GCOV - Varnish Cache


/*-
 * Copyright (c) 2006 Verdens Gang AS
 * Copyright (c) 2006-2021 Varnish Software AS
 * All rights reserved.
 *
 * Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
 * Author: Dridi Boukelmoune <dridi.boukelmoune@gmail.com>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 */

#include "config.h"

#include "cache_varnishd.h"

#define WS_REDZONE_END          '\x15'

static const uintptr_t snap_overflowed = (uintptr_t)&snap_overflowed;

void
WS_Assert(const struct ws *ws)
{

        CHECK_OBJ_NOTNULL(ws, WS_MAGIC);
        DSLb(DBG_WORKSPACE, "WS(%s, %p) = {%p %zu %zu %zu}",
            ws->id, ws, ws->s, pdiff(ws->s, ws->f),
            ws->r == NULL ? 0 : pdiff(ws->f, ws->r),
            pdiff(ws->s, ws->e));
        assert(ws->s != NULL);
        assert(PAOK(ws->s));
        assert(ws->e != NULL);
        assert(PAOK(ws->e));
        assert(ws->s < ws->e);
        assert(ws->f >= ws->s);
        assert(ws->f <= ws->e);
        assert(PAOK(ws->f));
        if (ws->r) {
                assert(ws->r >= ws->f);
                assert(ws->r <= ws->e);
        }
        assert(*ws->e == WS_REDZONE_END);
}

int
WS_Allocated(const struct ws *ws, const void *ptr, ssize_t len)
{
        const char *p = ptr;

        WS_Assert(ws);
        if (len < 0)
                len = strlen(p) + 1;
        assert(!(p > ws->f && p <= ws->e));
        return (p >= ws->s && (p + len) <= ws->f);
}

/*
 * NB: The id must be max 3 char and lower-case.
 * (upper-case the first char to indicate overflow)
 */

void
WS_Init(struct ws *ws, const char *id, void *space, unsigned len)
{
        unsigned l;

        DSLb(DBG_WORKSPACE,
            "WS_Init(%s, %p, %p, %u)", id, ws, space, len);
        assert(space != NULL);
        INIT_OBJ(ws, WS_MAGIC);
        ws->s = space;
        assert(PAOK(space));
        l = PRNDDN(len - 1);
        ws->e = ws->s + l;
        memset(ws->e, WS_REDZONE_END, len - l);
        ws->f = ws->s;
        assert(id[0] & 0x20);           // cheesy islower()
        bstrcpy(ws->id, id);
        WS_Assert(ws);
}

/*
 * Reset a WS to a cookie from WS_Snapshot
 *
 * for use by any code using cache.h
 *
 * does not reset the overflow bit and asserts that, if WS_Snapshot had found
 * the workspace overflown, the marker is intact
 */

void
WS_Reset(struct ws *ws, uintptr_t pp)
{
        char *p;

        WS_Assert(ws);
        AN(pp);
        if (pp == snap_overflowed) {
                DSLb(DBG_WORKSPACE, "WS_Reset(%s, %p, overflowed)", ws->id, ws);
                AN(WS_Overflowed(ws));
                return;
        }
        p = (char *)pp;
        DSLb(DBG_WORKSPACE, "WS_Reset(%s, %p, %p)", ws->id, ws, p);
        assert(ws->r == NULL);
        assert(p >= ws->s);
        assert(p <= ws->e);
        ws->f = p;
        WS_Assert(ws);
}

/*
 * Make a reservation and optionally pipeline a memory region that may or
 * may not originate from the same workspace.
 */

int
WS_Pipeline(struct ws *ws, const void *b, const void *e, unsigned rollback)
{
        unsigned r, l;

        WS_Assert(ws);

        if (rollback)
                WS_Rollback(ws, 0);

        r = WS_ReserveAll(ws);

        if (b == NULL) {
                AZ(e);
                return (0);
        }

        AN(e);
        l = pdiff(b, e);
        if (l > r)
                return (-1);
        memmove(ws->f, b, l);
        return (l);
}

