fastthread 0.6.4.1 → 1.0

data/Rakefile

@@ -4,7 +4,7 @@ require 'rake/testtask'
 require 'rake/gempackagetask'
 require 'tools/rakehelp'
 
-GEM_VERSION="0.6.4.1"
+GEM_VERSION="1.0"
 
 setup_extension('fastthread', 'fastthread')
 

data/ext/fastthread/fastthread.c

@@ -4,6 +4,8 @@
  *
  *  Copyright 2006-2007  MenTaLguY <mental@rydia.net>
  *
+ * RDoc taken from original.
+ *
  * This file is made available under the same terms as Ruby.
  */
 
@@ -11,1125 +13,1174 @@
 #include <intern.h>
 #include <rubysig.h>
 
-static VALUE avoid_mem_pools;
-
-#ifndef USE_MEM_POOLS
-#define USE_MEM_POOLS !RTEST(avoid_mem_pools)
-#endif
-
 static VALUE rb_cMutex;
 static VALUE rb_cConditionVariable;
-/* post-1.8.5 Ruby exposes rb_eThreadError; earlier versions do not */
-static VALUE private_eThreadError;
 static VALUE rb_cQueue;
 static VALUE rb_cSizedQueue;
+/* earlier versions of ruby do not export rb_eThreadError */
+static VALUE private_eThreadError;
 
-static VALUE
-return_value(value)
-  VALUE value;
-{
-  return value;
-}
+static VALUE set_critical(VALUE value);
+
+/*
+ *  call-seq:
+ *     Thread.exclusive { block }   => obj
+ *  
+ *  Wraps a block in Thread.critical, restoring the original value
+ *  upon exit from the critical section, and returns the value of the
+ *  block.
+ */
 
 typedef struct _Entry {
-  VALUE value;
-  struct _Entry *next;
+    VALUE value;
+    struct _Entry *next;
 } Entry;
 
 typedef struct _List {
-  Entry *entries;
-  Entry *last_entry;
-  Entry *entry_pool;
-  unsigned long size;
+    Entry *entries;
+    Entry *last_entry;
+    Entry *entry_pool;
+    unsigned long size;
 } List;
 
-static void init_list _((List *));
-
 static void
-init_list(list)
-  List *list;
+init_list(List *list)
 {
-  list->entries = NULL;
-  list->last_entry = NULL;
-  list->entry_pool = NULL;
-  list->size = 0;
+    list->entries = NULL;
+    list->last_entry = NULL;
+    list->entry_pool = NULL;
+    list->size = 0;
 }
 
-static void mark_list _((List *));
-
 static void
-mark_list(list)
-  List *list;
+mark_list(List *list)
 {
-  Entry *entry;
-  for ( entry = list->entries ; entry ; entry = entry->next ) {
-    rb_gc_mark(entry->value);
-  }
+    Entry *entry;
+    for (entry = list->entries; entry; entry = entry->next) {
+        rb_gc_mark(entry->value);
+    }
 }
 
-static void free_entries _((Entry *));
-
 static void
-free_entries(first)
-  Entry *first;
+free_entries(Entry *first)
 {
-  Entry *next;
-  while (first) {
-    next = first->next;
-    free(first);
-    first = next;
-  }
+    Entry *next;
+    while (first) {
+        next = first->next;
+        xfree(first);
+        first = next;
+    }
 }
 
-static void finalize_list _((List *));
-
 static void
-finalize_list(list)
-  List *list;
+finalize_list(List *list)
 {
-  free_entries(list->entries);
-  free_entries(list->entry_pool);
+    free_entries(list->entries);
+    free_entries(list->entry_pool);
 }
 
-static void push_list _((List *, VALUE));
-
 static void
-push_list(list, value)
-  List *list;
-  VALUE value;
+push_list(List *list, VALUE value)
 {
-  Entry *entry;
+    Entry *entry;
 
-  if (list->entry_pool) {
-    entry = list->entry_pool;
-    list->entry_pool = entry->next;
-  } else {
-    entry = (Entry *)malloc(sizeof(Entry));
-  }
+    if (list->entry_pool) {
+        entry = list->entry_pool;
+        list->entry_pool = entry->next;
+    } else {
+        entry = ALLOC(Entry);
+    }
 
-  entry->value = value;
-  entry->next = NULL;
+    entry->value = value;
+    entry->next = NULL;
 
-  if (list->last_entry) {
-    list->last_entry->next = entry;
-  } else {
-    list->entries = entry;
-  }
-  list->last_entry = entry;
+    if (list->last_entry) {
+        list->last_entry->next = entry;
+    } else {
+        list->entries = entry;
+    }
+    list->last_entry = entry;
 
-  ++list->size;
+    ++list->size;
 }
 
-static void push_multiple_list _((List *, VALUE *, unsigned));
-
 static void
-push_multiple_list(list, values, count)
-  List *list;
-  VALUE *values;
-  unsigned count;
+push_multiple_list(List *list, VALUE *values, unsigned count)
 {
-  unsigned i;
-  for ( i = 0 ; i < count ; i++ ) {
-    push_list(list, values[i]);
-  }
+    unsigned i;
+    for (i = 0; i < count; i++) {
+        push_list(list, values[i]);
+    }
 }
 
-static void recycle_entries _((List *, Entry *, Entry *));
-
 static void
-recycle_entries(list, first_entry, last_entry)
-  List *list;
-  Entry *first_entry;
-  Entry *last_entry;
+recycle_entries(List *list, Entry *first_entry, Entry *last_entry)
 {
-  if (USE_MEM_POOLS) {
+#ifdef USE_MEM_POOLS
     last_entry->next = list->entry_pool;
     list->entry_pool = first_entry;
-  } else {
+#else
     last_entry->next = NULL;
     free_entries(first_entry);
-  }
+#endif
 }
 
-static VALUE shift_list _((List *));
-
 static VALUE
-shift_list(list)
-  List *list;
+shift_list(List *list)
 {
-  Entry *entry;
-  VALUE value;
+    Entry *entry;
+    VALUE value;
 
-  entry = list->entries;
-  if (!entry) return Qundef;
+    entry = list->entries;
+    if (!entry) return Qundef;
 
-  list->entries = entry->next;
-  if ( entry == list->last_entry ) {
-    list->last_entry = NULL;
-  }
+    list->entries = entry->next;
+    if (entry == list->last_entry) {
+        list->last_entry = NULL;
+    }
 
-  --list->size;
+    --list->size;
 
-  value = entry->value;
-  recycle_entries(list, entry, entry);
+    value = entry->value;
+    recycle_entries(list, entry, entry);
 
-  return value;
+    return value;
 }
 
-static void remove_one _((List *, VALUE));
-
 static void
