Split PJLIB utilities into pjutil

git-svn-id: http://svn.pjsip.org/repos/pjproject/main@29 74dad513-b988-da41-8d7b-12977e46ad98

5 files changed, 0 insertions, 1704 deletions

diff --git a/pjlib/src/pj/md5.c b/pjlib/src/pj/md5.c
deleted file mode 100644
index 7e78c9e0..00000000
--- a/pjlib/src/pj/md5.c
+++ /dev/null
@@ -1,406 +0,0 @@
-/* $Id$
- */
-/*
-  Copyright (C) 1999, 2000, 2002 Aladdin Enterprises.  All rights reserved.
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the authors be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  L. Peter Deutsch
-  ghost@aladdin.com
-
- */
-/* Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp */
-/*
-  Independent implementation of MD5 (RFC 1321).
-
-  This code implements the MD5 Algorithm defined in RFC 1321, whose
-  text is available at
-	http://www.ietf.org/rfc/rfc1321.txt
-  The code is derived from the text of the RFC, including the test suite
-  (section A.5) but excluding the rest of Appendix A.  It does not include
-  any code or documentation that is identified in the RFC as being
-  copyrighted.
-
-  The original and principal author of md5.c is L. Peter Deutsch
-  <ghost@aladdin.com>.  Other authors are noted in the change history
-  that follows (in reverse chronological order):
-
-  2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
-	either statically or dynamically; added missing #include <string.h>
-	in library.
-  2002-03-11 lpd Corrected argument list for main(), and added int return
-	type, in test program and T value program.
-  2002-02-21 lpd Added missing #include <stdio.h> in test program.
-  2000-07-03 lpd Patched to eliminate warnings about "constant is
-	unsigned in ANSI C, signed in traditional"; made test program
-	self-checking.
-  1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
-  1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
-  1999-05-03 lpd Original version.
- */
-
-#include <pj/md5.h>
-#include <pj/string.h>
-#include <pj/os.h>
-
-#undef BYTE_ORDER	/* 1 = big-endian, -1 = little-endian, 0 = unknown */
-
-/*
-#ifdef ARCH_IS_BIG_ENDIAN
-#  define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
-#else
-#  define BYTE_ORDER 0
-#endif
-*/
-/* pjlib: */
-#include <pj/config.h>
-#if PJ_IS_LITTLE_ENDIAN
-#  define BYTE_ORDER -1
-#elif PJ_IS_BIG_ENDIAN
-#  define BYTE_ORDER 1
-#else
-#  error Endianess is not known!
-#endif
-
-
-#define T_MASK ((md5_word_t)~0)
-#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
-#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
-#define T3    0x242070db
-#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
-#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
-#define T6    0x4787c62a
-#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
-#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
-#define T9    0x698098d8
-#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
-#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
-#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
-#define T13    0x6b901122
-#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
-#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
-#define T16    0x49b40821
-#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
-#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
-#define T19    0x265e5a51
-#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
-#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
-#define T22    0x02441453
-#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
-#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
-#define T25    0x21e1cde6
-#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
-#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
-#define T28    0x455a14ed
-#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
-#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
-#define T31    0x676f02d9
-#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
-#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
-#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
-#define T35    0x6d9d6122
-#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
-#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
-#define T38    0x4bdecfa9
-#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
-#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
-#define T41    0x289b7ec6
-#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
-#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
-#define T44    0x04881d05
-#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
-#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
-#define T47    0x1fa27cf8
-#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
-#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
-#define T50    0x432aff97
-#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
-#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
-#define T53    0x655b59c3
-#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
-#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
-#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
-#define T57    0x6fa87e4f
-#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
-#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
-#define T60    0x4e0811a1
-#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
-#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
-#define T63    0x2ad7d2bb
-#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
-
-
-static void
-md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
-{
-    md5_word_t
-	a = pms->abcd[0], b = pms->abcd[1],
-	c = pms->abcd[2], d = pms->abcd[3];
-    md5_word_t t;
-#if BYTE_ORDER > 0
-    /* Define storage only for big-endian CPUs. */
-    md5_word_t X[16];
-#else
-    /* Define storage for little-endian or both types of CPUs. */
-    md5_word_t xbuf[16];
-    const md5_word_t *X;
-#endif
-
-    PJ_CHECK_STACK();
-
-    {
-#if BYTE_ORDER == 0
-	/*
-	 * Determine dynamically whether this is a big-endian or
-	 * little-endian machine, since we can use a more efficient
-	 * algorithm on the latter.
-	 */
-	static const int w = 1;
-
-	if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
-#endif
-#if BYTE_ORDER <= 0		/* little-endian */
-	{
-	    /*
-	     * On little-endian machines, we can process properly aligned
-	     * data without copying it.
-	     */
-	    if (!((data - (const md5_byte_t *)0) & 3)) {
-		/* data are properly aligned */
-		X = (const md5_word_t *)data;
-	    } else {
-		/* not aligned */
-		memcpy(xbuf, data, 64);
-		X = xbuf;
-	    }
-	}
-#endif
-#if BYTE_ORDER == 0
-	else			/* dynamic big-endian */
-#endif
-#if BYTE_ORDER >= 0		/* big-endian */
-	{
-	    /*
-	     * On big-endian machines, we must arrange the bytes in the
-	     * right order.
-	     */
-	    const md5_byte_t *xp = data;
-	    int i;
-
-#  if BYTE_ORDER == 0
-	    X = xbuf;		/* (dynamic only) */
-#  else
-#    define xbuf X		/* (static only) */
-#  endif
-	    for (i = 0; i < 16; ++i, xp += 4)
-		xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
-	}
-#endif
-    }
-
-#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
-
-    /* Round 1. */
-    /* Let [abcd k s i] denote the operation
-       a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
-#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + F(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-    /* Do the following 16 operations. */
-    SET(a, b, c, d,  0,  7,  T1);
-    SET(d, a, b, c,  1, 12,  T2);
-    SET(c, d, a, b,  2, 17,  T3);
-    SET(b, c, d, a,  3, 22,  T4);
-    SET(a, b, c, d,  4,  7,  T5);
-    SET(d, a, b, c,  5, 12,  T6);
-    SET(c, d, a, b,  6, 17,  T7);
-    SET(b, c, d, a,  7, 22,  T8);
-    SET(a, b, c, d,  8,  7,  T9);
-    SET(d, a, b, c,  9, 12, T10);
-    SET(c, d, a, b, 10, 17, T11);
-    SET(b, c, d, a, 11, 22, T12);
-    SET(a, b, c, d, 12,  7, T13);
-    SET(d, a, b, c, 13, 12, T14);
-    SET(c, d, a, b, 14, 17, T15);
-    SET(b, c, d, a, 15, 22, T16);
-#undef SET
-
-     /* Round 2. */
-     /* Let [abcd k s i] denote the operation
-          a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
-#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + G(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  1,  5, T17);
-    SET(d, a, b, c,  6,  9, T18);
-    SET(c, d, a, b, 11, 14, T19);
-    SET(b, c, d, a,  0, 20, T20);
-    SET(a, b, c, d,  5,  5, T21);
-    SET(d, a, b, c, 10,  9, T22);
-    SET(c, d, a, b, 15, 14, T23);
-    SET(b, c, d, a,  4, 20, T24);
-    SET(a, b, c, d,  9,  5, T25);
-    SET(d, a, b, c, 14,  9, T26);
-    SET(c, d, a, b,  3, 14, T27);
-    SET(b, c, d, a,  8, 20, T28);
-    SET(a, b, c, d, 13,  5, T29);
-    SET(d, a, b, c,  2,  9, T30);
-    SET(c, d, a, b,  7, 14, T31);
-    SET(b, c, d, a, 12, 20, T32);
-#undef SET
-
-     /* Round 3. */
-     /* Let [abcd k s t] denote the operation
-          a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
-#define H(x, y, z) ((x) ^ (y) ^ (z))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + H(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  5,  4, T33);
-    SET(d, a, b, c,  8, 11, T34);
-    SET(c, d, a, b, 11, 16, T35);
-    SET(b, c, d, a, 14, 23, T36);
-    SET(a, b, c, d,  1,  4, T37);
-    SET(d, a, b, c,  4, 11, T38);
-    SET(c, d, a, b,  7, 16, T39);
-    SET(b, c, d, a, 10, 23, T40);
-    SET(a, b, c, d, 13,  4, T41);
-    SET(d, a, b, c,  0, 11, T42);
-    SET(c, d, a, b,  3, 16, T43);
-    SET(b, c, d, a,  6, 23, T44);
-    SET(a, b, c, d,  9,  4, T45);
-    SET(d, a, b, c, 12, 11, T46);
-    SET(c, d, a, b, 15, 16, T47);
-    SET(b, c, d, a,  2, 23, T48);
-#undef SET
-
-     /* Round 4. */
-     /* Let [abcd k s t] denote the operation
-          a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
-#define I(x, y, z) ((y) ^ ((x) | ~(z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + I(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  0,  6, T49);
-    SET(d, a, b, c,  7, 10, T50);
-    SET(c, d, a, b, 14, 15, T51);
-    SET(b, c, d, a,  5, 21, T52);
-    SET(a, b, c, d, 12,  6, T53);
-    SET(d, a, b, c,  3, 10, T54);
-    SET(c, d, a, b, 10, 15, T55);
-    SET(b, c, d, a,  1, 21, T56);
-    SET(a, b, c, d,  8,  6, T57);
-    SET(d, a, b, c, 15, 10, T58);
-    SET(c, d, a, b,  6, 15, T59);
-    SET(b, c, d, a, 13, 21, T60);
-    SET(a, b, c, d,  4,  6, T61);
-    SET(d, a, b, c, 11, 10, T62);
-    SET(c, d, a, b,  2, 15, T63);
-    SET(b, c, d, a,  9, 21, T64);
-#undef SET
-
-     /* Then perform the following additions. (That is increment each
-        of the four registers by the value it had before this block
-        was started.) */
-    pms->abcd[0] += a;
-    pms->abcd[1] += b;
-    pms->abcd[2] += c;
-    pms->abcd[3] += d;
-}
-
-void
-md5_init(md5_state_t *pms)
-{
-    PJ_CHECK_STACK();
-
-    pms->count[0] = pms->count[1] = 0;
-    pms->abcd[0] = 0x67452301;
-    pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
-    pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
-    pms->abcd[3] = 0x10325476;
-}
-
-void
-md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
-{
-    const md5_byte_t *p = data;
-    int left = nbytes;
-    int offset = (pms->count[0] >> 3) & 63;
-    md5_word_t nbits = (md5_word_t)(nbytes << 3);
-
-    PJ_CHECK_STACK();
-
-    if (nbytes <= 0)
-	return;
-
-    /* Update the message length. */
-    pms->count[1] += nbytes >> 29;
-    pms->count[0] += nbits;
-    if (pms->count[0] < nbits)
-	pms->count[1]++;
-
-    /* Process an initial partial block. */
-    if (offset) {
-	int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
-
-	memcpy(pms->buf + offset, p, copy);
-	if (offset + copy < 64)
-	    return;
-	p += copy;
-	left -= copy;
-	md5_process(pms, pms->buf);
-    }
-
-    /* Process full blocks. */
-    for (; left >= 64; p += 64, left -= 64)
-	md5_process(pms, p);
-
-    /* Process a final partial block. */
-    if (left)
-	memcpy(pms->buf, p, left);
-}
-
-void
-md5_finish(md5_state_t *pms, md5_byte_t digest[16])
-{
-    static const md5_byte_t pad[64] = {
-	0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-    };
-    md5_byte_t data[8];
-    int i;
-
-    PJ_CHECK_STACK();
-
-    /* Save the length before padding. */
-    for (i = 0; i < 8; ++i)
-	data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
-    /* Pad to 56 bytes mod 64. */
-    md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
-    /* Append the length. */
-    md5_append(pms, data, 8);
-    for (i = 0; i < 16; ++i)
-	digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
-}
-
diff --git a/pjlib/src/pj/scanner.c b/pjlib/src/pj/scanner.c
deleted file mode 100644
index b054f1d1..00000000
--- a/pjlib/src/pj/scanner.c
+++ /dev/null
@@ -1,544 +0,0 @@
-/* $Id$
- */
-#include <pj/scanner.h>
-#include <pj/string.h>
-#include <pj/except.h>
-#include <pj/os.h>
-
-#define PJ_SCAN_IS_SPACE(c)	((c)==' ' || (c)=='\t')
-#define PJ_SCAN_IS_NEWLINE(c)	((c)=='\r' || (c)=='\n')
-#define PJ_SCAN_CHECK_EOF(s)	(s != end)
-
-
-static void pj_scan_syntax_err(pj_scanner *scanner)
-{
-    (*scanner->callback)(scanner);
-}
-
-PJ_DEF(void) pj_cs_init( pj_char_spec cs)
-{
-    PJ_CHECK_STACK();
-    memset(cs, 0, sizeof(cs));
-}
-
-PJ_DEF(void) pj_cs_set( pj_char_spec cs, int c)
-{
-    PJ_CHECK_STACK();
-    cs[c] = 1;
-}
-
-PJ_DEF(void) pj_cs_add_range( pj_char_spec cs, int cstart, int cend)
-{
-    PJ_CHECK_STACK();
-    while (cstart != cend)
-	cs[cstart++] = 1;
-}
-
-PJ_DEF(void) pj_cs_add_alpha( pj_char_spec cs)
-{
-    pj_cs_add_range( cs, 'a', 'z'+1);
-    pj_cs_add_range( cs, 'A', 'Z'+1);
-}
-
-PJ_DEF(void) pj_cs_add_num( pj_char_spec cs)
-{
-    pj_cs_add_range( cs, '0', '9'+1);
-}
-
-PJ_DEF(void) pj_cs_add_str( pj_char_spec cs, const char *str)
-{
-    PJ_CHECK_STACK();
-    while (*str) {
-        cs[(int)*str] = 1;
-	++str;
-    }
-}
-
-PJ_DEF(void) pj_cs_del_range( pj_char_spec cs, int cstart, int cend)
-{
-    PJ_CHECK_STACK();
-    while (cstart != cend)
-	cs[cstart++] = 0;
-}
-
-PJ_DEF(void) pj_cs_del_str( pj_char_spec cs, const char *str)
-{
-    PJ_CHECK_STACK();
-    while (*str) {
-        cs[(int)*str] = 0;
-	++str;
-    }
-}
-
-PJ_DEF(void) pj_cs_invert( pj_char_spec cs )
-{
-    unsigned i;
-    PJ_CHECK_STACK();
-    for (i=0; i<sizeof(pj_char_spec)/sizeof(cs[0]); ++i) {
-	cs[i] = (pj_char_spec_element_t) !cs[i];
-    }
-}
-
-PJ_DEF(void) pj_scan_init( pj_scanner *scanner, char *bufstart, int buflen, 
-			   unsigned options, pj_syn_err_func_ptr callback )
-{
-    PJ_CHECK_STACK();
-
-    scanner->begin = scanner->curptr = bufstart;
-    scanner->end = bufstart + buflen;
-    scanner->line = 1;
-    scanner->col = 1;
-    scanner->callback = callback;
-    scanner->skip_ws = options;
-
-    if (scanner->skip_ws) 
-	pj_scan_skip_whitespace(scanner);
-
-    scanner->col = scanner->curptr - scanner->begin + 1;
-}
-
-
-PJ_DEF(void) pj_scan_fini( pj_scanner *scanner )
-{
-    PJ_CHECK_STACK();
-    PJ_UNUSED_ARG(scanner);
-}
-
-PJ_DEF(void) pj_scan_skip_whitespace( pj_scanner *scanner )
-{
-    register char *s = scanner->curptr;
-
-    PJ_CHECK_STACK();
-
-    while (PJ_SCAN_IS_SPACE(*s)) {
-	++s;
-    }
-
-    if ((scanner->skip_ws & PJ_SCAN_AUTOSKIP_NEWLINE) && PJ_SCAN_IS_NEWLINE(*s)) {
-	for (;;) {
-	    if (*s == '\r') {
-		++s;
-		if (*s == '\n') ++s;
-		++scanner->line;
-		scanner->col = 1;
-		scanner->curptr = s;
-	    } else if (*s == '\n') {
-		++s;
-		++scanner->line;
-		scanner->col = 1;
-		scanner->curptr = s;
-	    } else if (PJ_SCAN_IS_SPACE(*s)) {
-		do {
-		    ++s;
-		} while (PJ_SCAN_IS_SPACE(*s));
-	    } else {
-		break;
-	    }
-	}
-    }
-
-    if (PJ_SCAN_IS_NEWLINE(*s) && (scanner->skip_ws & PJ_SCAN_AUTOSKIP_WS_HEADER)==PJ_SCAN_AUTOSKIP_WS_HEADER) {
-	/* Check for header continuation. */
-	scanner->col += s - scanner->curptr;
-	scanner->curptr = s;
-
-	if (*s == '\r') {
-	    ++s;
-	}
-	if (*s == '\n') {
-	    ++s;
-	}
-	if (PJ_SCAN_IS_SPACE(*s)) {
-	    register char *t = s;
-	    do {
-		++t;
-	    } while (PJ_SCAN_IS_SPACE(*t));
-
-	    ++scanner->line;
-	    scanner->col = t-s;
-	    scanner->curptr = t;
-	}
-    } else {
-	scanner->col += s - scanner->curptr;
-	scanner->curptr = s;
-    }
-}
-
-PJ_DEF(int) pj_scan_peek( pj_scanner *scanner,
-			   const pj_char_spec spec, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return -1;
-    }
-
-    while (PJ_SCAN_CHECK_EOF(s) && pj_cs_match(spec, *s))
-	++s;
-
-    pj_strset3(out, scanner->curptr, s);
-    return s < scanner->end ? *s : 0;
-}
-
-
-PJ_DEF(int) pj_scan_peek_n( pj_scanner *scanner,
-			     pj_size_t len, pj_str_t *out)
-{
-    char *endpos = scanner->curptr + len;
-
-    PJ_CHECK_STACK();
-
-    if (endpos > scanner->end) {
-	pj_scan_syntax_err(scanner);
-	return -1;
-    }
-
-    pj_strset(out, scanner->curptr, len);
-    return *endpos;
-}
-
-
-PJ_DEF(int) pj_scan_peek_until( pj_scanner *scanner,
-				  const pj_char_spec spec, 
-				  pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return -1;
-    }
-
-    while (PJ_SCAN_CHECK_EOF(s) && !pj_cs_match( spec, *s))
-	++s;
-
-    pj_strset3(out, scanner->curptr, s);
-    return s!=scanner->end ? *s : 0;
-}
-
-
-PJ_DEF(void) pj_scan_get( pj_scanner *scanner,
-			   const pj_char_spec spec, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-    char *start = s;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner) || !pj_cs_match(spec, *s)) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    do {
-	++s;
-    } while (PJ_SCAN_CHECK_EOF(s) && pj_cs_match(spec, *s));
-
-    pj_strset3(out, scanner->curptr, s);
-
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);    
-    }
-}
-
-
-PJ_DEF(void) pj_scan_get_quote( pj_scanner *scanner,
-				 int begin_quote, int end_quote, 
-				 pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-    char *start = s;
-    
-    PJ_CHECK_STACK();
-
-    /* Check and eat the begin_quote. */
-    if (*s != begin_quote) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-    ++s;
-
-    /* Loop until end_quote is found. 
-     */
-    do {
-	/* loop until end_quote is found. */
-	do {
-	    ++s;
-	} while (s != end && *s != '\n' && *s != end_quote);
-
-	/* check that no backslash character precedes the end_quote. */
-	if (*s == end_quote) {
-	    if (*(s-1) == '\\') {
-		if (s-2 == scanner->begin) {
-		    break;
-		} else {
-		    char *q = s-2;
-		    char *r = s-2;
-
-		    while (r != scanner->begin && *r == '\\') {
-			--r;
-		    }
-		    /* break from main loop if we have odd number of backslashes */
-		    if (((unsigned)(q-r) & 0x01) == 1) {
-			break;
-		    }
-		}
-	    } else {
-		/* end_quote is not preceeded by backslash. break now. */
-		break;
-	    }
-	} else {
-	    /* loop ended by non-end_quote character. break now. */
-	    break;
-	}
-    } while (1);
-
-    /* Check and eat the end quote. */
-    if (*s != end_quote) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-    ++s;
-
-    pj_strset3(out, scanner->curptr, s);
-
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-PJ_DEF(void) pj_scan_get_n( pj_scanner *scanner,
-			     unsigned N, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    char *start = scanner->curptr;
-
-    PJ_CHECK_STACK();
-
-    if (scanner->curptr + N > scanner->end) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    pj_strset(out, s, N);
-    
-    s += N;
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-
-PJ_DEF(int) pj_scan_get_char( pj_scanner *scanner )
-{
-    char *start = scanner->curptr;
-    int chr = *start;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return 0;
-    }
-
-    ++scanner->curptr;
-    scanner->col += (scanner->curptr - start);
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-    return chr;
-}
-
-
-PJ_DEF(void) pj_scan_get_newline( pj_scanner *scanner )
-{
-    PJ_CHECK_STACK();
-
-    if (!PJ_SCAN_IS_NEWLINE(*scanner->curptr)) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    if (*scanner->curptr == '\r') {
-	++scanner->curptr;
-    }
-    if (*scanner->curptr == '\n') {
-	++scanner->curptr;
-    }
-
-    ++scanner->line;
-    scanner->col = 1;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-
-PJ_DEF(void) pj_scan_get_until( pj_scanner *scanner,
-				 const pj_char_spec spec, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-    char *start = s;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    while (PJ_SCAN_CHECK_EOF(s) && !pj_cs_match(spec, *s)) {
-	++s;
-    }
-
-    pj_strset3(out, scanner->curptr, s);
-
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-
-PJ_DEF(void) pj_scan_get_until_ch( pj_scanner *scanner, 
-				    int until_char, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-    char *start = s;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    while (PJ_SCAN_CHECK_EOF(s) && *s != until_char) {
-	++s;
-    }
-
-    pj_strset3(out, scanner->curptr, s);
-
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-
-PJ_DEF(void) pj_scan_get_until_chr( pj_scanner *scanner,
-				     const char *until_spec, pj_str_t *out)
-{
-    register char *s = scanner->curptr;
-    register char *end = scanner->end;
-    char *start = scanner->curptr;
-
-    PJ_CHECK_STACK();
-
-    if (pj_scan_is_eof(scanner)) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    while (PJ_SCAN_CHECK_EOF(s) && !strchr(until_spec, *s)) {
-	++s;
-    }
-
-    pj_strset3(out, scanner->curptr, s);
-
-    scanner->col += (s - start);
-    scanner->curptr = s;
-
-    if (scanner->skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-PJ_DEF(void) pj_scan_advance_n( pj_scanner *scanner,
-				 unsigned N, pj_bool_t skip_ws)
-{
-    char *start = scanner->curptr;
-
-    PJ_CHECK_STACK();
-
-    if (scanner->curptr + N > scanner->end) {
-	pj_scan_syntax_err(scanner);
-	return;
-    }
-
-    scanner->curptr += N;
-    scanner->col += (scanner->curptr - start);
-
-    if (skip_ws) {
-	pj_scan_skip_whitespace(scanner);
-    }
-}
-
-
-PJ_DEF(int) pj_scan_strcmp( pj_scanner *scanner, const char *s, int len)
-{
-    if (scanner->curptr + len > scanner->end) {
-	pj_scan_syntax_err(scanner);
-	return -1;
-    }
-    return strncmp(scanner->curptr, s, len);
-}
-
-
-PJ_DEF(int) pj_scan_stricmp( pj_scanner *scanner, const char *s, int len)
-{
-    if (scanner->curptr + len > scanner->end) {
-	pj_scan_syntax_err(scanner);
-	return -1;
-    }
-    return strnicmp(scanner->curptr, s, len);
-}
-
-
-PJ_DEF(void) pj_scan_save_state( pj_scanner *scanner, pj_scan_state *state)
-{
-    PJ_CHECK_STACK();
-
-    state->curptr = scanner->curptr;
-    state->line = scanner->line;
-    state->col = scanner->col;
-}
-
-
-PJ_DEF(void) pj_scan_restore_state( pj_scanner *scanner, 
-				     pj_scan_state *state)
-{
-    PJ_CHECK_STACK();
-
-    scanner->curptr = state->curptr;
-    scanner->line = state->line;
-    scanner->col = state->col;
-}
-
-
diff --git a/pjlib/src/pj/stun.c b/pjlib/src/pj/stun.c
deleted file mode 100644
index 90dd36a8..00000000
--- a/pjlib/src/pj/stun.c
+++ /dev/null
@@ -1,113 +0,0 @@
-/* $Id$
- */
-#include <pj/stun.h>
-#include <pj/pool.h>
-#include <pj/log.h>
-#include <pj/sock.h>
-#include <pj/os.h>
-
-#define THIS_FILE   "stun"
-
-PJ_DEF(pj_status_t) pj_stun_create_bind_req( pj_pool_t *pool, 
-					     void **msg, pj_size_t *len,
-					     pj_uint32_t id_hi, 
-					     pj_uint32_t id_lo)
-{
-    pj_stun_msg_hdr *hdr;
-    
-    PJ_CHECK_STACK();
-
-    PJ_LOG(5,(THIS_FILE, "pj_stun_create_bind_req"));
-
-    hdr = pj_pool_calloc(pool, 1, sizeof(pj_stun_msg_hdr));
-    if (!hdr) {
-	PJ_LOG(5,(THIS_FILE, "Error allocating memory!"));
-	return -1;
-    }
-
-    hdr->type = pj_htons(PJ_STUN_BINDING_REQUEST);
-    hdr->tsx[2] = pj_htonl(id_hi);
-    hdr->tsx[3] = pj_htonl(id_lo);
-    *msg = hdr;
-    *len = sizeof(pj_stun_msg_hdr);
-
-    return 0;
-}
-
-PJ_DEF(pj_status_t) pj_stun_parse_msg( void *buf, pj_size_t len, 
-				       pj_stun_msg *msg)
-{
-    pj_uint16_t msg_type, msg_len;
-    char *p_attr;
-
-    PJ_CHECK_STACK();
-
-    PJ_LOG(5,(THIS_FILE, "pj_stun_parse_msg %p, len=%d", buf, len));
-
-    msg->hdr = (pj_stun_msg_hdr*)buf;
-    msg_type = pj_ntohs(msg->hdr->type);
-
-    switch (msg_type) {
-    case PJ_STUN_BINDING_REQUEST:
-    case PJ_STUN_BINDING_RESPONSE:
-    case PJ_STUN_BINDING_ERROR_RESPONSE:
-    case PJ_STUN_SHARED_SECRET_REQUEST:
-    case PJ_STUN_SHARED_SECRET_RESPONSE:
-    case PJ_STUN_SHARED_SECRET_ERROR_RESPONSE:
-	break;
-    default:
-	PJ_LOG(5,(THIS_FILE, "Error: unknown msg type %d", msg_type));
-	return -1;
-    }
-
-    msg_len = pj_ntohs(msg->hdr->length);
-    if (msg_len != len - sizeof(pj_stun_msg_hdr)) {
-	PJ_LOG(5,(THIS_FILE, "Error: invalid msg_len %d (expecting %d)", 
-			     msg_len, len - sizeof(pj_stun_msg_hdr)));
-	return -1;
-    }
-
-    msg->attr_count = 0;
-    p_attr = (char*)buf + sizeof(pj_stun_msg_hdr);
-
-    while (msg_len > 0) {
-	pj_stun_attr_hdr **attr = &msg->attr[msg->attr_count];
-	pj_uint32_t len;
-
-	*attr = (pj_stun_attr_hdr*)p_attr;
-	len = pj_ntohs((pj_uint16_t) ((*attr)->length)) + sizeof(pj_stun_attr_hdr);
-
-	if (msg_len < len) {
-	    PJ_LOG(5,(THIS_FILE, "Error: length mismatch in attr %d", 
-				 msg->attr_count));
-	    return -1;
-	}
-
-	if (pj_ntohs((*attr)->type) > PJ_STUN_ATTR_REFLECTED_FORM) {
-	    PJ_LOG(5,(THIS_FILE, "Error: invalid attr type %d in attr %d",
-				 pj_ntohs((*attr)->type), msg->attr_count));
-	    return -1;
-	}
-
-	msg_len = (pj_uint16_t)(msg_len - len);
-	p_attr += len;
-	++msg->attr_count;
-    }
-
-    return 0;
-}
-
-PJ_DEF(void*) pj_stun_msg_find_attr( pj_stun_msg *msg, pj_stun_attr_type t)
-{
-    int i;
-
-    PJ_CHECK_STACK();
-
-    for (i=0; i<msg->attr_count; ++i) {
-	pj_stun_attr_hdr *attr = msg->attr[i];
-	if (pj_ntohs(attr->type) == t)
-	    return attr;
-    }
-
-    return 0;
-}
diff --git a/pjlib/src/pj/stun_client.c b/pjlib/src/pj/stun_client.c
deleted file mode 100644
index 75d20ee6..00000000
--- a/pjlib/src/pj/stun_client.c
+++ /dev/null
@@ -1,261 +0,0 @@
-/* $Id$
- */
-#include <pj/stun.h>
-#include <pj/pool.h>
-#include <pj/log.h>
-#include <pj/string.h>
-#include <pj/os.h>
-#include <pj/sock_select.h>
-
-enum { MAX_REQUEST = 3 };
-static int stun_timer[] = {1600, 1600, 1600 };
-
-#define THIS_FILE	"stunclient"
-#define LOG_ADDR(addr)	pj_inet_ntoa(addr.sin_addr), pj_ntohs(addr.sin_port)
-
-
-PJ_DECL(pj_status_t) pj_stun_get_mapped_addr( pj_pool_factory *pf,
-					      int sock_cnt, pj_sock_t sock[],
-					      const pj_str_t *srv1, int port1,
-					      const pj_str_t *srv2, int port2,
-					      pj_sockaddr_in mapped_addr[])
-{
-    pj_sockaddr_in srv_addr[2];
-    int i, j, rc, send_cnt = 0;
-    pj_pool_t *pool;
-    struct {
-	struct {
-	    pj_uint32_t	mapped_addr;
-	    pj_uint32_t	mapped_port;
-	} srv[2];
-    } *rec;
-    void       *out_msg;
-    pj_size_t	out_msg_len;
-    int wait_resp = 0;
-    int mapped_status = 0;
-
-    PJ_CHECK_STACK();
-
-    /* Create pool. */
-    pool = pj_pool_create(pf, "stun%p", 1024, 1024, NULL);
-    if (!pool) {
-	mapped_status = PJ_STUN_ERR_MEMORY; 
-	return -1;
-    }
-
-    /* Allocate client records */
-    rec = pj_pool_calloc(pool, sock_cnt, sizeof(*rec));
-    if (!rec) {
-	mapped_status = PJ_STUN_ERR_MEMORY; 
-	goto on_error;
-    }
-
-    /* Create the outgoing BIND REQUEST message template */
-    rc = pj_stun_create_bind_req( pool, &out_msg, &out_msg_len, 0, 0);
-    if (rc != 0) {
-	mapped_status = -1;
-	goto on_error;
-    }
-
-    /* Resolve servers. */
-    if (pj_sockaddr_in_init(&srv_addr[0], srv1, (pj_uint16_t)port1) != 0) {
-	mapped_status = PJ_STUN_ERR_RESOLVE; 
-	goto on_error;
-    }
-    if (pj_sockaddr_in_init(&srv_addr[1], srv2, (pj_uint16_t)port2) != 0) {
-	mapped_status = PJ_STUN_ERR_RESOLVE;
-	goto on_error;
-    }
-
-    /* Init mapped addresses to zero */
-    pj_memset(mapped_addr, 0, sock_cnt * sizeof(pj_sockaddr_in));
-
-    /* Main retransmission loop. */
-    for (send_cnt=0; send_cnt<MAX_REQUEST; ++send_cnt) {
-	pj_time_val next_tx, now;
-	pj_fd_set_t r;
-	int select_rc;
-
-	PJ_LOG(4,(THIS_FILE, "STUN retransmit %d, wait_resp=%d", 
-			     send_cnt, wait_resp));
-
-	PJ_FD_ZERO(&r);
-
-	/* Send messages to servers that has not given us response. */
-	for (i=0; i<sock_cnt && mapped_status==0; ++i) {
-	    for (j=0; j<2 && mapped_status==0; ++j) {
-		pj_stun_msg_hdr *msg_hdr = out_msg;
-                pj_ssize_t sent_len;
-
-		if (rec[i].srv[j].mapped_port != 0)
-		    continue;
-
-		/* Modify message so that we can distinguish response. */
-		msg_hdr->tsx[2] = pj_htonl(i);
-		msg_hdr->tsx[3] = pj_htonl(j);
-
-		/* Send! */
-                sent_len = out_msg_len;
-		rc = pj_sock_sendto(sock[i], out_msg, &sent_len, 0,
-				    (pj_sockaddr_t*)&srv_addr[j], 
-				    sizeof(pj_sockaddr_in));
-		if (sent_len != (int)out_msg_len) {
-		    PJ_LOG(4,(THIS_FILE, 
-			      "Error sending STUN request to %s:%d",
-			      LOG_ADDR(srv_addr[j])));
-		    mapped_status = PJ_STUN_ERR_TRANSPORT; 
-		} else {
-		    ++wait_resp;
-		}
-	    }
-	}
-
-	/* All requests sent.
-	 * The loop below will wait for responses until all responses have
-	 * been received (i.e. wait_resp==0) or timeout occurs, which then
-	 * we'll go to the next retransmission iteration.
-	 */
-
-	/* Calculate time of next retransmission. */
-	pj_gettimeofday(&next_tx);
-	next_tx.sec += (stun_timer[send_cnt]/1000);
-	next_tx.msec += (stun_timer[send_cnt]%1000);
-	pj_time_val_normalize(&next_tx);
-
-	for (pj_gettimeofday(&now), select_rc=1; 
-	     mapped_status==0 && select_rc==1 && wait_resp>0 && PJ_TIME_VAL_LT(now, next_tx); 
-	     pj_gettimeofday(&now)) 
-	{
-	    pj_time_val timeout;
-
-	    timeout = next_tx;
-	    PJ_TIME_VAL_SUB(timeout, now);
-
-	    for (i=0; i<sock_cnt; ++i) {
-		PJ_FD_SET(sock[i], &r);
-	    }
-
-	    select_rc = pj_sock_select(FD_SETSIZE, &r, NULL, NULL, &timeout);
-	    if (select_rc < 1)
-		continue;
-
-	    for (i=0; i<sock_cnt; ++i) {
-		int sock_idx, srv_idx;
-                pj_ssize_t len;
-		pj_stun_msg msg;
-		pj_sockaddr_in addr;
-		int addrlen = sizeof(addr);
-		pj_stun_mapped_addr_attr *attr;
-		char recv_buf[128];
-
-		if (!PJ_FD_ISSET(sock[i], &r))
-		    continue;
-
-                len = sizeof(recv_buf);
-		pj_sock_recvfrom( sock[i], recv_buf, 
-				  &len, 0,
-				  (pj_sockaddr_t*)&addr,
-				  &addrlen);
-
-		--wait_resp;
-
-		if (len < 1) {
-		    mapped_status = PJ_STUN_ERR_TRANSPORT; 
-		    continue;
-		}
-
-		if (pj_stun_parse_msg(recv_buf, len, &msg) != 0) {
-		    PJ_LOG(4,(THIS_FILE, 
-				"Error parsing STUN response from %s:%d",
-				LOG_ADDR(addr)));
-		    mapped_status = PJ_STUN_ERR_INVALID_MSG;
-		    continue;
-		}
-
-		sock_idx = pj_ntohl(msg.hdr->tsx[2]);
-		srv_idx = pj_ntohl(msg.hdr->tsx[3]);
-
-		if (sock_idx<0 || sock_idx>=sock_cnt || srv_idx<0 || srv_idx>=2) {
-		    PJ_LOG(4,(THIS_FILE, 
-				"Invalid transaction ID from %s:%d", 
-				LOG_ADDR(addr)));
-		    mapped_status = PJ_STUN_ERR_INVALID_MSG;
-		    continue;
-		}
-
-		if (pj_ntohs(msg.hdr->type) != PJ_STUN_BINDING_RESPONSE) {
-		    PJ_LOG(4,(THIS_FILE, 
-				"Non binding response %d from %s:%d", 
-				pj_ntohs(msg.hdr->type), LOG_ADDR(addr)));
-		    mapped_status = PJ_STUN_ERR_INVALID_MSG;
-		    continue;
-		}
-
-		if (pj_stun_msg_find_attr(&msg, PJ_STUN_ATTR_ERROR_CODE) != NULL) {
-		    PJ_LOG(4,(THIS_FILE, 
-				"Got STUN error attribute from %s:%d",
-				LOG_ADDR(addr)));
-		    mapped_status = PJ_STUN_ERR_INVALID_MSG;
-		    continue;
-		}
-
-		attr = (void*)pj_stun_msg_find_attr(&msg, PJ_STUN_ATTR_MAPPED_ADDR);
-		if (!attr) {
-		    PJ_LOG(4,(THIS_FILE,
-				"No mapped address in response from %s:%d",
-				LOG_ADDR(addr)));
-		    mapped_status = PJ_STUN_ERR_INVALID_MSG;
-		    continue;
-		}
-
-		rec[sock_idx].srv[srv_idx].mapped_addr = attr->addr;
-		rec[sock_idx].srv[srv_idx].mapped_port = attr->port;
-	    }
-	}
-
-	/* The best scenario is if all requests have been replied.
-	 * Then we don't need to go to the next retransmission iteration.
-	 */
-	if (wait_resp <= 0)
-	    break;
-    }
-
-    for (i=0; i<sock_cnt && mapped_status==0; ++i) {
-	if (rec[i].srv[0].mapped_addr == rec[i].srv[1].mapped_addr &&
-	    rec[i].srv[0].mapped_port == rec[i].srv[1].mapped_port)
-	{
-	    mapped_addr[i].sin_family = PJ_AF_INET;
-	    mapped_addr[i].sin_addr.s_addr = rec[i].srv[0].mapped_addr;
-	    mapped_addr[i].sin_port = (pj_uint16_t)rec[i].srv[0].mapped_port;
-
-	    if (rec[i].srv[0].mapped_addr == 0 || rec[i].srv[0].mapped_port == 0) {
-		mapped_status = PJ_STUN_ERR_NO_RESPONSE;
-	    }
-	} else {
-	    mapped_status = PJ_STUN_ERR_SYMETRIC;
-	}
-    }
-
-    pj_pool_release(pool);
-
-    return mapped_status;
-
-on_error:
-    if (pool) pj_pool_release(pool);
-    return -1;
-}
-
-PJ_DEF(const char*) pj_stun_get_err_msg(pj_status_t status)
-{
-    switch (status) {
-    case 0:			    return "No error";
-    case -1:			    return "General error";
-    case PJ_STUN_ERR_MEMORY:	    return "Memory allocation failed";
-    case PJ_STUN_ERR_RESOLVE:	    return "Invalid IP or unable to resolve STUN server";
-    case PJ_STUN_ERR_TRANSPORT:	    return "Unable to contact STUN server";
-    case PJ_STUN_ERR_INVALID_MSG:   return "Invalid response from STUN server";
-    case PJ_STUN_ERR_NO_RESPONSE:   return "No response from STUN server";
-    case PJ_STUN_ERR_SYMETRIC:	    return "Different mappings are returned from servers";
-    }
-    return "Unknown error";
-}
diff --git a/pjlib/src/pj/xml.c b/pjlib/src/pj/xml.c
deleted file mode 100644
index 19fe21f5..00000000
--- a/pjlib/src/pj/xml.c
+++ /dev/null
@@ -1,380 +0,0 @@
-/* $Id$
- */
-#include <pj/xml.h>
-#include <pj/scanner.h>
-#include <pj/except.h>
-#include <pj/pool.h>
-#include <pj/string.h>
-#include <pj/log.h>
-#include <pj/os.h>
-
-#define EX_SYNTAX_ERROR	12
-#define THIS_FILE	"xml.c"
-
-static void on_syntax_error(struct pj_scanner *scanner)
-{
-    PJ_UNUSED_ARG(scanner);
-    PJ_THROW(EX_SYNTAX_ERROR);
-}
-
-static pj_xml_node *alloc_node( pj_pool_t *pool )
-{
-    pj_xml_node *node;
-
-    node = pj_pool_calloc(pool, 1, sizeof(pj_xml_node));
-    pj_list_init( &node->attr_head );
-    pj_list_init( &node->node_head );
-
-    return node;
-}
-
-static pj_xml_attr *alloc_attr( pj_pool_t *pool )
-{
-    return pj_pool_calloc(pool, 1, sizeof(pj_xml_attr));
-}
-
-/* This is a recursive function! */
-static pj_xml_node *xml_parse_node( pj_pool_t *pool, pj_scanner *scanner)
-{
-    pj_xml_node *node;
-    pj_str_t end_name;
-
-    PJ_CHECK_STACK();
-
-    if (*scanner->curptr != '<')
-	on_syntax_error(scanner);
-
-    /* Handle Processing Instructino (PI) construct (i.e. "<?") */
-    if (*scanner->curptr == '<' && *(scanner->curptr+1) == '?') {
-	pj_scan_advance_n(scanner, 2, PJ_FALSE);
-	for (;;) {
-	    pj_str_t dummy;
-	    pj_scan_get_until_ch(scanner, '?', &dummy);
-	    if (*scanner->curptr=='?' && *(scanner->curptr+1)=='>') {
-		pj_scan_advance_n(scanner, 2, PJ_TRUE);
-		break;
-	    } else {
-		pj_scan_advance_n(scanner, 1, PJ_FALSE);
-	    }
-	}
-	return xml_parse_node(pool, scanner);
-    }
-
-    /* Handle comments construct (i.e. "<!--") */
-    if (pj_scan_strcmp(scanner, "<!--", 4) == 0) {
-	pj_scan_advance_n(scanner, 4, PJ_FALSE);
-	for (;;) {
-	    pj_str_t dummy;
-	    pj_scan_get_until_ch(scanner, '-', &dummy);
-	    if (pj_scan_strcmp(scanner, "-->", 3) == 0) {
-		pj_scan_advance_n(scanner, 3, PJ_TRUE);
-		break;
-	    } else {
-		pj_scan_advance_n(scanner, 1, PJ_FALSE);
-	    }
-	}
-	return xml_parse_node(pool, scanner);
-    }
-
-    /* Alloc node. */
-    node = alloc_node(pool);
-
-    /* Get '<' */
-    pj_scan_get_char(scanner);
-
-    /* Get node name. */
-    pj_scan_get_until_chr( scanner, " />\t", &node->name);
-
-    /* Get attributes. */
-    while (*scanner->curptr != '>' && *scanner->curptr != '/') {
-	pj_xml_attr *attr = alloc_attr(pool);
-	
-	pj_scan_get_until_chr( scanner, "=> \t", &attr->name);
-	if (*scanner->curptr == '=') {
-	    pj_scan_get_char( scanner );
-	    pj_scan_get_quote(scanner, '"', '"', &attr->value);
-	    /* remove quote characters */
-	    ++attr->value.ptr;
-	    attr->value.slen -= 2;
-	}
-	
-	pj_list_insert_before( &node->attr_head, attr );
-    }
-
-    if (*scanner->curptr == '/') {
-	pj_scan_get_char(scanner);
-	if (pj_scan_get_char(scanner) != '>')
-	    on_syntax_error(scanner);
-	return node;
-    }
-
-    /* Enclosing bracket. */
-    if (pj_scan_get_char(scanner) != '>')
-	on_syntax_error(scanner);
-
-    /* Sub nodes. */
-    while (*scanner->curptr == '<' && *(scanner->curptr+1) != '/') {
-	pj_xml_node *sub_node = xml_parse_node(pool, scanner);
-	pj_list_insert_before( &node->node_head, sub_node );
-    }
-
-    /* Content. */
-    if (!pj_scan_is_eof(scanner) && *scanner->curptr != '<') {
-	pj_scan_get_until_ch(scanner, '<', &node->content);
-    }
-
-    /* Enclosing node. */
-    if (pj_scan_get_char(scanner) != '<' || pj_scan_get_char(scanner) != '/')
-	on_syntax_error(scanner);
-
-    pj_scan_get_until_chr(scanner, " \t>", &end_name);
-
-    /* Compare name. */
-    if (pj_stricmp(&node->name, &end_name) != 0)
-	on_syntax_error(scanner);
-
-    /* Enclosing '>' */
-    if (pj_scan_get_char(scanner) != '>')
-	on_syntax_error(scanner);
-
-    return node;
-}
-
-PJ_DEF(pj_xml_node*) pj_xml_parse( pj_pool_t *pool, char *msg, pj_size_t len)
-{
-    pj_xml_node *node = NULL;
-    pj_scanner scanner;
-    PJ_USE_EXCEPTION;
-
-    if (!msg || !len || !pool)
-	return NULL;
-
-    pj_scan_init( &scanner, msg, len, 
-		  PJ_SCAN_AUTOSKIP_WS|PJ_SCAN_AUTOSKIP_NEWLINE, 
-		  &on_syntax_error);
-    PJ_TRY {
-	node =  xml_parse_node(pool, &scanner);
-    }
-    PJ_DEFAULT {
-	PJ_LOG(4,(THIS_FILE, "Syntax error parsing XML in line %d column %d",
-		  scanner.line, scanner.col));
-    }
-    PJ_END;
-    pj_scan_fini( &scanner );
-    return node;
-}
-
-/* This is a recursive function. */
-static int xml_print_node( const pj_xml_node *node, int indent, 
-			   char *buf, pj_size_t len )
-{
-    int i;
-    char *p = buf;
-    pj_xml_attr *attr;
-    pj_xml_node *sub_node;
-
-#define SIZE_LEFT()	((int)(len - (p-buf)))
-
-    PJ_CHECK_STACK();
-
-    /* Print name. */
-    if (SIZE_LEFT() < node->name.slen + indent + 5)
-	return -1;
-    for (i=0; i<indent; ++i)
-	*p++ = ' ';
-    *p++ = '<';
-    pj_memcpy(p, node->name.ptr, node->name.slen);
-    p += node->name.slen;
-
-    /* Print attributes. */
-    attr = node->attr_head.next;
-    while (attr != &node->attr_head) {
-
-	if (SIZE_LEFT() < attr->name.slen + attr->value.slen + 4)
-	    return -1;
-
-	*p++ = ' ';
-
-	/* Attribute name. */
-	pj_memcpy(p, attr->name.ptr, attr->name.slen);
-	p += attr->name.slen;
-
-	/* Attribute value. */
-	if (attr->value.slen) {
-	    *p++ = '=';
-	    *p++ = '"';
-	    pj_memcpy(p, attr->value.ptr, attr->value.slen);
-	    p += attr->value.slen;
-	    *p++ = '"';
-	}
-
-	attr = attr->next;
-    }
-
-    /* Check for empty node. */
-    if (node->content.slen==0 &&
-	node->node_head.next==(pj_xml_node*)&node->node_head)
-    {
-	*p++ = ' ';
-	*p++ = '/';
-	*p++ = '>';
-	return p-buf;
-    }
-
-    /* Enclosing '>' */
-    if (SIZE_LEFT() < 1) return -1;
-    *p++ = '>';
-
-    /* Print sub nodes. */
-    sub_node = node->node_head.next;
-    while (sub_node != (pj_xml_node*)&node->node_head) {
-	int printed;
-
-	if (SIZE_LEFT() < indent + 3)
-	    return -1;
-	//*p++ = '\r';
-	*p++ = '\n';
-
-	printed = xml_print_node(sub_node, indent + 1, p, SIZE_LEFT());
-	if (printed < 0)
-	    return -1;
-
-	p += printed;
-	sub_node = sub_node->next;
-    }
-
-    /* Content. */
-    if (node->content.slen) {
-	if (SIZE_LEFT() < node->content.slen) return -1;
-	pj_memcpy(p, node->content.ptr, node->content.slen);
-	p += node->content.slen;
-    }
-
-    /* Enclosing node. */
-    if (node->node_head.next != (pj_xml_node*)&node->node_head) {
-	if (SIZE_LEFT() < node->name.slen + 5 + indent)
-	    return -1;
-	//*p++ = '\r';
-	*p++ = '\n';
-	for (i=0; i<indent; ++i)
-	    *p++ = ' ';
-    } else {
-	if (SIZE_LEFT() < node->name.slen + 3)
-	    return -1;
-    }
-    *p++ = '<';
-    *p++ = '/';
-    pj_memcpy(p, node->name.ptr, node->name.slen);
-    p += node->name.slen;
-    *p++ = '>';
-
-#undef SIZE_LEFT
-
-    return p - buf;
-}
-
-PJ_DEF(int) pj_xml_print(const pj_xml_node *node, char *buf, pj_size_t len,
-			 pj_bool_t include_prolog)
-{
-    int prolog_len = 0;
-    int printed;
-
-    if (!node || !buf || !len)
-	return 0;
-
-    if (include_prolog) {
-	pj_str_t prolog = {"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n", 39};
-	if ((int)len < prolog.slen)
-	    return -1;
-	pj_memcpy(buf, prolog.ptr, prolog.slen);
-	prolog_len = prolog.slen;
-    }
-
-    printed = xml_print_node(node, 0, buf+prolog_len, len-prolog_len) + prolog_len;
-    if (printed > 0 && len-printed >= 1) {
-	buf[printed++] = '\n';
-    }
-    return printed;
-}
-
-
-PJ_DEF(void) pj_xml_add_node( pj_xml_node *parent, pj_xml_node *node )
-{
-    pj_list_insert_before(&parent->node_head, node);
-}
-
-PJ_DEF(void) pj_xml_add_attr( pj_xml_node *node, pj_xml_attr *attr )
-{
-    pj_list_insert_before(&node->attr_head, attr);
-}
-
-PJ_DEF(pj_xml_node*) pj_xml_find_node(pj_xml_node *parent, const pj_str_t *name)
-{
-    pj_xml_node *node = parent->node_head.next;
-
-    PJ_CHECK_STACK();
-
-    while (node != (void*)&parent->node_head) {
-	if (pj_stricmp(&node->name, name) == 0)
-	    return node;
-	node = node->next;
-    }
-    return NULL;
-}
-
-
-PJ_DEF(pj_xml_node*) pj_xml_find_next_node( pj_xml_node *parent, pj_xml_node *node,
-					    const pj_str_t *name)
-{
-    PJ_CHECK_STACK();
-
-    node = node->next;
-    while (node != (void*)&parent->node_head) {
-	if (pj_stricmp(&node->name, name) == 0)
-	    return node;
-	node = node->next;
-    }
-    return NULL;
-}
-
-
-PJ_DEF(pj_xml_attr*) pj_xml_find_attr( pj_xml_node *node, const pj_str_t *name,
-				       const pj_str_t *value)
-{
-    pj_xml_attr *attr = node->attr_head.next;
-    while (attr != (void*)&node->attr_head) {
-	if (pj_stricmp(&attr->name, name)==0) {
-	    if (value) {
-		if (pj_stricmp(&attr->value, value)==0)
-		    return attr;
-	    } else {
-		return attr;
-	    }
-	}
-	attr = attr->next;
-    }
-    return NULL;
-}
-
-
-
-PJ_DEF(pj_xml_node*) pj_xml_find( pj_xml_node *parent, const pj_str_t *name,
-				  const void *data, 
-				  pj_bool_t (*match)(pj_xml_node *, const void*))
-{
-    pj_xml_node *head = (void*)&parent->node_head, *node = head->next;
-
-    while (node != (void*)head) {
-	if (name && pj_stricmp(&node->name, name)==0) {
-	    if (match) {
-		if (match(node, data))
-		    return node;
-	    } else {
-		return node;
-	    }
-	}
-	node = node->next;
-    }
-    return NULL;
-}
-