reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
53 PointerIntPair(PointerTy PtrVal, IntType IntVal) { 61 IntType getInt() const { return (IntType)Info::getInt(Value); } 67 void setInt(IntType IntVal) LLVM_LVALUE_FUNCTION { 75 void setPointerAndInt(PointerTy PtrVal, IntType IntVal) LLVM_LVALUE_FUNCTION {include/llvm/ADT/SmallVector.h
641 template <typename... ArgTypes> reference emplace_back(ArgTypes &&... Args) { 644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...);include/llvm/Analysis/LazyCallGraph.h
141 explicit Edge(Node &N, Kind K); 150 Kind getKind() const; 171 PointerIntPair<Node *, 1, Kind> Value; 173 void setKind(Kind K) { Value.setInt(K); } 301 void insertEdgeInternal(Node &ChildN, Edge::Kind EK); 304 void setEdgeKind(Node &ChildN, Edge::Kind EK); 761 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK); 1021 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK); 1024 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { 1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} 1218 inline LazyCallGraph::Edge::Kind LazyCallGraph::Edge::getKind() const {lib/Analysis/LazyCallGraph.cpp
43 Edge::Kind EK) { 48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { 64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { 945 Edge::Kind EK) { 1476 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {usr/include/c++/7.4.0/bits/move.h
72 constexpr _Tp&& 73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept 83 constexpr _Tp&& 84 forward(typename std::remove_reference<_Tp>::type&& __t) noexceptusr/include/c++/7.4.0/type_traits
1629 { typedef _Tp type; }; 1633 { typedef _Tp type; };