Return to alloc.h CVS log

Up to [MW Coherent from dump] / coherent / f / usr / include / kernel

Annotation of coherent/f/usr/include/kernel/alloc.h, revision 1.1

1.1     ! root        1: /* (-lgl
        !             2:  *     COHERENT Version 3.0
        !             3:  *     Copyright (c) 1982, 1990 by Mark Williams Company.
        !             4:  *     All rights reserved. May not be copied without permission.
        !             5:  -lgl) */
        !             6: /*
        !             7:  * Kernel memory allocator.
        !             8:  */
        !             9: 
        !            10: #ifndef         __KERNEL_ALLOC_H__
        !            11: #define         __KERNEL_ALLOC_H__
        !            12: 
        !            13: #include <common/feature.h>
        !            14: #include <common/ccompat.h>
        !            15: #include <common/__size.h>
        !            16: #include <common/__parith.h>
        !            17: 
        !            18: #define        NEXT_FIT        1
        !            19: 
        !            20: /*
        !            21:  * Structure for allocator.
        !            22:  */
        !            23: 
        !            24: #if    NEXT_FIT
        !            25: 
        !            26: typedef        struct _heap    heap_t;
        !            27: 
        !            28: #else
        !            29: 
        !            30: typedef        __VOID__      * heap_t;
        !            31: 
        !            32: #endif
        !            33: 
        !            34: 
        !            35: __EXTERN_C_BEGIN__
        !            36: 
        !            37: heap_t       * setarena        __PROTO ((__VOID__ * _base, __size_t _size));
        !            38: __VOID__      *        alloc           __PROTO ((heap_t * _arena, __size_t _size));
        !            39: 
        !            40: __EXTERN_C_END__
        !            41: 
        !            42: #endif /* ! defined (__KERNEL_ALLOC_H__) */

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.