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
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
|
#!/usr/bin/perl
use strict;
use warnings;
use Getopt::Long qw(GetOptions VersionMessage);
use Pod::Usage;
my $gnumake;
my $src_root;
my $makefile_build;
my $verbose = 0;
my $no_leaf;
my $from_file;
my $to_file;
my $output_file;
my $preserve_libs = 0;
my $toposort = 0;
sub logit($)
{
print STDERR shift if ($verbose);
}
sub read_deps()
{
my $p;
my $to;
my $invalid_tolerance = 100;
my $line_count = 0;
my %deps;
if (defined $to_file)
{
open($to, ">$to_file") or die "can not open file for writing $to_file";
}
if (defined $from_file) {
open ($p, $from_file) || die "can't read deps from cache file: $!";
} else {
open ($p, "ENABLE_PRINT_DEPS=1 $gnumake -qrf $makefile_build|") || die "can't launch make: $!";
}
$|=1;
print STDERR "reading deps ";
while (<$p>) {
my $line = $_;
$line_count++;
print STDERR '.' if ($line_count % 10 == 0);
logit($line);
print $to $line if defined $to_file;
chomp ($line);
if ($line =~ m/^LibraryDep:\s+(\S+) links against (.*)$/) {
# if ($line =~ m/^LibraryDep:\s+(\S+)\s+links against/) {
$deps{$1} = ' ' if (!defined $deps{$1});
$deps{$1} = $deps{$1} . ' ' . $2;
} elsif ($line =~ m/^LibraryDep:\s+links against/) {
# these need fixing, we call gb_LinkTarget__use_$...
# and get less than normal data back to gb_LinkTarget_use_libraries
# print STDERR "ignoring unhelpful external dep\n";
} elsif ($invalid_tolerance < 0) {
# print "read all dependencies to: '$line'\n";
last;
} else {
# print "no match '$line'\n";
$invalid_tolerance--;
}
}
close ($p);
print STDERR " done\n";
return \%deps;
}
# graphviz etc. don't like some names
sub clean_name($)
{
my $name = shift;
$name =~ s/[\-\/\.]/_/g;
return $name;
}
# first create nodes for each entry
sub clean_tree($)
{
my $deps = shift;
my %tree;
for my $name (sort keys %{$deps}) {
my $need_str = $deps->{$name};
$need_str =~ s/^\s+//g;
$need_str =~ s/\s+$//g;
my @needs = split /\s+/, $need_str;
$name =~ m/^([^_]+)_(\S+)$/ || die "invalid target name: '$name'";
my $type = $1;
my $target = clean_name ($2);
$type eq 'Executable' || $type eq 'Library' ||
$type eq 'CppunitTest' || die "Unknown type '$type'";
my %result;
$result{type} = $type;
$result{target} = $target;
$result{generation} = 0;
my @clean_needs;
for my $need (@needs) {
push @clean_needs, clean_name($need);
}
$result{deps} = \@clean_needs;
if (defined $tree{$target}) {
logit("warning -duplicate target: '$target'\n");
delete($tree{$target});
}
$tree{$target} = \%result;
logit("$target ($type): " . join (',', @clean_needs) . "\n");
}
return \%tree;
}
sub has_child_dep($$$)
{
my ($tree,$search,$name) = @_;
my $node = $tree->{$name};
return defined $node->{flat_deps}->{$search};
}
# flatten deps recursively into a single hash per module
sub build_flat_dep_hash($$);
sub build_flat_dep_hash($$)
{
my ($tree, $name) = @_;
my %flat_deps;
my $node = $tree->{$name};
return if (defined $node->{flat_deps});
# build flat deps for children
for my $child (@{$node->{deps}}) {
build_flat_dep_hash($tree, $child)
}
for my $child (@{$node->{deps}}) {
$flat_deps{$child} = 1;
for my $dep (@{$tree->{$child}->{deps}}) {
$flat_deps{$dep} = 1;
}
}
$node->{flat_deps} = \%flat_deps;
# useful debugging ...
if (defined $ENV{DEP_CACHE_FILE}) {
logit("node '$name' has flat-deps: '" . join(',', keys %flat_deps) . "' " .
"vs. '" . join(',', @{$node->{deps}}) . "'\n");
}
}
# many modules depend on vcl + sal, but vcl depends on sal
# so we want to strip sal out - and the same for many
# similar instances
sub prune_redundant_deps($)
{
my $tree = shift;
for my $name (sort keys %{$tree}) {
build_flat_dep_hash($tree, $name);
}
}
# glob on libo directory
sub create_lib_module_map()
{
my %l2m;
# hardcode the libs that don't have a directory
$l2m{'merged'} = 'merged';
$l2m{'urelibs'} = 'urelibs';
for (glob($src_root."/*/Library_*.mk"))
{
/.*\/(.*)\/Library_(.*)\.mk/;
# add module -> module
$l2m{$1} = $1;
# add lib -> module
$l2m{$2} = $1;
}
return \%l2m;
}
# call prune redundant_deps
# rewrite the deps array
sub optimize_tree($)
{
my $tree = shift;
prune_redundant_deps($tree);
for my $name (sort keys %{$tree}) {
my $result = $tree->{$name};
logit("minimising deps for $result->{target}\n");
my @newdeps;
for my $dep (@{$result->{deps}}) {
# is this implied by any other child ?
logit("checking if '$dep' is redundant\n");
my $preserve = 1;
for my $other_dep (@{$result->{deps}}) {
next if ($other_dep eq $dep);
if (has_child_dep($tree,$dep,$other_dep)) {
logit("$dep is implied by $other_dep - ignoring\n");
$preserve = 0;
last;
}
}
push @newdeps, $dep if ($preserve);
}
# re-write the shrunk set to accelerate things
$result->{deps} = \@newdeps;
}
return $tree;
}
# walking through the library based graph and creating a module based graph.
sub collapse_lib_to_module($)
{
my $tree = shift;
my %digraph;
my $l2m = create_lib_module_map();
my %unknown_libs;
for my $name (sort keys %{$tree}) {
my $result = $tree->{$name};
$unknown_libs{$name} = 1 && next if (!grep {/$name/} keys $l2m);
$name = $l2m->{$name};
# sal has no dependencies, take care of it
# otherwise it doesn't have target key
if (!@{$result->{deps}}) {
if (!exists($digraph{$name})) {
my @empty;
$digraph{$name}{deps} = \@empty;
$digraph{$name}{target} = $result->{target};
}
}
for my $dep (@{$result->{deps}}) {
$dep = $l2m->{$dep};
# ignore: two libraries from the same module depend on each other
next if ($name eq $dep);
if (exists($digraph{$name}))
{
my @deps = @{$digraph{$name}{deps}};
# only add if we haven't seen already that edge?
if (!grep {/$dep/} @deps)
{
push @deps, $dep;
$digraph{$name}{deps} = \@deps;
}
}
else
{
my @deps;
push @deps, $dep;
$digraph{$name}{deps} = \@deps;
$digraph{$name}{target} = $result->{target};
}
}
}
logit("warn: no module for libs were found and dropped: [" .
join(",", (sort (keys(%unknown_libs)))) . "]\n");
return optimize_tree(\%digraph);
}
sub prune_leaves($)
{
my $tree = shift;
my %newtree;
my %name_has_deps;
# we like a few leaves around:
for my $nonleaf ('desktop', 'sw', 'sc', 'sd', 'starmath') {
$name_has_deps{$nonleaf} = 1;
}
# find which modules are depended on by others
for my $name (keys %{$tree}) {
for my $dep (@{$tree->{$name}->{deps}}) {
$name_has_deps{$dep} = 1;
}
}
# prune modules with no deps
for my $name (keys %{$tree}) {
delete $tree->{$name} if (!defined $name_has_deps{$name});
}
return optimize_tree($tree);
}
sub dump_graphviz($)
{
my $tree = shift;
my $to = \*STDOUT;
open($to, ">$output_file") if defined($output_file);
print $to <<END;
digraph LibreOffice {
node [shape="Mrecord", color="#BBBBBB"]
node [fontname=Verdana, color="#BBBBBB", fontsize=10, height=0.02, width=0.02]
edge [color="#31CEF0", len=0.4]
edge [fontname=Arial, fontsize=10, fontcolor="#31CEF0"]
END
for my $name (sort keys %{$tree}) {
my $result = $tree->{$name};
logit("minimising deps for $result->{target}\n");
for my $dep (@{$result->{deps}}) {
print $to "$name -> $dep;\n" ;
}
}
print $to "}\n";
}
sub toposort_visit($$$$);
sub toposort_visit($$$$)
{
my $tree = shift;
my $list = shift;
my $tags = shift;
my $name = shift;
die "dependencies don't form a DAG"
if (defined($tags->{$name}) && $tags->{$name} == 1);
if (!$tags->{$name}) {
$tags->{$name} = 1;
my $result = $tree->{$name};
for my $dep (@{$result->{deps}}) {
toposort_visit($tree, $list, $tags, $dep);
}
$tags->{$name} = 2;
push @{$list}, $name;
}
}
sub dump_toposort($)
{
my $tree = shift;
my @list;
my %tags;
for my $name (sort keys %{$tree}) {
toposort_visit($tree, \@list, \%tags, $name);
}
my $to = \*STDOUT;
open($to, ">$output_file") if defined($output_file);
for (my $i = 0; $i <= $#list; ++$i) {
print $to "$list[$i]\n";
}
}
sub filter_targets($)
{
my $tree = shift;
for my $name (sort keys %{$tree})
{
my $result = $tree->{$name};
if ($result->{type} eq 'CppunitTest' ||
($result->{type} eq 'Executable' &&
$result->{target} ne 'soffice_bin'))
{
delete($tree->{$name});
}
}
}
sub parse_options()
{
my %h = (
'verbose|v' => \$verbose,
'help|h' => \my $help,
'man|m' => \my $man,
'version|r' => sub {
VersionMessage(-msg => "You are using: 1.0 of ");
},
'preserve-libs|p' => \$preserve_libs,
'toposort|t' => \$toposort,
'write-dep-file|w=s' => \$to_file,
'read-dep-file|f=s' => \$from_file,
'no-leaf|l' => \$no_leaf,
'output-file|o=s' => \$output_file);
GetOptions(%h) or pod2usage(2);
pod2usage(1) if $help;
pod2usage(-exitstatus => 0, -verbose => 2) if $man;
($gnumake, $makefile_build) = @ARGV if $#ARGV == 1;
$gnumake = 'make' if (!defined $gnumake);
$makefile_build = 'Makefile.gbuild' if (!defined $makefile_build);
$src_root = defined $ENV{SRC_ROOT} ? $ENV{SRC_ROOT} : ".";
}
sub main()
{
parse_options();
my $deps = read_deps();
my $tree = clean_tree($deps);
filter_targets($tree);
optimize_tree($tree);
if (!$preserve_libs && !defined($ENV{PRESERVE_LIBS})) {
$tree = collapse_lib_to_module($tree);
}
if ($no_leaf) {
$tree = prune_leaves($tree);
}
if ($toposort) {
dump_toposort($tree);
} else {
dump_graphviz($tree);
}
}
main()
__END__
=head1 NAME
module-deps - Generate module dependencies for LibreOffice build system
=head1 SYNOPSIS
module_deps [options] [gnumake] [makefile]
=head1 OPTIONS
=over 8
=item B<--help>
=item B<-h>
Print a brief help message and exits.
=item B<--man>
=item B<-m>
Prints the manual page and exits.
=item B<--version>
=item B<-v>
Prints the version and exits.
=item B<--preserve-libs>
=item B<-p>
Don't collapse libs to modules
=item B<--toposort>
=item B<-t>
Output a topological sorting instead of a graph
=item B<--read-dep-file file>
=item B<-f>
Read dependency from file.
=item B<--write-dep-file file>
=item B<-w>
Write dependency to file.
=item B<--output-file file>
=item B<-o>
Write graph or sort output to file
=back
=head1 DESCRIPTION
B<This program> parses the output of LibreOffice make process
(or cached input file) and generates the digraph build dependency,
that must be piped to B<graphviz> program (typically B<dot>).
B<Hacking on it>:
The typical (optimized) B<workflow> includes 3 steps:
=over 3
=item 1
Create cache dependency file: module_deps --write-dep-file lo.dep
=item 2
Use cache dependency file: module_deps --read-dep-file lo.dep -o lo.graphviz
=item 3
Pipe the output to graphviz: cat lo.graphviz | dot -Tpng -o lo.png
=back
=head1 TODO
=over 2
=item 1
Add soft (include only) dependency
=item 2
Add dependency on external modules
=back
=head1 AUTHOR
=over 2
=item Michael Meeks
=item David Ostrovsky
=back
=cut
|