Examples of com.sleepycat.je.tree.Tree

com.sleepycat.je.tree.Tree
Tree implements the JE B+Tree. A note on tree search patterns: There's a set of Tree.search* methods. Some clients of the tree use those search methods directly, whereas other clients of the tree tend to use methods built on top of search. The semantics of search* are they leave you pointing at a BIN or IN they don't tell you where the reference of interest is. The semantics of the get* methods are: they leave you pointing at a BIN or IN they return the index of the slot of interest they traverse down to whatever level is needed they are built on top of search* methods. For the future: Over time, we need to clarify which methods are to be used by clients of the tree. Preferably clients that call the tree use get*, although their are cases where they need visibility into the tree structure. Also, search* should return the location of the slot to save us a second binary search. Search Method Call Hierarchy ---------------------------- getFirst/LastNode search CALLED BY: CursorImpl.getFirstOrLast getNext/PrevBin getParentINForChildIN searchSubTree CALLED BY: DupConvert CursorImpl.getNext getParentINForChildIN IN.findParent does not use shared latching CALLED BY: Checkpointer.flushIN (doFetch=false, targetLevel=-1) FileProcessor.processIN (doFetch=true, targetLevel=LEVEL) Evictor.evictIN (doFetch=true, targetLevel=-1) RecoveryManager.replaceOrInsertChild (doFetch=true, targetLevel=-1) getNext/PrevBin (doFetch=true, targetLevel=-1) search searchSubTree CALLED BY: CursorImpl.searchAndPosition INCompressor to find BIN searchSubTree uses shared grandparent latching getParentBINForChildLN searchSplitsAllowed CALLED BY: RecoveryManager.redo RecoveryManager.recoveryUndo search CALLED BY: RecoveryManager.abortUndo RecoveryManager.rollbackUndo FileProcessor.processLN Cleaner.processPendingLN UtilizationProfile.verifyLsnIsObsolete (utility) findBinForInsert searchSplitsAllowed CALLED BY: CursorImpl.putInternal searchSplitsAllowed uses shared non-grandparent latching CALLED BY: DupConvert (instead of findBinForInsert, which needs a cursor) Possible Shared Latching Improvements ------------------------------------- By implementing grandparent latching in searchSplitsAllowed we would increase performance slightly in these cases: Insertions By implementing shared latching in getParentINForChildIN we would get better concurrency in these cases: Cursor scan, when moving between BINs Eviction Checkpoints Cleaning INs By implementing shared latching for BINs we would get better concurrency in these cases: Reads when LN is in cache, or LN is not needed (key-only op, e.g., dups)

            if (!target.isEvictable()) {
                success = true;
                return evictedBytes;
            }
            /* Regular eviction. */
            Tree tree = db.getTree();


            /*
             * Unit testing.  The target is latched and we are about to release
             * that latch and search for the parent.  Make sure that other
             * operations, such as dirtying an LN in the target BIN, can occur
             * safely in this window.  [#18227]
             */
            assert TestHookExecute.doHookIfSet(preEvictINHook);


            /* getParentINForChildIN unlatches target. */
            targetIsLatched = false;
            SearchResult result = tree.getParentINForChildIN
                (target, true /*requireExactMatch*/, CacheMode.UNCHANGED);


            if (result.exactParentFound) {
                evictedBytes = evictIN(target, result.parent,
                                       result.index, backgroundIO, source);

View Full Code Here


        /*
         * The tree needs the env, make sure we assign it before
         * allocating the tree.
         */
        tree = new Tree(this);


        /* For error messages only. */
        debugDatabaseName = dbName;
    }

View Full Code Here

     */
    public DatabaseImpl() {
        id = new DatabaseId();
        envImpl = null;


        tree = new Tree();


        commonInit();


        /* initWithEnvironment is called after reading and envImpl is set.  */
    }

View Full Code Here

                nLNsDeadThisRun++;
                completed = true;
                return;
            }


            Tree tree = db.getTree();
            assert tree != null;


            /*
       * Search down to the bottom most level for the parent of this LN.
       */
            boolean parentFound = tree.getParentBINForChildLN
                (location, key, dupKey, ln,
                 false,  // splitsAllowed
                 true,   // findDeletedEntries
                 false,  // searchDupTree
                 false); // updateGeneration

