Home
last modified time | relevance | path

Searched refs:word (Results 1 – 4 of 4) sorted by relevance

/lib/
Dsbitmap.c35 val = sb->map[index].word; in sbitmap_deferred_clear()
36 } while (cmpxchg(&sb->map[index].word, val, val & ~mask) != val); in sbitmap_deferred_clear()
107 static int __sbitmap_get_word(unsigned long *word, unsigned long depth, in __sbitmap_get_word() argument
114 nr = find_next_zero_bit(word, depth, hint); in __sbitmap_get_word()
128 if (!test_and_set_bit_lock(nr, word)) in __sbitmap_get_word()
145 nr = __sbitmap_get_word(&sb->map[index].word, in sbitmap_find_bit_in_index()
202 nr = __sbitmap_get_word(&sb->map[index].word, in sbitmap_get_shallow()
232 if (sb->map[i].word & ~sb->map[i].cleared) in sbitmap_any_bit_set()
244 const struct sbitmap_word *word = &sb->map[i]; in sbitmap_any_bit_clear() local
245 unsigned long mask = word->word & ~word->cleared; in sbitmap_any_bit_clear()
[all …]
Dvsprintf.c1154 int word, bit; in bitmap_string() local
1157 word = i / BITS_PER_LONG; in bitmap_string()
1159 val = (bitmap[word] >> bit) & chunkmask; in bitmap_string()
1314 u16 word; in ip6_compressed_string() local
1363 word = ntohs(in6.s6_addr16[i]); in ip6_compressed_string()
1364 hi = word >> 8; in ip6_compressed_string()
1365 lo = word & 0xff; in ip6_compressed_string()
Dbch.c1179 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1222 for (j = 0, word = 0; j < nbits; j++) { in compute_generator_polynomial()
1224 word |= 1u << (31-j); in compute_generator_polynomial()
1226 genpoly[i++] = word; in compute_generator_polynomial()
DKconfig30 - The least-significant 32-bit word comes first (within a 64-bit