|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Edward Wang at The University of California, Berkeley. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted provided ! 9: * that: (1) source distributions retain this entire copyright notice and ! 10: * comment, and (2) distributions including binaries display the following ! 11: * acknowledgement: ``This product includes software developed by the ! 12: * University of California, Berkeley and its contributors'' in the ! 13: * documentation or other materials provided with the distribution and in ! 14: * all advertising materials mentioning features or use of this software. ! 15: * Neither the name of the University nor the names of its contributors may ! 16: * be used to endorse or promote products derived from this software without ! 17: * specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: * ! 22: * @(#)lcmd.h 3.9 (Berkeley) 6/6/90 ! 23: */ ! 24: ! 25: #define LCMD_NARG 20 /* maximum number of arguments */ ! 26: ! 27: struct lcmd_tab { ! 28: char *lc_name; ! 29: int lc_minlen; ! 30: int (*lc_func)(); ! 31: struct lcmd_arg *lc_arg; ! 32: }; ! 33: ! 34: struct lcmd_arg { ! 35: char *arg_name; ! 36: int arg_minlen; ! 37: int arg_flags; ! 38: }; ! 39: ! 40: /* arg_flags bits */ ! 41: #define ARG_TYPE 0x0f /* type of arg */ ! 42: #define ARG_ANY 0x00 /* any type */ ! 43: #define ARG_NUM 0x01 /* must be a number */ ! 44: #define ARG_STR 0x02 /* must be a string */ ! 45: #define ARG_LIST 0x10 /* this arg can be a list */ ! 46: ! 47: struct lcmd_tab *lcmd_lookup();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.