|
| 1 | +#include "stdio.h" |
| 2 | +#include "xtime_l.h" |
| 3 | + |
| 4 | +#include "data.c" |
| 5 | +#define u32 int |
| 6 | + |
| 7 | + |
| 8 | +inline void copy_kv_pairs(u32 *dst, u32 *src, int src_start, int src_end, int dst_start) { |
| 9 | + for (int l = src_start; l < src_end; l++) { |
| 10 | + dst[dst_start++] = src[l]; |
| 11 | + } |
| 12 | +} |
| 13 | + |
| 14 | + |
| 15 | +int main() { |
| 16 | + // To measure number of clock cycles |
| 17 | + XTime tStart, tEnd; |
| 18 | + |
| 19 | + const int merged_results_len = merged_len; |
| 20 | + |
| 21 | + // +1 due to last signal will generate a junk data |
| 22 | + u32 merged_result[merged_results_len + 1]; |
| 23 | + |
| 24 | + // Start testing |
| 25 | + XTime_GetTime(&tStart); |
| 26 | + |
| 27 | + // Merge two SSTables (file1 and file2) |
| 28 | + int file1Ptr = 0, file2Ptr = 0; |
| 29 | + int mergedPtr = 0; |
| 30 | + int last1 = 0, last2 = 0; |
| 31 | + |
| 32 | + while (last1 == 0 || last2 == 0) { |
| 33 | + // Get metadata |
| 34 | + u32 meta1 = file1[file1Ptr]; |
| 35 | + u32 meta2 = file2[file2Ptr]; |
| 36 | + last1 = meta1 & 0x1; |
| 37 | + last2 = meta2 & 0x1; |
| 38 | + u32 key1len = meta1 >> 8 & 0xFF; |
| 39 | + u32 key2len = meta2 >> 8 & 0xFF; |
| 40 | + u32 val1len = meta1 >> 16 & 0xFF; |
| 41 | + u32 val2len = meta2 >> 16 & 0xFF; |
| 42 | + |
| 43 | + // Compare keys |
| 44 | + int common_key_length = key1len < key2len ? key1len : key2len; |
| 45 | + int winner = 0; |
| 46 | + |
| 47 | + for (int k = 0; k < common_key_length; k++) { |
| 48 | + if (file1[file1Ptr + 1 + k] < file2[file2Ptr + 1 + k]) { |
| 49 | + // Copy KV pair from file1 |
| 50 | + copy_kv_pairs(merged_result, file1, file1Ptr, file1Ptr + key1len + val1len + 1, mergedPtr); |
| 51 | + file1Ptr += key1len + val1len + 1; |
| 52 | + mergedPtr += key1len + val1len + 1; |
| 53 | + winner = 1; |
| 54 | + break; |
| 55 | + } else if (file1[file1Ptr + 1 + k] > file2[file2Ptr + 1 + k]) { |
| 56 | + // Copy KV pair from file2 |
| 57 | + copy_kv_pairs(merged_result, file2, file2Ptr, file2Ptr + key2len + val2len + 1, mergedPtr); |
| 58 | + file2Ptr += key2len + val2len + 1; |
| 59 | + mergedPtr += key2len + val2len + 1; |
| 60 | + winner = 1; |
| 61 | + break; |
| 62 | + } |
| 63 | + } |
| 64 | + |
| 65 | + if (winner == 1) { |
| 66 | + continue; |
| 67 | + } |
| 68 | + |
| 69 | + // If keys are equal up to a common length, compare key lengths |
| 70 | + if (key1len < key2len) { |
| 71 | + // Copy KV pair from file1 |
| 72 | + copy_kv_pairs(merged_result, file1, file1Ptr, file1Ptr + key1len + val1len + 1, mergedPtr); |
| 73 | + file1Ptr += key1len + val1len + 1; |
| 74 | + mergedPtr += key1len + val1len + 1; |
| 75 | + continue; |
| 76 | + } else if (key1len > key2len) { |
| 77 | + // Copy KV pair from file2 |
| 78 | + copy_kv_pairs(merged_result, file2, file2Ptr, file2Ptr + key2len + val2len + 1, mergedPtr); |
| 79 | + mergedPtr += key2len + val2len + 1; |
| 80 | + file2Ptr += key2len + val2len + 1; |
| 81 | + continue; |
| 82 | + } |
| 83 | + |
| 84 | + // If lengths are equal, select file1 cause it is considered more up to date |
| 85 | + copy_kv_pairs(merged_result, file1, file1Ptr, file1Ptr + key1len + val1len + 1, mergedPtr); |
| 86 | + file1Ptr += key1len + val1len + 1; |
| 87 | + mergedPtr += key1len + val1len + 1; |
| 88 | + file2Ptr += key2len + val2len + 1; |
| 89 | + } |
| 90 | + |
| 91 | + // Copy the rest of the file1 or file2 |
| 92 | + if (last1) { |
| 93 | + copy_kv_pairs(merged_result, file2, file2Ptr, file2_len, mergedPtr); |
| 94 | + } else if (last2) { |
| 95 | + copy_kv_pairs(merged_result, file1, file1Ptr, file1_len, mergedPtr); |
| 96 | + } |
| 97 | + |
| 98 | + // End testing |
| 99 | + XTime_GetTime(&tEnd); |
| 100 | + |
| 101 | + xil_printf("Processing took %llu clock cycles.\n", 2 * (tEnd - tStart)); |
| 102 | + |
| 103 | + print("Comparing values..\n"); |
| 104 | + int errors_num = 0; |
| 105 | + for (int i = 0; i < merged_results_len; i++) { |
| 106 | + if (merged_result[i] != merged[i]) { |
| 107 | + xil_printf("Error at index %d, expected %0x, got %0x\n", i, merged[i], merged_result[i]); |
| 108 | + errors_num++; |
| 109 | + } |
| 110 | + } |
| 111 | + print("Comparing is done. Number of errors is %d\n", errors_num); |
| 112 | + xil_printf("Comparing is done. Number of errors is %d\n", errors_num); |
| 113 | +} |
| 114 | + |
0 commit comments