| 1 |
13 |
dgisselq |
////////////////////////////////////////////////////////////////////////////////
|
| 2 |
|
|
//
|
| 3 |
|
|
// Filename: asmdata.cpp
|
| 4 |
|
|
//
|
| 5 |
|
|
// Project: Zip CPU -- a small, lightweight, RISC CPU core
|
| 6 |
|
|
//
|
| 7 |
|
|
// Purpose: Like asmdata.h, this contains necessary data structures for the
|
| 8 |
|
|
// assembler. Specifically, in C/C++ fashion, this contains most
|
| 9 |
|
|
// of the code for actually building such structures.
|
| 10 |
|
|
//
|
| 11 |
|
|
// Creator: Dan Gisselquist, Ph.D.
|
| 12 |
|
|
// Gisselquist Tecnology, LLC
|
| 13 |
|
|
//
|
| 14 |
|
|
////////////////////////////////////////////////////////////////////////////////
|
| 15 |
|
|
//
|
| 16 |
|
|
// Copyright (C) 2015, Gisselquist Technology, LLC
|
| 17 |
|
|
//
|
| 18 |
|
|
// This program is free software (firmware): you can redistribute it and/or
|
| 19 |
|
|
// modify it under the terms of the GNU General Public License as published
|
| 20 |
|
|
// by the Free Software Foundation, either version 3 of the License, or (at
|
| 21 |
|
|
// your option) any later version.
|
| 22 |
|
|
//
|
| 23 |
|
|
// This program is distributed in the hope that it will be useful, but WITHOUT
|
| 24 |
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
| 25 |
|
|
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
| 26 |
|
|
// for more details.
|
| 27 |
|
|
//
|
| 28 |
|
|
// You should have received a copy of the GNU General Public License along
|
| 29 |
|
|
// with this program. (It's in the $(ROOT)/doc directory, run make with no
|
| 30 |
|
|
// target there if the PDF file isn't present.) If not, see
|
| 31 |
|
|
// <http://www.gnu.org/licenses/> for a copy.
|
| 32 |
|
|
//
|
| 33 |
|
|
// License: GPL, v3, as defined and found on www.gnu.org,
|
| 34 |
|
|
// http://www.gnu.org/licenses/gpl.html
|
| 35 |
|
|
//
|
| 36 |
|
|
//
|
| 37 |
|
|
////////////////////////////////////////////////////////////////////////////////
|
| 38 |
|
|
|
| 39 |
|
|
#include <stdlib.h>
|
| 40 |
|
|
#include <assert.h>
|
| 41 |
|
|
#include <string.h>
|
| 42 |
|
|
#include "asmdata.h"
|
| 43 |
|
|
|
| 44 |
|
|
extern void yyerror(const char *str);
|
| 45 |
|
|
|
| 46 |
|
|
unsigned int ILINE::eval(const int lno) {
|
| 47 |
|
|
return (lno==0)?m_in:DEFAULT_LINE;
|
| 48 |
|
|
}
|
| 49 |
|
|
|
| 50 |
|
|
unsigned int VLINE::eval(const int lno) {
|
| 51 |
|
|
return DEFAULT_LINE;
|
| 52 |
|
|
}
|
| 53 |
|
|
|
| 54 |
|
|
unsigned int DLINE::eval(const int lno) {
|
| 55 |
|
|
return (lno==0)?m_data:DEFAULT_LINE;
|
| 56 |
|
|
}
|
| 57 |
|
|
|
| 58 |
|
|
void LLINE::addline(ASMLINE *line) {
|
| 59 |
|
|
if (m_lines != NULL) {
|
| 60 |
|
|
ASMLINE **nwlines = new ASMLINE *[m_nlines+1];
|
| 61 |
|
|
for(int i=0; i<m_nlines; i++)
|
| 62 |
|
|
nwlines[i] = m_lines[i];
|
| 63 |
|
|
delete[] m_lines;
|
| 64 |
|
|
nwlines[m_nlines++] = line;
|
| 65 |
|
|
|
| 66 |
|
|
m_lines = nwlines;
|
| 67 |
|
|
} else {
|
| 68 |
|
|
m_lines = new ASMLINE *[1];
|
| 69 |
|
|
m_lines[m_nlines++] = line;
|
| 70 |
|
|
}
|
| 71 |
26 |
dgisselq |
|
| 72 |
|
|
if (m_lineno > line->m_lineno)
|
| 73 |
|
|
m_lineno = line->m_lineno;
|
| 74 |
13 |
dgisselq |
};
|
| 75 |
|
|
|
| 76 |
|
|
bool LLINE::isdefined(void) {
|
| 77 |
|
|
for(int i=0; i<m_nlines; i++)
|
| 78 |
|
|
if (!m_lines[i]->isdefined())
|
| 79 |
|
|
return false;
|
| 80 |
|
|
return true;
|
| 81 |
|
|
};
|
| 82 |
|
|
|
| 83 |
|
|
LLINE::~LLINE(void) {
|
| 84 |
|
|
for(int i=0; i<m_nlines; i++)
|
| 85 |
|
|
delete m_lines[i];
|
| 86 |
|
|
delete m_lines;
|
| 87 |
|
|
}
|
| 88 |
|
|
|
| 89 |
|
|
unsigned int LLINE::eval(const int lno) {
|
| 90 |
|
|
return (lno < m_nlines)?m_lines[lno]->eval(0) : DEFAULT_LINE;
|
| 91 |
|
|
}
|
| 92 |
|
|
|
| 93 |
|
|
// int m_op; // An operator
|
| 94 |
|
|
// AST *m_left, *m_right;
|
| 95 |
|
|
|
| 96 |
|
|
int AST_BRANCH::eval(void) {
|
| 97 |
|
|
int lft = m_left->eval(), rht = m_right->eval();
|
| 98 |
|
|
|
| 99 |
|
|
switch(m_op) {
|
| 100 |
|
|
case '+': return lft + rht;
|
| 101 |
|
|
case '-': return lft - rht;
|
| 102 |
|
|
case '*': return lft * rht;
|
| 103 |
|
|
case '/': return lft / rht;
|
| 104 |
|
|
case '%': return lft % rht;
|
| 105 |
|
|
case '^': return lft ^ rht;
|
| 106 |
|
|
case '|': return lft | rht;
|
| 107 |
|
|
case '&': return lft & rht;
|
| 108 |
|
|
case '~': return ~lft;
|
| 109 |
|
|
default: yyerror("Unknown operation"); return lft;
|
| 110 |
|
|
}
|
| 111 |
|
|
} void AST_BRANCH::reduce(void) {
|
| 112 |
|
|
if ((m_left)&&(m_left->m_node_type != 'N')&&(m_left->isdefined())) {
|
| 113 |
|
|
int val = m_left->eval();
|
| 114 |
|
|
delete m_left;
|
| 115 |
|
|
m_left = new AST_NUMBER(val);
|
| 116 |
|
|
} else
|
| 117 |
|
|
m_left->reduce();
|
| 118 |
|
|
if ((m_right)&&(m_right->m_node_type != 'N')&&(m_right->isdefined())) {
|
| 119 |
|
|
int val = m_right->eval();
|
| 120 |
|
|
delete m_right;
|
| 121 |
|
|
m_right = new AST_NUMBER(val);
|
| 122 |
|
|
} else
|
| 123 |
|
|
m_right->reduce();
|
| 124 |
|
|
}
|
| 125 |
|
|
|
| 126 |
|
|
AST_IDENTIFIER::AST_IDENTIFIER(AST *ida, const char *idb) {
|
| 127 |
|
|
m_node_type = 'I';
|
| 128 |
|
|
m_id = ((AST_IDENTIFIER*)ida)->m_id + "." + std::string(idb);
|
| 129 |
|
|
delete ida;
|
| 130 |
|
|
}
|
| 131 |
|
|
|
| 132 |
|
|
bool AST_IDENTIFIER::isdefined(void) {
|
| 133 |
|
|
bool answer = stb_isdefined(m_id);
|
| 134 |
|
|
return answer;
|
| 135 |
|
|
} int AST_IDENTIFIER::eval(void) {
|
| 136 |
|
|
return stb_value(m_id);
|
| 137 |
|
|
} void AST_IDENTIFIER::reduce(void) {}
|
| 138 |
|
|
|
| 139 |
|
|
bool AST_LABEL::isdefined(void) {
|
| 140 |
|
|
bool answer = stb_isdefined(m_label);
|
| 141 |
|
|
return answer;
|
| 142 |
|
|
} int AST_LABEL::eval(void) {
|
| 143 |
|
|
return stb_value(m_label);
|
| 144 |
|
|
} void AST_LABEL::reduce(void) {}
|
| 145 |
|
|
|
| 146 |
|
|
|
| 147 |
|
|
int AST_NUMBER::eval(void) {
|
| 148 |
|
|
return m_val;
|
| 149 |
|
|
} void AST_NUMBER::reduce(void) {}
|
| 150 |
|
|
|
| 151 |
|
|
void OBJFILE::open(const char *fname) {
|
| 152 |
|
|
if ((m_fp != NULL)||(m_pc != 0l)) {
|
| 153 |
|
|
fprintf(stderr, "Error: Can only change file names at startup\n");
|
| 154 |
|
|
exit(-2);
|
| 155 |
|
|
}
|
| 156 |
|
|
m_fp = fopen(fname, "w");
|
| 157 |
|
|
if (m_fp == NULL) {
|
| 158 |
|
|
fprintf(stderr, "Cannot open %s for writing\n", fname);
|
| 159 |
|
|
perror("O/S Err:");
|
| 160 |
|
|
m_fp = fopen("/dev/null","w");
|
| 161 |
|
|
}
|
| 162 |
|
|
}
|
| 163 |
|
|
|
| 164 |
|
|
void OBJFILE::operator+=(ASMLINE *ln) {
|
| 165 |
|
|
unsigned int buf[1];
|
| 166 |
|
|
int nlines = ln->nlines();
|
| 167 |
|
|
|
| 168 |
|
|
if (!ln->isdefined()) {
|
| 169 |
|
|
// fprintf(stderr, "%08x: Adding undefined line:\n", m_pc);
|
| 170 |
|
|
// ((TLINE *)ln)->dump(stderr);
|
| 171 |
|
|
m_tbl.insert(m_tbl.end(), SAVED_ASMLINE(m_pc,ln));
|
| 172 |
|
|
/*
|
| 173 |
|
|
} else {
|
| 174 |
|
|
fprintf(stderr, "%08x: Adding to file:\n", m_pc);
|
| 175 |
|
|
((TLINE *)ln)->dump(stderr);
|
| 176 |
|
|
*/
|
| 177 |
|
|
}
|
| 178 |
|
|
for(int i=0; i<nlines; i++) {
|
| 179 |
|
|
buf[0] = ln->eval(i);
|
| 180 |
|
|
if (m_fp) fwrite(buf, sizeof(ZIPI), 1, m_fp);
|
| 181 |
|
|
m_pc++;
|
| 182 |
|
|
}
|
| 183 |
|
|
}
|
| 184 |
|
|
|
| 185 |
|
|
bool OBJFILE::reduce(void) {
|
| 186 |
|
|
SVDTBL::iterator i;
|
| 187 |
|
|
bool all_reduced = true;
|
| 188 |
|
|
|
| 189 |
|
|
// printf("Checking for reductions\n");
|
| 190 |
|
|
unsigned int tmp = m_pc;
|
| 191 |
|
|
for(i=m_tbl.begin(); i != m_tbl.end(); i++) {
|
| 192 |
|
|
// printf("LINE %08x\n", i->m_pc);
|
| 193 |
|
|
ASMLINE *ln = i->m_ln;
|
| 194 |
|
|
m_pc = i->m_pc;
|
| 195 |
|
|
if (ln->isdefined()) {
|
| 196 |
|
|
// printf("PC = 0x%08x reduces\n", i->m_pc);
|
| 197 |
|
|
fseek(m_fp, sizeof(ZIPI)*i->m_pc, SEEK_SET);
|
| 198 |
|
|
for(int k=0; k< ln->nlines(); k++) {
|
| 199 |
|
|
ZIPI buf[1];
|
| 200 |
|
|
m_pc = i->m_pc+k;
|
| 201 |
|
|
buf[0] = ln->eval(k);
|
| 202 |
|
|
// printf("\t0x%08x -> %08x\n", i->m_pc+k,
|
| 203 |
|
|
// buf[0]);
|
| 204 |
|
|
fwrite(buf, sizeof(ZIPI), 1, m_fp);
|
| 205 |
|
|
}
|
| 206 |
|
|
} else {
|
| 207 |
26 |
dgisselq |
fprintf(stderr, "Line %d contains an undefined symbol: ", ln->m_lineno);
|
| 208 |
13 |
dgisselq |
fprintf(stderr, "PC = 0x%08x isn\'t ready yet\n", i->m_pc);
|
| 209 |
|
|
i->m_ln->dump(stderr);
|
| 210 |
|
|
all_reduced = false;
|
| 211 |
|
|
}
|
| 212 |
|
|
} m_pc = tmp;
|
| 213 |
|
|
return all_reduced;
|
| 214 |
|
|
}
|
| 215 |
|
|
|
| 216 |
|
|
bool fitsin(const int v, const int b) {
|
| 217 |
|
|
if (v>0)
|
| 218 |
|
|
return (v < (1<<(b-1)));
|
| 219 |
|
|
else
|
| 220 |
|
|
return (-v <= (1<<b));
|
| 221 |
|
|
}
|
| 222 |
|
|
|
| 223 |
|
|
#define BLD_DUALOP(OP) \
|
| 224 |
|
|
if (m_opa == zp.ZIP_Rnone) \
|
| 225 |
|
|
yyerror("Err: Dual Ops need a result register"); \
|
| 226 |
|
|
if (m_opb != zp.ZIP_Rnone) { \
|
| 227 |
|
|
if(!fitsin(imm, 16)) \
|
| 228 |
|
|
yyerror("16-bit: Immediate out of range"); \
|
| 229 |
|
|
in = zp.OP(m_cond,imm,m_opb,m_opa); \
|
| 230 |
|
|
} else { \
|
| 231 |
|
|
if(!fitsin(imm, 20)) \
|
| 232 |
|
|
yyerror("20-bit: Immediate out of range"); \
|
| 233 |
|
|
in = zp.OP(m_cond,imm,m_opa); \
|
| 234 |
|
|
}
|
| 235 |
|
|
|
| 236 |
|
|
#define BLD_BRANCH(OP,CND) \
|
| 237 |
|
|
if (fitsin(offset, 16)) \
|
| 238 |
|
|
in = zp.OP(offset); \
|
| 239 |
|
|
else if (fitsin(offset, 20)) \
|
| 240 |
|
|
in = zp.op_add(zp.CND, offset, zp.ZIP_PC); \
|
| 241 |
|
|
else { in = zp.OP(offset); yyerror("LONG JUMP NOT SUPPORTED"); }
|
| 242 |
|
|
|
| 243 |
|
|
ASMLINE *TLINE::eval(void) {
|
| 244 |
|
|
ZIPI in;
|
| 245 |
|
|
ZPARSER zp;
|
| 246 |
|
|
int offset = 0, imm = 0;
|
| 247 |
|
|
|
| 248 |
|
|
if (m_opcode != OP_MOV) {
|
| 249 |
|
|
if ( ((m_opa!=zp.ZIP_Rnone)&&(m_opa > zp.ZIP_PC))
|
| 250 |
|
|
|| ((m_opb!=zp.ZIP_Rnone)&&(m_opb > zp.ZIP_PC)) )
|
| 251 |
|
|
yyerror("Only move instructions can reference user regs");
|
| 252 |
|
|
}
|
| 253 |
|
|
|
| 254 |
|
|
// Offset used in jumps
|
| 255 |
|
|
if (m_imm) {
|
| 256 |
|
|
imm = m_imm->eval();
|
| 257 |
|
|
offset = imm-objcode.pc()-1;
|
| 258 |
|
|
|
| 259 |
|
|
if (m_opb == zp.ZIP_PC)
|
| 260 |
|
|
imm = offset;
|
| 261 |
|
|
}
|
| 262 |
|
|
|
| 263 |
|
|
switch(m_opcode) {
|
| 264 |
|
|
case OP_CMP:
|
| 265 |
|
|
BLD_DUALOP(op_cmp)
|
| 266 |
|
|
break;
|
| 267 |
|
|
case OP_TST:
|
| 268 |
|
|
BLD_DUALOP(op_tst)
|
| 269 |
|
|
break;
|
| 270 |
|
|
case OP_MOV:
|
| 271 |
|
|
if ((m_opa == zp.ZIP_Rnone)||(m_opb == zp.ZIP_Rnone)) {
|
| 272 |
|
|
yyerror("Moves can only occurr between registers");
|
| 273 |
|
|
fprintf(stderr, "m_opa = %d, m_opb = %d\n", m_opa, m_opb);
|
| 274 |
|
|
fprintf(stderr, "m_imm = %d\n", imm);
|
| 275 |
|
|
} else if (!fitsin(imm, 16))
|
| 276 |
|
|
yyerror("Immediate overflow on move");
|
| 277 |
|
|
in = zp.op_mov(m_cond, imm, m_opb, m_opa);
|
| 278 |
|
|
break;
|
| 279 |
|
|
case OP_LDIHI:
|
| 280 |
|
|
if ((imm & (-1<<16))!=0)
|
| 281 |
|
|
yyerror("16-bit Immediate out of range");
|
| 282 |
|
|
if (m_opb != zp.ZIP_Rnone)
|
| 283 |
|
|
yyerror("LDIHI cannot accept OP-B registers");
|
| 284 |
|
|
if (m_opa == zp.ZIP_Rnone)
|
| 285 |
|
|
yyerror("LDIHI needs a register result");
|
| 286 |
|
|
in = zp.op_ldihi(m_cond, imm, m_opa);
|
| 287 |
|
|
break;
|
| 288 |
|
|
case OP_LDILO:
|
| 289 |
|
|
if ((imm & (-1<<16))!=0)
|
| 290 |
|
|
yyerror("16-bit Immediate out of range");
|
| 291 |
|
|
if (m_opb != zp.ZIP_Rnone)
|
| 292 |
|
|
yyerror("LDIHI cannot accept OP-B registers");
|
| 293 |
|
|
if (m_opa == zp.ZIP_Rnone)
|
| 294 |
|
|
yyerror("LDIHI needs a register result");
|
| 295 |
|
|
if ((imm & (-1<<16))!=0)
|
| 296 |
|
|
yyerror("16-bit Immediate out of range");
|
| 297 |
|
|
in = zp.op_ldilo(m_cond, imm, m_opa);
|
| 298 |
|
|
break;
|
| 299 |
26 |
dgisselq |
case OP_MPYU:
|
| 300 |
|
|
if ((m_opb == zp.ZIP_PC)||(m_opb == zp.ZIP_CC)
|
| 301 |
|
|
||(m_opa == zp.ZIP_PC)||(m_opa == zp.ZIP_CC))
|
| 302 |
|
|
yyerror("MPYU does not support PC or CC register operands or results");
|
| 303 |
|
|
else if (m_opb == zp.ZIP_Rnone)
|
| 304 |
|
|
in = zp.op_mpyu(m_cond, imm, m_opa);
|
| 305 |
|
|
else
|
| 306 |
|
|
in = zp.op_mpyu(m_cond, imm, m_opb, m_opa);
|
| 307 |
13 |
dgisselq |
break;
|
| 308 |
26 |
dgisselq |
case OP_MPYS:
|
| 309 |
|
|
if ((m_opb == zp.ZIP_PC)||(m_opb == zp.ZIP_CC)
|
| 310 |
|
|
||(m_opa == zp.ZIP_PC)||(m_opa == zp.ZIP_CC))
|
| 311 |
|
|
yyerror("MPYS does not support PC or CC register operands or results");
|
| 312 |
|
|
else if (m_opb == zp.ZIP_Rnone)
|
| 313 |
|
|
in = zp.op_mpys(m_cond, imm, m_opa);
|
| 314 |
|
|
else
|
| 315 |
|
|
in = zp.op_mpys(m_cond, imm, m_opb, m_opa);
|
| 316 |
|
|
break;
|
| 317 |
13 |
dgisselq |
case OP_ROL:
|
| 318 |
|
|
if (m_opa == zp.ZIP_Rnone)
|
| 319 |
|
|
yyerror("ROL needs a register result");
|
| 320 |
|
|
if (m_opb != zp.ZIP_Rnone)
|
| 321 |
|
|
in = zp.op_rol(m_cond, imm, m_opb, m_opa);
|
| 322 |
|
|
else
|
| 323 |
|
|
in = zp.op_rol(m_cond, imm, m_opa);
|
| 324 |
|
|
break;
|
| 325 |
|
|
case OP_SUB:
|
| 326 |
|
|
BLD_DUALOP(op_sub)
|
| 327 |
|
|
break;
|
| 328 |
|
|
case OP_AND:
|
| 329 |
|
|
BLD_DUALOP(op_and)
|
| 330 |
|
|
break;
|
| 331 |
|
|
case OP_ADD:
|
| 332 |
|
|
BLD_DUALOP(op_add)
|
| 333 |
|
|
break;
|
| 334 |
|
|
case OP_OR:
|
| 335 |
|
|
BLD_DUALOP(op_or)
|
| 336 |
|
|
break;
|
| 337 |
|
|
case OP_XOR:
|
| 338 |
|
|
BLD_DUALOP(op_xor)
|
| 339 |
|
|
break;
|
| 340 |
|
|
case OP_LSL:
|
| 341 |
|
|
BLD_DUALOP(op_lsl)
|
| 342 |
|
|
break;
|
| 343 |
|
|
case OP_ASR:
|
| 344 |
|
|
BLD_DUALOP(op_asr)
|
| 345 |
|
|
break;
|
| 346 |
|
|
case OP_LSR:
|
| 347 |
|
|
BLD_DUALOP(op_lsr)
|
| 348 |
|
|
break;
|
| 349 |
|
|
case OP_LOD:
|
| 350 |
|
|
if (m_opb != zp.ZIP_Rnone)
|
| 351 |
|
|
in = zp.op_lod(m_cond, imm, m_opb, m_opa);
|
| 352 |
|
|
else
|
| 353 |
|
|
in = zp.op_lod(m_cond, imm, m_opa);
|
| 354 |
|
|
break;
|
| 355 |
|
|
case OP_STO:
|
| 356 |
|
|
if (m_opb != zp.ZIP_Rnone)
|
| 357 |
|
|
in = zp.op_sto(m_cond, m_opa, imm, m_opb);
|
| 358 |
|
|
else
|
| 359 |
|
|
in = zp.op_sto(m_cond, m_opa, imm);
|
| 360 |
|
|
break;
|
| 361 |
|
|
case OP_LDI:
|
| 362 |
|
|
if ((!fitsin(imm, 24))||(m_cond != zp.ZIPC_ALWAYS)) {
|
| 363 |
|
|
if (m_opa == zp.ZIP_PC)
|
| 364 |
|
|
yyerror("Cannot LDI 32-bit addresses into PC register!");
|
| 365 |
|
|
LLINE *lln = new LLINE;
|
| 366 |
|
|
lln->addline(new ILINE(zp.op_ldihi(m_cond, (imm>>16)&0x0ffff, m_opa)));
|
| 367 |
|
|
lln->addline(new ILINE(zp.op_ldilo(m_cond, imm&0x0ffff, m_opa)));
|
| 368 |
26 |
dgisselq |
lln->m_lineno = m_lineno;
|
| 369 |
13 |
dgisselq |
return lln;
|
| 370 |
|
|
} else
|
| 371 |
|
|
in = zp.op_ldi(imm, m_opa);
|
| 372 |
|
|
break;
|
| 373 |
|
|
case OP_CLRF:
|
| 374 |
|
|
in = zp.op_clrf(m_cond, m_opb);
|
| 375 |
|
|
break;
|
| 376 |
|
|
case OP_NOT:
|
| 377 |
|
|
in = zp.op_not(m_cond, m_opb);
|
| 378 |
|
|
break;
|
| 379 |
26 |
dgisselq |
case OP_NEG:
|
| 380 |
|
|
if (m_cond != zp.ZIPC_ALWAYS) {
|
| 381 |
|
|
yyerror("Illegal operation: Conditional negate. Negates cannot handle conditions");
|
| 382 |
|
|
} else {
|
| 383 |
|
|
LLINE *lln = new LLINE;
|
| 384 |
|
|
lln->addline(new ILINE(zp.op_not(m_opb)));
|
| 385 |
|
|
lln->addline(new ILINE(zp.op_add(1,m_opb)));
|
| 386 |
|
|
return lln;
|
| 387 |
|
|
}break;
|
| 388 |
13 |
dgisselq |
case OP_JMP:
|
| 389 |
|
|
if (!fitsin(imm, 16))
|
| 390 |
|
|
yyerror("JMP: Immediate out of range");
|
| 391 |
|
|
else if (m_opb == zp.ZIP_Rnone) {
|
| 392 |
|
|
if (m_cond != zp.ZIPC_ALWAYS)
|
| 393 |
|
|
yyerror("JMP: Conditions are not allowed for absolute jumps.");
|
| 394 |
|
|
imm &= (1<<24)-1;
|
| 395 |
|
|
if (!fitsin(imm, 24))
|
| 396 |
|
|
yyerror("JMP: Absolute jump address out of range");
|
| 397 |
|
|
zp.op_ldi(imm, zp.ZIP_PC);
|
| 398 |
|
|
}
|
| 399 |
|
|
in = zp.op_mov(m_cond, imm, m_opb, zp.ZIP_PC);
|
| 400 |
|
|
case OP_BRA:
|
| 401 |
|
|
BLD_BRANCH(op_bra,ZIPC_ALWAYS)
|
| 402 |
|
|
break;
|
| 403 |
|
|
case OP_BZ:
|
| 404 |
|
|
BLD_BRANCH(op_brz,ZIPC_Z)
|
| 405 |
|
|
break;
|
| 406 |
|
|
case OP_BNZ:
|
| 407 |
|
|
BLD_BRANCH(op_bnz,ZIPC_NZ)
|
| 408 |
|
|
break;
|
| 409 |
|
|
case OP_BGE:
|
| 410 |
|
|
BLD_BRANCH(op_bge,ZIPC_GE)
|
| 411 |
|
|
break;
|
| 412 |
|
|
case OP_BGT:
|
| 413 |
|
|
BLD_BRANCH(op_bgt,ZIPC_GT)
|
| 414 |
|
|
break;
|
| 415 |
|
|
case OP_BLT:
|
| 416 |
|
|
BLD_BRANCH(op_blt,ZIPC_LT)
|
| 417 |
|
|
break;
|
| 418 |
|
|
case OP_BRC:
|
| 419 |
|
|
BLD_BRANCH(op_brc,ZIPC_C)
|
| 420 |
|
|
break;
|
| 421 |
|
|
case OP_BRV:
|
| 422 |
|
|
BLD_BRANCH(op_brv,ZIPC_V)
|
| 423 |
|
|
break;
|
| 424 |
|
|
case OP_CLR:
|
| 425 |
|
|
in = zp.op_clr(m_opb);
|
| 426 |
|
|
break;
|
| 427 |
|
|
case OP_TRAP:
|
| 428 |
|
|
if((m_opb == zp.ZIP_Rnone)&&(m_cond == zp.ZIPC_ALWAYS))
|
| 429 |
|
|
in = zp.op_ldi(imm, zp.ZIP_CC);
|
| 430 |
|
|
else if((m_opb == zp.ZIP_Rnone)&&((imm&0x0ffff)==imm))
|
| 431 |
|
|
in = zp.op_ldilo(imm, zp.ZIP_CC);
|
| 432 |
|
|
else if((m_opb != zp.ZIP_Rnone)&&(fitsin(imm, 16)))
|
| 433 |
|
|
in = zp.op_mov(m_cond, imm, m_opb, zp.ZIP_CC);
|
| 434 |
|
|
else {
|
| 435 |
|
|
yyerror("Illegal trap!");
|
| 436 |
|
|
in = zp.op_trap(m_cond, 0);
|
| 437 |
|
|
}
|
| 438 |
|
|
break;
|
| 439 |
|
|
case OP_HALT: in = zp.op_halt(m_cond); break;
|
| 440 |
|
|
case OP_RTU: in = zp.op_rtu(m_cond); break;
|
| 441 |
|
|
case OP_BUSY: in = zp.op_busy(m_cond); break;
|
| 442 |
|
|
case OP_BREAK: in = zp.op_break(); break;
|
| 443 |
|
|
case OP_NOOP: in = zp.op_noop(); break;
|
| 444 |
|
|
// OP_LJMP:
|
| 445 |
|
|
case OP_NONE:
|
| 446 |
|
|
default: { char ebuf[256]; sprintf(ebuf, "Unrecognized OP-Code, %d, NONE = %d, CLR=%d", m_opcode, OP_NONE, OP_CLR);
|
| 447 |
|
|
yyerror(ebuf);
|
| 448 |
|
|
in = zp.op_noop(); break;
|
| 449 |
|
|
}
|
| 450 |
26 |
dgisselq |
}
|
| 451 |
|
|
ILINE *rs = new ILINE(in);
|
| 452 |
|
|
rs->m_lineno = m_lineno;
|
| 453 |
13 |
dgisselq |
}
|
| 454 |
|
|
|
| 455 |
|
|
int TLINE::nlines(void) {
|
| 456 |
|
|
if ((m_opcode == OP_LDI)&&( (!(m_imm->isdefined()))
|
| 457 |
|
|
|| (m_cond != ZPARSER::ZIPC_ALWAYS)
|
| 458 |
|
|
|| (!fitsin(m_imm->eval(), 24)) )) {
|
| 459 |
|
|
return 2;
|
| 460 |
|
|
}
|
| 461 |
|
|
return 1;
|
| 462 |
|
|
}
|
| 463 |
|
|
|
| 464 |
|
|
unsigned int TLINE::eval(const int lno) {
|
| 465 |
|
|
if (!isdefined())
|
| 466 |
|
|
return DEFAULT_LINE;
|
| 467 |
|
|
else {
|
| 468 |
|
|
ASMLINE *ln = this->eval();
|
| 469 |
|
|
unsigned int val = ln->eval(lno);
|
| 470 |
|
|
delete ln;
|
| 471 |
|
|
return val;
|
| 472 |
|
|
}
|
| 473 |
|
|
}
|
| 474 |
|
|
|
| 475 |
|
|
void TLINE::dump(FILE *fp) {
|
| 476 |
|
|
if (m_state == 'V')
|
| 477 |
26 |
dgisselq |
fprintf(fp, "Void @%d\n", m_lineno);
|
| 478 |
13 |
dgisselq |
else if (m_state != 'T')
|
| 479 |
|
|
fprintf(fp, "TLINE state != T (== %c)\n", m_state);
|
| 480 |
|
|
else {
|
| 481 |
26 |
dgisselq |
fprintf(fp, "TLINE @%d\n", m_lineno);
|
| 482 |
13 |
dgisselq |
switch(m_opcode) {
|
| 483 |
|
|
case OP_CMP: fprintf(fp, "\tTLINE OP = CMP\n");
|
| 484 |
|
|
break;
|
| 485 |
|
|
case OP_TST: fprintf(fp, "\tTLINE OP = TST\n");
|
| 486 |
|
|
break;
|
| 487 |
|
|
case OP_MOV: fprintf(fp, "\tTLINE OP = MOV\n");
|
| 488 |
|
|
break;
|
| 489 |
26 |
dgisselq |
case OP_LDIHI:fprintf(fp,"\tTLINE OP = LDIHI\n");
|
| 490 |
13 |
dgisselq |
break;
|
| 491 |
26 |
dgisselq |
case OP_LDILO:fprintf(fp,"\tTLINE OP = LDILO\n");
|
| 492 |
13 |
dgisselq |
break;
|
| 493 |
26 |
dgisselq |
case OP_MPYU: fprintf(fp,"\tTLINE OP = MPYU\n");
|
| 494 |
13 |
dgisselq |
break;
|
| 495 |
26 |
dgisselq |
case OP_MPYS: fprintf(fp,"\tTLINE OP = MPYS\n");
|
| 496 |
|
|
break;
|
| 497 |
13 |
dgisselq |
case OP_ROL: fprintf(fp, "\tTLINE OP = ROL\n");
|
| 498 |
|
|
break;
|
| 499 |
|
|
case OP_SUB: fprintf(fp, "\tTLINE OP = SUB\n");
|
| 500 |
|
|
break;
|
| 501 |
|
|
case OP_AND: fprintf(fp, "\tTLINE OP = AND\n");
|
| 502 |
|
|
break;
|
| 503 |
|
|
case OP_ADD: fprintf(fp, "\tTLINE OP = ADD\n");
|
| 504 |
|
|
break;
|
| 505 |
|
|
case OP_OR: fprintf(fp, "\tTLINE OP = OR\n");
|
| 506 |
|
|
break;
|
| 507 |
|
|
case OP_XOR: fprintf(fp, "\tTLINE OP = XOR\n");
|
| 508 |
|
|
break;
|
| 509 |
|
|
case OP_LSL: fprintf(fp, "\tTLINE OP = LSL\n");
|
| 510 |
|
|
break;
|
| 511 |
|
|
case OP_ASR: fprintf(fp, "\tTLINE OP = ASR\n");
|
| 512 |
|
|
break;
|
| 513 |
|
|
case OP_LSR: fprintf(fp, "\tTLINE OP = LSR\n");
|
| 514 |
|
|
break;
|
| 515 |
|
|
case OP_LOD: fprintf(fp, "\tTLINE OP = LOD\n");
|
| 516 |
|
|
break;
|
| 517 |
|
|
case OP_STO: fprintf(fp, "\tTLINE OP = STO\n");
|
| 518 |
|
|
break;
|
| 519 |
|
|
case OP_LDI: fprintf(fp, "\tTLINE OP = LDI\n");
|
| 520 |
|
|
break;
|
| 521 |
|
|
case OP_CLRF: fprintf(fp, "\tTLINE OP = CLRF\n");
|
| 522 |
|
|
break;
|
| 523 |
|
|
case OP_NOT: fprintf(fp, "\tTLINE OP = NOT\n");
|
| 524 |
|
|
break;
|
| 525 |
|
|
case OP_JMP: fprintf(fp, "\tTLINE OP = JMP\n");
|
| 526 |
|
|
break;
|
| 527 |
|
|
case OP_BRA: fprintf(fp, "\tTLINE OP = BRA\n");
|
| 528 |
|
|
break;
|
| 529 |
|
|
case OP_BZ:
|
| 530 |
|
|
case OP_BNZ:
|
| 531 |
|
|
case OP_BGE:
|
| 532 |
|
|
case OP_BGT:
|
| 533 |
|
|
case OP_BLT:
|
| 534 |
|
|
case OP_BRC:
|
| 535 |
|
|
case OP_BRV:
|
| 536 |
|
|
fprintf(fp, "\tTLINE OP = BRA.C\n");
|
| 537 |
|
|
break;
|
| 538 |
|
|
case OP_CLR: fprintf(fp, "\tTLINE OP = CLR\n");
|
| 539 |
|
|
break;
|
| 540 |
26 |
dgisselq |
case OP_NEG: fprintf(fp, "\tTLINE OP = NEG\n");
|
| 541 |
|
|
break;
|
| 542 |
13 |
dgisselq |
case OP_TRAP: fprintf(fp, "\tTLINE OP = TRAP\n");
|
| 543 |
|
|
break;
|
| 544 |
|
|
case OP_HALT: fprintf(fp, "\tTLINE OP = HALT\n");
|
| 545 |
|
|
break;
|
| 546 |
|
|
case OP_RTU: fprintf(fp, "\tTLINE OP = RTU\n");
|
| 547 |
|
|
break;
|
| 548 |
|
|
case OP_BUSY: fprintf(fp, "\tTLINE OP = BUSY\n");
|
| 549 |
|
|
break;
|
| 550 |
|
|
case OP_BREAK: fprintf(fp, "\tTLINE OP = BREAK\n");
|
| 551 |
|
|
break;
|
| 552 |
|
|
case OP_NOOP: fprintf(fp, "\tTLINE OP = NOOP\n");
|
| 553 |
|
|
break;
|
| 554 |
|
|
// OP_LJMP:
|
| 555 |
|
|
case OP_NONE:
|
| 556 |
|
|
default:
|
| 557 |
|
|
fprintf(fp, "\tTLINE OP = (Unrecognized, %d)\n", m_opcode);
|
| 558 |
|
|
break;
|
| 559 |
|
|
}
|
| 560 |
|
|
fprintf(fp, "\tTLINE COND = %d\n", m_cond);
|
| 561 |
|
|
if (m_imm == NULL)
|
| 562 |
|
|
fprintf(fp, "\tTLINE imm = (NULL)\n");
|
| 563 |
|
|
else if (!m_imm->isdefined()) {
|
| 564 |
|
|
m_imm->reduce();
|
| 565 |
|
|
fprintf(fp, "\tTLINE imm = ");
|
| 566 |
|
|
m_imm->dump(fp);
|
| 567 |
|
|
fprintf(fp, "\n");
|
| 568 |
|
|
} else
|
| 569 |
|
|
fprintf(fp, "\tTLINE imm = %d\n", m_imm->eval());
|
| 570 |
|
|
fprintf(fp, "\tTLINE opb = %d\n", m_opb);
|
| 571 |
|
|
fprintf(fp, "\tTLINE opa = %d\n", m_opa);
|
| 572 |
|
|
}
|
| 573 |
|
|
}
|
| 574 |
|
|
|
| 575 |
|
|
|
| 576 |
|
|
// Now, for our symbol table
|
| 577 |
|
|
class SYMTABLE_ENTRY {
|
| 578 |
|
|
private:
|
| 579 |
|
|
int m_recursion_check;
|
| 580 |
|
|
|
| 581 |
|
|
std::string &trim(std::string &s) {
|
| 582 |
|
|
std::string::iterator ptr = s.end()-1;
|
| 583 |
|
|
|
| 584 |
|
|
while((ptr >= s.begin())&&(isspace(*ptr)))
|
| 585 |
|
|
*ptr-- = '\0';
|
| 586 |
|
|
if (*ptr == ':')
|
| 587 |
|
|
*ptr-- = '\0';
|
| 588 |
|
|
|
| 589 |
|
|
// printf("STORING: %s\n", s.c_str());
|
| 590 |
|
|
|
| 591 |
|
|
return s;
|
| 592 |
|
|
}
|
| 593 |
|
|
|
| 594 |
|
|
public:
|
| 595 |
|
|
std::string m_name;
|
| 596 |
|
|
AST *m_value;
|
| 597 |
|
|
SYMTABLE_ENTRY(const char *str) : m_recursion_check(0), m_name(str), m_value(NULL) {
|
| 598 |
|
|
trim(m_name);
|
| 599 |
|
|
} SYMTABLE_ENTRY(const char *str, AST *v) : m_recursion_check(0), m_name(str), m_value(v) {
|
| 600 |
|
|
trim(m_name);
|
| 601 |
|
|
} ~SYMTABLE_ENTRY(void) {
|
| 602 |
|
|
delete m_value;
|
| 603 |
|
|
}
|
| 604 |
|
|
|
| 605 |
|
|
SYMTABLE_ENTRY &operator=(AST *new_value) {
|
| 606 |
|
|
if (m_value)
|
| 607 |
|
|
delete m_value;
|
| 608 |
|
|
m_value = new_value;
|
| 609 |
|
|
}
|
| 610 |
|
|
|
| 611 |
|
|
bool isdefined(void) {
|
| 612 |
|
|
if (m_recursion_check > 0) {
|
| 613 |
|
|
fprintf(stderr, "RECURSION DETECTED! Symbol: %s\n",
|
| 614 |
|
|
m_name.c_str());
|
| 615 |
|
|
return false;
|
| 616 |
|
|
}
|
| 617 |
|
|
m_recursion_check = 1;
|
| 618 |
|
|
if (m_value->m_node_type != 'N')
|
| 619 |
|
|
m_value->reduce();
|
| 620 |
|
|
bool answer = m_value->isdefined();
|
| 621 |
|
|
m_recursion_check = 0;
|
| 622 |
|
|
return answer;
|
| 623 |
|
|
}
|
| 624 |
|
|
int val(void) {
|
| 625 |
|
|
if ((m_value->isdefined())&&(m_value->m_node_type != 'N')) {
|
| 626 |
|
|
int v = m_value->eval();
|
| 627 |
|
|
AST *tmp;
|
| 628 |
|
|
tmp = m_value;
|
| 629 |
|
|
m_value = new AST_NUMBER(v);
|
| 630 |
|
|
delete tmp;
|
| 631 |
|
|
} return (m_value->eval());
|
| 632 |
|
|
}
|
| 633 |
|
|
void dump(FILE *fp) { m_value->dump(fp); }
|
| 634 |
|
|
};
|
| 635 |
|
|
|
| 636 |
|
|
class SYMBOL_TABLE {
|
| 637 |
|
|
private:
|
| 638 |
|
|
typedef SYMTABLE_ENTRY *TBLV;
|
| 639 |
|
|
typedef std::list<TBLV> TBLT;
|
| 640 |
|
|
|
| 641 |
|
|
TBLT m_tbl;
|
| 642 |
|
|
|
| 643 |
|
|
TBLT::iterator lookup(const char *str) {
|
| 644 |
|
|
TBLT::iterator i = m_tbl.begin();
|
| 645 |
|
|
for(; (i!=m_tbl.end())&&(strcmp(str, (*i)->m_name.c_str())>0);
|
| 646 |
|
|
i++)
|
| 647 |
|
|
;
|
| 648 |
|
|
if ((i != m_tbl.end())&&(strcmp(str,(*i)->m_name.c_str())==0))
|
| 649 |
|
|
return i;
|
| 650 |
|
|
return m_tbl.end();
|
| 651 |
|
|
}
|
| 652 |
|
|
|
| 653 |
|
|
public:
|
| 654 |
|
|
SYMBOL_TABLE(void) {}
|
| 655 |
|
|
~SYMBOL_TABLE(void) {
|
| 656 |
|
|
TBLT::iterator i = m_tbl.begin();
|
| 657 |
|
|
while(i != m_tbl.end()) {
|
| 658 |
|
|
delete (*i);
|
| 659 |
|
|
m_tbl.erase(i);
|
| 660 |
|
|
}
|
| 661 |
|
|
}
|
| 662 |
|
|
|
| 663 |
|
|
void define(const char *key, AST *value) {
|
| 664 |
|
|
SYMTABLE_ENTRY *v = new SYMTABLE_ENTRY(key, value);
|
| 665 |
|
|
TBLT::iterator i = m_tbl.begin();
|
| 666 |
|
|
for(; (i!=m_tbl.end())&&(strcmp(key, (*i)->m_name.c_str())>0);
|
| 667 |
|
|
i++)
|
| 668 |
|
|
;
|
| 669 |
|
|
m_tbl.insert(i, v);
|
| 670 |
|
|
|
| 671 |
|
|
/*
|
| 672 |
|
|
fprintf(stderr, "Defining: %s = ", key);
|
| 673 |
|
|
value->dump(stderr);
|
| 674 |
|
|
fprintf(stderr, "\n");
|
| 675 |
|
|
*/
|
| 676 |
|
|
}
|
| 677 |
|
|
|
| 678 |
|
|
bool isdefined(const char *key) {
|
| 679 |
|
|
TBLT::iterator i = lookup(key);
|
| 680 |
|
|
if (i == m_tbl.end()) {
|
| 681 |
|
|
// fprintf(stderr, "%s is not in the symbol table\n", key);
|
| 682 |
|
|
return false;
|
| 683 |
|
|
} else {
|
| 684 |
|
|
bool defined = (*i)->isdefined();
|
| 685 |
|
|
/*
|
| 686 |
|
|
if (!defined) {
|
| 687 |
|
|
fprintf(stderr, "KEY: %s = ", key);
|
| 688 |
|
|
(*i)->dump(stderr);
|
| 689 |
|
|
fprintf(stderr, " is not yet defined\n");
|
| 690 |
|
|
} */
|
| 691 |
|
|
return (*i)->isdefined();
|
| 692 |
|
|
}
|
| 693 |
|
|
}
|
| 694 |
|
|
|
| 695 |
|
|
int value(const char *key) {
|
| 696 |
|
|
TBLT::iterator i = lookup(key);
|
| 697 |
|
|
if (i == m_tbl.end())
|
| 698 |
|
|
return 0;
|
| 699 |
|
|
else
|
| 700 |
|
|
return (*i)->val();
|
| 701 |
|
|
}
|
| 702 |
|
|
};
|
| 703 |
|
|
|
| 704 |
|
|
SYMBOL_TABLE *global_context = NULL, *file_context = NULL;
|
| 705 |
|
|
|
| 706 |
|
|
bool stb_isdefined(const char *key) {
|
| 707 |
|
|
if ((file_context)&&(file_context->isdefined(key)))
|
| 708 |
|
|
return true;
|
| 709 |
|
|
else
|
| 710 |
|
|
return global_context->isdefined(key);
|
| 711 |
|
|
} int stb_value(const char *key) {
|
| 712 |
|
|
if (file_context->isdefined(key))
|
| 713 |
|
|
return file_context->value(key);
|
| 714 |
|
|
else
|
| 715 |
|
|
return global_context->value(key);
|
| 716 |
|
|
} void stb_define(const char *key, AST *value) {
|
| 717 |
|
|
file_context->define(key, value);
|
| 718 |
|
|
} void gbl_define(const char *key, AST *value) {
|
| 719 |
|
|
global_context->define(key, value);
|
| 720 |
|
|
}
|
| 721 |
|
|
|
| 722 |
|
|
void create_new_context(void) {
|
| 723 |
|
|
if (global_context == NULL)
|
| 724 |
|
|
global_context = new SYMBOL_TABLE;
|
| 725 |
|
|
if (file_context != NULL)
|
| 726 |
|
|
delete file_context;
|
| 727 |
|
|
file_context = new SYMBOL_TABLE;
|
| 728 |
|
|
}
|
| 729 |
|
|
|
| 730 |
|
|
|
| 731 |
|
|
// Convenience functions for accessing the symbol table
|
| 732 |
|
|
bool stb_isdefined(const std::string &key) {
|
| 733 |
|
|
bool answer = stb_isdefined(key.c_str());
|
| 734 |
|
|
return answer;
|
| 735 |
|
|
} int stb_value(const std::string &key) {
|
| 736 |
|
|
return stb_value(key.c_str());
|
| 737 |
|
|
} void stb_define(const std::string &key, AST *value) {
|
| 738 |
|
|
stb_define(key.c_str(), value);
|
| 739 |
|
|
} void gbl_define(const std::string &key, AST *value) {
|
| 740 |
|
|
gbl_define(key.c_str(), value);
|
| 741 |
|
|
}
|
| 742 |
|
|
|
| 743 |
|
|
|
