aboutsummaryrefslogtreecommitdiffstats
path: root/src/tlsf.c
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2009-07-03 07:43:44 +0000
committerDavid Robillard <d@drobilla.net>2009-07-03 07:43:44 +0000
commit22dac3110718ed92672d22f0438034c7e1b77dfd (patch)
tree00001ab836d1ce4dd7d4616409fd6025ed8d8aa9 /src/tlsf.c
parent6bbc46388656547dd566849d3ed8aaaec9ad1cb9 (diff)
downloadresp-22dac3110718ed92672d22f0438034c7e1b77dfd.tar.gz
resp-22dac3110718ed92672d22f0438034c7e1b77dfd.tar.bz2
resp-22dac3110718ed92672d22f0438034c7e1b77dfd.zip
Tidy.
git-svn-id: http://svn.drobilla.net/resp/tuplr@175 ad02d1e2-f140-0410-9f75-f8b11f17cedd
Diffstat (limited to 'src/tlsf.c')
-rw-r--r--src/tlsf.c10
1 files changed, 3 insertions, 7 deletions
diff --git a/src/tlsf.c b/src/tlsf.c
index b912800..97a1410 100644
--- a/src/tlsf.c
+++ b/src/tlsf.c
@@ -1,6 +1,9 @@
/* Two Levels Segregate Fit memory allocator (TLSF)
* Version 2.4.4
*
+ * Modified for Tuplr by David Robillard.
+ * Original TLSF code available at http://rtportal.upv.es/rtmalloc/
+ *
* Written by Miguel Masmano Tello <mimastel@doctor.upv.es>
*
* Thanks to Ismael Ripoll for his suggestions and reviews
@@ -14,10 +17,6 @@
* Released under the terms of the GNU Lesser General Public License Version 2.1
*/
-/* This version of TLSF has been modified for Tuplr by David Robillard.
- * The original code is available at http://rtportal.upv.es/rtmalloc/
- */
-
//#define USE_SBRK 1
#define USE_MMAP 1
//#define TLSF_STATISTICS 1
@@ -251,7 +250,6 @@ MAPPING_INSERT(size_t _r, int *_fl, int *_sl)
}
}
-
static inline bhdr_t*
FIND_SUITABLE_BLOCK(tlsf_t * _tlsf, int *_fl, int *_sl)
{
@@ -271,7 +269,6 @@ FIND_SUITABLE_BLOCK(tlsf_t * _tlsf, int *_fl, int *_sl)
return _b;
}
-
#define EXTRACT_BLOCK_HDR(_b, _tlsf, _fl, _sl) do { \
_tlsf -> matrix [_fl] [_sl] = _b -> ptr.free_ptr.next; \
if (_tlsf -> matrix[_fl][_sl]) \
@@ -285,7 +282,6 @@ FIND_SUITABLE_BLOCK(tlsf_t * _tlsf, int *_fl, int *_sl)
_b -> ptr.free_ptr.next = NULL; \
} while (0)
-
#define EXTRACT_BLOCK(_b, _tlsf, _fl, _sl) do { \
if (_b -> ptr.free_ptr.next) \
_b -> ptr.free_ptr.next -> ptr.free_ptr.prev = _b -> ptr.free_ptr.prev; \