File: iterate_mod.c

package info (click to toggle)
lcov 2.3.2-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 3,464 kB
  • sloc: perl: 27,911; sh: 7,320; xml: 6,982; python: 1,152; makefile: 597; cpp: 520; ansic: 176
file content (38 lines) | stat: -rw-r--r-- 978 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
 *  methods/iterate_mod.c
 *  
 *  identical to 'iterate.c', but with some trivial code changs to create
 *  differences - for differential coverage report.
 *
 */

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include "iterate.h"


int iterate_get_sum (int min, int max)
{
        int total = 0;

        /* This is where we loop over each number in the range, including
           both the minimum and the maximum number. */

        /* just reverse iteration order */
        for (int i = max; i >= min; total += i , --i)
        {
                /* We can detect an overflow by checking whether the new
                   sum would exceed the maximum integer value. */

                if (total > INT_MAX - i)
                {
                        printf ("Error: sum too large!\n");
                        exit (1);
                }

                /* Everything seems to fit into an int, so continue adding. */
        }

        return total;
}