| /external/cpu_features/test/ |
| D | cpuinfo_x86_test.cc | 28 Leaf CpuIdEx(uint32_t leaf_id, int ecx) const { in CpuIdEx()
38 void SetLeaves(std::map<std::pair<uint32_t, int>, Leaf> configuration) { in SetLeaves()
47 std::map<std::pair<uint32_t, int>, Leaf> cpuid_leaves_;
53 extern "C" Leaf CpuIdEx(uint32_t leaf_id, int ecx) { in CpuIdEx()
64 {{0x00000000, 0}, Leaf{0x0000000D, 0x756E6547, 0x6C65746E, 0x49656E69}}, in TEST()
65 {{0x00000001, 0}, Leaf{0x000206A6, 0x00100800, 0x1F9AE3BF, 0xBFEBFBFF}}, in TEST()
66 {{0x00000007, 0}, Leaf{0x00000000, 0x00000000, 0x00000000, 0x00000000}}, in TEST()
109 {{0x00000000, 0}, Leaf{0x0000000D, 0x756E6547, 0x6C65746E, 0x49656E69}}, in TEST()
110 {{0x00000001, 0}, Leaf{0x000206A6, 0x00100800, 0x1F9AE3BF, 0xBFEBFBFF}}, in TEST()
111 {{0x00000007, 0}, Leaf{0x00000000, 0x00000000, 0x00000000, 0x00000000}}, in TEST()
[all …]
|
| /external/python/cpython3/Lib/lib2to3/tests/ |
| D | test_pytree.py | 35 l1 = pytree.Leaf(100, "foo")
40 l1 = pytree.Leaf(100, "foo")
44 l1 = pytree.Leaf(100, "foo")
46 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
52 l1 = pytree.Leaf(2, 5)
57 l1 = pytree.Leaf(100, "foo")
58 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
60 l3 = pytree.Leaf(101, "foo")
61 l4 = pytree.Leaf(100, "bar")
66 l1 = pytree.Leaf(100, "foo")
[all …]
|
| /external/python/cpython2/Lib/lib2to3/tests/ |
| D | test_pytree.py | 37 l = pytree.Leaf(100, "foo")
57 l1 = pytree.Leaf(100, "foo")
62 l1 = pytree.Leaf(100, "foo")
66 l1 = pytree.Leaf(100, "foo")
68 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
74 l1 = pytree.Leaf(2, 5)
79 l1 = pytree.Leaf(100, "foo")
80 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
82 l3 = pytree.Leaf(101, "foo")
83 l4 = pytree.Leaf(100, "bar")
[all …]
|
| /external/selinux/python/sepolgen/src/sepolgen/ |
| D | refpolicy.py | 154 class Leaf(PolicyBase): class
265 class SecurityContext(Leaf):
274 Leaf.__init__(self, parent)
345 class ObjectClass(Leaf):
354 Leaf.__init__(self, parent)
419 class TypeAttribute(Leaf):
425 Leaf.__init__(self, parent)
432 class RoleAttribute(Leaf):
438 Leaf.__init__(self, parent)
446 class Role(Leaf):
[all …]
|
| /external/python/cpython2/Lib/lib2to3/ |
| D | 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)
40 return Leaf(token.NAME, name, prefix=prefix)
48 return Leaf(token.COMMA, u",")
52 return Leaf(token.DOT, u".")
70 return Leaf(token.NEWLINE, u"\n")
74 return Leaf(token.NEWLINE, u"")
[all …]
|
| /external/python/cpython3/Lib/lib2to3/ |
| D | fixer_util.py | 6 from .pytree import Leaf, Node
17 [keyword, Leaf(token.EQUAL, "="), value])
20 return Leaf(token.LPAR, "(")
23 return Leaf(token.RPAR, ")")
34 target + [Leaf(token.EQUAL, "=", prefix=" ")] + source)
38 return Leaf(token.NAME, name, prefix=prefix)
46 return Leaf(token.COMMA, ",")
50 return Leaf(token.DOT, ".")
68 return Leaf(token.NEWLINE, "\n")
72 return Leaf(token.NEWLINE, "")
[all …]
|
| /external/yapf/yapf/yapflib/ |
| D | subtype_assigner.py | 114 if isinstance(child, pytree.Leaf) and child.value == '=':
121 if isinstance(child, pytree.Leaf) and child.value == 'or':
128 if isinstance(child, pytree.Leaf) and child.value == 'and':
135 if isinstance(child, pytree.Leaf) and child.value == 'not':
143 if (isinstance(child, pytree.Leaf) and
154 if isinstance(child, pytree.Leaf) and child.value == '*':
162 if isinstance(child, pytree.Leaf) and child.value == '|':
169 if isinstance(child, pytree.Leaf) and child.value == '^':
176 if isinstance(child, pytree.Leaf) and child.value == '&':
183 if isinstance(child, pytree.Leaf) and child.value in {'<<', '>>'}:
[all …]
|
| D | split_penalty.py | 72 if (prev_child and isinstance(prev_child, pytree.Leaf) and
100 if isinstance(node.children[colon_idx], pytree.Leaf):
145 if isinstance(child, pytree.Leaf) and child.value == ',':
158 if isinstance(child, pytree.Leaf) and child.value == '=':
171 if isinstance(child, pytree.Leaf) and child.value == ':':
391 if isinstance(child, pytree.Leaf) and child.value == '|':
471 if isinstance(child, pytree.Leaf) and child.value == ',':
517 if isinstance(node, pytree.Leaf):
538 if isinstance(node, pytree.Leaf):
564 if isinstance(tree, pytree.Leaf):
[all …]
|
| D | pytree_utils.py | 73 if isinstance(node, pytree.Leaf):
79 if isinstance(node, pytree.Leaf):
144 if isinstance(tree, pytree.Leaf) and tree.type == token.ENDMARKER:
305 if isinstance(node, pytree.Leaf):
328 if isinstance(node, pytree.Leaf):
|
| /external/python/cpython2/Lib/lib2to3/fixes/ |
| D | fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf
39 if isinstance(left_side, Leaf) and \
115 if isinstance(left_node, Leaf) and \
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
186 node.insert_child(2, Leaf(token.RPAR, u')'))
188 node.insert_child(2, Leaf(token.LPAR, u'('))
198 arglist.append_child(Leaf(token.COMMA, u','))
217 pass_leaf = Leaf(text_type, u'pass')
220 node.append_child(Leaf(token.NEWLINE, u'\n'))
226 pass_leaf = Leaf(text_type, u'pass')
[all …]
|
| /external/python/cpython3/Lib/lib2to3/fixes/ |
| D | fix_metaclass.py | 23 from ..fixer_util import syms, Node, Leaf
39 if isinstance(left_side, Leaf) and \
115 if isinstance(left_node, Leaf) and \
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
186 node.insert_child(2, Leaf(token.RPAR, ')'))
188 node.insert_child(2, Leaf(token.LPAR, '('))
198 arglist.append_child(Leaf(token.COMMA, ','))
217 pass_leaf = Leaf(text_type, 'pass')
220 node.append_child(Leaf(token.NEWLINE, '\n'))
226 pass_leaf = Leaf(text_type, 'pass')
[all …]
|
| /external/grpc-grpc-java/context/src/test/java/io/grpc/ |
| D | PersistentHashArrayMappedTrieTest.java | 25 import io.grpc.PersistentHashArrayMappedTrie.Leaf;
38 Leaf<Key, Object> leaf = new Leaf<Key, Object>(key, value1); in leaf_replace()
40 assertTrue(ret instanceof Leaf); in leaf_replace()
55 Leaf<Key, Object> leaf = new Leaf<Key, Object>(key1, value1); in leaf_collision()
74 Leaf<Key, Object> leaf = new Leaf<Key, Object>(key1, value1); in leaf_insert()
175 Leaf<Key, Object> leaf1 = new Leaf<Key, Object>(key1, value1); in compressedIndex_combine_differentIndexBit()
176 Leaf<Key, Object> leaf2 = new Leaf<Key, Object>(key2, value2); in compressedIndex_combine_differentIndexBit()
206 Leaf<Key, Object> leaf1 = new Leaf<Key, Object>(key1, value1); in compressedIndex_combine_sameIndexBit()
207 Leaf<Key, Object> leaf2 = new Leaf<Key, Object>(key2, value2); in compressedIndex_combine_sameIndexBit()
|
| /external/bcc/src/python/bcc/ |
| D | table.py | 170 self.Leaf = leaftype
184 buf = ct.create_string_buffer(ct.sizeof(self.Leaf) * 8)
200 leaf = self.Leaf()
208 leaf = self.Leaf()
260 self[k] = self.Leaf()
449 leaf = self.Leaf()
487 leaf = self.Leaf(leaf)
489 leaf = self.Leaf(leaf.fd)
518 super(CgroupArray, self).__setitem__(key, self.Leaf(leaf))
522 super(CgroupArray, self).__setitem__(key, self.Leaf(f.fd))
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 101 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
308 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, in newLeafBlock() argument
317 if (Leaf.Low == Leaf.High) { in newLeafBlock()
320 Leaf.Low, "SwitchLeaf"); in newLeafBlock()
323 if (Leaf.Low->isMinValue(true /*isSigned*/)) { in newLeafBlock()
325 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
327 } else if (Leaf.Low->isZero()) { in newLeafBlock()
329 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
333 Constant* NegLo = ConstantExpr::getNeg(Leaf.Low); in newLeafBlock()
337 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); in newLeafBlock()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 81 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
295 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, in newLeafBlock() argument
305 if (Leaf.Low == Leaf.High) { in newLeafBlock()
308 Leaf.Low, "SwitchLeaf"); in newLeafBlock()
311 if (Leaf.Low->isMinValue(true /*isSigned*/)) { in newLeafBlock()
313 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
315 } else if (Leaf.Low->isZero()) { in newLeafBlock()
317 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
321 Constant* NegLo = ConstantExpr::getNeg(Leaf.Low); in newLeafBlock()
325 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); in newLeafBlock()
[all …]
|
| /external/bcc/tests/python/ |
| D | test_stat1.py | 21 Leaf = None variable
26 class Leaf(Structure): class
35 self.stats = b.get_table("stats", Key, Leaf)
62 self.stats[self.stats.Key()] = self.stats.Leaf(100, 200)
64 self.stats[self.stats.Key(10, 20)] = self.stats.Leaf(300, 400)
|
| /external/cpu_features/src/ |
| D | cpuinfo_x86.c | 36 Leaf CpuIdEx(uint32_t leaf_id, int ecx) { in CpuIdEx()
37 Leaf leaf; in CpuIdEx()
56 Leaf CpuIdEx(uint32_t leaf_id, int ecx) { in CpuIdEx()
57 Leaf leaf; in CpuIdEx()
73 static Leaf CpuId(uint32_t leaf_id) { return CpuIdEx(leaf_id, 0); } in CpuId()
75 static const Leaf kEmptyLeaf;
77 static Leaf SafeCpuIdEx(uint32_t max_cpuid_leaf, uint32_t leaf_id, int ecx) { in SafeCpuIdEx()
85 static Leaf SafeCpuId(uint32_t max_cpuid_leaf, uint32_t leaf_id) { in SafeCpuId()
118 static void SetVendor(const Leaf leaf, char* const vendor) { in SetVendor()
125 static int IsVendor(const Leaf leaf, const char* const name) { in IsVendor()
[all …]
|
| /external/yapf/yapftests/ |
| D | pytree_utils_test.py | 39 leaf = pytree.Leaf(token.LPAR, '(')
43 leaf = pytree.Leaf(token.LPAR, '(')
90 lpar1 = pytree.Leaf(token.LPAR, '(')
91 lpar2 = pytree.Leaf(token.LPAR, '(')
93 [pytree.Leaf(token.NAME, 'foo')])
98 return pytree.Leaf(token.RPAR, ')')
153 self._leaf = pytree.Leaf(token.LPAR, '(')
155 [pytree.Leaf(token.NAME, 'foo')])
|
| D | format_token_test.py | 69 tok = format_token.FormatToken(pytree.Leaf(token.STRING, "'hello world'"))
73 tok = format_token.FormatToken(pytree.Leaf(token.COMMENT, '# A comment'))
78 tok = format_token.FormatToken(pytree.Leaf(token.STRING, '"""hello"""'))
81 tok = format_token.FormatToken(pytree.Leaf(token.STRING, 'r"""hello"""'))
|
| /external/llvm/lib/DebugInfo/CodeView/ |
| D | CVTypeVisitor.cpp | 76 uint8_t Leaf = Data.front(); in skipPadding() local
77 if (Leaf < LF_PAD0) in skipPadding()
81 unsigned BytesToAdvance = Leaf & 0x0F; in skipPadding()
98 TypeLeafKind Leaf = TypeLeafKind(unsigned(*LeafPtr)); in visitFieldList() local
99 switch (Leaf) { in visitFieldList()
|
| /external/bcc/examples/networking/http_filter/ |
| D | http-parse-complete.c | 15 struct Leaf { struct
22 BPF_HASH(sessions, struct Key, struct Leaf, 1024);
57 struct Leaf zero = {0}; in http_filter()
134 struct Leaf * lookup_leaf = sessions.lookup(&key); in http_filter()
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 934 typedef IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits> Leaf; typedef
1149 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1160 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1170 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1177 Leaf *L = newNode<Leaf>(); in branchRoot()
1186 rootBranch().stop(n) = node[n].template get<Leaf>().stop(size[n]-1); in branchRoot()
1189 rootBranchStart() = node[0].template get<Leaf>().start(0); in branchRoot()
1211 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1267 deleteNode(&Node.get<Leaf>()); in deleteNode()
1319 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : in unsafeStart()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 935 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>; variable
1152 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1162 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1172 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1179 Leaf *L = newNode<Leaf>(); in branchRoot()
1188 rootBranch().stop(n) = node[n].template get<Leaf>().stop(size[n]-1); in branchRoot()
1191 rootBranchStart() = node[0].template get<Leaf>().start(0); in branchRoot()
1213 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1269 deleteNode(&Node.get<Leaf>()); in deleteNode()
1322 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : in unsafeStart()
[all …]
|
| /external/clang/lib/Rewrite/ |
| D | RewriteRope.cpp | 616 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in Destroy() local
617 delete Leaf; in Destroy()
630 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in split() local
631 return Leaf->split(Offset); in split()
644 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in insert() local
645 return Leaf->insert(Offset, R); in insert()
653 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in erase() local
654 return Leaf->erase(Offset, NumBytes); in erase()
733 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear() local
734 Leaf->clear(); in clear()
|
| /external/bcc/examples/networking/dns_matching/ |
| D | dns_matching.c | 49 struct Leaf { struct
54 BPF_HASH(cache, struct Key, struct Leaf, 128); argument
91 struct Leaf * lookup_leaf = cache.lookup(&key); in dns_matching()
|