-
Notifications
You must be signed in to change notification settings - Fork 60
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Dibyendu Majumdar
committed
Mar 21, 2015
1 parent
362a544
commit ab97712
Showing
9 changed files
with
232 additions
and
28 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,152 @@ | ||
| /****************************************************************************** | ||
| * Copyright (C) 2015 Dibyendu Majumdar | ||
| * | ||
| * 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. | ||
| ******************************************************************************/ | ||
| #include "ravi_llvmcodegen.h" | ||
|
|
||
| namespace ravi { | ||
|
|
||
| void RaviCodeGenerator::emit_refresh_L_top(RaviFunctionDef *def) { | ||
| // Get pointer to ci->top | ||
| llvm::Value *citop = emit_gep(def, "ci_top", def->ci_val, 0, 1); | ||
| // Load ci->top | ||
| llvm::Instruction *citop_val = def->builder->CreateLoad(citop); | ||
| // TODO set tbaa | ||
| // Get L->top | ||
| llvm::Value *top = emit_gep(def, "L_top", def->L, 0, 4); | ||
| // Assign ci>top to L->top | ||
| auto ins = def->builder->CreateStore(citop_val, top); | ||
| ins->setMetadata(llvm::LLVMContext::MD_tbaa, def->types->tbaa_luaState_topT); | ||
| } | ||
|
|
||
| void RaviCodeGenerator::emit_TFORCALL(RaviFunctionDef *def, llvm::Value *L_ci, | ||
| llvm::Value *proto, int A, int B, int C, | ||
| int j, int jA) { | ||
|
|
||
| // case OP_TFORCALL: { | ||
| // StkId cb = ra + 3; /* call base */ | ||
| // setobjs2s(L, cb + 2, ra + 2); | ||
| // setobjs2s(L, cb + 1, ra + 1); | ||
| // setobjs2s(L, cb, ra); | ||
| // L->top = cb + 3; /* func. + 2 args (state and index) */ | ||
| // Protect(luaD_call(L, cb, GETARG_C(i), 1)); | ||
| // L->top = ci->top; | ||
| // i = *(ci->u.l.savedpc++); /* go to next instruction */ | ||
| // ra = RA(i); | ||
| // lua_assert(GET_OPCODE(i) == OP_TFORLOOP); | ||
| // goto l_tforloop; | ||
| // } | ||
| // case OP_TFORLOOP: { | ||
| // l_tforloop: | ||
| // if (!ttisnil(ra + 1)) { /* continue loop? */ | ||
| // setobjs2s(L, ra, ra + 1); /* save control variable */ | ||
| // ci->u.l.savedpc += GETARG_sBx(i); /* jump back */ | ||
| // } | ||
| // } break; | ||
|
|
||
| // Load pointer to base | ||
| llvm::Instruction *base_ptr = emit_load_base(def); | ||
|
|
||
| // Get pointer to register A | ||
| llvm::Value *ra = emit_gep_ra(def, base_ptr, A); | ||
| llvm::Value *ra1 = emit_gep_ra(def, base_ptr, A + 1); | ||
| llvm::Value *ra2 = emit_gep_ra(def, base_ptr, A + 2); | ||
| llvm::Value *cb = emit_gep_ra(def, base_ptr, A + 3); | ||
| llvm::Value *cb1 = emit_gep_ra(def, base_ptr, A + 4); | ||
| llvm::Value *cb2 = emit_gep_ra(def, base_ptr, A + 5); | ||
|
|
||
| emit_assign(def, cb2, ra2); | ||
| emit_assign(def, cb1, ra1); | ||
| emit_assign(def, cb, ra); | ||
|
|
||
| // Get pointer to register at cb+3 | ||
| llvm::Value *cb3 = emit_gep_ra(def, base_ptr, A + 6); | ||
| // Get pointer to L->top | ||
| llvm::Value *top = emit_gep(def, "L_top", def->L, 0, 4); | ||
| // Assign to L->top | ||
| llvm::Instruction *ins = def->builder->CreateStore(cb3, top); | ||
| ins->setMetadata(llvm::LLVMContext::MD_tbaa, def->types->tbaa_luaState_topT); | ||
|
|
||
| def->builder->CreateCall4(def->luaD_callF, def->L, cb, def->types->kInt[C], | ||
| def->types->kInt[1]); | ||
| // reload base | ||
| base_ptr = emit_load_base(def); | ||
| emit_refresh_L_top(def); | ||
| ra = emit_gep_ra(def, base_ptr, jA); | ||
| ra1 = emit_gep_ra(def, base_ptr, jA + 1); | ||
| llvm::Value *type = emit_load_type(def, ra1); | ||
|
|
||
| // Test if type != LUA_TNIL (0) | ||
| llvm::Value *isnotnil = def->builder->CreateICmpNE(type, def->types->kInt[0]); | ||
| llvm::BasicBlock *then_block = | ||
| llvm::BasicBlock::Create(def->jitState->context(), "if.not.nil", def->f); | ||
| llvm::BasicBlock *else_block = | ||
| llvm::BasicBlock::Create(def->jitState->context(), "if.nil"); | ||
| def->builder->CreateCondBr(isnotnil, then_block, else_block); | ||
| def->builder->SetInsertPoint(then_block); | ||
|
|
||
| emit_assign(def, ra, ra1); | ||
| // Do the jump | ||
| def->builder->CreateBr(def->jmp_targets[j].jmp1); | ||
|
|
||
| // Add the else block and make it current so that the next instruction flows | ||
| // here | ||
| def->f->getBasicBlockList().push_back(else_block); | ||
| def->builder->SetInsertPoint(else_block); | ||
| } | ||
|
|
||
| void RaviCodeGenerator::emit_TFORLOOP(RaviFunctionDef *def, llvm::Value *L_ci, | ||
| llvm::Value *proto, int A, int j) { | ||
| // case OP_TFORLOOP: { | ||
| // l_tforloop: | ||
| // if (!ttisnil(ra + 1)) { /* continue loop? */ | ||
| // setobjs2s(L, ra, ra + 1); /* save control variable */ | ||
| // ci->u.l.savedpc += GETARG_sBx(i); /* jump back */ | ||
| // } | ||
| // } break; | ||
|
|
||
| // Load pointer to base | ||
| llvm::Instruction *base_ptr = emit_load_base(def); | ||
|
|
||
| // Get pointer to register A | ||
| llvm::Value *ra = emit_gep_ra(def, base_ptr, A); | ||
| llvm::Value *ra1 = emit_gep_ra(def, base_ptr, A + 1); | ||
| llvm::Value *type = emit_load_type(def, ra1); | ||
|
|
||
| // Test if type != LUA_TNIL (0) | ||
| llvm::Value *isnotnil = def->builder->CreateICmpNE(type, def->types->kInt[0]); | ||
| llvm::BasicBlock *then_block = | ||
| llvm::BasicBlock::Create(def->jitState->context(), "if.not.nil", def->f); | ||
| llvm::BasicBlock *else_block = | ||
| llvm::BasicBlock::Create(def->jitState->context(), "if.nil"); | ||
| def->builder->CreateCondBr(isnotnil, then_block, else_block); | ||
| def->builder->SetInsertPoint(then_block); | ||
|
|
||
| emit_assign(def, ra, ra1); | ||
| // Do the jump | ||
| def->builder->CreateBr(def->jmp_targets[j].jmp1); | ||
|
|
||
| // Add the else block and make it current so that the next instruction flows | ||
| // here | ||
| def->f->getBasicBlockList().push_back(else_block); | ||
| def->builder->SetInsertPoint(else_block); | ||
| } | ||
| } |