Searched refs:Leaf (Results 1 - 7 of 7) sorted by relevance

/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dpoint_iterators.hpp61 Leaf, \
71 Leaf, \
81 Leaf, \
91 Leaf, \
101 class Leaf,
117 Leaf>::other::const_pointer
122 Leaf>::other::pointer
359 class Leaf,
376 Leaf>::other::const_pointer
381 Leaf>
[all...]
H A Dnode_iterators.hpp60 Leaf, \
71 Leaf, \
81 class Leaf,
98 Leaf>::other::const_pointer
103 Leaf>::other::pointer
258 class Leaf,
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp87 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
301 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, argument
311 if (Leaf.Low == Leaf.High) {
314 Leaf.Low, "SwitchLeaf");
317 if (Leaf.Low->isMinValue(true /*isSigned*/)) {
319 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
321 } else if (Leaf.Low->isZero()) {
323 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High,
327 Constant* NegLo = ConstantExpr::getNeg(Leaf
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Rewrite/
H A DRewriteRope.cpp614 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
615 delete Leaf;
628 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
629 return Leaf->split(Offset);
642 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
643 return Leaf->insert(Offset, R);
651 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
652 return Leaf->erase(Offset, NumBytes);
731 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root)))
732 Leaf
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h206 // 8 4 16 0 Leaf<4,4>, Branch<4>
207 // 8 8 12 0 Leaf<4,8>, Branch<8>
208 // 16 4 9 12 Leaf<8,4>
209 // 16 8 8 0 Leaf<8,8>
543 // Leaf nodes store up to N disjoint intervals with corresponding values.
799 // Leaf accessors.
934 typedef IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits> Leaf;
1149 return NR.get<Leaf>().safeLookup(x, NotFound);
1160 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1;
1170 NewOffset = distribute(Nodes, rootSize, Leaf
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Lex/
H A DPPMacroExpansion.cpp134 auto Leaf = LeafModuleMacros.find(II); local
135 if (Leaf == LeafModuleMacros.end()) {
149 for (auto *LeafMM : Leaf->second) {
205 ArrayRef<ModuleMacro*> Leaf; local
208 Leaf = LeafIt->second;
236 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end());
/freebsd-11.0-release/contrib/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp2932 Record *Leaf) {
2933 if (OI.Rec == Leaf)
2938 if (Leaf->isSubClassOf("ValueType"))
2942 if (Leaf->isSubClassOf("ComplexPattern"))
2931 checkOperandClass(CGIOperandList::OperandInfo &OI, Record *Leaf) argument

Completed in 86 milliseconds