| /external/bcc/tests/cc/ |
| D | test_usdt_probes.cc | 43 auto probe = ctx.get("sample_probe_1"); variable
44 REQUIRE(probe);
46 REQUIRE(probe->in_shared_object(probe->bin_path()) == false);
47 REQUIRE(probe->name() == "sample_probe_1");
48 REQUIRE(probe->provider() == "libbcc_test");
49 REQUIRE(probe->bin_path().find("/test_libbcc") != std::string::npos);
51 REQUIRE(probe->num_locations() == 1);
52 REQUIRE(probe->num_arguments() == 2);
53 REQUIRE(probe->need_enable() == false);
161 auto probe = ctx.get(name); variable
[all …]
|
| /external/e2fsprogs/lib/blkid/ |
| D | probe.c | 320 static int probe_ext4dev(struct blkid_probe *probe, in probe_ext4dev() argument
361 get_ext2_info(probe->dev, id, buf); in probe_ext4dev()
365 static int probe_ext4(struct blkid_probe *probe, struct blkid_magic *id, in probe_ext4() argument
409 get_ext2_info(probe->dev, id, buf); in probe_ext4()
413 static int probe_ext3(struct blkid_probe *probe, struct blkid_magic *id, in probe_ext3() argument
431 get_ext2_info(probe->dev, id, buf); in probe_ext3()
435 static int probe_ext2(struct blkid_probe *probe, struct blkid_magic *id, in probe_ext2() argument
463 get_ext2_info(probe->dev, id, buf); in probe_ext2()
467 static int probe_jbd(struct blkid_probe *probe, struct blkid_magic *id, in probe_jbd() argument
476 get_ext2_info(probe->dev, id, buf); in probe_jbd()
[all …]
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | GrammarNonDeterminismMessage.java | 44 public DecisionProbe probe; field in GrammarNonDeterminismMessage
47 public GrammarNonDeterminismMessage(DecisionProbe probe, in GrammarNonDeterminismMessage() argument
51 this.probe = probe; in GrammarNonDeterminismMessage()
54 if ( probe.dfa.isTokensRuleDecision() ) { in GrammarNonDeterminismMessage()
61 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
64 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
71 List<Label> labels = probe.getSampleNonDeterministicInputSequence(problemState); in toString()
72 String input = probe.getInputSequenceDisplay(labels); in toString()
75 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
76 Set<Integer> disabledAlts = probe.getDisabledAlternatives(problemState); in toString()
[all …]
|
| D | GrammarUnreachableAltsMessage.java | 40 public DecisionProbe probe; field in GrammarUnreachableAltsMessage
43 public GrammarUnreachableAltsMessage(DecisionProbe probe, in GrammarUnreachableAltsMessage() argument
47 this.probe = probe; in GrammarUnreachableAltsMessage()
50 if ( probe.dfa.isTokensRuleDecision() ) { in GrammarUnreachableAltsMessage()
57 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
60 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
67 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
72 probe.getTokenNameForTokensRuleAlt(altI); in toString()
75 probe.dfa.nfa.grammar.getRuleStartState(tokenName); in toString()
|
| D | GrammarDanglingStateMessage.java | 43 public DecisionProbe probe; field in GrammarDanglingStateMessage
46 public GrammarDanglingStateMessage(DecisionProbe probe, in GrammarDanglingStateMessage() argument
50 this.probe = probe; in GrammarDanglingStateMessage()
56 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
59 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
63 List<Label> labels = probe.getSampleNonDeterministicInputSequence(problemState); in toString()
64 String input = probe.getInputSequenceDisplay(labels); in toString()
|
| D | GrammarAnalysisAbortedMessage.java | 37 public DecisionProbe probe; field in GrammarAnalysisAbortedMessage
39 public GrammarAnalysisAbortedMessage(DecisionProbe probe) { in GrammarAnalysisAbortedMessage() argument
41 this.probe = probe; in GrammarAnalysisAbortedMessage()
46 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
49 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
55 probe.dfa.getNFADecisionStartState().enclosingRule.name); in toString()
|
| D | RecursionOverflowMessage.java | 43 public DecisionProbe probe; field in RecursionOverflowMessage
49 public RecursionOverflowMessage(DecisionProbe probe, in RecursionOverflowMessage() argument
56 this.probe = probe; in RecursionOverflowMessage()
65 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
68 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
79 probe.getSampleNonDeterministicInputSequence(sampleBadState); in toString()
80 String input = probe.getInputSequenceDisplay(labels); in toString()
|
| D | GrammarInsufficientPredicatesMessage.java | 39 public DecisionProbe probe; field in GrammarInsufficientPredicatesMessage
43 public GrammarInsufficientPredicatesMessage(DecisionProbe probe, in GrammarInsufficientPredicatesMessage() argument
48 this.probe = probe; in GrammarInsufficientPredicatesMessage()
55 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
58 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
81 …List<Label> sampleInputLabels = problemState.dfa.probe.getSampleNonDeterministicInputSequence(prob… in toString()
82 String input = problemState.dfa.probe.getInputSequenceDisplay(sampleInputLabels); in toString()
|
| D | NonRegularDecisionMessage.java | 40 public DecisionProbe probe; field in NonRegularDecisionMessage
43 public NonRegularDecisionMessage(DecisionProbe probe, Set<Integer> altsWithRecursion) { in NonRegularDecisionMessage() argument
45 this.probe = probe; in NonRegularDecisionMessage()
51 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
54 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
60 String ruleName = probe.dfa.getNFADecisionStartState().enclosingRule.name; in toString()
|
| /external/python/cpython3/Include/ |
| D | pydtrace.d | 4 probe function__entry(const char *, const char *, int);
5 probe function__return(const char *, const char *, int);
6 probe instance__new__start(const char *, const char *);
7 probe instance__new__done(const char *, const char *);
8 probe instance__delete__start(const char *, const char *);
9 probe instance__delete__done(const char *, const char *);
10 probe line(const char *, const char *, int);
11 probe gc__start(int);
12 probe gc__done(long);
13 probe import__find__load__start(const char *);
[all …]
|
| /external/bcc/src/python/bcc/ |
| D | usdt.py | 80 def __init__(self, probe, index, location): argument
81 self.probe = probe
83 self.num_arguments = probe.num_arguments
92 res = lib.bcc_usdt_get_argument(self.probe.context, self.probe.provider,
93 self.probe.name,
102 def __init__(self, context, probe): argument
104 self.provider = probe.provider
105 self.name = probe.name
106 self.bin_path = probe.bin_path
107 self.semaphore = probe.semaphore
[all …]
|
| /external/bcc/src/cc/usdt/ |
| D | usdt.cc | 230 void Context::_each_probe(const char *binpath, const struct bcc_elf_usdt *probe, in _each_probe() argument
233 ctx->add_probe(binpath, probe); in _each_probe()
249 void Context::add_probe(const char *binpath, const struct bcc_elf_usdt *probe) { in add_probe() argument
251 if (p->provider_ == probe->provider && p->name_ == probe->name) { in add_probe()
252 p->add_location(probe->pc, binpath, probe->arg_fmt); in add_probe()
258 new Probe(binpath, probe->provider, probe->name, probe->semaphore, pid_, in add_probe()
260 probes_.back()->add_location(probe->pc, binpath, probe->arg_fmt); in add_probe()
321 for (const auto &probe : probes_) { in each() local
323 info.provider = probe->provider().c_str(); in each()
324 info.bin_path = probe->bin_path().c_str(); in each()
[all …]
|
| /external/bcc/tools/ |
| D | tplist.py | 71 def print_usdt_details(probe): argument
73 print(probe)
75 for idx in range(0, probe.num_locations):
76 loc = probe.get_location(idx)
80 print(" %d location(s)" % probe.num_locations)
81 print(" %d argument(s)" % probe.num_arguments)
84 (probe.bin_path, probe.provider, probe.name))
89 for probe in reader.enumerate_probes():
90 probe_name = probe.short_name()
95 print_usdt_details(probe)
|
| D | stackcount.py | 179 for probe in self.usdt.enumerate_probes():
180 if not self.pid and (probe.bin_path != self.library):
182 if re.match(self.pattern, probe.name):
191 self.usdt.enable_probe(probe.name, new_func)
272 self.probe = Probe(self.args.pattern,
283 print("%s" % self.probe.bpf.ksym(addr, show_offset=True))
285 print("%s" % self.probe.bpf.ksym(addr))
292 print("%s" % self.probe.bpf.sym(addr, pid, show_offset=True))
294 print("%s" % self.probe.bpf.sym(addr, pid))
304 self.probe.load()
[all …]
|
| /external/tensorflow/tensorflow/contrib/eager/python/examples/workshop/ |
| D | 1_basic.ipynb | 235 " probe = (a + b) / 2\n",
236 " f_probe = f(probe)\n",
239 " a = probe\n",
242 " b = probe\n",
244 " probe = (a + b) / 2\n",
245 " f_probe = f(probe)\n",
246 " print(\"new probe\", probe)\n",
247 " return probe\n",
256 "('new probe', 0.25)\n",
257 "('new probe', 0.125)\n",
[all …]
|
| /external/icu/icu4c/source/samples/layout/ |
| D | cmaps.cpp | 137 le_uint16 probe = 1 << fEntrySelector; in unicodeToGlyph() local
144 while (probe > (1 << 0)) { in unicodeToGlyph()
145 probe >>= 1; in unicodeToGlyph()
147 if (SWAPU16(fStartCodes[index + probe]) <= unicode) { in unicodeToGlyph()
148 index += probe; in unicodeToGlyph()
186 le_int32 probe = fPower; in unicodeToGlyph() local
193 while (probe > (1 << 0)) { in unicodeToGlyph()
194 probe >>= 1; in unicodeToGlyph()
196 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) { in unicodeToGlyph()
197 range += probe; in unicodeToGlyph()
|
| /external/icu/icu4c/source/test/letest/ |
| D | cmaps.cpp | 177 le_uint16 probe = 1 << fEntrySelector; in unicodeToGlyph() local
184 while (probe > (1 << 0)) { in unicodeToGlyph()
185 probe >>= 1; in unicodeToGlyph()
187 if (SWAPU16(fStartCodes[index + probe]) <= unicode) { in unicodeToGlyph()
188 index += probe; in unicodeToGlyph()
226 le_int32 probe = fPower; in unicodeToGlyph() local
233 while (probe > (1 << 0)) { in unicodeToGlyph()
234 probe >>= 1; in unicodeToGlyph()
236 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) { in unicodeToGlyph()
237 range += probe; in unicodeToGlyph()
|
| D | FontObject.cpp | 65 le_uint16 probe = 1 << entrySelector; in findTable() local
71 while (probe > (1 << 0)) { in findTable()
72 probe >>= 1; in findTable()
74 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) { in findTable()
75 table += probe; in findTable()
163 le_uint16 probe = 1 << cmEntrySelector; in unicodeToGlyph() local
170 while (probe > (1 << 0)) { in unicodeToGlyph()
171 probe >>= 1; in unicodeToGlyph()
173 if (SWAPW(cmStartCodes[index + probe]) <= unicode) { in unicodeToGlyph()
174 index += probe; in unicodeToGlyph()
|
| /external/icu/icu4c/source/test/perf/leperf/ |
| D | cmaps.cpp | 178 le_uint16 probe = 1 << fEntrySelector; in unicodeToGlyph() local
185 while (probe > (1 << 0)) { in unicodeToGlyph()
186 probe >>= 1; in unicodeToGlyph()
188 if (SWAPU16(fStartCodes[index + probe]) <= unicode) { in unicodeToGlyph()
189 index += probe; in unicodeToGlyph()
227 le_int32 probe = fPower; in unicodeToGlyph() local
234 while (probe > (1 << 0)) { in unicodeToGlyph()
235 probe >>= 1; in unicodeToGlyph()
237 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) { in unicodeToGlyph()
238 range += probe; in unicodeToGlyph()
|
| D | FontObject.cpp | 69 le_uint16 probe = 1 << entrySelector; in findTable() local
75 while (probe > (1 << 0)) { in findTable()
76 probe >>= 1; in findTable()
78 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) { in findTable()
79 table += probe; in findTable()
167 le_uint16 probe = 1 << cmEntrySelector; in unicodeToGlyph() local
174 while (probe > (1 << 0)) { in unicodeToGlyph()
175 probe >>= 1; in unicodeToGlyph()
177 if (SWAPW(cmStartCodes[index + probe]) <= unicode) { in unicodeToGlyph()
178 index += probe; in unicodeToGlyph()
|
| /external/bcc/src/cc/ |
| D | bcc_elf.c | 60 static const char *parse_stapsdt_note(struct bcc_elf_usdt *probe, in parse_stapsdt_note() argument
63 probe->pc = *((uint32_t *)(desc)); in parse_stapsdt_note()
64 probe->base_addr = *((uint32_t *)(desc + 4)); in parse_stapsdt_note()
65 probe->semaphore = *((uint32_t *)(desc + 8)); in parse_stapsdt_note()
68 probe->pc = *((uint64_t *)(desc)); in parse_stapsdt_note()
69 probe->base_addr = *((uint64_t *)(desc + 8)); in parse_stapsdt_note()
70 probe->semaphore = *((uint64_t *)(desc + 16)); in parse_stapsdt_note()
74 probe->provider = desc; in parse_stapsdt_note()
77 probe->name = desc; in parse_stapsdt_note()
80 probe->arg_fmt = desc; in parse_stapsdt_note()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/Inline/ |
| D | inline-stack-probe-size.ll | 3 define internal void @innerSmall() "stack-probe-size"="4096" {
7 define internal void @innerLarge() "stack-probe-size"="8192" {
16 define void @outerConflictingAttributeSmall() "stack-probe-size"="4096" {
21 define void @outerConflictingAttributeLarge() "stack-probe-size"="8192" {
29 ; CHECK: attributes #0 = { "stack-probe-size"="4096" }
|
| /external/llvm/test/CodeGen/X86/ |
| D | stack-probe-size.ll | 2 ; probe calls when the size of the local variables exceeds the specified stack
3 ; probe size.
6 ; stack probe size equals the page size (4096 bytes for all x86 targets), and
13 define i32 @test1() "stack-probe-size"="0" {
35 define i32 @test3() "stack-probe-size"="8192" {
46 define i32 @test4() "stack-probe-size"="0" {
68 define i32 @test6() "stack-probe-size"="8192" {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | stack-probe-size.ll | 2 ; probe calls when the size of the local variables exceeds the specified stack
3 ; probe size.
6 ; stack probe size equals the page size (4096 bytes for all x86 targets), and
13 define i32 @test1() "stack-probe-size"="0" {
35 define i32 @test3() "stack-probe-size"="8192" {
46 define i32 @test4() "stack-probe-size"="0" {
68 define i32 @test6() "stack-probe-size"="8192" {
|
| /external/grpc-grpc/src/core/lib/profiling/ |
| D | stap_probes.d | 2 probe add_mark(int tag);
3 probe add_important_mark(int tag);
4 probe timing_ns_begin(int tag);
5 probe timing_ns_end(int tag);
|