| /* $Id$ |
| * |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to you under the Apache License, Version |
| * 2.0 (the "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| /* |
| -------------------------------------------------------------------- |
| By Bob Jenkins, September 1996. recycle.h |
| You may use this code in any way you wish, and it is free. No warranty. |
| |
| This manages memory for commonly-allocated structures. |
| It allocates RESTART to REMAX items at a time. |
| Timings have shown that, if malloc is used for every new structure, |
| malloc will consume about 90% of the time in a program. This |
| module cuts down the number of mallocs by an order of magnitude. |
| This also decreases memory fragmentation, and freeing all structures |
| only requires freeing the root. |
| -------------------------------------------------------------------- |
| */ |
| |
| #include "jenkstd.h" |
| |
| #ifndef RECYCLE |
| #define RECYCLE |
| |
| #define RESTART 0 |
| #define REMAX 32000 |
| |
| struct recycle |
| { |
| struct recycle *next; |
| }; |
| typedef struct recycle recycle; |
| |
| struct reroot |
| { |
| struct recycle *list; /* list of malloced blocks */ |
| struct recycle *trash; /* list of deleted items */ |
| size_t size; /* size of an item */ |
| size_t logsize; /* log_2 of number of items in a block */ |
| intx numleft; /* number of bytes left in this block */ |
| }; |
| typedef struct reroot reroot; |
| |
| /* make a new recycling root */ |
| reroot *remkroot(size_t mysize); |
| |
| /* free a recycling root and all the items it has made */ |
| void refree(struct reroot *r); |
| |
| /* get a new (cleared) item from the root */ |
| #define renew(r) ((r)->numleft ? \ |
| (((char *)((r)->list+1))+((r)->numleft-=(int)(r)->size)) : renewx(r)) |
| |
| char *renewx(struct reroot *r); |
| |
| |
| /* delete an item; let the root recycle it */ |
| /* void redel(/o_ struct reroot *r, struct recycle *item _o/); */ |
| #define redel(root,item) { \ |
| ((recycle *)item)->next=(root)->trash; \ |
| (root)->trash=(recycle *)(item); \ |
| } |
| |
| /* malloc, but complain to stderr and exit program if no joy */ |
| /* use plain free() to free memory allocated by remalloc() */ |
| char *remalloc(size_t len, char *purpose); |
| |
| #endif /* RECYCLE */ |