IDR_BITS 42 lib/util/idtree.c #define IDR_SIZE (1 << IDR_BITS) IDR_BITS 43 lib/util/idtree.c #define IDR_MASK ((1 << IDR_BITS)-1) IDR_BITS 47 lib/util/idtree.c #define MAX_LEVEL (MAX_ID_SHIFT + IDR_BITS - 1) / IDR_BITS IDR_BITS 122 lib/util/idtree.c n = (id >> (IDR_BITS*l)) & IDR_MASK; IDR_BITS 129 lib/util/idtree.c id = (id | ((1 << (IDR_BITS*l))-1)) + 1; IDR_BITS 140 lib/util/idtree.c sh = IDR_BITS * (l + 1); IDR_BITS 147 lib/util/idtree.c sh = IDR_BITS*l; IDR_BITS 183 lib/util/idtree.c n = n >> IDR_BITS; IDR_BITS 209 lib/util/idtree.c while ((layers < MAX_LEVEL) && (id >= (1 << (layers*IDR_BITS)))) { IDR_BITS 255 lib/util/idtree.c shift -= IDR_BITS; IDR_BITS 277 lib/util/idtree.c n = idp->layers * IDR_BITS; IDR_BITS 283 lib/util/idtree.c if ((id & ~(~0 << MAX_ID_SHIFT)) >> (n + IDR_BITS)) IDR_BITS 289 lib/util/idtree.c while (n >= IDR_BITS && p) { IDR_BITS 290 lib/util/idtree.c n -= IDR_BITS; IDR_BITS 303 lib/util/idtree.c if (sub_remove(idp, (idp->layers - 1) * IDR_BITS, id) == -1) {