2 * Copyright 2013, GitHub, Inc
3 * Copyright 2009-2013, Daniel Lemire, Cliff Moon,
4 * David McIntosh, Robert Becho, Google Inc. and Veronika Zenz
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.
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.
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/>.
19 #include "git-compat-util.h"
23 int ewah_serialize_native(struct ewah_bitmap
*self
, int fd
)
26 size_t to_write
= self
->buffer_size
* 8;
28 /* 32 bit -- bit size for the map */
29 write32
= (uint32_t)self
->bit_size
;
30 if (write(fd
, &write32
, 4) != 4)
33 /** 32 bit -- number of compressed 64-bit words */
34 write32
= (uint32_t)self
->buffer_size
;
35 if (write(fd
, &write32
, 4) != 4)
38 if (write(fd
, self
->buffer
, to_write
) != to_write
)
41 /** 32 bit -- position for the RLW */
42 write32
= self
->rlw
- self
->buffer
;
43 if (write(fd
, &write32
, 4) != 4)
46 return (3 * 4) + to_write
;
49 int ewah_serialize_to(struct ewah_bitmap
*self
,
50 int (*write_fun
)(void *, const void *, size_t),
55 const size_t words_per_dump
= sizeof(dump
) / sizeof(eword_t
);
56 uint32_t bitsize
, word_count
, rlw_pos
;
58 const eword_t
*buffer
;
61 /* 32 bit -- bit size for the map */
62 bitsize
= htonl((uint32_t)self
->bit_size
);
63 if (write_fun(data
, &bitsize
, 4) != 4)
66 /** 32 bit -- number of compressed 64-bit words */
67 word_count
= htonl((uint32_t)self
->buffer_size
);
68 if (write_fun(data
, &word_count
, 4) != 4)
71 /** 64 bit x N -- compressed words */
72 buffer
= self
->buffer
;
73 words_left
= self
->buffer_size
;
75 while (words_left
>= words_per_dump
) {
76 for (i
= 0; i
< words_per_dump
; ++i
, ++buffer
)
77 dump
[i
] = htonll(*buffer
);
79 if (write_fun(data
, dump
, sizeof(dump
)) != sizeof(dump
))
82 words_left
-= words_per_dump
;
86 for (i
= 0; i
< words_left
; ++i
, ++buffer
)
87 dump
[i
] = htonll(*buffer
);
89 if (write_fun(data
, dump
, words_left
* 8) != words_left
* 8)
93 /** 32 bit -- position for the RLW */
94 rlw_pos
= (uint8_t*)self
->rlw
- (uint8_t *)self
->buffer
;
95 rlw_pos
= htonl(rlw_pos
/ sizeof(eword_t
));
97 if (write_fun(data
, &rlw_pos
, 4) != 4)
100 return (3 * 4) + (self
->buffer_size
* 8);
103 static int write_helper(void *fd
, const void *buf
, size_t len
)
105 return write((intptr_t)fd
, buf
, len
);
108 int ewah_serialize(struct ewah_bitmap
*self
, int fd
)
110 return ewah_serialize_to(self
, write_helper
, (void *)(intptr_t)fd
);
113 static int write_strbuf(void *user_data
, const void *data
, size_t len
)
115 struct strbuf
*sb
= user_data
;
116 strbuf_add(sb
, data
, len
);
120 int ewah_serialize_strbuf(struct ewah_bitmap
*self
, struct strbuf
*sb
)
122 return ewah_serialize_to(self
, write_strbuf
, sb
);
125 ssize_t
ewah_read_mmap(struct ewah_bitmap
*self
, const void *map
, size_t len
)
127 const uint8_t *ptr
= map
;
131 if (len
< sizeof(uint32_t))
132 return error("corrupt ewah bitmap: eof before bit size");
133 self
->bit_size
= get_be32(ptr
);
134 ptr
+= sizeof(uint32_t);
135 len
-= sizeof(uint32_t);
137 if (len
< sizeof(uint32_t))
138 return error("corrupt ewah bitmap: eof before length");
139 self
->buffer_size
= self
->alloc_size
= get_be32(ptr
);
140 ptr
+= sizeof(uint32_t);
141 len
-= sizeof(uint32_t);
143 REALLOC_ARRAY(self
->buffer
, self
->alloc_size
);
146 * Copy the raw data for the bitmap as a whole chunk;
147 * if we're in a little-endian platform, we'll perform
148 * the endianness conversion in a separate pass to ensure
149 * we're loading 8-byte aligned words.
151 data_len
= st_mult(self
->buffer_size
, sizeof(eword_t
));
153 return error("corrupt ewah bitmap: eof in data "
154 "(%"PRIuMAX
" bytes short)",
155 (uintmax_t)(data_len
- len
));
156 memcpy(self
->buffer
, ptr
, data_len
);
160 for (i
= 0; i
< self
->buffer_size
; ++i
)
161 self
->buffer
[i
] = ntohll(self
->buffer
[i
]);
163 if (len
< sizeof(uint32_t))
164 return error("corrupt ewah bitmap: eof before rlw");
165 self
->rlw
= self
->buffer
+ get_be32(ptr
);
166 ptr
+= sizeof(uint32_t);
167 len
-= sizeof(uint32_t);
169 return ptr
- (const uint8_t *)map
;
172 int ewah_deserialize(struct ewah_bitmap
*self
, int fd
)
176 const size_t words_per_dump
= sizeof(dump
) / sizeof(eword_t
);
177 uint32_t bitsize
, word_count
, rlw_pos
;
179 eword_t
*buffer
= NULL
;
184 /* 32 bit -- bit size for the map */
185 if (read(fd
, &bitsize
, 4) != 4)
188 self
->bit_size
= (size_t)ntohl(bitsize
);
190 /** 32 bit -- number of compressed 64-bit words */
191 if (read(fd
, &word_count
, 4) != 4)
194 self
->buffer_size
= self
->alloc_size
= (size_t)ntohl(word_count
);
195 REALLOC_ARRAY(self
->buffer
, self
->alloc_size
);
197 /** 64 bit x N -- compressed words */
198 buffer
= self
->buffer
;
199 words_left
= self
->buffer_size
;
201 while (words_left
>= words_per_dump
) {
202 if (read(fd
, dump
, sizeof(dump
)) != sizeof(dump
))
205 for (i
= 0; i
< words_per_dump
; ++i
, ++buffer
)
206 *buffer
= ntohll(dump
[i
]);
208 words_left
-= words_per_dump
;
212 if (read(fd
, dump
, words_left
* 8) != words_left
* 8)
215 for (i
= 0; i
< words_left
; ++i
, ++buffer
)
216 *buffer
= ntohll(dump
[i
]);
219 /** 32 bit -- position for the RLW */
220 if (read(fd
, &rlw_pos
, 4) != 4)
223 self
->rlw
= self
->buffer
+ ntohl(rlw_pos
);