Lines Matching defs:nlgrps_max
318 int nlgrps_max;
341 nlgrps_max = snap->ss_nlgrps_max;
342 for (i = 0; i < nlgrps_max; i++) {
358 for (i = 0; i < nlgrps_max; i++) {
370 for (i = 0; i < nlgrps_max; i++) {
617 int nlgrps_max;
634 nlgrps_max = snap->ss_nlgrps_max;
635 if (lgrp >= nlgrps_max || !BT_TEST(snap->ss_lgrpset, lgrp)) {
661 lgrp_parents = &snap->ss_parents[lgrp * BT_BITOUL(nlgrps_max)];
672 for (i = 0; i < nlgrps_max; i++) {
693 int nlgrps_max;
711 nlgrps_max = snap->ss_nlgrps_max;
712 if (lgrp >= nlgrps_max || !BT_TEST(snap->ss_lgrpset, lgrp)) {
737 lgrp_children = &snap->ss_children[lgrp * BT_BITOUL(nlgrps_max)];
747 for (i = 0; i < nlgrps_max; i++) {
770 int nlgrps_max;
790 nlgrps_max = snap->ss_nlgrps_max;
791 rset = &lgrp_info->info_rset[LGRP_RSRC_CPU * BT_BITOUL(nlgrps_max)];
797 for (i = 0; i < nlgrps_max; i++) {
916 int nlgrps_max;
936 nlgrps_max = snap->ss_nlgrps_max;
937 if (lgrp >= nlgrps_max || snap->ss_info == NULL ||
981 BT_BITOUL(nlgrps_max)];
987 for (i = 0; i < nlgrps_max; i++) {
1027 int nlgrps_max;
1046 nlgrps_max = snap->ss_nlgrps_max;
1047 if (lgrp >= nlgrps_max || snap->ss_info == NULL ||
1062 rset = &lgrp_info->info_rset[type * BT_BITOUL(nlgrps_max)];
1137 int nlgrps_max;
1154 nlgrps_max = snap->ss_nlgrps_max;
1155 if (from >= nlgrps_max || to >= nlgrps_max) {