/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | InstVisitor.h | 32 visit##CLASS_TO_VISIT(static_cast<CLASS_TO_VISIT&>(I)) 61 /// CAV.visit(function); 64 /// The defined has 'visit' methods for Instruction, and also for BasicBlock, 84 // use to visit instructions... 88 // Generic visit method - Allow visitation to all instructions in a range 90 void visit(Iterator Start, Iterator End) { function in class:llvm::InstVisitor 92 static_cast<SubClass*>(this)->visit(*Start++); 97 void visit(Module &M) { function in class:llvm::InstVisitor 99 visit(M.begin(), M.end()); 101 void visit(Functio function in class:llvm::InstVisitor 105 void visit(BasicBlock &BB) { function in class:llvm::InstVisitor 111 void visit(Module *M) { visit(*M); } function in class:llvm::InstVisitor 112 void visit(Function *F) { visit(*F); } function in class:llvm::InstVisitor 113 void visit(BasicBlock *BB) { visit(*BB); } function in class:llvm::InstVisitor 114 RetTy visit(Instruction *I) { return visit(*I); } function in class:llvm::InstVisitor 118 RetTy visit(Instruction &I) { function in class:llvm::InstVisitor [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | CommentVisitor.h | 27 return static_cast<ImplClass*>(this)->visit ## NAME(static_cast<PTR(CLASS)>(C)) 29 RetTy visit(PTR(Comment) C) { 48 RetTy visit ## CLASS(PTR(CLASS) C) { DISPATCH(PARENT, PARENT); }
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | InstCount.cpp | 45 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; } 82 visit(F);
|
H A D | InlineCost.cpp | 130 void visit(Module *); void visit(Module &); 131 void visit(Function *); void visit(Function &); 132 void visit(BasicBlock *); void visit(BasicBlock &); 134 // Provide base case for our instruction visit. 137 // Our visit overrides. 992 // all of the per-instruction logic. The visit tree returns true if we 995 if (Base::visit( [all...] |
H A D | CFLAliasAnalysis.cpp | 455 visit##OPCODE(*(CLASS *)CE); \ 708 return V.visit(Inst); 760 v.visit(Inst);
|
H A D | MemoryBuiltins.cpp | 405 return visit(*I); 640 Result = visit(*I);
|
/freebsd-11.0-release/contrib/dialog/samples/ |
H A D | buildlist2 | 36 --visit-items --scrollbar --separator "|" \
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpressions.h | 453 RetVal visit(const SCEV *S) { function in struct:llvm::SCEVVisitor 550 /// Use SCEVTraversal to visit all nodes in the given expression tree. 570 const SCEV *Operand = ((SC*)this)->visit(Expr->getOperand()); 575 const SCEV *Operand = ((SC*)this)->visit(Expr->getOperand()); 580 const SCEV *Operand = ((SC*)this)->visit(Expr->getOperand()); 587 Operands.push_back(((SC*)this)->visit(Expr->getOperand(i))); 594 Operands.push_back(((SC*)this)->visit(Expr->getOperand(i))); 599 return SE.getUDivExpr(((SC*)this)->visit(Expr->getLHS()), 600 ((SC*)this)->visit(Expr->getRHS())); 606 Operands.push_back(((SC*)this)->visit(Exp [all...] |
H A D | PtrUseVisitor.h | 44 /// \brief This class provides information about the result of a visit. 48 /// analysis and whether the visit completed or aborted early. 61 /// \brief Did we abort the visit early? 67 /// \brief Get the instruction causing the visit to abort. 77 /// \brief Mark the visit as aborted. Intended for use in a void return. 78 /// \param I The instruction which caused the visit to abort, if available. 91 /// \brief Mark the pointer as escaped, and the visit as aborted. Intended 94 /// visit, if available. 113 /// \brief A struct of the data needed to visit a particular use. 115 /// This is used to maintain a worklist fo to-visit use [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Index/ |
H A D | CommentToXML.cpp | 326 visit(*I); 348 visit(C->getParagraph()); 446 visit(Parts.Headerfile); 448 visit(Parts.Brief); 460 visit(C); 466 visit(Parts.TParams[i]); 473 visit(Parts.Params[i]); 480 visit(Parts.Returns[i]); 493 visit(*I); 705 visit(* [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | WorkList.h | 87 virtual bool visit(const WorkListUnit &U) = 0;
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAnnotateUniformValues.cpp | 76 visit(F);
|
H A D | SITypeRewriter.cpp | 68 visit(F); 69 visit(F);
|
H A D | R600TextureIntrinsicsReplacer.cpp | 249 visit(F);
|
H A D | AMDGPUPromoteAlloca.cpp | 99 visit(F);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyOptimizeReturned.cpp | 74 visit(F);
|
/freebsd-11.0-release/usr.bin/makewhatis/ |
H A D | makewhatis.c | 417 struct visited_dir *visit; local 424 SLIST_FOREACH(visit, &visited_dirs, next) { 425 if (visit->inode == st.st_ino && 426 visit->device == st.st_dev) { 431 visit = (struct visited_dir *) malloc(sizeof(struct visited_dir)); 432 visit->device = st.st_dev; 433 visit->inode = st.st_ino; 434 SLIST_INSERT_HEAD(&visited_dirs, visit, next);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Serialization/ |
H A D | ModuleManager.h | 79 /// \brief State used by the "visit" operation to avoid malloc traffic in 80 /// calls to visit(). 96 /// \brief The visit number of each module file, which indicates when 100 /// \brief The next visit number to use to mark visited module files. 103 /// \brief The next visit state. 107 /// \brief The first visit() state in the chain. 255 /// that we know we need to visit because the global module index told us to. 258 void visit(llvm::function_ref<bool(ModuleFile &M)> Visitor,
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 65 if (V.visit(*I)) 92 if (V.visit(*I)) 142 if (V.visit(*I)) 147 if (V.visit(*I))
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | IvarInvalidationChecker.cpp | 226 void visit(const ObjCImplementationDecl *D) const; 364 visit(const ObjCImplementationDecl *ImplD) const { function in class:__anon4171::IvarInvalidationCheckerImpl 738 Walker.visit(D);
|
/freebsd-11.0-release/usr.bin/dtc/ |
H A D | fdt.hh | 574 * Recursively visit this node and then its children. 576 void visit(std::function<void(node&)>); 706 * require one. This method will recursively visit the tree starting at
|
H A D | fdt.cc | 664 node::visit(std::function<void(node&)> fn) function in class:dtc::fdt::node 669 c->visit(fn); 1102 root->visit([&](node &n) {
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | predict.c | 1537 /* Number of predecessors we need to visit first. */ 1569 /* For each basic block we need to visit count number of his predecessors 1570 we need to visit first. */ 1583 bool visit = bitmap_bit_p (tovisit, e->src->index); 1585 if (visit && !(e->flags & EDGE_DFS_BACK)) 1587 else if (visit && dump_file && !EDGE_INFO (e)->back_edge) 1577 bool visit = bitmap_bit_p (tovisit, e->src->index); local
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Object/ |
H A D | RelocVisitor.h | 51 // visit. 52 RelocToApply visit(uint32_t RelocType, RelocationRef R, uint64_t Value = 0) { function in class:llvm::object::RelocVisitor
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 308 void ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor, function in class:ModuleManager 330 // Traverse the graph, making sure to visit a module before visiting any
|