Lines Matching defs:height
51 * A leaf holds an array of u32 seqno, and has height 0. The bitmap field
55 * A branch holds an array of layer pointers, and has height > 0, and always
80 unsigned int height;
106 GEM_BUG_ON(p->height);
112 GEM_BUG_ON(!p->height);
119 return (id >> p->height) & MASK;
125 GEM_BUG_ON(p->height);
131 return id >> p->height >> SHIFT;
136 GEM_BUG_ON(p->height);
183 if (!p->height)
213 p->height = 0;
267 * or lower layers. Leaf nodes (height = 0) contain the fences, all
268 * other nodes (height > 0) are internal layers that point to a lower
277 * of the tree. If it has height 0, we have found our leaf and just
278 * need to replace the fence slot with ourselves. If the height is
281 * As descend the tree the prefix grows (and height decreases).
295 /* Compute the height at which these two diverge */
298 next->height = above + p->height;
317 if (!p->height)
322 GEM_BUG_ON(!p->height);
376 if (p->height) {
Indexes created Thu Oct 02 07:10:07 GMT 2025