mirror of
https://github.com/byteworksinc/ORCA-C.git
synced 2025-01-01 13:29:32 +00:00
91d33b586d
The main changes made to most tests are:
*Declarations always include explicit types, not relying on implicit int. The declaration of main in most test programs is changed to be "int main (void) {...}", adding an explicit return type and a prototype. (There are still some non-prototyped functions, though.)
*Functions are always declared before use, either by including a header or by providing a declaration for the specific function. The latter approach is usually used for printf, to avoid requiring ORCA/C to process stdio.h when compiling every test case (which might make test runs noticeably slower).
*Make all return statements in non-void functions (e.g. main) return a value.
*Avoid some instances of undefined behavior and type errors in printf and scanf calls.
Several miscellaneous bugs are also fixed.
There are still a couple test cases that intentionally rely on the C89 behavior, to ensure it still works.
71 lines
1.4 KiB
C++
71 lines
1.4 KiB
C++
/* Conformance Test 22.5.0.1: Verification of bsearch, qsort functions */
|
|
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
|
|
int printf(const char *, ...);
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
int Compare (const void *p1, const void *p2)
|
|
{
|
|
int const *i1 = p1;
|
|
int const *i2 = p2;
|
|
|
|
if (*i1 < *i2)
|
|
return (-1);
|
|
|
|
else if (*i1 > *i2)
|
|
return (1);
|
|
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
int main (void)
|
|
{
|
|
int i [10] = { 3, 4, 6, 8, 0, 2, 1, 5, 3, 7 };
|
|
int j, *iptr;
|
|
|
|
|
|
/* First sort the array with the qsort routine, then check results. */
|
|
|
|
qsort ( (int *) (i), 10, sizeof (int), Compare );
|
|
|
|
for (j = 0; j < 4; j++)
|
|
if (i [j] != j)
|
|
goto Fail;
|
|
|
|
for (j = 3; j < 9; j++)
|
|
if (i [j+1] != j)
|
|
goto Fail;
|
|
|
|
|
|
/* Now call bsearch to find some values in the array. */
|
|
|
|
j = 7;
|
|
iptr = (int *) bsearch ( &j, i, 10, sizeof (int), Compare );
|
|
if (iptr != &i [8])
|
|
goto Fail;
|
|
|
|
j = 0;
|
|
iptr = (int *) bsearch ( &j, i, 10, sizeof (int), Compare );
|
|
if (iptr != i)
|
|
goto Fail;
|
|
|
|
j = -3;
|
|
iptr = (int *) bsearch ( &j, i, 10, sizeof (int), Compare );
|
|
if (iptr != NULL)
|
|
goto Fail;
|
|
|
|
printf ("Passed Conformance Test 22.5.0.1\n");
|
|
return 0;
|
|
|
|
Fail:
|
|
printf ("Failed Conformance Test 22.5.0.1\n");
|
|
}
|