Home
last modified time | relevance | path

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

12345678910>>...586

/external/jsoup/src/test/resources/fuzztests/
D1697.html.gz
D1577.html.gz
D1611.html.gz
D1639.html.gz
/external/vulkan-validation-layers/layers/generated/
Dvk_dispatch_table_helper.h395 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/swiftshader/third_party/llvm-16.0/llvm/lib/Target/WebAssembly/
DWebAssemblyRuntimeLibcallSignatures.cpp14 /// 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/
DWebAssemblyRuntimeLibcallSignatures.cpp14 /// 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/nouveau/vulkan/
Dnvk_descriptor_table.c14 struct nvk_descriptor_table *table, in nvk_descriptor_table_grow_locked() argument
21 assert(new_alloc > table->alloc && new_alloc <= table->max_alloc); in nvk_descriptor_table_grow_locked()
23 const uint32_t new_bo_size = new_alloc * table->desc_size; in nvk_descriptor_table_grow_locked()
31 "Failed to allocate the image descriptor table"); in nvk_descriptor_table_grow_locked()
34 if (table->bo) { in nvk_descriptor_table_grow_locked()
35 assert(new_bo_size >= table->bo->size); in nvk_descriptor_table_grow_locked()
36 memcpy(new_map, table->map, table->bo->size); in nvk_descriptor_table_grow_locked()
38 nouveau_ws_bo_unmap(table->bo, table->map); in nvk_descriptor_table_grow_locked()
39 nouveau_ws_bo_destroy(table->bo); in nvk_descriptor_table_grow_locked()
41 table->bo = new_bo; in nvk_descriptor_table_grow_locked()
[all …]
/external/mesa3d/src/glx/tests/
Dindirect_api.cpp28 * Tests various aspects 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
416 … target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const GLvoid *table) { } in __indirect_glColorTable() argument
431 void __indirect_glGetColorTable(GLenum target, GLenum format, GLenum type, GLvoid *table) { } in __indirect_glGetColorTable() argument
717 _glapi_proc *table; member in IndirectAPI
723 this->table = (_glapi_proc *) __glXNewIndirectAPI(); in SetUp()
729 free(this->table); in TearDown()
[all …]
/external/armnn/src/armnnSerializer/
DArmnnSchema.fbs66 table TensorInfo {
83 table ByteData {
87 table ShortData {
91 table IntData {
95 table LongData {
101 table ConstTensor {
106 table InputSlot {
111 table OutputSlot {
189 // Base layer table to be used as part of other layers
190 table LayerBase {
[all …]
/external/mesa3d/src/mesa/main/
Dhash.c28 * Generic hash table.
45 * Initialize a hash table.
48 _mesa_InitHashTable(struct _mesa_HashTable *table) in _mesa_InitHashTable() argument
50 memset(table, 0, sizeof(*table)); in _mesa_InitHashTable()
51 util_sparse_array_init(&table->array, sizeof(void*), 1024); in _mesa_InitHashTable()
52 util_idalloc_init(&table->id_alloc, 8); in _mesa_InitHashTable()
54 util_idalloc_reserve(&table->id_alloc, 0); in _mesa_InitHashTable()
55 simple_mtx_init(&table->Mutex, mtx_plain); in _mesa_InitHashTable()
59 * Delete a hash table.
60 * Frees each entry on the hash table and then the hash table structure itself.
[all …]
/external/tensorflow/tensorflow/core/function/polymorphism/
Dtype_dispatch_test.py62 table = type_dispatch.TypeDispatchTable()
63 table.add_target(MockShape(None, None, None))
64 table.add_target(MockShape(None, None, 1))
65 table.add_target(MockShape(None, 1, 1))
66 table.add_target(MockShape(1, 1, 1))
68 list(table.targets), [
76 table = type_dispatch.TypeDispatchTable()
77 table.add_target(MockShape(1,))
78 table.add_target(MockShape(1, 2))
79 table.add_target(MockShape(1, 2, 3))
[all …]
/external/guava/android/guava-tests/test/com/google/common/collect/
DArrayTableTest.java25 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 …]
DAbstractTableReadTest.java29 * 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 …]
DTableCollectionTest.java25 import com.google.common.collect.Table.Cell;
50 * Collection tests for {@link Table} implementations.
81 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() in suite()
89 Table<String, Integer, Character> table = in suite()
91 populateForRowKeySet(table, elements); in suite()
92 return table.rowKeySet(); in suite()
109 Table<String, Integer, Character> table = HashBasedTable.create(); in suite()
110 populateForRowKeySet(table, elements); in suite()
111 return table.rowKeySet(); in suite()
124 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); in suite()
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DArrayTableTest.java25 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 …]
DAbstractTableReadTest.java29 * 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 …]
DTableCollectionTest.java25 import com.google.common.collect.Table.Cell;
50 * Collection tests for {@link Table} implementations.
81 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() in suite()
89 Table<String, Integer, Character> table = in suite()
91 populateForRowKeySet(table, elements); in suite()
92 return table.rowKeySet(); in suite()
109 Table<String, Integer, Character> table = HashBasedTable.create(); in suite()
110 populateForRowKeySet(table, elements); in suite()
111 return table.rowKeySet(); in suite()
124 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); in suite()
[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/perfetto/python/generators/trace_processor_table/
Dutil.py38 from python.generators.trace_processor_table.public import Table
49 id_table: Optional[Table] = None
86 # is set to false, the user explicitly specified it for this table.
92 """Representation of a table parsed from a Python definition."""
94 table: Table
98 def parse_type_with_cols(table: Table, cols: List[Column], argument
116 parse_type(table, col.type).cpp_type,
122 f'{col_type.table.class_name}::Id', id_table=col_type.table)
126 f'{table.class_name}::Id', is_self_id=True, id_table=table)
129 inner = parse_type(table, col_type.inner)
[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/perfetto/src/trace_processor/db/
Dquery_executor_benchmark.cc35 #include "src/trace_processor/db/table.h"
235 SliceTableForBenchmark& table, in BenchmarkSliceTableFilter() argument
240 benchmark::DoNotOptimize(table.table_.QueryToRowMap(q)); in BenchmarkSliceTableFilter()
243 benchmark::Counter(static_cast<double>(table.table_.row_count()), in BenchmarkSliceTableFilter()
247 static_cast<double>(table.table_.QueryToRowMap(q).size()), in BenchmarkSliceTableFilter()
253 SliceTableForBenchmark& table, in BenchmarkSliceTableSort() argument
256 benchmark::DoNotOptimize(table.table_.Sort(ob)); in BenchmarkSliceTableSort()
259 benchmark::Counter(static_cast<double>(table.table_.row_count()), in BenchmarkSliceTableSort()
266 ExpectedFrameTimelineTableForBenchmark& table, in BenchmarkExpectedFrameTableQuery() argument
269 benchmark::DoNotOptimize(table.table_.QueryToRowMap(q)); in BenchmarkExpectedFrameTableQuery()
[all …]
/external/armnn/docs/
D02_operator_list.dox15 Arm NN supports operators that are listed in below table.
41 <table>
63 <table>
72 </table>
80 <table>
85 </table>
93 <table>
97 </table>
120 <table>
128 </table>
[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 …]

12345678910>>...586