Remove list-processes C function; misc fixes to last change.

* src/process.c (Flist_processes): Removed to Lisp.
(list_processes_1): Deleted.

* lisp/emacs-lisp/cconv.el (cconv--analyse-use): Ignore "ignored" when
issuing unused warnings.

* lisp/emacs-lisp/tabulated-list.el (tabulated-list-print): Use lambda
macro directly.

3 files changed, 14 insertions, 6 deletions

diff --git a/lisp/ChangeLog b/lisp/ChangeLog
index b09313ddda0..75bb06806bd 100644
--- a/lisp/ChangeLog
+++ b/lisp/ChangeLog
@@ -1,5 +1,11 @@
 2011-04-06  Chong Yidong  <cyd@stupidchicken.com>
 
+        * emacs-lisp/cconv.el (cconv--analyse-use): Ignore "ignored" when
+        issuing unused warnings.
+
+        * emacs-lisp/tabulated-list.el (tabulated-list-print): Use lambda
+        macro directly.
+
         * simple.el: Lisp reimplement of list-processes.  Based on an
         earlier reimplementation by Leo Liu, but using tabulated-list.el.
         (process-menu-mode): New major mode.
diff --git a/lisp/emacs-lisp/cconv.el b/lisp/emacs-lisp/cconv.el
index 5cc9ecb4cf7..38584c437b8 100644
--- a/lisp/emacs-lisp/cconv.el
+++ b/lisp/emacs-lisp/cconv.el
@@ -536,7 +536,9 @@ FORM is the parent form that binds this var."
               ;; it is often non-trivial for the programmer to avoid such
               ;; unused vars.
               (not (intern-soft var))
-              (eq ?_ (aref (symbol-name var) 0)))
+              (eq ?_ (aref (symbol-name var) 0))
+              ;; As a special exception, ignore "ignore".
+              (eq var 'ignored))
        (byte-compile-log-warning (format "Unused lexical %s `%S'"
                                          varkind var))))
     ;; If it's unused, there's no point converting it into a cons-cell, even if
diff --git a/lisp/emacs-lisp/tabulated-list.el b/lisp/emacs-lisp/tabulated-list.el
index c9f186323c7..03ee59dd89c 100644
--- a/lisp/emacs-lisp/tabulated-list.el
+++ b/lisp/emacs-lisp/tabulated-list.el
@@ -229,11 +229,11 @@ to the entry with the same ID element as the current line."
           (setq sorter (nth 2 (aref tabulated-list-format n)))
           (when (eq sorter t)
             (setq sorter ; Default sorter checks column N:
-                  `(lambda (A B)
-                     (setq A (aref (cadr A) ,n))
-                     (setq B (aref (cadr B) ,n))
-                     (string< (if (stringp A) A (car A))
-                              (if (stringp B) B (car B))))))
+                  (lambda (A B)
+                    (setq A (aref (cadr A) n))
+                    (setq B (aref (cadr B) n))
+                    (string< (if (stringp A) A (car A))
+                             (if (stringp B) B (car B))))))
           (setq entries (sort entries sorter))
           (if (cdr tabulated-list-sort-key)
               (setq entries (nreverse entries)))