8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
# File 'lib/ruby_codex.rb', line 8
def initialize(db,agg_db)
@nodes = {}
info = Proc.new do |node|
normal_node(node) do |n, norm|
norm.pretty_complexity.map { |k,v| v }.reduce(:+)
end
end
func_info = Proc.new do |node|
normal_node(node) do |n, norm|
norm.pretty_complexity[:send] || 0
end
end
type = Proc.new { |node| node.is_a?(AST::Node) ? node.type.to_s : node.class.to_s }
func_name = Proc.new do |node|
if type.call(node.children.first) == "const"
node.children.first.children[1].to_s + "." + node.children[1].to_s
else
node.children[1].to_s
end
end
key = {
:type => type,
}
data_core = {
:file => Proc.new { |node, f, p| f },
:project => Proc.new { |node, f, p| p },
:line => Proc.new { |node, f, p| node.loc ? node.loc.line : nil },
:orig_code => Proc.new { |node, f, p| Unparser.unparse(node) rescue nil },
}
combine = {
:files => Proc.new { |v| v.map { |x| x[:file] }.uniq },
:file_count => Proc.new { |v| v.map { |x| x[:file] }.uniq.count },
:projects => Proc.new { |v| v.map { |x| x[:project] }.uniq },
:project_count => Proc.new { |v| v.map { |x| x[:project] }.uniq.count },
:orig_code => Proc.new { |v| v.sample(10).map do |x|
{:code => x[:orig_code], :file => x[:file], :line => x[:line]}
end.uniq },
:count => Proc.new { |v| v.map { |x| x[:orig_code] }.count },
}
@nodes[:block] = DataNode.new(
db, agg_db,
Proc.new { |x| x.type == :block},
key.merge({
:func => Proc.new { |x| func_name.call(x.children.first) },
:body => Proc.new { |x| normalize_nodes(x.children.last) },
:arg_size => Proc.new { |x| x.children[1].children.size },
:info => Proc.new { |x| info.call(block_without_caller(x)) },
:func_info => Proc.new { |x| func_info.call(block_without_caller(x)) },
:ret_val => Proc.new do |x|
body = x.children.last
ret = type.call(body) == "begin" ? body.children.last : body
typ = type.call(ret)
typ == "send" ? func_name.call(ret) : typ
end,
:norm_code => Proc.new do |x|
normal_node(x) { |x| Unparser.unparse(block_without_caller(x)) rescue nil }
end
}),
data_core.merge({
:args => Proc.new { |x| x.children[1].children.map{ |y| y.children[0].to_s }}
}),
combine.merge({
:args_list => Proc.new { |v| v.map { |x| x[:args] } }
}),
Proc.new { |db,keys,vals|
query = db.where(:type => keys[:type], :func => keys[:func], :ret_val => keys[:ret_val]).first
query_count = query.nil? ? 0 : query.count
blocks = db.where(:type => keys[:type], :func => keys[:func]).sum(:count)
rets = db.where(:type => keys[:type], :ret_val => keys[:ret_val]).sum(:count)
{ :keys => keys,
:message =>
"We've seen #{keys[:func]} blocks returning the #{keys[:ret_val]} type #{query_count.to_s} " +
"times, and we've seen #{keys[:func]} blocks #{blocks.to_s} times and #{keys[:ret_val]} " +
"returned #{rets.to_s} times.",
:unlikely => Proc.new { |gt=1,bt=5,rt=5| query_count < gt && blocks > bt && rets > rt}
}
}
)
@nodes[:func] = DataNode.new(
db, agg_db,
Proc.new { |x| x.type == :send},
key.merge({
:func => Proc.new { |x| func_name.call(x) },
:sig => Proc.new { |x| x.children.drop(2).map { |y| type.call(y) } },
:norm_code => Proc.new do |x|
name = func_name.call(x)
sig = x.children.drop(2).map { |y| type.call(y) }.join(",")
"#{name}(#{sig})"
end
}),
data_core.merge({
:info => Proc.new { |x| info.call(without_caller(x)) },
:func_info => Proc.new { |x| func_info.call(without_caller(x)) }
}),
combine,
Proc.new do |db,keys,values|
primatives = ["str","int","float","array","hash"]
all_prim = keys[:sig].all? { |x| primatives.include?(x) }
query = db.where( :type => keys[:type], :func => keys[:func], :sig => keys[:sig]).first
query_count = query.nil? ? 0 : query.count
func = db.where(:type => keys[:type], :func => keys[:func], :sig => {:$ne => keys[:sig]}).sort(:count => -1).limit(1).first
alt_text =
if func
alt_count = func.count
"and the most common alternative #{func.func}:#{func.sig.join(",")} has appeared #{alt_count.to_s} times."
else
alt_count = 0
"and we've seen no known alternative."
end
{ :keys => keys,
:message =>
"Function call #{keys[:func]}:#{keys[:sig].join(",")} has appeared #{query_count.to_s} times, " +
alt_text,
:unlikely => Proc.new do |ac=5,t=1024|
all_prim && query_count == 0 && alt_count >= ac || alt_count >= t * (query_count + 1)
end
}
end
)
@nodes[:func_chain] = DataNode.new(
db, agg_db,
Proc.new { |x| x.type == :send && type.call(x.children.first) == "send" },
key.merge({
:type => Proc.new { "func_chain" },
:f1 => Proc.new { |x| func_name.call(x) },
:f2 => Proc.new { |x| func_name.call(x.children.first) },
:norm_code => Proc.new do |x|
f1 = func_name.call(x)
f2 = func_name.call(x.children.first)
"#{f1}.#{f2}"
end
}),
data_core,
combine,
Proc.new do |db,keys,data|
query = db.where(keys).first
query_count = query.nil? ? 0 : query.count
fs = [:f1,:f2].map { |f| db.where(:type => "send", :func => keys[f]).sum(:count) }
{ :keys => keys,
:message =>
"Function #{keys[:f1]} has appeared #{fs[0].to_s} times " +
"and #{keys[:f2]} has appeared #{fs[1].to_s} times, and " +
"they've appeared #{query_count} times together.",
:unlikely => Proc.new { |gt=1, t=10| query_count < gt && fs[0] > t && fs[1] > t }
}
end
)
@nodes[:cond] = DataNode.new(
db, agg_db,
Proc.new { |x| x.type == :if },
key.merge({
:norm_code => Proc.new { |x| normalize_nodes(x) },
:cond => Proc.new { |x| normal_node(x) { |n| Unparser.unparse(n.children.first) }},
:iftrue => Proc.new { |x| normal_node(x) { |n| Unparser.unparse(n.children[1]) }},
:iffalse => Proc.new { |x| normal_node(x) { |n| Unparser.unparse(n.children[2]) }},
:info => info,
:func_info => func_info
}),
data_core,
combine
)
@nodes[:ident] = DataNode.new(
db, agg_db,
Proc.new { |x| [:lvasgn, :ivasgn, :cvasgn, :gvasgn].include?(x.type) },
key.merge({
:type => Proc.new { "ident" },
:ident => Proc.new { |x| x.children.first.to_s },
:norm_code => Proc.new { |x| x.children.first.to_s + " ="}
}),
data_core.merge({
:ident_type => Proc.new { |x| type.call(x.children[1]) rescue nil }
}),
combine.merge({
:ident_types => Proc.new { |v| v.group_by { |y| y[:ident_type] }.map_hash { |x| x.size } }
}),
Proc.new { |db, keys, data|
primatives = ["str","int","float","array","hash"]
query = db.where(keys).first
if query && primatives.include?(data[:ident_type])
types = query.ident_types.select { |k,v| primatives.include? k }
types.default = 0
best = types.select { |k,v| k != data[:ident_type] }.sort_by{ |k,v| v*-1 }.first
best_str = best ? "#{best[1].to_s} times as #{best[0].to_s}" : "never as anything else."
{ :keys => keys,
:message =>
"The identifier #{keys[:ident]} has appeared #{types[data[:ident_type]].to_s} " +
"times as #{data[:ident_type].to_s} and #{best_str}",
:unlikely => Proc.new do |ac=5,t=8|
if best
(types[keys[:ident_type]] == 0 && best[1] >= ac) || (best[1] >= t * (types[keys[:ident_type]] + 1))
else
false
end
end
}
else
{ :message => "Never Seen", :unlikely => Proc.new { false } }
end
}
)
end
|