| /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:__anon5791
[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) */
|
| gstavdtpsink.c | 324 gint rate, subbands, blocks; local
388 value = gst_structure_get_value(structure, "blocks");
389 blocks = g_value_get_int(value);
390 if (blocks == 16)
392 else if (blocks == 12)
394 else if (blocks == 8)
396 else if (blocks == 4)
399 GST_ERROR_OBJECT(sink, "Invalid blocks %d", blocks);
553 /* blocks */
[all...] |
| /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/v8/src/ |
| 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...] |
| /dalvik/vm/compiler/ |
| 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 | 585 dvmGrowableListIteratorInit(&bottomBlock->successorBlockList.blocks,
736 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
766 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
823 dvmGrowableListIteratorInit(&predBB->successorBlockList.blocks,
850 /* Identify code range in try blocks and set up the empty catch blocks */
866 /* Mark all the insn offsets in Try blocks */
878 /* Iterate over each of the handlers to enqueue the empty Catch blocks */
894 * Create dummy catch blocks first. Since these are created before
895 * other blocks are processed, "split" is specified as false
[all...] |
| CompilerIR.h | 157 const Method *containingMethod; // For blocks from the callee
159 bool needFallThroughBranch; // For blocks ended due to length limit
173 GrowableList blocks; member in struct:BasicBlock::__anon739
178 * The "blocks" field in "successorBlockList" points to an array of
180 * For catch blocks, key is type index for the exception.
181 * For swtich blocks, key is the case value.
|
| /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:__anon12675
[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++;
|
| /external/e2fsprogs/lib/ext2fs/ |
| inode.c | 111 errcode_t (*save_get_blocks)(ext2_filsys f, ext2_ino_t ino, blk_t *blocks);
267 * blocks in the inode table.
280 * bad blocks. :-)
288 * is no longer the case. If we run out of bad blocks, then
301 * (We could try to handle runs of bad blocks, but that
316 * read in, adjust the number of blocks to read so that we we
328 * read in more blocks from the current blockgroup's inode table.
336 * Figure out how many blocks to read; we read at most
338 * many blocks left to read.
453 * need to read in more blocks
[all...] |
| /frameworks/base/core/java/android/os/ |
| FileUtils.java | 67 public long blocks; field in class:FileUtils.FileStatus
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/cp/ |
| name-lookup.h | 224 tree blocks;
222 tree blocks; local
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/cp/ |
| name-lookup.h | 224 tree blocks;
222 tree blocks; local
|
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/cp/ |
| name-lookup.h | 224 tree blocks;
222 tree blocks; local
|
| /external/v8/benchmarks/ |
| richards.js | 95 * priorities. Scheduling is done by maintaining a list of task control blocks
102 this.blocks = new Array(NUMBER_OF_IDS);
182 this.blocks[id] = this.currentTcb;
205 var tcb = this.blocks[id];
242 var t = this.blocks[packet.id];
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks
97 this.blocks = new Array(NUMBER_OF_IDS);
177 this.blocks[id] = this.currentTcb;
200 var tcb = this.blocks[id];
237 var t = this.blocks[packet.id];
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks
97 this.blocks = new Array(NUMBER_OF_IDS);
177 this.blocks[id] = this.currentTcb;
200 var tcb = this.blocks[id];
237 var t = this.blocks[packet.id];
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks
97 this.blocks = new Array(NUMBER_OF_IDS);
177 this.blocks[id] = this.currentTcb;
200 var tcb = this.blocks[id];
237 var t = this.blocks[packet.id];
|
| /external/blktrace/doc/ |
| blktrace.tex | 243 16793600 inodes, 33555456 blocks
244 1677772 blocks (5.00%) reserved for the super user
246 Maximum filesystem blocks=4294967296
248 32768 blocks per group, 32768 fragments per group
250 Superblock backups stored on blocks:
255 Creating journal (8192 blocks): done
603 \emph{n} & Number of blocks \\ \hline
690 If no payload is present, the sector and number of blocks are presented
701 If no payload is present, the sector and number of blocks are presented
710 \item[S -- sleep] The starting sector and number of blocks is outpu
[all...] |
