All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.jgroups.protocols.pbcast.ViewHandler Maven / Gradle / Ivy

package org.jgroups.protocols.pbcast;

import org.jgroups.annotations.GuardedBy;
import org.jgroups.logging.Log;
import org.jgroups.util.BoundedList;
import org.jgroups.util.Util;

import java.util.*;
import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import java.util.function.BiPredicate;
import java.util.function.Consumer;
import java.util.stream.Collectors;

/**
 * Responsible for dispatching JOIN/LEAVE/MERGE requests to the GMS protocol. Bundles multiple concurrent requests into
 * a request list
 * @param  the type of the request
 * @author Bela Ban
 * @since  4.0.5
 */
public class ViewHandler {
    protected final Collection         requests=new ConcurrentLinkedQueue<>();
    protected final Lock                  lock=new ReentrantLock();
    protected final AtomicInteger         count=new AtomicInteger(); // #threads adding to (and removing from) queue
    protected final AtomicBoolean         suspended=new AtomicBoolean(false);
    @GuardedBy("lock")
    protected boolean                     processing;
    protected final Condition             processing_done=lock.newCondition();
    protected final GMS                   gms;
    protected Consumer>     req_processor;
    protected BiPredicate            req_matcher;
    protected final BoundedList   history=new BoundedList<>(20); // maintains a list of the last 20 requests


    /**
     * Constructor
     * @param gms The ref to GMS
     * @param req_processor A request processor which processes a list of requests
     * @param req_matcher The matcher which determines whether any given 2 requests can be processed together
     */
    public ViewHandler(GMS gms, Consumer> req_processor, BiPredicate req_matcher) {
        if(req_processor == null)
            throw new IllegalArgumentException("request processor cannot be null");
        this.gms=gms;
        this.req_processor=req_processor;
        this.req_matcher=req_matcher != null? req_matcher : (a,b) -> true;
    }

    public boolean                 suspended()                             {return suspended.get();}
    public int                     size()                                  {return requests.size();}
    public ViewHandler          reqProcessor(Consumer> p) {req_processor=p; return this;}
    public Consumer> reqProcessor()                          {return req_processor;}
    public ViewHandler          reqMatcher(BiPredicate m)          {req_matcher=m; return this;}
    public BiPredicate        reqMatcher()                            {return req_matcher;}

    public ViewHandler add(R req) {
        if(_add(req))
            process(requests);
        return this;
    }

    @SuppressWarnings("unchecked")
    public ViewHandler add(R ... reqs) {
        if(_add(reqs))
            process(requests);
        return this;
    }

    public ViewHandler add(Collection reqs) {
        if(_add(reqs))
            process(requests);
        return this;
    }


    /** Clears the queue and discards new requests from now on */
    public void suspend() {
        if(suspended.compareAndSet(false, true))
            requests.clear();
    }


    public void resume() {
        suspended.compareAndSet(true, false);
    }

    /** Blocks the caller until the current set of requests being processed have been completed. Returns
     * immediately if no requests are currently being processed */
    public void waitUntilComplete() {
        lock.lock();
        try {
            while(processing || count.get() > 0) {
                try {
                    processing_done.await();
                }
                catch(InterruptedException ignored) {
                }
            }
        }
        finally {
            lock.unlock();
        }
    }

    /** Blocks the caller until the current set of requests being processed have been completed, or the timeout
     * elapsed.
* Returns immediately if no requests are currently being processed * @param timeout Max time to wait in milliseconds */ public void waitUntilComplete(long timeout) { long base=System.currentTimeMillis(); long now=0; lock.lock(); try { while(processing || count.get() > 0) { long delay=timeout-now; if(delay <= 0) break; try { processing_done.await(delay, TimeUnit.MILLISECONDS); now=System.currentTimeMillis()-base; } catch(InterruptedException e) { } } } finally { lock.unlock(); } } /** To be used by testing only! */ public > T processing(boolean flag) { lock.lock(); try { setProcessing(flag); return (T)this; } finally { lock.unlock(); } } public String dumpQueue() { return requests.stream().map(Object::toString).collect(Collectors.joining("\n")); } public String dumpHistory() { return String.join("\n", history); } public String toString() { return Util.printListWithDelimiter(requests, ", "); } protected Log log() {return gms.getLog();} @GuardedBy("lock") protected boolean setProcessing(boolean flag) { boolean do_signal=processing && !flag; processing=flag; if(do_signal) processing_done.signalAll(); return flag; } protected boolean _add(R req) { if(req == null) return false; if(suspended.get()) { log().trace("%s: queue is suspended; request %s is discarded", gms.getAddress(), req); return false; } String log=new Date() + ": " + req; count.incrementAndGet(); lock.lock(); try { if(!requests.contains(req)) { // non-null check already performed (above) requests.add(req); history.add(log); } return count.decrementAndGet() == 0 && !processing && setProcessing(true); } finally { lock.unlock(); } } @SuppressWarnings("unchecked") protected boolean _add(R ... reqs) { if(reqs == null || reqs.length == 0) return false; if(suspended.get()) { log().trace("%s: queue is suspended; requests %s are discarded", gms.getAddress(), Arrays.toString(reqs)); return false; } count.incrementAndGet(); lock.lock(); try { for(R req: reqs) { if(req != null && !requests.contains(req)) { requests.add(req); history.add(new Date() + ": " + req); } } return count.decrementAndGet() == 0 && !processing && setProcessing(true); } finally { lock.unlock(); } } protected boolean _add(Collection reqs) { if(reqs == null || reqs.isEmpty()) return false; if(suspended.get()) { log().trace("%s: queue is suspended; requests %s are discarded", gms.getAddress(), reqs); return false; } count.incrementAndGet(); lock.lock(); try { for(R req: reqs) { if(req != null && !requests.contains(req)) { requests.add(req); history.add(new Date() + ": " + req); } } return count.decrementAndGet() == 0 && !processing && setProcessing(true); } finally { lock.unlock(); } } /** We're guaranteed that only one thread will be called with this method at any time */ protected void process(Collection requests) { for(;;) { while(!requests.isEmpty()) { removeAndProcess(requests); // remove matching requests and process them } lock.lock(); try { if(requests.isEmpty()) { setProcessing(false); return; } } finally { lock.unlock(); } } } /** * Removes requests as long as they match - breaks at the first non-matching request or when requests is empty * This method must catch all exceptions; or else process() might return without setting processing to true again! */ protected void removeAndProcess(Collection requests) { try { Collection removed=new ArrayList<>(); Iterator it=requests.iterator(); R first_req=it.next(); removed.add(first_req); it.remove(); while(it.hasNext()) { R next=it.next(); if(req_matcher.test(first_req, next)) { removed.add(next); it.remove(); } else break; } req_processor.accept(removed); } catch(Throwable t) { log().error("failed processing requests", t); } } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy