Lines Matching defs:nconv
2126 int nconv, conv;
2135 nconv = 0;
2140 for (j = 0; j < nconv; j++) {
2144 if (j == nconv) {
2145 convs[nconv++] = conv;
2148 if (nconv >= this->na_dacs) {
2162 for (k = 0; k < nconv; k++) {
2166 if (k == nconv)
2178 convs[nconv++] = conv;
2179 if (nconv >= this->na_dacs)
2198 int nconv, conv;
2201 nconv = fspkr = 0;
2204 for (j = 0; j < nconv; j++) {
2208 if (j == nconv) {
2211 convs[nconv++] = conv;
2212 if (nconv == this->na_dacs)
2223 for (j = 0; j < nconv; j++)
2226 if (j == nconv)
2679 variation += group->nconv * nbits;
2704 variation += group->nconv * nbits;
2726 for (c = 0; c < group->nconv; c++) {
2745 for (c = 0; c < group->nconv; c++) {
2837 for (i = 0; i < group->nconv; i++) {
2908 for (i = 0; i < group->nconv; i++) {
3005 for (j = 0; j < this->adcs.groups[i].nconv; j++) {
3015 for (j = 0; j < this->dacs.groups[i].nconv; j++) {
3118 for (j = 0; j < group->nconv; j++) {
3130 for (j = 0; j < group->nconv; j++) {
3146 for (j = 0; j < group->nconv; j++) {
3158 for (j = 0; j < group->nconv; j++) {
3532 for (n = 0; n < this->dacs.groups[i].nconv; n++) {
3539 for (n = 0; n < this->adcs.groups[i].nconv; n++) {