1 files changed, 92 insertions, 92 deletions
diff --git a/src/common/src/fifo_queue.h b/src/common/src/fifo_queue.h
index 4f5ca5706..57efcd839 100644
--- a/src/common/src/fifo_queue.h
+++ b/src/common/src/fifo_queue.h
@@ -14,100 +14,100 @@ template <typename T>
 class FifoQueue
 {
 public:
-	FifoQueue() : m_size(0)
-	{
-		 m_write_ptr = m_read_ptr = new ElementPtr();
-	}
-
-	~FifoQueue()
-	{
-		// this will empty out the whole queue
-		delete m_read_ptr;
-	}
-
-	u32 Size() const
-	{
-		return m_size;
-	}
-
-	bool Empty() const
-	{
-		//return (m_read_ptr == m_write_ptr);
-		return (0 == m_size);
-	}
-
-	T& Front() const
-	{
-		return *m_read_ptr->current;
-	}
-
-	template <typename Arg>
-	void Push(Arg&& t)
-	{
-		// create the element, add it to the queue
-		m_write_ptr->current = new T(std::forward<Arg>(t));
-		// set the next pointer to a new element ptr
-		// then advance the write pointer 
-		m_write_ptr = m_write_ptr->next = new ElementPtr();
-		Common::AtomicIncrement(m_size);
-	}
-
-	void Pop()
-	{
-		Common::AtomicDecrement(m_size);
-		ElementPtr *const tmpptr = m_read_ptr;
-		// advance the read pointer
-		m_read_ptr = m_read_ptr->next;
-		// set the next element to NULL to stop the recursive deletion
-		tmpptr->next = NULL;
-		delete tmpptr;	// this also deletes the element
-	}
-
-	bool Pop(T& t)
-	{
-		if (Empty())
-			return false;
-
-		t = std::move(Front());
-		Pop();
-
-		return true;
-	}
-
-	// not thread-safe
-	void Clear()
-	{
-		m_size = 0;
-		delete m_read_ptr;
-		m_write_ptr = m_read_ptr = new ElementPtr();
-	}
+    FifoQueue() : m_size(0)
+    {
+         m_write_ptr = m_read_ptr = new ElementPtr();
+    }
+
+    ~FifoQueue()
+    {
+        // this will empty out the whole queue
+        delete m_read_ptr;
+    }
+
+    u32 Size() const
+    {
+        return m_size;
+    }
+
+    bool Empty() const
+    {
+        //return (m_read_ptr == m_write_ptr);
+        return (0 == m_size);
+    }
+
+    T& Front() const
+    {
+        return *m_read_ptr->current;
+    }
+
+    template <typename Arg>
+    void Push(Arg&& t)
+    {
+        // create the element, add it to the queue
+        m_write_ptr->current = new T(std::forward<Arg>(t));
+        // set the next pointer to a new element ptr
+        // then advance the write pointer 
+        m_write_ptr = m_write_ptr->next = new ElementPtr();
+        Common::AtomicIncrement(m_size);
+    }
+
+    void Pop()
+    {
+        Common::AtomicDecrement(m_size);
+        ElementPtr *const tmpptr = m_read_ptr;
+        // advance the read pointer
+        m_read_ptr = m_read_ptr->next;
+        // set the next element to NULL to stop the recursive deletion
+        tmpptr->next = NULL;
+        delete tmpptr;    // this also deletes the element
+    }
+
+    bool Pop(T& t)
+    {
+        if (Empty())
+            return false;
+
+        t = std::move(Front());
+        Pop();
+
+        return true;
+    }
+
+    // not thread-safe
+    void Clear()
+    {
+        m_size = 0;
+        delete m_read_ptr;
+        m_write_ptr = m_read_ptr = new ElementPtr();
+    }
 
 private:
-	// stores a pointer to element
-	// and a pointer to the next ElementPtr
-	class ElementPtr
-	{
-	public:
-		ElementPtr() : current(NULL), next(NULL) {}
-
-		~ElementPtr()
-		{
-			if (current)
-			{
-				delete current;
-				// recusion ftw
-				if (next)
-					delete next;
-			}
-		}
-
-		T *volatile current;
-		ElementPtr *volatile next;
-	};
-
-	ElementPtr *volatile m_write_ptr;
-	ElementPtr *volatile m_read_ptr;
-	volatile u32 m_size;
+    // stores a pointer to element
+    // and a pointer to the next ElementPtr
+    class ElementPtr
+    {
+    public:
+        ElementPtr() : current(NULL), next(NULL) {}
+
+        ~ElementPtr()
+        {
+            if (current)
+            {
+                delete current;
+                // recusion ftw
+                if (next)
+                    delete next;
+            }
+        }
+
+        T *volatile current;
+        ElementPtr *volatile next;
+    };
+
+    ElementPtr *volatile m_write_ptr;
+    ElementPtr *volatile m_read_ptr;
+    volatile u32 m_size;
 };
 
 }