Home
last modified time | relevance | path

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

12345678910>>...133

/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_rewrite/
H A Dzfs_rewrite_skip_clone.ksh29 # Verify zfs rewrite -C flag skips BRT-cloned blocks.
33 # 2. Clone the file using block cloning to share blocks via BRT.
34 # 3. Rewrite clone with -C flag and verify blocks are NOT rewritten.
35 # 4. Rewrite clone without -C flag and verify blocks ARE rewritten.
46 log_assert "zfs rewrite -C flag skips BRT-cloned blocks"
52 # Create source file (4 x 128KB = 4 blocks)
60 # Verify blocks are actually shared initially
61 typeset blocks=$(get_same_blocks $TESTPOOL/$TESTFS source \
63 log_must [ "$blocks" = "0 1 2 3" ]
65 # Test 1: Rewrite clone WITH -C flag (should skip all cloned blocks)
[all …]
H A Dzfs_rewrite_skip_snapshot.ksh29 # Verify zfs rewrite -S flag skips snapshot-shared blocks.
33 # 2. Take a snapshot to share the blocks.
34 # 3. Rewrite with -S flag and verify blocks are NOT rewritten.
35 # 4. Rewrite without -S flag and verify blocks ARE rewritten.
45 log_assert "zfs rewrite -S flag skips snapshot-shared blocks"
51 # Create test file (4 x 128KB = 4 blocks) and snapshot
56 # Test 1: Rewrite WITH -S flag (should skip all snapshot-shared blocks)
60 # All blocks should still be shared (all blocks were skipped)
61 typeset blocks=$(get_same_blocks $TESTPOOL/$TESTFS testfile \
63 log_must [ "$blocks" = "0 1 2 3" ]
[all …]
/freebsd/contrib/xz/src/liblzma/common/
H A Dindex_hash.c47 /// Information collected while decoding the actual Blocks.
48 lzma_index_hash_info blocks; member
82 index_hash->blocks.blocks_size = 0; in lzma_index_hash_init()
83 index_hash->blocks.uncompressed_size = 0; in lzma_index_hash_init()
84 index_hash->blocks.count = 0; in lzma_index_hash_init()
85 index_hash->blocks.index_list_size = 0; in lzma_index_hash_init()
96 (void)lzma_check_init(&index_hash->blocks.check, LZMA_CHECK_BEST); in lzma_index_hash_init()
115 // Get the size of the Index from ->blocks instead of ->records for in lzma_index_hash_size()
118 return index_size(index_hash->blocks.count, in lzma_index_hash_size()
119 index_hash->blocks.index_list_size); in lzma_index_hash_size()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_property/
H A Dzfs_written_property_001_pos.ksh59 typeset -l blocks=50
75 count=$blocks
78 ((expected_written=blocks * mb_block))
81 ((total = total + blocks))
82 ((blocks = blocks + 50))
86 blocks=0
89 if [[ $blocks -eq 0 ]]; then
95 ((expected_written = blocks * mb_block))
99 ((blocks = blocks + 50))
107 blocks=50
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp160 // Sorts the CFGs blocks using a reverse post-order depth-first traversal.
161 // Each block will be written into the Blocks array in order, and its BlockID
163 // block, and ID should be the total number of blocks.
164 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
169 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
171 // We may lose pointers to unreachable blocks. in topologicalSort()
174 Blocks[BlockID] = this; in topologicalSort()
180 // which guarantees that all blocks are serialized after their dominator and
186 // and no blocks are accessible via traversal of back-edges from the exit that
188 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dallocator_common.h24 memcpy(Blocks, Array, sizeof(Blocks[0]) * Count); in setFromArray()
28 memcpy(Blocks + Count, Array, sizeof(Blocks[0]) * N); in appendFromArray()
36 memcpy(Blocks + Count, B->Blocks + (B->Count - N), sizeof(Blocks[0]) * N); in appendFromBatch()
45 Blocks[Count++] = P; in add()
48 memcpy(Array, Blocks, sizeof(Blocks[0]) * Count); in moveToArray()
54 memcpy(Array, Blocks + Count - N, sizeof(Blocks[0]) * N); in moveNToArray()
61 return Blocks[I]; in get()
67 CompactPtrT Blocks[]; member
70 // A BatchGroup is used to collect blocks. Each group has a group id to
71 // identify the group kind of contained blocks.
[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.c57 void aesni_cbc_sha1_enc(const void *inp, void *out, size_t blocks,
61 void aesni256_cbc_sha1_dec(const void *inp, void *out, size_t blocks,
145 int blocks; member
153 int blocks; member
171 } blocks[8]; in tls1_1_multi_block_encrypt() local
181 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0) in tls1_1_multi_block_encrypt()
213 memcpy(blocks[0].c, key->md.data, 8); in tls1_1_multi_block_encrypt()
214 seqnum = BSWAP8(blocks[0].q[0]); in tls1_1_multi_block_encrypt()
230 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_1_multi_block_encrypt()
233 blocks[i].c[j] = ((u8 *)key->md.data)[j] + carry; in tls1_1_multi_block_encrypt()
[all …]
H A De_aes_cbc_hmac_sha256.c57 int aesni_cbc_sha256_enc(const void *inp, void *out, size_t blocks,
139 int blocks; member
147 int blocks; member
165 } blocks[8]; in tls1_1_multi_block_encrypt() local
175 if (RAND_bytes((IVs = blocks[0].c), 16 * x4) <= 0) in tls1_1_multi_block_encrypt()
208 memcpy(blocks[0].c, key->md.data, 8); in tls1_1_multi_block_encrypt()
209 seqnum = BSWAP8(blocks[0].q[0]); in tls1_1_multi_block_encrypt()
228 blocks[i].q[0] = BSWAP8(seqnum + i); in tls1_1_multi_block_encrypt()
231 blocks[i].c[j] = ((u8 *)key->md.data)[j] + carry; in tls1_1_multi_block_encrypt()
232 carry = (blocks[i].c[j] - carry) >> (sizeof(carry) * 8 - 1); in tls1_1_multi_block_encrypt()
[all …]
/freebsd/sys/contrib/openzfs/man/man8/
H A Dzfs-rewrite.841 Rewrite blocks of specified
49 Skip blocks that are shared via block cloning (BRT).
50 Cloned blocks are referenced by multiple files or datasets.
51 Rewriting these blocks would create separate copies and increase space usage.
52 This flag prevents such expansion by skipping cloned blocks.
54 Perform physical rewrite, preserving logical birth time of blocks.
55 By default, rewrite updates logical birth times, making blocks appear
63 Skip blocks that are shared with snapshots.
64 Blocks created before the most recent snapshot are shared with that snapshot.
65 Rewriting these blocks would create new copies, leaving the old copies for
[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 …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/MSF/
H A DMSFBuilder.h36 /// at least `MinBlockCount` blocks. This is useful when using `MSFBuilder`
38 /// original MSF file's SuperBlock contains the exact number of blocks used
39 /// by the file, so is a good hint as to how many blocks the new MSF file
43 /// is possible, space for all blocks must be allocated beforehand so that
47 /// locate a free block when all available blocks have been exhausted will
57 /// mandatory reserved blocks required by an MSF file.
71 /// list of blocks. This is useful when reading a MSF file and you want a
72 /// particular stream to occupy the original set of blocks. If the given
73 /// blocks are already allocated, or if the number of blocks specified is
76 ArrayRef<uint32_t> Blocks);
[all …]
H A DMSFCommon.h35 // These elements are referred to as blocks. The size of a block may vary
40 // This contains the number of blocks resident in the file system. In
74 /// file as a sequence of (possibly discontiguous) blocks. When we want to read
76 /// reader uses it to determine which blocks in the underlying MSF file contain
81 std::vector<support::ulittle32_t> Blocks; variable
85 /// stream spans 1 or more blocks, each at equally spaced intervals throughout
144 /// Given an MSF with the specified block size and number of blocks, determine
147 /// \p NumBlocks - the total number of blocks in the MSF
150 /// those FPM blocks are unused (a single FPM block can describe the
151 /// 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.c69 * This implies various alignment rules for the blocks in this in vdev_disk_check_alignment_cb()
80 /* This page must contain only whole LBS-sized blocks. */ in vdev_disk_check_alignment_cb()
125 "512B blocks, 4K single page",
130 "512B blocks, 1K at start of page",
135 "512B blocks, 1K at end of page",
140 "512B blocks, 1K within page, 512B start offset",
145 "512B blocks, 8K across 2x4K pages",
151 "512B blocks, 4K across two pages, 2K start offset",
157 "512B blocks, 16K across 5x4K pages, 512B start offset",
166 "512B blocks, 64K data, 8x8K compound pages",
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLockstepReverseIterator.h28 /// Iterates through instructions in a set of blocks in reverse order from the
29 /// first non-terminator. For example (assume all blocks have size n):
36 /// The iterator continues processing until all blocks have been exhausted if \p
38 /// determine which blocks are still going and the order they appear in the list
47 ArrayRef<BasicBlock *> Blocks; variable
52 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
60 this->ActiveBlocks.insert_range(Blocks); in reset()
63 for (BasicBlock *BB : Blocks) { in reset()
85 // ActiveBlocks will be later copied to Blocks using std::copy. The
86 // resultant order of elements in Blocks needs to be deterministic.
[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/ExecutionEngine/JITLink/
H A DJITLink.cpp98 if (B.getSize() == 0) // Empty blocks are not valid C-strings. in isCStringBlock()
101 // Zero-fill blocks of size one are valid empty strings. in isCStringBlock()
146 for (auto *B : TargetSec.blocks()) in printEdge()
167 for (auto *B : Blocks) in ~Section()
181 std::vector<Block *> LinkGraph::splitBlockImpl(std::vector<Block *> Blocks, in splitBlockImpl() argument
183 assert(!Blocks.empty() && "Blocks must at least contain the original block"); in splitBlockImpl()
185 // Fix up content of all blocks. in splitBlockImpl()
186 ArrayRef<char> Content = Blocks.front()->getContent(); in splitBlockImpl()
187 for (size_t I = 0; I != Blocks.size() - 1; ++I) { in splitBlockImpl()
188 Blocks[I]->setContent( in splitBlockImpl()
[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() argument
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()
139 Blocks[I++] = NextBlock; in allocateBlocks()
[all …]

12345678910>>...133