Mirrors/avrdude
1
0
Fork 0
mirror of https://github.com/avrdudes/avrdude.git synced 2026-09-22 17:16:24 +03:00
Code Issues Packages Projects Releases Wiki Activity

Utilise magic memory tree interface for src/lists.c

Browse Source
This commit is contained in:
Stefan Rueger
2024-04-26 23:31:20 +01:00
parent d561704890
commit 3fb246b775
1 changed files with 6 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/lists.c
View File

@@ -40,19 +40,15 @@
#include <stdio.h>
#include <stdlib.h>
#include "avrdude.h"
#include "libavrdude.h"
#define MAGIC 0xb05b05b0
#define CHECK_MAGIC 0 /* set to 1 to enable memory overwrite detection */
#ifdef BOS
#define MALLOC(size,x) kmalloc(size,x)
#define FREE kfree
#else
#define MALLOC(size,x) malloc(size)
#define FREE free
#endif
#define MALLOC(size,x) mmt_malloc(size)
#define FREE mmt_free
/*------------------------------------------------------------
@@ -397,13 +393,13 @@ free_listnode ( LIST * l, LISTNODE * ln )
If liststruct is not NULL, it is used to provide the memory space
for the list structure instance, otherwise, the necessary memory is
malloc'd.
mmt_malloc'd.
If elements is zero, the default poolsize is used, otherwise,
poolsizes of 'elements' elements are malloc'd to obtain the memory
poolsizes of 'elements' elements are mmt_malloc'd to obtain the memory
for list nodes. Minimum element count is 5.
The first node pool is not preallocated; instead it is malloc'd at
The first node pool is not preallocated; instead it is mmt_malloc'd at
the time of the first use.
----------------------------------------------------------------------*/
LISTID