1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/*
* Copyright (C) 2006-2009 Free Software Foundation
*
* This program is free software ; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation ; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY ; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with the program ; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <sys/types.h>
#include <string.h>
#include "ring.h"
/* dest is ring */
void hyp_ring_store(void *dest, const void *src, size_t size, void *start, void *end)
{
if (dest + size > end) {
size_t first_size = end - dest;
memcpy(dest, src, first_size);
src += first_size;
dest = start;
size -= first_size;
}
memcpy(dest, src, size);
}
/* src is ring */
void hyp_ring_fetch(void *dest, const void *src, size_t size, void *start, void *end)
{
if (src + size > end) {
size_t first_size = end - src;
memcpy(dest, src, first_size);
dest += first_size;
src = start;
size -= first_size;
}
memcpy(dest, src, size);
}
size_t hyp_ring_next_word(char **c, void *start, void *end)
{
size_t n = 0;
while (**c) {
n++;
if (++(*c) == end)
*c = start;
}
(*c)++;
return n;
}
|
