Searched refs:back (Results 226 - 250 of 498) sorted by relevance

1234567891011>>

/freebsd-9.3-release/contrib/llvm/lib/Analysis/
H A DIVUsers.cpp236 return IVUses.back();
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DInterferenceCache.cpp90 RegUnits.back().Fixed = &LIS->getRegUnit(*Units);
H A DLexicalScopes.cpp220 LexicalScope *WS = WorkStack.back();
H A DLiveRangeCalc.cpp270 LiveIn.back().Kill = Kill;
H A DScheduleDAGInstrs.cpp68 // If we find a ptrtoint, we can transfer control back to the
341 // the block. Instead, we leave only one call at the back of the
1233 void advance() { ++DFSStack.back().second; }
1237 return DFSStack.empty() ? 0 : llvm::prior(DFSStack.back().second);
1240 const SUnit *getCurr() const { return DFSStack.back().first; }
1242 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }
H A DStackMaps.cpp146 LocationVec &Locations = CSInfos.back().Locations;
H A DLiveDebugVariables.cpp196 locations.back().clearParent();
198 if (locations.back().isReg())
199 locations.back().setIsUse();
/freebsd-9.3-release/contrib/llvm/lib/DebugInfo/
H A DDWARFUnit.cpp130 DWARFDebugInfoEntryMinimal *die_array_end = &DieArray.back();
H A DDWARFContext.cpp293 offset = CUs.back()->getNextUnitOffset();
314 offset = TUs.back()->getNextUnitOffset();
333 offset = DWOCUs.back()->getNextUnitOffset();
/freebsd-9.3-release/contrib/llvm/lib/MC/
H A DMCWin64EH.cpp197 MCWin64EHInstruction inst = info->Instructions.back();
H A DMCAsmStreamer.cpp292 assert(Comments.back() == '\n' &&
648 if (MAI->getAscizDirective() && Data.back() == 0) {
1350 if (!String.empty() && String.back() == '\n')
/freebsd-9.3-release/contrib/llvm/lib/Support/
H A DTimer.cpp158 if (ActiveTimers->back() == this) {
/freebsd-9.3-release/contrib/llvm/lib/Target/R600/
H A DSIAnnotateControlFlow.cpp152 return !Stack.empty() && Stack.back().first == BB;
260 /// \brief Handle a back edge (loop)
/freebsd-9.3-release/contrib/llvm/lib/Transforms/IPO/
H A DStripSymbols.cpp272 Constant *C = DeadConstants.back();
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp258 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Frontend/
H A DChainedIncludesSource.cpp163 std::string pchName = includes.back() + ".pch-final";
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaLambda.cpp195 ManglingContextDecl = ExprEvalContexts.back().ManglingContextDecl;
252 return &ExprEvalContexts.back().getMangleNumberingContext(Context);
1141 // as the call operator's we don't have to fix any back references that
1205 // the trailing return type and adjusting all back DeclRefExpr's to refer
1431 switch (ExprEvalContexts.back().Context) {
1450 ExprEvalContexts.back().Lambdas.push_back(Lambda);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DLLVMConventionsChecker.cpp275 os << " (type " << FieldChain.back()->getType().getAsString() << ")";
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp309 V = FreeNodes.back();
/freebsd-9.3-release/contrib/ncurses/form/
H A Dform.h87 chtype back; /* background attribute */ member in struct:fieldnode
/freebsd-9.3-release/contrib/tcsh/
H A Dsh.lex.c75 * If they push back a character then they must push it behind
1154 int back = 0; local
1186 back = 1;
1218 if (back)
1222 if (back) {
/freebsd-9.3-release/sys/sys/
H A Dconsio.h118 /* set the history (scroll back) buffer size (in lines) */
121 /* clear the history (scroll back) buffer */
246 char back; member in struct:colors
/freebsd-9.3-release/contrib/libstdc++/include/ext/
H A Dbitmap_allocator.h109 // begin(), end(), back(), operator[].
139 back() const throw() function in class:__detail::__mini_vector
602 if (*__addr >= *__free_list.back())
614 ::operator delete(static_cast<void*>(__free_list.back()));
683 * gives back all the memory to the OS.
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/
H A DDominators.h612 DomTreeNodeBase<NodeT> *Node = WorkStack.back().first;
614 WorkStack.back().second;
616 // If we visited all of the children of this node, "recurse" back up the
624 ++WorkStack.back().second;
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp150 /// 3 3 = "Flow" block, with back edge to entry block
154 /// The back edge of the "Flow" block is always on the false side of the branch
291 // Test for exit as back edge
297 // Test for sucessors as back edge
452 // Find the last back edges
646 Order.back()->getEntry();
754 dominatesPredicates(Entry, Order.back())) {
765 RegionNode *Node = Order.back();

Completed in 156 milliseconds

1234567891011>>