Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
359 serge 1
/****************************************************************************
2
*
3
*                            Open Watcom Project
4
*
5
*    Portions Copyright (c) 1983-2002 Sybase, Inc. All Rights Reserved.
6
*
7
*  ========================================================================
8
*
9
*    This file contains Original Code and/or Modifications of Original
10
*    Code as defined in and that are subject to the Sybase Open Watcom
11
*    Public License version 1.0 (the 'License'). You may not use this file
12
*    except in compliance with the License. BY USING THIS FILE YOU AGREE TO
13
*    ALL TERMS AND CONDITIONS OF THE LICENSE. A copy of the License is
14
*    provided with the Original Code and Modifications, and is also
15
*    available at www.sybase.com/developer/opensource.
16
*
17
*    The Original Code and all software distributed under the License are
18
*    distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
19
*    EXPRESS OR IMPLIED, AND SYBASE AND ALL CONTRIBUTORS HEREBY DISCLAIM
20
*    ALL SUCH WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF
21
*    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR
22
*    NON-INFRINGEMENT. Please see the License for the specific language
23
*    governing rights and limitations under the License.
24
*
25
*  ========================================================================
26
*
27
* Description:  WHEN YOU FIGURE OUT WHAT THIS FILE DOES, PLEASE
28
*               DESCRIBE IT HERE!
29
*
30
****************************************************************************/
31
 
32
 
33
//#include "dll.h"        // needs to be first
34
#include "variety.h"
35
#include 
36
#include 
37
#include "heap.h"
38
#include "heapacc.h"
39
 
40
_WCRTLINK size_t _memmax( void )  /* return size of largest free piece from near heap */
41
    {
42
        size_t maxlen, size;
43
        frlptr pnext;
44
        mheapptr mhp;
45
 
46
        maxlen = 0;
47
        _AccessNHeap();
48
        for( mhp = __nheapbeg; mhp != NULL; mhp = mhp->next ) {
49
            pnext = mhp->freehead.next;
50
            while( pnext != (frlptr) &mhp->freehead ) {
51
                size = ((pnext->len - TAG_SIZE) & ~ROUND_SIZE);
52
                if( size > maxlen ) maxlen = size;
53
                pnext = pnext->next;
54
            }
55
        }
56
        _ReleaseNHeap();
57
        return( maxlen );
58
    }