Examples of Sync

EDU.oswego.cs.dl.util.concurrent.Sync
public void m() { try { gate.acquire(); // block until condition holds try { // ... method body } finally { gate.release() } } catch (InterruptedException ex) { // ... evasive action } } public void m2(Sync cond) { // use supplied condition try { if (cond.attempt(10)) { // try the condition for 10 ms try { // ... method body } finally { cond.release() } } } catch (InterruptedException ex) { // ... evasive action } } } Syncs may be used in somewhat tedious but more flexible replacements for built-in Java synchronized blocks. For example:
```
 class HandSynched {           private double state_ = 0.0;  private final Sync lock;  // use lock type supplied in constructor public HandSynched(Sync l) { lock = l; }  public void changeState(double d) { try { lock.acquire();  try     { state_ = updateFunction(d); }  finally { lock.release(); } }  catch(InterruptedException ex) { } } public double getState() { double d = 0.0; try { lock.acquire();  try     { d = accessFunction(state_); } finally { lock.release(); } }  catch(InterruptedException ex){} return d; } private double updateFunction(double d) { ... } private double accessFunction(double d) { ... } } 
```
If you have a lot of such methods, and they take a common form, you can standardize this using wrappers. Some of these wrappers are standardized in LockedExecutor, but you can make others. For example:
```
 class HandSynchedV2 {           private double state_ = 0.0;  private final Sync lock;  // use lock type supplied in constructor public HandSynchedV2(Sync l) { lock = l; }  protected void runSafely(Runnable r) { try { lock.acquire(); try { r.run(); } finally { lock.release(); } } catch (InterruptedException ex) { // propagate without throwing Thread.currentThread().interrupt(); } } public void changeState(double d) { runSafely(new Runnable() { public void run() { state_ = updateFunction(d); }  }); } // ... } 
```
One reason to bother with such constructions is to use deadlock- avoiding back-offs when dealing with locks involving multiple objects. For example, here is a Cell class that uses attempt to back-off and retry if two Cells are trying to swap values with each other at the same time.
```
 class Cell { long value; Sync lock = ... // some sync implementation class void swapValue(Cell other) { for (;;) {  try { lock.acquire(); try { if (other.lock.attempt(100)) { try {  long t = value;  value = other.value; other.value = t; return; } finally { other.lock.release(); } } } finally { lock.release(); } }  catch (InterruptedException ex) { return; } } } } 
```
Here is an even fancier version, that uses lock re-ordering upon conflict:
```
 class Cell {  long value; Sync lock = ...; private static boolean trySwap(Cell a, Cell b) { a.lock.acquire(); try { if (!b.lock.attempt(0))  return false; try {  long t = a.value; a.value = b.value; b.value = t; return true; } finally { other.lock.release(); } } finally { lock.release(); } return false; } void swapValue(Cell other) { try { while (!trySwap(this, other) && !tryswap(other, this))  Thread.sleep(1); } catch (InterruptedException ex) { return; } } } 
```
Interruptions are in general handled as early as possible. Normally, InterruptionExceptions are thrown in acquire and attempt(msec) if interruption is detected upon entry to the method, as well as in any later context surrounding waits. However, interruption status is ignored in release();
Timed versions of attempt report failure via return value. If so desired, you can transform such constructions to use exception throws via
```
 if (!c.attempt(timeval)) throw new TimeoutException(timeval); 
```
The TimoutSync wrapper class can be used to automate such usages.
All time values are expressed in milliseconds as longs, which have a maximum value of Long.MAX_VALUE, or almost 300,000 centuries. It is not known whether JVMs actually deal correctly with such extreme values. For convenience, some useful time values are defined as static constants.
All implementations of the three Sync methods guarantee to somehow employ Java synchronized methods or blocks, and so entail the memory operations described in JLS chapter 17 which ensure that variables are loaded and flushed within before/after constructions.
Syncs may also be used in spinlock constructions. Although it is normally best to just use acquire(), various forms of busy waits can be implemented. For a simple example (but one that would probably never be preferable to using acquire()):
```
 class X { Sync lock = ... void spinUntilAcquired() throws InterruptedException { // Two phase.  // First spin without pausing. int purespins = 10;  for (int i = 0; i < purespins; ++i) { if (lock.attempt(0)) return true; } // Second phase - use timed waits long waitTime = 1; // 1 millisecond for (;;) { if (lock.attempt(waitTime)) return true; else  waitTime = waitTime * 3 / 2 + 1; // increase 50%  } } } 
```
In addition pure synchronization control, Syncs may be useful in any context requiring before/after methods. For example, you can use an ObservableSync (perhaps as part of a LayeredSync) in order to obtain callbacks before and after each method invocation for a given class.

[ Introduction to this package. ]
edu.scripps.mwsync.Sync
Sync objects represent the operation of pulling changes from a source MediaWiki and pushing them to a target MediaWiki. They are repeatedly executed by a Sync.Runner object.

To instantiate, the client can either inject the dependencies through the constructor, or use the static methods to create a Sync object from options specified in a configuration file.

To run, simply call sync.run() from the app's main method. Use `cron` or similar system utilities to launch on a repeating schedule.

To create custom rewriting behavior, the client can create an object that implements the Rewriter interface and attach it using mySync.addRewriter(myRewriter).

Usage example:
```
 Sync sync = Sync.newFromConfigFile(); Rewriter r = new MyCustomRewriter(); sync.addRewriter(r); sync.start() 
```
@author eclarke@scripps.edu
net.sf.ehcache.concurrent.Sync
/> public void m() { try { gate.acquire(); // block until condition holds try { // ... method body } finally { gate.release() } } catch (InterruptedException ex) { // ... evasive action } }
public void m2(Sync cond) { // use supplied condition try { if (cond.attempt(10)) { // try the condition for 10 ms try { // ... method body } finally { cond.release() } } } catch (InterruptedException ex) { // ... evasive action } } } Syncs may be used in somewhat tedious but more flexible replacements for built-in Java synchronized blocks. For example:
```
 class HandSynched { private double state_ = 0.0; private final Sync lock;  // use lock type supplied in constructor public HandSynched(Sync l) { lock = l; }  public void changeState(double d) { try { lock.acquire(); try     { state_ = updateFunction(d); } finally { lock.release(); } } catch(InterruptedException ex) { } } 
 public double getState() { double d = 0.0; try { lock.acquire(); try     { d = accessFunction(state_); } finally { lock.release(); } } catch(InterruptedException ex){} return d; } private double updateFunction(double d) { ... } private double accessFunction(double d) { ... } } 
```
If you have a lot of such methods, and they take a common form, you can standardize this using wrappers. Some of these wrappers are standardized in LockedExecutor, but you can make others. For example:
```
 class HandSynchedV2 { private double state_ = 0.0; private final Sync lock;  // use lock type supplied in constructor public HandSynchedV2(Sync l) { lock = l; }  protected void runSafely(Runnable r) { try { lock.acquire(); try { r.run(); } finally { lock.release(); } } catch (InterruptedException ex) { // propagate without throwing Thread.currentThread().interrupt(); } } 
 public void changeState(double d) { runSafely(new Runnable() { public void run() { state_ = updateFunction(d); } }); } // ... } 
```
One reason to bother with such constructions is to use deadlock- avoiding back-offs when dealing with locks involving multiple objects. For example, here is a Cell class that uses attempt to back-off and retry if two Cells are trying to swap values with each other at the same time.
```
 class Cell { long value; Sync lock = ... // some sync implementation class void swapValue(Cell other) { for (;;) { try { lock.acquire(); try { if (other.lock.attempt(100)) { try { long t = value; value = other.value; other.value = t; return; } finally { other.lock.release(); } } } finally { lock.release(); } } catch (InterruptedException ex) { return; } } } } 
```
Here is an even fancier version, that uses lock re-ordering upon conflict:
```
 class Cell { long value; Sync lock = ...; private static boolean trySwap(Cell a, Cell b) { a.lock.acquire(); try { if (!b.lock.attempt(0)) return false; try { long t = a.value; a.value = b.value; b.value = t; return true; } finally { other.lock.release(); } } finally { lock.release(); } return false; }  void swapValue(Cell other) { try { while (!trySwap(this, other) && !tryswap(other, this)) Thread.sleep(1); } catch (InterruptedException ex) { return; } } } 
```
Interruptions are in general handled as early as possible. Normally, InterruptionExceptions are thrown in acquire and attempt(msec) if interruption is detected upon entry to the method, as well as in any later context surrounding waits. However, interruption status is ignored in release();
Timed versions of attempt report failure via return value. If so desired, you can transform such constructions to use exception throws via
```
 if (!c.attempt(timeval)) throw new TimeoutException(timeval); 
```
The TimoutSync wrapper class can be used to automate such usages.
All time values are expressed in milliseconds as longs, which have a maximum value of Long.MAX_VALUE, or almost 300,000 centuries. It is not known whether JVMs actually deal correctly with such extreme values. For convenience, some useful time values are defined as static constants.
All implementations of the three Sync methods guarantee to somehow employ Java synchronized methods or blocks, and so entail the memory operations described in JLS chapter 17 which ensure that variables are loaded and flushed within before/after constructions.
Syncs may also be used in spinlock constructions. Although it is normally best to just use acquire(), various forms of busy waits can be implemented. For a simple example (but one that would probably never be preferable to using acquire()):
```
 class X { Sync lock = ... void spinUntilAcquired() throws InterruptedException { // Two phase. // First spin without pausing. int purespins = 10; for (int i = 0; i < purespins; ++i) { if (lock.attempt(0)) return true; } // Second phase - use timed waits long waitTime = 1; // 1 millisecond for (;;) { if (lock.attempt(waitTime)) return true; else waitTime = waitTime * 3 / 2 + 1; // increase 50% } } } 
```
In addition pure synchronization control, Syncs may be useful in any context requiring before/after methods. For example, you can use an ObservableSync (perhaps as part of a LayeredSync) in order to obtain callbacks before and after each method invocation for a given class.

[ Introduction to this package. ]
nexj.core.meta.integration.service.Sync
Object persistence step.
org.apache.abdera.ext.sharing.Sync
org.apache.jackrabbit.vault.vlt.actions.Sync
Checkout...
org.gradle.api.tasks.Sync
Synchronises the contents of a destination directory with some source.
org.jboss.errai.jpa.sync.client.local.Sync
org.jruby.pg.internal.messages.Sync
org.structr.web.entity.relation.Sync
@author Christian Morgner

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

        }


        // if we get here the following is true:
        // - the current thread does not hold a write lock
        for (;;) {
            Sync signal;
            // make sure writer state does not change
            Sync shared = writerStateRWLock.readLock();
            shared.acquire();
            try {
                if (activeWriter == null
                        || !hasDependency(activeWriter.changes, id)) {
                    readerCount.incrementAndGet();
                    readLockMap.addLock(id);
                    return new ReadLockImpl(id);
                } else {
                    signal = new Latch();
                    waitingReaders.add(signal);
                }
            } finally {
                shared.release();
            }


            // if we get here there was an active writer with
            // a dependency to the current id.
            // wait for the writer until it is done, then try again

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

     * {@inheritDoc}
     */
    public WriteLock acquireWriteLock(ChangeLog changeLog)
            throws InterruptedException {
        for (;;) {
            Sync signal;
            // we want to become the current writer
            Sync exclusive = writerStateRWLock.writeLock();
            exclusive.acquire();
            try {
                if (activeWriter == null
                        && !readLockMap.hasDependency(changeLog)) {
                    activeWriter = new WriteLockImpl(changeLog);
                    activeWriterId = getCurrentThreadId();
                    return activeWriter;
                } else {
                    signal = new Latch();
                    waitingWriters.add(signal);
                }
            } finally {
                exclusive.release();
            }
            // if we get here there is an active writer or there is a read
            // lock that conflicts with the change log
            signal.acquire();
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

        WriteLockImpl(ChangeLog changes) {
            this.changes = changes;
        }


        public void release() {
            Sync exclusive = writerStateRWLock.writeLock();
            for (;;) {
                try {
                    exclusive.acquire();
                    break;
                } catch (InterruptedException e) {
                    // try again
                    Thread.interrupted();
                }
            }
            try {
                activeWriter = null;
                activeWriterId = null;
                notifyWaitingReaders();
                notifyWaitingWriters();
            } finally {
                exclusive.release();
            }
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

        }


        public ReadLock downgrade() {
            readerCount.incrementAndGet();
            readLockMap.addLock(null);
            Sync exclusive = writerStateRWLock.writeLock();
            for (;;) {
                try {
                    exclusive.acquire();
                    break;
                } catch (InterruptedException e) {
                    // try again
                    Thread.interrupted();
                }
            }
            try {
                activeWriter = null;
                // only notify waiting readers since we still hold a down
                // graded lock, which is kind of exclusiv with respect to
                // other writers
                notifyWaitingReaders();
            } finally {
                exclusive.release();
            }
            return anonymousReadLock;
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

        ReadLockImpl(ItemId id) {
            this.id = id;
        }


        public void release() {
            Sync shared = writerStateRWLock.readLock();
            for (;;) {
                try {
                    shared.acquire();
                    break;
                } catch (InterruptedException e) {
                    // try again
                    Thread.interrupted();
                }
            }
            try {
                readLockMap.removeLock(id);
                if (readerCount.decrementAndGet() == 0 && activeWriter == null) {
                    activeWriterId = null;
                }
                if (!isSameThreadId(activeWriterId, getCurrentThreadId())) {
                    // only notify waiting writers if we do *not* hold a write
                    // lock at the same time. that would be a waste of cpu time.
                    notifyWaitingWriters();
                }
            } finally {
                shared.release();
            }
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

    }


    public synchronized Object getObject(final Object key)
    throws IOException, ClassNotFoundException
    {
        Sync sync = this.lock.writeLock();
        try
        {
            sync.acquire();
            try 
            {
                final File file = this.fileFromKey(key);
                if (file != null) {
                    return this.deserializeObject(file);
                }
            }
            finally 
            {
                sync.release();
            }
        }
        catch (InterruptedException ignore)
        {
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

     * @return the Object associated with Key Object
     */
    public Object get(Object key) 
    {
        Object value = null;
        Sync sync = this.lock.writeLock();
        try
        {
            sync.acquire();
            try 
            {
                value = this.doGet(key);
            }
            finally 
            {
                sync.release();
            }
        }
        catch (InterruptedException ignore)
        {
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

     * @exception  IOException
     */
    public void store(Object key, Object value)
    throws IOException 
    {
        Sync sync = this.lock.writeLock();
        try
        {
            sync.acquire();


            try 
            {
                this.doStore(key, value);
                m_sizeInstrument.setValue( doGetSize() );
            } 
            finally 
            {
                sync.release();
            }
        }
        catch (InterruptedException ignore)
        {
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

    /**
     * Frees some values of the data file.<br>
     */
    public void free() 
    {
        Sync sync = this.lock.writeLock();
        try
        {
            sync.acquire();


            try 
            {
                this.doFree();
                m_sizeInstrument.setValue( doGetSize() );
            } 
            finally 
            {
                sync.release();
            }
        }
        catch (InterruptedException ignore)
        {
        }

View Full Code Here

Examples of EDU.oswego.cs.dl.util.concurrent.Sync

        if (getLogger().isDebugEnabled()) 
        {
            getLogger().debug("clear(): Clearing the database ");
        }


        Sync sync = this.lock.writeLock();
        try
        {
            sync.acquire();
            try 
            {
                this.doClear();
                m_sizeInstrument.setValue( 0 );
            }
            finally 
            {
                sync.release();
            }
        }
        catch (InterruptedException ignore)
        {
        }

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.