Searched refs:index (Results 1 – 6 of 6) sorted by relevance
| /lib/ |
| D | iommu-helper.c | 14 unsigned long index, end, i; in find_next_zero_area() local
16 index = find_next_zero_bit(map, size, start); in find_next_zero_area()
19 index = (index + align_mask) & ~align_mask; in find_next_zero_area()
21 end = index + nr; in find_next_zero_area()
24 for (i = index; i < end; i++) { in find_next_zero_area()
30 return index; in find_next_zero_area()
42 int iommu_is_span_boundary(unsigned int index, unsigned int nr, in iommu_is_span_boundary() argument
48 shift = (shift + index) & (boundary_size - 1); in iommu_is_span_boundary()
57 unsigned long index; in iommu_area_alloc() local
59 index = find_next_zero_area(map, size, start, nr, align_mask); in iommu_area_alloc()
[all …]
|
| D | radix-tree.c | 242 static int radix_tree_extend(struct radix_tree_root *root, unsigned long index) in radix_tree_extend() argument
250 while (index > radix_tree_maxindex(height)) in radix_tree_extend()
292 unsigned long index, void *item) in radix_tree_insert() argument
302 if (index > radix_tree_maxindex(root->height)) { in radix_tree_insert()
303 error = radix_tree_extend(root, index); in radix_tree_insert()
329 offset = (index >> shift) & RADIX_TREE_MAP_MASK; in radix_tree_insert()
367 void **radix_tree_lookup_slot(struct radix_tree_root *root, unsigned long index) in radix_tree_lookup_slot() argument
377 if (index > 0) in radix_tree_lookup_slot()
384 if (index > radix_tree_maxindex(height)) in radix_tree_lookup_slot()
391 (node->slots + ((index>>shift) & RADIX_TREE_MAP_MASK)); in radix_tree_lookup_slot()
[all …]
|
| D | proportions.c | 83 pd->index = 0; in prop_descriptor_init()
107 int index; in prop_change_shift() local
117 index = pd->index ^ 1; in prop_change_shift()
118 offset = pd->pg[pd->index].shift - shift; in prop_change_shift()
122 pd->pg[index].shift = shift; in prop_change_shift()
125 events = percpu_counter_sum(&pd->pg[pd->index].events); in prop_change_shift()
130 percpu_counter_set(&pd->pg[index].events, events); in prop_change_shift()
136 pd->index = index; in prop_change_shift()
152 int index; in prop_get_global() local
155 index = pd->index; in prop_get_global()
[all …]
|
| D | swiotlb.c | 377 unsigned int nslots, stride, index, wrap; in map_single() local
413 index = ALIGN(io_tlb_index, stride); in map_single()
414 if (index >= io_tlb_nslabs) in map_single()
415 index = 0; in map_single()
416 wrap = index; in map_single()
419 while (iommu_is_span_boundary(index, nslots, offset_slots, in map_single()
421 index += stride; in map_single()
422 if (index >= io_tlb_nslabs) in map_single()
423 index = 0; in map_single()
424 if (index == wrap) in map_single()
[all …]
|
| D | prio_tree.c | 192 unsigned long r_index, h_index, index, mask; in prio_tree_insert() local
216 index = r_index; in prio_tree_insert()
218 radix_index = index; in prio_tree_insert()
219 index = h_index; in prio_tree_insert()
221 heap_index = index; in prio_tree_insert()
225 index = heap_index - radix_index; in prio_tree_insert()
227 index = radix_index; in prio_tree_insert()
229 if (index & mask) { in prio_tree_insert()
|
| D | bitmap.c | 886 int index; /* index first long of region in bitmap */ in __reg_op() local
899 index = pos / BITS_PER_LONG; in __reg_op()
900 offset = pos - (index * BITS_PER_LONG); in __reg_op()
915 if (bitmap[index + i] & mask) in __reg_op()
923 bitmap[index + i] |= mask; in __reg_op()
928 bitmap[index + i] &= ~mask; in __reg_op()
|