Searched refs:back (Results 76 - 100 of 498) sorted by relevance

1234567891011>>

/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DSlotIndexes.cpp77 SlotIndex blockStartIndex(&indexList.back(), SlotIndex::Slot_Block);
89 mi2iMap.insert(std::make_pair(mi, SlotIndex(&indexList.back(),
97 MBBRanges[mbb->getNumber()].second = SlotIndex(&indexList.back(),
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/
H A DDeclContextInternals.h235 } else if (!Vec.empty() && Vec.back()->hasTagIdentifierNamespace()) {
236 NamedDecl *TagD = Vec.back();
237 Vec.back() = D;
H A DASTVector.h131 reference back() { function in class:clang::ASTVector
134 const_reference back() const { function in class:clang::ASTVector
144 T Result = back();
233 new (this->end()) T(this->back());
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/Support/
H A DBumpVector.h114 reference back() { function in class:clang::BumpVector
117 const_reference back() const { function in class:clang::BumpVector
127 T Result = back();
236 // For now, leak 'Begin'. We can add it back to a freelist in
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/AST/
H A DRawCommentList.cpp221 !SourceMgr.isBeforeInTranslationUnit(Comments.back()->getLocStart(),
239 const RawComment &C1 = *Comments.back();
249 *Comments.back() = RawComment(SourceMgr, MergedRange, true,
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Lex/
H A DMacroArgs.cpp174 Token &Tok = Result.back();
176 } while (Result.back().isNot(tok::eof));
255 if (Result.back() == '\\') {
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_da_btree.c128 node->hdr.info.back = 0;
154 * Walk back up the tree splitting/inserting/adjusting as necessary.
300 node->hdr.info.back = cpu_to_be32(oldblk->blkno);
306 if (node->hdr.info.back) {
307 if (be32_to_cpu(node->hdr.info.back) == addblk->blkno) {
676 * Walk back up the tree joining/deallocating as necessary.
772 ASSERT(!oldroot->hdr.info.back);
799 ASSERT(!blkinfo->back);
873 forward = (be32_to_cpu(info->forw) < be32_to_cpu(info->back));
878 blkno = be32_to_cpu(info->back);
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Format/
H A DUnwrappedLineParser.cpp46 Line.MustBeDeclaration = Stack.back();
130 Parser.CurrentLines = &Parser.Line->Tokens.back().Children;
228 PPLevelBranchIndex.back() + 1 >= PPLevelBranchCount.back()) {
233 ++PPLevelBranchIndex.back();
235 assert(PPLevelBranchIndex.back() <= PPLevelBranchCount.back());
316 if (LBraceStack.back()->BlockKind == BK_Unknown) {
330 LBraceStack.back()->BlockKind = BK_BracedInit;
333 LBraceStack.back()
[all...]
H A DTokenAnnotator.h65 Current->Children.push_back(Children.back());
/freebsd-9.3-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64BranchFixupPass.cpp273 // Now go back through the instructions and build up our data structures.
526 MachineInstr *BMI = &MBB->back();
556 int delta = TII->getInstSizeInBytes(MBB->back());
558 MBB->back().eraseFromParent();
592 BBInfo[MBB->getNumber()].Size += TII->getInstSizeInBytes(MBB->back());
596 ImmBranches.push_back(ImmBranch(&MBB->back(), OffsetBits, false));
/freebsd-9.3-release/contrib/llvm/lib/MC/
H A DMCObjectDisassembler.cpp252 const MCDecodedInst &LI = TA->back();
408 if ((MIA.isConditionalBranch(TA->back().Inst) ||
409 !MIA.isTerminator(TA->back().Inst)) &&
416 if (MIA.isBranch(TA->back().Inst)) {
418 if (MIA.evaluateBranch(TA->back().Inst, TA->back().Address,
419 TA->back().Size, BranchTarget)) {
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/Interpreter/
H A DExecution.cpp277 ExecutionContext &SF = ECStack.back();
609 ExecutionContext &SF = ECStack.back();
680 ExecutionContext &SF = ECStack.back();
805 ExecutionContext &SF = ECStack.back();
828 /// back into the result variable if we are not returning void. The
849 ExecutionContext &CallingSF = ECStack.back();
862 ExecutionContext &SF = ECStack.back();
880 ExecutionContext &SF = ECStack.back();
893 ExecutionContext &SF = ECStack.back();
912 ExecutionContext &SF = ECStack.back();
[all...]
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h178 /// calls to the heuristic (which will call back to the reduction rules in
373 g.setEdgeData(yzeId, &edgeDataList.back());
420 g.setNodeData(*nItr, &nodeDataList.back());
427 g.setEdgeData(*eItr, &edgeDataList.back());
474 g.removeEdge(edgesToRemove.back());
491 if (tryToEliminateEdge(edgesToProcess.back()))
554 computeSolution(stack.back());
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Frontend/
H A DCacheTokens.cpp272 // This speed up reading them back in.
375 assert(PPCond.size() > PPStartCond.back());
376 assert(PPCond[PPStartCond.back()].second == 0);
377 PPCond[PPStartCond.back()].second = index;
400 assert(PPCond.size() > PPStartCond.back());
401 assert(PPCond[PPStartCond.back()].second == 0);
402 PPCond[PPStartCond.back()].second = index;
429 // we read the PTH file back in.
/freebsd-9.3-release/usr.bin/sed/
H A Dprocess.c448 SS.space = SS.back;
517 YS.space = YS.back;
681 if ((sp->space = sp->back = realloc(sp->back, sp->blen)) \
727 if ((sp->space = sp->back = realloc(sp->back, sp->blen)) ==
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/
H A DImmutableSet.h467 T = freeNodes.back();
666 return reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
671 return stack.back() & Flags;
688 stack.back() |= VisitedLeft;
691 stack.back() |= VisitedRight;
711 TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
718 stack.back() |= VisitedLeft;
724 stack.back() |= VisitedRight;
737 TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
744 stack.back()
[all...]
H A DSmallSet.h73 Set.insert(Vector.back());
H A DArrayRef.h117 /// back - Get the last element.
118 const T &back() const { function in class:llvm::ArrayRef
233 /// back - Get the last element.
234 T &back() const { function in class:llvm::ArrayRef
/freebsd-9.3-release/contrib/llvm/lib/Bitcode/Reader/
H A DBitstreamReader.cpp61 BlockScope.back().PrevAbbrevs.swap(CurAbbrevs);
68 CurAbbrevs.back()->addRef();
342 BitCodeAbbrev *Abbv = CurAbbrevs.back();
/freebsd-9.3-release/contrib/llvm/lib/DebugInfo/
H A DDWARFDebugFrame.cpp85 Instructions.back().Ops.push_back(Operand1);
90 Instructions.back().Ops.push_back(Operand1);
91 Instructions.back().Ops.push_back(Operand2);
H A DDWARFDebugLoc.cpp41 LocationList &Loc = Locations.back();
/freebsd-9.3-release/contrib/binutils/bfd/
H A Delfcode.h603 const struct elf_backend_data *back;
607 back = (const struct elf_backend_data *) (*target_ptr)->backend_data;
608 if (back->elf_machine_code == i_ehdrp->e_machine
609 || (back->elf_machine_alt1 != 0
610 && back->elf_machine_alt1 == i_ehdrp->e_machine)
611 || (back->elf_machine_alt2 != 0
612 && back->elf_machine_alt2 == i_ehdrp->e_machine))
649 const struct elf_backend_data *back;
660 back = (const struct elf_backend_data *) (*target_ptr)->backend_data;
661 if (back
601 const struct elf_backend_data *back; local
647 const struct elf_backend_data *back; local
[all...]
/freebsd-9.3-release/lib/libz/
H A Dinflate.c33 * - Remove bit fields--back to byte structure for speed
53 * source file infback.c to provide a call-back interface to inflate for
124 state->back = -1;
1027 state->back = -1;
1030 state->back = 0;
1045 state->back += last.bits;
1048 state->back += here.bits;
1059 state->back = -1;
1075 state->back += state->extra;
1095 state->back
[all...]
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/
H A DCallGraph.h246 CalledFunctions.back().second->DropRef();
272 *I = CalledFunctions.back();
/freebsd-9.3-release/contrib/llvm/lib/IR/
H A DBasicBlock.cpp122 return dyn_cast<TerminatorInst>(&InstList.back());
127 return dyn_cast<TerminatorInst>(&InstList.back());

Completed in 301 milliseconds

1234567891011>>