buf.c revision 1.40 1 1.40 rillig /* $NetBSD: buf.c,v 1.40 2020/09/27 16:59:02 rillig Exp $ */
2 1.6 christos
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
5 1.14 agc * All rights reserved.
6 1.14 agc *
7 1.14 agc * This code is derived from software contributed to Berkeley by
8 1.14 agc * Adam de Boor.
9 1.14 agc *
10 1.14 agc * Redistribution and use in source and binary forms, with or without
11 1.14 agc * modification, are permitted provided that the following conditions
12 1.14 agc * are met:
13 1.14 agc * 1. Redistributions of source code must retain the above copyright
14 1.14 agc * notice, this list of conditions and the following disclaimer.
15 1.14 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.14 agc * notice, this list of conditions and the following disclaimer in the
17 1.14 agc * documentation and/or other materials provided with the distribution.
18 1.14 agc * 3. Neither the name of the University nor the names of its contributors
19 1.14 agc * may be used to endorse or promote products derived from this software
20 1.14 agc * without specific prior written permission.
21 1.14 agc *
22 1.14 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.14 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.14 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.14 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.14 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.14 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.14 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.14 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.14 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.14 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.14 agc * SUCH DAMAGE.
33 1.14 agc */
34 1.14 agc
35 1.14 agc /*
36 1.1 cgd * Copyright (c) 1988, 1989 by Adam de Boor
37 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
38 1.1 cgd * All rights reserved.
39 1.1 cgd *
40 1.1 cgd * This code is derived from software contributed to Berkeley by
41 1.1 cgd * Adam de Boor.
42 1.1 cgd *
43 1.1 cgd * Redistribution and use in source and binary forms, with or without
44 1.1 cgd * modification, are permitted provided that the following conditions
45 1.1 cgd * are met:
46 1.1 cgd * 1. Redistributions of source code must retain the above copyright
47 1.1 cgd * notice, this list of conditions and the following disclaimer.
48 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
49 1.1 cgd * notice, this list of conditions and the following disclaimer in the
50 1.1 cgd * documentation and/or other materials provided with the distribution.
51 1.1 cgd * 3. All advertising materials mentioning features or use of this software
52 1.1 cgd * must display the following acknowledgement:
53 1.1 cgd * This product includes software developed by the University of
54 1.1 cgd * California, Berkeley and its contributors.
55 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
56 1.1 cgd * may be used to endorse or promote products derived from this software
57 1.1 cgd * without specific prior written permission.
58 1.1 cgd *
59 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 1.1 cgd * SUCH DAMAGE.
70 1.1 cgd */
71 1.1 cgd
72 1.37 rillig /* Functions for automatically-expanded null-terminated buffers. */
73 1.1 cgd
74 1.27 rillig #include <limits.h>
75 1.27 rillig #include "make.h"
76 1.1 cgd
77 1.38 rillig /* "@(#)buf.c 8.1 (Berkeley) 6/6/93" */
78 1.40 rillig MAKE_RCSID("$NetBSD: buf.c,v 1.40 2020/09/27 16:59:02 rillig Exp $");
79 1.38 rillig
80 1.29 rillig /* Extend the buffer for adding a single byte. */
81 1.1 cgd void
82 1.40 rillig Buf_Expand_1(Buffer *buf)
83 1.1 cgd {
84 1.40 rillig buf->cap += MAX(buf->cap, 16);
85 1.40 rillig buf->data = bmake_realloc(buf->data, buf->cap);
86 1.1 cgd }
87 1.24 dsl
88 1.29 rillig /* Add the given bytes to the buffer. */
89 1.1 cgd void
90 1.40 rillig Buf_AddBytes(Buffer *buf, const char *bytes, size_t bytes_len)
91 1.1 cgd {
92 1.40 rillig size_t old_len = buf->len;
93 1.39 rillig char *end;
94 1.1 cgd
95 1.40 rillig if (__predict_false(old_len + bytes_len >= buf->cap)) {
96 1.40 rillig buf->cap += MAX(buf->cap, bytes_len + 16);
97 1.40 rillig buf->data = bmake_realloc(buf->data, buf->cap);
98 1.24 dsl }
99 1.1 cgd
100 1.40 rillig end = buf->data + old_len;
101 1.40 rillig buf->len = old_len + bytes_len;
102 1.39 rillig memcpy(end, bytes, bytes_len);
103 1.39 rillig end[bytes_len] = '\0';
104 1.1 cgd }
105 1.24 dsl
106 1.29 rillig /* Add the bytes between start and end to the buffer. */
107 1.28 rillig void
108 1.40 rillig Buf_AddBytesBetween(Buffer *buf, const char *start, const char *end)
109 1.28 rillig {
110 1.40 rillig Buf_AddBytes(buf, start, (size_t)(end - start));
111 1.28 rillig }
112 1.28 rillig
113 1.29 rillig /* Add the given string to the buffer. */
114 1.28 rillig void
115 1.40 rillig Buf_AddStr(Buffer *buf, const char *str)
116 1.28 rillig {
117 1.40 rillig Buf_AddBytes(buf, str, strlen(str));
118 1.28 rillig }
119 1.28 rillig
120 1.29 rillig /* Add the given number to the buffer. */
121 1.27 rillig void
122 1.40 rillig Buf_AddInt(Buffer *buf, int n)
123 1.27 rillig {
124 1.33 rillig enum {
125 1.34 rillig bits = sizeof(int) * CHAR_BIT,
126 1.37 rillig max_octal_digits = (bits + 2) / 3,
127 1.37 rillig max_decimal_digits = /* at most */ max_octal_digits,
128 1.37 rillig max_sign_chars = 1,
129 1.40 rillig str_size = max_sign_chars + max_decimal_digits + 1
130 1.33 rillig };
131 1.40 rillig char str[str_size];
132 1.27 rillig
133 1.40 rillig size_t len = (size_t)snprintf(str, sizeof str, "%d", n);
134 1.40 rillig Buf_AddBytes(buf, str, len);
135 1.27 rillig }
136 1.27 rillig
137 1.29 rillig /* Get the data (usually a string) from the buffer.
138 1.29 rillig * The returned data is valid until the next modifying operation
139 1.29 rillig * on the buffer.
140 1.1 cgd *
141 1.29 rillig * Returns the pointer to the data and optionally the length of the
142 1.29 rillig * data in the buffer. */
143 1.35 rillig char *
144 1.40 rillig Buf_GetAll(Buffer *buf, size_t *out_len)
145 1.1 cgd {
146 1.39 rillig if (out_len != NULL)
147 1.40 rillig *out_len = buf->len;
148 1.40 rillig return buf->data;
149 1.1 cgd }
150 1.24 dsl
151 1.29 rillig /* Mark the buffer as empty, so it can be filled with data again. */
152 1.1 cgd void
153 1.40 rillig Buf_Empty(Buffer *buf)
154 1.1 cgd {
155 1.40 rillig buf->len = 0;
156 1.40 rillig buf->data[0] = '\0';
157 1.1 cgd }
158 1.24 dsl
159 1.29 rillig /* Initialize a buffer.
160 1.39 rillig * If the given initial capacity is 0, a reasonable default is used. */
161 1.24 dsl void
162 1.40 rillig Buf_Init(Buffer *buf, size_t cap)
163 1.1 cgd {
164 1.39 rillig if (cap <= 0)
165 1.39 rillig cap = 256;
166 1.40 rillig buf->cap = cap;
167 1.40 rillig buf->len = 0;
168 1.40 rillig buf->data = bmake_malloc(cap);
169 1.40 rillig buf->data[0] = '\0';
170 1.24 dsl }
171 1.1 cgd
172 1.29 rillig /* Reset the buffer.
173 1.29 rillig * If freeData is TRUE, the data from the buffer is freed as well.
174 1.29 rillig * Otherwise it is kept and returned. */
175 1.35 rillig char *
176 1.24 dsl Buf_Destroy(Buffer *buf, Boolean freeData)
177 1.1 cgd {
178 1.39 rillig char *data = buf->data;
179 1.1 cgd if (freeData) {
180 1.24 dsl free(data);
181 1.24 dsl data = NULL;
182 1.1 cgd }
183 1.24 dsl
184 1.39 rillig buf->cap = 0;
185 1.39 rillig buf->len = 0;
186 1.39 rillig buf->data = NULL;
187 1.24 dsl
188 1.24 dsl return data;
189 1.1 cgd }
190 1.25 sjg
191 1.25 sjg #ifndef BUF_COMPACT_LIMIT
192 1.34 rillig # define BUF_COMPACT_LIMIT 128 /* worthwhile saving */
193 1.25 sjg #endif
194 1.25 sjg
195 1.29 rillig /* Reset the buffer and return its data.
196 1.29 rillig *
197 1.29 rillig * If the buffer size is much greater than its content,
198 1.29 rillig * a new buffer will be allocated and the old one freed. */
199 1.35 rillig char *
200 1.25 sjg Buf_DestroyCompact(Buffer *buf)
201 1.25 sjg {
202 1.25 sjg #if BUF_COMPACT_LIMIT > 0
203 1.39 rillig if (buf->cap - buf->len >= BUF_COMPACT_LIMIT) {
204 1.25 sjg /* We trust realloc to be smart */
205 1.39 rillig char *data = bmake_realloc(buf->data, buf->len + 1);
206 1.39 rillig data[buf->len] = '\0'; /* XXX: unnecessary */
207 1.30 rillig Buf_Destroy(buf, FALSE);
208 1.30 rillig return data;
209 1.25 sjg }
210 1.25 sjg #endif
211 1.25 sjg return Buf_Destroy(buf, FALSE);
212 1.25 sjg }
213