/external/antlr/antlr-3.4/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() 60 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 63 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 70 List labels = probe.getSampleNonDeterministicInputSequence(problemState); in toString() 71 String input = probe.getInputSequenceDisplay(labels); in toString() 74 if ( probe.dfa.isTokensRuleDecision() ) { in toString() 75 Set 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() 56 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 59 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 66 if ( probe.dfa.isTokensRuleDecision() ) { in toString() 71 probe.getTokenNameForTokensRuleAlt(altI.intValue()); in toString() 74 probe.dfa.nfa.grammar.getRuleStartState(tokenName); in toString()
|
D | GrammarDanglingStateMessage.java | 42 public DecisionProbe probe; field in GrammarDanglingStateMessage 45 public GrammarDanglingStateMessage(DecisionProbe probe, in GrammarDanglingStateMessage() argument 49 this.probe = probe; in GrammarDanglingStateMessage() 54 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 57 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 61 List labels = probe.getSampleNonDeterministicInputSequence(problemState); in toString() 62 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() 45 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 48 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 54 probe.dfa.getNFADecisionStartState().enclosingRule.name); in toString()
|
D | RecursionOverflowMessage.java | 41 public DecisionProbe probe; field in RecursionOverflowMessage 47 public RecursionOverflowMessage(DecisionProbe probe, in RecursionOverflowMessage() argument 54 this.probe = probe; in RecursionOverflowMessage() 62 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 65 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 76 probe.getSampleNonDeterministicInputSequence(sampleBadState); in toString() 77 String input = probe.getInputSequenceDisplay(labels); 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() 50 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 53 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 59 String ruleName = probe.dfa.getNFADecisionStartState().enclosingRule.name; 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() 54 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString() 57 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString() 80 …List<Label> sampleInputLabels = problemState.dfa.probe.getSampleNonDeterministicInputSequence(prob… in toString() 81 String input = problemState.dfa.probe.getInputSequenceDisplay(sampleInputLabels); in toString()
|
D | ErrorManager.java | 615 public static void nondeterminism(DecisionProbe probe, in nondeterminism() argument 619 Message msg = new GrammarNonDeterminismMessage(probe,d); in nondeterminism() 624 public static void danglingState(DecisionProbe probe, in danglingState() argument 628 Message msg = new GrammarDanglingStateMessage(probe,d); in danglingState() 638 public static void analysisAborted(DecisionProbe probe) in analysisAborted() argument 641 Message msg = new GrammarAnalysisAbortedMessage(probe); in analysisAborted() 646 public static void unreachableAlts(DecisionProbe probe, in unreachableAlts() argument 650 Message msg = new GrammarUnreachableAltsMessage(probe,alts); in unreachableAlts() 655 public static void insufficientPredicates(DecisionProbe probe, in insufficientPredicates() argument 660 Message msg = new GrammarInsufficientPredicatesMessage(probe,d,altToUncoveredLocations); in insufficientPredicates() [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/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/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" {
|
D | win_coreclr_chkstk.ll | 7 ; Prolog stack allocation >= 4096 bytes will require the probe sequence 43 ; Prolog stack allocation >= 4096 bytes will require the probe sequence 57 ; Prolog stack allocation >= 4096 bytes will require the probe sequence 70 ; Prolog stack allocation >= 4096 bytes will require the probe sequence 82 ; Prolog stack allocation >= 4096 bytes will require the probe sequence 93 ; Make sure we don't emit the probe for a smaller prolog stack allocation. 104 ; Make sure we don't emit the probe sequence if not on windows even if the 117 ; Within-body inline probe expansion 134 ; Influence of stack-probe-size attribute 136 define i32 @test_probe_size() "stack-probe-size"="8192" nounwind {
|
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
D | TaggedRecord.java | 59 int probe = power; in search() local 66 while (probe > (1 << 0)) { in search() 67 probe >>= 1; in search() 69 if (table[index + probe].getTag().compareTo(tag) <= 0) { in search() 70 index += probe; in search()
|
D | ClassTable.java | 73 int probe = power; in search() local 80 while (probe > (1 << 0)) { in search() 81 probe >>= 1; in search() 83 if (table[index + probe].glyphID <= glyphID) { in search() 84 index += probe; in search()
|
/external/icu/icu4c/source/layoutex/ |
D | LXUtilities.cpp | 59 le_int32 probe = power; in search() local 66 while (probe > (1 << 0)) { in search() 67 probe >>= 1; in search() 69 if (value >= array[index + probe]) { in search() 70 index += probe; in search()
|
/external/bison/src/ |
D | muscle-tab.c | 111 muscle_entry probe; in muscle_insert() local 114 probe.key = key; in muscle_insert() 115 entry = hash_lookup (muscle_table, &probe); in muscle_insert() 141 muscle_entry probe; in muscle_grow() local 144 probe.key = key; in muscle_grow() 145 entry = hash_lookup (muscle_table, &probe); in muscle_grow() 228 muscle_entry probe; in muscle_find_const() local 231 probe.key = key; in muscle_find_const() 232 result = hash_lookup (muscle_table, &probe); in muscle_find_const() 248 muscle_entry probe; in muscle_find() local [all …]
|
/external/webrtc/webrtc/base/ |
D | autodetectproxy.cc | 222 std::string probe; in OnConnectEvent() local 226 probe.assign("CONNECT www.google.com:443 HTTP/1.0\r\n" in OnConnectEvent() 228 probe.append(agent_); in OnConnectEvent() 229 probe.append("\r\n" in OnConnectEvent() 236 probe.assign("\005\001\000", 3); in OnConnectEvent() 244 << " sending " << probe.size() << " bytes"; in OnConnectEvent() 245 socket_->Send(probe.data(), probe.size()); in OnConnectEvent()
|
/external/icu/icu4c/source/extra/scrptrun/ |
D | scrptrun.cpp | 86 int32_t probe = pairedCharPower; in getPairIndex() local 93 while (probe > (1 << 0)) { in getPairIndex() 94 probe >>= 1; in getPairIndex() 96 if (ch >= pairedChars[index + probe]) { in getPairIndex() 97 index += probe; in getPairIndex()
|
/external/walt/arduino/walt/ |
D | walt.ino | 89 boolean probe; // whether currently probing 304 gshock.probe = true; 308 sound.probe = true; 324 midi.probe = true; 339 screen.probe = true; 343 screen.probe = false; 382 if (gshock.probe) { 387 gshock.probe = false; 393 if (sound.probe) { 398 sound.probe = false; [all …]
|
/external/syslinux/gpxe/src/include/ |
D | nic.h | 80 int ( * probe ) ( struct nic *nic, void *hwdev ), 95 .probe = _name ## _pci_legacy_probe, \ 116 .probe = _name ## _isapnp_legacy_probe, \ 137 .probe = _name ## _eisa_legacy_probe, \ 158 .probe = _name ## _mca_legacy_probe, \ 189 .probe = _name ## _isa_legacy_probe_at_addr, \
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/lang/ |
D | UScriptRun.java | 601 int probe = pairedCharPower; in getPairIndex() local 608 while (probe > (1 << 0)) { in getPairIndex() 609 probe >>= 1; in getPairIndex() 611 if (ch >= pairedChars[index + probe]) { in getPairIndex() 612 index += probe; in getPairIndex()
|