Index: common.scm
==================================================================
--- common.scm
+++ common.scm
@@ -521,12 +521,14 @@
     (7 "REMOTEHOSTSTART")
     (8 "RUNNING")
     ))
 
 ;; BBnote: *common:std-statuses* dashboard filter control and test control status buttons defined here; used in set-fields-panel and dboard:make-controls
+;; note these statuses are sorted from better to worse.
+;; This sort order is important to dcommon:status-compare3 and db:set-state-status-and-roll-up-items
 (define *common:std-statuses*
-  '(;; (0 "DELETED")
+  '(;; (0 "DELETED")  
     (1 "n/a")
     (2 "PASS")
     (3 "SKIP")
     (4 "WARN")
     (5 "WAIVED")

Index: db.scm
==================================================================
--- db.scm
+++ db.scm
@@ -1527,11 +1527,11 @@
 	 (toplevels   '())
 	 (deadtime-str (configf:lookup *configdat* "setup" "deadtime"))
 	 (deadtime     (if (and deadtime-str
 				(string->number deadtime-str))
 			   (string->number deadtime-str)
-			   7200))) ;; two hours
+			   72000))) ;; twenty hours
     (db:with-db
      dbstruct #f #f
      (lambda (db)
        (if (number? ovr-deadtime)(set! deadtime ovr-deadtime))
        

Index: dcommon.scm
==================================================================
--- dcommon.scm
+++ dcommon.scm
@@ -334,11 +334,14 @@
 ;; return 1 if status1 is better
 ;; return 0 if status1 and 2 are equally good
 ;; return -1 if status2 is better
 (define (dcommon:status-compare3 status1 status2)
   (let*
-      ((status-goodness-ranking  (list "PASS" "WARN" "WAIVED" "SKIP" "FAIL" "ABORT" #f))
+      ((status-goodness-ranking  (cdr ;; cdr to drop first item -- "n/a"
+                                  (append (map cadr *common:std-statuses*)
+                                          '(#f)) ;; algorithm requres last item to be #f
+                                  )  )
        (mem1 (member status1 status-goodness-ranking))
        (mem2 (member status2 status-goodness-ranking))
        )
     (cond
      ((and (not mem1) (not mem2)) 0)

Index: runs.scm
==================================================================
--- runs.scm
+++ runs.scm
@@ -1501,20 +1501,20 @@
                 (for-each (lambda (my-itemdat)
                             (let* ((new-test-record (let ((newrec (make-tests:testqueue)))
                                                       (vector-copy! test-record newrec)
                                                       newrec))
                                    (my-item-path (item-list->path my-itemdat))
+
                                    (newtestname (db:test-make-full-name hed my-item-path)))    ;; test names are unique on testname/item-path
                               (tests:testqueue-set-items!     new-test-record #f)
                             (tests:testqueue-set-itemdat!   new-test-record my-itemdat)
                             (tests:testqueue-set-item_path! new-test-record my-item-path)
                             (hash-table-set! test-records newtestname new-test-record)
                             (set! tal (append tal (list newtestname)))))  ;; since these are itemized create new test names testname/itempath
                           items-in-testpatt)))
                           
             
-
 
 	  ;; At this point we have possibly added items to tal but all must be handed off to 
 	  ;; INNER COND logic. I think loop without rotating the queue 
 	  ;; (loop hed tal reg reruns))
 	  ;; (let ((newtal (append tal (list hed))))  ;; We should discard hed as it has been expanded into it's items? Yes, but only if this *is* an itemized test