* lisp/registry.el (registry-collect-prune-candidates): Skip invalid entries

diff --git a/lisp/registry.el b/lisp/registry.el
index 17dc23d68e8805a72224a50882e5df97c740cf0a..3d0502a8f4248e3cd12ee4c61fbafa530e5fa83b 100644 (file)
--- a/lisp/registry.el
+++ b/lisp/registry.el
@@ -358,11 +358,12 @@ return LIMIT such candidates.  If SORTFUNC is provided, sort
 entries first and return candidates from beginning of list."
   (let* ((precious (oref db precious))
         (precious-p (lambda (entry-key)
-                      (cdr (memq (car entry-key) precious))))
+                      (cdr (memq (car-safe entry-key) precious))))
         (data (oref db data))
         (candidates (cl-loop for k being the hash-keys of data
                              using (hash-values v)
-                             when (cl-notany precious-p v)
+                             when (and (listp v)
+                                        (cl-notany precious-p v))
                              collect (cons k v))))
     ;; We want the full entries for sorting, but should only return a
     ;; list of entry keys.