| /hardware/qcom/gps/msm8998/utils/ |
| loc_log.h | 55 #define LOC_TABLE_SIZE(table) (sizeof(table)/sizeof((table)[0]))
58 const char* loc_get_name_from_mask(const loc_name_val_s_type table[], size_t table_size, long mask);
59 const char* loc_get_name_from_val(const loc_name_val_s_type table[], size_t table_size, long value);
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| table.pass.cpp | 14 // const mask* table() const throw();
25 assert(f.table() == f.classic_table());
28 std::ctype<char>::mask table[256]; local
29 std::locale l(std::locale::classic(), new std::ctype<char>(table));
31 assert(f.table() == table);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| table.pass.cpp | 14 // const mask* table() const throw();
25 assert(f.table() == f.classic_table());
28 std::ctype<char>::mask table[256]; local
29 std::locale l(std::locale::classic(), new std::ctype<char>(table));
31 assert(f.table() == table);
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68hc11/ |
| bug-1417.s | 7 tst table
12 ldx #table ; Instruction removed
13 bset 0,x #4 ; Changed to bset *table #4
20 .globl table
21 table: .long 0 label
|
| /external/valgrind/coregrind/ |
| m_hashtable.c | 3 /*--- A separately-chained hash table. m_hashtable.c ---*/
51 Bool iterOK; // table safe to iterate over?
52 const HChar* name; // name of table (for debugging only)
74 VgHashTable *table = VG_(calloc)("hashtable.Hc.1", local
76 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
77 table->n_chains = n_chains;
78 table->n_elements = 0;
79 table->iterOK = True;
80 table->name = name;
82 return table;
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeBasedTableTest.java | 46 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
47 table.put("a", "b", "c");
48 table.put("c", "b", "a");
49 table.put("a", "a", "d");
50 return table.row("b");
54 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
55 table.put("a", "b", "c");
56 table.put("c", "b", "a");
57 table.put("b", "b", "x");
58 table.put("b", "c", "y")
73 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
94 TreeBasedTable<String, Integer, Character> table = local
105 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); local
[all...] |
| /frameworks/base/tools/aapt2/ |
| ResourceTable_test.cpp | 30 ResourceTable table; local
32 EXPECT_FALSE(table.AddResource(
37 EXPECT_FALSE(table.AddResource(
44 ResourceTable table; local
46 EXPECT_TRUE(table.AddResourceAllowMangled(
52 ResourceTable table; local
54 EXPECT_TRUE(table.AddResource(
59 ASSERT_NE(nullptr, test::GetValue<Id>(&table, "android:attr/id"));
63 ResourceTable table; local
69 EXPECT_TRUE(table.AddResource
99 ResourceTable table; local
119 ResourceTable table; local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
| st.c | 1 /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */
58 #define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)((x),(y)) == 0)
60 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)((key))
61 #define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins)
70 Table of prime numbers 2^n+a, 2<=n<=30.
202 st_free_table(table)
[all...] |
| /external/icu/icu4c/source/test/letest/ |
| FontTableCache.cpp | 21 const void *table; member in struct:FontTableCacheEntry
37 fTableCache[i].table = NULL;
45 LE_DELETE_ARRAY(fTableCache[i].table);
48 fTableCache[i].table = NULL;
57 void FontTableCache::freeFontTable(const void *table) const
59 LE_DELETE_ARRAY(table);
67 return fTableCache[i].table;
71 const void *table = readFontTable(tableTag, length); local
73 ((FontTableCache *) this)->add(tableTag, table, length);
75 return table;
[all...] |
| /external/icu/icu4c/source/test/perf/leperf/ |
| FontTableCache.cpp | 23 const void *table; member in struct:FontTableCacheEntry
39 fTableCache[i].table = NULL;
47 LE_DELETE_ARRAY(fTableCache[i].table);
50 fTableCache[i].table = NULL;
59 void FontTableCache::freeFontTable(const void *table) const
61 LE_DELETE_ARRAY(table);
69 return fTableCache[i].table;
73 const void *table = readFontTable(tableTag, length); local
75 ((FontTableCache *) this)->add(tableTag, table, length);
77 return table;
[all...] |
| /external/mesa3d/src/mesa/program/ |
| symbol_table.c | 30 * Link to the next symbol in the table with the same name
39 * Link to the next symbol in the table with the same scope
74 /** Linkage in list of all headers in a given symbol table. */
101 /** Hash table containing all symbols in the symbol table. */
107 /** List of all symbol headers in the table. */
134 check_symbol_table(struct _mesa_symbol_table *table)
139 for (scope = table->current_scope; scope != NULL; scope = scope->next) {
159 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table)
161 struct scope_level *const scope = table->current_scope
458 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local
[all...] |
| /external/skia/tools/lua/ |
| agg_dash.lua | 9 function increment_inner(table, key, value)
10 table[key] = (table[key] or 0) + value
13 function increment(table, tableKey, key, value)
14 if (table[tableKey] == nil) then
15 table[tableKey] = {}
17 increment_inner(table[tableKey], key, value)
|
| /art/runtime/ |
| mapping_table.h | 25 // A utility for processing the raw uleb128 encoded mapping table created by the quick compiler.
32 const uint8_t* table = encoded_table_; variable
33 if (table == nullptr) {
36 return DecodeUnsignedLeb128(&table);
41 const uint8_t* table = encoded_table_; variable
42 if (table == nullptr) {
45 uint32_t total_size = DecodeUnsignedLeb128(&table);
46 uint32_t pc_to_dex_size = DecodeUnsignedLeb128(&table);
52 const uint8_t* table = encoded_table_; local
53 if (table != nullptr)
124 const uint8_t* table = encoded_table_; variable
128 DecodeUnsignedLeb128(&table); \/\/ Total_size, unused. variable
135 const uint8_t* table = encoded_table_; local
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| hash.c | 9 * Entry **newHashTable(); Create and return initialized hash table
67 /* create the hash table and string table for terminals (string table only once) */
75 Entry **table;
local
77 table = (Entry **) calloc(size, sizeof(Entry *));
78 require( table != NULL, "cannot allocate hash table");
82 require( strings != NULL, "cannot allocate string table");
85 return table;
[all...] |
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
| symshift.pl | 3 # "plane" and create combined symbol table
9 # This script creates a symbol table which must be used when
87 and converts into one symbol table with ids in range [0..2^16-1] which
127 foreach $table (@alltables) {
128 $table{$plane{$table}} = $table;
184 foreach $table (@alltables) {
185 #printf STDERR "doing table $table (plane %d)\n", $plane{$table}
[all...] |
| /frameworks/base/tools/aapt2/optimize/ |
| VersionCollapser_test.cpp | 40 std::unique_ptr<ResourceTable> table = BuildTableWithConfigs( local
45 ASSERT_TRUE(collapser.Consume(context.get(), table.get()));
49 test::GetValueForConfig<Id>(table.get(), res_name,
52 test::GetValueForConfig<Id>(table.get(), res_name,
57 test::GetValueForConfig<Id>(table.get(), res_name,
62 test::GetValueForConfig<Id>(table.get(), res_name,
67 test::GetValueForConfig<Id>(table.get(), res_name,
70 test::GetValueForConfig<Id>(table.get(), res_name,
73 test::GetValueForConfig<Id>(table.get(), res_name,
83 std::unique_ptr<ResourceTable> table = BuildTableWithConfigs local
[all...] |
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| TaggedRecord.java | 35 public static void sort(TaggedRecord[] table, int count)
39 TaggedRecord v = table[j];
43 if (vTag.compareTo(table[i].getTag()) >= 0) {
47 table[i + 1] = table[i];
50 table[i + 1] = v;
54 public static int search(TaggedRecord[] table, int count, String tag)
62 if (table[extra].getTag().compareTo(tag) <= 0) {
69 if (table[index + probe].getTag().compareTo(tag) <= 0) {
74 if (table[index].getTag().equals(tag))
[all...] |
| /external/lzma/C/ |
| XzCrc64Opt.c | 8 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
12 UInt64 MY_FAST_CALL XzCrc64UpdateT4(UInt64 v, const void *data, size_t size, const UInt64 *table)
21 table[0x300 + ((d ) & 0xFF)] ^
22 table[0x200 + ((d >> 8) & 0xFF)] ^
23 table[0x100 + ((d >> 16) & 0xFF)] ^
24 table[0x000 + ((d >> 24))];
46 UInt64 MY_FAST_CALL XzCrc64UpdateT1_BeT4(UInt64 v, const void *data, size_t size, const UInt64 *table)
52 table += 0x100;
57 table[0x000 + ((d ) & 0xFF)] ^
58 table[0x100 + ((d >> 8) & 0xFF)] ^
[all...] |
| /frameworks/base/tools/aapt2/link/ |
| ProductFilter_test.cpp | 29 ResourceTable table; local
30 ASSERT_TRUE(table.AddResource(
34 ASSERT_TRUE(table.AddResource(
39 ASSERT_TRUE(table.AddResource(
43 ASSERT_TRUE(table.AddResource(
49 ASSERT_TRUE(filter.Consume(context.get(), &table));
52 &table, "android:string/one", land, ""));
54 &table, "android:string/one", land, "tablet"));
56 &table, "android:string/one", port, ""));
58 &table, "android:string/one", port, "tablet"))
64 ResourceTable table; local
90 ResourceTable table; local
114 ResourceTable table; local
[all...] |
| /toolchain/binutils/binutils-2.25/gas/ |
| hash.c | 1 /* hash.c -- gas hash table code
21 /* This version of the hash table code is a wholescale replacement of
22 the old hash table code, which was fairly bad. This is based on
23 the hash table code in BFD, but optimized slightly for the
25 are stored in the hash table. Instead, it always stores a pointer.
26 The assembler uses the hash table mostly to store symbols, and we
27 don't need to confuse the symbol structure with a hash table
34 /* An entry in a hash table. */
42 table. */
44 /* Pointer being stored in the hash table. *
52 struct hash_entry **table; member in struct:hash_control
[all...] |
| /external/freetype/src/autofit/ |
| afangles.c | 81 /* the following table has been automatically generated with */
188 FT_Pos* table )
198 if ( table[j] >= table[j - 1] )
201 swap = table[j];
202 table[j] = table[j - 1];
203 table[j - 1] = swap;
211 AF_Width table,
229 if ( table[j].org >= table[j - 1].org
[all...] |
| /external/iproute2/ip/ |
| routel | 17 ip route list table "$@" |
26 table=""
40 echo "$network $via $src $proto $scope $dev $table"
57 table=$7;
58 printf(format,network,mask,via,src,proto,scope,dev,table);
|
| /external/e2fsprogs/lib/et/ |
| com_right.c | 53 if (code >= p->table->base && code < p->table->base + p->table->n_msgs)
54 return p->table->msgs[code - p->table->base];
64 if ((code >= p->table->base) &&
65 (code < p->table->base + p->table->n_msgs)) {
66 strncpy(str, p->table->msgs[code - p->table->base], len)
[all...] |
| /external/google-breakpad/src/common/windows/ |
| dia_util.h | 46 // Finds the first table implementing the COM interface with ID |iid| in the
48 // table is found. On success the table will be returned via |table|.
49 bool FindTable(REFIID iid, IDiaSession* session, void** table);
51 // A templated version of FindTable. Finds the first table implementing type
53 // error or if no such table is found. On success the table will be returned via
54 // |table|.
56 bool FindTable(IDiaSession* session, InterfaceType** table) {
[all...] |
| /prebuilts/ndk/r11/sources/android/support/src/musl-ctype/ |
| wcwidth.c | 3 static const unsigned char table[] = { variable
16 if ((table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1)
|
