/* * Copyright 1993, 1995 Christopher Seiwald. * * This file is part of Jam - see jam.c for Copyright information. */ /* * make.c - bring a target up to date, once rules are in place * * This modules controls the execution of rules to bring a target and * its dependencies up to date. It is invoked after the targets, rules, * et. al. described in rules.h are created by the interpreting of the * jam files. * * This file contains the main make() entry point and the first pass * make0(). The second pass, make1(), which actually does the command * execution, is in make1.c. * * External routines: * make() - make a target, given its name * * Internal routines: * make0() - bind and scan everything to make a TARGET * * 12/26/93 (seiwald) - allow NOTIME targets to be expanded via $(<), $(>) * 01/04/94 (seiwald) - print all targets, bounded, when tracing commands * 04/08/94 (seiwald) - progress report now reflects only targets with actions * 04/11/94 (seiwald) - Combined deps & headers into deps[2] in TARGET. * 12/20/94 (seiwald) - NOTIME renamed NOTFILE. * 12/20/94 (seiwald) - make0() headers after determining fate of target, so * that headers aren't seen as dependents on themselves. * 01/19/95 (seiwald) - distinguish between CANTFIND/CANTMAKE targets. * 02/02/95 (seiwald) - propagate leaf source time for new LEAVES rule. * 02/14/95 (seiwald) - NOUPDATE rule means don't update existing target. * 08/22/95 (seiwald) - NOUPDATE targets immune to anyhow (-a) flag. */ # include "jam.h" # include "lists.h" # include "parse.h" # include "variable.h" # include "rules.h" # include "search.h" # include "newstr.h" # include "make.h" # include "headers.h" # include "command.h" static void make0(); #ifdef OPT_GRAPH_DEBUG_EXT static void dependGraphOutput(); #endif # ifndef max # define max( a,b ) ((a)>(b)?(a):(b)) # endif typedef struct { int temp; int updating; int cantfind; int cantmake; int targets; int made; } COUNTS ; static char *target_fate[] = { "init", /* T_FATE_INIT */ "making", /* T_FATE_MAKING */ "stable", /* T_FATE_STABLE */ "newer", /* T_FATE_NEWER */ "temp", /* T_FATE_ISTMP */ "touched", /* T_FATE_TOUCHED */ "missing", /* T_FATE_MISSING */ "old", /* T_FATE_OUTDATED */ "update", /* T_FATE_UPDATE */ "nofind", /* T_FATE_CANTFIND */ "nomake" /* T_FATE_CANTMAKE */ } ; static char *target_bind[] = { "unbound", "missing", "parents", "exists", } ; # define spaces(x) ( " " + 16 - ( x > 16 ? 16 : x ) ) /* * make() - make a target, given its name */ int make( n_targets, targets, anyhow ) int n_targets; char **targets; int anyhow; { int i; COUNTS counts[1]; int status = 0; /* 1 if anything fails */ #ifdef OPT_TIME_STAMP_OUTPUT_EXT { time_t clock; time( &clock ); if( DEBUG_MAKE ) printf( "...binding...%s", ctime ( &clock ) ); } #endif #ifdef OPT_HEADER_CACHE_EXT hcache_init(); #endif memset( (char *)counts, 0, sizeof( *counts ) ); for( i = 0; i < n_targets; i++ ) { TARGET *t = bindtarget( targets[i] ); make0( t, T_BIND_UNBOUND, (time_t)0, 0, counts, anyhow ); } #ifdef OPT_GRAPH_DEBUG_EXT if( DEBUG_GRAPH ) { for( i = 0; i < n_targets; i++ ) { TARGET *t = bindtarget( targets[i] ); dependGraphOutput( t, 0 ); } } #endif if( DEBUG_MAKE ) { if( counts->targets ) printf( "...found %d target(s)...\n", counts->targets ); if( counts->temp ) printf( "...using %d temp target(s)...\n", counts->temp ); if( counts->updating ) printf( "...updating %d target(s)...\n", counts->updating ); if( counts->cantfind ) printf( "...can't find %d target(s)...\n", counts->cantfind ); if( counts->cantmake ) printf( "...can't make %d target(s)...\n", counts->cantmake ); } #ifdef OPT_HEADER_CACHE_EXT hcache_done(); #endif #ifdef OPT_TIME_STAMP_OUTPUT_EXT { time_t clock; time( &clock ); if( DEBUG_MAKE && counts->updating ) printf( "...building...%s", ctime ( &clock ) ); } #endif status = counts->cantfind || counts->cantmake; for( i = 0; i < n_targets; i++ ) status |= make1( bindtarget( targets[i] ) ); return status; } /* * make0() - bind and scan everything to make a TARGET * * Make0() recursively binds a target, searches for #included headers, * calls itself on those headers, and calls itself on any dependents. */ static void make0( t, pbinding, ptime, depth, counts, anyhow ) TARGET *t; int pbinding; /* parent target's binding */ time_t ptime; /* parent target's timestamp */ int depth; /* for display purposes */ COUNTS *counts; /* for reporting */ int anyhow; /* forcibly touch all (real) targets */ { TARGETS *c; int fate, hfate; time_t last, leaf, hlast, hleaf; char *flag = ""; if( DEBUG_MAKEPROG ) printf( "make\t--\t%s%s\n", spaces( depth ), t->name ); /* * Step 1: don't remake if already trying or tried */ switch( t->fate ) { case T_FATE_MAKING: printf( "warning: %s depends on itself\n", t->name ); return; default: return; case T_FATE_INIT: break; } t->fate = T_FATE_MAKING; /* * Step 2: under the influence of "on target" variables, * bind the target and search for headers. */ /* Step 2a: set "on target" variables. */ pushsettings( t->settings ); /* Step 2b: find and timestamp the target file (if it's a file). */ if( t->binding == T_BIND_UNBOUND && !( t->flags & T_FLAG_NOTFILE ) ) { t->boundname = search( t->name, &t->time ); t->binding = t->time ? T_BIND_EXISTS : T_BIND_MISSING; } /* If temp file doesn't exist, use parent */ if( t->binding == T_BIND_MISSING && t->flags & T_FLAG_TEMP && ptime ) { t->time = ptime; t->binding = t->time ? T_BIND_PARENTS : T_BIND_MISSING; } /* Step 2c: If its a file, search for headers. */ if( t->binding == T_BIND_EXISTS ) headers( t ); /* Step 2d: reset "on target" variables */ popsettings( t->settings ); /* * Pause for a little progress reporting */ if( DEBUG_BIND ) { if( strcmp( t->name, t->boundname ) ) { printf( "bind\t--\t%s%s: %s\n", spaces( depth ), t->name, t->boundname ); } switch( t->binding ) { case T_BIND_UNBOUND: case T_BIND_MISSING: case T_BIND_PARENTS: printf( "time\t--\t%s%s: %s\n", spaces( depth ), t->name, target_bind[ t->binding ] ); break; case T_BIND_EXISTS: printf( "time\t--\t%s%s: %s", spaces( depth ), t->name, ctime( &t->time ) ); break; } } /* * Step 3: recursively make0() dependents */ last = 0; leaf = 0; fate = T_FATE_STABLE; for( c = t->deps[ T_DEPS_DEPENDS ]; c; c = c->next ) { make0( c->target, t->binding, t->time, depth + 1, counts, anyhow ); leaf = max( leaf, c->target->leaf ); leaf = max( leaf, c->target->hleaf ); /* If LEAVES has been applied, we only heed the timestamps of */ /* the leaf source nodes. */ if( t->flags & T_FLAG_LEAVES ) { last = leaf; continue; } last = max( last, c->target->time ); last = max( last, c->target->htime ); fate = max( fate, c->target->fate ); fate = max( fate, c->target->hfate ); } /* If a NOUPDATE file exists, make dependents eternally old. */ if( t->flags & T_FLAG_NOUPDATE ) { last = 0; t->time = 0; } /* Step 3b: determine fate: rebuild target or what? */ /* In English: If can't find or make child, can't make target. If children changed, make target. If target missing, make it. If children newer, make target. If temp's children newer, make temp. If deliberately touched, make it. If up-to-date temp file present, use it. If target exists but parent not, mark target newer. If target newer than parent, mark target newer. Don't propagate child's "newer" status. */ if( fate >= T_FATE_BROKEN ) { fate = T_FATE_CANTMAKE; } else if( fate >= T_FATE_SPOIL ) { fate = T_FATE_UPDATE; } else if( t->binding == T_BIND_MISSING ) { fate = T_FATE_MISSING; } else if( t->binding == T_BIND_EXISTS && last > t->time ) { fate = T_FATE_OUTDATED; } else if( t->binding == T_BIND_PARENTS && last > t->time ) { fate = T_FATE_OUTDATED; } else if( t->flags & T_FLAG_TOUCHED ) { fate = T_FATE_TOUCHED; } else if( anyhow && !( t->flags & T_FLAG_NOUPDATE ) ) { fate = T_FATE_TOUCHED; } else if( t->binding == T_BIND_EXISTS && t->flags & T_FLAG_TEMP ) { fate = T_FATE_ISTMP; } else if( t->binding == T_BIND_EXISTS && pbinding == T_BIND_MISSING ) { fate = T_FATE_NEWER; } else if( t->binding == T_BIND_EXISTS && ptime && t->time > ptime ) { fate = T_FATE_NEWER; } else if( fate == T_FATE_NEWER ) { fate = T_FATE_STABLE; } /* Step 3c: handle missing files */ /* If it's missing and there are no actions to create it, boom. */ /* If we can't make a target we don't care about, 'sokay */ /* We could insist that there are updating actions for all missing */ /* files, but if they have dependents we just pretend it's NOTFILE. */ if( fate == T_FATE_MISSING && !t->actions && !t->deps[ T_DEPS_DEPENDS ] ) { if( t->flags & T_FLAG_NOCARE ) { fate = T_FATE_STABLE; } else { printf( "don't know how to make %s\n", t->name ); fate = T_FATE_CANTFIND; } } /* Step 3d: propagate dependents' time & fate. */ /* Set leaf time to be our time only if this is a leaf. */ t->time = max( t->time, last ); t->leaf = leaf ? leaf : t->time ; t->fate = fate; /* * Step 4: Recursively make0() headers. */ /* Step 4a: recursively make0() headers */ hlast = 0; hleaf = 0; hfate = T_FATE_STABLE; for( c = t->deps[ T_DEPS_INCLUDES ]; c; c = c->next ) { make0( c->target, pbinding, ptime, depth + 1, counts, anyhow ); hlast = max( hlast, c->target->time ); hlast = max( hlast, c->target->htime ); hleaf = max( hleaf, c->target->leaf ); hleaf = max( hleaf, c->target->hleaf ); hfate = max( hfate, c->target->fate ); hfate = max( hfate, c->target->hfate ); } /* Step 4b: propagate dependents' time & fate. */ t->htime = hlast; t->hleaf = hleaf ? hleaf : t->htime; t->hfate = hfate; /* * Step 5: a little harmless tabulating for tracing purposes */ #ifdef OPT_LARGE_BUILD_EXT /* When there are a lot of nodes, ...patience... wears thin :-) */ ++counts->targets; #else if( !( ++counts->targets % 1000 ) && DEBUG_MAKE ) printf( "...patience...\n" ); #endif if( fate == T_FATE_ISTMP ) counts->temp++; else if( fate == T_FATE_CANTFIND ) counts->cantfind++; else if( fate == T_FATE_CANTMAKE && t->actions ) counts->cantmake++; else if( fate >= T_FATE_BUILD && fate < T_FATE_BROKEN && t->actions ) counts->updating++; if( !( t->flags & T_FLAG_NOTFILE ) && fate >= T_FATE_SPOIL ) flag = "+"; else if( t->binding == T_BIND_EXISTS && ptime && t->time > ptime ) flag = "*"; if( DEBUG_MAKEPROG ) printf( "made%s\t%s\t%s%s\n", flag, target_fate[ t->fate ], spaces( depth ), t->name ); } #ifdef OPT_GRAPH_DEBUG_EXT /* * dependGraphOutput() - output the DG after make0 has run */ static void dependGraphOutput( t, depth ) TARGET *t; int depth; /* for display purposes */ { TARGETS *c; if ( (t->flags & T_FLAG_VISITED) != 0 || !t->name || !t->boundname) return; t->flags |= T_FLAG_VISITED; switch (t->fate) { case T_FATE_TOUCHED: case T_FATE_MISSING: case T_FATE_OUTDATED: case T_FATE_UPDATE: printf( "->%s%2d Name: %s\n", spaces(depth), depth, t->name ); break; default: printf( " %s%2d Name: %s\n", spaces(depth), depth, t->name ); break; } if( strcmp (t->name, t->boundname) ) { printf( " %s Loc: %s\n", spaces(depth), t->boundname ); } switch (t->fate) { case T_FATE_STABLE: printf( " %s : Stable\n", spaces(depth) ); break; case T_FATE_NEWER: printf( " %s : Newer\n", spaces(depth) ); break; case T_FATE_ISTMP: printf( " %s : Up to date temp file\n", spaces(depth) ); break; case T_FATE_TOUCHED: printf( " %s : Been touched, updating it\n", spaces(depth) ); break; case T_FATE_MISSING: printf( " %s : Missing, creating it\n", spaces(depth) ); break; case T_FATE_OUTDATED: printf( " %s : Outdated, updating it\n", spaces(depth) ); break; case T_FATE_UPDATE: printf( " %s : Updating it\n", spaces(depth) ); break; case T_FATE_CANTFIND: printf( " %s : Can't find it\n", spaces(depth) ); break; case T_FATE_CANTMAKE: printf( " %s : Can't make it\n", spaces(depth) ); break; } for( c = t->deps[ T_DEPS_DEPENDS ]; c; c = c->next ) { printf( " %s : Depends on %s (%s)\n", spaces(depth), c->target->name, target_fate[ c->target->fate ] ); } for( c = t->deps[ T_DEPS_INCLUDES ]; c; c = c->next ) { printf( " %s : Includes %s (%s)\n", spaces(depth), c->target->name, target_fate[ c->target->fate ] ); } for( c = t->deps[ T_DEPS_DEPENDS ]; c; c = c->next ) { dependGraphOutput( c->target, depth + 1 ); } for( c = t->deps[ T_DEPS_INCLUDES ]; c; c = c->next ) { dependGraphOutput( c->target, depth + 1 ); } } #endif
# | Change | User | Description | Committed | |
---|---|---|---|---|---|
#14 | 4111 | Craig Mcpheeters | Integration from my jam branch | ||
#13 | 4110 | Craig Mcpheeters | Some of my changes from work. | ||
#12 | 3183 | Craig Mcpheeters | Integration of my jam mainline branch into my work branch. | ||
#11 | 3182 | Craig Mcpheeters | Update of my work branch. | ||
#10 | 1664 | Craig Mcpheeters | A new extension - semaphores | ||
#9 | 1606 | Craig Mcpheeters |
Integration from my modified jam mainline. This is all the mainline changes into my work branch. |
||
#8 | 1605 | Craig Mcpheeters |
Updated with respect to my copy at work. A few minor updates/enhancements |
||
#7 | 1484 | Craig Mcpheeters |
Integration from my mainline into my branch. Incorporation of the W32_GetReg stuff from Matt to set MSVCNT. Cool |
||
#6 | 1188 | Craig Mcpheeters |
The latest updates from my A|W work copy. Added a -d11 debug mode, which outputs information on fate changes Create jam variables to show job (-jn) information, such as the number of jobs requested, whether or not there is more than one job, and a list of the job slot numbers. These can be used in a variety of ways in supporting multi-job builds Added jobs slot expansion to the action blocks, the sequence !! is replaced by the job slot the action is running in. Modified the special shell handling to include unix. It used to be that on Unix, you could create an action block which exceeded the size that execvp() could handle (perhaps only when the DynamicCommandSize option is enabled.) On NT, all non-default shells are invoked through a intermediate file. This modification does the same for unix shells. Improved the -d+10 debug level, the dependency graph. It now shows the flags on the node as well (NOUPDATE, NOTFILE, etc.) Only issue the '...skipped' messages for nodes which would have been built |
||
#5 | 1100 | Craig Mcpheeters |
Added a percent-done extension Converted the hcache file to ansi, as the rest of Jam was updated in 2.3 |
||
#4 | 1071 | Craig Mcpheeters | A few tweaks from my jam branch. | ||
#3 | 785 | Craig Mcpheeters |
Integration from //guest/craig_mcpheeters/jam/src/... This work area now contains both the Alias|Wavefront changes, and the latest integrations from the mainline. There are some changes in this area which shouldn't be merged back into the mainline. As I merge this branch back into my jam/src/... branch, I'll leave out a few of the changes. |
||
#2 | 782 | Craig Mcpheeters |
Initial return of the Alias|Wavefront mods to jam 2.2. I made a stab at a configuration system - see the file Jamfile.config. Most of the mods are now enclosed within #ifdef blocks, which kind of pollutes the code, but may make it easier to accept or reject some of these changes. Some of these #ifdefs could disappear completely if they are accepted into the mainline This return implements the following extensions: * header cache * dynamic command block size, allowing for *large* commands * slightly improved warnings and errors * serial output from jam - nice when working with multiple jobs * an extension to variable modifiers: $(>:/) and $(>:\\) * ability to ignore header dependencies for a build (jam -p) * new debug level, -d+10, which outputs the dependency graph * added no-care support to internal nodes. if they fail, dependents are built anyway * time stamps on output * a few minor output modifications * a fix for nt batch file names conflicing when more than one jam runs at a time Each of the above can be enabled/disabled on the command line. For example, to turn on the HeaderCache code: jam -sHeaderCache=1 that is, build jam first, then use that jam to build a new one with the options you want. Some of these changes may have been made in the mainline already, my next step will be to integrate the mainline changes into these ones This return isn't yet ready for prime-time |
||
#1 | 777 | Craig Mcpheeters |
Branch of my jam/src/... area. This new area establishes the integration base for the copy of Jam which has all the changes. |
||
//guest/craig_mcpheeters/jam/src/make.c | |||||
#2 | 617 | Craig Mcpheeters | Integration from mainline as of @3 | ||
#1 | 616 | Craig Mcpheeters | Integration from Jam mainline, as of @2 |