33 	unsigned int blklen;  member
49 	*top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride);  in regcache_rbtree_get_base_top_reg()
157 		mem_size += (n->blklen * map->cache_word_size);  in rbtree_show()
158 		mem_size += BITS_TO_LONGS(n->blklen) * sizeof(long);  in rbtree_show()
284 	unsigned int blklen;  in regcache_rbtree_insert_to_block()  local
289 	blklen = (top_reg - base_reg) / map->reg_stride + 1;  in regcache_rbtree_insert_to_block()
294 		       blklen * map->cache_word_size,  in regcache_rbtree_insert_to_block()
299 	if (BITS_TO_LONGS(blklen) > BITS_TO_LONGS(rbnode->blklen)) {  in regcache_rbtree_insert_to_block()
301 				   BITS_TO_LONGS(blklen) * sizeof(*present),  in regcache_rbtree_insert_to_block()
308 		memset(present + BITS_TO_LONGS(rbnode->blklen), 0,  in regcache_rbtree_insert_to_block()
309 		       (BITS_TO_LONGS(blklen) - BITS_TO_LONGS(rbnode->blklen))  in regcache_rbtree_insert_to_block()
318 			blk, rbnode->blklen * map->cache_word_size);  in regcache_rbtree_insert_to_block()
319 		bitmap_shift_left(present, present, offset, blklen);  in regcache_rbtree_insert_to_block()
324 	rbnode->blklen = blklen;  in regcache_rbtree_insert_to_block()
353 			rbnode->blklen = (range->range_max - range->range_min) /  in regcache_rbtree_node_alloc()
359 	if (!rbnode->blklen) {  in regcache_rbtree_node_alloc()
360 		rbnode->blklen = 1;  in regcache_rbtree_node_alloc()
364 	rbnode->block = kmalloc_array(rbnode->blklen, map->cache_word_size,  in regcache_rbtree_node_alloc()
369 	rbnode->cache_present = kcalloc(BITS_TO_LONGS(rbnode->blklen),  in regcache_rbtree_node_alloc()
509 			end = rbnode->blklen;  in regcache_rbtree_sync()
549 			end = rbnode->blklen;  in regcache_rbtree_drop()