Set svn:eol-style for all files

git-svn-id: https://svn.pjsip.org/repos/pjproject/trunk@66 74dad513-b988-da41-8d7b-12977e46ad98
diff --git a/pjlib/src/pj/string.c b/pjlib/src/pj/string.c
index 5c152fb..00728f1 100644
--- a/pjlib/src/pj/string.c
+++ b/pjlib/src/pj/string.c
@@ -1,123 +1,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;

-}

-

-

+/* $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;
+}
+
+