Home
last modified time | relevance | path

Searched full:blocks (Results 1 – 25 of 2789) sorted by relevance

12345678910>>...112

/freebsd/share/doc/smm/03.fsck/
H A D3.t101 for the cylinder group blocks, the inodes, the indirect blocks, and
102 the data blocks containing directory entries.
111 system's blocks or inodes,
119 number of blocks used by the super-block
120 and the number of blocks used by the list of inodes.
139 checks that all the blocks
142 When all the blocks have been initially accounted for,
145 the number of free blocks
146 plus the number of blocks claimed by the inodes
147 equals the total number of blocks in the file system.
[all …]
H A D2.t44 such as the number of data blocks it contains
54 .I "redundant super blocks"
58 The redundant blocks are sprinkled throughout the disk partition.
67 and an array of indices pointing to the data blocks for the file.
69 we assume that the first 12 blocks
76 The inode structure may also contain references to indirect blocks
81 blocks,
83 blocks (the triple indirect block is never needed in practice).
89 The size of file system blocks can be any power of two
107 the number of blocks, fragments, inodes and directories in the file system.
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_property/
H A Dzfs_written_property_001_pos.ksh58 typeset -l blocks=50
74 count=$blocks
77 ((expected_written=blocks * mb_block))
80 ((total = total + blocks))
81 ((blocks = blocks + 50))
85 blocks=0
88 if [[ $blocks -eq 0 ]]; then
94 ((expected_written = blocks * mb_block))
98 ((blocks = blocks + 50))
106 blocks=50
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp161 // Sorts the CFGs blocks using a reverse post-order depth-first traversal.
162 // Each block will be written into the Blocks array in order, and its BlockID
164 // block, and ID should be the total number of blocks.
165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
172 // We may lose pointers to unreachable blocks. in topologicalSort()
175 Blocks[BlockID] = this; in topologicalSort()
181 // which guarantees that all blocks are serialized after their dominator and
187 // and no blocks are accessible via traversal of back-edges from the exit that
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
[all …]
/freebsd/share/doc/smm/05.fastfs/
H A D3.t50 The size of file system blocks can be any power of two
68 a bit map describing available blocks in the cylinder group,
69 and summary information describing the usage of data blocks
71 The bit map of available blocks in the cylinder group replaces
96 is used for data blocks.\(dg
101 with blocks sizes of 16 kilobytes or greater.
109 Without knowing the size of the file system blocks,
116 Data is laid out so that larger blocks can be transferred
119 composed of 4096 byte data blocks.
120 In the old file system this file would be composed of 1024 byte blocks.
[all …]
/freebsd/share/man/man5/
H A Dfs.555 The block size and number of blocks which
80 int32_t fs_unused_1; /* used for incore super blocks */
83 int32_t fs_iblkno; /* offset of inode-blocks in filesys */
88 int32_t fs_old_size; /* number of blocks in fs */
89 int32_t fs_old_dsize; /* number of data blocks in fs */
91 int32_t fs_bsize; /* size of basic blocks in fs */
92 int32_t fs_fsize; /* size of frag blocks in fs */
95 int32_t fs_minfree; /* minimum percentage of free blocks */
131 int32_t fs_fpg; /* blocks per group * fs_frag */
157 int64_t fs_size; /* number of blocks in fs */
[all …]
/freebsd/crypto/openssl/crypto/evp/
H A De_aes_cbc_hmac_sha1.c59 void aesni_cbc_sha1_enc(const void *inp, void *out, size_t blocks,
63 void aesni256_cbc_sha1_dec(const void *inp, void *out, size_t blocks,
146 int blocks; member
154 int blocks; member
172 } blocks[8]; in tls1_1_multi_block_encrypt() local
183 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0) in tls1_1_multi_block_encrypt()
215 memcpy(blocks[0].c, key->md.data, 8); in tls1_1_multi_block_encrypt()
216 seqnum = BSWAP8(blocks[0].q[0]); in tls1_1_multi_block_encrypt()
232 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_1_multi_block_encrypt()
235 blocks[i].c[j] = ((u8 *)key->md.data)[j] + carry; in tls1_1_multi_block_encrypt()
[all …]
H A De_aes_cbc_hmac_sha256.c59 int aesni_cbc_sha256_enc(const void *inp, void *out, size_t blocks,
141 int blocks; member
149 int blocks; member
167 } blocks[8]; in tls1_1_multi_block_encrypt() local
178 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0) in tls1_1_multi_block_encrypt()
211 memcpy(blocks[0].c, key->md.data, 8); in tls1_1_multi_block_encrypt()
212 seqnum = BSWAP8(blocks[0].q[0]); in tls1_1_multi_block_encrypt()
231 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_1_multi_block_encrypt()
234 blocks[i].c[j] = ((u8 *)key->md.data)[j] + carry; in tls1_1_multi_block_encrypt()
235 carry = (blocks[i].c[j] - carry) >> (sizeof(carry) * 8 - 1); in tls1_1_multi_block_encrypt()
[all …]
H A De_rc4_hmac_md5.c40 MD5_CTX *ctx, const void *inp, size_t blocks);
83 md5_off = MD5_CBLOCK - key->md.num, blocks; in rc4_hmac_md5_cipher() local
99 if (plen > md5_off && (blocks = (plen - md5_off) / MD5_CBLOCK) && in rc4_hmac_md5_cipher()
105 &key->md, in + md5_off, blocks); in rc4_hmac_md5_cipher()
106 blocks *= MD5_CBLOCK; in rc4_hmac_md5_cipher()
107 rc4_off += blocks; in rc4_hmac_md5_cipher()
108 md5_off += blocks; in rc4_hmac_md5_cipher()
109 key->md.Nh += blocks >> 29; in rc4_hmac_md5_cipher()
110 key->md.Nl += blocks <<= 3; in rc4_hmac_md5_cipher()
111 if (key->md.Nl < (unsigned int)blocks) in rc4_hmac_md5_cipher()
[all …]
/freebsd/crypto/openssl/providers/implementations/ciphers/
H A Dcipher_aes_cbc_hmac_sha256_hw.c36 int aesni_cbc_sha256_enc(const void *inp, void *out, size_t blocks,
112 int blocks; member
118 int blocks; member
139 } blocks[8]; in tls1_multi_block_encrypt() local
150 if (RAND_bytes_ex(ctx->base.libctx, (IVs = blocks[0].c), 16 * x4, 0) <= 0) in tls1_multi_block_encrypt()
182 memcpy(blocks[0].c, sctx->md.data, 8); in tls1_multi_block_encrypt()
183 seqnum = BSWAP8(blocks[0].q[0]); in tls1_multi_block_encrypt()
203 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_multi_block_encrypt()
206 blocks[i].c[j] = ((u8 *)sctx->md.data)[j] + carry; in tls1_multi_block_encrypt()
207 carry = (blocks[i].c[j] - carry) >> (sizeof(carry) * 8 - 1); in tls1_multi_block_encrypt()
[all …]
H A Dcipher_aes_cbc_hmac_sha1_hw.c36 void aesni_cbc_sha1_enc(const void *inp, void *out, size_t blocks,
108 int blocks; member
114 int blocks; member
135 } blocks[8]; in tls1_multi_block_encrypt() local
146 if (RAND_bytes_ex(ctx->base.libctx, (IVs = blocks[0].c), 16 * x4, 0) <= 0) in tls1_multi_block_encrypt()
178 memcpy(blocks[0].c, sctx->md.data, 8); in tls1_multi_block_encrypt()
179 seqnum = BSWAP8(blocks[0].q[0]); in tls1_multi_block_encrypt()
195 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_multi_block_encrypt()
198 blocks[i].c[j] = ((u8 *)sctx->md.data)[j] + carry; in tls1_multi_block_encrypt()
199 carry = (blocks[i].c[j] - carry) >> (sizeof(carry) * 8 - 1); in tls1_multi_block_encrypt()
[all …]
H A Dcipher_chacha20_hw.c70 size_t blocks = inl / CHACHA_BLK_SIZE; in chacha20_cipher() local
77 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28)) in chacha20_cipher()
78 blocks = (1U << 28); in chacha20_cipher()
84 * amount of blocks to the exact overflow point... in chacha20_cipher()
86 ctr32 += (unsigned int)blocks; in chacha20_cipher()
87 if (ctr32 < blocks) { in chacha20_cipher()
88 blocks -= ctr32; in chacha20_cipher()
91 blocks *= CHACHA_BLK_SIZE; in chacha20_cipher()
92 ChaCha20_ctr32(out, in, blocks, ctx->key.d, ctx->counter); in chacha20_cipher()
93 inl -= blocks; in chacha20_cipher()
[all …]
H A Dcipher_rc4_hmac_md5_hw.c58 size_t md5_off = MD5_CBLOCK - ctx->md.num, blocks; in cipher_hw_rc4_hmac_md5_cipher() local
75 && (blocks = (plen - md5_off) / MD5_CBLOCK) in cipher_hw_rc4_hmac_md5_cipher()
81 &ctx->md, in + md5_off, blocks); in cipher_hw_rc4_hmac_md5_cipher()
82 blocks *= MD5_CBLOCK; in cipher_hw_rc4_hmac_md5_cipher()
83 rc4_off += blocks; in cipher_hw_rc4_hmac_md5_cipher()
84 md5_off += blocks; in cipher_hw_rc4_hmac_md5_cipher()
85 ctx->md.Nh += blocks >> 29; in cipher_hw_rc4_hmac_md5_cipher()
86 ctx->md.Nl += blocks <<= 3; in cipher_hw_rc4_hmac_md5_cipher()
87 if (ctx->md.Nl < (unsigned int)blocks) in cipher_hw_rc4_hmac_md5_cipher()
121 && (blocks = (len - rc4_off) / MD5_CBLOCK) in cipher_hw_rc4_hmac_md5_cipher()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/MSF/
H A DMSFBuilder.h35 /// at least `MinBlockCount` blocks. This is useful when using `MSFBuilder`
37 /// original MSF file's SuperBlock contains the exact number of blocks used
38 /// by the file, so is a good hint as to how many blocks the new MSF file
42 /// is possible, space for all blocks must be allocated beforehand so that
46 /// locate a free block when all available blocks have been exhausted will
56 /// mandatory reserved blocks required by an MSF file.
70 /// list of blocks. This is useful when reading a MSF file and you want a
71 /// particular stream to occupy the original set of blocks. If the given
72 /// blocks are already allocated, or if the number of blocks specified is
74 Expected<uint32_t> addStream(uint32_t Size, ArrayRef<uint32_t> Blocks);
[all …]
H A DMSFCommon.h34 // These elements are referred to as blocks. The size of a block may vary
39 // This contains the number of blocks resident in the file system. In
73 /// file as a sequence of (possibly discontiguous) blocks. When we want to read
75 /// reader uses it to determine which blocks in the underlying MSF file contain
80 std::vector<support::ulittle32_t> Blocks; variable
84 /// stream spans 1 or more blocks, each at equally spaced intervals throughout
143 /// Given an MSF with the specified block size and number of blocks, determine
146 /// \p NumBlocks - the total number of blocks in the MSF
149 /// those FPM blocks are unused (a single FPM block can describe the
150 /// allocation status of up to 32,767 blocks, although one appears only
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp19 /// of blocks with a single entry and no branches back to that entry. A region
37 /// use the "label" helper for the blocks we absolutely must and no others. We
81 // Calculates reachability in a region. Ignores branches to blocks outside of
86 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
87 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
90 for (auto *MBB : Blocks) { in ReachabilityGraph()
109 // "Loopers" are blocks that are in a loop. We detect these by finding blocks
113 // Get all blocks that are loop entries.
116 // Get all blocks that enter a particular loop from outside.
126 const BlockSet &Blocks; member in __anon5f812d3b0111::ReachabilityGraph
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/vdev_disk/
H A Dpage_alignment.c68 * This implies various alignment rules for the blocks in this in vdev_disk_check_alignment_cb()
79 /* This page must contain only whole LBS-sized blocks. */ in vdev_disk_check_alignment_cb()
124 "512B blocks, 4K single page",
129 "512B blocks, 1K at start of page",
134 "512B blocks, 1K at end of page",
139 "512B blocks, 1K within page, 512B start offset",
144 "512B blocks, 8K across 2x4K pages",
150 "512B blocks, 4K across two pages, 2K start offset",
156 "512B blocks, 16K across 5x4K pages, 512B start offset",
165 "512B blocks, 64K data, 8x8K compound pages",
[all …]
/freebsd/sys/contrib/device-tree/Bindings/sifive/
H A Dsifive-blocks-ip-versioning.txt1 DT compatible string versioning for SiFive open-source IP blocks
4 strings for open-source SiFive IP blocks. HDL for these IP blocks
7 https://github.com/sifive/sifive-blocks
14 https://github.com/sifive/sifive-blocks/blob/v1.0/src/main/scala/devices/uart/UART.scala#L43
16 Until these IP blocks (or IP integration) support version
17 auto-discovery, the maintainers of these IP blocks intend to increment
19 interface to these IP blocks changes, or when the functionality of the
20 underlying IP blocks changes in a way that software should be aware of.
25 upstream sifive-blocks commits. It is expected that most drivers will
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp9 // An irreducible SCC is one which has multiple "header" blocks, i.e., blocks
22 // INPUT CFG: The blocks A and B form an irreducible loop with two headers.
55 // takes a set of incoming blocks (the predecessors) and outgoing blocks (the
57 // hub. Since the hub dominates all the outgoing blocks, each such PHINode
116 SetVector<BasicBlock *> &Blocks, in INITIALIZE_PASS_DEPENDENCY()
125 return L == NewLoop || !Blocks.contains(L->getHeader()); in INITIALIZE_PASS_DEPENDENCY()
137 for (auto *BB : Child->blocks()) { in INITIALIZE_PASS_DEPENDENCY()
161 // Given a set of blocks an in INITIALIZE_PASS_DEPENDENCY()
169 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument
257 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
263 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
275 SetVector<BasicBlock *> Blocks; makeReducible() local
[all...]
/freebsd/bin/dd/
H A Ddd.145 Input data is read and written in 512-byte blocks.
50 displays the number of complete and partial input and output blocks
69 single block without any aggregation of short blocks.
79 input blocks.
114 is called on the input rather than the number of blocks copied in full.
123 blocks.
159 blocks.
165 blocks from the beginning of the output before copying.
169 Otherwise, existing blocks are read and the data discarded.
175 end of file to the specified offset is filled with blocks of
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMSFBuilder.cpp70 "Cannot grow the number of blocks"); in setBlockMapAddr()
104 MutableArrayRef<uint32_t> Blocks) { in allocateBlocks()
112 "There are no free Blocks in the file"); in allocateBlocks()
119 // blocks for each FPM group crossed and mark both blocks from the group as in allocateBlocks()
120 // used. FPM blocks are marked as allocated regardless of whether or not in allocateBlocks()
121 // they ultimately describe the status of blocks in the file. This means in allocateBlocks()
122 // that not only are extraneous blocks at the end of the main FPM marked as in allocateBlocks()
123 // allocated, but also blocks from the alternate FPM are always marked as in allocateBlocks()
136 assert(Block != -1 && "We ran out of Blocks!"); in allocateBlocks()
103 allocateBlocks(uint32_t NumBlocks,MutableArrayRef<uint32_t> Blocks) allocateBlocks() argument
156 addStream(uint32_t Size,ArrayRef<uint32_t> Blocks) addStream() argument
407 for (const auto &Blocks : Layout.StreamMap) { commit() local
[all...]
/freebsd/tools/diag/prtblknos/
H A DREADME3 of blocks used by a requested list of inodes.
5 For example, to list the blocks referenced by your kernel:
8 Filesystem 1K-blocks Used Avail Capacity Mounted on
24 Each contiguous range of blocks is printed on a line.
26 previous set of blocks to the beginning of the next set of blocks.
30 size blocks which by today's default is 32Kb.
35 physical block numbers reference 4Kb blocks. The distances listed
43 half the block size (say 32Kb blocks with 16Kb fragments) then the
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h42 /// A wrapper of a jump between two basic blocks.
52 /// A wrapper of binary function with basic blocks and jumps.
54 /// Basic blocks in the function.
55 std::vector<FlowBlock> Blocks; member
56 /// Jumps between the basic blocks.
138 /// Initialize flow function blocks, jumps and misc metadata.
158 /// Map basic blocks to their sampled weights.
165 // Find all forwards reachable blocks which the inference algorithm will be in apply()
169 (void)BB /* Mark all reachable blocks */; in apply()
171 // Find all backwards reachable blocks whic in apply()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DFlattenCFGPass.cpp43 /// iterativelyFlattenCFG - Call FlattenCFG on all the blocks in the function,
49 // Use block handles instead of iterating over function blocks directly in iterativelyFlattenCFG()
50 // to avoid using iterators invalidated by erasing blocks. in iterativelyFlattenCFG()
51 std::vector<WeakVH> Blocks; in iterativelyFlattenCFG() local
52 Blocks.reserve(F.size()); in iterativelyFlattenCFG()
54 Blocks.push_back(&BB); in iterativelyFlattenCFG()
59 // Loop over all of the basic blocks and try to flatten them. in iterativelyFlattenCFG()
60 for (WeakVH &BlockHandle : Blocks) { in iterativelyFlattenCFG()
61 // Skip blocks erased by FlattenCFG. in iterativelyFlattenCFG()
88 // iterativelyFlattenCFG can make some blocks dead. in runOnFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DBasicBlockSections.cpp11 // The purpose of this pass is to assign sections to basic blocks when
13 // only the subset of basic blocks with profiles are placed in separate sections
14 // and the rest are grouped in a cold section. The exception handling blocks are
21 // clusters of basic blocks. Every cluster will be emitted into a separate
22 // section with its basic blocks sequenced in the given order. To get the
28 // of 6 basic blocks 0, 1, ..., 5).
33 // * Basic blocks 0 and 2 are placed in one section with symbol `foo`
35 // * Basic blocks 1, 3, 5 are placed in a separate section. A new symbol
66 // the corresponding basic blocks. This logic is implemented in AsmPrinter. This
118 /// Identify basic blocks that need separate sections and prepare to emit them
[all …]

12345678910>>...112