void *
WS_Alloc(struct ws *ws, unsigned bytes)
{
        char *r;

        WS_Assert(ws);
        assert(bytes > 0);
        bytes = PRNDUP(bytes);

        assert(ws->r == NULL);
        if (ws->f + bytes > ws->e) {
                WS_MarkOverflow(ws);
                return (NULL);
        }
        r = ws->f;
        ws->f += bytes;
        DSLb(DBG_WORKSPACE, "WS_Alloc(%s, %p, %u) = %p", ws->id, ws, bytes, r);
        WS_Assert(ws);
        return (r);
}

void *
WS_Copy(struct ws *ws, const void *str, int len)
{
        char *r;
        unsigned bytes;

        WS_Assert(ws);
        assert(ws->r == NULL);

        if (len == -1)
                len = strlen(str) + 1;
        assert(len > 0);

        bytes = PRNDUP((unsigned)len);
        if (ws->f + bytes > ws->e) {
                WS_MarkOverflow(ws);
                return (NULL);
        }
        r = ws->f;
        ws->f += bytes;
        memcpy(r, str, len);
        DSLb(DBG_WORKSPACE, "WS_Copy(%s, %p, %d) = %p", ws->id, ws, len, r);
        WS_Assert(ws);
        return (r);
}

uintptr_t
WS_Snapshot(struct ws *ws)
{

        WS_Assert(ws);
        assert(ws->r == NULL);
        if (WS_Overflowed(ws)) {
                DSLb(DBG_WORKSPACE, "WS_Snapshot(%s, %p) = overflowed",
                    ws->id, ws);
                return (snap_overflowed);
        }
        DSLb(DBG_WORKSPACE, "WS_Snapshot(%s, %p) = %p", ws->id, ws, ws->f);
        return ((uintptr_t)ws->f);
}

/*
 * WS_Release() must be called in all cases
 */
unsigned
WS_ReserveAll(struct ws *ws)
{
        unsigned b;

        WS_Assert(ws);
        assert(ws->r == NULL);

        ws->r = ws->e;
        b = pdiff(ws->f, ws->r);

        WS_Assert(ws);
        DSLb(DBG_WORKSPACE, "WS_ReserveAll(%s, %p) = %u", ws->id, ws, b);

        return (b);
}

/*
 * WS_Release() must be called for retval > 0 only
 */
unsigned
WS_ReserveSize(struct ws *ws, unsigned bytes)
{
        unsigned l;

        WS_Assert(ws);
        assert(ws->r == NULL);
        assert(bytes > 0);

        l = pdiff(ws->f, ws->e);
        if (bytes > l) {
                WS_MarkOverflow(ws);
                return (0);
        }
        ws->r = ws->f + bytes;
        DSLb(DBG_WORKSPACE, "WS_ReserveSize(%s, %p, %u/%u) = %u", ws->id,
            ws, bytes, l, bytes);
        WS_Assert(ws);
        return (bytes);
}

void
WS_Release(struct ws *ws, unsigned bytes)
{
        WS_Assert(ws);
        assert(bytes <= ws->e - ws->f);
        DSLb(DBG_WORKSPACE, "WS_Release(%s, %p, %u)", ws->id, ws, bytes);
        assert(ws->r != NULL);
        assert(ws->f + bytes <= ws->r);
        ws->f += PRNDUP(bytes);
        ws->r = NULL;
        WS_Assert(ws);
}

void
WS_ReleaseP(struct ws *ws, const char *ptr)
{
        WS_Assert(ws);
        DSLb(DBG_WORKSPACE, "WS_ReleaseP(%s, %p, %p (%zd))", ws->id, ws, ptr,
            ptr - ws->f);
        assert(ws->r != NULL);
        assert(ptr >= ws->f);
        assert(ptr <= ws->r);
        ws->f += PRNDUP(ptr - ws->f);
        ws->r = NULL;
        WS_Assert(ws);
}

