|
|
1.1 root 1:
2: #ifdef RPC_HDR
3: %/*
4: % * WARNING - DO NOT EDIT THIS FILE
5: % * IT IS GENERATED BY RPCGEN - LOOK AT THE MAKEFILE
6: % */
7: #endif
8:
9: #ifdef RPC_XDR
10: %/*
11: % * WARNING - DO NOT EDIT THIS FILE
12: % * IT IS GENERATED BY RPCGEN - LOOK AT THE MAKEFILE
13: % */
14: #endif
15:
16: #ifdef RPC_SVC
17: %/*
18: % * WARNING - DO NOT EDIT THIS FILE
19: % * IT IS GENERATED BY RPCGEN - LOOK AT THE MAKEFILE
20: % */
21: #endif
22:
23: #ifdef RPC_CLNT
24: %/*
25: % * WARNING - DO NOT EDIT THIS FILE
26: % * IT IS GENERATED BY RPCGEN - LOOK AT THE MAKEFILE
27: % */
28: #endif
29:
30:
31:
32: /*
33: ** The sizes of data items.
34: */
35: const BB_MAX_IMP = 200;
36: const BB_ID_NAME_LEN = 8;
37: const BB_COMPANY_NAME_LEN = 32;
38: const BB_IMP_NAME_LEN = 16;
39: const BB_PASSWD_LEN = 16;
40:
41:
42: /*
43: ** Structure which corresponds to a row of the cthon board. The phase
44: ** variables indicate completion of each of the first two phases. The
45: ** clients variable is an array indicating that this implementation has
46: ** completed the client side testing of the NFS test suite against it's
47: ** "indexed" implementation.
48: */
49: typedef u_char BB_row[ BB_MAX_IMP];
50:
51: /*
52: ** The connectathon board consists of N X N testing. Each implementation
53: ** of NFS is tested against all others. This implies creation of an
54: ** array of the CTHON_row structures, one for each implementation.
55: */
56: typedef BB_row BB_board[ BB_MAX_IMP];
57:
58: typedef char BB_id[BB_ID_NAME_LEN]; /* combo of co and implementation */
59:
60: typedef char BB_passwd[BB_PASSWD_LEN];
61:
62: struct BB_vendor
63: {
64: int booth;
65: char company[BB_COMPANY_NAME_LEN];
66: char imp[BB_IMP_NAME_LEN];
67: BB_id id; /* combo of co and implementation */
68: };
69:
70: struct BB_set_in
71: {
72: BB_id client;
73: BB_id server;
74: BB_passwd passwd;
75: };
76:
77: struct BB_set_out
78: {
79: int status;
80: BB_vendor client;
81: BB_vendor server;
82: };
83:
84: struct BB_passwd_in
85: {
86: BB_id client;
87: BB_passwd old;
88: BB_passwd new;
89: };
90:
91: struct BB_list_in
92: {
93: BB_id id;
94: BB_passwd passwd;
95: };
96:
97: struct BB_list_out
98: {
99: int status;
100: BB_vendor data<BB_MAX_IMP>;
101: };
102:
103: struct BB_grid
104: {
105: int status;
106: int row;
107: int column;
108: BB_board grid;
109: };
110:
111: /*
112: ** Prograzm definitions
113: ** The program number PROGNUM is defined during compilation, see the Makefile
114: **/
115: program BILLBOARD_PROG {
116: version BILLBOARD_VERS {
117: BB_set_out BB_SET(BB_set_in) = 1;
118: BB_set_out BB_UNSET(BB_set_in) = 2;
119: BB_list_out BB_ALIST(BB_list_in) = 3;
120: BB_list_out BB_BLIST(BB_list_in) = 4;
121: BB_list_out BB_CLIST(BB_list_in) = 5;
122: BB_list_out BB_DLIST(BB_list_in) = 6;
123: int BB_PASSWD_SET(BB_passwd_in) = 7;
124: BB_grid BB_GRID(void) = 8;
125: } = 1;
126: } = PROGNUM;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.