SExpr* SCodeScope::inlineMerge(SendInfo* info, MergeNode*& merge) {
// inline the send by type-casing; return uninlined cases in others list
// If merge has no predecessors, return NULL for merge ref.
SExpr* res = NULL;
assert(info->rcvr->isMergeSExpr(), "must be a merge");
MergeSExpr* r = (MergeSExpr*)info->rcvr;
stringOop sel = info->sel;
merge = NULL;
if (r->isSplittable() && shouldSplit(info)) {
return splitMerge(info, merge);
}
fint ncases = r->exprs->length();
if (ncases > SICTypeCaseLimit) {
info->needRealSend = true;
if (PrintInlining) {
lprintf("%*s*not type-casing %s (%ld > SICTypeCaseLimit)\n",
(void*)depth, "", selector_string(sel), (void*)ncases);
}
return res;
}
assert( merge == NULL, "I assume merge is out param only");
merge = new MergeNode("inlineMerge merge");
if (SICDebug) {
char* s = NEW_RESOURCE_ARRAY(char, 200);
sprintf(s, "begin type-case of %s (ends at node N%ld)",
sel->copy_null_terminated(), long(merge->id()));
theNodeGen->comment(s);
}
if (PrintInlining) {
lprintf("%*s*type-casing %s\n", (void*)depth, "", selector_string(sel));
}
// build list of cases to inline
// (add only immediate maps at first, collect others in ...2 lists
SSelfScopeBList* slist = new SSelfScopeBList(ncases);
SSelfScopeBList* slist2 = new SSelfScopeBList(ncases);
SExprBList* elist = new SExprBList(ncases);
SExprBList* elist2 = new SExprBList(ncases);
SExprBList* others = new SExprBList(ncases);
OopBList* mlist = new OopBList(ncases);
OopBList* mlist2 = new OopBList(ncases);
bool needMapLoad = false;
fint i;
for (i = 0; i < ncases; i++) {
SExpr* nth = r->exprs->nth(i);
assert(!nth->isConstantSExpr() || nth->next == NULL ||
nth->constant() == nth->next->constant(),
"shouldn't happen: merged consts - convert to map");
SSelfScope* s;
if (!nth->hasMap() || (s = tryLookup(info, nth)) == NULL) {
// cannot inline
others->append(nth);
info->needRealSend = true;
continue;
}
// can inline this case
// Notice that for immediates, instead of putting the constants in the mlist,
// we put the maps. No point in optimizing just for 17. -- dmu 6/05
Map* map = nth->map();
if (map == Memory->smi_map || map == Memory->float_map) {
slist ->append(s); // immediate maps go first
// Bug fix: instead of nth->shallowCopy, must generalize to any
// with same map, not just the same constant, because other ints (for example)
// will pass the type test, too. -- dmu 6/05
elist ->append(new MapSExpr(map->enclosing_mapOop(), r->preg(), NULL));
mlist ->append(map->enclosing_mapOop());
continue;
}
// can inline but not immediate map
slist2->append(s); // append later
elist2->append(nth->shallowCopy(r->preg(), NULL)); // use preg of merge
if (nth->isConstantSExpr()) {
mlist2->append(nth->constant());
}
else {
needMapLoad = true; // will need to load map of testee
mlist2->append(map->enclosing_mapOop());
}
}
mlist->appendList(mlist2);
elist->appendList(elist2);
slist->appendList(slist2);
// now do the type test and inline the individual cases
if (slist->length() > 0) {
memoizeBlocks(sel);
Node* typeCase =
theNodeGen->append(new TypeTestNode(r->preg(), mlist, needMapLoad,
info->needRealSend));
Node* fallThrough = typeCase->append(new NopNode);
for (i = 0; i < slist->length(); i++) {
theNodeGen->current = typeCase->append(i + 1, new NopNode);
SExpr* e = doInline(slist->nth(i), elist->nth(i), theNodeGen->current, merge);
if (!e->isNoResultSExpr()) {
theNodeGen->append(new NopNode);
e = e->shallowCopy(info->resReg, theNodeGen->current);
res = res ? res->mergeWith(e, merge) : e;
}
theNodeGen->branch(merge);
}
theNodeGen->current = fallThrough;
}
if (res && res->isMergeSExpr())
res->setNode(merge, info->resReg);
assert( info->needRealSend && others->length() ||
!info->needRealSend && !others->length(), "inconsistent");
// NB: *must* use uncommon branch if marked unlikely because
// future type tests won't test for unknown
if (others->isEmpty()) {
// typecase cannot fail
theNodeGen->deadEnd();
}
else if ( others->length() == 1
&& others->first()->isUnknownSExpr()
&& ((UnknownSExpr*)others->first())->isUnlikely()) {
// generate an uncommon branch for the unknown case, not a send
theNodeGen->uncommonBranch(currentExprStack(0), info->restartPrim);
info->needRealSend = false;
if (PrintInlining)
lprintf("%*s*making %s uncommon (2)\n", (void*)depth,"",selector_string(sel));
}
return res;
}
SExpr* SPrimScope::genPrimFailure(PrimNode* call, PReg* errorReg,
Node*& test, MergeNode*& merge,
PReg* resultReg, bool failure) {
// generate primitive failure code
// two modes:
// if call == NULL, omit the test for failure because it's already
// been generated (inlined prim.); in this case, errorReg
// must be set
// if call != NULL, generate test code (setting test & merge node args)
// returns the result of the failure branch
// pop prim args (they're not on the expr stack anymore in the fail branch)
while (npop-- > 0) exprStack()->pop();
SCodeScope* s = sender();
NodeGen* ng = theNodeGen;
if (call) {
fint b = bci();
SAPReg* t = new SAPReg(s, b, b);
// extract tag field and test for mark tag
ng->append(new ArithRCNode(AndArithOp, call->dest(), Tag_Mask, t));
ng->append(new ArithRCNode(SubCCArithOp, t, Tag_Mask, ng->noPR));
test = ng->append(new BranchNode(NEBranchOp));
// failure branch; load error string
if (!errorReg) errorReg = new SAPReg(s, b, b);
ng->current =
test->append(new ArithRCNode(SubArithOp, call->dest(),
Mark_Tag-Mem_Tag, errorReg));
}
SExpr* failReceiver = hasFailBlock ? failBlock : receiver;
SendInfo* info = new SendInfo(failReceiver, NormalLookupType, false, false,
(stringOop)failSelector, NULL);
info->computeNSends(rscope, bci());
info->primFailure = failure;
info->restartPrim = call == NULL; // restart inlined prims (unc. traps)
s->exprStack->push(failReceiver);
if (errorReg->isConstPReg()) {
s->exprStack->push(new ConstantSExpr(((ConstPReg*)errorReg)->constant,
errorReg, ng->current));
} else {
s->exprStack->push(new MapSExpr(Memory->stringObj->map()->enclosing_mapOop(),
errorReg, ng->current));
}
ConstPReg* failSelReg = new_ConstPReg(s, selector());
s->exprStack->push(new ConstantSExpr(selector(), failSelReg, NULL));
SExpr* res = s->inlineSend(info);
if (res->isNoResultSExpr()) {
// never returns
ng->current = merge; // set to NULL if no merge
}
else {
if (needZap) {
assert(failBlock->preg()->isBlockPReg(), "should be a block");
ng->zapBlock((BlockPReg*)failBlock->preg());
}
ng->move(res->preg(), resultReg);
res = res->shallowCopy(resultReg, ng->current);
// moved creation down from before if res->isNoResult...
// to avoid creating unreachable merge -- dmu
if (merge == NULL) merge = new MergeNode("genPrimFailure merge");
ng->append(merge);
}
return res;
}
SExpr* SCodeScope::inlineSend(SendInfo* info) {
stringOop sel = info->sel;
SExpr* res = NULL;
info->resReg = new SAPReg(this);
MergeNode* merge = NULL;
fint argc = sel->arg_count();
if (!Inline && !InlineSTMessages) {
// don't do any inlining
info->needRealSend = true;
} else {
info->rcvr = picPredict(info);
UnknownSExpr* u = info->rcvr->findUnknown();
if (u && !u->isUnlikely()) {
info->rcvr = typePredict(info);
}
if (info->rcvr->really_hasMap(this)) {
// single map - try to inline this send
SSelfScope* s = tryLookup(info, info->rcvr);
if (s) {
SExpr* r = doInline(s, info->rcvr, theNodeGen->current, NULL);
if (r->isNoResultSExpr()) {
res = r;
} else {
theNodeGen->append(new NopNode()); // to get right scope for r
res = r->shallowCopy(r->preg(), theNodeGen->current);
}
} else {
if (PrintInlining) {
lprintf("%*s*marking %s send ReceiverStatic\n",
(void*)depth,"", selector_string(sel));
}
// receiver type is constant (but e.g. method was too big to inline)
info->l |= ReceiverStaticBit;
info->needRealSend = true;
}
} else if (info->rcvr->isMergeSExpr()) {
res = inlineMerge(info, merge);
} else {
// unknown receiver
// NB: *must* use uncommon branch if marked unlikely because
// future type tests won't test for unknown
if (info->rcvr->findUnknown()->isUnlikely()) {
// generate an uncommon branch for the unknown case, not a send
theNodeGen->current = theNodeGen->uncommonBranch(currentExprStack(0),
info->restartPrim);
info->needRealSend = false;
if (PrintInlining) {
lprintf("%*s*making %s uncommon\n", (void*)depth,"",selector_string(sel));
}
} else {
info->needRealSend = true;
}
}
}
if (info->needRealSend) {
SExpr* r = genRealSend(info);
res = res ? res->mergeWith(r, merge) : r;
}
if (merge && res && !res->isNoResultSExpr()) theNodeGen->branch(merge);
// now pop expr stack
for (fint i = 0; i < argc; i++) exprStack->pop();
if (!info->isSelfImplicit) exprStack->pop();
if (!res) res = new NoResultSExpr;
return res;
}
