mas01cr@590
|
1 #if defined(WIN32)
|
mas01cr@590
|
2 #include <sys/locking.h>
|
mas01cr@590
|
3 #endif
|
mas01cr@590
|
4 #if !defined(WIN32)
|
mas01cr@589
|
5 #include <sys/mman.h>
|
mas01cr@590
|
6 #endif
|
mas01cr@591
|
7 #include <sys/stat.h>
|
mas01cr@563
|
8 #include <sys/types.h>
|
mas01cr@589
|
9
|
mas01cr@589
|
10 #include <errno.h>
|
mas01cr@589
|
11 #include <fcntl.h>
|
mas01cr@590
|
12 #if defined(WIN32)
|
mas01cr@590
|
13 #include <io.h>
|
mas01cr@590
|
14 #endif
|
mas01cr@589
|
15 #include <limits.h>
|
mas01cr@589
|
16 #include <math.h>
|
mas01cr@589
|
17 #include <string.h>
|
mas01cr@563
|
18 #include <unistd.h>
|
mas01cr@590
|
19 #if defined(WIN32)
|
mas01cr@590
|
20 #include <windows.h>
|
mas01cr@590
|
21 #endif
|
mas01cr@563
|
22
|
mas01cr@589
|
23 #include <algorithm>
|
mas01cr@589
|
24 #include <iostream>
|
mas01cr@589
|
25 #include <map>
|
mas01cr@589
|
26 #include <queue>
|
mas01cr@509
|
27 #include <set>
|
mas01cr@509
|
28 #include <string>
|
mas01cr@589
|
29 #include <vector>
|
mas01cr@509
|
30
|
mas01cr@589
|
31 #include "accumulator.h"
|
mas01cr@509
|
32 #include "pointpair.h"
|
mas01cr@509
|
33 #include "lshlib.h"
|
mas01cr@498
|
34
|
mas01cr@589
|
35 using namespace std;
|
mas01cr@589
|
36
|
mas01cr@498
|
37 /* this struct is for writing polymorphic routines as puns. When
|
mas01cr@498
|
38 * inserting, we might have a "datum" (with actual numerical data) or
|
mas01cr@498
|
39 * a "reference" (with strings denoting pathnames containing numerical
|
mas01cr@498
|
40 * data), but most of the operations are the same. This struct, used
|
mas01cr@498
|
41 * only internally, allows us to write the main body of the insert
|
mas01cr@498
|
42 * code only once.
|
mas01cr@498
|
43 */
|
mas01cr@498
|
44 typedef struct adb_datum_internal {
|
mas01cr@498
|
45 uint32_t nvectors;
|
mas01cr@498
|
46 uint32_t dim;
|
mas01cr@498
|
47 const char *key;
|
mas01cr@498
|
48 void *data;
|
mas01cr@498
|
49 void *times;
|
mas01cr@498
|
50 void *power;
|
mas01cr@498
|
51 } adb_datum_internal_t;
|
mas01cr@498
|
52
|
mas01cr@498
|
53 /* this struct is to collect together a bunch of information about a
|
mas01cr@498
|
54 * query (or, in fact, a single database entry, or even a whole
|
mas01cr@498
|
55 * database). The _data pointers are immutable (hey, FIXME: should
|
mas01cr@498
|
56 * they be constified in some way?) so that free() can work on them
|
mas01cr@498
|
57 * later, while the ones without the suffix are mutable to maintain
|
mas01cr@498
|
58 * the "current" position in some way. mean_duration points to a
|
mas01cr@498
|
59 * (possibly single-element) array of mean durations for each track.
|
mas01cr@498
|
60 */
|
mas01cr@498
|
61 typedef struct adb_qpointers_internal {
|
mas01cr@498
|
62 uint32_t nvectors;
|
mas01cr@498
|
63 double *l2norm_data;
|
mas01cr@498
|
64 double *l2norm;
|
mas01cr@498
|
65 double *power_data;
|
mas01cr@498
|
66 double *power;
|
mas01cr@498
|
67 double *mean_duration;
|
mas01cr@498
|
68 } adb_qpointers_internal_t;
|
mas01cr@498
|
69
|
mas01cr@498
|
70 /* this struct is for maintaining per-query state. We don't want to
|
mas01cr@498
|
71 * store this stuff in the adb struct itself, because (a) it doesn't
|
mas01cr@498
|
72 * belong there and (b) in principle people might do two queries in
|
mas01cr@498
|
73 * parallel using the same adb handle. (b) is in practice a little
|
mas01cr@498
|
74 * bit academic because at the moment we're seeking all over the disk
|
mas01cr@498
|
75 * using adb->fd, but changing to use pread() might win us
|
mas01cr@498
|
76 * threadsafety eventually.
|
mas01cr@498
|
77 */
|
mas01cr@498
|
78 typedef struct adb_qstate_internal {
|
mas01cr@498
|
79 Accumulator *accumulator;
|
mas01cr@498
|
80 std::set<std::string> *allowed_keys;
|
mas01cr@498
|
81 std::priority_queue<PointPair> *exact_evaluation_queue;
|
mas01cr@498
|
82 LSH *lsh;
|
mas01cr@498
|
83 } adb_qstate_internal_t;
|
mas01cr@498
|
84
|
mas01cr@509
|
85 /* this struct is the in-memory representation of the binary
|
mas01cr@509
|
86 * information stored at the head of each adb file */
|
mas01cr@509
|
87 typedef struct adbheader {
|
mas01cr@509
|
88 uint32_t magic;
|
mas01cr@509
|
89 uint32_t version;
|
mas01cr@509
|
90 uint32_t numFiles;
|
mas01cr@509
|
91 uint32_t dim;
|
mas01cr@509
|
92 uint32_t flags;
|
mas01cr@509
|
93 uint32_t headerSize;
|
mas01cr@509
|
94 off_t length;
|
mas01cr@509
|
95 off_t fileTableOffset;
|
mas01cr@509
|
96 off_t trackTableOffset;
|
mas01cr@509
|
97 off_t dataOffset;
|
mas01cr@509
|
98 off_t l2normTableOffset;
|
mas01cr@509
|
99 off_t timesTableOffset;
|
mas01cr@509
|
100 off_t powerTableOffset;
|
mas01cr@509
|
101 off_t dbSize;
|
mas01cr@509
|
102 } adb_header_t;
|
mas01cr@509
|
103
|
mas01cr@509
|
104 #define ADB_HEADER_SIZE (sizeof(struct adbheader))
|
mas01cr@509
|
105
|
mas01cr@509
|
106 #define ADB_HEADER_FLAG_L2NORM (0x1U)
|
mas01cr@509
|
107 #define ADB_HEADER_FLAG_POWER (0x4U)
|
mas01cr@509
|
108 #define ADB_HEADER_FLAG_TIMES (0x20U)
|
mas01cr@509
|
109 #define ADB_HEADER_FLAG_REFERENCES (0x40U)
|
mas01cr@509
|
110
|
mas01cr@498
|
111 /* the transparent version of the opaque (forward-declared) adb_t. */
|
mas01cr@498
|
112 struct adb {
|
mas01cr@498
|
113 char *path;
|
mas01cr@498
|
114 int fd;
|
mas01cr@498
|
115 int flags;
|
mas01cr@498
|
116 adb_header_t *header;
|
mas01cr@498
|
117 std::vector<std::string> *keys;
|
mas01cr@498
|
118 std::map<std::string,uint32_t> *keymap;
|
mas01cr@498
|
119 std::vector<uint32_t> *track_lengths;
|
mas01cr@498
|
120 std::vector<off_t> *track_offsets;
|
mas01cr@498
|
121 LSH *cached_lsh;
|
mas01cr@498
|
122 };
|
mas01cr@498
|
123
|
mas01cr@498
|
124 typedef struct {
|
mas01cr@498
|
125 bool operator() (const adb_result_t &r1, const adb_result_t &r2) {
|
mas01cr@498
|
126 return strcmp(r1.key, r2.key) < 0;
|
mas01cr@498
|
127 }
|
mas01cr@498
|
128 } adb_result_key_lt;
|
mas01cr@498
|
129
|
mas01cr@498
|
130 typedef struct {
|
mas01cr@498
|
131 bool operator() (const adb_result_t &r1, const adb_result_t &r2) {
|
mas01cr@498
|
132 return r1.qpos < r2.qpos;
|
mas01cr@498
|
133 }
|
mas01cr@498
|
134 } adb_result_qpos_lt;
|
mas01cr@498
|
135
|
mas01cr@498
|
136 typedef struct {
|
mas01cr@498
|
137 bool operator() (const adb_result_t &r1, const adb_result_t &r2) {
|
mas01cr@498
|
138 return r1.dist < r2.dist;
|
mas01cr@498
|
139 }
|
mas01cr@498
|
140 } adb_result_dist_lt;
|
mas01cr@498
|
141
|
mas01cr@498
|
142 typedef struct {
|
mas01cr@498
|
143 bool operator() (const adb_result_t &r1, const adb_result_t &r2) {
|
mas01cr@498
|
144 return r1.dist > r2.dist;
|
mas01cr@498
|
145 }
|
mas01cr@498
|
146 } adb_result_dist_gt;
|
mas01cr@498
|
147
|
mas01cr@498
|
148 typedef struct {
|
mas01cr@498
|
149 bool operator() (const adb_result_t &r1, const adb_result_t &r2) {
|
mas01cr@498
|
150 return ((r1.ipos < r2.ipos) ||
|
mas01cr@498
|
151 ((r1.ipos == r2.ipos) &&
|
mas01cr@498
|
152 ((r1.qpos < r2.qpos) ||
|
mas01cr@498
|
153 ((r1.qpos == r2.qpos) && (strcmp(r1.key, r2.key) < 0)))));
|
mas01cr@498
|
154 }
|
mas01cr@498
|
155 } adb_result_triple_lt;
|
mas01cr@498
|
156
|
mas01cr@498
|
157 /* We could go gcc-specific here and use typeof() instead of passing
|
mas01cr@498
|
158 * in an explicit type. Answers on a postcard as to whether that's a
|
mas01cr@498
|
159 * good plan or not. */
|
mas01cr@498
|
160 #define mmap_or_goto_error(type, var, start, length) \
|
mas01cr@498
|
161 { void *tmp = mmap(0, length, PROT_READ, MAP_SHARED, adb->fd, (start)); \
|
mas01cr@498
|
162 if(tmp == (void *) -1) { \
|
mas01cr@498
|
163 goto error; \
|
mas01cr@498
|
164 } \
|
mas01cr@498
|
165 var = (type) tmp; \
|
mas01cr@498
|
166 }
|
mas01cr@498
|
167
|
mas01cr@498
|
168 #define maybe_munmap(table, length) \
|
mas01cr@498
|
169 { if(table) { \
|
mas01cr@498
|
170 munmap(table, length); \
|
mas01cr@498
|
171 } \
|
mas01cr@498
|
172 }
|
mas01cr@498
|
173
|
mas01cr@509
|
174 #define maybe_delete_array(pointer) \
|
mas01cr@509
|
175 { if(pointer) { \
|
mas01cr@509
|
176 delete [] pointer; \
|
mas01cr@509
|
177 pointer = NULL; \
|
mas01cr@509
|
178 } \
|
mas01cr@509
|
179 }
|
mas01cr@509
|
180
|
mas01cr@498
|
181 #define write_or_goto_error(fd, buffer, size) \
|
mas01cr@498
|
182 { ssize_t tmp = size; \
|
mas01cr@498
|
183 if(write(fd, buffer, size) != tmp) { \
|
mas01cr@498
|
184 goto error; \
|
mas01cr@498
|
185 } \
|
mas01cr@498
|
186 }
|
mas01cr@498
|
187
|
mas01cr@498
|
188 #define read_or_goto_error(fd, buffer, size) \
|
mas01cr@498
|
189 { ssize_t tmp = size; \
|
mas01cr@498
|
190 if(read(fd, buffer, size) != tmp) { \
|
mas01cr@498
|
191 goto error; \
|
mas01cr@498
|
192 } \
|
mas01cr@498
|
193 }
|
mas01cr@498
|
194
|
mas01cr@592
|
195 #define lseek_set_or_goto_error(fd, offset) \
|
mas01cr@592
|
196 { if(lseek(fd, offset, SEEK_SET) == (off_t) -1) \
|
mas01cr@592
|
197 goto error; \
|
mas01cr@592
|
198 } \
|
mas01cr@592
|
199
|
mas01cr@498
|
200 static inline int audiodb_sync_header(adb_t *adb) {
|
mas01cr@498
|
201 off_t pos;
|
mas01cr@498
|
202 pos = lseek(adb->fd, (off_t) 0, SEEK_CUR);
|
mas01cr@498
|
203 if(pos == (off_t) -1) {
|
mas01cr@498
|
204 goto error;
|
mas01cr@498
|
205 }
|
mas01cr@498
|
206 if(lseek(adb->fd, (off_t) 0, SEEK_SET) == (off_t) -1) {
|
mas01cr@498
|
207 goto error;
|
mas01cr@498
|
208 }
|
mas01cr@509
|
209 if(write(adb->fd, adb->header, ADB_HEADER_SIZE) != ADB_HEADER_SIZE) {
|
mas01cr@498
|
210 goto error;
|
mas01cr@498
|
211 }
|
mas01cr@498
|
212
|
mas01cr@588
|
213 #if defined(WIN32)
|
mas01cr@588
|
214 _commit(adb->fd);
|
mas01cr@588
|
215 #elif defined(_POSIX_SYNCHRONIZED_IO) && (_POSIX_SYNCHRONIZED_IO > 0)
|
mas01cr@498
|
216 fdatasync(adb->fd);
|
mas01cr@563
|
217 #else
|
mas01cr@563
|
218 fsync(adb->fd);
|
mas01cr@563
|
219 #endif
|
mas01cr@498
|
220 if(lseek(adb->fd, pos, SEEK_SET) == (off_t) -1) {
|
mas01cr@498
|
221 goto error;
|
mas01cr@498
|
222 }
|
mas01cr@498
|
223 return 0;
|
mas01cr@498
|
224
|
mas01cr@498
|
225 error:
|
mas01cr@498
|
226 return 1;
|
mas01cr@498
|
227 }
|
mas01cr@498
|
228
|
mas01cr@498
|
229 static inline double audiodb_dot_product(double *p, double *q, size_t count) {
|
mas01cr@498
|
230 double result = 0;
|
mas01cr@498
|
231 while(count--) {
|
mas01cr@498
|
232 result += *p++ * *q++;
|
mas01cr@498
|
233 }
|
mas01cr@498
|
234 return result;
|
mas01cr@498
|
235 }
|
mas01cr@498
|
236
|
mas01cr@498
|
237 static inline void audiodb_l2norm_buffer(double *d, size_t dim, size_t nvectors, double *l) {
|
mas01cr@498
|
238 while(nvectors--) {
|
mas01cr@498
|
239 double *d1 = d;
|
mas01cr@498
|
240 double *d2 = d;
|
mas01cr@498
|
241 *l++ = audiodb_dot_product(d1, d2, dim);
|
mas01cr@498
|
242 d += dim;
|
mas01cr@498
|
243 }
|
mas01cr@498
|
244 }
|
mas01cr@498
|
245
|
mas01cr@498
|
246 // This is a common pattern in sequence queries: what we are doing is
|
mas01cr@498
|
247 // taking a window of length seqlen over a buffer of length length,
|
mas01cr@498
|
248 // and placing the sum of the elements in that window in the first
|
mas01cr@498
|
249 // element of the window: thus replacing all but the last seqlen
|
mas01cr@498
|
250 // elements in the buffer with the corresponding windowed sum.
|
mas01cr@498
|
251 static inline void audiodb_sequence_sum(double *buffer, int length, int seqlen) {
|
mas01cr@498
|
252 double tmp1, tmp2, *ps;
|
mas01cr@498
|
253 int j, w;
|
mas01cr@498
|
254
|
mas01cr@498
|
255 tmp1 = *buffer;
|
mas01cr@498
|
256 j = 1;
|
mas01cr@498
|
257 w = seqlen - 1;
|
mas01cr@498
|
258 while(w--) {
|
mas01cr@498
|
259 *buffer += buffer[j++];
|
mas01cr@498
|
260 }
|
mas01cr@498
|
261 ps = buffer + 1;
|
mas01cr@498
|
262 w = length - seqlen; // +1 - 1
|
mas01cr@498
|
263 while(w--) {
|
mas01cr@498
|
264 tmp2 = *ps;
|
mas01cr@498
|
265 if(isfinite(tmp1)) {
|
mas01cr@498
|
266 *ps = *(ps - 1) - tmp1 + *(ps + seqlen - 1);
|
mas01cr@498
|
267 } else {
|
mas01cr@498
|
268 for(int i = 1; i < seqlen; i++) {
|
mas01cr@498
|
269 *ps += *(ps + i);
|
mas01cr@498
|
270 }
|
mas01cr@498
|
271 }
|
mas01cr@498
|
272 tmp1 = tmp2;
|
mas01cr@498
|
273 ps++;
|
mas01cr@498
|
274 }
|
mas01cr@498
|
275 }
|
mas01cr@498
|
276
|
mas01cr@498
|
277 // In contrast to audiodb_sequence_sum() above,
|
mas01cr@498
|
278 // audiodb_sequence_sqrt() and audiodb_sequence_average() below are
|
mas01cr@498
|
279 // simple mappers across the sequence.
|
mas01cr@498
|
280 static inline void audiodb_sequence_sqrt(double *buffer, int length, int seqlen) {
|
mas01cr@498
|
281 int w = length - seqlen + 1;
|
mas01cr@498
|
282 while(w--) {
|
mas01cr@498
|
283 *buffer = sqrt(*buffer);
|
mas01cr@498
|
284 buffer++;
|
mas01cr@498
|
285 }
|
mas01cr@498
|
286 }
|
mas01cr@498
|
287
|
mas01cr@498
|
288 static inline void audiodb_sequence_average(double *buffer, int length, int seqlen) {
|
mas01cr@498
|
289 int w = length - seqlen + 1;
|
mas01cr@498
|
290 while(w--) {
|
mas01cr@498
|
291 *buffer /= seqlen;
|
mas01cr@498
|
292 buffer++;
|
mas01cr@498
|
293 }
|
mas01cr@498
|
294 }
|
mas01cr@498
|
295
|
mas01cr@498
|
296 static inline uint32_t audiodb_key_index(adb_t *adb, const char *key) {
|
mas01cr@498
|
297 std::map<std::string,uint32_t>::iterator it;
|
mas01cr@498
|
298 it = adb->keymap->find(key);
|
mas01cr@498
|
299 if(it == adb->keymap->end()) {
|
mas01cr@498
|
300 return (uint32_t) -1;
|
mas01cr@498
|
301 } else {
|
mas01cr@498
|
302 return (*it).second;
|
mas01cr@498
|
303 }
|
mas01cr@498
|
304 }
|
mas01cr@498
|
305
|
mas01cr@498
|
306 static inline const char *audiodb_index_key(adb_t *adb, uint32_t index) {
|
mas01cr@498
|
307 return (*adb->keys)[index].c_str();
|
mas01cr@498
|
308 }
|
mas01cr@498
|
309
|
mas01mc@557
|
310 static inline uint32_t audiodb_index_to_track_id(adb_t *adb, uint32_t lshid){
|
mas01mc@557
|
311 off_t offset = (off_t)lshid*adb->header->dim*sizeof(double);
|
mas01cr@536
|
312 std::vector<off_t>::iterator b = (*adb->track_offsets).begin();
|
mas01cr@536
|
313 std::vector<off_t>::iterator e = (*adb->track_offsets).end();
|
mas01cr@536
|
314 std::vector<off_t>::iterator p = std::upper_bound(b, e, offset);
|
mas01cr@536
|
315 return p - b - 1;
|
mas01cr@498
|
316 }
|
mas01cr@498
|
317
|
mas01mc@534
|
318 static inline uint32_t audiodb_index_to_track_pos(adb_t *adb, uint32_t track_id, uint32_t lshid) {
|
mas01mc@534
|
319 uint32_t trackIndexOffset = (*adb->track_offsets)[track_id] / (adb->header->dim * sizeof(double));
|
mas01mc@534
|
320 return lshid - trackIndexOffset;
|
mas01cr@498
|
321 }
|
mas01cr@498
|
322
|
mas01mc@534
|
323 static inline uint32_t audiodb_index_from_trackinfo(adb_t *adb, uint32_t track_id, uint32_t track_pos) {
|
mas01mc@534
|
324 uint32_t trackIndexOffset = (*adb->track_offsets)[track_id] / (adb->header->dim * sizeof(double));
|
mas01mc@534
|
325 return trackIndexOffset + track_pos;
|
mas01cr@498
|
326 }
|
mas01cr@498
|
327
|
mas01cr@498
|
328 int audiodb_read_data(adb_t *, int, int, double **, size_t *);
|
mas01cr@498
|
329 int audiodb_insert_create_datum(adb_insert_t *, adb_datum_t *);
|
mas01cr@498
|
330 int audiodb_track_id_datum(adb_t *, uint32_t, adb_datum_t *);
|
mas01cr@580
|
331 int audiodb_really_free_datum(adb_datum_t *);
|
mas01cr@498
|
332 int audiodb_datum_qpointers(adb_datum_t *, uint32_t, double **, double **, adb_qpointers_internal_t *);
|
mas01cr@498
|
333 int audiodb_query_spec_qpointers(adb_t *, const adb_query_spec_t *, double **, double **, adb_qpointers_internal_t *);
|
mas01cr@498
|
334 int audiodb_query_queue_loop(adb_t *, const adb_query_spec_t *, adb_qstate_internal_t *, double *, adb_qpointers_internal_t *);
|
mas01cr@498
|
335 int audiodb_query_loop(adb_t *, const adb_query_spec_t *, adb_qstate_internal_t *);
|
mas01cr@498
|
336 char *audiodb_index_get_name(const char *, double, uint32_t);
|
mas01cr@498
|
337 bool audiodb_index_exists(const char *, double, uint32_t);
|
mas01cr@498
|
338 int audiodb_index_query_loop(adb_t *, const adb_query_spec_t *, adb_qstate_internal_t *);
|
mas01cr@509
|
339 LSH *audiodb_index_allocate(adb_t *, char *, bool);
|
mas01cr@509
|
340 vector<vector<float> > *audiodb_index_initialize_shingles(uint32_t, uint32_t, uint32_t);
|
mas01cr@509
|
341 void audiodb_index_delete_shingles(vector<vector<float> > *);
|
mas01cr@509
|
342 void audiodb_index_make_shingle(vector<vector<float> > *, uint32_t, double *, uint32_t, uint32_t);
|
mas01cr@509
|
343 int audiodb_index_norm_shingles(vector<vector<float> > *, double *, double *, uint32_t, uint32_t, double, bool, bool, float);
|
mas01cr@509
|
344
|
mas01cr@509
|
345 #define ADB_MAXSTR (512U)
|
mas01cr@509
|
346 #define ADB_FILETABLE_ENTRY_SIZE (256U)
|
mas01cr@509
|
347 #define ADB_TRACKTABLE_ENTRY_SIZE (sizeof(uint32_t))
|
mas01cr@509
|
348 #define ADB_DISTANCE_TOLERANCE (1e-6)
|
mas01cr@509
|
349
|
mas01cr@509
|
350 #define ADB_DEFAULT_DATASIZE (1355U) /* in MB */
|
mas01cr@509
|
351 #define ADB_DEFAULT_NTRACKS (20000U)
|
mas01cr@509
|
352 #define ADB_DEFAULT_DATADIM (9U)
|
mas01cr@509
|
353
|
mas01cr@509
|
354 #define ADB_FIXME_LARGE_ADB_SIZE (ADB_DEFAULT_DATASIZE+1)
|
mas01cr@509
|
355 #define ADB_FIXME_LARGE_ADB_NTRACKS (ADB_DEFAULT_NTRACKS+1)
|
mas01cr@509
|
356
|
mas01cr@509
|
357 #define ADB_OLD_MAGIC ('O'|'2'<<8|'D'<<16|'B'<<24)
|
mas01cr@509
|
358 #define ADB_MAGIC ('o'|'2'<<8|'d'<<16|'b'<<24)
|
mas01cr@509
|
359 #define ADB_FORMAT_VERSION (4U)
|
mas01cr@509
|
360
|
mas01cr@509
|
361 #define align_up(x,w) (((x) + ((1<<w)-1)) & ~((1<<w)-1))
|
mas01cr@509
|
362 #define align_down(x,w) ((x) & ~((1<<w)-1))
|
mas01cr@509
|
363
|
mas01cr@591
|
364 #if defined(WIN32)
|
mas01cr@591
|
365 #define getpagesize() (64*1024)
|
mas01cr@591
|
366 #endif
|
mas01cr@591
|
367
|
mas01cr@509
|
368 #define align_page_up(x) (((x) + (getpagesize()-1)) & ~(getpagesize()-1))
|
mas01cr@509
|
369 #define align_page_down(x) ((x) & ~(getpagesize()-1))
|
mas01cr@509
|
370
|