You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

478 lines
10KB

  1. /*
  2. * default memory allocator for libavutil
  3. * Copyright (c) 2002 Fabrice Bellard
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * default memory allocator for libavutil
  24. */
  25. #define _XOPEN_SOURCE 600
  26. #include "config.h"
  27. #include <limits.h>
  28. #include <stdint.h>
  29. #include <stdlib.h>
  30. #include <string.h>
  31. #if HAVE_MALLOC_H
  32. #include <malloc.h>
  33. #endif
  34. #include "avassert.h"
  35. #include "avutil.h"
  36. #include "common.h"
  37. #include "dynarray.h"
  38. #include "intreadwrite.h"
  39. #include "mem.h"
  40. #ifdef MALLOC_PREFIX
  41. #define malloc AV_JOIN(MALLOC_PREFIX, malloc)
  42. #define memalign AV_JOIN(MALLOC_PREFIX, memalign)
  43. #define posix_memalign AV_JOIN(MALLOC_PREFIX, posix_memalign)
  44. #define realloc AV_JOIN(MALLOC_PREFIX, realloc)
  45. #define free AV_JOIN(MALLOC_PREFIX, free)
  46. void *malloc(size_t size);
  47. void *memalign(size_t align, size_t size);
  48. int posix_memalign(void **ptr, size_t align, size_t size);
  49. void *realloc(void *ptr, size_t size);
  50. void free(void *ptr);
  51. #endif /* MALLOC_PREFIX */
  52. #include "mem_internal.h"
  53. #define ALIGN (HAVE_AVX ? 32 : 16)
  54. /* NOTE: if you want to override these functions with your own
  55. * implementations (not recommended) you have to link libav* as
  56. * dynamic libraries and remove -Wl,-Bsymbolic from the linker flags.
  57. * Note that this will cost performance. */
  58. static size_t max_alloc_size= INT_MAX;
  59. void av_max_alloc(size_t max){
  60. max_alloc_size = max;
  61. }
  62. void *av_malloc(size_t size)
  63. {
  64. void *ptr = NULL;
  65. /* let's disallow possibly ambiguous cases */
  66. if (size > (max_alloc_size - 32))
  67. return NULL;
  68. #if HAVE_POSIX_MEMALIGN
  69. if (size) //OS X on SDK 10.6 has a broken posix_memalign implementation
  70. if (posix_memalign(&ptr, ALIGN, size))
  71. ptr = NULL;
  72. #elif HAVE_ALIGNED_MALLOC
  73. ptr = _aligned_malloc(size, ALIGN);
  74. #elif HAVE_MEMALIGN
  75. #ifndef __DJGPP__
  76. ptr = memalign(ALIGN, size);
  77. #else
  78. ptr = memalign(size, ALIGN);
  79. #endif
  80. /* Why 64?
  81. * Indeed, we should align it:
  82. * on 4 for 386
  83. * on 16 for 486
  84. * on 32 for 586, PPro - K6-III
  85. * on 64 for K7 (maybe for P3 too).
  86. * Because L1 and L2 caches are aligned on those values.
  87. * But I don't want to code such logic here!
  88. */
  89. /* Why 32?
  90. * For AVX ASM. SSE / NEON needs only 16.
  91. * Why not larger? Because I did not see a difference in benchmarks ...
  92. */
  93. /* benchmarks with P3
  94. * memalign(64) + 1 3071, 3051, 3032
  95. * memalign(64) + 2 3051, 3032, 3041
  96. * memalign(64) + 4 2911, 2896, 2915
  97. * memalign(64) + 8 2545, 2554, 2550
  98. * memalign(64) + 16 2543, 2572, 2563
  99. * memalign(64) + 32 2546, 2545, 2571
  100. * memalign(64) + 64 2570, 2533, 2558
  101. *
  102. * BTW, malloc seems to do 8-byte alignment by default here.
  103. */
  104. #else
  105. ptr = malloc(size);
  106. #endif
  107. if(!ptr && !size) {
  108. size = 1;
  109. ptr= av_malloc(1);
  110. }
  111. #if CONFIG_MEMORY_POISONING
  112. if (ptr)
  113. memset(ptr, FF_MEMORY_POISON, size);
  114. #endif
  115. return ptr;
  116. }
  117. void *av_realloc(void *ptr, size_t size)
  118. {
  119. /* let's disallow possibly ambiguous cases */
  120. if (size > (max_alloc_size - 32))
  121. return NULL;
  122. #if HAVE_ALIGNED_MALLOC
  123. return _aligned_realloc(ptr, size + !size, ALIGN);
  124. #else
  125. return realloc(ptr, size + !size);
  126. #endif
  127. }
  128. void *av_realloc_f(void *ptr, size_t nelem, size_t elsize)
  129. {
  130. size_t size;
  131. void *r;
  132. if (av_size_mult(elsize, nelem, &size)) {
  133. av_free(ptr);
  134. return NULL;
  135. }
  136. r = av_realloc(ptr, size);
  137. if (!r)
  138. av_free(ptr);
  139. return r;
  140. }
  141. int av_reallocp(void *ptr, size_t size)
  142. {
  143. void *val;
  144. if (!size) {
  145. av_freep(ptr);
  146. return 0;
  147. }
  148. memcpy(&val, ptr, sizeof(val));
  149. val = av_realloc(val, size);
  150. if (!val) {
  151. av_freep(ptr);
  152. return AVERROR(ENOMEM);
  153. }
  154. memcpy(ptr, &val, sizeof(val));
  155. return 0;
  156. }
  157. void *av_realloc_array(void *ptr, size_t nmemb, size_t size)
  158. {
  159. if (!size || nmemb >= INT_MAX / size)
  160. return NULL;
  161. return av_realloc(ptr, nmemb * size);
  162. }
  163. int av_reallocp_array(void *ptr, size_t nmemb, size_t size)
  164. {
  165. void *val;
  166. memcpy(&val, ptr, sizeof(val));
  167. val = av_realloc_f(val, nmemb, size);
  168. memcpy(ptr, &val, sizeof(val));
  169. if (!val && nmemb && size)
  170. return AVERROR(ENOMEM);
  171. return 0;
  172. }
  173. void av_free(void *ptr)
  174. {
  175. #if HAVE_ALIGNED_MALLOC
  176. _aligned_free(ptr);
  177. #else
  178. free(ptr);
  179. #endif
  180. }
  181. void av_freep(void *arg)
  182. {
  183. void *val;
  184. memcpy(&val, arg, sizeof(val));
  185. memcpy(arg, &(void *){ NULL }, sizeof(val));
  186. av_free(val);
  187. }
  188. void *av_mallocz(size_t size)
  189. {
  190. void *ptr = av_malloc(size);
  191. if (ptr)
  192. memset(ptr, 0, size);
  193. return ptr;
  194. }
  195. void *av_calloc(size_t nmemb, size_t size)
  196. {
  197. if (size <= 0 || nmemb >= INT_MAX / size)
  198. return NULL;
  199. return av_mallocz(nmemb * size);
  200. }
  201. char *av_strdup(const char *s)
  202. {
  203. char *ptr = NULL;
  204. if (s) {
  205. size_t len = strlen(s) + 1;
  206. ptr = av_realloc(NULL, len);
  207. if (ptr)
  208. memcpy(ptr, s, len);
  209. }
  210. return ptr;
  211. }
  212. char *av_strndup(const char *s, size_t len)
  213. {
  214. char *ret = NULL, *end;
  215. if (!s)
  216. return NULL;
  217. end = memchr(s, 0, len);
  218. if (end)
  219. len = end - s;
  220. ret = av_realloc(NULL, len + 1);
  221. if (!ret)
  222. return NULL;
  223. memcpy(ret, s, len);
  224. ret[len] = 0;
  225. return ret;
  226. }
  227. void *av_memdup(const void *p, size_t size)
  228. {
  229. void *ptr = NULL;
  230. if (p) {
  231. ptr = av_malloc(size);
  232. if (ptr)
  233. memcpy(ptr, p, size);
  234. }
  235. return ptr;
  236. }
  237. int av_dynarray_add_nofree(void *tab_ptr, int *nb_ptr, void *elem)
  238. {
  239. void **tab;
  240. memcpy(&tab, tab_ptr, sizeof(tab));
  241. FF_DYNARRAY_ADD(INT_MAX, sizeof(*tab), tab, *nb_ptr, {
  242. tab[*nb_ptr] = elem;
  243. memcpy(tab_ptr, &tab, sizeof(tab));
  244. }, {
  245. return AVERROR(ENOMEM);
  246. });
  247. return 0;
  248. }
  249. void av_dynarray_add(void *tab_ptr, int *nb_ptr, void *elem)
  250. {
  251. void **tab;
  252. memcpy(&tab, tab_ptr, sizeof(tab));
  253. FF_DYNARRAY_ADD(INT_MAX, sizeof(*tab), tab, *nb_ptr, {
  254. tab[*nb_ptr] = elem;
  255. memcpy(tab_ptr, &tab, sizeof(tab));
  256. }, {
  257. *nb_ptr = 0;
  258. av_freep(tab_ptr);
  259. });
  260. }
  261. void *av_dynarray2_add(void **tab_ptr, int *nb_ptr, size_t elem_size,
  262. const uint8_t *elem_data)
  263. {
  264. uint8_t *tab_elem_data = NULL;
  265. FF_DYNARRAY_ADD(INT_MAX, elem_size, *tab_ptr, *nb_ptr, {
  266. tab_elem_data = (uint8_t *)*tab_ptr + (*nb_ptr) * elem_size;
  267. if (elem_data)
  268. memcpy(tab_elem_data, elem_data, elem_size);
  269. else if (CONFIG_MEMORY_POISONING)
  270. memset(tab_elem_data, FF_MEMORY_POISON, elem_size);
  271. }, {
  272. av_freep(tab_ptr);
  273. *nb_ptr = 0;
  274. });
  275. return tab_elem_data;
  276. }
  277. static void fill16(uint8_t *dst, int len)
  278. {
  279. uint32_t v = AV_RN16(dst - 2);
  280. v |= v << 16;
  281. while (len >= 4) {
  282. AV_WN32(dst, v);
  283. dst += 4;
  284. len -= 4;
  285. }
  286. while (len--) {
  287. *dst = dst[-2];
  288. dst++;
  289. }
  290. }
  291. static void fill24(uint8_t *dst, int len)
  292. {
  293. #if HAVE_BIGENDIAN
  294. uint32_t v = AV_RB24(dst - 3);
  295. uint32_t a = v << 8 | v >> 16;
  296. uint32_t b = v << 16 | v >> 8;
  297. uint32_t c = v << 24 | v;
  298. #else
  299. uint32_t v = AV_RL24(dst - 3);
  300. uint32_t a = v | v << 24;
  301. uint32_t b = v >> 8 | v << 16;
  302. uint32_t c = v >> 16 | v << 8;
  303. #endif
  304. while (len >= 12) {
  305. AV_WN32(dst, a);
  306. AV_WN32(dst + 4, b);
  307. AV_WN32(dst + 8, c);
  308. dst += 12;
  309. len -= 12;
  310. }
  311. if (len >= 4) {
  312. AV_WN32(dst, a);
  313. dst += 4;
  314. len -= 4;
  315. }
  316. if (len >= 4) {
  317. AV_WN32(dst, b);
  318. dst += 4;
  319. len -= 4;
  320. }
  321. while (len--) {
  322. *dst = dst[-3];
  323. dst++;
  324. }
  325. }
  326. static void fill32(uint8_t *dst, int len)
  327. {
  328. uint32_t v = AV_RN32(dst - 4);
  329. while (len >= 4) {
  330. AV_WN32(dst, v);
  331. dst += 4;
  332. len -= 4;
  333. }
  334. while (len--) {
  335. *dst = dst[-4];
  336. dst++;
  337. }
  338. }
  339. void av_memcpy_backptr(uint8_t *dst, int back, int cnt)
  340. {
  341. const uint8_t *src = &dst[-back];
  342. if (!back)
  343. return;
  344. if (back == 1) {
  345. memset(dst, *src, cnt);
  346. } else if (back == 2) {
  347. fill16(dst, cnt);
  348. } else if (back == 3) {
  349. fill24(dst, cnt);
  350. } else if (back == 4) {
  351. fill32(dst, cnt);
  352. } else {
  353. if (cnt >= 16) {
  354. int blocklen = back;
  355. while (cnt > blocklen) {
  356. memcpy(dst, src, blocklen);
  357. dst += blocklen;
  358. cnt -= blocklen;
  359. blocklen <<= 1;
  360. }
  361. memcpy(dst, src, cnt);
  362. return;
  363. }
  364. if (cnt >= 8) {
  365. AV_COPY32U(dst, src);
  366. AV_COPY32U(dst + 4, src + 4);
  367. src += 8;
  368. dst += 8;
  369. cnt -= 8;
  370. }
  371. if (cnt >= 4) {
  372. AV_COPY32U(dst, src);
  373. src += 4;
  374. dst += 4;
  375. cnt -= 4;
  376. }
  377. if (cnt >= 2) {
  378. AV_COPY16U(dst, src);
  379. src += 2;
  380. dst += 2;
  381. cnt -= 2;
  382. }
  383. if (cnt)
  384. *dst = *src;
  385. }
  386. }
  387. void *av_fast_realloc(void *ptr, unsigned int *size, size_t min_size)
  388. {
  389. if (min_size < *size)
  390. return ptr;
  391. min_size = FFMAX(min_size + min_size / 16 + 32, min_size);
  392. ptr = av_realloc(ptr, min_size);
  393. /* we could set this to the unmodified min_size but this is safer
  394. * if the user lost the ptr and uses NULL now
  395. */
  396. if (!ptr)
  397. min_size = 0;
  398. *size = min_size;
  399. return ptr;
  400. }
  401. void av_fast_malloc(void *ptr, unsigned int *size, size_t min_size)
  402. {
  403. ff_fast_malloc(ptr, size, min_size, 0);
  404. }
  405. void av_fast_mallocz(void *ptr, unsigned int *size, size_t min_size)
  406. {
  407. ff_fast_malloc(ptr, size, min_size, 1);
  408. }