HomeSort by relevance Sort by last modified time
    Searched refs:taken (Results 1 - 25 of 128) sorted by null

1 2 3 4 5 6

  /external/chromium_org/media/base/
audio_buffer_queue.cc 55 int taken = InternalRead(frames, true, 0, 0, NULL); local
56 DCHECK_EQ(taken, frames);
65 int taken = 0; local
70 while (taken < frames) {
91 int copied = std::min(frames - taken, remaining_frames_in_buffer);
96 copied, current_buffer_offset, dest_frame_offset + taken, dest);
101 taken += copied;
122 // Update the appropriate values since |taken| frames have been copied out.
123 frames_ -= taken;
134 return taken;
    [all...]
seekable_buffer.cc 113 int taken = InternalRead(NULL, size, true, 0); local
114 DCHECK_EQ(taken, size);
121 // Record the number of bytes taken.
122 int taken = 0; local
123 // Loop until we taken enough bytes and rewind by the desired |size|.
124 while (taken < size) {
134 int consumed = std::min(size - taken, current_buffer_offset_);
139 // Increase the amount of bytes taken in the backward direction. This
141 taken += consumed;
164 DCHECK_EQ(taken, size)
186 int taken = 0; local
    [all...]
  /external/openssl/crypto/perlasm/
ppc-xlate.pl 94 my $bo = $f=~/[\+\-]/ ? 16+9 : 16; # optional "to be taken" hint
99 my $bo = $f=~/\-/ ? 12+2 : 12; # optional "not to be taken" hint
106 my $bo = $f=~/\-/ ? 4+2 : 4; # optional "not to be taken" hint
113 my $bo = $f=~/-/ ? 12+2 : 12; # optional "not to be taken" hint
  /external/llvm/lib/Target/Hexagon/
HexagonNewValueJump.cpp 293 bool taken = false; local
299 taken = true;
303 return taken ? Hexagon::CMPEQrr_t_Jumpnv_t_V4
308 return taken ? Hexagon::CMPEQri_t_Jumpnv_t_V4
311 return taken ? Hexagon::CMPEQn1_t_Jumpnv_t_V4
317 return taken ? Hexagon::CMPLTrr_t_Jumpnv_t_V4
320 return taken ? Hexagon::CMPGTrr_t_Jumpnv_t_V4
326 return taken ? Hexagon::CMPGTri_t_Jumpnv_t_V4
329 return taken ? Hexagon::CMPGTn1_t_Jumpnv_t_V4
335 return taken ? Hexagon::CMPLTUrr_t_Jumpnv_t_V
    [all...]
  /external/chromium_org/third_party/boringssl/src/crypto/perlasm/
ppc-xlate.pl 99 my $bo = $f=~/[\+\-]/ ? 16+9 : 16; # optional "to be taken" hint
104 my $bo = $f=~/\-/ ? 12+2 : 12; # optional "not to be taken" hint
111 my $bo = $f=~/\-/ ? 4+2 : 4; # optional "not to be taken" hint
118 my $bo = $f=~/-/ ? 12+2 : 12; # optional "not to be taken" hint
  /external/chromium_org/v8/src/ia32/
debug-ia32.cc 129 bool taken = reg.code() == esi.code(); local
132 taken = true;
137 taken = true;
139 if (!taken) {
  /external/chromium_org/v8/src/x87/
debug-x87.cc 129 bool taken = reg.code() == esi.code(); local
132 taken = true;
137 taken = true;
139 if (!taken) {
  /external/chromium_org/third_party/lcov/bin/
lcov     [all...]
genhtml     [all...]
geninfo 1237 # BRDA:<line number>,<block number>,<branch number>,<taken>
1239 # where 'taken' is the number of times the branch was taken
1246 my ($line, $block, $branch, $taken) =
1249 print(INFO_HANDLE "BRDA:$line,$block,$branch,$taken\n");
1251 $br_hit++ if ($taken ne '-' && $taken > 0);
    [all...]
  /art/compiler/dex/
ssa_transformation.cc 44 res = NeedsVisit(GetBasicBlock(bb->taken));
217 if ((curr_bb->taken != NullBasicBlockId) && curr_bb->dominators->IsBitSet(curr_bb->taken)) {
241 if (bb->taken != NullBasicBlockId) {
242 CheckForDominanceFrontier(bb, GetBasicBlock(bb->taken));
466 BasicBlock* bb_taken = GetBasicBlock(bb->taken);
602 if (block->taken != NullBasicBlockId) {
603 DoDFSPreOrderSSARename(GetBasicBlock(block->taken));
mir_analysis.cc 889 if ((ending_bb->taken != NullBasicBlockId) && (ending_bb->fall_through == NullBasicBlockId)) {
890 if ((GetBasicBlock(ending_bb->taken)->taken == bb->id) ||
891 (GetBasicBlock(ending_bb->taken)->fall_through == bb->id)) {
896 if ((ending_bb->taken != NullBasicBlockId) && (ending_bb->taken == bb->id)) {
mir_optimization.cc 156 BasicBlock* bb_taken = GetBasicBlock(bb->taken);
413 if ((IsBackedge(bb, bb->taken) && GetBasicBlock(bb->taken)->dominates_return) ||
436 BasicBlock* ft_tk = GetBasicBlock(ft->taken);
438 BasicBlock* tk = GetBasicBlock(bb->taken);
441 BasicBlock* tk_tk = GetBasicBlock(tk->taken);
444 * In the select pattern, the taken edge goes to a block that unconditionally
452 * suspend check on the taken-taken branch back to the join point.
476 * of the merge as the target of the SELECT. Delete both taken an
    [all...]
mir_graph.cc 179 /* Handle the taken path */
180 bottom_block->taken = orig_block->taken;
181 if (bottom_block->taken != NullBasicBlockId) {
182 orig_block->taken = NullBasicBlockId;
183 BasicBlock* bb_taken = GetBasicBlock(bottom_block->taken);
433 cur_block->taken = taken_block->id;
588 cur_block->taken = eh_block->id;
764 DCHECK(cur_block->taken == NullBasicBlockId);
    [all...]
  /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/
xmlreport.py 122 total, taken = branch_stats[line]
125 "%d%% (%d/%d)" % (100*taken/total, taken, total)
  /external/oprofile/events/i386/atom/
unit_masks 74 0x01 pred_not_taken Retired branch instructions that were predicted not-taken
75 0x02 mispred_not_taken Retired branch instructions that were mispredicted not-taken
76 0x04 pred_taken Retired branch instructions that were predicted taken
77 0x08 mispred_taken Retired branch instructions that were mispredicted taken
79 0x0C taken Retired taken branch instructions
  /external/ltrace/
dict.c 27 unsigned char taken : 1; member in struct:status_bits
225 /* We skip over any taken or erased slots. But we remember
228 for (; bitp(dict, pos)->taken || bitp(dict, pos)->erased;
241 if (bitp(dict, pos)->taken
380 assert(!bitp(dict, slot_n)->taken);
391 bitp(dict, slot_n)->taken = 1;
430 bitp(dict, slot_n)->taken = 0;
455 if (bitp(dict, i)->taken && !bitp(dict, i)->erased) {
  /art/compiler/dex/quick/
mir_to_lir.cc 595 if (mir_graph_->IsBackedge(bb, bb->taken) &&
596 (kLeafOptimization || !mir_graph_->HasSuspendTestBetween(bb, bb->taken))) {
597 GenSuspendTestAndBranch(opt_flags, &label_list[bb->taken]);
599 OpUnconditionalBranch(&label_list[bb->taken]);
628 LIR* taken = &label_list[bb->taken]; local
634 BasicBlockId target_id = is_taken ? bb->taken : bb->fall_through;
642 (kLeafOptimization || !mir_graph_->HasSuspendTestBetween(bb, bb->taken) ||
646 GenCompareAndBranch(opcode, rl_src[0], rl_src[1], taken, fall_through);
657 LIR* taken = &label_list[bb->taken] local
    [all...]
  /external/chromium_org/chrome/tools/
webforms_aggregator.py 402 currently set to 30 URLs. These URLs are taken from the links lists, which
403 are from csl, gcl, sl, and gl. The rules define how many URLs are taken from
417 Since 30 URLs can be handled concurrently, the number of links taken from
420 than 24 links, e.g. there are only 21 links, then only 9 links may be taken
435 # links will be taken by the following priority: csl, cgl, sl, gl.
  /external/oprofile/events/mips/rm7000/
events 21 event:0x11 counters:0,1 um:zero minimum:500 name:BRANCHES_TAKEN : Branches taken
25 event:0x15 counters:0,1 um:zero minimum:500 name:DCACHE_MISS_STALL_CYCLES : Dcache miss stall cycles (cycles where both cache miss tokens taken and a third try is requested)
  /external/bison/doc/
bison.x 43 manual, which should be taken as authoritative.
  /external/chromium_org/remoting/webapp/
fullscreen_v1.js 84 // the time taken to animate presentation mode. Since I haven't been able
  /external/chromium_org/v8/test/mjsunit/harmony/
string-fromcodepoint.js 7 // Tests taken from:
  /external/chromium_org/v8/test/webkit/
dfg-branch-not-fail.js 25 "Check that short-circuiting Branch(LogicalNot(@a)) and then failing speculation does not result in the branch being taken the wrong way."
  /art/compiler/dex/quick/arm/
int_arm.cc 161 LIR* taken = &block_label_list_[bb->taken]; local
171 OpCondBranch(ccode, taken);
178 OpCmpImmBranch(kCondNe, high_reg, val_hi, (ccode == kCondEq) ? not_taken : taken);
181 OpCmpImmBranch(kCondLt, high_reg, val_hi, taken);
186 OpCmpImmBranch(kCondLt, high_reg, val_hi, taken);
191 OpCmpImmBranch(kCondGt, high_reg, val_hi, taken);
196 OpCmpImmBranch(kCondGt, high_reg, val_hi, taken);
203 OpCmpImmBranch(ccode, low_reg, val_lo, taken);
324 LIR* taken = &block_label_list_[bb->taken] local
    [all...]

Completed in 439 milliseconds

1 2 3 4 5 6