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 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476
|
/*
*$Id: ut.h,v 1.6 2005/12/07 12:43:35 bogdan_iancu Exp $
*
* - various general purpose functions
*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of openser, a free SIP server.
*
* openser is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version
*
* openser is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* History
* ------
* 2003-01-18 un_escape function introduced for convenience of code needing
* the complex&slow feature of unescaping
* 2003-01-28 scratchpad removed (jiri)
* 2003-01-29 pathmax added (jiri)
* 2003-02-13 strlower added (janakj)
* 2003-02-28 scratchpad compatibility abandoned (jiri)
* 2003-03-30 str2int and str2float added (janakj)
* 2003-04-26 ZSW (jiri)
* 2004-03-08 updated int2str (64 bits, INT2STR_MAX_LEN used) (andrei)
*/
#ifndef ut_h
#define ut_h
#include <sys/types.h>
#include <sys/time.h>
#include <limits.h>
#include <unistd.h>
#include <ctype.h>
#include "config.h"
#include "dprint.h"
#include "str.h"
struct sip_msg;
/* zero-string wrapper */
#define ZSW(_c) ((_c)?(_c):"")
/* str initialization */
#define str_init(_string) {_string, sizeof(_string) - 1}
/* returns string beginning and length without insignificant chars */
#define trim_len( _len, _begin, _mystr ) \
do{ static char _c; \
(_len)=(_mystr).len; \
while ((_len) && ((_c=(_mystr).s[(_len)-1])==0 || _c=='\r' || \
_c=='\n' || _c==' ' || _c=='\t' )) \
(_len)--; \
(_begin)=(_mystr).s; \
while ((_len) && ((_c=*(_begin))==' ' || _c=='\t')) { \
(_len)--;\
(_begin)++; \
} \
}while(0)
#define trim_r( _mystr ) \
do{ static char _c; \
while( ((_mystr).len) && ( ((_c=(_mystr).s[(_mystr).len-1]))==0 ||\
_c=='\r' || _c=='\n' ) \
) \
(_mystr).len--; \
}while(0)
#define translate_pointer( _new_buf , _org_buf , _p) \
( (_p)?(_new_buf + (_p-_org_buf)):(0) )
#define via_len(_via) \
((_via)->bsize-((_via)->name.s-\
((_via)->hdr.s+(_via)->hdr.len)))
/* char to hex conversion table */
static char fourbits2char[16] = { '0', '1', '2', '3', '4', '5',
'6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
/* converts a str to an u. short, returns the u. short and sets *err on
* error and if err!=null
*/
static inline unsigned short str2s(const char* s, unsigned int len,
int *err)
{
unsigned short ret;
int i;
unsigned char *limit;
unsigned char *init;
unsigned char* str;
/*init*/
str=(unsigned char*)s;
ret=i=0;
limit=str+len;
init=str;
for(;str<limit ;str++){
if ( (*str <= '9' ) && (*str >= '0') ){
ret=ret*10+*str-'0';
i++;
if (i>5) goto error_digits;
}else{
//error unknown char
goto error_char;
}
}
if (err) *err=0;
return ret;
error_digits:
DBG("str2s: ERROR: too many letters in [%.*s]\n", (int)len, init);
if (err) *err=1;
return 0;
error_char:
DBG("str2s: ERROR: unexpected char %c in %.*s\n", *str, (int)len, init);
if (err) *err=1;
return 0;
}
static inline int btostr( char *p, unsigned char val)
{
unsigned int a,b,i =0;
if ( (a=val/100)!=0 )
*(p+(i++)) = a+'0'; /*first digit*/
if ( (b=val%100/10)!=0 || a)
*(p+(i++)) = b+'0'; /*second digit*/
*(p+(i++)) = '0'+val%10; /*third digit*/
return i;
}
#define INT2STR_MAX_LEN (19+1+1) /* 2^64~= 16*10^18 => 19+1 digits + \0 */
/* returns a pointer to a static buffer containing l in asciiz & sets len */
static inline char* int2str(unsigned long l, int* len)
{
static char r[INT2STR_MAX_LEN];
int i;
i=INT2STR_MAX_LEN-2;
r[INT2STR_MAX_LEN-1]=0; /* null terminate */
do{
r[i]=l%10+'0';
i--;
l/=10;
}while(l && (i>=0));
if (l && (i<0)){
LOG(L_CRIT, "BUG: int2str: overflow\n");
}
if (len) *len=(INT2STR_MAX_LEN-2)-i;
return &r[i+1];
}
#define SINT2STR_MAX_LEN (1+19+1+1) /* 2^64~= 16*10^18 => s+19+1 digits + \0 */
/* signed int to str
* returns a pointer to a static buffer containing l in asciiz & sets len */
static inline char* sint2str(long l, int* len)
{
static char rs[SINT2STR_MAX_LEN];
int i;
int s;
i=SINT2STR_MAX_LEN-2;
rs[SINT2STR_MAX_LEN-1]=0; /* null terminate */
s = 0;
if(l<0) {
s = 1;
l = -l;
}
do{
rs[i]=l%10+'0';
i--;
l/=10;
}while(l && (i>=0));
if (l && (i<=0)){
LOG(L_CRIT, "BUG: sint2str: overflow\n");
}
if(s) {
rs[i]='-';
i--;
}
if (len) *len=(SINT2STR_MAX_LEN-2)-i;
return &rs[i+1];
}
/* faster memchr version */
static inline char* q_memchr(char* p, int c, unsigned int size)
{
char* end;
end=p+size;
for(;p<end;p++){
if (*p==(unsigned char)c) return p;
}
return 0;
}
inline static int reverse_hex2int( char *c, int len )
{
char *pc;
int r;
char mychar;
r=0;
for (pc=c+len-1; len>0; pc--, len--) {
r <<= 4 ;
mychar=*pc;
if ( mychar >='0' && mychar <='9') r+=mychar -'0';
else if (mychar >='a' && mychar <='f') r+=mychar -'a'+10;
else if (mychar >='A' && mychar <='F') r+=mychar -'A'+10;
else return -1;
}
return r;
}
inline static int int2reverse_hex( char **c, int *size, int nr )
{
unsigned short digit;
if (*size && nr==0) {
**c = '0';
(*c)++;
(*size)--;
return 1;
}
while (*size && nr ) {
digit = nr & 0xf ;
**c= digit >= 10 ? digit + 'a' - 10 : digit + '0';
nr >>= 4;
(*c)++;
(*size)--;
}
return nr ? -1 /* number not processed; too little space */ : 1;
}
inline static int hexstr2int(char *c, int len, int *val)
{
char *pc;
int r;
char mychar;
r=0;
for (pc=c; pc<c+len; pc++) {
r <<= 4 ;
mychar=*pc;
if ( mychar >='0' && mychar <='9') r+=mychar -'0';
else if (mychar >='a' && mychar <='f') r+=mychar -'a'+10;
else if (mychar >='A' && mychar <='F') r+=mychar -'A'+10;
else return -1;
}
*val = r;
return 0;
}
/* double output length assumed ; does NOT zero-terminate */
inline static int string2hex(
/* input */ unsigned char *str, int len,
/* output */ char *hex )
{
int orig_len;
if (len==0) {
*hex='0';
return 1;
}
orig_len=len;
while ( len ) {
*hex=fourbits2char[(*str) >> 4];
hex++;
*hex=fourbits2char[(*str) & 0xf];
hex++;
len--;
str++;
}
return orig_len-len;
}
/* portable sleep in microseconds (no interrupt handling now) */
inline static void sleep_us( unsigned int nusecs )
{
struct timeval tval;
tval.tv_sec=nusecs/1000000;
tval.tv_usec=nusecs%1000000;
select(0, NULL, NULL, NULL, &tval );
}
/* portable determination of max_path */
inline static int pathmax()
{
#ifdef PATH_MAX
static int pathmax=PATH_MAX;
#else
static int pathmax=0;
#endif
if (pathmax==0) { /* init */
pathmax=pathconf("/", _PC_PATH_MAX);
pathmax=(pathmax<=0)?PATH_MAX_GUESS:pathmax+1;
}
return pathmax;
}
inline static int hex2int(char hex_digit)
{
if (hex_digit>='0' && hex_digit<='9')
return hex_digit-'0';
if (hex_digit>='a' && hex_digit<='f')
return hex_digit-'a'+10;
if (hex_digit>='A' && hex_digit<='F')
return hex_digit-'A'+10;
/* no valid hex digit ... */
LOG(L_ERR, "ERROR: hex2int: '%c' is no hex char\n", hex_digit );
return -1;
}
/* Un-escape URI user -- it takes a pointer to original user
str, as well as the new, unescaped one, which MUST have
an allocated buffer linked to the 'str' structure ;
(the buffer can be allocated with the same length as
the original string -- the output string is always
shorter (if escaped characters occur) or same-long
as the original one).
only printable characters are permitted
<0 is returned on an unescaping error, length of the
unescaped string otherwise
*/
inline static int un_escape(str *user, str *new_user )
{
int i, j, value;
int hi, lo;
if( new_user==0 || new_user->s==0) {
LOG(L_CRIT, "BUG: un_escape: called with invalid param\n");
return -1;
}
new_user->len = 0;
j = 0;
for (i = 0; i < user->len; i++) {
if (user->s[i] == '%') {
if (i + 2 >= user->len) {
LOG(L_ERR, "ERROR: un_escape: escape sequence too short in"
" '%.*s' @ %d\n",
user->len, user->s, i );
goto error;
}
hi=hex2int(user->s[i + 1]);
if (hi<0) {
LOG(L_ERR, "ERROR: un_escape: non-hex high digit in an escape sequence in"
" '%.*s' @ %d\n",
user->len, user->s, i+1 );
goto error;
}
lo=hex2int(user->s[i + 2]);
if (lo<0) {
LOG(L_ERR, "ERROR: non-hex low digit in an escape sequence in "
"'%.*s' @ %d\n",
user->len, user->s, i+2 );
goto error;
}
value=(hi<<4)+lo;
if (value < 32 || value > 126) {
LOG(L_ERR, "ERROR: non-ASCII escaped character in '%.*s' @ %d\n",
user->len, user->s, i );
goto error;
}
new_user->s[j] = value;
i+=2; /* consume the two hex digits, for cycle will move to the next char */
} else {
new_user->s[j] = user->s[i];
}
j++; /* good -- we translated another character */
}
new_user->len = j;
return j;
error:
new_user->len = j;
return -1;
}
/*
* Convert a string to lower case
*/
static inline void strlower(str* _s)
{
int i;
for(i = 0; i < _s->len; i++) {
_s->s[i] = tolower(_s->s[i]);
}
}
/*
* Convert a str into integer
*/
static inline int str2int(str* _s, unsigned int* _r)
{
int i;
*_r = 0;
for(i = 0; i < _s->len; i++) {
if ((_s->s[i] >= '0') && (_s->s[i] <= '9')) {
*_r *= 10;
*_r += _s->s[i] - '0';
} else {
return -1;
}
}
return 0;
}
/*
* Convert a str into signed integer
*/
static inline int str2sint(str* _s, int* _r)
{
int i;
int s;
*_r = 0;
s = 1;
i=0;
if(_s->s[i]=='-') {
s=-1;
i++;
}
for(; i < _s->len; i++) {
if ((_s->s[i] >= '0') && (_s->s[i] <= '9')) {
*_r *= 10;
*_r += _s->s[i] - '0';
} else {
return -1;
}
}
*_r *= s;
return 0;
}
#endif
|