29 	unsigned int blklen;  member
45 	*top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride);  in regcache_rbtree_get_base_top_reg()
152 		mem_size += (n->blklen * map->cache_word_size);  in rbtree_show()
153 		mem_size += BITS_TO_LONGS(n->blklen) * sizeof(long);  in rbtree_show()
269 	unsigned int blklen;  in regcache_rbtree_insert_to_block()  local
274 	blklen = (top_reg - base_reg) / map->reg_stride + 1;  in regcache_rbtree_insert_to_block()
279 		       blklen * map->cache_word_size,  in regcache_rbtree_insert_to_block()
286 	if (BITS_TO_LONGS(blklen) > BITS_TO_LONGS(rbnode->blklen)) {  in regcache_rbtree_insert_to_block()
288 				   BITS_TO_LONGS(blklen) * sizeof(*present),  in regcache_rbtree_insert_to_block()
293 		memset(present + BITS_TO_LONGS(rbnode->blklen), 0,  in regcache_rbtree_insert_to_block()
294 		       (BITS_TO_LONGS(blklen) - BITS_TO_LONGS(rbnode->blklen))  in regcache_rbtree_insert_to_block()
303 			blk, rbnode->blklen * map->cache_word_size);  in regcache_rbtree_insert_to_block()
304 		bitmap_shift_left(present, present, offset, blklen);  in regcache_rbtree_insert_to_block()
308 	rbnode->blklen = blklen;  in regcache_rbtree_insert_to_block()
337 			rbnode->blklen = (range->range_max - range->range_min) /  in regcache_rbtree_node_alloc()
343 	if (!rbnode->blklen) {  in regcache_rbtree_node_alloc()
344 		rbnode->blklen = 1;  in regcache_rbtree_node_alloc()
348 	rbnode->block = kmalloc_array(rbnode->blklen, map->cache_word_size,  in regcache_rbtree_node_alloc()
353 	rbnode->cache_present = kcalloc(BITS_TO_LONGS(rbnode->blklen),  in regcache_rbtree_node_alloc()
496 			end = rbnode->blklen;  in regcache_rbtree_sync()
538 			end = rbnode->blklen;  in regcache_rbtree_drop()