Examples of com.sleepycat.je.cleaner.OffsetList

com.sleepycat.je.cleaner.OffsetList
List of LSN offsets as a linked list of segments. The reasons for using a list of this type and not a java.util.List are:
- Segements reduce memory overhead by storing long primitives rather than Long objects. Many longs per segment reduce link overhead.
- Memory is only allocated for new segments, reducing the number of calls to update the memory budget.
- This is an append-only list that supports a single appender thread and multiple unsynchronized reader threads. The caller is responsible for synchronizing such that only one thread calls add() at one time. The reader threads see data as it is changing but do not see inconsistent data (corrupt longs) and do not require synchronization for thread safety.
The algorithms here use traversal of the list segments rather than recursion to avoid using a lot of stack space.

        parent.incInternalMemoryUsage(increment);
    }


    void add(long lsn) {
        long fileNumber = DbLsn.getFileNumber(lsn);
        OffsetList offsetsForFile = offsetsByFile.get(fileNumber);
        if (offsetsForFile == null) {
            offsetsForFile = new OffsetList();
            offsetsByFile.put(fileNumber, offsetsForFile);
            incInternalMemoryUsage(MemoryBudget.TFS_LIST_INITIAL_OVERHEAD);
            incInternalMemoryUsage(MemoryBudget.TREEMAP_ENTRY_OVERHEAD);
        }


        boolean newSegment =
            offsetsForFile.add(DbLsn.getFileOffset(lsn), false);
        if (newSegment) {
            incInternalMemoryUsage(MemoryBudget.TFS_LIST_SEGMENT_OVERHEAD);
        }


        nTotalEntries += 1;

View Full Code Here

        doOneTest(array(list));
    }


    private void doOneTest(long[] offsets) {


        OffsetList list = new OffsetList();
        for (int i = 0; i < offsets.length; i += 1) {
            list.add(offsets[i], true);
        }
        long[] array = list.toArray();
        assertTrue("array=\n" + dump(array) + " offsets=\n" + dump(offsets),
                   Arrays.equals(offsets, array));


        long[] sorted = new long[array.length];
        System.arraycopy(array, 0, sorted, 0, array.length);

View Full Code Here


      long lsn = in.getLsn(i);
      Node node = in.getTarget(i);
      if (accumulate && (node == null)) {
                if (accumulatedLSNFileNumbers == null) {
                    accumulatedLSNFileNumbers = new OffsetList();
                    accumulatedLSNFileOffsets = new OffsetList();
                }


                accumulatedLSNFileNumbers.add(DbLsn.getFileNumber(lsn),
                                              false);
                accumulatedLSNFileOffsets.add(DbLsn.getFileOffset(lsn),

View Full Code Here


                if (accumulate &&
                    (node == null) &&
                    lsn != DbLsn.NULL_LSN) {
                    if (accumulatedLSNFileNumbers == null) {
                        accumulatedLSNFileNumbers = new OffsetList();
                        accumulatedLSNFileOffsets = new OffsetList();
                    }


                    accumulatedLSNFileNumbers.add(DbLsn.getFileNumber(lsn),
                                                  false);
                    accumulatedLSNFileOffsets.add(DbLsn.getFileOffset(lsn),

View Full Code Here

TOP

Related Classes of com.sleepycat.je.cleaner.OffsetList

com.sleepycat.je.cleaner.OffsetTest

com.sleepycat.je.dbi.LSNAccumulator

com.sleepycat.je.dbi.SortedLSNTreeWalker

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.