| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| dqblk_xfs.h | 46 * It is 64-bit aligned, and all the blk units are in BBs (Basic Blocks) of
59 __u64 d_bcount; /* # disk blocks owned by the user */
63 __s32 d_btimer; /* similar to above; for disk blocks */
65 __u16 d_bwarns; /* # warnings issued wrt disk blocks */
69 __u64 d_rtbcount; /* # realtime blocks owned */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_xfs.h | 46 * It is 64-bit aligned, and all the blk units are in BBs (Basic Blocks) of
59 __u64 d_bcount; /* # disk blocks owned by the user */
63 __s32 d_btimer; /* similar to above; for disk blocks */
65 __u16 d_bwarns; /* # warnings issued wrt disk blocks */
69 __u64 d_rtbcount; /* # realtime blocks owned */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_xfs.h | 46 * It is 64-bit aligned, and all the blk units are in BBs (Basic Blocks) of
59 __u64 d_bcount; /* # disk blocks owned by the user */
63 __s32 d_btimer; /* similar to above; for disk blocks */
65 __u16 d_bwarns; /* # warnings issued wrt disk blocks */
69 __u64 d_rtbcount; /* # realtime blocks owned */
|
| /bionic/libc/kernel/tools/ |
| cpp.py | [all...] |
| /external/e2fsprogs/resize/ |
| resize2fs.c | 20 * 2. Determine blocks which need to be relocated, and copy the
21 * contents of blocks from their old locations to the new ones.
23 * a. If blocks have been moved, update the block
24 * pointers in the inodes and indirect blocks to
29 * c. If (b) needs to be done, note which blocks contain
32 * 4. Update the directory blocks with the new inode locations.
126 printf("Number of free blocks: %u/%u, Needed: %d\n",
249 * If the group descriptor's bitmap and inode table blocks are valid,
251 * reserved so the old inode table blocks don't get overwritten.
321 * Overhead is the number of bookkeeping blocks per group. I
[all...] |
| /external/libpcap/doc/ |
| pcap.xml | 71 <t>A capture file is organized in blocks, that are appended one to another to form the file. All the blocks share a common format, which is shown in <xref target="formatblock"/>.</t>
99 <t>This structure, shared among all blocks, makes easy to process a file and to skip unneeded or unknown blocks. Blocks can be nested one inside the others (NOTE: needed?). Some of the blocks are mandatory, i.e. a dump file is not valid if they are not present, other are optional.</t>
100 <t>The structure of the blocks allows to define other blocks if needed. A parser that does non understand them can simply ignore their content.</t>
104 <t>The currently defined blocks are the following:</t>
117 <t>The following blocks instead are considered interesting but the authors believe that they deserve more in-depth discuss (…)
[all...] |
| /external/valgrind/main/memcheck/ |
| mc_leakcheck.c | 62 // blocks (they are excluded so that later on we can differentiate
63 // between heap blocks that are indirectly leaked vs. directly leaked).
64 // - heap-allocated blocks. A block is a mempool chunk or a malloc chunk
65 // that doesn't contain a mempool chunk. Nb: the terms "blocks" and
74 // Root set nodes only point to blocks. Blocks only point to blocks;
96 // directly lost blocks, and the indirectly lost ones will be fixed as
97 // part of that. Any possibly lost blocks will just be due to random
121 // of indirectly leaked blocks(!) It would be better named --show-all o
[all...] |
| /external/webrtc/src/common_audio/resampler/ |
| resampler.cc | 513 // We can only handle blocks of 160 samples
549 // We can only handle blocks of 80 samples
580 // We can only handle blocks of 40 samples
620 // We can only handle blocks of 160 samples
643 // We can only handle blocks of 80 samples
672 // We can only handle blocks of 80 samples
694 // We can only handle blocks of 160 samples
717 // We can only handle blocks of 110 samples
747 // We can only handle blocks of 110 samples
790 // We can only handle blocks of 480 sample
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| chvr_filter.cpp | 51 /* Calculate the width and height of the area in blocks (divide by 8) */
81 /* Process four blocks for the filtering */
83 /* Loop over two rows of blocks */
84 for (br = mbr + 1; br < mbr + 3; br++) /* br is the row counter in blocks */
87 /* brwidth is used as an index when counting blocks */
90 /* Loop over two columns of blocks in the row */
91 for (bc = mbc; bc < mbc + 2; bc++) /* bc is the column counter in blocks */
102 /* Set the index to the current block of the second row counting in blocks */
245 /* Process four blocks for the filtering */
247 /* Loop over two rows of blocks */
[all...] |
| /bootable/recovery/mtdutils/ |
| mtdutils.c | 283 // anything other than whole blocks; unpredictable things will result.
341 // Read complete blocks directly into the user's buffer
425 continue; // Don't try to erase known factory-bad blocks.
480 // Coalesce partial writes into complete blocks
495 // Write complete blocks directly from the user's buffer
505 off_t mtd_erase_blocks(MtdWriteContext *ctx, int blocks)
519 if (blocks < 0) blocks = total;
520 if (blocks > total) {
525 // Erase the specified number of blocks
[all...] |
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.cc | 57 // Compute the number of row blocks in E. The number of row blocks
58 // in E maybe less than the number of row blocks in the input matrix
59 // as some of the row blocks at the bottom may not have any
97 // Iterate over the first num_row_blocks_e_ row blocks, and multiply
117 // Iterate over row blocks, and if the row block is in E, then
120 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
142 // Iterate over the first num_row_blocks_e_ row blocks, and multiply
162 // Iterate over row blocks, and if the row block is in E, then
165 // num_row_blocks - num_row_blocks_e row blocks), then all the cell
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkDeque.h | 17 * size. It manages the memory as a doubly linked list of blocks each of which
18 * can contain multiple elements. Pushes and pops add/remove blocks from the
132 * This returns the number of chunk blocks allocated by the deque. It
|
| /external/clang/utils/analyzer/ |
| SumTimerInfo.py | 50 if (("The % of reachable basic blocks" in line) and (Mode == 1)) :
56 if (("The maximum number of basic blocks in a function" in line) and (Mode == 1)) :
77 print "Reachable Blocks %d" % (ReachableBlocks)
|
| /external/e2fsprogs/debugfs/ |
| debugfs.8.in | 85 should be used when reading blocks not found in the ext2 image file.
86 This includes data, directory, and indirect blocks.
215 (Please note that the length and range of blocks for the last extent in
233 free blocks, starting from
255 blocks starting at block number
268 Print a listing of the inodes which use the one or more blocks specified
290 and its blocks. Note that this does not remove any directory
325 program to print the contents of all of the descriptor blocks.
333 option will print out the contents of all of the data blocks selected by
422 blocks starting at block numbe
[all...] |
| /external/kernel-headers/original/mtd/ |
| mtd-abi.h | 68 uint32_t numblocks; /* Number of blocks in this region */
131 * @badblocks: number of bad blocks in this partition
132 * @bbtblocks: number of blocks reserved for bad block tables
|
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 10 // This family of functions performs analyses on basic blocks, and instructions
11 // contained within basic blocks.
56 /// This function is linear with respect to the number of blocks in the CFG,
|
| /external/llvm/include/llvm/CodeGen/ |
| LiveVariables.h | 55 /// information: the set of blocks in which the instruction is live
56 /// throughout, the set of blocks in which the instruction is actually used,
63 /// throughout any blocks, these blocks are listed in AliveBlocks. Blocks
65 /// being captured by the Kills set. In these blocks, the value is live into
71 /// value in one of its predecessor blocks, it is not listed in the kills set,
76 /// not live across any blocks) and Kills is empty (phi nodes are not
78 /// the block, but is not live in any successor blocks.
80 /// AliveBlocks - Set of blocks in which this value is alive completel
[all...] |
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 13 // basic blocks are weighted by the block frequency and added to become the node
16 // Transparent basic blocks have the variable live through, but don't care if it
17 // is spilled or in a register. These blocks become connections in the Hopfield
76 /// BiasN - Sum of blocks that prefer a spill.
78 /// BiasP - Sum of blocks that prefer a register.
88 /// Links - (Weight, BundleNo) for all transparent blocks connecting to other
215 // allocate registers when so many different blocks are involved.
218 // fraction of the connected blocks need to be interested before we consider
220 // limiting the number of blocks visited and the number of links in the
253 void SpillPlacement::addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.h | 48 RetainAutoreleaseDep, ///< Blocks objc_retainAutorelease.
49 RetainAutoreleaseRVDep, ///< Blocks objc_retainAutoreleaseReturnValue.
50 RetainRVDep ///< Blocks objc_retainAutoreleasedReturnValue.
|
| /external/llvm/lib/Transforms/Scalar/ |
| FlattenCFGPass.cpp | 50 /// iterativelyFlattenCFG - Call FlattenCFG on all the blocks in the function,
58 // Loop over all of the basic blocks and remove them if they are unneeded...
73 // iterativelyFlattenCFG can make some blocks dead.
|
| /external/markdown/markdown/extensions/ |
| def_list.py | 34 def run(self, parent, blocks):
35 block = blocks.pop(0)
74 blocks.insert(0, theRest)
|
| fenced_code.py | 7 This extension adds Fenced Code Blocks to Python-Markdown.
37 Multiple blocks and language tags:
87 """ Match and store Fenced Code Blocks in the HtmlStash. """
|
| /external/skia/include/core/ |
| SkDeque.h | 17 * size. It manages the memory as a doubly linked list of blocks each of which
18 * can contain multiple elements. Pushes and pops add/remove blocks from the
132 * This returns the number of chunk blocks allocated by the deque. It
|
| /libcore/luni/src/main/java/java/io/ |
| ObjectInput.java | 49 * reached. Blocks if no input is available.
58 * Reads bytes from this stream into the byte array {@code buffer}. Blocks
69 * byte array {@code buffer} starting at offset {@code byteOffset}. Blocks while
|
| ObjectOutput.java | 47 * stream. Blocks until all bytes are written.
58 * position {@code offset} to the target stream. Blocks until all bytes are
75 * byte of the integer {@code value} is written to the stream. Blocks until
|
