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
|
/*
Title: Object size
Copyright (c) 2000
Cambridge University Technical Services Limited
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
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 A 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 WIN32
#include "winconfig.h"
#else
#include "config.h"
#endif
#ifdef HAVE_STDIO_H
#include <stdio.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_ASSERT_H
#include <assert.h>
#define ASSERT(x) assert(x)
#else
#define ASSERT(x)
#endif
#include "globals.h"
#include "arb.h"
#include "run_time.h"
#include "machine_dep.h"
#include "objsize.h"
#include "scanaddrs.h"
#include "polystring.h"
#include "save_vec.h"
#include "bitmap.h"
#include "memmgr.h"
#define MAX_PROF_LEN 100 // Profile lengths between 1 and this
class VisitBitmap
{
public:
VisitBitmap(PolyWord *bottom, PolyWord *top):
m_bitmap(top - bottom),
m_bottom(bottom), m_top(top) {}
bool AlreadyVisited(PolyObject *p) { return m_bitmap.TestBit((PolyWord*)p - m_bottom); }
void SetVisited(PolyObject *p) { m_bitmap.SetBit((PolyWord*)p - m_bottom); }
Bitmap m_bitmap;
PolyWord *m_bottom;
PolyWord *m_top;
};
class ProcessVisitAddresses: public ScanAddress
{
public:
virtual POLYUNSIGNED ScanAddressAt(PolyWord *pt) { return ShowWord(*pt); }
virtual PolyObject *ScanObjectAddress(PolyObject *base);
POLYUNSIGNED ShowWord(PolyWord w);
ProcessVisitAddresses(bool show);
~ProcessVisitAddresses();
VisitBitmap *FindBitmap(PolyWord p);
void ShowBytes(PolyObject *start);
void ShowCode(PolyObject *start);
void ShowWords(PolyObject *start);
int total_length;
bool show_size;
void *io_bottom;
void *io_top;
VisitBitmap **bitmaps;
unsigned nBitmaps;
// Counts of objects of each size for mutable and immutable data.
unsigned iprofile[MAX_PROF_LEN+1];
unsigned mprofile[MAX_PROF_LEN+1];
};
ProcessVisitAddresses::ProcessVisitAddresses(bool show)
{
MemSpace *ioSpace = gMem.IoSpace();
io_bottom = ioSpace->bottom;
io_top = ioSpace->top;
total_length = 0;
show_size = show;
// Create a bitmap for each of the areas apart from the IO area
nBitmaps = gMem.nlSpaces+gMem.npSpaces; //
bitmaps = new VisitBitmap*[nBitmaps];
unsigned bm = 0;
unsigned j;
for (j = 0; j < gMem.npSpaces; j++)
{
MemSpace *space = gMem.pSpaces[j];
// Permanent areas are filled with objects from the bottom.
bitmaps[bm++] = new VisitBitmap(space->bottom, space->top);
}
for (j = 0; j < gMem.nlSpaces; j++)
{
LocalMemSpace *space = gMem.lSpaces[j];
// Local areas only have objects from the allocation pointer to the top.
bitmaps[bm++] = new VisitBitmap(space->pointer, space->top);
}
ASSERT(bm == nBitmaps);
// Clear the profile counts.
for (unsigned i = 0; i < MAX_PROF_LEN+1; i++)
{
iprofile[i] = mprofile[i] = 0;
}
}
ProcessVisitAddresses::~ProcessVisitAddresses()
{
if (bitmaps)
{
for (unsigned i = 0; i < nBitmaps; i++)
delete(bitmaps[i]);
delete[](bitmaps);
}
}
// Return the bitmap corresponding to the address or NULL if it isn't there.
VisitBitmap *ProcessVisitAddresses::FindBitmap(PolyWord p)
{
for (unsigned i = 0; i < nBitmaps; i++)
{
VisitBitmap *bm = bitmaps[i];
if (p.AsAddress() > bm->m_bottom && p.AsAddress() <= bm->m_top) return bm;
}
return 0;
}
void ProcessVisitAddresses::ShowBytes(PolyObject *start)
{
POLYUNSIGNED bytes = start->Length() * sizeof(PolyWord);
char *array = (char *) start;
putc('\n', stdout);
if (start->IsMutable()) printf("MUTABLE ");
printf("BYTES:%p:%lu\n", array, bytes);
POLYUNSIGNED i, n;
for (i = 0, n = 0; n < bytes; n++)
{
printf("%02x ",array[n] & 0xff);
i++;
if (i == 16)
{
putc('\n', stdout);
i = 0;
}
}
if (i != 0) putc('\n', stdout);
}
#define MAXNAME 500
void ProcessVisitAddresses::ShowCode(PolyObject *start)
{
POLYUNSIGNED length = start->Length();
putc('\n', stdout);
if (start->IsMutable()) printf("MUTABLE ");
char buffer[MAXNAME+1];
PolyWord *consts = start->ConstPtrForCode();
PolyWord string = consts[0];
if (string == TAGGED(0))
strcpy(buffer, "<not-named>");
else
(void) Poly_string_to_C(string, buffer, sizeof(buffer));
printf("CODE:%p:%lu %s\n", start, length, buffer);
POLYUNSIGNED i, n;
for (i = 0, n = 0; n < length; n++)
{
if (i != 0) putc('\t', stdout);
printf("%8p ", start->Get(n).AsObjPtr());
i++;
if (i == 4)
{
putc('\n', stdout);
i = 0;
}
}
if (i != 0) putc('\n', stdout);
}
void ProcessVisitAddresses::ShowWords(PolyObject *start)
{
POLYUNSIGNED length = start->Length();
putc('\n', stdout);
if (start->IsMutable()) printf("MUTABLE ");
printf("WORDS:%p:%lu\n", start, length);
POLYUNSIGNED i, n;
for (i = 0, n = 0; n < length; n++)
{
if (i != 0)
putc('\t', stdout);
printf("%8p ", start->Get(n).AsObjPtr());
i++;
if (i == 4)
{
putc('\n', stdout);
i = 0;
}
}
if (i != 0)
putc('\n', stdout);
}
// This is called initially to print the top-level object.
// Since we don't process stacks it probably doesn't get called elsewhere.
PolyObject *ProcessVisitAddresses::ScanObjectAddress(PolyObject *base)
{
POLYUNSIGNED lengthWord = ShowWord(base);
if (lengthWord)
ScanAddressesInObject(base, lengthWord);
return base;
}
// Handle the normal case. Print the object at this word and
// return true is it must be handled recursively.
POLYUNSIGNED ProcessVisitAddresses::ShowWord(PolyWord w)
{
if (IS_INT(w))
return 0; /* not a pointer */
if (w.AsAddress() >= io_bottom && w.AsAddress() < io_top)
return 0; /* IO segment */
if (w == PolyWord::FromUnsigned(0))
return 0;
VisitBitmap *bm = FindBitmap(w);
if (bm == 0)
{
printf("Bad address "ZERO_X"%p found\n", w.AsObjPtr());
return 0;
}
PolyObject *p;
if (OBJ_IS_CODEPTR(w))
p = ObjCodePtrToPtr(w.AsCodePtr()); /* find beginning of the code object */
else p = w.AsObjPtr();
/* Have we already visited this object? */
if (bm->AlreadyVisited(p))
return 0;
bm->SetVisited(p);
POLYUNSIGNED L = p->LengthWord();
POLYUNSIGNED obj_length = OBJ_OBJECT_LENGTH(L);
// Increment the appropriate size profile count.
if (p->IsMutable())
{
if (obj_length > MAX_PROF_LEN)
mprofile[MAX_PROF_LEN]++;
else
mprofile[obj_length]++;
}
else
{
if (obj_length > MAX_PROF_LEN)
iprofile[MAX_PROF_LEN]++;
else
iprofile[obj_length]++;
}
total_length += obj_length + 1; /* total space needed for object */
if (OBJ_IS_BYTE_OBJECT(L))
{
if (show_size)
ShowBytes(p);
return 0;
}
else if (OBJ_IS_STACK_OBJECT(L))
{
return 0; // We shouldn't get stack objects.
}
else if (OBJ_IS_CODE_OBJECT(L))
{
PolyWord *cp;
POLYUNSIGNED const_count;
p->GetConstSegmentForCode(cp, const_count);
if (show_size)
ShowCode(p);
return L; // Process addresses in it.
}
else /* Word object */
{
if (show_size)
ShowWords(p);
return L; // Process addresses in it.
}
}
Handle ObjSize(TaskData *taskData, Handle obj)
{
ProcessVisitAddresses process(false);
process.ScanObjectAddress(obj->WordP());
return Make_arbitrary_precision(taskData, process.total_length);
}
Handle ShowSize(TaskData *taskData, Handle obj)
{
ProcessVisitAddresses process(true);
process.ScanObjectAddress(obj->WordP());
fflush(stdout); /* We need this for Windows at least. */
return Make_arbitrary_precision(taskData, process.total_length);
}
static void printfprof(unsigned *counts)
{
for(unsigned i = 0; i < MAX_PROF_LEN+1; i++)
{
if (counts[i] != 0)
{
if (i == MAX_PROF_LEN)
printf(">%d\t%u\n", MAX_PROF_LEN, counts[i]);
else
printf("%d\t%u\n", i, counts[i]);
}
}
}
Handle ObjProfile(TaskData *taskData, Handle obj)
{
ProcessVisitAddresses process(false);
process.ScanObjectAddress(obj->WordP());
printf("\nImmutable object sizes and counts\n");
printfprof(process.iprofile);
printf("\nMutable object sizes and counts\n");
printfprof(process.mprofile);
fflush(stdout); /* We need this for Windows at least. */
return Make_arbitrary_precision(taskData, process.total_length);
}
|