/freebsd-10.0-release/contrib/subversion/subversion/libsvn_delta/ |
H A D | xdelta.c | 41 /* Size of the blocks we compute checksums for. This was chosen out of 111 /* A hash table, using open addressing, of the blocks of the source. */ struct 112 struct blocks 123 /* The vector of blocks. A pos value of NO_POSITION represents an unused 140 data into the table BLOCKS. Ignore true duplicates, i.e. blocks with 143 add_block(struct blocks *blocks, apr_uint32_t adlersum, apr_uint32_t pos) 145 apr_uint32_t h = hash_func(adlersum) & blocks->max; 148 for (; blocks->slots[h].pos != NO_POSITION; h = (h + 1) & blocks 142 add_block(struct blocks *blocks, apr_uint32_t adlersum, apr_uint32_t pos) argument 161 find_block(const struct blocks *blocks, apr_uint32_t adlersum, const char* data) argument 180 init_blocks_table(const char *data, apr_size_t datalen, struct blocks *blocks, apr_pool_t *pool) argument 303 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 410 struct blocks blocks; local [all...] |
/freebsd-10.0-release/contrib/xz/src/liblzma/common/ |
H A D | index_hash.c | 49 lzma_index_hash_info blocks; member in struct:lzma_index_hash_s 82 index_hash->blocks.blocks_size = 0; 83 index_hash->blocks.uncompressed_size = 0; 84 index_hash->blocks.count = 0; 85 index_hash->blocks.index_list_size = 0; 96 (void)lzma_check_init(&index_hash->blocks.check, LZMA_CHECK_BEST); 114 // Get the size of the Index from ->blocks instead of ->records for 117 return index_size(index_hash->blocks.count, 118 index_hash->blocks.index_list_size); 153 return_if_error(hash_append(&index_hash->blocks, [all...] |
/freebsd-10.0-release/contrib/wpa/src/crypto/ |
H A D | aes-cbc.c | 29 int i, j, blocks; local 36 blocks = data_len / AES_BLOCK_SIZE; 37 for (i = 0; i < blocks; i++) { 62 int i, j, blocks; local 69 blocks = data_len / AES_BLOCK_SIZE; 70 for (i = 0; i < blocks; i++) {
|
H A D | crypto_internal-cipher.c | 106 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-10.0-release/crypto/openssl/crypto/modes/ |
H A D | ctr128.c | 210 size_t blocks = len/16; local 216 if (sizeof(size_t)>sizeof(unsigned int) && blocks>(1U<<28)) 217 blocks = (1U<<28); 222 * amount of blocks to the exact overflow point... 224 ctr32 += (u32)blocks; 225 if (ctr32 < blocks) { 226 blocks -= ctr32; 229 (*func)(in,out,blocks,key,ivec); 234 blocks *= 16; 235 len -= blocks; [all...] |
/freebsd-10.0-release/crypto/openssl/crypto/evp/ |
H A D | e_rc4_hmac_md5.c | 81 MD5_CTX *ctx,const void *inp,size_t blocks); 123 blocks; local 137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) && 143 &key->md,in+md5_off,blocks); 144 blocks *= MD5_CBLOCK; 145 rc4_off += blocks; 146 md5_off += blocks; 147 key->md.Nh += blocks>>29; 148 key->md.Nl += blocks<<=3; 149 if (key->md.Nl<(unsigned int)blocks) ke [all...] |
/freebsd-10.0-release/contrib/apr-util/buckets/ |
H A D | apr_buckets_alloc.c | 41 apr_memnode_t *blocks; member in struct:apr_bucket_alloc_t 48 apr_allocator_free(list->allocator, list->blocks); 103 list->blocks = block; 115 apr_allocator_free(list->allocator, list->blocks); 128 apr_memnode_t *active = list->blocks; 140 list->blocks = apr_allocator_alloc(list->allocator, ALLOC_AMT); 141 if (!list->blocks) { 142 list->blocks = active; 145 list->blocks->next = active; 146 active = list->blocks; [all...] |
/freebsd-10.0-release/crypto/openssl/engines/ccgost/ |
H A D | gost89.h | 22 /* Internal representation of GOST substitution blocks */ 41 /* Note: encrypt and decrypt expect full blocks--padding blocks is 45 /* Encrypt several full blocks in ECB mode */ 46 void gost_enc(gost_ctx *ctx, const byte *clear,byte *cipher, int blocks); 47 /* Decrypt several full blocks in ECB mode */ 48 void gost_dec(gost_ctx *ctx, const byte *cipher,byte *clear, int blocks); 49 /* Encrypts several full blocks in CFB mode using 8byte IV */ 50 void gost_enc_cfb(gost_ctx *ctx,const byte *iv,const byte *clear,byte *cipher,int blocks); 51 /* Decrypts several full blocks i [all...] |
/freebsd-10.0-release/sys/dev/drm/ |
H A D | radeon_mem.c | 140 struct mem_block *blocks = drm_alloc(sizeof(*blocks), DRM_MEM_BUFS); local 142 if (!blocks) 147 drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFS); 151 blocks->start = start; 152 blocks->size = size; 153 blocks->file_priv = NULL; 154 blocks->next = blocks [all...] |
H A D | i915_mem.c | 190 struct mem_block *blocks = drm_alloc(sizeof(*blocks), DRM_MEM_BUFLISTS); local 192 if (!blocks) 197 drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFLISTS); 201 blocks->start = start; 202 blocks->size = size; 203 blocks->file_priv = NULL; 204 blocks->next = blocks [all...] |
H A D | sis_ds.c | 166 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-10.0-release/sys/dev/drm2/radeon/ |
H A D | radeon_mem.c | 139 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-10.0-release/contrib/ofed/management/opensm/include/opensm/ |
H A D | osm_pkey.h | 84 cl_ptr_vector_t blocks; member in struct:osm_pkeybl 93 * blocks 94 * The IBA defined blocks of pkey values, updated from the subnet 97 * The blocks of pkey values, will be used for updates by SM 107 * Tracks the number of blocks having non-zero pkeys 110 * The maximal number of blocks this partition table might hold 116 * 'blocks' vector should be used to store pkey values obtained from 120 * The only pkey values stored in 'blocks' vector will be mapped with 219 * Obtain the number of blocks in IB PKey table 226 return ((uint16_t) (cl_ptr_vector_get_size(&p_pkey_tbl->blocks))); [all...] |
/freebsd-10.0-release/release/powerpc/ |
H A D | make-memstick.sh | 46 # how many blocks to transfer "+ 2" is to account for truncation in the 51 blocks=$(($filesize / ${BLOCKSIZE} + 1728)) 52 dd if=/dev/zero of=${2} bs=${BLOCKSIZE} count=${blocks}
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | gcov.c | 24 /* ??? 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::__anon1047 [all...] |
H A D | tracer.c | 155 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 D | tree-ssa-sink.c | 218 bitmap blocks = BITMAP_ALLOC (NULL); local 227 bitmap_clear (blocks); 249 BITMAP_FREE (blocks); 252 bitmap_set_bit (blocks, useblock->index); 255 commondom = BASIC_BLOCK (bitmap_first_set_bit (blocks)); 256 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, j, bi) 259 BITMAP_FREE (blocks); 310 We can't sink statements that end basic blocks without splitting the 346 find the nearest common dominator of all of the predecessor blocks, since
|
/freebsd-10.0-release/contrib/ofed/management/opensm/opensm/ |
H A D | osm_pkey.c | 61 cl_ptr_vector_construct(&p_pkey_tbl->blocks); 73 num_blocks = (uint16_t) (cl_ptr_vector_get_size(&p_pkey_tbl->blocks)); 75 if ((p_block = cl_ptr_vector_get(&p_pkey_tbl->blocks, i))) 77 cl_ptr_vector_destroy(&p_pkey_tbl->blocks); 94 cl_ptr_vector_init(&p_pkey_tbl->blocks, 0, 1); 139 if (cl_ptr_vector_get_size(&p_pkey_tbl->blocks) > block) 141 (ib_pkey_table_t *) cl_ptr_vector_get(&p_pkey_tbl->blocks, 152 cl_ptr_vector_set(&p_pkey_tbl->blocks, block, p_pkey_block); 167 for (b = 0; b < cl_ptr_vector_get_size(&p_pkey_tbl->blocks); b++) { 169 p_pkey_block = cl_ptr_vector_get(&p_pkey_tbl->blocks, [all...] |
/freebsd-10.0-release/contrib/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 95 const uint32_t *blocks = (const uint32_t *) (data + nblocks*4); local 99 uint32_t k1 = hash_get_block_32(blocks, i); 152 const uint32_t *blocks = (const uint32_t *) (data + nblocks*16); local 156 uint32_t k1 = hash_get_block_32(blocks, i*4 + 0); 157 uint32_t k2 = hash_get_block_32(blocks, i*4 + 1); 158 uint32_t k3 = hash_get_block_32(blocks, i*4 + 2); 159 uint32_t k4 = hash_get_block_32(blocks, i*4 + 3); 250 const uint64_t *blocks = (const uint64_t *) (data); local 254 uint64_t k1 = hash_get_block_64(blocks, i*2 + 0); 255 uint64_t k2 = hash_get_block_64(blocks, [all...] |
/freebsd-10.0-release/sbin/newfs_nandfs/ |
H A D | newfs_nandfs.c | 79 uint32_t *blocks; member in struct:file_info 166 "\t-B blocks-per-segment\n" 334 user_files[i].blocks = malloc(user_files[i].nblocks * sizeof(uint32_t)); 339 ifile.blocks = malloc(ifile.nblocks * sizeof(uint32_t)); 345 cpfile.blocks = malloc(cpfile.nblocks * sizeof(uint32_t)); 353 debug("bad blocks found: extra space for sufile"); 357 sufile.blocks = malloc(sufile.nblocks * sizeof(uint32_t)); 362 datfile.blocks = malloc(datfile.nblocks * sizeof(uint32_t)); 375 user_files[i].blocks[j] = start_block++; 380 ifile.blocks[ [all...] |
/freebsd-10.0-release/sys/boot/common/ |
H A D | part.h | 65 typedef int (diskread_t)(void *arg, void *buf, size_t blocks, off_t offset);
|
/freebsd-10.0-release/sys/sys/ |
H A D | blist.h | 32 * blist = blist_create(blocks, flags) 47 * capable of managing up to (2^31) blocks per blist, though 49 * that. Managing something like 512MB worth of 4K blocks 85 daddr_t bl_free; /* number of free blocks */ 95 extern blist_t blist_create(daddr_t blocks, int flags);
|
/freebsd-10.0-release/tools/tools/bootparttest/ |
H A D | bootparttest.c | 52 diskread(void *arg, void *buf, size_t blocks, off_t offset) argument 57 printf("%s: read %lu blocks from the offset %jd [+%jd]\n", dp->name, 58 blocks, offset, dp->offset); 62 return (pread(dp->fd, buf, blocks * dp->sectorsize, 63 (offset + dp->offset) * dp->sectorsize) != blocks * dp->sectorsize);
|
/freebsd-10.0-release/contrib/serf/buckets/ |
H A D | allocator.c | 93 node_header_t *freelist; /* free STANDARD_NODE_SIZE blocks */ 94 apr_memnode_t *blocks; /* blocks we allocated for subdividing */ member in struct:serf_bucket_alloc_t 107 if (allocator->blocks) { 108 apr_allocator_free(allocator->allocator, allocator->blocks); 189 apr_memnode_t *active = allocator->blocks; 193 apr_memnode_t *head = allocator->blocks; 203 allocator->blocks = active;
|
/freebsd-10.0-release/crypto/openssh/ |
H A D | cipher-aes.c | 77 int i, j, blocks = len / RIJNDAEL_BLOCKSIZE; local 91 for (i = 0; i < blocks; i++, plain+=RIJNDAEL_BLOCKSIZE, 104 for (i = blocks; i > 0; i--, cnow-=RIJNDAEL_BLOCKSIZE,
|