| /device/generic/vulkan-cereal/include/vulkan/ |
| D | vk_dispatch_table_helper.h | 662 static inline void layer_init_device_dispatch_table(VkDevice device, VkLayerDispatchTable *table, P… in layer_init_device_dispatch_table() argument
663 memset(table, 0, sizeof(*table)); in layer_init_device_dispatch_table()
665 table->GetDeviceProcAddr = gpa; in layer_init_device_dispatch_table()
666 table->DestroyDevice = (PFN_vkDestroyDevice) gpa(device, "vkDestroyDevice"); in layer_init_device_dispatch_table()
667 table->GetDeviceQueue = (PFN_vkGetDeviceQueue) gpa(device, "vkGetDeviceQueue"); in layer_init_device_dispatch_table()
668 table->QueueSubmit = (PFN_vkQueueSubmit) gpa(device, "vkQueueSubmit"); in layer_init_device_dispatch_table()
669 table->QueueWaitIdle = (PFN_vkQueueWaitIdle) gpa(device, "vkQueueWaitIdle"); in layer_init_device_dispatch_table()
670 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle) gpa(device, "vkDeviceWaitIdle"); in layer_init_device_dispatch_table()
671 table->AllocateMemory = (PFN_vkAllocateMemory) gpa(device, "vkAllocateMemory"); in layer_init_device_dispatch_table()
672 table->FreeMemory = (PFN_vkFreeMemory) gpa(device, "vkFreeMemory"); in layer_init_device_dispatch_table()
[all …]
|
| /device/generic/vulkan-cereal/third-party/angle/src/third_party/volk/ |
| D | volk.c | 33 static void volkGenLoadDeviceTable(struct VolkDeviceTable* table, void* context, PFN_vkVoidFunction…
123 void volkLoadDeviceTable(struct VolkDeviceTable* table, VkDevice device) in volkLoadDeviceTable() argument
125 volkGenLoadDeviceTable(table, device, vkGetDeviceProcAddrStub); in volkLoadDeviceTable()
723 static void volkGenLoadDeviceTable(struct VolkDeviceTable* table, void* context, PFN_vkVoidFunction… in volkGenLoadDeviceTable() argument
727 …table->vkAllocateCommandBuffers = (PFN_vkAllocateCommandBuffers)load(context, "vkAllocateCommandBu… in volkGenLoadDeviceTable()
728 …table->vkAllocateDescriptorSets = (PFN_vkAllocateDescriptorSets)load(context, "vkAllocateDescripto… in volkGenLoadDeviceTable()
729 table->vkAllocateMemory = (PFN_vkAllocateMemory)load(context, "vkAllocateMemory"); in volkGenLoadDeviceTable()
730 table->vkBeginCommandBuffer = (PFN_vkBeginCommandBuffer)load(context, "vkBeginCommandBuffer"); in volkGenLoadDeviceTable()
731 table->vkBindBufferMemory = (PFN_vkBindBufferMemory)load(context, "vkBindBufferMemory"); in volkGenLoadDeviceTable()
732 table->vkBindImageMemory = (PFN_vkBindImageMemory)load(context, "vkBindImageMemory"); in volkGenLoadDeviceTable()
[all …]
|
| /device/google/coral/json-c/ |
| D | linkhash.h | 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table.
[all …]
|
| D | linkhash.c | 58 These are functions for producing 32-bit hashes for hash table lookup.
215 The best hash table sizes are powers of 2. There is no need to do
219 In which case, the hash table should have hashsize(10) elements.
227 Use for hash table lookup, or anything where one collision in 2^^32 is
439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
[all …]
|
| /device/google/sunfish/json-c/ |
| D | linkhash.h | 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table.
[all …]
|
| D | linkhash.c | 58 These are functions for producing 32-bit hashes for hash table lookup.
215 The best hash table sizes are powers of 2. There is no need to do
219 In which case, the hash table should have hashsize(10) elements.
227 Use for hash table lookup, or anything where one collision in 2^^32 is
439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
[all …]
|
| /device/google/bonito/json-c/ |
| D | linkhash.h | 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table.
[all …]
|
| D | linkhash.c | 58 These are functions for producing 32-bit hashes for hash table lookup.
215 The best hash table sizes are powers of 2. There is no need to do
219 In which case, the hash table should have hashsize(10) elements.
227 Use for hash table lookup, or anything where one collision in 2^^32 is
439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
[all …]
|
| /device/google/crosshatch/json-c/ |
| D | linkhash.h | 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table.
[all …]
|
| D | linkhash.c | 58 These are functions for producing 32-bit hashes for hash table lookup.
215 The best hash table sizes are powers of 2. There is no need to do
219 In which case, the hash table should have hashsize(10) elements.
227 Use for hash table lookup, or anything where one collision in 2^^32 is
439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
[all …]
|
| /device/google/redbull/json-c/ |
| D | linkhash.h | 28 * The fraction of filled hash buckets until an insert will cause the table
60 * An entry in the hash table
83 * The hash table structure.
121 * Name of the hash table.
135 struct lh_entry *table; member
159 #define lh_foreach(table, entry) \ argument
160 for(entry = table->head; entry; entry = entry->next)
165 #define lh_foreach_safe(table, entry, tmp) \ argument
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
171 * Create a new linkhash table.
[all …]
|
| D | linkhash.c | 58 These are functions for producing 32-bit hashes for hash table lookup.
215 The best hash table sizes are powers of 2. There is no need to do
219 In which case, the hash table should have hashsize(10) elements.
227 Use for hash table lookup, or anything where one collision in 2^^32 is
439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); in lh_table_new()
440 if(!t->table) lh_abort("lh_table_new: calloc failed\n"); in lh_table_new()
444 for(i = 0; i < size; i++) t->table[i].k = LH_EMPTY; in lh_table_new()
471 free(t->table); in lh_table_resize()
472 t->table = new_t->table; in lh_table_resize()
488 free(t->table); in lh_table_free()
[all …]
|
| /device/generic/vulkan-cereal/protocols/vulkan/chapters/VK_NVX_device_generated_commands/ |
| D | objecttable.txt | 1 == Binding Object Table
3 [open,refpage='VkObjectTableNVX',desc='Opaque handle to an object table',type='handles']
6 The device-side bindings are registered inside a table:
14 The combination of sname:VkObjectTableNVX and ftext:uint32_t table indices
18 At creation time the table is defined with a fixed amount of registration
25 === Table Creation
27 [open,refpage='vkCreateObjectTableNVX',desc='Create an object table',type='protos']
34 * pname:device is the logical device that creates the object table.
37 affecting creation of the table.
41 the resulting object table is returned.
[all …]
|
| /device/google/contexthub/firmware/os/inc/ |
| D | osApi.h | 23 //level 1 indices in the OS table
28 //level 2 indices in the OS.drivers table
34 //level 3 indices in the OS.drivers.gpio table
45 //level 3 indices in the OS.drivers.i2cM table
51 //level 3 indices in the OS.drivers.i2cS table
59 //level 2 indices in the OS.main table
70 //level 3 indices in the OS.main.event_queue table
79 //level 3 indices in the OS.main.logging table
83 //level 3 indices in the OS.main.sensors table
98 //level 3 indices in the OS.main.timer table
[all …]
|
| D | chreApi.h | 37 //level 1 indices in the CHRE table
42 //level 2 indices in the CHRE.main table
47 //level 3 indices in the CHRE.main.api table
71 //level 3 indices in the CHRE.main.event table
81 //level 2 indices in the CHRE.drivers table
88 //level 3 indices in the CHRE.drivers.gnss table
97 //level 3 indices in the CHRE.drivers.wifi table
103 //level 3 indices in the CHRE.drivers.wwan table
108 //level 3 indicies in the CHRE.drivers.audio table
|
| /device/generic/vulkan-cereal/protocols/vulkan/config/ |
| D | asciidoctor-mathematical-ext.rb | 3 # This script makes [latexmath] blocks work within table cells.
10 (table_blocks = doc.find_by context: :table).each do |table|
11 (table.rows[:body] + table.rows[:foot]).each do |row|
|
| D | khronos.css | 121 /** Remove most spacing between table cells. */
122 table { border-collapse: collapse; border-spacing: 0; } selector
176 …> .title, .openblock > .title, .paragraph > .title, .quoteblock > .title, table.tableblock > .titl…
265 table { background: #fff; margin-bottom: 1.25em; border: solid 1px #d8d8ce; } selector
266 table thead, table tfoot { background: #eee; font-weight: bold; }
267 table thead tr th, table thead tr td, table tfoot tr th, table tfoot tr td { padding: 0.5em 0.625em…
268 table tr th, table tr td { padding: 0.5625em 0.625em; font-size: inherit; color: #6d6e71; }
269 table tr.even, table tr.alt, table tr:nth-of-type(even) { background: #f8f8f8; }
270 table thead tr th, table tfoot tr th, table tbody tr td, table tr td, table tfoot tr td { display: …
278 …:before, .clearfix:after, .float-group:before, .float-group:after { content: " "; display: table; }
[all …]
|
| /device/generic/vulkan-cereal/third-party/angle/extensions/ |
| D | ANGLE_get_image.txt | 65 values in table 8.19." to "<pname> must be one of IMAGE_FORMAT_COMPATIBILITY_-
68 values in table 8.19.".
96 may also be one of the targets from table 8.20, indicating the
101 <level> is a level-of-detail number, <format> is a pixel format from table 8.5,
102 and <type> is a pixel type from table 8.4.
113 as shown in table 8.24.
123 applicable to ReadPixels are applied, as described in table 16.1 and section
139 or one of the targets from table 8.20.
151 * <format> is a color format (one of the formats in table 8.3 whose target is
164 * <format> is one of the integer formats in table 8.5 and the internal format
[all …]
|
| D | ANGLE_texture_compression_dxt.txt | 87 Table 3.x: Specific Compressed Internal Formats
89 If <internalformat> is one of the S3TC formats listed in Table 3.x,
95 <internalformat> is one of the values from Table 3.x under the following
106 in Table 3.x, the texture is stored in the appropriate S3TC compressed
125 is one of the compressed internal formats from Table 3.x and any of the
133 Table 3.x.
137 one of the compressed internal formats from Table 3.x.
140 is one of the compressed interal formats from Table 3.x and any of the
|
| D | ANGLE_depth_texture.txt | 96 Add the following rows to Table 3.2 (page 62):
105 Add the following rows to Table 3.3 (page 62):
114 Add a row to Table 3.5 "Packed pixel formats" (page 64):
121 Add a new table after Table 3.6 (page 64):
130 Table 3.6.B: UNSIGNED_INT formats
132 Add a row to Table 3.7 "Packed pixel field assignments" (page 65):
156 specified by <internalformat>. Table 3.8 summarizes the mapping of R, G,
160 table 3.8. Specifying a value for <internalformat> that is not one of the
187 Add a row to table 3.8 (page 68), and update the title of the
197 Update the caption for table 3.8 (page 68)
[all …]
|
| /device/google/crosshatch/sdm845/original-kernel-headers/linux/ |
| D | msm_thermal_ioctl.h | 18 ** cluster frequency table. A non-zero value will fetch the frequency
19 ** table contents.
23 ** For clusters with frequency table length greater than
24 ** MSM_IOCTL_FREQ_SIZE, the frequency table is fetched from kernel
26 ** indicates, which set/part of frequency table the user is requesting.
30 ** from the frequency table, starting from the index
37 ** number of frequency table entries fetched.
|
| /device/google/bonito/sdm710/original-kernel-headers/linux/ |
| D | msm_thermal_ioctl.h | 18 ** cluster frequency table. A non-zero value will fetch the frequency
19 ** table contents.
23 ** For clusters with frequency table length greater than
24 ** MSM_IOCTL_FREQ_SIZE, the frequency table is fetched from kernel
26 ** indicates, which set/part of frequency table the user is requesting.
30 ** from the frequency table, starting from the index
37 ** number of frequency table entries fetched.
|
| /device/generic/vulkan-cereal/third-party/angle/src/libANGLE/ |
| D | GLES1State.h | 262 // Table 6.4, 6.5 (IsEnabled)
269 // Table 6.7-6.16 (IsEnabled)
282 // Table 6.3
288 // Table 6.4
291 // Table 6.7
297 // Table 6.15
301 // Table 6.9, 2.8
305 // Table 6.10
308 // Table 6.8
312 // Table 6.11
[all …]
|
| /device/generic/goldfish-opengl/system/vulkan_enc/ |
| D | DescriptorSetVirtualization.cpp | 29 …ble(const std::vector<VkDescriptorSetLayoutBinding>& layoutBindings, DescriptorWriteTable& table) { in initDescriptorWriteTable() argument
45 table.resize(countsEachBinding.size()); in initDescriptorWriteTable()
47 for (uint32_t i = 0; i < table.size(); ++i) { in initDescriptorWriteTable()
48 table[i].resize(countsEachBinding[i]); in initDescriptorWriteTable()
51 table[i][j].type = DescriptorWriteType::Empty; in initDescriptorWriteTable()
52 table[i][j].dstArrayElement = 0; in initDescriptorWriteTable()
120 DescriptorWriteTable& table = toWrite->allWrites; in doEmulatedDescriptorWrite() local
126 if (arrOffset >= table[dstBinding].size()) { in doEmulatedDescriptorWrite()
130 auto& entry = table[dstBinding][arrOffset]; in doEmulatedDescriptorWrite()
137 if (arrOffset >= table[dstBinding].size()) { in doEmulatedDescriptorWrite()
[all …]
|
| /device/google/contexthub/firmware/external/arm/ |
| D | arm_sin_cos_f32.c | 51 * Example code for the generation of the floating-point sine table:
166 * Computes the trigonometric sine function using a combination of table lookup
174 * The implementation is based on table lookup using 256 values together with cubic interpolation.
176 * -# Calculation of the nearest integer table index
177 * -# Fetch the four table values a, b, c, and d
178 * -# Compute the fractional portion (fract) of the table index.
184 * a=Table[index-1];
185 * b=Table[index+0];
186 * c=Table[index+1];
187 * d=Table[index+2];
[all …]
|