| /external/v8/src/ |
| lithium-allocator.cc | 538 live_in_sets_(graph->blocks()->length()),
556 int block_count = graph_->blocks()->length();
567 // Process all successor blocks.
1061 const ZoneList<HBasicBlock*>* blocks = graph_->blocks(); local
1073 const ZoneList<HBasicBlock*>* blocks = graph_->blocks(); local
1198 const ZoneList<HBasicBlock*>* blocks = graph_->blocks(); local
1221 const ZoneList<HBasicBlock*>* blocks = graph_->blocks(); local
[all...] |
| handles.cc | 51 int n = impl->blocks()->length();
54 (isolate->handle_scope_data()->next - impl->blocks()->last()));
76 if (!impl->blocks()->is_empty()) {
77 Object** limit = &impl->blocks()->last()[kHandleBlockSize];
89 // Add the extension to the global list of blocks, but count the
91 impl->blocks()->Add(result);
[all...] |
| /external/grub/stage2/ |
| fsys_reiserfs.c | 55 __u32 s_block_count; /* blocks count */
56 __u32 s_free_blocks; /* free blocks count */
61 __u32 s_journal_trans_max; /* max number of blocks in a transaction. */
63 __u32 s_journal_max_batch; /* max number of blocks to batch into a trans */
72 __u16 s_bmap_nr; /* amount of bitmap blocks needed to address each block of file system */
92 __u32 j_realblock[JOURNAL_TRANS_HALF]; /* real locations for the first blocks */
100 __u32 j_realblock[JOURNAL_TRANS_HALF]; /* real locations for the last blocks */
101 char j_digest[16]; /* md5 sum of all the blocks involved, including desc and commit. not used, kill it */
107 fully flushed means all the log blocks and all the real blocks ar
337 unsigned int blocks[MAX_HEIGHT]; member in struct:fsys_reiser_info
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/sed/ |
| compile.c | 91 struct error_info err_info; /* track where `{}' blocks start */
129 static struct sed_label *blocks = NULL;
1151 blocks = setup_label(blocks, vector->v_length, NULL, &cur_input);
1156 if (!blocks)
1166 vector->v[blocks->v_index].x.jump_index = vector->v_length;
1167 blocks = release_label(blocks); /* done with this entry */
127 static struct sed_label *blocks = NULL; variable in typeref:struct:sed_label
[all...] |
| /cts/tools/vm-tests-tf/src/util/build/ |
| BuildDalvikSuite.java | 552 int blocks = 1;
553 while ((currentChar = (char) reader.read()) != -1 && blocks > 0) {
556 blocks--;
561 blocks++;
|
| /external/libyuv/files/source/ |
| rotate_neon.s | 30 @ the first of the two blocks. need to subtract that 8 off
40 @ the loop needs to run on blocks of 16. what will be left
112 @ loops are on blocks of 8. loop will stop when
117 @ handle 8x8 blocks. this should be the majority of the plane
299 @ the output is written in to two blocks.
307 @ the loop needs to run on blocks of 8. what will be left
370 @ loops are on blocks of 8. loop will stop when
375 @ handle 8x8 blocks. this should be the majority of the plane
|
| /dalvik/vm/alloc/ |
| Copying.cpp | 57 * The block queue exists to thread lists of blocks from the various
68 * more contiguous blocks. Objects that are small enough to fit
71 * blocks. When half the available blocks are filled, a garbage
78 * scheme; blocks containing such objects are grayed (promoted) at the
153 * We use 512-byte blocks.
183 /* Total number of blocks available for allocation. */
194 * Base and limit blocks. Basically the shifted start address of
195 * the block. We convert blocks to a relative number when
294 * blocks
590 size_t aligned, available, blocks; local
[all...] |
| /external/emma/core/java12/com/vladium/emma/instr/ |
| InstrVisitor.java | 946 final BlockList blocks = new BlockList (blockCount); local
[all...] |
| /dalvik/vm/compiler/ |
| Utility.cpp | 58 * See if there are previously allocated arena blocks before the last
89 /* Reclaim all the arena blocks allocated so far */
178 LOGD("%d blocks in total", cUnit->numBlocks);
247 LOGD("Compiler arena uses %d blocks (%d bytes each)",
370 void dvmDumpBlockBitVector(const GrowableList *blocks, char *msg,
379 (BasicBlock *) dvmGrowableListGetElement(blocks, i);
|
| SSATransformation.cpp | 36 dvmGrowableListIteratorInit(&block->successorBlockList.blocks,
49 /* Sort the blocks by the Depth-First-Search pre-order */
128 /* Iterate through the dominated blocks first */
151 * blocks.
174 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
380 * Iterate through all successor blocks and propagate up the live-in sets.
399 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
447 /* Calculate the phi blocks for each Dalvik register */
467 * Iterate through the original blocks plus the new ones in
499 * predecessor blocks
[all...] |
| Frontend.cpp | 586 dvmGrowableListIteratorInit(&bottomBlock->successorBlockList.blocks,
752 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
782 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
839 dvmGrowableListIteratorInit(&predBB->successorBlockList.blocks,
866 /* Identify code range in try blocks and set up the empty catch blocks */
882 /* Mark all the insn offsets in Try blocks */
894 /* Iterate over each of the handlers to enqueue the empty Catch blocks */
910 * Create dummy catch blocks first. Since these are created before
911 * other blocks are processed, "split" is specified as false
[all...] |
| /external/webrtc/src/modules/audio_processing/aecm/main/matlab/ |
| compsup.m | 74 maxDelayb = floor(samplingfreq*maxDelay/updatel); % in blocks
75 histLenb = floor(samplingfreq*histLen/updatel); % in blocks
96 nb = n/blockLen - oversampling + 1; % in blocks
151 % loop over signal blocks
|
| /system/core/gpttool/ |
| gpttool.c | 95 void init_mbr(u8 *mbr, u32 blocks)
112 memcpy(mbr + 0x1ca, &blocks, sizeof(u32));
301 fprintf(stderr,"blocks %lld\n", sz);
|
| /system/core/sdcard/ |
| fuse.h | 89 __u64 blocks; member in struct:fuse_attr
106 __u64 blocks; member in struct:fuse_kstatfs
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 36 * blocks.
73 private final ByteBlockList blocks; field in class:Ropper
128 /** list of all blocks that jsr to this subroutine */
130 /** List of all blocks that return from this subroutine */
151 * @param retBlock one of the ret blocks (final blocks) of this
167 * Adds a label to the list of ret blocks (final blocks) for this
177 * Adds a label to the list of caller blocks for this subroutine.
186 * Generates a list of subroutine successors. Note: successor blocks
[all...] |
| /external/e2fsprogs/e2fsck/ |
| rehash.c | 24 * blocks. This pretty much requires an incremental approach, where
30 * yet available, blocks from the beginning part of the old directory
224 int blocks)
229 new_mem = realloc(outdir->buf, blocks * fs->blocksize);
234 blocks * sizeof(ext2_dirhash_t));
239 outdir->buf = malloc(blocks * fs->blocksize);
240 outdir->hashes = malloc(blocks * sizeof(ext2_dirhash_t));
243 outdir->max = blocks;
569 /* Write out the pointer blocks */
|
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| ikev2_common.c | 203 size_t i, blocks; local
213 blocks = len / 8;
215 for (i = 0; i < blocks; i++) {
262 size_t i, blocks; local
276 blocks = len / 8;
277 for (i = 0; i < blocks; i++) {
|
| /external/wpa_supplicant_8/src/eap_common/ |
| ikev2_common.c | 204 size_t i, blocks; local
214 blocks = len / 8;
216 for (i = 0; i < blocks; i++) {
263 size_t i, blocks; local
277 blocks = len / 8;
278 for (i = 0; i < blocks; i++) {
|
| /external/expat/lib/ |
| xmlparse.c | 222 BLOCK *blocks; member in struct:__anon5794
[all...] |
| /external/bluetooth/bluez/audio/ |
| liba2dp.c | 480 data->sbc.blocks = SBC_BLK_4;
483 data->sbc.blocks = SBC_BLK_8;
486 data->sbc.blocks = SBC_BLK_12;
489 data->sbc.blocks = SBC_BLK_16;
633 data->sbc.allocation, data->sbc.subbands, data->sbc.blocks,
1206 /* Enough data to encode (sbc wants 512 byte blocks) */
|
| /external/bluetooth/bluez/test/ |
| ipctest.c | 551 a2dp->sbc.blocks = SBC_BLK_4;
554 a2dp->sbc.blocks = SBC_BLK_8;
557 a2dp->sbc.blocks = SBC_BLK_12;
560 a2dp->sbc.blocks = SBC_BLK_16;
648 u->a2dp.sbc.blocks, u->a2dp.sbc.bitpool);
|
| /external/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 26 # Define the width of a tab for code blocks.
319 # Turn block-level HTML blocks into hash entries
389 # Hashify HTML blocks:
444 # First, look for nested blocks, e.g.:
578 # begining in the Markdown function since hashed blocks can be part of
579 # list items and could have been indented. Indented blocks would have
588 # Run block gamut tranformations, without hashing HTML blocks. This is
589 # useful when HTML blocks are known to be already hashed, like in the first
596 # Finally form paragraph and restore hashed blocks.
1611 $blocks = explode("\\t", $line); variable
[all...] |
| /external/valgrind/main/exp-ptrcheck/ |
| sg_main.c | 166 /* Hopefully the .base test hits most of the time. For the blocks
298 identical blocks are claimed to have different sizes. In which
317 /* This makes the blocks identical, at the size of the
322 stage will get rid of one of the blocks. This is
331 /* If there are any blocks which overlap and have the same
348 "overlapping stack blocks\n");
384 XArray* blocks = VG_(di_get_stack_blocks_at_ip)( ip, True/*arrays only*/ ); local
385 tl_assert(blocks);
386 return StackBlocks__find_and_dealloc__or_add( blocks );
559 overlapping stack blocks. *
1132 XArray* blocks; \/* XArray* of StackBlock, or NULL if none *\/ member in struct:__anon12678
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| nfs_prot.h | 87 u_int blocks; member in struct:fattr
248 u_int blocks; member in struct:statfsokres
|
| /cts/tools/vm-tests/src/util/build/ |
| BuildDalvikSuite.java | 715 int blocks = 1;
716 while ((currentChar = (char) reader.read()) != -1 && blocks > 0) {
719 blocks--;
724 blocks++;
|
