Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.

fstring.c 9.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502
  1. /*-
  2. * Copyright 2016 Vsevolod Stakhov
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "fstring.h"
  17. #include "str_util.h"
  18. #include "contrib/fastutf8/fastutf8.h"
  19. #ifdef WITH_JEMALLOC
  20. #include <jemalloc/jemalloc.h>
  21. #if (JEMALLOC_VERSION_MAJOR == 3 && JEMALLOC_VERSION_MINOR >= 6) || (JEMALLOC_VERSION_MAJOR > 3)
  22. #define HAVE_MALLOC_SIZE 1
  23. #define sys_alloc_size(sz) nallocx(sz, 0)
  24. #endif
  25. #elif defined(__APPLE__)
  26. #include <malloc/malloc.h>
  27. #define HAVE_MALLOC_SIZE 1
  28. #define sys_alloc_size(sz) malloc_good_size(sz)
  29. #endif
  30. static const gsize default_initial_size = 16;
  31. #define fstravail(s) ((s)->allocated - (s)->len)
  32. rspamd_fstring_t *
  33. rspamd_fstring_new (void)
  34. {
  35. rspamd_fstring_t *s;
  36. if ((s = malloc (default_initial_size + sizeof (*s))) == NULL) {
  37. g_error ("%s: failed to allocate %"G_GSIZE_FORMAT" bytes",
  38. G_STRLOC, default_initial_size + sizeof (*s));
  39. return NULL;
  40. }
  41. s->len = 0;
  42. s->allocated = default_initial_size;
  43. return s;
  44. }
  45. rspamd_fstring_t *
  46. rspamd_fstring_sized_new (gsize initial_size)
  47. {
  48. rspamd_fstring_t *s;
  49. gsize real_size = MAX (default_initial_size, initial_size);
  50. if ((s = malloc (real_size + sizeof (*s))) == NULL) {
  51. g_error ("%s: failed to allocate %"G_GSIZE_FORMAT" bytes",
  52. G_STRLOC, real_size + sizeof (*s));
  53. return NULL;
  54. }
  55. s->len = 0;
  56. s->allocated = real_size;
  57. return s;
  58. }
  59. rspamd_fstring_t *
  60. rspamd_fstring_new_init (const gchar *init, gsize len)
  61. {
  62. rspamd_fstring_t *s;
  63. gsize real_size = MAX (default_initial_size, len);
  64. if ((s = malloc (real_size + sizeof (*s))) == NULL) {
  65. g_error ("%s: failed to allocate %"G_GSIZE_FORMAT" bytes",
  66. G_STRLOC, real_size + sizeof (*s));
  67. abort ();
  68. }
  69. s->len = len;
  70. s->allocated = real_size;
  71. memcpy (s->str, init, len);
  72. return s;
  73. }
  74. rspamd_fstring_t *
  75. rspamd_fstring_assign (rspamd_fstring_t *str, const gchar *init, gsize len)
  76. {
  77. gsize avail;
  78. if (str == NULL) {
  79. return rspamd_fstring_new_init (init, len);
  80. }
  81. avail = fstravail (str);
  82. if (avail < len) {
  83. str = rspamd_fstring_grow (str, len);
  84. }
  85. if (len > 0) {
  86. memcpy (str->str, init, len);
  87. }
  88. str->len = len;
  89. return str;
  90. }
  91. void
  92. rspamd_fstring_free (rspamd_fstring_t *str)
  93. {
  94. free (str);
  95. }
  96. inline gsize
  97. rspamd_fstring_suggest_size (gsize len, gsize allocated, gsize needed_len)
  98. {
  99. gsize newlen, optlen = 0;
  100. if (allocated < 4096) {
  101. newlen = MAX (len + needed_len, allocated * 2);
  102. }
  103. else {
  104. newlen = MAX (len + needed_len, 1 + allocated * 3 / 2);
  105. }
  106. #ifdef HAVE_MALLOC_SIZE
  107. optlen = sys_alloc_size (newlen + sizeof (rspamd_fstring_t));
  108. #endif
  109. return MAX (newlen, optlen);
  110. }
  111. rspamd_fstring_t *
  112. rspamd_fstring_grow (rspamd_fstring_t *str, gsize needed_len)
  113. {
  114. gsize newlen;
  115. gpointer nptr;
  116. newlen = rspamd_fstring_suggest_size (str->len, str->allocated, needed_len);
  117. nptr = realloc (str, newlen + sizeof (*str));
  118. if (nptr == NULL) {
  119. /* Avoid memory leak */
  120. free (str);
  121. g_error ("%s: failed to re-allocate %"G_GSIZE_FORMAT" bytes",
  122. G_STRLOC, newlen + sizeof (*str));
  123. abort ();
  124. }
  125. str = nptr;
  126. str->allocated = newlen;
  127. return str;
  128. }
  129. rspamd_fstring_t *
  130. rspamd_fstring_append (rspamd_fstring_t *str, const char *in, gsize len)
  131. {
  132. if (str == NULL) {
  133. str = rspamd_fstring_new_init (in, len);
  134. }
  135. else {
  136. gsize avail = fstravail (str);
  137. if (avail < len) {
  138. str = rspamd_fstring_grow (str, len);
  139. }
  140. memcpy (str->str + str->len, in, len);
  141. str->len += len;
  142. }
  143. return str;
  144. }
  145. rspamd_fstring_t *
  146. rspamd_fstring_append_chars (rspamd_fstring_t *str,
  147. char c, gsize len)
  148. {
  149. if (str == NULL) {
  150. str = rspamd_fstring_sized_new (len);
  151. memset (str->str + str->len, c, len);
  152. str->len += len;
  153. }
  154. else {
  155. gsize avail = fstravail (str);
  156. if (avail < len) {
  157. str = rspamd_fstring_grow (str, len);
  158. }
  159. memset (str->str + str->len, c, len);
  160. str->len += len;
  161. }
  162. return str;
  163. }
  164. void
  165. rspamd_fstring_erase (rspamd_fstring_t *str, gsize pos, gsize len)
  166. {
  167. if (pos < str->len) {
  168. if (pos + len > str->len) {
  169. len = str->len - pos;
  170. }
  171. if (len == str->len - pos) {
  172. /* Fast path */
  173. str->len = pos;
  174. }
  175. else {
  176. memmove (str->str + pos, str->str + pos + len, str->len - pos);
  177. str->len -= pos;
  178. }
  179. }
  180. else {
  181. /* Do nothing */
  182. }
  183. }
  184. /* Compat code */
  185. static guint32
  186. fstrhash_c (gchar c, guint32 hval)
  187. {
  188. guint32 tmp;
  189. /*
  190. * xor in the current byte against each byte of hval
  191. * (which alone guarantees that every bit of input will have
  192. * an effect on the output)
  193. */
  194. tmp = c & 0xFF;
  195. tmp = tmp | (tmp << 8) | (tmp << 16) | (tmp << 24);
  196. hval ^= tmp;
  197. /* add some bits out of the middle as low order bits */
  198. hval = hval + ((hval >> 12) & 0x0000ffff);
  199. /* swap most and min significative bytes */
  200. tmp = (hval << 24) | ((hval >> 24) & 0xff);
  201. /* zero most and min significative bytes of hval */
  202. hval &= 0x00ffff00;
  203. hval |= tmp;
  204. /*
  205. * rotate hval 3 bits to the left (thereby making the
  206. * 3rd msb of the above mess the hsb of the output hash)
  207. */
  208. return (hval << 3) + (hval >> 29);
  209. }
  210. /*
  211. * Return hash value for a string
  212. */
  213. guint32
  214. rspamd_fstrhash_lc (const rspamd_ftok_t * str, gboolean is_utf)
  215. {
  216. gsize i;
  217. guint32 j, hval;
  218. const gchar *p, *end = NULL;
  219. gchar t;
  220. gunichar uc;
  221. if (str == NULL) {
  222. return 0;
  223. }
  224. p = str->begin;
  225. hval = str->len;
  226. end = p + str->len;
  227. if (is_utf) {
  228. if (rspamd_fast_utf8_validate (p, str->len) != 0) {
  229. return rspamd_fstrhash_lc (str, FALSE);
  230. }
  231. while (p < end) {
  232. uc = g_unichar_tolower (g_utf8_get_char (p));
  233. for (j = 0; j < sizeof (gunichar); j++) {
  234. t = (uc >> (j * 8)) & 0xff;
  235. if (t != 0) {
  236. hval = fstrhash_c (t, hval);
  237. }
  238. }
  239. p = g_utf8_next_char (p);
  240. }
  241. }
  242. else {
  243. for (i = 0; i < str->len; i++, p++) {
  244. hval = fstrhash_c (g_ascii_tolower (*p), hval);
  245. }
  246. }
  247. return hval;
  248. }
  249. gboolean
  250. rspamd_fstring_equal (const rspamd_fstring_t *s1,
  251. const rspamd_fstring_t *s2)
  252. {
  253. g_assert (s1 != NULL && s2 != NULL);
  254. if (s1->len == s2->len) {
  255. return (memcmp (s1->str, s2->str, s1->len) == 0);
  256. }
  257. return FALSE;
  258. }
  259. gint
  260. rspamd_fstring_casecmp (const rspamd_fstring_t *s1,
  261. const rspamd_fstring_t *s2)
  262. {
  263. gint ret = 0;
  264. g_assert (s1 != NULL && s2 != NULL);
  265. if (s1->len == s2->len) {
  266. ret = rspamd_lc_cmp (s1->str, s2->str, s1->len);
  267. }
  268. else {
  269. ret = s1->len - s2->len;
  270. }
  271. return ret;
  272. }
  273. gint
  274. rspamd_fstring_cmp (const rspamd_fstring_t *s1,
  275. const rspamd_fstring_t *s2)
  276. {
  277. g_assert (s1 != NULL && s2 != NULL);
  278. if (s1->len == s2->len) {
  279. return memcmp (s1->str, s2->str, s1->len);
  280. }
  281. return s1->len - s2->len;
  282. }
  283. gint
  284. rspamd_ftok_casecmp (const rspamd_ftok_t *s1,
  285. const rspamd_ftok_t *s2)
  286. {
  287. gint ret = 0;
  288. g_assert (s1 != NULL && s2 != NULL);
  289. if (s1->len == s2->len) {
  290. ret = rspamd_lc_cmp (s1->begin, s2->begin, s1->len);
  291. }
  292. else {
  293. ret = s1->len - s2->len;
  294. }
  295. return ret;
  296. }
  297. gint
  298. rspamd_ftok_cmp (const rspamd_ftok_t *s1,
  299. const rspamd_ftok_t *s2)
  300. {
  301. g_assert (s1 != NULL && s2 != NULL);
  302. if (s1->len == s2->len) {
  303. return memcmp (s1->begin, s2->begin, s1->len);
  304. }
  305. return s1->len - s2->len;
  306. }
  307. gboolean
  308. rspamd_ftok_starts_with (const rspamd_ftok_t *s1,
  309. const rspamd_ftok_t *s2)
  310. {
  311. g_assert (s1 != NULL && s2 != NULL);
  312. if (s1->len >= s2->len) {
  313. return !!(memcmp (s1->begin, s2->begin, s2->len) == 0);
  314. }
  315. return FALSE;
  316. }
  317. void
  318. rspamd_fstring_mapped_ftok_free (gpointer p)
  319. {
  320. rspamd_ftok_t *tok = p;
  321. rspamd_fstring_t *storage;
  322. storage = (rspamd_fstring_t *) (tok->begin - 2 * sizeof (gsize));
  323. rspamd_fstring_free (storage);
  324. g_free (tok);
  325. }
  326. rspamd_ftok_t *
  327. rspamd_ftok_map (const rspamd_fstring_t *s)
  328. {
  329. rspamd_ftok_t *tok;
  330. g_assert (s != NULL);
  331. tok = g_malloc (sizeof (*tok));
  332. tok->begin = s->str;
  333. tok->len = s->len;
  334. return tok;
  335. }
  336. char *
  337. rspamd_fstring_cstr (const rspamd_fstring_t *s)
  338. {
  339. char *result;
  340. if (s == NULL) {
  341. return NULL;
  342. }
  343. result = g_malloc (s->len + 1);
  344. memcpy (result, s->str, s->len);
  345. result[s->len] = '\0';
  346. return result;
  347. }
  348. char *
  349. rspamd_ftok_cstr (const rspamd_ftok_t *s)
  350. {
  351. char *result;
  352. if (s == NULL) {
  353. return NULL;
  354. }
  355. result = g_malloc (s->len + 1);
  356. memcpy (result, s->begin, s->len);
  357. result[s->len] = '\0';
  358. return result;
  359. }
  360. gboolean
  361. rspamd_ftok_cstr_equal (const rspamd_ftok_t *s, const gchar *pat,
  362. gboolean icase)
  363. {
  364. gsize slen;
  365. rspamd_ftok_t srch;
  366. g_assert (s != NULL);
  367. g_assert (pat != NULL);
  368. slen = strlen (pat);
  369. srch.begin = pat;
  370. srch.len = slen;
  371. if (icase) {
  372. return (rspamd_ftok_casecmp (s, &srch) == 0);
  373. }
  374. return (rspamd_ftok_cmp (s, &srch) == 0);
  375. }
  376. gchar *
  377. rspamd_ftokdup (const rspamd_ftok_t *src)
  378. {
  379. gchar *newstr;
  380. if (src == NULL) {
  381. return NULL;
  382. }
  383. newstr = g_malloc (src->len + 1);
  384. memcpy (newstr, src->begin, src->len);
  385. newstr[src->len] = '\0';
  386. return newstr;
  387. }
  388. gchar *
  389. rspamd_fstringdup (const rspamd_fstring_t *src)
  390. {
  391. gchar *newstr;
  392. if (src == NULL) {
  393. return NULL;
  394. }
  395. newstr = g_malloc (src->len + 1);
  396. memcpy (newstr, src->str, src->len);
  397. newstr[src->len] = '\0';
  398. return newstr;
  399. }