| /dports/x11/xmotd/xmotd-1.17.3b/libhtmlw/ |
| H A D | list.c | 45 List theList; in ListHead()
47 if (!theList)
49 theList->current = theList->head;
62 List theList; in ListTail()
64 if (!theList)
66 theList->current = theList->tail;
78 List theList; in ListCurrent()
95 List theList; in ListNext()
100 theList->current = theList->current->next;
118 theList->current = theList->current->prev;
[all …]
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 105 if (!theList) in load()
138 theList[5] = fs; in load()
188 if (!theList[i]) in load()
218 if(theList != 0){ in unload()
220 if(theList[i] != 0){ in unload()
222 theList[i]->~SimulatedBlock(); in unload()
223 free(theList[i]); in unload()
225 delete(theList[i]); in unload()
227 theList[i] = 0; in unload()
230 delete [] theList; in unload()
[all …]
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 75 if (!theList) in load()
108 theList[5] = fs; in load()
158 if (!theList[i]) in load()
188 if(theList != 0){ in unload()
190 if(theList[i] != 0){ in unload()
192 theList[i]->~SimulatedBlock(); in unload()
193 free(theList[i]); in unload()
195 delete(theList[i]); in unload()
197 theList[i] = 0; in unload()
200 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 105 if (!theList) in load()
138 theList[5] = fs; in load()
188 if (!theList[i]) in load()
218 if(theList != 0){ in unload()
220 if(theList[i] != 0){ in unload()
222 theList[i]->~SimulatedBlock(); in unload()
223 free(theList[i]); in unload()
225 delete(theList[i]); in unload()
227 theList[i] = 0; in unload()
230 delete [] theList; in unload()
[all …]
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 105 if (!theList) in load()
138 theList[5] = fs; in load()
188 if (!theList[i]) in load()
218 if(theList != 0){ in unload()
220 if(theList[i] != 0){ in unload()
222 theList[i]->~SimulatedBlock(); in unload()
223 free(theList[i]); in unload()
225 delete(theList[i]); in unload()
227 theList[i] = 0; in unload()
230 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 105 if (!theList) in load()
138 theList[5] = fs; in load()
188 if (!theList[i]) in load()
218 if(theList != 0){ in unload()
220 if(theList[i] != 0){ in unload()
222 theList[i]->~SimulatedBlock(); in unload()
223 free(theList[i]); in unload()
225 delete(theList[i]); in unload()
227 theList[i] = 0; in unload()
230 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 105 if (!theList) in load()
138 theList[5] = fs; in load()
188 if (!theList[i]) in load()
218 if(theList != 0){ in unload()
220 if(theList[i] != 0){ in unload()
222 theList[i]->~SimulatedBlock(); in unload()
223 free(theList[i]); in unload()
225 delete(theList[i]); in unload()
227 theList[i] = 0; in unload()
230 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 98 if (!theList) in load()
131 theList[5] = fs; in load()
176 if (!theList[i]) in load()
186 if(theList != 0){ in unload()
188 if(theList[i] != 0){ in unload()
190 theList[i]->~SimulatedBlock(); in unload()
191 free(theList[i]); in unload()
193 delete(theList[i]); in unload()
195 theList[i] = 0; in unload()
198 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 98 if (!theList) in load()
131 theList[5] = fs; in load()
176 if (!theList[i]) in load()
186 if(theList != 0){ in unload()
188 if(theList[i] != 0){ in unload()
190 theList[i]->~SimulatedBlock(); in unload()
191 free(theList[i]); in unload()
193 delete(theList[i]); in unload()
195 theList[i] = 0; in unload()
198 delete [] theList; in unload()
[all …]
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 98 if (!theList) in load()
131 theList[5] = fs; in load()
176 if (!theList[i]) in load()
186 if(theList != 0){ in unload()
188 if(theList[i] != 0){ in unload()
190 theList[i]->~SimulatedBlock(); in unload()
191 free(theList[i]); in unload()
193 delete(theList[i]); in unload()
195 theList[i] = 0; in unload()
198 delete [] theList; in unload()
[all …]
|
| /dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 98 if (!theList) in load()
131 theList[5] = fs; in load()
176 if (!theList[i]) in load()
186 if(theList != 0){ in unload()
188 if(theList[i] != 0){ in unload()
190 theList[i]->~SimulatedBlock(); in unload()
191 free(theList[i]); in unload()
193 delete(theList[i]); in unload()
195 theList[i] = 0; in unload()
198 delete [] theList; in unload()
[all …]
|
| /dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 98 if (!theList) in load()
131 theList[5] = fs; in load()
176 if (!theList[i]) in load()
186 if(theList != 0){ in unload()
188 if(theList[i] != 0){ in unload()
190 theList[i]->~SimulatedBlock(); in unload()
191 free(theList[i]); in unload()
193 delete(theList[i]); in unload()
195 theList[i] = 0; in unload()
198 delete [] theList; in unload()
[all …]
|
| /dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/kernel/ |
| H A D | SimBlockList.cpp | 101 theList[5] = fs; in load()
105 theList[9] = NEW_BLOCK(Dbtc)(ctx); in load()
108 theList[12] = NEW_BLOCK(Qmgr)(ctx); in load()
120 if(theList != 0){ in unload()
122 if(theList[i] != 0){ in unload()
124 theList[i]->~SimulatedBlock(); in unload()
125 free(theList[i]); in unload()
127 delete(theList[i]); in unload()
129 theList[i] = 0; in unload()
132 delete [] theList; in unload()
[all …]
|
| /dports/lang/clips/clips_core_source_630/core/ |
| H A D | modulbin.c | 145 struct portItem *theList; in BsaveFind() local
193 theList != NULL; in BsaveFind()
194 theList = theList->next) in BsaveFind()
213 theList != NULL; in BsaveFind()
214 theList = theList->next) in BsaveFind()
291 theList = theList->next) in BsaveBinaryItem()
302 theList = theList->next) in BsaveBinaryItem()
320 theList = theList->next) in BsaveBinaryItem()
340 theList = theList->next) in BsaveBinaryItem()
561 theList = theList->next) in ClearBload()
[all …]
|
| H A D | userdata.c | 62 struct userData **theList) in FetchUserData() argument
66 for (theData = *theList; in FetchUserData()
77 *theList = theData; in FetchUserData()
90 struct userData *theList) in TestUserData() argument
94 for (theData = theList; in TestUserData()
110 struct userData *theList) in ClearUserDataList() argument
114 while (theList != NULL) in ClearUserDataList()
118 theList = nextData; in ClearUserDataList()
133 for (theData = theList; in DeleteUserData()
145 return(theList); in DeleteUserData()
[all …]
|
| H A D | sortfun.c | 302 DATA_OBJECT *theList, in MergeSort() argument
339 DATA_OBJECT *theList, in DoMergeSort() argument
357 if ((*swapFunction)(theEnv,&theList[s1],&theList[e1])) in DoMergeSort()
359 TransferDataObjectValues(&temp,&theList[s1]); in DoMergeSort()
360 TransferDataObjectValues(&theList[s1],&theList[e1]); in DoMergeSort()
361 TransferDataObjectValues(&theList[e1],&temp); in DoMergeSort()
375 if ((*swapFunction)(theEnv,&theList[s2],&theList[e2])) in DoMergeSort()
377 TransferDataObjectValues(&temp,&theList[s2]); in DoMergeSort()
378 TransferDataObjectValues(&theList[s2],&theList[e2]); in DoMergeSort()
379 TransferDataObjectValues(&theList[e2],&temp); in DoMergeSort()
[all …]
|
| /dports/math/planarity/edge-addition-planarity-suite-Version_3.0.1.1/c/ |
| H A D | listcoll.h | 61 #define LCGetNext(listColl, theList, theNode) listColl->List[theNode].next==theList ? NIL : listCol… argument
70 #define LCGetPrev(listColl, theList, theNode) \ argument
72 ? listColl->List[theList].prev \
80 (theList==NIL \
86 listColl->List[theList].prev))
92 #define LCAppend(listColl, theList, theNode) \ argument
93 (theList==NIL \
99 theList))
109 listColl->List[theList].next == theList \
110 ? (listColl->List[theList].prev = listColl->List[theList].next = NIL) \
[all …]
|
| H A D | listcoll.c | 175 return next==theList ? NIL : next; in LCGetNext()
186 if (theNode == theList) return NIL; in LCGetPrev()
212 if (theList == NIL) in LCAppend()
215 theList = theNode; in LCAppend()
233 return theList; in LCAppend()
245 if (listColl->List[theList].next == theList) in LCDelete()
247 listColl->List[theList].prev = listColl->List[theList].next = NIL; in LCDelete()
248 theList = NIL; in LCDelete()
265 if (theList == theNode) in LCDelete()
266 theList = succ; in LCDelete()
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/edge-addition-planarity-suite-Version_3.0.0.5/c/ |
| H A D | listcoll.h | 61 #define LCGetNext(listColl, theList, theNode) listColl->List[theNode].next==theList ? NIL : listCol… argument
70 #define LCGetPrev(listColl, theList, theNode) \ argument
72 ? listColl->List[theList].prev \
79 #define LCPrepend(listColl, theList, theNode) listColl->List[LCAppend(listColl, theList, theNode)].… argument
85 #define LCAppend(listColl, theList, theNode) \ argument
86 (theList==NIL \
92 theList))
101 #define LCDelete(listColl, theList, theNode) \ argument
102 listColl->List[theList].next == theList \
103 ? (listColl->List[theList].prev = listColl->List[theList].next = NIL) \
[all …]
|
| H A D | listcoll.c | 175 return next==theList ? NIL : next; in LCGetNext()
186 if (theNode == theList) return NIL; in LCGetPrev()
212 if (theList == NIL) in LCAppend()
215 theList = theNode; in LCAppend()
233 return theList; in LCAppend()
245 if (listColl->List[theList].next == theList) in LCDelete()
247 listColl->List[theList].prev = listColl->List[theList].next = NIL; in LCDelete()
248 theList = NIL; in LCDelete()
265 if (theList == theNode) in LCDelete()
266 theList = succ; in LCDelete()
[all …]
|
| /dports/astro/merkaartor/merkaartor-0.19.0/src/common/ |
| H A D | FeatureManipulations.h | 15 void joinRoads(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
16 void splitRoads(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
18 void breakRoads(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
21 void addStreetNumbers(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
22 void reversePoints(Document* theDocument, CommandList* theList, Way* R);
24 void alignNodes(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
26 void spreadNodes(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
27 void mergeNodes(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
28 void detachNode(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
38 void joinAreas(Document* theDocument, CommandList* theList, PropertiesDock* theDock);
[all …]
|
| /dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmnet/libsrc/ |
| H A D | lst.cc | 26 : theList() in LST_HEAD()
29 theIterator = theList.end(); in LST_HEAD()
38 theList.push_back(node); in push_back()
43 if (theList.size() == 0) return NULL; in dequeue()
44 void *result = theList.front(); in dequeue()
45 theList.pop_front(); in dequeue()
51 return theList.size(); in size()
56 if (theList.size() > 0) return theList.front(); in front()
62 if (theList.size() == 0) return NULL; in next()
71 if (theList.size() == 0) return NULL; in current()
[all …]
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/src/kernel/blocks/ndbfs/ |
| H A D | Pool.hpp | 205 theList(0) in Pool()
213 delete theList[i]; in ~Pool()
215 delete []theList; in ~Pool()
232 T** tList = theList; in allocate()
234 theList = new T*[aSize+theCurrentSize]; in allocate()
237 theList[i] = tList[i]; in allocate()
241 theList[theTop] = (T*)new T; in allocate()
254 T** theList; member in Pool
266 tmp = theList[theTop]; in get()
275 theList[theTop]= aT; in put()
[all …]
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/ndbfs/ |
| H A D | Pool.hpp | 203 theList(0) in Pool()
211 delete theList[i]; in ~Pool()
213 delete []theList; in ~Pool()
224 T** tList = theList; in allocate()
226 theList = new T*[aSize+theCurrentSize]; in allocate()
229 theList[i] = tList[i]; in allocate()
233 theList[theTop] = (T*)new T; in allocate()
246 T** theList; member in Pool
258 tmp = theList[theTop]; in get()
267 theList[theTop]= aT; in put()
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/ndbfs/ |
| H A D | Pool.hpp | 203 theList(0) in Pool()
211 delete theList[i]; in ~Pool()
213 delete []theList; in ~Pool()
224 T** tList = theList; in allocate()
226 theList = new T*[aSize+theCurrentSize]; in allocate()
229 theList[i] = tList[i]; in allocate()
233 theList[theTop] = (T*)new T; in allocate()
246 T** theList; member in Pool
258 tmp = theList[theTop]; in get()
267 theList[theTop]= aT; in put()
|