-remove_one(list, value)
-  List *list;
-  VALUE value;
-{
-  Entry **ref;
-  Entry *entry;
-  for (ref = &list->entries, entry = list->entries;
-       entry != NULL;
-       ref = &entry->next, entry = entry->next)
-  {
-    if (entry->value == value) {
-      *ref = entry->next;
-      recycle_entries(list, entry, entry);
-      break;
+remove_one(List *list, VALUE value)
+{
+    Entry **ref;
+    Entry *prev;
+    Entry *entry;
+
+    for (ref = &list->entries, prev = NULL, entry = list->entries;
+              entry != NULL;
+              ref = &entry->next, prev = entry, entry = entry->next) {
+        if (entry->value == value) {
+            *ref = entry->next;
+            list->size--;
+            if (!entry->next) {
+                list->last_entry = prev;
+            }
+            recycle_entries(list, entry, entry);
+            break;
+        }
     }
-  }
 }
 
-static void clear_list _((List *));
-
 static void
-clear_list(list)
-  List *list;
+clear_list(List *list)
 {
-  if (list->last_entry) {
-    recycle_entries(list, list->entries, list->last_entry);
-    list->entries = NULL;
-    list->last_entry = NULL;
-    list->size = 0;
-  }
+    if (list->last_entry) {
+        recycle_entries(list, list->entries, list->last_entry);
+        list->entries = NULL;
+        list->last_entry = NULL;
+        list->size = 0;
+    }
 }
 
-static VALUE array_from_list _((List const *));
-
 static VALUE
-array_from_list(list)
-  List const *list;
+array_from_list(List const *list)
 {
-  VALUE ary;
-  Entry *entry;
-  ary = rb_ary_new();
-  for ( entry = list->entries ; entry ; entry = entry->next ) {
-    rb_ary_push(ary, entry->value);
-  }
-  return ary;
+    VALUE ary;
+    Entry *entry;
+    ary = rb_ary_new();
+    for (entry = list->entries; entry; entry = entry->next) {
+        rb_ary_push(ary, entry->value);
+    }
+    return ary;
 }
 
-static VALUE wake_thread _((VALUE));
-
 static VALUE
-wake_thread(thread)
-  VALUE thread;
+wake_thread(VALUE thread)
 {
-  return rb_rescue2(rb_thread_wakeup, thread,
-                    return_value, Qnil, private_eThreadError, 0);
+    return rb_rescue2(rb_thread_wakeup, thread,
+      NULL, Qundef, private_eThreadError, 0);
 }
 
-static VALUE run_thread _((VALUE));
-
 static VALUE
-run_thread(thread)
-  VALUE thread;
+run_thread(VALUE thread)
 {
-  return rb_rescue2(rb_thread_run, thread,
-                    return_value, Qnil, private_eThreadError, 0);
+    return rb_rescue2(rb_thread_run, thread,
+      NULL, Qundef, private_eThreadError, 0);
 }
 
-static VALUE wake_one _((List *));
-
 static VALUE
-wake_one(list)
-  List *list;
+wake_one(List *list)
 {
-  VALUE waking;
+    VALUE waking;
 
-  waking = Qnil;
-  while ( list->entries && !RTEST(waking) ) {
-    waking = wake_thread(shift_list(list));
-  }
+    waking = Qnil;
+    while (list->entries && !RTEST(waking)) {
+        waking = wake_thread(shift_list(list));
+    }
 
-  return waking;
+    return waking;
 }
 
-static VALUE wake_all _((List *));
-
 static VALUE
-wake_all(list)
-  List *list;
+wake_all(List *list)
 {
-  while (list->entries) {
-    wake_one(list);
-  }
-  return Qnil;
+    while (list->entries) {
+        wake_one(list);
+    }
+    return Qnil;
 }
 
-static VALUE wait_list_inner _((List *));
-
 static VALUE
-wait_list_inner(list)
-  List *list;
+wait_list_inner(List *list)
 {
-  push_list(list, rb_thread_current());
-  rb_thread_stop();
-  return Qnil;
+    push_list(list, rb_thread_current());
+    rb_thread_stop();
+    return Qnil;
 }
 
-static VALUE wait_list_cleanup _((List *));
-
 static VALUE
-wait_list_cleanup(list)
-  List *list;
+wait_list_cleanup(List *list)
 {
-  /* cleanup in case of spurious wakeups */
-  rb_thread_critical = 1;
-  remove_one(list, rb_thread_current());
-  rb_thread_critical = 0;
-  return Qnil;
+    /* cleanup in case of spurious wakeups */
+    remove_one(list, rb_thread_current());
+    return Qnil;
 }
 
-static void wait_list _((List *));
-
 static void
-wait_list(list)
-  List *list;
+wait_list(List *list)
 {
-  rb_ensure(wait_list_inner, (VALUE)list, wait_list_cleanup, (VALUE)list);
+    rb_ensure(wait_list_inner, (VALUE)list, wait_list_cleanup, (VALUE)list);
 }
 
-static void assert_no_survivors _((List *, const char *, void *));
-
 static void
-assert_no_survivors(waiting, label, addr)
-  List *waiting;
-  const char *label;
-  void *addr;
-{
-  Entry *entry;
-  for ( entry = waiting->entries ; entry ; entry = entry->next ) {
-    if (RTEST(wake_thread(entry->value))) {
-      rb_bug("%s %p freed with live thread(s) waiting", label, addr);
+assert_no_survivors(List *waiting, const char *label, void *addr)
+{
+    Entry *entry;
+    for (entry = waiting->entries; entry; entry = entry->next) {
+        if (RTEST(wake_thread(entry->value))) {
+            rb_bug("%s %p freed with live thread(s) waiting", label, addr);
+        }
     }
-  }
 }
 
+/*
+ * Document-class: Mutex
+ *
+ * Mutex implements a simple semaphore that can be used to coordinate access to
+ * shared data from multiple concurrent threads.
+ *
+ * Example:
+ *
+ *   require 'thread'
+ *   semaphore = Mutex.new
+ *
+ *   a = Thread.new {
+ *     semaphore.synchronize {
+ *       # access shared resource
+ *     }
+ *   }
+ *
+ *   b = Thread.new {
+ *     semaphore.synchronize {
+ *       # access shared resource
+ *     }
+ *   }
+ *
+ */
+
 typedef struct _Mutex {
-  VALUE owner;
-  List waiting;
+    VALUE owner;
+    List waiting;
 } Mutex;
 
-static void mark_mutex _((Mutex *));
-
 static void
-mark_mutex(mutex)
-  Mutex *mutex;
+mark_mutex(Mutex *mutex)
 {
-  rb_gc_mark(mutex->owner);
-  mark_list(&mutex->waiting);
+    rb_gc_mark(mutex->owner);
+    mark_list(&mutex->waiting);
 }
 
-static void finalize_mutex _((Mutex *));
-
 static void
-finalize_mutex(mutex)
-  Mutex *mutex;
+finalize_mutex(Mutex *mutex)
 {
-  finalize_list(&mutex->waiting);
+    finalize_list(&mutex->waiting);
 }
 
-static void free_mutex _((Mutex *));
-
 static void
-free_mutex(mutex)
-  Mutex *mutex;
+free_mutex(Mutex *mutex)
 {
-  assert_no_survivors(&mutex->waiting, "mutex", mutex);
-  finalize_mutex(mutex);
-  free(mutex);
+    assert_no_survivors(&mutex->waiting, "mutex", mutex);
+    finalize_mutex(mutex);
+    xfree(mutex);
 }
 
-static void init_mutex _((Mutex *));
-
 static void
-init_mutex(mutex)
-  Mutex *mutex;
+init_mutex(Mutex *mutex)
 {
-  mutex->owner = Qnil;
-  init_list(&mutex->waiting);
+    mutex->owner = Qnil;
+    init_list(&mutex->waiting);
 }
 
-static VALUE rb_mutex_alloc _((VALUE));
+/*
+ * Document-method: new
+ * call-seq: Mutex.new
+ * 
+ * Creates a new Mutex
+ *
+ */
 
 static VALUE 
-rb_mutex_alloc(klass)
-  VALUE klass;
+rb_mutex_alloc(VALUE klass)
 {
-  Mutex *mutex;
-  mutex = (Mutex *)malloc(sizeof(Mutex));
-  init_mutex(mutex);
-  return Data_Wrap_Struct(klass, mark_mutex, free_mutex, mutex);
+    Mutex *mutex;
+    mutex = ALLOC(Mutex);
+    init_mutex(mutex);
+    return Data_Wrap_Struct(klass, mark_mutex, free_mutex, mutex);
 }
 
-static VALUE rb_mutex_locked_p _((VALUE));
+/*
+ * Document-method: locked?
+ * call-seq: locked?
+ *
+ * Returns +true+ if this lock is currently held by some thread.
+ *
+ */
 
 static VALUE
-rb_mutex_locked_p(self)
-  VALUE self;
+rb_mutex_locked_p(VALUE self)
 {
-  Mutex *mutex;
-  Data_Get_Struct(self, Mutex, mutex);
-  return ( RTEST(mutex->owner) ? Qtrue : Qfalse );
+    Mutex *mutex;
+    Data_Get_Struct(self, Mutex, mutex);
+    return RTEST(mutex->owner) ? Qtrue : Qfalse;
 }
 
-static VALUE rb_mutex_try_lock _((VALUE));
+/*
+ * Document-method: try_lock
+ * call-seq: try_lock
+ *
+ * Attempts to obtain the lock and returns immediately. Returns +true+ if the
+ * lock was granted.
+ *
+ */
 
 static VALUE
-rb_mutex_try_lock(self)
-  VALUE self;
+rb_mutex_try_lock(VALUE self)
 {
-  Mutex *mutex;
-  VALUE result;
+    Mutex *mutex;
 
-  Data_Get_Struct(self, Mutex, mutex);
+    Data_Get_Struct(self, Mutex, mutex);
 
-  result = Qfalse;
+    if (RTEST(mutex->owner))
+        return Qfalse;
 
-  rb_thread_critical = 1;
-  if (!RTEST(mutex->owner)) {
     mutex->owner = rb_thread_current();
-    result = Qtrue;
-  }
-  rb_thread_critical = 0;
-
-  return result;
+    return Qtrue;
 }
 
-static void lock_mutex _((Mutex *));
+/*
+ * Document-method: lock
+ * call-seq: lock
+ *
+ * Attempts to grab the lock and waits if it isn't available.
+ *
+ */
 
-static void
-lock_mutex(mutex)
-  Mutex *mutex;
+static VALUE
+lock_mutex(Mutex *mutex)
 {
-  VALUE current;
-  current = rb_thread_current();
-
-  rb_thread_critical = 1;
+    VALUE current;
+    current = rb_thread_current();
 
-  while (RTEST(mutex->owner)) {
-    wait_list(&mutex->waiting);
     rb_thread_critical = 1;
-  }
-  mutex->owner = current; 
 
-  rb_thread_critical = 0;
-}
+    while (RTEST(mutex->owner)) {
+        wait_list(&mutex->waiting);
+        rb_thread_critical = 1;
+    }
+    mutex->owner = current; 
 
-static VALUE rb_mutex_lock _((VALUE));
+    rb_thread_critical = 0;
+    return Qnil;
+}
 
 static VALUE
-rb_mutex_lock(self)
-  VALUE self;
+rb_mutex_lock(VALUE self)
 {
-  Mutex *mutex;
-  Data_Get_Struct(self, Mutex, mutex);
-  lock_mutex(mutex);
-  return self;
+    Mutex *mutex;
+    Data_Get_Struct(self, Mutex, mutex);
+    lock_mutex(mutex);
+    return self;
 }
 
-static VALUE unlock_mutex_inner _((Mutex *));
+/*
+ * Document-method: unlock
+ *
+ * Releases the lock. Returns +nil+ if ref wasn't locked.
+ *
+ */
 
 static VALUE
-unlock_mutex_inner(mutex)
-  Mutex *mutex;
+unlock_mutex_inner(Mutex *mutex)
 {
-  VALUE waking;
+    VALUE waking;
 
-  if (!RTEST(mutex->owner)) {
-    return Qundef;
-  }
-  mutex->owner = Qnil;
-  waking = wake_one(&mutex->waiting);
+    if (!RTEST(mutex->owner)) {
+	return Qundef;
+    }
 
-  return waking;
-}
+    mutex->owner = Qnil;
+    waking = wake_one(&mutex->waiting);
 
-static VALUE set_critical _((VALUE));
+    return waking;
+}
 
 static VALUE
-set_critical(value)
-  VALUE value;
+set_critical(VALUE value)
 {
-  rb_thread_critical = (int)value;
-  return Qnil;
+    rb_thread_critical = (int)value;
+    return Qundef;
 }
 
-static VALUE unlock_mutex _((Mutex *));
-
 static VALUE
-unlock_mutex(mutex)
-  Mutex *mutex;
+unlock_mutex(Mutex *mutex)
 {
-  VALUE waking;
+    VALUE waking;
 
-  rb_thread_critical = 1;
-  waking = rb_ensure(unlock_mutex_inner, (VALUE)mutex, set_critical, 0);
+    rb_thread_critical = 1;
+    waking = rb_ensure(unlock_mutex_inner, (VALUE)mutex, set_critical, 0);
 
-  if ( waking == Qundef ) {
-    return Qfalse;
-  }
+    if (waking == Qundef) {
+        return Qfalse;
+    }
 
-  if (RTEST(waking)) {
-    run_thread(waking);
-  }
+    if (RTEST(waking)) {
+        run_thread(waking);
+    }
 
-  return Qtrue;
+    return Qtrue;
 }
 
-static VALUE rb_mutex_unlock _((VALUE));
-
 static VALUE
-rb_mutex_unlock(self)
-  VALUE self;
+rb_mutex_unlock(VALUE self)
 {
-  Mutex *mutex;
-  Data_Get_Struct(self, Mutex, mutex);
+    Mutex *mutex;
+    Data_Get_Struct(self, Mutex, mutex);
 
-  if (RTEST(unlock_mutex(mutex))) {
-    return self;
-  } else {
-    return Qnil;
-  }
+    if (RTEST(unlock_mutex(mutex))) {
+        return self;
+    } else {
+        return Qnil;
+    }
 }
 
-static VALUE rb_mutex_exclusive_unlock_inner _((Mutex *));
+/*
+ * Document-method: exclusive_unlock
+ * call-seq: exclusive_unlock { ... }
+ *
+ * If the mutex is locked, unlocks the mutex, wakes one waiting thread, and
+ * yields in a critical section.
+ *
+ */
 
 static VALUE
-rb_mutex_exclusive_unlock_inner(mutex)
-  Mutex *mutex;
+rb_mutex_exclusive_unlock_inner(Mutex *mutex)
 {
-  VALUE waking;
-  waking = unlock_mutex_inner(mutex);
-  rb_yield(Qundef);
-  return waking;
+    VALUE waking;
+    waking = unlock_mutex_inner(mutex);
+    rb_yield(Qundef);
+    return waking;
 }
 
-static VALUE rb_mutex_exclusive_unlock _((VALUE));
-
 static VALUE
-rb_mutex_exclusive_unlock(self)
-  VALUE self;
+rb_mutex_exclusive_unlock(VALUE self)
 {
-  Mutex *mutex;
-  VALUE waking;
-  Data_Get_Struct(self, Mutex, mutex);
+    Mutex *mutex;
+    VALUE waking;
+    Data_Get_Struct(self, Mutex, mutex);
 
-  rb_thread_critical = 1;
-  waking = rb_ensure(rb_mutex_exclusive_unlock_inner, (VALUE)mutex, set_critical, 0);
+    rb_thread_critical = 1;
+    waking = rb_ensure(rb_mutex_exclusive_unlock_inner, (VALUE)mutex, set_critical, 0);
 
-  if ( waking == Qundef ) {
-    return Qnil;
-  }
+    if (waking == Qundef) {
+        return Qnil;
+    }
 
-  if (RTEST(waking)) {
-    run_thread(waking);
-  }
+    if (RTEST(waking)) {
+        run_thread(waking);
+    }
 
-  return self;
+    return self;
 }
 
-static VALUE rb_mutex_synchronize _((VALUE));
+/*
+ * Document-method: synchronize
+ * call-seq: synchronize { ... }
+ *
+ * Obtains a lock, runs the block, and releases the lock when the block
+ * completes.  See the example under Mutex.
+ *
+ */
 
 static VALUE
-rb_mutex_synchronize(self)
-  VALUE self;
+rb_mutex_synchronize(VALUE self)
 {
-  rb_mutex_lock(self);
-  return rb_ensure(rb_yield, Qundef, rb_mutex_unlock, self);
+    rb_mutex_lock(self);
+    return rb_ensure(rb_yield, Qundef, rb_mutex_unlock, self);
 }
 
+/*
+ * Document-class: ConditionVariable
+ *
+ * ConditionVariable objects augment class Mutex. Using condition variables,
+ * it is possible to suspend while in the middle of a critical section until a
+ * resource becomes available.
+ *
+ * Example:
+ *
+ *   require 'thread'
+ *
+ *   mutex = Mutex.new
+ *   resource = ConditionVariable.new
+ *
+ *   a = Thread.new {
+ *     mutex.synchronize {
+ *       # Thread 'a' now needs the resource
+ *       resource.wait(mutex)
+ *       # 'a' can now have the resource
+ *     }
+ *   }
+ *
+ *   b = Thread.new {
+ *     mutex.synchronize {
+ *       # Thread 'b' has finished using the resource
+ *       resource.signal
+ *     }
+ *   }
+ *
+ */
+
 typedef struct _ConditionVariable {
-  List waiting;
+    List waiting;
 } ConditionVariable;
 
-static void mark_condvar _((ConditionVariable *));
-
 static void
-mark_condvar(condvar)
-  ConditionVariable *condvar;
+mark_condvar(ConditionVariable *condvar)
 {
-  mark_list(&condvar->waiting);
+    mark_list(&condvar->waiting);
 }
 
-static void finalize_condvar _((ConditionVariable *));
-
 static void
-finalize_condvar(condvar)
-  ConditionVariable *condvar;
+finalize_condvar(ConditionVariable *condvar)
 {
-  finalize_list(&condvar->waiting);
+    finalize_list(&condvar->waiting);
 }
 
-static void free_condvar _((ConditionVariable *));
-
 static void
-free_condvar(condvar)
-  ConditionVariable *condvar;
+free_condvar(ConditionVariable *condvar)
 {
-  assert_no_survivors(&condvar->waiting, "condition variable", condvar);
-  finalize_condvar(condvar);
-  free(condvar);
+    assert_no_survivors(&condvar->waiting, "condition variable", condvar);
+    finalize_condvar(condvar);
+    xfree(condvar);
 }
 
-static void init_condvar _((ConditionVariable *));
-
 static void
-init_condvar(condvar)
-  ConditionVariable *condvar;
+init_condvar(ConditionVariable *condvar)
 {
-  init_list(&condvar->waiting);
+    init_list(&condvar->waiting);
 }
 
-static VALUE rb_condvar_alloc _((VALUE));
+/*
+ * Document-method: new
+ * call-seq: ConditionVariable.new
+ *
+ * Creates a new ConditionVariable
+ *
+ */
 
 static VALUE
-rb_condvar_alloc(klass)
-  VALUE klass;
+rb_condvar_alloc(VALUE klass)
 {
-  ConditionVariable *condvar;
+    ConditionVariable *condvar;
 
-  condvar = (ConditionVariable *)malloc(sizeof(ConditionVariable));
-  init_condvar(condvar);
+    condvar = ALLOC(ConditionVariable);
+    init_condvar(condvar);
 
-  return Data_Wrap_Struct(klass, mark_condvar, free_condvar, condvar);
+    return Data_Wrap_Struct(klass, mark_condvar, free_condvar, condvar);
 }
 
-static void wait_condvar _((ConditionVariable *, Mutex *));
+/*
+ * Document-method: wait
+ * call-seq: wait
+ *
+ * Releases the lock held in +mutex+ and waits; reacquires the lock on wakeup.
+ *
+ */
 
 static void
-wait_condvar(condvar, mutex)
-  ConditionVariable *condvar;
-  Mutex *mutex;
+wait_condvar(ConditionVariable *condvar, Mutex *mutex)
 {
-  rb_thread_critical = 1;
-  if (!RTEST(mutex->owner)) {
-    rb_thread_critical = Qfalse;
-    return;
-  }
-  if ( mutex->owner != rb_thread_current() ) {
-    rb_thread_critical = Qfalse;
-    rb_raise(private_eThreadError, "Not owner");
-  }
-  mutex->owner = Qnil;
-  wait_list(&condvar->waiting);
-
-  lock_mutex(mutex);
+    rb_thread_critical = 1;
+    if (rb_thread_current() != mutex->owner) {
+        rb_thread_critical = 0;
+        rb_raise(private_eThreadError, "not owner of the synchronization mutex");
+    }
+    unlock_mutex_inner(mutex);
+    rb_ensure(wait_list, (VALUE)&condvar->waiting, lock_mutex, (VALUE)mutex);
 }
 
-static VALUE legacy_exclusive_unlock _((VALUE));
-
 static VALUE
-legacy_exclusive_unlock(mutex)
-  VALUE mutex;
+legacy_exclusive_unlock(VALUE mutex)
 {
-  return rb_funcall(mutex, rb_intern("exclusive_unlock"), 0);
+    return rb_funcall(mutex, rb_intern("exclusive_unlock"), 0);
 }
 
 typedef struct {
-  ConditionVariable *condvar;
-  VALUE mutex;
+    ConditionVariable *condvar;
+    VALUE mutex;
 } legacy_wait_args;
 
-static VALUE legacy_wait _((VALUE, legacy_wait_args *));
-
 static VALUE
-legacy_wait(unused, args)
-  VALUE unused;
-  legacy_wait_args *args;
+legacy_wait(VALUE unused, legacy_wait_args *args)
 {
-  wait_list(&args->condvar->waiting);
-  rb_funcall(args->mutex, rb_intern("lock"), 0);
-  return Qnil;
+    wait_list(&args->condvar->waiting);
+    rb_funcall(args->mutex, rb_intern("lock"), 0);
+    return Qnil;
 }
 
-static VALUE rb_condvar_wait _((VALUE, VALUE));
-
 static VALUE
-rb_condvar_wait(self, mutex_v)
-  VALUE self;
-  VALUE mutex_v;
-{
-  ConditionVariable *condvar;
-  Data_Get_Struct(self, ConditionVariable, condvar);
-
-  if ( CLASS_OF(mutex_v) != rb_cMutex ) {
-    /* interoperate with legacy mutex */
-    legacy_wait_args args;
-    args.condvar = condvar;
-    args.mutex = mutex_v;
-    rb_iterate(legacy_exclusive_unlock, mutex_v, legacy_wait, (VALUE)&args);
-  } else {
-    Mutex *mutex;
-    Data_Get_Struct(mutex_v, Mutex, mutex);
-    wait_condvar(condvar, mutex);
-  }
+rb_condvar_wait(VALUE self, VALUE mutex_v)
+{
+    ConditionVariable *condvar;
+    Data_Get_Struct(self, ConditionVariable, condvar);
+
+    if (CLASS_OF(mutex_v) != rb_cMutex) {
+        /* interoperate with legacy mutex */
+        legacy_wait_args args;
+        args.condvar = condvar;
+        args.mutex = mutex_v;
+        rb_iterate(legacy_exclusive_unlock, mutex_v, legacy_wait, (VALUE)&args);
+    } else {
+        Mutex *mutex;
+        Data_Get_Struct(mutex_v, Mutex, mutex);
+        wait_condvar(condvar, mutex);
+    }
 
-  return self;
+    return self;
 }
 
-static VALUE rb_condvar_broadcast _((VALUE));
+/*
+ * Document-method: broadcast
+ * call-seq: broadcast
+ *
+ * Wakes up all threads waiting for this condition.
+ *
+ */
 
 static VALUE
-rb_condvar_broadcast(self)
-  VALUE self;
+rb_condvar_broadcast(VALUE self)
 {
-  ConditionVariable *condvar;
+    ConditionVariable *condvar;
 
-  Data_Get_Struct(self, ConditionVariable, condvar);
+    Data_Get_Struct(self, ConditionVariable, condvar);
   
-  rb_thread_critical = 1;
-  rb_ensure(wake_all, (VALUE)&condvar->waiting, set_critical, 0);
-  rb_thread_schedule();
+    rb_thread_critical = 1;
+    rb_ensure(wake_all, (VALUE)&condvar->waiting, set_critical, 0);
+    rb_thread_schedule();
 
-  return self;
+    return self;
 }
 
-static void signal_condvar _((ConditionVariable *condvar));
+/*
+ * Document-method: signal
+ * call-seq: signal
+ *
+ * Wakes up the first thread in line waiting for this condition.
+ *
+ */
 
 static void
-signal_condvar(condvar)
-  ConditionVariable *condvar;
+signal_condvar(ConditionVariable *condvar)
 {
-  VALUE waking;
-  rb_thread_critical = 1;
-  waking = rb_ensure(wake_one, (VALUE)&condvar->waiting, set_critical, 0);
-  if (RTEST(waking)) {
-    run_thread(waking);
-  }
+    VALUE waking;
+    rb_thread_critical = 1;
+    waking = rb_ensure(wake_one, (VALUE)&condvar->waiting, set_critical, 0);
+    if (RTEST(waking)) {
+        run_thread(waking);
+    }
 }
 
-static VALUE rb_condvar_signal _((VALUE));
-
 static VALUE
-rb_condvar_signal(self)
-  VALUE self;
+rb_condvar_signal(VALUE self)
 {
-  ConditionVariable *condvar;
-  Data_Get_Struct(self, ConditionVariable, condvar);
-  signal_condvar(condvar);
-  return self;
+    ConditionVariable *condvar;
+    Data_Get_Struct(self, ConditionVariable, condvar);
+    signal_condvar(condvar);
+    return self;
 }
 
+/*
+ * Document-class: Queue
+ *
+ * This class provides a way to synchronize communication between threads.
+ *
+ * Example:
+ *
+ *   require 'thread'
+ *
+ *   queue = Queue.new
+ *
+ *   producer = Thread.new do
+ *     5.times do |i|
+ *       sleep rand(i) # simulate expense
+ *       queue << i
+ *       puts "#{i} produced"
+ *     end
+ *   end
+ *
+ *   consumer = Thread.new do
+ *     5.times do |i|
+ *       value = queue.pop
+ *       sleep rand(i/2) # simulate expense
+ *       puts "consumed #{value}"
+ *     end
+ *   end
+ *
+ *   consumer.join
+ *
+ */
+
 typedef struct _Queue {
-  Mutex mutex;
-  ConditionVariable value_available;
-  ConditionVariable space_available;
-  List values;
-  unsigned long capacity;
+    Mutex mutex;
+    ConditionVariable value_available;
+    ConditionVariable space_available;
+    List values;
+    unsigned long capacity;
 } Queue;
 
-static void mark_queue _((Queue *));
-
 static void
-mark_queue(queue)
-  Queue *queue;
+mark_queue(Queue *queue)
 {
-  mark_mutex(&queue->mutex);
-  mark_condvar(&queue->value_available);
-  mark_condvar(&queue->space_available);
-  mark_list(&queue->values);
+    mark_mutex(&queue->mutex);
+    mark_condvar(&queue->value_available);
+    mark_condvar(&queue->space_available);
+    mark_list(&queue->values);
 }
 
-static void finalize_queue _((Queue *));
-
 static void
-finalize_queue(queue)
-  Queue *queue;
+finalize_queue(Queue *queue)
 {
-  finalize_mutex(&queue->mutex);
-  finalize_condvar(&queue->value_available);
-  finalize_condvar(&queue->space_available);
-  finalize_list(&queue->values);
+    finalize_mutex(&queue->mutex);
+    finalize_condvar(&queue->value_available);
+    finalize_condvar(&queue->space_available);
+    finalize_list(&queue->values);
 }
 
-static void free_queue _((Queue *));
-
 static void
-free_queue(queue)
-  Queue *queue;
+free_queue(Queue *queue)
 {
-  assert_no_survivors(&queue->mutex.waiting, "queue", queue);
-  assert_no_survivors(&queue->space_available.waiting, "queue", queue);
-  assert_no_survivors(&queue->value_available.waiting, "queue", queue);
-  finalize_queue(queue);
-  free(queue);
+    assert_no_survivors(&queue->mutex.waiting, "queue", queue);
+    assert_no_survivors(&queue->space_available.waiting, "queue", queue);
+    assert_no_survivors(&queue->value_available.waiting, "queue", queue);
+    finalize_queue(queue);
+    xfree(queue);
 }
 
-static void init_queue _((Queue *));
-
 static void
-init_queue(queue)
-  Queue *queue;
+init_queue(Queue *queue)
 {
-  init_mutex(&queue->mutex);
-  init_condvar(&queue->value_available);
-  init_condvar(&queue->space_available);
-  init_list(&queue->values);
-  queue->capacity = 0;
+    init_mutex(&queue->mutex);
+    init_condvar(&queue->value_available);
+    init_condvar(&queue->space_available);
+    init_list(&queue->values);
+    queue->capacity = 0;
 }
 
-static VALUE rb_queue_alloc _((VALUE));
+/*
+ * Document-method: new
+ * call-seq: new
+ *
+ * Creates a new queue.
+ *
+ */
 
 static VALUE
-rb_queue_alloc(klass)
-  VALUE klass;
+rb_queue_alloc(VALUE klass)
 {
-  Queue *queue;
-  queue = (Queue *)malloc(sizeof(Queue));
-  init_queue(queue);
-  return Data_Wrap_Struct(klass, mark_queue, free_queue, queue);
+    Queue *queue;
+    queue = ALLOC(Queue);
+    init_queue(queue);
+    return Data_Wrap_Struct(klass, mark_queue, free_queue, queue);
 }
 
-static VALUE rb_queue_marshal_load _((VALUE, VALUE));
-
 static VALUE
-rb_queue_marshal_load(self, data)
-  VALUE self;
-  VALUE data;
+rb_queue_marshal_load(VALUE self, VALUE data)
 {
-  Queue *queue;
-  VALUE array;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE array;
+    Data_Get_Struct(self, Queue, queue);
 
-  array = rb_marshal_load(data);
-  if ( TYPE(array) != T_ARRAY ) {
-    rb_raise(rb_eRuntimeError, "expected Array of queue data");
-  }
-  if ( RARRAY(array)->len < 1 ) {
-    rb_raise(rb_eRuntimeError, "missing capacity value");
-  }
-  queue->capacity = NUM2ULONG(rb_ary_shift(array));
-  push_multiple_list(&queue->values, RARRAY(array)->ptr, (unsigned)RARRAY(array)->len);
+    array = rb_marshal_load(data);
+    if (TYPE(array) != T_ARRAY) {
+        rb_raise(rb_eRuntimeError, "expected Array of queue data");
+    }
+    if (RARRAY(array)->len < 1) {
+        rb_raise(rb_eRuntimeError, "missing capacity value");
+    }
+    queue->capacity = NUM2ULONG(rb_ary_shift(array));
+    push_multiple_list(&queue->values, RARRAY(array)->ptr, (unsigned)RARRAY(array)->len);
 
-  return self;
+    return self;
 }
 
-static VALUE rb_queue_marshal_dump _((VALUE));
-
 static VALUE
-rb_queue_marshal_dump(self)
-  VALUE self;
+rb_queue_marshal_dump(VALUE self)
 {
-  Queue *queue;
-  VALUE array;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE array;
+    Data_Get_Struct(self, Queue, queue);
 
-  array = array_from_list(&queue->values);
-  rb_ary_unshift(array, ULONG2NUM(queue->capacity));
-  return rb_marshal_dump(array, Qnil);
+    array = array_from_list(&queue->values);
+    rb_ary_unshift(array, ULONG2NUM(queue->capacity));
+    return rb_marshal_dump(array, Qnil);
 }
 
-static VALUE rb_queue_clear _((VALUE));
+/*
+ * Document-method: clear
+ * call-seq: clear
+ *
+ * Removes all objects from the queue.
+ *
+ */
 
 static VALUE
-rb_queue_clear(self)
-  VALUE self;
+rb_queue_clear(VALUE self)
 {
-  Queue *queue;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  clear_list(&queue->values);
-  signal_condvar(&queue->space_available);
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    clear_list(&queue->values);
+    signal_condvar(&queue->space_available);
+    unlock_mutex(&queue->mutex);
 
-  return self;
+    return self;
 }
 
-static VALUE rb_queue_empty_p _((VALUE));
+/*
+ * Document-method: empty?
+ * call-seq: empty?
+ *
+ * Returns +true+ if the queue is empty.
+ *
+ */
 
 static VALUE
-rb_queue_empty_p(self)
-  VALUE self;
+rb_queue_empty_p(VALUE self)
 {
-  Queue *queue;
-  VALUE result;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE result;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  result = ( ( queue->values.size == 0 ) ? Qtrue : Qfalse );
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    result = queue->values.size == 0 ? Qtrue : Qfalse;
+    unlock_mutex(&queue->mutex);
 
-  return result;
+    return result;
 }
 
-static VALUE rb_queue_length _((VALUE));
+/*
+ * Document-method: length
+ * call-seq: length
+ *
+ * Returns the length of the queue.
+ *
+ */
 
 static VALUE
-rb_queue_length(self)
-  VALUE self;
+rb_queue_length(VALUE self)
 {
-  Queue *queue;
-  VALUE result;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE result;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  result = ULONG2NUM(queue->values.size);
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    result = ULONG2NUM(queue->values.size);
+    unlock_mutex(&queue->mutex);
 
-  return result;
+    return result;
 }
 
-static VALUE rb_queue_num_waiting _((VALUE));
+/*
+ * Document-method: num_waiting
+ * call-seq: num_waiting
+ *
+ * Returns the number of threads waiting on the queue.
+ *
+ */
 
 static VALUE
-rb_queue_num_waiting(self)
-  VALUE self;
+rb_queue_num_waiting(VALUE self)
 {
-  Queue *queue;
-  VALUE result;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE result;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  result = ULONG2NUM(queue->value_available.waiting.size +
-                     queue->space_available.waiting.size);
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    result = ULONG2NUM(queue->value_available.waiting.size +
+      queue->space_available.waiting.size);
+    unlock_mutex(&queue->mutex);
 
-  return result;
+    return result;
 }
 
-static VALUE rb_queue_pop _((int, VALUE *, VALUE));
+/*
+ * Document-method: pop
+ * call_seq: pop(non_block=false)
+ *
+ * Retrieves data from the queue.  If the queue is empty, the calling thread is
+ * suspended until data is pushed onto the queue.  If +non_block+ is true, the
+ * thread isn't suspended, and an exception is raised.
+ *
+ */
 
 static VALUE
-rb_queue_pop(argc, argv, self)
-  int argc;
-  VALUE *argv;
-  VALUE self;
-{
-  Queue *queue;
-  int should_block;
-  VALUE result;
-  Data_Get_Struct(self, Queue, queue);
-
-  if ( argc == 0 ) {
-    should_block = 1;
-  } else if ( argc == 1 ) {
-    should_block = !RTEST(argv[0]);
-  } else {
-    rb_raise(rb_eArgError, "wrong number of arguments (%d for 1)", argc);
-  }
-
-  lock_mutex(&queue->mutex);
-  if ( !queue->values.entries && !should_block ) {
-    unlock_mutex(&queue->mutex);
-    rb_raise(private_eThreadError, "queue empty");
-  }
+rb_queue_pop(int argc, VALUE *argv, VALUE self)
+{
+    Queue *queue;
+    int should_block;
+    VALUE result;
+    Data_Get_Struct(self, Queue, queue);
+
+    if (argc == 0) {
+        should_block = 1;
+    } else if (argc == 1) {
+        should_block = !RTEST(argv[0]);
+    } else {
+        rb_raise(rb_eArgError, "wrong number of arguments (%d for 1)", argc);
+    }
 
-  while (!queue->values.entries) {
-    wait_condvar(&queue->value_available, &queue->mutex);
-  }
+    lock_mutex(&queue->mutex);
+    if (!queue->values.entries && !should_block) {
+        unlock_mutex(&queue->mutex);
+        rb_raise(private_eThreadError, "queue empty");
+    }
 
-  result = shift_list(&queue->values);
-  if ( queue->capacity && queue->values.size < queue->capacity ) {
-    signal_condvar(&queue->space_available);
-  }
-  unlock_mutex(&queue->mutex);
+    while (!queue->values.entries) {
+        wait_condvar(&queue->value_available, &queue->mutex);
+    }
 
-  return result;
+    result = shift_list(&queue->values);
+    if (queue->capacity && queue->values.size < queue->capacity) {
+        signal_condvar(&queue->space_available);
+    }
+    unlock_mutex(&queue->mutex);
+
+    return result;
 }
 
-static VALUE rb_queue_push _((VALUE, VALUE));
+/*
+ * Document-method: push
+ * call-seq: push(obj)
+ *
+ * Pushes +obj+ to the queue.
+ *
+ */
 
 static VALUE
-rb_queue_push(self, value)
-  VALUE self;
-  VALUE value;
+rb_queue_push(VALUE self, VALUE value)
 {
-  Queue *queue;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  while ( queue->capacity && queue->values.size >= queue->capacity ) {
-    wait_condvar(&queue->space_available, &queue->mutex);
-  }
-  push_list(&queue->values, value);
-  signal_condvar(&queue->value_available);
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    while (queue->capacity && queue->values.size >= queue->capacity) {
+        wait_condvar(&queue->space_available, &queue->mutex);
+    }
+    push_list(&queue->values, value);
+    signal_condvar(&queue->value_available);
+    unlock_mutex(&queue->mutex);
 
-  return self;
+    return self;
 }
 
-static VALUE rb_sized_queue_max _((VALUE));
+/*
+ * Document-class: SizedQueue
+ *
+ * This class represents queues of specified size capacity.  The push operation
+ * may be blocked if the capacity is full.
+ *
+ * See Queue for an example of how a SizedQueue works.
+ *
+ */
+
+/*
+ * Document-method: new
+ * call-seq: new
+ *
+ * Creates a fixed-length queue with a maximum size of +max+.
+ *
+ */
+
+/*
+ * Document-method: max
+ * call-seq: max
+ *
+ * Returns the maximum size of the queue.
+ *
+ */
 
 static VALUE
-rb_sized_queue_max(self)
-  VALUE self;
+rb_sized_queue_max(VALUE self)
 {
-  Queue *queue;
-  VALUE result;
-  Data_Get_Struct(self, Queue, queue);
+    Queue *queue;
+    VALUE result;
+    Data_Get_Struct(self, Queue, queue);
 
-  lock_mutex(&queue->mutex);
-  result = ULONG2NUM(queue->capacity);
-  unlock_mutex(&queue->mutex);
+    lock_mutex(&queue->mutex);
+    result = ULONG2NUM(queue->capacity);
+    unlock_mutex(&queue->mutex);
 
-  return result;
+    return result;
 }
 
-static VALUE rb_sized_queue_max_set _((VALUE, VALUE));
+/*
+ * Document-method: max=
+ * call-seq: max=(size)
+ *
+ * Sets the maximum size of the queue.
+ *
+ */
 
 static VALUE
-rb_sized_queue_max_set(self, value)
-  VALUE self;
-  VALUE value;
-{
-  Queue *queue;
-  unsigned long new_capacity;
-  unsigned long difference;
-  Data_Get_Struct(self, Queue, queue);
-
-  new_capacity = NUM2ULONG(value);
-
-  if ( new_capacity < 1 ) {
-    rb_raise(rb_eArgError, "value must be positive");
-  }
-
-  lock_mutex(&queue->mutex);
-  if ( queue->capacity && new_capacity > queue->capacity ) {
-    difference = new_capacity - queue->capacity;
-  } else {
-    difference = 0;
-  }
-  queue->capacity = new_capacity;
-  for ( ; difference > 0 ; --difference ) {
-    signal_condvar(&queue->space_available);
-  }
-  unlock_mutex(&queue->mutex);
+rb_sized_queue_max_set(VALUE self, VALUE value)
+{
+    Queue *queue;
+    unsigned long new_capacity;
+    unsigned long difference;
+    Data_Get_Struct(self, Queue, queue);
+
+    new_capacity = NUM2ULONG(value);
 
-  return self;
+    if (new_capacity < 1) {
+        rb_raise(rb_eArgError, "value must be positive");
+    }
+
+    lock_mutex(&queue->mutex);
+    if (queue->capacity && new_capacity > queue->capacity) {
+        difference = new_capacity - queue->capacity;
+    } else {
+        difference = 0;
+    }
+    queue->capacity = new_capacity;
+    for (; difference > 0; --difference) {
+        signal_condvar(&queue->space_available);
+    }
+    unlock_mutex(&queue->mutex);
+
+    return self;
 }
 
-/* Existing code expects to be able to serialize Mutexes... */
+/*
+ * Document-method: push
+ * call-seq: push(obj)
+ *
+ * Pushes +obj+ to the queue.  If there is no space left in the queue, waits
+ * until space becomes available.
+ *
+ */
 
-static VALUE dummy_load _((VALUE, VALUE)); 
+/*
+ * Document-method: pop
+ * call-seq: pop(non_block=false)
+ *
+ * Retrieves data from the queue and runs a waiting thread, if any.
+ *
+ */
+
+/* for marshalling mutexes and condvars */
 
 static VALUE
-dummy_load(self, string)
-  VALUE self;
-  VALUE string;
+dummy_load(VALUE self, VALUE string)
 {
-  return Qnil;
+    return Qnil;
+}
+
+static VALUE
+dummy_dump(VALUE self)
+{
+    return rb_str_new2("");
 }
 
-static VALUE dummy_dump _((VALUE));
 
 static VALUE
-dummy_dump(self)
-  VALUE self;
-{
-  return rb_str_new2("");
-}
-
-static VALUE setup_classes _((VALUE));
-
-static VALUE setup_classes(unused)
-  VALUE unused;
-{
-  rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("Mutex")));
-  rb_cMutex = rb_define_class("Mutex", rb_cObject);
-  rb_define_alloc_func(rb_cMutex, rb_mutex_alloc);
-  rb_define_method(rb_cMutex, "marshal_load", dummy_load, 1);
-  rb_define_method(rb_cMutex, "marshal_dump", dummy_dump, 0);
-  rb_define_method(rb_cMutex, "initialize", return_value, 0);
-  rb_define_method(rb_cMutex, "locked?", rb_mutex_locked_p, 0);
-  rb_define_method(rb_cMutex, "try_lock", rb_mutex_try_lock, 0);
-  rb_define_method(rb_cMutex, "lock", rb_mutex_lock, 0);
-  rb_define_method(rb_cMutex, "unlock", rb_mutex_unlock, 0);
-  rb_define_method(rb_cMutex, "exclusive_unlock", rb_mutex_exclusive_unlock, 0);
-  rb_define_method(rb_cMutex, "synchronize", rb_mutex_synchronize, 0);
-
-  rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("ConditionVariable")));
-  rb_cConditionVariable = rb_define_class("ConditionVariable", rb_cObject);
-  rb_define_alloc_func(rb_cConditionVariable, rb_condvar_alloc);
-  rb_define_method(rb_cConditionVariable, "marshal_load", dummy_load, 1);
-  rb_define_method(rb_cConditionVariable, "marshal_dump", dummy_dump, 0);
-  rb_define_method(rb_cConditionVariable, "initialize", return_value, 0);
-  rb_define_method(rb_cConditionVariable, "wait", rb_condvar_wait, 1);
-  rb_define_method(rb_cConditionVariable, "broadcast", rb_condvar_broadcast, 0);
-  rb_define_method(rb_cConditionVariable, "signal", rb_condvar_signal, 0);
-
-  rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("Queue")));
-  rb_cQueue = rb_define_class("Queue", rb_cObject);
-  rb_define_alloc_func(rb_cQueue, rb_queue_alloc);
-  rb_define_method(rb_cQueue, "marshal_load", rb_queue_marshal_load, 1);
-  rb_define_method(rb_cQueue, "marshal_dump", rb_queue_marshal_dump, 0);
-  rb_define_method(rb_cQueue, "initialize", return_value, 0);
-  rb_define_method(rb_cQueue, "clear", rb_queue_clear, 0);
-  rb_define_method(rb_cQueue, "empty?", rb_queue_empty_p, 0);
-  rb_define_method(rb_cQueue, "length", rb_queue_length, 0);
-  rb_define_method(rb_cQueue, "num_waiting", rb_queue_num_waiting, 0);
-  rb_define_method(rb_cQueue, "pop", rb_queue_pop, -1);
-  rb_define_method(rb_cQueue, "push", rb_queue_push, 1);
-  rb_alias(rb_cQueue, rb_intern("<<"), rb_intern("push"));
-  rb_alias(rb_cQueue, rb_intern("deq"), rb_intern("pop"));
-  rb_alias(rb_cQueue, rb_intern("shift"), rb_intern("pop"));
-  rb_alias(rb_cQueue, rb_intern("size"), rb_intern("length"));
-
-  rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("SizedQueue")));
-  rb_cSizedQueue = rb_define_class("SizedQueue", rb_cQueue);
-  rb_define_method(rb_cSizedQueue, "initialize", rb_sized_queue_max_set, 1);
-  rb_define_method(rb_cSizedQueue, "clear", rb_queue_clear, 0);
-  rb_define_method(rb_cSizedQueue, "empty?", rb_queue_empty_p, 0);
-  rb_define_method(rb_cSizedQueue, "length", rb_queue_length, 0);
-  rb_define_method(rb_cSizedQueue, "num_waiting", rb_queue_num_waiting, 0);
-  rb_define_method(rb_cSizedQueue, "pop", rb_queue_pop, -1);
-  rb_define_method(rb_cSizedQueue, "push", rb_queue_push, 1);
-  rb_define_method(rb_cSizedQueue, "max", rb_sized_queue_max, 0);
-  rb_define_method(rb_cSizedQueue, "max=", rb_sized_queue_max_set, 1);
-  rb_alias(rb_cSizedQueue, rb_intern("<<"), rb_intern("push"));
-  rb_alias(rb_cSizedQueue, rb_intern("deq"), rb_intern("pop"));
-  rb_alias(rb_cSizedQueue, rb_intern("shift"), rb_intern("pop"));
-
-  return Qnil;
+setup_classes(VALUE unused)
+{
+    rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("Mutex")));
+    rb_cMutex = rb_define_class("Mutex", rb_cObject);
+    rb_define_alloc_func(rb_cMutex, rb_mutex_alloc);
+    rb_define_method(rb_cMutex, "marshal_load", dummy_load, 1);
+    rb_define_method(rb_cMutex, "marshal_dump", dummy_dump, 0);
+    rb_define_method(rb_cMutex, "locked?", rb_mutex_locked_p, 0);
+    rb_define_method(rb_cMutex, "try_lock", rb_mutex_try_lock, 0);
+    rb_define_method(rb_cMutex, "lock", rb_mutex_lock, 0);
+    rb_define_method(rb_cMutex, "unlock", rb_mutex_unlock, 0);
+    rb_define_method(rb_cMutex, "exclusive_unlock", rb_mutex_exclusive_unlock, 0);
+    rb_define_method(rb_cMutex, "synchronize", rb_mutex_synchronize, 0);
+
+    rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("ConditionVariable")));
+    rb_cConditionVariable = rb_define_class("ConditionVariable", rb_cObject);
+    rb_define_alloc_func(rb_cConditionVariable, rb_condvar_alloc);
+    rb_define_method(rb_cConditionVariable, "marshal_load", dummy_load, 1);
+    rb_define_method(rb_cConditionVariable, "marshal_dump", dummy_dump, 0);
+    rb_define_method(rb_cConditionVariable, "wait", rb_condvar_wait, 1);
+    rb_define_method(rb_cConditionVariable, "broadcast", rb_condvar_broadcast, 0);
+    rb_define_method(rb_cConditionVariable, "signal", rb_condvar_signal, 0);
+
+    rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("Queue")));
+    rb_cQueue = rb_define_class("Queue", rb_cObject);
+    rb_define_alloc_func(rb_cQueue, rb_queue_alloc);
+    rb_define_method(rb_cQueue, "marshal_load", rb_queue_marshal_load, 1);
+    rb_define_method(rb_cQueue, "marshal_dump", rb_queue_marshal_dump, 0);
+    rb_define_method(rb_cQueue, "clear", rb_queue_clear, 0);
+    rb_define_method(rb_cQueue, "empty?", rb_queue_empty_p, 0);
+    rb_define_method(rb_cQueue, "length", rb_queue_length, 0);
+    rb_define_method(rb_cQueue, "num_waiting", rb_queue_num_waiting, 0);
+    rb_define_method(rb_cQueue, "pop", rb_queue_pop, -1);
+    rb_define_method(rb_cQueue, "push", rb_queue_push, 1);
+    rb_alias(rb_cQueue, rb_intern("enq"), rb_intern("push"));
+    rb_alias(rb_cQueue, rb_intern("<<"), rb_intern("push"));
+    rb_alias(rb_cQueue, rb_intern("deq"), rb_intern("pop"));
+    rb_alias(rb_cQueue, rb_intern("shift"), rb_intern("pop"));
+    rb_alias(rb_cQueue, rb_intern("size"), rb_intern("length"));
+
+    rb_mod_remove_const(rb_cObject, ID2SYM(rb_intern("SizedQueue")));
+    rb_cSizedQueue = rb_define_class("SizedQueue", rb_cQueue);
+    rb_define_method(rb_cSizedQueue, "initialize", rb_sized_queue_max_set, 1);
+    rb_define_method(rb_cSizedQueue, "clear", rb_queue_clear, 0);
+    rb_define_method(rb_cSizedQueue, "empty?", rb_queue_empty_p, 0);
+    rb_define_method(rb_cSizedQueue, "length", rb_queue_length, 0);
+    rb_define_method(rb_cSizedQueue, "num_waiting", rb_queue_num_waiting, 0);
+    rb_define_method(rb_cSizedQueue, "pop", rb_queue_pop, -1);
+    rb_define_method(rb_cSizedQueue, "push", rb_queue_push, 1);
+    rb_define_method(rb_cSizedQueue, "max", rb_sized_queue_max, 0);
+    rb_define_method(rb_cSizedQueue, "max=", rb_sized_queue_max_set, 1);
+    rb_alias(rb_cSizedQueue, rb_intern("<<"), rb_intern("push"));
+    rb_alias(rb_cSizedQueue, rb_intern("deq"), rb_intern("pop"));
+    rb_alias(rb_cSizedQueue, rb_intern("shift"), rb_intern("pop"));
+
+    return Qnil;
 }
 
 void
 Init_fastthread()
 {
-  VALUE global_variables;
-  VALUE fastthread_avoid_mem_pools;
-  int saved_critical;
-  int i;
-
-  avoid_mem_pools = Qnil;
-  fastthread_avoid_mem_pools = rb_str_new2("$fastthread_avoid_mem_pools");
-  global_variables = rb_f_global_variables();
-  for ( i = 0 ; i < RARRAY(global_variables)->len ; i++ ) {
-    if (RTEST(rb_equal(RARRAY(global_variables)->ptr[i], fastthread_avoid_mem_pools))) {
-      avoid_mem_pools = rb_gv_get("$fastthread_avoid_mem_pools");
-      break;
-    }
-  }
-  
-  rb_global_variable(&avoid_mem_pools);
-  rb_define_variable("$fastthread_avoid_mem_pools", &avoid_mem_pools);
+    int saved_critical;
 
-  rb_require("thread");
+    rb_require("thread");
 
-  private_eThreadError = rb_const_get(rb_cObject, rb_intern("ThreadError"));
+    private_eThreadError = rb_const_get(rb_cObject, rb_intern("ThreadError"));
 
-  /* ensure that classes get replaced atomically */
-  saved_critical = rb_thread_critical;
-  rb_thread_critical = 1;
-  rb_ensure(setup_classes, Qnil, set_critical, (VALUE)saved_critical);
+    /* ensure that classes get replaced atomically */
+    saved_critical = rb_thread_critical;
+    rb_thread_critical = 1;
+    rb_ensure(setup_classes, Qnil, set_critical, (VALUE)saved_critical);
 }