1285         return this->my_item_valid(this->my_tail - 1);  in is_item_valid()
1643         size_t new_tail = (tag+1 > this->my_tail) ? tag+1 : this->my_tail;  in __TBB_requires()
1648         this->my_tail = new_tail;  in __TBB_requires()
1720         if ( this->my_reserved == true || this->my_tail == 0 ) {  in internal_pop()
1733         if (this->my_reserved == true || this->my_tail == 0) {  in internal_reserve()
1761         if (mark < this->my_tail) heapify();  in order()
1762         __TBB_ASSERT(mark == this->my_tail, "mark unequal after heapify");  in order()
1766         return this->my_tail > 0;  in is_item_valid()
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()
1793         if ( this->my_tail >= this->my_array_size )  in prio_push()
1794             this->grow_my_array( this->my_tail + 1 );  in prio_push()
1795         (void) this->place_item(this->my_tail, src);  in prio_push()
1796         ++(this->my_tail);  in prio_push()
1797         __TBB_ASSERT(mark < this->my_tail, "mark outside bounds after push");  in prio_push()
1807             this->destroy_item(this->my_tail-1);  in prio_pop()
1808             --(this->my_tail);  in prio_pop()
1809             __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");  in prio_pop()
1813         if(this->my_tail > 1) {  in prio_pop()
1815             __TBB_ASSERT(this->my_item_valid(this->my_tail - 1), nullptr);  in prio_pop()
1816             this->move_item(0,this->my_tail - 1);  in prio_pop()
1818         --(this->my_tail);  in prio_pop()
1819         if(mark > this->my_tail) --mark;  in prio_pop()
1820         if (this->my_tail > 1) // don't reheap for heap of size 1  in prio_pop()
1822         __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");  in prio_pop()
1826         return this->get_my_item(prio_use_tail() ? this->my_tail-1 : 0);  in prio()
1831         if(this->my_tail == 0) {  in heapify()
1836         for (; mark<this->my_tail; ++mark) { // for each unheaped element  in heapify()