forked from rubinius/rubinius
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdependency_grapher.rb
439 lines (343 loc) · 9.02 KB
/
dependency_grapher.rb
1
2
3
4
5
6
7
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
# A simple processor to create a list of dependencies for a given source code
# file based on the #include files in the source file.
#
# The process involves three phases:
#
# 1. Parsing the source file for all C/C++ preprocessor control directives
# (#include, #ifdef, #ifndef, #else, #endif, #define, #undef, #if, #elif)
# 2. Executing the tree derived from step 1 in the context of a set of
# macro definitions.
# 3. Collecting the dependency list for each source file.
#
# In step 1, the tree resulting from parsing each included file is cached. If
# a later file of the same expanded relative path is included, the parse tree
# from the cache is returned.
#
# The system level macro definitions are retrieved using `cpp -dM`. This
# system set may be updated with new definitions or removed definitions while
# the parse tree is executed.
require 'set'
class DependencyGrapher
DEV_NULL = RUBY_PLATFORM =~ /mingw|mswin/ ? 'NUL' : '/dev/null'
class ExpressionEvaluator
def initialize(expression)
@expression = expression
end
# TODO: when melbourne is running in MRI, use it to parse
# the expression and then evaluate it.
def evaluate(defines)
@expression == "0" ? false : true
end
end
class Node
def initialize(parser)
@parser = parser
end
def close
message = "unbalanced \#endif for #{@parser.stack_top.class} at line #{@parser.line}"
raise ParseError, message
end
def add_else
"invalid \#else for #{@parser.stack_top.class} at line #{@parser.line}"
end
# TODO: remove
def execute(defines, node)
puts "#execute not implemented for #{self.class}"
end
end
module Container
attr_accessor :body
def initialize(parser)
super parser
@body = []
end
def close
@parser.stack_pop
end
def execute_body(defines, node)
body.each { |x| x.execute(defines, node) }
end
end
module Conditional
def initialize(parser)
super parser
@else = nil
end
def add_else(node)
@else = node
end
end
class SourceFile < Node
include Container
attr_reader :name, :object_name, :includes, :dependencies
def initialize(name, parser, objects_dir=nil)
super parser
@name = name
@object_name = name.sub(/((c(pp)?)|S)$/, 'o')
@objects_dir = objects_dir
@includes = []
end
def execute(defines)
execute_body defines, self
end
def collect_dependencies
set = Set.new
set << @name
@includes.each { |x| x.collect_dependencies(set) }
@dependencies = set.to_a.sort
end
def print_dependencies(out, max)
str = "#{@object_name}:"
str = "#{@objects_dir}/#{str}" if @objects_dir
out.print str
width = str.size
@dependencies.each do |name|
# Omit drive letter on Windows.
name = name[2..-1] if name[1] == ?:
size = name.size + 1
if width + size > max
width = 0
out.print " \\\n "
end
out.print " ", name
width += size
end
out.print "\n"
end
end
class IncludedFile < Node
include Container
attr_reader :name, :includes
def self.cache
@cache ||= {}
end
def initialize(name, parser)
super parser
@name = name
@includes = []
end
def expand_filename(node)
return if File.exist? @name
@parser.directories.each do |dir|
path = File.join dir, @name
return @name = path if File.file? path
end
raise Errno::ENOENT, "unable to find file to include: #{@name} from #{node.name}"
end
def execute(defines, node)
expand_filename(node)
if cached = self.class.cache[@name.to_sym]
@body = cached.body
else
parser = FileParser.new self, @parser.directories
parser.parse_file @name
self.class.cache[@name.to_sym] = self
end
execute_body defines, self
node.includes << self
end
def collect_dependencies(set)
return if set.include? @name
set << @name
@includes.each { |x| x.collect_dependencies(set) }
end
end
class IfDefined < Node
include Conditional, Container
def initialize(macro, parser)
super parser
@macro = macro.strip
end
def execute(defines, node)
if defines.key? @macro
execute_body defines, node
elsif @else
@else.execute(defines, node)
end
end
end
class IfNotDefined < Node
include Conditional, Container
def initialize(macro, parser)
super parser
@macro = macro.strip
end
def execute(defines, node)
if !defines.key? @macro
execute_body defines, node
elsif @else
@else.execute(defines, node)
end
end
end
class If < Node
include Conditional, Container
def initialize(expression, parser)
super parser
@value = nil
@expression = expression.strip
end
def execute(defines, node)
@value = ExpressionEvaluator.new(@expression).evaluate defines
if @value
execute_body(defines, node)
elsif @else
@else.execute(defines, node)
end
end
end
class Else < Node
include Container
def execute(defines, node)
execute_body defines, node
end
end
class ElseIf < If; end
class Define < Node
def initialize(macro, parser)
super parser
macro.strip!
if index = macro.index(" ")
@name = macro[0..index-1]
@value = macro[index+1..-1]
@name, @value = macro.strip.split
else
@name = macro
@value = "1"
end
end
def execute(defines, node)
defines[@name] = @value
end
end
class Undefine < Node
def initialize(macro, parser)
super parser
@macro = macro.strip
end
def execute(defines, node)
defines.delete @macro
end
end
class ParseError < Exception; end
# Parses a file for all preprocessor control directives into a tree of Node
# objects. The parser can operate on a file or an array of lines.
class FileParser
attr_reader :line, :directories
def initialize(root, directories)
@stack = [root]
@directories = directories
end
# Parser operations
def add_body(node)
@stack.last.body << node
end
def add_else(node)
@stack.last.add_else node
end
def stack_push(node)
@stack.push node
end
def stack_pop
@stack.pop
end
def stack_top
@stack.last
end
def close
@stack.last.close
end
# Events
def process_include(name)
# We do not process any <files>. This could be enabled as
# an option, but we don't need it or want it now.
name =~ /\s*"([^"]+)".*$/
return unless $1
node = IncludedFile.new $1, self
add_body node
end
def process_ifdef(macro)
node = IfDefined.new macro, self
add_body node
stack_push node
end
def process_ifndef(macro)
node = IfNotDefined.new macro, self
add_body node
stack_push node
end
def process_endif(rest)
close
end
def process_else(rest)
node = Else.new self
add_else node
end
def process_define(macro)
node = Define.new macro, self
add_body node
end
def process_undef(macro)
node = Undefine.new macro, self
add_body node
end
def process_if(expression)
node = If.new expression, self
add_body node
stack_push node
end
def process_elif(expression)
node = ElseIf.new expression, self
add_else node
add_body node
stack_push node
end
# Parse methods
def parse_file(name)
parse IO.readlines(name)
end
def parse(lines)
@line = 0
lines.each do |line|
@line += 1
m = line.match(/^\s*#(include|ifdef|ifndef|endif|else|define|undef|if|elif)(.*)$/)
# TODO: continue reading if line ends in \
send :"process_#{m[1]}", m[2] if m
end
end
end
attr_accessor :file_names, :directories, :defines, :system_defines, :objects_dir
attr_reader :sources
def initialize(cc, files, directories=[], defines=nil)
@cc = cc
@file_names = files
@directories = directories
@defines = defines
@objects_dir = nil
@system_defines = {}
@sources = []
end
def get_system_defines
lines = `#{@cc} -dM -E #{@defines} - < #{DEV_NULL}`.split("\n")
source = SourceFile.new "sytem_defines", self
parser = FileParser.new source, @directories
parser.parse lines
source.execute @system_defines
end
def process
get_system_defines
@file_names.each do |name|
source = SourceFile.new name, self, @objects_dir
parser = FileParser.new source, @directories
parser.parse_file name
source.execute @system_defines.dup
source.collect_dependencies
@sources << source
end
end
def print_dependencies(out, max=72)
@sources.each do |source|
source.print_dependencies out, max
end
end
end