stdlib.c 3.0 KB

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