Daily update on 20250307-071126 by Nitload Youmu. Additional Message : Rewrite of token and node cache stack
Signed-off-by: Nitload <YoumuLiu_NSI@whv0t.onmicrosoft.com>
This commit is contained in:
@@ -0,0 +1,171 @@
|
||||
//-----------------------------------------------------------------------
|
||||
//-----------------------------------------------------------------------
|
||||
// file="CompileStack.cs"
|
||||
// Project: StgSharp
|
||||
// AuthorGroup: Nitload Space
|
||||
// Copyright (c) Nitload Space. All rights reserved.
|
||||
//
|
||||
// Permission is hereby granted, free of charge, to any person
|
||||
// obtaining a copy of this software and associated documentation
|
||||
// files (the “Software”), to deal in the Software without restriction,
|
||||
// including without limitation the rights to use, copy, modify, merge,
|
||||
// publish, distribute, sublicense, and/or sell copies of the Software,
|
||||
// and to permit persons to whom the Software is furnished to do so,
|
||||
// subject to the following conditions:
|
||||
//
|
||||
// The above copyright notice and
|
||||
// this permission notice shall be included in all copies
|
||||
// or substantial portions of the Software.
|
||||
//
|
||||
// THE SOFTWARE IS PROVIDED “AS IS”,
|
||||
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||||
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
||||
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
||||
// ARISING FROM, OUT OF OR IN CONNECTION WITH
|
||||
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
//
|
||||
//-----------------------------------------------------------------------
|
||||
//-----------------------------------------------------------------------
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.Data;
|
||||
using System.Linq;
|
||||
using System.Runtime.CompilerServices;
|
||||
using System.Text;
|
||||
using System.Threading.Tasks;
|
||||
|
||||
namespace StgSharp.Script
|
||||
{
|
||||
public partial class CompileStack<TNode, TType>
|
||||
where TNode: IASTNode<TNode, TType>
|
||||
where TType: ITypeSource<TType>
|
||||
{
|
||||
|
||||
private TNode[] _nodeArray = new TNode[4];
|
||||
private Token[] _operatorArray = new Token[4];
|
||||
private Token[] _tokenArray = new Token[4];
|
||||
|
||||
private int _nodeCount,_tokenCount, _operatorCount;
|
||||
private Stack<CompileDepthMark> _depthStack = new Stack<CompileDepthMark>(
|
||||
);
|
||||
|
||||
private Stack<bool> _isNode = new Stack<bool>();
|
||||
|
||||
public int Depth => _depthStack.Count;
|
||||
|
||||
public int OperandCount => _isNode.Count;
|
||||
|
||||
public int OperatorCount => _operatorCount;
|
||||
|
||||
public int OperatorAheadOfDepth
|
||||
{
|
||||
get => OperatorCount - _depthStack.Peek().OperatorBegin;
|
||||
}
|
||||
|
||||
public int OperandAheadOfDepth
|
||||
{
|
||||
get => OperandCount - _depthStack.Peek().OperandBegin;
|
||||
}
|
||||
|
||||
public void DecreaseDepth()
|
||||
{
|
||||
CompileDepthMark mark = _depthStack.Pop();
|
||||
}
|
||||
|
||||
public void IncreaseDepth()
|
||||
{
|
||||
_depthStack.Push(
|
||||
new CompileDepthMark
|
||||
{
|
||||
OperandBegin = OperandCount,
|
||||
OperatorBegin = OperatorCount
|
||||
} );
|
||||
}
|
||||
|
||||
public bool PeekOperand( out Token t, out TNode n )
|
||||
{
|
||||
if( OperandAheadOfDepth <= 0 ) {
|
||||
t = Token.Empty;
|
||||
n = TNode.Empty;
|
||||
return false;
|
||||
}
|
||||
if( _isNode.Pop() ) {
|
||||
t = Token.Empty;
|
||||
n = _nodeArray[ _nodeCount - 1 ];
|
||||
return true;
|
||||
} else {
|
||||
t = _tokenArray[ _tokenCount - 1 ];
|
||||
n = TNode.Empty;
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
public Token PeekOperator()
|
||||
{
|
||||
if( OperatorAheadOfDepth > 0 ) {
|
||||
return _operatorArray[ _operatorCount - 1 ];
|
||||
}
|
||||
return Token.Empty;
|
||||
}
|
||||
|
||||
public bool PopOperand( out Token t, out TNode n )
|
||||
{
|
||||
if( _isNode.Pop() ) {
|
||||
t = Token.Empty;
|
||||
n = _nodeArray[ --_nodeCount ];
|
||||
return true;
|
||||
} else {
|
||||
t = _tokenArray[ --_tokenCount ];
|
||||
n = TNode.Empty;
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
public Token PopOperator()
|
||||
{
|
||||
_operatorCount--;
|
||||
return _operatorArray[ _operatorCount ];
|
||||
}
|
||||
|
||||
public void PushOperand( TNode node )
|
||||
{
|
||||
if( _nodeArray.Length == _nodeCount ) {
|
||||
Array.Resize( ref _nodeArray, _nodeArray.Length * 2 );
|
||||
}
|
||||
_nodeArray[ _nodeCount ] = node;
|
||||
_nodeCount++;
|
||||
_isNode.Push( true );
|
||||
}
|
||||
|
||||
public void PushOperand( Token token )
|
||||
{
|
||||
if( _tokenArray.Length == _tokenCount ) {
|
||||
Array.Resize( ref _tokenArray, _tokenArray.Length * 2 );
|
||||
}
|
||||
_tokenArray[ _tokenCount ] = token;
|
||||
_tokenCount++;
|
||||
_isNode.Push( false );
|
||||
}
|
||||
|
||||
public void PushOperator( Token token )
|
||||
{
|
||||
if( _operatorArray.Length == _operatorCount ) {
|
||||
Array.Resize( ref _operatorArray, _operatorArray.Length * 2 );
|
||||
}
|
||||
_operatorArray[ _operatorCount ] = token;
|
||||
_operatorCount++;
|
||||
_isNode.Push( false );
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
public struct CompileDepthMark
|
||||
{
|
||||
|
||||
public int OperandBegin;
|
||||
public int OperatorBegin;
|
||||
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user