Cross Reference: /ast/src/cmd/nmake/expand.c

Lines Matching refs:mark
393  * mark r and recursively all prerequisites with m
401 mark(Sfio_t* xp, Rule_t* r, int m, int c)
407 		if (r->mark & c)
412 		if (!(r->mark & m))
414 			r->mark |= m|c;
416 				if (mark(xp, p->rule, m, c))
422 				r->mark &= ~c;
427 	else if (r->mark & m)
429 		r->mark &= ~(m|c);
431 			mark(xp, p->rule, m, c);
452 		mark(xp, makerule(s), M_mark, cycle);
456 		mark(NiL, makerule(s), M_mark, cycle);
594 		x->rule->mark |= M_mark|M_metarule;
601 			r->mark &= ~M_mark;
604 				if (!(r->mark & M_metarule) && r->name[0] == '.' && r->name[1] == '.' && (!r->name[2] || r->name[2] == '/'))
606 					r->mark |= M_metarule;
609 					internal.dot->mark &= ~M_mark;
613 					r->mark &= ~M_mark;
614 					if (!(r->mark & M_metarule) && r->name[0] == '.' && r->name[1] == '.' && (!r->name[2] || r->name[2] == '/'))
616 						r->mark |= M_metarule;
618 						internal.dot->mark &= ~M_mark;
626 		if (!(p->rule->mark & M_mark))
631 			p->rule->mark |= M_mark;
636 		p->rule->mark &= ~(M_mark|M_metarule);
810 		if (!(r->mark & M_mark))
812 			r->mark |= M_mark;
824 		r->mark &= ~M_mark;
1138 order_descend(Sfio_t* xp, Hash_table_t* tab, Rule_t* r, unsigned long mark, unsigned int flags)
1147 	r->mark &= ~M_MUST;
1148 	r->complink = mark;
1162 					r->mark |= M_LHS;
1166 				a->mark |= M_RHS;
1178 			if (a->mark & M_MUST)
1179 				mark = order_descend(xp, tab, a, mark, flags);
1188 		if (!(flags & ORDER_all) || (r->mark & M_RHS))
1189 			return mark;
1190 		r->mark |= M_LHS;
1194 		if (!(flags & ORDER_all) || (r->mark & M_RHS))
1195 			return mark;
1196 		if (sfstrtell(xp) != here || mark == need)
1200 			mark++;
1203 		r->complink = mark;
1205 	return mark;
1218 	d->mark |= M_RHS;
1242 		d->mark |= M_MUST|M_SKIP;
1250 			d->mark |= M_MUST;
1252 			d->mark |= M_INIT|M_SKIP;
1258 			d->mark |= M_MUST|M_RHS|M_SKIP;
1264 	if (makefiles && (d->mark & M_MUST) && (sp = rsfopen(r->name)))
1405 	unsigned long	mark;
1421 	mark = sfstrtell(vec);
1424 	qsort(v, mark / sizeof(v) / 2, sizeof(v) * 2, order_cmp);
1428 		if ((d->mark & M_MUST) && (sp = rsfopen(bind(r)->name)))
1550 					if (k && ((r = (Rule_t*)hashget(tab, t)) && (r->mark & M_MUST) && r != d || *t++ == 'l' && *t++ == 'i' && *t++ == 'b' && *t && (r = (Rule_t*)hashget(tab, t)) && (r->mark & M_MUST) && r != d))
1611 	mark = 0;
1616 			if ((r = (Rule_t*)hashget(tab, s)) && (r->mark & M_MUST))
1617 				mark = order_descend(xp, tab, r, mark, flags|ORDER_all);
1629 				if ((r = (Rule_t*)hashget(tab, unbound(q->rule))) && (r->mark & M_MUST))
1631 					mark = order_descend(xp, tab, r, mark, flags);
1640 		if (r->mark & M_MUST)
1641 			mark = order_descend(xp, tab, r, mark, flags);
1651 			if (r->mark & M_INIT)
1660 		if ((flags & ORDER_prereqs) && (r->mark & (M_INIT|M_LHS|M_MUST|M_RHS|M_SKIP)) == M_LHS)
1662 		else if (!(state.questionable & 0x40000000) && !(flags & ORDER_prereqs) && (r->mark & (M_INIT|M_LHS|M_MUST|M_RHS|M_SKIP)) == M_RHS)
1671 		r->mark &= ~(M_INIT|M_LHS|M_MUST|M_RHS|M_SKIP);
2898 	if (r->active && active(r, r->active) && r->active->parent && !(r->active->parent->target->mark & M_mark) && r->active->parent->parent != r->active->parent)
2900 		r->mark |= M_mark;
2902 		r->mark &= ~M_mark;