Lines Matching refs:size
105 unsigned long start, unsigned long end, unsigned long size,
112 ret = mtree_alloc_range(mt, &result, ptr, size, start, end,
122 unsigned long start, unsigned long end, unsigned long size,
129 ret = mtree_alloc_rrange(mt, &result, ptr, size, start, end,
684 * Start of hole, end of hole, size of hole (+1)
695 * 3. size
703 0x7fff5878d << 12, /* First rev hole of size 0x1000 */
715 562949953421311 << 12,/* First rev hole of size 0x1000 */
721 0x7F36D5106 << 12, /* First rev hole of size 0x4000 */
792 pr_debug("\tReverse request %d between %lu-%lu size %lu, should get %lu\n",
801 req_range[i+2] >> 12, /* size */
853 /* Start of hole, end of hole, size of hole (+1) */
863 * 3. size
871 0x565234afb000, /* First hole in our data of size 1000. */
877 0x0, /* First hole in our data of size 2000. */
947 pr_debug("\tGet empty %lu-%lu size %lu (%lx-%lx)\n", min >> 12,
961 pr_debug("\tTest %d: %lu-%lu size %lu expected %lu (%lu-%lu)\n",
969 req_range[i+2] >> 12, /* size */
1581 * searching 20 - 50 for size 3.
2265 * Fixed by using the correct check for node size in mas_wr_modify()
2697 /* Small to medium size not starting at zero*/
2808 /* Check size that doesn't fit any gap */
2813 * Check size that doesn't fit the lower end of the window but
2820 * Check size that doesn't fit the upper end of the window but
2857 unsigned long size;
2864 size = 1 << shift;
2868 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != 0);
2869 MT_BUG_ON(mt, mas.last != mas.index + size - 1);
2870 mas_store_gfp(&mas, (void *)size, GFP_KERNEL);
2877 size = 0x1000;
2879 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != -EBUSY);