/src/pjsip/pjlib/include/pj/string_i.h

Source (jump to first uncovered line)
/* 
 * Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
 * Copyright (C) 2003-2008 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/assert.h>
#include <pj/pool.h>

PJ_IDEF(pj_str_t) pj_str(char *str)
{
    pj_str_t dst;
    dst.ptr = str;
    dst.slen = str ? pj_ansi_strlen(str) : 0;
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strdup(pj_pool_t *pool,
                              pj_str_t *dst,
                              const pj_str_t *src)
{
    pj_assert(src->slen >= 0);

    /* Without this, destination will be corrupted */
    if (dst == src)
        return dst;

    if (src->slen > 0) {
        dst->ptr = (char*)pj_pool_alloc(pool, src->slen);
        pj_memcpy(dst->ptr, src->ptr, src->slen);
    }
    dst->slen = (src->slen < 0)? 0: src->slen;
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strdup_with_null( pj_pool_t *pool,
                                        pj_str_t *dst,
                                        const pj_str_t *src)
{
    pj_ssize_t src_slen = src->slen;

    pj_assert(src->slen >= 0);

    /* Check if the source's length is invalid */
    if (src_slen < 0)
        src_slen = 0;

    dst->ptr = (char*)pj_pool_alloc(pool, src_slen+1);
    if (src_slen) {
        pj_memcpy(dst->ptr, src->ptr, src_slen);
    }
    dst->slen = src_slen;
    dst->ptr[dst->slen] = '\0';
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strdup2(pj_pool_t *pool,
                              pj_str_t *dst,
                              const char *src)
{
    dst->slen = src ? pj_ansi_strlen(src) : 0;
    if (dst->slen) {
        dst->ptr = (char*)pj_pool_alloc(pool, dst->slen);
        pj_memcpy(dst->ptr, src, dst->slen);
    } else {
        dst->ptr = NULL;
    }
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strdup2_with_null( pj_pool_t *pool,
                                         pj_str_t *dst,
                                         const char *src)
{
    dst->slen = src ? pj_ansi_strlen(src) : 0;
    dst->ptr = (char*)pj_pool_alloc(pool, dst->slen+1);
    if (dst->slen) {
        pj_memcpy(dst->ptr, src, dst->slen);
    }
    dst->ptr[dst->slen] = '\0';
    return dst;
}

PJ_IDEF(pj_str_t) pj_strdup3(pj_pool_t *pool, const char *src)
{
    pj_str_t temp;
    pj_strdup2(pool, &temp, src);
    return temp;
}

PJ_IDEF(pj_str_t*) pj_strassign( pj_str_t *dst, pj_str_t *src )
{
    dst->ptr = src->ptr;
    dst->slen = src->slen;
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strcpy(pj_str_t *dst, const pj_str_t *src)
{
    pj_assert(src->slen >= 0);

    dst->slen = (src->slen < 0)? 0: src->slen;
    if (src->slen > 0)
        pj_memcpy(dst->ptr, src->ptr, src->slen);
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strcpy2(pj_str_t *dst, const char *src)
{
    dst->slen = src ? pj_ansi_strlen(src) : 0;
    if (dst->slen > 0)
        pj_memcpy(dst->ptr, src, dst->slen);
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strncpy( pj_str_t *dst, const pj_str_t *src, 
                               pj_ssize_t max)
{
    pj_assert(src->slen >= 0);
    pj_assert(max >= 0);

    if (max > src->slen) max = src->slen;
    if (max > 0)
        pj_memcpy(dst->ptr, src->ptr, max);
    dst->slen = (max < 0)? 0: max;
    return dst;
}

PJ_IDEF(pj_str_t*) pj_strncpy_with_null( pj_str_t *dst, const pj_str_t *src,
                                         pj_ssize_t max)
{
    pj_assert(src->slen >= 0);
    pj_assert(max > 0);

    if (max <= src->slen)
        max = (max > 0)? max-1: 0;
    else
        max = (src->slen < 0)? 0: src->slen;

    if (max > 0)
        pj_memcpy(dst->ptr, src->ptr, max);
    dst->ptr[max] = '\0';
    dst->slen = max;
    return dst;
}


PJ_IDEF(int) pj_strcmp( const pj_str_t *str1, const pj_str_t *str2)
{
    pj_assert(str1->slen >= 0);
    pj_assert(str2->slen >= 0);

    if (str1->slen <= 0) {
        return str2->slen<=0 ? 0 : -1;
    } else if (str2->slen <= 0) {
        return 1;
    } else {
        pj_size_t min = (str1->slen < str2->slen)? str1->slen : str2->slen;
        int res = pj_memcmp(str1->ptr, str2->ptr, min);
        if (res == 0) {
            return (str1->slen < str2->slen) ? -1 :
                    (str1->slen == str2->slen ? 0 : 1);
        } else {
            return res;
        }
    }
}

PJ_IDEF(int) pj_strncmp( const pj_str_t *str1, const pj_str_t *str2, 
                         pj_size_t len)
{
    pj_str_t copy1, copy2;

    pj_assert(str1->slen >= 0);
    pj_assert(str2->slen >= 0);

    if (len < (unsigned)str1->slen && str1->slen > 0) {
        copy1.ptr = str1->ptr;
        copy1.slen = len;
        str1 = &copy1;
    }

    if (len < (unsigned)str2->slen && str2->slen > 0) {
        copy2.ptr = str2->ptr;
        copy2.slen = len;
        str2 = &copy2;
    }

    return pj_strcmp(str1, str2);
}

PJ_IDEF(int) pj_strncmp2( const pj_str_t *str1, const char *str2, 
                          pj_size_t len)
{
    pj_str_t copy2;

    if (str2) {
        copy2.ptr = (char*)str2;
        copy2.slen = pj_ansi_strlen(str2);
    } else {
        copy2.slen = 0;
    }

    return pj_strncmp(str1, &copy2, len);
}

PJ_IDEF(int) pj_strcmp2( const pj_str_t *str1, const char *str2 )
{
    pj_str_t copy2;

    if (str2) {
        copy2.ptr = (char*)str2;
        copy2.slen = pj_ansi_strlen(str2);
    } else {
        copy2.ptr = NULL;
        copy2.slen = 0;
    }

    return pj_strcmp(str1, &copy2);
}

PJ_IDEF(int) pj_stricmp( const pj_str_t *str1, const pj_str_t *str2)
{
    pj_assert(str1->slen >= 0);
    pj_assert(str2->slen >= 0);

    if (str1->slen <= 0) {
        return str2->slen<=0 ? 0 : -1;
    } else if (str2->slen <= 0) {
        return 1;
    } else {
        pj_size_t min = (str1->slen < str2->slen)? str1->slen : str2->slen;
        int res = pj_ansi_strnicmp(str1->ptr, str2->ptr, min);
        if (res == 0) {
            return (str1->slen < str2->slen) ? -1 :
                    (str1->slen == str2->slen ? 0 : 1);
        } else {
            return res;
        }
    }
}

#if defined(PJ_HAS_STRICMP_ALNUM) && PJ_HAS_STRICMP_ALNUM!=0
PJ_IDEF(int) strnicmp_alnum( const char *str1, const char *str2,
                             int len)
{
    if (len==0)
        return 0;
    else {
        register const pj_uint32_t *p1 = (pj_uint32_t*)str1, 
                                   *p2 = (pj_uint32_t*)str2;
        while (len > 3 && (*p1 & 0x5F5F5F5F)==(*p2 & 0x5F5F5F5F))
            ++p1, ++p2, len-=4;

        if (len > 3)
            return -1;
#if defined(PJ_IS_LITTLE_ENDIAN) && PJ_IS_LITTLE_ENDIAN!=0
        else if (len==3)
            return ((*p1 & 0x005F5F5F)==(*p2 & 0x005F5F5F)) ? 0 : -1;
        else if (len==2)
            return ((*p1 & 0x00005F5F)==(*p2 & 0x00005F5F)) ? 0 : -1;
        else if (len==1)
            return ((*p1 & 0x0000005F)==(*p2 & 0x0000005F)) ? 0 : -1;
#else
        else if (len==3)
            return ((*p1 & 0x5F5F5F00)==(*p2 & 0x5F5F5F00)) ? 0 : -1;
        else if (len==2)
            return ((*p1 & 0x5F5F0000)==(*p2 & 0x5F5F0000)) ? 0 : -1;
        else if (len==1)
            return ((*p1 & 0x5F000000)==(*p2 & 0x5F000000)) ? 0 : -1;
#endif
        else 
            return 0;
    }
}

PJ_IDEF(int) pj_stricmp_alnum(const pj_str_t *str1, const pj_str_t *str2)
{
    register int len = str1->slen;

    if (len != str2->slen) {
        return (len < str2->slen) ? -1 : 1;
    } else if (len == 0) {
        return 0;
    } else {
        register const pj_uint32_t *p1 = (pj_uint32_t*)str1->ptr, 
                                   *p2 = (pj_uint32_t*)str2->ptr;
        while (len > 3 && (*p1 & 0x5F5F5F5F)==(*p2 & 0x5F5F5F5F))
            ++p1, ++p2, len-=4;

        if (len > 3)
            return -1;
#if defined(PJ_IS_LITTLE_ENDIAN) && PJ_IS_LITTLE_ENDIAN!=0
        else if (len==3)
            return ((*p1 & 0x005F5F5F)==(*p2 & 0x005F5F5F)) ? 0 : -1;
        else if (len==2)
            return ((*p1 & 0x00005F5F)==(*p2 & 0x00005F5F)) ? 0 : -1;
        else if (len==1)
            return ((*p1 & 0x0000005F)==(*p2 & 0x0000005F)) ? 0 : -1;
#else
        else if (len==3)
            return ((*p1 & 0x5F5F5F00)==(*p2 & 0x5F5F5F00)) ? 0 : -1;
        else if (len==2)
            return ((*p1 & 0x5F5F0000)==(*p2 & 0x5F5F0000)) ? 0 : -1;
        else if (len==1)
            return ((*p1 & 0x5F000000)==(*p2 & 0x5F000000)) ? 0 : -1;
#endif
        else 
            return 0;
    }
}
#endif  /* PJ_HAS_STRICMP_ALNUM */

PJ_IDEF(int) pj_stricmp2( const pj_str_t *str1, const char *str2)
{
    pj_str_t copy2;

    if (str2) {
        copy2.ptr = (char*)str2;
        copy2.slen = pj_ansi_strlen(str2);
    } else {
        copy2.ptr = NULL;
        copy2.slen = 0;
    }

    return pj_stricmp(str1, &copy2);
}

PJ_IDEF(int) pj_strnicmp( const pj_str_t *str1, const pj_str_t *str2, 
                          pj_size_t len)
{
    pj_str_t copy1, copy2;

    if (len < (unsigned)str1->slen && str1->slen > 0) {
        copy1.ptr = str1->ptr;
        copy1.slen = len;
        str1 = &copy1;
    }

    if (len < (unsigned)str2->slen && str2->slen > 0) {
        copy2.ptr = str2->ptr;
        copy2.slen = len;
        str2 = &copy2;
    }

    return pj_stricmp(str1, str2);
}

PJ_IDEF(int) pj_strnicmp2( const pj_str_t *str1, const char *str2, 
                           pj_size_t len)
{
    pj_str_t copy2;

    if (str2) {
        copy2.ptr = (char*)str2;
        copy2.slen = pj_ansi_strlen(str2);
    } else {
        copy2.slen = 0;
    }

    return pj_strnicmp(str1, &copy2, len);
}

PJ_IDEF(void) pj_strcat(pj_str_t *dst, const pj_str_t *src)
{
    pj_assert(src->slen >= 0);
    pj_assert(dst->slen >= 0);

    if (src->slen > 0 && dst->slen >= 0) {
        pj_memcpy(dst->ptr + dst->slen, src->ptr, src->slen);
        dst->slen += src->slen;
    }
}

PJ_IDEF(void) pj_strcat2(pj_str_t *dst, const char *str)
{
    pj_size_t len = str? pj_ansi_strlen(str) : 0;

    pj_assert(dst->slen >= 0);

    if (len && dst->slen >= 0) {
        pj_memcpy(dst->ptr + dst->slen, str, len);
        dst->slen += len;
    }
}

PJ_IDEF(pj_str_t*) pj_strtrim( pj_str_t *str )
{
    pj_strltrim(str);
    pj_strrtrim(str);
    return str;
}


Coverage Report

Created: 2025-08-26 06:58

Line	Count	Source (jump to first uncovered line)
1		/*
2		* Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
3		* Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
4		*
5		* This program is free software; you can redistribute it and/or modify
6		* it under the terms of the GNU General Public License as published by
7		* the Free Software Foundation; either version 2 of the License, or
8		* (at your option) any later version.
9		*
10		* This program is distributed in the hope that it will be useful,
11		* but WITHOUT ANY WARRANTY; without even the implied warranty of
12		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13		* GNU General Public License for more details.
14		*
15		* You should have received a copy of the GNU General Public License
16		* along with this program; if not, write to the Free Software
17		* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18		*/
19
20		#include <pj/assert.h>
21		#include <pj/pool.h>
22
23		PJ_IDEF(pj_str_t) pj_str(char *str)
24	39.3k	{
25	39.3k	pj_str_t dst;
26	39.3k	dst.ptr = str;
27	39.3k	dst.slen = str ? pj_ansi_strlen(str) : 0;
28	39.3k	return dst;
29	39.3k	}
30
31		PJ_IDEF(pj_str_t) pj_strdup(pj_pool_t pool,
32		pj_str_t *dst,
33		const pj_str_t *src)
34	13.0k	{
35	13.0k	pj_assert(src->slen >= 0);
36
37		/* Without this, destination will be corrupted */
38	13.0k	if (dst == src)
39	0	return dst;
40
41	13.0k	if (src->slen > 0) {
42	8.79k	dst->ptr = (char*)pj_pool_alloc(pool, src->slen);
43	8.79k	pj_memcpy(dst->ptr, src->ptr, src->slen);
44	8.79k	}
45	13.0k	dst->slen = (src->slen < 0)? 0: src->slen;
46	13.0k	return dst;
47	13.0k	}
48
49		PJ_IDEF(pj_str_t) pj_strdup_with_null( pj_pool_t pool,
50		pj_str_t *dst,
51		const pj_str_t *src)
52	5.00k	{
53	5.00k	pj_ssize_t src_slen = src->slen;
54
55	5.00k	pj_assert(src->slen >= 0);
56
57		/* Check if the source's length is invalid */
58	5.00k	if (src_slen < 0)
59	0	src_slen = 0;
60
61	5.00k	dst->ptr = (char*)pj_pool_alloc(pool, src_slen+1);
62	5.00k	if (src_slen) {
63	5.00k	pj_memcpy(dst->ptr, src->ptr, src_slen);
64	5.00k	}
65	5.00k	dst->slen = src_slen;
66	5.00k	dst->ptr[dst->slen] = '\0';
67	5.00k	return dst;
68	5.00k	}
69
70		PJ_IDEF(pj_str_t) pj_strdup2(pj_pool_t pool,
71		pj_str_t *dst,
72		const char *src)
73	0	{
74	0	dst->slen = src ? pj_ansi_strlen(src) : 0;
75	0	if (dst->slen) {
76	0	dst->ptr = (char*)pj_pool_alloc(pool, dst->slen);
77	0	pj_memcpy(dst->ptr, src, dst->slen);
78	0	} else {
79	0	dst->ptr = NULL;
80	0	}
81	0	return dst;
82	0	}
83
84		PJ_IDEF(pj_str_t) pj_strdup2_with_null( pj_pool_t pool,
85		pj_str_t *dst,
86		const char *src)
87	0	{
88	0	dst->slen = src ? pj_ansi_strlen(src) : 0;
89	0	dst->ptr = (char*)pj_pool_alloc(pool, dst->slen+1);
90	0	if (dst->slen) {
91	0	pj_memcpy(dst->ptr, src, dst->slen);
92	0	}
93	0	dst->ptr[dst->slen] = '\0';
94	0	return dst;
95	0	}
96
97		PJ_IDEF(pj_str_t) pj_strdup3(pj_pool_t pool, const char src)
98	0	{
99	0	pj_str_t temp;
100	0	pj_strdup2(pool, &temp, src);
101	0	return temp;
102	0	}
103
104		PJ_IDEF(pj_str_t) pj_strassign( pj_str_t dst, pj_str_t *src )
105	4.10k	{
106	4.10k	dst->ptr = src->ptr;
107	4.10k	dst->slen = src->slen;
108	4.10k	return dst;
109	4.10k	}
110
111		PJ_IDEF(pj_str_t) pj_strcpy(pj_str_t dst, const pj_str_t *src)
112	468	{
113	468	pj_assert(src->slen >= 0);
114
115	468	dst->slen = (src->slen < 0)? 0: src->slen;
116	468	if (src->slen > 0)
117	468	pj_memcpy(dst->ptr, src->ptr, src->slen);
118	468	return dst;
119	468	}
120
121		PJ_IDEF(pj_str_t) pj_strcpy2(pj_str_t dst, const char *src)
122	0	{
123	0	dst->slen = src ? pj_ansi_strlen(src) : 0;
124	0	if (dst->slen > 0)
125	0	pj_memcpy(dst->ptr, src, dst->slen);
126	0	return dst;
127	0	}
128
129		PJ_IDEF(pj_str_t) pj_strncpy( pj_str_t dst, const pj_str_t *src,
130		pj_ssize_t max)
131	0	{
132	0	pj_assert(src->slen >= 0);
133	0	pj_assert(max >= 0);
134
135	0	if (max > src->slen) max = src->slen;
136	0	if (max > 0)
137	0	pj_memcpy(dst->ptr, src->ptr, max);
138	0	dst->slen = (max < 0)? 0: max;
139	0	return dst;
140	0	}
141
142		PJ_IDEF(pj_str_t) pj_strncpy_with_null( pj_str_t dst, const pj_str_t *src,
143		pj_ssize_t max)
144	0	{
145	0	pj_assert(src->slen >= 0);
146	0	pj_assert(max > 0);
147
148	0	if (max <= src->slen)
149	0	max = (max > 0)? max-1: 0;
150	0	else
151	0	max = (src->slen < 0)? 0: src->slen;
152
153	0	if (max > 0)
154	0	pj_memcpy(dst->ptr, src->ptr, max);
155	0	dst->ptr[max] = '\0';
156	0	dst->slen = max;
157	0	return dst;
158	0	}
159
160
161		PJ_IDEF(int) pj_strcmp( const pj_str_t str1, const pj_str_t str2)
162	27.6k	{
163	27.6k	pj_assert(str1->slen >= 0);
164	27.6k	pj_assert(str2->slen >= 0);
165
166	27.6k	if (str1->slen <= 0) {
167	35	return str2->slen<=0 ? 0 : -1;
168	27.6k	} else if (str2->slen <= 0) {
169	0	return 1;
170	27.6k	} else {
171	27.6k	pj_size_t min = (str1->slen < str2->slen)? str1->slen : str2->slen;
172	27.6k	int res = pj_memcmp(str1->ptr, str2->ptr, min);
173	27.6k	if (res == 0) {
174	9.51k	return (str1->slen < str2->slen) ? -1 :
175	9.51k	(str1->slen == str2->slen ? 0 : 1);
176	18.1k	} else {
177	18.1k	return res;
178	18.1k	}
179	27.6k	}
180	27.6k	}
181
182		PJ_IDEF(int) pj_strncmp( const pj_str_t str1, const pj_str_t str2,
183		pj_size_t len)
184	0	{
185	0	pj_str_t copy1, copy2;
186
187	0	pj_assert(str1->slen >= 0);
188	0	pj_assert(str2->slen >= 0);
189
190	0	if (len < (unsigned)str1->slen && str1->slen > 0) {
191	0	copy1.ptr = str1->ptr;
192	0	copy1.slen = len;
193	0	str1 = &copy1;
194	0	}
195
196	0	if (len < (unsigned)str2->slen && str2->slen > 0) {
197	0	copy2.ptr = str2->ptr;
198	0	copy2.slen = len;
199	0	str2 = &copy2;
200	0	}
201
202	0	return pj_strcmp(str1, str2);
203	0	}
204
205		PJ_IDEF(int) pj_strncmp2( const pj_str_t str1, const char str2,
206		pj_size_t len)
207	0	{
208	0	pj_str_t copy2;
209
210	0	if (str2) {
211	0	copy2.ptr = (char*)str2;
212	0	copy2.slen = pj_ansi_strlen(str2);
213	0	} else {
214	0	copy2.slen = 0;
215	0	}
216
217	0	return pj_strncmp(str1, &copy2, len);
218	0	}
219
220		PJ_IDEF(int) pj_strcmp2( const pj_str_t str1, const char str2 )
221	3.33k	{
222	3.33k	pj_str_t copy2;
223
224	3.33k	if (str2) {
225	3.33k	copy2.ptr = (char*)str2;
226	3.33k	copy2.slen = pj_ansi_strlen(str2);
227	3.33k	} else {
228	0	copy2.ptr = NULL;
229	0	copy2.slen = 0;
230	0	}
231
232	3.33k	return pj_strcmp(str1, &copy2);
233	3.33k	}
234
235		PJ_IDEF(int) pj_stricmp( const pj_str_t str1, const pj_str_t str2)
236	142k	{
237	142k	pj_assert(str1->slen >= 0);
238	142k	pj_assert(str2->slen >= 0);
239
240	142k	if (str1->slen <= 0) {
241	6.65k	return str2->slen<=0 ? 0 : -1;
242	136k	} else if (str2->slen <= 0) {
243	2	return 1;
244	136k	} else {
245	136k	pj_size_t min = (str1->slen < str2->slen)? str1->slen : str2->slen;
246	136k	int res = pj_ansi_strnicmp(str1->ptr, str2->ptr, min);
247	136k	if (res == 0) {
248	55.2k	return (str1->slen < str2->slen) ? -1 :
249	55.2k	(str1->slen == str2->slen ? 0 : 1);
250	80.9k	} else {
251	80.9k	return res;
252	80.9k	}
253	136k	}
254	142k	}
255
256		#if defined(PJ_HAS_STRICMP_ALNUM) && PJ_HAS_STRICMP_ALNUM!=0
257		PJ_IDEF(int) strnicmp_alnum( const char str1, const char str2,
258		int len)
259		{
260		if (len==0)
261		return 0;
262		else {
263		register const pj_uint32_t p1 = (pj_uint32_t)str1,
264		p2 = (pj_uint32_t)str2;
265		while (len > 3 && (p1 & 0x5F5F5F5F)==(p2 & 0x5F5F5F5F))
266		++p1, ++p2, len-=4;
267
268		if (len > 3)
269		return -1;
270		#if defined(PJ_IS_LITTLE_ENDIAN) && PJ_IS_LITTLE_ENDIAN!=0
271		else if (len==3)
272		return ((p1 & 0x005F5F5F)==(p2 & 0x005F5F5F)) ? 0 : -1;
273		else if (len==2)
274		return ((p1 & 0x00005F5F)==(p2 & 0x00005F5F)) ? 0 : -1;
275		else if (len==1)
276		return ((p1 & 0x0000005F)==(p2 & 0x0000005F)) ? 0 : -1;
277		#else
278		else if (len==3)
279		return ((p1 & 0x5F5F5F00)==(p2 & 0x5F5F5F00)) ? 0 : -1;
280		else if (len==2)
281		return ((p1 & 0x5F5F0000)==(p2 & 0x5F5F0000)) ? 0 : -1;
282		else if (len==1)
283		return ((p1 & 0x5F000000)==(p2 & 0x5F000000)) ? 0 : -1;
284		#endif
285		else
286		return 0;
287		}
288		}
289
290		PJ_IDEF(int) pj_stricmp_alnum(const pj_str_t str1, const pj_str_t str2)
291		{
292		register int len = str1->slen;
293
294		if (len != str2->slen) {
295		return (len < str2->slen) ? -1 : 1;
296		} else if (len == 0) {
297		return 0;
298		} else {
299		register const pj_uint32_t p1 = (pj_uint32_t)str1->ptr,
300		p2 = (pj_uint32_t)str2->ptr;
301		while (len > 3 && (p1 & 0x5F5F5F5F)==(p2 & 0x5F5F5F5F))
302		++p1, ++p2, len-=4;
303
304		if (len > 3)
305		return -1;
306		#if defined(PJ_IS_LITTLE_ENDIAN) && PJ_IS_LITTLE_ENDIAN!=0
307		else if (len==3)
308		return ((p1 & 0x005F5F5F)==(p2 & 0x005F5F5F)) ? 0 : -1;
309		else if (len==2)
310		return ((p1 & 0x00005F5F)==(p2 & 0x00005F5F)) ? 0 : -1;
311		else if (len==1)
312		return ((p1 & 0x0000005F)==(p2 & 0x0000005F)) ? 0 : -1;
313		#else
314		else if (len==3)
315		return ((p1 & 0x5F5F5F00)==(p2 & 0x5F5F5F00)) ? 0 : -1;
316		else if (len==2)
317		return ((p1 & 0x5F5F0000)==(p2 & 0x5F5F0000)) ? 0 : -1;
318		else if (len==1)
319		return ((p1 & 0x5F000000)==(p2 & 0x5F000000)) ? 0 : -1;
320		#endif
321		else
322		return 0;
323		}
324		}
325		#endif /* PJ_HAS_STRICMP_ALNUM */
326
327		PJ_IDEF(int) pj_stricmp2( const pj_str_t str1, const char str2)
328	7.92k	{
329	7.92k	pj_str_t copy2;
330
331	7.92k	if (str2) {
332	7.92k	copy2.ptr = (char*)str2;
333	7.92k	copy2.slen = pj_ansi_strlen(str2);
334	7.92k	} else {
335	0	copy2.ptr = NULL;
336	0	copy2.slen = 0;
337	0	}
338
339	7.92k	return pj_stricmp(str1, &copy2);
340	7.92k	}
341
342		PJ_IDEF(int) pj_strnicmp( const pj_str_t str1, const pj_str_t str2,
343		pj_size_t len)
344	0	{
345	0	pj_str_t copy1, copy2;
346
347	0	if (len < (unsigned)str1->slen && str1->slen > 0) {
348	0	copy1.ptr = str1->ptr;
349	0	copy1.slen = len;
350	0	str1 = &copy1;
351	0	}
352
353	0	if (len < (unsigned)str2->slen && str2->slen > 0) {
354	0	copy2.ptr = str2->ptr;
355	0	copy2.slen = len;
356	0	str2 = &copy2;
357	0	}
358
359	0	return pj_stricmp(str1, str2);
360	0	}
361
362		PJ_IDEF(int) pj_strnicmp2( const pj_str_t str1, const char str2,
363		pj_size_t len)
364	0	{
365	0	pj_str_t copy2;
366
367	0	if (str2) {
368	0	copy2.ptr = (char*)str2;
369	0	copy2.slen = pj_ansi_strlen(str2);
370	0	} else {
371	0	copy2.slen = 0;
372	0	}
373
374	0	return pj_strnicmp(str1, &copy2, len);
375	0	}
376
377		PJ_IDEF(void) pj_strcat(pj_str_t dst, const pj_str_t src)
378	468	{
379	468	pj_assert(src->slen >= 0);
380	468	pj_assert(dst->slen >= 0);
381
382	468	if (src->slen > 0 && dst->slen >= 0) {
383	468	pj_memcpy(dst->ptr + dst->slen, src->ptr, src->slen);
384	468	dst->slen += src->slen;
385	468	}
386	468	}
387
388		PJ_IDEF(void) pj_strcat2(pj_str_t dst, const char str)
389	468	{
390	468	pj_size_t len = str? pj_ansi_strlen(str) : 0;
391
392	468	pj_assert(dst->slen >= 0);
393
394	468	if (len && dst->slen >= 0) {
395	468	pj_memcpy(dst->ptr + dst->slen, str, len);
396	468	dst->slen += len;
397	468	}
398	468	}
399
400		PJ_IDEF(pj_str_t) pj_strtrim( pj_str_t str )
401	431	{
402	431	pj_strltrim(str);
403	431	pj_strrtrim(str);
404	431	return str;
405	431	}
406