Searched defs:Leaf (Results 1 - 5 of 5) sorted by relevance

/external/llvm/unittests/IR/
H A DPatternMatch.cpp53 // Leaf = (Two + 8) + (Two + 13)
57 Value *Leaf = IRB.CreateAdd(IRB.CreateAdd(Two, IRB.getInt32(8)), local
65 EXPECT_FALSE(m_OneUse(m_Value()).match(Leaf));
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dpagemap.h128 // Leaf node
129 struct Leaf { struct in class:TCMalloc_PageMap2
133 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
170 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
190 Leaf* leaf = root_[i1];
223 // Leaf node
224 struct Leaf { struct in class:TCMalloc_PageMap3
255 return reinterpret_cast<Leaf*>(root
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dpagemap.h331 // Leaf node
332 struct Leaf { struct in class:TCMalloc_PageMap2
336 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf)));
393 Leaf* leaf = root_[i1];
426 // Leaf node
427 struct Leaf { struct in class:TCMalloc_PageMap3
458 return reinterpret_cast<Leaf*>(root
[all...]
/external/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp72 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
228 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, argument
239 if (Leaf.Low == Leaf.High) {
242 Leaf.Low, "SwitchLeaf");
245 if (cast<ConstantInt>(Leaf.Low)->isMinValue(true /*isSigned*/)) {
247 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
249 } else if (cast<ConstantInt>(Leaf.Low)->isZero()) {
251 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High,
255 Constant* NegLo = ConstantExpr::getNeg(Leaf
[all...]
/external/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp2748 Record *Leaf) {
2749 if (OI.Rec == Leaf)
2754 if (Leaf->isSubClassOf("ValueType"))
2758 if (Leaf->isSubClassOf("ComplexPattern"))
2747 checkOperandClass(CGIOperandList::OperandInfo &OI, Record *Leaf) argument

Completed in 262 milliseconds