path.hh gecode/search.hh gecode/search/support.hh gecode/search/worker.hh gecode/search/meta/nogoods.hh /usr/include/gecode/search/parallel/engine.hh gecode/support/cast.hpp gecode/search/cutoff.hpp gecode/kernel/brancher-val-sel-commit.hpp gecode/support/static-stack.hpp gecode/kernel/var-imp.hpp gecode/support/random.hpp limits gecode/kernel/var.hpp gecode/support/thread/none.hpp iterator gecode/support/timer.hpp gecode/support/thread/thread.hpp gecode/kernel/brancher-val-commit.hpp gecode/kernel/afc.hpp gecode/kernel/var-type.hpp gecode/support/hw-rnd.hpp cmath cassert gecode/kernel/brancher-view-sel.hpp gecode/kernel/allocators.hpp gecode/search.hh cstdarg gecode/support/bitset-base.hpp gecode/kernel/shared-array.hpp gecode/kernel/modevent.hpp gecode/search/bab.hpp gecode/kernel/memory-config.hpp gecode/support/int-type.hpp gecode/support/exception.hpp exception gecode/search/stop.hpp gecode/kernel/region.hpp gecode/support/marked-pointer.hpp gecode/support/thread.hpp gecode/kernel.hh gecode/kernel/branch-traits.hpp gecode/kernel/array.hpp gecode/kernel/branch-val.hpp gecode/search/dfs.hpp gecode/support/dynamic-stack.hpp gecode/kernel/archive.hpp gecode/kernel/range-list.hpp gecode/search/options.hpp gecode/kernel/brancher-merit.hpp gecode/support/config.hpp gecode/search/worker.hh gecode/kernel/branch-var.hpp gecode/kernel/memory-manager.hpp gecode/support/dynamic-queue.hpp gecode/kernel/macros.hpp /usr/include/gecode/search/parallel/path.hh ctime vector gecode/search/meta/rbs.hh gecode/kernel/advisor.hpp gecode/kernel/brancher-view-val.hpp sstream gecode/kernel/brancher-val-sel.hpp gecode/kernel/propagator.hpp gecode/support/block-allocator.hpp gecode/search/engine-base.hpp gecode/search/rbs.hpp gecode/kernel/activity.hpp cstdlib gecode/support/bitset.hpp gecode/support/auto-link.hpp iostream gecode/kernel/exception.hpp gecode/search/meta/nogoods.hh gecode/support/macros.hpp gecode/kernel/view.hpp gecode/kernel/branch-tiebreak.hpp cstddef climits gecode/search/exception.hpp gecode/kernel/core.hpp gecode/support.hh gecode/search/statistics.hpp gecode/support/dynamic-array.hpp gecode/support/sort.hpp gecode/kernel/rnd.hpp algorithm gecode/kernel/brancher-view.hpp gecode/kernel/global-afc.hpp gecode/search/support.hh cstring gecode/support/bitset-offset.hpp gecode/support/heap.hpp /usr/include/gecode/search/parallel/dfs.hh /usr/include/gecode/search/parallel/path.hh /usr/include/gecode/search/parallel/bab.hh /usr/include/gecode/search/parallel/engine.hh Gecode::Search::Parallel::Path Gecode::Search::Parallel::Path::Edge Gecode Gecode::Search Gecode::Search::Parallel /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2003 * *Lastmodified: *$Date:2013-07-1218:20:11+0200(Fri,12Jul2013)$by$Author:schulte$ *$Revision:13877$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ #ifndef__GECODE_SEARCH_PARALLEL_PATH_HH__ #define__GECODE_SEARCH_PARALLEL_PATH_HH__ #include<gecode/search.hh> #include<gecode/search/support.hh> #include<gecode/search/worker.hh> #include<gecode/search/meta/nogoods.hh> namespaceGecode{namespaceSearch{namespaceParallel{ classPath:publicNoGoods{ friendclassSearch::Meta::NoGoodsProp; public: classEdge{ protected: Space*_space; unsignedint_alt; unsignedint_alt_max; constChoice*_choice; public: Edge(void); Edge(Space*s,Space*c); Space*space(void)const; voidspace(Space*s); constChoice*choice(void)const; unsignedintalt(void)const; unsignedinttruealt(void)const; boolrightmost(void)const; boollao(void)const; boolwork(void)const; voidnext(void); unsignedintsteal(void); voiddispose(void); }; protected: Support::DynamicStack<Edge,Heap>ds; int_ngdl; unsignedintn_work; public: Path(intl); intngdl(void)const; voidngdl(intl); constChoice*push(Worker&stat,Space*s,Space*c); boolnext(void); Edge&top(void)const; boolempty(void)const; intlc(void)const; voidunwind(intl); voidcommit(Space*s,inti)const; Space*recompute(unsignedint&d,unsignedinta_d,Worker&s); Space*recompute(unsignedint&d,unsignedinta_d,Worker&s, constSpace*best,int&mark); intentries(void)const; voidreset(intl); boolsteal(void)const; Space*steal(Worker&stat,unsignedlongint&d); voidvirtualpost(Space&home); }; /* *Edgeforrecomputation * */ forceinline Path::Edge::Edge(void){} forceinline Path::Edge::Edge(Space*s,Space*c) :_space(c),_alt(0),_choice(s->choice()){ _alt_max=_choice->alternatives()-1; } forceinlineSpace* Path::Edge::space(void)const{ return_space; } forceinlinevoid Path::Edge::space(Space*s){ _space=s; } forceinlineunsignedint Path::Edge::alt(void)const{ return_alt; } forceinlineunsignedint Path::Edge::truealt(void)const{ assert(_alt<_choice->alternatives()); return_alt; } forceinlinebool Path::Edge::rightmost(void)const{ return_alt>=_alt_max; } forceinlinebool Path::Edge::lao(void)const{ return_alt>_alt_max; } forceinlinebool Path::Edge::work(void)const{ return_alt<_alt_max; } forceinlinevoid Path::Edge::next(void){ _alt++; } forceinlineunsignedint Path::Edge::steal(void){ assert(work()); return_alt_max--; } forceinlineconstChoice* Path::Edge::choice(void)const{ return_choice; } forceinlinevoid Path::Edge::dispose(void){ delete_space; delete_choice; } /* *Depth-firststackwithrecomputation * */ forceinline Path::Path(intl) :ds(heap),_ngdl(l),n_work(0){} forceinlineint Path::ngdl(void)const{ return_ngdl; } forceinlinevoid Path::ngdl(intl){ _ngdl=l; } forceinlineconstChoice* Path::push(Worker&stat,Space*s,Space*c){ if(!ds.empty()&&ds.top().lao()){ //TopmoststackentrywasLAO->reuse ds.pop().dispose(); } Edgesn(s,c); if(sn.work()) n_work++; ds.push(sn); stat.stack_depth(static_cast<unsignedlongint>(ds.entries())); returnsn.choice(); } forceinlinebool Path::next(void){ while(!ds.empty()) if(ds.top().rightmost()){ ds.pop().dispose(); }else{ assert(ds.top().work()); ds.top().next(); if(!ds.top().work()) n_work--; returntrue; } returnfalse; } forceinlinePath::Edge& Path::top(void)const{ assert(!ds.empty()); returnds.top(); } forceinlinebool Path::empty(void)const{ returnds.empty(); } forceinlinevoid Path::commit(Space*s,inti)const{ constEdge&n=ds[i]; s->commit(*n.choice(),n.alt()); } forceinlineint Path::lc(void)const{ intl=ds.entries()-1; while(ds[l].space()==NULL) l--; returnl; } forceinlineint Path::entries(void)const{ returnds.entries(); } forceinlinevoid Path::unwind(intl){ assert((ds[l].space()==NULL)||ds[l].space()->failed()); intn=ds.entries(); for(inti=l;i<n;i++){ if(ds.top().work()) n_work--; ds.pop().dispose(); } assert(ds.entries()==l); } forceinlinevoid Path::reset(intl){ n_work=0; while(!ds.empty()) ds.pop().dispose(); _ngdl=l; } forceinlinebool Path::steal(void)const{ returnn_work>Config::steal_limit; } forceinlineSpace* Path::steal(Worker&stat,unsignedlongint&d){ //Findpositiontosteal:leavesufficientwork intn=ds.entries()-1; unsignedintw=0; while(n>=0){ if(ds[n].work()) w++; if(w>Config::steal_limit){ //Okay,thereissufficientworkleft intl=n; //Findlastcopy while(ds[l].space()==NULL) l--; Space*c=ds[l].space()->clone(false); //Recompute,ifnecessary for(inti=l;i<n;i++) commit(c,i); c->commit(*ds[n].choice(),ds[n].steal()); if(!ds[n].work()) n_work--; //Nono-goodscanbeextractedaboven ngdl(std::min(ngdl(),n)); d=stat.steal_depth(static_cast<unsignedlongint>(n+1)); returnc; } n--; } returnNULL; } forceinlineSpace* Path::recompute(unsignedint&d,unsignedinta_d,Worker&stat){ assert(!ds.empty()); //Recomputespaceaccordingtopath //Alsosaydistancetocopy(d==0)requiresimmediatecopying //CheckforLAO if((ds.top().space()!=NULL)&&ds.top().rightmost()){ Space*s=ds.top().space(); s->commit(*ds.top().choice(),ds.top().alt()); assert(ds.entries()-1==lc()); ds.top().space(NULL); //Markasreusable if(ds.entries()>ngdl()) ds.top().next(); d=0; returns; } //Generalcaseforrecomputation intl=lc();//Positionoflastclone intn=ds.entries();//Numberofstackentries //Newdistance,ifnoadaptiverecomputation d=static_cast<unsignedint>(n-l); Space*s=ds[l].space()->clone();//Lastclone if(d<a_d){ //Noadaptiverecomputation for(inti=l;i<n;i++) commit(s,i); }else{ intm=l+static_cast<int>(d>>1);//Middlebetweencopyandtop inti=l;//Toiterateoverallentries //Recomputeuptomiddle for(;i<m;i++) commit(s,i); //Skipoverallrightmostbranches for(;(i<n)&&ds[i].rightmost();i++) commit(s,i); //Isthereanypointtomakeacopy? if(i<n-1){ //Propagatetofixpoint SpaceStatusss=s->status(stat); /* *Again,thespacemightalreadypropagatetofailure(dueto *weaklymonotonicpropagators). */ if(ss==SS_FAILED){ //smustbedeletedasitisnotonthestack deletes; stat.fail++; unwind(i); returnNULL; } ds[i].space(s->clone()); d=static_cast<unsignedint>(n-i); } //Finallydotheremainingcommits for(;i<n;i++) commit(s,i); } returns; } forceinlineSpace* Path::recompute(unsignedint&d,unsignedinta_d,Worker&stat, constSpace*best,int&mark){ assert(!ds.empty()); //Recomputespaceaccordingtopath //Alsosaydistancetocopy(d==0)requiresimmediatecopying //CheckforLAO if((ds.top().space()!=NULL)&&ds.top().rightmost()){ Space*s=ds.top().space(); s->commit(*ds.top().choice(),ds.top().alt()); assert(ds.entries()-1==lc()); if(mark>ds.entries()-1){ mark=ds.entries()-1; s->constrain(*best); } ds.top().space(NULL); //Markasreusable if(ds.entries()>ngdl()) ds.top().next(); d=0; returns; } //Generalcaseforrecomputation intl=lc();//Positionoflastclone intn=ds.entries();//Numberofstackentries //Newdistance,ifnoadaptiverecomputation d=static_cast<unsignedint>(n-l); Space*s=ds[l].space();//Lastclone if(l<mark){ mark=l; s->constrain(*best); //Thespaceonthestackcouldbefailednowasanadditional //constraintmighthavebeenadded. if(s->status(stat)==SS_FAILED){ //sdoesnotneeddeletionasitisonthestack(unwinddoesthis) stat.fail++; unwind(l); returnNULL; } //Itisimportanttoreplacethespaceonthestackwiththe //copy:acopymightbemuchsmallerduetoflushedcaches //ofpropagators Space*c=s->clone(); ds[l].space(c); }else{ s=s->clone(); } if(d<a_d){ //Noadaptiverecomputation for(inti=l;i<n;i++) commit(s,i); }else{ intm=l+static_cast<int>(d>>1);//Middlebetweencopyandtop inti=l;//Toiterateoverallentries //Recomputeuptomiddle for(;i<m;i++) commit(s,i); //Skipoverallrightmostbranches for(;(i<n)&&ds[i].rightmost();i++) commit(s,i); //Isthereanypointtomakeacopy? if(i<n-1){ //Propagatetofixpoint SpaceStatusss=s->status(stat); /* *Again,thespacemightalreadypropagatetofailure * *Thiscanbefortworeasons: *-constrainistrue,sowefail *-thespacehasweaklymonotonicpropagators */ if(ss==SS_FAILED){ //smustbedeletedasitisnotonthestack deletes; stat.fail++; unwind(i); returnNULL; } ds[i].space(s->clone()); d=static_cast<unsignedint>(n-i); } //Finallydotheremainingcommits for(;i<n;i++) commit(s,i); } returns; } }}} #endif //STATISTICS:search-parallel