Package com.sleepycat.je.tree

Examples of com.sleepycat.je.tree.TreeLocation

880
881
882
883
884
885
886
887
888
889
890
        if (pendingLNs == null) {
            return;
        }

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

        for (int i = 0; i < pendingLNs.length; i += 1) {
            LNInfo info = pendingLNs[i];

            DatabaseId dbId = info.getDbId();
View Full Code Here
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
         * Search down to the bottom most level for the parent of this LN.
         */
        BIN bin = null;
        try {
            Tree tree = db.getTree();
            TreeLocation location = new TreeLocation();
            boolean parentFound = tree.getParentBINForChildLN
                (location,
                 entry.getKey(),
                 entry.getDupKey(),
                 entry.getLN(),
View Full Code Here
777
778
779
780
781
782
783
784
785
786
787
        Map countedFileSummaries = new HashMap(); // TxnNodeId -> file number
        Set countedAbortLsnNodes = new HashSet(); // set of TxnNodeId

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

            /*
             * Iterate over the target LNs and commit records, constructing
             * tree.
 
View Full Code Here
909
910
911
912
913
914
915
916
917
918
919
        }

        Set countedAbortLsnNodes = new HashSet(); // set of TxnNodeId

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

            /* Iterate over the target LNs and construct in- memory tree. */
            while (reader.readNextEntry()) {
                if (reader.isLN()) {
View Full Code Here
612
613
614
615
616
617
618
619
620
621
622
        long undoLsn = lastLoggedLsn;
        LogManager logManager = envImpl.getLogManager();

        try {
            Set alreadyUndone = new HashSet();
            TreeLocation location = new TreeLocation();
            while (undoLsn != DbLsn.NULL_LSN) {

                LNLogEntry undoEntry =
        (LNLogEntry) logManager.getLogEntry(undoLsn);
                LN undoLN = undoEntry.getLN();
View Full Code Here
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
         * We need to undo, or reverse the effect of any applied operations on
         * the in-memory btree. We also need to make the latest version of any
         * record modified by the transaction obsolete.
         */
        Set<Long> alreadyUndone = new HashSet<Long>();
        TreeLocation location = new TreeLocation();
        long undoLsn = lastLoggedLsn;
        try {
            while (undoLsn != NULL_LSN) {
                UndoReader undo = new UndoReader(envImpl,
                                                 undoLsn,
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
                (env, readBufferSize, DbLsn.NULL_LSN, fileNum);
            /* Validate all entries before ever deleting a file. */
            reader.setAlwaysValidateChecksum(true);

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

            int nProcessedLNs = 0;
            while (reader.readNextEntry()) {
                cleaner.nEntriesRead += 1;
                long lsn = reader.getLastLsn();
View Full Code Here
788
789
790
791
792
793
794
795
796
797
798
        Map countedFileSummaries = new HashMap(); // TxnNodeId -> file number
        Set countedAbortLsnNodes = new HashSet(); // set of TxnNodeId

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

            /*
             * Iterate over the target LNs and commit records, constructing
             * tree.
 
View Full Code Here
921
922
923
924
925
926
927
928
929
930
931
        }

        Set countedAbortLsnNodes = new HashSet(); // set of TxnNodeId

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

            /* Iterate over the target LNs and construct in- memory tree. */
            while (reader.readNextEntry()) {
                if (reader.isLN()) {
View Full Code Here
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
         * Search down to the bottom most level for the parent of this LN.
         */
        BIN bin = null;
        try {
            Tree tree = db.getTree();
            TreeLocation location = new TreeLocation();
            boolean parentFound = tree.getParentBINForChildLN
                (location,
                 entry.getKey(),
                 entry.getDupKey(),
                 entry.getLN(),
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.