Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(81)

Side by Side Diff: core/src/fxcrt/fx_basic_list.cpp

Issue 1265503005: clang-format all pdfium code. (Closed) Base URL: https://pdfium.googlesource.com/pdfium.git@master
Patch Set: sigh Created 5 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2014 PDFium Authors. All rights reserved. 1 // Copyright 2014 PDFium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
6 6
7 #include "../../include/fxcrt/fx_basic.h" 7 #include "../../include/fxcrt/fx_basic.h"
8 #include "plex.h" 8 #include "plex.h"
9 CFX_PtrList::CFX_PtrList(int nBlockSize) 9 CFX_PtrList::CFX_PtrList(int nBlockSize)
10 : m_pNodeHead(NULL) 10 : m_pNodeHead(NULL),
11 , m_pNodeTail(NULL) 11 m_pNodeTail(NULL),
12 , m_nCount(0) 12 m_nCount(0),
13 , m_pNodeFree(NULL) 13 m_pNodeFree(NULL),
14 , m_pBlocks(NULL) 14 m_pBlocks(NULL),
15 , m_nBlockSize(nBlockSize) 15 m_nBlockSize(nBlockSize) {}
16 { 16 FX_POSITION CFX_PtrList::AddTail(void* newElement) {
17 CNode* pNewNode = NewNode(m_pNodeTail, NULL);
18 pNewNode->data = newElement;
19 if (m_pNodeTail != NULL) {
20 m_pNodeTail->pNext = pNewNode;
21 } else {
22 m_pNodeHead = pNewNode;
23 }
24 m_pNodeTail = pNewNode;
25 return (FX_POSITION)pNewNode;
17 } 26 }
18 FX_POSITION CFX_PtrList::AddTail(void* newElement) 27 FX_POSITION CFX_PtrList::AddHead(void* newElement) {
19 { 28 CNode* pNewNode = NewNode(NULL, m_pNodeHead);
20 CNode* pNewNode = NewNode(m_pNodeTail, NULL); 29 pNewNode->data = newElement;
21 pNewNode->data = newElement; 30 if (m_pNodeHead != NULL) {
22 if (m_pNodeTail != NULL) { 31 m_pNodeHead->pPrev = pNewNode;
23 m_pNodeTail->pNext = pNewNode; 32 } else {
24 } else { 33 m_pNodeTail = pNewNode;
25 m_pNodeHead = pNewNode; 34 }
35 m_pNodeHead = pNewNode;
36 return (FX_POSITION)pNewNode;
37 }
38 FX_POSITION CFX_PtrList::InsertAfter(FX_POSITION position, void* newElement) {
39 if (position == NULL) {
40 return AddTail(newElement);
41 }
42 CNode* pOldNode = (CNode*)position;
43 CNode* pNewNode = NewNode(pOldNode, pOldNode->pNext);
44 pNewNode->data = newElement;
45 if (pOldNode->pNext != NULL) {
46 pOldNode->pNext->pPrev = pNewNode;
47 } else {
48 m_pNodeTail = pNewNode;
49 }
50 pOldNode->pNext = pNewNode;
51 return (FX_POSITION)pNewNode;
52 }
53 void CFX_PtrList::RemoveAt(FX_POSITION position) {
54 CNode* pOldNode = (CNode*)position;
55 if (pOldNode == m_pNodeHead) {
56 m_pNodeHead = pOldNode->pNext;
57 } else {
58 pOldNode->pPrev->pNext = pOldNode->pNext;
59 }
60 if (pOldNode == m_pNodeTail) {
61 m_pNodeTail = pOldNode->pPrev;
62 } else {
63 pOldNode->pNext->pPrev = pOldNode->pPrev;
64 }
65 FreeNode(pOldNode);
66 }
67 void CFX_PtrList::FreeNode(CFX_PtrList::CNode* pNode) {
68 pNode->pNext = m_pNodeFree;
69 m_pNodeFree = pNode;
70 m_nCount--;
71 if (m_nCount == 0) {
72 RemoveAll();
73 }
74 }
75 void CFX_PtrList::RemoveAll() {
76 m_nCount = 0;
77 m_pNodeHead = m_pNodeTail = m_pNodeFree = NULL;
78 m_pBlocks->FreeDataChain();
79 m_pBlocks = NULL;
80 }
81 CFX_PtrList::CNode* CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev,
82 CFX_PtrList::CNode* pNext) {
83 if (m_pNodeFree == NULL) {
84 CFX_Plex* pNewBlock =
85 CFX_Plex::Create(m_pBlocks, m_nBlockSize, sizeof(CNode));
86 CNode* pNode = (CNode*)pNewBlock->data();
87 pNode += m_nBlockSize - 1;
88 for (int i = m_nBlockSize - 1; i >= 0; i--, pNode--) {
89 pNode->pNext = m_pNodeFree;
90 m_pNodeFree = pNode;
26 } 91 }
27 m_pNodeTail = pNewNode; 92 }
28 return (FX_POSITION) pNewNode; 93 ASSERT(m_pNodeFree != NULL);
94 CFX_PtrList::CNode* pNode = m_pNodeFree;
95 m_pNodeFree = m_pNodeFree->pNext;
96 pNode->pPrev = pPrev;
97 pNode->pNext = pNext;
98 m_nCount++;
99 ASSERT(m_nCount > 0);
100 pNode->data = 0;
101 return pNode;
29 } 102 }
30 FX_POSITION CFX_PtrList::AddHead(void* newElement) 103 CFX_PtrList::~CFX_PtrList() {
31 { 104 RemoveAll();
32 CNode* pNewNode = NewNode(NULL, m_pNodeHead); 105 ASSERT(m_nCount == 0);
33 pNewNode->data = newElement; 106 }
34 if (m_pNodeHead != NULL) { 107 FX_POSITION CFX_PtrList::FindIndex(int nIndex) const {
35 m_pNodeHead->pPrev = pNewNode; 108 if (nIndex >= m_nCount || nIndex < 0) {
36 } else { 109 return NULL;
37 m_pNodeTail = pNewNode; 110 }
111 CNode* pNode = m_pNodeHead;
112 while (nIndex--) {
113 pNode = pNode->pNext;
114 }
115 return (FX_POSITION)pNode;
116 }
117 FX_POSITION CFX_PtrList::Find(void* searchValue, FX_POSITION startAfter) const {
118 CNode* pNode = (CNode*)startAfter;
119 if (pNode == NULL) {
120 pNode = m_pNodeHead;
121 } else {
122 pNode = pNode->pNext;
123 }
124 for (; pNode != NULL; pNode = pNode->pNext)
125 if (pNode->data == searchValue) {
126 return (FX_POSITION)pNode;
38 } 127 }
39 m_pNodeHead = pNewNode; 128 return NULL;
40 return (FX_POSITION) pNewNode;
41 } 129 }
42 FX_POSITION CFX_PtrList::InsertAfter(FX_POSITION position, void* newElement)
43 {
44 if (position == NULL) {
45 return AddTail(newElement);
46 }
47 CNode* pOldNode = (CNode*) position;
48 CNode* pNewNode = NewNode(pOldNode, pOldNode->pNext);
49 pNewNode->data = newElement;
50 if (pOldNode->pNext != NULL) {
51 pOldNode->pNext->pPrev = pNewNode;
52 } else {
53 m_pNodeTail = pNewNode;
54 }
55 pOldNode->pNext = pNewNode;
56 return (FX_POSITION) pNewNode;
57 }
58 void CFX_PtrList::RemoveAt(FX_POSITION position)
59 {
60 CNode* pOldNode = (CNode*) position;
61 if (pOldNode == m_pNodeHead) {
62 m_pNodeHead = pOldNode->pNext;
63 } else {
64 pOldNode->pPrev->pNext = pOldNode->pNext;
65 }
66 if (pOldNode == m_pNodeTail) {
67 m_pNodeTail = pOldNode->pPrev;
68 } else {
69 pOldNode->pNext->pPrev = pOldNode->pPrev;
70 }
71 FreeNode(pOldNode);
72 }
73 void CFX_PtrList::FreeNode(CFX_PtrList::CNode* pNode)
74 {
75 pNode->pNext = m_pNodeFree;
76 m_pNodeFree = pNode;
77 m_nCount--;
78 if (m_nCount == 0) {
79 RemoveAll();
80 }
81 }
82 void CFX_PtrList::RemoveAll()
83 {
84 m_nCount = 0;
85 m_pNodeHead = m_pNodeTail = m_pNodeFree = NULL;
86 m_pBlocks->FreeDataChain();
87 m_pBlocks = NULL;
88 }
89 CFX_PtrList::CNode*
90 CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev, CFX_PtrList::CNode* pNext)
91 {
92 if (m_pNodeFree == NULL) {
93 CFX_Plex* pNewBlock = CFX_Plex::Create(m_pBlocks, m_nBlockSize, sizeof(C Node));
94 CNode* pNode = (CNode*)pNewBlock->data();
95 pNode += m_nBlockSize - 1;
96 for (int i = m_nBlockSize - 1; i >= 0; i--, pNode--) {
97 pNode->pNext = m_pNodeFree;
98 m_pNodeFree = pNode;
99 }
100 }
101 ASSERT(m_pNodeFree != NULL);
102 CFX_PtrList::CNode* pNode = m_pNodeFree;
103 m_pNodeFree = m_pNodeFree->pNext;
104 pNode->pPrev = pPrev;
105 pNode->pNext = pNext;
106 m_nCount++;
107 ASSERT(m_nCount > 0);
108 pNode->data = 0;
109 return pNode;
110 }
111 CFX_PtrList::~CFX_PtrList()
112 {
113 RemoveAll();
114 ASSERT(m_nCount == 0);
115 }
116 FX_POSITION CFX_PtrList::FindIndex(int nIndex) const
117 {
118 if (nIndex >= m_nCount || nIndex < 0) {
119 return NULL;
120 }
121 CNode* pNode = m_pNodeHead;
122 while (nIndex--) {
123 pNode = pNode->pNext;
124 }
125 return (FX_POSITION) pNode;
126 }
127 FX_POSITION CFX_PtrList::Find(void* searchValue, FX_POSITION startAfter) const
128 {
129 CNode* pNode = (CNode*) startAfter;
130 if (pNode == NULL) {
131 pNode = m_pNodeHead;
132 } else {
133 pNode = pNode->pNext;
134 }
135 for (; pNode != NULL; pNode = pNode->pNext)
136 if (pNode->data == searchValue) {
137 return (FX_POSITION) pNode;
138 }
139 return NULL;
140 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698