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.

446 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 "intreadwrite.h"
  37. #include "mem.h"
  38. #ifdef MALLOC_PREFIX
  39. #define malloc AV_JOIN(MALLOC_PREFIX, malloc)
  40. #define memalign AV_JOIN(MALLOC_PREFIX, memalign)
  41. #define posix_memalign AV_JOIN(MALLOC_PREFIX, posix_memalign)
  42. #define realloc AV_JOIN(MALLOC_PREFIX, realloc)
  43. #define free AV_JOIN(MALLOC_PREFIX, free)
  44. void *malloc(size_t size);
  45. void *memalign(size_t align, size_t size);
  46. int posix_memalign(void **ptr, size_t align, size_t size);
  47. void *realloc(void *ptr, size_t size);
  48. void free(void *ptr);
  49. #endif /* MALLOC_PREFIX */
  50. #define ALIGN (HAVE_AVX ? 32 : 16)
  51. /* NOTE: if you want to override these functions with your own
  52. * implementations (not recommended) you have to link libav* as
  53. * dynamic libraries and remove -Wl,-Bsymbolic from the linker flags.
  54. * Note that this will cost performance. */
  55. static size_t max_alloc_size= INT_MAX;
  56. void av_max_alloc(size_t max){
  57. max_alloc_size = max;
  58. }
  59. void *av_malloc(size_t size)
  60. {
  61. void *ptr = NULL;
  62. #if CONFIG_MEMALIGN_HACK
  63. long diff;
  64. #endif
  65. /* let's disallow possible ambiguous cases */
  66. if (size > (max_alloc_size - 32))
  67. return NULL;
  68. #if CONFIG_MEMALIGN_HACK
  69. ptr = malloc(size + ALIGN);
  70. if (!ptr)
  71. return ptr;
  72. diff = ((~(long)ptr)&(ALIGN - 1)) + 1;
  73. ptr = (char *)ptr + diff;
  74. ((char *)ptr)[-1] = diff;
  75. #elif HAVE_POSIX_MEMALIGN
  76. if (size) //OS X on SDK 10.6 has a broken posix_memalign implementation
  77. if (posix_memalign(&ptr, ALIGN, size))
  78. ptr = NULL;
  79. #elif HAVE_ALIGNED_MALLOC
  80. ptr = _aligned_malloc(size, ALIGN);
  81. #elif HAVE_MEMALIGN
  82. #ifndef __DJGPP__
  83. ptr = memalign(ALIGN, size);
  84. #else
  85. ptr = memalign(size, ALIGN);
  86. #endif
  87. /* Why 64?
  88. * Indeed, we should align it:
  89. * on 4 for 386
  90. * on 16 for 486
  91. * on 32 for 586, PPro - K6-III
  92. * on 64 for K7 (maybe for P3 too).
  93. * Because L1 and L2 caches are aligned on those values.
  94. * But I don't want to code such logic here!
  95. */
  96. /* Why 32?
  97. * For AVX ASM. SSE / NEON needs only 16.
  98. * Why not larger? Because I did not see a difference in benchmarks ...
  99. */
  100. /* benchmarks with P3
  101. * memalign(64) + 1 3071, 3051, 3032
  102. * memalign(64) + 2 3051, 3032, 3041
  103. * memalign(64) + 4 2911, 2896, 2915
  104. * memalign(64) + 8 2545, 2554, 2550
  105. * memalign(64) + 16 2543, 2572, 2563
  106. * memalign(64) + 32 2546, 2545, 2571
  107. * memalign(64) + 64 2570, 2533, 2558
  108. *
  109. * BTW, malloc seems to do 8-byte alignment by default here.
  110. */
  111. #else
  112. ptr = malloc(size);
  113. #endif
  114. if(!ptr && !size) {
  115. size = 1;
  116. ptr= av_malloc(1);
  117. }
  118. #if CONFIG_MEMORY_POISONING
  119. if (ptr)
  120. memset(ptr, FF_MEMORY_POISON, size);
  121. #endif
  122. return ptr;
  123. }
  124. void *av_realloc(void *ptr, size_t size)
  125. {
  126. #if CONFIG_MEMALIGN_HACK
  127. int diff;
  128. #endif
  129. /* let's disallow possible ambiguous cases */
  130. if (size > (max_alloc_size - 32))
  131. return NULL;
  132. #if CONFIG_MEMALIGN_HACK
  133. //FIXME this isn't aligned correctly, though it probably isn't needed
  134. if (!ptr)
  135. return av_malloc(size);
  136. diff = ((char *)ptr)[-1];
  137. av_assert0(diff>0 && diff<=ALIGN);
  138. ptr = realloc((char *)ptr - diff, size + diff);
  139. if (ptr)
  140. ptr = (char *)ptr + diff;
  141. return ptr;
  142. #elif HAVE_ALIGNED_MALLOC
  143. return _aligned_realloc(ptr, size + !size, ALIGN);
  144. #else
  145. return realloc(ptr, size + !size);
  146. #endif
  147. }
  148. void *av_realloc_f(void *ptr, size_t nelem, size_t elsize)
  149. {
  150. size_t size;
  151. void *r;
  152. if (av_size_mult(elsize, nelem, &size)) {
  153. av_free(ptr);
  154. return NULL;
  155. }
  156. r = av_realloc(ptr, size);
  157. if (!r && size)
  158. av_free(ptr);
  159. return r;
  160. }
  161. void *av_realloc_array(void *ptr, size_t nmemb, size_t size)
  162. {
  163. if (size <= 0 || nmemb >= INT_MAX / size)
  164. return NULL;
  165. return av_realloc(ptr, nmemb * size);
  166. }
  167. int av_reallocp_array(void *ptr, size_t nmemb, size_t size)
  168. {
  169. void **ptrptr = ptr;
  170. *ptrptr = av_realloc_f(*ptrptr, nmemb, size);
  171. if (!*ptrptr && !(nmemb && size))
  172. return AVERROR(ENOMEM);
  173. return 0;
  174. }
  175. void av_free(void *ptr)
  176. {
  177. #if CONFIG_MEMALIGN_HACK
  178. if (ptr) {
  179. int v= ((char *)ptr)[-1];
  180. av_assert0(v>0 && v<=ALIGN);
  181. free((char *)ptr - v);
  182. }
  183. #elif HAVE_ALIGNED_MALLOC
  184. _aligned_free(ptr);
  185. #else
  186. free(ptr);
  187. #endif
  188. }
  189. void av_freep(void *arg)
  190. {
  191. void **ptr = (void **)arg;
  192. av_free(*ptr);
  193. *ptr = NULL;
  194. }
  195. void *av_mallocz(size_t size)
  196. {
  197. void *ptr = av_malloc(size);
  198. if (ptr)
  199. memset(ptr, 0, size);
  200. return ptr;
  201. }
  202. void *av_calloc(size_t nmemb, size_t size)
  203. {
  204. if (size <= 0 || nmemb >= INT_MAX / size)
  205. return NULL;
  206. return av_mallocz(nmemb * size);
  207. }
  208. char *av_strdup(const char *s)
  209. {
  210. char *ptr = NULL;
  211. if (s) {
  212. int len = strlen(s) + 1;
  213. ptr = av_malloc(len);
  214. if (ptr)
  215. memcpy(ptr, s, len);
  216. }
  217. return ptr;
  218. }
  219. void *av_memdup(const void *p, size_t size)
  220. {
  221. void *ptr = NULL;
  222. if (p) {
  223. ptr = av_malloc(size);
  224. if (ptr)
  225. memcpy(ptr, p, size);
  226. }
  227. return ptr;
  228. }
  229. void av_dynarray_add(void *tab_ptr, int *nb_ptr, void *elem)
  230. {
  231. /* see similar ffmpeg.c:grow_array() */
  232. int nb, nb_alloc;
  233. intptr_t *tab;
  234. nb = *nb_ptr;
  235. tab = *(intptr_t**)tab_ptr;
  236. if ((nb & (nb - 1)) == 0) {
  237. if (nb == 0) {
  238. nb_alloc = 1;
  239. } else {
  240. if (nb > INT_MAX / (2 * sizeof(intptr_t)))
  241. goto fail;
  242. nb_alloc = nb * 2;
  243. }
  244. tab = av_realloc(tab, nb_alloc * sizeof(intptr_t));
  245. if (!tab)
  246. goto fail;
  247. *(intptr_t**)tab_ptr = tab;
  248. }
  249. tab[nb++] = (intptr_t)elem;
  250. *nb_ptr = nb;
  251. return;
  252. fail:
  253. av_freep(tab_ptr);
  254. *nb_ptr = 0;
  255. }
  256. void *av_dynarray2_add(void **tab_ptr, int *nb_ptr, size_t elem_size,
  257. const uint8_t *elem_data)
  258. {
  259. int nb = *nb_ptr, nb_alloc;
  260. uint8_t *tab = *tab_ptr, *tab_elem_data;
  261. if ((nb & (nb - 1)) == 0) {
  262. if (nb == 0) {
  263. nb_alloc = 1;
  264. } else {
  265. if (nb > INT_MAX / (2 * elem_size))
  266. goto fail;
  267. nb_alloc = nb * 2;
  268. }
  269. tab = av_realloc(tab, nb_alloc * elem_size);
  270. if (!tab)
  271. goto fail;
  272. *tab_ptr = tab;
  273. }
  274. *nb_ptr = nb + 1;
  275. tab_elem_data = tab + nb*elem_size;
  276. if (elem_data)
  277. memcpy(tab_elem_data, elem_data, elem_size);
  278. else if (CONFIG_MEMORY_POISONING)
  279. memset(tab_elem_data, FF_MEMORY_POISON, elem_size);
  280. return tab_elem_data;
  281. fail:
  282. av_freep(tab_ptr);
  283. *nb_ptr = 0;
  284. return NULL;
  285. }
  286. static void fill16(uint8_t *dst, int len)
  287. {
  288. uint32_t v = AV_RN16(dst - 2);
  289. v |= v << 16;
  290. while (len >= 4) {
  291. AV_WN32(dst, v);
  292. dst += 4;
  293. len -= 4;
  294. }
  295. while (len--) {
  296. *dst = dst[-2];
  297. dst++;
  298. }
  299. }
  300. static void fill24(uint8_t *dst, int len)
  301. {
  302. #if HAVE_BIGENDIAN
  303. uint32_t v = AV_RB24(dst - 3);
  304. uint32_t a = v << 8 | v >> 16;
  305. uint32_t b = v << 16 | v >> 8;
  306. uint32_t c = v << 24 | v;
  307. #else
  308. uint32_t v = AV_RL24(dst - 3);
  309. uint32_t a = v | v << 24;
  310. uint32_t b = v >> 8 | v << 16;
  311. uint32_t c = v >> 16 | v << 8;
  312. #endif
  313. while (len >= 12) {
  314. AV_WN32(dst, a);
  315. AV_WN32(dst + 4, b);
  316. AV_WN32(dst + 8, c);
  317. dst += 12;
  318. len -= 12;
  319. }
  320. if (len >= 4) {
  321. AV_WN32(dst, a);
  322. dst += 4;
  323. len -= 4;
  324. }
  325. if (len >= 4) {
  326. AV_WN32(dst, b);
  327. dst += 4;
  328. len -= 4;
  329. }
  330. while (len--) {
  331. *dst = dst[-3];
  332. dst++;
  333. }
  334. }
  335. static void fill32(uint8_t *dst, int len)
  336. {
  337. uint32_t v = AV_RN32(dst - 4);
  338. while (len >= 4) {
  339. AV_WN32(dst, v);
  340. dst += 4;
  341. len -= 4;
  342. }
  343. while (len--) {
  344. *dst = dst[-4];
  345. dst++;
  346. }
  347. }
  348. void av_memcpy_backptr(uint8_t *dst, int back, int cnt)
  349. {
  350. const uint8_t *src = &dst[-back];
  351. if (!back)
  352. return;
  353. if (back == 1) {
  354. memset(dst, *src, cnt);
  355. } else if (back == 2) {
  356. fill16(dst, cnt);
  357. } else if (back == 3) {
  358. fill24(dst, cnt);
  359. } else if (back == 4) {
  360. fill32(dst, cnt);
  361. } else {
  362. if (cnt >= 16) {
  363. int blocklen = back;
  364. while (cnt > blocklen) {
  365. memcpy(dst, src, blocklen);
  366. dst += blocklen;
  367. cnt -= blocklen;
  368. blocklen <<= 1;
  369. }
  370. memcpy(dst, src, cnt);
  371. return;
  372. }
  373. if (cnt >= 8) {
  374. AV_COPY32U(dst, src);
  375. AV_COPY32U(dst + 4, src + 4);
  376. src += 8;
  377. dst += 8;
  378. cnt -= 8;
  379. }
  380. if (cnt >= 4) {
  381. AV_COPY32U(dst, src);
  382. src += 4;
  383. dst += 4;
  384. cnt -= 4;
  385. }
  386. if (cnt >= 2) {
  387. AV_COPY16U(dst, src);
  388. src += 2;
  389. dst += 2;
  390. cnt -= 2;
  391. }
  392. if (cnt)
  393. *dst = *src;
  394. }
  395. }