| /external/libcxx/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);
|
| /hardware/qcom/gps/msm8909/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);
|
| /hardware/qcom/gps/msm8909w_3100/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);
|
| /hardware/qcom/gps/msm8996/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);
|
| /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/r16/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);
|
| /system/chre/apps/wifi_offload/include/chre/apps/wifi_offload/ |
| flatbuffers_types.fbs | 20 table Ssid {
28 table PreferredNetwork {
38 table ScanResult {
51 table ScanResultMessage {
58 table ScanParams {
68 table ScanFilter {
76 table ScanConfig {
84 table ScanRecord {
96 table RpcLogRecord {
104 table ScanStats
[all...] |
| /toolchain/binutils/binutils-2.27/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/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_combine_constants.cpp | 141 struct table { struct
148 find_imm(struct table *table, float val)
150 for (int i = 0; i < table->len; i++) {
151 if (table->imm[i].val == val) {
152 return &table->imm[i];
159 new_imm(struct table *table, void *mem_ctx)
161 if (table->len == table->size)
198 struct table table; local
[all...] |
| /external/freetype/src/gxvalid/ |
| gxvalid.h | 5 /* TrueTypeGX/AAT table validation (specification only). */
44 gxv_feat_validate( FT_Bytes table,
50 gxv_bsln_validate( FT_Bytes table,
56 gxv_trak_validate( FT_Bytes table,
61 gxv_just_validate( FT_Bytes table,
66 gxv_mort_validate( FT_Bytes table,
71 gxv_morx_validate( FT_Bytes table,
76 gxv_kern_validate( FT_Bytes table,
81 gxv_kern_validate_classic( FT_Bytes table,
87 gxv_opbd_validate( FT_Bytes table,
[all...] |
| /external/valgrind/include/ |
| pub_tool_hashtable.h | 3 /*--- A hash table implementation. pub_tool_hashtable.h ---*/
36 /* Generic type for a separately-chained hash table. Via a kind of dodgy
54 /* Make a new table. Allocates the memory with VG_(calloc)(), so can
55 be freed with VG_(free)(). The table starts small but will
60 /* Count the number of nodes in a table. */
61 extern UInt VG_(HT_count_nodes) ( const VgHashTable *table );
63 /* Add a node to the table. Duplicate keys are permitted. */
66 /* Looks up a VgHashNode by key in the table.
70 extern void* VG_(HT_lookup) ( const VgHashTable *table, UWord key );
72 /* Removes a VgHashNode by key from the table. Returns NULL if not found. *
[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...] |
| /external/libxkbcommon/xkbcommon/test/ |
| atom.c | 29 #define INTERN_LITERAL(table, literal) \
30 atom_intern(table, literal, sizeof(literal) - 1, false)
32 #define LOOKUP_LITERAL(table, literal) \
33 atom_lookup(table, literal, sizeof(literal) - 1)
69 struct atom_table *table; local
75 table = atom_table_new();
76 assert(table);
87 atom = atom_lookup(table, arr[i].string, arr[i].len);
89 string = atom_text(table, atom);
108 arr[i].atom = atom_intern(table, arr[i].string, arr[i].len, false)
150 struct atom_table *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/mesa3d/src/gallium/drivers/swr/rasterizer/memory/ |
| LoadTile.h | 174 static INLINE void InitLoadTileColorTable(PFN_LOAD_TILES (&table)[NUM_SWR_FORMATS])
176 memset(table, 0, sizeof(table));
178 table[R32G32B32A32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_FLOAT, R32G32B32A32_FLOAT>::Load;
179 table[R32G32B32A32_SINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_SINT, R32G32B32A32_FLOAT>::Load;
180 table[R32G32B32A32_UINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_UINT, R32G32B32A32_FLOAT>::Load;
181 table[R32G32B32X32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32X32_FLOAT, R32G32B32A32_FLOAT>::Load;
182 table[R32G32B32A32_SSCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_SSCALED, R32G32B32A32_FLOAT>::Load;
183 table[R32G32B32A32_USCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_USCALED, R32G32B32A32_FLOAT>::Load;
184 table[R32G32B32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 96>, R32G32B32_FLOAT, R32 (…)
[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/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)
|
| /external/skqp/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...] |
| /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/freetype/src/otvalid/ |
| otvgsub.c | 5 /* OpenType GSUB table validation (body). */
44 otv_SingleSubst_validate( FT_Bytes table,
47 FT_Bytes p = table;
68 Coverage = table + FT_NEXT_USHORT( p );
94 otv_Coverage_validate( table + Coverage,
126 otv_MultipleSubst_validate( FT_Bytes table,
129 FT_Bytes p = table;
145 OTV_RUN( table, otvalid );
167 otv_AlternateSubst_validate( FT_Bytes table,
170 FT_Bytes p = table;
[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 | 10 #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 #define CRC_UPDATE_BYTE_2_BE(crc, b) (table[(Byte)((crc) >> 56) ^ (b)] ^ ((crc) << 8))
48 UInt64 MY_FAST_CALL XzCrc64UpdateT1_BeT4(UInt64 v, const void *data, size_t size, const UInt64 *table)
51 table += 0x100;
59 ^ table[0x000 + ((d ) & 0xFF)]
[all...] |
