Home
last modified time | relevance | path

Searched full:table (Results 1 – 25 of 7730) sorted by relevance

12345678910>>...310

/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/
DWebAssemblyRuntimeLibcallSignatures.cpp15 /// table providing type signatures for all runtime library functions that LLVM
93 std::vector<RuntimeLibcallSignature> Table; member
96 RuntimeLibcallSignatureTable() : Table(RTLIB::UNKNOWN_LIBCALL, unsupported) { in RuntimeLibcallSignatureTable()
98 Table[RTLIB::SHL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
99 Table[RTLIB::SHL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
100 Table[RTLIB::SHL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
101 Table[RTLIB::SHL_I128] = i64_i64_func_i64_i64_i32; in RuntimeLibcallSignatureTable()
102 Table[RTLIB::SRL_I16] = i16_func_i16_i16; in RuntimeLibcallSignatureTable()
103 Table[RTLIB::SRL_I32] = i32_func_i32_i32; in RuntimeLibcallSignatureTable()
104 Table[RTLIB::SRL_I64] = i64_func_i64_i64; in RuntimeLibcallSignatureTable()
[all …]
/external/mesa3d/src/glx/tests/
Dindirect_api.cpp28 * 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
715 _glapi_proc *table; member in IndirectAPI
721 this->table = (_glapi_proc *) __glXNewIndirectAPI(); in SetUp()
727 free(this->table); in TearDown()
728 this->table = NULL; in TearDown()
735 /* __glXNewIndirectAPI determines the size of the dispatch table by calling in TEST_F()
[all …]
/external/mesa3d/src/mesa/main/
Dhash.c3 * Generic hash table.
43 * Create a new hash table.
45 * \return pointer to a new, empty hash table.
50 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); in _mesa_NewHashTable() local
52 if (table) { in _mesa_NewHashTable()
53 table->ht = _mesa_hash_table_create(NULL, uint_key_hash, in _mesa_NewHashTable()
55 if (table->ht == NULL) { in _mesa_NewHashTable()
56 free(table); in _mesa_NewHashTable()
61 _mesa_hash_table_set_deleted_key(table->ht, uint_key(DELETED_KEY_VALUE)); in _mesa_NewHashTable()
66 mtx_init(&table->Mutex, mtx_recursive); in _mesa_NewHashTable()
[all …]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
DTableCollectionTest.java21 import com.google.common.collect.Table.Cell;
37 * Collection tests for {@link Table} implementations.
70 Table<String, Integer, Character> table, String[] elements) { in populateForRowKeySet() argument
72 table.put(row, 1, 'a'); in populateForRowKeySet()
73 table.put(row, 2, 'b'); in populateForRowKeySet()
78 Table<Integer, String, Character> table, String[] elements) { in populateForColumnKeySet() argument
80 table.put(1, column, 'a'); in populateForColumnKeySet()
81 table.put(2, column, 'b'); in populateForColumnKeySet()
86 Table<Integer, Character, String> table, String[] elements) { in populateForValues() argument
88 table.put(i, 'a', elements[i]); in populateForValues()
[all …]
DArrayTableTest.java24 import com.google.common.collect.Table.Cell;
43 ArrayTable<String, Integer, Character> table = in create() local
45 populate(table, data); in create()
46 return table; in create()
50 assertEquals(9, table.size()); in assertSize()
64 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
65 assertTrue(table.contains("foo", 1)); in testContains()
66 assertTrue(table.contains("bar", 1)); in testContains()
67 assertTrue(table.contains("foo", 3)); in testContains()
68 assertTrue(table.contains("foo", 2)); in testContains()
[all …]
DAbstractTableReadTest.java28 * Test cases for {@link Table} read operations.
34 protected Table<String, Integer, Character> table; field in AbstractTableReadTest
37 * Creates a table with the specified data.
39 * @param data the table data, repeating the sequence row key, column key,
45 protected abstract Table<String, Integer, Character>
49 assertEquals(expectedSize, table.size()); in assertSize()
54 table = create(); in setUp()
58 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
59 assertTrue(table.contains("foo", 1)); in testContains()
60 assertTrue(table.contains("bar", 1)); in testContains()
[all …]
/external/libxml2/
Dhash.c51 * A single entry in the hash table
65 * The entire hash table
68 struct _xmlHashEntry *table; member
82 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, in xmlHashComputeKey() argument
88 value = table->random_seed; in xmlHashComputeKey()
108 return (value % table->size); in xmlHashComputeKey()
112 xmlHashComputeQKey(xmlHashTablePtr table, in xmlHashComputeQKey() argument
120 value = table->random_seed; in xmlHashComputeQKey()
162 return (value % table->size); in xmlHashComputeQKey()
167 * @size: the size of the hash table
[all …]
/external/v8/src/objects/
Dordered-hash-table.cc5 #include "src/objects/ordered-hash-table.h"
10 #include "src/objects/ordered-hash-table-inl.h"
25 isolate->heap()->FatalProcessOutOfMemory("invalid table size"); in Allocate()
31 Handle<Derived> table = Handle<Derived>::cast(backing_store); in Allocate() local
33 table->set(kHashTableStartIndex + i, Smi::FromInt(kNotFound)); in Allocate()
35 table->SetNumberOfBuckets(num_buckets); in Allocate()
36 table->SetNumberOfElements(0); in Allocate()
37 table->SetNumberOfDeletedElements(0); in Allocate()
38 return table; in Allocate()
43 Isolate* isolate, Handle<Derived> table) { in EnsureGrowable() argument
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DTableCollectionTest.java25 import com.google.common.collect.Table.Cell;
53 * Collection tests for {@link Table} implementations.
118 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() in suite()
123 Table<String, Integer, Character> table in suite()
126 populateForRowKeySet(table, elements); in suite()
127 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()
151 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); in suite()
[all …]
DAbstractTableReadTest.java30 * Test cases for {@link Table} read operations.
36 protected Table<String, Integer, Character> table; field in AbstractTableReadTest
39 * Creates a table with the specified data.
41 * @param data the table data, repeating the sequence row key, column key,
47 protected abstract Table<String, Integer, Character>
51 assertEquals(expectedSize, table.size()); in assertSize()
56 table = create(); in setUp()
60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
61 assertTrue(table.contains("foo", 1)); in testContains()
62 assertTrue(table.contains("bar", 1)); in testContains()
[all …]
DArrayTableTest.java25 import com.google.common.collect.Table.Cell;
45 ArrayTable<String, Integer, Character> table = in create() local
47 populate(table, data); in create()
48 return table; in create()
52 assertEquals(9, table.size()); in assertSize()
66 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testContains()
67 assertTrue(table.contains("foo", 1)); in testContains()
68 assertTrue(table.contains("bar", 1)); in testContains()
69 assertTrue(table.contains("foo", 3)); in testContains()
70 assertTrue(table.contains("foo", 2)); in testContains()
[all …]
DAbstractTableTest.java26 * Test cases for a {@link Table} implementation supporting reads and writes.
35 Table<String, Integer, Character> table, Object... data) { in populate() argument
38 table.put( in populate()
52 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); in testClear()
54 table.clear(); in testClear()
55 assertEquals(0, table.size()); in testClear()
56 assertFalse(table.containsRow("foo")); in testClear()
59 table.clear(); in testClear()
66 assertNull(table.put("foo", 1, 'a')); in testPut()
67 assertNull(table.put("bar", 1, 'b')); in testPut()
[all …]
/external/python/google-api-python-client/docs/dyn/
Dfusiontables_v1.table.html75 …="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 …]
Dfusiontables_v2.table.html75 …="fusiontables_v2.html">Fusion Tables API</a> . <a href="fusiontables_v2.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">Imports more rows into a table.</p>
91 <p class="firstline">Imports 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">Replaces rows of an existing table. Current rows remain visible until all repl…
109 <p class="firstline">Updates an existing table. Unless explicitly requested, only the name, descrip…
[all …]
/external/autotest/frontend/migrations/
D066_drop_planner.py2 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 …]
D045_test_planner_framework.py9 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/freetype/src/base/
Dftdbgmem.c226 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/libaom/libaom/test/
Dfilm_grain_table_test.cc73 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/swiftshader/third_party/llvm-7.0/llvm/unittests/DebugInfo/PDB/
DHashTableTest.cpp40 HashTableInternals Table; in TEST() local
41 EXPECT_EQ(0u, Table.size()); in TEST()
42 EXPECT_GT(Table.capacity(), 0u); in TEST()
44 Table.set_as(3u, 7); in TEST()
45 EXPECT_EQ(1u, Table.size()); in TEST()
46 ASSERT_NE(Table.end(), Table.find_as(3u)); in TEST()
47 EXPECT_EQ(7u, Table.get(3u)); in TEST()
51 HashTableInternals Table; in TEST() local
52 EXPECT_EQ(0u, Table.size()); in TEST()
53 EXPECT_GT(Table.capacity(), 0u); in TEST()
[all …]
/external/mesa3d/src/gallium/drivers/swr/rasterizer/memory/
DLoadTile.h174 static INLINE void InitLoadTileColorTable(PFN_LOAD_TILES (&table)[NUM_SWR_FORMATS]) in InitLoadTileColorTable()
176 memset(table, 0, sizeof(table)); in InitLoadTileColorTable()
178 …table[R32G32B32A32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
179 …table[R32G32B32A32_SINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
180 …table[R32G32B32A32_UINT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
181 …table[R32G32B32X32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32X32_… in InitLoadTileColorTable()
182 …table[R32G32B32A32_SSCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
183 …table[R32G32B32A32_USCALED] = LoadMacroTile<TilingTraits<TTileMode, 128>, R32G32B32A32_… in InitLoadTileColorTable()
184 …table[R32G32B32_FLOAT] = LoadMacroTile<TilingTraits<TTileMode, 96>, R32G32B32_FLOA… in InitLoadTileColorTable()
185 …table[R32G32B32_SINT] = LoadMacroTile<TilingTraits<TTileMode, 96>, R32G32B32_SINT… in InitLoadTileColorTable()
[all …]
/external/speex/libspeexdsp/
Dfftwrap.c86 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/
Dglxhash.c1 /* 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/
Dxf86drmHash.c1 /* 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 …]
/external/libxkbcommon/xkbcommon/src/compose/
Dtable.c25 #include "table.h"
36 struct xkb_compose_table *table; in xkb_compose_table_new() local
43 table = calloc(1, sizeof(*table)); in xkb_compose_table_new()
44 if (!table) { in xkb_compose_table_new()
49 table->refcnt = 1; in xkb_compose_table_new()
50 table->ctx = xkb_context_ref(ctx); in xkb_compose_table_new()
52 table->locale = resolved_locale; in xkb_compose_table_new()
53 table->format = format; in xkb_compose_table_new()
54 table->flags = flags; in xkb_compose_table_new()
56 darray_init(table->nodes); in xkb_compose_table_new()
[all …]
/external/autotest/database/
Dschema_129.sql19 -- Table structure for table `afe_aborted_host_queue_entries`
22 DROP TABLE IF EXISTS `afe_aborted_host_queue_entries`;
25 CREATE TABLE `afe_aborted_host_queue_entries` (
37 -- Table structure for table `afe_acl_groups`
40 DROP TABLE IF EXISTS `afe_acl_groups`;
43 CREATE TABLE `afe_acl_groups` (
52 -- Table structure for table `afe_acl_groups_hosts`
55 DROP TABLE IF EXISTS `afe_acl_groups_hosts`;
58 CREATE TABLE `afe_acl_groups_hosts` (
71 -- Table structure for table `afe_acl_groups_users`
[all …]

12345678910>>...310