Searched defs:move (Results 1 - 25 of 142) sorted by last modified time

123456

/external/webp/src/dsp/
H A Dlossless_enc_sse2.c449 const uint32_t move = _mm_movemask_epi8(shift); local
450 dst[0] = 0xff000000 | ((move & 0xff) << 8);
451 dst[1] = 0xff000000 | (move & 0xff00);
/external/v8/testing/gtest/src/
H A Dgtest.cc1076 EditType move = best_move[l_i][r_i]; local
1077 best_path.push_back(move);
1078 l_i -= move != kAdd;
1079 r_i -= move != kRemove;
2308 << "want to change the TEST to TEST_F or move it to another test\n"
/external/valgrind/VEX/priv/
H A Dhost_s390_defs.h125 S390_INSN_COND_MOVE, /* conditonal "move" to register */
395 } move; member in union:__anon24156::__anon24157
/external/v8/src/compiler/
H A Dcode-generator.cc348 for (auto move : *parallel_move) {
349 InstructionOperand source = move->source();
350 InstructionOperand destination = move->destination();
355 // pushes don't participate in the parallel move and might clobber
377 (*pushes)[index] = move;
388 for (auto move : base::Reversed(*pushes)) {
389 if (move == nullptr) break;
527 ParallelMove* move = instr->GetParallelMove(inner_pos); local
528 if (move != nullptr) resolver()->Resolve(move);
[all...]
H A Dgap-resolver.cc22 inline bool Blocks(MoveOperands* move, InstructionOperand destination) { argument
23 return !move->IsEliminated() && move->source().InterferesWith(destination);
26 // Splits a FP move between two location operands into the equivalent series of
27 // moves between smaller sub-operands, e.g. a double move to two single moves.
30 MoveOperands* Split(MoveOperands* move, MachineRepresentation smaller_rep, argument
35 const LocationOperand& src_loc = LocationOperand::cast(move->source());
36 const LocationOperand& dst_loc = LocationOperand::cast(move->destination());
70 // Reuse 'move' for the first fragment. It is not pending.
71 move
91 MoveOperands* move = (*moves)[i]; local
111 auto move = (*moves)[i]; local
119 auto move = (*moves)[i]; local
129 auto move = (*moves)[i]; local
134 PerformMove(ParallelMove* moves, MoveOperands* move) argument
[all...]
H A Dinstruction.cc89 // the gap resolver may break a move into 2 or 4 equivalent smaller moves.
268 for (MoveOperands* move : *this) {
269 if (!move->IsRedundant()) return false;
275 MoveOperands* move, ZoneVector<MoveOperands*>* to_eliminate) const {
277 kSimpleFPAliasing || !move->destination().IsFPLocationOperand();
282 if (curr->destination().EqualsCanonicalized(move->source())) {
283 // We must replace move's source with curr's destination in order to
288 } else if (curr->destination().InterferesWith(move->destination())) {
289 // We can eliminate curr, since move overwrites at least a part of its
296 if (replacement != nullptr) move
274 PrepareInsertAfter( MoveOperands* move, ZoneVector<MoveOperands*>* to_eliminate) const argument
[all...]
H A Dinstruction.h698 // A move is redundant if it's been eliminated or if its source and
705 // We clear both operands to indicate move that's been eliminated.
749 MoveOperands* move = new (operand_allocation_zone) MoveOperands(from, to); local
750 push_back(move);
751 return move;
756 // Prepare this ParallelMove to insert move as if it happened in a subsequent
757 // ParallelMove. move->source() may be changed. Any MoveOperands added to
759 void PrepareInsertAfter(MoveOperands* move,
H A Dregister-allocator.cc598 // If we split, we do so because we're about to switch registers or move
875 ParallelMove* move = local
877 // Skip insertion if it's possible that the move exists already as a
878 // constraint move from a fixed output register to a slot.
881 for (MoveOperands* move_op : *move) {
893 move->AddMove(*to_spill->operand, op);
1305 // Append the 'current' node to the result accumulator and move forward
1503 // will be transferred via a move in the Gap::END's of the last instruction
1679 // and insert a gap move from the fixed output to the operand.
1741 // Make sure we add a gap move fo
1822 MoveOperands* move = data()->AddGapMove( local
2173 ParallelMove* move = instr->GetParallelMove(position); local
3900 ParallelMove* move = local
3935 MoveOperands* move = local
[all...]
/external/v8/src/crankshaft/arm/
H A Dlithium-codegen-arm.cc934 void LCodeGen::DoParallelMove(LParallelMove* move) { argument
935 resolver_.Resolve(move);
944 LParallelMove* move = gap->GetParallelMove(inner_pos); local
945 if (move != NULL) DoParallelMove(move);
5187 // Nothing to see here, move on!
5192 // Nothing to see here, move on!
H A Dlithium-gap-resolver-arm.cc12 // moves. We don't need access to roots while resolving the move list and using
35 LMoveOperands move = moves_[i]; local
39 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
40 root_index_ = i; // Any cycle is found when by reaching this move again.
68 // moves to perform, ignoring any move that is redundant (the source is
70 // unallocated, or the move was already eliminated).
73 LMoveOperands move = moves->at(i); local
74 if (!move.IsRedundant()) moves_.Add(move, cgen
[all...]
/external/v8/src/crankshaft/arm64/
H A Dlithium-codegen-arm64.cc1308 LParallelMove* move = gap->GetParallelMove(inner_pos); local
1309 if (move != NULL) {
1310 resolver_.Resolve(move);
2650 // Nothing to see here, move on!
2655 // Nothing to see here, move on!
H A Dlithium-gap-resolver-arm64.cc40 LMoveOperands move = moves_[i]; local
45 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
46 root_index_ = i; // Any cycle is found when we reach this move again.
54 LMoveOperands move = moves_[i]; local
56 if (!move.IsEliminated()) {
57 DCHECK(move.source()->IsConstantOperand());
70 // moves to perform, ignoring any move that is redundant (the source is
72 // unallocated, or the move was already eliminated).
75 LMoveOperands move local
[all...]
/external/v8/src/crankshaft/ia32/
H A Dlithium-codegen-ia32.cc835 void LCodeGen::DoParallelMove(LParallelMove* move) { argument
836 resolver_.Resolve(move);
845 LParallelMove* move = gap->GetParallelMove(inner_pos); local
846 if (move != NULL) DoParallelMove(move);
4954 // Nothing to see here, move on!
4959 // Nothing to see here, move on!
H A Dlithium-gap-resolver-ia32.cc28 LMoveOperands move = moves_[i]; local
32 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
52 // moves to perform, ignoring any move that is redundant (the source is
54 // unallocated, or the move was already eliminated).
57 LMoveOperands move = moves->at(i); local
58 if (!move.IsRedundant()) AddMove(move);
65 // Each call to this function performs a move and deletes it from the move
129 AddMove(LMoveOperands move) argument
[all...]
/external/v8/src/crankshaft/
H A Dlithium-allocator.cc734 LParallelMove* move = gap->GetOrCreateParallelMove(LGap::START, local
737 const ZoneList<LMoveOperands>* move_operands = move->move_operands();
744 move->AddMove(cur.source(), to, chunk()->zone());
750 move->AddMove(from, to, chunk()->zone());
807 // This move to spill operand is not a real use. Liveness analysis
812 LParallelMove* move = gap->GetOrCreateParallelMove(LGap::BEFORE, local
814 move->AddMove(first_output, range->GetSpillOperand(),
898 LParallelMove* move = gap->GetOrCreateParallelMove(LGap::START, local
900 const ZoneList<LMoveOperands>* move_operands = move->move_operands();
909 // This is a phi resolving move
1217 LParallelMove* move = GetConnectingParallelMove(pos); local
1288 LParallelMove* move = gap->GetOrCreateParallelMove(LGap::START, local
[all...]
/external/v8/src/crankshaft/mips/
H A Dlithium-codegen-mips.cc919 void LCodeGen::DoParallelMove(LParallelMove* move) { argument
920 resolver_.Resolve(move);
929 LParallelMove* move = gap->GetParallelMove(inner_pos); local
930 if (move != NULL) DoParallelMove(move);
5219 // Nothing to see here, move on!
5224 // Nothing to see here, move on!
H A Dlithium-gap-resolver-mips.cc26 LMoveOperands move = moves_[i]; local
30 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
31 root_index_ = i; // Any cycle is found when by reaching this move again.
53 // moves to perform, ignoring any move that is redundant (the source is
55 // unallocated, or the move was already eliminated).
58 LMoveOperands move = moves->at(i); local
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
66 // Each call to this function performs a move an
[all...]
/external/v8/src/crankshaft/mips64/
H A Dlithium-codegen-mips64.cc908 void LCodeGen::DoParallelMove(LParallelMove* move) { argument
909 resolver_.Resolve(move);
918 LParallelMove* move = gap->GetParallelMove(inner_pos); local
919 if (move != NULL) DoParallelMove(move);
5412 // Nothing to see here, move on!
5417 // Nothing to see here, move on!
H A Dlithium-gap-resolver-mips64.cc26 LMoveOperands move = moves_[i]; local
30 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
31 root_index_ = i; // Any cycle is found when by reaching this move again.
53 // moves to perform, ignoring any move that is redundant (the source is
55 // unallocated, or the move was already eliminated).
58 LMoveOperands move = moves->at(i); local
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
66 // Each call to this function performs a move an
[all...]
/external/v8/src/crankshaft/ppc/
H A Dlithium-codegen-ppc.cc874 void LCodeGen::DoParallelMove(LParallelMove* move) { resolver_.Resolve(move); } argument
881 LParallelMove* move = gap->GetParallelMove(inner_pos); local
882 if (move != NULL) DoParallelMove(move);
5490 // Nothing to see here, move on!
5495 // Nothing to see here, move on!
H A Dlithium-gap-resolver-ppc.cc28 LMoveOperands move = moves_[i]; local
32 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
33 root_index_ = i; // Any cycle is found when by reaching this move again.
55 // moves to perform, ignoring any move that is redundant (the source is
57 // unallocated, or the move was already eliminated).
60 LMoveOperands move = moves->at(i); local
61 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
68 // Each call to this function performs a move an
[all...]
/external/v8/src/crankshaft/s390/
H A Dlithium-codegen-s390.cc859 void LCodeGen::DoParallelMove(LParallelMove* move) { resolver_.Resolve(move); } argument
865 LParallelMove* move = gap->GetParallelMove(inner_pos); local
866 if (move != NULL) DoParallelMove(move);
5428 // Nothing to see here, move on!
5432 // Nothing to see here, move on!
H A Dlithium-gap-resolver-s390.cc27 LMoveOperands move = moves_[i]; local
31 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
32 root_index_ = i; // Any cycle is found when by reaching this move again.
53 // moves to perform, ignoring any move that is redundant (the source is
55 // unallocated, or the move was already eliminated).
58 LMoveOperands move = moves->at(i); local
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
65 // Each call to this function performs a move an
[all...]
/external/v8/src/crankshaft/x64/
H A Dlithium-codegen-x64.cc864 void LCodeGen::DoParallelMove(LParallelMove* move) { argument
865 resolver_.Resolve(move);
874 LParallelMove* move = gap->GetParallelMove(inner_pos); local
875 if (move != NULL) DoParallelMove(move);
5239 // Nothing to see here, move on!
5244 // Nothing to see here, move on!
H A Dlithium-gap-resolver-x64.cc25 LMoveOperands move = moves_[i]; local
29 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
48 // moves to perform, ignoring any move that is redundant (the source is
50 // unallocated, or the move was already eliminated).
53 LMoveOperands move = moves->at(i); local
54 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
61 // Each call to this function performs a move and deletes it from the move
[all...]

Completed in 514 milliseconds

123456