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 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
|
/*
Title: Export and import memory in a portable format
Author: David C. J. Matthews.
Copyright (c) 2006-7, 2015-7 David C. J. Matthews
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License version 2.1 as published by the Free Software Foundation.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR H PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#elif defined(_WIN32)
#include "winconfig.h"
#else
#error "No configuration file"
#endif
#ifdef HAVE_STDIO_H
#include <stdio.h>
#endif
#ifdef HAVE_ERRNO_H
#include <errno.h>
#endif
#ifdef HAVE_ASSERT_H
#include <assert.h>
#define ASSERT(x) assert(x)
#else
#define ASSERT(x)
#endif
#include "globals.h"
#include "pexport.h"
#include "machine_dep.h"
#include "scanaddrs.h"
#include "run_time.h"
#include "../polyexports.h"
#include "version.h"
#include "sys.h"
#include "polystring.h"
#include "processes.h" // For IO_SPACING
#include "memmgr.h"
#include "osmem.h"
#include "rtsentry.h"
/*
This file contains the code both to export the file and to import it
in a new session.
*/
PExport::PExport()
{
pMap = 0;
nMapSize = 0;
nObjects = 0;
indexOrder = 0;
}
PExport::~PExport()
{
free(pMap);
free(indexOrder);
}
// Get the index corresponding to an address.
unsigned long PExport::getIndex(PolyObject *p)
{
// Binary chop to find the index from the address.
unsigned long lower = 0, upper = nObjects;
while (1)
{
ASSERT(lower < upper);
unsigned long middle = (lower+upper)/2;
ASSERT(middle < nObjects);
if (p < pMap[middle])
{
// Use lower to middle
upper = middle;
}
else if (p > pMap[middle])
{
// Use middle+1 to upper
lower = middle+1;
}
else // Found it
return middle;
}
}
/* Get the index corresponding to an address. */
void PExport::printAddress(void *p)
{
fprintf(exportFile, "@%lu", getIndex((PolyObject*)p));
}
void PExport::printValue(PolyWord q)
{
if (IS_INT(q) || q == PolyWord::FromUnsigned(0))
fprintf(exportFile, "%" POLYSFMT, UNTAGGED(q));
else
printAddress(q.AsAddress());
}
void PExport::printObject(PolyObject *p)
{
POLYUNSIGNED length = p->Length();
POLYUNSIGNED i;
unsigned long myIndex = getIndex(p);
fprintf(exportFile, "%lu:", myIndex);
if (p->IsMutable())
putc('M', exportFile);
if (OBJ_IS_NEGATIVE(p->LengthWord()))
putc('N', exportFile);
if (OBJ_IS_WEAKREF_OBJECT(p->LengthWord()))
putc('W', exportFile);
if (OBJ_IS_NO_OVERWRITE(p->LengthWord()))
putc('V', exportFile);
if (p->IsByteObject())
{
if (p->IsMutable() && p->IsWeakRefObject())
{
// This is either an entry point or a weak ref used in the FFI.
// Clear the first word
if (p->Length() >= 1) p->Set(0, PolyWord::FromSigned(0));
}
/* May be a string, a long format arbitrary precision
number or a real number. */
PolyStringObject* ps = (PolyStringObject*)p;
/* This is not infallible but it seems to be good enough
to detect the strings. */
POLYUNSIGNED bytes = length * sizeof(PolyWord);
if (length >= 2 &&
ps->length <= bytes - sizeof(POLYUNSIGNED) &&
ps->length > bytes - 2 * sizeof(POLYUNSIGNED))
{
/* Looks like a string. */
fprintf(exportFile, "S%" POLYUFMT "|", ps->length);
for (unsigned i = 0; i < ps->length; i++)
{
char ch = ps->chars[i];
fprintf(exportFile, "%02x", ch & 0xff);
}
}
else
{
/* Not a string. May be an arbitrary precision integer.
If the source and destination word lengths differ we
could find that some long-format arbitrary precision
numbers could be represented in the tagged short form
or vice-versa. The former case might give rise to
errors because when comparing two arbitrary precision
numbers for equality we assume that they are not equal
if they have different representation. The latter
case could be a problem because we wouldn't know whether
to convert the tagged form to long form, which would be
correct if the value has type "int" or to truncate it
which would be correct for "word".
It could also be a real number but that doesn't matter
if we recompile everything on the new machine.
*/
byte *u = (byte*)p;
putc('B', exportFile);
fprintf(exportFile, "%" POLYUFMT "|", length*sizeof(PolyWord));
for (unsigned i = 0; i < (unsigned)(length*sizeof(PolyWord)); i++)
{
fprintf(exportFile, "%02x", u[i]);
}
}
}
else if (p->IsCodeObject())
{
POLYUNSIGNED constCount, i;
PolyWord *cp;
ASSERT(! p->IsMutable() );
/* Work out the number of bytes in the code and the
number of constants. */
p->GetConstSegmentForCode(cp, constCount);
/* The byte count is the length of the segment minus the
number of constants minus one for the constant count.
It includes the marker word, byte count, profile count
and, on the X86/64 at least, any non-address constants.
These are actually word values. */
POLYUNSIGNED byteCount = (length - constCount - 1) * sizeof(PolyWord);
fprintf(exportFile, "D%" POLYUFMT ",%" POLYUFMT "|", constCount, byteCount);
// First the code.
byte *u = (byte*)p;
for (i = 0; i < byteCount; i++)
fprintf(exportFile, "%02x", u[i]);
putc('|', exportFile);
// Now the constants.
for (i = 0; i < constCount; i++)
{
printValue(cp[i]);
if (i < constCount-1)
putc(',', exportFile);
}
putc('|', exportFile);
// Finally any constants in the code object.
machineDependent->ScanConstantsWithinCode(p, this);
}
else /* Ordinary objects, essentially tuples. */
{
fprintf(exportFile, "O%" POLYUFMT "|", length);
for (i = 0; i < length; i++)
{
printValue(p->Get(i));
if (i < length-1)
putc(',', exportFile);
}
}
fprintf(exportFile, "\n");
}
/* This is called for each constant within the code.
Print a relocation entry for the word and return a value that means
that the offset is saved in original word. */
void PExport::ScanConstant(PolyObject *base, byte *addr, ScanRelocationKind code)
{
PolyWord p = GetConstantValue(addr, code);
// We put in all the values including tagged constants.
// Put in the byte offset and the relocation type code.
POLYUNSIGNED offset = (POLYUNSIGNED)(addr - (byte*)base);
ASSERT (offset < base->Length() * sizeof(POLYUNSIGNED));
fprintf(exportFile, "%" POLYUFMT ",%d,", (POLYUNSIGNED)(addr - (byte*)base), code);
printValue(p); // The value to plug in.
fprintf(exportFile, " ");
}
void PExport::exportStore(void)
{
unsigned i;
// Calculate a first guess for the map size based on the space size
totalBytes = 0;
void *startAddr = 0;
for (i = 0; i < memTableEntries; i++)
{
totalBytes += (unsigned long)memTable[i].mtLength;
// Get the lowest address.
if (startAddr == 0 || memTable[i].mtAddr < startAddr)
startAddr = memTable[i].mtAddr;
}
// Create a map entry for each entry. Allow five words per object.
nMapSize = totalBytes/(sizeof(PolyWord)*5);
pMap = (PolyObject **)malloc(sizeof(PolyObject*)*nMapSize);
if (pMap == 0)
throw MemoryException();
// We want the entries in pMap to be in ascending
// order of address to make searching easy so we need to process the areas
// in order of increasing address, which may not be the order in memTable.
indexOrder = (unsigned*)calloc(sizeof(unsigned), memTableEntries);
if (indexOrder == 0)
throw MemoryException();
unsigned items = 0;
for (i = 0; i < memTableEntries; i++)
{
unsigned j = items;
while (j > 0 && memTable[i].mtAddr < memTable[indexOrder[j-1]].mtAddr)
{
indexOrder[j] = indexOrder[j-1];
j--;
}
indexOrder[j] = i;
items++;
}
ASSERT(items == memTableEntries);
// Process the area in order of ascending address.
for (i = 0; i < items; i++)
{
unsigned index = indexOrder[i];
char *start = (char*)memTable[index].mtAddr;
char *end = start + memTable[index].mtLength;
for (PolyWord *p = (PolyWord*)start; p < (PolyWord*)end; )
{
p++;
PolyObject *obj = (PolyObject*)p;
if (nObjects == nMapSize)
{
// Need to expand the array.
PolyObject **newMap =
(PolyObject **)realloc(pMap, (nMapSize + nMapSize/2)*sizeof(PolyObject*));
if (newMap == 0)
throw MemoryException();
pMap = newMap;
}
POLYUNSIGNED length = obj->Length();
pMap[nObjects++] = obj;
p += length;
}
}
/* Start writing the information. */
fprintf(exportFile, "Objects\t%lu\n", nObjects);
fprintf(exportFile, "Root\t%lu\n", getIndex(rootFunction));
// Generate each of the areas.
for (i = 0; i < memTableEntries; i++)
{
char *start = (char*)memTable[i].mtAddr;
char *end = start + memTable[i].mtLength;
for (PolyWord *p = (PolyWord*)start; p < (PolyWord*)end; )
{
p++;
PolyObject *obj = (PolyObject*)p;
POLYUNSIGNED length = obj->Length();
printObject(obj);
p += length;
}
}
fclose(exportFile); exportFile = NULL;
}
/*
Import a portable export file and load it into memory.
Creates "permanent" address entries in the global memory table.
*/
class SpaceAlloc
{
public:
SpaceAlloc(bool isMut, POLYUNSIGNED def);
~SpaceAlloc();
PolyObject *NewObj(POLYUNSIGNED objWords);
bool AddToTable(void);
POLYUNSIGNED defaultSize;
POLYUNSIGNED currentSize;
PolyWord *base;
POLYUNSIGNED used;
bool isMutable;
unsigned spaceIndex;
};
SpaceAlloc::SpaceAlloc(bool isMut, POLYUNSIGNED def)
{
isMutable = isMut;
defaultSize = def;
base = 0;
currentSize = 0;
used = 0;
spaceIndex = 1;
}
SpaceAlloc::~SpaceAlloc()
{
if (base)
osMemoryManager->Free(base, currentSize*sizeof(PolyWord));
}
bool SpaceAlloc::AddToTable(void)
{
if (base != 0)
{
// Add the new space to the permanent memory table.
MemSpace* space = gMem.NewPermanentSpace(base, used, isMutable ? MTF_WRITEABLE : 0, spaceIndex++);
if (space == 0)
{
fprintf(stderr, "Insufficient memory\n");
return false;
}
}
base = 0;
return true;
}
// Allocate a new object. May create a new space and add the old one to the permanent
// memory table if this is exhausted.
PolyObject *SpaceAlloc::NewObj(POLYUNSIGNED objWords)
{
if (currentSize - used <= objWords)
{
// Need some more space.
if (! AddToTable())
return 0;
POLYUNSIGNED size = defaultSize;
if (size <= objWords)
size = objWords+1;
size_t iSpace = size*sizeof(PolyWord);
base = (PolyWord*)osMemoryManager->Allocate(iSpace, PERMISSION_READ|PERMISSION_WRITE|PERMISSION_EXEC);
if (base == 0)
{
fprintf(stderr, "Unable to allocate memory\n");
return 0;
}
currentSize = iSpace/sizeof(PolyWord);
used = 0;
}
ASSERT(currentSize - used > objWords);
PolyObject *newObj = (PolyObject*)(base+used+1);
used += objWords+1;
return newObj;
}
class PImport
{
public:
PImport();
~PImport();
bool DoImport(void);
FILE *f;
PolyObject *Root(void) { return objMap[nRoot]; }
private:
PolyObject *NewObject(POLYUNSIGNED words, bool isMutable);
bool ReadValue(PolyObject *p, POLYUNSIGNED i);
bool GetValue(PolyWord *result);
POLYUNSIGNED nObjects, nRoot;
PolyObject **objMap;
SpaceAlloc mutSpace, immutSpace;
};
PImport::PImport(): mutSpace(true, 1024*1024), immutSpace(false, 1024*1024)
{
f = NULL;
objMap = 0;
}
PImport::~PImport()
{
if (f)
fclose(f);
free(objMap);
}
PolyObject *PImport::NewObject(POLYUNSIGNED words, bool isMutableObj)
{
PolyObject *newObj = 0;
if (isMutableObj)
newObj = mutSpace.NewObj(words);
else
newObj = immutSpace.NewObj(words);
if (newObj == 0)
return 0;
return newObj;
}
bool PImport::GetValue(PolyWord *result)
{
int ch = getc(f);
if (ch == '@')
{
/* Address of an object. */
POLYUNSIGNED obj;
fscanf(f, "%" POLYUFMT, &obj);
ASSERT(obj < nObjects);
*result = objMap[obj];
}
else if (ch == '$')
{
/* Code address. */
POLYUNSIGNED obj, offset;
fscanf(f, "%" POLYUFMT "+%" POLYUFMT, &obj, &offset);
ASSERT(obj < nObjects);
PolyObject *q = objMap[obj];
ASSERT(q->IsCodeObject());
*result = PolyWord::FromCodePtr((PolyWord(q)).AsCodePtr() + offset); /* The offset is in bytes. */
}
else if ((ch >= '0' && ch <= '9') || ch == '-')
{
/* Tagged integer. */
POLYSIGNED j;
ungetc(ch, f);
fscanf(f, "%" POLYSFMT, &j);
/* The assertion may be false if we are porting to a machine
with a shorter tagged representation. */
ASSERT(j >= -MAXTAGGED-1 && j <= MAXTAGGED);
*result = TAGGED(j);
}
else if (ch == 'I')
{
/* IO entry number. */
POLYUNSIGNED j;
fscanf(f, "%" POLYUFMT, &j);
// We may still have references to the old empty string value (j == 48).
if (j == 48)
{
// This is a bit of a hack but it's only temporary.
PolyObject *p = NewObject(1, false);
p->SetLengthWord(1, F_BYTE_OBJ);
p->Set(0, PolyWord::FromUnsigned(0));
*result = p;
}
else ASSERT(0);
}
else
{
fprintf(stderr, "Unexpected character in stream");
return false;
}
return true;
}
/* Read a value and store it at the specified word. */
bool PImport::ReadValue(PolyObject *p, POLYUNSIGNED i)
{
PolyWord result = TAGGED(0);
if (GetValue(&result))
{
p->Set(i, result);
return true;
}
else return false;
}
bool PImport::DoImport()
{
int ch;
POLYUNSIGNED objNo;
ASSERT(gMem.pSpaces.size() == 0);
ASSERT(gMem.eSpaces.size() == 0);
ch = getc(f);
/* Skip the "Mapping" line. */
if (ch == 'M') { while (getc(f) != '\n') ; ch = getc(f); }
ASSERT(ch == 'O'); /* Number of objects. */
while (getc(f) != '\t') ;
fscanf(f, "%" POLYUFMT, &nObjects);
/* Create a mapping table. */
objMap = (PolyObject**)calloc(nObjects, sizeof(PolyObject*));
if (objMap == 0)
{
fprintf(stderr, "Unable to allocate memory\n");
return false;
}
do
{
ch = getc(f);
} while (ch == '\n');
ASSERT(ch == 'R'); /* Root object number. */
while (getc(f) != '\t') ;
fscanf(f, "%" POLYUFMT, &nRoot);
/* Now the objects themselves. */
while (1)
{
bool isMutable = false;
unsigned objBits = 0;
POLYUNSIGNED nWords, nBytes;
do
{
ch = getc(f);
} while (ch == '\r' || ch == '\n');
if (ch == EOF) break;
ungetc(ch, f);
fscanf(f, "%" POLYUFMT, &objNo);
ch = getc(f);
ASSERT(ch == ':');
ASSERT(objNo < nObjects);
/* Modifiers, MNVW. */
do
{
ch = getc(f);
if (ch == 'M') { isMutable = true; objBits |= F_MUTABLE_BIT; }
else if (ch == 'N') objBits |= F_NEGATIVE_BIT;
if (ch == 'V') objBits |= F_NO_OVERWRITE;
if (ch == 'W') objBits |= F_WEAK_BIT;
} while (ch == 'M' || ch == 'N' || ch == 'L' || ch == 'V' || ch == 'W');
/* Object type. */
switch (ch)
{
case 'O': /* Simple object. */
fscanf(f, "%" POLYUFMT, &nWords);
break;
case 'B': /* Byte segment. */
objBits |= F_BYTE_OBJ;
fscanf(f, "%" POLYUFMT, &nBytes);
/* Round up to appropriate number of words. */
nWords = (nBytes + sizeof(PolyWord) -1) / sizeof(PolyWord);
break;
case 'S': /* String. */
objBits |= F_BYTE_OBJ;
/* The length is the number of characters. */
fscanf(f, "%" POLYUFMT, &nBytes);
/* Round up to appropriate number of words. Need to add
one PolyWord for the length PolyWord. */
nWords = (nBytes + sizeof(PolyWord) -1) / sizeof(PolyWord) + 1;
break;
case 'C': /* Code segment (old form). */
case 'D': /* Code segment (new form). */
objBits |= F_CODE_OBJ;
/* Read the number of bytes of code and the number of words
for constants. */
fscanf(f, "%" POLYUFMT ",%" POLYUFMT, &nWords, &nBytes);
nWords += ch == 'C' ? 4 : 1; /* Add words for extras. */
/* Add in the size of the code itself. */
nWords += (nBytes + sizeof(PolyWord) -1) / sizeof(PolyWord);
break;
default:
fprintf(stderr, "Invalid object type\n");
return false;
}
PolyObject *p = NewObject(nWords, isMutable);
if (p == 0)
return false;
objMap[objNo] = p;
/* Put in length PolyWord and flag bits. */
p->SetLengthWord(nWords, objBits);
/* Skip the object contents. */
while (getc(f) != '\n') ;
}
/* Second pass - fill in the contents. */
fseek(f, 0, SEEK_SET);
/* Skip the information at the start. */
ch = getc(f);
if (ch == 'M')
{
while (getc(f) != '\n') ;
ch = getc(f);
}
ASSERT(ch == 'O'); /* Number of objects. */
while (getc(f) != '\n');
ch = getc(f);
ASSERT(ch == 'R'); /* Root object number. */
while (getc(f) != '\n') ;
while (1)
{
POLYUNSIGNED nWords, nBytes, i;
if (feof(f))
break;
fscanf(f, "%" POLYUFMT, &objNo);
if (feof(f))
break;
ch = getc(f);
ASSERT(ch == ':');
ASSERT(objNo < nObjects);
PolyObject * p = objMap[objNo];
/* Modifiers, M or N. */
do
{
ch = getc(f);
} while (ch == 'M' || ch == 'N' || ch == 'L' || ch == 'V' || ch == 'W');
/* Object type. */
switch (ch)
{
case 'O': /* Simple object. */
fscanf(f, "%" POLYUFMT, &nWords);
ch = getc(f);
ASSERT(ch == '|');
ASSERT(nWords == p->Length());
for (i = 0; i < nWords; i++)
{
if (! ReadValue(p, i))
return false;
ch = getc(f);
ASSERT((ch == ',' && i < nWords-1) ||
(ch == '\n' && i == nWords-1));
}
break;
case 'B': /* Byte segment. */
{
byte *u = (byte*)p;
fscanf(f, "%" POLYUFMT, &nBytes);
ch = getc(f); ASSERT(ch == '|');
for (i = 0; i < nBytes; i++)
{
int n;
fscanf(f, "%02x", &n);
u[i] = n;
}
ch = getc(f);
ASSERT(ch == '\n');
// If this is an entry point object set its value.
if (p->IsMutable() && p->IsWeakRefObject())
{
bool loadEntryPt = setEntryPoint(p);
ASSERT(loadEntryPt);
}
break;
}
case 'S': /* String. */
{
PolyStringObject * ps = (PolyStringObject *)p;
/* The length is the number of characters. */
fscanf(f, "%" POLYUFMT, &nBytes);
ch = getc(f); ASSERT(ch == '|');
ps->length = nBytes;
for (i = 0; i < nBytes; i++)
{
int n;
fscanf(f, "%02x", &n);
ps->chars[i] = n;
}
ch = getc(f);
ASSERT(ch == '\n');
break;
}
case 'C': /* Code segment. */
case 'D':
{
bool oldForm = ch == 'C';
byte *u = (byte*)p;
POLYUNSIGNED length = p->Length();
/* Read the number of bytes of code and the number of words
for constants. */
fscanf(f, "%" POLYUFMT ",%" POLYUFMT, &nWords, &nBytes);
/* Read the code. */
ch = getc(f); ASSERT(ch == '|');
for (i = 0; i < nBytes; i++)
{
int n;
fscanf(f, "%02x", &n);
u[i] = n;
}
machineDependent->FlushInstructionCache(u, nBytes);
ch = getc(f);
ASSERT(ch == '|');
/* Set the constant count. */
p->Set(length-1, PolyWord::FromUnsigned(nWords));
if (oldForm)
{
p->Set(length-1-nWords-1, PolyWord::FromUnsigned(0)); /* Profile count. */
p->Set(length-1-nWords-3, PolyWord::FromUnsigned(0)); /* Marker word. */
p->Set(length-1-nWords-2, PolyWord::FromUnsigned((length-1-nWords-2)*sizeof(PolyWord)));
/* Check - the code should end at the marker word. */
ASSERT(nBytes == ((length-1-nWords-3)*sizeof(PolyWord)));
}
/* Read in the constants. */
for (i = 0; i < nWords; i++)
{
if (! ReadValue(p, i+length-nWords-1))
return false;
ch = getc(f);
ASSERT((ch == ',' && i < nWords-1) ||
((ch == '\n' || ch == '|') && i == nWords-1));
}
// Read in any constants in the code.
if (ch == '|')
{
ch = getc(f);
while (ch != '\n')
{
ungetc(ch, f);
POLYUNSIGNED offset;
int code;
fscanf(f, "%" POLYUFMT ",%d", &offset, &code);
ch = getc(f);
ASSERT(ch == ',');
PolyWord constVal = TAGGED(0);
if (! GetValue(&constVal))
return false;
byte *toPatch = (byte*)p + offset;
ScanAddress::SetConstantValue(toPatch, constVal, (ScanRelocationKind)code);
do ch = getc(f); while (ch == ' ');
}
}
break;
}
default:
fprintf(stderr, "Invalid object type\n");
return false;
}
}
return mutSpace.AddToTable() && immutSpace.AddToTable();
}
// Import a file in the portable format and return a pointer to the root object.
PolyObject *ImportPortable(const TCHAR *fileName)
{
PImport pImport;
#if (defined(_WIN32) && defined(UNICODE))
pImport.f = _wfopen(fileName, L"r");
if (pImport.f == 0)
{
fprintf(stderr, "Unable to open file: %S\n", fileName);
return 0;
}
#else
pImport.f = fopen(fileName, "r");
if (pImport.f == 0)
{
fprintf(stderr, "Unable to open file: %s\n", fileName);
return 0;
}
#endif
if (pImport.DoImport())
return pImport.Root();
else
return 0;
}
|