Lines Matching +full:fail +full:- +full:fast

2                       BGET  --  Memory Allocator
13 configured by compile-time definitions, Major options include:
15 * A built-in test program to exercise BGET and
24 * Built-in routines to dump individual buffers or the
33 means of call-backs to user defined functions.
35 Applications of BGET can range from storage management in ROM-based
47 to name two, on which programs have obtained substantial speed-ups by
53 systems, multi-thread applications, embedded software in data network
56 fast, memory efficient, portable, and easy to integrate into your
88 ---------------------
100 ------------------
106 bpool()--usually obtained by making a call to the operating system's
107 low-level memory allocator. Then allocate buffers with bget(), bgetz(),
109 to zero and [inefficient] re-allocation of existing buffers for
116 ----------------------------
120 application-specific memory compaction by compiling BGET with the BECtl
125 acquisition function, does it?). Once the call-back functions have been
137 next-higher sequence number.
141 non-NULL allocation function was supplied to bectl(). If so, that
150 a non-NULL release function is supplied, expansion blocks which become
207 become empty. If <compact> is non-NULL, whenever a buffer allocation
217 is re-tried. If <compact> returns 0 (as it must if it isn't able to
220 <acquire> argument is non-NULL. At the time the <compact> function is
234 If <acquire> is non-NULL, that function will be called whenever an
239 allocation process will fail. <pool_incr> specifies the normal
242 linked-block scheme (in other words, larger than <pool_incr> minus the
256 successful (non-NULL return) bget() calls and the number of brel()
295 #define TestProg 20000 /* Generate built-in test program