| /linux/rust/syn/ |
| H A D | op.rs | 7 pub enum BinOp {
84 use crate::op::{BinOp, UnOp};
88 impl Parse for BinOp { implementation
91 input.parse().map(BinOp::AddAssign) in parse()
93 input.parse().map(BinOp::SubAssign) in parse()
95 input.parse().map(BinOp::MulAssign) in parse()
97 input.parse().map(BinOp::DivAssign) in parse()
99 input.parse().map(BinOp::RemAssign) in parse()
101 input.parse().map(BinOp::BitXorAssign) in parse()
103 input.parse().map(BinOp::BitAndAssign) in parse()
[all …]
|
| H A D | precedence.rs | 14 use crate::op::BinOp;
61 pub(crate) fn of_binop(op: &BinOp) -> Self { in of_binop()
63 BinOp::Add(_) | BinOp::Sub(_) => Precedence::Sum, in of_binop()
64 BinOp::Mul(_) | BinOp::Div(_) | BinOp::Rem(_) => Precedence::Product, in of_binop()
65 BinOp::And(_) => Precedence::And, in of_binop()
66 BinOp::Or(_) => Precedence::Or, in of_binop()
67 BinOp::BitXor(_) => Precedence::BitXor, in of_binop()
68 BinOp::BitAnd(_) => Precedence::BitAnd, in of_binop()
69 BinOp::BitOr(_) => Precedence::BitOr, in of_binop()
70 BinOp::Shl(_) | BinOp::Shr(_) => Precedence::Shift, in of_binop()
[all …]
|
| H A D | scan_expr.rs | 6 use syn::{AngleBracketedGenericArguments, BinOp, Expr, ExprPath, Lifetime, Lit, Token, Type};
223 Input::ConsumeBinOp => input.parse::<BinOp>().is_ok(), in scan_expr()
|
| H A D | expr.rs | 15 use crate::op::{BinOp, UnOp};
320 pub op: BinOp,
1200 use crate::op::BinOp;
1323 } else if let Ok(op) = ahead.parse::<BinOp>() { in parse_expr()
1396 if let Ok(op) = ahead.parse::<BinOp>() { in parse_expr()
3142 use crate::op::BinOp;
3387 BinOp::Sub(_) in print_expr_binary()
3388 | BinOp::Mul(_) in print_expr_binary()
3389 | BinOp::And(_) in print_expr_binary()
3390 | BinOp::Or(_) in print_expr_binary()
[all …]
|
| H A D | lib.rs | 470 pub use crate::op::{BinOp, UnOp};
|
| /linux/rust/syn/gen/ |
| H A D | eq.rs | 107 impl Eq for crate::BinOp {} implementation
110 impl PartialEq for crate::BinOp { implementation
113 (crate::BinOp::Add(_), crate::BinOp::Add(_)) => true, in eq()
114 (crate::BinOp::Sub(_), crate::BinOp::Sub(_)) => true, in eq()
115 (crate::BinOp::Mul(_), crate::BinOp::Mul(_)) => true, in eq()
116 (crate::BinOp::Div(_), crate::BinOp::Div(_)) => true, in eq()
117 (crate::BinOp::Rem(_), crate::BinOp::Rem(_)) => true, in eq()
118 (crate::BinOp::And(_), crate::BinOp::And(_)) => true, in eq()
119 (crate::BinOp::Or(_), crate::BinOp::Or(_)) => true, in eq()
120 (crate::BinOp::BitXor(_), crate::BinOp::BitXor(_)) => true, in eq()
[all …]
|
| H A D | fold.rs | 85 fn fold_bin_op(&mut self, i: crate::BinOp) -> crate::BinOp { in fold_bin_op() argument
1147 pub fn fold_bin_op<F>(f: &mut F, node: crate::BinOp) -> crate::BinOp in fold_bin_op()
1152 crate::BinOp::Add(_binding_0) => crate::BinOp::Add(_binding_0), in fold_bin_op()
1153 crate::BinOp::Sub(_binding_0) => crate::BinOp::Sub(_binding_0), in fold_bin_op()
1154 crate::BinOp::Mul(_binding_0) => crate::BinOp::Mul(_binding_0), in fold_bin_op()
1155 crate::BinOp::Div(_binding_0) => crate::BinOp::Div(_binding_0), in fold_bin_op()
1156 crate::BinOp::Rem(_binding_0) => crate::BinOp::Rem(_binding_0), in fold_bin_op()
1157 crate::BinOp::And(_binding_0) => crate::BinOp::And(_binding_0), in fold_bin_op()
1158 crate::BinOp::Or(_binding_0) => crate::BinOp::Or(_binding_0), in fold_bin_op()
1159 crate::BinOp::BitXor(_binding_0) => crate::BinOp::BitXor(_binding_0), in fold_bin_op()
[all …]
|
| H A D | hash.rs | 122 impl Hash for crate::BinOp { implementation
128 crate::BinOp::Add(_) => { in hash()
131 crate::BinOp::Sub(_) => { in hash()
134 crate::BinOp::Mul(_) => { in hash()
137 crate::BinOp::Div(_) => { in hash()
140 crate::BinOp::Rem(_) => { in hash()
143 crate::BinOp::And(_) => { in hash()
146 crate::BinOp::Or(_) => { in hash()
149 crate::BinOp::BitXor(_) => { in hash()
152 crate::BinOp::BitAnd(_) => { in hash()
[all …]
|
| H A D | debug.rs | 126 impl Debug for crate::BinOp { implementation
130 crate::BinOp::Add(v0) => { in fmt()
135 crate::BinOp::Sub(v0) => { in fmt()
140 crate::BinOp::Mul(v0) => { in fmt()
145 crate::BinOp::Div(v0) => { in fmt()
150 crate::BinOp::Rem(v0) => { in fmt()
155 crate::BinOp::And(v0) => { in fmt()
160 crate::BinOp::Or(v0) => { in fmt()
165 crate::BinOp::BitXor(v0) => { in fmt()
170 crate::BinOp::BitAnd(v0) => { in fmt()
[all …]
|
| H A D | visit_mut.rs | 89 fn visit_bin_op_mut(&mut self, i: &mut crate::BinOp) { in visit_bin_op_mut() argument
1079 pub fn visit_bin_op_mut<V>(v: &mut V, node: &mut crate::BinOp) in visit_bin_op_mut()
1084 crate::BinOp::Add(_binding_0) => { in visit_bin_op_mut()
1087 crate::BinOp::Sub(_binding_0) => { in visit_bin_op_mut()
1090 crate::BinOp::Mul(_binding_0) => { in visit_bin_op_mut()
1093 crate::BinOp::Div(_binding_0) => { in visit_bin_op_mut()
1096 crate::BinOp::Rem(_binding_0) => { in visit_bin_op_mut()
1099 crate::BinOp::And(_binding_0) => { in visit_bin_op_mut()
1102 crate::BinOp::Or(_binding_0) => { in visit_bin_op_mut()
1105 crate::BinOp::BitXor(_binding_0) => { in visit_bin_op_mut()
[all …]
|
| H A D | visit.rs | 81 fn visit_bin_op(&mut self, i: &'ast crate::BinOp) { in visit_bin_op() argument
1077 pub fn visit_bin_op<'ast, V>(v: &mut V, node: &'ast crate::BinOp) in visit_bin_op()
1082 crate::BinOp::Add(_binding_0) => { in visit_bin_op()
1085 crate::BinOp::Sub(_binding_0) => { in visit_bin_op()
1088 crate::BinOp::Mul(_binding_0) => { in visit_bin_op()
1091 crate::BinOp::Div(_binding_0) => { in visit_bin_op()
1094 crate::BinOp::Rem(_binding_0) => { in visit_bin_op()
1097 crate::BinOp::And(_binding_0) => { in visit_bin_op()
1100 crate::BinOp::Or(_binding_0) => { in visit_bin_op()
1103 crate::BinOp::BitXor(_binding_0) => { in visit_bin_op()
[all …]
|
| H A D | clone.rs | 114 impl Copy for crate::BinOp {} implementation
117 impl Clone for crate::BinOp { implementation
|