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;
}
/**
* @brief Retrieve keys in an atomic and universal way.
*
* @pre The @p handle must be passed as returned from kdbOpen().
*
* @pre The @p returned KeySet must be a valid KeySet, e.g. constructed
* with ksNew().
*
* @pre The @p parentKey Key must be a valid Key, e.g. constructed with
* keyNew().
*
* If you pass NULL on any parameter kdbGet() will fail immediately without doing anything.
*
* The @p returned KeySet may already contain some keys, e.g. from previous
* kdbGet() calls. The new retrieved keys will be appended using
* ksAppendKey().
*
* If not done earlier kdbGet() will fully retrieve all keys under the @p parentKey
* folder recursively (See Optimization below when it will not be done).
*
* @note kdbGet() might retrieve more keys than requested (that are not
* below parentKey). These keys must be passed to calls of kdbSet(),
* otherwise they will be lost. This stems from the fact that the
* user has the only copy of the whole configuration and backends
* only write configuration that was passed to them.
* For example, if you kdbGet() "system/mountpoint/interest"
* you will not only get all keys below system/mountpoint/interest,
* but also all keys below system/mountpoint (if system/mountpoint
* is a mountpoint as the name suggests, but
* system/mountpoint/interest is not a mountpoint).
* Make sure to not touch or remove keys outside the keys of interest,
* because others may need them!
*
* @par Example:
* This example demonstrates the typical usecase within an application
* (without error handling).
*
* @include kdbget.c
*
* When a backend fails kdbGet() will return -1 with all
* error and warning information in the @p parentKey.
* The parameter @p returned will not be changed.
*
* @par Optimization:
* In the first run of kdbGet all requested (or more) keys are retrieved. On subsequent
* calls only the keys are retrieved where something was changed
* inside the key database. The other keys stay in the
* KeySet returned as passed.
*
* It is your responsibility to save the original keyset if you
* need it afterwards.
*
* If you want to be sure to get a fresh keyset again, you need to open a
* second handle to the key database using kdbOpen().
*
* @param handle contains internal information of @link kdbOpen() opened @endlink key database
* @param parentKey is used to add warnings and set an error
* information. Additionally, its name is a hint which keys
* should be retrieved (it is possible that more are retrieved, see Note above).
* - cascading keys (starting with /) will retrieve the same path in all namespaces
* - / will retrieve all keys
* @param ks the (pre-initialized) KeySet returned with all keys found
* will not be changed on error or if no update is required
* @see ksLookup(), ksLookupByName() for powerful
* lookups after the KeySet was retrieved
* @see kdbOpen() which needs to be called before
* @see kdbSet() to save the configuration afterwards and kdbClose() to
* finish affairs with the key database.
* @retval 1 if the keys were retrieved successfully
* @retval 0 if there was no update - no changes are made to the keyset then
* @retval -1 on failure - no changes are made to the keyset then
* @ingroup kdb
*/
int kdbGet (KDB * handle, KeySet * ks, Key * parentKey)
{
elektraNamespace ns = keyGetNamespace (parentKey);
if (ns == KEY_NS_NONE)
{
return -1;
}
Key * oldError = keyNew (keyName (parentKey), KEY_END);
copyError (oldError, parentKey);
if (ns == KEY_NS_META)
{
clearError (parentKey);
keyDel (oldError);
ELEKTRA_SET_ERRORF (104, parentKey, "metakey with name \"%s\" passed to kdbGet", keyName (parentKey));
return -1;
}
if (ns == KEY_NS_EMPTY)
{
ELEKTRA_ADD_WARNING (105, parentKey, "invalid key name passed to kdbGet");
}
int errnosave = errno;
Key * initialParent = keyDup (parentKey);
ELEKTRA_LOG ("now in new kdbGet (%s)", keyName (parentKey));
Split * split = splitNew ();
if (!handle || !ks)
{
clearError (parentKey);
ELEKTRA_SET_ERROR (37, parentKey, "handle or ks null pointer");
goto error;
}
elektraGlobalGet (handle, ks, parentKey, PREGETSTORAGE, INIT);
elektraGlobalGet (handle, ks, parentKey, PREGETSTORAGE, MAXONCE);
elektraGlobalGet (handle, ks, parentKey, PREGETSTORAGE, DEINIT);
if (splitBuildup (split, handle, parentKey) == -1)
{
clearError (parentKey);
ELEKTRA_SET_ERROR (38, parentKey, "error in splitBuildup");
goto error;
}
// Check if a update is needed at all
switch (elektraGetCheckUpdateNeeded (split, parentKey))
{
case 0: // We don't need an update so let's do nothing
keySetName (parentKey, keyName (initialParent));
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, INIT);
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, MAXONCE);
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, DEINIT);
splitUpdateFileName (split, handle, parentKey);
keyDel (initialParent);
splitDel (split);
errno = errnosave;
keyDel (oldError);
return 0;
case -1:
goto error;
// otherwise fall trough
}
// Appoint keys (some in the bypass)
if (splitAppoint (split, handle, ks) == -1)
{
clearError (parentKey);
ELEKTRA_SET_ERROR (38, parentKey, "error in splitAppoint");
goto error;
}
if (handle->globalPlugins[POSTGETSTORAGE][FOREACH] || handle->globalPlugins[POSTGETCLEANUP][FOREACH])
{
clearError (parentKey);
if (elektraGetDoUpdateWithGlobalHooks (NULL, split, NULL, parentKey, initialParent, FIRST) == -1)
{
goto error;
}
else
{
copyError (parentKey, oldError);
}
keySetName (parentKey, keyName (initialParent));
if (splitGet (split, parentKey, handle) == -1)
{
ELEKTRA_ADD_WARNING (108, parentKey, keyName (ksCurrent (ks)));
// continue, because sizes are already updated
}
ksClear (ks);
splitMerge (split, ks);
clearError (parentKey);
if (elektraGetDoUpdateWithGlobalHooks (handle, split, ks, parentKey, initialParent, LAST) == -1)
{
goto error;
}
else
{
copyError (parentKey, oldError);
}
}
else
{
/* Now do the real updating,
but not for bypassed keys in split->size-1 */
clearError (parentKey);
if (elektraGetDoUpdate (split, parentKey) == -1)
{
goto error;
}
else
{
copyError (parentKey, oldError);
}
/* Now post-process the updated keysets */
if (splitGet (split, parentKey, handle) == -1)
{
ELEKTRA_ADD_WARNING (108, parentKey, keyName (ksCurrent (ks)));
// continue, because sizes are already updated
}
/* We are finished, now just merge everything to returned */
ksClear (ks);
splitMerge (split, ks);
}
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, INIT);
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, MAXONCE);
elektraGlobalGet (handle, ks, parentKey, POSTGETSTORAGE, DEINIT);
ksRewind (ks);
keySetName (parentKey, keyName (initialParent));
splitUpdateFileName (split, handle, parentKey);
keyDel (initialParent);
keyDel (oldError);
splitDel (split);
errno = errnosave;
return 1;
error:
keySetName (parentKey, keyName (initialParent));
elektraGlobalError (handle, ks, parentKey, POSTGETSTORAGE, INIT);
elektraGlobalError (handle, ks, parentKey, POSTGETSTORAGE, MAXONCE);
elektraGlobalError (handle, ks, parentKey, POSTGETSTORAGE, DEINIT);
keySetName (parentKey, keyName (initialParent));
if (handle) splitUpdateFileName (split, handle, parentKey);
keyDel (initialParent);
keyDel (oldError);
splitDel (split);
errno = errnosave;
return -1;
}
