1f1b9d127SSheldon Hearn /*
2f1b9d127SSheldon Hearn * Copyright (c) 2000, Boris Popov
3f1b9d127SSheldon Hearn * All rights reserved.
4f1b9d127SSheldon Hearn *
5f1b9d127SSheldon Hearn * Redistribution and use in source and binary forms, with or without
6f1b9d127SSheldon Hearn * modification, are permitted provided that the following conditions
7f1b9d127SSheldon Hearn * are met:
8f1b9d127SSheldon Hearn * 1. Redistributions of source code must retain the above copyright
9f1b9d127SSheldon Hearn * notice, this list of conditions and the following disclaimer.
10f1b9d127SSheldon Hearn * 2. Redistributions in binary form must reproduce the above copyright
11f1b9d127SSheldon Hearn * notice, this list of conditions and the following disclaimer in the
12f1b9d127SSheldon Hearn * documentation and/or other materials provided with the distribution.
13f1b9d127SSheldon Hearn * 3. All advertising materials mentioning features or use of this software
14f1b9d127SSheldon Hearn * must display the following acknowledgement:
15f1b9d127SSheldon Hearn * This product includes software developed by Boris Popov.
16f1b9d127SSheldon Hearn * 4. Neither the name of the author nor the names of any co-contributors
17f1b9d127SSheldon Hearn * may be used to endorse or promote products derived from this software
18f1b9d127SSheldon Hearn * without specific prior written permission.
19f1b9d127SSheldon Hearn *
20f1b9d127SSheldon Hearn * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
21f1b9d127SSheldon Hearn * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22f1b9d127SSheldon Hearn * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23f1b9d127SSheldon Hearn * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24f1b9d127SSheldon Hearn * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25f1b9d127SSheldon Hearn * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26f1b9d127SSheldon Hearn * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27f1b9d127SSheldon Hearn * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28f1b9d127SSheldon Hearn * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29f1b9d127SSheldon Hearn * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30f1b9d127SSheldon Hearn * SUCH DAMAGE.
31f1b9d127SSheldon Hearn *
32f1b9d127SSheldon Hearn * $Id: rq.c,v 1.7 2001/04/16 04:33:01 bp Exp $
332cc37f2cSAlexander Kabaev * $FreeBSD$
34f1b9d127SSheldon Hearn */
35f1b9d127SSheldon Hearn #include <sys/param.h>
36f1b9d127SSheldon Hearn #include <sys/ioctl.h>
37f1b9d127SSheldon Hearn #include <sys/errno.h>
38f1b9d127SSheldon Hearn #include <sys/stat.h>
39f1b9d127SSheldon Hearn #include <ctype.h>
40f1b9d127SSheldon Hearn #include <err.h>
41f1b9d127SSheldon Hearn #include <stdio.h>
42f1b9d127SSheldon Hearn #include <unistd.h>
431ac62e0bSDavid E. O'Brien #include <string.h>
44f1b9d127SSheldon Hearn #include <stdlib.h>
45f1b9d127SSheldon Hearn #include <sysexits.h>
46f1b9d127SSheldon Hearn
47f1b9d127SSheldon Hearn #include <sys/mchain.h>
48f1b9d127SSheldon Hearn
49f1b9d127SSheldon Hearn #include <netsmb/smb_lib.h>
50f1b9d127SSheldon Hearn #include <netsmb/smb_conn.h>
51f1b9d127SSheldon Hearn #include <netsmb/smb_rap.h>
52f1b9d127SSheldon Hearn
53f1b9d127SSheldon Hearn
54f1b9d127SSheldon Hearn int
smb_rq_init(struct smb_ctx * ctx,u_char cmd,size_t rpbufsz,struct smb_rq ** rqpp)55f1b9d127SSheldon Hearn smb_rq_init(struct smb_ctx *ctx, u_char cmd, size_t rpbufsz, struct smb_rq **rqpp)
56f1b9d127SSheldon Hearn {
57f1b9d127SSheldon Hearn struct smb_rq *rqp;
58f1b9d127SSheldon Hearn
59f1b9d127SSheldon Hearn rqp = malloc(sizeof(*rqp));
60f1b9d127SSheldon Hearn if (rqp == NULL)
61f1b9d127SSheldon Hearn return ENOMEM;
62f1b9d127SSheldon Hearn bzero(rqp, sizeof(*rqp));
63f1b9d127SSheldon Hearn rqp->rq_cmd = cmd;
64f1b9d127SSheldon Hearn rqp->rq_ctx = ctx;
65f1b9d127SSheldon Hearn mb_init(&rqp->rq_rq, M_MINSIZE);
66f1b9d127SSheldon Hearn mb_init(&rqp->rq_rp, rpbufsz);
67f1b9d127SSheldon Hearn *rqpp = rqp;
68f1b9d127SSheldon Hearn return 0;
69f1b9d127SSheldon Hearn }
70f1b9d127SSheldon Hearn
71f1b9d127SSheldon Hearn void
smb_rq_done(struct smb_rq * rqp)72f1b9d127SSheldon Hearn smb_rq_done(struct smb_rq *rqp)
73f1b9d127SSheldon Hearn {
74f1b9d127SSheldon Hearn mb_done(&rqp->rq_rp);
75f1b9d127SSheldon Hearn mb_done(&rqp->rq_rq);
76f1b9d127SSheldon Hearn free(rqp);
77f1b9d127SSheldon Hearn }
78f1b9d127SSheldon Hearn
79f1b9d127SSheldon Hearn void
smb_rq_wend(struct smb_rq * rqp)80f1b9d127SSheldon Hearn smb_rq_wend(struct smb_rq *rqp)
81f1b9d127SSheldon Hearn {
82f1b9d127SSheldon Hearn if (rqp->rq_rq.mb_count & 1)
83f1b9d127SSheldon Hearn smb_error("smbrq_wend: odd word count\n", 0);
84f1b9d127SSheldon Hearn rqp->rq_wcount = rqp->rq_rq.mb_count / 2;
85f1b9d127SSheldon Hearn rqp->rq_rq.mb_count = 0;
86f1b9d127SSheldon Hearn }
87f1b9d127SSheldon Hearn
88f1b9d127SSheldon Hearn int
smb_rq_dmem(struct mbdata * mbp,char * src,size_t size)89*1243a98eSTijl Coosemans smb_rq_dmem(struct mbdata *mbp, char *src, size_t size)
90f1b9d127SSheldon Hearn {
91f1b9d127SSheldon Hearn struct mbuf *m;
92f1b9d127SSheldon Hearn char * dst;
93f1b9d127SSheldon Hearn int cplen, error;
94f1b9d127SSheldon Hearn
95f1b9d127SSheldon Hearn if (size == 0)
96f1b9d127SSheldon Hearn return 0;
97f1b9d127SSheldon Hearn m = mbp->mb_cur;
98f1b9d127SSheldon Hearn if ((error = m_getm(m, size, &m)) != 0)
99f1b9d127SSheldon Hearn return error;
100f1b9d127SSheldon Hearn while (size > 0) {
101f1b9d127SSheldon Hearn cplen = M_TRAILINGSPACE(m);
102f1b9d127SSheldon Hearn if (cplen == 0) {
103f1b9d127SSheldon Hearn m = m->m_next;
104f1b9d127SSheldon Hearn continue;
105f1b9d127SSheldon Hearn }
106f1b9d127SSheldon Hearn if (cplen > (int)size)
107f1b9d127SSheldon Hearn cplen = size;
108f1b9d127SSheldon Hearn dst = mtod(m, char *) + m->m_len;
109f1b9d127SSheldon Hearn nls_mem_toext(dst, src, cplen);
110f1b9d127SSheldon Hearn size -= cplen;
111f1b9d127SSheldon Hearn src += cplen;
112f1b9d127SSheldon Hearn m->m_len += cplen;
113f1b9d127SSheldon Hearn mbp->mb_count += cplen;
114f1b9d127SSheldon Hearn }
115f1b9d127SSheldon Hearn mbp->mb_pos = mtod(m, char *) + m->m_len;
116f1b9d127SSheldon Hearn mbp->mb_cur = m;
117f1b9d127SSheldon Hearn return 0;
118f1b9d127SSheldon Hearn }
119f1b9d127SSheldon Hearn
120f1b9d127SSheldon Hearn int
smb_rq_dstring(struct mbdata * mbp,char * s)121*1243a98eSTijl Coosemans smb_rq_dstring(struct mbdata *mbp, char *s)
122f1b9d127SSheldon Hearn {
123f1b9d127SSheldon Hearn return smb_rq_dmem(mbp, s, strlen(s) + 1);
124f1b9d127SSheldon Hearn }
125f1b9d127SSheldon Hearn
126f1b9d127SSheldon Hearn int
smb_rq_simple(struct smb_rq * rqp)127f1b9d127SSheldon Hearn smb_rq_simple(struct smb_rq *rqp)
128f1b9d127SSheldon Hearn {
129f1b9d127SSheldon Hearn struct smbioc_rq krq;
130f1b9d127SSheldon Hearn struct mbdata *mbp;
131f1b9d127SSheldon Hearn char *data;
132f1b9d127SSheldon Hearn
133f1b9d127SSheldon Hearn mbp = smb_rq_getrequest(rqp);
134f1b9d127SSheldon Hearn m_lineup(mbp->mb_top, &mbp->mb_top);
135f1b9d127SSheldon Hearn data = mtod(mbp->mb_top, char*);
136f1b9d127SSheldon Hearn bzero(&krq, sizeof(krq));
137f1b9d127SSheldon Hearn krq.ioc_cmd = rqp->rq_cmd;
138f1b9d127SSheldon Hearn krq.ioc_twc = rqp->rq_wcount;
139f1b9d127SSheldon Hearn krq.ioc_twords = data;
140f1b9d127SSheldon Hearn krq.ioc_tbc = mbp->mb_count;
141f1b9d127SSheldon Hearn krq.ioc_tbytes = data + rqp->rq_wcount * 2;
142f1b9d127SSheldon Hearn mbp = smb_rq_getreply(rqp);
143f1b9d127SSheldon Hearn krq.ioc_rpbufsz = mbp->mb_top->m_maxlen;
144f1b9d127SSheldon Hearn krq.ioc_rpbuf = mtod(mbp->mb_top, char *);
145f1b9d127SSheldon Hearn if (ioctl(rqp->rq_ctx->ct_fd, SMBIOC_REQUEST, &krq) == -1)
146f1b9d127SSheldon Hearn return errno;
147f1b9d127SSheldon Hearn mbp->mb_top->m_len = krq.ioc_rwc * 2 + krq.ioc_rbc;
148f1b9d127SSheldon Hearn rqp->rq_wcount = krq.ioc_rwc;
149f1b9d127SSheldon Hearn rqp->rq_bcount = krq.ioc_rbc;
150f1b9d127SSheldon Hearn return 0;
151f1b9d127SSheldon Hearn }
152f1b9d127SSheldon Hearn
153f1b9d127SSheldon Hearn 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)154f1b9d127SSheldon Hearn smb_t2_request(struct smb_ctx *ctx, int setup, int setupcount,
155f1b9d127SSheldon Hearn const char *name,
156f1b9d127SSheldon Hearn int tparamcnt, void *tparam,
157f1b9d127SSheldon Hearn int tdatacnt, void *tdata,
158f1b9d127SSheldon Hearn int *rparamcnt, void *rparam,
159f1b9d127SSheldon Hearn int *rdatacnt, void *rdata)
160f1b9d127SSheldon Hearn {
161f1b9d127SSheldon Hearn struct smbioc_t2rq krq;
162f1b9d127SSheldon Hearn
163f1b9d127SSheldon Hearn bzero(&krq, sizeof(krq));
164f1b9d127SSheldon Hearn krq.ioc_setup[0] = setup;
165f1b9d127SSheldon Hearn krq.ioc_setupcnt = setupcount;
1662cc37f2cSAlexander Kabaev krq.ioc_name = (char *)name;
167f1b9d127SSheldon Hearn krq.ioc_tparamcnt = tparamcnt;
168f1b9d127SSheldon Hearn krq.ioc_tparam = tparam;
169f1b9d127SSheldon Hearn krq.ioc_tdatacnt = tdatacnt;
170f1b9d127SSheldon Hearn krq.ioc_tdata = tdata;
171f1b9d127SSheldon Hearn krq.ioc_rparamcnt = *rparamcnt;
172f1b9d127SSheldon Hearn krq.ioc_rparam = rparam;
173f1b9d127SSheldon Hearn krq.ioc_rdatacnt = *rdatacnt;
174f1b9d127SSheldon Hearn krq.ioc_rdata = rdata;
175f1b9d127SSheldon Hearn if (ioctl(ctx->ct_fd, SMBIOC_T2RQ, &krq) == -1)
176f1b9d127SSheldon Hearn return errno;
177f1b9d127SSheldon Hearn *rparamcnt = krq.ioc_rparamcnt;
178f1b9d127SSheldon Hearn *rdatacnt = krq.ioc_rdatacnt;
179f1b9d127SSheldon Hearn return 0;
180f1b9d127SSheldon Hearn }
181