decy-core 2.2.0

Core transpilation pipeline for C-to-Rust conversion
Documentation
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
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
//! Loop + Array Access Safety Integration Tests
//!
//! **RED PHASE**: Comprehensive tests for C loop + array patterns → Safe Rust
//!
//! This validates that dangerous C patterns (array indexing in loops, buffer overflows)
//! are transpiled to safe Rust with bounds checking and safe iteration.
//!
//! **Pattern**: EXTREME TDD - Test-First Development
//! **Reference**: ISO C99 §6.5.2.1 (Array subscripting) + §6.8.5 (Iteration statements)
//!
//! **Safety Goal**: Zero buffer overflows through bounds checking
//! **Validation**: Transpiled Rust uses safe indexing or iterators

use decy_core::transpile;

// ============================================================================
// RED PHASE: For Loop + Array Access
// ============================================================================

#[test]
fn test_for_loop_array_iteration() {
    // Classic C pattern: iterate array with for loop
    let c_code = r#"
        int main() {
            int numbers[5] = {1, 2, 3, 4, 5};
            int sum = 0;

            for (int i = 0; i < 5; i++) {
                sum += numbers[i];
            }

            return sum;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    // Should generate Rust code
    assert!(result.contains("fn main"), "Should have main function");

    // Should handle array safely
    assert!(!result.is_empty(), "Should generate code");

    // Count unsafe blocks - should be minimal
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 3, "Array iteration should minimize unsafe (found {})", unsafe_count);
}

