Searched defs:table (Results 1 - 7 of 7) sorted by relevance
/lib/ |
H A D | crc8.c | 24 * crc8_populate_msb - fill crc table for given polynomial in reverse bit order. 26 * table: table to be filled. 27 * polynomial: polynomial for which table is to be filled. 29 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) argument 35 table[0] = 0; 40 table[i+j] = table[j] ^ t; 46 * crc8_populate_lsb - fill crc table for given polynomial in regular bit order. 48 * table 51 crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) argument 74 crc8(const u8 table[CRC8_TABLE_SIZE], u8 *pdata, size_t nbytes, u8 crc) argument [all...] |
H A D | gen_crc32table.c | 29 * crc32init_le() - allocate and initialize LE table data 68 * crc32init_be() - allocate and initialize BE table data 91 static void output_table(uint32_t (*table)[256], int rows, int len, char *trans) argument 100 printf("%s(0x%8.8xL), ", trans, table[j][i]); 102 printf("%s(0x%8.8xL)},\n", trans, table[j][len - 1]);
|
H A D | parser.c | 96 * @table: match_table_t describing the set of allowed option tokens and the 107 int match_token(char *s, const match_table_t table, substring_t args[]) argument 111 for (p = table; !match_one(s, p->pattern, args) ; p++)
|
H A D | devres.c | 211 void __iomem *table[PCIM_IOMAP_MAX]; member in struct:pcim_iomap_devres 221 if (this->table[i]) 222 pci_iounmap(dev, this->table[i]); 226 * pcim_iomap_table - access iomap allocation table 227 * @pdev: PCI device to access iomap table for 229 * Access iomap allocation table for @dev. If iomap table doesn't 231 * recorded in the iomap table are automatically unmapped on driver 234 * This function might sleep when the table is first allocated but can 244 return dr->table; [all...] |
H A D | scatterlist.c | 95 * sg_init_table - Initialize SG table 96 * @sgl: The SG table 97 * @nents: Number of entries in table 100 * If this is part of a chained sg table, sg_mark_end() should be 101 * used only on the last table part. 165 * __sg_free_table - Free a previously mapped sg table 166 * @table: The sg table header to use 172 * Free an sg table previously allocated and setup with 177 void __sg_free_table(struct sg_table *table, unsigne argument 222 sg_free_table(struct sg_table *table) argument 247 __sg_alloc_table(struct sg_table *table, unsigned int nents, unsigned int max_ents, struct scatterlist *first_chunk, gfp_t gfp_mask, sg_alloc_fn *alloc_fn) argument 331 sg_alloc_table(struct sg_table *table, unsigned int nents, gfp_t gfp_mask) argument [all...] |
H A D | dynamic_debug.c | 59 struct ddebug_table *table; member in struct:ddebug_iter 687 iter->table = NULL; 691 iter->table = list_entry(ddebug_tables.next, 694 return &iter->table->ddebugs[iter->idx]; 705 if (iter->table == NULL) 707 if (++iter->idx == iter->table->num_ddebugs) { 708 /* iterate to next table */ 710 if (list_is_last(&iter->table->link, &ddebug_tables)) { 711 iter->table = NULL; 714 iter->table [all...] |
/lib/zlib_inflate/ |
H A D | inftrees.c | 13 The code lengths are lens[0..codes-1]. The result starts at *table, 17 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table 19 requested root table index bits, and on return it is the actual root 20 table index bits. It will differ if the request is greater than the 24 code **table, unsigned *bits, unsigned short *work) 29 unsigned root; /* number of index bits for root table */ 30 unsigned curr; /* number of index bits for current table */ 31 unsigned drop; /* code bits to drop for sub-table */ 33 unsigned used; /* code entries in table used */ 39 code this; /* table entr 23 zlib_inflate_table(codetype type, unsigned short *lens, unsigned codes, code **table, unsigned *bits, unsigned short *work) argument [all...] |
Completed in 2022 milliseconds