Examples of com.sleepycat.je.tree.ChildReference

com.sleepycat.je.tree.ChildReference
A ChildReference is a reference in the tree from parent to child. It contains a node reference, key, and LSN.

             */
            BIN binDeltaBin =
    new BIN(DbInternal.dbGetDatabaseImpl(db), key, 10, 1);
            maxNodeId = binDeltaBin.getNodeId();
            binDeltaBin.latch();
            ChildReference newEntry =
                new ChildReference(null, key, DbLsn.makeLsn(0, 0));
            assertTrue(binDeltaBin.insertEntry(newEntry));


            lsn = binDeltaBin.logProvisional(logManager, in); // full


            /* Modify the bin with one entry so there can be a delta. */


            byte[] keyBuf2 = new byte[2];
            Arrays.fill(keyBuf2, (byte) (i + 2));
            ChildReference newEntry2 =
                new ChildReference(null, keyBuf2,
                                   DbLsn.makeLsn(100, 101));
            assertTrue(binDeltaBin.insertEntry(newEntry2));


            assertTrue(binDeltaBin.log(logManager, true, false) ==
           DbLsn.NULL_LSN);

View Full Code Here

         * @return true if the in-memory root was replaced.
         */
        public IN doWork(ChildReference root) 
            throws DatabaseException {


            ChildReference newRoot =
                new ChildReference(inFromLog, new byte[0], lsn);
            inFromLog.releaseLatch();


            if (root == null) {
                tree.setRoot(newRoot);
                inserted = true;

View Full Code Here

             */
            parent = db.getTree().searchSplitsAllowed
                (mainTreeKey, -1, true /*updateGeneration*/);
            assert parent instanceof BIN;


      ChildReference newRef =
    new ChildReference(inFromLog, mainTreeKey, lsn);
      index = parent.insertEntry1(newRef);
      if ((index >= 0 &&
     (index & IN.EXACT_MATCH) != 0)) {


    index &= ~IN.EXACT_MATCH;

View Full Code Here

                                                      inLsn);
                            replaced = true;
                        }
                    } else {
                        /* case 2: no match, insert the new node. */
                        ChildReference ref =
                            new ChildReference(inFromLog, idKey, inLsn);
                        boolean insertOk = result.parent.insertEntry(ref);
                        assert insertOk:
                            "Nomatch, couln't insert for LSN " +
          DbLsn.toString(logLsn) +
                            " parent=" +  result.parent.getNodeId() +
                            " index=" + result.index; 
                        inserted = true;
                    }
                }
            } else {
                /* case 2: no match */
                ChildReference newRef =
                    new ChildReference(inFromLog, idKey, inLsn);
                boolean insertOk = result.parent.insertEntry(newRef);
                assert insertOk;
                inserted = true;
            }
            success = true;

View Full Code Here

                                          TreeLocation location,
                                          long logLsn) 
        throws DatabaseException {
        
        /* Make a child reference as a candidate for insertion. */
        ChildReference newLNRef =
      new ChildReference(null, location.lnKey, logLsn);


        BIN parentBIN = location.bin;
        int entryIndex = parentBIN.insertEntry1(newLNRef);


        if ((entryIndex & IN.INSERT_SUCCESS) == 0) {

View Full Code Here

            /* 
             * Save a reference to the affected parent of this LN to place on
             * the delete info queue when the txn commits. If this is a
             * duplicate tree, we also have to update the duplicate tree count.
             */
            ChildReference dupCountRef = dupRoot.getDupCountLNRef();
            DupCountLN dcl = (DupCountLN)
                dupCountRef.fetchTarget(database, dupRoot);
            dupRoot.releaseLatch();
            LockResult dclGrantAndInfo = locker.lock
                (dcl.getNodeId(), LockType.WRITE, database);
 
            /*
             * The write lock request might have blocked while waiting for a
             * transaction that changed the oldLsn.  Re-get the reference to
             * the LN and get the old (abort) LSN out of it.
             */
            latchBIN();
            dupRoot = (DIN) bin.fetchTarget(index);
            dupRoot.latch();
            releaseBIN();
            dupCountRef = dupRoot.getDupCountLNRef();
            long oldDclLsn = dupCountRef.getLsn();
            dclGrantAndInfo.setAbortLsn(oldDclLsn,
                                        dupCountRef.isKnownDeleted());
            dcl = (DupCountLN) dupCountRef.fetchTarget(database, dupRoot);
            dcl.decDupCount();
      assert dcl.getDupCount() >= 0;
            EnvironmentImpl envImpl = database.getDbEnvironment();
            long dupCountLsn =
                dcl.log(envImpl, database.getId(), dupKey, oldDclLsn, locker);

View Full Code Here

             */
            parent = db.getTree().searchSplitsAllowed
                (mainTreeKey, -1, true /*updateGeneration*/);
            assert parent instanceof BIN;


      ChildReference newRef =
    new ChildReference(inFromLog, mainTreeKey, lsn);
      index = parent.insertEntry1(newRef);
      if ((index >= 0 &&
     (index & IN.EXACT_MATCH) != 0)) {


    index &= ~IN.EXACT_MATCH;

View Full Code Here

                                          TreeLocation location,
                                          long logLsn) 
        throws DatabaseException {
        
        /* Make a child reference as a candidate for insertion. */
        ChildReference newLNRef =
      new ChildReference(null, location.lnKey, logLsn);


        BIN parentBIN = location.bin;
        int entryIndex = parentBIN.insertEntry1(newLNRef);


        if ((entryIndex & IN.INSERT_SUCCESS) == 0) {

View Full Code Here

            boolean isDupCountLN = ln.containsDuplicates();
            long treeLsn;
      if (isDupCountLN) {
    parentDIN = (DIN) bin.fetchTarget(index);
    parentDIN.latch(Cleaner.UPDATE_GENERATION);
                ChildReference dclRef = parentDIN.getDupCountLNRef();
                treeLsn = dclRef.getLsn();
      } else {
                treeLsn = bin.getLsn(index);
      }


            /* Process this LN that was found in the tree. */

View Full Code Here

                 * the target is not resident.  We must call postFetchInit to
                 * initialize MapLNs that have not been fully initialized yet
                 * [#13191].
                 */
                if (isDupCountLN) {
                    ChildReference dclRef = parentDIN.getDupCountLNRef();
                    dclRef.setMigrate(true);
                    parentDIN.setDirty(true);


                    if (treeLsn == logLsn && dclRef.getTarget() == null) {
                        ln.postFetchInit(db, logLsn);
                        parentDIN.updateDupCountLN(ln);
                    }
                } else {
                    bin.setMigrate(index, true);

View Full Code Here

0 1 2 3

TOP

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

com.sleepycat.je.cleaner.Cleaner

com.sleepycat.je.cleaner.FileProcessor

com.sleepycat.je.dbi.CursorImpl

com.sleepycat.je.dbi.EnvironmentImpl

com.sleepycat.je.dbi.SortedLSNTreeWalker

com.sleepycat.je.log.INFileReaderTest

com.sleepycat.je.log.LoggableTest

com.sleepycat.je.recovery.RecoveryManager

com.sleepycat.je.recovery.RecoveryManager$RootUpdater

com.sleepycat.je.tree.dupConvert.DIN

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.