Searched refs:probe (Results 1 - 25 of 98) sorted by relevance

1234

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DGrammarAnalysisAbortedMessage.java37 public DecisionProbe probe; field in class:GrammarAnalysisAbortedMessage
39 public GrammarAnalysisAbortedMessage(DecisionProbe probe) { argument
41 this.probe = probe;
45 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
48 String fileName = probe.dfa.nfa.grammar.getFileName();
54 probe.dfa.getNFADecisionStartState().enclosingRule.name);
H A DGrammarNonDeterminismMessage.java44 public DecisionProbe probe; field in class:GrammarNonDeterminismMessage
47 public GrammarNonDeterminismMessage(DecisionProbe probe, argument
51 this.probe = probe;
54 if ( probe.dfa.isTokensRuleDecision() ) {
60 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
63 String fileName = probe.dfa.nfa.grammar.getFileName();
70 List labels = probe.getSampleNonDeterministicInputSequence(problemState);
71 String input = probe.getInputSequenceDisplay(labels);
74 if ( probe
[all...]
H A DGrammarUnreachableAltsMessage.java40 public DecisionProbe probe; field in class:GrammarUnreachableAltsMessage
43 public GrammarUnreachableAltsMessage(DecisionProbe probe, argument
47 this.probe = probe;
50 if ( probe.dfa.isTokensRuleDecision() ) {
56 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
59 String fileName = probe.dfa.nfa.grammar.getFileName();
66 if ( probe.dfa.isTokensRuleDecision() ) {
71 probe.getTokenNameForTokensRuleAlt(altI.intValue());
74 probe
[all...]
H A DGrammarDanglingStateMessage.java42 public DecisionProbe probe; field in class:GrammarDanglingStateMessage
45 public GrammarDanglingStateMessage(DecisionProbe probe, argument
49 this.probe = probe;
54 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
57 String fileName = probe.dfa.nfa.grammar.getFileName();
61 List labels = probe.getSampleNonDeterministicInputSequence(problemState);
62 String input = probe.getInputSequenceDisplay(labels);
H A DRecursionOverflowMessage.java41 public DecisionProbe probe; field in class:RecursionOverflowMessage
47 public RecursionOverflowMessage(DecisionProbe probe, argument
54 this.probe = probe;
62 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
65 String fileName = probe.dfa.nfa.grammar.getFileName();
76 probe.getSampleNonDeterministicInputSequence(sampleBadState);
77 String input = probe.getInputSequenceDisplay(labels);
H A DNonRegularDecisionMessage.java40 public DecisionProbe probe; field in class:NonRegularDecisionMessage
43 public NonRegularDecisionMessage(DecisionProbe probe, Set<Integer> altsWithRecursion) { argument
45 this.probe = probe;
50 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
53 String fileName = probe.dfa.nfa.grammar.getFileName();
59 String ruleName = probe.dfa.getNFADecisionStartState().enclosingRule.name;
H A DGrammarInsufficientPredicatesMessage.java39 public DecisionProbe probe; field in class:GrammarInsufficientPredicatesMessage
43 public GrammarInsufficientPredicatesMessage(DecisionProbe probe, argument
48 this.probe = probe;
54 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
57 String fileName = probe.dfa.nfa.grammar.getFileName();
80 List<Label> sampleInputLabels = problemState.dfa.probe.getSampleNonDeterministicInputSequence(problemState);
81 String input = problemState.dfa.probe.getInputSequenceDisplay(sampleInputLabels);
H A DErrorManager.java615 public static void nondeterminism(DecisionProbe probe, argument
619 Message msg = new GrammarNonDeterminismMessage(probe,d);
624 public static void danglingState(DecisionProbe probe, argument
628 Message msg = new GrammarDanglingStateMessage(probe,d);
638 public static void analysisAborted(DecisionProbe probe) argument
641 Message msg = new GrammarAnalysisAbortedMessage(probe);
646 public static void unreachableAlts(DecisionProbe probe, argument
650 Message msg = new GrammarUnreachableAltsMessage(probe,alts);
655 public static void insufficientPredicates(DecisionProbe probe, argument
660 Message msg = new GrammarInsufficientPredicatesMessage(probe,
665 nonLLStarDecision(DecisionProbe probe) argument
672 recursionOverflow(DecisionProbe probe, DFAState sampleBadState, int alt, Collection targetRules, Collection callSiteStates) argument
[all...]
/external/icu/icu4c/source/layout/
H A DLookupTables.cpp31 le_int16 probe = SWAPW(searchRange); local
43 while (probe > unity && LE_SUCCESS(success)) {
44 probe >>= 1;
46 trial.addOffset(probe, success);
63 le_int16 probe = SWAPW(searchRange); local
73 while (probe > unity && LE_SUCCESS(success)) {
74 probe >>= 1;
76 trial.addOffset(probe, success);
H A DCoverageTables.cpp48 le_uint16 probe = power; local
59 while (probe > (1 << 0)) {
60 probe >>= 1;
62 if (SWAPW(glyphArray[index + probe]) <= ttGlyphID) {
63 index += probe;
H A DOpenTypeUtilities.cpp64 le_int32 probe = power; local
74 while (probe > (1 << 0)) {
75 probe >>= 1;
78 const ATag &aTag = (r0+index+probe)->tag;
80 index += probe;
103 le_int32 probe = power; local
114 while (probe > (1 << 0) && LE_SUCCESS(success)) {
115 probe >>= 1;
117 if (SWAPW(records(range + probe,success).firstGlyph) <= glyphID) {
118 range += probe;
133 le_int32 probe = power; local
155 le_int32 probe = power; local
[all...]
/external/e2fsprogs/lib/blkid/
H A Dprobe.c2 * probe.c - identify a block device by its contents, and return a dev
37 #include "probe.h"
320 static int probe_ext4dev(struct blkid_probe *probe, argument
361 get_ext2_info(probe->dev, id, buf);
365 static int probe_ext4(struct blkid_probe *probe, struct blkid_magic *id, argument
409 get_ext2_info(probe->dev, id, buf);
413 static int probe_ext3(struct blkid_probe *probe, struct blkid_magic *id, argument
431 get_ext2_info(probe->dev, id, buf);
435 static int probe_ext2(struct blkid_probe *probe, struct blkid_magic *id, argument
463 get_ext2_info(probe
467 probe_jbd(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
512 probe_fat(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
639 probe_fat_nomagic(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
680 probe_ntfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
788 probe_xfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
804 probe_reiserfs(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
832 probe_reiserfs4(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
848 probe_jfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
874 probe_zfs(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
888 probe_luks(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
901 probe_romfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
916 probe_cramfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
931 probe_swap0(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf __BLKID_ATTR((unused))) argument
940 probe_swap1(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf __BLKID_ATTR((unused))) argument
973 probe_iso9660(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
993 probe_udf(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf __BLKID_ATTR((unused))) argument
1036 probe_ocfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
1059 probe_ocfs2(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
1072 probe_oracleasm(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
1084 probe_gfs(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
1106 probe_gfs2(struct blkid_probe *probe, struct blkid_magic *id __BLKID_ATTR((unused)), unsigned char *buf) argument
1183 probe_hfsplus(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
1327 probe_lvm2(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
1374 probe_btrfs(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
1390 probe_f2fs(struct blkid_probe *probe, struct blkid_magic *id, unsigned char *buf) argument
1516 struct blkid_probe probe; local
[all...]
/external/icu/icu4c/source/layoutex/
H A DLXUtilities.cpp57 le_int32 probe = power; local
64 while (probe > (1 << 0)) {
65 probe >>= 1;
67 if (value >= array[index + probe]) {
68 index += probe;
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
H A DTaggedRecord.java57 int probe = power;
64 while (probe > (1 << 0)) {
65 probe >>= 1;
67 if (table[index + probe].getTag().compareTo(tag) <= 0) {
68 index += probe;
/external/chromium-trace/catapult/third_party/coverage/coverage/htmlfiles/
H A Dcoverage_html.js324 var probe = c.sel_end;
327 probe_line = c.line_elt(probe);
335 probe++;
338 // There's a next chunk, `probe` points to it.
339 var begin = probe;
344 probe++;
345 probe_line = c.line_elt(probe);
348 c.set_sel(begin, probe);
356 var probe = c.sel_begin-1;
357 var probe_line = c.line_elt(probe);
[all...]
/external/icu/icu4c/source/samples/layout/
H A Dcmaps.cpp131 le_uint16 probe = 1 << fEntrySelector; local
138 while (probe > (1 << 0)) {
139 probe >>= 1;
141 if (SWAPU16(fStartCodes[index + probe]) <= unicode) {
142 index += probe;
180 le_int32 probe = fPower; local
187 while (probe > (1 << 0)) {
188 probe >>= 1;
190 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) {
191 range += probe;
[all...]
/external/icu/icu4c/source/test/letest/
H A DFontObject.cpp63 le_uint16 probe = 1 << entrySelector; local
69 while (probe > (1 << 0)) {
70 probe >>= 1;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
161 le_uint16 probe = 1 << cmEntrySelector; local
168 while (probe > (1 << 0)) {
169 probe >>= 1;
171 if (SWAPW(cmStartCodes[index + probe]) <= unicode) {
172 index += probe;
[all...]
H A Dcmaps.cpp175 le_uint16 probe = 1 << fEntrySelector; local
182 while (probe > (1 << 0)) {
183 probe >>= 1;
185 if (SWAPU16(fStartCodes[index + probe]) <= unicode) {
186 index += probe;
224 le_int32 probe = fPower; local
231 while (probe > (1 << 0)) {
232 probe >>= 1;
234 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) {
235 range += probe;
[all...]
/external/icu/icu4c/source/test/perf/leperf/
H A DFontObject.cpp63 le_uint16 probe = 1 << entrySelector; local
69 while (probe > (1 << 0)) {
70 probe >>= 1;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
161 le_uint16 probe = 1 << cmEntrySelector; local
168 while (probe > (1 << 0)) {
169 probe >>= 1;
171 if (SWAPW(cmStartCodes[index + probe]) <= unicode) {
172 index += probe;
[all...]
H A Dcmaps.cpp172 le_uint16 probe = 1 << fEntrySelector; local
179 while (probe > (1 << 0)) {
180 probe >>= 1;
182 if (SWAPU16(fStartCodes[index + probe]) <= unicode) {
183 index += probe;
221 le_int32 probe = fPower; local
228 while (probe > (1 << 0)) {
229 probe >>= 1;
231 if (SWAPU32(fGroups[range + probe].startCharCode) <= unicode32) {
232 range += probe;
[all...]
/external/webrtc/webrtc/base/
H A Dautodetectproxy.cc222 std::string probe; local
226 probe.assign("CONNECT www.google.com:443 HTTP/1.0\r\n"
228 probe.append(agent_);
229 probe.append("\r\n"
236 probe.assign("\005\001\000", 3);
244 << " sending " << probe.size() << " bytes";
245 socket_->Send(probe.data(), probe.size());
/external/icu/icu4c/source/extra/scrptrun/
H A Dscrptrun.cpp85 int32_t probe = pairedCharPower; local
92 while (probe > (1 << 0)) {
93 probe >>= 1;
95 if (ch >= pairedChars[index + probe]) {
96 index += probe;
/external/bison/src/
H A Dmuscle-tab.c111 muscle_entry probe; local
114 probe.key = key;
115 entry = hash_lookup (muscle_table, &probe);
141 muscle_entry probe; local
144 probe.key = key;
145 entry = hash_lookup (muscle_table, &probe);
228 muscle_entry probe; local
231 probe.key = key;
232 result = hash_lookup (muscle_table, &probe);
248 muscle_entry probe; local
[all...]
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/
H A DMethodProbesAdapter.java43 * generator for unique probe ids
67 // If a probe will be inserted before the start label, we'll need to use
160 boolean probe = false;
164 probe = true;
170 probe = true;
174 return probe;
/external/icu/android_icu4j/src/main/java/android/icu/lang/
H A DUScriptRun.java601 int probe = pairedCharPower;
608 while (probe > (1 << 0)) {
609 probe >>= 1;
611 if (ch >= pairedChars[index + probe]) {
612 index += probe;

Completed in 659 milliseconds

1234