| 18 |
|
#if 1 |
| 19 |
|
|
| 20 |
|
char * |
| 21 |
< |
savqstr(s) /* save a private string */ |
| 22 |
< |
register char *s; |
| 21 |
> |
savqstr(char *s) /* save a private string */ |
| 22 |
|
{ |
| 23 |
< |
register char *cp; |
| 23 |
> |
char *cp; |
| 24 |
|
char *newp; |
| 25 |
|
|
| 26 |
|
for (cp = s; *cp++; ) /* compute strlen()+1 */ |
| 37 |
|
|
| 38 |
|
|
| 39 |
|
void |
| 40 |
< |
freeqstr(s) /* free a private string */ |
| 42 |
< |
char *s; |
| 40 |
> |
freeqstr(char *s) /* free a private string */ |
| 41 |
|
{ |
| 42 |
|
if (s != NULL) |
| 43 |
|
free((void *)s); |
| 50 |
|
* large blocks to optimize paging in VM environments. |
| 51 |
|
*/ |
| 52 |
|
|
| 53 |
+ |
#include "rtmisc.h" |
| 54 |
+ |
|
| 55 |
|
#ifdef SMLMEM |
| 56 |
|
#ifndef MINBLOCK |
| 57 |
|
#define MINBLOCK (1<<10) /* minimum allocation block size */ |
| 68 |
|
#endif |
| 69 |
|
#endif |
| 70 |
|
|
| 71 |
– |
extern char *bmalloc(); |
| 71 |
|
|
| 73 |
– |
|
| 72 |
|
char * |
| 73 |
< |
savqstr(s) /* save a private string */ |
| 76 |
< |
register char *s; |
| 73 |
> |
savqstr(char *s) /* save a private string */ |
| 74 |
|
{ |
| 75 |
|
static char *curp = NULL; /* allocated memory pointer */ |
| 76 |
|
static unsigned nrem = 0; /* bytes remaining in block */ |
| 77 |
|
static unsigned nextalloc = MINBLOCK; /* next block size */ |
| 78 |
< |
register char *cp; |
| 79 |
< |
register unsigned n; |
| 78 |
> |
char *cp; |
| 79 |
> |
unsigned n; |
| 80 |
|
|
| 81 |
|
for (cp = s; *cp++; ) /* compute strlen()+1 */ |
| 82 |
|
; |
| 101 |
|
|
| 102 |
|
|
| 103 |
|
void |
| 104 |
< |
freeqstr(s) /* free a private string (not recommended) */ |
| 108 |
< |
char *s; |
| 104 |
> |
freeqstr(char *s) /* free a private string (not recommended) */ |
| 105 |
|
{ |
| 106 |
|
bfree(s, strlen(s)+1); |
| 107 |
|
} |