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

#define C;



/*
-----------------------------------------------------------------------------
--| NAME:   wxp.6.1
--|
--| ABSTRACT:
--|   This function does wxp stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void wxp.6.1(void)
{
A = 0x0004;

if (A ge 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 < 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 = 0x0008;

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


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


if (A ge 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;
}


if (A gt 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;
/* LE SV TOC-3091 this is a wxp-06.1.24 req to compare*/
 LogSvEvent((int)2168); /*12/01/2003 17:21:26*/ 
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;
A = B/C;
A = B+C;
A = B*C;

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;

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

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

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

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


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 = (float)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 = 0x0004;

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

A = B+C;

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 = 0x0003;

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;
// max LOC 63

}


/*
-----------------------------------------------------------------------------
--| NAME:   wxp.6.2
--|
--| ABSTRACT:
--|   This function does wxp stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void wxp.6.2(void)
{
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 = 0x0009;
A = B*C;
FreePtr = HmiStringPtr;
A = B*C;
A = B*C;
A = B*C;

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


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;

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

A = B*C;
A = B-C;
/* LE SV TOC-3092 this is a wxp-06.2.23 req to set RTC*/
 LogSvEvent((int)2169); /*12/01/2003 17:21:26*/ 
A = B/C;

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

A = B*C;
A = B/C;
/* LE SV TOC-3093 this is a wxp-06.2.27 req to compare*/
 LogSvEvent((int)2170); /*12/01/2003 17:21:26*/ 
A = B*C;
A = B-C;

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

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

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


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

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;
/* LE SV TOC-3094 this is a wxp-06.2.43 req to detect error*/
 LogSvEvent((int)2171); /*12/01/2003 17:21:26*/ 

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


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


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

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

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

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

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

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

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


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

A = B/C;
A = B-C;
/* LE SV TOC-3095 this is a wxp-06.2.57 req to transform*/
 LogSvEvent((int)2172); /*12/01/2003 17:21:26*/ 
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-3096 this is a wxp-06.2.63 req to compare*/
 LogSvEvent((int)2173); /*12/01/2003 17:21:26*/ 
A = B-C;

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

/* LE SV TOC-3097 this is a wxp-06.2.65 req to check unix*/
 LogSvEvent((int)2174); /*12/01/2003 17:21:26*/ 
A = B-C;
A = B+C;
A = B-C;

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

A = B*C;

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


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

A = B-C;
A = B+C;
// max LOC 73

}


/*
-----------------------------------------------------------------------------
--| NAME:   wxp.6.3
--|
--| ABSTRACT:
--|   This function does wxp stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void wxp.6.3(void)
{
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 (A >= B)
{
   A = B + C;
   D = E + F;
}


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

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

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


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;
}

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

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


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

A = B+C;

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


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

A = B-C;
// max LOC 25

}