| /third_party/vulkan-loader/loader/generated/ |
| H A D | vk_dispatch_table_helper.h | 32 static inline void layer_init_device_dispatch_table(VkDevice device, VkLayerDispatchTable *table, PFN_vkGetDeviceProcAddr gpa) { in layer_init_device_dispatch_table() argument
33 memset(table, 0, sizeof(*table)); in layer_init_device_dispatch_table()
34 table->magic = DEVICE_DISP_TABLE_MAGIC_NUMBER; in layer_init_device_dispatch_table()
37 table->GetDeviceProcAddr = gpa; in layer_init_device_dispatch_table()
38 table->DestroyDevice = (PFN_vkDestroyDevice)gpa(device, "vkDestroyDevice"); in layer_init_device_dispatch_table()
39 table->GetDeviceQueue = (PFN_vkGetDeviceQueue)gpa(device, "vkGetDeviceQueue"); in layer_init_device_dispatch_table()
40 table->QueueSubmit = (PFN_vkQueueSubmit)gpa(device, "vkQueueSubmit"); in layer_init_device_dispatch_table()
41 table->QueueWaitIdle = (PFN_vkQueueWaitIdle)gpa(device, "vkQueueWaitIdle"); in layer_init_device_dispatch_table()
42 table in layer_init_device_dispatch_table()
749 layer_init_instance_dispatch_table(VkInstance instance, VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa) layer_init_instance_dispatch_table() argument
[all...] |
| /third_party/vulkan-loader/tests/framework/layer/ |
| H A D | vk_dispatch_table_helper.h | 32 static inline void layer_init_device_dispatch_table(VkDevice device, VkLayerDispatchTable *table, PFN_vkGetDeviceProcAddr gpa) { in layer_init_device_dispatch_table() argument
33 memset(table, 0, sizeof(*table)); in layer_init_device_dispatch_table()
34 table->magic = DEVICE_DISP_TABLE_MAGIC_NUMBER; in layer_init_device_dispatch_table()
37 table->GetDeviceProcAddr = gpa; in layer_init_device_dispatch_table()
38 table->DestroyDevice = (PFN_vkDestroyDevice)gpa(device, "vkDestroyDevice"); in layer_init_device_dispatch_table()
39 table->GetDeviceQueue = (PFN_vkGetDeviceQueue)gpa(device, "vkGetDeviceQueue"); in layer_init_device_dispatch_table()
40 table->QueueSubmit = (PFN_vkQueueSubmit)gpa(device, "vkQueueSubmit"); in layer_init_device_dispatch_table()
41 table->QueueWaitIdle = (PFN_vkQueueWaitIdle)gpa(device, "vkQueueWaitIdle"); in layer_init_device_dispatch_table()
42 table in layer_init_device_dispatch_table()
733 layer_init_instance_dispatch_table(VkInstance instance, VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa) layer_init_instance_dispatch_table() argument
[all...] |
| /third_party/mesa3d/src/mesa/main/ |
| H A 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()
65 simple_mtx_init(&table in _mesa_NewHashTable()
85 _mesa_DeleteHashTable(struct _mesa_HashTable *table) _mesa_DeleteHashTable() argument
103 init_name_reuse(struct _mesa_HashTable *table) init_name_reuse() argument
113 _mesa_HashEnableNameReuse(struct _mesa_HashTable *table) _mesa_HashEnableNameReuse() argument
125 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key) _mesa_HashLookup_unlocked() argument
154 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key) _mesa_HashLookup() argument
176 _mesa_HashLookupLocked(struct _mesa_HashTable *table, GLuint key) _mesa_HashLookupLocked() argument
183 _mesa_HashInsert_unlocked(struct _mesa_HashTable *table, GLuint key, void *data) _mesa_HashInsert_unlocked() argument
220 _mesa_HashInsertLocked(struct _mesa_HashTable *table, GLuint key, void *data, GLboolean isGenName) _mesa_HashInsertLocked() argument
239 _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data, GLboolean isGenName) _mesa_HashInsert() argument
260 _mesa_HashRemove_unlocked(struct _mesa_HashTable *table, GLuint key) _mesa_HashRemove_unlocked() argument
289 _mesa_HashRemoveLocked(struct _mesa_HashTable *table, GLuint key) _mesa_HashRemoveLocked() argument
295 _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key) _mesa_HashRemove() argument
312 _mesa_HashDeleteAll(struct _mesa_HashTable *table, void (*callback)(void *data, void *userData), void *userData) _mesa_HashDeleteAll() argument
350 hash_walk_unlocked(const struct _mesa_HashTable *table, void (*callback)(void *data, void *userData), void *userData) hash_walk_unlocked() argument
366 _mesa_HashWalk(const struct _mesa_HashTable *table, void (*callback)(void *data, void *userData), void *userData) _mesa_HashWalk() argument
379 _mesa_HashWalkLocked(const struct _mesa_HashTable *table, void (*callback)(void *data, void *userData), void *userData) _mesa_HashWalkLocked() argument
392 _mesa_HashPrint(const struct _mesa_HashTable *table) _mesa_HashPrint() argument
418 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable *table, GLuint numKeys) _mesa_HashFindFreeKeyBlock() argument
453 _mesa_HashFindFreeKeys(struct _mesa_HashTable *table, GLuint* keys, GLuint numKeys) _mesa_HashFindFreeKeys() argument
475 _mesa_HashNumEntries(const struct _mesa_HashTable *table) _mesa_HashNumEntries() argument
[all...] |
| H A D | hash.h | 3 * Generic hash table.
47 * The hash table needs a particular pointer to be the marker for a key that
48 * was deleted from the table, along with NULL for the "never allocated in the
49 * table" marker. Legacy GL allows any GLuint to be used as a GL object name,
52 * struct hash_table. We tell the hash table to use "1" as the deleted key
53 * value, so that we test the deleted-key-in-the-table path as best we can.
66 * are never deleted, we will never see a collision in the table, because the
67 * table resizes itself when it approaches full, and thus key % table_size ==
102 * The hash table data structure.
111 /** Value that would be in the table fo
139 _mesa_HashLockMutex(struct _mesa_HashTable *table) _mesa_HashLockMutex() argument
152 _mesa_HashUnlockMutex(struct _mesa_HashTable *table) _mesa_HashUnlockMutex() argument
195 _mesa_HashWalkMaybeLocked(const struct _mesa_HashTable *table, void (*callback)(void *data, void *userData), void *userData, bool locked) _mesa_HashWalkMaybeLocked() argument
206 _mesa_HashLookupMaybeLocked(struct _mesa_HashTable *table, GLuint key, bool locked) _mesa_HashLookupMaybeLocked() argument
216 _mesa_HashInsertMaybeLocked(struct _mesa_HashTable *table, GLuint key, void *data, GLboolean isGenName, bool locked) _mesa_HashInsertMaybeLocked() argument
227 _mesa_HashLockMaybeLocked(struct _mesa_HashTable *table, bool locked) _mesa_HashLockMaybeLocked() argument
234 _mesa_HashUnlockMaybeLocked(struct _mesa_HashTable *table, bool locked) _mesa_HashUnlockMaybeLocked() argument
[all...] |
| /third_party/skia/third_party/externals/imgui/ |
| H A D | imgui_tables.cpp | 37 // - BeginTable() user begin into a table
39 // | TableBeginInitMemory() - first time table is used
65 // - EndTable() user ends the table
82 // Y with ScrollX/ScrollY disabled: we output table directly in current window
88 // - outer_size.y = 0.0f -> Bottom-align, consistent with BeginChild(). Not recommended unless table is last item in parent window.
94 // - ImGuiTableFlags_NoHostExtendY -> Make outer height stop exactly at outer_size.y (prevent auto-extending table past the limit). Only available when ScrollX/ScrollY is disabled. Data below the limit will be clipped and not visible.
158 // By default a table with _ScrollX but without _Resizable will have column auto-resize.
333 // Acquire storage for the table in BeginTableEx()
334 ImGuiTable* table = g.Tables.GetOrAddByKey(id); in BeginTableEx() local
335 const int instance_no = (table in BeginTableEx()
572 TableBeginInitMemory(ImGuiTable* table, int columns_count) TableBeginInitMemory() argument
588 TableBeginApplyRequests(ImGuiTable* table) TableBeginApplyRequests() argument
656 TableSetupColumnFlags(ImGuiTable* table, ImGuiTableColumn* column, ImGuiTableColumnFlags flags_in) TableSetupColumnFlags() argument
715 TableUpdateLayout(ImGuiTable* table) TableUpdateLayout() argument
1136 TableUpdateBorders(ImGuiTable* table) TableUpdateBorders() argument
1199 ImGuiTable* table = g.CurrentTable; EndTable() local
1402 ImGuiTable* table = g.CurrentTable; TableSetupColumn() local
1470 ImGuiTable* table = g.CurrentTable; TableSetupScrollFreeze() local
1512 ImGuiTable* table = g.CurrentTable; TableGetColumnCount() local
1519 ImGuiTable* table = g.CurrentTable; TableGetColumnName() local
1527 TableGetColumnName(const ImGuiTable* table, int column_n) TableGetColumnName() argument
1546 ImGuiTable* table = g.CurrentTable; TableSetColumnEnabled() local
1562 ImGuiTable* table = g.CurrentTable; TableGetColumnFlags() local
1577 TableGetCellBgRect(const ImGuiTable* table, int column_n) TableGetCellBgRect() argument
1590 TableGetColumnResizeID(const ImGuiTable* table, int column_n, int instance_no) TableGetColumnResizeID() argument
1601 ImGuiTable* table = g.CurrentTable; TableGetHoveredColumn() local
1610 ImGuiTable* table = g.CurrentTable; TableSetBgColor() local
1662 ImGuiTable* table = g.CurrentTable; TableGetRowIndex() local
1672 ImGuiTable* table = g.CurrentTable; TableNextRow() local
1694 TableBeginRow(ImGuiTable* table) TableBeginRow() argument
1727 TableEndRow(ImGuiTable* table) TableEndRow() argument
1874 ImGuiTable* table = g.CurrentTable; TableGetColumnIndex() local
1884 ImGuiTable* table = g.CurrentTable; TableSetColumnIndex() local
1905 ImGuiTable* table = g.CurrentTable; TableNextColumn() local
1931 TableBeginCell(ImGuiTable* table, int column_n) TableBeginCell() argument
1989 TableEndCell(ImGuiTable* table) TableEndCell() argument
2021 TableGetMaxColumnWidth(const ImGuiTable* table, int column_n) TableGetMaxColumnWidth() argument
2053 TableGetColumnWidthAuto(ImGuiTable* table, ImGuiTableColumn* column) TableGetColumnWidthAuto() argument
2073 ImGuiTable* table = g.CurrentTable; TableSetColumnWidth() local
2153 TableSetColumnWidthAutoSingle(ImGuiTable* table, int column_n) TableSetColumnWidthAutoSingle() argument
2163 TableSetColumnWidthAutoAll(ImGuiTable* table) TableSetColumnWidthAutoAll() argument
2175 TableUpdateColumnsWeightFromWidth(ImGuiTable* table) TableUpdateColumnsWeightFromWidth() argument
2220 ImGuiTable* table = g.CurrentTable; TablePushBackgroundChannel() local
2232 ImGuiTable* table = g.CurrentTable; TablePopBackgroundChannel() local
2256 TableSetupDrawChannels(ImGuiTable* table) TableSetupDrawChannels() argument
2324 TableMergeDrawChannels(ImGuiTable* table) TableMergeDrawChannels() argument
2491 TableDrawBorders(ImGuiTable* table) TableDrawBorders() argument
2604 ImGuiTable* table = g.CurrentTable; TableGetSortSpecs() local
2626 TableFixColumnSortDirection(ImGuiTable* table, ImGuiTableColumn* column) TableFixColumnSortDirection() argument
2655 ImGuiTable* table = g.CurrentTable; TableSetColumnSortDirection() local
2685 TableSortSpecsSanitize(ImGuiTable* table) TableSortSpecsSanitize() argument
[all...] |
| /third_party/mesa3d/src/glx/ |
| H A 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
159 __glxHashTablePtr table; __glxHashCreate() local
178 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashDestroy() local
201 HashFind(__glxHashTablePtr table, unsigned long key, unsigned long *h) HashFind() argument
233 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashLookup() local
249 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashInsert() local
275 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashDelete() local
295 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashNext() local
313 __glxHashTablePtr table = (__glxHashTablePtr) t; __glxHashFirst() local
356 compute_dist(__glxHashTablePtr table) compute_dist() argument
377 check_table(__glxHashTablePtr table, unsigned long key, unsigned long value) check_table() argument
407 __glxHashTablePtr table; main() local
[all...] |
| /third_party/node/deps/v8/src/objects/ |
| H A D | ordered-hash-table.cc | 5 #include "src/objects/ordered-hash-table.h"
12 #include "src/objects/ordered-hash-table-inl.h"
37 Handle<Derived> table = Handle<Derived>::cast(backing_store); in Allocate() local
39 table->set(HashTableStartIndex() + i, Smi::FromInt(kNotFound)); in Allocate()
41 table->SetNumberOfBuckets(num_buckets); in Allocate()
42 table->SetNumberOfElements(0); in Allocate()
43 table->SetNumberOfDeletedElements(0); in Allocate()
44 return table; in Allocate()
52 // Requires that the map has already been set up in the roots table. in AllocateEmpty()
58 Handle<Derived> table in AllocateEmpty() local
67 EnsureGrowable( IsolateT* isolate, Handle<Derived> table) EnsureGrowable() argument
93 Shrink( Isolate* isolate, Handle<Derived> table) Shrink() argument
104 Clear( Isolate* isolate, Handle<Derived> table) Clear() argument
125 HasKey(Isolate* isolate, Derived table, Object key) HasKey() argument
167 Add(Isolate* isolate, Handle<OrderedHashSet> table, Handle<Object> key) Add() argument
202 ConvertToKeysArray( Isolate* isolate, Handle<OrderedHashSet> table, GetKeysConversion convert) ConvertToKeysArray() argument
242 Rehash( IsolateT* isolate, Handle<Derived> table) Rehash() argument
250 Rehash( IsolateT* isolate, Handle<Derived> table, int new_capacity) Rehash() argument
301 Rehash(Isolate* isolate, Handle<OrderedHashSet> table, int new_capacity) Rehash() argument
307 Rehash( Isolate* isolate, Handle<OrderedHashSet> table) Rehash() argument
312 Rehash( Isolate* isolate, Handle<OrderedHashMap> table) Rehash() argument
317 Rehash(Isolate* isolate, Handle<OrderedHashMap> table, int new_capacity) Rehash() argument
324 Rehash( IsolateT* isolate, Handle<OrderedNameDictionary> table, int new_capacity) Rehash() argument
336 Delete(Isolate* isolate, Derived table, Object key) Delete() argument
368 Add(Isolate* isolate, Handle<OrderedHashMap> table, Handle<Object> key, Handle<Object> value) Add() argument
447 Add( IsolateT* isolate, Handle<OrderedNameDictionary> table, Handle<Name> key, Handle<Object> value, PropertyDetails details) Add() argument
496 DeleteEntry( Isolate* isolate, Handle<OrderedNameDictionary> table, InternalIndex entry) DeleteEntry() argument
530 Handle<OrderedNameDictionary> table; Allocate() local
554 Handle<OrderedNameDictionary> table; AllocateEmpty() local
709 Add( Isolate* isolate, Handle<SmallOrderedHashSet> table, Handle<Object> key) Add() argument
741 Delete(Isolate* isolate, SmallOrderedHashSet table, Object key) Delete() argument
751 Add( Isolate* isolate, Handle<SmallOrderedHashMap> table, Handle<Object> key, Handle<Object> value) Add() argument
785 Delete(Isolate* isolate, SmallOrderedHashMap table, Object key) Delete() argument
816 Add( Isolate* isolate, Handle<SmallOrderedNameDictionary> table, Handle<Name> key, Handle<Object> value, PropertyDetails details) Add() argument
880 Delete(Isolate* isolate, Derived table, Object key) Delete() argument
900 DeleteEntry( Isolate* isolate, Handle<SmallOrderedNameDictionary> table, InternalIndex entry) DeleteEntry() argument
919 Rehash(Isolate* isolate, Handle<Derived> table, int new_capacity) Rehash() argument
956 Rehash( Isolate* isolate, Handle<SmallOrderedHashSet> table, int new_capacity) Rehash() argument
962 Rehash( Isolate* isolate, Handle<SmallOrderedHashMap> table, int new_capacity) Rehash() argument
968 Rehash( Isolate* isolate, Handle<SmallOrderedNameDictionary> table, int new_capacity) Rehash() argument
979 Shrink(Isolate* isolate, Handle<Derived> table) Shrink() argument
988 Grow( Isolate* isolate, Handle<Derived> table) Grow() argument
1103 Delete( Isolate* isolate, Handle<HeapObject> table, Handle<Object> key) Delete() argument
1116 HasKey( Isolate* isolate, Handle<HeapObject> table, Handle<Object> key) HasKey() argument
1145 AdjustRepresentation( Isolate* isolate, Handle<SmallOrderedHashMap> table) AdjustRepresentation() argument
1172 AdjustRepresentation( Isolate* isolate, Handle<SmallOrderedHashSet> table) AdjustRepresentation() argument
1197 AdjustRepresentation( Isolate* isolate, Handle<SmallOrderedNameDictionary> table) AdjustRepresentation() argument
1224 Add(Isolate* isolate, Handle<HeapObject> table, Handle<Object> key, Handle<Object> value) Add() argument
1249 Add(Isolate* isolate, Handle<HeapObject> table, Handle<Object> key) Add() argument
1272 Add( Isolate* isolate, Handle<HeapObject> table, Handle<Name> key, Handle<Object> value, PropertyDetails details) Add() argument
1297 SetEntry(HeapObject table, InternalIndex entry, Object key, Object value, PropertyDetails details) SetEntry() argument
1312 FindEntry(Isolate* isolate, HeapObject table, Name key) FindEntry() argument
1324 ValueAt(HeapObject table, InternalIndex entry) ValueAt() argument
1334 ValueAtPut(HeapObject table, InternalIndex entry, Object value) ValueAtPut() argument
1345 DetailsAt(HeapObject table, InternalIndex entry) DetailsAt() argument
1355 DetailsAtPut(HeapObject table, InternalIndex entry, PropertyDetails details) DetailsAtPut() argument
1366 Hash(HeapObject table) Hash() argument
1375 SetHash(HeapObject table, int hash) SetHash() argument
1384 KeyAt(HeapObject table, InternalIndex entry) KeyAt() argument
1394 NumberOfElements(HeapObject table) NumberOfElements() argument
1402 Capacity(HeapObject table) Capacity() argument
1410 Shrink( Isolate* isolate, Handle<HeapObject> table) Shrink() argument
1423 DeleteEntry( Isolate* isolate, Handle<HeapObject> table, InternalIndex entry) DeleteEntry() argument
1441 TableType table = TableType::cast(this->table()); Transition() local
1478 TableType table = TableType::cast(this->table()); HasMore() local
[all...] |
| /third_party/backends/testsuite/backend/genesys/ |
| H A D | tests_motor.cpp | 36 // created approximately from LIDE 110 slow table: { 62464, 7896, 2632, 0 } in test_create_slope_table_small_full_step()
42 auto table = create_slope_table_for_speed(slope, 5000, StepType::FULL, 4, 8, max_table_size); in test_create_slope_table_small_full_step() local
47 ASSERT_EQ(table.table, expected_table); in test_create_slope_table_small_full_step()
48 ASSERT_EQ(table.table.size(), 8u); in test_create_slope_table_small_full_step()
49 ASSERT_EQ(table.pixeltime_sum(), 156348u); in test_create_slope_table_small_full_step()
52 table = create_slope_table_for_speed(slope, 3000, StepType::FULL, 4, 8, max_table_size); in test_create_slope_table_small_full_step()
57 ASSERT_EQ(table.table, expected_tabl in test_create_slope_table_small_full_step()
72 auto table = create_slope_table_for_speed(slope, 2000, StepType::FULL, 4, 8, max_table_size); test_create_slope_table_small_full_step_target_speed_too_high() local
92 auto table = create_slope_table_for_speed(slope, 5000, StepType::HALF, 4, 8, max_table_size); test_create_slope_table_small_half_step() local
145 auto table = create_slope_table_for_speed(slope, 3000, StepType::FULL, 4, 8, max_table_size); test_create_slope_table_large_full_step() local
203 auto table = create_slope_table_for_speed(slope, 3000, StepType::HALF, 4, 8, max_table_size); test_create_slope_table_large_half_step() local
[all...] |
| /third_party/skia/third_party/externals/freetype/src/base/ |
| H A 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()
384 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) ft_mem_table_get_nodep() argument
463 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_Long size, FT_Long delta ) ft_mem_table_set() argument
562 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) ft_mem_table_remove() argument
639 FT_MemTable table = (FT_MemTable)memory->user; ft_mem_debug_alloc() local
675 FT_MemTable table = (FT_MemTable)memory->user; ft_mem_debug_free() local
701 FT_MemTable table = (FT_MemTable)memory->user; ft_mem_debug_realloc() local
783 FT_MemTable table; ft_mem_debug_init() local
860 FT_MemTable table = (FT_MemTable)memory->user; ft_mem_debug_done() local
899 FT_MemTable table = (FT_MemTable)memory->user; FT_DumpMemory() local
[all...] |
| /third_party/libdrm/ |
| H A 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
107 HashTablePtr table; drmHashCreate() local
118 HashTablePtr table = (HashTablePtr)t; drmHashDestroy() local
139 HashFind(HashTablePtr table, unsigned long key, unsigned long *h) HashFind() argument
169 HashTablePtr table = (HashTablePtr)t; drmHashLookup() local
182 HashTablePtr table = (HashTablePtr)t; drmHashInsert() local
201 HashTablePtr table = (HashTablePtr)t; drmHashDelete() local
218 HashTablePtr table = (HashTablePtr)t; drmHashNext() local
235 HashTablePtr table = (HashTablePtr)t; drmHashFirst() local
[all...] |
| /third_party/pulseaudio/speex/libspeexdsp/ |
| H A 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) in spx_fft()
116 spx_ifft(void *table, float *in, float *out) spx_ifft() argument
139 struct mkl_config *table = (struct mkl_config *) speex_alloc(sizeof(struct mkl_config)); spx_fft_init() local
149 spx_fft_destroy(void *table) spx_fft_destroy() argument
156 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) spx_fft() argument
162 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) spx_ifft() argument
182 struct ipp_fft_config *table; spx_fft_init() local
199 spx_fft_destroy(void *table) spx_fft_destroy() argument
207 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) spx_fft() argument
213 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) spx_ifft() argument
233 struct fftw_config *table = (struct fftw_config *) speex_alloc(sizeof(struct fftw_config)); spx_fft_init() local
244 spx_fft_destroy(void *table) spx_fft_destroy() argument
255 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) spx_fft() argument
273 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) spx_ifft() argument
306 struct kiss_config *table; spx_fft_init() local
314 spx_fft_destroy(void *table) spx_fft_destroy() argument
324 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) spx_fft() argument
336 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) spx_fft() argument
348 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) spx_ifft() argument
366 spx_fft_float(void *table, float *in, float *out) spx_fft_float() argument
402 spx_ifft_float(void *table, float *in, float *out) spx_ifft_float() argument
439 spx_fft_float(void *table, float *in, float *out) spx_fft_float() argument
443 spx_ifft_float(void *table, float *in, float *out) spx_ifft_float() argument
[all...] |
| /third_party/mesa3d/src/mesa/program/ |
| H A D | symbol_table.c | 35 * Link to the next symbol in the table with the same name
43 * Link to the next symbol in the table with the same scope
76 /** Hash table containing all symbols in the symbol table. */
87 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table) in _mesa_symbol_table_pop_scope() argument
89 struct scope_level *const scope = table->current_scope; in _mesa_symbol_table_pop_scope()
92 table->current_scope = scope->next; in _mesa_symbol_table_pop_scope()
93 table->depth--; in _mesa_symbol_table_pop_scope()
99 struct hash_entry *hte = _mesa_hash_table_search(table->ht, in _mesa_symbol_table_pop_scope()
103 * the hash table t in _mesa_symbol_table_pop_scope()
119 _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table) _mesa_symbol_table_push_scope() argument
134 find_symbol(struct _mesa_symbol_table *table, const char *name) find_symbol() argument
150 _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *table, const char *name) _mesa_symbol_table_symbol_scope() argument
165 _mesa_symbol_table_find_symbol(struct _mesa_symbol_table *table, const char *name) _mesa_symbol_table_find_symbol() argument
177 _mesa_symbol_table_add_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) _mesa_symbol_table_add_symbol() argument
217 _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) _mesa_symbol_table_replace_symbol() argument
232 _mesa_symbol_table_add_global_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) _mesa_symbol_table_add_global_symbol() argument
292 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); _mesa_symbol_table_ctor() local
306 _mesa_symbol_table_dtor(struct _mesa_symbol_table *table) _mesa_symbol_table_dtor() argument
[all...] |
| /third_party/node/deps/uvwasi/src/ |
| H A D | fd_table.c | 19 struct uvwasi_fd_table_t* table, in uvwasi__insert_stdio()
38 table, in uvwasi__insert_stdio()
60 struct uvwasi_fd_table_t* table, in uvwasi_fd_table_insert()
119 uv_rwlock_wrlock(&table->rwlock); in uvwasi_fd_table_insert()
121 /* Check that there is room for a new item. If there isn't, grow the table. */ in uvwasi_fd_table_insert()
122 if (table->used >= table->size) { in uvwasi_fd_table_insert()
123 new_size = table->size * 2; in uvwasi_fd_table_insert()
124 new_fds = uvwasi__realloc(uvwasi, table->fds, new_size * sizeof(*new_fds)); in uvwasi_fd_table_insert()
131 for (i = table in uvwasi_fd_table_insert()
18 uvwasi__insert_stdio(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table, const uvwasi_fd_t fd, const uvwasi_fd_t expected, const char* name) uvwasi__insert_stdio() argument
59 uvwasi_fd_table_insert(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table, uv_file fd, uv_tcp_t* sock, const char* mapped_path, const char* real_path, uvwasi_filetype_t type, uvwasi_rights_t rights_base, uvwasi_rights_t rights_inheriting, int preopen, struct uvwasi_fd_wrap_t** wrap) uvwasi_fd_table_insert() argument
190 struct uvwasi_fd_table_t* table; uvwasi_fd_table_init() local
241 uvwasi_fd_table_free(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table) uvwasi_fd_table_free() argument
270 uvwasi_fd_table_insert_preopen(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table, const uv_file fd, const char* path, const char* real_path) uvwasi_fd_table_insert_preopen() argument
308 uvwasi_fd_table_insert_preopen_socket(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table, uv_tcp_t* sock) uvwasi_fd_table_insert_preopen_socket() argument
328 uvwasi_fd_table_get(struct uvwasi_fd_table_t* table, const uvwasi_fd_t id, struct uvwasi_fd_wrap_t** wrap, uvwasi_rights_t rights_base, uvwasi_rights_t rights_inheriting) uvwasi_fd_table_get() argument
352 uvwasi_fd_table_get_nolock(struct uvwasi_fd_table_t* table, const uvwasi_fd_t id, struct uvwasi_fd_wrap_t** wrap, uvwasi_rights_t rights_base, uvwasi_rights_t rights_inheriting) uvwasi_fd_table_get_nolock() argument
382 uvwasi_fd_table_remove_nolock(uvwasi_t* uvwasi, struct uvwasi_fd_table_t* table, const uvwasi_fd_t id) uvwasi_fd_table_remove_nolock() argument
406 uvwasi_fd_table_renumber(struct uvwasi_s* uvwasi, struct uvwasi_fd_table_t* table, const uvwasi_fd_t dst, const uvwasi_fd_t src) uvwasi_fd_table_renumber() argument
470 uvwasi_fd_table_lock(struct uvwasi_fd_table_t* table) uvwasi_fd_table_lock() argument
479 uvwasi_fd_table_unlock(struct uvwasi_fd_table_t* table) uvwasi_fd_table_unlock() argument
[all...] |
| /third_party/gn/src/gn/ |
| H A D | hash_table_base_unittest.cc | 19 // Because the derived table HashTableTest owns all pointer objects, it
96 // IMPORTANT NOTE: Because the table contains bare owning pointers, we
126 // Discard all valid Int pointers in the hash table. in ~TestHashTable()
131 // Return true iff the table contains |x|.
139 // Try to insert |x| in the table. Returns true on success, or false if
153 // Try to remove |x| from the table. Return true on success, or false
194 TestHashTable table; in TEST() local
195 EXPECT_TRUE(table.empty()); in TEST()
196 EXPECT_EQ(table.size(), 0u); in TEST()
197 EXPECT_EQ(table in TEST()
208 TestHashTable table; TEST() local
237 TestHashTable table; TEST() local
282 TestHashTable table; TEST() local
318 TestHashTable table; TEST() local
338 TestHashTable table; TEST() local
[all...] |
| /third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/sfntly/table/opentype/component/ |
| H A D | RuleExtractor.java | 1 package com.google.typography.font.sfntly.table.opentype.component;
3 import com.google.typography.font.sfntly.table.opentype.AlternateSubst;
4 import com.google.typography.font.sfntly.table.opentype.ChainContextSubst;
5 import com.google.typography.font.sfntly.table.opentype.ClassDefTable;
6 import com.google.typography.font.sfntly.table.opentype.ContextSubst;
7 import com.google.typography.font.sfntly.table.opentype.CoverageTable;
8 import com.google.typography.font.sfntly.table.opentype.ExtensionSubst;
9 import com.google.typography.font.sfntly.table.opentype.LigatureSubst;
10 import com.google.typography.font.sfntly.table.opentype.LookupListTable;
11 import com.google.typography.font.sfntly.table
48 extract(LigatureSubst table) extract() argument
60 extract(CoverageTable table) extract() argument
78 extract(RecordsTable<NumRecord> table) extract() argument
86 extract(RangeRecordTable table) extract() argument
108 extract(LigatureSet table) extract() argument
118 extract(Ligature table) extract() argument
129 extract(SingleSubst table) extract() argument
152 extract(MultipleSubst table) extract() argument
170 extract(AlternateSubst table) extract() argument
189 extract(ContextSubst table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
201 extract(SubRuleSetArray table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
215 extract( Integer firstGlyph, SubRuleSet table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
228 extract( Integer firstGlyph, SubRule table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
239 extract( SubClassSetArray table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
256 extract(SubClassSet table, int firstInputClass, Map<Integer, GlyphGroup> inputClassDef, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
266 extract(SubClassRule table, int firstInputClass, Map<Integer, GlyphGroup> inputClassDef, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
274 extract( ChainContextSubst table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
288 extract( ChainSubRuleSetArray table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
302 extract( Integer firstGlyph, ChainSubRuleSet table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
311 extract( Integer firstGlyph, ChainSubRule table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
333 extract( ChainSubClassSetArray table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
356 extract(ClassDefTable table) extract() argument
367 extract(InnerArrayFmt1 table) extract() argument
382 extract(ChainSubClassSet table, Map<Integer, GlyphGroup> backtrackClassDef, int firstInputClass, Map<Integer, GlyphGroup> inputClassDef, Map<Integer, GlyphGroup> lookAheadClassDef, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
402 extract(ChainSubClassRule table, Map<Integer, GlyphGroup> backtrackClassDef, int firstInputClass, Map<Integer, GlyphGroup> inputClassDef, Map<Integer, GlyphGroup> lookAheadClassDef, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
447 extract(InnerArraysFmt3 table, LookupListTable lookupListTable, Map<Integer, Set<Rule>> allLookupRules) extract() argument
459 extract(ReverseChainSingleSubst table) extract() argument
504 extract(LookupListTable table) extract() argument
571 extract(CoverageArray table) extract() argument
[all...] |
| /third_party/mesa3d/src/glx/tests/ |
| H A 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
416 void __indirect_glColorTable(GLenum 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()
742 _glapi_table *table = __glXNewIndirectAPI(); TEST_F() local
[all...] |
| /third_party/libdrm/tests/ |
| H A D | hash.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
104 compute_dist(HashTablePtr table) compute_dist() argument
124 check_table(HashTablePtr table, unsigned long key, void * value) check_table() argument
157 HashTablePtr table; main() local
[all...] |
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/ |
| H A D | eloop.c | 84 struct eloop_sock *table; member
92 int count; /* sum of all table counts */
141 static void eloop_trace_sock_add_ref(struct eloop_sock_table *table) in eloop_trace_sock_add_ref() argument
144 if (table == NULL || table->table == NULL) in eloop_trace_sock_add_ref()
146 for (i = 0; i < table->count; i++) { in eloop_trace_sock_add_ref()
147 wpa_trace_add_ref(&table->table[i], eloop, in eloop_trace_sock_add_ref()
148 table in eloop_trace_sock_add_ref()
155 eloop_trace_sock_remove_ref(struct eloop_sock_table *table) eloop_trace_sock_remove_ref() argument
334 eloop_sock_table_add_sock(struct eloop_sock_table *table, int sock, eloop_sock_handler handler, void *eloop_data, void *user_data) eloop_sock_table_add_sock() argument
459 eloop_sock_table_remove_sock(struct eloop_sock_table *table, int sock) eloop_sock_table_remove_sock() argument
594 eloop_sock_table_dispatch_table(struct eloop_sock_table *table, struct pollfd **pollfds_map, int max_pollfd_map, short int revents) eloop_sock_table_dispatch_table() argument
649 eloop_sock_table_set_fds(struct eloop_sock_table *table, fd_set *fds) eloop_sock_table_set_fds() argument
666 eloop_sock_table_dispatch(struct eloop_sock_table *table, fd_set *fds) eloop_sock_table_dispatch() argument
692 struct eloop_sock *table; eloop_sock_table_dispatch() local
714 struct eloop_sock *table; eloop_sock_table_dispatch() local
731 eloop_sock_table_requeue(struct eloop_sock_table *table) eloop_sock_table_requeue() argument
771 eloop_sock_table_destroy(struct eloop_sock_table *table) eloop_sock_table_destroy() argument
826 struct eloop_sock_table *table; eloop_register_sock() local
837 struct eloop_sock_table *table; eloop_unregister_sock() local
[all...] |
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/ |
| H A D | eloop.c | 84 struct eloop_sock *table; member
92 size_t count; /* sum of all table counts */
141 static void eloop_trace_sock_add_ref(struct eloop_sock_table *table) in eloop_trace_sock_add_ref() argument
145 if (table == NULL || table->table == NULL) in eloop_trace_sock_add_ref()
147 for (i = 0; i < table->count; i++) { in eloop_trace_sock_add_ref()
148 wpa_trace_add_ref(&table->table[i], eloop, in eloop_trace_sock_add_ref()
149 table in eloop_trace_sock_add_ref()
156 eloop_trace_sock_remove_ref(struct eloop_sock_table *table) eloop_trace_sock_remove_ref() argument
336 eloop_sock_table_add_sock(struct eloop_sock_table *table, int sock, eloop_sock_handler handler, void *eloop_data, void *user_data) eloop_sock_table_add_sock() argument
462 eloop_sock_table_remove_sock(struct eloop_sock_table *table, int sock) eloop_sock_table_remove_sock() argument
597 eloop_sock_table_dispatch_table(struct eloop_sock_table *table, struct pollfd **pollfds_map, int max_pollfd_map, short int revents) eloop_sock_table_dispatch_table() argument
652 eloop_sock_table_set_fds(struct eloop_sock_table *table, fd_set *fds) eloop_sock_table_set_fds() argument
669 eloop_sock_table_dispatch(struct eloop_sock_table *table, fd_set *fds) eloop_sock_table_dispatch() argument
695 struct eloop_sock *table; eloop_sock_table_dispatch() local
717 struct eloop_sock *table; eloop_sock_table_dispatch() local
734 eloop_sock_table_requeue(struct eloop_sock_table *table) eloop_sock_table_requeue() argument
775 eloop_sock_table_destroy(struct eloop_sock_table *table) eloop_sock_table_destroy() argument
831 struct eloop_sock_table *table; eloop_register_sock() local
842 struct eloop_sock_table *table; eloop_unregister_sock() local
[all...] |
| /third_party/skia/third_party/externals/freetype/src/otvalid/ |
| H A D | otvgpos.c | 5 * OpenType GPOS table validation (body).
35 otv_Anchor_validate( FT_Bytes table,
39 otv_MarkArray_validate( FT_Bytes table,
59 otv_x_sxy( FT_Bytes table, in otv_x_sxy() argument
62 FT_Bytes p = table; in otv_x_sxy()
90 otv_Anchor_validate( table + anchor_offset, otvalid ); in otv_x_sxy()
93 otv_Anchor_validate( table + anchor_offset, otvalid ); in otv_x_sxy()
107 otv_u_O_O_u_O_O( FT_Bytes table, in otv_u_O_O_u_O_O() argument
110 FT_Bytes p = table; in otv_u_O_O_u_O_O()
127 otv_Coverage_validate( table in otv_u_O_O_u_O_O()
169 otv_ValueRecord_validate( FT_Bytes table, FT_UInt format, OTV_Validator otvalid ) otv_ValueRecord_validate() argument
243 otv_Anchor_validate( FT_Bytes table, OTV_Validator otvalid ) otv_Anchor_validate() argument
309 otv_MarkArray_validate( FT_Bytes table, OTV_Validator otvalid ) otv_MarkArray_validate() argument
348 otv_SinglePos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_SinglePos_validate() argument
428 otv_PairSet_validate( FT_Bytes table, FT_UInt format1, FT_UInt format2, OTV_Validator otvalid ) otv_PairSet_validate() argument
472 otv_PairPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_PairPos_validate() argument
579 otv_CursivePos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_CursivePos_validate() argument
657 otv_MarkBasePos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_MarkBasePos_validate() argument
698 otv_MarkLigPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_MarkLigPos_validate() argument
739 otv_MarkMarkPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_MarkMarkPos_validate() argument
780 otv_ContextPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_ContextPos_validate() argument
839 otv_ChainContextPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_ChainContextPos_validate() argument
900 otv_ExtensionPos_validate( FT_Bytes table, OTV_Validator otvalid ) otv_ExtensionPos_validate() argument
961 otv_GPOS_subtable_validate( FT_Bytes table, OTV_Validator otvalid ) otv_GPOS_subtable_validate() argument
982 otv_GPOS_validate( FT_Bytes table, FT_UInt glyph_count, FT_Validator ftvalid ) otv_GPOS_validate() argument
[all...] |
| /third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/sfntly/sample/sfview/ |
| H A D | OtTableTagger.java | 7 import com.google.typography.font.sfntly.table.FontDataTable;
8 import com.google.typography.font.sfntly.table.opentype.AlternateSubst;
9 import com.google.typography.font.sfntly.table.opentype.ChainContextSubst;
10 import com.google.typography.font.sfntly.table.opentype.ClassDefTable;
11 import com.google.typography.font.sfntly.table.opentype.ContextSubst;
12 import com.google.typography.font.sfntly.table.opentype.CoverageTable;
13 import com.google.typography.font.sfntly.table.opentype.ExtensionSubst;
14 import com.google.typography.font.sfntly.table.opentype.FeatureListTable;
15 import com.google.typography.font.sfntly.table.opentype.FeatureTable;
16 import com.google.typography.font.sfntly.table
81 tagTable(FontDataTable table) tagTable() argument
112 tableLabel(FontDataTable table) tableLabel() argument
121 tag(FontDataTable table) tag() argument
736 getTagMethod(FontDataTable table) getTagMethod() argument
[all...] |
| /third_party/lzma/C/ |
| H A D | 7zCrcOpt.c | 10 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
12 UInt32 Z7_FASTCALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table);
13 UInt32 Z7_FASTCALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table)
in CrcUpdateT4() argument
22 (table + 0x300)[((v ) & 0xFF)]
in CrcUpdateT4()
23 ^ (table + 0x200)[((v >> 8) & 0xFF)]
in CrcUpdateT4()
24 ^ (table + 0x100)[((v >> 16) & 0xFF)]
in CrcUpdateT4()
25 ^ (table + 0x000)[((v >> 24))];
in CrcUpdateT4()
32 UInt32 Z7_FASTCALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table);
33 UInt32 Z7_FASTCALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table)
in CrcUpdateT8() argument
43 (table in CrcUpdateT8()
68 CrcUpdateT1_BeT4(UInt32 v, const void *data, size_t size, const UInt32 *table) CrcUpdateT1_BeT4() argument
89 CrcUpdateT1_BeT8(UInt32 v, const void *data, size_t size, const UInt32 *table) CrcUpdateT1_BeT8() argument
[all...] |
| /third_party/node/test/fixtures/wpt/wasm/jsapi/table/ |
| H A D | grow.any.js | 11 const table = new WebAssembly.Table(argument);
12 assert_throws_js(TypeError, () => table.grow());
42 const table = new WebAssembly.Table(argument);
43 assert_equal_to_array(table, nulls(5), "before");
45 const result = table.grow(3);
47 assert_equal_to_array(table, nulls(8), "after");
52 const table = new WebAssembly.Table(argument);
53 assert_equal_to_array(table, nulls(3), "before");
55 const result = table.grow(2);
57 assert_equal_to_array(table, null
[all...] |
| /third_party/skia/third_party/externals/angle2/src/third_party/volk/ |
| H A D | volk.c | 33 static void volkGenLoadDeviceTable(struct VolkDeviceTable* table, void* context, PFN_vkVoidFunction (*load)(void*, const char*));
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 (*load)(void*, const char*)) in volkGenLoadDeviceTable() argument
727 table->vkAllocateCommandBuffers = (PFN_vkAllocateCommandBuffers)load(context, "vkAllocateCommandBuffers"); in volkGenLoadDeviceTable()
728 table->vkAllocateDescriptorSets = (PFN_vkAllocateDescriptorSets)load(context, "vkAllocateDescriptorSets"); 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 in volkGenLoadDeviceTable()
[all...] |
| /third_party/backends/backend/genesys/ |
| H A D | motor.cpp | 64 if (count > table.size() || count < step_multiplier) { in slice_steps()
68 table.resize(count); in slice_steps()
74 if (table.empty()) { in expand_table()
75 throw SaneException("Can't expand empty table"); in expand_table()
78 table.resize(table.size() + count, table.back()); in expand_table()
84 pixeltime_sum_ = std::accumulate(table.begin(), table.end(), in generate_pixeltime_sum()
110 MotorSlopeTable table; in create_slope_table_for_speed() local
[all...] |