Lines Matching refs:leaf
1130 s8 *leaf; in dbAllocNext() local
1140 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1157 if (leaf[word] == NOFREE) in dbAllocNext()
1204 if (leaf[word] < BUDMIN) in dbAllocNext()
1211 min_t(int, leaf[word], NLSTOL2BSZ(nwords)); in dbAllocNext()
1261 s8 *leaf; in dbAllocNear() local
1268 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1282 if (leaf[word] < l2nb) in dbAllocNear()
1295 if (leaf[word] < BUDMIN) in dbAllocNear()
2183 s8 *leaf; in dbAllocBits() local
2186 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2252 if (leaf[word] < BUDMIN) { in dbAllocBits()
2263 size = min_t(int, leaf[word], in dbAllocBits()
2664 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); in dbSplit() local
2668 if (leaf[leafno] > tp->dmt_budmin) { in dbSplit()
2674 cursz = leaf[leafno] - 1; in dbSplit()
2729 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); in dbBackSplit() local
2734 assert(leaf[leafno] == NOFREE); in dbBackSplit()
2755 while (leaf[leafno] == NOFREE) { in dbBackSplit()
2771 if (leaf[bud] != NOFREE) { in dbBackSplit()
2775 cursz = leaf[bud] - 1; in dbBackSplit()
2782 if (leaf[leafno] != size) { in dbBackSplit()
2807 s8 *leaf; in dbJoin() local
2814 leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); in dbJoin()
2841 if (newval > leaf[buddy]) in dbJoin()
2845 if (newval < leaf[buddy]) in dbJoin()