summaryrefslogtreecommitdiff
path: root/targets/instr_sort.c
diff options
context:
space:
mode:
authorGabriel Schneider <[email protected]>2026-11-10 11:32:21 -0300
committerGabriel Schneider <[email protected]>2026-11-10 12:08:27 -0300
commitb426a8a99bcad81ecbb41d1f2a2e83738c29d8e1 (patch)
tree06e303f1f33ce53cfc2d8a2043e24f032877f9ad /targets/instr_sort.c
parent7f363779cb99b0820cce69c433bcfab87bb3d709 (diff)
downloadcomputeranim-b426a8a99bcad81ecbb41d1f2a2e83738c29d8e1.tar.gz
computeranim-b426a8a99bcad81ecbb41d1f2a2e83738c29d8e1.zip
llvm: a pass that instruments for animation, its runtime, ztrace cc
llvm/pass.cpp is an LLVM pass plugin: lines, stores, loads, calls and variables, each call into the runtime carrying names and type descriptions, selected by globs (-ztrace-only, -ztrace-mem), before the optimizer by default. src/instr/rt.zig is the runtime (libztrace-rt.a), which also answers clang's own coverage and -finstrument-functions hooks; src/instr/types.zig the grammar of the type descriptions and its parser. ztrace cc adds all of it to a compiler command. test-llvm compiles fib, two sorts, a linked list and a BFS through ztrace cc and asserts on their recordings; bench-llvm measures what each selection costs. Co-Authored-By: Claude Fable 5.2 <[email protected]>
Diffstat (limited to 'targets/instr_sort.c')
-rw-r--r--targets/instr_sort.c44
1 files changed, 44 insertions, 0 deletions
diff --git a/targets/instr_sort.c b/targets/instr_sort.c
new file mode 100644
index 0000000..411b348
--- /dev/null
+++ b/targets/instr_sort.c
@@ -0,0 +1,44 @@
+// Bubble sort and insertion sort of the same eight numbers, argv[1] times
+// (by default once). Exits with the smallest plus the largest.
+#include <stdlib.h>
+#include <string.h>
+
+#define N 8
+// Not const, not static: -O2 must sort at run time, not when compiling.
+int unsorted[N] = {5, 2, 9, 1, 7, 3, 8, 4};
+
+static void bubble(int *a, int n) {
+ for (int i = 0; i < n - 1; i++) {
+ for (int j = 0; j < n - 1 - i; j++) {
+ if (a[j] > a[j + 1]) {
+ int t = a[j];
+ a[j] = a[j + 1];
+ a[j + 1] = t;
+ }
+ }
+ }
+}
+
+static void insertion(int *a, int n) {
+ for (int i = 1; i < n; i++) {
+ int key = a[i];
+ int j = i - 1;
+ while (j >= 0 && a[j] > key) {
+ a[j + 1] = a[j];
+ j--;
+ }
+ a[j + 1] = key;
+ }
+}
+
+int main(int argc, char **argv) {
+ int rounds = argc > 1 ? atoi(argv[1]) : 1;
+ int bubbled[N], inserted[N];
+ while (rounds-- > 0) {
+ memcpy(bubbled, unsorted, sizeof unsorted);
+ memcpy(inserted, unsorted, sizeof unsorted);
+ bubble(bubbled, N);
+ insertion(inserted, N);
+ }
+ return bubbled[0] + inserted[N - 1];
+}