HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 251 - 275 of 3336) sorted by null

<<11121314151617181920>>

  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elfvsb/
internal1.d 5 Symbol table '.symtab' contains .* entries:
protected0.d 6 Symbol table '.symtab' contains .* entries:
protected1.d 5 Symbol table '.symtab' contains .* entries:
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elfweak/
size2.d 5 Symbol table '.symtab' contains .* entries:
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mmix/
b-widec3.d 6 #error: invalid symbol table: duplicate symbol `Main'
  /external/elfutils/libdw/
dwarf_getmacros.c 74 build_table (Dwarf_Macro_Op_Table *table,
80 table->table[table->opcodes[i - 1] = ct++] = op_protos[i - 1];
82 table->opcodes[i - 1] = 0xff;
91 enum { macinfo_data_size = offsetof (Dwarf_Macro_Op_Table, table[5]) };
131 Dwarf_Macro_Op_Table *table = libdw_alloc (dbg, Dwarf_Macro_Op_Table,
133 memcpy (table, macinfo_data, macinfo_data_size);
135 table->offset = macoff;
136 table->sec_index = IDX_debug_macinfo
248 Dwarf_Macro_Op_Table *table = libdw_alloc (dbg, Dwarf_Macro_Op_Table, local
319 Dwarf_Macro_Op_Table *table = cache_op_table (dbg, sec_index, macoff, local
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/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 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...]
inftrees.h 13 indexed that table entry, or it provides a pointer to another
14 table that indexes more bits of the code. op indicates whether
15 the entry is a pointer to another table, a literal, a length or
16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
23 the current table to the next table. Each entry is four bytes. */
25 unsigned char op; /* operation, extra bits, table bits */
27 unsigned short val; /* offset in table or code value */
32 0000tttt - table link, tttt != 0 is the number of table index bits
    [all...]
  /external/v8/src/ic/
stub-cache.h 46 // Clear the lookup table (@ mark compact collection).
51 // Generate code for probing the stub cache table.
59 enum Table { kPrimary, kSecondary };
61 SCTableReference key_reference(StubCache::Table table) {
63 reinterpret_cast<Address>(&first_entry(table)->key));
66 SCTableReference map_reference(StubCache::Table table) {
68 reinterpret_cast<Address>(&first_entry(table)->map));
71 SCTableReference value_reference(StubCache::Table table)
    [all...]
  /frameworks/base/tools/aapt2/cmd/
Dump.cpp 49 std::unique_ptr<ResourceTable> table; local
69 table = DeserializeTableFromPb(pb_table, Source(file_path), context->GetDiagnostics());
70 if (!table) {
75 if (!table) {
85 table = util::make_unique<ResourceTable>();
86 BinaryResourceParser parser(context, table.get(), Source(file_path), data->data(),
95 if (!table) {
104 // Try as a compiled table.
107 table = DeserializeTableFromPb(pb_table, Source(file_path), context->GetDiagnostics());
110 if (!table) {
    [all...]
  /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/
opcode.cpp 114 spv_result_t spvOpcodeTableNameLookup(const spv_opcode_table table,
118 if (!table) return SPV_ERROR_INVALID_TABLE;
120 // TODO: This lookup of the Opcode table is suboptimal! Binary sort would be
121 // preferable but the table requires sorting on the Opcode name, but it's
125 for (uint64_t opcodeIndex = 0; opcodeIndex < table->count; ++opcodeIndex) {
126 if (nameLength == strlen(table->entries[opcodeIndex].name) &&
127 !strncmp(name, table->entries[opcodeIndex].name, nameLength)) {
129 *pEntry = &table->entries[opcodeIndex];
137 spv_result_t spvOpcodeTableValueLookup(const spv_opcode_table table,
140 if (!table) return SPV_ERROR_INVALID_TABLE
    [all...]
  /external/toolchain-utils/cros_utils/
tabulator_test.py 19 table = ['k1', ['1', '3'], ['55']]
22 result.Compute(cell, table[2], table[1])
23 expected = ' '.join([str(float(v)) for v in table[2]])
28 result.Compute(cell, table[2], table[1])
29 self.assertTrue(cell.value == float(table[2][0]))
83 table = tg.GetTable()
84 header = table.pop(0)
87 row = table.pop(0
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/bsddb/
dbtables.py 15 # This provides a simple database table interface built on top of
117 def _columns_key(table):
118 return table + _columns
121 # these keys are found within table sub databases
123 _data = '._DATA_.' # this+column+this+rowid key contains table data
125 # row in the table. (no data is stored)
129 def _data_key(table, col, rowid):
130 return table + _data + col + _data + rowid
132 def _search_col_data_key(table, col):
133 return table + _data + col + _dat
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/bsddb/
dbtables.py 15 # This provides a simple database table interface built on top of
117 def _columns_key(table):
118 return table + _columns
121 # these keys are found within table sub databases
123 _data = '._DATA_.' # this+column+this+rowid key contains table data
125 # row in the table. (no data is stored)
129 def _data_key(table, col, rowid):
130 return table + _data + col + _data + rowid
132 def _search_col_data_key(table, col):
133 return table + _data + col + _dat
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/
dbtables.py 15 # This provides a simple database table interface built on top of
117 def _columns_key(table):
118 return table + _columns
121 # these keys are found within table sub databases
123 _data = '._DATA_.' # this+column+this+rowid key contains table data
125 # row in the table. (no data is stored)
129 def _data_key(table, col, rowid):
130 return table + _data + col + _data + rowid
132 def _search_col_data_key(table, col):
133 return table + _data + col + _dat
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/
dbtables.py 15 # This provides a simple database table interface built on top of
117 def _columns_key(table):
118 return table + _columns
121 # these keys are found within table sub databases
123 _data = '._DATA_.' # this+column+this+rowid key contains table data
125 # row in the table. (no data is stored)
129 def _data_key(table, col, rowid):
130 return table + _data + col + _data + rowid
132 def _search_col_data_key(table, col):
133 return table + _data + col + _dat
    [all...]
  /cts/apps/CtsVerifier/assets/report/
compatibility_result.css 26 table.title {
34 table.summary {
42 table.summary th {
48 table.summary td {
57 table.testsummary {
64 table.testsummary th {
70 table.testsummary td {
76 table.testdetails {
88 table.testdetails th {
97 table.testdetails td
    [all...]
  /system/netd/server/
RouteController.cpp 159 void addTableName(uint32_t table, const std::string& name, std::string* contents) {
161 snprintf(tableString, sizeof(tableString), "%u", table);
207 // + If |table| is non-zero, the rule points at the specified routing table. Otherwise, the table is
208 // unspecified. An unspecified table is not allowed when creating an FR_ACT_TO_TBL rule.
218 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif,
249 // Note that here we're implicitly setting rule.table to 0. When we want to specify a
250 // non-zero table, we do this via the FRATTR_TABLE attribute.
253 // Don't ever create a rule that looks up table 0, because table 0 is the local table
579 uint32_t table = getRouteTableForInterface(physicalInterface); local
645 uint32_t table = getRouteTableForInterface(interface); local
711 uint32_t table = getRouteTableForInterface(interface); local
751 uint32_t table = getRouteTableForInterface(interface); local
789 uint32_t table = getRouteTableForInterface(interface); local
809 uint32_t table = getRouteTableForInterface(outputInterface); local
823 uint32_t table; local
895 uint32_t table = getRouteTableForInterface(interface); local
    [all...]
  /external/freetype/src/sfnt/
ttload.c 45 /* Looks for a TrueType table by name. */
53 /* A pointer to the table directory entry. 0 if not found. */
84 FT_TRACE4(( "found table.\n" ));
95 FT_TRACE4(( "ignoring empty table\n" ));
97 FT_TRACE4(( "could not find table\n" ));
110 /* Looks for a TrueType table by name, then seek a stream to it. */
117 /* stream :: The stream to seek when the table is found. */
120 /* length :: The length of the table if found, undefined otherwise. */
131 TT_Table table; local
135 table = tt_face_lookup_table( face, tag )
198 TT_TableRec table; local
548 TT_Table table; local
811 TT_NameTable table; local
999 TT_NameTable table = &face->name_table; local
    [all...]
  /external/mesa3d/src/mapi/glapi/
glapi_getproc.c 52 * Search the table of static entrypoint functions for the named function
76 * Return dispatch table offset of the named static (built-in) function.
119 * table. For debugging only.
163 * Offset in the dispatch table where the pointer to the real function is
165 * added to the dispatch table, this will have the value ~0.
344 * The offset in the dispatch table of the named function. A pointer to the
484 * Return offset of entrypoint for named function within dispatch table.
566 * GL API table functions.
571 * Return size of dispatch table struct as number of functions (or
578 * The dispatch table size (number of entries) is the size of th
    [all...]
  /toolchain/binutils/binutils-2.25/bfd/
elf-strtab.c 29 /* An entry in the strtab hash table. */
45 /* The strtab hash table. */
49 struct bfd_hash_table table; member in struct:elf_strtab_hash
64 struct bfd_hash_table *table,
71 bfd_hash_allocate (table, sizeof (struct elf_strtab_hash_entry));
76 entry = bfd_hash_newfunc (entry, table, string);
92 /* Create a new hash table. */
97 struct elf_strtab_hash *table; local
100 table = (struct elf_strtab_hash *) bfd_malloc (amt);
101 if (table == NULL
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
inftrees.h 13 indexed that table entry, or it provides a pointer to another
14 table that indexes more bits of the code. op indicates whether
15 the entry is a pointer to another table, a literal, a length or
16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
23 the current table to the next table. Each entry is four bytes. */
25 unsigned char op; /* operation, extra bits, table bits */
27 unsigned short val; /* offset in table or code value */
32 0000tttt - table link, tttt != 0 is the number of table index bits
    [all...]
  /external/bison/src/
tables.h 128 extern base_number *table;
130 /* The value used in TABLE to denote explicit syntax errors
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
CRLReason.java 91 private static final Hashtable table = new Hashtable(); field in class:CRLReason
144 if (!table.containsKey(idx))
146 table.put(idx, new CRLReason(value));
149 return (CRLReason)table.get(idx);
  /external/clang/test/Analysis/
malloc-sizeof.c 41 int *table = malloc(sizeof sTable); local
45 return table;
50 int *table = malloc(sizeof sTable); // expected-warning {{Result of 'malloc' is converted to a pointer of type 'int', which is incompatible with sizeof operand type 'const double [10]'}} local
51 return table;

Completed in 953 milliseconds

<<11121314151617181920>>