void *
WS_AtOffset(const struct ws *ws, unsigned off, unsigned len)
{
        char *ptr;

        WS_Assert(ws);
        ptr = ws->s + off;
        AN(WS_Allocated(ws, ptr, len));
        return (ptr);
}

unsigned
WS_ReservationOffset(const struct ws *ws)
{

        AN(ws->r);
        return (ws->f - ws->s);
}

/*--------------------------------------------------------------------*/

unsigned
WS_Dump(const struct ws *ws, char where, size_t off, void *buf, size_t len)
{
        char *b, *p;
        size_t l;

        WS_Assert(ws);
        AN(buf);
        AN(len);

        switch (where) {
        case 's': p = ws->s; break;
        case 'f': p = ws->f; break;
        case 'r': p = ws->r; break;
        default:
                errno = EINVAL;
                return (0);
        }

        if (p == NULL) {
                errno = EAGAIN;
                return (0);
        }

        p += off;
        if (p >= ws->e) {
                errno = EFAULT;
                return (0);
        }

        l = pdiff(p, ws->e);
        if (len <= l) {
                memcpy(buf, p, len);
                return (len);
        }

        b = buf;
        memcpy(b, p, l);
        memset(b + l, WS_REDZONE_END, len - l);
        return (l);
}

/*--------------------------------------------------------------------*/

static inline void
ws_printptr(struct vsb *vsb, const char *s, const char *p)
{
        if (p >= s)
                VSB_printf(vsb, ", +%ld", (long) (p - s));
        else
                VSB_printf(vsb, ", %p", p);
}

void
WS_Panic(struct vsb *vsb, const struct ws *ws)
{

        if (PAN_dump_struct(vsb, ws, WS_MAGIC, "ws"))
                return;
        if (ws->id[0] != '\0' && (!(ws->id[0] & 0x20))) // cheesy islower()
                VSB_cat(vsb, "OVERFLOWED ");
        VSB_printf(vsb, "id = \"%s\",\n", ws->id);
        VSB_printf(vsb, "{s, f, r, e} = {%p", ws->s);
        ws_printptr(vsb, ws->s, ws->f);
        ws_printptr(vsb, ws->s, ws->r);
        ws_printptr(vsb, ws->s, ws->e);
        VSB_cat(vsb, "},\n");
        VSB_indent(vsb, -2);
        VSB_cat(vsb, "},\n");
}

		varnish-cache/bin/varnishd/cache/cache_ws.c
