This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

link list

Hello everyone,
I am studying link list in c
I have a project in which I have lookup table of rpm (clocks used to load the timer used for motor).
This rpm table, I am taking in an array
Now I want to implement a link list which will access the rpm from table and load it to timer of clock used for running the motor
Is it possible
Because as I am studying the link list, in that it is mentioned that link list is used instead of array
Is it possible to access an array elements using link list ?
If yes, then pls suggest me some link for it
Correct me if I am wrong
Thank u all

Parents
  • No, the data was dynamic,

    Well, then you used the right tool for the job.

    stored in a fixed area of memory (i.e., no use of malloc or the like),

    As far as I've read the docs, the C51 implementations of malloc et al do exactly that - you give them a fixed area of memory and they hand out/free small chunks of it when asked.

    Regardless of whether you use malloc or have rolled your own memory allocation functions, you may still run into things like memory fragmentation, though.

Reply
  • No, the data was dynamic,

    Well, then you used the right tool for the job.

    stored in a fixed area of memory (i.e., no use of malloc or the like),

    As far as I've read the docs, the C51 implementations of malloc et al do exactly that - you give them a fixed area of memory and they hand out/free small chunks of it when asked.

    Regardless of whether you use malloc or have rolled your own memory allocation functions, you may still run into things like memory fragmentation, though.

Children
  • "As far as I've read the docs, the C51 implementations of malloc et al do exactly that - you give them a fixed area of memory and they hand out/free small chunks of it when asked."

    Sorry, I didn't explain that so clearly. We just used our own simple allocation strategy of the fixed area.

    For fragmentation control, we would mark blocks as free and then coalesce the free space at suitable and appropriate times. It was done as a background, interruptable and low priority operation - Again, within acceptable constraints specified by our customer.