HomeSort by relevance Sort by last modified time
    Searched defs:Leaf (Results 1 - 11 of 11) sorted by null

  /external/llvm/unittests/IR/
PatternMatch.cpp 53 // Leaf = (Two + 8) + (Two + 13)
57 Value *Leaf = IRB.CreateAdd(IRB.CreateAdd(Two, IRB.getInt32(8)),
65 EXPECT_FALSE(m_OneUse(m_Value()).match(Leaf));
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_metaclass.py 23 from ..fixer_util import Name, syms, Node, Leaf
29 1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
30 2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
39 if isinstance(left_side, Leaf) and \
108 # look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ]
115 if isinstance(left_node, Leaf) and \
134 # find the first Leaf
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
164 text_type = node.children[0].type # always Leaf(nnn, 'class')
186 node.insert_child(2, Leaf(token.RPAR, u')')
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_metaclass.py 23 from ..fixer_util import Name, syms, Node, Leaf
29 1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
30 2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
39 if isinstance(left_side, Leaf) and \
108 # look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ]
115 if isinstance(left_node, Leaf) and \
134 # find the first Leaf
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
164 text_type = node.children[0].type # always Leaf(nnn, 'class')
186 node.insert_child(2, Leaf(token.RPAR, u')')
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/
pagemap.h 121 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
128 // Leaf node
129 struct Leaf {
133 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
170 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
171 if (leaf == NULL) return false;
172 memset(leaf, 0, sizeof(*leaf))
190 Leaf* leaf = root_[i1]; local
284 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
307 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 324 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
331 // Leaf node
332 struct Leaf {
336 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
374 if (leaf == NULL) return false;
375 memset(leaf, 0, sizeof(*leaf))
393 Leaf* leaf = root_[i1]; local
487 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
510 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/
fixer_util.py 8 from .pytree import Leaf, Node
19 [keyword, Leaf(token.EQUAL, u"="), value])
22 return Leaf(token.LPAR, u"(")
25 return Leaf(token.RPAR, u")")
36 target + [Leaf(token.EQUAL, u"=", prefix=u" ")] + source)
39 """Return a NAME leaf"""
40 return Leaf(token.NAME, name, prefix=prefix)
47 """A comma leaf"""
48 return Leaf(token.COMMA, u",")
51 """A period (.) leaf"""
    [all...]
pytree.py 35 Abstract base class for Node and Leaf.
114 Set the prefix for the node (see Leaf class).
124 Return the prefix for the node (see Leaf class).
158 while not isinstance(node, Leaf):
351 class Leaf(Base):
353 """Concrete implementation for leaf nodes."""
402 return Leaf(self.type, self.value,
431 Convert raw node information to a Node or Leaf instance.
445 return Leaf(type, value, context=context)
459 - LeafPattern matches a single leaf node
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/
fixer_util.py 8 from .pytree import Leaf, Node
19 [keyword, Leaf(token.EQUAL, u"="), value])
22 return Leaf(token.LPAR, u"(")
25 return Leaf(token.RPAR, u")")
36 target + [Leaf(token.EQUAL, u"=", prefix=u" ")] + source)
39 """Return a NAME leaf"""
40 return Leaf(token.NAME, name, prefix=prefix)
47 """A comma leaf"""
48 return Leaf(token.COMMA, u",")
51 """A period (.) leaf"""
    [all...]
pytree.py 35 Abstract base class for Node and Leaf.
114 Set the prefix for the node (see Leaf class).
124 Return the prefix for the node (see Leaf class).
158 while not isinstance(node, Leaf):
351 class Leaf(Base):
353 """Concrete implementation for leaf nodes."""
402 return Leaf(self.type, self.value,
431 Convert raw node information to a Node or Leaf instance.
445 return Leaf(type, value, context=context)
459 - LeafPattern matches a single leaf node
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_util.py 10 from lib2to3.pytree import Node, Leaf
94 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 2),
95 Leaf(token.NUMBER, 3)],
96 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 3),
97 Leaf(token.NUMBER, 2), Leaf(token.NUMBER, 4)],
98 [Leaf(token.STRING, "b"), Leaf(token.STRING, "j", prefix=" ")
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_util.py 10 from lib2to3.pytree import Node, Leaf
94 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 2),
95 Leaf(token.NUMBER, 3)],
96 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 3),
97 Leaf(token.NUMBER, 2), Leaf(token.NUMBER, 4)],
98 [Leaf(token.STRING, "b"), Leaf(token.STRING, "j", prefix=" ")
    [all...]

Completed in 180 milliseconds