static void PPDrive(
void *theEnv,
struct partialMatch *lhsBinds,
struct partialMatch *rhsBinds,
struct joinNode *join)
{
struct partialMatch *linker;
struct joinNode *listOfJoins;
/*==================================================*/
/* Merge the alpha and beta memory partial matches. */
/*==================================================*/
linker = MergePartialMatches(theEnv,lhsBinds,rhsBinds,
(join->ruleToActivate == NULL) ? 0 : 1,
(int) join->logicalJoin);
/*=======================================================*/
/* Add the partial match to the beta memory of the join. */
/*=======================================================*/
linker->next = join->beta;
join->beta = linker;
/*====================================================*/
/* Activate the rule satisfied by this partial match. */
/*====================================================*/
if (join->ruleToActivate != NULL) AddActivation(theEnv,join->ruleToActivate,linker);
/*================================================*/
/* Send the new partial match to all child joins. */
/*================================================*/
listOfJoins = join->nextLevel;
if (listOfJoins != NULL)
{
if (((struct joinNode *) (listOfJoins->rightSideEntryStructure)) == join)
{ NetworkAssert(theEnv,linker,listOfJoins,RHS); }
else while (listOfJoins != NULL)
{
NetworkAssert(theEnv,linker,listOfJoins,LHS);
listOfJoins = listOfJoins->rightDriveNode;
}
}
return;
}
globle void PPDrive(
void *theEnv,
struct partialMatch *lhsBinds,
struct partialMatch *rhsBinds,
struct joinNode *join)
{
struct partialMatch *linker;
struct joinLink *listOfJoins;
unsigned long hashValue;
/*================================================*/
/* Send the new partial match to all child joins. */
/*================================================*/
listOfJoins = join->nextLinks;
if (listOfJoins == NULL) return;
/*===============================================================*/
/* In the current implementation, all children of this join must */
/* be entered from the same side (either all left or all right). */
/*===============================================================*/
while (listOfJoins != NULL)
{
/*==================================================*/
/* Merge the alpha and beta memory partial matches. */
/*==================================================*/
linker = MergePartialMatches(theEnv,lhsBinds,rhsBinds);
/*================================================*/
/* Determine the hash value of the partial match. */
/*================================================*/
if (listOfJoins->enterDirection == LHS)
{
if (listOfJoins->join->leftHash != NULL)
{ hashValue = BetaMemoryHashValue(theEnv,listOfJoins->join->leftHash,linker,NULL,listOfJoins->join); }
else
{ hashValue = 0; }
}
else
{
if (listOfJoins->join->rightHash != NULL)
{ hashValue = BetaMemoryHashValue(theEnv,listOfJoins->join->rightHash,linker,NULL,listOfJoins->join); }
else
{ hashValue = 0; }
}
/*=======================================================*/
/* Add the partial match to the beta memory of the join. */
/*=======================================================*/
UpdateBetaPMLinks(theEnv,linker,lhsBinds,rhsBinds,listOfJoins->join,hashValue,listOfJoins->enterDirection);
if (listOfJoins->enterDirection == LHS)
{ NetworkAssertLeft(theEnv,linker,listOfJoins->join); }
else
{ NetworkAssertRight(theEnv,linker,listOfJoins->join); }
listOfJoins = listOfJoins->next;
}
return;
}
