Package org.chaidb.db.index.btree.bufmgr

Examples of org.chaidb.db.index.btree.bufmgr.PageNumber

204
205
206
207
208
209
210
211
212
213
214
        boolean succ = false;

        //retry to finish this operation with maxized MAX_RETRYS times.
        for (int retry = 0; retry < BTreeLock.MAX_RETRYS + 1 && !succ; retry++)
            try {
                PageNumber root = getDocRoot(((NodeId) key).getDocId(), kContext);

                root = store(key, value, mode, root, kContext);
                if (root == null) {
                    succ = true;
                    return;
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
    /**
     * load root of the specified document
     */
    private PageNumber getDocRoot(int docID, KernelContext kContext) throws ChaiDBException {

        PageNumber docRoot;
        docRoot = (PageNumber) id2root.get(new Integer(docID));

        if (docRoot != null) {
            return docRoot;
        }
        Key tmpKey = new IntKey(docID);
        indexBTree.acquire(kContext, READ_MODE);
        byte[] bRoot = null;
        try {
            bRoot = (byte[]) indexBTree.lookup(tmpKey, kContext);
        } finally {
            indexBTree.release(kContext);
        }
        if (bRoot != null) docRoot = new PageNumber(ByteTool.bytesToInt(bRoot, 0, btreeSpec.isMsbFirst()));
        else docRoot = new PageNumber(BTreeSpec.INVALID_PAGENO);
        synchronized (cleanIdQueue) {
            if (id2root.size() >= MAX_ENTRY_NUMBERS) {
                //need to kick out last entry.
                Integer doc_id = null;
                //Todo: cleanIdQueue.size == 0 , exist memory leak
                for (int i = 0; i < KICK_NUMBERS && cleanIdQueue.size() > 0; i++) {
                    doc_id = (Integer) cleanIdQueue.removeLast();
                    id2root.remove(doc_id);
                }
            }

            id2root.put(new Integer(docID), docRoot);
            cleanIdQueue.addFirst(new Integer(docID));
        }


        docRoot.setTreeId(id);
        return docRoot;
    }
View Full Code Here
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
        int txnId = kContext.getLocker();
        boolean needLog = kContext.getNeedLog();

        //search key2root first
        Integer idocID = new Integer(docID);
        PageNumber subRoot = (PageNumber) id2root.get(idocID);
        if (subRoot == null) {
            Key tmpKey = new IntKey(docID);
            indexBTree.acquire(kContext, READ_MODE);
            byte[] bRoot = null;
            try {
                bRoot = (byte[]) indexBTree.lookup(tmpKey, kContext);
            } finally {
                indexBTree.release(kContext);
            }

            if (bRoot != null) subRoot = new PageNumber(ByteTool.bytesToInt(bRoot, 0, btreeSpec.isMsbFirst()));
            else subRoot = null;

        }

        if (needLog) {
            BTreeSpecLogRecord logRec = new BTreeSpecLogRecord(id, subRoot == null ? -1 : subRoot.getPageNumber(), docRoot.getPageNumber(), BTreeSpecLogRecord.DOC_ROOT_PAGE_NUMBER_FLAG, txnId, docID, IDBIndex.ID2NODE_BTREE);
            logRec.log();
        }

        docRoot.setTreeId(id);
        if (subRoot == null) id2root.put(idocID, docRoot);
        else subRoot.setPageNumber(docRoot);

        //This situation occurs to do commit like operation(such as delete, modify node etc)after getDocument operation
        synchronized (cleanIdQueue) {
            cleanIdQueue.remove(idocID);
        }
View Full Code Here
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
    }

    //called when a txn commits if txn exists OR btree destroy if no txn
    public void flushDocRoot(Integer docID, KernelContext kContext) throws ChaiDBException {

        PageNumber docRoot = (PageNumber) id2root.get(docID);
        if (docRoot == null) {
            //Due to dirty root don't join into clean queue, so don't be kick out.
            //so there is no entry in memory, it represents it don't need be flushed.
//            if (Debug.DEBUG_ID2ROOT){    //Todo: remove it
//                new Throwable("doc id " + docID.intValue()).printStackTrace(System.err);
//            }
            return;
        }
        this.getBTreeSpec().setModified(true);
        /*Appended by ben zhang at aug, 14, 2002 */
        IntKey tmpKey = new IntKey(docID.intValue());

        try {
            indexBTree.acquire(kContext, WRITE_MODE);
            if (docRoot.getPageNumber() <= 0) {
                indexBTree.delete(tmpKey, kContext);
            } else {
                indexBTree.store(tmpKey, ByteTool.intToBytes(docRoot.getPageNumber(), btreeSpec.isMsbFirst()), STORE_REPLACE, kContext);

            }
        } finally {
            indexBTree.release(kContext);
        }
View Full Code Here
401
402
403
404
405
406
407
408
409
410
411
412
413
            }

            return;
        }

        PageNumber subRoot = (PageNumber) id2root.get(idocID);
        if (subRoot == null) id2root.put(idocID, docRoot);
        else subRoot.setPageNumber(docRoot);


        synchronized (cleanIdQueue) {
            cleanIdQueue.remove(idocID);
            cleanIdQueue.addFirst(idocID);
View Full Code Here
438
439
440
441
442
443
444
445
446
447
     * @param kContext
     * @throws ChaiDBException
     */
    public void deleteSubTree(int docId, KernelContext kContext) throws ChaiDBException {
        this.getBTreeSpec().setModified(true);
        PageNumber subRoot = new PageNumber(getDocRoot(docId, kContext));
        updateDocRoot(docId, new PageNumber(BTreeSpec.INVALID_PAGENO), kContext);
        delSubTreeCore(subRoot, false, kContext);

    }
View Full Code Here
57
58
59
60
61
62
63
64
    protected void initParameter(IBTree bt, BTreeSpec btSpec, PageBufferManager buffer, KernelContext kContext) {
        setBtree(bt);
        setBtreeSpec(btSpec);
        this.setBuffer(buffer);
        setCurrentPageNumber(new PageNumber());
        this.setkContext(kContext);
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
    /**
     * find the leftmost leaf page number, store it to currentPageNumber
     */
    protected void init() throws ChaiDBException {
        PageNumber root = null;
        root = getBtreeSpec().getRootPageNumber();
        TreeEnumeratorUtils.findLeftMostLeaf(this, root);
    }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
                // and there is no successing leaf page after the current one, return false
                int nodes = leafPage.getCurrNodeNumbers();

                if (getNextNodeIndex() >= nodes) {
                    if (leafPage.nextPage.getPageNumber() > 0) setNextNodeIndex(0);
                    this.currentPageNumber = new PageNumber(leafPage.nextPage);

                } else return true;

            }
        } catch (Exception e) {
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
    public void acquire(KernelContext kContext, int mode) throws ChaiDBException {
        Lock lock = null;
        try {
            if (mode == IBTreeConst.READ_MODE) {
                lock = BTreeLock.acquire(kContext, LockManager.LOCK_WAITING, new PageNumber(id, 0, 0), LockManager.LOCK_READ);
            } else if (mode == IBTreeConst.WRITE_MODE) {
                lock = BTreeLock.acquire(kContext, LockManager.LOCK_WAITING, new PageNumber(id, 0, 0), LockManager.LOCK_WRITE);
            } else {
                logger.fatal("Open mode is not recognized.");
            }
            kContext.addLock(getBTreeName(), lock);
        } catch (ChaiDBException e) {
View Full Code Here
TOP

Related Classes of org.chaidb.db.index.btree.bufmgr.PageNumber

  • org.chaidb.db.index.btree.AbstractBTree
  • org.chaidb.db.index.btree.BTree
  • org.chaidb.db.index.btree.BTreeChanges
  • org.chaidb.db.index.btree.BTreeEnumerator
  • org.chaidb.db.index.btree.BTreeNode
  • org.chaidb.db.index.btree.BTreePage
  • org.chaidb.db.index.btree.BTreeSpec
  • org.chaidb.db.index.btree.DataNode
  • org.chaidb.db.index.btree.DataPage
  • org.chaidb.db.index.btree.Debug
    • 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.