aprender-serve 0.64.0

Pure Rust ML inference engine built from scratch - model serving for GGUF and safetensors
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
//! Part 26: Error Path and Edge Case Coverage Tests
//!
//! This module targets uncovered error handling paths in quantize/mod.rs:
//! - InterleavedQ4K::from_q4k invalid data errors
//! - InterleavedQ4K::dot dimension mismatch errors
//! - fused_q4_0_q8_0_parallel_matvec validation errors
//! - fused_q8_0_q8_0_parallel_matvec validation errors
//! - Boundary conditions and edge cases
//!
//! Refs: T-COV-001

use crate::quantize::{
    dequantize_q8_blocks, fused_q4_0_q8_0_parallel_matvec, fused_q4_0_q8_0_parallel_matvec_into,
    fused_q8_0_q8_0_parallel_matvec, fused_q8_0_q8_0_parallel_matvec_into,
    quantize_activations_q8k_into, quantize_to_q8_blocks, InterleavedQ4K,
};

// =============================================================================
// Error Path Tests: InterleavedQ4K
// =============================================================================

/// Test InterleavedQ4K::from_q4k with data not aligned to super-block size
#[test]
fn test_interleaved_q4k_from_q4k_invalid_length() {
    // Q4_K super-block is 144 bytes; test with misaligned data
    let invalid_data = vec![0u8; 143]; // One byte short
    let result = InterleavedQ4K::from_q4k(&invalid_data);
    assert!(
        result.is_err(),
        "Should fail with 143 bytes (not multiple of 144)"
    );

    let err_msg = format!("{:?}", result.unwrap_err());
    assert!(
        err_msg.contains("multiple") || err_msg.contains("144"),
        "Error should mention super-block size: {}",
        err_msg
    );
}

/// Test InterleavedQ4K::from_q4k with partial super-block
#[test]
fn test_interleaved_q4k_from_q4k_partial_superblock() {
    // 145 bytes = 1 super-block + 1 extra byte
    let invalid_data = vec![0u8; 145];
    let result = InterleavedQ4K::from_q4k(&invalid_data);
    assert!(result.is_err());
}

/// Test InterleavedQ4K::from_q4k with empty data
#[test]
fn test_interleaved_q4k_from_q4k_empty() {
    let empty_data: Vec<u8> = vec![];
    // Empty is technically a multiple of 144 (0 super-blocks)
    let result = InterleavedQ4K::from_q4k(&empty_data);
    assert!(result.is_ok());
    let interleaved = result.expect("test value should be present");
    assert_eq!(interleaved.num_values(), 0);
}

/// Test InterleavedQ4K::dot with mismatched activation length
#[test]
fn test_interleaved_q4k_dot_dimension_mismatch() {
    // Create valid 1 super-block = 256 values
    let data = vec![0u8; 144];
    let interleaved = InterleavedQ4K::from_q4k(&data).expect("test value should be present");
    assert_eq!(interleaved.num_values(), 256);

    // Try with wrong activation length
    let activations = vec![1.0f32; 128]; // Half the expected length
    let result = interleaved.dot(&activations);
    assert!(result.is_err());

    let err_msg = format!("{:?}", result.unwrap_err());
    assert!(
        err_msg.contains("128") || err_msg.contains("256"),
        "Error should mention dimension mismatch: {}",
        err_msg
    );
}

/// Test InterleavedQ4K::dot with extra activations
#[test]
fn test_interleaved_q4k_dot_extra_activations() {
    let data = vec![0u8; 144];
    let interleaved = InterleavedQ4K::from_q4k(&data).expect("test value should be present");

    // Try with too many activations
    let activations = vec![1.0f32; 512]; // Double the expected length
    let result = interleaved.dot(&activations);
    assert!(result.is_err());
}

// =============================================================================
// Error Path Tests: fused_q4_0_q8_0_parallel_matvec
// =============================================================================

/// Test parallel matvec with insufficient weight data
#[test]
fn test_fused_q4_0_q8_0_parallel_matvec_weight_too_small() {
    let in_dim = 64;
    let out_dim = 4;
    let bytes_per_row = (in_dim / 32) * 18; // 2 blocks * 18 bytes = 36

    // Provide less data than needed
    let weight_data = vec![0u8; out_dim * bytes_per_row - 1];
    let activations = vec![1.0f32; in_dim];

    let result = fused_q4_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_err());
}

/// Test parallel matvec with activation dimension mismatch
#[test]
fn test_fused_q4_0_q8_0_parallel_matvec_activation_mismatch() {
    let in_dim = 64;
    let out_dim = 4;
    let bytes_per_row = (in_dim / 32) * 18;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim + 1]; // One extra element

    let result = fused_q4_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_err());
}

/// Test parallel matvec exceeding parallel threshold
#[test]
fn test_fused_q4_0_q8_0_parallel_matvec_large_matrix() {
    // Use out_dim >= 1024 to trigger parallel path
    let in_dim = 64;
    let out_dim = 1024;
    let bytes_per_row = (in_dim / 32) * 18;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim];

    let result = fused_q4_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_ok());
    assert_eq!(result.expect("test value should be present").len(), out_dim);
}

