1f1b9d127SSheldon Hearn /* 2df3342d6SSheldon Hearn * Copyright (c) 2000-2001, 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 * 32df3342d6SSheldon Hearn * $Id: nb_name.c,v 1.2 2001/08/22 03:31:36 bp Exp $ 33f1b9d127SSheldon Hearn */ 344d79445aSR. Imura 354d79445aSR. Imura #include <sys/cdefs.h> 364d79445aSR. Imura __FBSDID("$FreeBSD$"); 374d79445aSR. Imura 38f1b9d127SSheldon Hearn #include <sys/param.h> 394d79445aSR. Imura #include <sys/endian.h> 40f1b9d127SSheldon Hearn #include <sys/socket.h> 41f1b9d127SSheldon Hearn 42f1b9d127SSheldon Hearn #include <ctype.h> 43f1b9d127SSheldon Hearn #include <err.h> 44f1b9d127SSheldon Hearn #include <errno.h> 45f1b9d127SSheldon Hearn #include <stdio.h> 46f1b9d127SSheldon Hearn #include <stdlib.h> 47f1b9d127SSheldon Hearn #include <string.h> 48f1b9d127SSheldon Hearn 49f1b9d127SSheldon Hearn #include <netsmb/netbios.h> 50f1b9d127SSheldon Hearn #include <netsmb/smb_lib.h> 51f1b9d127SSheldon Hearn #include <netsmb/nb_lib.h> 52f1b9d127SSheldon Hearn 53f1b9d127SSheldon Hearn int 54f1b9d127SSheldon Hearn nb_snballoc(int namelen, struct sockaddr_nb **dst) 55f1b9d127SSheldon Hearn { 56f1b9d127SSheldon Hearn struct sockaddr_nb *snb; 57f1b9d127SSheldon Hearn int slen; 58f1b9d127SSheldon Hearn 59f1b9d127SSheldon Hearn slen = namelen + sizeof(*snb) - sizeof(snb->snb_name); 60f1b9d127SSheldon Hearn snb = malloc(slen); 61f1b9d127SSheldon Hearn if (snb == NULL) 62f1b9d127SSheldon Hearn return ENOMEM; 63f1b9d127SSheldon Hearn bzero(snb, slen); 64f1b9d127SSheldon Hearn snb->snb_family = AF_NETBIOS; 65f1b9d127SSheldon Hearn snb->snb_len = slen; 66f1b9d127SSheldon Hearn *dst = snb; 67f1b9d127SSheldon Hearn return 0; 68f1b9d127SSheldon Hearn } 69f1b9d127SSheldon Hearn 70f1b9d127SSheldon Hearn void 71f1b9d127SSheldon Hearn nb_snbfree(struct sockaddr *snb) 72f1b9d127SSheldon Hearn { 73f1b9d127SSheldon Hearn free(snb); 74f1b9d127SSheldon Hearn } 75f1b9d127SSheldon Hearn 76f1b9d127SSheldon Hearn /* 77f1b9d127SSheldon Hearn * Create a full NETBIOS address 78f1b9d127SSheldon Hearn */ 79f1b9d127SSheldon Hearn int 80f1b9d127SSheldon Hearn nb_sockaddr(struct sockaddr *peer, struct nb_name *np, 81f1b9d127SSheldon Hearn struct sockaddr_nb **dst) 82f1b9d127SSheldon Hearn 83f1b9d127SSheldon Hearn { 84f1b9d127SSheldon Hearn struct sockaddr_nb *snb; 85f1b9d127SSheldon Hearn int nmlen, error; 86f1b9d127SSheldon Hearn 87f1b9d127SSheldon Hearn if (peer && (peer->sa_family != AF_INET && peer->sa_family != AF_IPX)) 88f1b9d127SSheldon Hearn return EPROTONOSUPPORT; 89f1b9d127SSheldon Hearn nmlen = nb_name_len(np); 90f1b9d127SSheldon Hearn if (nmlen < NB_ENCNAMELEN) 91f1b9d127SSheldon Hearn return EINVAL; 92f1b9d127SSheldon Hearn error = nb_snballoc(nmlen, &snb); 93f1b9d127SSheldon Hearn if (error) 94f1b9d127SSheldon Hearn return error; 95f1b9d127SSheldon Hearn if (nmlen != nb_name_encode(np, snb->snb_name)) 96f1b9d127SSheldon Hearn printf("a bug somewhere in the nb_name* code\n"); 97f1b9d127SSheldon Hearn if (peer) 98f1b9d127SSheldon Hearn memcpy(&snb->snb_tran, peer, peer->sa_len); 99f1b9d127SSheldon Hearn *dst = snb; 100f1b9d127SSheldon Hearn return 0; 101f1b9d127SSheldon Hearn } 102f1b9d127SSheldon Hearn 103f1b9d127SSheldon Hearn int 104f1b9d127SSheldon Hearn nb_name_len(struct nb_name *np) 105f1b9d127SSheldon Hearn { 106f1b9d127SSheldon Hearn u_char *name; 107f1b9d127SSheldon Hearn int len, sclen; 108f1b9d127SSheldon Hearn 109f1b9d127SSheldon Hearn len = 1 + NB_ENCNAMELEN; 110f1b9d127SSheldon Hearn if (np->nn_scope == NULL) 111f1b9d127SSheldon Hearn return len + 1; 112f1b9d127SSheldon Hearn sclen = 0; 113f1b9d127SSheldon Hearn for (name = np->nn_scope; *name; name++) { 114f1b9d127SSheldon Hearn if (*name == '.') { 115f1b9d127SSheldon Hearn sclen = 0; 116f1b9d127SSheldon Hearn } else { 117f1b9d127SSheldon Hearn if (sclen < NB_MAXLABLEN) { 118f1b9d127SSheldon Hearn sclen++; 119f1b9d127SSheldon Hearn len++; 120f1b9d127SSheldon Hearn } 121f1b9d127SSheldon Hearn } 122f1b9d127SSheldon Hearn } 123f1b9d127SSheldon Hearn return len + 1; 124f1b9d127SSheldon Hearn } 125f1b9d127SSheldon Hearn 126f1b9d127SSheldon Hearn int 127f1b9d127SSheldon Hearn nb_encname_len(const char *str) 128f1b9d127SSheldon Hearn { 129f1b9d127SSheldon Hearn const u_char *cp = (const u_char *)str; 130f1b9d127SSheldon Hearn int len, blen; 131f1b9d127SSheldon Hearn 132f1b9d127SSheldon Hearn if ((cp[0] & 0xc0) == 0xc0) 133f1b9d127SSheldon Hearn return -1; /* first two bytes are offset to name */ 134f1b9d127SSheldon Hearn 135f1b9d127SSheldon Hearn len = 1; 136f1b9d127SSheldon Hearn for (;;) { 137f1b9d127SSheldon Hearn blen = *cp; 138f1b9d127SSheldon Hearn if (blen++ == 0) 139f1b9d127SSheldon Hearn break; 140f1b9d127SSheldon Hearn len += blen; 141f1b9d127SSheldon Hearn cp += blen; 142f1b9d127SSheldon Hearn } 143f1b9d127SSheldon Hearn return len; 144f1b9d127SSheldon Hearn } 145f1b9d127SSheldon Hearn 146*69ba6292SIan Lepore static inline void 147*69ba6292SIan Lepore nb_char_encode(u_char **ptr, u_char c, int n) 148f1b9d127SSheldon Hearn { 149*69ba6292SIan Lepore 150f1b9d127SSheldon Hearn while (n--) { 151*69ba6292SIan Lepore *(*ptr)++ = 0x41 + (c >> 4); 152*69ba6292SIan Lepore *(*ptr)++ = 0x41 + (c & 0x0f); 153f1b9d127SSheldon Hearn } 154f1b9d127SSheldon Hearn } 155f1b9d127SSheldon Hearn 156f1b9d127SSheldon Hearn int 157f1b9d127SSheldon Hearn nb_name_encode(struct nb_name *np, u_char *dst) 158f1b9d127SSheldon Hearn { 159f1b9d127SSheldon Hearn u_char *name, *plen; 160f1b9d127SSheldon Hearn u_char *cp = dst; 161f1b9d127SSheldon Hearn int i, lblen; 162f1b9d127SSheldon Hearn 163f1b9d127SSheldon Hearn *cp++ = NB_ENCNAMELEN; 164f1b9d127SSheldon Hearn name = np->nn_name; 165f1b9d127SSheldon Hearn if (name[0] == '*' && name[1] == 0) { 166*69ba6292SIan Lepore nb_char_encode(&cp, '*', 1); 167*69ba6292SIan Lepore nb_char_encode(&cp, ' ', NB_NAMELEN - 1); 168f1b9d127SSheldon Hearn } else { 169*69ba6292SIan Lepore for (i = 0; i < NB_NAMELEN - 1; i++) 170*69ba6292SIan Lepore if (*name != 0) 171*69ba6292SIan Lepore nb_char_encode(&cp, toupper(*name++), 1); 172*69ba6292SIan Lepore else 173*69ba6292SIan Lepore nb_char_encode(&cp, ' ', 1); 174*69ba6292SIan Lepore nb_char_encode(&cp, np->nn_type, 1); 175f1b9d127SSheldon Hearn } 176f1b9d127SSheldon Hearn *cp = 0; 177f1b9d127SSheldon Hearn if (np->nn_scope == NULL) 178f1b9d127SSheldon Hearn return nb_encname_len(dst); 179f1b9d127SSheldon Hearn plen = cp++; 180f1b9d127SSheldon Hearn lblen = 0; 181f1b9d127SSheldon Hearn for (name = np->nn_scope; ; name++) { 182f1b9d127SSheldon Hearn if (*name == '.' || *name == 0) { 183f1b9d127SSheldon Hearn *plen = lblen; 184f1b9d127SSheldon Hearn plen = cp++; 185f1b9d127SSheldon Hearn *plen = 0; 186f1b9d127SSheldon Hearn if (*name == 0) 187f1b9d127SSheldon Hearn break; 188f1b9d127SSheldon Hearn } else { 189f1b9d127SSheldon Hearn if (lblen < NB_MAXLABLEN) { 190f1b9d127SSheldon Hearn *cp++ = *name; 191f1b9d127SSheldon Hearn lblen++; 192f1b9d127SSheldon Hearn } 193f1b9d127SSheldon Hearn } 194f1b9d127SSheldon Hearn } 195f1b9d127SSheldon Hearn return nb_encname_len(dst); 196f1b9d127SSheldon Hearn } 197f1b9d127SSheldon Hearn 198