text: /* TEMPLATE GENERATED TESTCASE FILE
  Filename: CWE190_Integer_Overflow__int64_t_max_preinc_17.c
  Label Definition File: CWE190_Integer_Overflow.label.xml
  Template File: sources-sinks-17.tmpl.c
  */
  /*
   * @description
   * CWE: 190 Integer Overflow
   * BadSource: max Set data to the max value for int64_t
   * GoodSource: Set data to a small, non-zero number (two)
   * Sinks: increment
   *    GoodSink: Ensure there will not be an overflow before incrementing data
   *    BadSink : Increment data, which can cause an overflow
   * Flow Variant: 17 Control flow: for loops
   *
   * */
  
  #include "std_testcase.h"
  
  #ifndef OMITBAD
  
  void CWE190_Integer_Overflow__int64_t_max_preinc_17_bad()
  {
      int i,j;
      int64_t data;
      data = 0LL;
      for(i = 0; i < 1; i++)
      {
          /* POTENTIAL FLAW: Use the maximum size of the data type */
          data = LLONG_MAX;
      }
      for(j = 0; j < 1; j++)
      {
          {
              /* POTENTIAL FLAW: Incrementing data could cause an overflow */
              ++data;
              int64_t result = data;
              printLongLongLine(result);
          }
      }
  }
  
  #endif /* OMITBAD */
  
  #ifndef OMITGOOD
  
  /* goodB2G() - use badsource and goodsink in the for statements */
  static void goodB2G()
  {
      int i,k;
      int64_t data;
      data = 0LL;
      for(i = 0; i < 1; i++)
      {
          /* POTENTIAL FLAW: Use the maximum size of the data type */
          data = LLONG_MAX;
      }
      for(k = 0; k < 1; k++)
      {
          /* FIX: Add a check to prevent an overflow from occurring */
          if (data < LLONG_MAX)
          {
              ++data;
              int64_t result = data;
              printLongLongLine(result);
          }
          else
          {
              printLine("data value is too large to perform arithmetic safely.");
          }
      }
  }
  
  /* goodG2B() - use goodsource and badsink in the for statements */
  static void goodG2B()
  {
      int h,j;
      int64_t data;
      data = 0LL;
      for(h = 0; h < 1; h++)
      {
          /* FIX: Use a small, non-zero value that will not cause an overflow in the sinks */
          data = 2;
      }
      for(j = 0; j < 1; j++)
      {
          {
              /* POTENTIAL FLAW: Incrementing data could cause an overflow */
              ++data;
              int64_t result = data;
              printLongLongLine(result);
          }
      }
  }
  
  void CWE190_Integer_Overflow__int64_t_max_preinc_17_good()
  {
      goodB2G();
      goodG2B();
  }
  
  #endif /* OMITGOOD */
  
  /* Below is the main(). It is only used when building this testcase on
     its own for testing or for building a binary to use in testing binary
     analysis tools. It is not used when compiling all the testcases as one
     application, which is how source code analysis tools are tested. */
  
  #ifdef INCLUDEMAIN
  
  int main(int argc, char * argv[])
  {
      /* seed randomness */
      srand( (unsigned)time(NULL) );
  #ifndef OMITGOOD
      printLine("Calling good()...");
      CWE190_Integer_Overflow__int64_t_max_preinc_17_good();
      printLine("Finished good()");
  #endif /* OMITGOOD */
  #ifndef OMITBAD
      printLine("Calling bad()...");
      CWE190_Integer_Overflow__int64_t_max_preinc_17_bad();
      printLine("Finished bad()");
  #endif /* OMITBAD */
      return 0;
  }
  
  #endif
  