Lines Matching refs:Mark
88 // difficult to mark them as such.
377 #define Mark (-1)
386 // Constructor: n is number of normal slots, maxmark number of mark slots.
404 void mark() {
429 int nextmark_; // id of next mark
430 bool last_was_mark_; // last inserted was mark
534 if (state->inst_[i] == Mark) {
599 // This is implemented by separating different sets with Mark pointers.
616 bool sawmark = false; // whether queue contains a Mark
624 if (n > 0 && inst[n-1] != Mark) {
626 inst[n++] = Mark;
675 if (n > 0 && inst[n-1] == Mark)
717 while (markp < ep && *markp != Mark)
798 if (s->inst_[i] == Mark)
799 q->mark();
813 // pushes at most two instructions plus maybe a mark.
823 if (id == Mark) {
824 q->mark();
861 // with a Mark, so that out1's threads (which will start farther
867 stk[nstk++] = Mark;
899 AddToQueue(newq, Mark, flag);
921 newq->mark();
