File: iterate.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 (57 lines) | stat: -rw-r--r-- 1,492 bytes parent folder | download
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
 /*
 *  methods/iterate.c
 *  
 *  Calculate the sum of a given range of integer numbers.
 *
 *  This particular method of implementation works by way of brute force,
 *  i.e. it iterates over the entire range while adding the numbers to finally
 *  get the total sum. As a positive side effect, we're able to easily detect
 *  overflows, i.e. situations in which the sum would exceed the capacity
 *  of an integer variable.
 *
 */

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

void test_data_logging(int, int);

int iterate_get_sum (int min, int max)
{
        int i, total;

	test_data_logging(min, max);

        total = 0;

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

        for (i = min; i <= max; 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. */

                total += i;
        }

        return total;
}

void
test_data_logging(int min, int max)
{
  (void)min; /* quiet compiler complaints */
  (void)max;
  printf("this is some debug data logging code that gets removed in the final product\n");
}