| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils_test.cc | 43 vector<int> blocks; local
47 blocks.push_back(1);
48 blocks.push_back(2);
49 blocks.push_back(3);
50 blocks.push_back(3);
51 blocks.push_back(1);
77 BlockOrderingToScalarOrdering(blocks,
|
| compressed_row_sparse_matrix.cc | 292 const vector<int>& blocks) {
295 for (int i = 0; i < blocks.size(); ++i) {
296 num_rows += blocks[i];
297 num_nonzeros += blocks[i] * blocks[i];
310 for (int i = 0; i < blocks.size(); ++i) {
311 const int block_size = blocks[i];
323 *matrix->mutable_row_blocks() = blocks;
324 *matrix->mutable_col_blocks() = blocks;
|
| block_jacobian_writer.h | 35 // jacobian. When the cost function is evaluated, the jacobian blocks get placed
69 // This is a noop since the blocks were written directly into their final
80 // contiguos dense blocks, one after each other; see BlockSparseMatrix. The
82 // blocks. Given a pointer to the first element of a block and the size of
111 // There are only 2 jacobian blocks: dr/dx and dr/dz. jacobian_layout_ would
|
| block_random_access_sparse_matrix.cc | 48 const vector<int>& blocks,
51 blocks_(blocks) {
52 CHECK_LT(blocks.size(), kMaxRowBlocks);
118 // Assume that the user does not hold any locks on any cell blocks
148 // Assume that the user does not hold any locks on any cell blocks
|
| /external/e2fsprogs/misc/ |
| badblocks.c | 2 * badblocks.c - Bad blocks checker
23 * 94/02/27 - Made a separate bad blocks checker
25 * configurable blocks-at-once parameter,
27 * blocks known to be bad, multiple passes to
28 * make sure that no new blocks are added to the
78 static unsigned int max_bb = 0; /* Abort test if more than this number of bad blocks has been encountered */
323 * Perform a read of a sequence of blocks; return the number of blocks
395 * Perform a write of a sequence of blocks; return the number of blocks
[all...] |
| e2image.8.in | 108 blocks and directory blocks, which the standard image file does not have,
118 This will only send the metadata information, without any data blocks.
119 However, the filenames in the directory blocks can still reveal
126 of the directory blocks before writing the image file. However,
|
| /external/eigen/doc/ |
| C04_TutorialBlockOperations.dox | 10 A block is a rectangular part of a matrix or array. Blocks expressions can be used both
45 The following program uses the dynamic-size and fixed-size versions to print the values of several blocks inside a
58 it was only read from. However, blocks can also be used as \em lvalues, meaning that you can assign to a block.
60 This is illustrated in the following example. This example also demonstrates blocks in arrays, which works exactly like the above-demonstrated blocks in matrices.
80 Individual columns and rows are special cases of blocks. Eigen provides methods to easily address them:
114 Eigen also provides special methods for blocks that are flushed against one of the corners or sides of a
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 180 // Sort the blocks vector so that we can use binary search to do quick
196 // block they are defined in. Also, blocks not reachable from the
220 // Return false if any loop blocks contain indirectbrs, or there are any calls
340 // Sort the blocks vector so that we can use binary search to do quick
356 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
357 /// These are the blocks _outside of the current loop_ which are branched to.
365 // Sort the blocks vector so that we can use binary search to do quick
433 /// Find the new parent loop for all blocks within the "unloop" whose last
466 /// updateBlockParents - Update the parent loop for all blocks that are directly
470 // Perform a post order CFG traversal of all blocks within this loop
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86PadShortFunction.cpp | 33 STATISTIC(NumBBsPadded, "Number of basic blocks padded");
73 // ReturnBBs - Maps basic blocks that return to the minimum number of
91 /// runOnMachineFunction - Loop over all of the basic blocks, inserting
105 // Search through basic blocks and mark the ones that have early returns
115 // Pad the identified basic blocks with NOOPs
143 /// basic blocks that contain a return to ReturnBBs.
184 // Mark basic blocks with a return instruction. Calls to other
|
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_cipher.h | 373 @param blocks The number of complete blocks to process
377 int (*accel_ecb_encrypt)(const unsigned char *pt, unsigned char *ct, unsigned long blocks, symmetric_key *skey);
382 @param blocks The number of complete blocks to process
386 int (*accel_ecb_decrypt)(const unsigned char *ct, unsigned char *pt, unsigned long blocks, symmetric_key *skey);
391 @param blocks The number of complete blocks to process
396 int (*accel_cbc_encrypt)(const unsigned char *pt, unsigned char *ct, unsigned long blocks, unsigned char *IV, symmetric_key *skey);
401 @param blocks The number of complete blocks to proces
[all...] |
| /external/clang/docs/ |
| BlockLanguageSpec.rst | 5 Language Specification for Blocks
33 function type. Blocks are intended to be used much like functions with
179 (nest) and all variables captured by any nested blocks are implicitly
180 also captured in the scopes of their enclosing Blocks.
188 Blocks are :block-term:`invoked` using function call syntax with a
212 in matched use, release allocated storage for referenced Blocks.
242 an implementation provides initial automatic storage for Blocks. This
268 All Blocks are constructed to be Objective-C objects regardless of
270 not. Blocks using automatic (stack) memory are objects and may be
287 Blocks
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveRangeCalc.h | 53 /// LiveOutMap - Map basic blocks to the value leaving the block.
62 /// Blocks without a Seen bit are ignored.
98 /// LiveIn - Work list of blocks where the live-in value has yet to be
110 /// If multiple values can reach Kill, the blocks that need LI to be live in
113 /// PhysReg, when set, is used to verify live-in lists on basic blocks.
120 /// blocks in LiveIn. Create PHI-def values as required to preserve SSA form.
123 /// blocks. No values are read from the live ranges.
167 /// PhysReg, when set, is used to verify live-in lists on basic blocks.
196 // live-out blocks are already known, but the SSA value in each block is
199 // After calling reset(), add known live-out values and known live-in blocks
[all...] |
| /dalvik/dx/src/com/android/dx/rop/ |
| package-info.java | 58 * Each method is separated into a list of basic blocks. For the most part,
59 * basic blocks are referred to by a positive integer
62 * bytecode. Blocks that don't originate directly from source bytecode have
65 * Blocks are referred to by their label, for the most part, because
71 * to N {@link RopMethod#getExitPredecessors exit predecessor blocks} which
72 * will return. All blocks that are not the entry block will have at least
74 * list). All blocks that are not exit predecessors must have at least one
77 * Since all blocks must branch, all blocks must have, as their final
|
| /external/chromium_org/chrome/test/automation/ |
| tab_proxy.h | 88 // hence blocks until the navigation completes.
94 // hence blocks until the |number_of_navigations| navigations complete.
109 // hence blocks until the navigation completes.
113 // hence blocks until the |number_of_navigations| navigations complete.
118 // hence blocks until the navigation completes.
122 // hence blocks until the |number_of_navigations| navigations complete.
127 // hence blocks until the navigation completes.
131 // closed, rather it blocks until the browser has initiated the close. Use
182 // hence blocks until the navigation completes.
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 108 // blocks.
156 // BlockFile - A file which contains a list of blocks that should not be
159 BlockFile("extract-blocks-file", cl::value_desc("filename"),
160 cl::desc("A file containing list of basic blocks to not extract"),
164 /// BlockExtractorPass - This pass is used by bugpoint to extract all blocks
185 INITIALIZE_PASS(BlockExtractorPass, "extract-blocks",
186 "Extract Basic Blocks From Module (for bugpoint use)",
189 // createBlockExtractorPass - This pass extracts all blocks (except those
284 // Now that we know which blocks to not extract, figure out which ones we WANT
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| find.h | 178 * There are two main differences between the growing blocks and
179 * the constant-size blocks variants.
182 * 2. For GB, the blocks are allocated dynamically;
183 * for CSB, the blocks are allocated in a predetermined manner,
261 // Result cannot be in future blocks, stop algorithm.
302 * There are two main differences between the growing blocks and the
303 * constant-size blocks variants.
305 * 2. For GB, the blocks are allocated dynamically; for CSB, the
306 * blocks are allocated in a predetermined manner, namely spacial
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| find.h | 173 * There are two main differences between the growing blocks and
174 * the constant-size blocks variants.
176 * 2. For GB, the blocks are allocated dynamically;
177 * for CSB, the blocks are allocated in a predetermined manner,
262 // Result cannot be in future blocks, stop algorithm.
303 * There are two main differences between the growing blocks and the
304 * constant-size blocks variants.
306 * 2. For GB, the blocks are allocated dynamically; for CSB, the
307 * blocks are allocated in a predetermined manner, namely spacial
|
| /external/bluetooth/bluedroid/stack/include/ |
| a2d_sbc.h | 49 #define A2D_SBC_IE_BLOCKS_MSK 0xF0 /* b7-b4 number of blocks */
50 #define A2D_SBC_IE_BLOCKS_4 0x80 /* 4 blocks */
51 #define A2D_SBC_IE_BLOCKS_8 0x40 /* 8 blocks */
52 #define A2D_SBC_IE_BLOCKS_12 0x20 /* 12blocks */
53 #define A2D_SBC_IE_BLOCKS_16 0x10 /* 16blocks */
|
| /external/chromium_org/third_party/icu/source/common/ |
| utrie2_impl.h | 67 /** Null index and data blocks, not shifted. */
133 * It also leads to orphan data blocks that are kept through serialization.
135 * Need to use reference counting for data blocks,
138 * This scheme seems like overkill for index-2 blocks since the whole index array is
140 * Just allocating multiple index-2 blocks as needed.
|
| /external/chromium_org/v8/src/ |
| hydrogen-dce.cc | 75 for (int i = 0; i < graph()->blocks()->length(); ++i) {
76 HBasicBlock* block = graph()->blocks()->at(i);
92 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone());
95 for (int i = 0; i < graph()->blocks()->length(); ++i) {
96 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/icu4c/common/ |
| utrie2_impl.h | 67 /** Null index and data blocks, not shifted. */
133 * It also leads to orphan data blocks that are kept through serialization.
135 * Need to use reference counting for data blocks,
138 * This scheme seems like overkill for index-2 blocks since the whole index array is
140 * Just allocating multiple index-2 blocks as needed.
|
| /external/kernel-headers/original/linux/ |
| ext3_fs.h | 31 * Define EXT3_RESERVATION to reserve data blocks for expanding files
34 /*max window size: 1024(direct blocks) + 3([t,d]indirect blocks) */
59 #define EXT3_BAD_INO 1 /* Bad blocks inode */
124 * Structure of a blocks group descriptor
128 __le32 bg_block_bitmap; /* Blocks bitmap block */
131 __le16 bg_free_blocks_count; /* Free blocks count */
153 * Constants relative to the data blocks
202 __u32 blocks_count; /* Total number of blocks in this group */
203 __u16 reserved_blocks; /* Number of reserved blocks in this group *
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 52 SetVector<BasicBlock *> Blocks;
63 /// \brief Create a code extractor for a sequence of blocks.
65 /// Given a sequence of basic blocks where the first block in the sequence
93 /// Based on the blocks used when constructing the code extractor,
95 bool isEligible() const { return !Blocks.empty(); }
|
| /external/qemu/elff/ |
| elf_alloc.h | 26 /* Alignment mask for blocks, allocated with this allocator. */
38 * ELFALLOC_ALIGNMENT_MASK value, so we can produce properly aligned blocks
39 * without having to adjust alignment of the blocks, returned from alloc()
68 * provide DWARF objects with blocks of the required size inside those chunks.
90 * simplifying alignment adjustments for the allocated blocks.
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| elf_alloc.h | 26 /* Alignment mask for blocks, allocated with this allocator. */
38 * ELFALLOC_ALIGNMENT_MASK value, so we can produce properly aligned blocks
39 * without having to adjust alignment of the blocks, returned from alloc()
68 * provide DWARF objects with blocks of the required size inside those chunks.
90 * simplifying alignment adjustments for the allocated blocks.
|
