misc. whitespace and comment cleanup

diff --git a/decode.scm b/decode.scm
index 57c87d403164bf7037cf9dcee4c556388a0d901f..f1894727d2befbbe89748566eff2716b1c57fbb1 100644 (file)
--- a/decode.scm
+++ b/decode.scm
@@ -212,13 +212,13 @@
        ))
 )
 
-
 ; Compute population counts for each bit.  Return it as a vector indexed by bit number.
 ; Rather than computing raw popularity, attempt to compute "disinguishing value" or
 ; inverse-entropy for each bit.  The idea is that the larger the number for any particular
 ; bit slot, the more instructions it can be used to distinguish.  Raw mask popularity
 ; is not enough -- popular masks may include useless "reserved" fields whose values
 ; don't change, and thus are useless in distinguishing.
+
 (define (-distinguishing-bit-population masks mask-lens values lsb0?)
   (let* ((max-length (apply max mask-lens))
         (0-population (make-vector max-length 0))
@@ -263,8 +263,8 @@
          (vector->list 0-population) (vector->list 1-population))))
 )
 
-
 ; Return a list (0 ... limit-1)
+
 (define (-range limit)
   (let loop ((i 0)
             (indices (list)))
@@ -272,14 +272,16 @@
 )
 
 ; Return a list (base ... base+size-1)
+
 (define (-range2 base size)
   (let loop ((i base)
             (indices (list)))
     (if (= i (+ base size)) (reverse indices) (loop (+ i 1) (cons i indices))))
 )
 
+; Return a copy of given vector, with all entries with given indices set
+; to `value'
 
-; Return a copy of given vector, with all entries with given indices set to `value'
 (define (-vector-copy-set-all vector indices value)
   (let ((new-vector (make-vector (vector-length vector))))
     (for-each (lambda (index)
@@ -290,9 +292,10 @@
     new-vector)
 )
 
-
-; Return a list of indices whose counts in the given vector exceed the given threshold.
+; Return a list of indices whose counts in the given vector exceed the given
+; threshold.
 ; Sort them in decreasing order of populatority.
+
 (define (-population-above-threshold population threshold)
   (let* ((unsorted
          (find (lambda (index) (if (vector-ref population index) 
@@ -305,10 +308,10 @@
     sorted)
 )
 
-
 ; Return the top few most popular indices in the population vector,
 ; ignoring any that are already used (marked by #f).  Don't exceed
 ; `size' unless the clustering is just too good to pass up.
+
 (define (-population-top-few population size)
   (let loop ((old-picks (list))
             (remaining-population population)
@@ -346,8 +349,6 @@
                (* 0.75 count-threshold))))))
 )
 
-
-
 ; Given list of insns, return list of bit numbers of constant bits in opcode
 ; that they all share (or mostly share), up to MAX elements.
 ; ALREADY-USED is a list of bitnums we can't use.
@@ -397,7 +398,6 @@
     sorted-indices)
 )
 
-
 (define (OLDdecode-get-best-bits insn-list already-used startbit max decode-bitsize lsb0?)
   (let ((masks (map insn-base-mask insn-list))
        ; ??? We assume mask lengths are repeatedly used for insns longer

diff --git a/html.scm b/html.scm
index 58335e11339381461efc8f57f095cf90769c0682..8fb1833f8acf5b57a6205dcddb60973834f7b09f 100644 (file)
--- a/html.scm
+++ b/html.scm
@@ -24,8 +24,6 @@
 ;   including generic cgen documentation here
 ; - function units, timing, etc.
 ; - instruction framing
-; - ARM docs mix arm/thumb, should be separate,
-;   first try to split using keep-isa
 
 ; Global state variables.
 

diff --git a/insn.scm b/insn.scm
index f3ec7935690006fe5ef28757fa4825fdcde9e7e8..6cb606a5783176054e65ba560305f8af899c8b18 100644 (file)
--- a/insn.scm
+++ b/insn.scm
@@ -705,7 +705,6 @@
   (find (lambda (insn) (not (multi-insn? insn))) insn-list)
 )
 
-
 ; Filter out instructions whose ifield patterns are strict supersets of
 ; another, keeping the less general cousin.  Used to resolve ambiguity
 ; when there are no more bits to consider.

diff --git a/sid-decode.scm b/sid-decode.scm
index b07c272dcb07efe7316bc1891bb86864ebdcbeee..d1d3280d6966651661b1df9ef51d04062d773a54 100644 (file)
--- a/sid-decode.scm
+++ b/sid-decode.scm
@@ -617,9 +617,6 @@ static void
 ; build the first decode table.  If nil, we compute 8 bits of it (FIXME)
 ; ourselves.
 ; LSB0? is non-#f if bit number 0 is the least significant bit.
-; FIXME: Need to be perfect for every subtable, or allow target more control.
-; Leave for later (and don't give target more control until oodles of effort
-; have been spent trying to be perfect! ... or close enough).
 
 (define (-gen-decode-fn insn-list initial-bitnums lsb0?)
   (assert (with-scache?))
@@ -635,7 +632,8 @@ static void
     ; 0 is passed for the start bit (it is independent of lsb0?)
     (if (null? initial-bitnums)
        (set! initial-bitnums
-             (if (= 0 (length insn-list)) (list 0) ; dummy value
+             (if (= 0 (length insn-list))
+                 (list 0) ; dummy value
                  (decode-get-best-bits insn-list nil
                                        0 ; startbit
                                        8 ; max

diff --git a/sim-decode.scm b/sim-decode.scm
index 8759f6d0a18936437c0e08739955d58b9f9dee63..a4e620aa031192d963b44b554d3e3505f4cac69b 100644 (file)
--- a/sim-decode.scm
+++ b/sim-decode.scm
@@ -466,9 +466,6 @@ void
 ; build the first decode table.  If nil, we compute 8 bits of it (FIXME)
 ; ourselves.
 ; LSB0? is non-#f if bit number 0 is the least significant bit.
-; FIXME: Need to be perfect for every subtable, or allow target more control.
-; Leave for later (and don't give target more control until oodles of effort
-; have been spent trying to be perfect! ... or close enough).
 
 (define (-gen-decode-fn insn-list initial-bitnums lsb0?)