205 	       tree->times->t_prior_max[d->num]);  in TIMES_Print_Node_Times()
228   tree->times->t_prior_max[tree->n_root->num] =   in TIMES_Set_All_Node_Priors()
229     MIN(tree->times->t_prior_max[tree->n_root->num],  in TIMES_Set_All_Node_Priors()
230 	MIN(tree->times->t_prior_max[tree->n_root->v[2]->num],  in TIMES_Set_All_Node_Priors()
231 	    tree->times->t_prior_max[tree->n_root->v[1]->num]));  in TIMES_Set_All_Node_Priors()
297 	  t_sup = MIN(tree->times->t_prior_max[d->num],  in TIMES_Set_All_Node_Priors_Bottom_Up()
298 		      MIN(tree->times->t_prior_max[v1->num],  in TIMES_Set_All_Node_Priors_Bottom_Up()
299 			  tree->times->t_prior_max[v2->num]));  in TIMES_Set_All_Node_Priors_Bottom_Up()
301 	  tree->times->t_prior_max[d->num] = t_sup;  in TIMES_Set_All_Node_Priors_Bottom_Up()
303 	  if(tree->times->t_prior_max[d->num] < tree->times->t_prior_min[d->num])  in TIMES_Set_All_Node_Priors_Bottom_Up()
305 …"\n. prior_min=%f prior_max=%f",tree->times->t_prior_min[d->num],tree->times->t_prior_max[d->num]);  in TIMES_Set_All_Node_Priors_Bottom_Up()
313 	  tree->times->t_prior_max[d->num] =   in TIMES_Set_All_Node_Priors_Bottom_Up()
314 	    MIN(tree->times->t_prior_max[v1->num],  in TIMES_Set_All_Node_Priors_Bottom_Up()
315 		tree->times->t_prior_max[v2->num]);  in TIMES_Set_All_Node_Priors_Bottom_Up()
335 	  if(tree->times->t_prior_max[d->num] < tree->times->t_prior_min[d->num])  in TIMES_Set_All_Node_Priors_Top_Down()
337 …"\n. prior_min=%f prior_max=%f",tree->times->t_prior_min[d->num],tree->times->t_prior_max[d->num]);  in TIMES_Set_All_Node_Priors_Top_Down()
579   tp_max = tree->times->t_prior_max;  in TIMES_Lk_Yule_Order()
1148       tree->times->t_prior_max[i] = BIG;   in TIMES_Set_Calibration()
1175       tree->times->t_prior_max_ori[i] = tree->times->t_prior_max[i];  in TIMES_Record_Prior_Times()
1188       tree->times->t_prior_max[i] = tree->times->t_prior_max_ori[i];  in TIMES_Reset_Prior_Times()
1212   tp_max = tree->times->t_prior_max;  in TIMES_Lk_Yule_Order_Root_Cond()
1320            tree->times->nd_t[i] > tree->times->t_prior_max[i])   in TIMES_Lk_Birth_Death()
1325 … range : %G [%G,%G]",tree->times->nd_t[i],tree->times->t_prior_min[i],tree->times->t_prior_max[i]);  in TIMES_Lk_Birth_Death()
2286   for(i=0;i<2*n_otu-1;++i) to->t_prior_max[i] = from->t_prior_max[i];  in TIMES_Copy_Time_Struct()