jasder
/
antlr
1
0
Fork 1
Code Issues Pull Requests Releases 1 Wiki Activity

Remove tracing support from LexerATNSimulator - in process of moving it to dynamic instrumentation to eliminate runtime overhead in production use

This commit is contained in:
Sam Harwell 2012-11-01 05:35:01 -05:00
parent 3278997a89
commit eca9090fce
2 changed files with 0 additions and 272 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
runtime/Java/src/org/antlr/v4/runtime/Lexer.java
View File

@ -204,7 +204,6 @@ public abstract class Lexer extends Recognizer<Integer, LexerATNSimulator>
public void pushMode(int m) {
if ( LexerATNSimulator.debug ) System.out.println("pushMode "+m);
getInterpreter().tracePushMode(m);
_modeStack.push(_mode);
mode(m);
}
@ -212,7 +211,6 @@ public abstract class Lexer extends Recognizer<Integer, LexerATNSimulator>
public int popMode() {
if ( _modeStack.isEmpty() ) throw new EmptyStackException();
if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek());
getInterpreter().tracePopMode();
mode( _modeStack.pop() );
return _mode;
}
@ -250,7 +248,6 @@ public abstract class Lexer extends Recognizer<Integer, LexerATNSimulator>
* rather than a single variable as this implementation does).
*/
public void emit(Token token) {
getInterpreter().traceEmit(token);
//System.err.println("emit "+token);
this._token = token;
}

269
runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java
View File

