Lpc2000

Marko Pavlin ha scritto:

>Hello!
>
>I am looking for simple dynamic memory allocation management for 
>LPC213x. 
>
In C you may use malloc(), alloc() and free.

>I need some segmentation for using simple, variable length 
>linked lists. Priority is speed.
>  
>
You may find any algorithm book with C or C++ source. Of course to add 
an element from the list you have to alloca some space before to connect 
next element to the list (also insert have the same necessity) and for 
remove you have to disconnect the list item and then deallocate some 
space. In my opinion you may find pool algorithms and use a memory pool 
to allocate/free memory for the list because it permits a better memory 
usage. Of course you have to define the maximum pool size but of course 
memory is phisically limited.

>Could someone point me to some "c" sources?
>
>Thanks!
>
>
>Marko
>
>
> 
>Yahoo! Groups Links
>
>
>
> 
>
>
>
>
>
>  
>


  ----------

No virus found in this outgoing message.
Checked by AVG Free Edition.
Version: 7.1.375 / Virus Database: 267.14.19/231 - Release Date: 16/01/2006


[Non-text portions of this message have been removed]