| /external/webkit/Source/JavaScriptCore/wtf/ |
| TCPageMap.h | 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
111 // Leaf node
112 struct Leaf {
116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
148 if (leaf == NULL) return false;
149 memset(leaf, 0, sizeof(*leaf))
259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 65 BasicBlock* newLeafBlock(CaseRange& Leaf, Value* Val,
157 // newLeafBlock - Create a new leaf block for the binary lookup tree. It
163 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val,
174 if (Leaf.Low == Leaf.High) {
177 Leaf.Low, "SwitchLeaf");
180 if (cast<ConstantInt>(Leaf.Low)->isMinValue(true /*isSigned*/)) {
182 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
184 } else if (cast<ConstantInt>(Leaf.Low)->isZero()) {
186 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| point_iterators.hpp | 55 Leaf, \
65 Leaf, \
75 Leaf, \
85 Leaf, \
95 class Leaf,
111 Leaf>::other::const_pointer
116 Leaf>::other::pointer
353 class Leaf,
370 Leaf>::other::const_pointer
375 Leaf>::other::pointe
[all...] |
| node_iterators.hpp | 54 Leaf, \
65 Leaf, \
75 class Leaf,
92 Leaf>::other::const_pointer
97 Leaf>::other::pointer
194 // the current leaf.
252 class Leaf,
305 // Access; returns the iterator* associated with the current leaf.
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 169 // Both leaf and branch nodes store vectors of pairs.
185 // 8 4 16 0 Leaf<4,4>, Branch<4>
186 // 8 8 12 0 Leaf<4,8>, Branch<8>
187 // 16 4 9 12 Leaf<8,4>
188 // 16 8 8 0 Leaf<8,8>
412 // Compute the leaf node branching factor that makes a node fit in three
426 // Now that we have the leaf branching factor, compute the actual allocation
435 /// Allocator - The recycling allocator used for both branch and leaf nodes.
458 // A NodeRef doesn't know whether it references a leaf node or a branch node.
522 // Leaf nodes store up to N disjoint intervals with corresponding values
[all...] |
| /external/clang/lib/Rewrite/Core/ |
| RewriteRope.cpp | 142 /// Pieces - This tracks the file chunks currently in this leaf.
146 /// NextLeaf - This is a pointer to the next leaf in the tree, allowing
160 /// clear - Remove all rope pieces from this leaf.
295 // For an insertion into a non-full leaf node, just insert the value in
305 // Otherwise, if this is leaf is full, split it in two halves. Since this
618 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
619 delete Leaf;
632 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
633 return Leaf->split(Offset);
646 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)
[all...] |