// =============================================================================
// Error Path Tests: fused_q4_0_q8_0_parallel_matvec_into
// =============================================================================

/// Test into variant with activation mismatch
#[test]
fn test_fused_q4_0_q8_0_parallel_matvec_into_activation_mismatch() {
    let in_dim = 64;
    let out_dim = 8;
    let bytes_per_row = (in_dim / 32) * 18;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim + 1]; // One extra element
    let mut output = vec![0.0f32; out_dim];

    let result =
        fused_q4_0_q8_0_parallel_matvec_into(&weight_data, &activations, in_dim, &mut output);
    assert!(result.is_err());
}

/// Test into variant with correct dimensions
#[test]
fn test_fused_q4_0_q8_0_parallel_matvec_into_success() {
    let in_dim = 64;
    let out_dim = 8;
    let bytes_per_row = (in_dim / 32) * 18;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim];
    let mut output = vec![0.0f32; out_dim];

    let result =
        fused_q4_0_q8_0_parallel_matvec_into(&weight_data, &activations, in_dim, &mut output);
    assert!(result.is_ok());
}

// =============================================================================
// Error Path Tests: fused_q8_0_q8_0_parallel_matvec
// =============================================================================

/// Test Q8_0 parallel matvec with weight data too small
#[test]
fn test_fused_q8_0_q8_0_parallel_matvec_weight_too_small() {
    let in_dim = 64;
    let out_dim = 4;
    let bytes_per_row = (in_dim / 32) * 34; // Q8_0: 34 bytes per block

    let weight_data = vec![0u8; out_dim * bytes_per_row - 1];
    let activations = vec![1.0f32; in_dim];

    let result = fused_q8_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_err());
}

/// Test Q8_0 parallel matvec with activation mismatch
#[test]
fn test_fused_q8_0_q8_0_parallel_matvec_activation_mismatch() {
    let in_dim = 64;
    let out_dim = 4;
    let bytes_per_row = (in_dim / 32) * 34;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim - 1]; // One element short

    let result = fused_q8_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_err());
}

/// Test Q8_0 parallel matvec large matrix (parallel path)
#[test]
fn test_fused_q8_0_q8_0_parallel_matvec_large() {
    let in_dim = 64;
    let out_dim = 1024;
    let bytes_per_row = (in_dim / 32) * 34;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim];

    let result = fused_q8_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_ok());
    assert_eq!(result.expect("test value should be present").len(), out_dim);
}

// =============================================================================
// Error Path Tests: fused_q8_0_q8_0_parallel_matvec_into
// =============================================================================

/// Test Q8_0 into variant with output buffer too small
#[test]
fn test_fused_q8_0_q8_0_parallel_matvec_into_output_small() {
    let in_dim = 64;
    let out_dim = 8;
    let bytes_per_row = (in_dim / 32) * 34;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim];
    let mut output = vec![0.0f32; out_dim - 1];

    let result = fused_q8_0_q8_0_parallel_matvec_into(
        &weight_data,
        &activations,
        in_dim,
        out_dim,
        &mut output,
    );
    assert!(result.is_err());
}

/// Test Q8_0 into variant success
#[test]
fn test_fused_q8_0_q8_0_parallel_matvec_into_success() {
    let in_dim = 64;
    let out_dim = 8;
    let bytes_per_row = (in_dim / 32) * 34;

    let weight_data = vec![0u8; out_dim * bytes_per_row];
    let activations = vec![1.0f32; in_dim];
    let mut output = vec![0.0f32; out_dim];

    let result = fused_q8_0_q8_0_parallel_matvec_into(
        &weight_data,
        &activations,
        in_dim,
        out_dim,
        &mut output,
    );
    assert!(result.is_ok());
}

// =============================================================================
// Error Path Tests: quantize_activations_q8k_into
// =============================================================================

/// Test Q8K into with buffers too small
#[test]
fn test_quantize_activations_q8k_into_buffers_small() {
    let activations = vec![1.0f32; 512]; // 2 super-blocks
    let mut scales = vec![0.0f32; 1]; // Need 2
    let mut quants = vec![0i8; 512];

    let result = quantize_activations_q8k_into(&activations, &mut scales, &mut quants);
    assert!(result.is_err());
}

/// Test Q8K into with quants buffer too small
#[test]
fn test_quantize_activations_q8k_into_quants_small() {
    let activations = vec![1.0f32; 512];
    let mut scales = vec![0.0f32; 2];
    let mut quants = vec![0i8; 256]; // Need 512

    let result = quantize_activations_q8k_into(&activations, &mut scales, &mut quants);
    assert!(result.is_err());
}

