50         priors = priors_mult = counts = buf = direction = split_buf = 0;  in CvDTreeTrainData()
64         priors = priors_mult = counts = buf = direction = split_buf = 0;  in CvDTreeTrainData()
162         cvReleaseMat( &priors );  in CV_IMPLEMENT_QSORT_EX()
169         priors = data->priors; data->priors = 0;  in CV_IMPLEMENT_QSORT_EX()
508     have_priors = is_classifier && params.priors;  in CV_IMPLEMENT_QSORT_EX()
513         CV_CALL( priors = cvCreateMat( 1, m, CV_64F ));  in CV_IMPLEMENT_QSORT_EX()
516             double val = have_priors ? params.priors[i] : 1.;  in CV_IMPLEMENT_QSORT_EX()
519             priors->data.db[i] = val;  in CV_IMPLEMENT_QSORT_EX()
525             cvScale( priors, priors, 1./sum );  in CV_IMPLEMENT_QSORT_EX()
527         CV_CALL( priors_mult = cvCloneMat( priors ));  in CV_IMPLEMENT_QSORT_EX()
923     cvReleaseMat( &priors );  in clear()
1038     if( priors )  in write_params()
1039         cvWrite( fs, "priors", priors );  in write_params()
1107         priors = (CvMat*)cvReadByName( fs, tparams_node, "priors" );  in read_params()
1108         if( priors )  in read_params()
1110             if( !CV_IS_MAT(priors) )  in read_params()
1112             priors_mult = cvCloneMat( priors );  in read_params()
1459             const double* priors = data->priors_mult->data.db;  in calc_node_dir()  local
1465                 double w = priors[responses[i]];  in calc_node_dir()
1498             const double* priors = data->priors_mult->data.db;  in calc_node_dir()  local
1504                 double w = priors[responses[idx]];  in calc_node_dir()
1512                 double w = priors[responses[idx]];  in calc_node_dir()
1579     const double* priors = data->have_priors ? data->priors_mult->data.db : 0;  in find_split_ord_class()  local
1592     if( !priors )  in find_split_ord_class()
1625             double wv = rc[i]*priors[i];  in find_split_ord_class()
1634             double p = priors[idx], p2 = p*p;  in find_split_ord_class()
1775     const double* priors = data->priors_mult->data.db;  in find_split_cat_class()  local
1826             sum += cjk[j*m + k]*priors[k];  in find_split_cat_class()
1865                 double p = priors[k], p2 = p*p;  in find_split_cat_class()
1880                 double p = priors[k], p2 = p*p;  in find_split_cat_class()
2110         const double* priors = data->priors_mult->data.db;  in find_surrogate_split_ord()  local
2117             double w = priors[responses[idx]];  in find_surrogate_split_ord()
2132             double w = priors[responses[idx]];  in find_surrogate_split_ord()
2209         const double* priors = data->priors_mult->data.db;  in find_surrogate_split_cat()  local
2215             double w = priors[responses[i]];  in find_surrogate_split_cat()
2276         double* priors = data->priors_mult->data.db;  in calc_node_value()  local
2310                 priors[k] = data->priors->data.db[k]*(n_k ? 1./n_k : 0.);  in calc_node_value()
2311                 sum += priors[k];  in calc_node_value()
2315                 priors[k] *= sum;  in calc_node_value()
2320             double val = cls_count[k]*priors[k];  in calc_node_value()
2341                 double w = priors[k];  in calc_node_value()