1 | // |
---|
2 | // C++ Interface: Scantable |
---|
3 | // |
---|
4 | // Description: |
---|
5 | // |
---|
6 | // Copyright: See COPYING file that comes with this distribution |
---|
7 | // |
---|
8 | |
---|
9 | #include <stdio.h> |
---|
10 | #include <stdlib.h> |
---|
11 | |
---|
12 | #include "TableTraverse.h" |
---|
13 | #include <tables/Tables/TableColumn.h> |
---|
14 | #include <tables/Tables/PlainColumn.h> |
---|
15 | #include <tables/Tables/DataManager.h> |
---|
16 | |
---|
17 | #define TIMING 0 |
---|
18 | |
---|
19 | #if TIMING |
---|
20 | #include <sys/time.h> |
---|
21 | #endif |
---|
22 | |
---|
23 | static const char version[] = "$Id: TableTraverse.cpp 2316 2011-09-29 07:09:17Z MalteMarquarding $"; |
---|
24 | |
---|
25 | using namespace casa; |
---|
26 | |
---|
27 | namespace asap { |
---|
28 | class Comparator { |
---|
29 | public: |
---|
30 | virtual ~Comparator() {} |
---|
31 | virtual int compare(const void *a, const void *b) = 0; |
---|
32 | }; |
---|
33 | |
---|
34 | class CompContext: public Comparator { |
---|
35 | uInt nCols; |
---|
36 | void const *const *colValues; |
---|
37 | const TypeManager *const* typeManagers; |
---|
38 | public: |
---|
39 | CompContext(uInt nCols, void const *const colValues[], |
---|
40 | const TypeManager *const typeManagers[]) |
---|
41 | : nCols(nCols), colValues(colValues), typeManagers(typeManagers) { |
---|
42 | DebugAssert(colValues != NULL, AipsError); |
---|
43 | DebugAssert(typeManagers != NULL, AipsError); |
---|
44 | for (uInt i = 0; i < nCols; i++) { |
---|
45 | DebugAssert(colValues[i] != NULL, AipsError); |
---|
46 | DebugAssert(typeManagers[i] != NULL, AipsError); |
---|
47 | } |
---|
48 | } |
---|
49 | |
---|
50 | virtual int compare(const void *a, const void *b) { |
---|
51 | uInt ai = *(uInt*)a; |
---|
52 | uInt bi = *(uInt*)b; |
---|
53 | for (size_t i = 0; i < nCols; i++) { |
---|
54 | const size_t valueSize = typeManagers[i]->sizeOf(); |
---|
55 | const char *values = (const char *)colValues[i]; |
---|
56 | int diff = typeManagers[i]->getComparator()->comp(&values[ai*valueSize], &values[bi*valueSize]); |
---|
57 | if (diff != 0) { |
---|
58 | return diff; |
---|
59 | } |
---|
60 | } |
---|
61 | return 0; |
---|
62 | } |
---|
63 | }; |
---|
64 | } |
---|
65 | |
---|
66 | #if TIMING |
---|
67 | static double currenttime() |
---|
68 | { |
---|
69 | struct timeval tv; |
---|
70 | int result = gettimeofday(&tv, NULL); |
---|
71 | return tv.tv_sec + ((double)tv.tv_usec) / 1000000.; |
---|
72 | } |
---|
73 | #endif |
---|
74 | |
---|
75 | #ifdef HAVE_QSORT_R |
---|
76 | |
---|
77 | static int compWithComparator(void *arg, const void *a, const void *b) |
---|
78 | { |
---|
79 | return ((asap::Comparator *)arg)->compare(a, b); |
---|
80 | } |
---|
81 | |
---|
82 | #else |
---|
83 | |
---|
84 | static inline void swap_(char *a, char *b, size_t size) |
---|
85 | { |
---|
86 | char tmp[size]; |
---|
87 | char *p = tmp; |
---|
88 | do { |
---|
89 | *p = *a; |
---|
90 | *a++ = *b; |
---|
91 | *b++ = *p++; |
---|
92 | } while (--size > 0); |
---|
93 | } |
---|
94 | |
---|
95 | static inline void cpy(char *dest, char *src, size_t size) |
---|
96 | { |
---|
97 | for (size_t i = 0; i < size; i++) { |
---|
98 | dest[i] = src[i]; |
---|
99 | } |
---|
100 | } |
---|
101 | |
---|
102 | // returning NULL means, already sorted. |
---|
103 | static inline char *quickFindPivot(char *const left, char *const right, |
---|
104 | const size_t size, asap::Comparator *comp) |
---|
105 | { |
---|
106 | char *const m = &left[(((right - left) / size) / 2 ) * size]; |
---|
107 | char *result = NULL; |
---|
108 | if (left == m) { // This means there are at most 2 elements. |
---|
109 | int diff = (left == right) ? 0 : comp->compare(left, right); |
---|
110 | if (diff > 0) { |
---|
111 | swap_(left, right, size); |
---|
112 | } |
---|
113 | if (diff != 0) { |
---|
114 | return right; |
---|
115 | } |
---|
116 | return result; |
---|
117 | } |
---|
118 | |
---|
119 | int diff = comp->compare(left, m); |
---|
120 | if (diff > 0) { |
---|
121 | swap_(left, m, size); |
---|
122 | } |
---|
123 | int diff2 = comp->compare(m, right); |
---|
124 | if (diff == 0 && diff2 == 0) { |
---|
125 | return result; |
---|
126 | } |
---|
127 | result = m; |
---|
128 | if (diff2 > 0) { |
---|
129 | swap_(right, m, size); |
---|
130 | int diff3 = comp->compare(left, m); |
---|
131 | if (diff3 > 0) { |
---|
132 | swap_(left, m, size); |
---|
133 | } else if (diff3 == 0) { |
---|
134 | result = right; |
---|
135 | } |
---|
136 | } else if (diff == 0) { |
---|
137 | result = right; |
---|
138 | } |
---|
139 | return result; |
---|
140 | } |
---|
141 | |
---|
142 | static inline char *findPivot(char *const start, char *const end, |
---|
143 | size_t size, asap::Comparator *comp) |
---|
144 | { |
---|
145 | char *result = quickFindPivot(start, end, size, comp); |
---|
146 | if (result || &start[2*size] >= end) { |
---|
147 | return result; |
---|
148 | } |
---|
149 | |
---|
150 | for (char *pivot = start + size; pivot <= end; pivot += size) { |
---|
151 | int diff = comp->compare(start, pivot); |
---|
152 | if (diff < 0) { |
---|
153 | return pivot; |
---|
154 | } else if (diff > 0) { |
---|
155 | swap_(start, pivot, size); |
---|
156 | return pivot; |
---|
157 | } |
---|
158 | } |
---|
159 | return NULL; // all values are same. |
---|
160 | } |
---|
161 | |
---|
162 | static void sort_(char *const left, char *const right, const size_t size, |
---|
163 | asap::Comparator *comp, int level) |
---|
164 | { |
---|
165 | char *const m = findPivot(left, right, size, comp); |
---|
166 | if (m == NULL) { |
---|
167 | return; |
---|
168 | } |
---|
169 | char *l = left; |
---|
170 | char *r = right; |
---|
171 | char pivot[size] __attribute__ ((aligned (16))); |
---|
172 | cpy(pivot, m, size); |
---|
173 | while (true) { |
---|
174 | while (l < r && comp->compare(l, pivot) < 0) { |
---|
175 | l += size; |
---|
176 | } |
---|
177 | while (l < r && comp->compare(pivot, r) <= 0) { |
---|
178 | r -= size; |
---|
179 | } |
---|
180 | if (l >= r) { |
---|
181 | break; |
---|
182 | } |
---|
183 | swap_(l, r, size); |
---|
184 | l += size; |
---|
185 | r -= size; |
---|
186 | } |
---|
187 | if (l == r && comp->compare(l, pivot) < 0) { |
---|
188 | l += size; |
---|
189 | } |
---|
190 | sort_(left, l - size, size, comp, level + 1); |
---|
191 | sort_(l, right, size, comp, level + 1); |
---|
192 | } |
---|
193 | |
---|
194 | #endif |
---|
195 | |
---|
196 | static inline void modernQSort(void *base, size_t elements, size_t size, |
---|
197 | asap::Comparator *comp) |
---|
198 | { |
---|
199 | if (elements > 1) { |
---|
200 | #ifdef HAVE_QSORT_R |
---|
201 | qsort_r(base, elements, size, comp, compWithComparator); |
---|
202 | #else |
---|
203 | sort_((char *)base, &((char *)base)[(elements - 1) * size], size, comp, 0); |
---|
204 | #endif |
---|
205 | } |
---|
206 | } |
---|
207 | |
---|
208 | namespace asap { |
---|
209 | class ROTableColumnBackDoor: public ROTableColumn { |
---|
210 | public: |
---|
211 | static BaseColumn *baseColumnPtr(const ROTableColumn *col) |
---|
212 | { |
---|
213 | return ((ROTableColumnBackDoor*)col)->baseColPtr(); |
---|
214 | } |
---|
215 | }; |
---|
216 | |
---|
217 | static void copyColumnData(void *colValues, size_t elementSize, uInt nRows, |
---|
218 | BaseColumn *refCol) |
---|
219 | { |
---|
220 | char *base = (char *)colValues; |
---|
221 | for (uInt i = 0; i < nRows; i++) { |
---|
222 | refCol->get(i, &base[elementSize * i]); |
---|
223 | } |
---|
224 | } |
---|
225 | |
---|
226 | void traverseTable(const Table &table, |
---|
227 | const char *const columnNames[], |
---|
228 | const TypeManager *const typeManagers[], |
---|
229 | TableVisitor *visitor, |
---|
230 | Bool doSort) |
---|
231 | { |
---|
232 | #if TIMING |
---|
233 | double s = currenttime(); |
---|
234 | #endif |
---|
235 | uInt colCount = 0; |
---|
236 | for (; columnNames[colCount]; colCount++) { |
---|
237 | AlwaysAssert(typeManagers[colCount], AipsError); |
---|
238 | } |
---|
239 | |
---|
240 | ROTableColumn *cols[colCount]; |
---|
241 | void *colValues[colCount]; |
---|
242 | for (uInt i = 0; i < colCount; i++) { |
---|
243 | cols[i] = NULL; |
---|
244 | colValues[i] = NULL; |
---|
245 | } |
---|
246 | size_t sizes[colCount]; |
---|
247 | const uInt nRows = table.nrow(); |
---|
248 | for (uInt i = 0; i < colCount; i++) { |
---|
249 | cols[i] = new ROTableColumn(table, columnNames[i]); |
---|
250 | colValues[i] = typeManagers[i]->allocArray(nRows); |
---|
251 | sizes[i] = typeManagers[i]->sizeOf(); |
---|
252 | BaseColumn *baseCol = ROTableColumnBackDoor::baseColumnPtr(cols[i]); |
---|
253 | copyColumnData(colValues[i], typeManagers[i]->sizeOf(), nRows, baseCol); |
---|
254 | // PlainColumn *col = dynamic_cast <PlainColumn *>(baseCol); |
---|
255 | // if (col) { |
---|
256 | // const uInt gotRows = col->dataManagerColumn()-> |
---|
257 | // getBlockV(0, nRows, colValues[i]); |
---|
258 | // DebugAssert(gotRows == nRows, AipsError); |
---|
259 | // } else { |
---|
260 | // copyColumnData(colValues[i], typeManagers[i]->sizeOf(), nRows, baseCol); |
---|
261 | // } |
---|
262 | } |
---|
263 | |
---|
264 | uInt *idx = new uInt[nRows]; |
---|
265 | for (uInt i = 0; i < nRows; i++) { |
---|
266 | idx[i] = i; |
---|
267 | } |
---|
268 | |
---|
269 | try { |
---|
270 | if (doSort) { |
---|
271 | CompContext compCtx(colCount, colValues, typeManagers); |
---|
272 | modernQSort(idx, nRows, sizeof(idx[0]), &compCtx); |
---|
273 | } |
---|
274 | |
---|
275 | visitor->start(); |
---|
276 | Bool first = True; |
---|
277 | for (uInt i = 0; i < nRows; i++) { |
---|
278 | if (visitor->visit(first, idx[i], colCount, colValues) == False) { |
---|
279 | break; |
---|
280 | } |
---|
281 | first = False; |
---|
282 | } |
---|
283 | visitor->finish(); |
---|
284 | } catch (...) { |
---|
285 | delete[] idx; |
---|
286 | for (uInt i = 0; i < colCount; i++) { |
---|
287 | typeManagers[i]->freeArray(colValues[i]); |
---|
288 | delete cols[i]; |
---|
289 | } |
---|
290 | throw; |
---|
291 | } |
---|
292 | |
---|
293 | delete[] idx; |
---|
294 | for (uInt i = 0; i < colCount; i++) { |
---|
295 | typeManagers[i]->freeArray(colValues[i]); |
---|
296 | delete cols[i]; |
---|
297 | } |
---|
298 | |
---|
299 | #if TIMING |
---|
300 | double e = currenttime(); |
---|
301 | printf("%s took %.3f sec\n", __PRETTY_FUNCTION__, e - s); |
---|
302 | #endif |
---|
303 | } |
---|
304 | } |
---|
305 | |
---|
306 | #if 0 && TIMING |
---|
307 | #include <assert.h> |
---|
308 | |
---|
309 | #define elementsof(x) (sizeof(x)/sizeof(*x)) |
---|
310 | |
---|
311 | using namespace asap ; |
---|
312 | |
---|
313 | class IntComp: public Comparator { |
---|
314 | public: |
---|
315 | virtual int compare(const void *a, const void *b) { |
---|
316 | return (*(int*)a) - (*(int*)b); |
---|
317 | } |
---|
318 | }; |
---|
319 | |
---|
320 | static int compare(const void *a, const void *b) { |
---|
321 | return (*(int*)a) - (*(int*)b); |
---|
322 | } |
---|
323 | |
---|
324 | int main() |
---|
325 | { |
---|
326 | IntComp myComp; |
---|
327 | srand((int)currenttime()); |
---|
328 | const size_t N = 1024*1024*100; |
---|
329 | int *x = new int[N]; |
---|
330 | int xx[] = { |
---|
331 | 5, 3,0, 1, 2,4, 4, 4 |
---|
332 | }; |
---|
333 | #if 0 |
---|
334 | { |
---|
335 | int x[] = {1}; |
---|
336 | char *p = findPivot((char *)x, (char *)&x[0], sizeof(x[0]), &myComp); |
---|
337 | assert(p == NULL); |
---|
338 | } |
---|
339 | { |
---|
340 | int x[] = {1, 1}; |
---|
341 | char *p = findPivot((char *)x, (char *)&x[1], sizeof(x[0]), &myComp); |
---|
342 | assert(p == NULL); |
---|
343 | } |
---|
344 | { |
---|
345 | int x[] = {2, 1}; |
---|
346 | char *p = findPivot((char *)x, (char *)&x[1], sizeof(x[0]), &myComp); |
---|
347 | assert((int*)p == &x[1] && x[0] == 1 && x[1] == 2); |
---|
348 | } |
---|
349 | { |
---|
350 | int x[] = {1, 2}; |
---|
351 | char *p = findPivot((char *)x, (char *)&x[1], sizeof(x[0]), &myComp); |
---|
352 | assert((int*)p == &x[1] && x[0] == 1 && x[1] == 2); |
---|
353 | } |
---|
354 | { |
---|
355 | int x[] = {1, 1, 1}; |
---|
356 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
357 | assert(p == NULL); |
---|
358 | } |
---|
359 | { |
---|
360 | int x[] = {2, 1, 1}; |
---|
361 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
362 | assert((int*)p == &x[2]); |
---|
363 | assert(x[0] == 1 && x[1] == 1 && x[2] == 2); |
---|
364 | } |
---|
365 | { |
---|
366 | int x[] = {1, 2, 1}; |
---|
367 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
368 | assert((int*)p == &x[2]); |
---|
369 | assert(x[0] == 1 && x[1] == 1 && x[2] == 2); |
---|
370 | } |
---|
371 | { |
---|
372 | int x[] = {1, 1, 2}; |
---|
373 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
374 | assert((int*)p == &x[2]); |
---|
375 | assert(x[0] == 1 && x[1] == 1 && x[2] == 2); |
---|
376 | } |
---|
377 | { |
---|
378 | int x[] = {2, 2, 1}; |
---|
379 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
380 | assert((int*)p == &x[1]); |
---|
381 | assert(x[0] == 1 && x[1] == 2 && x[2] == 2); |
---|
382 | } |
---|
383 | { |
---|
384 | int x[] = {2, 1, 2}; |
---|
385 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
386 | assert((int*)p == &x[1]); |
---|
387 | assert(x[0] == 1 && x[1] == 2 && x[2] == 2); |
---|
388 | } |
---|
389 | { |
---|
390 | int x[] = {1, 2, 2}; |
---|
391 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
392 | assert((int*)p == &x[1]); |
---|
393 | assert(x[0] == 1 && x[1] == 2 && x[2] == 2); |
---|
394 | } |
---|
395 | { |
---|
396 | int x[] = {1, 2, 3}; |
---|
397 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
398 | assert((int*)p == &x[1]); |
---|
399 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
400 | } |
---|
401 | { |
---|
402 | int x[] = {2, 1, 3}; |
---|
403 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
404 | assert((int*)p == &x[1]); |
---|
405 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
406 | } |
---|
407 | { |
---|
408 | int x[] = {1, 3, 2}; |
---|
409 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
410 | assert((int*)p == &x[1]); |
---|
411 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
412 | } |
---|
413 | { |
---|
414 | int x[] = {3, 1, 2}; |
---|
415 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
416 | assert((int*)p == &x[1]); |
---|
417 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
418 | } |
---|
419 | { |
---|
420 | int x[] = {3, 2, 1}; |
---|
421 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
422 | assert((int*)p == &x[1]); |
---|
423 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
424 | } |
---|
425 | { |
---|
426 | int x[] = {2, 3, 1}; |
---|
427 | char *p = findPivot((char *)x, (char *)&x[2], sizeof(x[0]), &myComp); |
---|
428 | assert((int*)p == &x[1]); |
---|
429 | assert(x[0] == 1 && x[1] == 2 && x[2] == 3); |
---|
430 | } |
---|
431 | { |
---|
432 | int x[] = {36, 39, 42, 41, 36}; |
---|
433 | char *p = findPivot((char *)x, (char *)&x[4], sizeof(x[0]), &myComp); |
---|
434 | assert((int*)p == &x[4]); |
---|
435 | assert(x[4] == 42); |
---|
436 | } |
---|
437 | |
---|
438 | //assert(("assert enabled: OK", false)); |
---|
439 | modernQSort(x, 8, sizeof(x[0]), &myComp); |
---|
440 | for (int i = 0; i < 8; i++) { |
---|
441 | fprintf(stderr, "%d\n", x[i]); |
---|
442 | } |
---|
443 | #endif |
---|
444 | fprintf(stderr, "init\n"); |
---|
445 | for (int i = 0; i < N; i++) { |
---|
446 | x[i] = rand(); |
---|
447 | } |
---|
448 | fprintf(stderr, "sorting\n"); |
---|
449 | modernQSort(x, 1, sizeof(x[0]), &myComp); |
---|
450 | modernQSort(x, 2, sizeof(x[0]), &myComp); |
---|
451 | modernQSort(x, 3, sizeof(x[0]), &myComp); |
---|
452 | if (! getenv("QSORT")) { |
---|
453 | double _s = currenttime(); |
---|
454 | modernQSort(x, N, sizeof(x[0]), &myComp); |
---|
455 | double _e = currenttime(); |
---|
456 | fprintf(stderr, "modernSorted %.3f\n", _e - _s); |
---|
457 | } else { |
---|
458 | double _s = currenttime(); |
---|
459 | qsort(x, N, sizeof(x[0]), compare); |
---|
460 | double _e = currenttime(); |
---|
461 | fprintf(stderr, "qsorted %.3f\n", _e - _s); |
---|
462 | } |
---|
463 | fprintf(stderr, "outputting\n"); |
---|
464 | for (int i = 0; i < N; i++) { |
---|
465 | printf("%d\n", x[i]); |
---|
466 | } |
---|
467 | delete[] x; |
---|
468 | } |
---|
469 | #endif |
---|