/// Test Q8K into with non-aligned activation length
#[test]
fn test_quantize_activations_q8k_into_non_aligned() {
    let activations = vec![1.0f32; 300]; // Not multiple of 256
    let mut scales = vec![0.0f32; 2];
    let mut quants = vec![0i8; 512];

    let result = quantize_activations_q8k_into(&activations, &mut scales, &mut quants);
    assert!(result.is_err());
}

/// Test Q8K into success case
#[test]
fn test_quantize_activations_q8k_into_success() {
    let activations = vec![1.0f32; 512];
    let mut scales = vec![0.0f32; 2];
    let mut quants = vec![0i8; 512];

    let result = quantize_activations_q8k_into(&activations, &mut scales, &mut quants);
    assert!(result.is_ok());
}

// =============================================================================
// Edge Case Tests: quantize_to_q8_blocks
// =============================================================================

/// Test Q8 block quantization with empty input
#[test]
fn test_quantize_to_q8_blocks_empty() {
    let values: Vec<f32> = vec![];
    let result = quantize_to_q8_blocks(&values);
    assert!(result.is_ok());
    assert!(result.expect("test value should be present").is_empty());
}

/// Test Q8 block quantization with non-aligned input
#[test]
fn test_quantize_to_q8_blocks_non_aligned() {
    let values = vec![1.0f32; 50]; // Not multiple of 32
    let result = quantize_to_q8_blocks(&values);
    assert!(result.is_err());
}

/// Test Q8 block quantization with special values
#[test]
fn test_quantize_to_q8_blocks_special_values() {
    let mut values = vec![0.0f32; 32];
    values[0] = f32::INFINITY;
    values[1] = f32::NEG_INFINITY;
    values[2] = f32::NAN;

    // Should still produce blocks (implementation handles special floats)
    let result = quantize_to_q8_blocks(&values);
    // Result depends on implementation - just verify it doesn't panic
    let _ = result;
}

/// Test Q8 block round-trip (quantize then dequantize)
#[test]
fn test_q8_block_round_trip() {
    let original: Vec<f32> = (0..64).map(|i| (i as f32 - 32.0) / 10.0).collect();

    let blocks = quantize_to_q8_blocks(&original).expect("test value should be present");
    assert_eq!(blocks.len(), 2); // 64 values = 2 blocks of 32

    let reconstructed = dequantize_q8_blocks(&blocks);
    assert_eq!(reconstructed.len(), original.len());

    // Check reconstruction is reasonable (quantization introduces error)
    for (orig, recon) in original.iter().zip(reconstructed.iter()) {
        let diff = (orig - recon).abs();
        assert!(
            diff < 0.5,
            "Round-trip error too large: {} -> {}",
            orig,
            recon
        );
    }
}

// =============================================================================
// Edge Case Tests: InterleavedQ4K dot with actual values
// =============================================================================

/// Test InterleavedQ4K dot with all-zero weights
#[test]
fn test_interleaved_q4k_dot_zero_weights() {
    let data = vec![0u8; 144];
    let interleaved = InterleavedQ4K::from_q4k(&data).expect("test value should be present");
    let activations = vec![1.0f32; 256];

    let result = interleaved.dot(&activations).expect("test value should be present");
    // All-zero weights should give zero result
    assert!(result.abs() < 1e-6);
}

/// Test InterleavedQ4K dot with large values
#[test]
fn test_interleaved_q4k_dot_large_values() {
    // Create super-block with d=1.0 (f16 0x3C00)
    let mut data = vec![0u8; 144];
    data[0] = 0x00;
    data[1] = 0x3C; // d = 1.0

    let interleaved = InterleavedQ4K::from_q4k(&data).expect("test value should be present");
    let activations = vec![1000.0f32; 256];

    let result = interleaved.dot(&activations).expect("test value should be present");
    assert!(result.is_finite());
}

/// Test InterleavedQ4K dot with multiple super-blocks
#[test]
fn test_interleaved_q4k_dot_multiple_superblocks() {
    let num_superblocks = 8;
    let mut data = vec![0u8; num_superblocks * 144];

    // Set d=1.0 for each super-block
    for sb in 0..num_superblocks {
        let offset = sb * 144;
        data[offset] = 0x00;
        data[offset + 1] = 0x3C;
    }

    let interleaved = InterleavedQ4K::from_q4k(&data).expect("test value should be present");
    assert_eq!(interleaved.num_values(), num_superblocks * 256);

    let activations = vec![1.0f32; interleaved.num_values()];
    let result = interleaved.dot(&activations).expect("test value should be present");
    assert!(result.is_finite());
}

// =============================================================================
// Boundary Condition Tests
// =============================================================================

/// Test minimum valid Q4_0 matvec (1 block, 1 output)
#[test]
fn test_minimum_q4_0_matvec() {
    let in_dim = 32;
    let out_dim = 1;
    let weight_data = vec![0u8; 18];
    let activations = vec![1.0f32; in_dim];

    let result = fused_q4_0_q8_0_parallel_matvec(&weight_data, &activations, in_dim, out_dim);
    assert!(result.is_ok());
}

include!("minimum_exactly.rs");