1669         : buffer_node<T>(g), compare(comp), mark(0) {
1685         : buffer_node<T>(src), mark(0)  in priority_queue_node()
1695         mark = 0;  in reset_node()
1761         if (mark < this->my_tail) heapify();  in order()
1762         __TBB_ASSERT(mark == this->my_tail, "mark unequal after heapify");  in order()
1781     size_type mark;  variable
1787         __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds before test");  in prio_use_tail()
1788 …return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1));  in prio_use_tail()
1797         __TBB_ASSERT(mark < this->my_tail, "mark outside bounds after push");  in prio_push()
1809             __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");  in prio_pop()
1819         if(mark > this->my_tail) --mark;  in prio_pop()
1822         __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");  in prio_pop()
1832             mark = 0;  in heapify()
1835         if (!mark) mark = 1;  in heapify()
1836         for (; mark<this->my_tail; ++mark) { // for each unheaped element  in heapify()
1837             size_type cur_pos = mark;  in heapify()
1839             this->fetch_item(mark,to_place);  in heapify()
1854         while (child < mark) {  in reheap()
1856             if (child+1<mark &&  in reheap()