| /frameworks/av/services/camera/libcameraservice/api1/client2/ |
| Camera2Heap.h | 26 // Utility class for managing a set of IMemory blocks
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| InputStreamReaderTest.java | 28 * This bug claims that InputStreamReader blocks unnecessarily:
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/ |
| ustat.h | 27 __daddr_t f_tfree; /* Number of free blocks. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| ustat.h | 27 __daddr_t f_tfree; /* Number of free blocks. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| ustat.h | 27 __daddr_t f_tfree; /* Number of free blocks. */
|
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 148 LOG(INFO) << "Camera blocks for inner iterations";
154 LOG(INFO) << "Point blocks for inner iterations";
160 LOG(INFO) << "Camera followed by point blocks for inner iterations";
169 LOG(INFO) << "Point followed by camera blocks for inner iterations";
178 LOG(INFO) << "Choosing automatic blocks for inner iterations";
212 // If quaternions are used, there are two blocks, so add the
286 // parameter blocks. One of size 4 for the quaternion and the
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_sparse_matrix_test.cc | 179 vector<int> blocks; local
180 blocks.push_back(1);
181 blocks.push_back(2);
182 blocks.push_back(2);
191 diagonal.data(), blocks));
196 EXPECT_EQ(blocks, matrix->row_blocks());
197 EXPECT_EQ(blocks, matrix->col_blocks());
|
| coordinate_descent_minimizer.cc | 86 // The ordering does not have to contain all parameter blocks, so
88 // blocks.
97 // Compute the set of residual blocks that depend on each parameter
125 // Set the state and mark all parameter blocks constant.
149 // The parameter blocks in each independent set can be optimized
|
| visibility_based_preconditioner.h | 89 // were to permute the parameter blocks such that all the cameras in
91 // be a block diagonal matrix with blocks corresponding to the
108 // of the camera blocks under which the CLUSTER_TRIDIAGONAL
167 // Number of parameter blocks in the schur complement.
171 // Sizes of the blocks in the schur complement.
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs_live_variables.cpp | 55 fs_bblock *block = cfg->blocks[b];
59 assert(cfg->blocks[b - 1]->end_ip == ip - 1);
120 foreach_list(block_node, &cfg->blocks[b]->children) {
212 def[i] = MIN2(def[i], cfg.blocks[b]->start_ip);
213 use[i] = MAX2(use[i], cfg.blocks[b]->start_ip);
217 def[i] = MIN2(def[i], cfg.blocks[b]->end_ip);
218 use[i] = MAX2(use[i], cfg.blocks[b]->end_ip);
|
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 11 // determining reachable blocks within a CFG.
273 // Find the reachable blocks from 'Start'.
297 // Scan for reachable blocks from the entrance of the CFG.
298 // If there are no unreachable blocks, we're done.
305 // blocks as roots.
315 // There are some unreachable blocks. We need to find the root blocks that
|
| /external/e2fsprogs/resize/ |
| main.c | 67 label = _("Relocating blocks");
395 /* Take down devices exactly 16T to 2^32-1 blocks */
442 " is only %llu (%dk) blocks.\nYou requested a new size"
443 " of %u blocks.\n\n"), max_size,
448 fprintf(stderr, _("The filesystem is already %u blocks "
464 "%s to %u (%dk) blocks.\n"),
481 printf(_("The filesystem on %s is now %u blocks long.\n\n"),
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/ |
| BlenderLoader.java | 74 /** The blocks read from the file. */
75 protected List<FileBlockHeader> blocks;
field in class:BlenderLoader
85 for (FileBlockHeader block : blocks) {
183 // reading blocks
184 blocks = new ArrayList<FileBlockHeader>();
210 // reading the blocks (dna block is automatically saved in the blender context when found)//TODO: zmieni? to
215 blocks.add(fileBlock);
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| EqualPHIEdgeBlockMerge.ll | 1 ; Test merging of blocks with phi nodes.
29 ; Test merging of blocks with phi nodes where at least one incoming value
54 ; Test merging of blocks with phi nodes where at least one incoming value
141 ; This phi has a conflicting value (0) with below phi (2), so blocks
169 ; blocks can't be merged
192 ; blocks can't be merged
217 ; This phi has a matching value (0) with below phi (0), so blocks
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_live_variables.cpp | 55 fs_bblock *block = cfg->blocks[b];
59 assert(cfg->blocks[b - 1]->end_ip == ip - 1);
120 foreach_list(block_node, &cfg->blocks[b]->children) {
212 def[i] = MIN2(def[i], cfg.blocks[b]->start_ip);
213 use[i] = MAX2(use[i], cfg.blocks[b]->start_ip);
217 def[i] = MIN2(def[i], cfg.blocks[b]->end_ip);
218 use[i] = MAX2(use[i], cfg.blocks[b]->end_ip);
|
| /system/core/libsparse/ |
| sparse_read.c | 99 int fd, int64_t offset, unsigned int blocks, unsigned int block,
104 unsigned int len = blocks * s->block_size;
110 if (chunk_size / s->block_size != blocks) {
137 int fd, unsigned int blocks, unsigned int block, uint32_t *crc32)
141 int64_t len = (int64_t)blocks * s->block_size;
178 int fd, unsigned int blocks, unsigned int block, uint32_t *crc32)
182 int64_t len = (int64_t)blocks * s->block_size;
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BasicBlocker.java | 29 * Utility that identifies basic blocks in bytecode.
50 * basic blocks, including the opcodes that start blocks of
71 * Identifies and enumerates the basic blocks in the given method,
76 * @return {@code non-null;} list of basic blocks
228 * target and next instruction begin new blocks.)
267 * Extracts the list of basic blocks from the bit sets.
269 * @return {@code non-null;} the list of basic blocks
409 * dead code blocks as those marked as blocks but not also marke
[all...] |
| /external/chromium_org/third_party/angle/src/third_party/murmurhash/ |
| MurmurHash3.cpp | 108 const uint32_t * blocks = (const uint32_t *)(data + nblocks*4); local
112 uint32_t k1 = getblock(blocks,i);
169 const uint32_t * blocks = (const uint32_t *)(data + nblocks*16); local
173 uint32_t k1 = getblock(blocks,i*4+0);
174 uint32_t k2 = getblock(blocks,i*4+1);
175 uint32_t k3 = getblock(blocks,i*4+2);
176 uint32_t k4 = getblock(blocks,i*4+3);
270 const uint64_t * blocks = (const uint64_t *)(data); local
274 uint64_t k1 = getblock(blocks,i*2+0);
275 uint64_t k2 = getblock(blocks,i*2+1)
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| MurmurHash3.cpp | 108 const uint32_t * blocks = (const uint32_t *)(data + nblocks*4); local
112 uint32_t k1 = getblock(blocks,i);
169 const uint32_t * blocks = (const uint32_t *)(data + nblocks*16); local
173 uint32_t k1 = getblock(blocks,i*4+0);
174 uint32_t k2 = getblock(blocks,i*4+1);
175 uint32_t k3 = getblock(blocks,i*4+2);
176 uint32_t k4 = getblock(blocks,i*4+3);
270 const uint64_t * blocks = (const uint64_t *)(data); local
274 uint64_t k1 = getblock(blocks,i*2+0);
275 uint64_t k2 = getblock(blocks,i*2+1)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| mkjournal.c | 138 * Convenience function which zeros out _num_ blocks starting at
310 * of free blocks.
372 * Find a reasonable journal file size (in blocks) given the number of blocks
376 int ext2fs_default_journal_size(__u64 blocks)
378 if (blocks < 2048)
380 if (blocks < 32768)
382 if (blocks < 256*1024)
384 if (blocks < 512*1024)
386 if (blocks < 1024*1024
[all...] |
| /external/llvm/include/llvm/Support/ |
| CFG.h | 137 assert(Term == I.Term &&"Cannot assign iterators to two different blocks!");
164 assert(Term == x.Term && "Cannot compare iterators of different blocks!");
169 assert(Term == x.Term && "Cannot compare iterators of different blocks!");
173 assert(Term == x.Term && "Cannot compare iterators of different blocks!");
178 assert(Term == x.Term && "Cannot compare iterators of different blocks!");
204 assert(Term == x.Term && "Cannot work on iterators of different blocks!");
254 // graph of basic blocks...
284 // graph of basic blocks... and to walk it in inverse order. Inverse order for
321 // graph of basic blocks... these are the same as the basic block iterators,
346 // graph of basic blocks... and to walk it in inverse order. Inverse order fo
[all...] |
| /external/llvm/lib/IR/ |
| GCOV.cpp | 85 DeleteContainerPointers(Blocks);
108 Blocks[i]->addCount(Buff.readInt64());
115 // read blocks.
122 Blocks.push_back(new GCOVBlock(i));
131 Blocks[BlockNo]->addEdge(Buff.readInt());
142 GCOVBlock *Block = Blocks[BlockNo];
158 for (SmallVectorImpl<GCOVBlock *>::iterator I = Blocks.begin(),
159 E = Blocks.end(); I != E; ++I)
166 for (SmallVectorImpl<GCOVBlock *>::iterator I = Blocks.begin(),
167 E = Blocks.end(); I != E; ++I
[all...] |
| /external/lzma/C/ |
| XzEnc.c | 93 const CXzBlockSizes *block = &p->blocks[i];
126 if (p->blocks == 0 || p->numBlocksAllocated == p->numBlocks)
130 CXzBlockSizes *blocks;
local
133 blocks = alloc->Alloc(alloc, newSize);
134 if (blocks == 0)
138 memcpy(blocks, p->blocks, p->numBlocks * sizeof(CXzBlockSizes));
141 p->blocks = blocks;
145 CXzBlockSizes *block = &p->blocks[p->numBlocks++];
[all...] |
| /external/chromium/chrome/browser/sync/ |
| profile_sync_service_harness.h | 63 // Blocks the caller until this harness has completed a single sync cycle
67 // Blocks the caller until this harness has observed that the sync engine
72 // Calling this acts as a barrier and blocks the caller until |this| and
81 // Blocks the caller until |this| completes its ongoing sync cycle and every
88 // Blocks the caller until every client in |clients| completes its ongoing
|
| /external/chromium_org/net/disk_cache/v3/ |
| disk_format_v3.h | 10 // will be stored as a series of blocks on a block-file. In any case, CacheAddr
25 // designed to store blocks of data of a given size. For more details see
29 // data_6), each one dedicated to store blocks of a given size or function. The
32 // There are three "special" types of blocks: normal entries, evicted entries
35 // The files that store internal information for the cache (blocks and index)
|
