| /dports/devel/p5-Cache-FastMmap/Cache-FastMmap-1.57/lib/Cache/ |
| H A D | FastMmap.pm | 788 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
819 fc_write($Cache, $HashSlot, $_[1], $Val, -1, 0);
875 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
1018 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
1030 my ($DidDel, $Flags) = fc_delete($Cache, $HashSlot, $_[1]);
1071 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
1077 (undef, $Flags) = fc_delete($Cache, $HashSlot, $_[1]);
1243 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
1252 (undef, $HashSlot) = fc_hash($Cache, $FinalKey);
1287 my ($HashPage, $HashSlot) = fc_hash($Cache, $_[1]);
[all …]
|
| /dports/math/flexfloat/flexfloat-6db869087a12d763a94d53e9b0a9d52def270865/include/ |
| H A D | flexfloat.h | 258 } HashSlot; typedef
261 extern HashSlot op_stats[FLEXFLOAT_STATS_MAX_TYPES];
262 extern HashSlot cast_stats[FLEXFLOAT_STATS_MAX_TYPES*FLEXFLOAT_STATS_MAX_TYPES];
|
| /dports/math/flexfloat/flexfloat-6db869087a12d763a94d53e9b0a9d52def270865/src/ |
| H A D | flexfloat.c | 684 HashSlot op_stats[FLEXFLOAT_STATS_MAX_TYPES];
685 HashSlot cast_stats[FLEXFLOAT_STATS_MAX_TYPES*FLEXFLOAT_STATS_MAX_TYPES];
687 void * ht_search(HashSlot* hashArray, uint32_t hashIndex, uint32_t key, uint32_t arraySize) { in ht_search()
699 void ht_insert(HashSlot* hashArray, uint32_t hashIndex, uint32_t key, void *value, uint32_t arraySi… in ht_insert()
747 memset(op_stats, 0, sizeof(HashSlot) * FLEXFLOAT_STATS_MAX_TYPES); in ff_clear_stats()
750 memset(cast_stats, 0, sizeof(HashSlot) * FLEXFLOAT_STATS_MAX_TYPES*FLEXFLOAT_STATS_MAX_TYPES); in ff_clear_stats()
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/emulators/qemu/qemu-6.2.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/emulators/qemu5/qemu-5.2.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/emulators/qemu5/qemu-5.2.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/BaseTools/Source/C/BrotliCompress/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; typedef
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/emulators/qemu/qemu-6.2.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/sysutils/edk2/edk2-edk2-stable202102/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; typedef
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/sysutils/edk2/edk2-edk2-stable202102/BaseTools/Source/C/BrotliCompress/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot {
17 } HashSlot;
295 std::vector<HashSlot> map;
307 HashSlot& item = map[slot];
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/research/ |
| H A D | durchschlag.cc | 14 typedef struct HashSlot { struct
17 } HashSlot; argument
295 std::vector<HashSlot> map; in durchschlag_prepare()
307 HashSlot& item = map[slot]; in durchschlag_prepare()
|
| /dports/net/kamailio/kamailio-5.4.5/src/modules/nat_traversal/ |
| H A D | nat_traversal.c | 157 typedef struct HashSlot struct
162 } HashSlot; argument
167 HashSlot *slots;
561 table->slots = shm_malloc(sizeof(HashSlot) * table->size); in HashTable_new()
567 memset(table->slots, 0, sizeof(HashSlot) * table->size); in HashTable_new()
1625 HashSlot *slot; in keepalive_timer()
|
| /dports/multimedia/gpac-mp4box/gpac-1.0.0/src/utils/ |
| H A D | Remotery.c | 1988 } HashSlot; typedef
1998 HashSlot* slots;
2010 table->slots = (HashSlot*)rmtMalloc(table->max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Constructor()
2013 memset(table->slots, 0, table->max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Constructor()
2036 HashSlot* slot = NULL; in rmtHashTable_Insert()
2080 HashSlot* new_slots = NULL; in rmtHashTable_Resize()
2081 HashSlot* old_slots = table->slots; in rmtHashTable_Resize()
2092 new_slots = (HashSlot*)rmtMalloc(new_max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Resize()
2095 memset(new_slots, 0, new_max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Resize()
2105 HashSlot* slot = old_slots + i; in rmtHashTable_Resize()
[all …]
|
| /dports/multimedia/gpac-libgpac/gpac-1.0.0/src/utils/ |
| H A D | Remotery.c | 1988 } HashSlot; typedef
1998 HashSlot* slots;
2010 table->slots = (HashSlot*)rmtMalloc(table->max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Constructor()
2013 memset(table->slots, 0, table->max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Constructor()
2036 HashSlot* slot = NULL; in rmtHashTable_Insert()
2080 HashSlot* new_slots = NULL; in rmtHashTable_Resize()
2081 HashSlot* old_slots = table->slots; in rmtHashTable_Resize()
2092 new_slots = (HashSlot*)rmtMalloc(new_max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Resize()
2095 memset(new_slots, 0, new_max_nb_slots * sizeof(HashSlot)); in rmtHashTable_Resize()
2105 HashSlot* slot = old_slots + i; in rmtHashTable_Resize()
[all …]
|