|
|
1.1 root 1: /* llib-lrosy - lint library for -lrosy */
2:
3: /*
4: * $Header: /f/osi/rosy/RCS/llib-lrosy,v 7.0 89/11/23 22:21:48 mrose Rel $
5: *
6: *
7: * $Log: llib-lrosy,v $
8: * Revision 7.0 89/11/23 22:21:48 mrose
9: * Release 6.0
10: *
11: */
12:
13: /*
14: * NOTICE
15: *
16: * Acquisition, use, and distribution of this module and related
17: * materials are subject to the restrictions of a license agreement.
18: * Consult the Preface in the User's Manual for the full terms of
19: * this agreement.
20: *
21: */
22:
23:
24: /* LINTLIBRARY */
25:
26: #include "rosy.h"
27:
28: /* */
29:
30: /* WAIT */
31:
32: int RyWait (sd, id, out, secs, roi)
33: int sd,
34: *id,
35: secs;
36: caddr_t *out;
37: struct RoSAPindication *roi;
38: {
39: return RyWait (sd, id, out, secs, roi);
40: }
41:
42:
43: /* Initiator */
44:
45: /* STUB */
46:
47: int RyStub (sd, ryo, op, id, linked, in, rfx, efx, class, roi)
48: int sd;
49: struct RyOperation *ryo;
50: int op,
51: id,
52: *linked,
53: class;
54: caddr_t in;
55: IFP rfx,
56: efx;
57: struct RoSAPindication *roi;
58: {
59: return RyStub (sd, ryo, op, id, linked, in, rfx, efx, class, roi);
60: }
61:
62:
63: /* DISCARD */
64:
65: int RyDiscard (sd, id, roi)
66: int sd,
67: id;
68: struct RoSAPindication *roi;
69: {
70: return RyDiscard (sd, id, roi);
71: }
72:
73:
74: /* OPERATION */
75:
76: int RyOperation (sd, ryo, op, in, out, response, roi)
77: int sd;
78: struct RyOperation *ryo;
79: int op,
80: *response;
81: caddr_t in,
82: *out;
83: struct RoSAPindication *roi;
84: {
85: return RyOperation (sd, ryo, op, in, out, response, roi);
86: }
87:
88:
89: /* INVOKE */
90:
91: int RyOpInvoke (sd, ryo, op, in, out, rfx, efx, class, invokeID, linkedID,
92: priority, roi)
93: int sd;
94: struct RyOperation *ryo;
95: int op,
96: class,
97: invokeID,
98: *linkedID,
99: priority;
100: caddr_t in,
101: *out;
102: IFP rfx,
103: efx;
104: struct RoSAPindication *roi;
105: {
106: return RyOpInvoke (sd, ryo, op, in, out, rfx, efx, class, invokeID,
107: linkedID, priority, roi);
108: }
109:
110:
111: /* generate unique invoke ID */
112:
113: int RyGenID (sd)
114: int sd;
115: {
116: return RyGenID (sd);
117: }
118:
119:
120: /* Responder */
121:
122: /* DISPATCH */
123:
124: int RyDispatch (sd, ryo, op, fnx, roi)
125: int sd;
126: struct RyOperation *ryo;
127: int op;
128: IFP fnx;
129: struct RoSAPindication *roi;
130: {
131: return RyDispatch (sd, ryo, op, fnx, roi);
132: }
133:
134:
135: /* RESULT */
136:
137: int RyDsResult (sd, id, out, priority, roi)
138: int sd;
139: int id,
140: priority;
141: caddr_t out;
142: struct RoSAPindication *roi;
143: {
144: return RyDsResult (sd, id, out, priority, roi);
145: }
146:
147:
148: /* ERROR */
149:
150: int RyDsError (sd, id, err, out, priority, roi)
151: int sd;
152: int id,
153: err,
154: priority;
155: caddr_t out;
156: struct RoSAPindication *roi;
157: {
158: return RyDsError (sd, id, err, out, priority, roi);
159: }
160:
161:
162: /* U-REJECT */
163:
164: int RyDsUReject (sd, id, reason, priority, roi)
165: int sd;
166: int id,
167: reason,
168: priority;
169: struct RoSAPindication *roi;
170: {
171: return RyDsUReject (sd, id, reason, priority, roi);
172: }
173:
174:
175: /* clean-up after association termination */
176:
177: int RyLose (sd, roi)
178: int sd;
179: struct RoSAPindication *roi;
180: {
181: return RyLose (sd, roi);
182: }
183:
184:
185: /* find operations and errors by numbers and names */
186:
187: struct RyOperation *findopbyop (ryo, op)
188: struct RyOperation *ryo;
189: int op;
190: {
191: return findopbyop (ryo, op);
192: }
193:
194:
195: struct RyOperation *findopbyname (ryo, name)
196: struct RyOperation *ryo;
197: char *name;
198: {
199: return findopbyname (ryo, name);
200: }
201:
202:
203: struct RyError *finderrbyerr (rye, err)
204: struct RyError *rye;
205: int err;
206: {
207: return finderrbyerr (rye, err);
208: }
209:
210:
211: struct RyError *finderrbyname (rye, name)
212: struct RyError *rye;
213: char *name;
214: {
215: return finderrbyname (rye, name);
216: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.