michael@0: /**
michael@0:    hex.c
michael@0: 
michael@0: 
michael@0:    Copyright (C) 2001-2003, Network Resonance, Inc.
michael@0:    Copyright (C) 2006, Network Resonance, Inc.
michael@0:    All Rights Reserved
michael@0: 
michael@0:    Redistribution and use in source and binary forms, with or without
michael@0:    modification, are permitted provided that the following conditions
michael@0:    are met:
michael@0: 
michael@0:    1. Redistributions of source code must retain the above copyright
michael@0:       notice, this list of conditions and the following disclaimer.
michael@0:    2. Redistributions in binary form must reproduce the above copyright
michael@0:       notice, this list of conditions and the following disclaimer in the
michael@0:       documentation and/or other materials provided with the distribution.
michael@0:    3. Neither the name of Network Resonance, Inc. nor the name of any
michael@0:       contributors to this software may be used to endorse or promote
michael@0:       products derived from this software without specific prior written
michael@0:       permission.
michael@0: 
michael@0:    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
michael@0:    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0:    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0:    ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0:    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0:    CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0:    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0:    INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0:    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0:    ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
michael@0:    POSSIBILITY OF SUCH DAMAGE.
michael@0: 
michael@0: 
michael@0:    briank@network-resonance.com
michael@0:  */
michael@0: 
michael@0: 
michael@0: static char *RCSSTRING __UNUSED__ ="$Id: hex.c,v 1.3 2007/06/26 22:37:56 adamcain Exp $";
michael@0: 
michael@0: #include <sys/types.h>
michael@0: #include <string.h>
michael@0: #include <ctype.h>
michael@0: #include "r_common.h"
michael@0: #include "hex.h"
michael@0: #include "r_log.h"
michael@0: 
michael@0: static char bin2hex_map[][3] = { "00", "01", "02", "03", "04", "05", "06", "07", "08", "09", "0a", "0b", "0c", "0d", "0e", "0f", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "1a", "1b", "1c", "1d", "1e", "1f", "20", "21", "22", "23", "24", "25", "26", "27", "28", "29", "2a", "2b", "2c", "2d", "2e", "2f", "30", "31", "32", "33", "34", "35", "36", "37", "38", "39", "3a", "3b", "3c", "3d", "3e", "3f", "40", "41", "42", "43", "44", "45", "46", "47", "48", "49", "4a", "4b", "4c", "4d", "4e", "4f", "50", "51", "52", "53", "54", "55", "56", "57", "58", "59", "5a", "5b", "5c", "5d", "5e", "5f", "60", "61", "62", "63", "64", "65", "66", "67", "68", "69", "6a", "6b", "6c", "6d", "6e", "6f", "70", "71", "72", "73", "74", "75", "76", "77", "78", "79", "7a", "7b", "7c", "7d", "7e", "7f", "80", "81", "82", "83", "84", "85", "86", "87", "88", "89", "8a", "8b", "8c", "8d", "8e", "8f", "90", "91", "92", "93", "94", "95", "96", "97", "98", "99", "9a", "9b", "9c", "9d", "9e", "9f", "a0", "a1", "a2", "a3", "a4", "a5", "a6", "a7", "a8", "a9", "aa", "ab", "ac", "ad", "ae", "af", "b0", "b1", "b2", "b3", "b4", "b5", "b6", "b7", "b8", "b9", "ba", "bb", "bc", "bd", "be", "bf", "c0", "c1", "c2", "c3", "c4", "c5", "c6", "c7", "c8", "c9", "ca", "cb", "cc", "cd", "ce", "cf", "d0", "d1", "d2", "d3", "d4", "d5", "d6", "d7", "d8", "d9", "da", "db", "dc", "dd", "de", "df", "e0", "e1", "e2", "e3", "e4", "e5", "e6", "e7", "e8", "e9", "ea", "eb", "ec", "ed", "ee", "ef", "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", "f8", "f9", "fa", "fb", "fc", "fd", "fe", "ff" };
michael@0: 
michael@0: static int hex2bin_map[] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0 /* '0' */, 1 /* '1' */, 2 /* '2' */, 3 /* '3' */, 4 /* '4' */, 5 /* '5' */, 6 /* '6' */, 7 /* '7' */, 8 /* '8' */, 9 /* '9' */, -1, -1, -1, -1, -1, -1, -1, 10 /* 'A' */, 11 /* 'B' */, 12 /* 'C' */, 13 /* 'D' */, 14 /* 'E' */, 15 /* 'F' */, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 10 /* 'a' */, 11 /* 'b' */, 12 /* 'c' */, 13 /* 'd' */, 14 /* 'e' */, 15 /* 'f' */, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 };
michael@0: 
michael@0: int
michael@0: nr_nbin2hex(UCHAR *bin, int binlen, char hex[], size_t size, int *len)
michael@0: {
michael@0:     int _status;
michael@0:     int i;
michael@0: 
michael@0:     if (size < (2*binlen))
michael@0:         ABORT(R_BAD_ARGS);
michael@0: 
michael@0:     for (i = 0; i < binlen; ++i) {
michael@0:         *hex++ = bin2hex_map[bin[i]][0];
michael@0:         *hex++ = bin2hex_map[bin[i]][1];
michael@0:     }
michael@0: 
michael@0:     if (size >= (2*binlen)+1)
michael@0:         *hex = '\0';
michael@0: 
michael@0:     *len = (2*binlen);
michael@0: 
michael@0:     _status=0;
michael@0:   abort:
michael@0:     return(_status);
michael@0: }
michael@0: 
michael@0: 
michael@0: int
michael@0: nr_nhex2bin(char *hex, int hexlen, UCHAR bin[], size_t size, int *len)
michael@0: {
michael@0:     int _status;
michael@0:     int binlen;
michael@0:     int h1;
michael@0:     int h2;
michael@0:     int i;
michael@0: 
michael@0:     if (hexlen % 2)
michael@0:         ABORT(R_BAD_ARGS);
michael@0: 
michael@0:     binlen = hexlen/2;
michael@0: 
michael@0:     if (size < binlen)
michael@0:         ABORT(R_BAD_ARGS);
michael@0: 
michael@0:     for (i = 0; i < binlen; ++i) {
michael@0:         h1 = hex2bin_map[(int)*hex++];
michael@0:         h2 = hex2bin_map[(int)*hex++];
michael@0: 
michael@0:         if (h1 == -1 || h2 == -1)
michael@0:             ABORT(R_BAD_ARGS);
michael@0: 
michael@0:         bin[i] = (h1 << 4) | h2;
michael@0:     }
michael@0: 
michael@0:     *len = binlen;
michael@0: 
michael@0:     _status=0;
michael@0:   abort:
michael@0:     return(_status);
michael@0: }