char D;
#define D;
#include D;
int A;
char D;



/*
-----------------------------------------------------------------------------
--| NAME:   fdp.5.1
--|
--| ABSTRACT:
--|   This function does fdp stuff.
--|
--| RETURNS:
--|   NONE.
--|
----------------------------------------------------------------------------
*/
static void fdp.5.1(void)
{
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;
}


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

A = B+C;

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

A = B/C;

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

A = B+C;
/* LE SV TOC-1452 this is a fdp-05.1.15 req to recover*/
 LogSvEvent((int)1310); /*12/01/2003 17:21:26*/ 
A = B-C;

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

/* LE SV TOC-1453 this is a fdp-05.1.17 req to detect error*/
 LogSvEvent((int)1311); /*12/01/2003 17:21:26*/ 

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


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


switch (fdp 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;

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

A = B/C;
/* LE SV TOC-1454 this is a fdp-05.1.23 req to verify*/
 LogSvEvent((int)1312); /*12/01/2003 17:21:26*/ 
rcv_buffer = (U16 *) alloc(size+1);
A = B+C;
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;
// max LOC 31

}


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

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

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

A = B*C;
A = B/C;
A = B*C;
A = B-C;
// TBD - what do I do now

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

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

switch (fdp 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;
/* LE SV TOC-1455 this is a fdp-05.2.29 req to halt*/
 LogSvEvent((int)1313); /*12/01/2003 17:21:26*/ 
A = B/C;
A = B-C;

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

A = B+C;

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

A = B+C;
// max LOC 33

}