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 | #if defined(__SMALL_DATA__) |
||
| 41 | _WCRTLINK int _heapwalk( struct _heapinfo *entry ) |
||
| 42 | { |
||
| 43 | return( _nheapwalk( entry ) ); |
||
| 44 | } |
||
| 45 | #endif |
||
| 46 | |||
| 47 | int __NHeapWalk( struct _heapinfo *entry, mheapptr heapbeg ) |
||
| 48 | { |
||
| 49 | frlptr p; |
||
| 50 | frlptr q; |
||
| 51 | |||
| 52 | if( heapbeg == NULL ) { |
||
| 53 | return( _HEAPEMPTY ); |
||
| 54 | } |
||
| 55 | p = (frlptr)(entry->_pentry); |
||
| 56 | if( p == NULL ) { |
||
| 57 | p = (frlptr)(heapbeg + 1); |
||
| 58 | } else { /* advance to next entry */ |
||
| 59 | for( heapbeg = __nheapbeg;; heapbeg = heapbeg->next ) { |
||
| 60 | if( heapbeg->next == NULL ) break; |
||
| 61 | if( (PTR)heapbeg <= (PTR)p && |
||
| 62 | (PTR)heapbeg+heapbeg->len > (PTR)p ) break; |
||
| 63 | } |
||
| 64 | q = (frlptr)((PTR)p + (p->len & ~1)); |
||
| 65 | if( q <= p ) { |
||
| 66 | return( _HEAPBADNODE ); |
||
| 67 | } |
||
| 68 | p = q; |
||
| 69 | } |
||
| 70 | for( ;; ) { |
||
| 71 | if( p->len == END_TAG ) { |
||
| 72 | if( heapbeg->next == NULL ) { |
||
| 73 | entry->_useflag = _USEDENTRY; |
||
| 74 | entry->_size = 0; |
||
| 75 | entry->_pentry = NULL; |
||
| 76 | return( _HEAPEND ); |
||
| 77 | } else { // We advance to next miniheapblk |
||
| 78 | heapbeg = heapbeg->next; |
||
| 79 | p = (frlptr)(heapbeg + 1); |
||
| 80 | } |
||
| 81 | } else { |
||
| 82 | break; |
||
| 83 | } |
||
| 84 | } |
||
| 85 | entry->_pentry = p; |
||
| 86 | entry->_useflag = _FREEENTRY; |
||
| 87 | entry->_size = p->len & ~1; |
||
| 88 | if( p->len & 1 ) { |
||
| 89 | entry->_useflag = _USEDENTRY; |
||
| 90 | } |
||
| 91 | return( _HEAPOK ); |
||
| 92 | } |
||
| 93 | |||
| 94 | _WCRTLINK int _nheapwalk( struct _heapinfo *entry ) |
||
| 95 | { |
||
| 96 | int heap_status; |
||
| 97 | |||
| 98 | _AccessNHeap(); |
||
| 99 | heap_status = __NHeapWalk( entry, __nheapbeg ); |
||
| 100 | _ReleaseNHeap(); |
||
| 101 | return( heap_status ); |
||
| 102 | } |
||
| 103 |