Searched refs:isPartAmbig (Results 1 – 4 of 4) sorted by relevance
246 if (p->left->left == NULL && m->isPartAmbig[p->left->index] == NO) in CondLikeDown_Gen()274 if (p->right->left == NULL && m->isPartAmbig[p->right->index] == NO) in CondLikeDown_Gen()432 if (p->left->left == NULL && m->isPartAmbig[p->left->index] == NO) in CondLikeDown_Gen_SSE()640 if (p->left->left == NULL && m->isPartAmbig[p->left->index] == NO) in CondLikeDown_Gen_GibbsGamma()2257 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_Gen()2515 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_Gen_SSE()2817 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_Gen_GibbsGamma()3038 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_NUC4()3276 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_NUC4_GibbsGamma()4091 if (m->isPartAmbig[p->anc->index] == YES) in CondLikeRoot_NY98()[all …]
105 if (m->isPartAmbig[i] == YES || beagleAllFloatTips) in InitBeagleInstance()107 if (m->isPartAmbig[i] == YES) in InitBeagleInstance()130 if (m->isPartAmbig[i] == NO && !(beagleAllFloatTips)) in InitBeagleInstance()132 if (m->isPartAmbig[i] == NO) in InitBeagleInstance()1606 if (m->isPartAmbig[i] == YES) in InitBeagleMultiPartitionInstance()
1310 int *isPartAmbig; /* is tip partially ambiguous? */ member
307 int *isPartAmbig = NULL; /* records whether tips are partially ambiguous */ variable4747 free (isPartAmbig); in FreeChainMemory()4748 isPartAmbig = NULL; in FreeChainMemory()18627 isPartAmbig = (int *) SafeCalloc (numLocalTaxa*numCurrentDivisions, sizeof(int)); in SetUpTermState()18628 if (isPartAmbig) in SetUpTermState()18638 isPartAmbig[i] = NO; in SetUpTermState()18674 m->isPartAmbig = isPartAmbig + numLocalTaxa * d; in SetUpTermState()18695 m->isPartAmbig[i] = YES; in SetUpTermState()