@ -41,7 +41,6 @@ import org.antlr.v4.runtime.misc.Interval;
import org.antlr.v4.runtime.misc.NotNull;
import org.antlr.v4.runtime.misc.Nullable;
import java.io.IOException;
import java.io.OutputStream;
/** "dup" of ParserInterpreter */
@ -52,10 +51,6 @@ public class LexerATNSimulator extends ATNSimulator {
public static final int MIN_DFA_EDGE = 0;
public static final int MAX_DFA_EDGE = 127; // forces unicode to stay in ATN
private boolean trace = false;
private OutputStream traceStream = null;
private boolean traceFailed = false;
/** When we hit an accept state in either the DFA or the ATN, we
* have to notify the character stream to start buffering characters
* via mark() and record the current state. The current sim state
@ -140,27 +135,12 @@ public class LexerATNSimulator extends ATNSimulator {
this.line = simulator.line;
this.mode = simulator.mode;
this.startIndex = simulator.startIndex;
this.trace = simulator.trace;
this.traceStream = simulator.traceStream;
this.traceFailed = simulator.traceFailed;
}
public OutputStream getTraceStream() {
return this.traceStream;
}
public void setTraceStream(OutputStream traceStream) {
this.traceStream = traceStream;
this.trace = traceStream != null;
this.traceFailed = false;
}
public int match(@NotNull CharStream input, int mode) {
match_calls++;
this.mode = mode;
int mark = input.mark();
traceBeginMatch(input, mode);
try {
this.startIndex = input.index();
this.prevAccept.reset();
@ -173,7 +153,6 @@ public class LexerATNSimulator extends ATNSimulator {
}
}
finally {
traceEndMatch();
input.release(mark);
}
}
@ -189,7 +168,6 @@ public class LexerATNSimulator extends ATNSimulator {
// only called from test code from outside
protected int matchATN(@NotNull CharStream input) {
traceMatchATN();
ATNState startState = atn.modeToStartState.get(mode);
if ( debug ) {
@ -213,7 +191,6 @@ public class LexerATNSimulator extends ATNSimulator {
System.out.format("DFA after matchATN: %s\n", decisionToDFA[old_mode].toLexerString());
}
tracePredict(predict);
return predict;
}
@ -223,7 +200,6 @@ public class LexerATNSimulator extends ATNSimulator {
System.out.format("start state closure=%s\n", ds0.configs);
}
traceLookahead1();
int t = input.LA(1);
@NotNull
DFAState s = ds0; // s is current/from DFA state
@ -288,12 +264,10 @@ public class LexerATNSimulator extends ATNSimulator {
}
if (target.isAcceptState) {
traceAcceptState(target.prediction);
captureSimState(prevAccept, input, target);
}
consume(input);
traceLookahead1();
t = input.LA(1);
s = target; // flip; current DFA target becomes new src/from state
}
@ -309,7 +283,6 @@ public class LexerATNSimulator extends ATNSimulator {
int actionIndex = prevAccept.dfaState.lexerActionIndex;
accept(input, ruleIndex, actionIndex,
prevAccept.index, prevAccept.line, prevAccept.charPos);
tracePredict(prevAccept.dfaState.prediction);
return prevAccept.dfaState.prediction;
}
else {
@ -366,7 +339,6 @@ public class LexerATNSimulator extends ATNSimulator {
if ( actionIndex>=0 && recog!=null ) recog.action(null, ruleIndex, actionIndex);
// seek to after last char in token
traceSeek(index);
input.seek(index);
this.line = line;
this.charPositionInLine = charPos;
@ -723,7 +695,6 @@ public class LexerATNSimulator extends ATNSimulator {
charPositionInLine++;
}
input.consume();
traceConsume(input, curChar);
}
@NotNull
@ -732,244 +703,4 @@ public class LexerATNSimulator extends ATNSimulator {
//if ( atn.g!=null ) return atn.g.getTokenDisplayName(t);
return "'"+(char)t+"'";
}
/*
* Trace helpers (API and file format are work in progress)
*/
public void traceEndMatch() {
if (trace) {
traceSlow(LexerOpCode.EndMatch);
}
}
public void traceMatchATN() {
if (trace) {
traceSlow(LexerOpCode.MatchATN);
}
}
public void traceMatchDFA() {
if (trace) {
traceSlow(LexerOpCode.MatchDFA);
}
}
public void traceLookahead1() {
if (trace) {
traceSlow(LexerOpCode.Lookahead1);
}
}
public void traceFailOverToATN() {
if (trace) {
traceSlow(LexerOpCode.FailOverToATN);
}
}
public void tracePredict(int prediction) {
if (trace) {
traceIntSlow(LexerOpCode.Predict, prediction);
}
}
public void traceAcceptState(int prediction) {
if (trace) {
traceIntSlow(LexerOpCode.AcceptState, prediction);
}
}
public void traceSeek(int index) {
if (trace) {
traceIntSlow(LexerOpCode.Seek, index);
}
}
public final void traceBeginMatch(CharStream input, int mode) {
if (trace) {
traceBeginMatchSlow(input, mode);
}
}
public final void traceConsume(CharStream input, int c) {
if (trace) {
traceConsumeSlow(input, c);
}
}
public final void tracePushMode(int mode) {
if (trace) {
traceByteSlow(LexerOpCode.PushMode, (byte) mode);
}
}
public final void tracePopMode() {
if (trace) {
traceSlow(LexerOpCode.PopMode);
}
}
public final void traceEmit(Token token) {
if (trace) {
traceEmitSlow(token);
}
}
private void traceSlow(LexerOpCode opcode) {
assert traceStream != null;
assert opcode.getArgumentSize() == 0;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceByteSlow(LexerOpCode opcode, byte arg) {
assert traceStream != null;
assert opcode.getArgumentSize() == 1;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
traceStream.write(arg);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceByteIntSlow(LexerOpCode opcode, byte arg1, int arg2) {
assert traceStream != null;
assert opcode.getArgumentSize() == 5;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
traceStream.write(arg1);
traceIntSlow(arg2);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceIntSlow(LexerOpCode opcode, int arg) {
assert traceStream != null;
assert opcode.getArgumentSize() == 4;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
traceIntSlow(arg);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceIntIntSlow(LexerOpCode opcode, int arg1, int arg2) {
assert traceStream != null;
assert opcode.getArgumentSize() == 8;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
traceIntSlow(arg1);
traceIntSlow(arg2);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceIntIntIntIntSlow(LexerOpCode opcode, int arg1, int arg2, int arg3, int arg4) {
assert traceStream != null;
assert opcode.getArgumentSize() == 16;
if (!traceFailed) {
try {
traceStream.write(opcode.ordinal());
traceIntSlow(arg1);
traceIntSlow(arg2);
traceIntSlow(arg3);
traceIntSlow(arg4);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceIntSlow(int arg) {
assert traceStream != null;
if (!traceFailed) {
try {
traceStream.write(arg);
traceStream.write(arg >> 8);
traceStream.write(arg >> 16);
traceStream.write(arg >> 24);
} catch (IOException e) {
e.printStackTrace();
traceFailed = true;
}
}
}
private void traceBeginMatchSlow(CharStream input, int mode) {
traceByteIntSlow(LexerOpCode.BeginMatch, (byte)mode, input.index());
}
private void traceConsumeSlow(CharStream input, int c) {
assert traceStream != null;
if (!traceFailed) {
traceIntIntSlow(LexerOpCode.Consume, c, input.index());
}
}
private void traceEmitSlow(Token token) {
assert traceStream != null;
if (token != null && !traceFailed) {
traceIntIntIntIntSlow(LexerOpCode.Emit, token.getStartIndex(), token.getStopIndex(), token.getType(), token.getChannel());
}
}
public enum LexerOpCode {
BeginMatch(5),
EndMatch(0),
MatchATN(0),
MatchDFA(0),
FailOverToATN(0),
AcceptState(4),
Predict(4),
Seek(4),
Consume(8),
Lookahead1(0),
PushMode(1),
PopMode(0),
Emit(16);
private final int argumentSize;
private LexerOpCode(int argumentSize) {
this.argumentSize = argumentSize;
}
public int getArgumentSize() {
return argumentSize;
}
}
}