View Full Code Here

                obsolete = true;
                completed = true;
                return;
            }


            Tree tree = db.getTree();
            assert tree != null;


            /* Get a non-blocking lock on the original node ID. */
      locker = new BasicLocker(env);
      if (locker.nonBlockingReadLock(ln.getNodeId(), db) ==
                LockGrantType.DENIED) {
                /* Try again later. */
                nPendingLNsLocked++;
                lockDenied = true;
                completed = true;
                return;
            }


            /*
       * Search down to the bottom most level for the parent of this LN.
             *
             * We pass searchDupTree=true to search the dup tree by nodeID if
             * necessary.  This handles the case where dupKey is null because
             * the pending entry was a deleted single-duplicate in a BIN.
       */
            parentFound = tree.getParentBINForChildLN
                (location, key, dupKey, ln,
                 false,  // splitsAllowed
                 true,   // findDeletedEntries
                 true,   // searchDupTree
                 false); // updateGeneration

View Full Code Here

                obsolete = true;
                completed = true;
                return;
            }


            Tree tree = db.getTree();
            assert tree != null;
            IN inInTree = findINInTree(tree, db, inClone, lsn);


            if (inInTree == null) {
                /* IN is no longer in the tree.  Do nothing. */

View Full Code Here

        /*
         * 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(),
                 false,  // splitsAllowed

View Full Code Here

                                long logLsn)
        throws DatabaseException {


        boolean found = false;
        boolean deleted = false;
        Tree tree = db.getTree();
        SearchResult result = new SearchResult();


        try {
            /* Search for the parent of this target node. */
            result = db.getTree().getParentINForChildIN
                (nodeId,
                 containsDuplicates,
                 false, // do not stop at dup tree root
                 mainKey,
                 dupKey,
                 false, // requireExactMatch
                 false, // updateGeneration
                 -1,    // targetLevel
                 null,  // trackingList
                 true); // doFetch


            if (result.parent == null) {
                /* It's null -- we actually deleted the root. */
                tree.withRootLatched(new RootDeleter(tree));
                DbTree dbTree = db.getDbEnvironment().getDbMapTree();
                dbTree.modifyDbRoot(db);
                traceRootDeletion(Level.FINE, db);
                deleted = true;
            } else if (result.exactParentFound) {

View Full Code Here

     */
    private void replaceOrInsertRoot(DatabaseImpl db, IN inFromLog, long lsn)
        throws DatabaseException {


        boolean success = true;
        Tree tree = db.getTree();
        RootUpdater rootUpdater = new RootUpdater(tree, inFromLog, lsn);
        try {
            /* Run the root updater while the root latch is held. */
            tree.withRootLatched(rootUpdater);


            /* Update the mapLN if necessary */
            if (rootUpdater.updateDone()) {
                EnvironmentImpl env = db.getDbEnvironment();
                env.getDbMapTree().modifyDbRoot(db);

View Full Code Here

                         boolean logProvisionally,
                         boolean allowDeltas,
                         long checkpointStart)
        throws DatabaseException {


        Tree tree = targetRef.db.getTree();
        boolean targetWasRoot = false;
        if (targetRef.isDbRoot) {
            /* We're trying to flush the root. */
            RootFlusher flusher =
    new RootFlusher(targetRef.db, logManager, targetRef.nodeId);
            tree.withRootLatched(flusher);
            boolean flushed = flusher.getFlushed();


            /* 
             * If this target isn't the root anymore, we'll have to handled it
             * like a regular node.
             */
            targetWasRoot = flusher.stillRoot();
            
            /* 
             * Update the tree's owner, whether it's the env root or the
             * dbmapping tree.
             */
            if (flushed) {
                DbTree dbTree = targetRef.db.getDbEnvironment().getDbMapTree();
                dbTree.modifyDbRoot(targetRef.db);
                nFullINFlushThisRun++;
                nFullINFlush++;
            }
        }


        /* 
         * The following attempt to flush applies to two cases:
   * 
         * (1) the target was not ever the root
   * 
         * (2) the target was the root, when the checkpoint dirty set was 
         * assembled but is not the root now.
   * 
         */
        if (!targetWasRoot) {


            /*
             * The "isRoot" param is used to stop a search in
             * BIN.descendOnParentSearch and is passed as false (never stop).
             */ 
            SearchResult result =
                tree.getParentINForChildIN(targetRef.nodeId,
                                           targetRef.containsDuplicates,
                                           false,  // isRoot
                                           targetRef.mainTreeKey,
                                           targetRef.dupTreeKey,
                                           false,  // requireExactMatch

View Full Code Here

0 1 2 3 4 5 6

TOP

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

com.sleepycat.je.CacheMode

com.sleepycat.je.cleaner.Cleaner

com.sleepycat.je.cleaner.FileProcessor

com.sleepycat.je.cleaner.UtilizationProfile

com.sleepycat.je.dbi.CursorImpl

com.sleepycat.je.dbi.DatabaseImpl

com.sleepycat.je.dbi.DbConfigManager

com.sleepycat.je.dbi.DbCursorTestBase

com.sleepycat.je.dbi.DbTree

com.sleepycat.je.dbi.EnvironmentImpl

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.