| /external/vulkan-validation-layers/layers/generated/ |
| D | vk_dispatch_table_helper.h | 395 static inline void layer_init_device_dispatch_table(VkDevice device, VkLayerDispatchTable *table, P… in layer_init_device_dispatch_table() argument
396 memset(table, 0, sizeof(*table)); in layer_init_device_dispatch_table()
398 table->GetDeviceProcAddr = gpa; in layer_init_device_dispatch_table()
399 table->DestroyDevice = (PFN_vkDestroyDevice) gpa(device, "vkDestroyDevice"); in layer_init_device_dispatch_table()
400 table->GetDeviceQueue = (PFN_vkGetDeviceQueue) gpa(device, "vkGetDeviceQueue"); in layer_init_device_dispatch_table()
401 table->QueueSubmit = (PFN_vkQueueSubmit) gpa(device, "vkQueueSubmit"); in layer_init_device_dispatch_table()
402 table->QueueWaitIdle = (PFN_vkQueueWaitIdle) gpa(device, "vkQueueWaitIdle"); in layer_init_device_dispatch_table()
403 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle) gpa(device, "vkDeviceWaitIdle"); in layer_init_device_dispatch_table()
404 table->AllocateMemory = (PFN_vkAllocateMemory) gpa(device, "vkAllocateMemory"); in layer_init_device_dispatch_table()
405 table->FreeMemory = (PFN_vkFreeMemory) gpa(device, "vkFreeMemory"); in layer_init_device_dispatch_table()
[all …]
|
| /external/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyRuntimeLibcallSignatures.cpp | 14 /// table providing type signatures for all runtime library functions that LLVM
97 std::vector<RuntimeLibcallSignature> Table; member
100 RuntimeLibcallSignatureTable() : Table(RTLIB::UNKNOWN_LIBCALL, unsupported) { in RuntimeLibcallSignatureTable()
102 Table[RTLIB::SHL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
103 Table[RTLIB::SHL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
104 Table[RTLIB::SHL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
105 Table[RTLIB::SHL_I128] = i64_i64_func_i64_i64_i32; in RuntimeLibcallSignatureTable()
106 Table[RTLIB::SRL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
107 Table[RTLIB::SRL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
108 Table[RTLIB::SRL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyRuntimeLibcallSignatures.cpp | 14 /// table providing type signatures for all runtime library functions that LLVM
96 std::vector<RuntimeLibcallSignature> Table; member
99 RuntimeLibcallSignatureTable() : Table(RTLIB::UNKNOWN_LIBCALL, unsupported) { in RuntimeLibcallSignatureTable()
101 Table[RTLIB::SHL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
102 Table[RTLIB::SHL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
103 Table[RTLIB::SHL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
104 Table[RTLIB::SHL_I128] = i64_i64_func_i64_i64_i32; in RuntimeLibcallSignatureTable()
105 Table[RTLIB::SRL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
106 Table[RTLIB::SRL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
107 Table[RTLIB::SRL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | hash.c | 3 * Generic hash table.
46 * Create a new hash table.
48 * \return pointer to a new, empty hash table.
53 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); in _mesa_NewHashTable() local
55 if (table) { in _mesa_NewHashTable()
56 table->ht = _mesa_hash_table_create(NULL, uint_key_hash, in _mesa_NewHashTable()
58 if (table->ht == NULL) { in _mesa_NewHashTable()
59 free(table); in _mesa_NewHashTable()
64 _mesa_hash_table_set_deleted_key(table->ht, uint_key(DELETED_KEY_VALUE)); in _mesa_NewHashTable()
69 mtx_init(&table->Mutex, mtx_recursive); in _mesa_NewHashTable()
[all …]
|
| /external/mesa3d/src/glx/tests/ |
| D | indirect_api.cpp | 28 * Tests various apsects of the dispatch table generated by
31 * * No entry in the table should be \c NULL.
33 * * Entries in the table that correspond to "known" functions with GLX
36 * * Entries beyond the end of the "known" part of the table (i.e., entries
40 * * Entries in the table that correspond to "known" functions that lack
414 … target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const GLvoid *table) { } in __indirect_glColorTable() argument
429 void __indirect_glGetColorTable(GLenum target, GLenum format, GLenum type, GLvoid *table) { } in __indirect_glGetColorTable() argument
715 _glapi_proc *table; member in IndirectAPI
721 this->table = (_glapi_proc *) __glXNewIndirectAPI(); in SetUp()
727 free(this->table); in TearDown()
[all …]
|
| /external/libxml2/ |
| D | hash.c | 52 * A single entry in the hash table
66 * The entire hash table
69 struct _xmlHashEntry *table; member
86 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, in xmlHashComputeKey() argument
92 value = table->random_seed; in xmlHashComputeKey()
112 return (value % table->size); in xmlHashComputeKey()
119 xmlHashComputeQKey(xmlHashTablePtr table, in xmlHashComputeQKey() argument
127 value = table->random_seed; in xmlHashComputeQKey()
169 return (value % table->size); in xmlHashComputeQKey()
174 * @size: the size of the hash table
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | TableCollectionTest.java | 25 import com.google.common.collect.Table.Cell;
51 * Collection tests for {@link Table} implementations.
111 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() in suite()
119 Table<String, Integer, Character> table = in suite()
121 populateForRowKeySet(table, elements); in suite()
122 return table.rowKeySet(); in suite()
139 Table<String, Integer, Character> table = HashBasedTable.create(); in suite()
140 populateForRowKeySet(table, elements); in suite()
141 return table.rowKeySet(); in suite()
154 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); in suite()
[all …]
|
| D | ArrayTableTest.java | 25 import com.google.common.collect.Table.Cell;
44 ArrayTable<String, Integer, Character> table = in create() local
46 populate(table, data); in create()
47 return table; in create()
52 assertEquals(9, table.size()); in assertSize()
69 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
70 assertTrue(table.contains("foo", 1)); in testContains()
71 assertTrue(table.contains("bar", 1)); in testContains()
72 assertTrue(table.contains("foo", 3)); in testContains()
73 assertTrue(table.contains("foo", 2)); in testContains()
[all …]
|
| D | AbstractTableReadTest.java | 29 * Test cases for {@link Table} read operations.
35 protected Table<String, Integer, Character> table; field in AbstractTableReadTest
38 * Creates a table with the specified data.
40 * @param data the table data, repeating the sequence row key, column key, value once per mapping
44 protected abstract Table<String, Integer, Character> create(Object... data); in create()
47 assertEquals(expectedSize, table.size()); in assertSize()
53 table = create(); in setUp()
57 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
58 assertTrue(table.contains("foo", 1)); in testContains()
59 assertTrue(table.contains("bar", 1)); in testContains()
[all …]
|
| D | AbstractTableTest.java | 25 * Test cases for a {@link Table} implementation supporting reads and writes.
33 protected void populate(Table<String, Integer, Character> table, Object... data) { in populate() argument
36 table.put((String) data[i], (Integer) data[i + 1], (Character) data[i + 2]); in populate()
49 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testClear()
51 table.clear(); in testClear()
52 assertEquals(0, table.size()); in testClear()
53 assertFalse(table.containsRow("foo")); in testClear()
56 table.clear(); in testClear()
64 assertNull(table.put("foo", 1, 'a')); in testPut()
65 assertNull(table.put("bar", 1, 'b')); in testPut()
[all …]
|
| /external/guava/android/guava-tests/test/com/google/common/collect/ |
| D | TableCollectionTest.java | 25 import com.google.common.collect.Table.Cell;
51 * Collection tests for {@link Table} implementations.
111 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() in suite()
119 Table<String, Integer, Character> table = in suite()
121 populateForRowKeySet(table, elements); in suite()
122 return table.rowKeySet(); in suite()
139 Table<String, Integer, Character> table = HashBasedTable.create(); in suite()
140 populateForRowKeySet(table, elements); in suite()
141 return table.rowKeySet(); in suite()
154 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); in suite()
[all …]
|
| D | ArrayTableTest.java | 25 import com.google.common.collect.Table.Cell;
44 ArrayTable<String, Integer, Character> table = in create() local
46 populate(table, data); in create()
47 return table; in create()
52 assertEquals(9, table.size()); in assertSize()
69 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
70 assertTrue(table.contains("foo", 1)); in testContains()
71 assertTrue(table.contains("bar", 1)); in testContains()
72 assertTrue(table.contains("foo", 3)); in testContains()
73 assertTrue(table.contains("foo", 2)); in testContains()
[all …]
|
| D | AbstractTableReadTest.java | 29 * Test cases for {@link Table} read operations.
35 protected Table<String, Integer, Character> table; field in AbstractTableReadTest
38 * Creates a table with the specified data.
40 * @param data the table data, repeating the sequence row key, column key, value once per mapping
44 protected abstract Table<String, Integer, Character> create(Object... data); in create()
47 assertEquals(expectedSize, table.size()); in assertSize()
53 table = create(); in setUp()
57 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
58 assertTrue(table.contains("foo", 1)); in testContains()
59 assertTrue(table.contains("bar", 1)); in testContains()
[all …]
|
| D | AbstractTableTest.java | 25 * Test cases for a {@link Table} implementation supporting reads and writes.
33 protected void populate(Table<String, Integer, Character> table, Object... data) { in populate() argument
36 table.put((String) data[i], (Integer) data[i + 1], (Character) data[i + 2]); in populate()
49 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testClear()
51 table.clear(); in testClear()
52 assertEquals(0, table.size()); in testClear()
53 assertFalse(table.containsRow("foo")); in testClear()
56 table.clear(); in testClear()
64 assertNull(table.put("foo", 1, 'a')); in testPut()
65 assertNull(table.put("bar", 1, 'b')); in testPut()
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | fusiontables_v1.table.html | 75 …="fusiontables_v1.html">Fusion Tables API</a> . <a href="fusiontables_v1.table.html">table</a></h1>
79 <p class="firstline">Copies a table.</p>
82 <p class="firstline">Deletes a table.</p>
85 <p class="firstline">Retrieves a specific table by its id.</p>
88 <p class="firstline">Import more rows into a table.</p>
91 <p class="firstline">Import a new table.</p>
94 <p class="firstline">Creates a new table.</p>
103 <p class="firstline">Updates an existing table. Unless explicitly requested, only the name, descrip…
106 <p class="firstline">Updates an existing table. Unless explicitly requested, only the name, descrip…
110 <pre>Copies a table.
[all …]
|
| /external/autotest/frontend/migrations/ |
| D | 066_drop_planner.py | 2 DROP TABLE IF EXISTS planner_test_run_bugs;
3 DROP TABLE IF EXISTS planner_test_runs;
4 DROP TABLE IF EXISTS planner_history;
5 DROP TABLE IF EXISTS planner_autoprocess_bugs;
6 DROP TABLE IF EXISTS planner_bugs;
7 DROP TABLE IF EXISTS planner_hosts;
8 DROP TABLE IF EXISTS planner_additional_parameter_values;
9 DROP TABLE IF EXISTS planner_additional_parameters;
10 DROP TABLE IF EXISTS planner_autoprocess_labels;
11 DROP TABLE IF EXISTS planner_autoprocess_keyvals;
[all …]
|
| D | 045_test_planner_framework.py | 9 CREATE TABLE `planner_plans` (
21 CREATE TABLE `planner_hosts` (
29 ALTER TABLE `planner_hosts` ADD CONSTRAINT hosts_plan_id_fk FOREIGN KEY (`plan_id`) REFERENCES `pla…
30 ALTER TABLE `planner_hosts` ADD CONSTRAINT hosts_host_id_fk FOREIGN KEY (`host_id`) REFERENCES `afe…
33 CREATE TABLE `planner_test_control_files` (
41 CREATE TABLE `planner_tests` (
48 ALTER TABLE `planner_tests` ADD CONSTRAINT tests_plan_id_fk FOREIGN KEY (`plan_id`) REFERENCES `pla…
49 ALTER TABLE `planner_tests` ADD CONSTRAINT tests_control_file_id_fk FOREIGN KEY (`control_file_id`)…
52 CREATE TABLE `planner_test_jobs` (
59 ALTER TABLE `planner_test_jobs` ADD CONSTRAINT test_jobs_plan_id_fk FOREIGN KEY (`plan_id`) REFEREN…
[all …]
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_hash.c | 42 int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table, in isl_hash_table_init() argument
47 if (!table) in isl_hash_table_init()
52 table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1; in isl_hash_table_init()
53 table->n = 0; in isl_hash_table_init()
55 size = 1 << table->bits; in isl_hash_table_init()
56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in isl_hash_table_init()
58 if (!table->entries) in isl_hash_table_init()
71 /* Extend "table" to twice its size.
74 * We reuse isl_hash_table_find to create entries in the extended table.
75 * Since all entries in the original table are assumed to be different,
[all …]
|
| /external/freetype/src/base/ |
| D | ftdbgmem.c | 226 ft_mem_table_alloc( FT_MemTable table, in ft_mem_table_alloc() argument
229 FT_Memory memory = table->memory; in ft_mem_table_alloc()
233 memory->user = table->memory_user; in ft_mem_table_alloc()
234 block = table->alloc( memory, size ); in ft_mem_table_alloc()
235 memory->user = table; in ft_mem_table_alloc()
242 ft_mem_table_free( FT_MemTable table, in ft_mem_table_free() argument
245 FT_Memory memory = table->memory; in ft_mem_table_free()
248 memory->user = table->memory_user; in ft_mem_table_free()
249 table->free( memory, block ); in ft_mem_table_free()
250 memory->user = table; in ft_mem_table_free()
[all …]
|
| /external/llvm-project/llvm/unittests/DebugInfo/PDB/ |
| D | HashTableTest.cpp | 46 HashTableInternals<> Table; in TEST() local
47 EXPECT_EQ(0u, Table.size()); in TEST()
48 EXPECT_GT(Table.capacity(), 0u); in TEST()
51 Table.set_as(3u, 7, Traits); in TEST()
52 EXPECT_EQ(1u, Table.size()); in TEST()
53 ASSERT_NE(Table.end(), Table.find_as(3u, Traits)); in TEST()
54 EXPECT_EQ(7u, Table.get(3u, Traits)); in TEST()
58 HashTableInternals<> Table; in TEST() local
59 EXPECT_EQ(0u, Table.size()); in TEST()
60 EXPECT_GT(Table.capacity(), 0u); in TEST()
[all …]
|
| /external/libaom/libaom/test/ |
| D | film_grain_table_test.cc | 73 aom_film_grain_table_t table; in TEST() local
74 memset(&table, 0, sizeof(table)); in TEST()
77 EXPECT_FALSE(aom_film_grain_table_lookup(&table, 0, 1000, false, &grain)); in TEST()
79 aom_film_grain_table_append(&table, 1000, 2000, film_grain_test_vectors + 0); in TEST()
80 EXPECT_FALSE(aom_film_grain_table_lookup(&table, 0, 1000, false, &grain)); in TEST()
81 EXPECT_FALSE(aom_film_grain_table_lookup(&table, 2000, 3000, false, &grain)); in TEST()
83 EXPECT_TRUE(aom_film_grain_table_lookup(&table, 1000, 2000, false, &grain)); in TEST()
86 EXPECT_EQ(0, memcmp(&grain, film_grain_test_vectors + 0, sizeof(table))); in TEST()
89 aom_film_grain_table_append(&table, 2000, 3000, film_grain_test_vectors + 0); in TEST()
90 EXPECT_EQ(0, table.head->next); in TEST()
[all …]
|
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/memory/ |
| D | LoadTile.h | 158 static INLINE void InitLoadTileColorTable(PFN_LOAD_TILES (&table)[NUM_SWR_FORMATS]) in InitLoadTileColorTable()
160 memset(table, 0, sizeof(table)); in InitLoadTileColorTable()
162 …table[R32G32B32A32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
163 …table[R32G32B32A32_SINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
164 …table[R32G32B32A32_UINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
165 …table[R32G32B32X32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32X32_… in InitLoadTileColorTable()
166 …table[R32G32B32A32_SSCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
167 …table[R32G32B32A32_USCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
168 …table[R32G32B32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 96>, R32G32B32_FLOA… in InitLoadTileColorTable()
169 …table[R32G32B32_SINT] = LoadMacroTile<TilingTraits<TTileMode, 96>, R32G32B32_SINT… in InitLoadTileColorTable()
[all …]
|
| /external/speex/libspeexdsp/ |
| D | fftwrap.c | 86 struct drft_lookup *table; in spx_fft_init() local
87 table = speex_alloc(sizeof(struct drft_lookup)); in spx_fft_init()
88 spx_drft_init((struct drft_lookup *)table, size); in spx_fft_init()
89 return (void*)table; in spx_fft_init()
92 void spx_fft_destroy(void *table) in spx_fft_destroy() argument
94 spx_drft_clear(table); in spx_fft_destroy()
95 speex_free(table); in spx_fft_destroy()
98 void spx_fft(void *table, float *in, float *out) in spx_fft() argument
103 float scale = 1./((struct drft_lookup *)table)->n; in spx_fft()
105 for (i=0;i<((struct drft_lookup *)table)->n;i++) in spx_fft()
[all …]
|
| /external/mesa3d/src/glx/ |
| D | glxhash.c | 1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table. The approach in [Larson88] is superior in
54 * two ways: 1) only a portion of the table is expanded when needed,
[all …]
|
| /external/libdrm/ |
| D | xf86drmHash.c | 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
35 * 1) The table is power-of-two sized. Prime sized tables are more
37 * sized table, especially when double hashing is not used for collision
40 * 2) The hash computation uses a table of random integers [Hanson97,
45 * With a table size of 512, the current implementation is sufficient for a
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
51 * and destroys the old table. The approach in [Larson88] is superior in
52 * two ways: 1) only a portion of the table is expanded when needed,
[all …]
|