/*
----------------------------------------------------------------------------
--| BEGIN PROLOGUE
--|
--| CLASSIFICATION: UNCLASSIFIED
--|
--| FILE NAME:      ca-02.c
--|
--| ABSTRACT:
--|   This file contains the 8 functions that do file ca stuff.
--|
--| HISTORY:
--|   CCCQ_NAME:
--|   CCCQ_VER: 
--|
--| END PROLOGUE
----------------------------------------------------------------------------
*/

double C;
#include A;
#define C;
#include D;
double C;
#define C;



/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.1
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.1(void)
{
A = B-C;
A = B/C;
A = B+C;
A = B*C;
A = B+C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B+C;
A = B-C;
A = B+C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = B+C;
/* LE SV TOC-1030 this is a ca-02.1.16 req to audit*/
 LogSvEvent((int)1031); /*12/01/2003 17:21:26*/ 
A = B+C;
/* LE SV TOC-1031 this is a ca-02.1.17 req to compare*/
 LogSvEvent((int)1032); /*12/01/2003 17:21:26*/ 
A = B-C;
/* LE SV TOC-1032 this is a ca-02.1.18 req to update*/
 LogSvEvent((int)1033); /*12/01/2003 17:21:26*/ 
A = B*C;
A = B+C;
A = B-C;
A = B-C;
A = B*C;
A = B+C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B+C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B-C;
A = B*C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B/C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A ge B)
{
   A = B + C;
   D = E + F;
}

A = B-C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B*C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B+C;
A = B*C;
A = B-C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}


if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B*C;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

/* LE SV TOC-1033 this is a ca-02.1.50 req to store*/
 LogSvEvent((int)1034); /*12/01/2003 17:21:26*/ 
A = (float)B + C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}


if (A != B)
{
   A = B + C;
   D = E + F;
}

A = 0x0009;
A = B/C;
A = B/C;
A = B/C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}


if (A < B)
{
   A = B + C;
   D = E + F;
}


if (A == B)
{
   A = B + C;
   D = E + F;
}


if (A gt B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B/C;
A = B*C;
A = B/C;
A = B-C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

/* LE SV TOC-1034 this is a ca-02.1.66 req to set RTC*/
 LogSvEvent((int)1035); /*12/01/2003 17:21:26*/ 

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B+C;
A = B+C;
A = B+C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A ge B)
{
   A = B + C;
   D = E + F;
}


if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
/* dead_code = A * B; */
A = B+C;
/* LE SV TOC-1035 this is a ca-02.1.77 req to compare*/
 LogSvEvent((int)1036); /*12/01/2003 17:21:26*/ 

if (A le B)
{
   A = B + C;
   D = E + F;
}


if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
// max LOC 79

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.2
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.2(void)
{
A = B/C;
A = B/C;

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B+C;
A = B/C;
A = B+C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = 0x0001;
A = B+C;
A = B*C;
A = 0x0008;
A = B-C;
A = B+C;
A = B/C;
A = B*C;
A = B-C;

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
/* LE SV TOC-1036 this is a ca-02.2.19 req to set RTC*/
 LogSvEvent((int)1037); /*12/01/2003 17:21:26*/ 

if (A le B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B+C;
// max LOC 22

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.3
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.3(void)
{
A = B+C;
A = B+C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B-C;
A = B/C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}


if (A == B)
{
   A = B + C;
   D = E + F;
}


if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B-C;
/* LE SV TOC-1037 this is a ca-02.3.12 req to translate*/
 LogSvEvent((int)1038); /*12/01/2003 17:21:26*/ 
A = B*C;

if (A == B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
FreePtr = HmiStringPtr;
A = B/C;

if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = 0x0004;

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = 0x0008;

if (A > B)
{
   A = B + C;
   D = E + F;
}


if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
send_buffer = (U16 *) malloc(size+1);

if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B-C;

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B/C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}


if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B/C;

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
/* dead_code = A * B; */
A = B*C;
A = B-C;
A = B+C;
A = B+C;
A = B-C;
A = B+C;
A = B/C;

if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B+C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      // missing break
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
      SwError;
   }
}

A = B*C;
A = B+C;

if (A < B)
{
   A = B + C;
   D = E + F;
}


