* Copyright (c) 1989 Jan-Simon Pendry
* Copyright (c) 1989 Imperial College of Science, Technology & Medicine
* Copyright (c) 1989 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Jan-Simon Pendry at Imperial College, London.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* @(#)fsinfo.h 5.3 (Berkeley) 5/12/91
* $Id: fsinfo.h,v 5.2.1.5 91/05/07 22:19:15 jsp Alpha $
* Get this in now so that OS_HDR can use it
#define P_void /* as nothing */
#define Const /* as nothing */
#define INLINE /* __inline */
* Pick up target dependent definitions
* Bogosity to deal with ether { ... }
#include <netinet/if_ether.h>
extern char* strchr
P((Const
char*, int)); /* C */
extern char* strrchr
P((Const
char*, int)); /* C */
extern char *strdup
P((char*)); /* C */
extern void analyze_automounts
P((qelem
*));
extern void analyze_hosts
P((qelem
*));
extern void compute_automount_point
P((char*, host
*, char*));
extern automount
*new_automount
P((char*));
extern auto_tree
*new_auto_tree
P((char*, qelem
*));
extern host
*new_host
P((void));
extern disk_fs
*new_disk_fs
P((void));
extern void set_disk_fs
P((disk_fs
*, int, char*));
extern ether_if
*new_ether_if
P((void));
extern mount
*new_mount
P((void));
extern void set_mount
P((mount
*, int, char*));
extern fsmount
*new_fsmount
P((void));
extern void set_fsmount
P((fsmount
*, int, char*));
extern qelem
*new_que
P((void));
extern void init_que
P((qelem
*));
extern void ins_que
P((qelem
*, qelem
*));
extern void rem_que
P((qelem
*));
extern dict
*new_dict
P((void));
extern dict_ent
*dict_locate
P((dict
*, char*));
extern void dict_add
P((dict
*, char*, char*));
extern int dict_iter
P((dict
*, int (*)()));
extern FILE *pref_open();
extern ioloc
*current_location();
extern char *disk_fs_strings
[];
extern char *mount_strings
[];
extern char *fsmount_strings
[];
extern char *host_strings
[];
extern char *ether_if_strings
[];
extern char *exportfs_pref
;
extern char *dumpset_pref
;
extern char *bootparams_pref
;
extern int file_io_errors
;
extern dict
*dict_of_hosts
;
extern dict
*dict_of_volnames
;
#define ALLOC(x) ((struct x *) xcalloc(1, sizeof(struct x)))
#define STREQ(s,t) (*(s) == *(t) && strcmp((s)+1,(t)+1) == 0)
#define ISSET(m,b) ((m) & (1<<(b)))
#define BITSET(m,b) ((m) |= (1<<(b)))
#define FIRST(ty, q) ((ty *) ((q)->q_forw))
#define LAST(ty, q) ((ty *) ((q)->q_back))
#define NEXT(ty, q) ((ty *) (((qelem *) q)->q_forw))
#define HEAD(ty, q) ((ty *) q)
for ((v) = FIRST(ty,(q)); (v) != HEAD(ty,(q)); (v) = NEXT(ty,(v)))