1 files changed, 20 insertions, 17 deletions

diff --git a/plugins/pluginWinMF/internals/mf_sample_queue.h b/plugins/pluginWinMF/internals/mf_sample_queue.h
index b42ecde..b110a06 100755
--- a/plugins/pluginWinMF/internals/mf_sample_queue.h
+++ b/plugins/pluginWinMF/internals/mf_sample_queue.h
@@ -1,18 +1,18 @@
 /* Copyright (C) 2013 Mamadou DIOP
 * Copyright (C) 2013 Doubango Telecom <http://www.doubango.org>
-*	
+*
 * This file is part of Open Source Doubango Framework.
 *
 * DOUBANGO 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 3 of the License, or
 * (at your option) any later version.
-*	
+*
 * DOUBANGO 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 DOUBANGO.
 */
@@ -32,49 +32,52 @@ class MFSampleQueue : public IUnknown
 protected:
 
     // Nodes in the linked list
-    struct Node
-    {
+    struct Node {
         Node *prev;
         Node *next;
         IMFSample*  item;
 
-        Node() : prev(NULL), next(NULL)
-        {
+        Node() : prev(NULL), next(NULL) {
         }
 
-        Node(IMFSample* item) : prev(NULL), next(NULL)
-        {
+        Node(IMFSample* item) : prev(NULL), next(NULL) {
             this->item = item;
         }
 
-        IMFSample* Item() const { return item; }
+        IMFSample* Item() const {
+            return item;
+        }
     };
 
 
 protected:
     Node						m_anchor;
-	long						m_nCount;
-	CRITICAL_SECTION            m_critSec;
+    long						m_nCount;
+    CRITICAL_SECTION            m_critSec;
 
 private:
-	long						m_nRefCount;
+    long						m_nRefCount;
 
 public:
 
     MFSampleQueue();
     virtual ~MFSampleQueue();
 
-	// IUnknown
+    // IUnknown
     STDMETHODIMP QueryInterface(REFIID iid, void** ppv);
     STDMETHODIMP_(ULONG) AddRef();
     STDMETHODIMP_(ULONG) Release();
 
     HRESULT Queue(IMFSample* item);
-    HRESULT Dequeue(IMFSample* *ppItem);
+    HRESULT Dequeue(IMFSample**ppItem);
     HRESULT Clear();
 
-	inline BOOL IsEmpty() const { return m_anchor.next == &m_anchor; }
-	inline long Count() { return m_nCount; }
+    inline BOOL IsEmpty() const {
+        return m_anchor.next == &m_anchor;
+    }
+    inline long Count() {
+        return m_nCount;
+    }
 };