|
| 1 | +extern crate libcc2rs; |
| 2 | +use libcc2rs::*; |
| 3 | +use std::cell::RefCell; |
| 4 | +use std::collections::BTreeMap; |
| 5 | +use std::io::prelude::*; |
| 6 | +use std::io::Seek; |
| 7 | +use std::io::{Read, Write}; |
| 8 | +use std::os::fd::AsFd; |
| 9 | +use std::rc::{Rc, Weak}; |
| 10 | +pub fn extract_nth_0(n: i32, ap: VaList) -> i32 { |
| 11 | + let n: Value<i32> = Rc::new(RefCell::new(n)); |
| 12 | + let ap: Value<VaList> = Rc::new(RefCell::new(ap)); |
| 13 | + let i: Value<i32> = Rc::new(RefCell::new(0)); |
| 14 | + 'loop_: while ((*i.borrow()) < (*n.borrow())) { |
| 15 | + (*ap.borrow_mut()).arg::<i32>(); |
| 16 | + (*i.borrow_mut()).postfix_inc(); |
| 17 | + } |
| 18 | + return ((*ap.borrow_mut()).arg::<i32>()).clone(); |
| 19 | +} |
| 20 | +pub fn middle_layer_1(n: i32, ap: VaList) -> i32 { |
| 21 | + let n: Value<i32> = Rc::new(RefCell::new(n)); |
| 22 | + let ap: Value<VaList> = Rc::new(RefCell::new(ap)); |
| 23 | + return ({ |
| 24 | + let _n: i32 = (*n.borrow()); |
| 25 | + let _ap: VaList = (*ap.borrow()).clone(); |
| 26 | + extract_nth_0(_n, _ap) |
| 27 | + }); |
| 28 | +} |
| 29 | +pub fn top_level_2(n: i32, args: &[VaArg]) -> i32 { |
| 30 | + let n: Value<i32> = Rc::new(RefCell::new(n)); |
| 31 | + let ap: Value<VaList> = Rc::new(RefCell::new(<VaList>::default())); |
| 32 | + (*ap.borrow_mut()) = VaList::new(args); |
| 33 | + let result: Value<i32> = Rc::new(RefCell::new( |
| 34 | + ({ |
| 35 | + let _n: i32 = (*n.borrow()); |
| 36 | + let _ap: VaList = (*ap.borrow()).clone(); |
| 37 | + middle_layer_1(_n, _ap) |
| 38 | + }), |
| 39 | + )); |
| 40 | + return (*result.borrow()); |
| 41 | +} |
| 42 | +pub fn main() { |
| 43 | + std::process::exit(main_0()); |
| 44 | +} |
| 45 | +fn main_0() -> i32 { |
| 46 | + assert!( |
| 47 | + (({ |
| 48 | + let _n: i32 = 2; |
| 49 | + top_level_2(_n, &[100.into(), 200.into(), 300.into(), 400.into()]) |
| 50 | + }) == 300) |
| 51 | + ); |
| 52 | + assert!( |
| 53 | + (({ |
| 54 | + let _n: i32 = 0; |
| 55 | + top_level_2(_n, &[42.into(), 99.into()]) |
| 56 | + }) == 42) |
| 57 | + ); |
| 58 | + assert!( |
| 59 | + (({ |
| 60 | + let _n: i32 = 3; |
| 61 | + top_level_2(_n, &[1.into(), 2.into(), 3.into(), 4.into()]) |
| 62 | + }) == 4) |
| 63 | + ); |
| 64 | + return 0; |
| 65 | +} |
0 commit comments