Searched refs:words (Results 1 - 4 of 4) sorted by relevance
/lib/ |
H A D | find_last_bit.c | 22 unsigned long words; local 26 words = size / BITS_PER_LONG; 30 tmp = (addr[words] & (~0UL >> (BITS_PER_LONG 36 while (words) { 37 tmp = addr[--words]; 40 return words * BITS_PER_LONG + __fls(tmp);
|
H A D | dynamic_debug.c | 208 * Split the buffer `buf' into space-separated words. 210 * embedded or escaped \". Return the number of words 213 static int ddebug_tokenize(char *buf, char *words[], int maxwords) argument 244 pr_err("too many words, legal max <=%d\n", maxwords); 245 return -EINVAL; /* ran out of words[] before bytes */ 249 words[nwords++] = buf; 255 pr_info("split into words:"); 257 pr_cont(" \"%s\"", words[i]); 297 * Parse words[] as a ddebug query specification, which is a series 311 static int ddebug_parse_query(char *words[], in argument 439 char *words[MAXWORDS]; local [all...] |
H A D | string.c | 814 unsigned int words, prefix; local 843 words = bytes / 8; 845 while (words) { 849 words--;
|
H A D | bch.c | 133 * convert ecc bytes to aligned, zero-padded 32-bit ecc words 149 * convert 32-bit ecc words to ecc bytes 213 /* process 32-bit aligned data words */ 1252 unsigned int i, words; local 1297 words = DIV_ROUND_UP(m*t, 32); 1301 bch->mod8_tab = bch_alloc(words*1024*sizeof(*bch->mod8_tab), &err); 1302 bch->ecc_buf = bch_alloc(words*sizeof(*bch->ecc_buf), &err); 1303 bch->ecc_buf2 = bch_alloc(words*sizeof(*bch->ecc_buf2), &err);
|
Completed in 158 milliseconds