Contents|Index|Previous|Next
Implicit rule search algorithm

The following is the procedure make uses for searching for an implicit rule for a target, t. This procedure is followed for each double-colon rule with no commands, for each target of ordinary rules none of which have commands, and for each dependency that is not the target of any rule. It is also followed recursively for dependencies that come from implicit rules, in the search for a chain of rules.

Suffix rules are not mentioned in this algorithm because suffix rules are converted to equivalent pattern rules once the makefiles have been read in. For an archive member target of the form, ‘archive(member)’, the following algorithm is run twice, first using the entire target name, t, and, second, using ‘(member)’ as the target, t, if the first run found no rule.
 


Top|Contents|Index|Previous|Next