|
|
1.1 root 1: /*
2: * $Id: amq.h,v 5.2 90/06/23 22:20:13 jsp Rel $
3: *
4: * Copyright (c) 1990 Jan-Simon Pendry
5: * Copyright (c) 1990 Imperial College of Science, Technology & Medicine
6: * Copyright (c) 1990 The Regents of the University of California.
7: * All rights reserved.
8: *
9: * This code is derived from software contributed to Berkeley by
10: * Jan-Simon Pendry at Imperial College, London.
11: *
12: * Redistribution and use in source and binary forms are permitted provided
13: * that: (1) source distributions retain this entire copyright notice and
14: * comment, and (2) distributions including binaries display the following
15: * acknowledgement: ``This product includes software developed by the
16: * University of California, Berkeley and its contributors'' in the
17: * documentation or other materials provided with the distribution and in
18: * all advertising materials mentioning features or use of this software.
19: * Neither the name of the University nor the names of its contributors may
20: * be used to endorse or promote products derived from this software without
21: * specific prior written permission.
22: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
23: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
24: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
25: *
26: * @(#)amq.h 5.1 (Berkeley) 7/19/90
27: */
28:
29: #define AMQ_STRLEN 1024
30:
31: typedef char *amq_string;
32: bool_t xdr_amq_string();
33:
34:
35: typedef long *time_type;
36: bool_t xdr_time_type();
37:
38:
39: struct amq_mount_tree {
40: amq_string mt_mountinfo;
41: amq_string mt_directory;
42: amq_string mt_mountpoint;
43: amq_string mt_type;
44: time_type mt_mounttime;
45: u_short mt_mountuid;
46: int mt_getattr;
47: int mt_lookup;
48: int mt_readdir;
49: int mt_readlink;
50: int mt_statfs;
51: struct amq_mount_tree *mt_next;
52: struct amq_mount_tree *mt_child;
53: };
54: typedef struct amq_mount_tree amq_mount_tree;
55: bool_t xdr_amq_mount_tree();
56:
57:
58: typedef amq_mount_tree *amq_mount_tree_p;
59: bool_t xdr_amq_mount_tree_p();
60:
61:
62: struct amq_mount_info {
63: amq_string mi_type;
64: amq_string mi_mountpt;
65: amq_string mi_mountinfo;
66: amq_string mi_fserver;
67: int mi_error;
68: int mi_refc;
69: int mi_up;
70: };
71: typedef struct amq_mount_info amq_mount_info;
72: bool_t xdr_amq_mount_info();
73:
74:
75: typedef struct {
76: u_int amq_mount_info_list_len;
77: amq_mount_info *amq_mount_info_list_val;
78: } amq_mount_info_list;
79: bool_t xdr_amq_mount_info_list();
80:
81:
82: typedef struct {
83: u_int amq_mount_tree_list_len;
84: amq_mount_tree_p *amq_mount_tree_list_val;
85: } amq_mount_tree_list;
86: bool_t xdr_amq_mount_tree_list();
87:
88:
89: struct amq_mount_stats {
90: int as_drops;
91: int as_stale;
92: int as_mok;
93: int as_merr;
94: int as_uerr;
95: };
96: typedef struct amq_mount_stats amq_mount_stats;
97: bool_t xdr_amq_mount_stats();
98:
99:
100: enum amq_opt {
101: AMOPT_DEBUG = 0,
102: AMOPT_LOGFILE = 1,
103: AMOPT_XLOG = 2,
104: AMOPT_FLUSHMAPC = 3
105: };
106: typedef enum amq_opt amq_opt;
107: bool_t xdr_amq_opt();
108:
109:
110: struct amq_setopt {
111: amq_opt as_opt;
112: amq_string as_str;
113: };
114: typedef struct amq_setopt amq_setopt;
115: bool_t xdr_amq_setopt();
116:
117:
118: #define AMQ_PROGRAM ((u_long)300019)
119: #define AMQ_VERSION ((u_long)1)
120: #define AMQPROC_NULL ((u_long)0)
121: extern voidp amqproc_null_1();
122: #define AMQPROC_MNTTREE ((u_long)1)
123: extern amq_mount_tree_p *amqproc_mnttree_1();
124: #define AMQPROC_UMNT ((u_long)2)
125: extern voidp amqproc_umnt_1();
126: #define AMQPROC_STATS ((u_long)3)
127: extern amq_mount_stats *amqproc_stats_1();
128: #define AMQPROC_EXPORT ((u_long)4)
129: extern amq_mount_tree_list *amqproc_export_1();
130: #define AMQPROC_SETOPT ((u_long)5)
131: extern int *amqproc_setopt_1();
132: #define AMQPROC_GETMNTFS ((u_long)6)
133: extern amq_mount_info_list *amqproc_getmntfs_1();
134:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.