|
| From: | Bertolt Mildner |
| Subject: | [avr-libc-dev] malloc implementation |
| Date: | Thu, 16 Dec 2004 08:21:35 +0100 |
I just had a quick look at malloc.c and saw that in step 2 the free list is walked through a second time. Why is this necessary when in step 1 the smallest fitting chunk has already been found? Bertolt -- Best regards, Bertolt mailto:address@hidden
| [Prev in Thread] | Current Thread | [Next in Thread] |