Lines Matching defs:bottom
106 * bottom-most node added to the graph or NULL
1826 Candidate *bottom; /* Start of found transformation path */
1856 bottom = NULL;
1871 bottom = FindThem(&srcs, cs);
1873 if (bottom == NULL) {
1887 for (targ = bottom;
1934 while (bottom != NULL && bottom->parent != NULL) {
1935 CandidateSearcher_AddIfNew(cs, bottom);
1936 bottom = bottom->parent;
1938 bottom = src;
1942 if (bottom == NULL) {
1948 * We now have a list of candidates headed by 'bottom' and linked via
1959 if (bottom->node == NULL)
1960 bottom->node = Targ_GetNode(bottom->file);
1962 for (src = bottom; src->parent != NULL; src = src->parent) {
1976 * nodes between bottom and gn (no point in questing
1996 if (bottom != NULL)
1997 CandidateSearcher_AddIfNew(cs, bottom);