stdlib.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. /* Minimal freestanding stdlib support for ring-3 commands. */
  2. #include <stddef.h>
  3. #include <stdlib.h>
  4. #include <ucmd_lib.h>
  5. int abs(int value)
  6. {
  7. return value < 0 ? -value : value;
  8. }
  9. long strtol(const char *str, char **endptr, int base)
  10. {
  11. const char *p = str;
  12. int negative = 0;
  13. int any = 0;
  14. unsigned long value = 0;
  15. if (!str) {
  16. if (endptr)
  17. *endptr = (char *)str;
  18. return 0;
  19. }
  20. while (*p == ' ' || *p == '\t' || *p == '\n' ||
  21. *p == '\v' || *p == '\f' || *p == '\r')
  22. p++;
  23. if (*p == '+' || *p == '-') {
  24. negative = (*p == '-');
  25. p++;
  26. }
  27. if ((base == 0 || base == 16) && p[0] == '0' &&
  28. (p[1] == 'x' || p[1] == 'X')) {
  29. base = 16;
  30. p += 2;
  31. } else if (base == 0) {
  32. base = (p[0] == '0') ? 8 : 10;
  33. }
  34. if (base < 2 || base > 36) {
  35. if (endptr)
  36. *endptr = (char *)str;
  37. return 0;
  38. }
  39. for (;;) {
  40. int digit;
  41. if (*p >= '0' && *p <= '9')
  42. digit = *p - '0';
  43. else if (*p >= 'a' && *p <= 'z')
  44. digit = *p - 'a' + 10;
  45. else if (*p >= 'A' && *p <= 'Z')
  46. digit = *p - 'A' + 10;
  47. else
  48. break;
  49. if (digit >= base)
  50. break;
  51. value = value * (unsigned long)base + (unsigned long)digit;
  52. any = 1;
  53. p++;
  54. }
  55. if (!any) {
  56. if (endptr)
  57. *endptr = (char *)str;
  58. return 0;
  59. }
  60. if (endptr)
  61. *endptr = (char *)p;
  62. return negative ? -(long)value : (long)value;
  63. }
  64. static void swap_bytes(unsigned char *a, unsigned char *b, size_t n)
  65. {
  66. while (n--) {
  67. unsigned char t = *a;
  68. *a++ = *b;
  69. *b++ = t;
  70. }
  71. }
  72. /* Sift element `start` down in a max heap. */
  73. static void sift_down(unsigned char *base, size_t start, size_t end,
  74. size_t size, int (*compar)(const void *, const void *))
  75. {
  76. size_t root = start;
  77. while (root * 2 + 1 <= end) {
  78. size_t child = root * 2 + 1;
  79. if (child + 1 <= end &&
  80. compar(base + child * size, base + (child + 1) * size) < 0)
  81. child++;
  82. if (compar(base + root * size, base + child * size) < 0) {
  83. swap_bytes(base + root * size, base + child * size, size);
  84. root = child;
  85. } else {
  86. return;
  87. }
  88. }
  89. }
  90. void qsort(void *base, size_t nmemb, size_t size,
  91. int (*compar)(const void *, const void *))
  92. {
  93. unsigned char *p = (unsigned char *)base;
  94. size_t start;
  95. size_t end;
  96. if (!p || !compar || nmemb < 2 || size == 0)
  97. return;
  98. /* Build the max heap. */
  99. start = (nmemb - 2) / 2;
  100. for (;;) {
  101. sift_down(p, start, nmemb - 1, size, compar);
  102. if (start == 0)
  103. break;
  104. start--;
  105. }
  106. /* Repeatedly move the maximum to the end and shrink the heap. */
  107. end = nmemb - 1;
  108. while (end > 0) {
  109. swap_bytes(p, p + end * size, size);
  110. end--;
  111. sift_down(p, 0, end, size, compar);
  112. }
  113. }
  114. void exit(int status)
  115. {
  116. u_exit(status);
  117. for (;;)
  118. ;
  119. }
  120. void abort(void)
  121. {
  122. u_puts("abort\n");
  123. u_exit(1);
  124. for (;;)
  125. ;
  126. }
  127. void __assert_fail(const char *expr, const char *file, unsigned int line)
  128. {
  129. u_puts("assert failed: ");
  130. u_puts(expr ? expr : "?");
  131. u_puts(" (");
  132. u_puts(file ? file : "?");
  133. u_puts(":");
  134. u_putdec(line);
  135. u_puts(")\n");
  136. u_exit(1);
  137. for (;;)
  138. ;
  139. }