Line | Count | Source |
1 | | /** |
2 | | * Copyright 2013, GitHub, Inc |
3 | | * Copyright 2009-2013, Daniel Lemire, Cliff Moon, |
4 | | * David McIntosh, Robert Becho, Google Inc. and Veronika Zenz |
5 | | * |
6 | | * This program is free software; you can redistribute it and/or |
7 | | * modify it under the terms of the GNU General Public License |
8 | | * as published by the Free Software Foundation; either version 2 |
9 | | * of the License, or (at your option) any later version. |
10 | | * |
11 | | * This program is distributed in the hope that it will be useful, |
12 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | | * GNU General Public License for more details. |
15 | | * |
16 | | * You should have received a copy of the GNU General Public License |
17 | | * along with this program; if not, see <http://www.gnu.org/licenses/>. |
18 | | */ |
19 | | |
20 | | #define DISABLE_SIGN_COMPARE_WARNINGS |
21 | | |
22 | | #include "git-compat-util.h" |
23 | | #include "ewok.h" |
24 | | #include "strbuf.h" |
25 | | |
26 | | int ewah_serialize_to(struct ewah_bitmap *self, |
27 | | int (*write_fun)(void *, const void *, size_t), |
28 | | void *data) |
29 | 0 | { |
30 | 0 | size_t i; |
31 | 0 | eword_t dump[2048]; |
32 | 0 | const size_t words_per_dump = sizeof(dump) / sizeof(eword_t); |
33 | 0 | uint32_t bitsize, word_count, rlw_pos; |
34 | |
|
35 | 0 | const eword_t *buffer; |
36 | 0 | size_t words_left; |
37 | | |
38 | | /* 32 bit -- bit size for the map */ |
39 | 0 | bitsize = htonl((uint32_t)self->bit_size); |
40 | 0 | if (write_fun(data, &bitsize, 4) != 4) |
41 | 0 | return -1; |
42 | | |
43 | | /** 32 bit -- number of compressed 64-bit words */ |
44 | 0 | word_count = htonl((uint32_t)self->buffer_size); |
45 | 0 | if (write_fun(data, &word_count, 4) != 4) |
46 | 0 | return -1; |
47 | | |
48 | | /** 64 bit x N -- compressed words */ |
49 | 0 | buffer = self->buffer; |
50 | 0 | words_left = self->buffer_size; |
51 | |
|
52 | 0 | while (words_left >= words_per_dump) { |
53 | 0 | for (i = 0; i < words_per_dump; ++i, ++buffer) |
54 | 0 | dump[i] = htonll(*buffer); |
55 | |
|
56 | 0 | if (write_fun(data, dump, sizeof(dump)) != sizeof(dump)) |
57 | 0 | return -1; |
58 | | |
59 | 0 | words_left -= words_per_dump; |
60 | 0 | } |
61 | | |
62 | 0 | if (words_left) { |
63 | 0 | for (i = 0; i < words_left; ++i, ++buffer) |
64 | 0 | dump[i] = htonll(*buffer); |
65 | |
|
66 | 0 | if (write_fun(data, dump, words_left * 8) != words_left * 8) |
67 | 0 | return -1; |
68 | 0 | } |
69 | | |
70 | | /** 32 bit -- position for the RLW */ |
71 | 0 | rlw_pos = (uint8_t*)self->rlw - (uint8_t *)self->buffer; |
72 | 0 | rlw_pos = htonl(rlw_pos / sizeof(eword_t)); |
73 | |
|
74 | 0 | if (write_fun(data, &rlw_pos, 4) != 4) |
75 | 0 | return -1; |
76 | | |
77 | 0 | return (3 * 4) + (self->buffer_size * 8); |
78 | 0 | } |
79 | | |
80 | | static int write_strbuf(void *user_data, const void *data, size_t len) |
81 | 0 | { |
82 | 0 | struct strbuf *sb = user_data; |
83 | 0 | strbuf_add(sb, data, len); |
84 | 0 | return len; |
85 | 0 | } |
86 | | |
87 | | int ewah_serialize_strbuf(struct ewah_bitmap *self, struct strbuf *sb) |
88 | 0 | { |
89 | 0 | return ewah_serialize_to(self, write_strbuf, sb); |
90 | 0 | } |
91 | | |
92 | | ssize_t ewah_read_mmap(struct ewah_bitmap *self, const void *map, size_t len) |
93 | 0 | { |
94 | 0 | const uint8_t *ptr = map; |
95 | 0 | size_t data_len; |
96 | 0 | size_t i; |
97 | |
|
98 | 0 | if (len < sizeof(uint32_t)) |
99 | 0 | return error("corrupt ewah bitmap: eof before bit size"); |
100 | 0 | self->bit_size = get_be32(ptr); |
101 | 0 | ptr += sizeof(uint32_t); |
102 | 0 | len -= sizeof(uint32_t); |
103 | |
|
104 | 0 | if (len < sizeof(uint32_t)) |
105 | 0 | return error("corrupt ewah bitmap: eof before length"); |
106 | 0 | self->buffer_size = self->alloc_size = get_be32(ptr); |
107 | 0 | ptr += sizeof(uint32_t); |
108 | 0 | len -= sizeof(uint32_t); |
109 | |
|
110 | 0 | REALLOC_ARRAY(self->buffer, self->alloc_size); |
111 | | |
112 | | /* |
113 | | * Copy the raw data for the bitmap as a whole chunk; |
114 | | * if we're in a little-endian platform, we'll perform |
115 | | * the endianness conversion in a separate pass to ensure |
116 | | * we're loading 8-byte aligned words. |
117 | | */ |
118 | 0 | data_len = st_mult(self->buffer_size, sizeof(eword_t)); |
119 | 0 | if (len < data_len) |
120 | 0 | return error("corrupt ewah bitmap: eof in data " |
121 | 0 | "(%"PRIuMAX" bytes short)", |
122 | 0 | (uintmax_t)(data_len - len)); |
123 | 0 | memcpy(self->buffer, ptr, data_len); |
124 | 0 | ptr += data_len; |
125 | 0 | len -= data_len; |
126 | |
|
127 | 0 | for (i = 0; i < self->buffer_size; ++i) |
128 | 0 | self->buffer[i] = ntohll(self->buffer[i]); |
129 | |
|
130 | 0 | if (len < sizeof(uint32_t)) |
131 | 0 | return error("corrupt ewah bitmap: eof before rlw"); |
132 | 0 | self->rlw = self->buffer + get_be32(ptr); |
133 | 0 | ptr += sizeof(uint32_t); |
134 | 0 | len -= sizeof(uint32_t); |
135 | |
|
136 | 0 | return ptr - (const uint8_t *)map; |
137 | 0 | } |