public static string InsertSample(string value, string name)
{
LLex l = new LLex(new StringLoadInfo(value), name);
l.InsertString(0, LOCAL_PROFILER + "BeginMikuSample(\"" + "[lua]:require " + name + " &line:1" + "\") ");
int lastPos = 0;
int nextPos = l.pos;
l.Next();
int tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
InsertSample(l, ref lastPos, ref nextPos, tokenType, false);
return(l.code);
}
public static string InsertSample(string value, string name)
{
LLex l = new LLex(new StringLoadInfo(value), name);
l.InsertString(0, "BeginMikuSample(\"" + name + ", line:1 require file\")\r\n");
int lastPos = 0;
int nextPos = l.pos;
l.Next();
int tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
InsertSample(l, ref lastPos, ref nextPos, tokenType, false);
return(l.code);
}
public static string InsertSample(string value, string name)
{
LLex l = new LLex(new StringLoadInfo(value), name);
string sampleStr = string.Format("{0}BeginMikuSample(\"[lua]:require {1},{1}&line:1\")", LOCAL_PROFILER, name);
l.InsertString(0, sampleStr);
int lastPos = 0;
int nextPos = l.pos;
l.Next();
int tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
InsertSample(l, ref lastPos, ref nextPos, tokenType, false);
return(l.code);
}
static void InsertSample(LLex l, ref int lastPos, ref int nextPos, int tokenType, bool onlyFun)
{
Stack <int> tokens = new Stack <int>();
List <Token> history = new List <Token>(16);
bool needLastSample = true;
bool hasReturn = false;
int lastStackToken = -1;
while (tokenType != (int)TK.EOS)
{
switch (tokenType)
{
case (int)TK.FUNCTION:
hasReturn = false;
tokens.Push(tokenType);
lastStackToken = tokenType;
string funName = "";
bool isLeft = false;
bool isForward = false;
int index = history.Count - 2;
if (index >= 0)
{
var hisToken = history[index];
while (hisToken is JumpToken)
{
index--;
if (index < 0)
{
break;
}
hisToken = history[index];
}
isForward = hisToken.TokenType == (int)'=';
index--;
if (isForward && index >= 0)
{
hisToken = history[index];
while (hisToken is JumpToken)
{
index--;
if (index < 0)
{
break;
}
hisToken = history[index];
}
while (!(hisToken is JumpToken))
{
if (hisToken is NameToken)
{
funName = ((NameToken)hisToken).SemInfo + funName;
}
else if ((hisToken.TokenType == (int)':'))
{
funName = ':' + funName;
}
else if ((hisToken.TokenType == (int)'.') ||
(hisToken.TokenType == (int)'['))
{
funName = '.' + funName;
}
else if (hisToken is StringToken)
{
funName = ((StringToken)hisToken).SemInfo + funName;
}
index--;
if (index < 0)
{
break;
}
hisToken = history[index];
}
}
}
while (tokenType != (int)TK.EOS)
{
l.Next();
tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
if (!isLeft && !isForward)
{
if (l.Token is NameToken)
{
funName += ((NameToken)l.Token).SemInfo;
}
else if ((l.Token.TokenType == (int)':'))
{
funName += ':';
}
else if ((l.Token.TokenType == (int)'.'))
{
funName += '.';
}
}
if (tokenType == (int)'(')
{
isLeft = true;
}
if (tokenType == (int)')')
{
if (string.IsNullOrEmpty(funName))
{
funName = "";
}
string profilerStr = string.Format(" BeginMikuSample(\"[lua]:{0} {1}&line:{2}\") ", funName, l.Source, l.LineNumber);
l.InsertString(nextPos - 1, profilerStr);
nextPos = l.pos;
break;
}
}
break;
case (int)TK.IF:
case (int)TK.FOR:
case (int)TK.WHILE:
if (tokens.Count > 0)
{
tokens.Push(tokenType);
lastStackToken = tokenType;
}
break;
case (int)TK.RETURN:
int insertPos = lastPos - 1;
if (tokens.Count == 0)
{
needLastSample = false;
}
while (tokenType != (int)TK.EOS)
{
l.Next();
tokenType = l.Token.TokenType;
if (!(l.Token is JumpToken))
{
lastPos = nextPos;
nextPos = l.pos;
}
if (tokenType == (int)TK.FUNCTION)
{
InsertSample(l, ref lastPos, ref nextPos, tokenType, true);
tokenType = l.Token.TokenType;
}
if (tokenType == (int)TK.END ||
tokenType == (int)TK.ELSEIF ||
tokenType == (int)TK.ELSE ||
tokenType == (int)TK.EOS)
{
lastPos = lastPos - 1;
string returnStr = l.ReadString(insertPos, lastPos - 1);
returnStr = " return miku_unpack_return_value(" + returnStr.Substring(6, returnStr.Length - 6) + ") ";
l.Replace(insertPos, lastPos - 1, returnStr);
nextPos = l.pos;
if (tokenType == (int)TK.END)
{
if (tokens.Count > 0)
{
tokens.Pop();
}
if (onlyFun && tokens.Count <= 0)
{
l.Next();
lastPos = nextPos;
nextPos = l.pos;
return;
}
}
break;
}
}
if (lastStackToken != (int)TK.IF)
{
hasReturn = true;
}
break;
case (int)TK.END:
if (tokens.Count > 0)
{
int token = tokens.Pop();
if (token == (int)TK.FUNCTION)
{
if (!hasReturn)
{
l.InsertString(lastPos - 1, " EndMikuSample() ");
lastPos = nextPos;
nextPos = l.pos;
}
if (onlyFun && tokens.Count <= 0)
{
l.Next();
lastPos = nextPos;
nextPos = l.pos;
return;
}
}
if (tokens.Count > 0)
{
var tA = tokens.ToArray();
lastStackToken = tA[tA.Length - 1];
}
hasReturn = false;
}
break;
}
l.Next();
history.Add(l.Token);
if (history.Count >= 16)
{
history.RemoveAt(0);
}
tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
}
if (needLastSample)
{
l.InsertString(nextPos, " EndMikuSample()");
}
}
static void InsertSample(LLex l, ref int lastPos, ref int nextPos, int tokenType, bool onlyFun)
{
Stack <int> tokens = new Stack <int>();
bool needLastSample = true;
bool hasReturn = false;
int lastStackToken = -1;
while (tokenType != (int)TK.EOS)
{
switch (tokenType)
{
case (int)TK.FUNCTION:
hasReturn = false;
tokens.Push(tokenType);
lastStackToken = tokenType;
string funName = "";
bool isLeft = false;
while (tokenType != (int)TK.EOS)
{
l.Next();
tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
if (!isLeft)
{
if (l.Token is NameToken)
{
funName += ((NameToken)l.Token).SemInfo;
}
else if ((l.Token.TokenType == (int)':'))
{
funName += ':';
}
else if ((l.Token.TokenType == (int)'.'))
{
funName += '.';
}
}
if (tokenType == (int)'(')
{
isLeft = true;
}
if (tokenType == (int)')')
{
l.InsertString(nextPos - 1, "\r\nBeginMikuSample(\"" + l.Source
+ ",line:" + l.LineNumber + " funName:" + funName + "\")\r\n");
nextPos = l.pos;
break;
}
}
break;
case (int)TK.IF:
case (int)TK.FOR:
case (int)TK.WHILE:
if (tokens.Count > 0)
{
tokens.Push(tokenType);
lastStackToken = tokenType;
}
break;
case (int)TK.RETURN:
int insertPos = lastPos - 1;
if (tokens.Count == 0)
{
needLastSample = false;
}
Token lastTokenType = null;
int commentPos = insertPos;
while (tokenType != (int)TK.EOS)
{
lastTokenType = l.Token;
l.Next();
tokenType = l.Token.TokenType;
if (l.Token is CommentToken && !(lastTokenType is CommentToken))
{
commentPos = nextPos - 1;
}
lastPos = nextPos;
nextPos = l.pos;
if (tokenType == (int)TK.FUNCTION)
{
InsertSample(l, ref lastPos, ref nextPos, tokenType, true);
tokenType = l.Token.TokenType;
if (l.Token is CommentToken && !(lastTokenType is CommentToken))
{
commentPos = lastPos - 1;
}
lastTokenType = l.Token;
}
if (tokenType == (int)TK.END ||
tokenType == (int)TK.ELSEIF ||
tokenType == (int)TK.ELSE ||
tokenType == (int)TK.EOS)
{
if (lastTokenType is CommentToken)
{
lastPos = commentPos;
}
string returnStr = l.ReadString(insertPos, lastPos - 1);;
returnStr = returnStr.Trim();
if (returnStr.Length > 0 && returnStr[returnStr.Length - 1] == ';')
{
returnStr = returnStr.Substring(0, returnStr.Length - 1);
}
returnStr = "\r\nreturn miku_unpack_return_value(" + returnStr.Substring(6, returnStr.Length - 6).Trim() + ")\r\n";
l.Replace(insertPos, lastPos - 1, returnStr);
nextPos = l.pos;
if (tokenType == (int)TK.END)
{
if (tokens.Count > 0)
{
tokens.Pop();
}
if (onlyFun && tokens.Count <= 0)
{
l.Next();
lastPos = nextPos;
nextPos = l.pos;
return;
}
}
break;
}
}
if (lastStackToken != (int)TK.IF)
{
hasReturn = true;
}
break;
case (int)TK.END:
if (tokens.Count > 0)
{
int token = tokens.Pop();
if (token == (int)TK.FUNCTION)
{
if (!hasReturn)
{
l.InsertString(lastPos - 1, "\r\nEndMikuSample()\r\n");
lastPos = nextPos;
nextPos = l.pos;
}
if (onlyFun && tokens.Count <= 0)
{
l.Next();
lastPos = nextPos;
nextPos = l.pos;
return;
}
}
if (tokens.Count > 0)
{
var tA = tokens.ToArray();
lastStackToken = tA[tA.Length - 1];
}
hasReturn = false;
}
break;
}
l.Next();
tokenType = l.Token.TokenType;
lastPos = nextPos;
nextPos = l.pos;
}
if (needLastSample)
{
l.InsertString(nextPos, "\r\nEndMikuSample()");
}
}