-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Divakar Venkata (divvenka) wrote: > We use non-recursive make system with over 1000+ fragmented > makefiles all over source code. We have seen make spending > lot of time in reading these files and calculating dependency graph > before starting build. > > Here, is there a way to instruct gmake to read these fragmented > makefiles paralally and create dependency graph..?
It's almost certainly nothing to do with the loading time on the Makefiles (unless you are doing something crazy with massive strings), but more likely the time to stat() files in graph to figure out what work to do. You can actually test this theory by making the last line of the Makefile output the current time using a $(warning). If you make the first line do the same then you'll be able to measure the 'loading' time for the Makefiles. The time between the second $(warning) and the first job running will tell you how long all the stat() calls are taking. What file system is this sitting on? John. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFGenazLphrp73n/hARAgPfAKCZmVjaVzZ7LHlnFuNdM7G4o5TIWQCg1dgl vbrEFtboVzi1u6IskVHKlvw= =Bd+K -----END PGP SIGNATURE----- _______________________________________________ Help-make mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-make
