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
|
/*
* Copyright (c) 2000, 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.
*
* $Id: rq.c,v 1.7 2001/04/16 04:33:01 bp Exp $
* $FreeBSD$
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/errno.h>
#include <sys/stat.h>
#include <ctype.h>
#include <err.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <sysexits.h>
#include <sys/mchain.h>
#include <netsmb/smb_lib.h>
#include <netsmb/smb_conn.h>
#include <netsmb/smb_rap.h>
int
smb_rq_init(struct smb_ctx *ctx, u_char cmd, size_t rpbufsz, struct smb_rq **rqpp)
{
struct smb_rq *rqp;
rqp = malloc(sizeof(*rqp));
if (rqp == NULL)
return ENOMEM;
bzero(rqp, sizeof(*rqp));
rqp->rq_cmd = cmd;
rqp->rq_ctx = ctx;
mb_init(&rqp->rq_rq, M_MINSIZE);
mb_init(&rqp->rq_rp, rpbufsz);
*rqpp = rqp;
return 0;
}
void
smb_rq_done(struct smb_rq *rqp)
{
mb_done(&rqp->rq_rp);
mb_done(&rqp->rq_rq);
free(rqp);
}
void
smb_rq_wend(struct smb_rq *rqp)
{
if (rqp->rq_rq.mb_count & 1)
smb_error("smbrq_wend: odd word count\n", 0);
rqp->rq_wcount = rqp->rq_rq.mb_count / 2;
rqp->rq_rq.mb_count = 0;
}
int
smb_rq_dmem(struct mbdata *mbp, char *src, size_t size)
{
struct mbuf *m;
char * dst;
int cplen, error;
if (size == 0)
return 0;
m = mbp->mb_cur;
if ((error = m_getm(m, size, &m)) != 0)
return error;
while (size > 0) {
cplen = M_TRAILINGSPACE(m);
if (cplen == 0) {
m = m->m_next;
continue;
}
if (cplen > (int)size)
cplen = size;
dst = mtod(m, char *) + m->m_len;
nls_mem_toext(dst, src, cplen);
size -= cplen;
src += cplen;
m->m_len += cplen;
mbp->mb_count += cplen;
}
mbp->mb_pos = mtod(m, char *) + m->m_len;
mbp->mb_cur = m;
return 0;
}
int
smb_rq_dstring(struct mbdata *mbp, char *s)
{
return smb_rq_dmem(mbp, s, strlen(s) + 1);
}
int
smb_rq_simple(struct smb_rq *rqp)
{
struct smbioc_rq krq;
struct mbdata *mbp;
char *data;
mbp = smb_rq_getrequest(rqp);
m_lineup(mbp->mb_top, &mbp->mb_top);
data = mtod(mbp->mb_top, char*);
bzero(&krq, sizeof(krq));
krq.ioc_cmd = rqp->rq_cmd;
krq.ioc_twc = rqp->rq_wcount;
krq.ioc_twords = data;
krq.ioc_tbc = mbp->mb_count;
krq.ioc_tbytes = data + rqp->rq_wcount * 2;
mbp = smb_rq_getreply(rqp);
krq.ioc_rpbufsz = mbp->mb_top->m_maxlen;
krq.ioc_rpbuf = mtod(mbp->mb_top, char *);
if (ioctl(rqp->rq_ctx->ct_fd, SMBIOC_REQUEST, &krq) == -1)
return errno;
mbp->mb_top->m_len = krq.ioc_rwc * 2 + krq.ioc_rbc;
rqp->rq_wcount = krq.ioc_rwc;
rqp->rq_bcount = krq.ioc_rbc;
return 0;
}
int
smb_t2_request(struct smb_ctx *ctx, int setup, int setupcount,
const char *name,
int tparamcnt, void *tparam,
int tdatacnt, void *tdata,
int *rparamcnt, void *rparam,
int *rdatacnt, void *rdata)
{
struct smbioc_t2rq krq;
bzero(&krq, sizeof(krq));
krq.ioc_setup[0] = setup;
krq.ioc_setupcnt = setupcount;
krq.ioc_name = (char *)name;
krq.ioc_tparamcnt = tparamcnt;
krq.ioc_tparam = tparam;
krq.ioc_tdatacnt = tdatacnt;
krq.ioc_tdata = tdata;
krq.ioc_rparamcnt = *rparamcnt;
krq.ioc_rparam = rparam;
krq.ioc_rdatacnt = *rdatacnt;
krq.ioc_rdata = rdata;
if (ioctl(ctx->ct_fd, SMBIOC_T2RQ, &krq) == -1)
return errno;
*rparamcnt = krq.ioc_rparamcnt;
*rdatacnt = krq.ioc_rdatacnt;
return 0;
}
|
