reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/Support/Alignment.h
  103     return Constant<std::alignment_of<T>::value>();
include/llvm/Support/Allocator.h
   81   template <typename T> T *Allocate(size_t Num = 1) {
   82     return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
   82     return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
  470       for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T))
  470       for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T))
  478       char *Begin = (char *)alignAddr(*I, Align::Of<T>());
  488       DestroyElements((char *)alignAddr(Ptr, Align::Of<T>()),
  496   T *Allocate(size_t num = 1) { return Allocator.Allocate<T>(num); }
  496   T *Allocate(size_t num = 1) { return Allocator.Allocate<T>(num); }
lib/CodeGen/MachineOutliner.cpp
  125   DenseMap<unsigned, SuffixTreeNode *> Children;
  161   SuffixTreeNode *Link = nullptr;
  187   SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link)
  231   SpecificBumpPtrAllocator<SuffixTreeNode> NodeAllocator;
  237   SuffixTreeNode *Root = nullptr;
  255     SuffixTreeNode *Node;
  275   SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx,
  275   SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx,
  280     SuffixTreeNode *N = new (NodeAllocator.Allocate())
  281         SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr);
  295   SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx,
  295   SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx,
  303     SuffixTreeNode *N =
  304         new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root);
  317   void setSuffixIndices(SuffixTreeNode &CurrNode, unsigned CurrNodeLen) {
  350     SuffixTreeNode *NeedsLink = nullptr;
  379         SuffixTreeNode *NextNode = Active.Node->Children[FirstChar];
  426         SuffixTreeNode *SplitNode =
  496     SuffixTreeNode *N = nullptr;
  502     std::vector<SuffixTreeNode *> ToVisit;
  518       std::vector<SuffixTreeNode *> LeafChildren;
  522         SuffixTreeNode *Curr = ToVisit.back();
  554           for (SuffixTreeNode *Leaf : LeafChildren)
  587     RepeatedSubstringIterator(SuffixTreeNode *N) : N(N) {