Lines Matching defs:npart
369 int const npart = gd->npart;
370 int const b_lim = bo_sb < npart ? bo_sb : npart;
378 if (b >= npart) {
571 for (b = j = 0; b < l->npart; ++b) {
620 for (b = 1; b < gdl->npart - 1; b++) {
642 assert(b == gdl->npart - 1);
661 assert(b == (gdl->npart - 1));
959 int const n = gfc->cd_psy->s.npart;
995 for (b = 1; b < gds->npart - 1; b++) {
997 assert(b + 1 < gds->npart);
1018 assert(b == gds->npart - 1);
1037 assert(b == (gds->npart - 1));
1054 for (b = j = 0; b < gds->npart; ++b) {
1070 assert(b == gds->npart);
1073 for (j = b = 0; b < gds->npart; b++) {
1165 for (b = 0; b < gdl->npart; b++) {
1471 ath_factor, cfg->msfix, gdl->npart);
1500 ath_factor, cfg->msfix, gds->npart);
1755 gd->npart = ni;
1759 for (i = 0; i < gd->npart; i++) {
1809 int k, j = 0, ni = gd->npart;
1827 init_s3_values(FLOAT ** p, int (*s3ind)[2], int npart,
1845 for (i = 0; i < npart; i++) {
1846 for (j = 0; j < npart; j++) {
1851 for (i = 0; i < npart; i++) {
1852 for (j = 0; j < npart; j++) {
1858 for (j = npart - 1; j > 0; j--) {
1870 for (i = 0; i < npart; i++)
1941 assert(gd->l.npart < CBANDS);
1945 for (i = 0; i < gd->l.npart; i++) {
1953 i = init_s3_values(&gd->l.s3, gd->l.s3ind, gd->l.npart, bval, bval_width, norm);
1959 for (i = 0; i < gd->l.npart; i++) {
2001 assert(gd->s.npart < CBANDS);
2006 for (i = 0; i < gd->s.npart; i++) {
2052 i = init_s3_values(&gd->s.s3, gd->s.s3ind, gd->s.npart, bval, bval_width, norm);
2075 for (b = 0; b < gd->l.npart; b++)
2076 if (gd->l.s3ind[b][1] > gd->l.npart - 1)
2077 gd->l.s3ind[b][1] = gd->l.npart - 1;
2089 assert(gd->l.bo[SBMAX_l - 1] <= gd->l.npart);
2090 assert(gd->s.bo[SBMAX_s - 1] <= gd->s.npart);
2111 for (b = j = 0; b < gd->s.npart; ++b) {
2117 for (b = j = 0; b < gd->l.npart; ++b) {
2148 for (; b < gd->s.npart; b++) {
2149 float m = (float) (gd->s.npart - b) / gd->s.npart;
2156 for (; b < gd->l.npart; b++) {
2157 float m = (float) (gd->l.npart - b) / gd->l.npart;