| /external/cpu_features/test/ |
| D | cpuinfo_x86_test.cc | 33 Leaf GetCpuidLeaf(uint32_t leaf_id, int ecx) const { in GetCpuidLeaf()
43 void SetLeaves(std::map<std::pair<uint32_t, int>, Leaf> configuration) { in SetLeaves()
72 std::map<std::pair<uint32_t, int>, Leaf> cpuid_leaves_;
84 extern "C" Leaf GetCpuidLeaf(uint32_t leaf_id, int ecx) { in GetCpuidLeaf()
113 {{0x00000000, 0}, Leaf{0x0000000D, 0x756E6547, 0x6C65746E, 0x49656E69}}, in TEST_F()
114 {{0x00000001, 0}, Leaf{0x000206A6, 0x00100800, 0x1F9AE3BF, 0xBFEBFBFF}}, in TEST_F()
115 {{0x00000007, 0}, Leaf{0x00000000, 0x00000000, 0x00000000, 0x00000000}}, in TEST_F()
158 {{0x00000000, 0}, Leaf{0x0000000D, 0x756E6547, 0x6C65746E, 0x49656E69}}, in TEST_F()
159 {{0x00000001, 0}, Leaf{0x000206A6, 0x00100800, 0x1F9AE3BF, 0xBFEBFBFF}}, in TEST_F()
160 {{0x00000007, 0}, Leaf{0x00000000, 0x00000000, 0x00000000, 0x00000000}}, in TEST_F()
[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/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| D | GIMatchTree.cpp | 40 for (const auto &Leaf : PossibleLeaves) { in writeDOTGraphNode() local
41 OS << Separator << Leaf.getName(); in writeDOTGraphNode()
43 if (!Leaf.isFullyTraversed()) in writeDOTGraphNode()
45 if (!Leaf.isFullyTested()) in writeDOTGraphNode()
53 for (const GIMatchTreeLeafInfo &Leaf : PossibleLeaves) { in writeDOTGraphNode() local
54 if (Leaf.isFullyTested()) in writeDOTGraphNode()
56 OS << "\\n" << Leaf.getName() << ": " << &Leaf; in writeDOTGraphNode()
57 for (const GIMatchDagPredicate *P : Leaf.untested_predicates()) in writeDOTGraphNode()
222 for (const auto &Leaf : Leaves) { in runStep() local
223 LLVM_DEBUG(dbgs() << " " << Leaf.getName() << " (" << &Leaf.getInfo() << "\n"); in runStep()
[all …]
|
| /external/llvm-project/clang/lib/Tooling/Syntax/ |
| D | Nodes.cpp | 204 syntax::Leaf *syntax::UnaryOperatorExpression::getOperatorToken() { in getOperatorToken()
205 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
212 syntax::Leaf *syntax::BinaryOperatorExpression::getOperatorToken() { in getOperatorToken()
213 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
221 syntax::Leaf *syntax::SwitchStatement::getSwitchKeyword() { in getSwitchKeyword()
222 return cast_or_null<syntax::Leaf>( in getSwitchKeyword()
231 syntax::Leaf *syntax::CaseStatement::getCaseKeyword() { in getCaseKeyword()
232 return cast_or_null<syntax::Leaf>( in getCaseKeyword()
246 syntax::Leaf *syntax::DefaultStatement::getDefaultKeyword() { in getDefaultKeyword()
247 return cast_or_null<syntax::Leaf>( in getDefaultKeyword()
[all …]
|
| D | Tree.cpp | 51 syntax::Leaf::Leaf(const syntax::Token *Tok) : Node(NodeKind::Leaf), Tok(Tok) { in Leaf() function in syntax::Leaf
192 static void dumpLeaf(raw_ostream &OS, const syntax::Leaf *L, in dumpLeaf()
216 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpNode()
261 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpTokens()
298 assert(isa<Leaf>(C)); in assertInvariants()
299 assert(cast<Leaf>(C).getToken()->kind() == L->getDelimiterTokenKind()); in assertInvariants()
312 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
314 if (const auto *L = dyn_cast<syntax::Leaf>(&C)) in findFirstLeaf()
322 const syntax::Leaf *syntax::Tree::findLastLeaf() const { in findLastLeaf()
324 if (const auto *L = dyn_cast<syntax::Leaf>(C)) in findLastLeaf()
[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/llvm-project/clang/include/clang/Tooling/Syntax/ |
| D | Nodes.h | 164 Leaf *getOperatorToken();
208 Leaf *getOperatorToken();
247 Leaf *getSwitchKeyword();
256 Leaf *getCaseKeyword();
266 Leaf *getDefaultKeyword();
276 Leaf *getIfKeyword();
278 Leaf *getElseKeyword();
287 Leaf *getForKeyword();
296 Leaf *getWhileKeyword();
305 Leaf *getContinueKeyword();
[all …]
|
| D | Tree.h | 157 class Leaf final : public Node {
159 Leaf(const Token *T);
206 const Leaf *findFirstLeaf() const;
207 Leaf *findFirstLeaf() { in findFirstLeaf()
208 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
211 const Leaf *findLastLeaf() const;
212 Leaf *findLastLeaf() { in findLastLeaf()
213 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf()); in findLastLeaf()
288 Leaf *delimiter;
|
| /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 …]
|
| /external/llvm-project/clang/unittests/Tooling/Syntax/ |
| D | SynthesisTest.cpp | 47 auto *Leaf = createLeaf(*Arena, tok::comma); in TEST_P() local
49 EXPECT_TRUE(treeDumpEqual(Leaf, R"txt( in TEST_P()
60 auto *Leaf = createLeaf(*Arena, tok::coloncolon); in TEST_P() local
62 EXPECT_TRUE(treeDumpEqual(Leaf, R"txt( in TEST_P()
70 auto *Leaf = createLeaf(*Arena, tok::kw_if); in TEST_P() local
72 EXPECT_TRUE(treeDumpEqual(Leaf, R"txt( in TEST_P()
83 auto *Leaf = createLeaf(*Arena, tok::kw_nullptr); in TEST_P() local
85 EXPECT_TRUE(treeDumpEqual(Leaf, R"txt( in TEST_P()
93 auto *Leaf = createLeaf(*Arena, tok::identifier, "a"); in TEST_P() local
95 EXPECT_TRUE(treeDumpEqual(Leaf, R"txt( in TEST_P()
[all …]
|
| /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/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 111 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val,
333 BasicBlock *LowerSwitch::newLeafBlock(CaseRange &Leaf, Value *Val, in newLeafBlock() argument
344 if (Leaf.Low == Leaf.High) { in newLeafBlock()
347 Leaf.Low, "SwitchLeaf"); in newLeafBlock()
350 if (Leaf.Low == LowerBound) { in newLeafBlock()
352 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
354 } else if (Leaf.High == UpperBound) { in newLeafBlock()
356 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low, in newLeafBlock()
358 } else if (Leaf.Low->isZero()) { in newLeafBlock()
360 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
[all …]
|
| /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-10.0/configs/common/lib/Target/AArch64/ |
| D | AArch64GenGICombiner.inc | 145 // Leaf name: copy_prop
160 // Leaf name: ptr_add_immed_chain
175 // Leaf name: extending_loads
187 // Leaf name: combine_indexed_load_store
202 // Leaf name: extending_loads
214 // Leaf name: combine_indexed_load_store
229 // Leaf name: extending_loads
241 // Leaf name: combine_indexed_load_store
256 // Leaf name: combine_indexed_load_store
271 // Leaf name: elide_br_by_inverting_cond
|
| /external/llvm-project/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 156 BasicBlock *NewLeafBlock(CaseRange &Leaf, Value *Val, ConstantInt *LowerBound, in NewLeafBlock() argument
165 if (Leaf.Low == Leaf.High) { in NewLeafBlock()
168 new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val, Leaf.Low, "SwitchLeaf"); in NewLeafBlock()
171 if (Leaf.Low == LowerBound) { in NewLeafBlock()
173 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in NewLeafBlock()
175 } else if (Leaf.High == UpperBound) { in NewLeafBlock()
177 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low, in NewLeafBlock()
179 } else if (Leaf.Low->isZero()) { in NewLeafBlock()
181 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in NewLeafBlock()
185 Constant *NegLo = ConstantExpr::getNeg(Leaf.Low); 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/llvm-project/compiler-rt/lib/fuzzer/ |
| D | FuzzerIO.cpp | 160 static bool MkDirRecursiveInner(const std::string &Leaf) { in MkDirRecursiveInner() argument
162 if (Leaf == ".") in MkDirRecursiveInner()
165 const std::string &Dir = DirName(Leaf); in MkDirRecursiveInner()
168 MkDir(Leaf); in MkDirRecursiveInner()
169 return IsDirectory(Leaf); in MkDirRecursiveInner()
178 MkDir(Leaf); in MkDirRecursiveInner()
179 return IsDirectory(Leaf); in MkDirRecursiveInner()
|
| /external/rust/crates/libfuzzer-sys/libfuzzer/ |
| D | FuzzerIO.cpp | 160 static bool MkDirRecursiveInner(const std::string &Leaf) { in MkDirRecursiveInner() argument
162 if (Leaf == ".") in MkDirRecursiveInner()
165 const std::string &Dir = DirName(Leaf); in MkDirRecursiveInner()
168 MkDir(Leaf); in MkDirRecursiveInner()
169 return IsDirectory(Leaf); in MkDirRecursiveInner()
178 MkDir(Leaf); in MkDirRecursiveInner()
179 return IsDirectory(Leaf); in MkDirRecursiveInner()
|
| /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/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')])
|