Package com.sleepycat.je.tree

Examples of com.sleepycat.je.tree.TreeLocation

429
430
431
432
433
434
435
436
437
438
439
        /*
         * Generate a map of node->List of intermediate LSNs for this node.
         * to re-create the transaction chain.
         */
        TreeLocation location = new TreeLocation();
        Long undoLsn = lastLoggedLsn;
        TxnChain chain =
            new TxnChain(undoLsn, id, matchpointLsn, undoDatabases, envImpl);

        try {
View Full Code Here
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
         * the in-memory btree. We also need to make the latest version of any
         * record modified by the transaction obsolete.
         */
        Set<Long> alreadyUndoneLsns = new HashSet<Long>();
        Set<CompareSlot> alreadyUndoneSlots = new TreeSet<CompareSlot>();
        TreeLocation location = new TreeLocation();
        long undoLsn = lastLoggedLsn;
        try {
            while (undoLsn != NULL_LSN) {
                UndoReader undo = new UndoReader(envImpl,
                                                 undoLsn,
View Full Code Here
466
467
468
469
470
471
472
473
474
475
476
            (env, readBufferSize, DbLsn.makeLsn(fileNum, 0), fileNum,
             fileSummary);
        /* Validate all entries before ever deleting a file. */
        reader.setAlwaysValidateChecksum(true);
        try {
            final TreeLocation location = new TreeLocation();

            int nProcessedLNs = 0;
            while (reader.readNextEntryAllowExceptions()) {
                cleaner.nEntriesRead.increment();
                long logLsn = reader.getLastLsn();
View Full Code Here
691
692
693
694
695
696
697
698
        lookAheadCache.add
            (Long.valueOf(DbLsn.getFileOffset(logLsn)),
             new LNInfo(targetLN, dbId, key));

        processLN(DbLsn.getFileNumber(logLsn), new TreeLocation(),
                  lookAheadCache, dbCache);
    }
View Full Code Here
941
942
943
944
945
946
947
948
949
950
951
        DbTree dbMapTree = env.getDbTree();

        Map<Long, LNInfo> pendingLNs = fileSelector.getPendingLNs();
        if (pendingLNs != null) {
            TreeLocation location = new TreeLocation();

            for (Map.Entry<Long, LNInfo> entry : pendingLNs.entrySet()) {
                long originalLsn = entry.getKey();
                LNInfo info = entry.getValue();
                DatabaseId dbId = info.getDbId();
View Full Code Here
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
            return;
        }
        LNLogEntry lnEntry = reader.getLNLogEntry();
        lnEntry.postFetchInit(db);
        LN ln = lnEntry.getLN();
        TreeLocation location = new TreeLocation();
        long logLsn = reader.getLastLsn();
        long abortLsn = reader.getAbortLsn();
        boolean abortKnownDeleted = reader.getAbortKnownDeleted();

        try {
View Full Code Here
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
        for (LogEntryType lt : lnTypes) {
            reader.addTargetType(lt);
        }

        DbTree dbMapTree = envImpl.getDbTree();
        TreeLocation location = new TreeLocation();

        try {

            /*
             * Iterate over the target LNs and construct in-memory tree.
View Full Code Here
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
            }

            entry.postFetchInit(db);

            Tree tree = db.getTree();
            TreeLocation location = new TreeLocation();
            boolean parentFound = tree.getParentBINForChildLN
                (location, entry.getKey(), false /*splitsAllowed*/,
                 true /*findDeletedEntries*/, CacheMode.UNCHANGED);
            bin = location.bin;
            int index = location.index;
View Full Code Here
469
470
471
472
473
474
475
476
477
478
479
                return;
            }

            long undoLsn = reader.getLastLsn();

            TreeLocation location = new TreeLocation();
       
            /* Get the TxnChain for this log entry. */
            TxnChain chain = target.getChain(txnId, undoLsn, envImpl);
            UndoReader undo = new UndoReader(reader, envImpl.getDbTree());

View Full Code Here
522
523
524
525
526
527
528
529
530
531
532
            /* Create the file reader. */
            CleanerFileReader reader = new CleanerFileReader
                (env, readBufferSize, DbLsn.NULL_LSN, fileNum);

            DbTree dbMapTree = env.getDbMapTree();
            TreeLocation location = new TreeLocation();

            while (reader.readNextEntry()) {

                nEntriesRead += 1;
                long lsn = reader.getLastLsn();
View Full Code Here
TOP

Related Classes of com.sleepycat.je.tree.TreeLocation

  • com.sleepycat.je.cleaner.Cleaner
  • com.sleepycat.je.cleaner.FileProcessor
  • com.sleepycat.je.cleaner.UtilizationProfile
  • com.sleepycat.je.recovery.RecoveryManager
  • com.sleepycat.je.recovery.RollbackTracker$Scanner
  • com.sleepycat.je.rep.txn.ReplayTxn
  • com.sleepycat.je.txn.Txn
    • Copyright © 2018 www.massapicom. 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.