HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 376 - 400 of 3741) sorted by null

<<11121314151617181920>>

  /external/freetype/src/gzip/
zutil.c 75 local ptr_table table[MAX_PTR]; variable
76 /* This table is used to remember the original form of pointers
78 * Since MSDOS is not a preemptive multitasking OS, this table is not
98 table[next_ptr].org_ptr = buf;
103 table[next_ptr++].new_ptr = buf;
116 if (ptr != table[n].new_ptr) continue;
118 farfree(table[n].org_ptr);
120 table[n-1] = table[n];
  /external/lzma/C/
7zCrc.c 18 UInt32 MY_FAST_CALL CrcUpdateT1_BeT4(UInt32 v, const void *data, size_t size, const UInt32 *table);
19 UInt32 MY_FAST_CALL CrcUpdateT1_BeT8(UInt32 v, const void *data, size_t size, const UInt32 *table);
23 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table);
24 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table);
27 typedef UInt32 (MY_FAST_CALL *CRC_FUNC)(UInt32 v, const void *data, size_t size, const UInt32 *table);
45 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
47 UInt32 MY_FAST_CALL CrcUpdateT1(UInt32 v, const void *data, size_t size, const UInt32 *table)
  /external/perfetto/src/ftrace_reader/
proto_translation_table_unittest.cc 103 auto table = ProtoTranslationTable::Create( local
105 const Field& pid_field = table->common_fields().at(0);
112 auto event = table->GetEventByName("sched_switch");
121 auto event = table->GetEventByName("sched_wakeup");
130 auto event = table->GetEventByName("cpufreq_interactive_target");
139 auto event = table->GetEventByName("ext4_da_write_begin");
223 auto table = ProtoTranslationTable::Create(&ftrace, std::move(events), local
225 EXPECT_EQ(table->largest_id(), 42ul);
226 EXPECT_EQ(table->EventNameToFtraceId("foo"), 42ul);
227 EXPECT_EQ(table->EventNameToFtraceId("bar"), 0ul)
    [all...]
ftrace_config_muxer.cc 48 void AddEventGroup(const ProtoTranslationTable* table,
51 const std::vector<const Event*>* events = table->GetEventsByGroup(group);
61 const ProtoTranslationTable* table) {
74 AddEventGroup(table, "mdss", &events);
75 AddEventGroup(table, "sde", &events);
85 AddEventGroup(table, "cgroup", &events);
90 AddEventGroup(table, "irq", &events);
91 AddEventGroup(table, "ipi", &events);
108 AddEventGroup(table, "i2c", &events);
125 AddEventGroup(table, "memory_bus", &events)
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/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...]
  /device/linaro/bootloader/edk2/EmbeddedPkg/Library/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...]
  /external/freetype/src/gxvalid/
gxvmort1.c 5 /* TrueTypeGX/AAT mort table validation */
55 gxv_mort_subtable_type1_substitutionTable_load( FT_Bytes table,
59 FT_Bytes p = table;
139 FT_Bytes table,
151 FT_UNUSED( table );
183 gxv_mort_subtable_type1_substTable_validate( FT_Bytes table,
187 FT_Bytes p = table;
225 gxv_mort_subtable_type1_validate( FT_Bytes table,
229 FT_Bytes p = table;
252 table + st_rec.substitutionTable
    [all...]
gxvmorx5.c 5 /* TrueTypeGX/AAT morx table validation */
48 * this offset to the table is different from mort type5).
66 gxv_morx_subtable_type5_insertionGlyphList_load( FT_Bytes table,
70 FT_Bytes p = table;
115 FT_Bytes table,
119 FT_Bytes p = table + table_index * 2;
125 while ( p < table + count * 2 + table_index * 2 )
145 FT_Bytes table,
183 table, limit,
189 table, limit
    [all...]
gxvkern.c 5 /* TrueTypeGX/AAT kern table validation (body). */
110 gxv_kern_subtable_fmt0_pairs_validate( FT_Bytes table,
115 FT_Bytes p = table;
172 gxv_kern_subtable_fmt0_validate( FT_Bytes table,
176 FT_Bytes p = table + GXV_KERN_SUBTABLE_HEADER_SIZE;
210 gxv_kern_subtable_fmt1_valueTable_load( FT_Bytes table,
214 FT_Bytes p = table;
259 * passed table & limit are of whole StateTable, not including subtables
266 FT_Bytes table,
299 p = table + valueOffset
    [all...]
  /external/python/cpython2/Modules/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...]
  /external/python/cpython3/Modules/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...]
  /external/zlib/src/
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...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/
ApplicationAttributesPart.java 98 Composite table = getTable(); local
99 if (table == null || managedForm == null) {
104 for (Control c : table.getChildren()) {
129 ui_attr.createUiControl(table, managedForm);
141 createLabel(table, managedForm.getToolkit(),
165 Composite table = getTable(); local
167 if (table != null && table.getEnabled() != exists) {
168 table.setEnabled(exists);
169 for (Control c : table.getChildren())
    [all...]
  /toolchain/binutils/binutils-2.27/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...]
  /toolchain/binutils/binutils-2.27/opcodes/
i386-gen.c 835 output_cpu_flags (FILE *table, bitfield *flags, unsigned int size,
840 fprintf (table, "%s{ { ", indent);
845 fprintf (table, "%d, ", flags[i].value);
847 fprintf (table, "%d,", flags[i].value);
852 fprintf (table, " \\\n %s", indent);
854 fprintf (table, "\n %s", indent);
858 fprintf (table, "%d } }%s\n", flags[i].value, comma);
862 process_i386_cpu_flag (FILE *table, char *flag, int macro,
922 output_cpu_flags (table, flags, ARRAY_SIZE (flags), macro,
927 output_opcode_modifier (FILE *table, bitfield *modifier, unsigned int size
1428 FILE *table; local
    [all...]
  /external/autotest/database/
db_utils.py 32 @param mapping a dictionary of orig_name => new_name. Any table not matching
35 check_exists(manager, (table for table, _ in mapping.iteritems()),
38 manager.execute('RENAME TABLE `%s` TO `%s`' % (orig_name, new_name))
45 If a table does not exist in the source database, this method fails without
53 for table in tables:
54 manager.execute('RENAME TABLE `%(db)s`.`%(table)s` TO `%(table)s`'
55 % dict(db=src_manager.get_db_name(), table=table)
    [all...]
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
SignerInformationStore.java 16 private Map table = new HashMap(); field in class:SignerInformationStore
31 table.put(sid, all);
49 List list = (ArrayList)table.get(sid);
53 table.put(sid, list);
128 List list = (ArrayList)table.get(selector);
  /external/guava/
javadoc-stylesheet.css 61 table tr td dt code {
334 table tr td dl, table tr td dl dt, table tr td dl dd {
339 Table styles
341 .contentContainer table, .classUseContainer table, .constantValuesContainer table {
345 .contentContainer ul li table, .classUseContainer ul li table, .constantValuesContainer ul li table
    [all...]
  /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/page/
PageTestBase.java 28 import org.jacoco.report.internal.html.table.LabelColumn;
29 import org.jacoco.report.internal.html.table.Table;
49 final Table table = new Table(); local
50 table.add("Element", null, new LabelColumn(), true);
61 public Table getTable() {
62 return table;
  /external/libjpeg-turbo/java/doc/
stylesheet.css 61 table tr td dt code {
334 table tr td dl, table tr td dl dt, table tr td dl dd {
339 Table styles
341 .contentContainer table, .classUseContainer table, .constantValuesContainer table {
345 .contentContainer ul li table, .classUseContainer ul li table, .constantValuesContainer ul li table
    [all...]
  /hardware/qcom/msm8998/json-c/
linkhash.h 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member in struct:lh_table
159 #define lh_foreach(table, entry) \
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table
    [all...]
  /external/libexif/libexif/olympus/
mnote-olympus-tag.c 34 } table[] = { variable in typeref:struct:__anon24793
148 {MNOTE_OLYMPUS_TAG_INTERNALFLASHTABLE, "InternalFlashTable", N_("Internal Flash Table"), ""},
201 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
202 if (table[i].tag == t) return (table[i].name);
212 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
213 if (table[i].tag == t) return (_(table[i].title))
    [all...]
  /frameworks/wilhelm/tests/examples/
xaVideoDecoderCapabilities.cpp 57 // Use a table of [integer, string] entries to map an integer to a string
64 const char *id_to_string(XAuint32 id, const id_to_string_t *table, size_t numEntries)
68 if (id == table[i].id) {
69 return table[i].string;
75 // Use a table of [integer, table] entries to map a pair of integers to a string
83 const char *id_pair_to_string(XAuint32 id1, XAuint32 id2, const id_pair_to_string_t *table,
88 if (id1 == table[i].id1) {
89 return id_to_string(id2, table[i].id2_table, table[i].id2_numEntries)
148 static const id_pair_to_string_t table[] = { local
212 static const id_pair_to_string_t table[] = { local
    [all...]
  /external/vulkan-validation-layers/scripts/
loader_extension_generator.py 92 # Generates dispatch table helper header files for LVL
94 """Generate dispatch table helper header based on XML element attributes"""
268 # Determine if this API should be ignored or added to the instance or device dispatch table
377 protos += '// Dispatch table properly filled in with appropriate terminators for the\n'
387 protos += '// Init Device function pointer dispatch table with core commands\n'
391 protos += '// Init Device function pointer dispatch table with extension commands\n'
395 protos += '// Init Instance function pointer dispatch table with core commands\n'
396 protos += 'VKAPI_ATTR void VKAPI_CALL loader_init_instance_core_dispatch_table(VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa,\n'
399 protos += '// Init Instance function pointer dispatch table with core commands\n'
400 protos += 'VKAPI_ATTR void VKAPI_CALL loader_init_instance_extension_dispatch_table(VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa,\n
    [all...]
  /external/autotest/client/tools/
html_report.py 64 table.meta_table
77 table.meta_table td
87 table.stats
100 table.stats td{
109 table.stats th{
117 table.stats td.top{
127 table.stats th.table-sorted-asc{
133 table.stats th.table-sorted-desc
    [all...]

Completed in 950 milliseconds

<<11121314151617181920>>