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