1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296
|
/*===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
*/
typedef struct MemBankImpl MemBankImpl;
#define MEMBANK_IMPL MemBankImpl
#include <sysalloc.h>
#include "caps.h"
#include "ctx.h"
#include "mem.h"
#include "except.h"
#include "status.h"
#include <kfs/directory.h>
#include <kfs/file.h>
#include <kfs/mmap.h>
#include <klib/refcount.h>
#include <klib/container.h>
#include <klib/rc.h>
#include <atomic.h>
#include <stdlib.h>
#include <string.h>
FILE_ENTRY ( membank );
/*--------------------------------------------------------------------------
* MemBankImpl
* maintains a quota
*/
struct MemBankImpl
{
MemBank dad;
size_t quota;
atomic_t avail;
};
static
void MemBankImplWhack ( MemBankImpl *self, const ctx_t *ctx )
{
FUNC_ENTRY ( ctx );
Caps *caps;
MemBankDestroy ( & self -> dad, ctx );
caps = ( Caps* ) ctx -> caps;
if ( & self -> dad != caps -> mem )
MemBankFree ( caps -> mem, ctx, self, sizeof * self );
else
{
free ( self );
caps -> mem = NULL;
}
}
/* InUse
* report the number of bytes in use
* optionally returns quota
*/
static
size_t MemBankImplInUse ( const MemBankImpl *self, const ctx_t *ctx, size_t *quota )
{
size_t dummy;
if ( quota == NULL )
quota = & dummy;
if ( self != NULL )
{
* quota = self -> quota;
return self -> quota - atomic_read ( & self -> avail );
}
* quota = 0;
return 0;
}
/* Alloc
* allocates some memory from bank
*/
static
void *MemBankImplAlloc ( MemBankImpl *self, const ctx_t *ctx, size_t bytes, bool clear )
{
if ( self != NULL )
{
/* allocation from the raw bank */
rc_t rc;
FUNC_ENTRY ( ctx );
/* update "avail" atomicially */
size_t remaining, avail;
for ( avail = atomic_read ( & self -> avail ); avail >= bytes; avail = remaining )
{
/* subtract the bytes */
remaining = atomic_test_and_set ( & self -> avail,
( atomic_int ) ( avail - bytes ), ( atomic_int ) avail );
if ( remaining == avail )
{
/* try to allocate the memory directly */
void *mem = clear ? calloc ( 1, bytes ) : malloc ( bytes );
if ( mem == NULL )
{
/* failed to get memory */
atomic_add ( & self -> avail, ( atomic_int ) bytes );
rc = RC ( rcExe, rcMemory, rcAllocating, rcMemory, rcExhausted );
ERROR ( rc, "failed to allocate %zu bytes of memory", bytes );
}
else if ( bytes > 256 * 1024 )
{
if ( bytes > 1024 * 1024 )
STATUS ( 3, "allocated %,zu bytes of memory", bytes );
else
STATUS ( 4, "allocated %,zu bytes of memory", bytes );
}
return mem;
}
}
/* at this point we could be using a timeout */
rc = RC ( rcExe, rcMemory, rcAllocating, rcRange, rcExcessive );
ERROR ( rc, "quota exceeded allocating %zu bytes of memory", bytes );
}
return NULL;
}
/* Free
* returns memory to bank
* ignored by paged bank
* burden on caller to remember allocation size
*/
static
void MemBankImplFree ( MemBankImpl *self, const ctx_t *ctx, void *mem, size_t bytes )
{
if ( mem != NULL )
{
FUNC_ENTRY ( ctx );
if ( self == NULL )
{
rc_t rc = RC ( rcExe, rcMemory, rcReleasing, rcSelf, rcNull );
ERROR ( rc, "attempt to return memory to NULL MemBank" );
}
else
{
/* release the memory */
free ( mem );
/* update the counters */
if ( bytes == 0 )
ANNOTATE ( "freed memory with size of 0 bytes" );
else
{
atomic_add ( & self -> avail, ( atomic_int ) bytes );
if ( bytes > 256 * 1024 )
{
if ( bytes > 1024 * 1024 )
STATUS ( 3, "freed %,zu bytes of memory", bytes );
else
STATUS ( 4, "freed %,zu bytes of memory", bytes );
}
}
}
}
}
static MemBank_vt MemBankImpl_vt =
{
MemBankImplWhack,
MemBankImplInUse,
MemBankImplAlloc,
MemBankImplFree
};
/*--------------------------------------------------------------------------
* MemBank
* very, very, very watered down memory bank
*/
/* Make
* make a new memory bank
* in a real system, this could make a bank linked to
* the primordial one. in this system, there is only
* a single bank, so this function is overloaded to
* create both the primordial and to reset quota on it.
*/
MemBank *MemBankMake ( const ctx_t *ctx, size_t quota )
{
FUNC_ENTRY ( ctx );
MemBankImpl *mem = malloc ( sizeof * mem );
if ( mem == NULL )
exit ( -1 );
MemBankInit ( & mem -> dad, ctx, & MemBankImpl_vt, "Process MemBank" );
if ( quota < 4096 )
quota = 4096;
mem -> quota = quota;
atomic_set ( & mem -> avail, ( atomic_int ) ( quota - sizeof * mem ) );
return & mem -> dad;
}
/* Init
*/
void MemBankInit ( MemBank *self, const ctx_t *ctx, const MemBank_vt *vt, const char *name )
{
FUNC_ENTRY ( ctx );
self -> vt = vt;
KRefcountInit ( & self -> refcount, 1, "MemBank", "Make", name );
self -> align = 0;
}
/* Duplicate
* Release
*/
MemBank *MemBankDuplicate ( const MemBank *self, const ctx_t *ctx )
{
if ( self != NULL )
{
switch ( KRefcountAdd ( & self -> refcount, "MemBank" ) )
{
case krefOkay:
case krefWhack:
case krefZero:
break;
case krefLimit:
case krefNegative: {
FUNC_ENTRY ( ctx );
rc_t rc = RC ( rcExe, rcMemory, rcAttaching, rcRange, rcExcessive );
ERROR ( rc, "excessive references on MemBank" );
return NULL;
}}
}
return ( MemBank* ) self;
}
void MemBankRelease ( const MemBank *self, const ctx_t *ctx )
{
if ( self != NULL )
{
switch ( KRefcountDrop ( & self -> refcount, "MemBank" ) )
{
case krefOkay:
break;
case krefWhack:
( * self -> vt -> whack ) ( ( MEMBANK_IMPL* ) self, ctx );
break;
case krefZero:
break;
case krefLimit:
case krefNegative: {
FUNC_ENTRY ( ctx );
rc_t rc = RC ( rcExe, rcMemory, rcReleasing, rcRange, rcExcessive );
ERROR ( rc, "excessive releases on MemBank" );
}}
}
}
|