Home
last modified time | relevance | path

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

12345678910>>...14

/device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/
Dst.c58 #define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)((x),(y)) == 0) argument
60 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)((key)) argument
61 #define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins) argument
202 st_free_table(table) in st_free_table() argument
203 st_table *table; in st_free_table()
208 for(i = 0; i < table->num_bins; i++) {
209 ptr = table->bins[i];
216 free(table->bins);
217 free(table);
220 #define PTR_NOT_EQUAL(table, ptr, hash_val, key) \ argument
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/unicode/
Dmkstringprep.py68 table = {} variable
69 tables.append((curname, table))
96 table[i] = i
105 table[int(code, 16)] = value
123 name, table = tables[0] variable
126 table = set(table.keys()) variable
146 name, table = tables[0] variable
149 table = sorted(table.keys()) variable
151 b1_set = """ + compact_set(table) + """
236 name, table = tables[0] variable
[all …]
Dmakeunicodedata.py80 print len(filter(None, unicode.table)), "characters"
88 print len(filter(None, old_unicode.table)), "characters"
101 table = [dummy]
112 record = unicode.table[char]
128 cache[item] = i = len(table)
129 table.append(item)
144 record = unicode.table[char]
167 unicode.table[decomp[1]][3] == "0":
218 print len(table), "unique properties"
235 for item in table:
[all …]
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Dhash.c75 Entry **table; in newHashTable() local
77 table = (Entry **) calloc(size, sizeof(Entry *)); in newHashTable()
78 require( table != NULL, "cannot allocate hash table"); in newHashTable()
85 return table; in newHashTable()
90 killHashTable( Entry **table ) in killHashTable() argument
92 killHashTable( table ) in killHashTable()
93 Entry **table; in killHashTable()
97 free( (char *) table ); /* MR10 cast */
103 hash_add( Entry **table, char *key, Entry *rec ) in hash_add() argument
105 hash_add( table, key, rec ) in hash_add()
[all …]
Dfcache.c45 Entry **table=Fcache; local
54 for (p=table; p<&(table[HashTableSize]); p++) {
58 if ( q != NULL && low==0 ) low = p-table;
72 if ( *p != NULL ) hi = p-table;
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/scripts/
Dpdeps.py36 table = {}
38 process(arg, table)
41 printresults(table)
44 inv = inverse(table)
48 reach = closure(table)
66 def process(filename, table): argument
71 table[mod] = list = []
94 def closure(table): argument
95 modules = table.keys()
101 reach[mod] = table[mod][:]
[all …]
/device/google/crosshatch/json-c/
Dlinkhash.c439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
504 if(t->table[n].k == LH_EMPTY || t->table[n].k == LH_FREED) break; in lh_table_insert()
509 t->table[n].k = k; in lh_table_insert()
510 t->table[n].v = v; in lh_table_insert()
514 t->head = t->tail = &t->table[n]; in lh_table_insert()
[all …]
Dlinkhash.h135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
/device/google/bonito/json-c/
Dlinkhash.c439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
504 if(t->table[n].k == LH_EMPTY || t->table[n].k == LH_FREED) break; in lh_table_insert()
509 t->table[n].k = k; in lh_table_insert()
510 t->table[n].v = v; in lh_table_insert()
514 t->head = t->tail = &t->table[n]; in lh_table_insert()
[all …]
Dlinkhash.h135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
Dtoaiff.py21 table = {} variable
25 table['au'] = t
35 table['hcom'] = t
39 table['voc'] = t
43 table['wav'] = t
47 table['8svx'] = t
51 table['sndt'] = t
55 table['sndr'] = t
102 if ftype is None or not ftype in table:
107 sts = table[ftype].copy(fname, temp)
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/SmbiosDxe/
DSmbiosDxe.uni2 …tializes and installs the SMBIOS protocol, constructs SMBIOS table into system configuration table.
4 … and installs the SMBIOS protocol, and constructs SMBIOS table into the system configuration table.
18 … and installs the SMBIOS protocol, and constructs SMBIOS table into the system configuration table"
20 …and installs the SMBIOS protocol, and constructs SMBIOS table into the system configuration table."
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/sym/
Dsym.c123 static Sym **table=NULL; variable
136 table = (Sym **) calloc(sz, sizeof(Sym *));
137 if ( table == NULL )
159 if ( table != NULL ) free( table ); in zzs_done()
179 rec->next = table[h]; /* Add to doubly-linked list */
182 table[h] = rec;
183 rec->head = &(table[h]);
199 for (q = table[h%size]; q != NULL; q = q->next)
300 for (p=table; p<&(table[size]); p++) in zzs_stat()
305 if ( q != NULL && low==0 ) low = p-table; in zzs_stat()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
Dinftrees.c32 int inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
36 code FAR * FAR *table;
121 *(*table)++ = this; /* make a table to force an error */
122 *(*table)++ = this;
204 next = *table; /* current table to fill in */
285 (*table)[low].op = (unsigned char)curr;
286 (*table)[low].bits = (unsigned char)root;
287 (*table)[low].val = (unsigned short)(next - *table);
306 next = *table;
326 *table += used;
Dalgorithm.txt21 Duplicated strings are found using a hash table. All input strings of
22 length 3 are inserted in the hash table. A hash index is computed for
53 are inserted in the hash table only when no match was found, or
67 inflate() sets up a first level table that covers some number of bits of
69 stream, and looks it up in the table. The table will tell if the next
71 the value, else it will point to the next level table for which inflate()
75 takes to decode and the time it takes to build the table. If building the
76 table took no time (and if you had infinite memory), then there would only
77 be a first level table to cover all the way to the longest code. However,
78 building the table ends up taking a lot longer for more bits since short
[all …]
Dzutil.c208 local ptr_table table[MAX_PTR]; variable
231 table[next_ptr].org_ptr = buf; in zcalloc()
236 table[next_ptr++].new_ptr = buf; in zcalloc()
249 if (ptr != table[n].new_ptr) continue; in zcfree()
251 farfree(table[n].org_ptr); in zcfree()
253 table[n-1] = table[n]; in zcfree()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
Dinftrees.c32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
36 code FAR * FAR *table;
121 *(*table)++ = here; /* make a table to force an error */
122 *(*table)++ = here;
203 next = *table; /* current table to fill in */
286 (*table)[low].op = (unsigned char)curr;
287 (*table)[low].bits = (unsigned char)root;
288 (*table)[low].val = (unsigned short)(next - *table);
303 *table += used;
Dalgorithm.txt21 Duplicated strings are found using a hash table. All input strings of
22 length 3 are inserted in the hash table. A hash index is computed for
53 are inserted in the hash table only when no match was found, or
67 inflate() sets up a first level table that covers some number of bits of
69 stream, and looks it up in the table. The table will tell if the next
71 the value, else it will point to the next level table for which inflate()
75 takes to decode and the time it takes to build the table. If building the
76 table took no time (and if you had infinite memory), then there would only
77 be a first level table to cover all the way to the longest code. However,
78 building the table ends up taking a lot longer for more bits since short
[all …]
Dzutil.c212 local ptr_table table[MAX_PTR]; variable
235 table[next_ptr].org_ptr = buf; in zcalloc()
240 table[next_ptr++].new_ptr = buf; in zcalloc()
253 if (ptr != table[n].new_ptr) continue; in zcfree()
255 farfree(table[n].org_ptr); in zcfree()
257 table[n-1] = table[n]; in zcfree()
/device/linaro/bootloader/edk2/EmbeddedPkg/Library/ZLib/
Dinftrees.c32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
36 code FAR * FAR *table;
121 *(*table)++ = here; /* make a table to force an error */
122 *(*table)++ = here;
201 next = *table; /* current table to fill in */
284 (*table)[low].op = (unsigned char)curr;
285 (*table)[low].bits = (unsigned char)root;
286 (*table)[low].val = (unsigned short)(next - *table);
301 *table += used;
Dzutil.c206 local ptr_table table[MAX_PTR]; variable
231 table[next_ptr].org_ptr = buf; in zcalloc()
236 table[next_ptr++].new_ptr = buf; in zcalloc()
252 if (ptr != table[n].new_ptr) continue; in zcfree()
254 farfree(table[n].org_ptr); in zcfree()
256 table[n-1] = table[n]; in zcfree()
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/SmbiosMeasurementDxe/
DSmbiosMeasurementDxe.uni2 // This driver measures SMBIOS table to TPM.
4 …/ This driver calculates SMBIOS table based on default policy and calls TPM interface to measure t…
18 #string STR_MODULE_ABSTRACT #language en-US "This driver measures SMBIOS table to TPM."
20 … "This driver calculates SMBIOS table based on default policy and calls TPM interface to measure t…
/device/linaro/bootloader/edk2/QuarkPlatformPkg/Acpi/AcpiTables/Mcfg/
DMcfg.aslc3 Address Space table (MCFG). Any changes to the number of entries in the table require
5 MCFG defined in this file. The table layout is defined in Mcfg.h and the
6 table contents are defined in the MemoryMappedConfigurationSpaceAccessTable.h.
77 // Reference the table being generated to prevent the optimizer from removing the
/device/linaro/bootloader/edk2/MdeModulePkg/Core/RuntimeDxe/
DRuntimeDxe.uni5 // CalculateCrc32 boot services table, SetVirtualAddressMap & ConvertPointer
6 // runtime services table.
22 …isters the CalculateCrc32 boot services table, and SetVirtualAddressMap and ConvertPointer runtime…
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/
Dsetobject.c42 (so)->table = (so)->smalltable; \
82 setentry *table = so->table; in set_lookkey() local
88 entry = &table[i]; in set_lookkey()
102 if (table == so->table && entry->key == startkey) { in set_lookkey()
120 entry = &table[i & mask]; in set_lookkey()
135 if (table == so->table && entry->key == startkey) { in set_lookkey()
164 setentry *table = so->table; in set_lookkey_string() local
176 entry = &table[i]; in set_lookkey_string()
191 entry = &table[i & mask]; in set_lookkey_string()
253 setentry *table = so->table; in set_insert_clean() local
[all …]

12345678910>>...14