Lines Matching defs:FREE
31 // FREE -> NORMAL <-> WEAK -> PENDING -> NEAR_DEATH -> { NORMAL, WEAK, FREE }
33 FREE = 0,
80 set_state(FREE);
87 DCHECK(state() == FREE);
106 set_state(FREE);
172 bool IsInUse() const { return state() != FREE; }
185 return state() != FREE &&
221 // Accessors for next free node in the free list.
223 DCHECK(state() == FREE);
227 DCHECK(state() == FREE);
378 // Provided data for callback. In FREE state, this is used for
379 // the free list link.
567 // Take the first node in the free list.
933 // Free nodes do not have weak callbacks. Do not use them to compute
969 // Free nodes do not have weak callbacks. Do not use them to compute
1060 DCHECK(node_->state() == Node::FREE);
1191 } else if (it.node()->state() == Node::FREE) {
1211 if (it.node()->state() == Node::FREE) destroyed++;
1219 PrintF(" # free = %d\n", destroyed);
