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;
}
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;
}
void go()
{
int rf = KDE::resolverFlags;
printf("The resolver claims to:\n");
if(rf & KRF_USING_OWN_GETADDRINFO)
{
printf(" - Be using its own version of getaddrinfo()\n");
if(rf & KRF_CAN_RESOLVE_UNIX)
printf(" - Be able to resolve Unix-domain sockets\n");
else
printf(" - Be unable to resolve Unix-domain sockets -- This shouldn't happen\n");
if(rf & KRF_CAN_RESOLVE_IPV4)
printf(" - Be able to resolve IPv4 Internet sockets\n");
else
printf(" - Be unable to resolve IPv4 Internet sockets -- This shouldn't happen\n");
if(rf & KRF_CAN_RESOLVE_IPV6)
printf(" - Be able to resolve IPv6 Internet sockets\n");
else
printf(" - Be unable to resolve IPv6 Internet sockets\n");
}
else
printf(" - Be using the system getaddrinfo()\n");
if(rf & KRF_USING_OWN_INET_NTOP)
printf(" - Be using its own inet_ntop()\n");
else
printf(" - Be using the system inet_ntop()\n");
if(rf & KRF_USING_OWN_INET_PTON)
printf(" - Be using its own inet_pton()\n");
else
printf(" - Be using the system inet_pton()\n");
if(rf & KRF_KNOWS_AF_INET6)
printf(" - To know the value of AF_INET6\n");
else
printf(" - Not to know the value of AF_INET6\n");
printf("\n\nGeneral conclusion is:\n");
if((rf & KRF_USING_OWN_GETADDRINFO) == 0 && rf & KRF_KNOWS_AF_INET6)
printf(
" Your system probably supports full IPv6 implementation.\n"
" This depends on whether your system's getaddrinfo() supports IPv6.\n"
" However, KDE Libraries were compiled to use the support whenever available.\n");
else if((rf & (KRF_USING_OWN_GETADDRINFO | KRF_KNOWS_AF_INET6)) == 0)
printf(
" Your system supports partial IPv6 implementation.\n"
" That is, your system has a getaddrinfo() implementation, but KDE Libraries\n"
" don't know how to detect an IPv6 socket. That means that only request to"
" any kind of socket will use IPv6, if your getaddrinfo() returns them.");
else if(rf & KRF_USING_OWN_GETADDRINFO)
{
if(rf & KRF_KNOWS_AF_INET6)
{
printf(" Your system supports partial IPv6 implementation.\n");
if(rf & KRF_CAN_RESOLVE_IPV6)
printf(
" The KDE implementation of getaddrinfo() claims to be able to resolve\n"
" IPv6 lookups and the value of AF_INET6 is known.\n");
else
printf(
" The KDE implementation of getaddrinfo() cannot resolve IPv6 lookups.\n"
" That means that IPv6 support is limited to two addresses (:: and ::1)\n");
}
else
printf(" Your system doesn't support IPv6\n");
}
/* Make sure KSocks doesn't interfere in testing */
KSocks::disable();
/* Begin testing */
printf("\nReady to start testing\nPress any key to continue...");
getchar();
printf("\n");
/* Start with simple lookups */
printf(
"Trying simple lookups\n"
"All of the following look ups should work\n\n");
tryLookup(NULL, "/tmp/something");
tryLookup("127.0.0.1", "80");
tryLookup("localhost", "http");
#ifdef AF_INET6
printf("\nPress any key for next test");
getchar();
printf("\nThis test determines if the inet_ntop and inet_pton functions work\n");
try_ntop();
try_pton();
#endif
printf("\nPress any key for next test");
getchar();
printf("\nThis test determines how far the IPv6 resolution can go\n");
if(!tryLookup6("::1", "80"))
printf("Your system can't resolve a numeric IPv6 address\n");
else if(!tryLookup6("localhost", "80"))
printf("Your system can resolve a numeric IPv6 address, but not localhost\n");
else if(!tryLookup6("www.6bone.net", "80"))
printf(
"Your system can resolve numeric IPv6 addresses and localhost, \n"
"but cannot resolve an external address to IPv6 (www.6bone.net)\n");
else
printf("Your system can resolve any kind of IPv6 addresses\n");
printf("\nPress any key for next test");
getchar();
printf("\nThis test determines how supported IPv6 is in your kernel\n");
testKernel();
printf("\nPress any key for next test");
getchar();
printf("\nThis test determines if you can connect to IPv6 addresses via TCP\n");
tryConnectLocal();
tryConnectRemote();
printf("\n\nTest finished\n");
}