#[test]
fn test_for_loop_array_modification() {
    // Modify array elements in loop
    let c_code = r#"
        int main() {
            int values[10];

            for (int i = 0; i < 10; i++) {
                values[i] = i * 2;
            }

            return values[5];
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Should have array and loop
    let unsafe_count = result.matches("unsafe").count();
    assert!(
        unsafe_count <= 3,
        "Array modification should minimize unsafe (found {})",
        unsafe_count
    );
}

#[test]
fn test_for_loop_with_array_bounds() {
    // Explicit bounds checking pattern
    let c_code = r#"
        #define ARRAY_SIZE 8

        int main() {
            int data[ARRAY_SIZE];
            int total = 0;

            for (int i = 0; i < ARRAY_SIZE; i++) {
                data[i] = i + 1;
                total += data[i];
            }

            return total;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Bounds should be respected
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 3, "Bounded loop should minimize unsafe (found {})", unsafe_count);
}

// ============================================================================
// RED PHASE: While Loop + Array Access
// ============================================================================

#[test]
fn test_while_loop_array_access() {
    // While loop with array indexing
    let c_code = r#"
        int main() {
            int numbers[5] = {10, 20, 30, 40, 50};
            int i = 0;
            int sum = 0;

            while (i < 5) {
                sum += numbers[i];
                i++;
            }

            return sum;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    let unsafe_count = result.matches("unsafe").count();
    assert!(
        unsafe_count <= 3,
        "While loop array access should minimize unsafe (found {})",
        unsafe_count
    );
}

#[test]
fn test_while_loop_array_search() {
    // Search pattern with while loop
    let c_code = r#"
        int main() {
            int values[10] = {5, 3, 8, 1, 9, 2, 7, 4, 6, 0};
            int i = 0;
            int target = 7;
            int found = -1;

            while (i < 10) {
                if (values[i] == target) {
                    found = i;
                    break;
                }
                i++;
            }

            return found;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Should handle break statement
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 4, "Search pattern should minimize unsafe (found {})", unsafe_count);
}

// ============================================================================
// RED PHASE: Nested Loops + 2D Arrays
// ============================================================================

#[test]
fn test_nested_loop_2d_array() {
    // 2D array with nested loops
    let c_code = r#"
        int main() {
            int matrix[3][3] = {
                {1, 2, 3},
                {4, 5, 6},
                {7, 8, 9}
            };
            int sum = 0;

            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    sum += matrix[i][j];
                }
            }

            return sum;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Nested loops with 2D array
    let unsafe_count = result.matches("unsafe").count();
    assert!(
        unsafe_count <= 5,
        "Nested loops with 2D array should minimize unsafe (found {})",
        unsafe_count
    );
}

// ============================================================================
// RED PHASE: Array Bounds Safety
// ============================================================================

#[test]
fn test_array_out_of_bounds_prevention() {
    // Pattern that could overflow in C
    let c_code = r#"
        int main() {
            int buffer[5];

            // Safe because loop condition matches array size
            for (int i = 0; i < 5; i++) {
                buffer[i] = i * 10;
            }

            return buffer[0];
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Should be safe due to matching bounds
    let unsafe_count = result.matches("unsafe").count();
    let lines = result.lines().count();
    let unsafe_per_1000 =
        if lines > 0 { (unsafe_count as f64 / lines as f64) * 1000.0 } else { 0.0 };

    assert!(
        unsafe_per_1000 < 50.0,
        "Array bounds should be safe (got {:.2} unsafe/1000 LOC)",
        unsafe_per_1000
    );
}

#[test]
fn test_array_initialization_in_loop() {
    // Initialize array to zero in loop
    let c_code = r#"
        int main() {
            int array[100];

            for (int i = 0; i < 100; i++) {
                array[i] = 0;
            }

            return 0;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Large array initialization
    let unsafe_count = result.matches("unsafe").count();
    assert!(
        unsafe_count <= 3,
        "Array initialization should minimize unsafe (found {})",
        unsafe_count
    );
}

// ============================================================================
// RED PHASE: Common Real-World Patterns
// ============================================================================

#[test]
fn test_array_copy_loop() {
    // Copy one array to another
    let c_code = r#"
        int main() {
            int source[5] = {1, 2, 3, 4, 5};
            int dest[5];

            for (int i = 0; i < 5; i++) {
                dest[i] = source[i];
            }

            return dest[4];
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Array copy should be safe
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 4, "Array copy should minimize unsafe (found {})", unsafe_count);
}

#[test]
fn test_array_reverse_loop() {
    // Reverse array in-place
    let c_code = r#"
        int main() {
            int numbers[6] = {1, 2, 3, 4, 5, 6};

            for (int i = 0; i < 3; i++) {
                int temp = numbers[i];
                numbers[i] = numbers[5 - i];
                numbers[5 - i] = temp;
            }

            return numbers[0];
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // In-place swap should be safe
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 5, "Array reverse should minimize unsafe (found {})", unsafe_count);
}

#[test]
fn test_array_max_find_loop() {
    // Find maximum value in array
    let c_code = r#"
        int main() {
            int values[8] = {23, 45, 12, 67, 34, 89, 56, 78};
            int max = values[0];

            for (int i = 1; i < 8; i++) {
                if (values[i] > max) {
                    max = values[i];
                }
            }

            return max;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Max find should be safe
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 4, "Max find should minimize unsafe (found {})", unsafe_count);
}

// ============================================================================
// RED PHASE: Edge Cases and Safety
// ============================================================================

#[test]
fn test_empty_loop_array() {
    // Loop that doesn't execute (edge case)
    let c_code = r#"
        int main() {
            int array[5] = {1, 2, 3, 4, 5};
            int sum = 0;

            for (int i = 0; i < 0; i++) {
                sum += array[i];
            }

            return sum;  // Should be 0
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Empty loop should be safe
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count <= 2, "Empty loop should minimize unsafe (found {})", unsafe_count);
}

#[test]
fn test_single_element_array_loop() {
    // Single element array
    let c_code = r#"
        int main() {
            int single[1] = {42};
            int value = 0;

            for (int i = 0; i < 1; i++) {
                value = single[i];
            }

            return value;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    assert!(result.contains("fn main"), "Should have main function");

    // Single element should be safe
    let unsafe_count = result.matches("unsafe").count();
    assert!(
        unsafe_count <= 2,
        "Single element loop should minimize unsafe (found {})",
        unsafe_count
    );
}

#[test]
fn test_unsafe_minimization_target() {
    // CRITICAL: Validate overall unsafe minimization for loop+array pattern
    let c_code = r#"
        int main() {
            int data[20];

            // Initialize
            for (int i = 0; i < 20; i++) {
                data[i] = i * i;
            }

            // Sum
            int total = 0;
            for (int i = 0; i < 20; i++) {
                total += data[i];
            }

            return total;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    // Count unsafe blocks and calculate density
    let unsafe_count = result.matches("unsafe").count();
    let lines_of_code = result.lines().count();

    let unsafe_per_1000 =
        if lines_of_code > 0 { (unsafe_count as f64 / lines_of_code as f64) * 1000.0 } else { 0.0 };

    // Target: <5 unsafe per 1000 LOC
    assert!(
        unsafe_per_1000 < 50.0,
        "Loop+array pattern should minimize unsafe (got {:.2} per 1000 LOC, want <50)",
        unsafe_per_1000
    );

    // Should have main function
    assert!(result.contains("fn main"), "Should generate main function");
}

// ============================================================================
// RED PHASE: Compilation and Correctness
// ============================================================================

#[test]
fn test_transpiled_loop_array_compiles() {
    // Generated Rust should have valid syntax
    let c_code = r#"
        int main() {
            int numbers[10];

            for (int i = 0; i < 10; i++) {
                numbers[i] = i * 2;
            }

            int result = 0;
            for (int i = 0; i < 10; i++) {
                result += numbers[i];
            }

            return result;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    // Basic syntax validation
    assert!(!result.is_empty(), "Should generate non-empty code");
    assert!(result.contains("fn main"), "Should have main function");

    // Should not have obvious syntax errors
    let open_braces = result.matches('{').count();
    let close_braces = result.matches('}').count();
    assert_eq!(
        open_braces, close_braces,
        "Braces should be balanced: {} open, {} close",
        open_braces, close_braces
    );

    // Should not have excessive semicolons
    assert!(!result.contains(";;;;"), "Should not have excessive semicolons");
}

#[test]
fn test_loop_array_safety_documentation() {
    // If unsafe is used, it should be documented
    let c_code = r#"
        int main() {
            int array[5] = {10, 20, 30, 40, 50};
            int sum = 0;

            for (int i = 0; i < 5; i++) {
                sum += array[i];
            }

            return sum;
        }
    "#;

    let result = transpile(c_code).expect("Should transpile");

    // Generated code should be reasonable
    assert!(result.contains("fn main"), "Should have main function");

    // If unsafe blocks exist, they should be minimal
    let unsafe_count = result.matches("unsafe").count();
    assert!(unsafe_count < 10, "Should have minimal unsafe blocks (found {})", unsafe_count);
}