Home
last modified time | relevance | path

Searched full:chunk (Results 1 – 25 of 906) sorted by relevance

12345678910>>...37

/freebsd-src/contrib/llvm-project/clang/lib/AST/Interp/
H A DInterpStack.cpp26 if (Chunk && Chunk->Next) in clear()
27 std::free(Chunk->Next); in clear()
28 if (Chunk) in clear()
29 std::free(Chunk); in clear()
30 Chunk = nullptr; in clear()
40 if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) { in grow()
41 if (Chunk && Chunk in grow()
[all...]
/freebsd-src/contrib/llvm-project/lld/COFF/
H A DDLL.h20 // call create() to populate the chunk vectors.
29 std::vector<Chunk *> dirs;
30 std::vector<Chunk *> lookups;
31 std::vector<Chunk *> addresses;
32 std::vector<Chunk *> hints;
33 std::vector<Chunk *> dllNames;
44 std::vector<Chunk *> getChunks();
45 std::vector<Chunk *> getDataChunks();
46 ArrayRef<Chunk *> getCodeChunks() { return thunks; } in getCodeChunks()
47 ArrayRef<Chunk *> getCodePData() { return pdata; } in getCodePData()
[all …]
H A DChunks.h52 // A Chunk represents a chunk of data that will occupy space in the
56 class Chunk {
66 // Returns the size of this chunk (even if this is a common or BSS.)
69 // Returns chunk alignment in power of two form. Value values are powers of in setAlignment()
73 // Update the chunk section alignment measured in bytes. Internally alignment in setAlignment()
84 // Write this chunk to a mmap'ed file, assuming Buf is pointing to
91 // larger than 2GB. Chunks are always laid as part of the image, so Chunk RVAs in setRVA()
102 // Returns the section name if this is a section chunk. in setOutputSectionIdx()
107 // chunk ha
180 NonSectionChunk(Kind k = OtherKind) : Chunk(k) {} Chunk() function
797 SectionChunk chunk; global() variable
[all...]
H A DDLL.cpp39 // A chunk for the import descriptor table.
61 // A chunk for the import descriptor table.
64 explicit LookupChunk(COFFLinkerContext &ctx, Chunk *c) in LookupChunk()
77 Chunk *hintName;
83 // A chunk for the import descriptor table.
84 // This chunk represent import-by-ordinal symbols.
110 // A chunk for the import descriptor table.
113 explicit ImportDirectoryChunk(Chunk *n) : dllName(n) { setAlignment(4); } in ImportDirectoryChunk()
125 Chunk *dllName;
126 Chunk *lookupTa
[all...]
/freebsd-src/sys/dev/mlx4/mlx4_core/
H A Dmlx4_icm.c48 * per chunk.
55 static void mlx4_free_icm_pages(struct mlx4_dev *dev, struct mlx4_icm_chunk *chunk) in mlx4_free_icm_pages() argument
59 if (chunk->nsg > 0) in mlx4_free_icm_pages()
60 pci_unmap_sg(dev->persist->pdev, chunk->mem, chunk->npages, in mlx4_free_icm_pages()
63 for (i = 0; i < chunk->npages; ++i) in mlx4_free_icm_pages()
64 __free_pages(sg_page(&chunk->mem[i]), in mlx4_free_icm_pages()
65 get_order(chunk->mem[i].length)); in mlx4_free_icm_pages()
68 static void mlx4_free_icm_coherent(struct mlx4_dev *dev, struct mlx4_icm_chunk *chunk) in mlx4_free_icm_coherent() argument
72 for (i = 0; i < chunk->npages; ++i) in mlx4_free_icm_coherent()
74 chunk->mem[i].length, in mlx4_free_icm_coherent()
[all …]
/freebsd-src/contrib/libucl/src/
H A Ducl_parser.c46 * @return new position in chunk
48 #define ucl_chunk_skipc(chunk, p) \ argument
51 (chunk)->line ++; \
52 (chunk)->column = 0; \
54 else (chunk)->column ++; \
56 (chunk)->pos ++; \
57 (chunk)->remain --; \
64 struct ucl_chunk *chunk = parser->chunks; in ucl_set_err() local
73 if (chunk->pos < chunk->end) { in ucl_set_err()
74 if (isgraph (*chunk->pos)) { in ucl_set_err()
[all …]
/freebsd-src/sys/cddl/dev/kinst/
H A Dtrampoline.c75 struct trampchunk *chunk; in kinst_trampchunk_alloc() local
93 * Allocate virtual memory for the trampoline chunk. The returned in kinst_trampchunk_alloc()
101 KINST_LOG("trampoline chunk allocation failed: %d", error); in kinst_trampchunk_alloc()
111 /* Allocate a tracker for this chunk. */ in kinst_trampchunk_alloc()
112 chunk = malloc(sizeof(*chunk), M_KINST, M_WAITOK); in kinst_trampchunk_alloc()
113 chunk->addr = (void *)trampaddr; in kinst_trampchunk_alloc()
114 BIT_FILL(KINST_TRAMPS_PER_CHUNK, &chunk->free); in kinst_trampchunk_alloc()
116 TAILQ_INSERT_HEAD(&kinst_trampchunks, chunk, next); in kinst_trampchunk_alloc()
118 return (chunk); in kinst_trampchunk_alloc()
122 kinst_trampchunk_free(struct trampchunk *chunk) in kinst_trampchunk_free() argument
[all …]
/freebsd-src/sys/contrib/openzfs/module/zfs/
H A Dzap_leaf.c30 * chunk number n means l_chunk[n], even though the header precedes it.
47 #define CHAIN_END 0xffff /* end of the chunk chain */
179 uint_t chunk = zap_leaf_phys(l)->l_hdr.lh_freelist; in zap_leaf_chunk_alloc() local
180 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); in zap_leaf_chunk_alloc()
181 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE); in zap_leaf_chunk_alloc()
184 ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next; in zap_leaf_chunk_alloc()
188 return (chunk); in zap_leaf_chunk_alloc()
192 zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk) in zap_leaf_chunk_free() argument
194 struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free; in zap_leaf_chunk_free()
196 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNK in zap_leaf_chunk_free()
227 uint16_t chunk = zap_leaf_chunk_alloc(l); zap_leaf_array_create() local
254 uint16_t chunk = *chunkp; zap_leaf_array_free() local
269 zap_leaf_array_read(zap_leaf_t * l,uint16_t chunk,int array_int_len,int array_len,int buf_int_len,uint64_t buf_len,void * buf) zap_leaf_array_read() argument
328 zap_leaf_array_match(zap_leaf_t * l,zap_name_t * zn,uint_t chunk,int array_numints) zap_leaf_array_match() argument
389 uint16_t chunk = *chunkp; zap_leaf_lookup() local
436 for (uint16_t chunk = zap_leaf_phys(l)->l_hash[lh]; zap_leaf_lookup_closest() local
551 uint16_t chunk; zap_entry_create() local
653 for (uint16_t chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash); zap_entry_normalization_conflict() local
705 zap_leaf_transfer_array(zap_leaf_t * l,uint16_t chunk,zap_leaf_t * nl) zap_leaf_transfer_array() argument
738 uint16_t chunk = zap_leaf_chunk_alloc(nl); zap_leaf_transfer_entry() local
819 uint_t chunk = zap_leaf_phys(l)->l_hash[i]; zap_leaf_stats() local
[all...]
/freebsd-src/contrib/libdiff/test/
H A Dexpect004.diff4 +int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n)
6 + if (chunk == NULL) return 0;
8 + return start <= chunk->length && n <= chunk->length - start;
11 void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n)
19 -int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n)
21 - if (chunk == NULL) return 0;
23 - return start <= chunk->length && n <= chunk->length - start;
H A Dexpect104.diff4 +int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n)
6 + if (chunk == NULL) return 0;
8 + return start <= chunk->length && n <= chunk->length - start;
11 void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n)
19 -int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n)
21 - if (chunk == NULL) return 0;
23 - return start <= chunk->length && n <= chunk->length - start;
H A Dtest004.left.txt1 void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n)
9 int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n)
11 if (chunk == NULL) return 0;
13 return start <= chunk->length && n <= chunk->length - start;
/freebsd-src/contrib/libdiff/lib/
H A Ddiff_main.c39 diff_chunk_type(const struct diff_chunk *chunk) in diff_chunk_type() argument
41 if (!chunk->left_count && !chunk->right_count) in diff_chunk_type()
43 if (!chunk->solved) in diff_chunk_type()
45 if (!chunk->right_count) in diff_chunk_type()
47 if (!chunk->left_count) in diff_chunk_type()
49 if (chunk->left_count != chunk->right_count) in diff_chunk_type()
234 const struct diff_chunk *chunk) in diff_state_add_solved_chunk() argument
242 … to solved chunks; make sure that adjacent chunks of same type are combined, and that a minus chunk in diff_state_add_solved_chunk()
243 * never directly follows a plus chunk. */ in diff_state_add_solved_chunk()
248 new_t = diff_chunk_type(chunk); in diff_state_add_solved_chunk()
[all …]
/freebsd-src/sys/dev/mthca/
H A Dmthca_memfree.c47 * per chunk.
63 static void mthca_free_icm_pages(struct mthca_dev *dev, struct mthca_icm_chunk *chunk) in mthca_free_icm_pages() argument
67 if (chunk->nsg > 0) in mthca_free_icm_pages()
68 pci_unmap_sg(dev->pdev, chunk->mem, chunk->npages, in mthca_free_icm_pages()
71 for (i = 0; i < chunk->npages; ++i) in mthca_free_icm_pages()
72 __free_pages(sg_page(&chunk->mem[i]), in mthca_free_icm_pages()
73 get_order(chunk->mem[i].length)); in mthca_free_icm_pages()
76 static void mthca_free_icm_coherent(struct mthca_dev *dev, struct mthca_icm_chunk *chunk) in mthca_free_icm_coherent() argument
80 for (i = 0; i < chunk->npages; ++i) { in mthca_free_icm_coherent()
81 dma_free_coherent(&dev->pdev->dev, chunk->mem[i].length, in mthca_free_icm_coherent()
[all …]
/freebsd-src/usr.sbin/makefs/zfs/
H A Dobjset.c79 struct objset_dnode_chunk *chunk; in objset_alloc() local
91 chunk = ecalloc(1, sizeof(*chunk)); in objset_alloc()
92 chunk->nextfree = 1; in objset_alloc()
93 STAILQ_INSERT_HEAD(&os->dnodechunks, chunk, next); in objset_alloc()
113 struct objset_dnode_chunk *chunk, *tmp; in _objset_write() local
121 STAILQ_FOREACH_SAFE(chunk, &os->dnodechunks, next, tmp) { in _objset_write()
124 assert(chunk->nextfree > 0); in _objset_write()
125 assert(chunk->nextfree <= os->dnodecount); in _objset_write()
126 assert(chunk->nextfree <= DNODES_PER_CHUNK); in _objset_write()
128 for (i = 0; i < chunk->nextfree; i += DNODES_PER_BLOCK) { in _objset_write()
[all …]
/freebsd-src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dcombined.h14 #include "chunk.h"
69 // Chunk recycling function, returns a quarantined chunk to the backend, in recycle()
72 Chunk::UnpackedHeader Header; in recycle()
73 Chunk::loadHeader(Allocator.Cookie, Ptr, &Header); in recycle()
74 if (UNLIKELY(Header.State != Chunk::State::Quarantined)) in recycle()
77 Header.State = Chunk::State::Available; in recycle()
78 Chunk::storeHeader(Allocator.Cookie, Ptr, &Header); in recycle()
91 sizeof(QuarantineBatch) + Chunk::getHeaderSize()); in allocate()
98 Chunk in allocate()
762 uptr Chunk; iterateOverChunks() local
1176 getChunkFromBlock(uptr Block,uptr * Chunk,Chunk::UnpackedHeader * Header) getChunkFromBlock() argument
[all...]
H A Dwrappers_cpp.cpp39 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::New); in operator new()
44 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::NewArray); in operator new[]()
50 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::New); in operator new()
56 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::NewArray); in operator new[]()
61 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::New, in operator new()
67 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::NewArray, in operator new[]()
74 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::New, in operator new()
81 void *Ptr = Allocator.allocate(size, scudo::Chunk::Origin::NewArray, in operator new[]()
89 Allocator.deallocate(ptr, scudo::Chunk::Origin::New); in operator delete()
93 Allocator.deallocate(ptr, scudo::Chunk::Origin::NewArray); in operator delete[]()
[all …]
/freebsd-src/crypto/openssl/engines/asm/
H A De_padlock-x86_64.pl47 $chunk="%rbx";
318 mov \$$PADLOCK_CHUNK,$chunk
321 cmp $chunk,$len
322 cmovc $len,$chunk # chunk=len>PADLOCK_CHUNK?PADLOCK_CHUNK:len
323 and $chunk,%rax # out_misaligned?chunk:0
324 mov $len,$chunk
326 and \$$PADLOCK_CHUNK-1,$chunk # chunk%=PADLOCK_CHUNK
329 cmovz %rax,$chunk # chunk=chunk?:PADLOCK_CHUNK
337 mov \$$PADLOCK_CHUNK,$chunk
339 cmovz $chunk,%rax
[all …]
/freebsd-src/sys/dev/irdma/
H A Dirdma_pble.c51 struct irdma_chunk *chunk; in irdma_destroy_pble_prm() local
55 chunk = (struct irdma_chunk *)(&pinfo->clist)->next; in irdma_destroy_pble_prm()
56 list_del(&chunk->list); in irdma_destroy_pble_prm()
57 if (chunk->type == PBLE_SD_PAGED) in irdma_destroy_pble_prm()
58 irdma_pble_free_paged_mem(chunk); in irdma_destroy_pble_prm()
59 bitmap_free(chunk->bitmapbuf); in irdma_destroy_pble_prm()
60 kfree(chunk->chunkmem.va); in irdma_destroy_pble_prm()
128 struct irdma_chunk *chunk = info->chunk; in add_sd_direct() local
141 chunk->type = PBLE_SD_CONTIGOUS; in add_sd_direct()
145 chunk->size = info->pages << HMC_PAGED_BP_SHIFT; in add_sd_direct()
[all …]
/freebsd-src/crypto/openssl/providers/implementations/ciphers/
H A Dcipher_des_hw.c111 size_t chunk = MAXCHUNK; in cipher_hw_des_cfb64_cipher() local
115 if (len < chunk) in cipher_hw_des_cfb64_cipher()
116 chunk = len; in cipher_hw_des_cfb64_cipher()
117 while (len > 0 && len >= chunk) { in cipher_hw_des_cfb64_cipher()
118 DES_cfb64_encrypt(in, out, (long)chunk, key, (DES_cblock *)ctx->iv, in cipher_hw_des_cfb64_cipher()
120 len -= chunk; in cipher_hw_des_cfb64_cipher()
121 in += chunk; in cipher_hw_des_cfb64_cipher()
122 out += chunk; in cipher_hw_des_cfb64_cipher()
123 if (len < chunk) in cipher_hw_des_cfb64_cipher()
124 chunk = len; in cipher_hw_des_cfb64_cipher()
[all …]
H A Dciphercommon_hw.c149 size_t chunk = MAXCHUNK; in ossl_cipher_hw_chunked_cfb8() local
151 if (inl < chunk) in ossl_cipher_hw_chunked_cfb8()
152 chunk = inl; in ossl_cipher_hw_chunked_cfb8()
153 while (inl > 0 && inl >= chunk) { in ossl_cipher_hw_chunked_cfb8()
155 inl -= chunk; in ossl_cipher_hw_chunked_cfb8()
156 in += chunk; in ossl_cipher_hw_chunked_cfb8()
157 out += chunk; in ossl_cipher_hw_chunked_cfb8()
158 if (inl < chunk) in ossl_cipher_hw_chunked_cfb8()
159 chunk = inl; in ossl_cipher_hw_chunked_cfb8()
167 size_t chunk = MAXCHUNK; in ossl_cipher_hw_chunked_cfb128() local
[all …]
/freebsd-src/share/doc/papers/malloc/
H A Dmalloc.ms26 front and if a free chunk big enough to hold the request is found,
27 it is returned, if the free chunk is bigger than the size requested,
28 a new free chunk is made from the excess and put back on the list.
30 When a chunk is
32 the chunk is found in the list, its status
39 a chunk, trying to avoid copying the contents if possible.
42 The typical pattern of use is to malloc(3) a chunk of the maximum size
43 needed, read in the data and adjust the size of the chunk to match the
48 plus the state of the chunk right before the chunk itself.
55 If in freeing a chunk, we end up with the last chunk on the list being
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ExpandImm.cpp20 /// Helper function which extracts the specified 16-bit chunk from a
23 assert(ChunkIdx < 4 && "Out of range chunk index specified!"); in getChunk()
28 /// Check whether the given 16-bit chunk replicated to full 64-bit width
30 static bool canUseOrr(uint64_t Chunk, uint64_t &Encoding) { in canUseOrr() argument
31 Chunk = (Chunk << 48) | (Chunk << 32) | (Chunk << 16) | Chunk; in canUseOrr()
33 return AArch64_AM::processLogicalImmediate(Chunk, 6 in canUseOrr()
54 for (const auto &Chunk : Counts) { tryToreplicateChunks() local
106 isStartChunk(uint64_t Chunk) isStartChunk() argument
116 isEndChunk(uint64_t Chunk) isEndChunk() argument
159 int64_t Chunk = getChunk(UImm, Idx); trySequenceOfOnes() local
193 const uint64_t Chunk = getChunk(UImm, Idx); trySequenceOfOnes() local
534 const unsigned Chunk = (Imm >> Shift) & Mask; expandMOVImm() local
[all...]
/freebsd-src/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_sched.cpp79 typename traits_t<T>::signed_t chunk in __kmp_for_static_init()
141 " %%%s, %%%s) incr=%%%s chunk=%%%s signed?<%s>\n", in __kmp_for_static_init()
145 *pstride, incr, chunk)); in __kmp_for_static_init()
364 KMP_DEBUG_ASSERT(chunk != 0); in __kmp_for_static_init()
365 if (chunk < 1) in __kmp_for_static_init()
366 chunk = 1; in __kmp_for_static_init()
367 else if ((UT)chunk > trip_count) in __kmp_for_static_init()
368 chunk = trip_count; in __kmp_for_static_init()
369 nchunks = (trip_count) / (UT)chunk + (trip_count % (UT)chunk in __kmp_for_static_init()
78 __kmp_for_static_init(ident_t * loc,kmp_int32 global_tid,kmp_int32 schedtype,kmp_int32 * plastiter,T * plower,T * pupper,typename traits_t<T>::signed_t * pstride,typename traits_t<T>::signed_t incr,typename traits_t<T>::signed_t chunk,void * codeptr) __kmp_for_static_init() argument
476 __kmp_dist_for_static_init(ident_t * loc,kmp_int32 gtid,kmp_int32 schedule,kmp_int32 * plastiter,T * plower,T * pupper,T * pupperDist,typename traits_t<T>::signed_t * pstride,typename traits_t<T>::signed_t incr,typename traits_t<T>::signed_t chunk,void * codeptr) __kmp_dist_for_static_init() argument
742 __kmp_team_static_init(ident_t * loc,kmp_int32 gtid,kmp_int32 * p_last,T * p_lb,T * p_ub,typename traits_t<T>::signed_t * p_st,typename traits_t<T>::signed_t incr,typename traits_t<T>::signed_t chunk) __kmp_team_static_init() argument
875 __kmpc_for_static_init_4(ident_t * loc,kmp_int32 gtid,kmp_int32 schedtype,kmp_int32 * plastiter,kmp_int32 * plower,kmp_int32 * pupper,kmp_int32 * pstride,kmp_int32 incr,kmp_int32 chunk) __kmpc_for_static_init_4() argument
892 __kmpc_for_static_init_4u(ident_t * loc,kmp_int32 gtid,kmp_int32 schedtype,kmp_int32 * plastiter,kmp_uint32 * plower,kmp_uint32 * pupper,kmp_int32 * pstride,kmp_int32 incr,kmp_int32 chunk) __kmpc_for_static_init_4u() argument
908 __kmpc_for_static_init_8(ident_t * loc,kmp_int32 gtid,kmp_int32 schedtype,kmp_int32 * plastiter,kmp_int64 * plower,kmp_int64 * pupper,kmp_int64 * pstride,kmp_int64 incr,kmp_int64 chunk) __kmpc_for_static_init_8() argument
925 __kmpc_for_static_init_8u(ident_t * loc,kmp_int32 gtid,kmp_int32 schedtype,kmp_int32 * plastiter,kmp_uint64 * plower,kmp_uint64 * pupper,kmp_int64 * pstride,kmp_int64 incr,kmp_int64 chunk) __kmpc_for_static_init_8u() argument
970 __kmpc_dist_for_static_init_4(ident_t * loc,kmp_int32 gtid,kmp_int32 schedule,kmp_int32 * plastiter,kmp_int32 * plower,kmp_int32 * pupper,kmp_int32 * pupperD,kmp_int32 * pstride,kmp_int32 incr,kmp_int32 chunk) __kmpc_dist_for_static_init_4() argument
983 __kmpc_dist_for_static_init_4u(ident_t * loc,kmp_int32 gtid,kmp_int32 schedule,kmp_int32 * plastiter,kmp_uint32 * plower,kmp_uint32 * pupper,kmp_uint32 * pupperD,kmp_int32 * pstride,kmp_int32 incr,kmp_int32 chunk) __kmpc_dist_for_static_init_4u() argument
996 __kmpc_dist_for_static_init_8(ident_t * loc,kmp_int32 gtid,kmp_int32 schedule,kmp_int32 * plastiter,kmp_int64 * plower,kmp_int64 * pupper,kmp_int64 * pupperD,kmp_int64 * pstride,kmp_int64 incr,kmp_int64 chunk) __kmpc_dist_for_static_init_8() argument
1009 __kmpc_dist_for_static_init_8u(ident_t * loc,kmp_int32 gtid,kmp_int32 schedule,kmp_int32 * plastiter,kmp_uint64 * plower,kmp_uint64 * pupper,kmp_uint64 * pupperD,kmp_int64 * pstride,kmp_int64 incr,kmp_int64 chunk) __kmpc_dist_for_static_init_8u() argument
1047 __kmpc_team_static_init_4(ident_t * loc,kmp_int32 gtid,kmp_int32 * p_last,kmp_int32 * p_lb,kmp_int32 * p_ub,kmp_int32 * p_st,kmp_int32 incr,kmp_int32 chunk) __kmpc_team_static_init_4() argument
1059 __kmpc_team_static_init_4u(ident_t * loc,kmp_int32 gtid,kmp_int32 * p_last,kmp_uint32 * p_lb,kmp_uint32 * p_ub,kmp_int32 * p_st,kmp_int32 incr,kmp_int32 chunk) __kmpc_team_static_init_4u() argument
1071 __kmpc_team_static_init_8(ident_t * loc,kmp_int32 gtid,kmp_int32 * p_last,kmp_int64 * p_lb,kmp_int64 * p_ub,kmp_int64 * p_st,kmp_int64 incr,kmp_int64 chunk) __kmpc_team_static_init_8() argument
1083 __kmpc_team_static_init_8u(ident_t * loc,kmp_int32 gtid,kmp_int32 * p_last,kmp_uint64 * p_lb,kmp_uint64 * p_ub,kmp_int64 * p_st,kmp_int64 incr,kmp_int64 chunk) __kmpc_team_static_init_8u() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Support/BLAKE3/
H A Dblake3.c82 // Chaining values within a given chunk (specifically the compress_in_place
159 // Given some input larger than one chunk, return the number of bytes that in parent_output()
170 // on a single thread. Write out the chunk chaining values and return the
195 // Hash the remaining partial chunk, if there is one. Note that the empty in compress_chunks_parallel()
196 // chunk (meaning the empty message) is a different codepath. in compress_chunks_parallel()
263 // not used when the whole input is only 1 chunk long; that's a different
274 // Note that the single chunk case does *not* bump the SIMD degree up to 2 in blake3_compress_subtree_wide()
276 // this gives us the option of multi-threading even the 2-chunk case, which in blake3_compress_subtree_wide()
300 // sure there are two outputs. Except, as noted above, at the chunk in blake3_compress_subtree_wide()
301 // level, where we allow degree=1. (Note that the 1-chunk in blake3_compress_subtree_wide()
[all...]
/freebsd-src/sys/contrib/openzfs/module/icp/algs/blake3/
H A Dblake3.c126 * Chaining values within a given chunk (specifically the compress_in_place
211 * Given some input larger than one chunk, return the number of bytes that
228 * on a single thread. Write out the chunk chaining values and return the
250 * Hash the remaining partial chunk, if there is one. Note that the in compress_chunks_parallel()
251 * empty chunk (meaning the empty message) is a different codepath. in compress_chunks_parallel()
315 * not used when the whole input is only 1 chunk long; that's a different
327 * Note that the single chunk case does *not* bump the SIMD degree up in blake3_compress_subtree_wide()
330 * 2-chunk case, which can help performance on smaller platforms. in blake3_compress_subtree_wide()
363 * at the chunk level, where we allow degree=1. (Note that the in blake3_compress_subtree_wide()
364 * 1-chunk-input case is a different codepath.) in blake3_compress_subtree_wide()
[all …]

12345678910>>...37