@@ -16,17 +16,19 @@ use rustc_hir::RangeEnd;
16
16
use rustc_index:: newtype_index;
17
17
use rustc_index:: IndexVec ;
18
18
use rustc_middle:: middle:: region;
19
- use rustc_middle:: mir:: interpret:: AllocId ;
19
+ use rustc_middle:: mir:: interpret:: { AllocId , Scalar } ;
20
20
use rustc_middle:: mir:: { self , BinOp , BorrowKind , FakeReadCause , Mutability , UnOp } ;
21
21
use rustc_middle:: ty:: adjustment:: PointerCoercion ;
22
+ use rustc_middle:: ty:: layout:: IntegerExt ;
22
23
use rustc_middle:: ty:: {
23
24
self , AdtDef , CanonicalUserType , CanonicalUserTypeAnnotation , FnSig , GenericArgsRef , List , Ty ,
24
- UpvarArgs ,
25
+ TyCtxt , UpvarArgs ,
25
26
} ;
26
27
use rustc_span:: def_id:: LocalDefId ;
27
28
use rustc_span:: { sym, ErrorGuaranteed , Span , Symbol , DUMMY_SP } ;
28
- use rustc_target:: abi:: { FieldIdx , VariantIdx } ;
29
+ use rustc_target:: abi:: { FieldIdx , Integer , Size , VariantIdx } ;
29
30
use rustc_target:: asm:: InlineAsmRegOrRegClass ;
31
+ use std:: cmp:: Ordering ;
30
32
use std:: fmt;
31
33
use std:: ops:: Index ;
32
34
@@ -793,12 +795,217 @@ pub enum PatKind<'tcx> {
793
795
Error ( ErrorGuaranteed ) ,
794
796
}
795
797
798
+ /// A range pattern.
799
+ /// The boundaries must be of the same type and that type must be numeric.
796
800
#[ derive( Clone , Debug , PartialEq , HashStable , TypeVisitable ) ]
797
801
pub struct PatRange < ' tcx > {
798
- pub lo : mir :: Const < ' tcx > ,
799
- pub hi : mir :: Const < ' tcx > ,
802
+ pub lo : PatRangeBoundary < ' tcx > ,
803
+ pub hi : PatRangeBoundary < ' tcx > ,
800
804
#[ type_visitable( ignore) ]
801
805
pub end : RangeEnd ,
806
+ pub ty : Ty < ' tcx > ,
807
+ }
808
+
809
+ impl < ' tcx > PatRange < ' tcx > {
810
+ /// Whether this range covers the full extent of possible values (best-effort, we ignore floats).
811
+ #[ inline]
812
+ pub fn is_full_range ( & self , tcx : TyCtxt < ' tcx > ) -> Option < bool > {
813
+ let ( min, max, size, bias) = match * self . ty . kind ( ) {
814
+ ty:: Char => ( 0 , std:: char:: MAX as u128 , Size :: from_bits ( 32 ) , 0 ) ,
815
+ ty:: Int ( ity) => {
816
+ let size = Integer :: from_int_ty ( & tcx, ity) . size ( ) ;
817
+ let max = size. truncate ( u128:: MAX ) ;
818
+ let bias = 1u128 << ( size. bits ( ) - 1 ) ;
819
+ ( 0 , max, size, bias)
820
+ }
821
+ ty:: Uint ( uty) => {
822
+ let size = Integer :: from_uint_ty ( & tcx, uty) . size ( ) ;
823
+ let max = size. unsigned_int_max ( ) ;
824
+ ( 0 , max, size, 0 )
825
+ }
826
+ _ => return None ,
827
+ } ;
828
+
829
+ // We want to compare ranges numerically, but the order of the bitwise representation of
830
+ // signed integers does not match their numeric order. Thus, to correct the ordering, we
831
+ // need to shift the range of signed integers to correct the comparison. This is achieved by
832
+ // XORing with a bias (see pattern/deconstruct_pat.rs for another pertinent example of this
833
+ // pattern).
834
+ //
835
+ // Also, for performance, it's important to only do the second `try_to_bits` if necessary.
836
+ let lo_is_min = match self . lo {
837
+ PatRangeBoundary :: Finite ( value) => {
838
+ let lo = value. try_to_bits ( size) . unwrap ( ) ^ bias;
839
+ lo <= min
840
+ }
841
+ } ;
842
+ if lo_is_min {
843
+ let hi_is_max = match self . hi {
844
+ PatRangeBoundary :: Finite ( value) => {
845
+ let hi = value. try_to_bits ( size) . unwrap ( ) ^ bias;
846
+ hi > max || hi == max && self . end == RangeEnd :: Included
847
+ }
848
+ } ;
849
+ if hi_is_max {
850
+ return Some ( true ) ;
851
+ }
852
+ }
853
+ Some ( false )
854
+ }
855
+
856
+ #[ inline]
857
+ pub fn contains (
858
+ & self ,
859
+ value : mir:: Const < ' tcx > ,
860
+ tcx : TyCtxt < ' tcx > ,
861
+ param_env : ty:: ParamEnv < ' tcx > ,
862
+ ) -> Option < bool > {
863
+ use Ordering :: * ;
864
+ debug_assert_eq ! ( self . ty, value. ty( ) ) ;
865
+ let ty = self . ty ;
866
+ let value = PatRangeBoundary :: Finite ( value) ;
867
+ // For performance, it's important to only do the second comparison if necessary.
868
+ Some (
869
+ match self . lo . compare_with ( value, ty, tcx, param_env) ? {
870
+ Less | Equal => true ,
871
+ Greater => false ,
872
+ } && match value. compare_with ( self . hi , ty, tcx, param_env) ? {
873
+ Less => true ,
874
+ Equal => self . end == RangeEnd :: Included ,
875
+ Greater => false ,
876
+ } ,
877
+ )
878
+ }
879
+
880
+ #[ inline]
881
+ pub fn overlaps (
882
+ & self ,
883
+ other : & Self ,
884
+ tcx : TyCtxt < ' tcx > ,
885
+ param_env : ty:: ParamEnv < ' tcx > ,
886
+ ) -> Option < bool > {
887
+ use Ordering :: * ;
888
+ debug_assert_eq ! ( self . ty, other. ty) ;
889
+ // For performance, it's important to only do the second comparison if necessary.
890
+ Some (
891
+ match other. lo . compare_with ( self . hi , self . ty , tcx, param_env) ? {
892
+ Less => true ,
893
+ Equal => self . end == RangeEnd :: Included ,
894
+ Greater => false ,
895
+ } && match self . lo . compare_with ( other. hi , self . ty , tcx, param_env) ? {
896
+ Less => true ,
897
+ Equal => other. end == RangeEnd :: Included ,
898
+ Greater => false ,
899
+ } ,
900
+ )
901
+ }
902
+ }
903
+
904
+ impl < ' tcx > fmt:: Display for PatRange < ' tcx > {
905
+ fn fmt ( & self , f : & mut fmt:: Formatter < ' _ > ) -> fmt:: Result {
906
+ let PatRangeBoundary :: Finite ( value) = & self . lo ;
907
+ write ! ( f, "{value}" ) ?;
908
+ write ! ( f, "{}" , self . end) ?;
909
+ let PatRangeBoundary :: Finite ( value) = & self . hi ;
910
+ write ! ( f, "{value}" ) ?;
911
+ Ok ( ( ) )
912
+ }
913
+ }
914
+
915
+ /// A (possibly open) boundary of a range pattern.
916
+ /// If present, the const must be of a numeric type.
917
+ #[ derive( Copy , Clone , Debug , PartialEq , HashStable , TypeVisitable ) ]
918
+ pub enum PatRangeBoundary < ' tcx > {
919
+ Finite ( mir:: Const < ' tcx > ) ,
920
+ }
921
+
922
+ impl < ' tcx > PatRangeBoundary < ' tcx > {
923
+ #[ inline]
924
+ pub fn lower_bound ( ty : Ty < ' tcx > , tcx : TyCtxt < ' tcx > ) -> Self {
925
+ // Unwrap is ok because the type is known to be numeric.
926
+ let c = ty. numeric_min_val ( tcx) . unwrap ( ) ;
927
+ let value = mir:: Const :: from_ty_const ( c, tcx) ;
928
+ Self :: Finite ( value)
929
+ }
930
+ #[ inline]
931
+ pub fn upper_bound ( ty : Ty < ' tcx > , tcx : TyCtxt < ' tcx > ) -> Self {
932
+ // Unwrap is ok because the type is known to be numeric.
933
+ let c = ty. numeric_max_val ( tcx) . unwrap ( ) ;
934
+ let value = mir:: Const :: from_ty_const ( c, tcx) ;
935
+ Self :: Finite ( value)
936
+ }
937
+
938
+ #[ inline]
939
+ pub fn to_const ( self , _ty : Ty < ' tcx > , _tcx : TyCtxt < ' tcx > ) -> mir:: Const < ' tcx > {
940
+ match self {
941
+ Self :: Finite ( value) => value,
942
+ }
943
+ }
944
+ pub fn eval_bits (
945
+ self ,
946
+ _ty : Ty < ' tcx > ,
947
+ tcx : TyCtxt < ' tcx > ,
948
+ param_env : ty:: ParamEnv < ' tcx > ,
949
+ ) -> u128 {
950
+ match self {
951
+ Self :: Finite ( value) => value. eval_bits ( tcx, param_env) ,
952
+ }
953
+ }
954
+
955
+ #[ instrument( skip( tcx, param_env) , level = "debug" , ret) ]
956
+ pub fn compare_with (
957
+ self ,
958
+ other : Self ,
959
+ ty : Ty < ' tcx > ,
960
+ tcx : TyCtxt < ' tcx > ,
961
+ param_env : ty:: ParamEnv < ' tcx > ,
962
+ ) -> Option < Ordering > {
963
+ use PatRangeBoundary :: * ;
964
+ match ( self , other) {
965
+ // This code is hot when compiling matches with many ranges. So we
966
+ // special-case extraction of evaluated scalars for speed, for types where
967
+ // raw data comparisons are appropriate. E.g. `unicode-normalization` has
968
+ // many ranges such as '\u{037A}'..='\u{037F}', and chars can be compared
969
+ // in this way.
970
+ ( Finite ( mir:: Const :: Ty ( a) ) , Finite ( mir:: Const :: Ty ( b) ) )
971
+ if matches ! ( ty. kind( ) , ty:: Uint ( _) | ty:: Char ) =>
972
+ {
973
+ return Some ( a. kind ( ) . cmp ( & b. kind ( ) ) ) ;
974
+ }
975
+ (
976
+ Finite ( mir:: Const :: Val ( mir:: ConstValue :: Scalar ( Scalar :: Int ( a) ) , _) ) ,
977
+ Finite ( mir:: Const :: Val ( mir:: ConstValue :: Scalar ( Scalar :: Int ( b) ) , _) ) ,
978
+ ) if matches ! ( ty. kind( ) , ty:: Uint ( _) | ty:: Char ) => return Some ( a. cmp ( & b) ) ,
979
+ _ => { }
980
+ }
981
+
982
+ let a = self . eval_bits ( ty, tcx, param_env) ;
983
+ let b = other. eval_bits ( ty, tcx, param_env) ;
984
+
985
+ match ty. kind ( ) {
986
+ ty:: Float ( ty:: FloatTy :: F32 ) => {
987
+ use rustc_apfloat:: Float ;
988
+ let a = rustc_apfloat:: ieee:: Single :: from_bits ( a) ;
989
+ let b = rustc_apfloat:: ieee:: Single :: from_bits ( b) ;
990
+ a. partial_cmp ( & b)
991
+ }
992
+ ty:: Float ( ty:: FloatTy :: F64 ) => {
993
+ use rustc_apfloat:: Float ;
994
+ let a = rustc_apfloat:: ieee:: Double :: from_bits ( a) ;
995
+ let b = rustc_apfloat:: ieee:: Double :: from_bits ( b) ;
996
+ a. partial_cmp ( & b)
997
+ }
998
+ ty:: Int ( ity) => {
999
+ use rustc_middle:: ty:: layout:: IntegerExt ;
1000
+ let size = rustc_target:: abi:: Integer :: from_int_ty ( & tcx, * ity) . size ( ) ;
1001
+ let a = size. sign_extend ( a) as i128 ;
1002
+ let b = size. sign_extend ( b) as i128 ;
1003
+ Some ( a. cmp ( & b) )
1004
+ }
1005
+ ty:: Uint ( _) | ty:: Char => Some ( a. cmp ( & b) ) ,
1006
+ _ => bug ! ( ) ,
1007
+ }
1008
+ }
802
1009
}
803
1010
804
1011
impl < ' tcx > fmt:: Display for Pat < ' tcx > {
@@ -924,11 +1131,7 @@ impl<'tcx> fmt::Display for Pat<'tcx> {
924
1131
write ! ( f, "{subpattern}" )
925
1132
}
926
1133
PatKind :: Constant { value } => write ! ( f, "{value}" ) ,
927
- PatKind :: Range ( box PatRange { lo, hi, end } ) => {
928
- write ! ( f, "{lo}" ) ?;
929
- write ! ( f, "{end}" ) ?;
930
- write ! ( f, "{hi}" )
931
- }
1134
+ PatKind :: Range ( ref range) => write ! ( f, "{range}" ) ,
932
1135
PatKind :: Slice { ref prefix, ref slice, ref suffix }
933
1136
| PatKind :: Array { ref prefix, ref slice, ref suffix } => {
934
1137
write ! ( f, "[" ) ?;
0 commit comments