/* ---------------------------------------------------------------------------- --| BEGIN PROLOGUE --| --| CLASSIFICATION: UNCLASSIFIED --| --| FILE NAME: dlp-02.c --| --| ABSTRACT: --| This file contains the 6 functions that do file dlp stuff. --| --| HISTORY: --| CCCQ_NAME: --| CCCQ_VER: --| --| END PROLOGUE ---------------------------------------------------------------------------- */ #include A; #include D; #define C; #include C; #define C; #define B; int A; #include D; #include C; /* ----------------------------------------------------------------------------- --| NAME: dlp.2.1 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.1(void) { 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; /* LE SV TOC-1205 this is a dlp-02.1.8 req to disable*/ LogSvEvent((int)1181); /*12/01/2003 16:20:36*/ 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; FreePtr = HmiStringPtr; A = B/C; A = 0x0004; A = B+C; A = B/C; A = B-C; // TBS - I need to figure this out 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; if (A <= B) { A = B + C; D = E + F; } A = B/C; /* LE SV TOC-1206 this is a dlp-02.1.27 req to compare*/ LogSvEvent((int)1182); /*12/01/2003 16:20:36*/ A = B-C; // max LOC 27 } /* ----------------------------------------------------------------------------- --| NAME: dlp.2.2 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.2(void) { switch (dlp stuff) { case one: { run_this; 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 eq 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; /* LE SV TOC-1207 this is a dlp-02.2.11 req to transform*/ LogSvEvent((int)1183); /*12/01/2003 16:20:36*/ A = B/C; /* LE SV TOC-1208 this is a dlp-02.2.12 req to set Real Time Clock*/ LogSvEvent((int)1184); /*12/01/2003 16:20:36*/ if (A lt B) { A = B + C; D = E + F; } A = (long)B + C; if (A ge 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; A = B+C; A = 0x0004; 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; 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 = B*C; // max LOC 33 } /* ----------------------------------------------------------------------------- --| NAME: dlp.2.3 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.3(void) { A = B/C; A = B*C; A = B*C; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } /* dead_block = C * D; dead_block = E * F; */ A = B+C; if (A >= B) { A = B + C; D = E + F; } A = B/C; if (A le B) { A = B + C; D = E + F; } A = B/C; A = B+C; /* LE SV TOC-1209 this is a dlp-02.3.11 req to check unix*/ LogSvEvent((int)1185); /*12/01/2003 16:20:36*/ A = B-C; A = B+C; A = B/C; if (A < B) { A = B + C; D = E + F; } A = B+C; /* LE SV TOC-1210 this is a dlp-02.3.16 req to convert*/ LogSvEvent((int)1186); /*12/01/2003 16:20:36*/ if (A lt 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; // TBS - I need to figure this out if (A ge 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; if (A le B) { A = B + C; D = E + F; } if (A ge B) { A = B + C; D = E + F; } if (A ge B) { A = B + C; D = E + F; } A = B/C; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } if (A ge 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 == 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; if (A != B) { A = B + C; D = E + F; } A = B/C; A = B/C; switch (dlp 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; /* LE SV TOC-1211 this is a dlp-02.3.53 req to convert*/ LogSvEvent((int)1187); /*12/01/2003 16:20:36*/ A = B+C; A = B-C; A = B/C; A = B/C; A = B*C; switch (dlp 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; 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; switch (dlp 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; A = B-C; A = B*C; A = B/C; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } A = B+C; /* LE SV TOC-1212 this is a dlp-02.3.72 req to recover*/ LogSvEvent((int)1188); /*12/01/2003 16:20:36*/ if (A le 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; } A = B-C; A = B/C; A = B/C; // max LOC 77 } /* ----------------------------------------------------------------------------- --| NAME: dlp.2.4 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.4(void) { A = B*C; A = B-C; A = B*C; A = B+C; A = B*C; /* dead_code = A * B; */ 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; if (A lt 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; } 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 23 } /* ----------------------------------------------------------------------------- --| NAME: dlp.2.5 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.5(void) { /* LE SV TOC-1213 this is a dlp-02.5.1 req to verify*/ LogSvEvent((int)1189); /*12/01/2003 16:20:36*/ A = B/C; /* LE SV TOC-1214 this is a dlp-02.5.2 req to process*/ LogSvEvent((int)1190); /*12/01/2003 16:20:36*/ 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 > B) { A = B + C; D = E + F; } A = B*C; A = B+C; A = B/C; A = B-C; A = B+C; if (A ge B) { A = B + C; D = E + F; } if (A le B) { A = B + C; D = E + F; } A = B-C; /* LE SV TOC-1215 this is a dlp-02.5.19 req to verify*/ LogSvEvent((int)1191); /*12/01/2003 16:20:36*/ if (A lt B) { A = B + C; D = E + F; } A = B-C; 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; } 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; if (A > B) { A = B + C; D = E + F; } if (A > B) { A = B + C; D = E + F; } /* LE SV TOC-1216 this is a dlp-02.5.34 req to audit*/ LogSvEvent((int)1192); /*12/01/2003 16:20:36*/ A = B-C; if (A gt B) { A = B + C; D = E + F; } A = B+C; A = B/C; A = B-C; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } if (A != 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; } if (A ge B) { A = B + C; D = E + F; } if (A > B) { A = B + C; D = E + F; } A = B*C; A = 0x0003; A = B*C; if (A ne B) { A = B + C; D = E + F; } // TBD - what do I do now if (A != B) { A = B + C; D = E + F; } A = B-C; A = B*C; // max LOC 51 } /* ----------------------------------------------------------------------------- --| NAME: dlp.2.6 --| --| ABSTRACT: --| This function does dlp stuff. --| --| RETURNS: --| NONE. --| ---------------------------------------------------------------------------- */ static void dlp.2.6(void) { if (A > B) { A = B + C; D = E + F; } if (A eq B) { A = B + C; D = E + F; } 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; if (A == B) { A = B + C; D = E + F; } A = B-C; A = B/C; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } A = B*C; /* LE SV TOC-1217 this is a dlp-02.6.14 req to validate*/ LogSvEvent((int)1193); /*12/01/2003 16:20:36*/ 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; } 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; /* LE SV TOC-1218 this is a dlp-02.6.23 req to recover*/ LogSvEvent((int)1194); /*12/01/2003 16:20:36*/ if (A gt 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; A = 0x0002; 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; if (A <= B) { A = B + C; D = E + F; } switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } if (A >= B) { A = B + C; D = E + F; } send_buffer = (U16 *) malloc(size+1); A = B+C; A = B-C; A = B-C; A = B/C; A = B-C; /* LE SV TOC-1219 this is a dlp-02.6.43 req to check unix*/ LogSvEvent((int)1195); /*12/01/2003 16:20:36*/ A = B+C; if (A lt B) { A = B + C; D = E + F; } switch (dlp 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; 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; A = B*C; switch (dlp 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; switch (dlp stuff) { case one: { run_this; break; } case two: { run_this; break; } default: { SwError; } } A = 0x0002; if (A gt B) { A = B + C; D = E + F; } A = B/C; // max LOC 60 }