Package org.exist.storage.lock

Examples of org.exist.storage.lock.Lock.release()

863
864
865
866
867
868
869
870
871
872
873
                }
                catch( final BTreeException e ) {
                    LOG.error( e.getMessage(), e );
                }
                finally {
                    lock.release( Lock.READ_LOCK );
                }
            } else {

                for( int i = 0; i < qnames.size(); i++ ) {
                    final QName qname = ( QName )qnames.get( i );
View Full Code Here
898
899
900
901
902
903
904
905
906
907
908
                    }
                    catch( final BTreeException e ) {
                        LOG.error( e.getMessage(), e );
                    }
                    finally {
                        lock.release( Lock.READ_LOCK );
                    }
                }
            }
        }
        return( result );
View Full Code Here
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
                }
                catch( final BTreeException e ) {
                    LOG.error( e.getMessage(), e );
                }
                finally {
                    lock.release( Lock.READ_LOCK );
                }
            } else {

                for( int i = 0; i < qnames.size(); i++ ) {
                    final QName qname = ( QName )qnames.get( i );
View Full Code Here
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
                    }
                    catch( final BTreeException e ) {
                        LOG.error( e.getMessage(), e );
                    }
                    finally {
                        lock.release( Lock.READ_LOCK );
                    }
                }
            }
        }
        return( result );
View Full Code Here
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
            }
            catch( final TerminatedException e ) {
                LOG.warn( e.getMessage(), e );
            }
            finally {
                lock.release( Lock.READ_LOCK );
            }
        }
        final Map<AtomicValue, ValueOccurrences> map = cb.map;
        final ValueOccurrences[] result = new ValueOccurrences[map.size()];
        return( ( ValueOccurrences[] )map.values().toArray( result ) );
View Full Code Here
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
                }
                catch( final TerminatedException e ) {
                    LOG.warn( e.getMessage(), e );
                }
                finally {
                    lock.release( Lock.READ_LOCK );
                }
            }
        }
        final Map<AtomicValue, ValueOccurrences> map = cb.map;
        final ValueOccurrences[] result = new ValueOccurrences[map.size()];
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
                            cached.sync(true);
                            map.remove(cached.getKey());
                            removed = true;
                        }
                    } finally {
                        lock.release(Lock.READ_LOCK);
                    }
                }
            }
            if (!removed) {
                next = next.getNext();
View Full Code Here
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
    public void unlock(boolean exclusive) {
        final Lock dlock = doc.getUpdateLock();
        if(exclusive)
            {dlock.release(Lock.WRITE_LOCK);}
        else if (dlock.isLockedForRead(Thread.currentThread()))
            {dlock.release(Lock.READ_LOCK);}
    }

    public boolean equalDocs(DocumentSet other) {
        if (this == other)
            // we are comparing the same objects
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.