Home
last modified time | relevance | path

Searched refs:shift (Results 1 – 13 of 13) sorted by relevance

/lib/
Dts_bm.c63 int shift = bm->patlen - 1, bs; in bm_find() local
72 while (shift < text_len) { in bm_find()
74 shift, text[shift]); in bm_find()
76 if ((icase ? toupper(text[shift-i]) in bm_find()
77 : text[shift-i]) in bm_find()
83 return consumed += (shift-(bm->patlen-1)); in bm_find()
85 next: bs = bm->bad_shift[text[shift-i]]; in bm_find()
88 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]); in bm_find()
Dxarray.c144 return (index >> node->shift) & XA_CHUNK_MASK; in get_offset()
155 unsigned int shift = xas->xa_node->shift; in xas_move_index() local
156 xas->xa_index &= ~XA_CHUNK_MASK << shift; in xas_move_index()
157 xas->xa_index += offset << shift; in xas_move_index()
193 if ((xas->xa_index >> xa_to_node(entry)->shift) > XA_CHUNK_MASK) in xas_start()
238 if (xas->xa_shift > node->shift) in xas_load()
241 if (node->shift == 0) in xas_load()
355 static void *xas_alloc(struct xa_state *xas, unsigned int shift) in xas_alloc() argument
384 XA_NODE_BUG_ON(node, shift > BITS_PER_LONG); in xas_alloc()
386 node->shift = shift; in xas_alloc()
[all …]
Diommu-helper.c11 unsigned long shift, unsigned long boundary_size, in iommu_area_alloc() argument
21 if (iommu_is_span_boundary(index, nr, shift, boundary_size)) { in iommu_area_alloc()
22 start = ALIGN(shift + index, boundary_size) - shift; in iommu_area_alloc()
Dradix-tree.c97 unsigned int offset = (index >> parent->shift) & RADIX_TREE_MAP_MASK; in radix_tree_descend()
220 static inline unsigned long shift_maxindex(unsigned int shift) in shift_maxindex() argument
222 return (RADIX_TREE_MAP_SIZE << shift) - 1; in shift_maxindex()
227 return shift_maxindex(node->shift); in node_maxindex()
234 return (index & ~node_maxindex(node)) + (offset << node->shift); in next_index()
244 unsigned int shift, unsigned int offset, in radix_tree_node_alloc() argument
289 ret->shift = shift; in radix_tree_node_alloc()
407 return node->shift + RADIX_TREE_MAP_SHIFT; in radix_tree_load_root()
418 unsigned long index, unsigned int shift) in radix_tree_extend() argument
425 maxshift = shift; in radix_tree_extend()
[all …]
Dsbitmap.c44 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift, in sbitmap_init_node() argument
50 if (shift < 0) { in sbitmap_init_node()
51 shift = ilog2(BITS_PER_LONG); in sbitmap_init_node()
59 while ((4U << shift) > depth) in sbitmap_init_node()
60 shift--; in sbitmap_init_node()
63 bits_per_word = 1U << shift; in sbitmap_init_node()
67 sb->shift = shift; in sbitmap_init_node()
91 unsigned int bits_per_word = 1U << sb->shift; in sbitmap_resize()
178 nr += index << sb->shift; in sbitmap_get()
206 nr += index << sb->shift; in sbitmap_get_shallow()
[all …]
Drhashtable.c68 const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); in nested_table_free() local
69 const unsigned int len = 1 << shift; in nested_table_free()
77 size >>= shift; in nested_table_free()
142 const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); in nested_bucket_table_alloc() local
146 if (nbuckets < (1 << (shift + 1))) in nested_bucket_table_alloc()
161 tbl->nest = (ilog2(nbuckets) - 1) % shift + 1; in nested_bucket_table_alloc()
1170 const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); in __rht_bucket_nested() local
1180 while (ntbl && size > (1 << shift)) { in __rht_bucket_nested()
1181 index = subhash & ((1 << shift) - 1); in __rht_bucket_nested()
1184 size >>= shift; in __rht_bucket_nested()
[all …]
Didr.c553 extern void xa_dump_index(unsigned long index, unsigned int shift);
565 unsigned int shift = node->shift + IDA_CHUNK_SHIFT + in ida_dump_entry() local
568 xa_dump_index(index * IDA_BITMAP_BITS, shift); in ida_dump_entry()
572 index | (i << node->shift)); in ida_dump_entry()
Dbitmap.c102 unsigned shift, unsigned nbits) in __bitmap_shift_right() argument
105 unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_right()
147 unsigned int shift, unsigned int nbits) in __bitmap_shift_left() argument
151 unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_left()
Dassoc_array.c260 int shift = shortcut->skip_to_level & ASSOC_ARRAY_KEY_CHUNK_MASK; in assoc_array_walk() local
261 dissimilarity &= ~(ULONG_MAX << shift); in assoc_array_walk()
Dvsprintf.c461 int shift = 3; in number() local
464 shift = 4; in number()
467 num >>= shift; in number()
Dtest_xarray.c1507 xas.xa_shift = node->shift + XA_CHUNK_SHIFT; in shadow_remove()
/lib/reed_solomon/
Dtest_rslib.c87 int shift; member
463 int pad = (pad_coef[i].mult * max_pad) >> pad_coef[i].shift; in run_exercise()
/lib/vdso/
Dgettimeofday.c57 ns >>= vd->shift; in do_hres()