1 | /* $Id: CbcThread.cpp 1261 2009-10-30 12:45:20Z forrest $ */ |
---|
2 | // Copyright (C) 2002, International Business Machines |
---|
3 | // Corporation and others. All Rights Reserved. |
---|
4 | // This code is licensed under the terms of the Eclipse Public License (EPL). |
---|
5 | |
---|
6 | #if defined(_MSC_VER) |
---|
7 | // Turn off compiler warning about long names |
---|
8 | # pragma warning(disable:4786) |
---|
9 | #endif |
---|
10 | |
---|
11 | #include "CbcConfig.h" |
---|
12 | |
---|
13 | //#define THREAD_DEBUG |
---|
14 | #include <string> |
---|
15 | #include <cassert> |
---|
16 | #include <cmath> |
---|
17 | #include <cfloat> |
---|
18 | |
---|
19 | #include "CbcEventHandler.hpp" |
---|
20 | |
---|
21 | #include "OsiSolverInterface.hpp" |
---|
22 | #include "OsiRowCutDebugger.hpp" |
---|
23 | #include "CbcThread.hpp" |
---|
24 | #include "CbcTree.hpp" |
---|
25 | #include "CbcHeuristic.hpp" |
---|
26 | #include "CbcCutGenerator.hpp" |
---|
27 | #include "CbcModel.hpp" |
---|
28 | #include "CbcFathom.hpp" |
---|
29 | #include "CbcSimpleIntegerDynamicPseudoCost.hpp" |
---|
30 | #include "ClpDualRowDantzig.hpp" |
---|
31 | #include "OsiAuxInfo.hpp" |
---|
32 | |
---|
33 | #include "CoinTime.hpp" |
---|
34 | #ifdef CBC_THREAD |
---|
35 | /// Thread functions |
---|
36 | static void * doNodesThread(void * voidInfo); |
---|
37 | static void * doCutsThread(void * voidInfo); |
---|
38 | static void * doHeurThread(void * voidInfo); |
---|
39 | // Default Constructor |
---|
40 | CbcSpecificThread::CbcSpecificThread () |
---|
41 | : basePointer_(NULL), |
---|
42 | masterMutex_(NULL), |
---|
43 | locked_(false) |
---|
44 | { |
---|
45 | #ifdef CBC_PTHREAD |
---|
46 | pthread_mutex_init(&mutex2_, NULL); |
---|
47 | pthread_cond_init(&condition2_, NULL); |
---|
48 | threadId_.status = 0; |
---|
49 | #else |
---|
50 | #endif |
---|
51 | } |
---|
52 | // Useful Constructor |
---|
53 | CbcSpecificThread::CbcSpecificThread (CbcSpecificThread * master, pthread_mutex_t * masterMutex) |
---|
54 | : basePointer_(master), |
---|
55 | masterMutex_(masterMutex), |
---|
56 | locked_(false) |
---|
57 | |
---|
58 | { |
---|
59 | #ifdef CBC_PTHREAD |
---|
60 | pthread_mutex_init(&mutex2_, NULL); |
---|
61 | pthread_cond_init(&condition2_, NULL); |
---|
62 | threadId_.status = 0; |
---|
63 | #else |
---|
64 | #endif |
---|
65 | |
---|
66 | } |
---|
67 | // Useful stuff |
---|
68 | void |
---|
69 | CbcSpecificThread::setUsefulStuff (CbcSpecificThread * master, void *& masterMutex) |
---|
70 | |
---|
71 | { |
---|
72 | #ifdef CBC_PTHREAD |
---|
73 | basePointer_ = master; |
---|
74 | if (masterMutex) { |
---|
75 | masterMutex_ = reinterpret_cast<pthread_mutex_t *>(masterMutex); |
---|
76 | } else { |
---|
77 | // create master mutex |
---|
78 | masterMutex_ = new pthread_mutex_t; |
---|
79 | pthread_mutex_init(masterMutex_, NULL); |
---|
80 | masterMutex = reinterpret_cast<void *>(masterMutex_); |
---|
81 | } |
---|
82 | #else |
---|
83 | #endif |
---|
84 | } |
---|
85 | |
---|
86 | CbcSpecificThread::~CbcSpecificThread() |
---|
87 | { |
---|
88 | #ifdef CBC_PTHREAD |
---|
89 | pthread_mutex_destroy (&mutex2_); |
---|
90 | if (basePointer_ == this) { |
---|
91 | pthread_mutex_destroy (masterMutex_); |
---|
92 | delete masterMutex_; |
---|
93 | } |
---|
94 | #else |
---|
95 | #endif |
---|
96 | } |
---|
97 | /* |
---|
98 | Locks a thread if parallel so that stuff like cut pool |
---|
99 | can be updated and/or used. |
---|
100 | */ |
---|
101 | void |
---|
102 | CbcSpecificThread::lockThread() |
---|
103 | { |
---|
104 | #ifdef CBC_PTHREAD |
---|
105 | // Use master mutex |
---|
106 | assert (basePointer_->masterMutex_ == masterMutex_); |
---|
107 | pthread_mutex_lock (masterMutex_); |
---|
108 | #else |
---|
109 | #endif |
---|
110 | } |
---|
111 | /* |
---|
112 | Unlocks a thread if parallel to say cut pool stuff not needed |
---|
113 | */ |
---|
114 | void |
---|
115 | CbcSpecificThread::unlockThread() |
---|
116 | { |
---|
117 | #ifdef CBC_PTHREAD |
---|
118 | // Use master mutex |
---|
119 | pthread_mutex_unlock (masterMutex_); |
---|
120 | #else |
---|
121 | #endif |
---|
122 | } |
---|
123 | // Locks a thread for testing whether to start etc |
---|
124 | void |
---|
125 | CbcSpecificThread::lockThread2(bool doAnyway) |
---|
126 | { |
---|
127 | if (!locked_ || doAnyway) { |
---|
128 | #ifdef CBC_PTHREAD |
---|
129 | pthread_mutex_lock (&mutex2_); |
---|
130 | #else |
---|
131 | #endif |
---|
132 | locked_ = true; |
---|
133 | } |
---|
134 | } |
---|
135 | // Unlocks a thread for testing whether to start etc |
---|
136 | void |
---|
137 | CbcSpecificThread::unlockThread2(bool doAnyway) |
---|
138 | { |
---|
139 | if (locked_ || doAnyway) { |
---|
140 | #ifdef CBC_PTHREAD |
---|
141 | pthread_mutex_unlock (&mutex2_); |
---|
142 | #else |
---|
143 | #endif |
---|
144 | locked_ = false; |
---|
145 | } |
---|
146 | } |
---|
147 | #ifdef HAVE_CLOCK_GETTIME |
---|
148 | inline int my_gettime(struct timespec* tp) |
---|
149 | { |
---|
150 | return clock_gettime(CLOCK_REALTIME, tp); |
---|
151 | } |
---|
152 | #else |
---|
153 | #ifndef _MSC_VER |
---|
154 | inline int my_gettime(struct timespec* tp) |
---|
155 | { |
---|
156 | struct timeval tv; |
---|
157 | int ret = gettimeofday(&tv, NULL); |
---|
158 | tp->tv_sec = tv.tv_sec; |
---|
159 | tp->tv_nsec = tv.tv_usec * 1000; |
---|
160 | return ret; |
---|
161 | } |
---|
162 | #else |
---|
163 | inline int my_gettime(struct timespec* tp) |
---|
164 | { |
---|
165 | double t = CoinGetTimeOfDay(); |
---|
166 | tp->tv_sec = (int)floor(t); |
---|
167 | tp->tv_nsec = (int)((tp->tv_sec - floor(t)) / 1000000.0); |
---|
168 | return 0; |
---|
169 | } |
---|
170 | #endif |
---|
171 | #endif |
---|
172 | // Get time |
---|
173 | static double getTime() |
---|
174 | { |
---|
175 | struct timespec absTime2; |
---|
176 | my_gettime(&absTime2); |
---|
177 | double time2 = absTime2.tv_sec + 1.0e-9 * absTime2.tv_nsec; |
---|
178 | return time2; |
---|
179 | } |
---|
180 | // Timed wait in nanoseconds - if negative then seconds |
---|
181 | void |
---|
182 | CbcSpecificThread::timedWait(int time) |
---|
183 | { |
---|
184 | |
---|
185 | #ifdef CBC_PTHREAD |
---|
186 | struct timespec absTime; |
---|
187 | my_gettime(&absTime); |
---|
188 | if (time > 0) { |
---|
189 | absTime.tv_nsec += time; |
---|
190 | if (absTime.tv_nsec >= 1000000000) { |
---|
191 | absTime.tv_nsec -= 1000000000; |
---|
192 | absTime.tv_sec++; |
---|
193 | } |
---|
194 | } else { |
---|
195 | absTime.tv_sec -= time; |
---|
196 | } |
---|
197 | pthread_cond_timedwait(&condition2_, &mutex2_, &absTime); |
---|
198 | #else |
---|
199 | #endif |
---|
200 | } |
---|
201 | // Signal |
---|
202 | void |
---|
203 | CbcSpecificThread::signal() |
---|
204 | { |
---|
205 | #ifdef CBC_PTHREAD |
---|
206 | pthread_cond_signal(&condition2_); |
---|
207 | #else |
---|
208 | #endif |
---|
209 | } |
---|
210 | // Actually starts a thread |
---|
211 | void |
---|
212 | CbcSpecificThread::startThread(void * (*routine ) (void *), CbcThread * thread) |
---|
213 | { |
---|
214 | #ifdef CBC_PTHREAD |
---|
215 | pthread_create(&(threadId_.thr), NULL, routine, thread); |
---|
216 | threadId_.status = 1; |
---|
217 | #else |
---|
218 | #endif |
---|
219 | } |
---|
220 | // Exits thread (from master) |
---|
221 | int |
---|
222 | CbcSpecificThread::exit() |
---|
223 | { |
---|
224 | #ifdef CBC_PTHREAD |
---|
225 | pthread_cond_signal(&condition2_); // unlock |
---|
226 | return pthread_join(threadId_.thr, NULL); |
---|
227 | #else |
---|
228 | #endif |
---|
229 | } |
---|
230 | // Exits thread |
---|
231 | void |
---|
232 | CbcSpecificThread::exitThread() |
---|
233 | { |
---|
234 | #ifdef CBC_PTHREAD |
---|
235 | pthread_mutex_unlock(&mutex2_); |
---|
236 | pthread_exit(NULL); |
---|
237 | #else |
---|
238 | #endif |
---|
239 | |
---|
240 | } |
---|
241 | // Get status |
---|
242 | int |
---|
243 | CbcSpecificThread::status() const |
---|
244 | { |
---|
245 | #ifdef CBC_PTHREAD |
---|
246 | return threadId_.status; |
---|
247 | #else |
---|
248 | #endif |
---|
249 | } |
---|
250 | // Set status |
---|
251 | void |
---|
252 | CbcSpecificThread::setStatus(int value) |
---|
253 | { |
---|
254 | #ifdef CBC_PTHREAD |
---|
255 | threadId_.status = value; |
---|
256 | #else |
---|
257 | #endif |
---|
258 | } |
---|
259 | // Parallel heuristics |
---|
260 | void |
---|
261 | parallelHeuristics (int numberThreads, |
---|
262 | int sizeOfData, |
---|
263 | void * argBundle) |
---|
264 | { |
---|
265 | Coin_pthread_t * threadId = new Coin_pthread_t [numberThreads]; |
---|
266 | char * args = reinterpret_cast<char *>(argBundle); |
---|
267 | for (int i = 0; i < numberThreads; i++) { |
---|
268 | pthread_create(&(threadId[i].thr), NULL, doHeurThread, |
---|
269 | args + i*sizeOfData); |
---|
270 | } |
---|
271 | // now wait |
---|
272 | for (int i = 0; i < numberThreads; i++) { |
---|
273 | pthread_join(threadId[i].thr, NULL); |
---|
274 | } |
---|
275 | delete [] threadId; |
---|
276 | } |
---|
277 | // End of specific thread stuff |
---|
278 | |
---|
279 | /// Default constructor |
---|
280 | CbcThread::CbcThread() |
---|
281 | : |
---|
282 | baseModel_(NULL), |
---|
283 | thisModel_(NULL), |
---|
284 | node_(NULL), // filled in every time |
---|
285 | createdNode_(NULL), // filled in every time on return |
---|
286 | returnCode_(-1), // -1 available, 0 busy, 1 finished , 2?? |
---|
287 | timeLocked_(0.0), |
---|
288 | timeWaitingToLock_(0.0), |
---|
289 | timeWaitingToStart_(0.0), |
---|
290 | timeInThread_(0.0), |
---|
291 | numberTimesLocked_(0), |
---|
292 | numberTimesUnlocked_(0), |
---|
293 | numberTimesWaitingToStart_(0), |
---|
294 | dantzigState_(0), // 0 unset, -1 waiting to be set, 1 set |
---|
295 | locked_(false), |
---|
296 | nDeleteNode_(0), |
---|
297 | delNode_(NULL), |
---|
298 | maxDeleteNode_(0), |
---|
299 | nodesThisTime_(0), |
---|
300 | iterationsThisTime_(0), |
---|
301 | deterministic_(0) |
---|
302 | { |
---|
303 | } |
---|
304 | void |
---|
305 | CbcThread::gutsOfDelete() |
---|
306 | { |
---|
307 | baseModel_ = NULL; |
---|
308 | thisModel_ = NULL; |
---|
309 | node_ = NULL; |
---|
310 | createdNode_ = NULL; |
---|
311 | delNode_ = NULL; |
---|
312 | } |
---|
313 | // Destructor |
---|
314 | CbcThread::~CbcThread() |
---|
315 | { |
---|
316 | } |
---|
317 | // Fills in useful stuff |
---|
318 | void |
---|
319 | CbcThread::setUsefulStuff (CbcModel * model, int deterministic, CbcModel * baseModel, |
---|
320 | CbcThread * master, |
---|
321 | void *& masterMutex) |
---|
322 | { |
---|
323 | baseModel_ = baseModel; |
---|
324 | thisModel_ = model; |
---|
325 | deterministic_ = deterministic; |
---|
326 | threadStuff_.setUsefulStuff(&master->threadStuff_, masterMutex); |
---|
327 | node_ = NULL; |
---|
328 | createdNode_ = NULL; |
---|
329 | master_ = master; |
---|
330 | returnCode_ = -1; |
---|
331 | timeLocked_ = 0.0; |
---|
332 | timeWaitingToLock_ = 0.0; |
---|
333 | timeWaitingToStart_ = 0.0; |
---|
334 | timeInThread_ = 0.0; |
---|
335 | numberTimesLocked_ = 0; |
---|
336 | numberTimesUnlocked_ = 0; |
---|
337 | numberTimesWaitingToStart_ = 0; |
---|
338 | dantzigState_ = 0; // 0 unset, -1 waiting to be set, 1 set |
---|
339 | locked_ = false; |
---|
340 | delNode_ = NULL; |
---|
341 | maxDeleteNode_ = 0; |
---|
342 | nDeleteNode_ = 0; |
---|
343 | nodesThisTime_ = 0; |
---|
344 | iterationsThisTime_ = 0; |
---|
345 | if (model != baseModel) { |
---|
346 | // thread |
---|
347 | thisModel_->setInfoInChild(-3, this); |
---|
348 | if (deterministic_ >= 0) |
---|
349 | thisModel_->moveToModel(baseModel, -1); |
---|
350 | if (deterministic == -1) |
---|
351 | threadStuff_.startThread( doCutsThread, this); |
---|
352 | else |
---|
353 | threadStuff_.startThread( doNodesThread, this); |
---|
354 | } |
---|
355 | } |
---|
356 | /* |
---|
357 | Locks a thread if parallel so that stuff like cut pool |
---|
358 | can be updated and/or used. |
---|
359 | */ |
---|
360 | void |
---|
361 | CbcThread::lockThread() |
---|
362 | { |
---|
363 | if (!locked_) { |
---|
364 | double time2 = getTime(); |
---|
365 | threadStuff_.lockThread(); |
---|
366 | locked_ = true; |
---|
367 | timeWhenLocked_ = getTime(); |
---|
368 | timeWaitingToLock_ += timeWhenLocked_ - time2;; |
---|
369 | numberTimesLocked_++; |
---|
370 | #ifdef THREAD_DEBUG |
---|
371 | lockCount_ ++; |
---|
372 | #if THREAD_DEBUG>1 |
---|
373 | if (threadNumber_ == -1) |
---|
374 | printf("locking master %d\n", lockCount_); |
---|
375 | else |
---|
376 | printf("locking thread %d %d\n", threadNumber_, lockCount_); |
---|
377 | #endif |
---|
378 | } else { |
---|
379 | if (threadNumber_ == -1) |
---|
380 | printf("master already locked %d\n", lockCount_); |
---|
381 | else |
---|
382 | printf("thread already locked %d %d\n", threadNumber_, lockCount_); |
---|
383 | #endif |
---|
384 | } |
---|
385 | } |
---|
386 | /* |
---|
387 | Unlocks a thread if parallel |
---|
388 | */ |
---|
389 | void |
---|
390 | CbcThread::unlockThread() |
---|
391 | { |
---|
392 | if (locked_) { |
---|
393 | locked_ = false; |
---|
394 | threadStuff_.unlockThread(); |
---|
395 | double time2 = getTime(); |
---|
396 | timeLocked_ += time2 - timeWhenLocked_; |
---|
397 | numberTimesUnlocked_++; |
---|
398 | #ifdef THREAD_DEBUG |
---|
399 | #if THREAD_DEBUG>1 |
---|
400 | if (threadNumber_ == -1) |
---|
401 | printf("unlocking master %d\n", lockCount_); |
---|
402 | else |
---|
403 | printf("unlocking thread %d %d\n", threadNumber_, lockCount_); |
---|
404 | #endif |
---|
405 | } else { |
---|
406 | if (threadNumber_ == -1) |
---|
407 | printf("master already unlocked %d\n", lockCount_); |
---|
408 | else |
---|
409 | printf("thread already unlocked %d %d\n", threadNumber_, lockCount_); |
---|
410 | #endif |
---|
411 | } |
---|
412 | } |
---|
413 | /* Wait for child to have return code NOT == to currentCode |
---|
414 | type - 0 timed wait |
---|
415 | 1 wait |
---|
416 | returns true if return code changed */ |
---|
417 | bool |
---|
418 | CbcThread::wait(int type, int currentCode) |
---|
419 | { |
---|
420 | if (!type) { |
---|
421 | // just timed wait |
---|
422 | master_->threadStuff_.lockThread2(); |
---|
423 | master_->threadStuff_.timedWait(1000000); |
---|
424 | master_->threadStuff_.unlockThread2(); |
---|
425 | } else { |
---|
426 | // wait until return code changes |
---|
427 | while (returnCode_ == currentCode) { |
---|
428 | threadStuff_.signal(); |
---|
429 | master_->threadStuff_.lockThread2(); |
---|
430 | master_->threadStuff_.timedWait(1000000); |
---|
431 | master_->threadStuff_.unlockThread2(); |
---|
432 | } |
---|
433 | } |
---|
434 | return (returnCode_ != currentCode); |
---|
435 | } |
---|
436 | #if 0 |
---|
437 | pthread_cond_signal(&condition2_); |
---|
438 | - |
---|
439 | if (!locked_) |
---|
440 | { |
---|
441 | pthread_mutex_lock (&mutex2_); |
---|
442 | locked_ = true; |
---|
443 | } |
---|
444 | - |
---|
445 | pthread_cond_timedwait(&condition2_, &mutex2_, &absTime); |
---|
446 | - |
---|
447 | if (locked_) |
---|
448 | { |
---|
449 | pthread_mutex_unlock (&mutex2_); |
---|
450 | locked_ = false; |
---|
451 | } |
---|
452 | #endif |
---|
453 | // Waits until returnCode_ goes to zero |
---|
454 | void |
---|
455 | CbcThread::waitThread() |
---|
456 | { |
---|
457 | double time = getTime(); |
---|
458 | threadStuff_.lockThread2(); |
---|
459 | while (returnCode_) { |
---|
460 | threadStuff_.timedWait(-10); // 10 seconds |
---|
461 | } |
---|
462 | timeWaitingToStart_ += getTime() - time; |
---|
463 | numberTimesWaitingToStart_++; |
---|
464 | } |
---|
465 | // Just wait for so many nanoseconds |
---|
466 | void |
---|
467 | CbcThread::waitNano(int time) |
---|
468 | { |
---|
469 | threadStuff_.lockThread2(); |
---|
470 | threadStuff_.timedWait(time); |
---|
471 | threadStuff_.unlockThread2(); |
---|
472 | } |
---|
473 | // Signal child to carry on |
---|
474 | void |
---|
475 | CbcThread::signal() |
---|
476 | { |
---|
477 | threadStuff_.signal(); |
---|
478 | } |
---|
479 | // Lock from master with mutex2 and signal before lock |
---|
480 | void |
---|
481 | CbcThread::lockFromMaster() |
---|
482 | { |
---|
483 | threadStuff_.signal(); |
---|
484 | master_->threadStuff_.lockThread2(true); |
---|
485 | } |
---|
486 | // Unlock from master with mutex2 and signal after unlock |
---|
487 | void |
---|
488 | CbcThread::unlockFromMaster() |
---|
489 | { |
---|
490 | master_->threadStuff_.unlockThread2(true); // unlock anyway |
---|
491 | threadStuff_.signal(); |
---|
492 | } |
---|
493 | // Lock from thread with mutex2 and signal before lock |
---|
494 | void |
---|
495 | CbcThread::lockFromThread() |
---|
496 | { |
---|
497 | master_->threadStuff_.signal(); |
---|
498 | threadStuff_.lockThread2(); |
---|
499 | } |
---|
500 | // Unlock from thread with mutex2 and signal after unlock |
---|
501 | void |
---|
502 | CbcThread::unlockFromThread() |
---|
503 | { |
---|
504 | master_->threadStuff_.signal(); |
---|
505 | threadStuff_.unlockThread2(); |
---|
506 | } |
---|
507 | // Exits thread (from master) |
---|
508 | int |
---|
509 | CbcThread::exit() |
---|
510 | { |
---|
511 | return threadStuff_.exit(); |
---|
512 | } |
---|
513 | // Exits thread |
---|
514 | void |
---|
515 | CbcThread::exitThread() |
---|
516 | { |
---|
517 | threadStuff_.exitThread(); |
---|
518 | } |
---|
519 | // Default constructor |
---|
520 | CbcBaseModel::CbcBaseModel() |
---|
521 | : |
---|
522 | numberThreads_(0), |
---|
523 | children_(NULL), |
---|
524 | type_(0), |
---|
525 | threadCount_(NULL), |
---|
526 | threadModel_(NULL), |
---|
527 | numberObjects_(0), |
---|
528 | saveObjects_(NULL), |
---|
529 | defaultParallelIterations_(400), |
---|
530 | defaultParallelNodes_(2) |
---|
531 | { |
---|
532 | } |
---|
533 | // Constructor with model |
---|
534 | CbcBaseModel::CbcBaseModel (CbcModel & model, int type) |
---|
535 | : |
---|
536 | children_(NULL), |
---|
537 | type_(type), |
---|
538 | threadCount_(NULL), |
---|
539 | threadModel_(NULL), |
---|
540 | numberObjects_(0), |
---|
541 | saveObjects_(NULL), |
---|
542 | defaultParallelIterations_(400), |
---|
543 | defaultParallelNodes_(2) |
---|
544 | { |
---|
545 | numberThreads_ = model.getNumberThreads(); |
---|
546 | if (numberThreads_) { |
---|
547 | children_ = new CbcThread [numberThreads_+1]; |
---|
548 | // Do a partial one for base model |
---|
549 | void * mutex_main = NULL; |
---|
550 | children_[numberThreads_].setUsefulStuff(&model, type_, &model, |
---|
551 | children_ + numberThreads_, mutex_main); |
---|
552 | #ifdef THREAD_DEBUG |
---|
553 | children_[numberThreads_].threadNumber_ = -1; |
---|
554 | children_[numberThreads_].lockCount_ = 0; |
---|
555 | #endif |
---|
556 | threadCount_ = new int [numberThreads_]; |
---|
557 | CoinZeroN(threadCount_, numberThreads_); |
---|
558 | threadModel_ = new CbcModel * [numberThreads_+1]; |
---|
559 | memset(threadStats_, 0, sizeof(threadStats_)); |
---|
560 | if (type_ > 0) { |
---|
561 | // May need for deterministic |
---|
562 | numberObjects_ = model.numberObjects(); |
---|
563 | saveObjects_ = new OsiObject * [numberObjects_]; |
---|
564 | for (int i = 0; i < numberObjects_; i++) { |
---|
565 | saveObjects_[i] = model.object(i)->clone(); |
---|
566 | } |
---|
567 | } |
---|
568 | // we don't want a strategy object |
---|
569 | CbcStrategy * saveStrategy = model.strategy(); |
---|
570 | model.setStrategy(NULL); |
---|
571 | for (int i = 0; i < numberThreads_; i++) { |
---|
572 | threadModel_[i] = new CbcModel(model, true); |
---|
573 | threadModel_[i]->synchronizeHandlers(1); |
---|
574 | #ifdef COIN_HAS_CLP |
---|
575 | // Solver may need to know about model |
---|
576 | CbcModel * thisModel = threadModel_[i]; |
---|
577 | CbcOsiSolver * solver = |
---|
578 | dynamic_cast<CbcOsiSolver *>(thisModel->solver()) ; |
---|
579 | if (solver) |
---|
580 | solver->setCbcModel(thisModel); |
---|
581 | #endif |
---|
582 | children_[i].setUsefulStuff(threadModel_[i], type_, &model, |
---|
583 | children_ + numberThreads_, mutex_main); |
---|
584 | #ifdef THREAD_DEBUG |
---|
585 | children_[i].threadNumber_ = i; |
---|
586 | children_[i].lockCount_ = 0; |
---|
587 | #endif |
---|
588 | } |
---|
589 | model.setStrategy(saveStrategy); |
---|
590 | } |
---|
591 | } |
---|
592 | // Stop threads |
---|
593 | void |
---|
594 | CbcBaseModel::stopThreads(int type) |
---|
595 | { |
---|
596 | if (type < 0) { |
---|
597 | // max nodes ? |
---|
598 | bool finished = false; |
---|
599 | while (!finished) { |
---|
600 | finished = true; |
---|
601 | for (int i = 0; i < numberThreads_; i++) { |
---|
602 | if (abs(children_[i].returnCode()) != 1) { |
---|
603 | children_[i].wait(1, 0); |
---|
604 | finished=false; |
---|
605 | } |
---|
606 | } |
---|
607 | } |
---|
608 | return; |
---|
609 | } |
---|
610 | for (int i = 0; i < numberThreads_; i++) { |
---|
611 | children_[i].wait(1, 0); |
---|
612 | assert (children_[i].returnCode() == -1); |
---|
613 | threadModel_[i]->setInfoInChild(-2, NULL); |
---|
614 | children_[i].setReturnCode( 0); |
---|
615 | children_[i].exit(); |
---|
616 | children_[i].setStatus( 0); |
---|
617 | } |
---|
618 | // delete models and solvers |
---|
619 | for (int i = 0; i < numberThreads_; i++) { |
---|
620 | threadModel_[i]->setInfoInChild(type_, NULL); |
---|
621 | delete threadModel_[i]; |
---|
622 | } |
---|
623 | delete [] children_; |
---|
624 | delete [] threadModel_; |
---|
625 | for (int i = 0; i < numberObjects_; i++) |
---|
626 | delete saveObjects_[i]; |
---|
627 | delete [] saveObjects_; |
---|
628 | children_ = NULL; |
---|
629 | threadModel_ = NULL; |
---|
630 | saveObjects_ = NULL; |
---|
631 | numberObjects_ = 0; |
---|
632 | numberThreads_ = 0; |
---|
633 | } |
---|
634 | // Wait for threads in tree |
---|
635 | int |
---|
636 | CbcBaseModel::waitForThreadsInTree(int type) |
---|
637 | { |
---|
638 | CbcModel * baseModel = children_[0].baseModel(); |
---|
639 | int anyLeft = 0; |
---|
640 | // May be able to combine parts later |
---|
641 | |
---|
642 | if (type == 0) { |
---|
643 | bool locked = true; |
---|
644 | #ifdef COIN_DEVELOP |
---|
645 | printf("empty\n"); |
---|
646 | #endif |
---|
647 | // may still be outstanding nodes |
---|
648 | while (true) { |
---|
649 | int iThread; |
---|
650 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
651 | if (children_[iThread].status()) { |
---|
652 | if (children_[iThread].returnCode() == 0) |
---|
653 | break; |
---|
654 | } |
---|
655 | } |
---|
656 | if (iThread < numberThreads_) { |
---|
657 | #ifdef COIN_DEVELOP |
---|
658 | printf("waiting for thread %d code 0\n", iThread); |
---|
659 | #endif |
---|
660 | unlockThread(); |
---|
661 | locked = false; |
---|
662 | children_[iThread].wait(1, 0); |
---|
663 | assert(children_[iThread].returnCode() == 1); |
---|
664 | threadModel_[iThread]->moveToModel(baseModel, 1); |
---|
665 | #ifdef THREAD_PRINT |
---|
666 | printf("off thread2 %d node %x\n", iThread, children_[iThread].node()); |
---|
667 | #endif |
---|
668 | children_[iThread].setNode(NULL); |
---|
669 | anyLeft = 1; |
---|
670 | assert (children_[iThread].returnCode() == 1); |
---|
671 | if (children_[iThread].dantzigState() == -1) { |
---|
672 | // 0 unset, -1 waiting to be set, 1 set |
---|
673 | children_[iThread].setDantzigState(1); |
---|
674 | CbcModel * model = children_[iThread].thisModel(); |
---|
675 | OsiClpSolverInterface * clpSolver2 |
---|
676 | = dynamic_cast<OsiClpSolverInterface *> (model->solver()); |
---|
677 | assert (clpSolver2); |
---|
678 | ClpSimplex * simplex2 = clpSolver2->getModelPtr(); |
---|
679 | ClpDualRowDantzig dantzig; |
---|
680 | simplex2->setDualRowPivotAlgorithm(dantzig); |
---|
681 | } |
---|
682 | // say available |
---|
683 | children_[iThread].setReturnCode( -1); |
---|
684 | threadStats_[4]++; |
---|
685 | #ifdef COIN_DEVELOP |
---|
686 | printf("thread %d code now -1\n", iThread); |
---|
687 | #endif |
---|
688 | break; |
---|
689 | } else { |
---|
690 | #ifdef COIN_DEVELOP |
---|
691 | printf("no threads at code 0 \n"); |
---|
692 | #endif |
---|
693 | // now check if any have just finished |
---|
694 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
695 | if (children_[iThread].status()) { |
---|
696 | if (children_[iThread].returnCode() == 1) |
---|
697 | break; |
---|
698 | } |
---|
699 | } |
---|
700 | if (iThread < numberThreads_) { |
---|
701 | unlockThread(); |
---|
702 | locked = false; |
---|
703 | threadModel_[iThread]->moveToModel(baseModel, 1); |
---|
704 | #ifdef THREAD_PRINT |
---|
705 | printf("off thread3 %d node %x\n", iThread, children_[iThread].node()); |
---|
706 | #endif |
---|
707 | children_[iThread].setNode(NULL); |
---|
708 | anyLeft = 1; |
---|
709 | assert (children_[iThread].returnCode() == 1); |
---|
710 | // say available |
---|
711 | children_[iThread].setReturnCode( -1); |
---|
712 | threadStats_[4]++; |
---|
713 | #ifdef COIN_DEVELOP |
---|
714 | printf("thread %d code now -1\n", iThread); |
---|
715 | #endif |
---|
716 | break; |
---|
717 | } |
---|
718 | } |
---|
719 | if (!baseModel->tree()->empty()) { |
---|
720 | #ifdef COIN_DEVELOP |
---|
721 | printf("tree not empty!!!!!!\n"); |
---|
722 | #endif |
---|
723 | if (locked) |
---|
724 | unlockThread(); |
---|
725 | return 1; |
---|
726 | break; |
---|
727 | } |
---|
728 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
729 | if (children_[iThread].status()) { |
---|
730 | if (children_[iThread].returnCode() != -1) { |
---|
731 | printf("bad end of tree\n"); |
---|
732 | abort(); |
---|
733 | } |
---|
734 | } |
---|
735 | } |
---|
736 | break; |
---|
737 | } |
---|
738 | #ifdef COIN_DEVELOP |
---|
739 | printf("finished ************\n"); |
---|
740 | #endif |
---|
741 | if (locked) |
---|
742 | unlockThread(); |
---|
743 | return anyLeft; |
---|
744 | } else if (type == 1) { |
---|
745 | // normal |
---|
746 | double cutoff = baseModel->getCutoff(); |
---|
747 | CbcNode * node = baseModel->tree()->bestNode(cutoff) ; |
---|
748 | // Possible one on tree worse than cutoff |
---|
749 | if (!node || node->objectiveValue() > cutoff) |
---|
750 | return 1; |
---|
751 | threadStats_[0]++; |
---|
752 | //need to think |
---|
753 | int iThread; |
---|
754 | // Start one off if any available |
---|
755 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
756 | if (children_[iThread].returnCode() == -1) |
---|
757 | break; |
---|
758 | } |
---|
759 | if (iThread < numberThreads_) { |
---|
760 | children_[iThread].setNode(node); |
---|
761 | #ifdef THREAD_PRINT |
---|
762 | printf("empty thread %d node %x\n", iThread, children_[iThread].node()); |
---|
763 | #endif |
---|
764 | assert (children_[iThread].returnCode() == -1); |
---|
765 | // say in use |
---|
766 | threadModel_[iThread]->moveToModel(baseModel, 0); |
---|
767 | // This has to be AFTER moveToModel |
---|
768 | children_[iThread].setReturnCode( 0); |
---|
769 | children_[iThread].signal(); |
---|
770 | threadCount_[iThread]++; |
---|
771 | } |
---|
772 | lockThread(); |
---|
773 | // see if any finished |
---|
774 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
775 | if (children_[iThread].returnCode() > 0) |
---|
776 | break; |
---|
777 | } |
---|
778 | unlockThread(); |
---|
779 | if (iThread < numberThreads_) { |
---|
780 | threadModel_[iThread]->moveToModel(baseModel, 1); |
---|
781 | #ifdef THREAD_PRINT |
---|
782 | printf("off thread4 %d node %x\n", iThread, children_[iThread].node()); |
---|
783 | #endif |
---|
784 | children_[iThread].setNode(NULL); |
---|
785 | anyLeft = 1; |
---|
786 | assert (children_[iThread].returnCode() == 1); |
---|
787 | // say available |
---|
788 | children_[iThread].setReturnCode( -1); |
---|
789 | // carry on |
---|
790 | threadStats_[3]++; |
---|
791 | } else { |
---|
792 | // Start one off if any available |
---|
793 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
794 | if (children_[iThread].returnCode() == -1) |
---|
795 | break; |
---|
796 | } |
---|
797 | if (iThread < numberThreads_) { |
---|
798 | // If any on tree get |
---|
799 | if (!baseModel->tree()->empty()) { |
---|
800 | //node = baseModel->tree()->bestNode(cutoff) ; |
---|
801 | //assert (node); |
---|
802 | threadStats_[1]++; |
---|
803 | return 1; // ** get another node |
---|
804 | } |
---|
805 | } |
---|
806 | // wait (for debug could sleep and use test) |
---|
807 | bool finished = false; |
---|
808 | while (!finished) { |
---|
809 | double time = getTime(); |
---|
810 | children_[numberThreads_].wait(0, 0); |
---|
811 | children_[numberThreads_].incrementTimeInThread(getTime() - time); |
---|
812 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
813 | if (children_[iThread].returnCode() > 0) { |
---|
814 | finished = true; |
---|
815 | break; |
---|
816 | } else if (children_[iThread].returnCode() == 0) { |
---|
817 | children_[iThread].signal(); // unlock |
---|
818 | } |
---|
819 | } |
---|
820 | } |
---|
821 | assert (iThread < numberThreads_); |
---|
822 | // move information to model |
---|
823 | threadModel_[iThread]->moveToModel(baseModel, 1); |
---|
824 | anyLeft = 1; |
---|
825 | #ifdef THREAD_PRINT |
---|
826 | printf("off thread %d node %x\n", iThread, children_[iThread].node()); |
---|
827 | #endif |
---|
828 | children_[iThread].setNode(NULL); |
---|
829 | assert (children_[iThread].returnCode() == 1); |
---|
830 | // say available |
---|
831 | children_[iThread].setReturnCode( -1); |
---|
832 | } |
---|
833 | // carry on |
---|
834 | threadStats_[2]++; |
---|
835 | for (int iThread = 0; iThread < numberThreads_; iThread++) { |
---|
836 | if (children_[iThread].status()) { |
---|
837 | if (children_[iThread].returnCode() != -1) { |
---|
838 | anyLeft = 1; |
---|
839 | break; |
---|
840 | } |
---|
841 | } |
---|
842 | } |
---|
843 | return anyLeft; |
---|
844 | } else if (type == 2) { |
---|
845 | if (!baseModel->tree()->empty()) { |
---|
846 | // max nodes ? |
---|
847 | bool finished = false; |
---|
848 | while (!finished) { |
---|
849 | finished = true; |
---|
850 | for (int iThread = 0; iThread < numberThreads_; iThread++) { |
---|
851 | if (children_[iThread].returnCode() == 0) { |
---|
852 | double time = getTime(); |
---|
853 | children_[numberThreads_].wait(0, 0); |
---|
854 | children_[numberThreads_].incrementTimeInThread(getTime() - time); |
---|
855 | finished = false; |
---|
856 | children_[iThread].signal(); // unlock |
---|
857 | } |
---|
858 | } |
---|
859 | } |
---|
860 | } |
---|
861 | int i; |
---|
862 | // do statistics |
---|
863 | // Seems to be bug in CoinCpu on Linux - does threads as well despite documentation |
---|
864 | double time = 0.0; |
---|
865 | for (i = 0; i < numberThreads_; i++) |
---|
866 | time += children_[i].timeInThread(); |
---|
867 | bool goodTimer = time < (baseModel->getCurrentSeconds()); |
---|
868 | for (i = 0; i < numberThreads_; i++) { |
---|
869 | while (children_[i].returnCode() == 0) { |
---|
870 | children_[i].signal(); |
---|
871 | double time = getTime(); |
---|
872 | children_[numberThreads_].wait(0, 0); |
---|
873 | children_[numberThreads_].incrementTimeInThread(getTime() - time); |
---|
874 | } |
---|
875 | children_[i].lockFromMaster(); |
---|
876 | threadModel_[i]->setNumberThreads(0); // say exit |
---|
877 | if (children_[i].deterministic() > 0) |
---|
878 | delete [] children_[i].delNode(); |
---|
879 | children_[i].setReturnCode( 0); |
---|
880 | children_[i].unlockFromMaster(); |
---|
881 | int returnCode; |
---|
882 | returnCode = children_[i].exit(); |
---|
883 | children_[i].setStatus( 0); |
---|
884 | assert (!returnCode); |
---|
885 | //else |
---|
886 | threadModel_[i]->moveToModel(baseModel, 2); |
---|
887 | assert (children_[i].numberTimesLocked() == children_[i].numberTimesUnlocked()); |
---|
888 | baseModel->messageHandler()->message(CBC_THREAD_STATS, baseModel->messages()) |
---|
889 | << "Thread"; |
---|
890 | baseModel->messageHandler()->printing(true) |
---|
891 | << i << threadCount_[i] << children_[i].timeWaitingToStart(); |
---|
892 | baseModel->messageHandler()->printing(goodTimer) << children_[i].timeInThread(); |
---|
893 | baseModel->messageHandler()->printing(false) << 0.0; |
---|
894 | baseModel->messageHandler()->printing(true) << children_[i].numberTimesLocked() |
---|
895 | << children_[i].timeLocked() << children_[i].timeWaitingToLock() |
---|
896 | << CoinMessageEol; |
---|
897 | } |
---|
898 | assert (children_[numberThreads_].numberTimesLocked() == children_[numberThreads_].numberTimesUnlocked()); |
---|
899 | baseModel->messageHandler()->message(CBC_THREAD_STATS, baseModel->messages()) |
---|
900 | << "Main thread"; |
---|
901 | baseModel->messageHandler()->printing(false) << 0 << 0 << 0.0; |
---|
902 | baseModel->messageHandler()->printing(false) << 0.0; |
---|
903 | baseModel->messageHandler()->printing(true) << children_[numberThreads_].timeInThread(); |
---|
904 | baseModel->messageHandler()->printing(true) << children_[numberThreads_].numberTimesLocked() |
---|
905 | << children_[numberThreads_].timeLocked() << children_[numberThreads_].timeWaitingToLock() |
---|
906 | << CoinMessageEol; |
---|
907 | // delete models (here in case some point to others) |
---|
908 | for (i = 0; i < numberThreads_; i++) { |
---|
909 | // make sure handler will be deleted |
---|
910 | threadModel_[i]->setDefaultHandler(true); |
---|
911 | //delete threadModel_[i]; |
---|
912 | } |
---|
913 | } else { |
---|
914 | abort(); |
---|
915 | } |
---|
916 | return 0; |
---|
917 | } |
---|
918 | void |
---|
919 | CbcBaseModel::waitForThreadsInCuts(int type, OsiCuts * eachCuts, |
---|
920 | int whichGenerator) |
---|
921 | { |
---|
922 | if (type == 0) { |
---|
923 | // cuts while doing |
---|
924 | bool finished = false; |
---|
925 | int iThread = -1; |
---|
926 | // see if any available |
---|
927 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
928 | if (children_[iThread].returnCode()) { |
---|
929 | finished = true; |
---|
930 | break; |
---|
931 | } else if (children_[iThread].returnCode() == 0) { |
---|
932 | children_[iThread].signal(); |
---|
933 | } |
---|
934 | } |
---|
935 | while (!finished) { |
---|
936 | children_[numberThreads_].waitNano(1000000); |
---|
937 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
938 | if (children_[iThread].returnCode() > 0) { |
---|
939 | finished = true; |
---|
940 | break; |
---|
941 | } else if (children_[iThread].returnCode() == 0) { |
---|
942 | children_[iThread].signal(); |
---|
943 | } |
---|
944 | } |
---|
945 | } |
---|
946 | assert (iThread < numberThreads_); |
---|
947 | assert (children_[iThread].returnCode()); |
---|
948 | // Use dantzigState to signal which generator |
---|
949 | children_[iThread].setDantzigState(whichGenerator); |
---|
950 | // and delNode for eachCuts |
---|
951 | children_[iThread].fakeDelNode(reinterpret_cast<CbcNode **> (eachCuts)); |
---|
952 | // allow to start |
---|
953 | children_[iThread].setReturnCode( 0); |
---|
954 | children_[iThread].signal(); |
---|
955 | } else if (type == 1) { |
---|
956 | // cuts - finish up |
---|
957 | for (int iThread = 0; iThread < numberThreads_; iThread++) { |
---|
958 | if (children_[iThread].returnCode() == 0) { |
---|
959 | bool finished = false; |
---|
960 | while (!finished) { |
---|
961 | children_[numberThreads_].wait(0, 0); |
---|
962 | if (children_[iThread].returnCode() > 0) { |
---|
963 | finished = true; |
---|
964 | break; |
---|
965 | //#ifndef NEW_STYLE_PTHREAD |
---|
966 | //} else if (children_[iThread].returnCode_ == 0) { |
---|
967 | //pthread_cond_signal(&children_[iThread].threadStuff_.condition2_); // unlock |
---|
968 | //#endif |
---|
969 | } |
---|
970 | } |
---|
971 | } |
---|
972 | assert (children_[iThread].returnCode()); |
---|
973 | // say available |
---|
974 | children_[iThread].setReturnCode( -1); |
---|
975 | //delete threadModel_[iThread]->solver(); |
---|
976 | //threadModel_[iThread]->setSolver(NULL); |
---|
977 | } |
---|
978 | } else { |
---|
979 | abort(); |
---|
980 | } |
---|
981 | } |
---|
982 | // Returns pointer to master thread |
---|
983 | CbcThread * |
---|
984 | CbcBaseModel::masterThread() const |
---|
985 | { |
---|
986 | return children_ + numberThreads_; |
---|
987 | } |
---|
988 | |
---|
989 | // Split model and do work in deterministic parallel |
---|
990 | void |
---|
991 | CbcBaseModel::deterministicParallel() |
---|
992 | { |
---|
993 | CbcModel * baseModel = children_[0].baseModel(); |
---|
994 | for (int i = 0; i < numberThreads_; i++) |
---|
995 | threadCount_[i]++; |
---|
996 | int saveTreeSize = baseModel->tree()->size(); |
---|
997 | // For now create threadModel - later modify splitModel |
---|
998 | CbcModel ** threadModel = new CbcModel * [numberThreads_]; |
---|
999 | int iThread; |
---|
1000 | for (iThread = 0; iThread < numberThreads_; iThread++) |
---|
1001 | threadModel[iThread] = children_[iThread].thisModel(); |
---|
1002 | |
---|
1003 | int nAffected = baseModel->splitModel(numberThreads_, threadModel, defaultParallelNodes_); |
---|
1004 | // do all until finished |
---|
1005 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
1006 | // obviously tune |
---|
1007 | children_[iThread].setNDeleteNode(defaultParallelIterations_); |
---|
1008 | } |
---|
1009 | // Save current state |
---|
1010 | int iObject; |
---|
1011 | OsiObject ** object = baseModel->objects(); |
---|
1012 | for (iObject = 0; iObject < numberObjects_; iObject++) { |
---|
1013 | saveObjects_[iObject]->updateBefore(object[iObject]); |
---|
1014 | } |
---|
1015 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
1016 | children_[iThread].setReturnCode( 0); |
---|
1017 | children_[iThread].signal(); |
---|
1018 | } |
---|
1019 | // wait |
---|
1020 | bool finished = false; |
---|
1021 | double time = getTime(); |
---|
1022 | while (!finished) { |
---|
1023 | children_[numberThreads_].waitNano( 1000000); // millisecond |
---|
1024 | finished = true; |
---|
1025 | for (iThread = 0; iThread < numberThreads_; iThread++) { |
---|
1026 | if (children_[iThread].returnCode() <= 0) { |
---|
1027 | finished = false; |
---|
1028 | } |
---|
1029 | } |
---|
1030 | } |
---|
1031 | for (iThread = 0; iThread < numberThreads_; iThread++) |
---|
1032 | children_[iThread].setReturnCode(-1); |
---|
1033 | children_[numberThreads_].incrementTimeInThread(getTime() - time); |
---|
1034 | // Unmark marked |
---|
1035 | for (int i = 0; i < nAffected; i++) { |
---|
1036 | baseModel->walkback()[i]->unmark(); |
---|
1037 | } |
---|
1038 | int iModel; |
---|
1039 | double scaleFactor = 1.0; |
---|
1040 | for (iModel = 0; iModel < numberThreads_; iModel++) { |
---|
1041 | //printf("model %d tree size %d\n",iModel,threadModel[iModel]->baseModel->tree()->size()); |
---|
1042 | if (saveTreeSize > 4*numberThreads_*defaultParallelNodes_) { |
---|
1043 | if (!threadModel[iModel]->tree()->size()) { |
---|
1044 | scaleFactor *= 1.05; |
---|
1045 | } |
---|
1046 | } |
---|
1047 | threadModel[iModel]->moveToModel(baseModel, 11); |
---|
1048 | // Update base model |
---|
1049 | OsiObject ** threadObject = threadModel[iModel]->objects(); |
---|
1050 | for (iObject = 0; iObject < numberObjects_; iObject++) { |
---|
1051 | object[iObject]->updateAfter(threadObject[iObject], saveObjects_[iObject]); |
---|
1052 | } |
---|
1053 | } |
---|
1054 | if (scaleFactor != 1.0) { |
---|
1055 | int newNumber = static_cast<int> (defaultParallelNodes_ * scaleFactor + 0.5001); |
---|
1056 | if (newNumber*2 < defaultParallelIterations_) { |
---|
1057 | if (defaultParallelNodes_ == 1) |
---|
1058 | newNumber = 2; |
---|
1059 | if (newNumber != defaultParallelNodes_) { |
---|
1060 | char general[200]; |
---|
1061 | sprintf(general, "Changing tree size from %d to %d", |
---|
1062 | defaultParallelNodes_, newNumber); |
---|
1063 | baseModel->messageHandler()->message(CBC_GENERAL, |
---|
1064 | baseModel->messages()) |
---|
1065 | << general << CoinMessageEol ; |
---|
1066 | defaultParallelNodes_ = newNumber; |
---|
1067 | } |
---|
1068 | } |
---|
1069 | } |
---|
1070 | delete [] threadModel; |
---|
1071 | } |
---|
1072 | // Destructor |
---|
1073 | CbcBaseModel::~CbcBaseModel() |
---|
1074 | { |
---|
1075 | delete [] threadCount_; |
---|
1076 | #if 1 |
---|
1077 | for (int i = 0; i < numberThreads_; i++) |
---|
1078 | delete threadModel_[i]; |
---|
1079 | delete [] threadModel_; |
---|
1080 | delete [] children_; |
---|
1081 | #endif |
---|
1082 | for (int i = 0; i < numberObjects_; i++) |
---|
1083 | delete saveObjects_[i]; |
---|
1084 | delete [] saveObjects_; |
---|
1085 | } |
---|
1086 | // Sets Dantzig state in children |
---|
1087 | void |
---|
1088 | CbcBaseModel::setDantzigState() |
---|
1089 | { |
---|
1090 | for (int i = 0; i < numberThreads_; i++) { |
---|
1091 | children_[i].setDantzigState(-1); |
---|
1092 | } |
---|
1093 | } |
---|
1094 | static void * doNodesThread(void * voidInfo) |
---|
1095 | { |
---|
1096 | CbcThread * stuff = reinterpret_cast<CbcThread *> (voidInfo); |
---|
1097 | CbcModel * thisModel = stuff->thisModel(); |
---|
1098 | CbcModel * baseModel = stuff->baseModel(); |
---|
1099 | while (true) { |
---|
1100 | stuff->waitThread(); |
---|
1101 | //printf("start node %x\n",stuff->node); |
---|
1102 | int mode = thisModel->getNumberThreads(); |
---|
1103 | if (mode) { |
---|
1104 | // normal |
---|
1105 | double time2 = CoinCpuTime(); |
---|
1106 | assert (stuff->returnCode() == 0); |
---|
1107 | if (thisModel->parallelMode() >= 0) { |
---|
1108 | CbcNode * node = stuff->node(); |
---|
1109 | assert (node->nodeInfo()); |
---|
1110 | CbcNode * createdNode = stuff->createdNode(); |
---|
1111 | thisModel->doOneNode(baseModel, node, createdNode); |
---|
1112 | stuff->setNode(node); |
---|
1113 | stuff->setCreatedNode(createdNode); |
---|
1114 | stuff->setReturnCode( 1); |
---|
1115 | } else { |
---|
1116 | assert (!stuff->node()); |
---|
1117 | assert (!stuff->createdNode()); |
---|
1118 | int numberIterations = stuff->nDeleteNode(); |
---|
1119 | int nDeleteNode = 0; |
---|
1120 | int maxDeleteNode = stuff->maxDeleteNode(); |
---|
1121 | CbcNode ** delNode = stuff->delNode(); |
---|
1122 | int returnCode = 1; |
---|
1123 | // this should be updated by heuristics strong branching etc etc |
---|
1124 | assert (numberIterations > 0); |
---|
1125 | thisModel->setNumberThreads(0); |
---|
1126 | int nodesThisTime = thisModel->getNodeCount(); |
---|
1127 | int iterationsThisTime = thisModel->getIterationCount(); |
---|
1128 | int strongThisTime = thisModel->numberStrongIterations(); |
---|
1129 | thisModel->setStopNumberIterations(thisModel->getIterationCount() + numberIterations); |
---|
1130 | int numberColumns = thisModel->getNumCols(); |
---|
1131 | int * used = CoinCopyOfArray(thisModel->usedInSolution(), numberColumns); |
---|
1132 | int numberSolutions = thisModel->getSolutionCount(); |
---|
1133 | while (true) { |
---|
1134 | if (thisModel->tree()->empty()) { |
---|
1135 | returnCode = 1 + 1; |
---|
1136 | #ifdef CLP_INVESTIGATE_2 |
---|
1137 | printf("%x tree empty - time %18.6f\n", thisModel, CoinGetTimeOfDay() - 1.2348e9); |
---|
1138 | #endif |
---|
1139 | break; |
---|
1140 | } |
---|
1141 | #define NODE_ITERATIONS 2 |
---|
1142 | int nodesNow = thisModel->getNodeCount(); |
---|
1143 | int iterationsNow = thisModel->getIterationCount(); |
---|
1144 | int strongNow = thisModel->numberStrongIterations(); |
---|
1145 | bool exit1 = (NODE_ITERATIONS * ((nodesNow - nodesThisTime) + |
---|
1146 | ((strongNow - strongThisTime) >> 1)) + |
---|
1147 | (iterationsNow - iterationsThisTime) > numberIterations); |
---|
1148 | //bool exit2 =(thisModel->getIterationCount()>thisModel->getStopNumberIterations()) ; |
---|
1149 | //assert (exit1==exit2); |
---|
1150 | if (exit1 && nodesNow - nodesThisTime >= 10) { |
---|
1151 | // out of loop |
---|
1152 | //printf("out of loop\n"); |
---|
1153 | #ifdef CLP_INVESTIGATE3 |
---|
1154 | printf("%x tree %d nodes left, done %d and %d its - time %18.6f\n", thisModel, |
---|
1155 | thisModel->tree()->size(), nodesNow - nodesThisTime, |
---|
1156 | iterationsNow - iterationsThisTime, CoinGetTimeOfDay() - 1.2348e9); |
---|
1157 | #endif |
---|
1158 | break; |
---|
1159 | } |
---|
1160 | double cutoff = thisModel->getCutoff() ; |
---|
1161 | CbcNode *node = thisModel->tree()->bestNode(cutoff) ; |
---|
1162 | // Possible one on tree worse than cutoff |
---|
1163 | if (!node) |
---|
1164 | continue; |
---|
1165 | CbcNode * createdNode = NULL; |
---|
1166 | // Do real work of node |
---|
1167 | thisModel->doOneNode(NULL, node, createdNode); |
---|
1168 | assert (createdNode); |
---|
1169 | if (!createdNode->active()) { |
---|
1170 | delete createdNode; |
---|
1171 | } else { |
---|
1172 | // Say one more pointing to this **** postpone if marked |
---|
1173 | node->nodeInfo()->increment() ; |
---|
1174 | thisModel->tree()->push(createdNode) ; |
---|
1175 | } |
---|
1176 | if (node->active()) { |
---|
1177 | assert (node->nodeInfo()); |
---|
1178 | if (node->nodeInfo()->numberBranchesLeft()) { |
---|
1179 | thisModel->tree()->push(node) ; |
---|
1180 | } else { |
---|
1181 | node->setActive(false); |
---|
1182 | } |
---|
1183 | } else { |
---|
1184 | if (node->nodeInfo()) { |
---|
1185 | if (!node->nodeInfo()->numberBranchesLeft()) |
---|
1186 | node->nodeInfo()->allBranchesGone(); // can clean up |
---|
1187 | // So will delete underlying stuff |
---|
1188 | node->setActive(true); |
---|
1189 | } |
---|
1190 | if (nDeleteNode == maxDeleteNode) { |
---|
1191 | maxDeleteNode = (3 * maxDeleteNode) / 2 + 10; |
---|
1192 | stuff->setMaxDeleteNode(maxDeleteNode); |
---|
1193 | stuff->setDelNode(new CbcNode * [maxDeleteNode]); |
---|
1194 | for (int i = 0; i < nDeleteNode; i++) |
---|
1195 | stuff->delNode()[i] = delNode[i]; |
---|
1196 | delete [] delNode; |
---|
1197 | delNode = stuff->delNode(); |
---|
1198 | } |
---|
1199 | delNode[nDeleteNode++] = node; |
---|
1200 | } |
---|
1201 | } |
---|
1202 | // end of this sub-tree |
---|
1203 | int * usedA = thisModel->usedInSolution(); |
---|
1204 | for (int i = 0; i < numberColumns; i++) { |
---|
1205 | usedA[i] -= used[i]; |
---|
1206 | } |
---|
1207 | delete [] used; |
---|
1208 | thisModel->setSolutionCount(thisModel->getSolutionCount() - numberSolutions); |
---|
1209 | stuff->setNodesThisTime(thisModel->getNodeCount() - nodesThisTime); |
---|
1210 | stuff->setIterationsThisTime(thisModel->getIterationCount() - iterationsThisTime); |
---|
1211 | stuff->setNDeleteNode(nDeleteNode); |
---|
1212 | stuff->setReturnCode( returnCode); |
---|
1213 | thisModel->setNumberThreads(mode); |
---|
1214 | } |
---|
1215 | //printf("end node %x\n",stuff->node); |
---|
1216 | stuff->unlockFromThread(); |
---|
1217 | stuff->incrementTimeInThread(CoinCpuTime() - time2); |
---|
1218 | } else { |
---|
1219 | // exit |
---|
1220 | break; |
---|
1221 | } |
---|
1222 | } |
---|
1223 | //printf("THREAD exiting\n"); |
---|
1224 | stuff->exitThread(); |
---|
1225 | return NULL; |
---|
1226 | } |
---|
1227 | static void * doHeurThread(void * voidInfo) |
---|
1228 | { |
---|
1229 | typedef struct { |
---|
1230 | double solutionValue; |
---|
1231 | CbcModel * model; |
---|
1232 | double * solution; |
---|
1233 | int foundSol; |
---|
1234 | } argBundle; |
---|
1235 | argBundle * stuff = reinterpret_cast<argBundle *> (voidInfo); |
---|
1236 | stuff->foundSol = |
---|
1237 | stuff->model->heuristic(0)->solution(stuff->solutionValue, |
---|
1238 | stuff->solution); |
---|
1239 | return NULL; |
---|
1240 | } |
---|
1241 | static void * doCutsThread(void * voidInfo) |
---|
1242 | { |
---|
1243 | CbcThread * stuff = reinterpret_cast<CbcThread *> (voidInfo); |
---|
1244 | CbcModel * thisModel = stuff->thisModel(); |
---|
1245 | while (true) { |
---|
1246 | stuff->waitThread(); |
---|
1247 | //printf("start node %x\n",stuff->node); |
---|
1248 | int mode = thisModel->getNumberThreads(); |
---|
1249 | if (mode) { |
---|
1250 | // normal |
---|
1251 | assert (stuff->returnCode() == 0); |
---|
1252 | int fullScan = thisModel->getNodeCount() == 0 ? 1 : 0; //? was >0 |
---|
1253 | CbcCutGenerator * generator = thisModel->cutGenerator(stuff->dantzigState()); |
---|
1254 | generator->refreshModel(thisModel); |
---|
1255 | OsiCuts * cuts = reinterpret_cast<OsiCuts *> (stuff->delNode()); |
---|
1256 | OsiSolverInterface * thisSolver = thisModel->solver(); |
---|
1257 | generator->generateCuts(*cuts, fullScan, thisSolver, NULL); |
---|
1258 | stuff->setReturnCode( 1); |
---|
1259 | stuff->unlockFromThread(); |
---|
1260 | } else { |
---|
1261 | // exit |
---|
1262 | break; |
---|
1263 | } |
---|
1264 | } |
---|
1265 | stuff->exitThread(); |
---|
1266 | return NULL; |
---|
1267 | } |
---|
1268 | // Split up nodes - returns number of CbcNodeInfo's affected |
---|
1269 | int |
---|
1270 | CbcModel::splitModel(int numberModels, CbcModel ** model, |
---|
1271 | int numberNodes) |
---|
1272 | { |
---|
1273 | int iModel; |
---|
1274 | int i; |
---|
1275 | for (iModel = 0; iModel < numberModels; iModel++) { |
---|
1276 | CbcModel * otherModel = model[iModel]; |
---|
1277 | otherModel->moveToModel(this, 10); |
---|
1278 | assert (!otherModel->tree()->size()); |
---|
1279 | otherModel->tree()->resetNodeNumbers(); |
---|
1280 | otherModel->bestPossibleObjective_ = bestPossibleObjective_; |
---|
1281 | otherModel->sumChangeObjective1_ = sumChangeObjective1_; |
---|
1282 | otherModel->sumChangeObjective2_ = sumChangeObjective2_; |
---|
1283 | int numberColumns = solver_->getNumCols(); |
---|
1284 | if (otherModel->bestSolution_) { |
---|
1285 | assert (bestSolution_); |
---|
1286 | memcpy(otherModel->bestSolution_, bestSolution_, numberColumns*sizeof(double)); |
---|
1287 | } else if (bestSolution_) { |
---|
1288 | otherModel->bestSolution_ = CoinCopyOfArray(bestSolution_, numberColumns); |
---|
1289 | } |
---|
1290 | otherModel->globalCuts_ = globalCuts_; |
---|
1291 | otherModel->numberSolutions_ = numberSolutions_; |
---|
1292 | otherModel->numberHeuristicSolutions_ = numberHeuristicSolutions_; |
---|
1293 | otherModel->numberNodes_ = 1; //numberNodes_; |
---|
1294 | otherModel->numberIterations_ = numberIterations_; |
---|
1295 | #ifdef JJF_ZERO |
---|
1296 | if (maximumNumberCuts_ > otherModel->maximumNumberCuts_) { |
---|
1297 | otherModel->maximumNumberCuts_ = maximumNumberCuts_; |
---|
1298 | delete [] otherModel->addedCuts_; |
---|
1299 | otherModel->addedCuts_ = new CbcCountRowCut * [maximumNumberCuts_]; |
---|
1300 | } |
---|
1301 | if (maximumDepth_ > otherModel->maximumDepth_) { |
---|
1302 | otherModel->maximumDepth_ = maximumDepth_; |
---|
1303 | delete [] otherModel->walkback_; |
---|
1304 | otherModel->walkback_ = new CbcNodeInfo * [maximumDepth_]; |
---|
1305 | } |
---|
1306 | #endif |
---|
1307 | otherModel->currentNumberCuts_ = currentNumberCuts_; |
---|
1308 | if (otherModel->usedInSolution_) { |
---|
1309 | assert (usedInSolution_); |
---|
1310 | memcpy(otherModel->usedInSolution_, usedInSolution_, numberColumns*sizeof(int)); |
---|
1311 | } else if (usedInSolution_) { |
---|
1312 | otherModel->usedInSolution_ = CoinCopyOfArray(usedInSolution_, numberColumns); |
---|
1313 | } |
---|
1314 | /// ??? tree_; |
---|
1315 | // Need flag (stopNumberIterations_>0?) which says don't update cut etc counts |
---|
1316 | for (i = 0; i < numberObjects_; i++) { |
---|
1317 | otherModel->object_[i]->updateBefore(object_[i]); |
---|
1318 | } |
---|
1319 | otherModel->maximumDepthActual_ = maximumDepthActual_; |
---|
1320 | // Real cuts are in node info |
---|
1321 | otherModel->numberOldActiveCuts_ = numberOldActiveCuts_; |
---|
1322 | otherModel->numberNewCuts_ = numberNewCuts_; |
---|
1323 | otherModel->numberStrongIterations_ = numberStrongIterations_; |
---|
1324 | } |
---|
1325 | double cutoff = getCutoff(); |
---|
1326 | int nAffected = 0; |
---|
1327 | while (!tree_->empty()) { |
---|
1328 | for (iModel = 0; iModel < numberModels; iModel++) { |
---|
1329 | if (tree_->empty()) |
---|
1330 | break; |
---|
1331 | CbcModel * otherModel = model[iModel]; |
---|
1332 | CbcNode * node = tree_->bestNode(cutoff) ; |
---|
1333 | CbcNodeInfo * nodeInfo = node->nodeInfo(); |
---|
1334 | assert (nodeInfo); |
---|
1335 | if (!nodeInfo->marked()) { |
---|
1336 | //while (nodeInfo&&!nodeInfo->marked()) { |
---|
1337 | if (nAffected == maximumDepth_) { |
---|
1338 | redoWalkBack(); |
---|
1339 | } |
---|
1340 | nodeInfo->mark(); |
---|
1341 | //nodeInfo->incrementCuts(1000000); |
---|
1342 | walkback_[nAffected++] = nodeInfo; |
---|
1343 | //nodeInfo = nodeInfo->parent() ; |
---|
1344 | //} |
---|
1345 | } |
---|
1346 | // Make node join otherModel |
---|
1347 | OsiBranchingObject * bobj = node->modifiableBranchingObject(); |
---|
1348 | CbcBranchingObject * cbcobj = dynamic_cast<CbcBranchingObject *> (bobj); |
---|
1349 | //assert (cbcobj); |
---|
1350 | if (cbcobj) { |
---|
1351 | CbcObject * object = cbcobj->object(); |
---|
1352 | assert (object); |
---|
1353 | int position = object->position(); |
---|
1354 | assert (position >= 0); |
---|
1355 | assert (object_[position] == object); |
---|
1356 | CbcObject * objectNew = |
---|
1357 | dynamic_cast<CbcObject *> (otherModel->object_[position]); |
---|
1358 | cbcobj->setOriginalObject(objectNew); |
---|
1359 | } |
---|
1360 | otherModel->tree_->push(node); |
---|
1361 | } |
---|
1362 | numberNodes--; |
---|
1363 | if (!numberNodes) |
---|
1364 | break; |
---|
1365 | } |
---|
1366 | return nAffected; |
---|
1367 | } |
---|
1368 | // Start threads |
---|
1369 | void |
---|
1370 | CbcModel::startSplitModel(int /*numberIterations*/) |
---|
1371 | { |
---|
1372 | abort(); |
---|
1373 | } |
---|
1374 | // Merge models |
---|
1375 | void |
---|
1376 | CbcModel::mergeModels(int /*numberModel*/, CbcModel ** /*model*/, |
---|
1377 | int /*numberNodes*/) |
---|
1378 | { |
---|
1379 | abort(); |
---|
1380 | } |
---|
1381 | /* Move/copy information from one model to another |
---|
1382 | -1 - initial setup |
---|
1383 | 0 - from base model |
---|
1384 | 1 - to base model (and reset) |
---|
1385 | 2 - add in final statistics etc (and reset so can do clean destruction) |
---|
1386 | 10 - from base model (deterministic) |
---|
1387 | 11 - to base model (deterministic) |
---|
1388 | */ |
---|
1389 | void |
---|
1390 | CbcModel::moveToModel(CbcModel * baseModel, int mode) |
---|
1391 | { |
---|
1392 | if (mode == 0) { |
---|
1393 | setCutoff(baseModel->getCutoff()); |
---|
1394 | bestObjective_ = baseModel->bestObjective_; |
---|
1395 | assert (!baseModel->globalCuts_.sizeRowCuts()); |
---|
1396 | numberSolutions_ = baseModel->numberSolutions_; |
---|
1397 | stateOfSearch_ = baseModel->stateOfSearch_; |
---|
1398 | numberNodes_ = baseModel->numberNodes_; |
---|
1399 | numberIterations_ = baseModel->numberIterations_; |
---|
1400 | numberFixedAtRoot_ = numberIterations_; // for statistics |
---|
1401 | numberSolves_ = 0; |
---|
1402 | phase_ = baseModel->phase_; |
---|
1403 | assert (!nextRowCut_); |
---|
1404 | nodeCompare_ = baseModel->nodeCompare_; |
---|
1405 | tree_ = baseModel->tree_; |
---|
1406 | assert (!subTreeModel_); |
---|
1407 | //branchingMethod_ = NULL; // need something but what |
---|
1408 | numberOldActiveCuts_ = baseModel->numberOldActiveCuts_; |
---|
1409 | cutModifier_ = NULL; |
---|
1410 | assert (!analyzeResults_); |
---|
1411 | CbcThread * stuff = reinterpret_cast<CbcThread *> (masterThread_); |
---|
1412 | assert (stuff); |
---|
1413 | //if (stuff) |
---|
1414 | stuff->setCreatedNode(NULL); |
---|
1415 | // ?? searchStrategy_; |
---|
1416 | searchStrategy_ = baseModel->searchStrategy_; |
---|
1417 | stuff->saveStuff()[0] = searchStrategy_; |
---|
1418 | stateOfSearch_ = baseModel->stateOfSearch_; |
---|
1419 | stuff->saveStuff()[1] = stateOfSearch_; |
---|
1420 | for (int iObject = 0 ; iObject < numberObjects_ ; iObject++) { |
---|
1421 | CbcSimpleIntegerDynamicPseudoCost * dynamicObject = |
---|
1422 | dynamic_cast <CbcSimpleIntegerDynamicPseudoCost *>(object_[iObject]) ; |
---|
1423 | if (dynamicObject) { |
---|
1424 | CbcSimpleIntegerDynamicPseudoCost * baseObject = |
---|
1425 | dynamic_cast <CbcSimpleIntegerDynamicPseudoCost *>(baseModel->object_[iObject]) ; |
---|
1426 | assert (baseObject); |
---|
1427 | dynamicObject->copySome(baseObject); |
---|
1428 | } |
---|
1429 | } |
---|
1430 | } else if (mode == 1) { |
---|
1431 | lockThread(); |
---|
1432 | CbcThread * stuff = reinterpret_cast<CbcThread *> (masterThread_); |
---|
1433 | assert (stuff); |
---|
1434 | //stateOfSearch_ |
---|
1435 | if (stuff->saveStuff()[0] != searchStrategy_) { |
---|
1436 | #ifdef COIN_DEVELOP |
---|
1437 | printf("changing searchStrategy from %d to %d\n", |
---|
1438 | baseModel->searchStrategy_, searchStrategy_); |
---|
1439 | #endif |
---|
1440 | baseModel->searchStrategy_ = searchStrategy_; |
---|
1441 | } |
---|
1442 | if (stuff->saveStuff()[1] != stateOfSearch_) { |
---|
1443 | #ifdef COIN_DEVELOP |
---|
1444 | printf("changing stateOfSearch from %d to %d\n", |
---|
1445 | baseModel->stateOfSearch_, stateOfSearch_); |
---|
1446 | #endif |
---|
1447 | baseModel->stateOfSearch_ = stateOfSearch_; |
---|
1448 | } |
---|
1449 | if (numberUpdateItems_) { |
---|
1450 | for (int i = 0; i < numberUpdateItems_; i++) { |
---|
1451 | CbcObjectUpdateData * update = updateItems_ + i; |
---|
1452 | int objectNumber = update->objectNumber_; |
---|
1453 | CbcObject * object = dynamic_cast<CbcObject *> (baseModel->object_[objectNumber]); |
---|
1454 | if (object) |
---|
1455 | object->updateInformation(*update); |
---|
1456 | } |
---|
1457 | numberUpdateItems_ = 0; |
---|
1458 | } |
---|
1459 | if (eventHappened_) |
---|
1460 | baseModel->eventHappened_ = true; |
---|
1461 | baseModel->numberNodes_++; |
---|
1462 | baseModel->numberIterations_ += |
---|
1463 | numberIterations_ - numberFixedAtRoot_; |
---|
1464 | baseModel->numberSolves_ += numberSolves_; |
---|
1465 | if (stuff->node()) |
---|
1466 | baseModel->tree_->push(stuff->node()); |
---|
1467 | if (stuff->createdNode()) |
---|
1468 | baseModel->tree_->push(stuff->createdNode()); |
---|
1469 | unlockThread(); |
---|
1470 | } else if (mode == 2) { |
---|
1471 | baseModel->sumChangeObjective1_ += sumChangeObjective1_; |
---|
1472 | baseModel->sumChangeObjective2_ += sumChangeObjective2_; |
---|
1473 | //baseModel->numberIterations_ += numberIterations_; |
---|
1474 | for (int iGenerator = 0; iGenerator < numberCutGenerators_; iGenerator++) { |
---|
1475 | CbcCutGenerator * generator = baseModel->generator_[iGenerator]; |
---|
1476 | CbcCutGenerator * generator2 = generator_[iGenerator]; |
---|
1477 | generator->incrementNumberTimesEntered(generator2->numberTimesEntered()); |
---|
1478 | generator->incrementNumberCutsInTotal(generator2->numberCutsInTotal()); |
---|
1479 | generator->incrementNumberCutsActive(generator2->numberCutsActive()); |
---|
1480 | generator->incrementTimeInCutGenerator(generator2->timeInCutGenerator()); |
---|
1481 | } |
---|
1482 | if (parallelMode() >= 0) |
---|
1483 | nodeCompare_ = NULL; |
---|
1484 | baseModel->maximumDepthActual_ = CoinMax(baseModel->maximumDepthActual_, maximumDepthActual_); |
---|
1485 | baseModel->numberDJFixed_ += numberDJFixed_; |
---|
1486 | baseModel->numberStrongIterations_ += numberStrongIterations_; |
---|
1487 | int i; |
---|
1488 | for (i = 0; i < 3; i++) |
---|
1489 | baseModel->strongInfo_[i] += strongInfo_[i]; |
---|
1490 | if (parallelMode() >= 0) { |
---|
1491 | walkback_ = NULL; |
---|
1492 | lastNodeInfo_ = NULL; |
---|
1493 | lastNumberCuts_ = NULL; |
---|
1494 | lastCut_ = NULL; |
---|
1495 | //addedCuts_ = NULL; |
---|
1496 | tree_ = NULL; |
---|
1497 | } |
---|
1498 | eventHandler_ = NULL; |
---|
1499 | delete solverCharacteristics_; |
---|
1500 | solverCharacteristics_ = NULL; |
---|
1501 | bool newMethod = (baseModel->branchingMethod_ && baseModel->branchingMethod_->chooseMethod()); |
---|
1502 | if (newMethod) { |
---|
1503 | // new method - we were using base models |
---|
1504 | numberObjects_ = 0; |
---|
1505 | object_ = NULL; |
---|
1506 | } |
---|
1507 | } else if (mode == -1) { |
---|
1508 | delete eventHandler_; |
---|
1509 | eventHandler_ = baseModel->eventHandler_; |
---|
1510 | assert (!statistics_); |
---|
1511 | assert(baseModel->solverCharacteristics_); |
---|
1512 | solverCharacteristics_ = new OsiBabSolver (*baseModel->solverCharacteristics_); |
---|
1513 | solverCharacteristics_->setSolver(solver_); |
---|
1514 | setMaximumNodes(COIN_INT_MAX); |
---|
1515 | if (parallelMode() >= 0) { |
---|
1516 | delete [] walkback_; |
---|
1517 | //delete [] addedCuts_; |
---|
1518 | walkback_ = NULL; |
---|
1519 | //addedCuts_ = NULL; |
---|
1520 | delete [] lastNodeInfo_ ; |
---|
1521 | lastNodeInfo_ = NULL; |
---|
1522 | delete [] lastNumberCuts_ ; |
---|
1523 | lastNumberCuts_ = NULL; |
---|
1524 | delete [] lastCut_ ; |
---|
1525 | lastCut_ = NULL; |
---|
1526 | delete tree_; |
---|
1527 | tree_ = NULL; |
---|
1528 | delete nodeCompare_; |
---|
1529 | nodeCompare_ = NULL; |
---|
1530 | } else { |
---|
1531 | delete tree_; |
---|
1532 | tree_ = new CbcTree(); |
---|
1533 | tree_->setComparison(*nodeCompare_) ; |
---|
1534 | } |
---|
1535 | continuousSolver_ = baseModel->continuousSolver_->clone(); |
---|
1536 | bool newMethod = (baseModel->branchingMethod_ && baseModel->branchingMethod_->chooseMethod()); |
---|
1537 | if (newMethod) { |
---|
1538 | // new method uses solver - but point to base model |
---|
1539 | // We may update an object in wrong order - shouldn't matter? |
---|
1540 | numberObjects_ = baseModel->numberObjects_; |
---|
1541 | if (parallelMode() >= 0) { |
---|
1542 | object_ = baseModel->object_; |
---|
1543 | } else { |
---|
1544 | printf("*****WARNING - fix testosi option\n"); |
---|
1545 | object_ = baseModel->object_; |
---|
1546 | } |
---|
1547 | } |
---|
1548 | int i; |
---|
1549 | for (i = 0; i < numberHeuristics_; i++) { |
---|
1550 | delete heuristic_[i]; |
---|
1551 | heuristic_[i] = baseModel->heuristic_[i]->clone(); |
---|
1552 | heuristic_[i]->setModelOnly(this); |
---|
1553 | } |
---|
1554 | for (i = 0; i < numberCutGenerators_; i++) { |
---|
1555 | delete generator_[i]; |
---|
1556 | generator_[i] = new CbcCutGenerator(*baseModel->generator_[i]); |
---|
1557 | // refreshModel was overkill as thought too many rows |
---|
1558 | generator_[i]->setModel(this); |
---|
1559 | } |
---|
1560 | } else if (mode == 10) { |
---|
1561 | setCutoff(baseModel->getCutoff()); |
---|
1562 | bestObjective_ = baseModel->bestObjective_; |
---|
1563 | assert (!baseModel->globalCuts_.sizeRowCuts()); |
---|
1564 | numberSolutions_ = baseModel->numberSolutions_; |
---|
1565 | assert (usedInSolution_); |
---|
1566 | assert (baseModel->usedInSolution_); |
---|
1567 | memcpy(usedInSolution_, baseModel->usedInSolution_, solver_->getNumCols()*sizeof(int)); |
---|
1568 | stateOfSearch_ = baseModel->stateOfSearch_; |
---|
1569 | //numberNodes_ = baseModel->numberNodes_; |
---|
1570 | //numberIterations_ = baseModel->numberIterations_; |
---|
1571 | //numberFixedAtRoot_ = numberIterations_; // for statistics |
---|
1572 | phase_ = baseModel->phase_; |
---|
1573 | assert (!nextRowCut_); |
---|
1574 | delete nodeCompare_; |
---|
1575 | nodeCompare_ = baseModel->nodeCompare_->clone(); |
---|
1576 | tree_->setComparison(*nodeCompare_) ; |
---|
1577 | assert (!subTreeModel_); |
---|
1578 | //branchingMethod_ = NULL; // need something but what |
---|
1579 | numberOldActiveCuts_ = baseModel->numberOldActiveCuts_; |
---|
1580 | cutModifier_ = NULL; |
---|
1581 | assert (!analyzeResults_); |
---|
1582 | CbcThread * stuff = reinterpret_cast<CbcThread *> (masterThread_); |
---|
1583 | assert (stuff); |
---|
1584 | //if (stuff) |
---|
1585 | stuff->setCreatedNode(NULL); |
---|
1586 | // ?? searchStrategy_; |
---|
1587 | searchStrategy_ = baseModel->searchStrategy_; |
---|
1588 | stuff->saveStuff()[0] = searchStrategy_; |
---|
1589 | stateOfSearch_ = baseModel->stateOfSearch_; |
---|
1590 | stuff->saveStuff()[1] = stateOfSearch_; |
---|
1591 | OsiObject ** baseObject = baseModel->object_; |
---|
1592 | for (int iObject = 0 ; iObject < numberObjects_ ; iObject++) { |
---|
1593 | object_[iObject]->updateBefore(baseObject[iObject]); |
---|
1594 | } |
---|
1595 | //delete [] stuff->nodeCount; |
---|
1596 | //stuff->nodeCount = new int [baseModel->maximumDepth_+1]; |
---|
1597 | } else if (mode == 11) { |
---|
1598 | if (parallelMode() < 0) { |
---|
1599 | // from deterministic |
---|
1600 | CbcThread * stuff = reinterpret_cast<CbcThread *> (masterThread_); |
---|
1601 | assert (stuff); |
---|
1602 | // Move solution etc |
---|
1603 | // might as well mark all including continuous |
---|
1604 | int numberColumns = solver_->getNumCols(); |
---|
1605 | for (int i = 0; i < numberColumns; i++) { |
---|
1606 | baseModel->usedInSolution_[i] += usedInSolution_[i]; |
---|
1607 | //usedInSolution_[i]=0; |
---|
1608 | } |
---|
1609 | baseModel->numberSolutions_ += numberSolutions_; |
---|
1610 | if (bestObjective_ < baseModel->bestObjective_ && bestObjective_ < baseModel->getCutoff()) { |
---|
1611 | baseModel->bestObjective_ = bestObjective_ ; |
---|
1612 | int numberColumns = solver_->getNumCols(); |
---|
1613 | if (!baseModel->bestSolution_) |
---|
1614 | baseModel->bestSolution_ = new double[numberColumns]; |
---|
1615 | CoinCopyN(bestSolution_, numberColumns, baseModel->bestSolution_); |
---|
1616 | baseModel->setCutoff(getCutoff()); |
---|
1617 | } |
---|
1618 | //stateOfSearch_ |
---|
1619 | if (stuff->saveStuff()[0] != searchStrategy_) { |
---|
1620 | #ifdef COIN_DEVELOP |
---|
1621 | printf("changing searchStrategy from %d to %d\n", |
---|
1622 | baseModel->searchStrategy_, searchStrategy_); |
---|
1623 | #endif |
---|
1624 | baseModel->searchStrategy_ = searchStrategy_; |
---|
1625 | } |
---|
1626 | if (stuff->saveStuff()[1] != stateOfSearch_) { |
---|
1627 | #ifdef COIN_DEVELOP |
---|
1628 | printf("changing stateOfSearch from %d to %d\n", |
---|
1629 | baseModel->stateOfSearch_, stateOfSearch_); |
---|
1630 | #endif |
---|
1631 | baseModel->stateOfSearch_ = stateOfSearch_; |
---|
1632 | } |
---|
1633 | int i; |
---|
1634 | if (eventHappened_) |
---|
1635 | baseModel->eventHappened_ = true; |
---|
1636 | baseModel->numberNodes_ += stuff->nodesThisTime(); |
---|
1637 | baseModel->numberIterations_ += stuff->iterationsThisTime(); |
---|
1638 | double cutoff = baseModel->getCutoff(); |
---|
1639 | while (!tree_->empty()) { |
---|
1640 | CbcNode * node = tree_->bestNode(COIN_DBL_MAX) ; |
---|
1641 | if (node->objectiveValue() < cutoff) { |
---|
1642 | assert(node->nodeInfo()); |
---|
1643 | // Make node join correctly |
---|
1644 | OsiBranchingObject * bobj = node->modifiableBranchingObject(); |
---|
1645 | CbcBranchingObject * cbcobj = dynamic_cast<CbcBranchingObject *> (bobj); |
---|
1646 | if (cbcobj) { |
---|
1647 | CbcObject * object = cbcobj->object(); |
---|
1648 | assert (object); |
---|
1649 | int position = object->position(); |
---|
1650 | assert (position >= 0); |
---|
1651 | assert (object_[position] == object); |
---|
1652 | CbcObject * objectNew = |
---|
1653 | dynamic_cast<CbcObject *> (baseModel->object_[position]); |
---|
1654 | cbcobj->setOriginalObject(objectNew); |
---|
1655 | } |
---|
1656 | baseModel->tree_->push(node); |
---|
1657 | } else { |
---|
1658 | delete node; |
---|
1659 | } |
---|
1660 | } |
---|
1661 | for (i = 0; i < stuff->nDeleteNode(); i++) { |
---|
1662 | //printf("CbcNode %x stuff delete\n",stuff->delNode[i]); |
---|
1663 | delete stuff->delNode()[i]; |
---|
1664 | } |
---|
1665 | } |
---|
1666 | } else { |
---|
1667 | abort(); |
---|
1668 | } |
---|
1669 | } |
---|
1670 | // Generate one round of cuts - parallel mode |
---|
1671 | int |
---|
1672 | CbcModel::parallelCuts(CbcBaseModel * master, OsiCuts & theseCuts, |
---|
1673 | CbcNode * /*node*/, OsiCuts & slackCuts, int lastNumberCuts) |
---|
1674 | { |
---|
1675 | /* |
---|
1676 | Is it time to scan the cuts in order to remove redundant cuts? If so, set |
---|
1677 | up to do it. |
---|
1678 | */ |
---|
1679 | int fullScan = 0 ; |
---|
1680 | if ((numberNodes_ % SCANCUTS) == 0 || (specialOptions_&256) != 0) { |
---|
1681 | fullScan = 1 ; |
---|
1682 | if (!numberNodes_ || (specialOptions_&256) != 0) |
---|
1683 | fullScan = 2; |
---|
1684 | specialOptions_ &= ~256; // mark as full scan done |
---|
1685 | } |
---|
1686 | // do cuts independently |
---|
1687 | OsiCuts * eachCuts = new OsiCuts [numberCutGenerators_];; |
---|
1688 | int i; |
---|
1689 | assert (master); |
---|
1690 | for (i = 0; i < numberThreads_; i++) { |
---|
1691 | // set solver here after cloning |
---|
1692 | master->model(i)->solver_ = solver_->clone(); |
---|
1693 | master->model(i)->numberNodes_ = (fullScan) ? 1 : 0; |
---|
1694 | } |
---|
1695 | // generate cuts |
---|
1696 | int status = 0; |
---|
1697 | const OsiRowCutDebugger * debugger = NULL; |
---|
1698 | bool onOptimalPath = false; |
---|
1699 | for (i = 0; i < numberCutGenerators_; i++) { |
---|
1700 | bool generate = generator_[i]->normal(); |
---|
1701 | // skip if not optimal and should be (maybe a cut generator has fixed variables) |
---|
1702 | if (generator_[i]->needsOptimalBasis() && !solver_->basisIsAvailable()) |
---|
1703 | generate = false; |
---|
1704 | if (generator_[i]->switchedOff()) |
---|
1705 | generate = false;; |
---|
1706 | if (generate) { |
---|
1707 | master->waitForThreadsInCuts(0, eachCuts + i, i); |
---|
1708 | } |
---|
1709 | } |
---|
1710 | // wait |
---|
1711 | master->waitForThreadsInCuts(1, eachCuts, 0); |
---|
1712 | // Now put together |
---|
1713 | for (i = 0; i < numberCutGenerators_; i++) { |
---|
1714 | // add column cuts |
---|
1715 | int numberColumnCutsBefore = theseCuts.sizeColCuts() ; |
---|
1716 | int numberColumnCuts = eachCuts[i].sizeColCuts(); |
---|
1717 | int numberColumnCutsAfter = numberColumnCutsBefore |
---|
1718 | + numberColumnCuts; |
---|
1719 | int j; |
---|
1720 | for (j = 0; j < numberColumnCuts; j++) { |
---|
1721 | theseCuts.insert(eachCuts[i].colCut(j)); |
---|
1722 | } |
---|
1723 | int numberRowCutsBefore = theseCuts.sizeRowCuts() ; |
---|
1724 | int numberRowCuts = eachCuts[i].sizeRowCuts(); |
---|
1725 | // insert good cuts |
---|
1726 | if (numberRowCuts) { |
---|
1727 | int n = numberRowCuts; |
---|
1728 | numberRowCuts = 0; |
---|
1729 | for (j = 0; j < n; j++) { |
---|
1730 | const OsiRowCut * thisCut = eachCuts[i].rowCutPtr(j) ; |
---|
1731 | if (thisCut->lb() <= 1.0e10 && thisCut->ub() >= -1.0e10) { |
---|
1732 | theseCuts.insert(eachCuts[i].rowCut(j)); |
---|
1733 | numberRowCuts++; |
---|
1734 | } |
---|
1735 | } |
---|
1736 | if (generator_[i]->mustCallAgain() && status >= 0) |
---|
1737 | status = 1; // say must go round |
---|
1738 | } |
---|
1739 | int numberRowCutsAfter = numberRowCutsBefore |
---|
1740 | + numberRowCuts; |
---|
1741 | if (numberRowCuts) { |
---|
1742 | // Check last cut to see if infeasible |
---|
1743 | const OsiRowCut * thisCut = theseCuts.rowCutPtr(numberRowCutsAfter - 1) ; |
---|
1744 | if (thisCut->lb() > thisCut->ub()) { |
---|
1745 | status = -1; // sub-problem is infeasible |
---|
1746 | break; |
---|
1747 | } |
---|
1748 | } |
---|
1749 | #ifdef CBC_DEBUG |
---|
1750 | { |
---|
1751 | int k ; |
---|
1752 | for (k = numberRowCutsBefore; k < numberRowCutsAfter; k++) { |
---|
1753 | OsiRowCut thisCut = theseCuts.rowCut(k) ; |
---|
1754 | /* check size of elements. |
---|
1755 | We can allow smaller but this helps debug generators as it |
---|
1756 | is unsafe to have small elements */ |
---|
1757 | int n = thisCut.row().getNumElements(); |
---|
1758 | const int * column = thisCut.row().getIndices(); |
---|
1759 | const double * element = thisCut.row().getElements(); |
---|
1760 | //assert (n); |
---|
1761 | for (int i = 0; i < n; i++) { |
---|
1762 | double value = element[i]; |
---|
1763 | assert(fabs(value) > 1.0e-12 && fabs(value) < 1.0e20); |
---|
1764 | } |
---|
1765 | } |
---|
1766 | } |
---|
1767 | #endif |
---|
1768 | if ((specialOptions_&1) != 0) { |
---|
1769 | if (onOptimalPath) { |
---|
1770 | int k ; |
---|
1771 | for (k = numberRowCutsBefore; k < numberRowCutsAfter; k++) { |
---|
1772 | OsiRowCut thisCut = theseCuts.rowCut(k) ; |
---|
1773 | if (debugger->invalidCut(thisCut)) { |
---|
1774 | solver_->getRowCutDebuggerAlways()->printOptimalSolution(*solver_); |
---|
1775 | solver_->writeMpsNative("badCut.mps", NULL, NULL, 2); |
---|
1776 | #ifdef NDEBUG |
---|
1777 | printf("Cut generator %d (%s) produced invalid cut (%dth in this go)\n", |
---|
1778 | i, generator_[i]->cutGeneratorName(), k - numberRowCutsBefore); |
---|
1779 | const double *lower = getColLower() ; |
---|
1780 | const double *upper = getColUpper() ; |
---|
1781 | int numberColumns = solver_->getNumCols(); |
---|
1782 | for (int i = 0; i < numberColumns; i++) |
---|
1783 | printf("%d bounds %g,%g\n", i, lower[i], upper[i]); |
---|
1784 | abort(); |
---|
1785 | #endif |
---|
1786 | } |
---|
1787 | assert(!debugger->invalidCut(thisCut)) ; |
---|
1788 | } |
---|
1789 | } |
---|
1790 | } |
---|
1791 | /* |
---|
1792 | The cut generator has done its thing, and maybe it generated some |
---|
1793 | cuts. Do a bit of bookkeeping: load |
---|
1794 | whichGenerator[i] with the index of the generator responsible for a cut, |
---|
1795 | and place cuts flagged as global in the global cut pool for the model. |
---|
1796 | |
---|
1797 | lastNumberCuts is the sum of cuts added in previous iterations; it's the |
---|
1798 | offset to the proper starting position in whichGenerator. |
---|
1799 | */ |
---|
1800 | int numberBefore = |
---|
1801 | numberRowCutsBefore + numberColumnCutsBefore + lastNumberCuts ; |
---|
1802 | int numberAfter = |
---|
1803 | numberRowCutsAfter + numberColumnCutsAfter + lastNumberCuts ; |
---|
1804 | // possibly extend whichGenerator |
---|
1805 | resizeWhichGenerator(numberBefore, numberAfter); |
---|
1806 | |
---|
1807 | for (j = numberRowCutsBefore; j < numberRowCutsAfter; j++) { |
---|
1808 | whichGenerator_[numberBefore++] = i ; |
---|
1809 | const OsiRowCut * thisCut = theseCuts.rowCutPtr(j) ; |
---|
1810 | if (thisCut->lb() > thisCut->ub()) |
---|
1811 | status = -1; // sub-problem is infeasible |
---|
1812 | if (thisCut->globallyValid()) { |
---|
1813 | // add to global list |
---|
1814 | OsiRowCut newCut(*thisCut); |
---|
1815 | newCut.setGloballyValid(true); |
---|
1816 | newCut.mutableRow().setTestForDuplicateIndex(false); |
---|
1817 | globalCuts_.insert(newCut) ; |
---|
1818 | } |
---|
1819 | } |
---|
1820 | for (j = numberColumnCutsBefore; j < numberColumnCutsAfter; j++) { |
---|
1821 | //whichGenerator_[numberBefore++] = i ; |
---|
1822 | const OsiColCut * thisCut = theseCuts.colCutPtr(j) ; |
---|
1823 | if (thisCut->globallyValid()) { |
---|
1824 | // add to global list |
---|
1825 | OsiColCut newCut(*thisCut); |
---|
1826 | newCut.setGloballyValid(true); |
---|
1827 | globalCuts_.insert(newCut) ; |
---|
1828 | } |
---|
1829 | } |
---|
1830 | } |
---|
1831 | // Add in any violated saved cuts |
---|
1832 | if (!theseCuts.sizeRowCuts() && !theseCuts.sizeColCuts()) { |
---|
1833 | int numberOld = theseCuts.sizeRowCuts() + lastNumberCuts; |
---|
1834 | int numberCuts = slackCuts.sizeRowCuts() ; |
---|
1835 | int i; |
---|
1836 | // possibly extend whichGenerator |
---|
1837 | resizeWhichGenerator(numberOld, numberOld + numberCuts); |
---|
1838 | double primalTolerance; |
---|
1839 | solver_->getDblParam(OsiPrimalTolerance, primalTolerance) ; |
---|
1840 | for ( i = 0; i < numberCuts; i++) { |
---|
1841 | const OsiRowCut * thisCut = slackCuts.rowCutPtr(i) ; |
---|
1842 | if (thisCut->violated(cbcColSolution_) > 100.0*primalTolerance) { |
---|
1843 | if (messageHandler()->logLevel() > 2) |
---|
1844 | printf("Old cut added - violation %g\n", |
---|
1845 | thisCut->violated(cbcColSolution_)) ; |
---|
1846 | whichGenerator_[numberOld++] = -1; |
---|
1847 | theseCuts.insert(*thisCut) ; |
---|
1848 | } |
---|
1849 | } |
---|
1850 | } |
---|
1851 | delete [] eachCuts; |
---|
1852 | return status; |
---|
1853 | } |
---|
1854 | /* |
---|
1855 | Locks a thread if parallel so that stuff like cut pool |
---|
1856 | can be updated and/or used. |
---|
1857 | */ |
---|
1858 | void |
---|
1859 | CbcModel::lockThread() |
---|
1860 | { |
---|
1861 | if (masterThread_ && (threadMode_&1) == 0) |
---|
1862 | masterThread_->lockThread(); |
---|
1863 | } |
---|
1864 | /* |
---|
1865 | Unlocks a thread if parallel |
---|
1866 | */ |
---|
1867 | void |
---|
1868 | CbcModel::unlockThread() |
---|
1869 | { |
---|
1870 | if (masterThread_ && (threadMode_&1) == 0) |
---|
1871 | masterThread_->unlockThread(); |
---|
1872 | } |
---|
1873 | // Returns true if locked |
---|
1874 | bool |
---|
1875 | CbcModel::isLocked() const |
---|
1876 | { |
---|
1877 | if (masterThread_) { |
---|
1878 | return (masterThread_->locked()); |
---|
1879 | } else { |
---|
1880 | return true; |
---|
1881 | } |
---|
1882 | } |
---|
1883 | // Stop a child |
---|
1884 | void |
---|
1885 | CbcModel::setInfoInChild(int type, CbcThread * info) |
---|
1886 | { |
---|
1887 | if (type == -3) { |
---|
1888 | // set up |
---|
1889 | masterThread_ = info; |
---|
1890 | } else if (type == -2) { |
---|
1891 | numberThreads_ = 0; // signal to stop |
---|
1892 | } else { |
---|
1893 | // make sure message handler will be deleted |
---|
1894 | defaultHandler_ = true; |
---|
1895 | ownObjects_ = false; |
---|
1896 | delete solverCharacteristics_; |
---|
1897 | solverCharacteristics_ = NULL; |
---|
1898 | if (type >= 0) { |
---|
1899 | delete [] object_; // may be able to when all over to CbcThread |
---|
1900 | for (int i = 0; i < numberCutGenerators_; i++) { |
---|
1901 | delete generator_[i]; |
---|
1902 | generator_[i] = NULL; |
---|
1903 | //delete virginGenerator_[i]; |
---|
1904 | //virginGenerator_[i]=NULL; |
---|
1905 | } |
---|
1906 | //generator_[0] = NULL; |
---|
1907 | //delete [] generator_; |
---|
1908 | //generator_ = NULL; |
---|
1909 | numberCutGenerators_ = 0; |
---|
1910 | } else { |
---|
1911 | for (int i = 0; i < numberCutGenerators_; i++) { |
---|
1912 | generator_[i] = NULL; |
---|
1913 | } |
---|
1914 | } |
---|
1915 | object_ = NULL; |
---|
1916 | } |
---|
1917 | } |
---|
1918 | |
---|
1919 | /// Indicates whether Cbc library has been compiled with multithreading support |
---|
1920 | bool CbcModel::haveMultiThreadSupport() { return true; } |
---|
1921 | |
---|
1922 | #else |
---|
1923 | // Default constructor |
---|
1924 | CbcBaseModel::CbcBaseModel() {} |
---|
1925 | |
---|
1926 | bool CbcModel::haveMultiThreadSupport() { return false; } |
---|
1927 | #endif |
---|
1928 | |
---|