Searched refs:blocks (Results 1 - 25 of 234) sorted by relevance

12345678910

/freebsd-12-stable/contrib/subversion/subversion/libsvn_delta/
H A Dxdelta.c42 /* Size of the blocks we compute checksums for. This was chosen out of
121 /* A hash table, using open addressing, of the blocks of the source. */ struct
122 struct blocks
144 /* The vector of blocks. A pos value of NO_POSITION represents an unused
170 data into the table BLOCKS. Ignore true duplicates, i.e. blocks with
173 add_block(struct blocks *blocks, apr_uint32_t adlersum, apr_uint32_t pos)
175 apr_uint32_t h = hash_func(adlersum) & blocks->max;
178 for (; blocks->slots[h].pos != NO_POSITION; h = (h + 1) & blocks
172 add_block(struct blocks *blocks, apr_uint32_t adlersum, apr_uint32_t pos) argument
192 find_block(const struct blocks *blocks, apr_uint32_t adlersum, const char* data) argument
211 init_blocks_table(const char *data, apr_size_t datalen, struct blocks *blocks, apr_pool_t *pool) argument
270 find_match(const struct blocks *blocks, const apr_uint32_t rolling, const char *a, apr_size_t asize, const char *b, apr_size_t bsize, apr_size_t *bposp, apr_size_t *aposp, apr_size_t pending_insert_start) argument
378 struct blocks blocks; local
[all...]
/freebsd-12-stable/contrib/xz/src/liblzma/common/
H A Dindex_hash.c49 lzma_index_hash_info blocks; member in struct:lzma_index_hash_s
83 index_hash->blocks.blocks_size = 0;
84 index_hash->blocks.uncompressed_size = 0;
85 index_hash->blocks.count = 0;
86 index_hash->blocks.index_list_size = 0;
97 (void)lzma_check_init(&index_hash->blocks.check, LZMA_CHECK_BEST);
116 // Get the size of the Index from ->blocks instead of ->records for
119 return index_size(index_hash->blocks.count,
120 index_hash->blocks.index_list_size);
155 return_if_error(hash_append(&index_hash->blocks,
[all...]
/freebsd-12-stable/contrib/subversion/subversion/libsvn_subr/
H A Dbit_array.c28 /* We allocate our data buffer in blocks of this size (in bytes).
48 * blocks are implicitly empty. Only if a bit will be set to 1, will the
56 /* Data buffer of BLOCK_COUNT blocks, BLOCK_SIZE_BITS each. Never NULL.
58 unsigned char **blocks; member in struct:svn_bit_array__t
68 * return the number of blocks entries to allocate for the data buffer. */
72 /* We allocate a power of two of bytes but at least 16 blocks. */
93 array->blocks = apr_pcalloc(pool,
94 array->block_count * sizeof(*array->blocks));
136 memcpy(new_blocks, array->blocks,
138 array->blocks
[all...]
/freebsd-12-stable/contrib/wpa/src/crypto/
H A Daes-cbc.c29 int i, j, blocks; local
39 blocks = data_len / AES_BLOCK_SIZE;
40 for (i = 0; i < blocks; i++) {
65 int i, j, blocks; local
75 blocks = data_len / AES_BLOCK_SIZE;
76 for (i = 0; i < blocks; i++) {
H A Dcrypto_internal-cipher.c106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks;
[all...]
/freebsd-12-stable/crypto/openssl/crypto/modes/
H A Dctr128.c172 size_t blocks = len / 16; local
178 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28))
179 blocks = (1U << 28);
184 * amount of blocks to the exact overflow point...
186 ctr32 += (u32)blocks;
187 if (ctr32 < blocks) {
188 blocks -= ctr32;
191 (*func) (in, out, blocks, key, ivec);
197 blocks *= 16;
198 len -= blocks;
[all...]
/freebsd-12-stable/crypto/openssl/crypto/evp/
H A De_rc4_hmac_md5.c33 MD5_CTX *ctx, const void *inp, size_t blocks);
72 md5_off = MD5_CBLOCK - key->md.num, blocks; local
89 if (plen > md5_off && (blocks = (plen - md5_off) / MD5_CBLOCK) &&
95 &key->md, in + md5_off, blocks);
96 blocks *= MD5_CBLOCK;
97 rc4_off += blocks;
98 md5_off += blocks;
99 key->md.Nh += blocks >> 29;
100 key->md.Nl += blocks <<= 3;
101 if (key->md.Nl < (unsigned int)blocks)
[all...]
H A De_aes_cbc_hmac_sha1.c53 void aesni_cbc_sha1_enc(const void *inp, void *out, size_t blocks,
57 void aesni256_cbc_sha1_dec(const void *inp, void *out, size_t blocks,
140 int blocks; member in struct:__anon8099
148 int blocks; member in struct:__anon8100
166 } blocks[8]; local
177 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0)
209 memcpy(blocks[0].c, key->md.data, 8);
210 seqnum = BSWAP8(blocks[0].q[0]);
226 blocks[i].q[0] = BSWAP8(seqnum + i);
229 blocks[
411 size_t aes_off = 0, blocks; local
[all...]
H A De_aes_cbc_hmac_sha256.c54 int aesni_cbc_sha256_enc(const void *inp, void *out, size_t blocks,
136 int blocks; member in struct:__anon8107
144 int blocks; member in struct:__anon8108
162 } blocks[8]; local
173 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0)
206 memcpy(blocks[0].c, key->md.data, 8);
207 seqnum = BSWAP8(blocks[0].q[0]);
226 blocks[i].q[0] = BSWAP8(seqnum + i);
229 blocks[i].c[j] = ((u8 *)key->md.data)[j] + carry;
230 carry = (blocks[
427 size_t aes_off = 0, blocks; local
[all...]
/freebsd-12-stable/sys/dev/qlnx/qlnxe/
H A Decore_cxt_api.h47 u8 *blocks[MAX_TID_BLOCKS]; /* 4K */ member in struct:ecore_tid_mem
/freebsd-12-stable/crypto/openssl/crypto/poly1305/
H A Dpoly1305_local.h24 poly1305_blocks_f blocks; member in struct:poly1305_context::__anon8193
/freebsd-12-stable/sys/dev/usb/
H A Dusb_msctest.h49 uint8_t iface_index, uint32_t lba, uint32_t blocks,
52 uint8_t iface_index, uint32_t lba, uint32_t blocks,
/freebsd-12-stable/contrib/jemalloc/include/jemalloc/internal/
H A Dbase_structs.h13 /* Next block in list of base's blocks. */
45 /* Chain of all blocks associated with base. */
46 base_block_t *blocks; member in struct:base_s
48 /* Heap of extents that track unused trailing space within blocks. */
H A Dhash.h84 const uint32_t *blocks = (const uint32_t *) (data + nblocks*4); local
88 uint32_t k1 = hash_get_block_32(blocks, i);
140 const uint32_t *blocks = (const uint32_t *) (data + nblocks*16); local
144 uint32_t k1 = hash_get_block_32(blocks, i*4 + 0);
145 uint32_t k2 = hash_get_block_32(blocks, i*4 + 1);
146 uint32_t k3 = hash_get_block_32(blocks, i*4 + 2);
147 uint32_t k4 = hash_get_block_32(blocks, i*4 + 3);
237 const uint64_t *blocks = (const uint64_t *) (data); local
241 uint64_t k1 = hash_get_block_64(blocks, i*2 + 0);
242 uint64_t k2 = hash_get_block_64(blocks,
[all...]
/freebsd-12-stable/contrib/apr-util/buckets/
H A Dapr_buckets_alloc.c42 apr_memnode_t *blocks; member in struct:apr_bucket_alloc_t
49 apr_allocator_free(list->allocator, list->blocks);
104 list->blocks = block;
116 apr_allocator_free(list->allocator, list->blocks);
160 apr_memnode_t *active = list->blocks;
172 list->blocks = apr_allocator_alloc(list->allocator, ALLOC_AMT);
173 if (!list->blocks) {
174 list->blocks = active;
177 list->blocks->next = active;
178 active = list->blocks;
[all...]
/freebsd-12-stable/sys/dev/drm2/radeon/
H A Dradeon_mem.c139 struct mem_block *blocks = malloc(sizeof(*blocks), local
142 if (!blocks)
147 free(blocks, DRM_MEM_DRIVER);
151 blocks->start = start;
152 blocks->size = size;
153 blocks->file_priv = NULL;
154 blocks->next = blocks->prev = *heap;
157 (*heap)->next = (*heap)->prev = blocks;
[all...]
/freebsd-12-stable/sys/dev/liquidio/
H A Dlio_main.h50 /** Swap 8B blocks */
52 lio_swap_8B_data(uint64_t *data, uint32_t blocks) argument
55 while (blocks) {
57 blocks--;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyUtilities.h41 for (MachineBasicBlock *MBB : Unit->blocks())
/freebsd-12-stable/sys/dev/mmc/
H A Dmmc_ioctl.h40 u_int blocks; member in struct:mmc_ioc_cmd
/freebsd-12-stable/contrib/gcc/
H A Dtracer.c155 Return number of basic blocks recorded. */
196 /* Look for basic blocks in frequency order, construct traces and tail duplicate
202 fibnode_t *blocks = XCNEWVEC (fibnode_t, last_basic_block); local
225 blocks[bb->index] = fibheap_insert (heap, -bb->frequency,
249 blocks[bb->index] = NULL;
259 if (blocks[bb->index])
261 fibheap_delete_node (heap, blocks[bb->index]);
262 blocks[bb->index] = NULL;
269 if (blocks[bb2->index])
271 fibheap_delete_node (heap, blocks[bb
[all...]
H A Dgcov.c24 /* ??? Print a list of the ten blocks with the highest execution counts,
25 and list the line numbers corresponding to those blocks. Also, perhaps
29 /* ??? Should have an option to print the number of basic blocks, and the
74 /* Describes an arc between two basic blocks. */
78 /* source and destination blocks. */
113 predecessor blocks. */
149 } line; /* Valid until blocks are linked onto lines */
152 /* Single line graph cycle workspace. Used for all-blocks
156 } cycle; /* Used in all-blocks mode, after blocks ar
176 block_t *blocks; member in struct:function_info
223 block_t *blocks; /* blocks which start on this line. Used member in union:line_info::__anon1494
[all...]
/freebsd-12-stable/sys/dev/drm/
H A Dsis_ds.c166 PMemBlock blocks; local
171 blocks = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), DRM_MEM_DRIVER);
172 if (blocks != NULL) {
173 blocks->ofs = ofs;
174 blocks->size = size;
175 blocks->free = 1;
176 return (memHeap_t *) blocks;
/freebsd-12-stable/contrib/ofed/opensm/include/opensm/
H A Dosm_pkey.h86 cl_ptr_vector_t blocks; member in struct:osm_pkeybl
102 * blocks
103 * The IBA defined blocks of pkey values, updated from the subnet
106 * The blocks of pkey values, will be used for updates by SM
116 * Tracks the number of blocks having non-zero pkeys
119 * The maximal number of blocks this partition table might hold
134 * 'blocks' vector should be used to store pkey values obtained from
138 * The only pkey values stored in 'blocks' vector will be mapped with
237 * Obtain the number of blocks in IB PKey table
244 return ((uint16_t) (cl_ptr_vector_get_size(&p_pkey_tbl->blocks)));
[all...]
/freebsd-12-stable/sbin/newfs_nandfs/
H A Dnewfs_nandfs.c81 uint32_t *blocks; member in struct:file_info
168 "\t-B blocks-per-segment\n"
336 user_files[i].blocks = malloc(user_files[i].nblocks * sizeof(uint32_t));
341 ifile.blocks = malloc(ifile.nblocks * sizeof(uint32_t));
347 cpfile.blocks = malloc(cpfile.nblocks * sizeof(uint32_t));
355 debug("bad blocks found: extra space for sufile");
359 sufile.blocks = malloc(sufile.nblocks * sizeof(uint32_t));
364 datfile.blocks = malloc(datfile.nblocks * sizeof(uint32_t));
377 user_files[i].blocks[j] = start_block++;
382 ifile.blocks[
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DBasicGOTAndStubsBuilder.h26 // We're going to be adding new blocks, but we don't want to iterate over
27 // the newly added ones, so just copy the existing blocks out.
28 std::vector<Block *> Blocks(G.blocks().begin(), G.blocks().end());

Completed in 347 milliseconds

12345678910