/external/vulkan-validation-layers/loader/ |
D | table_ops.h | 46 VkLayerDispatchTable *table = &dev_table->core_dispatch; in loader_init_device_dispatch_table() local 50 table->GetDeviceProcAddr = in loader_init_device_dispatch_table() 52 table->DestroyDevice = (PFN_vkDestroyDevice)gpa(dev, "vkDestroyDevice"); in loader_init_device_dispatch_table() 53 table->GetDeviceQueue = (PFN_vkGetDeviceQueue)gpa(dev, "vkGetDeviceQueue"); in loader_init_device_dispatch_table() 54 table->QueueSubmit = (PFN_vkQueueSubmit)gpa(dev, "vkQueueSubmit"); in loader_init_device_dispatch_table() 55 table->QueueWaitIdle = (PFN_vkQueueWaitIdle)gpa(dev, "vkQueueWaitIdle"); in loader_init_device_dispatch_table() 56 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle)gpa(dev, "vkDeviceWaitIdle"); in loader_init_device_dispatch_table() 57 table->AllocateMemory = (PFN_vkAllocateMemory)gpa(dev, "vkAllocateMemory"); in loader_init_device_dispatch_table() 58 table->FreeMemory = (PFN_vkFreeMemory)gpa(dev, "vkFreeMemory"); in loader_init_device_dispatch_table() 59 table->MapMemory = (PFN_vkMapMemory)gpa(dev, "vkMapMemory"); in loader_init_device_dispatch_table() [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 713 _glapi_proc *table; member in IndirectAPI 719 this->table = (_glapi_proc *) __glXNewIndirectAPI(); in SetUp() 725 free(this->table); in TearDown() 726 this->table = NULL; in TearDown() 733 /* __glXNewIndirectAPI determines the size of the dispatch table by calling in TEST_F() [all …]
|
/external/mesa3d/src/mesa/main/ |
D | hash.c | 3 * Generic hash table. 45 * The hash table needs a particular pointer to be the marker for a key that 46 * was deleted from the table, along with NULL for the "never allocated in the 47 * table" marker. Legacy GL allows any GLuint to be used as a GL object name, 50 * struct hash_table. We tell the hash table to use "1" as the deleted key 51 * value, so that we test the deleted-key-in-the-table path as best we can. 56 * The hash table data structure. 63 /** Value that would be in the table for DELETED_KEY_VALUE. */ 76 * are never deleted, we will never see a collision in the table, because the 77 * table resizes itself when it approaches full, and thus key % table_size == [all …]
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
D | TableCollectionTest.java | 21 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 …]
|
D | ArrayTableTest.java | 24 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 …]
|
D | AbstractTableReadTest.java | 28 * 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/ |
D | hash.c | 51 * 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/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/fr-FR/ |
D | fr-FR_nk0_kpdf_phs.utf | 38 index = 2500 , uint32 ; !specification for phase indices table 2539 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2541 phase = 0 , uint8 ; !specification for phase sub table 2542 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2544 phase = 0 , uint8 ; !specification for phase sub table 2545 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2547 phase = 71 , uint8 ; !specification for phase sub table 2619 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2621 phase = 71 , uint8 ; !specification for phase sub table 2693 n_comps = 1 , uint8 ; !specification for phase sub table number of components [all …]
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | TableCollectionTest.java | 25 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 …]
|
D | AbstractTableReadTest.java | 30 * 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 …]
|
D | ArrayTableTest.java | 25 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 …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/en-US/ |
D | en-US_lh0_kpdf_phs.utf | 38 index = 3200 , uint32 ; !specification for phase indices table 3239 n_comps = 1 , uint8 ; !specification for phase sub table number of components 3241 phase = 0 , uint8 ; !specification for phase sub table 3242 n_comps = 1 , uint8 ; !specification for phase sub table number of components 3244 phase = 71 , uint8 ; !specification for phase sub table 3316 n_comps = 1 , uint8 ; !specification for phase sub table number of components 3318 phase = 61 , uint8 ; !specification for phase sub table 3380 n_comps = 1 , uint8 ; !specification for phase sub table number of components 3382 phase = 0 , uint8 ; !specification for phase sub table 3383 n_comps = 1 , uint8 ; !specification for phase sub table number of components [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/es-ES/ |
D | es-ES_zl0_kpdf_phs.utf | 38 index = 2500 , uint32 ; !specification for phase indices table 2539 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2541 phase = 42 , uint8 ; !specification for phase sub table 2584 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2586 phase = 0 , uint8 ; !specification for phase sub table 2587 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2589 phase = 71 , uint8 ; !specification for phase sub table 2661 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2663 phase = 0 , uint8 ; !specification for phase sub table 2664 n_comps = 1 , uint8 ; !specification for phase sub table number of components [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/de-DE/ |
D | de-DE_gl0_kpdf_phs.utf | 38 index = 2500 , uint32 ; !specification for phase indices table 2539 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2541 phase = 61 , uint8 ; !specification for phase sub table 2603 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2605 phase = 0 , uint8 ; !specification for phase sub table 2606 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2608 phase = 71 , uint8 ; !specification for phase sub table 2680 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2682 phase = 0 , uint8 ; !specification for phase sub table 2683 n_comps = 1 , uint8 ; !specification for phase sub table number of components [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/en-GB/ |
D | en-GB_kh0_kpdf_phs.utf | 38 index = 2500 , uint32 ; !specification for phase indices table 2539 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2541 phase = 71 , uint8 ; !specification for phase sub table 2613 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2615 phase = 71 , uint8 ; !specification for phase sub table 2687 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2689 phase = 0 , uint8 ; !specification for phase sub table 2690 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2692 phase = 0 , uint8 ; !specification for phase sub table 2693 n_comps = 1 , uint8 ; !specification for phase sub table number of components [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/bison/lib/ |
D | hash.c | 1 /* hash - hashing table processing. 20 /* A generic hash table package. */ 56 are not empty, there are N_ENTRIES active entries in the table. */ 86 /* A hash table contains many internal entries, each holding a pointer to 91 and the current table size. At each slot position in the hash table, 97 entries divided by the table size. Finding the slot for a data is usually 100 larger hash table size (that is, a larger number of buckets) is prone to 103 Long buckets slow down the lookup algorithm. One might use big hash table 105 become inordinate, as unused slots in the hash table take some space. The 107 that those are not that easy to write! :-), and to use a table size [all …]
|
/external/pdfium/third_party/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/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/mesa3d/src/gallium/drivers/swr/rasterizer/memory/ |
D | LoadTile.h | 174 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/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/siggen/it-IT/ |
D | it-IT_cm0_kpdf_phs.utf | 38 index = 2500 , uint32 ; !specification for phase indices table 2539 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2541 phase = 47 , uint8 ; !specification for phase sub table 2589 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2591 phase = 0 , uint8 ; !specification for phase sub table 2592 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2594 phase = 71 , uint8 ; !specification for phase sub table 2666 n_comps = 1 , uint8 ; !specification for phase sub table number of components 2668 phase = 51 , uint8 ; !specification for phase sub table 2720 n_comps = 1 , uint8 ; !specification for phase sub table number of components [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/syslinux/gpxe/src/include/gpxe/ |
D | tables.h | 92 * table, and then have a function call_init_fns() that simply calls 93 * all functions present in this table. If and only if serial.o gets 101 * our table sections have names of the format @c .tbl.NAME.NN where 102 * @c NAME designates the data structure stored in the table (e.g. @c 105 * symbol indicating "table start", and @c NN=99 is reserved for the 106 * symbol indicating "table end". 173 * Declare a linker table 176 * @v name Table name 177 * @ret table Linker table 182 * Get linker table data type [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 …]
|