Lines Matching defs:_cnt
272 // duplicated; they have no embedded NULLs. Edges from 0 to _cnt-1
273 // are required, from _cnt to _max-1 are precedence edges.
274 node_idx_t _cnt; // Total number of required Node inputs.
299 uint req() const { return _cnt; }
387 assert( i < _cnt, err_msg_res("oob: i=%d, _cnt=%d", i, _cnt));
399 assert( i < _cnt, "oob");
471 assert( i >= _cnt, "not a precedence edge");
1330 uint _cnt;
1332 Node_List() : Node_Array(Thread::current()->resource_area()), _cnt(0) {}
1333 Node_List(Arena *a) : Node_Array(a), _cnt(0) {}
1340 void insert( uint i, Node *n ) { Node_Array::insert(i,n); _cnt++; }
1341 void remove( uint i ) { Node_Array::remove(i); _cnt--; }
1342 void push( Node *b ) { map(_cnt++,b); }
1344 Node *pop() { return _nodes[--_cnt]; }
1345 Node *rpop() { Node *b = _nodes[0]; _nodes[0]=_nodes[--_cnt]; return b;}
1346 void clear() { _cnt = 0; Node_Array::clear(); } // retain storage
1347 uint size() const { return _cnt; }