if (A == B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B-C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


if (A le B)
{
   A = B + C;
   D = E + F;
}


if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
// max LOC 57

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.4
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.4(void)
{
A = B+C;
/* LE SV TOC-1038 this is a ca-02.4.2 req to halt*/
 LogSvEvent((int)1039); /*12/01/2003 17:21:26*/ 
A = B+C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

A = 0x0006;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = B/C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B*C;
A = B/C;
/* LE SV TOC-1039 this is a ca-02.4.11 req to increment*/
 LogSvEvent((int)1040); /*12/01/2003 17:21:26*/ 
A = B+C;
A = B/C;

if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = B+C;
A = B-C;
A = B/C;
A = B+C;
A = B+C;
A = B-C;
A = B*C;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

FreePtr = HmiStringPtr;

if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
/* LE SV TOC-1040 this is a ca-02.4.26 req to check unix*/
 LogSvEvent((int)1041); /*12/01/2003 17:21:26*/ 

switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B/C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}


if (A > B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B+C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}


if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = B-C;
A = B+C;
A = B/C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A ge B)
{
   A = B + C;
   D = E + F;
}

/* LE SV TOC-1041 this is a ca-02.4.41 req to halt*/
 LogSvEvent((int)1042); /*12/01/2003 17:21:26*/ 

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
/* LE SV TOC-1042 this is a ca-02.4.43 req to audit*/
 LogSvEvent((int)1043); /*12/01/2003 17:21:26*/ 
A = B*C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case:
   case:
   // stacked case statements but only if there is a new line in between

   case:
   case:
   case:
   {
      run_this;
      break;
   }
   default:
   {
      halt;
   }
}

A = B-C;
A = B+C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}

/* LE SV TOC-1043 this is a ca-02.4.48 req to check pSOS*/
 LogSvEvent((int)1044); /*12/01/2003 17:21:26*/ 
A = B*C;
A = B-C;
A = 0x0006;

if (A == B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B+C;
A = B+C;
A = B-C;
A = B*C;
A = B-C;
A = B*C;

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B/C;
A = B*C;
A = B*C;
A = B*C;

/* dead_code = B + C; 
dead_code = D + E; 
dead_code = F + G; */

A = B-C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}


if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B-C;

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B*C;
A = B/C;
A = B+C;
A = B-C;
A = B/C;
A = B+C;

if ($ca stuff > $otherca stuff) 
/* LE SV TOC-008 we really should log all error calls */
 LogSvEvent((int)1045); /*12/01/2003 17:21:26*/ 
{
   A = B + C;
}


switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B+C;
/* LE SV TOC-1044 this is a ca-02.4.79 req to recover*/
 LogSvEvent((int)1046); /*12/01/2003 17:21:26*/ 

