|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: * ! 17: * @(#)alias.h 3.6 (Berkeley) 6/29/88 ! 18: */ ! 19: ! 20: #define alias var ! 21: #define a_name r_name ! 22: #define a_buf r_val.v_str ! 23: #define a_flags r_val.v_type ! 24: ! 25: /* a_flags bits, must not interfere with v_type values */ ! 26: #define A_INUSE 0x010 /* already inuse */ ! 27: ! 28: #define alias_set(n, s) var_setstr1(&alias_head, n, s) ! 29: #define alias_walk(f, a) var_walk1(alias_head, f, a) ! 30: #define alias_unset(n) var_unset1(&alias_head, n) ! 31: #define alias_lookup(n) (*var_lookup1(&alias_head, n)) ! 32: ! 33: struct var *alias_head;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.