authorgravatar for hello@nektro.netMeghan Denny <hello@nektro.net> 2026-02-27 15:56:03 -08:00
committergravatar for hello@nektro.netMeghan Denny <hello@nektro.net> 2026-02-27 15:56:03 -08:00
log9dc86081ba464532757859a9904c3a095a7aed0d
tree3ba5f9b1d952587808e1ae37194daf46f8ea8425
parent80455a913d0be4e02b024e2d94ae4d3a7d69d359

remove many temp ignores and bad asserts

1 files changed, 0 insertions(+), 27 deletions(-)

qrcode.zig-27
......@@ -21,11 +21,6 @@ const GF = blk: {
2121};
2222
2323pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16, input: []const u8) BitGrid(4 * version + 17) {
24 _ = &version;
25 _ = &mode;
26 _ = &level;
27 _ = &input;
28
2924 std.log.warn("mode: {s}", .{@tagName(mode)});
3025 std.log.warn("level: {s}", .{@tagName(level)});
3126
......@@ -81,9 +76,7 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
8176 std.log.warn("total_bits: {d}", .{total_bits});
8277
8378 var scratch: std.bit_set.ArrayBitSet(u8, total_bits) = .initEmpty();
84 _ = &scratch;
8579 var scratchw: BitsetWriter(u8, total_bits) = .{ .set = &scratch };
86 _ = &scratchw;
8780
8881 scratchw.writeInt(mode_indicator);
8982 scratchw.writeInt(len_indicator);
......@@ -92,15 +85,12 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
9285 const data_bits = input.len * 8 + @bitSizeOf(@TypeOf(mode_indicator)) + @bitSizeOf(@TypeOf(len_indicator));
9386 std.log.warn("data_bits: {d}", .{data_bits});
9487 std.debug.assert(scratchw.idx == data_bits);
95 std.debug.assert(scratchw.idx == 44); //temp
9688
9789 // write @max(4, padding_bits) 0s
9890 for (0..@min(4, total_bits - scratchw.idx)) |_| scratchw.writeInt(@as(u1, 0));
99 std.debug.assert(scratchw.idx == 48); //temp
10091
10192 // add zero bits to make data_bits%8 == 0
10293 for (0..-%scratchw.idx & 7) |_| scratchw.writeInt(@as(u1, 0));
103 std.debug.assert(scratchw.idx == 48); //temp
10494
10595 // add 236(11101100) 17(00010001) until we reach total_bits
10696 while (scratchw.idx < total_bits) {
......@@ -112,14 +102,6 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
112102 // std.log.warn("{d}", .{&bitReverse(scratch.masks)});
113103 // std.log.warn("{x}", .{&bitReverse(scratch.masks)});
114104
115 std.debug.assert(@bitReverse(scratch.masks[0]) == 0b01000000); //temp
116 std.debug.assert(!scratch.isSet(0)); //temp
117 std.debug.assert(scratch.isSet(1)); //temp
118 std.debug.assert(!scratch.isSet(2)); //temp
119 std.debug.assert(!scratch.isSet(3)); //temp
120 // 01000000 01000101 01100110 01010111 00100011 00010000 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100
121 // 01000000 01000101 01100110 01010111 00100011 00010000 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100
122
123105 const groups = 1; // ?
124106 _ = &groups;
125107 const blocks = 1; // ?
......@@ -130,15 +112,12 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
130112 _ = &ecc_per_block;
131113
132114 var message_polynomial = scratch.masks;
133 _ = &message_polynomial;
134115 std.log.warn("message_polynomial: {d}", .{&bitReverse(message_polynomial)});
135116
136117 const generator_polynomial = reverseArray(generatorPolynomial(ecc_per_block));
137 _ = &generator_polynomial;
138118 std.log.warn("generator_polynomial: {d}", .{generator_polynomial});
139119
140120 const generator_polynomial_alpha = to_alpha(generator_polynomial);
141 _ = &generator_polynomial_alpha;
142121 std.log.warn("generator_polynomial_alpha: {d}", .{generator_polynomial_alpha});
143122
144123 // Now that the message and generator polynomials have been created, divide them to get the error codewords.
......@@ -166,7 +145,6 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
166145 std.log.warn("error_codewords: {d}", .{error_codewords});
167146
168147 const interleaved_message = scratch.masks ++ bitReverse(error_codewords);
169 _ = &interleaved_message;
170148 std.log.warn("interleaved_message: {b:0>8}", .{&bitReverse(interleaved_message)});
171149
172150 // remainder bits
......@@ -175,7 +153,6 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
175153
176154 const size = 4 * version + 17;
177155 var grid: BitGrid(size) = .initEmpty();
178 _ = &grid;
179156
180157 // top left finder pattern
181158 for (0..7) |i| for (0..7) |j| grid.setT(0 + i, 0 + j);
......@@ -213,20 +190,16 @@ pub fn encode(comptime mode: Mode, comptime level: Level, comptime version: u16,
213190
214191 // write data
215192 var data_iter: BufBiterator = .init(&bitReverse(interleaved_message));
216 _ = &data_iter;
217193
218194 var griditer: GridZigZag = .init(size, 6);
219195 while (griditer.next()) |idx| {
220196 const x = idx % size;
221197 const y = (idx - x) / size;
222 // std.log.warn("idx: {d} {d},{d}", .{ idx, x, y });
223198 if (data_mask.isSet(x, y)) continue;
224199 grid.debug.set((y * size) + x);
225200 if (@bitCast(data_iter.next() orelse break)) grid.set(x, y);
226201 }
227202
228 //
229
230203 for (0..8) |y| for (0..8) |x| grid.debug.set((y * size) + x);
231204 for (0..8) |y| for (0..8) |x| grid.debug.set((y * size) + size - 8 + x);
232205 for (0..8) |y| for (0..8) |x| grid.debug.set(((size - 8 + y) * size) + x);