blob: fd919c92a262abddc3ede3f842f43d16592979ea [file] [log] [blame]
Chris Lattner00950542001-06-06 20:29:01 +00001//===- ReadInst.cpp - Code to read an instruction from bytecode -------------===
2//
3// This file defines the mechanism to read an instruction from a bytecode
4// stream.
5//
6// Note that this library should be as fast as possible, reentrant, and
7// threadsafe!!
8//
9// TODO: Change from getValue(Raw.Arg1) etc, to getArg(Raw, 1)
10// Make it check type, so that casts are checked.
11//
12//===------------------------------------------------------------------------===
13
14#include "llvm/iOther.h"
15#include "llvm/iTerminators.h"
16#include "llvm/iMemory.h"
17#include "llvm/DerivedTypes.h"
18#include "ReaderInternals.h"
19
20bool BytecodeParser::ParseRawInst(const uchar *&Buf, const uchar *EndBuf,
21 RawInst &Result) {
22 unsigned Op, Typ;
23 if (read(Buf, EndBuf, Op)) return true;
24
25 Result.NumOperands = Op >> 30;
26 Result.Opcode = (Op >> 24) & 63;
27
28 switch (Result.NumOperands) {
29 case 1:
30 Result.Ty = getType((Op >> 12) & 4095);
31 Result.Arg1 = Op & 4095;
32 if (Result.Arg1 == 4095) // Handle special encoding for 0 operands...
33 Result.NumOperands = 0;
34 break;
35 case 2:
36 Result.Ty = getType((Op >> 16) & 255);
37 Result.Arg1 = (Op >> 8 ) & 255;
38 Result.Arg2 = (Op >> 0 ) & 255;
39 break;
40 case 3:
41 Result.Ty = getType((Op >> 18) & 63);
42 Result.Arg1 = (Op >> 12) & 63;
43 Result.Arg2 = (Op >> 6 ) & 63;
44 Result.Arg3 = (Op >> 0 ) & 63;
45 break;
46 case 0:
47 Buf -= 4; // Hrm, try this again...
48 if (read_vbr(Buf, EndBuf, Result.Opcode)) return true;
49 if (read_vbr(Buf, EndBuf, Typ)) return true;
50 Result.Ty = getType(Typ);
51 if (read_vbr(Buf, EndBuf, Result.NumOperands)) return true;
52
53 switch (Result.NumOperands) {
54 case 0:
55 cerr << "Zero Arg instr found!\n";
56 return true; // This encoding is invalid!
57 case 1:
58 if (read_vbr(Buf, EndBuf, Result.Arg1)) return true;
59 break;
60 case 2:
61 if (read_vbr(Buf, EndBuf, Result.Arg1) ||
62 read_vbr(Buf, EndBuf, Result.Arg2)) return true;
63 break;
64 case 3:
65 if (read_vbr(Buf, EndBuf, Result.Arg1) ||
66 read_vbr(Buf, EndBuf, Result.Arg2) ||
67 read_vbr(Buf, EndBuf, Result.Arg3)) return true;
68 break;
69 default:
70 if (read_vbr(Buf, EndBuf, Result.Arg1) ||
71 read_vbr(Buf, EndBuf, Result.Arg2)) return true;
72
73 // Allocate a vector to hold arguments 3, 4, 5, 6 ...
74 Result.VarArgs = new vector<unsigned>(Result.NumOperands-2);
75 for (unsigned a = 0; a < Result.NumOperands-2; a++)
76 if (read_vbr(Buf, EndBuf, (*Result.VarArgs)[a])) return true;
77 break;
78 }
79 if (align32(Buf, EndBuf)) return true;
80 break;
81 }
82
83 //cerr << "NO: " << Result.NumOperands << " opcode: " << Result.Opcode
84 // << " Ty: " << Result.Ty->getName() << " arg1: " << Result.Arg1 << endl;
85 return false;
86}
87
88
89bool BytecodeParser::ParseInstruction(const uchar *&Buf, const uchar *EndBuf,
90 Instruction *&Res) {
91 RawInst Raw;
92 if (ParseRawInst(Buf, EndBuf, Raw)) return true;;
93
94 if (Raw.Opcode >= Instruction::FirstUnaryOp &&
95 Raw.Opcode < Instruction::NumUnaryOps && Raw.NumOperands == 1) {
Chris Lattnerbebd60d2001-06-25 07:31:31 +000096 Res = UnaryOperator::create(Raw.Opcode,getValue(Raw.Ty,Raw.Arg1));
Chris Lattner00950542001-06-06 20:29:01 +000097 return false;
98 } else if (Raw.Opcode >= Instruction::FirstBinaryOp &&
99 Raw.Opcode < Instruction::NumBinaryOps && Raw.NumOperands == 2) {
Chris Lattnerbebd60d2001-06-25 07:31:31 +0000100 Res = BinaryOperator::create(Raw.Opcode, getValue(Raw.Ty, Raw.Arg1),
101 getValue(Raw.Ty, Raw.Arg2));
Chris Lattner00950542001-06-06 20:29:01 +0000102 return false;
103 } else if (Raw.Opcode == Instruction::PHINode) {
104 PHINode *PN = new PHINode(Raw.Ty);
105 switch (Raw.NumOperands) {
Chris Lattneree976f32001-06-11 15:04:40 +0000106 case 0:
107 case 1:
108 case 3: cerr << "Invalid phi node encountered!\n";
Chris Lattner00950542001-06-06 20:29:01 +0000109 delete PN;
110 return true;
Chris Lattneree976f32001-06-11 15:04:40 +0000111 case 2: PN->addIncoming(getValue(Raw.Ty, Raw.Arg1),
112 (BasicBlock*)getValue(Type::LabelTy, Raw.Arg2));
113 break;
Chris Lattner00950542001-06-06 20:29:01 +0000114 default:
Chris Lattneree976f32001-06-11 15:04:40 +0000115 PN->addIncoming(getValue(Raw.Ty, Raw.Arg1),
116 (BasicBlock*)getValue(Type::LabelTy, Raw.Arg2));
117 if (Raw.VarArgs->size() & 1) {
118 cerr << "PHI Node with ODD number of arguments!\n";
119 delete PN;
120 return true;
121 } else {
Chris Lattner00950542001-06-06 20:29:01 +0000122 vector<unsigned> &args = *Raw.VarArgs;
Chris Lattneree976f32001-06-11 15:04:40 +0000123 for (unsigned i = 0; i < args.size(); i+=2)
124 PN->addIncoming(getValue(Raw.Ty, args[i]),
125 (BasicBlock*)getValue(Type::LabelTy, args[i+1]));
Chris Lattner00950542001-06-06 20:29:01 +0000126 }
Chris Lattneree976f32001-06-11 15:04:40 +0000127 delete Raw.VarArgs;
128 break;
Chris Lattner00950542001-06-06 20:29:01 +0000129 }
130 Res = PN;
131 return false;
132 } else if (Raw.Opcode == Instruction::Ret) {
133 if (Raw.NumOperands == 0) {
134 Res = new ReturnInst(); return false;
135 } else if (Raw.NumOperands == 1) {
136 Res = new ReturnInst(getValue(Raw.Ty, Raw.Arg1)); return false;
137 }
138 } else if (Raw.Opcode == Instruction::Br) {
139 if (Raw.NumOperands == 1) {
140 Res = new BranchInst((BasicBlock*)getValue(Type::LabelTy, Raw.Arg1));
141 return false;
142 } else if (Raw.NumOperands == 3) {
143 Res = new BranchInst((BasicBlock*)getValue(Type::LabelTy, Raw.Arg1),
144 (BasicBlock*)getValue(Type::LabelTy, Raw.Arg2),
145 getValue(Type::BoolTy , Raw.Arg3));
146 return false;
147 }
148 } else if (Raw.Opcode == Instruction::Switch) {
149 SwitchInst *I =
150 new SwitchInst(getValue(Raw.Ty, Raw.Arg1),
151 (BasicBlock*)getValue(Type::LabelTy, Raw.Arg2));
152 Res = I;
153 if (Raw.NumOperands < 3) return false; // No destinations? Wierd.
154
155 if (Raw.NumOperands == 3 || Raw.VarArgs->size() & 1) {
156 cerr << "Switch statement with odd number of arguments!\n";
157 delete I;
158 return true;
159 }
160
161 vector<unsigned> &args = *Raw.VarArgs;
162 for (unsigned i = 0; i < args.size(); i += 2)
163 I->dest_push_back((ConstPoolVal*)getValue(Raw.Ty, args[i]),
164 (BasicBlock*)getValue(Type::LabelTy, args[i+1]));
165
166 delete Raw.VarArgs;
167 return false;
168 } else if (Raw.Opcode == Instruction::Call) {
169 Method *M = (Method*)getValue(Raw.Ty, Raw.Arg1);
170 if (M == 0) return true;
171
172 const MethodType::ParamTypes &PL = M->getMethodType()->getParamTypes();
173 MethodType::ParamTypes::const_iterator It = PL.begin();
174
175 vector<Value *> Params;
176 switch (Raw.NumOperands) {
177 case 0: cerr << "Invalid call instruction encountered!\n";
178 return true;
179 case 1: break;
180 case 2: Params.push_back(getValue(*It++, Raw.Arg2)); break;
181 case 3: Params.push_back(getValue(*It++, Raw.Arg2));
182 if (It == PL.end()) return true;
183 Params.push_back(getValue(*It++, Raw.Arg3)); break;
184 default:
185 Params.push_back(getValue(*It++, Raw.Arg2));
186 {
187 vector<unsigned> &args = *Raw.VarArgs;
188 for (unsigned i = 0; i < args.size(); i++) {
189 if (It == PL.end()) return true;
190 Params.push_back(getValue(*It++, args[i]));
191 }
192 }
193 delete Raw.VarArgs;
194 }
195 if (It != PL.end()) return true;
196
197 Res = new CallInst(M, Params);
198 return false;
199 } else if (Raw.Opcode == Instruction::Malloc) {
200 if (Raw.NumOperands > 2) return true;
201 Value *Sz = (Raw.NumOperands == 2) ? getValue(Type::UIntTy, Raw.Arg2) : 0;
202 Res = new MallocInst((ConstPoolType*)getValue(Type::TypeTy, Raw.Arg1), Sz);
203 return false;
204 } else if (Raw.Opcode == Instruction::Alloca) {
205 if (Raw.NumOperands > 2) return true;
206 Value *Sz = (Raw.NumOperands == 2) ? getValue(Type::UIntTy, Raw.Arg2) : 0;
207 Res = new AllocaInst((ConstPoolType*)getValue(Type::TypeTy, Raw.Arg1), Sz);
208 return false;
209 } else if (Raw.Opcode == Instruction::Free) {
210 Value *Val = getValue(Raw.Ty, Raw.Arg1);
211 if (!Val->getType()->isPointerType()) return true;
212 Res = new FreeInst(Val);
213 return false;
214 }
215
216 cerr << "Unrecognized instruction! " << Raw.Opcode << endl;
217 return true;
218}