| 37 | } |
| 38 | |
| 39 | static void list_dealloc( LIST * l ) |
| 40 | { |
| 41 | int32_t size = list_length( l ); |
| 42 | int32_t bucket; |
| 43 | LIST * node = l; |
| 44 | |
| 45 | if ( size == 0 ) return; |
| 46 | |
| 47 | bucket = get_bucket( size );; |
| 48 | |
| 49 | #ifdef BJAM_NO_MEM_CACHE |
| 50 | BJAM_FREE( node ); |
| 51 | #else |
| 52 | node->impl.next = freelist[ bucket ]; |
| 53 | freelist[ bucket ] = node; |
| 54 | #endif |
| 55 | } |
| 56 | |
| 57 | /* |
| 58 | * list_append() - append a list onto another one, returning total |
no test coverage detected