HomeSort by: relevance | last modified time | path
    Searched defs:At (Results 1 - 15 of 15) sorted by relevancy

  /src/external/gpl3/gcc/dist/libsanitizer/tsan/
tsan_ignoreset.cpp 32 StackID IgnoreSet::At(uptr i) const {
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_ignoreset.cpp 32 StackID IgnoreSet::At(uptr i) const {
  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
tsan_ignoreset.cc 41 u32 IgnoreSet::At(uptr i) const {
  /src/external/apache2/llvm/dist/clang/lib/Format/
FormatTokenLexer.cpp 186 auto &At = *(Tokens.end() - 2);
188 if (!At->is(tok::at) || !String->is(tok::string_literal))
190 At->Tok.setKind(tok::string_literal);
191 At->TokenText = StringRef(At->TokenText.begin(),
192 String->TokenText.end() - At->TokenText.begin());
193 At->ColumnWidth += String->ColumnWidth;
194 At->setType(TT_ObjCStringLiteral);
281 auto &At = *(Tokens.end() - 2)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonVExtract.cpp 123 auto EmitAddr = [&] (MachineBasicBlock &BB, MachineBasicBlock::iterator At,
127 auto MIB = BuildMI(BB, At, dl, HII->get(FiOpc), AddrR);
145 // and AP may not be available at the location of the load/store.
150 MachineBasicBlock::iterator At = std::next(DefI->getIterator());
155 Register AddrR = EmitAddr(DefB, At, DefI->getDebugLoc(), FI, 0);
156 BuildMI(DefB, At, DefI->getDebugLoc(), HII->get(StoreOpc))
HexagonGenMux.cpp 107 MachineBasicBlock::iterator At;
115 : At(It), DefR(DR), PredR(PR), SrcT(TOp), SrcF(FOp), Def1(&D1),
296 // Check if the conversion to MUX is possible (either "up", i.e. at the
327 MachineBasicBlock::iterator At = CanDown ? Def2 : Def1;
328 ML.push_back(MuxInfo(At, DR, PR, SrcT, SrcF, Def1, Def2));
338 if (!MX.At->getParent() || !MX.Def1->getParent() || !MX.Def2->getParent())
341 MachineBasicBlock &B = *MX.At->getParent();
342 const DebugLoc &DL = B.findDebugLoc(MX.At);
343 auto NewMux = BuildMI(B, MX.At, DL, HII->get(MxOpc), MX.DefR)
HexagonEarlyIfConv.cpp 196 void predicateInstr(MachineBasicBlock *ToB, MachineBasicBlock::iterator At,
199 MachineBasicBlock::iterator At, MachineBasicBlock *FromB,
202 unsigned buildMux(MachineBasicBlock *B, MachineBasicBlock::iterator At,
240 LLVM_DEBUG(dbgs() << "Checking flow pattern at " << printMBBReference(*B)
322 // !TOk && FOk (at least one must be true by now).
429 // execute at run-time. If we convert this case, the "undef" will
459 // a MUX may be needed. Otherwise the PHI will need to be updated at
710 MachineBasicBlock::iterator At, MachineInstr *MI,
713 if (At != ToB->end())
714 DL = At->getDebugLoc()
    [all...]
HexagonExpandCondsets.cpp 77 // that is it actually live at the A2_tfrf, and so the now dead definition
78 // of %1 will need to be updated to non-dead at some point.
216 MachineBasicBlock::iterator At, unsigned DstR,
353 // Check if all subranges end at I->end. If so, make sure to kill
451 // needed at this point. Do not add SI to the extension points, since
466 // At the same time, add <dead> flag to all defs that are actually dead.
625 MachineBasicBlock::iterator At,
629 MachineBasicBlock &B = *At->getParent();
647 MIB = BuildMI(B, At, DL, HII->get(Opc))
652 MIB = BuildMI(B, At, DL, HII->get(Opc)
    [all...]
HexagonConstExtenders.cpp 192 MachineBasicBlock::iterator At;
195 : Block(B), At(It) {
1507 // at each instruction in Refs. Add an assertion just in case.
1530 MachineBasicBlock::iterator At = DefL.At;
1531 DebugLoc dl = DefL.Block->findDebugLoc(DefL.At);
1542 InitI = BuildMI(MBB, At, dl, HII->get(Hexagon::PS_fi), DefR)
1549 InitI = BuildMI(MBB, At, dl, HII->get(Hexagon::A2_tfrsi), DefR)
1554 InitI = BuildMI(MBB, At, dl, HII->get(Hexagon::A2_subri), DefR)
1559 InitI = BuildMI(MBB, At, dl, HII->get(Hexagon::A2_addi), DefR
    [all...]
HexagonConstPropagation.cpp 728 // Starting at a given branch, visit remaining branches in the block.
801 // tion will be visited at that time.
974 // computed during propagation) with these new vregs (which at this
1023 // Reset I to point at the just spliced PHI node.
2268 // We need to evaluate one branch at a time. TII::analyzeBranch checks
2269 // all the branches in a basic block at once, so we cannot use it.
2589 // Only create a zero/non-zero cell. At this time there isn't really
2876 MachineBasicBlock::iterator At = MI.getIterator();
2893 const MachineInstrBuilder &MIB = BuildMI(B, At, DL, *NewD, NewR);
2919 NewMI = BuildMI(B, At, DL, *NewD, NewR
    [all...]
HexagonFrameLowering.cpp 94 // alignment padding will be at the bottom of the stack (highest address),
95 // and so the offset with respect to the SP will be known at the compile-
101 // FP to access the local objects. At the same time, the variable-sized objects
112 // their name from being allocated at fixed locations on the stack, relative
126 // The AP is set up at the beginning of the function. Since it is not a dedi-
423 // Don't process functions that have loops, at least for now. Placement
1022 auto At = findCFILocation(B);
1023 if (At.hasValue())
1024 insertCFIInstructionsAt(B, At.getValue());
1029 MachineBasicBlock::iterator At) const
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/MC/
MCAsmMacro.h 54 Greater, GreaterEqual, GreaterGreater, At, MinusGreater,
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
StratifiedSets.h 74 /// containing variable B, then at some point, a variable that has interacted
162 /// that ended up in between %i and %ipp at the time of merging (in this case,
170 /// than doing this at each merge, we note in the BuilderLink structure that a
396 /// Adds the given element at the given index, merging sets if necessary.
414 /// Gets the BuilderLink at the given index, taking set remapping into
446 // CASE 1: If the set at `Idx1` is above or below `Idx2`, we need to merge
455 // CASE 2: The set at `Idx1` is not in the same chain as the set at `Idx2`.
460 /// Merges two sets assuming that the set at `Idx1` is unreachable from
461 /// traversing above or below the set at `Idx2`
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/
ASTDiagnostic.cpp 56 if (const AttributedType *AT = dyn_cast<AttributedType>(Ty)) {
57 QT = AT->desugar();
61 if (const AdjustedType *AT = dyn_cast<AdjustedType>(Ty)) {
62 QT = AT->desugar();
66 if (const AutoType *AT = dyn_cast<AutoType>(Ty)) {
67 if (!AT->isSugared())
69 QT = AT->desugar();
473 const Attr *At = reinterpret_cast<Attr *>(Val);
474 assert(At && "Received null Attr object!");
475 OS << '\'' << At->getSpelling() << '\''
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachinePipeliner.cpp 115 /// A command line option to enable SWP at -Os.
117 cl::desc("Enable SWP at Os."), cl::Hidden,
403 MachineBasicBlock::iterator At = PredB.getFirstTerminator();
404 const DebugLoc &DL = PredB.findDebugLoc(At);
405 auto Copy = BuildMI(PredB, At, DL, TII->get(TargetOpcode::COPY), NewReg)
994 // at each stage, and take the minimum value. We prioritize the
1122 // Attempt to reserve the instruction in an existing DFA. At least one
1274 /// Identify an elementary circuit in the dependence graph starting at the
1296 Node2Idx->at(W) < Node2Idx->at(V) ? true : HasBackedge)
    [all...]

Completed in 33 milliseconds