Mercurial > hg > xemacs-beta
view tests/sigpipe.c @ 5066:545ec923b4eb
add documentation on keywords to cl*.el
-------------------- ChangeLog entries follow: --------------------
lisp/ChangeLog addition:
2010-02-22 Ben Wing <ben@xemacs.org>
* cl-seq.el:
* cl-seq.el (reduce):
* cl-seq.el (fill):
* cl-seq.el (replace):
* cl-seq.el (remove*):
* cl-seq.el (remove-if):
* cl-seq.el (remove-if-not):
* cl-seq.el (delete*):
* cl-seq.el (delete-if):
* cl-seq.el (delete-if-not):
* cl-seq.el (remove-duplicates):
* cl-seq.el (delete-duplicates):
* cl-seq.el (substitute):
* cl-seq.el (substitute-if):
* cl-seq.el (substitute-if-not):
* cl-seq.el (nsubstitute):
* cl-seq.el (nsubstitute-if):
* cl-seq.el (nsubstitute-if-not):
* cl-seq.el (find):
* cl-seq.el (find-if):
* cl-seq.el (find-if-not):
* cl-seq.el (position):
* cl-seq.el (position-if):
* cl-seq.el (position-if-not):
* cl-seq.el (count):
* cl-seq.el (count-if):
* cl-seq.el (count-if-not):
* cl-seq.el (mismatch):
* cl-seq.el (search):
* cl-seq.el (sort*):
* cl-seq.el (stable-sort):
* cl-seq.el (merge):
* cl-seq.el (member*):
* cl-seq.el (member-if):
* cl-seq.el (member-if-not):
* cl-seq.el (assoc*):
* cl-seq.el (assoc-if):
* cl-seq.el (assoc-if-not):
* cl-seq.el (rassoc*):
* cl-seq.el (rassoc-if):
* cl-seq.el (rassoc-if-not):
* cl-seq.el (union):
* cl-seq.el (nunion):
* cl-seq.el (intersection):
* cl-seq.el (nintersection):
* cl-seq.el (set-difference):
* cl-seq.el (nset-difference):
* cl-seq.el (set-exclusive-or):
* cl-seq.el (nset-exclusive-or):
* cl-seq.el (subsetp):
* cl-seq.el (subst-if):
* cl-seq.el (subst-if-not):
* cl-seq.el (nsubst):
* cl-seq.el (nsubst-if):
* cl-seq.el (nsubst-if-not):
* cl-seq.el (sublis):
* cl-seq.el (nsublis):
* cl-seq.el (tree-equal):
* cl-seq.el (cl-tree-equal-rec):
* cl.el:
* cl.el (pushnew):
* cl.el (adjoin):
* cl.el (subst):
Document the keywords to the various sequence/list functions.
author | Ben Wing <ben@xemacs.org> |
---|---|
date | Mon, 22 Feb 2010 21:17:47 -0600 |
parents | 679041362cd4 |
children | 308d34e9f07d |
line wrap: on
line source
/* code is all from loser.c and loser.el by Mly Copyright (C) 2002 Richard Mlynarik <mly@pobox.com> This file is part of XEmacs. XEmacs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. XEmacs is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with XEmacs; see the file COPYING. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. Commentary: Compile this file. Run it in the background giving it a command line argument PORT which is a positive integer 1024 < PORT < 32768 (avoid the numbers assigned in /etc/services). Then start up a fresh (you're going to crash) XEmacs. Execute the following (defun lose (port) (interactive "nUrk: ") (require 'comint) (while t (condition-case e (let* ((name "*lose*") (b (get-buffer-create name))) (switch-to-buffer b) (comint-mode) (comint-exec b name (cons "127.0.0.1" port) nil '()) (process-send-string (get-buffer-process b) "\377\373\001") (process-send-string (get-buffer-process b) "\377\373\001")) (error (message "URK: %s" e)) (sit-for 1)))) Then M-x lose RET PORT RET and you lose big (in XEmacs 21.1, anyway). Note: the error messages are proper functioning. What should eventually happen after a number of SIGPIPEs is that you get a SIGSEGV and life is bad and XEmacs is dead. */ #include <arpa/inet.h> int main (int argc, char **argv) { struct sockaddr_in junk; int s; memset (&junk, 0, sizeof (junk)); junk.sin_family = AF_INET; junk.sin_addr.s_addr = htonl (INADDR_ANY); /* un*x sucks */ junk.sin_port = htons (atoi (argv[1])); /* un*x blows */ s = socket (PF_INET, SOCK_STREAM, 0); bind (s, (struct sockaddr *)&junk, sizeof (junk)); listen (s, 1); for (;;) { int loser = accept (s, NULL, 0); close (loser); } }