1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
* Copyright (c) 1999, Boris Popov
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 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 Boris Popov.
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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
* SUCH DAMAGE.
*
* NetWare queue interface
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/types.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <netncp/ncp_lib.h>
int
ncp_create_queue_job_and_file(NWCONN_HANDLE connid, u_int32_t queue_id,
struct queue_job *job)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 121);
ncp_add_dword_hl(conn, queue_id);
ncp_add_mem(conn, &(job->j), sizeof(job->j));
if ((error = ncp_request(connid, 23, conn)) != 0)
return error;
memcpy(&(job->j), ncp_reply_data(conn, 0), 78);
ConvertToNWfromDWORD(job->j.JobFileHandle, &job->file_handle);
return 0;
}
int
ncp_close_file_and_start_job(NWCONN_HANDLE connid, u_int32_t queue_id,
struct queue_job *job)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 127);
ncp_add_dword_hl(conn, queue_id);
ncp_add_dword_lh(conn, job->j.JobNumber);
error = ncp_request(connid, 23, conn);
return error;
}
int
ncp_attach_to_queue(NWCONN_HANDLE connid, u_int32_t queue_id) {
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 111);
ncp_add_dword_hl(conn, queue_id);
error = ncp_request(connid, 23, conn);
return error;
}
int
ncp_detach_from_queue(NWCONN_HANDLE connid, u_int32_t queue_id) {
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 112);
ncp_add_dword_hl(conn, queue_id);
error= ncp_request(connid, 23, conn);
return error;
}
int
ncp_service_queue_job(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int16_t job_type, struct queue_job *job)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 124);
ncp_add_dword_hl(conn, queue_id);
ncp_add_word_hl(conn, job_type);
if ((error = ncp_request(connid, 23, conn)) != 0) {
return error;
}
memcpy(&(job->j), ncp_reply_data(conn, 0), 78);
ConvertToNWfromDWORD(job->j.JobFileHandle, &job->file_handle);
return error;
}
int
ncp_finish_servicing_job(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int32_t job_number, u_int32_t charge_info)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 131);
ncp_add_dword_hl(conn, queue_id);
ncp_add_dword_lh(conn, job_number);
ncp_add_dword_hl(conn, charge_info);
error = ncp_request(connid, 23, conn);
return error;
}
int
ncp_abort_servicing_job(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int32_t job_number)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 132);
ncp_add_dword_hl(conn, queue_id);
ncp_add_dword_lh(conn, job_number);
error = ncp_request(connid, 23, conn);
return error;
}
int
ncp_get_queue_length(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int32_t *queue_length)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn, 125);
ncp_add_dword_hl(conn, queue_id);
if ((error = ncp_request(connid, 23, conn)) != 0)
return error;
if (conn->rpsize < 12) {
ncp_printf("ncp_reply_size %d < 12\n", conn->rpsize);
return EINVAL;
}
if (ncp_reply_dword_hl(conn,0) != queue_id) {
printf("Ouch! Server didn't reply with same queue id in ncp_get_queue_length!\n");
return EINVAL;
}
*queue_length = ncp_reply_dword_lh(conn,8);
return error;
}
int
ncp_get_queue_job_ids(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int32_t queue_section, u_int32_t *length1, u_int32_t *length2,
u_int32_t ids[])
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn,129);
ncp_add_dword_hl(conn, queue_id);
ncp_add_dword_lh(conn, queue_section);
if ((error = ncp_request(connid, 23, conn)) != 0)
return error;
if (conn->rpsize < 8) {
ncp_printf("ncp_reply_size %d < 8\n", conn->rpsize);
return EINVAL;
}
*length2 = ncp_reply_dword_lh(conn,4);
if (conn->rpsize < 8 + 4*(*length2)) {
ncp_printf("ncp_reply_size %d < %d\n", conn->rpsize, 8+4*(*length2));
return EINVAL;
}
if (ids) {
int count = min(*length1, *length2)*sizeof(u_int32_t);
int pos;
for (pos=0; pos<count; pos+=sizeof(u_int32_t)) {
*ids++ = ncp_reply_dword_lh(conn, 8+pos);
}
}
*length1 = ncp_reply_dword_lh(conn,0);
return error;
}
int
ncp_get_queue_job_info(NWCONN_HANDLE connid, u_int32_t queue_id,
u_int32_t job_id, struct nw_queue_job_entry *jobdata)
{
int error;
DECLARE_RQ;
ncp_init_request_s(conn,122);
ncp_add_dword_hl(conn, queue_id);
ncp_add_dword_lh(conn, job_id);
if ((error = ncp_request(connid, 23, conn)) != 0)
return error;
if (conn->rpsize < sizeof(struct nw_queue_job_entry)) {
ncp_printf("ncp_reply_size %d < %d\n", conn->rpsize,sizeof(struct nw_queue_job_entry));
return EINVAL;
}
memcpy(jobdata,ncp_reply_data(conn,0), sizeof(struct nw_queue_job_entry));
return error;
}
|
