0
|
1 /* |
|
2 * buf-erase.c -- simple string buffer for C |
|
3 * |
|
4 * Copyright (c) 2019-2020 David Demelier <markand@malikania.fr> |
|
5 * |
|
6 * Permission to use, copy, modify, and/or distribute this software for any |
|
7 * purpose with or without fee is hereby granted, provided that the above |
|
8 * copyright notice and this permission notice appear in all copies. |
|
9 * |
|
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
|
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
|
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
|
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
|
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
|
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
|
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
|
17 */ |
|
18 |
|
19 #include <assert.h> |
|
20 #include <string.h> |
|
21 |
|
22 #include "buf.h" |
|
23 |
|
24 void |
|
25 buf_erase(struct buf *b, size_t pos, size_t count) |
|
26 { |
|
27 assert(b); |
|
28 assert(pos <= b->length); |
|
29 |
|
30 if (count > b->length - pos) { |
|
31 /* Optimize whole erase at pos. */ |
|
32 b->data[pos] = 0; |
|
33 b->length = pos; |
|
34 } else { |
|
35 memmove(&b->data[pos], &b->data[pos + count], b->length - count); |
|
36 b->length -= count; |
|
37 } |
|
38 } |