Searched refs:blocks (Results 51 - 75 of 234) sorted by relevance

12345678910

/freebsd-12-stable/sbin/fsdb/
H A Dfsdbutil.c115 ufs2_daddr_t blocks; local
194 blocks = DIP(dp, di_blocks);
197 DIP(dp, di_flags), (intmax_t)blocks, (intmax_t)gen);
/freebsd-12-stable/crypto/openssl/crypto/blake2/
H A Dblake2b.c102 const uint8_t *blocks,
113 * a) BLAKE2b_Update uses it to process complete blocks,
124 * |len| not being multiple of complete blocks can be observed
137 m[i] = load64(blocks + i * sizeof(m[i]));
199 blocks += increment;
212 * store incomplete blocks. But in this case we are interested to
213 * temporarily stash even complete blocks, because last one in the
101 blake2b_compress(BLAKE2B_CTX *S, const uint8_t *blocks, size_t len) argument
H A Dblake2s.c98 const uint8_t *blocks,
109 * a) BLAKE2s_Update uses it to process complete blocks,
120 * |len| not being multiple of complete blocks can be observed
133 m[i] = load32(blocks + i * sizeof(m[i]));
193 blocks += increment;
206 * store incomplete blocks. But in this case we are interested to
207 * temporarily stash even complete blocks, because last one in the
97 blake2s_compress(BLAKE2S_CTX *S, const uint8_t *blocks, size_t len) argument
/freebsd-12-stable/sys/crypto/aesni/
H A Daesni.c410 /* CBC & XTS can only handle full blocks for now */
541 u_int blocks; local
544 /* Do any aligned blocks without redundant copying. */
546 blocks = datalen / 64;
547 ctx->c.b64[0] += blocks * 64 * 8;
548 intel_sha1_step(ctx->h.b32, data + off, blocks);
549 off += blocks * 64;
586 u_int blocks; local
610 /* Perform complete blocks */
612 blocks
[all...]
/freebsd-12-stable/contrib/jemalloc/src/
H A Dbase.c131 base_block_t *b = base->blocks;
165 /* Make the initial blocks THP lazily. */
166 base_block_t *block = base->blocks;
257 * Create increasingly larger blocks in order to limit the total number
324 block->next = base->blocks;
325 base->blocks = block;
373 base->blocks = block;
398 base_block_t *next = base->blocks;
/freebsd-12-stable/sys/dev/nand/
H A Dnandsim.c469 int blocks; local
480 blocks = params->luns * params->blocks_per_lun;
482 if (bs->block_num > blocks)
498 int blocks; local
509 blocks = params->luns * params->blocks_per_lun;
511 if (bs->block_num > blocks)
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSink.cpp93 /// Return a set of basic blocks to insert sinked instructions.
95 /// The returned set of basic blocks (BBsToSinkInto) should satisfy:
155 // Can't sink into blocks that have no valid insertion point.
173 // \p LoopBlockNumber is used to sort the insertion blocks to ensure
180 // Compute the set of blocks in loop L which contain a use of I.
205 // Return if any of the candidate blocks to sink into is non-cold.
237 // Replaces uses of I with IC in blocks dominated by N
266 // If there are no basic blocks with lower frequency than the preheader then
269 if (all_of(L.blocks(), [&](const BasicBlock *BB) {
278 for (BasicBlock *BB : L.blocks())
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp12 /// This pass reorders the blocks in a function to put them into topological
55 virtual iterator_range<block_iterator> blocks() const = 0;
69 iterator_range<block_iterator> blocks() const override {
70 return Region->blocks();
137 "Reorders blocks in topological order", false, false)
194 /// Sort blocks by their number.
208 /// Sort blocks by their number in the opposite order..
222 /// Bookkeeping for a region to help ensure that we don't mix blocks not
223 /// dominated by the its header among its blocks.
228 /// List of blocks no
[all...]
/freebsd-12-stable/contrib/libarchive/cpio/
H A Dcpio.c635 int64_t blocks = local
638 fprintf(stderr, "%lu %s\n", (unsigned long)blocks,
639 blocks == 1 ? "block" : "blocks");
1031 int64_t blocks = (archive_filter_bytes(a, 0) + 511) local
1033 fprintf(stderr, "%lu %s\n", (unsigned long)blocks,
1034 blocks == 1 ? "block" : "blocks");
1114 int64_t blocks = (archive_filter_bytes(a, 0) + 511) local
1116 fprintf(stderr, "%lu %s\n", (unsigned long)blocks,
1271 int64_t blocks = local
[all...]
/freebsd-12-stable/sys/dev/isci/scil/
H A Dsati_unmap.c80 * requests into DSM blocks based on the devices logical block size
82 * @return Number of DSM blocks required for the DSM descriptor count
89 U32 blocks = (dsm_descriptor_count * sizeof(TRIM_PAIR))/sequence->device->logical_block_size; local
92 blocks++;
94 return blocks;
194 * @brief This method determines the max number of blocks of DSM data
197 * @return Number of blocks supported
198 * @retval Number of blocks supported
318 // for the translation in terms of number of blocks
439 // Calculate number of blocks w
[all...]
/freebsd-12-stable/libexec/tftpd/
H A Dtftp-transfer.c187 ts->blocks++;
261 ts->blocks++;
340 ts->blocks++;
346 * Ignore duplicate blocks within the
350 * blocks during a rollover as
H A Dtftp-utils.c301 ts->blocks = 0;
315 printf("%s %zu bytes during %.1f seconds in %u blocks",
316 direction, ts->amount, delta, ts->blocks);
/freebsd-12-stable/contrib/amd/conf/nfs_prot/
H A Dnfs_prot_freebsd3.h137 #define sfrok_blocks blocks
/freebsd-12-stable/contrib/libpcap/
H A Doptimize.c248 struct block **blocks; member in struct:__anon2210
1828 opt_state->blocks[i]->in_edges = 0;
1995 opt_state->blocks[i]->link = 0;
2000 if (!isMarked(ic, opt_state->blocks[i]))
2003 if (!isMarked(ic, opt_state->blocks[j]))
2005 if (eq_blk(opt_state->blocks[i], opt_state->blocks[j])) {
2006 opt_state->blocks[i]->link = opt_state->blocks[j]->link ?
2007 opt_state->blocks[
[all...]
/freebsd-12-stable/contrib/llvm-project/lldb/bindings/interface/
H A DSBSymbolContextList.i131 blocks = property(get_block_array, None, doc='''Returns a list() of lldb.SBBlock objects, one for each block in each SBSymbolContext object in this list.''')
/freebsd-12-stable/sys/contrib/ck/src/
H A Dck_ht_hash.h133 const uint32_t * blocks = (const uint32_t *)(const void *)(data + nblocks*4); local
137 uint32_t k1 = getblock(blocks,i);
/freebsd-12-stable/sys/dev/usb/
H A Dusb_msctest.c1020 uint32_t lba, uint32_t blocks, void *buffer)
1033 cmd[7] = blocks >> 8;
1034 cmd[8] = blocks;
1042 blocks * SCSI_FIXED_BLOCK_SIZE, cmd, 10, USB_MS_HZ);
1051 uint32_t lba, uint32_t blocks, void *buffer)
1064 cmd[7] = blocks >> 8;
1065 cmd[8] = blocks;
1073 blocks * SCSI_FIXED_BLOCK_SIZE, cmd, 10, USB_MS_HZ);
1019 usb_msc_read_10(struct usb_device *udev, uint8_t iface_index, uint32_t lba, uint32_t blocks, void *buffer) argument
1050 usb_msc_write_10(struct usb_device *udev, uint8_t iface_index, uint32_t lba, uint32_t blocks, void *buffer) argument
/freebsd-12-stable/release/picobsd/build/
H A Dpicobsd135 # blocks
136 c_boot1=/boot/boot1 # boot blocks (in case you want custom ones)
829 local blocks dst mfs_start mfs_end mfs_size img_size
836 # correct blocks according to size.
837 blocks=${fd_size};
838 if [ "${blocks}" = "1720" ]; then
839 blocks=1722
840 elif [ "${blocks}" = "1480" ]; then
841 blocks=1476
904 log "image used `du -s ${dst}` of ${blocks}
[all...]
/freebsd-12-stable/sys/dev/cxgb/
H A Dbin2h.pl63 $atime,$mtime,$ctime,$blksize,$blocks)
/freebsd-12-stable/contrib/gcc/
H A Dsched-rgn.c24 /* This pass implements list scheduling within basic blocks. It is
29 different blocks in the same "region", and the second runs only
96 are allowed to move between blocks in the same region, along
100 /* Number of extended basic blocks in region. */
118 /* Array of lists of regions' blocks. */
121 /* Topological order of blocks in the region (if b2 is reachable from
166 while other blocks in the region from which insns can be moved to the
167 target are called "source" blocks. The candidate structure holds info
189 from 'source' to 'target'. The split blocks are those to be checked.
191 the 'update' blocks
2875 sbitmap blocks; local
2931 sbitmap large_region_blocks, blocks; local
3131 sbitmap blocks = sbitmap_alloc (last_basic_block); local
3246 check_dead_notes1(int rgn, sbitmap blocks) argument
[all...]
H A Drecog.c390 blocks, and clear num_changes. */
2743 sbitmap blocks;
2747 blocks = sbitmap_alloc (last_basic_block);
2748 sbitmap_zero (blocks);
2759 CODE_LABELS and short-out basic blocks. */
2768 break the code that handles REG_NO_CONFLICT blocks. */
2782 SET_BIT (blocks, bb->index);
2800 SET_BIT (blocks, bb->index);
2812 find_many_sub_basic_blocks (blocks);
2815 blocks
2730 sbitmap blocks; local
3041 sbitmap blocks; local
[all...]
/freebsd-12-stable/sbin/fsck_ffs/
H A Dsuj.c508 * to be freed. The mask value can be used to free partial blocks.
739 * Handle extattr blocks first.
781 * or ext blocks.
952 * Don't visit indirect blocks with contents we can't trust. This
998 * callback function. The callback may inspect or free blocks. The
1059 * Null visitor function used when we just want to count blocks and
1080 uint64_t blocks; local
1092 * Visit all blocks and count them as well as recording the last
1095 * the blocks count.
1099 blocks
2436 int blocks; local
2476 jblocks_add(struct jblocks *jblocks, ufs2_daddr_t daddr, int blocks) argument
2532 int blocks; local
2662 uint64_t blocks; local
[all...]
/freebsd-12-stable/sys/contrib/octeon-sdk/
H A Dcvmx-nand.c140 int blocks; member in struct:__anon11295
398 cvmx_nand_state[chip].blocks = cvmx_nand_default.blocks;
405 cvmx_dprintf("%s: Defaults: page size: %d, OOB size: %d, pages per block %d, blocks: %d, timing mode: %d\n",
407 cvmx_nand_state[chip].blocks, cvmx_nand_state[chip].onfi_timing);
583 cvmx_nand_state[chip].blocks = 100;
668 cvmx_nand_state[chip].blocks = cvmx_le32_to_cpu(onfi_param_page->blocks_per_lun) * onfi_param_page->number_lun;
732 cvmx_nand_state[chip].blocks = nand_size_bits/(8ULL*cvmx_nand_state[chip].page_size*cvmx_nand_state[chip].pages_per_block);
970 return cvmx_pop(cvmx_nand_state[chip].blocks-1) + cvmx_pop(cvmx_nand_state[chip].pages_per_block-1);
1398 /* The NAND DMA engine always does transfers in 8 byte blocks, s
1980 cvmx_nand_set_defaults(int page_size, int oob_size, int pages_per_block, int blocks, int onfi_timing_mode) argument
[all...]
/freebsd-12-stable/usr.sbin/nandsim/
H A Dnandsim.c642 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
876 * First loop acquires blocks states and writes them to
879 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
902 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
978 expfilesz = cparams.blocks * (blksz + sizeof(bs)) + sizeof(cparams);
1020 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
1033 blkidx, cparams.blocks, dump.ctrl_num, dump.chip_num,
1047 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h100 /// Base class for Addressable entities (externals, absolutes, blocks).
230 /// moving edges between blocks.
561 /// Returns an iterator over the blocks defined in this section.
562 iterator_range<block_iterator> blocks() { function in class:llvm::jitlink::Section
566 /// Returns an iterator over the blocks defined in this section.
567 iterator_range<const_block_iterator> blocks() const { function in class:llvm::jitlink::Section
618 if (llvm::empty(Sec.blocks()))
620 First = Last = *Sec.blocks().begin();
621 for (auto *B : Sec.blocks()) {
690 return S.blocks();
917 iterator_range<block_iterator> blocks() { function in class:llvm::jitlink::LinkGraph
922 iterator_range<const_block_iterator> blocks() const { function in class:llvm::jitlink::LinkGraph
[all...]

Completed in 421 milliseconds

12345678910