/** Returns the current view and digest. Try to find a matching digest twice (if not found on the first try) */ public Tuple<View,Digest> getViewAndDigest() { MutableDigest digest=new MutableDigest(view.getMembersRaw()).set(getDigest()); return digest.allSet() || digest.set(getDigest()).allSet()? new Tuple<>(view, digest) : null; }
/** * Merge all digests into one. For each sender, the new value is max(highest_delivered), * max(highest_received). This method has a lock on merge_rsps */ protected MutableDigest consolidateDigests(final View new_view, final List<MergeData> merge_rsps) { MutableDigest retval=new MutableDigest(new_view.getMembersRaw()); for(MergeData data: merge_rsps) { Digest tmp_digest=data.getDigest(); if(tmp_digest != null) retval.merge(tmp_digest); } return retval; } }
/** Returns an array of members whose seqno is not set. Returns an empty array if all are set. */ public Address[] getNonSetMembers() { Address[] retval=new Address[countNonSetMembers()]; if(retval.length == 0) return retval; int index=0; for(int i=0; i < members.length; i++) if(seqnos[i*2] == -1) retval[index++]=members[i]; return retval; }
/** * Similar to set(), but if the sender already exists, its seqnos will be modified (no new entry) as follows: * <ol> * <li>this.highest_delivered_seqno=max(this.highest_delivered_seqno, highest_delivered_seqno) * <li>this.highest_received_seqno=max(this.highest_received_seqno, highest_received_seqno) * </ol> */ public MutableDigest merge(final Address member, final long highest_delivered_seqno, final long highest_received_seqno) { if(member == null) return this; long[] entry=get(member); long hd=entry == null? highest_delivered_seqno : Math.max(entry[0],highest_delivered_seqno); long hr=entry == null? highest_received_seqno : Math.max(entry[1],highest_received_seqno); return set(member, hd, hr); }
final MutableDigest d=new MutableDigest(current_view.getMembersRaw()).set(getDigest()); Address dest=send_stable_msgs_to_coord_only? coordinator : null; if(d.allSet() || d.set(getDigest()).allSet()) // try once more if the first digest didn't match log.trace("%s: sending stable msg to %s: %s", local_addr, (send_stable_msgs_to_coord_only? coordinator : "cluster"), printDigest(d)); else { log.trace("%s: could not find matching digest for view %s, missing members: %s", local_addr, current_view, d.getNonSetMembers()); return;
/** * Merge all digests into one. For each sender, the new value is min(low_seqno), max(high_seqno), * max(high_seqno_seen) */ private Digest consolidateDigests(Vector<MergeData> merge_rsps, int num_mbrs) { MergeData data; Digest tmp_digest; MutableDigest retval=new MutableDigest(num_mbrs); for(int i=0; i < merge_rsps.size(); i++) { data=merge_rsps.elementAt(i); tmp_digest=data.getDigest(); if(tmp_digest == null) { if(log.isErrorEnabled()) log.error("tmp_digest == null; skipping"); continue; } retval.merge(tmp_digest); } return retval.copy(); }
return new MutableDigest(view.getMembersRaw()) .set((Digest)gms.getDownProtocol().down(new Event(Event.GET_DIGEST, gms.local_addr))); MutableDigest retval=new MutableDigest(tmp); Map<Address,Digest> responses=new HashMap<>(digest_collector.getResults()); responses.values().forEach(retval::set);
/** Returns a digest which contains, for all members of view, the highest delivered and received * seqno of all digests */ protected static Digest maxSeqnos(final View view, List<Digest> digests) { if(view == null || digests == null) return null; MutableDigest digest=new MutableDigest(view.getMembersRaw()); digests.forEach(digest::merge); return digest; }
else { join_digest=new MutableDigest(tmp.size() + new_mbrs.size()); join_digest.add(tmp); // add the existing digest to the new one for(Iterator i=new_mbrs.iterator(); i.hasNext();) join_digest.add((Address)i.next(), 0, 0); // ... and add the new members. their first seqno will be 1 join_rsp=new JoinRsp(new_view, join_digest != null? join_digest.copy() : null);
MutableDigest tmp_digest=new MutableDigest(rsp.getDigest()); tmp_view=rsp.getView(); if(tmp_digest == null || tmp_view == null) { tmp_digest.incrementHighestDeliveredSeqno(coord); // see DESIGN for an explanantion tmp_digest.seal(); gms.setDigest(tmp_digest);
/** * Adds a digest to this digest. This digest must have enough space to add the other digest; otherwise an error * message will be written. For each sender in the other digest, the merge() method will be called. */ public void merge(Digest digest) { if(digest == null) { if(log.isErrorEnabled()) log.error("digest to be merged with is null"); return; } checkSealed(); Map.Entry<Address,Entry> entry; Address sender; Entry val; for(Iterator<Map.Entry<Address,Entry>> it=digest.senders.entrySet().iterator(); it.hasNext();) { entry=it.next(); sender=entry.getKey(); val=entry.getValue(); if(val != null) { merge(sender, val.getLow(), val.getHighestDeliveredSeqno(), val.getHighestReceivedSeqno()); } } }
/** * Adds a digest to this digest. For each sender in the other digest, the merge() method will be called. */ public MutableDigest merge(Digest digest) { if(digest == null) return this; for(Entry entry: digest) merge(entry.getMember(), entry.getHighestDeliveredSeqno(), entry.getHighestReceivedSeqno()); return this; }
public MutableDigest set(Digest digest) { if(digest == null) return this; for(Entry entry: digest) set(entry.getMember(), entry.getHighestDeliveredSeqno(), entry.getHighestReceivedSeqno()); return this; }
public MutableDigest set(Address member, long highest_delivered_seqno, long highest_received_seqno) { if(member == null) return this; int index=find(member); if(index >= 0) { seqnos[index * 2]=highest_delivered_seqno; seqnos[index * 2 +1]=highest_received_seqno; } return this; }
public MutableDigest(Address[] members) { super(members, createEmptyArray(members.length *2)); }
if(new_digest == null || !new_digest.allSet()) return null;
gms.getDownProtocol().down(new Event(Event.SUSPEND_STABLE, MAX_SUSPEND_TIMEOUT)); MutableDigest join_digest=new MutableDigest(new_view.getMembersRaw()).set(gms.getDigest()); for(Address member: new_mbrs) join_digest.set(member,0,0); // ... and set the new members. their first seqno will be 1 if(join_digest.allSet() || join_digest.set(gms.getDigest()).allSet()) join_rsp=new JoinRsp(new_view, join_digest); else log.warn("%s: digest does not match view (missing seqnos for %s); dropping JOIN-RSP", gms.local_addr, Arrays.toString(join_digest.getNonSetMembers()));
/** Update my own digest from a digest received by somebody else. Returns whether the update was successful. * Needs to be called with a lock on digest */ @GuardedBy("lock") protected void updateLocalDigest(Digest d, Address sender) { StringBuilder sb=null; if(log.isTraceEnabled()) sb=new StringBuilder().append(local_addr).append(": handling digest from ").append(sender).append(":\nmine: ") .append(printDigest(digest)).append("\nother: ").append(printDigest(d)); for(Digest.Entry entry: d) { Address mbr=entry.getMember(); long hd=entry.getHighestDeliveredSeqno(), hr=entry.getHighestReceivedSeqno(); // compute the minimum of the highest seqnos deliverable (for garbage collection) long[] seqnos=digest.get(mbr); if(seqnos == null) continue; long my_hd=seqnos[0]; long my_hr=seqnos[1]; // (for retransmission of last missing message) if(my_hd == -1) // -1 means the seqno hasn't been set yet my_hd=hd; long new_hd=Math.min(my_hd, hd); long new_hr=Math.max(my_hr, hr); digest.set(mbr, new_hd, new_hr); } if(sb != null) // implies log.isTraceEnabled() == true log.trace(sb.append("\nresult: ").append(printDigest(digest)).append("\n")); }
return new MutableDigest(view.getMembersRaw()) .set((Digest)gms.getDownProtocol().down(new Event(Event.GET_DIGEST, gms.local_addr))); MutableDigest retval=new MutableDigest(tmp); Map<Address,Digest> responses=new HashMap<>(digest_collector.getResults()); responses.values().forEach(retval::set);
@GuardedBy("lock") protected void resetDigest() { if(view == null) return; digest=new MutableDigest(view.getMembersRaw()); // .set(getDigest()); votes=new FixedSizeBitSet(view.size()); // all 0's initially }