1 |
– |
/* Copyright (c) 1991 Regents of the University of California */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
< |
* Quick and dirty string saver. |
5 |
> |
* Save unshared strings. |
6 |
> |
* |
7 |
> |
* External symbols declared in standard.h |
8 |
|
*/ |
9 |
|
|
10 |
< |
#define NULL 0 |
10 |
> |
/* ==================================================================== |
11 |
> |
* The Radiance Software License, Version 1.0 |
12 |
> |
* |
13 |
> |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
14 |
> |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
15 |
> |
* |
16 |
> |
* Redistribution and use in source and binary forms, with or without |
17 |
> |
* modification, are permitted provided that the following conditions |
18 |
> |
* are met: |
19 |
> |
* |
20 |
> |
* 1. Redistributions of source code must retain the above copyright |
21 |
> |
* notice, this list of conditions and the following disclaimer. |
22 |
> |
* |
23 |
> |
* 2. Redistributions in binary form must reproduce the above copyright |
24 |
> |
* notice, this list of conditions and the following disclaimer in |
25 |
> |
* the documentation and/or other materials provided with the |
26 |
> |
* distribution. |
27 |
> |
* |
28 |
> |
* 3. The end-user documentation included with the redistribution, |
29 |
> |
* if any, must include the following acknowledgment: |
30 |
> |
* "This product includes Radiance software |
31 |
> |
* (http://radsite.lbl.gov/) |
32 |
> |
* developed by the Lawrence Berkeley National Laboratory |
33 |
> |
* (http://www.lbl.gov/)." |
34 |
> |
* Alternately, this acknowledgment may appear in the software itself, |
35 |
> |
* if and wherever such third-party acknowledgments normally appear. |
36 |
> |
* |
37 |
> |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
38 |
> |
* and "The Regents of the University of California" must |
39 |
> |
* not be used to endorse or promote products derived from this |
40 |
> |
* software without prior written permission. For written |
41 |
> |
* permission, please contact [email protected]. |
42 |
> |
* |
43 |
> |
* 5. Products derived from this software may not be called "Radiance", |
44 |
> |
* nor may "Radiance" appear in their name, without prior written |
45 |
> |
* permission of Lawrence Berkeley National Laboratory. |
46 |
> |
* |
47 |
> |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
48 |
> |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
49 |
> |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
50 |
> |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
51 |
> |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
52 |
> |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
53 |
> |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
54 |
> |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
55 |
> |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
56 |
> |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
57 |
> |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
58 |
> |
* SUCH DAMAGE. |
59 |
> |
* ==================================================================== |
60 |
> |
* |
61 |
> |
* This software consists of voluntary contributions made by many |
62 |
> |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
63 |
> |
* information on Lawrence Berkeley National Laboratory, please see |
64 |
> |
* <http://www.lbl.gov/>. |
65 |
> |
*/ |
66 |
|
|
67 |
< |
extern char *strcpy(), *strcat(), *bmalloc(); |
67 |
> |
#include <stdlib.h> |
68 |
|
|
69 |
+ |
extern void eputs(); |
70 |
+ |
extern void quit(); |
71 |
|
|
72 |
+ |
#if 1 |
73 |
+ |
|
74 |
|
char * |
75 |
|
savqstr(s) /* save a private string */ |
76 |
< |
char *s; |
76 |
> |
register char *s; |
77 |
|
{ |
78 |
|
register char *cp; |
79 |
+ |
char *newp; |
80 |
|
|
81 |
< |
if ((cp = bmalloc(strlen(s)+1)) == NULL) { |
81 |
> |
for (cp = s; *cp++; ) /* compute strlen()+1 */ |
82 |
> |
; |
83 |
> |
newp = (char *)malloc(cp-s); |
84 |
> |
if (newp == NULL) { |
85 |
|
eputs("out of memory in savqstr"); |
86 |
|
quit(1); |
87 |
|
} |
88 |
< |
(void)strcpy(cp, s); |
89 |
< |
return(cp); |
88 |
> |
for (cp = newp; *cp++ = *s++; ) /* inline strcpy() */ |
89 |
> |
; |
90 |
> |
return(newp); /* return new location */ |
91 |
|
} |
92 |
|
|
93 |
|
|
94 |
+ |
void |
95 |
|
freeqstr(s) /* free a private string */ |
96 |
|
char *s; |
97 |
|
{ |
98 |
+ |
free((void *)s); |
99 |
+ |
} |
100 |
+ |
|
101 |
+ |
#else |
102 |
+ |
|
103 |
+ |
/* |
104 |
+ |
* Save unshared strings, packing them together into |
105 |
+ |
* large blocks to optimize paging in VM environments. |
106 |
+ |
*/ |
107 |
+ |
|
108 |
+ |
#ifdef BIGMEM |
109 |
+ |
#ifndef MINBLOCK |
110 |
+ |
#define MINBLOCK (1<<12) /* minimum allocation block size */ |
111 |
+ |
#endif |
112 |
+ |
#ifndef MAXBLOCK |
113 |
+ |
#define MAXBLOCK (1<<16) /* maximum allocation block size */ |
114 |
+ |
#endif |
115 |
+ |
#else |
116 |
+ |
#ifndef MINBLOCK |
117 |
+ |
#define MINBLOCK (1<<10) /* minimum allocation block size */ |
118 |
+ |
#endif |
119 |
+ |
#ifndef MAXBLOCK |
120 |
+ |
#define MAXBLOCK (1<<14) /* maximum allocation block size */ |
121 |
+ |
#endif |
122 |
+ |
#endif |
123 |
+ |
|
124 |
+ |
extern char *bmalloc(); |
125 |
+ |
|
126 |
+ |
|
127 |
+ |
char * |
128 |
+ |
savqstr(s) /* save a private string */ |
129 |
+ |
register char *s; |
130 |
+ |
{ |
131 |
+ |
static char *curp = NULL; /* allocated memory pointer */ |
132 |
+ |
static unsigned nrem = 0; /* bytes remaining in block */ |
133 |
+ |
static unsigned nextalloc = MINBLOCK; /* next block size */ |
134 |
+ |
register char *cp; |
135 |
+ |
register unsigned n; |
136 |
+ |
|
137 |
+ |
for (cp = s; *cp++; ) /* compute strlen()+1 */ |
138 |
+ |
; |
139 |
+ |
if ((n = cp-s) > nrem) { /* do we need more core? */ |
140 |
+ |
bfree(curp, nrem); /* free remnant */ |
141 |
+ |
while (n > nextalloc) |
142 |
+ |
nextalloc <<= 1; |
143 |
+ |
if ((curp = bmalloc(nrem=nextalloc)) == NULL) { |
144 |
+ |
eputs("out of memory in savqstr"); |
145 |
+ |
quit(1); |
146 |
+ |
} |
147 |
+ |
if ((nextalloc <<= 1) > MAXBLOCK) /* double block size */ |
148 |
+ |
nextalloc = MAXBLOCK; |
149 |
+ |
} |
150 |
+ |
for (cp = curp; *cp++ = *s++; ) /* inline strcpy() */ |
151 |
+ |
; |
152 |
+ |
s = curp; /* update allocation info. */ |
153 |
+ |
curp = cp; |
154 |
+ |
nrem -= n; |
155 |
+ |
return(s); /* return new location */ |
156 |
+ |
} |
157 |
+ |
|
158 |
+ |
|
159 |
+ |
void |
160 |
+ |
freeqstr(s) /* free a private string (not recommended) */ |
161 |
+ |
char *s; |
162 |
+ |
{ |
163 |
|
bfree(s, strlen(s)+1); |
164 |
|
} |
165 |
+ |
|
166 |
+ |
#endif |