/freebsd-9.3-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-9.3-release/contrib/wpa/src/crypto/ |
H A D | aes-cbc.c | 35 int i, j, blocks; local 42 blocks = data_len / AES_BLOCK_SIZE; 43 for (i = 0; i < blocks; i++) { 68 int i, j, blocks; local 75 blocks = data_len / AES_BLOCK_SIZE; 76 for (i = 0; i < blocks; i++) {
|
H A D | crypto_internal-cipher.c | 118 size_t i, j, blocks; local 131 blocks = len / ctx->u.aes.block_size; 132 for (i = 0; i < blocks; i++) { 146 blocks = len / 8; 147 for (i = 0; i < blocks; i++) { 160 blocks = len / 8; 161 for (i = 0; i < blocks; i++) { 182 size_t i, j, blocks; local 196 blocks = len / ctx->u.aes.block_size; 197 for (i = 0; i < blocks; [all...] |
/freebsd-9.3-release/crypto/openssh/ |
H A D | hash.c | 15 #define blocks crypto_hashblocks_sha512 macro 39 blocks(h,in,inlen); 58 blocks(h,padded,128); 70 blocks(h,padded,256);
|
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,
|
/freebsd-9.3-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-9.3-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-9.3-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-9.3-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-9.3-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::__anon1159 [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
|
H A D | sched-ebb.c | 54 /* Set of blocks, that already have their dependencies calculated. */ 56 /* Set of basic blocks, that are ebb heads of tails respectively. */ 256 regions (or single basic blocks). */ 281 /* We need to DETACH_LIVE_INFO to be able to create new basic blocks. 301 blocks in EBB. The list is formed in `add_deps_for_risky_insns'. */ 473 /* Only recovery blocks can have their dependencies already calculated, 518 /* We might pack all instructions into fewer blocks, 549 sbitmap large_region_blocks, blocks; 623 /* We can create new basic blocks during scheduling, and 637 blocks 546 sbitmap large_region_blocks, blocks; local [all...] |
/freebsd-9.3-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-9.3-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-9.3-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);
|
H A D | cdrio.h | 89 u_int32_t blocks; member in struct:cdr_format_capacity 98 u_int32_t blocks; member in struct:cdr_format_capacities
|
/freebsd-9.3-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-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 77 /// checked for unique exit and exiting blocks, and that the code is in LCSSA 94 // Make sure all exiting blocks produce the same incoming value for the exit 96 // blocks, then it is impossible to statically determine which value should 203 // Update the dominator tree and remove the instructions and blocks that will 225 // Erase the instructions and the blocks without having to worry 233 // Finally, the blocks from loopinfo. This has to happen late because 236 SmallPtrSet<BasicBlock*, 8> blocks; local 237 blocks.insert(L->block_begin(), L->block_end()); 238 for (SmallPtrSet<BasicBlock*,8>::iterator I = blocks.begin(), 239 E = blocks [all...] |
/freebsd-9.3-release/lib/libdisk/ |
H A D | Makefile | 11 SRCS= blocks.c ${_change} chunk.c create_chunk.c disk.c ${_open_disk} \
|
/freebsd-9.3-release/libexec/tftpd/ |
H A D | tftp-utils.h | 117 uint32_t blocks; member in struct:tftp_stats
|
/freebsd-9.3-release/sys/boot/uboot/lib/ |
H A D | disk.c | 67 off_t blocks; /* block count */ member in struct:__anon5809 120 stor_info[stor_info_no].blocks = 207 return (disk_open(dev, SI(dev).blocks * SI(dev).bsize, 276 *(off_t *)data = SI(dev).bsize * SI(dev).blocks;
|
/freebsd-9.3-release/usr.sbin/repquota/ |
H A D | repquota.c | 264 prthumanval(int64_t blocks) argument 270 printf(" %6ju", (uintmax_t)dbtokb(blocks)); 274 if (blocks != 0) 276 humanize_number(buf, sizeof(buf) - (blocks < 0 ? 0 : 1), 277 dbtob(blocks), "", HN_AUTOSCALE, flags);
|