Searched refs:numLocalChains (Results 1 – 3 of 3) sorted by relevance
4682 for (j=0; j<numLocalChains; j++) in FreeChainMemory()5680 for (i=j=0; i<numLocalChains; i++) in InitAdGamma()5733 for (i=0; i<numLocalChains; i++) in InitAugmentedModels()6127 for (i=0; i<numLocalChains; i++) in InitChainCondLikes()6133 for (i=0; i<numLocalChains; i++) in InitChainCondLikes()6161 for (j=0; j<numLocalChains; j++) in InitChainCondLikes()14051 if (numLocalChains == 1) in PrintToScreen()14331 for (i=0; i<numLocalChains; i++) in ReassembleParamVals()14785 if (j == numLocalChains) in RedistributeMoveInfo()16580 if (chn<numLocalChains) in RunChain()[all …]
55 extern int numLocalChains;84 … m->logLikelihoods = (MrBFlt *) SafeCalloc ((numLocalChains)*m->numChars, sizeof(MrBFlt)); in InitBeagleInstance()322 ((numLocalChains + 1) * nCijkParts) * numCurrentDivisions, in createBeagleInstance()1588 m->logLikelihoodsAll = (MrBFlt *) SafeCalloc ((numLocalChains)*m->numCharsAll, sizeof(MrBFlt)); in InitBeagleMultiPartitionInstance()2051 … divisionCijkIndex = m->cijkIndex[chain] + (numLocalChains + 1) * m->nCijkParts * m->divisionIndex; in TreeTiProbs_BeagleMultiPartition()2645 divisionOffset = (numLocalChains + 1) * m->nCijkParts * m->divisionIndex; in TreeLikelihood_BeagleMultiPartition()2772 divisionOffset = (numLocalChains + 1) * m->nCijkParts * m->divisionIndex; in TreeLikelihood_BeagleMultiPartition()
53 extern int numLocalChains;10669 divisionOffset = (numLocalChains + 1) * m->nCijkParts * m->divisionIndex; in UpDateCijk()10769 … divisionOffset = (numLocalChains + 1) * m->nCijkParts * m->divisionIndex; in UpDateCijk()