| /external/openssh/ |
| cipher-aes.c | 80 int i, j, blocks = len / RIJNDAEL_BLOCKSIZE; local
94 for (i = 0; i < blocks; i++, plain+=RIJNDAEL_BLOCKSIZE,
107 for (i = blocks; i > 0; i--, cnow-=RIJNDAEL_BLOCKSIZE,
|
| /system/extras/ext4_utils/ |
| ext2simg.c | 91 printf(" Blocks per group: %d\n", info.blocks_per_group);
95 printf(" Blocks: %llu\n", aux_info.len_blocks);
98 printf(" Used %d/%d inodes and %d/%d blocks\n",
|
| ext4fixup.c | 39 /* The inode block count for a file/directory is in units of 512 byte blocks,
240 printf(" Blocks per group: %d\n", info.blocks_per_group);
244 printf(" Blocks: %llu\n", aux_info.len_blocks);
247 printf(" Used %d/%d inodes and %d/%d blocks\n",
655 /* A directory that requires doubly or triply indirect blocks in huge indeed,
658 * directory is not that big and give an error if so. Our limit is 12 direct blocks,
659 * plus block_size/4 singly indirect blocks, which for a filesystem with 4K blocks
660 * is a directory 1036 blocks long, or 4,243,456 bytes long! Assuming an average
670 /* Read in all the blocks for this directory *
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| utrie2_builder.c | 77 /** The start of allocated index-2 blocks. */
87 /** The start of allocated data blocks. */
91 * The start of data blocks for U+0800 and above.
162 /* set the index-2 indexes for the 2=0x80>>UTRIE2_SHIFT_2 ASCII data blocks */
172 * Reference counts for the null data block: all blocks except for the ASCII blocks.
197 * does not overlap other index-2 blocks with the gap.
225 * for 2-byte UTF-8 which will be compacted in 64-blocks
701 * mark index values for repeat-data blocks by setting bit 31 of the index values
753 /* iterate over all-value blocks */
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 354 /// LoopTarget - Some blocks are used to represent the "loop edge" to
356 /// refer to the loop statement for such blocks (and be null otherwise).
364 /// CFG blocks.
371 /// control cannot technically ever proceed past this block. All such blocks
706 CFGBlock & front() { return *Blocks.front(); }
707 CFGBlock & back() { return *Blocks.back(); }
709 iterator begin() { return Blocks.begin(); }
710 iterator end() { return Blocks.end(); }
711 const_iterator begin() const { return Blocks.begin(); }
712 const_iterator end() const { return Blocks.end();
[all...] |
| /external/icu4c/common/ |
| utrie2_builder.cpp | 77 /** The start of allocated index-2 blocks. */
87 /** The start of allocated data blocks. */
91 * The start of data blocks for U+0800 and above.
162 /* set the index-2 indexes for the 2=0x80>>UTRIE2_SHIFT_2 ASCII data blocks */
172 * Reference counts for the null data block: all blocks except for the ASCII blocks.
197 * does not overlap other index-2 blocks with the gap.
225 * for 2-byte UTF-8 which will be compacted in 64-blocks
701 * mark index values for repeat-data blocks by setting bit 31 of the index values
753 /* iterate over all-value blocks */
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_impl.cc | 63 // Callback for updating the user's parameter blocks. Updates are only
322 << " parameter blocks, "
326 << " residual blocks, "
363 summary->error = "Problem contains no parameter blocks.";
369 summary->error = "Problem contains no residual blocks.";
485 << "No non-constant parameter blocks found.";
734 summary->error = "Problem contains no parameter blocks.";
740 summary->error = "Problem contains no residual blocks.";
829 << "No non-constant parameter blocks found.";
[all...] |
| /external/ceres-solver/include/ceres/ |
| solver.h | 431 // parameter blocks, i.e, each parameter block belongs to exactly
436 // Given such an ordering, Ceres ensures that the parameter blocks in
438 // parmeter blocks in the next lowest numbered group and so on. Within
439 // each group, Ceres is free to order the parameter blocks as it
442 // If NULL, then all parameter blocks are assumed to be in the
473 // But if the user already knows what parameter blocks are points and
475 // the parameter blocks into two groups, one for the points and one
505 // structure in the way the parameter blocks interact that it is
566 // 1. Let the solver heuristically decide which parameter blocks
573 // all parameter blocks need to be present in the ordering
[all...] |
| /external/libnfc-nxp/src/ |
| phFriNfc_NdefMap.c | [all...] |
| phFriNfc_ISO15693Format.c | 70 /* Read MULTIPLE blocks support mask for CC byte 4 */
75 /* Read two blocks */
288 /* To get the number of blocks in the card */
415 /* For SLI - S tags : Read multiple blocks not supported */
422 /* For SLI - L tags : Read multiple blocks not supported */
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_rast_tri_tmp.h | 98 /* Mask of sub-blocks which are inside all trivial accept planes:
102 /* Mask of sub-blocks which are inside all trivial reject planes,
201 /* Mask of sub-blocks which are inside all trivial accept planes:
205 /* Mask of sub-blocks which are inside all trivial reject planes,
297 /* Mask of sub-blocks which are inside all trivial reject planes,
|
| /external/e2fsprogs/e2fsck/ |
| e2fsck.h | 100 int numblocks; /* number of blocks */
217 blk64_t num_blocks; /* Total number of blocks */
232 ext2fs_inode_bitmap inode_bb_map; /* Inodes which are in bad blocks */
236 ext2fs_block_bitmap block_found_map; /* Blocks which are in use */
238 ext2fs_block_bitmap block_ea_map; /* Blocks which are used by EA's */
|
| /external/llvm/lib/Target/ARM/ |
| Thumb2ITBlockPass.cpp | 1 //===-- Thumb2ITBlockPass.cpp - Insert Thumb-2 IT blocks ------------------===//
22 STATISTIC(NumITs, "Number of IT blocks inserted");
38 return "Thumb IT blocks insertion pass";
112 // between selects we would end up creating multiple IT blocks.
270 /// createThumb2ITBlockPass - Returns an instance of the Thumb2 IT blocks
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| OptimalEdgeProfiling.cpp | 96 // Keep track of which blocks need to be instrumented. We don't want to
97 // instrument blocks that are added as the result of breaking critical
134 // edges (0,entry) and (BB,0) (for blocks with no successors) and this
159 // InsertedBlocks contains all blocks that were inserted for splitting an
160 // edge, this blocks do not have to be instrumented.
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 10 // This pass moves instructions into successor blocks, when possible, so that
73 /// occur in blocks dominated by the specified block.
108 // Process all basic blocks.
123 // Don't bother sinking code out of unreachable blocks. In addition to being
237 // Instructions can only be sunk if all their uses are in blocks
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_rast_tri_tmp.h | 98 /* Mask of sub-blocks which are inside all trivial accept planes:
102 /* Mask of sub-blocks which are inside all trivial reject planes,
201 /* Mask of sub-blocks which are inside all trivial accept planes:
205 /* Mask of sub-blocks which are inside all trivial reject planes,
297 /* Mask of sub-blocks which are inside all trivial reject planes,
|
| /external/v8/src/x64/ |
| lithium-gap-resolver-x64.cc | 103 // as this one's destination blocks this one so recursively perform all
107 if (other_move.Blocks(destination) && !other_move.IsPending()) {
137 if (other_move.Blocks(destination)) {
310 if (other_move.Blocks(source)) {
312 } else if (other_move.Blocks(destination)) {
|
| /frameworks/base/core/java/android/nfc/tech/ |
| MifareUltralight.java | 142 * return pages that have been wrapped back to the first blocks. MIFARE
143 * Ultralight tags have readable blocks 0x00 through 0x0F. So a read to
144 * block offset 0x0E would return blocks 0x0E, 0x0F, 0x00, 0x01. MIFARE
145 * Ultralight C tags have readable blocks 0x00 through 0x2B. So a read to
146 * block 0x2A would return blocks 0x2A, 0x2B, 0x00, 0x01.
|
| /external/chromium_org/chromeos/dbus/ |
| cryptohome_client.h | 90 // This method blocks until the call returns.
121 // Same as GetSanitizedUsername() but blocks until a reply is received, and
166 // This method blocks until the call returns.
177 // This method blocks until the call returns.
185 // This method blocks until the call returns.
199 // succeeds. This method blocks until the call returns.
223 // This method blocks until the call returns.
230 // This method blocks until the call returns.
236 // succeeds. This method blocks until the call returns.
244 // succeeds. This method blocks until the call returns
[all...] |
| /external/chromium_org/net/disk_cache/ |
| block_files.cc | 25 // type of entry that can be stored there (number of consecutive blocks).
28 // Returns the type of block (number of consecutive blocks that can be stored)
93 // than the actual number of used blocks.
198 // this file yet so that it is easier to find empty blocks when we start
546 header->empty[3] = (new_size - header->max_entries) / 4; // 4 blocks entries
694 // We are interested in the total number of blocks used by this file type, and
695 // the max number of blocks that we can store (reported as the percentage of
696 // used blocks). In order to find out the number of used blocks, we have to
697 // substract the empty blocks from the total blocks for each file in the chain
[all...] |
| /external/clang/include/clang/AST/ |
| Comment.h | 1077 ArrayRef<BlockContentComment *> Blocks;
1081 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) :
1083 Blocks(Blocks), ThisDeclInfo(D) {
1084 if (Blocks.empty())
1087 setSourceRange(SourceRange(Blocks.front()->getLocStart(),
1088 Blocks.back()->getLocEnd()));
1089 setLocation(Blocks.front()->getLocStart());
1097 return reinterpret_cast<child_iterator>(Blocks.begin());
1101 return reinterpret_cast<child_iterator>(Blocks.end());
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 33 TargetsToBlocks *blocks) {
34 return CodeGen::CutGraphIntoBasicBlocks(insns, branch_targets, blocks);
37 void MergeTails(TargetsToBlocks *blocks) {
38 CodeGen::MergeTails(blocks);
243 // Basic blocks are supposed to start with a branch target and end with
315 // Also serialize the addresses the basic blocks as we encounter them.
316 // This will change as basic blocks are coalesed by MergeTails().
|
| /external/chromium_org/v8/src/ |
| hydrogen-bch.cc | 78 // Utility methods to iterate over dominated blocks.
120 for (int i = 0; i < graph()->blocks()->length(); i++) {
202 elements_(graph->blocks()->length(), graph->zone()) {
203 for (int i = 0; i < graph->blocks()->length(); i++) {
205 element.set_block(graph->blocks()->at(i));
397 for (int i = 0; i < graph()->blocks()->length(); i++) {
398 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
|
| /external/e2fsprogs/lib/ext2fs/ |
| initialize.c | 62 * Calculate the number of GDT blocks to reserve for online filesystem growth.
63 * The absolute maximum number of GDT blocks we can reserve is determined by
197 /* default: (fs->blocksize*8) blocks/group, up to 2^16 (GDT limit) */
271 * the inode table blocks in the descriptor. If not, add some
304 * check the number of reserved group descriptor table blocks
317 * Calculate the maximum number of bookkeeping blocks per
320 * table, and the reserved gdt blocks.
|
| /external/valgrind/main/docs/internals/ |
| xml-output.txt | 133 * Some errors may have two <auxwhat> blocks, rather than just one
271 bytes and blocks leaked by this error.
338 memory leak; the referenced blocks are definitely lost
342 memory leak; the referenced blocks are lost because all pointers
343 to them are also in leaked blocks
347 memory leak; only interior pointers to referenced blocks were
352 memory leak; pointers to un-freed blocks are still available
|
