Searched refs:back (Results 476 - 500 of 965) sorted by relevance

<<11121314151617181920>>

/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/
H A DMCCodeView.cpp228 // back to 4 bytes.
296 FilteredLines.back().getFileNum() != IA.File ||
297 FilteredLines.back().getLine() != IA.Line ||
298 FilteredLines.back().getColumn() != IA.Col) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInferAddressSpaces.cpp65 // but proving %y2 specific circles back to %y. To address this complication,
470 Value *TopVal = PostorderStack.back().getPointer();
473 if (PostorderStack.back().getInt()) {
480 PostorderStack.back().setInt(true);
H A DLoopDistribute.cpp293 if (PartitionContainer.empty() || !PartitionContainer.back().hasDepCycle())
296 PartitionContainer.back().add(Inst);
303 // possible, then later we may merge them back together.
480 setNewLoopID(OrigLoopID, &PartitionContainer.back());
H A DStructurizeCFG.cpp228 /// 3 3 = "Flow" block, with back edge to entry block
232 /// The back edge of the "Flow" block is always on the false side of the branch
423 // Test for exit as back edge
429 // Test for successors as back edge
533 // Find the last back edges
734 Order.back()->getEntry();
838 dominatesPredicates(Entry, Order.back())) {
849 RegionNode *Node = Order.back();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp279 Allocas[AllocaIdx] = Allocas.back();
345 /// and thus must be phi-ed with undef. We fall back to the standard alloca
411 return false; // If not, we'll have to fall back for the remainder.
646 RenamePassData RPD = std::move(RenamePassWorkList.back());
795 LiveInBlockWorklist[i] = LiveInBlockWorklist.back();
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-ar/
H A Dllvm-ar.cpp199 Extract, ///< Extract files back to file system
277 object::Archive::create(ArchiveBuffers.back()->getMemBufferRef());
281 return *Archives.back();
538 // Implement the 'x' operation. This function extracts files back to the file
1051 if (!Rest.empty() && Rest.front() == '"' && Rest.back() == '"')
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DInstrInfoEmitter.cpp132 OperandList.back().Rec = OpR;
724 MinOperands = Inst.Operands.back().MIOperandNo +
725 Inst.Operands.back().MINumOperands;
H A DSearchableTableEmitter.cpp394 Field, IndexRows.back()->getValueInit(Field.Name));
585 Enum.EntryMap.insert(std::make_pair(EntryRec, Enum.Entries.back().get()));
688 if (!parseFieldType(Table->Fields.back(), TypeOfVal->getValue())) {
H A DFixedLenDecoderEmitter.cpp683 FixupList &CurScope = TableInfo.FixupStack.back();
730 TableInfo.FixupStack.back().push_back(PrevFilter);
1175 // data easily enough with a map back to the actual string. That's
1263 // data easily enough with a map back to the actual string. That's
1298 TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
1394 TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
1438 TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
1457 resolveTableFixups(TableInfo.Table, TableInfo.FixupStack.back(),
2515 resolveTableFixups(TableInfo.Table, TableInfo.FixupStack.back(),
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DStackSafetyAnalysis.cpp550 const CalleeTy *Callee = WorkList.back();
765 FunctionSummary::ParamAccess &Param = ParamAccesses.back();
955 // Reset data for all summaries. Alive and DSO local will be set back from
968 FunctionSummary::ParamAccess &New = NewParams.back();
H A DLazyValueInfo.cpp290 BasicBlock *ToUpdate = worklist.back();
480 std::pair<BasicBlock *, Value *> &e = StartingStack.back();
489 std::pair<BasicBlock *, Value *> e = BlockValueStack.back();
494 assert(BlockValueStack.back() == e && "Nothing should have been pushed!");
508 assert(BlockValueStack.back() != e && "Stack should have been pushed!");
554 // false and come back later.
824 // ValueTracking getting smarter looking back past our immediate inputs.)
1767 // predicate back along each incoming edge to see if we can prove it
H A DMemorySSA.cpp563 // first iteration in the loop below, or is set back to 0 if all def chains
683 // we've reached back to the OriginalAccess, do not save path, we've
684 // just looped back to self.
740 /// The paths that we can legally cache back from, but that aren't
748 assert(!Paths.empty() && NP >= &Paths.front() && NP <= &Paths.back() &&
824 // A. We can't reliably cache all of NewPaused back. Consider a case
827 // back, we'll end up with suboptimal cache entries. We can handle
831 // B. We can't reliably cache TerminatedPaths back here without doing
854 // the rest to be cached back.
1157 DomTreeNode *Node = WorkStack.back()
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DCodeViewDebug.cpp187 if (Dir.back() != '/')
610 // Switch back to the generic .debug$S section after potentially processing
1223 return !Loc.LoadChain.empty() && Loc.LoadChain.back() == 0;
1227 return Loc.LoadChain.size() == 2 && Loc.LoadChain.back() == 0;
1278 !Location->LoadChain.empty() ? Location->LoadChain.back() : 0;
1288 Var.DefRanges.back().isDifferentLocation(DR)) {
1307 Var.DefRanges.back().Ranges;
1308 if (!R.empty() && R.back().second == Begin)
1309 R.back().second = End;
1891 ReturnAndArgTypeIndices.back()
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.cpp349 Loops.back()->Entries.push_back(std::move(E));
384 return resolve(Loop.Entries, Substs, Final, &Dest->back().Loop->Entries,
1171 if (!InitList.back()) return nullptr;
1173 TypedInit *InitListBack = dyn_cast<TypedInit>(InitList.back());
1176 InitList.back()->getAsString() + "'"));
1280 RHS = (BinOpInit::get(Code, InitList.back(), RHS, Type))->Fold(CurRec);
1281 InitList.back() = RHS;
2340 if (!Result.back()) {
2363 if (!Result.back()) {
2856 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back());
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64CallLowering.cpp270 SplitArgs.back().Flags[0].setInConsecutiveRegs();
273 SplitArgs.back().Flags[0].setInConsecutiveRegsLast();
518 // Move back to the end of the basic block.
818 // register class. Until we can do that, we should fall back here.
960 OutArgs.back().Flags[0].setZExt();
975 // fall back to SelectionDAG and let it try to handle this.
1027 // Finally we can copy the returned value back into its virtual-register. In
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmParser.cpp239 return *Names.back();
266 auto Top = NestingStack.back();
278 nestingString(NestingStack.back()).first);
/freebsd-13-stable/sys/dev/syscons/
H A Dscterm-teken.c197 vi->mv_norm.back = (attr >> 4) & 0x0f;
198 vi->mv_rev.fore = vi->mv_norm.back;
199 vi->mv_rev.back = vi->mv_norm.fore;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/MCParser/
H A DAsmParser.cpp968 // FIXME: We would really like to refer back to where the symbol was
2397 bool HasVararg = NParameters ? Parameters.back().Vararg : false;
2657 bool HasVararg = NParameters ? M->Parameters.back().Vararg : false;
2814 jumpToLoc(ActiveMacros.back()->ExitLoc, ActiveMacros.back()->ExitBuffer);
2818 delete ActiveMacros.back();
4384 if (!Parameters.empty() && Parameters.back().Vararg)
4386 Parameters.back().Name +
4614 while (TheCondStack.size() != ActiveMacros.back()->CondStackDepth) {
4615 TheCondState = TheCondStack.back();
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/AsmParser/
H A DMipsAsmParser.cpp479 AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
487 AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
496 AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
1417 unsigned R1 = RegList.List->back();
2322 MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder();
2359 if (!AssemblerOptions.back()->isReorder())
2674 if (MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder())
3605 if (MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder())
5208 if (AssemblerOptions.back()->isReorder())
5245 if (AssemblerOptions.back()
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaLambda.cpp279 Decl *ManglingContextDecl = ExprEvalContexts.back().ManglingContextDecl;
1244 LambdaScopeInfo *LSI = cast<LambdaScopeInfo>(FunctionScopes.back());
1360 // as the call operator's we don't have to fix any back references that
1418 // the trailing return type and adjusting all back DeclRefExpr's to refer
1542 LambdaScopeInfo LSI = *cast<LambdaScopeInfo>(FunctionScopes.back());
1840 switch (ExprEvalContexts.back().Context) {
1860 ExprEvalContexts.back().Lambdas.push_back(Lambda);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp317 assert(Tokens.back().kind() == tok::eof);
409 if (Tokens.back().kind() == tok::semi)
430 assert(Tokens.back().kind() != tok::eof);
432 if (Tokens.back().kind() != tok::semi && Tokens.end()->kind() == tok::semi)
451 assert(A.tokenBuffer().expandedTokens().back().kind() == tok::eof);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1236 // once and deciding on the best order right away with no back-tracking.
1470 /// Points back to the VectorizableTree.
1474 /// Thus we need a reference back to the container to translate the indices
1655 TreeEntry *Last = VectorizableTree.back().get();
2253 /// value must be signed-extended, rather than zero-extended, back to its
2647 VectorizableTree.back()->setOperand(0, Op0);
2670 VectorizableTree.back()->setOperand(0, Op0);
2721 PtrN = PointerOps.back();
2724 PtrN = PointerOps[CurrentOrder.back()];
2983 PtrN = PointerOps.back();
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMLowOverheadLoops.cpp24 /// DLS, WLS, DLSTP or WLSTP and an instruction that loops back: LE or LETP.
165 Divergent = &Insts.back();
498 if (RDA.hasLocalDefBefore(&MBB->back(), NumElements))
533 if (auto *Def = RDA.getUniqueReachingMIDef(&MBB->back(), NumElements)) {
972 CurrentBlock = &VPTBlocks.back();
1101 // back to a normal loop. Also look for a vctp instructions and decide
1449 auto I = MachineBasicBlock::reverse_iterator(Insts.back().MI);
/freebsd-13-stable/contrib/llvm-project/lldb/source/Interpreter/
H A DCommandInterpreter.cpp2102 // broadcasting of the commands back to any appropriate listener (see
2153 /// If this file doesn't exist, we fall back to just the "~/.lldbinit" file.
2412 } else if (m_command_source_flags.back() &
2424 } else if (m_command_source_flags.back() & eHandleCommandFlagStopOnError) {
2436 } else if (m_command_source_flags.back() & eHandleCommandFlagStopOnCrash) {
2445 } else if (m_command_source_flags.back() & eHandleCommandFlagEchoCommand) {
2457 } else if (m_command_source_flags.back() &
2469 } else if (m_command_source_flags.back() & eHandleCommandFlagPrintResult) {
2480 } else if (m_command_source_flags.back() & eHandleCommandFlagPrintErrors) {
/freebsd-13-stable/contrib/llvm-project/clang/lib/Basic/
H A DSourceManager.cpp63 /// Returns the kind of memory used to back the memory buffer for
251 FilenameID = Entries.back().FilenameID;
253 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
258 IncludeOffset = Entries.empty() ? 0 : Entries.back().IncludeOffset;
262 assert(!Entries.empty() && Entries.back().IncludeOffset &&
268 FindNearestLineEntry(FID, Entries.back().IncludeOffset))
285 if (Entries.back().FileOffset <= Offset)
286 return &Entries.back();
841 // then we fall back to a less cache efficient, but more scalable, binary
873 // Convert "I" back int
[all...]

Completed in 330 milliseconds

<<11121314151617181920>>