1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
|
/*
* MONA
* Copyright (C) 1997-2004 BRICS.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#include <iostream>
#include "code.h"
#include "offsets.h"
#include "symboltable.h"
#include "env.h"
extern "C" {
#include "../Mem/mem.h"
}
using std::cout;
extern Options options;
extern SymbolTable symbolTable;
////////// stateSpaces ////////////////////////////////////////////////////////
void
dumpStateSpaces(SSSet set)
{
unsigned i, j = 0;
cout << "[";
for (i = 0; i < guide.numSs; i++)
if (set[i])
j++;
if (j > 5)
cout << "...";
else {
for (i = 0; i < guide.numSs; i++)
if (set[i]) {
cout << i;
break;
}
for (i++; i < guide.numSs; i++)
if (set[i])
cout << "," << i;
}
cout << "]";
mem_free(set);
}
void
dumpStateSpaces(Ident id)
{
if (options.mode != TREE)
return;
dumpStateSpaces(stateSpaces(id));
}
/////////// VarCode ///////////////////////////////////////////////////////////
void
VarCode::dump(bool rec)
{
code->dump(rec);
dumpsubst();
}
void
VarCode::dumpsubst()
{
IdentList::iterator i,j;
bool first = true, any = false;
for (i = code->vars.begin(), j = vars->begin();
i != code->vars.end(); i++, j++)
if (*i != *j)
any = true;
if (any) {
cout << "[";
for (i = code->vars.begin(), j = vars->begin();
i != code->vars.end(); i++, j++)
if (*i != *j) {
if (!first)
cout << ",";
cout << "#" << *i << "->#" << *j;
first = false;
}
cout << "]";
}
}
void
VarCodeList::dump()
{
cout << "[";
for (VarCodeList::iterator i = begin(); i != end(); i++) {
if (i != begin())
cout << ",";
printf("(%x,", (unsigned) (*i).code);
if ((*i).vars)
(*i).vars->dumplist();
printf(")");
}
cout << "]";
}
/////////// Code //////////////////////////////////////////////////////////////
void
Code::viz()
{
if (!mark) {
printf(" L%x [label=\"", (unsigned) this);
dump(false);
// printf(" {%d}", refs);
printf("\"];\n");
mark = true;
}
}
void
Code_c::viz()
{
if (!mark) {
vc.code->viz();
Code::viz();
printf(" L%x -> L%x [label=\"", (unsigned) this, (unsigned) vc.code);
vc.dumpsubst();
printf("\"];\n");
mark = true;
}
}
void
Code_cc::viz()
{
if (!mark) {
vc1.code->viz();
vc2.code->viz();
Code::viz();
printf(" L%x -> L%x [label=\"", (unsigned) this, (unsigned) vc1.code);
vc1.dumpsubst();
printf("\"];\n");
printf(" L%x -> L%x [label=\"", (unsigned) this, (unsigned) vc2.code);
vc2.dumpsubst();
printf("\"];\n");
mark = true;
}
}
void
Code::show()
{
dump(false);
cout << "\n";
}
/////////// Code leaves ///////////////////////////////////////////////////////
void
Code_True::dump(bool rec)
{
cout << "True()";
}
void
Code_False::dump(bool rec)
{
cout << "False()";
}
void
Code_EqEmpty::dump(bool rec)
{
cout << "Empty(#" << id << ")";
}
void
Code_EqRoot::dump(bool rec)
{
cout << "Root(#" << id << ",";
universes->dump();
cout << ")";
}
void
Code_FirstOrder::dump(bool rec)
{
cout << "FirstOrder(#" << id << ")";
}
void
Code_EqConst::dump(bool rec)
{
cout << "Const(#" << id << "," << val << ")";
}
void
Code_Singleton::dump(bool rec)
{
cout << "Singleton(#" << id << ")";
}
void
Code_BoolVar::dump(bool rec)
{
cout << "BoolVar(#" << id << ")";
}
void
Code_InStateSpace::dump(bool rec)
{
cout << "InStateSpace(#" << id << ",[";
if (ss && ss->size() > 5)
cout << "...";
else {
IdentList::iterator i;
for (i = ss->begin(); i != ss->end(); i++) {
if (i != ss->begin())
cout << ",";
cout << symbolTable.lookupNumber(*i);
}
}
cout << "])";
}
void
Code_SomeType::dump(bool rec)
{
cout << "SomeType(#" << id << ")";
}
void
Code_In::dump(bool rec)
{
cout << "In(#" << id1 << ",#" << id2 << ")";
}
void
Code_Eq1::dump(bool rec)
{
cout << "Eq1(#" << id1 << ",#" << id2 << ")";
}
void
Code_Eq2::dump(bool rec)
{
cout << "Eq2(#" << id1 << ",#" << id2 << ")";
}
void
Code_Sub2::dump(bool rec)
{
cout << "Sub2(#" << id1 << ",#" << id2 << ")";
}
void
Code_Less1::dump(bool rec)
{
cout << "Less1(#" << id1 << ",#" << id2 << ")";
}
void
Code_LessEq1::dump(bool rec)
{
cout << "LessEq1(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqDot0::dump(bool rec)
{
cout << "Dot0(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqDot1::dump(bool rec)
{
cout << "Dot1(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqUp::dump(bool rec)
{
cout << "eqUp(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqPlus2::dump(bool rec)
{
cout << "EqPlus2(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqMinus2::dump(bool rec)
{
cout << "EqMinus2(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqMin::dump(bool rec)
{
cout << "EqMin(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqMax::dump(bool rec)
{
cout << "EqMax(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqPlus1::dump(bool rec)
{
cout << "EqPlus1(#" << id1 << ",#" << id2 << "," << val << ")";
}
void
Code_EqMinus1::dump(bool rec)
{
cout << "EqMinus1(#" << id1 << ",#" << id2 << ")";
}
void
Code_EqUnion::dump(bool rec)
{
cout << "Union(#" << id1 << ",#" << id2 << ",#" << id3 << ")";
}
void
Code_EqInter::dump(bool rec)
{
cout << "Inter(#" << id1 << ",#" << id2 << ",#" << id3 << ")";
}
void
Code_EqSetMinus::dump(bool rec)
{
cout << "SetMinus(#" << id1 << ",#" << id2 << ",#" << id3 << ")";
}
void
Code_EqPlusModulo::dump(bool rec)
{
cout << "EqPlusModulo(#" << id1 << ",#" << id2 << ",#" << id3 << ")";
}
void
Code_EqMinusModulo::dump(bool rec)
{
cout << "EqMinusModulo(#" << id1 << ",#" << id2 << ",#" << id3 << ")";
}
void
Code_EqPresbConst::dump(bool rec)
{
cout << "PresbConst(#" << id << "," << val << ")";
}
void
Code_WellFormedTree::dump(bool rec)
{
cout << "WellFormedTree(#" << id << ")";
}
/////////// Code composite ////////////////////////////////////////////////////
void
Code_Restrict::dump(bool rec)
{
cout << "Restrict";
if (rec) {
cout << "(";
vc.dump(rec);
cout << ")";
}
}
void
Code_Project::dump(bool rec)
{
cout << "Project(#" << var;
dumpStateSpaces(var);
if (rec) {
cout << ",";
vc.dump(rec);
}
cout << ")";
}
void
Code_Negate::dump(bool rec)
{
cout << "Negate";
if (rec) {
cout << "(";
vc.dump(rec);
cout << ")";
}
}
void
Code_Prefix::dump(bool rec)
{
cout << "Prefix";
if (rec) {
cout << "(";
vc.dump(rec);
cout << ")";
}
}
void
Code_And::dump(bool rec)
{
cout << "And";
if (rec) {
cout << "(";
vc1.dump(rec);
cout << ",";
vc2.dump(rec);
cout << ")";
}
}
void
Code_IdLeft::dump(bool rec)
{
cout << "IdLeft";
if (rec) {
cout << "(";
vc1.dump(rec);
cout << ",";
vc2.dump(rec);
cout << ")";
}
}
void
Code_Or::dump(bool rec)
{
cout << "Or";
if (rec) {
cout << "(";
vc1.dump(rec);
cout << ",";
vc2.dump(rec);
cout << ")";
}
}
void
Code_Impl::dump(bool rec)
{
cout << "Impl";
if (rec) {
cout << "(";
vc1.dump(rec);
cout << ",";
vc2.dump(rec);
cout << ")";
}
}
void
Code_Biimpl::dump(bool rec)
{
cout << "Biimpl";
if (rec) {
cout << "(";
vc1.dump(rec);
cout << ",";
vc2.dump(rec);
cout << ")";
}
}
void
Code_PredCall::dump(bool rec)
{
cout << "PredCall(" << symbolTable.lookupSymbol(name);
if (rec) {
cout << ",";
vc.dump(rec);
}
cout << ")";
}
void
Code_Import::dump(bool rec)
{
cout << "Import(" << file;
Deque<char*>::iterator i;
IdentList::iterator j;
for (i = formals->begin(), j = actuals->begin();
i != formals->end(); i++, j++)
cout << "," << *i << "->#" << *j;
cout << ")";
}
void
Code_Export::dump(bool rec)
{
cout << "Export(" << file;
if (rec) {
cout << ",";
vc.dump(rec);
}
cout << ")";
}
|