- if (nr_distrib == 4) {
- int bit_i, bit_j;
-
- for (bit_i = 0; bit_i < 8; bit_i++) {
- for (bit_j = 0; bit_j < bit_i; bit_j++) {
- int distance_to_best[4], subclass_len[4];
-
- distance_to_best[0] = (nr_2d_11[bit_i][bit_j] << 2U) - sel_pool_len;
- distance_to_best[1] = (nr_2d_10[bit_i][bit_j] << 2U) - sel_pool_len;
- distance_to_best[2] = (nr_2d_01[bit_i][bit_j] << 2U) - sel_pool_len;
- distance_to_best[3] = (nr_2d_00[bit_i][bit_j] << 2U) - sel_pool_len;
-
- subclass_len[0] = nr_2d_11[bit_i][bit_j];
- subclass_len[1] = nr_2d_10[bit_i][bit_j];
- subclass_len[2] = nr_2d_01[bit_i][bit_j];
- subclass_len[3] = nr_2d_00[bit_i][bit_j];
-
- /* Consider worse distance above best */
- if (distance_to_best[1] > 0 && distance_to_best[1] > distance_to_best[0]) {
- distance_to_best[0] = distance_to_best[1];
- subclass_len[0] = subclass_len[1];
- }
- if (distance_to_best[2] > 0 && distance_to_best[2] > distance_to_best[0]) {
- distance_to_best[0] = distance_to_best[2];
- subclass_len[0] = subclass_len[2];
- }
- if (distance_to_best[3] > 0 && distance_to_best[3] > distance_to_best[0]) {
- distance_to_best[0] = distance_to_best[3];
- subclass_len[0] = subclass_len[3];
- }
+static
+void stat_count_2d(void)
+{
+ int overall_best_distance = INT_MAX;
+ unsigned int overall_minsubclass_len = 0;
+ int bit_i, bit_j;
+
+ for (bit_i = 0; bit_i < 8; bit_i++) {
+ for (bit_j = 0; bit_j < bit_i; bit_j++) {
+ int distance_to_best[4], subclass_len[4];
+
+ distance_to_best[0] = ((unsigned int) nr_2d_11[bit_i][bit_j] << 2U) - sel_pool_len;
+ distance_to_best[1] = ((unsigned int) nr_2d_10[bit_i][bit_j] << 2U) - sel_pool_len;
+ distance_to_best[2] = ((unsigned int) nr_2d_01[bit_i][bit_j] << 2U) - sel_pool_len;
+ distance_to_best[3] = ((unsigned int) nr_2d_00[bit_i][bit_j] << 2U) - sel_pool_len;
+
+ subclass_len[0] = nr_2d_11[bit_i][bit_j];
+ subclass_len[1] = nr_2d_10[bit_i][bit_j];
+ subclass_len[2] = nr_2d_01[bit_i][bit_j];
+ subclass_len[3] = nr_2d_00[bit_i][bit_j];
+
+ /* Consider worse distance above best */
+ if (distance_to_best[1] > 0 && distance_to_best[1] > distance_to_best[0]) {
+ distance_to_best[0] = distance_to_best[1];
+ subclass_len[0] = subclass_len[1];
+ }
+ if (distance_to_best[2] > 0 && distance_to_best[2] > distance_to_best[0]) {
+ distance_to_best[0] = distance_to_best[2];
+ subclass_len[0] = subclass_len[2];
+ }
+ if (distance_to_best[3] > 0 && distance_to_best[3] > distance_to_best[0]) {
+ distance_to_best[0] = distance_to_best[3];
+ subclass_len[0] = subclass_len[3];
+ }