1 use crate::abi::call::{FnAbi, ArgAbi, Reg, RegKind, Uniform};
2 use crate::abi::{HasDataLayout, LayoutOf, TyLayout, TyLayoutMethods};
4 fn is_homogeneous_aggregate<'a, Ty, C>(cx: &C, arg: &mut ArgAbi<'a, Ty>)
6 where Ty: TyLayoutMethods<'a, C> + Copy,
7 C: LayoutOf<Ty = Ty, TyLayout = TyLayout<'a, Ty>> + HasDataLayout
9 arg.layout.homogeneous_aggregate(cx).unit().and_then(|unit| {
10 let size = arg.layout.size;
12 // Ensure we have at most four uniquely addressable members.
13 if size > unit.size.checked_mul(4, cx).unwrap() {
17 let valid_unit = match unit.kind {
18 RegKind::Integer => false,
19 RegKind::Float => true,
20 RegKind::Vector => size.bits() == 64 || size.bits() == 128
23 valid_unit.then_some(Uniform { unit, total: size })
27 fn classify_ret<'a, Ty, C>(cx: &C, ret: &mut ArgAbi<'a, Ty>)
28 where Ty: TyLayoutMethods<'a, C> + Copy,
29 C: LayoutOf<Ty = Ty, TyLayout = TyLayout<'a, Ty>> + HasDataLayout
31 if !ret.layout.is_aggregate() {
32 ret.extend_integer_width_to(32);
35 if let Some(uniform) = is_homogeneous_aggregate(cx, ret) {
39 let size = ret.layout.size;
40 let bits = size.bits();
42 let unit = if bits <= 8 {
44 } else if bits <= 16 {
46 } else if bits <= 32 {
61 fn classify_arg<'a, Ty, C>(cx: &C, arg: &mut ArgAbi<'a, Ty>)
62 where Ty: TyLayoutMethods<'a, C> + Copy,
63 C: LayoutOf<Ty = Ty, TyLayout = TyLayout<'a, Ty>> + HasDataLayout
65 if !arg.layout.is_aggregate() {
66 arg.extend_integer_width_to(32);
69 if let Some(uniform) = is_homogeneous_aggregate(cx, arg) {
73 let size = arg.layout.size;
74 let bits = size.bits();
76 let unit = if bits <= 8 {
78 } else if bits <= 16 {
80 } else if bits <= 32 {
95 pub fn compute_abi_info<'a, Ty, C>(cx: &C, fn_abi: &mut FnAbi<'a, Ty>)
96 where Ty: TyLayoutMethods<'a, C> + Copy,
97 C: LayoutOf<Ty = Ty, TyLayout = TyLayout<'a, Ty>> + HasDataLayout
99 if !fn_abi.ret.is_ignore() {
100 classify_ret(cx, &mut fn_abi.ret);
103 for arg in &mut fn_abi.args {
104 if arg.is_ignore() { continue; }
105 classify_arg(cx, arg);