| 1 |
/*----------------------------------------------------------------------* |
| 2 |
* File: salloc.C |
| 3 |
*----------------------------------------------------------------------* |
| 4 |
* |
| 5 |
* All portions of code are copyright by their respective author/s. |
| 6 |
* Copyright (c) 2003-2006 Marc Lehmann <schmorp@schmorp.de> |
| 7 |
* |
| 8 |
* This program is free software; you can redistribute it and/or modify |
| 9 |
* it under the terms of the GNU General Public License as published by |
| 10 |
* the Free Software Foundation; either version 2 of the License, or |
| 11 |
* (at your option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License |
| 19 |
* along with this program; if not, write to the Free Software |
| 20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 21 |
*----------------------------------------------------------------------*/ |
| 22 |
|
| 23 |
#include "salloc.h" |
| 24 |
|
| 25 |
#define SALLOC_BLOCK 65536 // size of basic block to allocate |
| 26 |
|
| 27 |
rxvt_salloc::rxvt_salloc (unsigned int size) |
| 28 |
{ |
| 29 |
this->size = size < sizeof (chain) ? sizeof (chain) : size; |
| 30 |
firstline = 0; |
| 31 |
firstblock = 0; |
| 32 |
firstfree = SALLOC_BLOCK; |
| 33 |
} |
| 34 |
|
| 35 |
rxvt_salloc::~rxvt_salloc () |
| 36 |
{ |
| 37 |
while (firstblock) |
| 38 |
{ |
| 39 |
chain *next = firstblock->next; |
| 40 |
::free (firstblock); |
| 41 |
firstblock = next; |
| 42 |
} |
| 43 |
} |
| 44 |
|
| 45 |
void * |
| 46 |
rxvt_salloc::alloc () |
| 47 |
{ |
| 48 |
void *r; |
| 49 |
|
| 50 |
if (firstline) |
| 51 |
{ |
| 52 |
r = (void *)firstline; |
| 53 |
firstline = firstline->next; |
| 54 |
} |
| 55 |
else |
| 56 |
{ |
| 57 |
if (firstfree + size > SALLOC_BLOCK) |
| 58 |
{ |
| 59 |
chain *next = (chain *)rxvt_malloc ((SALLOC_BLOCK - sizeof (chain)) / size * size + sizeof (chain)); |
| 60 |
next->next = firstblock; |
| 61 |
firstblock = next; |
| 62 |
firstfree = sizeof (chain); |
| 63 |
} |
| 64 |
|
| 65 |
r = (void *) ((char *)firstblock + firstfree); |
| 66 |
|
| 67 |
firstfree += size; |
| 68 |
} |
| 69 |
|
| 70 |
return r; |
| 71 |
} |
| 72 |
|
| 73 |
void * |
| 74 |
rxvt_salloc::alloc (void *data, unsigned int datalen) |
| 75 |
{ |
| 76 |
void *s = alloc (); |
| 77 |
|
| 78 |
if (datalen < size) |
| 79 |
{ |
| 80 |
memcpy (s, data, datalen); |
| 81 |
memset ((unsigned char *)s + datalen, 0, size - datalen); // not strictly required for screen.C |
| 82 |
} |
| 83 |
else |
| 84 |
memcpy (s, data, size); |
| 85 |
|
| 86 |
return s; |
| 87 |
} |
| 88 |
|
| 89 |
void |
| 90 |
rxvt_salloc::free (void *data) |
| 91 |
{ |
| 92 |
if (!data) |
| 93 |
return; |
| 94 |
|
| 95 |
chain *line = (chain *)data; |
| 96 |
line->next = firstline; |
| 97 |
firstline = line; |
| 98 |
} |
| 99 |
|
