tst-qsort2.c 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. char *array;
  4. char *array_end;
  5. size_t member_size;
  6. int
  7. compare (const void *a1, const void *b1)
  8. {
  9. const char *a = a1;
  10. const char *b = b1;
  11. if (! (array <= a && a < array_end
  12. && array <= b && b < array_end))
  13. {
  14. puts ("compare arguments not inside of the array");
  15. exit (EXIT_FAILURE);
  16. }
  17. int ret = b[0] - a[0];
  18. if (ret)
  19. return ret;
  20. if (member_size > 1)
  21. return b[1] - a[1];
  22. return 0;
  23. }
  24. int
  25. test (size_t nmemb, size_t size)
  26. {
  27. array = malloc (nmemb * size);
  28. if (array == NULL)
  29. {
  30. printf ("%zd x %zd: no memory", nmemb, size);
  31. return 1;
  32. }
  33. array_end = array + nmemb * size;
  34. member_size = size;
  35. char *p;
  36. size_t i;
  37. size_t bias = random ();
  38. for (i = 0, p = array; i < nmemb; i++, p += size)
  39. {
  40. p[0] = (char) (i + bias);
  41. if (size > 1)
  42. p[1] = (char) ((i + bias) >> 8);
  43. }
  44. qsort (array, nmemb, size, compare);
  45. for (i = 0, p = array; i < nmemb - 1; i++, p += size)
  46. {
  47. if (p[0] < p[size]
  48. || (size > 1 && p[0] == p[size] && p[1] < p[size + 1]))
  49. {
  50. printf ("%zd x %zd: failure at offset %zd\n", nmemb,
  51. size, i);
  52. free (array);
  53. return 1;
  54. }
  55. }
  56. free (array);
  57. return 0;
  58. }
  59. int
  60. main (int argc, char **argv)
  61. {
  62. int ret = 0;
  63. if (argc >= 3)
  64. ret |= test (atoi (argv[1]), atoi (argv[2]));
  65. else
  66. {
  67. ret |= test (10000, 1);
  68. ret |= test (200000, 2);
  69. ret |= test (2000000, 3);
  70. ret |= test (2132310, 4);
  71. ret |= test (1202730, 7);
  72. ret |= test (1184710, 8);
  73. ret |= test (272710, 12);
  74. ret |= test (14170, 32);
  75. ret |= test (4170, 320);
  76. }
  77. return ret;
  78. }