Home
last modified time | relevance | path

Searched refs:table (Results 1 – 10 of 10) sorted by relevance

/lib/
Dcrc8.c29 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_msb()
35 table[0] = 0; in crc8_populate_msb()
40 table[i+j] = table[j] ^ t; in crc8_populate_msb()
51 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_lsb()
56 table[0] = 0; in crc8_populate_lsb()
61 table[i+j] = table[j] ^ t; in crc8_populate_lsb()
74 u8 crc8(const u8 table[CRC8_TABLE_SIZE], u8 *pdata, size_t nbytes, u8 crc) in crc8()
78 crc = table[(crc ^ *pdata++) & 0xff]; in crc8()
Dscatterlist.c205 void __sg_free_table(struct sg_table *table, unsigned int max_ents, in __sg_free_table() argument
210 if (unlikely(!table->sgl)) in __sg_free_table()
213 sgl = table->sgl; in __sg_free_table()
214 while (table->orig_nents) { in __sg_free_table()
215 unsigned int alloc_size = table->orig_nents; in __sg_free_table()
233 table->orig_nents -= sg_size; in __sg_free_table()
241 table->sgl = NULL; in __sg_free_table()
250 void sg_free_table(struct sg_table *table) in sg_free_table() argument
252 __sg_free_table(table, SG_MAX_SINGLE_ALLOC, false, sg_kfree); in sg_free_table()
275 int __sg_alloc_table(struct sg_table *table, unsigned int nents, in __sg_alloc_table() argument
[all …]
Dgen_crc32table.c91 static void output_table(uint32_t (*table)[256], int rows, int len, char *trans) in output_table()
100 printf("%s(0x%8.8xL), ", trans, table[j][i]); in output_table()
102 printf("%s(0x%8.8xL)},\n", trans, table[j][len - 1]); in output_table()
Ddynamic_debug.c59 struct ddebug_table *table; member
690 iter->table = NULL; in ddebug_iter_first()
694 iter->table = list_entry(ddebug_tables.next, in ddebug_iter_first()
697 return &iter->table->ddebugs[iter->idx]; in ddebug_iter_first()
708 if (iter->table == NULL) in ddebug_iter_next()
710 if (++iter->idx == iter->table->num_ddebugs) { in ddebug_iter_next()
713 if (list_is_last(&iter->table->link, &ddebug_tables)) { in ddebug_iter_next()
714 iter->table = NULL; in ddebug_iter_next()
717 iter->table = list_entry(iter->table->link.next, in ddebug_iter_next()
720 return &iter->table->ddebugs[iter->idx]; in ddebug_iter_next()
[all …]
Ddevres.c235 void __iomem *table[PCIM_IOMAP_MAX]; member
245 if (this->table[i]) in pcim_iomap_release()
246 pci_iounmap(dev, this->table[i]); in pcim_iomap_release()
268 return dr->table; in pcim_iomap_table()
274 return dr->table; in pcim_iomap_table()
Dparser.c107 int match_token(char *s, const match_table_t table, substring_t args[]) in match_token() argument
111 for (p = table; !match_one(s, p->pattern, args) ; p++) in match_token()
DKconfig128 This is the fastest algorithm, but comes with a 8KiB lookup table.
129 Most modern processors have enough cache to hold this table without
140 table.
148 is not particularly fast, but has a small 256 byte lookup table.
156 no lookup table. This is provided as a debugging option.
DKconfig.debug1210 bool "Debug SG table operations"
1744 tristate "Perform selftest on resizable hash table"
/lib/zlib_inflate/
Dinftrees.c24 code **table, unsigned *bits, unsigned short *work) in zlib_inflate_table() argument
107 *(*table)++ = this; /* make a table to force an error */ in zlib_inflate_table()
108 *(*table)++ = this; in zlib_inflate_table()
190 next = *table; /* current table to fill in */ in zlib_inflate_table()
271 (*table)[low].op = (unsigned char)curr; in zlib_inflate_table()
272 (*table)[low].bits = (unsigned char)root; in zlib_inflate_table()
273 (*table)[low].val = (unsigned short)(next - *table); in zlib_inflate_table()
292 next = *table; in zlib_inflate_table()
312 *table += used; in zlib_inflate_table()
Dinftrees.h57 unsigned codes, code **table,