| /external/mesa3d/src/mapi/ |
| mapi_glapi.c | 33 #include "table.h" /* for MAPI_TABLE_NUM_SLOTS */
72 * Return size of dispatch table struct as number of functions (or
100 * The offset in the dispatch table of the named function. A pointer to the
194 * Return offset of entrypoint for named function within dispatch table.
226 /** Return pointer to new dispatch table filled with no-op functions */
230 struct _glapi_table *table; local
235 table = malloc(num_entries * sizeof(mapi_func));
236 if (table) {
237 memcpy(table, table_noop_array, num_entries * sizeof(mapi_func));
239 return table;
[all...] |
| /external/sfntly/cpp/src/sfntly/table/core/ |
| horizontal_device_metrics_table.cc | 17 #include "sfntly/table/core/horizontal_device_metrics_table.h"
76 : Table(header, data), num_glyphs_(num_glyphs) {
96 FontDataTablePtr table = new HorizontalDeviceMetricsTable(header(), data, local
98 return table.Detach();
109 HorizontalDeviceMetricsTable* table = local
111 if (table) {
112 table->num_glyphs_ = num_glyphs;
|
| /external/skia/bench/ |
| FontCacheBench.cpp | 80 char table[kMaxHashCount]; local
81 sk_bzero(table, sizeof(table));
86 collisions += table[index];
87 table[index] = 1;
|
| /external/skqp/bench/ |
| FontCacheBench.cpp | 80 char table[kMaxHashCount]; local
81 sk_bzero(table, sizeof(table));
86 collisions += table[index];
87 table[index] = 1;
|
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/codecs/vc1/parser/ |
| vc1parse_ppic.c | 20 * Table 19 of SMPTE 421M after processing up to PTYPE for P picture.
27 const uint8_t *table; local
65 table = VC1_MVMODE_LOW_TBL;
67 table = VC1_MVMODE_HIGH_TBL;
78 picLayerHeader->MVMODE = table[bit_count];
91 picLayerHeader->MVMODE2 = table[bit_count];
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/unicode/ |
| makeunicodedata.py | 10 # 2000-09-25 fl merged tim's splitbin fixes, separate decomposition table
11 # 2000-09-25 fl added character type table
80 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":
[all...] |
| /external/python/cpython2/Tools/unicode/ |
| makeunicodedata.py | 10 # 2000-09-25 fl merged tim's splitbin fixes, separate decomposition table
11 # 2000-09-25 fl added character type table
80 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"
[all...] |
| /external/iptables/iptables/ |
| nft.c | 41 #include <libnftnl/table.h>
274 struct nftnl_table *table; member in union:obj_update::__anon22452
539 printf("DEBUG: table: %s\n", tmp);
575 nft_chain_builtin_alloc(struct builtin_table *table,
584 nftnl_chain_set(c, NFTNL_CHAIN_TABLE, (char *)table->name);
618 struct builtin_table *table,
623 c = nft_chain_builtin_alloc(table, chain, NF_ACCEPT);
633 /* find if built-in table already exists */
635 nft_table_builtin_find(struct nft_handle *h, const char *table)
644 if (strcmp(h->tables[i].name, table) != 0
1748 const char *table = local
2486 } table[] = local
2543 struct nftnl_table *table; local
2809 const char *table = nftnl_chain_get(chain, NFTNL_CHAIN_TABLE); local
2842 struct nftnl_table *table; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| CatchStructs.java | 49 * {@code null-ok;} the underlying table; set in
52 private CatchTable table; field in class:CatchStructs
79 this.table = null;
89 if (table == null) {
90 table = code.getCatches();
101 return table.size();
123 int size = table.size();
132 handlerOffsets.put(table.get(i).getHandlers(), null);
202 int tableSize = table.size();
204 CatchTable.Entry one = table.get(i)
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| CatchStructs.java | 46 * {@code null-ok;} the underlying table; set in
49 private CatchTable table; field in class:CatchStructs
76 this.table = null;
86 if (table == null) {
87 table = code.getCatches();
98 return table.size();
120 int size = table.size();
129 handlerOffsets.put(table.get(i).getHandlers(), null);
199 int tableSize = table.size();
201 CatchTable.Entry one = table.get(i)
[all...] |
| /external/icu/icu4c/source/test/letest/ |
| FontObject.cpp | 57 void FontObject::deleteTable(void *table)
59 delete[] (char *) table;
64 le_uint16 table = 0; local
68 table = rangeShift;
74 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
75 table += probe;
79 if (SWAPL(directory->tableDirectory[table].tag) == tag) {
80 return &directory->tableDirectory[table];
97 void *table = new char[*length]; local
100 fread(table, sizeof(char), *length, file)
[all...] |
| /external/icu/icu4c/source/test/perf/leperf/ |
| FontObject.cpp | 61 void FontObject::deleteTable(void *table)
63 delete[] (char *) table;
68 le_uint16 table = 0; local
72 table = rangeShift;
78 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
79 table += probe;
83 if (SWAPL(directory->tableDirectory[table].tag) == tag) {
84 return &directory->tableDirectory[table];
101 void *table = new char[*length]; local
104 fread(table, sizeof(char), *length, file)
[all...] |
| /external/mesa3d/src/amd/common/ |
| sid_tables.py | 39 self.table = []
44 for te in self.table:
51 self.table.append((string, idx, set((idx,))))
67 for te in self.table
82 self.table = []
90 idx = self.table.index(array[0], idx, len(self.table) - len(array) + 1)
93 if array[i] != self.table[idx + i]:
103 idx = len(self.table)
104 self.table += arra
[all...] |
| /external/mesa3d/src/mesa/main/ |
| get_hash_generator.py | 81 def print_table(api, table):
84 # convert sparse (index, value) table into a dense table
86 for i, v in table:
98 for table in tables:
99 print_table(table["apis"][0], table["indices"])
102 for table in tables:
103 tname = table_name(table["apis"][0])
104 for api in table["apis"]
[all...] |
| /external/syslinux/com32/lib/zlib/ |
| inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
36 code FAR * FAR *table;
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
47 unsigned used; /* code entries in table used *
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| opcode.cpp | 115 spv_result_t spvOpcodeTableNameLookup(const spv_opcode_table table,
119 if (!table) return SPV_ERROR_INVALID_TABLE;
121 // TODO: This lookup of the Opcode table is suboptimal! Binary sort would be
122 // preferable but the table requires sorting on the Opcode name, but it's
126 for (uint64_t opcodeIndex = 0; opcodeIndex < table->count; ++opcodeIndex) {
127 if (nameLength == strlen(table->entries[opcodeIndex].name) &&
128 !strncmp(name, table->entries[opcodeIndex].name, nameLength)) {
130 *pEntry = &table->entries[opcodeIndex];
138 spv_result_t spvOpcodeTableValueLookup(const spv_opcode_table table,
141 if (!table) return SPV_ERROR_INVALID_TABLE
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| zutil.c | 208 local ptr_table table[MAX_PTR];
variable
209 /* This table is used to remember the original form of pointers
211 * Since MSDOS is not a preemptive multitasking OS, this table is not
231 table[next_ptr].org_ptr = buf;
236 table[next_ptr++].new_ptr = buf;
249 if (ptr != table[n].new_ptr) continue;
251 farfree(table[n].org_ptr);
253 table[n-1] = table[n];
|
| /external/autotest/frontend/client/src/autotest/tko/ |
| TkoUtils.java | 7 import autotest.common.table.RpcDataSource;
8 import autotest.common.table.DataSource.Query;
83 static int addControlRow(FlexTable table, String text, Widget control) {
84 int row = table.getRowCount();
85 table.setText(row, 0, text);
86 table.getFlexCellFormatter().setStylePrimaryName(row, 0, "field-name");
87 table.setWidget(row, 1, control);
|
| /external/elfutils/libelf/ |
| nlist.c | 69 struct nlist_fshash *table; local
92 /* Find a symbol table. We prefer the real symbol table but if it
93 does not exist use the dynamic symbol table. */
117 table. */
135 /* Create the hash table. */
136 table = nlist_fshash_init (nsyms);
137 if (table == NULL)
163 /* And add it to the hash table. Note that we are using the
170 (void) nlist_fshash_overwrite (table, mem.str, 0, &mem)
[all...] |
| /external/harfbuzz_ng/src/ |
| main.cc | 29 #include "hb-ot-layout-gdef-table.hh"
99 printf (" %d table(s) found in font\n", num_tables);
101 const OpenTypeTable &table = font.get_table (n_table); local
102 printf (" Table %2d of %2d: %.4s (0x%08x+0x%08x)\n", n_table, num_tables,
103 (const char *)table.tag,
104 (unsigned int) table.offset,
105 (unsigned int) table.length);
107 switch (table.tag) {
113 const GSUBGPOS &g = *CastP<GSUBGPOS> (font_data + table.offset);
116 printf (" %d script(s) found in table\n", num_scripts)
[all...] |
| /external/protobuf/ruby/ext/google/protobuf_c/ |
| map.c | 152 for (upb_strtable_begin(&it, &self->table);
164 upb_strtable_uninit(&self->table);
251 // Table value type is always UINT64: this ensures enough space to store the
253 if (!upb_strtable_init(&self->table, UPB_CTYPE_UINT64)) {
254 rb_raise(rb_eRuntimeError, "Could not allocate table.");
276 for (upb_strtable_begin(&it, &self->table);
306 for (upb_strtable_begin(&it, &self->table);
330 for (upb_strtable_begin(&it, &self->table);
362 if (upb_strtable_lookup2(&self->table, keyval, length, &v)) {
392 upb_strtable_remove2(&self->table, keyval, length, NULL)
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Hashtable.java | 35 * This class implements a hash table, which maps keys to values. Any
44 * <i>capacity</i> is the number of <i>buckets</i> in the hash table, and the
45 * <i>initial capacity</i> is simply the capacity at the time the hash table
46 * is created. Note that the hash table is <i>open</i>: in the case of a "hash
49 * table is allowed to get before its capacity is automatically increased.
69 * automatic rehashing as needed to grow the table. <p>
135 * The hash table data.
137 private transient HashtableEntry<?,?>[] table; field in class:Hashtable
140 * The total number of entries in the hash table.
145 * The table is rehashed when its size exceeds this threshold. (Th
1334 HashtableEntry<?,?>[] table = Hashtable.this.table; field in class:Hashtable.Enumerator
[all...] |
| /art/runtime/gc/accounting/ |
| mod_union_table_test.cc | 76 // inside the card cache mod-union table and causes the check
77 // ASSERT_FALSE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj3)));
117 // A mod union table that only holds references to a specified target space.
153 name << "Mod union table: " << type;
194 std::unique_ptr<ModUnionTable> table(ModUnionTableFactory::Create(
196 ASSERT_TRUE(table.get() != nullptr);
218 table->ProcessCards();
221 table->UpdateAndMarkReferences(&collector_before);
227 // obj1, obj2 cards should still be in mod union table since they have references to other
229 ASSERT_TRUE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj1)))
[all...] |
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/ |
| TableTest.java | 12 package org.jacoco.report.internal.html.table;
40 * Unit tests for {@link Table}.
54 private Table table; field in class:TableTest
64 table = new Table();
107 table.add("Header", null, recorder, false);
108 table.render(body, items, createTotal("Sum", 6), resources, root);
137 table.add("Header", null, column, false);
138 table.render(body, items, createTotal("Sum", 1), resources, root)
[all...] |
| /external/perfetto/src/ftrace_reader/ |
| ftrace_config_muxer_unittest.cc | 151 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
156 FtraceConfigMuxer model(&ftrace, table.get());
188 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
193 FtraceConfigMuxer model(&ftrace, table.get());
203 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
210 FtraceConfigMuxer model(&ftrace, table.get());
234 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
238 FtraceConfigMuxer model(&ftrace, table.get());
263 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
265 std::set<std::string> events = GetFtraceEvents(config, table.get())
272 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
283 std::unique_ptr<ProtoTranslationTable> table = CreateFakeTable(); local
[all...] |
