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 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
/*
Copyright (c) 2007-2014. The YARA Authors. 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. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
*/
#include <stdio.h>
#include <string.h>
#include <yara/mem.h>
#include <yara/strutils.h>
uint64_t xtoi(const char* hexstr)
{
size_t i;
size_t l = strlen(hexstr);
uint64_t r = 0;
for (i = 0; i < l; i++)
{
switch (hexstr[i])
{
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
r |= ((uint64_t) (hexstr[i] - '0')) << ((l - i - 1) * 4);
break;
case 'a':
case 'b':
case 'c':
case 'd':
case 'e':
case 'f':
r |= ((uint64_t) (hexstr[i] - 'a' + 10)) << ((l - i - 1) * 4);
break;
case 'A':
case 'B':
case 'C':
case 'D':
case 'E':
case 'F':
r |= ((uint64_t) (hexstr[i] - 'A' + 10)) << ((l - i - 1) * 4);
break;
default:
i = l; // force loop exit
}
}
return r;
}
/*
strlcpy and strlcat are defined in FreeBSD and OpenBSD,
the following implementations were taken from OpenBSD.
*/
#if !HAVE_STRLCPY && !defined(strlcpy)
size_t strlcpy(char* dst, const char* src, size_t size)
{
register char* d = dst;
register const char* s = src;
register size_t n = size;
// Copy as many bytes as will fit
if (n != 0 && --n != 0)
{
do
{
if ((*d++ = *s++) == 0)
break;
} while (--n != 0);
}
// Not enough room in dst, add NUL and traverse rest of src
if (n == 0)
{
if (size != 0)
*d = '\0'; // NULL-terminate dst
while (*s++)
;
}
return (s - src - 1); // count does not include NULL
}
#endif
#if !HAVE_STRLCAT && !defined(strlcat)
size_t strlcat(char* dst, const char* src, size_t size)
{
register char* d = dst;
register const char* s = src;
register size_t n = size;
size_t dlen;
// Find the end of dst and adjust bytes left but don't go past end
while (n-- != 0 && *d != '\0') d++;
dlen = d - dst;
n = size - dlen;
if (n == 0)
return (dlen + strlen(s));
while (*s != '\0')
{
if (n != 1)
{
*d++ = *s;
n--;
}
s++;
}
*d = '\0';
return (dlen + (s - src)); // count does not include NULL
}
#endif
int strnlen_w(const char* w_str)
{
int len = 0;
while (w_str[0] || w_str[1])
{
w_str += 2;
len += 1;
}
return len;
}
int strcmp_w(const char* w_str, const char* str)
{
while (*str != 0 && w_str[0] == *str && w_str[1] == 0)
{
w_str += 2;
str += 1;
}
// Higher-order byte of wide char non-zero? -> w_str is larger than str
if (w_str[1] != 0)
return 1;
return w_str[0] - *str;
}
size_t strlcpy_w(char* dst, const char* w_src, size_t n)
{
register char* d = dst;
register const char* s = w_src;
while (n > 1 && *s != 0)
{
*d = *s;
d += 1;
n -= 1;
s += 2;
}
while (*s) s += 2;
*d = '\0';
return (s - w_src) / 2;
}
#if !HAVE_MEMMEM && !defined(memmem)
void* memmem(
const void* haystack,
size_t haystack_size,
const void* needle,
size_t needle_size)
{
char* sp = (char*) haystack;
char* pp = (char*) needle;
char* eos;
if (haystack == NULL || haystack_size == 0 || needle == NULL ||
needle_size == 0)
return NULL;
eos = sp + haystack_size - needle_size;
while (sp <= eos)
{
if (*sp == *pp && memcmp(sp, pp, needle_size) == 0)
return sp;
sp++;
}
return NULL;
}
#endif
///////////////////////////////////////////////////////////////////////////////
// This our own implementation of isalnum(). The library version is locale
// dependent in some platforms and can consider non-ASCII characters to be
// alphanumeric.
//
int yr_isalnum(const uint8_t* s)
{
return (*s >= 0x30 && *s <= 0x39) || (*s >= 0x41 && *s <= 0x5a) ||
(*s >= 0x61 && *s <= 0x7a);
}
//////////////////////////////////////////////////////////////////////////
// This our own implementation of vasprintf(), as it is not available on
// some platforms. It is based on the implementation of vsnprintf but it
// allocates memory using yr_malloc, and therefore the caller must free
// the memory using yr_free.
//
void yr_vasprintf(char** strp, const char* fmt, va_list ap)
{
va_list ap_copy;
va_copy(ap_copy, ap);
*strp = NULL;
int len = vsnprintf(NULL, 0, fmt, ap_copy);
va_end(ap_copy);
if (len < 0)
return;
*strp = (char*) yr_malloc(len + 1);
if (*strp == NULL)
return;
vsnprintf(*strp, len + 1, fmt, ap);
}
//////////////////////////////////////////////////////////////////////////
// This our own implementation of asprintf(), see yr_vasprintf() for details.
//
void yr_asprintf(char** strp, const char* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
yr_vasprintf(strp, fmt, ap);
va_end(ap);
}
|