mirror/guile
mirror/guile
1
Fork 0
mirror of https://git.savannah.gnu.org/git/guile.git synced 2025-06-10 14:00:21 +02:00
Code Activity

Slower range saturation in type inference

Browse source 
* module/language/cps/types.scm (*max-size-t*): New definition.
  (type-entry-saturating-union): Saturate more slowly, first stopping at
  [0,*max-size-t*] then at [&range-min, &range-max] before saturating to
  [-inf.0, +inf.0].  This allows most offset phi variables to have their
  range inferred within the u64 range.
This commit is contained in:
Andy Wingo 2015-11-20 13:23:32 +01:00
parent d294d5d1e1
commit 672853657c
1 changed files with 19 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

21
module/language/cps/types.scm
View file

@ -206,6 +206,15 @@
(define-compile-time-value &range-min (- #x8000000000000000))
(define-compile-time-value &range-max #xffffFFFFffffFFFF)
;; This is a hack that takes advantage of knowing that
;; most-positive-fixnum is the size of a word, but with two tag bits and
;; one sign bit. We also assume that the current common architectural
;; restriction of a maximum 48-bit address space means that we won't see
;; a size_t value above 2^48.
(define *max-size-t*
(min (+ (ash most-positive-fixnum 3) #b111)
(1- (ash 1 48))))
(define-inlinable (make-unclamped-type-entry type min max)
(vector type min max))
(define-inlinable (type-entry-type tentry)
@ -271,10 +280,18 @@
(logior (type-entry-type a) (type-entry-type b))
(let ((a-min (type-entry-min a))
(b-min (type-entry-min b)))
(if (< b-min a-min) -inf.0 a-min))
(cond
((not (< b-min a-min)) a-min)
((> 0 b-min) 0)
((> &range-min b-min) &range-min)
(else -inf.0)))
(let ((a-max (type-entry-max a))
(b-max (type-entry-max b)))
(if (> b-max a-max) +inf.0 a-max))))))
(cond
((not (> b-max a-max)) a-max)
((> *max-size-t* b-max) *max-size-t*)
((> &range-max b-max) &range-max)
(else +inf.0)))))))
(define (type-entry-intersection a b)
(cond