HomeSort by relevance Sort by last modified time
    Searched defs:Start (Results 651 - 675 of 826) sorted by null

<<21222324252627282930>>

  /external/llvm/lib/CodeGen/
LiveIntervalAnalysis.cpp 606 // range. It is possible that KillMBB itself is reachable, so start a DFS
706 if (I == RURange.end() || I->start >= RI->end)
734 if (I == SR.end() || I->start >= RI->end)
765 if (N != LI.end() && N->start == RI->end)
787 SlotIndex Start = LI.beginIndex();
788 if (Start.isBlock())
797 MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
863 // Start with a binary search of RegMaskSlots to find a starting point.
865 std::lower_bound(Slots.begin(), Slots.end(), LiveI->start);
874 assert(*SlotI >= LiveI->start);
    [all...]
SplitKit.cpp 201 LIS.getMBBFromIndex(LVI->start)->getIterator();
205 SlotIndex Start, Stop;
206 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
221 assert(BI.FirstInstr >= Start);
228 BI.LiveIn = LVI->start <= Start;
232 assert(LVI->start == LVI->valno->def && "Dangling Segment start");
233 assert(LVI->start == BI.FirstInstr && "First instr should be a def");
241 if (++LVI == LVE || LVI->start >= Stop)
    [all...]
  /external/llvm/lib/MC/
MCDwarf.cpp 76 // This helper routine returns an expression of End - Start + IntVal .
79 const MCSymbol &Start,
86 MCSymbolRefExpr::create(&Start, Variant, MCOS.getContext());
254 // Set the value of the symbol, as we are at the start of the line table.
271 // Length of the prologue, is the next 4 bytes. Which is the start of the
347 // File numbers start with 1 and/or after any file numbers
600 // The 4 byte offset to the compile unit in the .debug_info from the start
647 // Create a symbol at the start and end of this section used in here for the
664 // The 4 byte offset to the debug abbrevs from the start of the .debug_abbrev,
665 // it is at the start of that section so this is zero
    [all...]
  /external/llvm/lib/Object/
COFFObjectFile.cpp     [all...]
  /external/llvm/lib/TableGen/
