HomeSort by relevance Sort by last modified time
    Searched full:blocks (Results 1901 - 1925 of 5464) sorted by null

<<71727374757677787980>>

  /dalvik/vm/compiler/
Loop.cpp 195 /* Loop structure not recognized as counted blocks */
540 /* Record blocks included in the loop */
613 /* Now mark blocks not included in the loop as hidden */
663 /* Loop blocks shouldn't contain any successor blocks (yet) */
  /external/aac/libAACenc/src/
block_switch.cpp 219 /* only long blocks, always use sine windows (MPEG2 AAC, MPEG4 AAC) */
428 /* Long Blocks */
443 /* Short Blocks */
445 /* in case all two channels were detected as short-blocks before syncing, use the grouping of channel with higher maxWindowNrg */
486 } /* Short Blocks */
  /external/bzip2/
bzip2recover.c 126 "%s: `%s' appears to contain more than %d blocks\n",
290 /* Increase if necessary. However, a .bz2 file with > 50000 blocks
316 "bzip2recover 1.0.6: extracts blocks from damaged .bz2 files.\n" );
414 /*-- identified blocks run from 1 to rbCtr inclusive. --*/
423 fprintf ( stderr, "%s: splitting into blocks\n", progName );
  /external/ceres-solver/internal/ceres/
visibility_based_preconditioner.cc 133 // visibility. The clusters form the diagonal blocks of the
240 // blocks. Thus all row blocks containing an e_block/point occur
266 // Iterate over the blocks in the row, ignoring the first block
378 // blocks correspond to the clusters. Then cluster pairs corresponding
  /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/
v8-richards.html 101 * priorities. Scheduling is done by maintaining a list of task control blocks
108 this.blocks = new Array(NUMBER_OF_IDS);
188 this.blocks[id] = this.currentTcb;
211 var tcb = this.blocks[id];
248 var t = this.blocks[packet.id];
  /external/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/sqlite/src/src/
mem3.c 50 ** more blocks where each block is 8 bytes. The first 8 bytes are
53 ** A chunk is two or more blocks that is either checked out or
55 ** size of the allocation in blocks if the allocation is free.
60 ** the previous chunk in blocks if the previous chunk is on the
133 ** Array of lists of free blocks according to the block size
  /external/chromium_org/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/chromium_org/v8/src/ia32/
lithium-gap-resolver-ia32.cc 107 // as this one's destination blocks this one so recursively perform all
111 if (other_move.Blocks(destination) && !other_move.IsPending()) {
141 if (other_move.Blocks(destination)) {
523 if (other_move.Blocks(source)) {
525 } else if (other_move.Blocks(destination)) {
  /external/e2fsprogs/e2fsck/
super.c 99 * We only remove indirect blocks if they are
118 * We don't remove direct blocks until we've reached
696 * locking the entire filesystem when allocating blocks or
877 * blocks. Returns non-zero if the sb should be backed up.
910 * If we are already writing out the backup blocks, then we
  /external/eigen/Eigen/src/Eigenvalues/
EigenSolver.h 40 * have blocks of the form
43 * blocks correspond to complex eigenvalue pairs \f$ u \pm iv \f$. We call
214 * block-diagonal. The blocks on the diagonal are either 1-by-1 or 2-by-2
215 * blocks of the form
217 * These blocks are not sorted in any particular order.
  /external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp 142 // If all successors are in the set of blocks post-dominated by unreachable,
210 /// \brief Calculate edge weights for edges leading to cold blocks.
232 // If all successors are in the set of blocks post-dominated by cold calls,
238 // set of blocks postdominated by a cold call.
477 // Walk the basic blocks in post-order so that we can build up state about
  /external/llvm/lib/CodeGen/
SjLjEHPrepare.cpp 143 /// we reach blocks we've already seen.
317 // Find all of the blocks that this value is live in.
335 // Now that we know all of the blocks that this thing is live in, see if
351 // in the unwind blocks. We should be more selective.
389 // Look through the terminators of the basic blocks to find invokes.
  /external/llvm/lib/Target/ARM/
ARMConstantIslandPass.cpp 47 STATISTIC(NumJTMoved, "Number of jump table destination blocks moved");
48 STATISTIC(NumJTInserted, "Number of jump table intermediate blocks inserted");
160 /// WaterList - A sorted list of basic blocks where islands could be placed
161 /// (i.e. blocks that don't fall through to the following block, due
394 // This pass invalidates liveness information when it splits basic blocks.
397 // Renumber all of the machine basic blocks in the function, guaranteeing that
409 // Blocks may have shifted around. Keep the numbering up to date.
517 // The function needs to be as aligned as the basic blocks. The linker may
638 // First thing, compute the size of all basic blocks, and see if the function
850 /// machine function, it upsets all of the block numbers. Renumber the blocks
    [all...]
  /external/llvm/lib/Target/Mips/
MipsDelaySlotFiller.cpp 54 cl::desc("Disallow MIPS delay filler to search successor basic blocks."),
68 /// \brief A functor comparing edge weight of two blocks.
223 /// This function searches one of MBB's successor blocks for an instruction
225 /// instruction into the successor's predecessor blocks.
256 /// This function inserts clones of Filler into predecessor blocks.
  /external/llvm/lib/Transforms/Utils/
LowerInvoke.cpp 254 /// we reach blocks we've already seen.
351 // Find all of the blocks that this value is live in.
369 // Now that we know all of the blocks that this thing is live in, see if
450 // statement that goes to all of the invoke catch blocks.
511 // Create three new blocks, the block to load the jmpbuf ptr and compare
  /external/strace/
quota.c 235 u_int64_t d_bcount; /* # disk blocks owned by the user */
238 int32_t d_btimer; /* similar to above; for disk blocks */
240 u_int16_t d_bwarns; /* # warnings issued wrt disk blocks */
244 u_int64_t d_rtbcount; /* # realtime blocks owned */
518 tprintf("blocks=%u, ", dq.dqi_blocks);
  /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];
  /frameworks/av/media/libeffects/lvm/lib/Bundle/src/
LVM_Buffers.c 35 /* the buffer management and the samples are grouped in to blocks of the correct size */
430 /* - Breaks the input sample stream in to blocks of the configured frame size or */
438 /* second and subsequent blocks. */
454 /* in each call so the size of the processing blocks can be controlled. The number of */
    [all...]
  /frameworks/base/services/tests/servicestests/src/com/android/server/
DropBoxTest.java 330 // Limit storage to 10 blocks
335 // Three tags using a total of 12 blocks:
337 // DropBoxTest1 [x][ ][ ][ ][xxx(20 blocks)xxx]
340 // The blocks marked "x" will be removed due to storage restrictions.
432 // Limit storage to 10 blocks with an expiration of 1 second
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/bin/
i686-linux-gcov 
  /prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.6/bin/
mipsel-linux-android-gcov 
  /prebuilts/gcc/linux-x86/x86/i686-linux-android-4.6/bin/
i686-linux-android-gcov 

Completed in 1463 milliseconds

<<71727374757677787980>>