Searched refs:maxindex (Results 1 – 9 of 9) sorted by relevance
401 *maxindex = 0; in radix_tree_load_root()604 unsigned long maxindex; in __radix_tree_create() local612 if (max > maxindex) { in __radix_tree_create()752 unsigned long maxindex; in __radix_tree_lookup() local759 if (index > maxindex) in __radix_tree_lookup()971 unsigned long maxindex; in radix_tree_tag_set() local1033 unsigned long maxindex; in radix_tree_tag_clear() local1037 if (index > maxindex) in radix_tree_tag_clear()1085 unsigned long maxindex; in radix_tree_tag_get() local1091 if (index > maxindex) in radix_tree_tag_get()[all …]
270 void tree_verify_min_height(struct radix_tree_root *root, int maxindex) in tree_verify_min_height() argument275 assert(maxindex == 0); in tree_verify_min_height()280 assert(maxindex <= node_maxindex(node)); in tree_verify_min_height()284 assert(maxindex > shift_maxindex(shift - RADIX_TREE_MAP_SHIFT)); in tree_verify_min_height()286 assert(maxindex > 0); in tree_verify_min_height()
47 void tree_verify_min_height(struct radix_tree_root *root, int maxindex);
50 maxindex = node_maxindex(node)52 if (index > maxindex):
1452 bool rtas_indicator_present(int token, int *maxindex) in rtas_indicator_present() argument1457 __be32 maxindex; in rtas_indicator_present() member1469 if (maxindex) in rtas_indicator_present()1470 *maxindex = __be32_to_cpu(indicators[i].maxindex); in rtas_indicator_present()
90 uint32_t maxindex = ((desc & 3) + 1) * 8; in HELPER() local96 if (index < maxindex) { in HELPER()
425 extern bool rtas_indicator_present(int token, int *maxindex);
587 - for(i=maxindex(flags);i;i--) /* clear the flags */
4177 pmcraid_release_host_rrqs(struct pmcraid_instance *pinstance, int maxindex) in pmcraid_release_host_rrqs() argument4181 for (i = 0; i < maxindex; i++) { in pmcraid_release_host_rrqs()