bheapset.c

来自「开放源码的编译器open watcom 1.6.0版的源代码」· C语言 代码 · 共 59 行

/****************************************************************************
*
*                            Open Watcom Project
*
*    Portions Copyright (c) 1983-2002 Sybase, Inc. All Rights Reserved.
*
*  ========================================================================
*
*    This file contains Original Code and/or Modifications of Original
*    Code as defined in and that are subject to the Sybase Open Watcom
*    Public License version 1.0 (the 'License'). You may not use this file
*    except in compliance with the License. BY USING THIS FILE YOU AGREE TO
*    ALL TERMS AND CONDITIONS OF THE LICENSE. A copy of the License is
*    provided with the Original Code and Modifications, and is also
*    available at www.sybase.com/developer/opensource.
*
*    The Original Code and all software distributed under the License are
*    distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
*    EXPRESS OR IMPLIED, AND SYBASE AND ALL CONTRIBUTORS HEREBY DISCLAIM
*    ALL SUCH WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF
*    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR
*    NON-INFRINGEMENT. Please see the License for the specific language
*    governing rights and limitations under the License.
*
*  ========================================================================
*
* Description:  WHEN YOU FIGURE OUT WHAT THIS FILE DOES, PLEASE
*               DESCRIBE IT HERE!
*
****************************************************************************/


#include "dll.h"        // needs to be first
#include "variety.h"
#include <malloc.h>
#include "heap.h"


_WCRTLINK int _bheapset( __segment seg, unsigned int fill )
{
    int         test_heap;
    struct heapblk __based(seg) *p;

    if( seg == _DGroup() ) return( _nheapset( fill ) );
    if( seg == _NULLSEG ) {
        p = 0;
        for( seg = __bheap; seg; ) {
            test_heap = _bheapset( seg, fill );
            if( test_heap != _HEAPOK )  return( test_heap );
            seg = p->nextseg;
        }
        return( _HEAPOK );
    } else {
        test_heap = _bheapchk( seg );
        if( test_heap != _HEAPOK )  return( test_heap );
        return( __HeapSet( seg, fill ) );
    }
}