TGParser.cpp 151 if (AddValue(CurRec, SubClass.RefRange.Start, Val))
158 return Error(SubClass.RefRange.Start,
166 if (SetValue(CurRec, SubClass.RefRange.Start, TArgs[i],
177 return Error(SubClass.RefRange.Start,
189 return Error(SubClass.RefRange.Start,
195 return Error(SubClass.RefRange.Start,
211 if (AddValue(CurRec, SubMultiClass.RefRange.Start, SMCVal))
223 if (AddValue(NewDef.get(), SubMultiClass.RefRange.Start, MCVal))
234 return Error(SubMultiClass.RefRange.Start,
243 if (SetValue(CurRec, SubMultiClass.RefRange.Start, SMCTArgs[i]
    [all...]
  /external/llvm/lib/Target/Lanai/AsmParser/
LanaiAsmParser.cpp 567 static std::unique_ptr<LanaiOperand> CreateToken(StringRef Str, SMLoc Start) {
571 Op->StartLoc = Start;
572 Op->EndLoc = Start;
576 static std::unique_ptr<LanaiOperand> createReg(unsigned RegNum, SMLoc Start,
580 Op->StartLoc = Start;
586 SMLoc Start, SMLoc End) {
589 Op->StartLoc = Start;
672 SMLoc Start = Parser.getTok().getLoc();
684 return LanaiOperand::createReg(RegNum, Start, End);
698 SMLoc Start = Parser.getTok().getLoc()
    [all...]
  /external/llvm/lib/Target/NVPTX/
NVPTXISelDAGToDAG.cpp     [all...]
  /external/llvm/lib/Target/SystemZ/
SystemZISelDAGToDAG.cpp 106 // given by Opcode. The operands are: Input (R2), Start (I3), End (I4) and
121 Mask(allOnes(BitSize)), Input(N), Start(64 - BitSize), End(63),
128 unsigned Start;
549 // Start out assuming that the address will need to be loaded separately,
730 if (TII->isRxSBGMask(Mask, RxSBG.BitSize, RxSBG.Start, RxSBG.End)) {
    [all...]
SystemZInstrInfo.cpp 281 // Start from the bottom of the block and work up, examining the
843 unsigned Start, End;
844 if (isRxSBGMask(Imm, And.RegSize, Start, End)) {
853 Start &= 31;
864 .addImm(Start)
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 495 // If processing the memset invalidated our iterator, start over from the
598 // For stores that start but don't end a link in the chain:
729 // If we have a negative stride, Start refers to the end of the memory location
731 // which is just Start - BECount*Size.
732 static const SCEV *getStartForNegStride(const SCEV *Start, const SCEV *BECount,
739 return SE->getMinusSCEV(Start, Index);
769 const SCEV *Start = Ev->getStart();
772 Start = getStartForNegStride(Start, BECount, IntPtr, StoreSize, SE);
780 Expander.expandCodeFor(Start, DestInt8PtrTy, Preheader->getTerminator())
    [all...]
MemCpyOptimizer.cpp 135 // Start/End - A semi range that describes the span that this range covers.
136 // The range is closed at the start and open at the end: [Start, End).
137 int64_t Start, End;
139 /// StartPtr - The getelementptr instruction that points to the start of the
155 if (TheStores.size() >= 4 || End-Start >= 16) return true;
180 unsigned Bytes = unsigned(End-Start);
229 void addRange(int64_t Start, int64_t Size, Value *Ptr,
240 void MemsetRanges::addRange(int64_t Start, int64_t Size, Value *Ptr,
242 int64_t End = Start+Size
    [all...]
  /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter6/
toy.cpp 169 ExprAST *Start, *End, *Step, *Body;
171 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
173 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
342 ExprAST *Start = ParseExpression();
343 if (Start == 0) return 0;
345 return Error("expected ',' after for start value");
366 return new ForExprAST(IdName, Start, End, Step, Body);
668 // start = startexpr
671 // variable = phi [start, loopheader], [nextvariable, loopend
    [all...]
  /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter7/
toy.cpp 174 ExprAST *Start, *End, *Step, *Body;
176 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
178 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
360 ExprAST *Start = ParseExpression();
361 if (Start == 0) return 0;
363 return Error("expected ',' after for start value");
384 return new ForExprAST(IdName, Start, End, Step, Body);
765 // start = startexpr
766 // store start -> va
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Analysis/
ScalarEvolution.cpp     [all...]
ScalarEvolutionExpander.cpp 260 // In an AddRec, check if both start and step are divisible.
268 const SCEV *Start = A->getStart();
269 if (!FactorOutConstant(Start, Remainder, Factor, SE, TD))
272 S = SE.getAddRecExpr(Start, Step, A->getLoop(), SCEV::FlagAnyWrap);
307 /// SplitAddRecs - Flatten a list of add operands, moving addrec start values
319 const SCEV *Start = A->getStart();
320 if (Start->isZero()) break;
327 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Start)) {
332 Ops[i] = Start;
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/AsmPrinter/
DwarfCompileUnit.cpp 255 /// addComplexAddress - Start with the address based on the location provided,
309 The following function does just that. We start by getting
339 DW_OP_deref -- optional, if we start with a pointer
346 /// addBlockByrefAddress - Start with the address based on the location
392 // Decode the original location, and use that as the start of the byref
493 int Start = (LittleEndian ? 0 : NumBytes - 1);
497 for (; Start != Stop; Start += Incr)
499 (unsigned char)0xFF & FltPtr[Start]);
    [all...]
  /external/swiftshader/third_party/LLVM/lib/TableGen/
TGParser.cpp 469 int64_t Start = Lex.getCurIntVal();
472 if (Start < 0)
477 Ranges.push_back(Start);
495 if (Start < End) {
496 for (; Start <= End; ++Start)
497 Ranges.push_back(Start);
499 for (; Start >= End; --Start)
500 Ranges.push_back(Start);
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Target/X86/AsmParser/
X86AsmParser.cpp 141 X86Operand(KindTy K, SMLoc Start, SMLoc End)
142 : Kind(K), StartLoc(Start), EndLoc(End) {}
497 SMLoc Start, End;
498 if (ParseRegister(RegNo, Start, End)) return 0;
500 Error(Start, "%eiz and %riz can only be used as index registers");
504 // If this is a segment register followed by a ':', then this is the start
507 return X86Operand::CreateReg(RegNo, Start, End);
511 return ParseMemOperand(RegNo, Start);
515 SMLoc Start = Parser.getTok().getLoc(), End;
520 return X86Operand::CreateImm(Val, Start, End)
    [all...]
  /external/swiftshader/third_party/subzero/src/
WasmTranslator.cpp 274 Node Start(uint32_t Params) {
275 LOG(out << "Start(" << Params << ") = ");
    [all...]
  /external/v8/src/compiler/
common-operator.cc     [all...]
  /external/v8/src/
counters.h 246 // Start the timer.
247 void Start();
282 timer_->Start();
287 timer_->Start();
328 // Start/stop the "outer" scope.
329 void Start() { time_ = base::TimeDelta(); }
346 histogram_->Start();
360 timer_.Start();
518 inline void Start(RuntimeCallCounter* counter, RuntimeCallTimer* parent);
    [all...]
  /external/v8/src/heap/
incremental-marking.cc 244 Object** start, Object** end)) {
245 for (Object** p = start; p < end; p++) {
292 void VisitPointers(Object** start, Object** end) override {
293 for (Object** p = start; p < end; p++) MarkObjectByPointer(p);
395 // Only start incremental marking in a safe state: 1) when incremental
440 void IncrementalMarking::Start(GarbageCollectionReason gc_reason) {
447 "[IncrementalMarking] Start (%s): old generation %dMB, limit %dMB, "
480 "[IncrementalMarking] Start sweeping.\n");
495 incremental_marking_job()->Start(heap_);
501 // Black allocation currently starts when we start incremental marking
716 double start = heap_->MonotonicallyIncreasingTimeInMs(); local
889 double start = 0.0; local
1135 double start = heap_->MonotonicallyIncreasingTimeInMs(); local
    [all...]
  /external/valgrind/drd/tests/
tsan_thread_wrappers_pthread.h 354 void Start() { CHECK(0 == pthread_create(&t_, NULL, (worker_t)ThreadBody, this));}
503 //! Create n_threads threads, but do not start.
512 //! Start all threads.
515 workers_[i]->Start();
  /external/vboot_reference/utility/
eficompress.c 1514 UINT16 Start[18];
1516 Start[1] = 0;
1518 Start[i + 1] = (UINT16)((Start[i] + mLenCnt[i]) << 1);
1521 Code[i] = Start[Len[i]]++;
  /external/webrtc/webrtc/modules/video_coding/
jitter_buffer.cc 302 void VCMJitterBuffer::Start() {
318 // Start in a non-signaled state.
712 // Now it's time to start estimating jitter
946 // Don't set a high start rtt if high_rtt_nack_threshold_ms_ is used, to not
    [all...]

Completed in 1524 milliseconds

<<21222324252627282930>>