Home | History | Annotate | Download | only in linker

Lines Matching full:buddy

64     int buddy, curr = index;
68     /* find a slots buddy Buddy# = Slot# ^ (1 << order)
69      * if the buddy is also free merge them
70      * repeat until the buddy is not free or end of the bitmap is reached
73         buddy = BA_BUDDY_INDEX(curr);
74         if (BA_IS_FREE(buddy) &&
75                 BA_ORDER(buddy) == BA_ORDER(curr)) {
76             BA_ORDER(buddy)++;
78             curr = min(buddy, curr);
139         int buddy;
141         buddy = BA_BUDDY_INDEX(best_fit);
142         BA_ORDER(buddy) = BA_ORDER(best_fit);