Browse Source

xmpp: removed trailing spaces

Daniel-Constantin Mierla 1 year ago
parent
commit
ae89b59ed8

+ 6 - 6
src/modules/xmpp/sha.c

@@ -12,7 +12,7 @@
  *  You should have received a copy of the GNU General Public License
  *  You should have received a copy of the GNU General Public License
  *  along with this program; if not, write to the Free Software
  *  along with this program; if not, write to the Free Software
  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
- * 
+ *
  *  Gabber
  *  Gabber
  *  Copyright (C) 1999-2000 Dave Smith & Julian Missig
  *  Copyright (C) 1999-2000 Dave Smith & Julian Missig
  *
  *
@@ -23,7 +23,7 @@
  */
  */
 
 
 
 
-/* 
+/*
    Implements the Secure Hash Algorithm (SHA1)
    Implements the Secure Hash Algorithm (SHA1)
 
 
    Copyright (C) 1999 Scott G. Miller
    Copyright (C) 1999 Scott G. Miller
@@ -31,12 +31,12 @@
    Released under the terms of the GNU General Public License v2
    Released under the terms of the GNU General Public License v2
    see file COPYING for details
    see file COPYING for details
 
 
-   Credits: 
-      Robert Klep <[email protected]>  -- Expansion function fix 
+   Credits:
+      Robert Klep <[email protected]>  -- Expansion function fix
 	  Thomas "temas" Muldowney <[email protected]>:
 	  Thomas "temas" Muldowney <[email protected]>:
 	  		-- shahash() for string fun
 	  		-- shahash() for string fun
 			-- Will add the int32 stuff in a few
 			-- Will add the int32 stuff in a few
-	  		
+
    ---
    ---
    FIXME: This source takes int to be a 32 bit integer.  This
    FIXME: This source takes int to be a 32 bit integer.  This
    may vary from system to system.  I'd use autoconf if I was familiar
    may vary from system to system.  I'd use autoconf if I was familiar
@@ -117,7 +117,7 @@ int sha_hash(int *data, int *hash)
 		W[t] = rol1(x);
 		W[t] = rol1(x);
 	}
 	}
 
 
-	/* SHA1 main loop (t=0 to 79) 
+	/* SHA1 main loop (t=0 to 79)
    This is broken down into four subloops in order to use
    This is broken down into four subloops in order to use
    the correct round function and constant */
    the correct round function and constant */
 	for(t = 0; t < 20; t++) {
 	for(t = 0; t < 20; t++) {

+ 1 - 1
src/modules/xmpp/xmpp.c

@@ -285,7 +285,7 @@ static void xmpp_process(int rank)
 
 
 /*********************************************************************************/
 /*********************************************************************************/
 
 
-/*! \brief Relay a MESSAGE to a SIP client 
+/*! \brief Relay a MESSAGE to a SIP client
 	\todo This assumes that a message is text/plain, which is not always the case with
 	\todo This assumes that a message is text/plain, which is not always the case with
 		XMPP messages. We should propably also set the character set, as all
 		XMPP messages. We should propably also set the character set, as all
 		SIP clients doesn't assume utf8 for text/plain
 		SIP clients doesn't assume utf8 for text/plain

+ 2 - 2
src/modules/xmpp/xmpp_api.c

@@ -19,9 +19,9 @@
  * along with this program; if not, write to the Free Software
  * along with this program; if not, write to the Free Software
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  *
  *
- * 
+ *
  */
  */
-/*! \file 
+/*! \file
  * \brief Kamailio XMPP :: API
  * \brief Kamailio XMPP :: API
  *  \ingroup xmpp
  *  \ingroup xmpp
  */
  */

+ 1 - 1
src/modules/xmpp/xmpp_api.h

@@ -18,7 +18,7 @@
  * along with this program; if not, write to the Free Software
  * along with this program; if not, write to the Free Software
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  *
  *
- * 
+ *
  */
  */
 
 
 /*! \file
 /*! \file

+ 1 - 1
src/modules/xmpp/xmpp_server.c

@@ -202,7 +202,7 @@ static struct xmpp_connection *conn_find_domain(char *domain, int type)
 static struct xmpp_connection *conn_find_fd(int fd)
 static struct xmpp_connection *conn_find_fd(int fd)
 {
 {
 	struct xmpp_connection *conn;
 	struct xmpp_connection *conn;
-	
+
 	for (conn = conn_list; conn; conn = conn->next)
 	for (conn = conn_list; conn; conn = conn->next)
 		if (conn->fd == fd)
 		if (conn->fd == fd)
 			return conn;
 			return conn;

+ 3 - 3
src/modules/xmpp/xode.h

@@ -90,7 +90,7 @@ extern "C"
 
 
 
 
 	/* xode_pool_cleaner - callback type which is associated
 	/* xode_pool_cleaner - callback type which is associated
-   with a pool entry; invoked when the pool entry is 
+   with a pool entry; invoked when the pool entry is
    free'd */
    free'd */
 	typedef void (*xode_pool_cleaner)(void *arg);
 	typedef void (*xode_pool_cleaner)(void *arg);
 
 
@@ -190,8 +190,8 @@ extern "C"
 #define XODE_TYPE_LAST 2
 #define XODE_TYPE_LAST 2
 #define XODE_TYPE_UNDEF -1
 #define XODE_TYPE_UNDEF -1
 
 
-	/* -------------------------------------------------------------------------- 
-   Node structure. Do not use directly! Always use accessors macros 
+	/* --------------------------------------------------------------------------
+   Node structure. Do not use directly! Always use accessors macros
    and methods!
    and methods!
    -------------------------------------------------------------------------- */
    -------------------------------------------------------------------------- */
 	typedef struct xode_struct
 	typedef struct xode_struct

+ 6 - 6
src/modules/xmpp/xpool.c

@@ -15,22 +15,22 @@
  *
  *
  *  Jabber
  *  Jabber
  *  Copyright (C) 1998-1999 The Jabber Team http://jabber.org/
  *  Copyright (C) 1998-1999 The Jabber Team http://jabber.org/
- *  
+ *
  *  2/27/00:3am, random plans by jer
  *  2/27/00:3am, random plans by jer
- *  
+ *
  *  ok based on gprof, we really need some innovation here... my thoughs are this:
  *  ok based on gprof, we really need some innovation here... my thoughs are this:
- *  
+ *
  *  most things are strings, so have a string-based true-blue garbage collector
  *  most things are strings, so have a string-based true-blue garbage collector
  *  one big global hash containing all the strings created by any pstrdup, returning const char *
  *  one big global hash containing all the strings created by any pstrdup, returning const char *
  *  a refcount on each string block
  *  a refcount on each string block
  *  when a pool is freed, it moves down the refcount
  *  when a pool is freed, it moves down the refcount
  *  garbage collector collects pools on the free stack, and runs through the hash for unused strings
  *  garbage collector collects pools on the free stack, and runs through the hash for unused strings
  *  j_strcmp can check for == (if they are both from a pstrdup)
  *  j_strcmp can check for == (if they are both from a pstrdup)
- *  
+ *
  *  let's see... this would change:
  *  let's see... this would change:
  *  pstrdup: do a hash lookup, success=return, fail=pmalloc & hash put
  *  pstrdup: do a hash lookup, success=return, fail=pmalloc & hash put
- *  pool_free: 
- *  
+ *  pool_free:
+ *
  */
  */
 
 
 /*! \file
 /*! \file

+ 8 - 8
src/modules/xmpp/xsnprintf.c

@@ -1,4 +1,4 @@
-/* 
+/*
  * Copyright (c) 1995-1998 The Apache Group.  All rights reserved.
  * Copyright (c) 1995-1998 The Apache Group.  All rights reserved.
  *
  *
  * Redistribution and use in source and binary forms, with or without
  * Redistribution and use in source and binary forms, with or without
@@ -6,7 +6,7 @@
  * are met:
  * are met:
  *
  *
  * 1. Redistributions of source code must retain the above copyright
  * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
+ *    notice, this list of conditions and the following disclaimer.
  *
  *
  * 2. Redistributions in binary form must reproduce the above copyright
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in
  *    notice, this list of conditions and the following disclaimer in
@@ -366,7 +366,7 @@ static char *conv_10(register wide_int num, register bool_int is_unsigned,
 		*is_negative = (num < 0);
 		*is_negative = (num < 0);
 
 
 		/*
 		/*
-         * On a 2's complement machine, negating the most negative integer 
+         * On a 2's complement machine, negating the most negative integer
          * results in a number that cannot be represented as a signed integer.
          * results in a number that cannot be represented as a signed integer.
          * Here is what we do to obtain the number's magnitude:
          * Here is what we do to obtain the number's magnitude:
          *      a. add 1 to the number
          *      a. add 1 to the number
@@ -383,7 +383,7 @@ static char *conv_10(register wide_int num, register bool_int is_unsigned,
 	}
 	}
 
 
 	/*
 	/*
-     * We use a do-while loop so that we write at least 1 digit 
+     * We use a do-while loop so that we write at least 1 digit
      */
      */
 	do {
 	do {
 		register u_wide_int new_magnitude = magnitude / 10;
 		register u_wide_int new_magnitude = magnitude / 10;
@@ -803,11 +803,11 @@ static int format_converter(register buffy *odp, const char *fmt, va_list ap)
 					break;
 					break;
 
 
 					/*
 					/*
-                 * Always extract the argument as a "char *" pointer. We 
-                 * should be using "void *" but there are still machines 
+                 * Always extract the argument as a "char *" pointer. We
+                 * should be using "void *" but there are still machines
                  * that don't understand it.
                  * that don't understand it.
                  * If the pointer size is equal to the size of an unsigned
                  * If the pointer size is equal to the size of an unsigned
-                 * integer we convert the pointer to a hex number, otherwise 
+                 * integer we convert the pointer to a hex number, otherwise
                  * we print "%p" to indicate that we don't handle "%p".
                  * we print "%p" to indicate that we don't handle "%p".
                  */
                  */
 				case 'p':
 				case 'p':
@@ -865,7 +865,7 @@ static int format_converter(register buffy *odp, const char *fmt, va_list ap)
 				PAD(min_width, s_len, pad_char);
 				PAD(min_width, s_len, pad_char);
 			}
 			}
 			/*
 			/*
-             * Print the string s. 
+             * Print the string s.
              */
              */
 			for(i = s_len; i != 0; i--) {
 			for(i = s_len; i != 0; i--) {
 				INS_CHAR(*s, sp, bep, cc);
 				INS_CHAR(*s, sp, bep, cc);