- trim any trailing whitespace

[uclinux-h8/uClibc.git] / libpthread / linuxthreads.old / rwlock.c

diff --git a/libpthread/linuxthreads.old/rwlock.c b/libpthread/linuxthreads.old/rwlock.c
index e25ab3e..eaf71e7 100644 (file)
--- a/libpthread/linuxthreads.old/rwlock.c
+++ b/libpthread/linuxthreads.old/rwlock.c
@@ -60,7 +60,7 @@ rwlock_add_to_list(pthread_descr self, pthread_rwlock_t *rwlock)
 {
   pthread_readlock_info *info = self->p_readlock_free;
 
-  if (info != NULL) 
+  if (info != NULL)
     self->p_readlock_free = info->pr_next;
   else
     info = malloc(sizeof *info);
@@ -100,7 +100,7 @@ rwlock_remove_from_list(pthread_descr self, pthread_rwlock_t *rwlock)
          return info;
        }
     }
-  
+
   return NULL;
 }
 
@@ -137,7 +137,7 @@ rwlock_can_rdlock(pthread_rwlock_t *rwlock, int have_lock_already)
  * This function helps support brain-damaged recursive read locking
  * semantics required by Unix 98, while maintaining write priority.
  * This basically determines whether this thread already holds a read lock
- * already. It returns 1 if so, otherwise it returns 0.  
+ * already. It returns 1 if so, otherwise it returns 0.
  *
  * If the thread has any ``untracked read locks'' then it just assumes
  * that this lock is among them, just to be safe, and returns 1.
@@ -259,7 +259,7 @@ pthread_rwlock_rdlock (pthread_rwlock_t *rwlock)
       else
        self->p_untracked_readlock_count++;
     }
-  
+
   return 0;
 }
 
@@ -277,7 +277,7 @@ pthread_rwlock_tryrdlock (pthread_rwlock_t *rwlock)
   __pthread_lock (&rwlock->__rw_lock, self);
 
   /* 0 is passed to here instead of have_lock_already.
-     This is to meet Single Unix Spec requirements: 
+     This is to meet Single Unix Spec requirements:
      if writers are waiting, pthread_rwlock_tryrdlock
      does not acquire a read lock, even if the caller has
      one or more read locks already. */
@@ -300,7 +300,7 @@ pthread_rwlock_tryrdlock (pthread_rwlock_t *rwlock)
            self->p_untracked_readlock_count++;
        }
     }
-  
+
   return retval;
 }