0		/*-
1		* Copyright (c) 2006 Verdens Gang AS
2		* Copyright (c) 2006-2021 Varnish Software AS
3		* All rights reserved.
4		*
5		* Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
6		* Author: Dridi Boukelmoune <dridi.boukelmoune@gmail.com>
7		*
8		* SPDX-License-Identifier: BSD-2-Clause
9		*
10		* Redistribution and use in source and binary forms, with or without
11		* modification, are permitted provided that the following conditions
12		* are met:
13		* 1. Redistributions of source code must retain the above copyright
14		* notice, this list of conditions and the following disclaimer.
15		* 2. Redistributions in binary form must reproduce the above copyright
16		* notice, this list of conditions and the following disclaimer in the
17		* documentation and/or other materials provided with the distribution.
18		*
19		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
23		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29		* SUCH DAMAGE.
30		*
31		*/
32
33		#include "config.h"
34
35		#include "cache_varnishd.h"
36
37		#define WS_REDZONE_END '\x15'
38
39		static const uintptr_t snap_overflowed = (uintptr_t)&snap_overflowed;
40
41		void
42	32440105	WS_Assert(const struct ws *ws)
43		{
44
45	32440105	CHECK_OBJ_NOTNULL(ws, WS_MAGIC);
46	32440105	DSLb(DBG_WORKSPACE, "WS(%s, %p) = {%p %zu %zu %zu}",
47		ws->id, ws, ws->s, pdiff(ws->s, ws->f),
48		ws->r == NULL ? 0 : pdiff(ws->f, ws->r),
49		pdiff(ws->s, ws->e));
50	32440105	assert(ws->s != NULL);
51	32440105	assert(PAOK(ws->s));
52	32440105	assert(ws->e != NULL);
53	32440105	assert(PAOK(ws->e));
54	32440105	assert(ws->s < ws->e);
55	32440105	assert(ws->f >= ws->s);
56	32440105	assert(ws->f <= ws->e);
57	32440105	assert(PAOK(ws->f));
58	32440105	if (ws->r) {
59	10665509	assert(ws->r >= ws->f);
60	10665509	assert(ws->r <= ws->e);
61	10665509	}
62	32440105	assert(*ws->e == WS_REDZONE_END);
63	32440105	}
64
65		int
66	2021216	WS_Allocated(const struct ws ws, const void ptr, ssize_t len)
67		{
68	2021216	const char *p = ptr;
69
70	2021216	WS_Assert(ws);
71	2021216	if (len < 0)
72	11520	len = strlen(p) + 1;
73	2021216	assert(!(p > ws->f && p <= ws->e));
74	2021216	return (p >= ws->s && (p + len) <= ws->f);
75		}
76
77		/*
78		* NB: The id must be max 3 char and lower-case.
79		* (upper-case the first char to indicate overflow)
80		*/
81
82		void
83	1073597	WS_Init(struct ws ws, const char id, void *space, unsigned len)
84		{
85		unsigned l;
86
87	1073597	DSLb(DBG_WORKSPACE,
88		"WS_Init(%s, %p, %p, %u)", id, ws, space, len);
89	1073597	assert(space != NULL);
90	1073597	INIT_OBJ(ws, WS_MAGIC);
91	1073597	ws->s = space;
92	1073597	assert(PAOK(space));
93	1073597	l = PRNDDN(len - 1);
94	1073597	ws->e = ws->s + l;
95	1073597	memset(ws->e, WS_REDZONE_END, len - l);
96	1073597	ws->f = ws->s;
97	1073597	assert(id[0] & 0x20); // cheesy islower()
98	1073597	bstrcpy(ws->id, id);
99	1073597	WS_Assert(ws);
100	1073597	}
101
102		/*
103		* Reset a WS to a cookie from WS_Snapshot
104		*
105		* for use by any code using cache.h
106		*
107		* does not reset the overflow bit and asserts that, if WS_Snapshot had found
108		* the workspace overflown, the marker is intact
109		*/
110
111		void
112	1737791	WS_Reset(struct ws *ws, uintptr_t pp)
113		{
114		char *p;
115
116	1737791	WS_Assert(ws);
117	1737791	AN(pp);
118	1737791	if (pp == snap_overflowed) {
119	40	DSLb(DBG_WORKSPACE, "WS_Reset(%s, %p, overflowed)", ws->id, ws);
120	40	AN(WS_Overflowed(ws));
121	40	return;
122		}
123	1737751	p = (char *)pp;
124	1737751	DSLb(DBG_WORKSPACE, "WS_Reset(%s, %p, %p)", ws->id, ws, p);
125	1737751	assert(ws->r == NULL);
126	1737751	assert(p >= ws->s);
127	1737751	assert(p <= ws->e);
128	1737751	ws->f = p;
129	1737751	WS_Assert(ws);
130	1737791	}
131
132		/*
133		* Make a reservation and optionally pipeline a memory region that may or
134		* may not originate from the same workspace.
135		*/
136
137		int
138	321081	WS_Pipeline(struct ws ws, const void b, const void *e, unsigned rollback)
139		{
140		unsigned r, l;
141
142	321081	WS_Assert(ws);
143
144	321081	if (rollback)
145	239649	WS_Rollback(ws, 0);
146
147	321081	r = WS_ReserveAll(ws);
148
149	321081	if (b == NULL) {
150	307793	AZ(e);
151	307793	return (0);
152		}
153
154	13288	AN(e);
155	13288	l = pdiff(b, e);
156	13288	if (l > r)
157	0	return (-1);
158	13288	memmove(ws->f, b, l);
159	13288	return (l);
160	321081	}
161
162		void *
163	700142	WS_Alloc(struct ws *ws, unsigned bytes)
164		{
165		char *r;
166
167	700142	WS_Assert(ws);
168	700142	assert(bytes > 0);
169	700142	bytes = PRNDUP(bytes);
170
171	700142	assert(ws->r == NULL);
172	700142	if (ws->f + bytes > ws->e) {
173	13760	WS_MarkOverflow(ws);
174	13760	return (NULL);
175		}
176	686382	r = ws->f;
177	686382	ws->f += bytes;
178	686382	DSLb(DBG_WORKSPACE, "WS_Alloc(%s, %p, %u) = %p", ws->id, ws, bytes, r);
179	686382	WS_Assert(ws);
180	686382	return (r);
181	700142	}
182
183		void *
184	648794	WS_Copy(struct ws ws, const void str, int len)
185		{
186		char *r;
187		unsigned bytes;
188
189	648794	WS_Assert(ws);
190	648794	assert(ws->r == NULL);
191
192	648794	if (len == -1)
193	12424	len = strlen(str) + 1;
194	648794	assert(len > 0);
195
196	648794	bytes = PRNDUP((unsigned)len);
197	648794	if (ws->f + bytes > ws->e) {
198	160	WS_MarkOverflow(ws);
199	160	return (NULL);
200		}
201	648634	r = ws->f;
202	648634	ws->f += bytes;
203	648634	memcpy(r, str, len);
204	648634	DSLb(DBG_WORKSPACE, "WS_Copy(%s, %p, %d) = %p", ws->id, ws, len, r);
205	648634	WS_Assert(ws);
206	648634	return (r);
207	648794	}
208
209		uintptr_t
210	1981745	WS_Snapshot(struct ws *ws)
211		{
212
213	1981745	WS_Assert(ws);
214	1981745	assert(ws->r == NULL);
215	1981745	if (WS_Overflowed(ws)) {
216	120	DSLb(DBG_WORKSPACE, "WS_Snapshot(%s, %p) = overflowed",
217		ws->id, ws);
218	120	return (snap_overflowed);
219		}
220	1981625	DSLb(DBG_WORKSPACE, "WS_Snapshot(%s, %p) = %p", ws->id, ws, ws->f);
221	1981625	return ((uintptr_t)ws->f);
222	1981745	}
223
224		/*
225		* WS_Release() must be called in all cases
226		*/
227		unsigned
228	2193158	WS_ReserveAll(struct ws *ws)
229		{
230		unsigned b;
231
232	2193158	WS_Assert(ws);
233	2193158	assert(ws->r == NULL);
234
235	2193158	ws->r = ws->e;
236	2193158	b = pdiff(ws->f, ws->r);
237
238	2193158	WS_Assert(ws);
239	2193158	DSLb(DBG_WORKSPACE, "WS_ReserveAll(%s, %p) = %u", ws->id, ws, b);
240
241	2193158	return (b);
242		}
243
244		/*
245		* WS_Release() must be called for retval > 0 only
246		*/
247		unsigned
248	593791	WS_ReserveSize(struct ws *ws, unsigned bytes)
249		{
250		unsigned l;
251
252	593791	WS_Assert(ws);
253	593791	assert(ws->r == NULL);
254	593791	assert(bytes > 0);
255
256	593791	l = pdiff(ws->f, ws->e);
257	593791	if (bytes > l) {
258	2680	WS_MarkOverflow(ws);
259	2680	return (0);
260		}
261	591111	ws->r = ws->f + bytes;
262	591111	DSLb(DBG_WORKSPACE, "WS_ReserveSize(%s, %p, %u/%u) = %u", ws->id,
263		ws, bytes, l, bytes);
264	591111	WS_Assert(ws);
265	591111	return (bytes);
266	593791	}
267
268		void
269	2272459	WS_Release(struct ws *ws, unsigned bytes)
270		{
271	2272459	WS_Assert(ws);
272	2272459	assert(bytes <= ws->e - ws->f);
273	2272459	DSLb(DBG_WORKSPACE, "WS_Release(%s, %p, %u)", ws->id, ws, bytes);
274	2272459	assert(ws->r != NULL);
275	2272459	assert(ws->f + bytes <= ws->r);
276	2272459	ws->f += PRNDUP(bytes);
277	2272459	ws->r = NULL;
278	2272459	WS_Assert(ws);
279	2272459	}
280
281		void
282	511299	WS_ReleaseP(struct ws ws, const char ptr)
283		{
284	511299	WS_Assert(ws);
285	511299	DSLb(DBG_WORKSPACE, "WS_ReleaseP(%s, %p, %p (%zd))", ws->id, ws, ptr,
286		ptr - ws->f);
287	511299	assert(ws->r != NULL);
288	511299	assert(ptr >= ws->f);
289	511299	assert(ptr <= ws->r);
290	511299	ws->f += PRNDUP(ptr - ws->f);
291	511299	ws->r = NULL;
292	511299	WS_Assert(ws);
293	511299	}
294
295		void *
296	1318005	WS_AtOffset(const struct ws *ws, unsigned off, unsigned len)
297		{
298		char *ptr;
299
300	1318005	WS_Assert(ws);
301	1318005	ptr = ws->s + off;
302	1318005	AN(WS_Allocated(ws, ptr, len));
303	1318005	return (ptr);
304		}
305
306		unsigned
307	420476	WS_ReservationOffset(const struct ws *ws)
308		{
309
310	420476	AN(ws->r);
311	420476	return (ws->f - ws->s);
312		}
313
314		/--------------------------------------------------------------------/
315
316		unsigned
317	477	WS_Dump(const struct ws ws, char where, size_t off, void buf, size_t len)
318		{
319		char b, p;
320		size_t l;
321
322	477	WS_Assert(ws);
323	477	AN(buf);
324	477	AN(len);
325
326	477	switch (where) {
327	0	case 's': p = ws->s; break;
328	477	case 'f': p = ws->f; break;
329	0	case 'r': p = ws->r; break;
330		default:
331	0	errno = EINVAL;
332	0	return (0);
333		}
334
335	477	if (p == NULL) {
336	2	errno = EAGAIN;
337	2	return (0);
338		}
339
340	479	p += off;
341	479	if (p >= ws->e) {
342	0	errno = EFAULT;
343	0	return (0);
344		}
345
346	479	l = pdiff(p, ws->e);
347	479	if (len <= l) {
348	479	memcpy(buf, p, len);
349	479	return (len);
350		}
351
352	0	b = buf;
353	0	memcpy(b, p, l);
354	0	memset(b + l, WS_REDZONE_END, len - l);
355	0	return (l);
356	481	}
357
358		/--------------------------------------------------------------------/
359
360		static inline void
361	2520	ws_printptr(struct vsb vsb, const char s, const char *p)
362		{
363	2520	if (p >= s)
364	1680	VSB_printf(vsb, ", +%ld", (long) (p - s));
365		else
366	840	VSB_printf(vsb, ", %p", p);
367	2520	}
368
369		void
370	1520	WS_Panic(struct vsb vsb, const struct ws ws)
371		{
372
373	1520	if (PAN_dump_struct(vsb, ws, WS_MAGIC, "ws"))
374	680	return;
375	840	if (ws->id[0] != '\0' && (!(ws->id[0] & 0x20))) // cheesy islower()
376	0	VSB_cat(vsb, "OVERFLOWED ");
377	840	VSB_printf(vsb, "id = \"%s\",\n", ws->id);
378	840	VSB_printf(vsb, "{s, f, r, e} = {%p", ws->s);
379	840	ws_printptr(vsb, ws->s, ws->f);
380	840	ws_printptr(vsb, ws->s, ws->r);
381	840	ws_printptr(vsb, ws->s, ws->e);
382	840	VSB_cat(vsb, "},\n");
383	840	VSB_indent(vsb, -2);
384	840	VSB_cat(vsb, "},\n");
385	1520	}