SplitOrderedList.cs System::Collections::Concurrent::SplitOrderedList System::Collections::Concurrent::SplitOrderedList::Node System::Collections::Concurrent::SplitOrderedList::SimpleRwLock System System::Collections System::Collections::Concurrent //SplitOrderedList.cs // //Copyright(c)2010Jérémie"Garuma"Laval // //Permissionisherebygranted,freeofcharge,toanypersonobtainingacopy //ofthissoftwareandassociateddocumentationfiles(the"Software"),todeal //intheSoftwarewithoutrestriction,includingwithoutlimitationtherights //touse,copy,modify,merge,publish,distribute,sublicense,and/orsell //copiesoftheSoftware,andtopermitpersonstowhomtheSoftwareis //furnishedtodoso,subjecttothefollowingconditions: // //Theabovecopyrightnoticeandthispermissionnoticeshallbeincludedin //allcopiesorsubstantialportionsoftheSoftware. // //THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND,EXPRESSOR //IMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOFMERCHANTABILITY, //FITNESSFORAPARTICULARPURPOSEANDNONINFRINGEMENT.INNOEVENTSHALLTHE //AUTHORSORCOPYRIGHTHOLDERSBELIABLEFORANYCLAIM,DAMAGESOROTHER //LIABILITY,WHETHERINANACTIONOFCONTRACT,TORTOROTHERWISE,ARISINGFROM, //OUTOFORINCONNECTIONWITHTHESOFTWAREORTHEUSEOROTHERDEALINGSIN //THESOFTWARE. // // #ifNET_4_0||UNITY_5_3_OR_NEWER||INSIDE_SYSTEM_WEB usingSystem; usingSystem.Threading; usingSystem.Collections; usingSystem.Collections.Generic; usingSystem.Runtime.Serialization; namespaceSystem.Collections.Concurrent { internalclassSplitOrderedList<TKey,T> { classNode { publicboolMarked; publiculongKey; publicTKeySubKey; publicTData; publicNodeNext; publicNodeInit(ulongkey,TKeysubKey,Tdata) { this.Key=key; this.SubKey=subKey; this.Data=data; this.Marked=false; this.Next=null; returnthis; } //Usedtocreatedummynode publicNodeInit(ulongkey) { this.Key=key; this.Data=default(T); this.Next=null; this.Marked=false; this.SubKey=default(TKey); returnthis; } //Usedtocreatemarkednode publicNodeInit(Nodewrapped) { this.Marked=true; this.Next=wrapped; this.Key=0; this.Data=default(T); this.SubKey=default(TKey); returnthis; } } constintMaxLoad=5; constuintBucketSize=512; Nodehead; Nodetail; Node[]buckets=newNode[BucketSize]; intcount; intsize=2; SimpleRwLockslim=newSimpleRwLock(); readonlyIEqualityComparer<TKey>comparer; publicSplitOrderedList(IEqualityComparer<TKey>comparer) { this.comparer=comparer; head=newNode().Init(0); tail=newNode().Init(ulong.MaxValue); head.Next=tail; SetBucket(0,head); } publicintCount{ get{ returncount; } } publicTInsertOrUpdate(uintkey,TKeysubKey,Func<T>addGetter,Func<T,T>updateGetter) { Nodecurrent; boolresult=InsertInternal(key,subKey,default(T),addGetter,outcurrent); if(result) returncurrent.Data; //FIXME:thisshouldhaveaCAS-likebehavior returncurrent.Data=updateGetter(current.Data); } publicTInsertOrUpdate(uintkey,TKeysubKey,TaddValue,TupdateValue) { Nodecurrent; if(InsertInternal(key,subKey,addValue,null,outcurrent)) returncurrent.Data; //FIXME:thisshouldhaveaCAS-likebehavior returncurrent.Data=updateValue; } publicboolInsert(uintkey,TKeysubKey,Tdata) { Nodecurrent; returnInsertInternal(key,subKey,data,null,outcurrent); } publicTInsertOrGet(uintkey,TKeysubKey,Tdata,Func<T>dataCreator) { Nodecurrent; InsertInternal(key,subKey,data,dataCreator,outcurrent); returncurrent.Data; } boolInsertInternal(uintkey,TKeysubKey,Tdata,Func<T>dataCreator,outNodecurrent) { Nodenode=newNode().Init(ComputeRegularKey(key),subKey,data); uintb=key%(uint)size; Nodebucket; if((bucket=GetBucket(b))==null) bucket=InitializeBucket(b); if(!ListInsert(node,bucket,outcurrent,dataCreator)) returnfalse; intcsize=size; if(Interlocked.Increment(refcount)/csize>MaxLoad&&(csize&0x40000000)==0) Interlocked.CompareExchange(refsize,2*csize,csize); current=node; returntrue; } publicboolFind(uintkey,TKeysubKey,outTdata) { Nodenode; uintb=key%(uint)size; data=default(T); Nodebucket; if((bucket=GetBucket(b))==null) bucket=InitializeBucket(b); if(!ListFind(ComputeRegularKey(key),subKey,bucket,outnode)) returnfalse; data=node.Data; return!node.Marked; } publicboolCompareExchange(uintkey,TKeysubKey,Tdata,Func<T,bool>check) { Nodenode; uintb=key%(uint)size; Nodebucket; if((bucket=GetBucket(b))==null) bucket=InitializeBucket(b); if(!ListFind(ComputeRegularKey(key),subKey,bucket,outnode)) returnfalse; if(!check(node.Data)) returnfalse; node.Data=data; returntrue; } publicboolDelete(uintkey,TKeysubKey,outTdata) { uintb=key%(uint)size; Nodebucket; if((bucket=GetBucket(b))==null) bucket=InitializeBucket(b); if(!ListDelete(bucket,ComputeRegularKey(key),subKey,outdata)) returnfalse; Interlocked.Decrement(refcount); returntrue; } publicIEnumerator<T>GetEnumerator() { Nodenode=head.Next; while(node!=tail){ while(node.Marked||(node.Key&1)==0){ node=node.Next; if(node==tail) yieldbreak; } yieldreturnnode.Data; node=node.Next; } } NodeInitializeBucket(uintb) { Nodecurrent; uintparent=GetParent(b); Nodebucket; if((bucket=GetBucket(parent))==null) bucket=InitializeBucket(parent); Nodedummy=newNode().Init(ComputeDummyKey(b)); if(!ListInsert(dummy,bucket,outcurrent,null)) returncurrent; returnSetBucket(b,dummy); } //Turnv'sMSBoff staticuintGetParent(uintv) { uintt,tt; //FindMSBpositioninv varpos=(tt=v>>16)>0? (t=tt>>8)>0?24+logTable[t]:16+logTable[tt]: (t=v>>8)>0?8+logTable[t]:logTable[v]; return(uint)(v&~(1<<pos)); } //ReverseintegerbitsandmakesureLSBisset staticulongComputeRegularKey(uintkey) { returnComputeDummyKey(key)|1; } //Reverseintegerbits staticulongComputeDummyKey(uintkey) { return((ulong)(((uint)reverseTable[key&0xff]<<24)| ((uint)reverseTable[(key>>8)&0xff]<<16)| ((uint)reverseTable[(key>>16)&0xff]<<8)| ((uint)reverseTable[(key>>24)&0xff])))<<1; } //Bucketstorageisabstractedinasimpletwo-layertreetoavoidtoomuchmemoryresize NodeGetBucket(uintindex) { if(index>=buckets.Length) returnnull; returnbuckets[index]; } NodeSetBucket(uintindex,Nodenode) { try{ slim.EnterReadLock(); CheckSegment(index,true); AotInterlocked.CompareExchange(refbuckets[index],node,null); returnbuckets[index]; }finally{ slim.ExitReadLock(); } } //Whenwerunoutofspaceforbucketstorage,weusealock-basedarrayresize voidCheckSegment(uintsegment,boolreadLockTaken) { if(segment<buckets.Length) return; if(readLockTaken) slim.ExitReadLock(); try{ slim.EnterWriteLock(); while(segment>=buckets.Length) Array.Resize(refbuckets,buckets.Length*2); }finally{ slim.ExitWriteLock(); } if(readLockTaken) slim.EnterReadLock(); } NodeListSearch(ulongkey,TKeysubKey,refNodeleft,Nodeh) { NodeleftNodeNext=null,rightNode=null; do{ Nodet=h; NodetNext=t.Next; do{ if(!tNext.Marked){ left=t; leftNodeNext=tNext; } t=tNext.Marked?tNext.Next:tNext; if(t==tail) break; tNext=t.Next; }while(tNext.Marked||t.Key<key||(tNext.Key==key&&!comparer.Equals(subKey,t.SubKey))); rightNode=t; if(leftNodeNext==rightNode){ if(rightNode!=tail&&rightNode.Next.Marked) continue; else returnrightNode; } if(AotInterlocked.CompareExchange(refleft.Next,rightNode,leftNodeNext)==leftNodeNext){ if(rightNode!=tail&&rightNode.Next.Marked) continue; else returnrightNode; } }while(true); } boolListDelete(NodestartPoint,ulongkey,TKeysubKey,outTdata) { NoderightNode=null,rightNodeNext=null,leftNode=null; data=default(T); NodemarkedNode=null; do{ rightNode=ListSearch(key,subKey,refleftNode,startPoint); if(rightNode==tail||rightNode.Key!=key||!comparer.Equals(subKey,rightNode.SubKey)) returnfalse; data=rightNode.Data; rightNodeNext=rightNode.Next; if(!rightNodeNext.Marked){ if(markedNode==null) markedNode=newNode(); markedNode.Init(rightNodeNext); if(AotInterlocked.CompareExchange(refrightNode.Next,markedNode,rightNodeNext)==rightNodeNext) break; } }while(true); if(AotInterlocked.CompareExchange(refleftNode.Next,rightNodeNext,rightNode)!=rightNode) ListSearch(rightNode.Key,subKey,refleftNode,startPoint); returntrue; } boolListInsert(NodenewNode,NodestartPoint,outNodecurrent,Func<T>dataCreator) { ulongkey=newNode.Key; NoderightNode=null,leftNode=null; do{ rightNode=current=ListSearch(key,newNode.SubKey,refleftNode,startPoint); if(rightNode!=tail&&rightNode.Key==key&&comparer.Equals(newNode.SubKey,rightNode.SubKey)) returnfalse; newNode.Next=rightNode; if(dataCreator!=null) newNode.Data=dataCreator(); if(AotInterlocked.CompareExchange(refleftNode.Next,newNode,rightNode)==rightNode) returntrue; }while(true); } boolListFind(ulongkey,TKeysubKey,NodestartPoint,outNodedata) { NoderightNode=null,leftNode=null; data=null; rightNode=ListSearch(key,subKey,refleftNode,startPoint); data=rightNode; returnrightNode!=tail&&rightNode.Key==key&&comparer.Equals(subKey,rightNode.SubKey); } staticreadonlybyte[]reverseTable={ 0,128,64,192,32,160,96,224,16,144,80,208,48,176,112,240,8,136,72,200,40,168,104,232,24,152,88,216,56,184,120,248,4,132,68,196,36,164,100,228,20,148,84,212,52,180,116,244,12,140,76,204,44,172,108,236,28,156,92,220,60,188,124,252,2,130,66,194,34,162,98,226,18,146,82,210,50,178,114,242,10,138,74,202,42,170,106,234,26,154,90,218,58,186,122,250,6,134,70,198,38,166,102,230,22,150,86,214,54,182,118,246,14,142,78,206,46,174,110,238,30,158,94,222,62,190,126,254,1,129,65,193,33,161,97,225,17,145,81,209,49,177,113,241,9,137,73,201,41,169,105,233,25,153,89,217,57,185,121,249,5,133,69,197,37,165,101,229,21,149,85,213,53,181,117,245,13,141,77,205,45,173,109,237,29,157,93,221,61,189,125,253,3,131,67,195,35,163,99,227,19,147,83,211,51,179,115,243,11,139,75,203,43,171,107,235,27,155,91,219,59,187,123,251,7,135,71,199,39,167,103,231,23,151,87,215,55,183,119,247,15,143,79,207,47,175,111,239,31,159,95,223,63,191,127,255 }; staticreadonlybyte[]logTable={ 0xFF,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7 }; structSimpleRwLock { constintRwWait=1; constintRwWrite=2; constintRwRead=4; intrwlock; publicvoidEnterReadLock() { SpinWaitsw=newSpinWait(); do{ while((rwlock&(RwWrite|RwWait))>0) sw.SpinOnce(); if((Interlocked.Add(refrwlock,RwRead)&(RwWait|RwWait))==0) return; Interlocked.Add(refrwlock,-RwRead); }while(true); } publicvoidExitReadLock() { Interlocked.Add(refrwlock,-RwRead); } publicvoidEnterWriteLock() { SpinWaitsw=newSpinWait(); do{ intstate=rwlock; if(state<RwWrite){ if(Interlocked.CompareExchange(refrwlock,RwWrite,state)==state) return; state=rwlock; } //WeregisterourinterestintakingtheWritelock(ifupgradeableit'salreadydone) while((state&RwWait)==0&&Interlocked.CompareExchange(refrwlock,state|RwWait,state)!=state) state=rwlock; //Beforefallingtosleep while(rwlock>RwWait) sw.SpinOnce(); }while(true); } publicvoidExitWriteLock() { Interlocked.Add(refrwlock,-RwWrite); } } } #ifINSIDE_SYSTEM_WEB&&!NET_4_0 internalstructSpinWait { //ThenumberofstepuntilSpinOnceyieldonmulticoremachine constintstep=10; constintmaxTime=200; staticreadonlyboolisSingleCpu=(Environment.ProcessorCount==1); intntime; publicvoidSpinOnce() { ntime+=1; if(isSingleCpu){ //Onasingle-CPUsystem,spinningdoesnogood Thread.Sleep(0); }else{ if(ntime%step==0) Thread.Sleep(0); else //Multi-CPUsystemmightbehyper-threaded,letotherthreadrun Thread.SpinWait(Math.Min(ntime,maxTime)<<1); } } } #endif } #endif