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
|
#include "stdafx.h"
#include "VTable.h"
#include "Type.h"
#include "Engine.h"
#include "Core/Str.h"
#include <iomanip>
namespace storm {
VTable::VTable(Type *owner) : owner(owner) {}
void VTable::createCpp(const void *cppVTable) {
assert(cpp == null, L"Can not re-use a VTable for a new C++ root object.");
stormFirst = 1;
cpp = VTableCpp::wrap(engine(), cppVTable);
if (engine().has(bootTemplates))
lateInit();
}
void VTable::createStorm(VTable *parent) {
// Disable vtable lookup for all functions already in here.
if (updaters) {
for (UpdateMap::Iter i = updaters->begin(), e = updaters->end(); i != e; ++i) {
i.k()->setLookup(null);
}
updaters = new (this) UpdateMap();
}
if (cpp)
cpp->replace(parent->cpp);
else
cpp = VTableCpp::copy(engine(), parent->cpp);
if (source)
source->set(cpp);
// Create a new Storm VTable.
storm = new (this) VTableStorm(cpp);
stormFirst = parent->storm
? parent->storm->count()
: 1; // always place stuff after the destructor slot.
storm->resize(stormFirst);
if (parent->storm)
storm->copyData(parent->storm);
if (engine().has(bootTemplates))
lateInit();
}
void VTable::lateInit() {
if (!updaters)
updaters = new (this) UpdateMap();
if (!source) {
source = new (this) NamedSource(owner, Char('v'));
source->set(cpp);
}
}
void VTable::insert(RootObject *obj) {
cpp->insert(obj);
}
void VTable::insert(code::Listing *to, code::Var obj) {
cpp->insert(to, obj, code::Ref(source));
}
const void **VTable::pointer() {
return cpp->pointer();
}
void VTable::replace(VTable *old, ReplaceTasks *tasks) {
source->steal(old->source);
tasks->replace(old, this);
}
Array<Function *> *VTable::allSlots() {
Array<Function *> *cppFns = new (this) Array<Function *>(cpp->count(), null);
Array<Function *> *stormFns = null;
if (storm)
stormFns = new (this) Array<Function *>(storm->count(), null);
allSlots(cppFns, stormFns);
Array<Function *> *result = new (this) Array<Function *>();
result->reserve(cppFns->count() + (stormFns ? stormFns->count() : 0));
for (Nat i = 0; i < cppFns->count(); i++)
if (Function *f = cppFns->at(i))
result->push(f);
if (storm)
for (Nat i = 0; i < stormFns->count(); i++)
if (Function *f = stormFns->at(i))
result->push(f);
return result;
}
void VTable::allSlots(Array<Function *> *cppFns, Array<Function *> *stormFns) {
for (Nat i = 0; i < min(cppFns->count(), cpp->count()); i++) {
if (!cppFns->at(i))
cppFns->at(i) = cpp->get(i);
}
if (storm) {
for (Nat i = 0; i < min(stormFns->count(), storm->count()); i++) {
if (!stormFns->at(i))
stormFns->at(i) = storm->get(i);
}
}
if (Type *s = owner->super())
rawVTable(s)->allSlots(cppFns, stormFns);
}
void VTable::dbg_dump() const {
PLN(L"vtable @" << cpp->address() << L":");
PLN(L"C++:");
const void **ptr = (const void **)cpp->address();
ptr += 4; // Skip metadata.
for (nat i = 0; i < cpp->count(); i++) {
PNN(std::setw(4) << i << L": " << ptr[i]);
if (Function *f = cpp->get(i))
PLN(L" (" << f << L")");
else
PLN(L"");
}
if (storm) {
const void **ptr = (const void **)cpp->extra();
PLN(L"Storm: " << ptr);
for (nat i = 0; i < storm->count(); i++) {
PNN(std::setw(4) << i << L": " << ptr[i+2]);
if (Function *f = storm->get(i))
PLN(L" (" << f << L")");
else
PLN(L"");
}
}
}
void VTable::insert(Function *fn) {
// Do we already know this function?
if (updaters->has(fn))
return;
VTableSlot slot = findSlot(fn, true);
if (!slot.valid()) {
// We need to allocate a slot for this function.
slot = allocSlot();
} else {
// See if something was in the slot before. If so, remove the corresponding updater.
// This happens if a user has replaced an entity marked with "namedAllowReplace".
Function *old = get(slot);
if (old) {
updaters->remove(old);
}
}
// Insert into the vtable.
set(slot, fn);
updaters->put(fn, new (this) VTableUpdater(this, slot, fn->directRef(), source->content()));
// See if there are any child functions which we potentially need to update.
if (updateChildren(fn, slot))
useLookup(fn, slot);
}
void VTable::remove(Function *fn) {
// Do we know this function?
VTableUpdater *u = updaters->get(fn, null);
if (!u)
return;
VTableSlot slot = u->slot();
clear(slot);
if (Type *s = owner->super())
rawVTable(s)->remove(slot);
}
void VTable::remove(VTableSlot slot) {
if (Function *fn = get(slot)) {
if (!hasOverride(slot)) {
// Disable vtable lookup for this function.
if (fn->ref().address() != fn->directRef().address()) {
fn->setLookup(null);
}
// No need to continue traversal.
return;
}
}
if (Type *s = owner->super())
rawVTable(s)->remove(slot);
}
void VTable::removeChild(Type *child) {
// For all slots: find a match to that function in a pre-existing child class.
nat stormCount = storm ? storm->count() : 1;
GcBitset *cppFound = allocBitset(engine(), cpp->count());
GcBitset *stormFound = allocBitset(engine(), stormCount);
disableLookup(cppFound, stormFound);
}
void VTable::disableLookup(GcBitset *cppFound, GcBitset *stormFound) {
// We need to check this, since in early boot we may not yet have created the map.
if (updaters) {
for (UpdateMap::Iter i = updaters->begin(), e = updaters->end(); i != e; ++i) {
VTableUpdater *u = i.v();
VTableSlot slot = u->slot();
GcBitset *found = slot.type == VTableSlot::tStorm ? stormFound : cppFound;
if (slot.offset >= found->count())
continue;
// Already found an overriding function?
if (found->has(slot.offset))
continue;
// Try to find one ourselves...
if (!hasOverride(slot)) {
// Disable vtable lookup for this function as it was a leaf function.
Function *f = i.k();
if (f->ref().address() != f->directRef().address()) {
f->setLookup(null);
}
}
// Note we found this one at least!
found->set(slot.offset, true);
}
}
// Ask our parent to do the same.
if (Type *s = owner->super())
rawVTable(s)->disableLookup(cppFound, stormFound);
}
Bool VTable::hasOverride(VTableSlot slot) {
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next()) {
VTable *child = rawVTable(c);
if (child->get(slot) != null)
return true;
if (child->hasOverride(slot))
return true;
}
return false;
}
void VTable::slotMoved(VTableSlot slot, const void *addr) {
set(slot, addr);
// Traverse the types and update all child types.
if (!owner->chain)
return;
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next()) {
if (VTable *t = rawVTable(c))
t->parentSlotMoved(slot, addr);
}
}
void VTable::parentSlotMoved(VTableSlot slot, const void *addr) {
// We do not need to propagate further.
if (get(slot) != null)
return;
set(slot, addr);
if (!owner->chain)
return;
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next()) {
if (VTable *t = rawVTable(c))
t->parentSlotMoved(slot, addr);
}
}
VTableSlot VTable::findSlot(Function *fn, bool setLookup) {
Code *c = fn->getCode();
bool cppType = (owner->typeFlags() & typeCpp) == typeCpp;
if (cppType && (as<StaticCode>(c) || as<CppMemberFunction>(fn))) {
// Might be a function from C++!
const void *addr = fn->originalPtr();
nat r = cpp->findSlot(addr);
if (r != vtable::invalid) {
VTableSlot slot = cppSlot(r);
if (setLookup)
updateSuper(slot);
return slot;
}
}
nat r = vtable::invalid;
if (storm)
r = storm->findSlot(fn);
if (r != vtable::invalid)
return stormSlot(r);
// See if our parent has a match!
if (Type *s = owner->super()) {
return rawVTable(s)->findSuperSlot(new (this) OverridePart(fn), setLookup);
} else {
return VTableSlot();
}
}
VTableSlot VTable::findSuperSlot(OverridePart *fn, bool setLookup) {
Function *found = as<Function>(owner->findHere(fn, Scope()));
if (found) {
// If it is not known to us yet, we can not do much about it.
if (updaters->has(found)) {
VTableSlot slot = updaters->get(found)->slot();
if (setLookup)
useLookup(found, slot);
return slot;
}
}
// Try to find it in superclasses.
if (Type *s = owner->super()) {
return rawVTable(s)->findSuperSlot(fn, setLookup);
} else {
return VTableSlot();
}
}
void VTable::updateSuper(VTableSlot slot) {
Type *s = owner->super();
if (!s)
return;
VTable *super = rawVTable(s);
if (Function *fn = get(slot)) {
useLookup(fn, slot);
} else {
// Keep on looking!
super->updateSuper(slot);
}
}
Bool VTable::updateChildren(Function *fn, VTableSlot slot) {
if (!owner->chain)
return false;
OverridePart *p = new (this) OverridePart(fn);
bool found = false;
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next())
found |= rawVTable(c)->updateChildren(p, slot);
return found;
}
Bool VTable::updateChildren(OverridePart *fn, VTableSlot slot) {
bool found = false;
// Note: Do not attempt to eagerly load functions in the child class. Functions there will
// be loaded when the class is created, and we will be notified when that happens.
if (Function *f = as<Function>(owner->tryFindHere(fn, Scope()))) {
// If it is not known to us, we can not do anything useful with it.
if (VTableUpdater *u = updaters->get(f, null)) {
VTableSlot from = u->slot();
// If we do not need to change the slot, we do not need to recurse anymore. No other
// overriding functions need to be updated.
if (from == slot)
return true;
found = true;
// Otherwise, we need to change slot for this function:
set(slot, f);
u->slot(slot);
updateLookup(f, slot);
clear(from);
}
}
// Go on recursing!
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next())
found |= rawVTable(c)->updateChildren(fn, slot);
return found;
}
VTableSlot VTable::allocSlot() {
if (!storm) {
assert(false, L"Can not allocate slots for the C++ class " + ::toS(owner->name) +
L". Are you trying to override a non-virtual function?");
return VTableSlot();
}
nat slot = storm->freeSlot(stormFirst);
if (slot >= storm->count()) {
nat oldCount = storm->count();
// We need to resize 'storm'...
storm->resize(oldCount + stormGrow);
// Grow all child vtables as well.
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next())
rawVTable(c)->parentGrown(oldCount, stormGrow);
}
return stormSlot(slot);
}
void VTable::parentGrown(Nat pos, Nat count) {
if (storm)
storm->insert(pos, count);
if (pos >= stormFirst)
stormFirst += count;
TypeChain::Iter i = owner->chain->children();
while (Type *c = i.next())
rawVTable(c)->parentGrown(pos, count);
for (UpdateMap::Iter i = updaters->begin(), e = updaters->end(); i != e; ++i) {
Function *f = i.k();
VTableUpdater *u = i.v();
VTableSlot slot = u->slot();
// Relevant to update?
if (slot.type != VTableSlot::tStorm || slot.offset < pos)
continue;
// Update!
VTableSlot to = slot;
to.offset += count;
set(to, f);
u->slot(to);
updateLookup(f, to);
clear(slot);
}
}
void VTable::useLookup(Function *fn, VTableSlot slot) {
code::RefSource *src = fn->engine().vtableCalls()->get(slot, fn->result);
fn->setLookup(new (fn) DelegatedCode(code::Ref(src)));
}
void VTable::updateLookup(Function *fn, VTableSlot slot) {
if (fn->ref().address() != fn->directRef().address())
useLookup(fn, slot);
}
void VTable::set(VTableSlot slot, Function *fn) {
switch (slot.type) {
case VTableSlot::tCpp:
cpp->set(slot.offset, fn);
break;
case VTableSlot::tStorm:
if (storm)
storm->set(slot.offset, fn);
break;
default:
assert(false, L"Unknown slot type.");
break;
}
}
void VTable::set(VTableSlot slot, const void *addr) {
switch (slot.type) {
case VTableSlot::tCpp:
cpp->set(slot.offset, addr);
break;
case VTableSlot::tStorm:
if (storm)
storm->set(slot.offset, addr);
break;
default:
assert(false, L"Unknown slot type.");
break;
}
}
Function *VTable::get(VTableSlot slot) {
switch (slot.type) {
case VTableSlot::tCpp:
return cpp->get(slot.offset);
case VTableSlot::tStorm:
if (storm)
return storm->get(slot.offset);
else
return null;
default:
assert(false, L"Unknown slot type.");
return null;
}
}
void VTable::clear(VTableSlot slot) {
switch (slot.type) {
case VTableSlot::tCpp:
cpp->clear(slot.offset);
break;
case VTableSlot::tStorm:
storm->clear(slot.offset);
break;
default:
assert(false, L"Unknown slot type.");
break;
}
}
}
|