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
|
/* $Id$ */
/*
* Copyright (C)2003-2006 Benny Prijono <benny@prijono.org>
*
* This program 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.
*
* This program 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
*/
#include <pj/string.h>
#include <pj/pool.h>
#include <pj/ctype.h>
#include <pj/rand.h>
#include <pj/os.h>
#if PJ_FUNCTIONS_ARE_INLINED==0
# include <pj/string_i.h>
#endif
PJ_DEF(pj_str_t*) pj_strltrim( pj_str_t *str )
{
register char *p = str->ptr;
while (pj_isspace(*p))
++p;
str->slen -= (p - str->ptr);
str->ptr = p;
return str;
}
PJ_DEF(pj_str_t*) pj_strrtrim( pj_str_t *str )
{
char *end = str->ptr + str->slen;
register char *p = end - 1;
while (p >= str->ptr && pj_isspace(*p))
--p;
str->slen -= ((end - p) - 1);
return str;
}
PJ_DEF(char*) pj_create_random_string(char *str, pj_size_t len)
{
unsigned i;
char *p = str;
PJ_CHECK_STACK();
for (i=0; i<len/8; ++i) {
unsigned val = pj_rand();
pj_val_to_hex_digit( (val & 0xFF000000) >> 24, p+0 );
pj_val_to_hex_digit( (val & 0x00FF0000) >> 16, p+2 );
pj_val_to_hex_digit( (val & 0x0000FF00) >> 8, p+4 );
pj_val_to_hex_digit( (val & 0x000000FF) >> 0, p+6 );
p += 8;
}
for (i=i * 8; i<len; ++i) {
*p++ = pj_hex_digits[ pj_rand() & 0x0F ];
}
return str;
}
PJ_DEF(unsigned long) pj_strtoul(const pj_str_t *str)
{
unsigned long value;
unsigned i;
PJ_CHECK_STACK();
value = 0;
for (i=0; i<(unsigned)str->slen; ++i) {
value = value * 10 + (str->ptr[i] - '0');
}
return value;
}
PJ_DEF(int) pj_utoa(unsigned long val, char *buf)
{
return pj_utoa_pad(val, buf, 0, 0);
}
PJ_DEF(int) pj_utoa_pad( unsigned long val, char *buf, int min_dig, int pad)
{
char *p;
int len;
PJ_CHECK_STACK();
p = buf;
do {
unsigned long digval = (unsigned long) (val % 10);
val /= 10;
*p++ = (char) (digval + '0');
} while (val > 0);
len = p-buf;
while (len < min_dig) {
*p++ = (char)pad;
++len;
}
*p-- = '\0';
do {
char temp = *p;
*p = *buf;
*buf = temp;
--p;
++buf;
} while (buf < p);
return len;
}
|
