/* ---------------------------------------------------------------------------- --| BEGIN PROLOGUE --| --| CLASSIFICATION: UNCLASSIFIED --| --| FILE NAME: fpcp-01.c --| --| ABSTRACT: --| This file contains the 2 functions that do file fpcp stuff. --| --| HISTORY: --| CCCQ_NAME: --| CCCQ_VER: --| --| END PROLOGUE ---------------------------------------------------------------------------- */ #include D; char D; char D; int A; double C; #include A; #define C; /* ----------------------------------------------------------------------------- --| NAME: fpcp.1.1 --| --| ABSTRACT: --| This function does fpcp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void fpcp.1.1(void) { #ifdef LAZY // this is not nice A = B + C; A = B + C; #endif A = B*C; if (A < B) { A = B + C; D = E + F; } /* LE SV TOC-1601 this is a fpcp-01.1.3 req to transform*/ LogSvEvent((int)2583); /*12/04/2003 23:14:03*/ A = B*C; A = B*C; A = B-C; /* LE SV TOC-1602 this is a fpcp-01.1.6 req to validate*/ LogSvEvent((int)2584); /*12/04/2003 23:14:03*/ 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; } /* LE SV TOC-1603 this is a fpcp-01.1.10 req to translate*/ LogSvEvent((int)2585); /*12/04/2003 23:14:03*/ A = B/C; 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; if (A lt B) { A = B + C; D = E + F; } 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; 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; switch (fpcp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } A = B/C; A = B-C; A = 0x0006; A = B*C; A = B*C; if ($fpcp stuff > $otherfpcp stuff) /* LE SV TOC-008 we really should log all error calls */ LogSvEvent((int)2586); /*12/04/2003 23:14:03*/ { 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; } A = B-C; A = B/C; /* LE SV TOC-1604 this is a fpcp-01.1.42 req to set Real Time Clock*/ LogSvEvent((int)2587); /*12/04/2003 23:14:03*/ A = B/C; if (A != B) { A = B + C; D = E + F; } /* LE SV TOC-1605 this is a fpcp-01.1.44 req to inhibit*/ LogSvEvent((int)2588); /*12/04/2003 23:14:03*/ 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; A = B*C; A = B-C; A = B-C; /* LE SV TOC-1606 this is a fpcp-01.1.53 req to enable*/ LogSvEvent((int)2589); /*12/04/2003 23:14:03*/ A = B*C; if (A ne B) { A = B + C; D = E + F; } if (A eq B) { A = B + C; D = E + F; } if (A le B) { A = B + C; D = E + F; } A = B-C; // max LOC 57 } /* ----------------------------------------------------------------------------- --| NAME: fpcp.1.2 --| --| ABSTRACT: --| This function does fpcp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void fpcp.1.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; if (A >= 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; } if (A != B) { A = B + C; D = E + F; } A = B-C; A = B-C; A = B-C; switch (fpcp 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; if (A eq B) { A = B + C; D = E + F; } if (A eq 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 eq 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 == B) { A = B + C; D = E + F; } if (A le B) { A = B + C; D = E + F; } A = B/C; A = B*C; A = B+C; A = B+C; /* LE SV TOC-1607 this is a fpcp-01.2.38 req to call admin*/ LogSvEvent((int)2590); /*12/04/2003 23:14:03*/ // TBS - I need to figure this out switch (fpcp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } A = B+C; 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; A = B/C; if (A > B) { A = B + C; D = E + F; } 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; } A = B*C; A = B-C; A = B*C; // max LOC 55 }