stdlib.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. // SPDX-License-Identifier: Apache-2.0
  2. #include <stdint.h>
  3. #include <stddef.h>
  4. #include <stdbool.h>
  5. #include "stdlib.h"
  6. /*
  7. */
  8. void __memset8(void *_dest, uint64_t val, uint32_t length)
  9. {
  10. uint64_t *dest = _dest;
  11. do
  12. {
  13. *dest++ = val;
  14. } while (--length);
  15. }
  16. void __memset(void *_dest, uint8_t val, size_t length)
  17. {
  18. uint8_t *dest = _dest;
  19. do
  20. {
  21. *dest++ = val;
  22. } while (--length);
  23. }
  24. /*
  25. * Our memcpy can only deal with multiples of 8 bytes. This is enough for
  26. * simple allocator below.
  27. */
  28. void __memcpy8(void *_dest, void *_src, uint32_t length)
  29. {
  30. uint64_t *dest = _dest;
  31. uint64_t *src = _src;
  32. do
  33. {
  34. *dest++ = *src++;
  35. } while (--length);
  36. }
  37. void *__memcpy(void *_dest, const void *_src, uint32_t length)
  38. {
  39. uint8_t *dest = _dest;
  40. const uint8_t *src = _src;
  41. while (length--)
  42. {
  43. *dest++ = *src++;
  44. }
  45. return dest;
  46. }
  47. /*
  48. * Fast-ish clear, 8 bytes at a time.
  49. */
  50. void __bzero8(void *_dest, uint32_t length)
  51. {
  52. uint64_t *dest = _dest;
  53. while (length--)
  54. {
  55. *dest++ = 0;
  56. }
  57. }
  58. int __memcmp_ord(uint8_t *a, uint8_t *b, uint32_t len)
  59. {
  60. do
  61. {
  62. int diff = (int)(*a++) - (int)(*b++);
  63. if (diff)
  64. return diff;
  65. } while (--len);
  66. return 0;
  67. }
  68. // This function is used for abi decoding integers.
  69. // ABI encoding is big endian, and can have integers of 8 to 256 bits
  70. // (1 to 32 bytes). This function copies length bytes and reverses the
  71. // order since wasm is little endian.
  72. void __be32toleN(uint8_t *from, uint8_t *to, uint32_t length)
  73. {
  74. from += 31;
  75. do
  76. {
  77. *to++ = *from--;
  78. } while (--length);
  79. }
  80. void __beNtoleN(uint8_t *from, uint8_t *to, uint32_t length)
  81. {
  82. from += length;
  83. do
  84. {
  85. *to++ = *--from;
  86. } while (--length);
  87. }
  88. // This function is for used for abi encoding integers
  89. // ABI encoding is big endian.
  90. void __leNtobe32(uint8_t *from, uint8_t *to, uint32_t length)
  91. {
  92. to += 31;
  93. do
  94. {
  95. *to-- = *from++;
  96. } while (--length);
  97. }
  98. void __leNtobeN(uint8_t *from, uint8_t *to, uint32_t length)
  99. {
  100. to += length;
  101. do
  102. {
  103. *--to = *from++;
  104. } while (--length);
  105. }
  106. uint64_t vector_hash(struct vector *v)
  107. {
  108. uint64_t hash = 0;
  109. uint8_t *data = v->data;
  110. uint32_t len = v->len;
  111. while (len--)
  112. {
  113. hash += *data;
  114. }
  115. return hash;
  116. }
  117. bool __memcmp(uint8_t *left, uint32_t left_len, uint8_t *right, uint32_t right_len)
  118. {
  119. if (left_len != right_len)
  120. return false;
  121. while (left_len--)
  122. {
  123. if (*left++ != *right++)
  124. return false;
  125. }
  126. return true;
  127. }
  128. #ifndef TEST
  129. #ifdef __wasm__
  130. #define VECTOR_EMPTY ((uint8_t *)~0l)
  131. #else
  132. #define VECTOR_EMPTY ((uint8_t *)0l)
  133. #endif
  134. // Create a new vector. If initial is -1 then clear the data. This is done since a null pointer is valid in Wasm
  135. struct vector *vector_new(uint32_t members, uint32_t size, uint8_t *initial)
  136. {
  137. struct vector *v;
  138. uint32_t size_array = members * size;
  139. v = __malloc(sizeof(*v) + size_array);
  140. v->len = members;
  141. v->size = members;
  142. uint8_t *data = v->data;
  143. if (initial != VECTOR_EMPTY)
  144. {
  145. while (size_array--)
  146. {
  147. *data++ = *initial++;
  148. }
  149. }
  150. else
  151. {
  152. while (size_array--)
  153. {
  154. *data++ = 0;
  155. }
  156. }
  157. return v;
  158. }
  159. #endif