当前位置: 首页>>代码示例>>Java>>正文


Java Lua.OP_TFORLOOP属性代码示例

本文整理汇总了Java中org.luaj.vm2.Lua.OP_TFORLOOP属性的典型用法代码示例。如果您正苦于以下问题:Java Lua.OP_TFORLOOP属性的具体用法?Java Lua.OP_TFORLOOP怎么用?Java Lua.OP_TFORLOOP使用的例子?那么恭喜您, 这里精选的属性代码示例或许可以为您提供帮助。您也可以进一步了解该属性所在org.luaj.vm2.Lua的用法示例。


在下文中一共展示了Lua.OP_TFORLOOP属性的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: isLoopVariable

private boolean isLoopVariable(VarInfo var) {
	if ( var.pc >= 0 ) {
		switch ( Lua.GET_OPCODE(pi.prototype.code[var.pc]) ) {
		case Lua.OP_TFORLOOP:
		case Lua.OP_FORLOOP:
			return true;
		}
	}
	return false;
}
 
开发者ID:hsllany,项目名称:HtmlNative,代码行数:10,代码来源:UpvalInfo.java

示例2: isLoopVariable

/**
 * Checks if this {@link VarInfo} is a loop variable
 *
 * @param var The variable to check
 * @return If this variable is one used in a loop
 */
private boolean isLoopVariable(VarInfo var) {
	if (var.pc >= 0) {
		switch (Lua.GET_OPCODE(pi.prototype.code[var.pc])) {
			case Lua.OP_TFORLOOP:
			case Lua.OP_FORLOOP:
				return true;
		}
	}
	return false;
}
 
开发者ID:SquidDev,项目名称:luaj.luajc,代码行数:16,代码来源:UpvalueInfo.java

示例3: visitBranches

public static void visitBranches( Prototype p, BranchVisitor visitor ) {
	int sbx,j,c;
	int[] code = p.code;
	int n = code.length;
	for ( int i=0; i<n; i++ ) {
		int ins = code[i];
		switch ( Lua.GET_OPCODE( ins ) ) {
		case Lua.OP_LOADBOOL:
			if ( 0 == Lua.GETARG_C(ins) )
				break;
			if ( Lua.GET_OPCODE(code[i+1]) == Lua.OP_JMP  )
				throw new IllegalArgumentException("OP_LOADBOOL followed by jump at "+i);
			visitor.visitBranch( i, i+2 );
			continue;
		case Lua.OP_EQ:
		case Lua.OP_LT:
		case Lua.OP_LE:
		case Lua.OP_TEST: 
		case Lua.OP_TESTSET:
			if ( Lua.GET_OPCODE(code[i+1]) != Lua.OP_JMP  )
				throw new IllegalArgumentException("test not followed by jump at "+i); 
			sbx = Lua.GETARG_sBx(code[i+1]);
			++i;
			j = i + sbx + 1;
			visitor.visitBranch( i, j );
			visitor.visitBranch( i, i+1 ); 				
			continue;
		case Lua.OP_TFORLOOP:
		case Lua.OP_FORLOOP:
			sbx = Lua.GETARG_sBx(ins);
			j = i + sbx + 1;
			visitor.visitBranch( i, j );
			visitor.visitBranch( i, i+1 ); 				
			continue;
		case Lua.OP_JMP:
		case Lua.OP_FORPREP:
			sbx = Lua.GETARG_sBx(ins);
			j = i + sbx + 1;
			visitor.visitBranch( i, j );
			continue;
		case Lua.OP_TAILCALL:
		case Lua.OP_RETURN:
			visitor.visitReturn( i );
			continue;
		}
		if ( i+1<n && visitor.isbeg[i+1] )
			visitor.visitBranch( i, i+1 );
	}
}
 
开发者ID:hsllany,项目名称:HtmlNative,代码行数:49,代码来源:BasicBlock.java

示例4: visitBranches

public final void visitBranches(Prototype p) {
	int branchOffset, branchTo;
	int[] code = p.code;
	int n = code.length;
	for (int i = 0; i < n; i++) {
		int ins = code[i];
		switch (Lua.GET_OPCODE(ins)) {
			case Lua.OP_LOADBOOL:
				if (0 == Lua.GETARG_C(ins)) {
					break;
				}
				if (Lua.GET_OPCODE(code[i + 1]) == Lua.OP_JMP) {
					throw new IllegalArgumentException("OP_LOADBOOL followed by jump at " + i);
				}
				visitBranch(i, i + 2);
				continue;
			case Lua.OP_EQ:
			case Lua.OP_LT:
			case Lua.OP_LE:
			case Lua.OP_TEST:
			case Lua.OP_TESTSET:
			case Lua.OP_TFORLOOP:
				if (Lua.GET_OPCODE(code[i + 1]) != Lua.OP_JMP) {
					throw new IllegalArgumentException("test not followed by jump at " + i);
				}
				branchOffset = Lua.GETARG_sBx(code[i + 1]);
				++i;
				branchTo = i + branchOffset + 1;
				visitBranch(i, branchTo);
				visitBranch(i, i + 1);
				continue;
			case Lua.OP_FORLOOP:
				branchOffset = Lua.GETARG_sBx(ins);
				branchTo = i + branchOffset + 1;
				visitBranch(i, branchTo);
				visitBranch(i, i + 1);
				continue;
			case Lua.OP_JMP:
			case Lua.OP_FORPREP:
				branchOffset = Lua.GETARG_sBx(ins);
				branchTo = i + branchOffset + 1;
				visitBranch(i, branchTo);
				continue;
			case Lua.OP_TAILCALL:
			case Lua.OP_RETURN:
				visitReturn(i);
				continue;
		}
		if (i + 1 < n && isBeginning[i + 1]) {
			visitBranch(i, i + 1);
		}
	}
}
 
开发者ID:SquidDev,项目名称:luaj.luajc,代码行数:53,代码来源:BranchVisitor.java


注:本文中的org.luaj.vm2.Lua.OP_TFORLOOP属性示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。