switch (ca stuff)
{
   case one:
   {
      run_this;
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   // missing default
}

A = B-C;
A = B/C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
// (P) this is really improtant
A = B+C;

if (A le B)
{
   A = B + C;
   D = E + F;
}


if (A gt B)
{
   A = B + C;
   D = E + F;
}

// max LOC 85

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.5
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.5(void)
{
A = B+C;
A = B*C;
A = B*C;

if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B+C;
A = B+C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B/C;

if (A == B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B/C;
A = B+C;
A = B-C;
A = B-C;
A = B+C;

if (veg)
   // missing curly brace
   variable = orange;

A = B*C;

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B+C;
A = B-C;
A = B-C;
A = B-C;
A = B+C;
/* LE SV TOC-1045 this is a ca-02.5.27 req to call admin*/
 LogSvEvent((int)1047); /*12/01/2003 17:21:26*/ 

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B/C;

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B-C;

if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B+C;

if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B*C;

if (A == B)
{
   A = B + C;
   D = E + F;
}

/* LE SV TOC-1046 this is a ca-02.5.39 req to set Real Time Clock*/
 LogSvEvent((int)1048); /*12/01/2003 17:21:26*/ 

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B+C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A >= B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B-C;
A = B*C;
A = B*C;
A = B+C;
A = B+C;

/* 
dead_code = B - C; 
dead_code = D - E; 
dead_code = F - G;
*/

A = B-C;
A = B-C;
A = B/C;
A = B*C;
FreePtr = HmiStringPtr;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

A = 0x0004;
A = B+C;
A = B-C;

switch (ca stuff)
{
   case:
   case:
   // stacked case statements but only if there is a new line in between

   case:
   case:
   case:
   {
      run_this;
      break;
   }
   default:
   {
      halt;
   }
}

A = B/C;
A = B+C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B*C;
A = B*C;
A = B+C;

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B+C;

if (A < B)
{
   A = B + C;
   D = E + F;
}


if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B*C;
A = B-C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

// ??? go see ws
A = B*C;
// max LOC 71

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.6
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.6(void)
{

if (A ne B)
{
   A = B + C;
   D = E + F;
}


if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}


if (A lt B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case one:
   {
      switch (nested)
      {
         case:
            X = Y + Z;
         case:
            X = Y + Z;
         default:
            SwError;
      } 
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
      SwError;
   }
}

A = B/C;
A = B*C;
goto error;
A = B+C;
A = B+C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = 0x0002;
A = B/C;
A = B+C;
A = B*C;
// max LOC 14

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.7
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.7(void)
{

if (A == B)
{
   A = B + C;
   D = E + F;
}

send_buffer = (U16 *) malloc(size+1);

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B-C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B*C;

if (A == B)
{
   A = B + C;
   D = E + F;
}


if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B/C;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

A = B/C;

if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B-C;
A = B+C;

if (A gt B)
{
   A = B + C;
   D = E + F;
}

do forever;
A = B-C;
A = B-C;
A = B+C;
A = B+C;
A = B*C;
A = B*C;
A = B/C;
A = B/C;
A = B*C;
A = B/C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
/* LE SV TOC-1047 this is a ca-02.7.32 req to increment*/
 LogSvEvent((int)1049); /*12/01/2003 17:21:26*/ 

/*
dead_block = C * D; 
dead_block = E * F;
*/

A = B+C;

if (A < B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B*C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case:
   case:
   // stacked case statements but only if there is a new line in between

   case:
   case:
   case:
   {
      run_this;
      break;
   }
   default:
   {
      halt;
   }
}

A = B/C;

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B-C;

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
A = B*C;
A = B/C;

if (A ge B)
{
   A = B + C;
   D = E + F;
}


if (A <= B)
{
   A = B + C;
   D = E + F;
}


if (A >= B)
{
   A = B + C;
   D = E + F;
}


if (A <= B)
{
   A = B + C;
   D = E + F;
}


if (A > B)
{
   A = B + C;
   D = E + F;
}

A = B*C;

if (A le B)
{
   A = B + C;
   D = E + F;
}


if (A == B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B+C;
A = B-C;
A = B/C;

if (A eq B)
{
   A = B + C;
   D = E + F;
}


if (A eq B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
/* LE SV TOC-1048 this is a ca-02.7.60 req to set RTC*/
 LogSvEvent((int)1050); /*12/01/2003 17:21:26*/ 

if (A ne B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B-C;
/* LE SV TOC-1049 this is a ca-02.7.63 req to disable*/
 LogSvEvent((int)1051); /*12/01/2003 17:21:26*/ 
A = B+C;
A = B*C;
A = B*C;
A = B-C;
A = B*C;
A = B-C;
A = B+C;

if (A ne B)
{
   A = B + C;
   D = E + F;
}


if (A ge B)
{
   A = B + C;
   D = E + F;
}

A = B+C;
A = B-C;
A = B/C;
A = B*C;

if (A <= B)
{
   A = B + C;
   D = E + F;
}

A = B+C;

switch (ca stuff)
{
   case one:
   {
      run_this; 
      // missing break
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
      SwError;
   }
}

A = B*C;

if (A le B)
{
   A = B + C;
   D = E + F;
}

A = B*C;
// max LOC 80

}


/*
-----------------------------------------------------------------------------
--| NAME:   ca.2.8
--|
--| ABSTRACT:
--|   This function does ca stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void ca.2.8(void)
{
A = B*C;

if (A != B)
{
   A = B + C;
   D = E + F;
}

// ??? go see ws
A = B-C;

if (A le B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}


if (A <= B)
{
   A = B + C;
   D = E + F;
}


switch (ca stuff)
{
   case one:
   {
      run_this; 
      break;
   }
   case two:
   {
      run_this;
      break;
   }
   default:
   {
       SwError;
   }
}

A = B-C;

if (A lt B)
{
   A = B + C;
   D = E + F;
}

A = B/C;
A = B-C;
A = B-C;
A = B-C;
// max LOC 13

}