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

Examples of org.chaidb.db.index.btree.bufmgr.PageBufferManager$ThreadRecorder$PageCount

85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
        if (nextNodePos == null) {
            nextNodePos = nodePos;
        }

        final PageBufferManager buffer = btree.getBuffer();
        final BTreeSpec btreeSpec = btree.getBTreeSpec();
        PageNumber dupPageNumber = new PageNumber(nodePos.getPageNo());
        try {
            DataPage curDataPage = new DataPage(btree.getBtreeId(), dupPageNumber, btreeSpec, buffer);
            DataNode curDataNode = new DataNode(curDataPage, nodePos.getOffsetInPage());
            curDataNode.setFlags(BTreeSpec.DATA_NODE_DUP_NEXT);
            byte[] oldData = ByteTool.copyByteArray(curDataNode.getPage().getPage(), curDataNode.getNodeOffset(), (int) curDataNode.getNodeSpace());
            byte[] data = new byte[8];
            ByteTool.intToBytes(data, 0, nextNodePos.getOffsetInPage());
            ByteTool.intToBytes(data, 4, nextNodePos.getPageNo());
            curDataNode.storeNode(data, oldData, kContext);
            buffer.releasePage(btree.getBtreeId(), nodePos.getPageNo(), true);
        } catch (ChaiDBException e) {
            logger.error(e);
            buffer.releasePage(btree.getBtreeId(), nodePos.getPageNo(), false);
        }
    }
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
        }

        int nPageNo = bulkNextNodePos.getPageNo();

        int id = btree.getBtreeId();
        final PageBufferManager buffer = btree.getBuffer();
        final BTreeSpec btreeSpec = btree.getBTreeSpec();
        PageNumber dupPageNumber = new PageNumber(nPageNo);

        try {
            DataPage dupDataPage = new DataPage(id, dupPageNumber, btreeSpec, buffer);
            int pageCount = 0;
            while (pageCount < page && !finished) {
                NodeInfo node = new NodeInfo();
                node.nodePosition = bulkNextNodePos;
                int ret = getNode(dupDataPage, node);
                bulkNextNodePos = node.nodeNextPosition;
                if ((ret & DUP_FINISHED) == DUP_FINISHED) {
                    finished = true;
                    if ((ret & DUP_NEXT) == DUP_NEXT) {
                        break;
                    }
                }
                if ((ret & DUP_DATA) == DUP_DATA) {
                    cache.add(node);
                } else if ((ret & DUP_NEXT) == DUP_NEXT) {
                    if (bulkNextNodePos.getPageNo() == nPageNo) {
                        continue;
                    } else {
                        if (cache.size() > 0) {
                            pageCount++;
                        }
                        if (pageCount < page) {
                            nPageNo = bulkNextNodePos.getPageNo();
                            buffer.releasePage(id, dupPageNumber, false);
                            dupPageNumber = new PageNumber(nPageNo);
                            dupDataPage = new DataPage(id, dupPageNumber, btreeSpec, buffer);
                        }
                    }
                } else {
                    logger.error("Failed to get next dup node.");
                }
            }
        } catch (ChaiDBException e) {
            logger.error(e);
        } finally {
            buffer.releasePage(id, dupPageNumber, false);
        }
        return Collections.unmodifiableList(cache);
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
    protected NodeInfo getNextDataNode(NodePosition nodePos) {
        if (finished) {
            return null;
        }
        int id = btree.getBtreeId();
        final PageBufferManager buffer = btree.getBuffer();
        final BTreeSpec btreeSpec = btree.getBTreeSpec();
        dupNextCountForTest = dupNextCountForNextNode;
        dupNextCountForNextNode = 0;

        int curPageNo = nodePos.getPageNo();
        PageNumber dupPageNumber = new PageNumber(curPageNo);
        try {
            DataPage dupDataPage = new DataPage(id, dupPageNumber, btreeSpec, buffer);
            NodeInfo node = new NodeInfo();
            node.nodePosition = nodePos;
            while (true) {
                int ret = getNode(dupDataPage, node);
                if ((ret & DUP_FINISHED) == DUP_FINISHED) {
                    finished = true;
                    if ((ret & DUP_NEXT) == DUP_NEXT) {
                        break;
                    }
                }
                if ((ret & DUP_DATA) == DUP_DATA) {
                    return node;
                } else if ((ret & DUP_NEXT) == DUP_NEXT) {
                    node.nodePosition = node.nodeNextPosition;
                    if (node.nodeNextPosition.getPageNo() != curPageNo) {
                        curPageNo = node.nodeNextPosition.getPageNo();
                        buffer.releasePage(id, dupPageNumber, false);
                        dupPageNumber = new PageNumber(curPageNo);
                        dupDataPage = new DataPage(id, dupPageNumber, btreeSpec, buffer);
                    }
                } else {
                    logger.error("Failed to get next dup node.");
                    break;
                }
            }
        } catch (ChaiDBException e) {
            logger.error(e);
        } finally {
            buffer.releasePage(id, dupPageNumber, false);
        }

        return null;
    }
View Full Code Here
288
289
290
291
292
293
294
295
296
297
298
299
        byte[] data = null;
        try {
            //lock the page pointed by this node
            DataPage dataPage = new DataPage(page.getBtreeSpec().btree.getBtreeId(), pageNumber, page.getBtreeSpec(), page.getBuffer());
            data = new DataNode(dataPage, dataNodeOffset).getData();
            PageBufferManager buffer = page.getBuffer();
            buffer.releasePage(pageNumber.getTreeId(), pageNumber, false);
            return data;
        } catch (ChaiDBException e) {
            String details = page.pageNumber.toHexString() + " of " + page.getBtreeSpec().btree.getBTreeName();
            logger.error(details);
            throw e;
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
     *         update date:2001-10-12 by marriane,delete freelist recover
     */
    protected boolean doRedo(byte[] page) throws ChaiDBException {
        try {
            /* add page to freelist of BufferedPage in memory*/
            PageBufferManager bp = bpm;
            bp.addToFreeList(treeId, super.getPageNum(), new Integer(super.getTxnId()));

            if (DataPage.isNormalDataPage((int) pageFlag)) {
                bp.removeLatestDataPage(docid, treeId, super.getPageNum(), new Integer(super.getTxnId()));
            }

            return true;
        } catch (Exception e) {
            logger.debug(e);
View Full Code Here
203
204
205
206
207
208
209
210
211
     * redo
     *
     * @return boolean true|false
     */
    protected boolean doRedo() throws ChaiDBException {
        PageBufferManager bp = bpm;
        return bp.updateBTreeSpec(treeId, newPageNum, flag, new Integer(super.getTxnId()), docIdArr, this.btreeType);

    }
View Full Code Here
225
226
227
228
229
230
231
232
                /* needn't do undo while flag is NODE_SIZE_FLAG, because
                it is not meaning. ?!*/
                flag == NODE_SIZE_FLAG) //appended by ben at Aug, 06, 2002
            return false;

        PageBufferManager bp = bpm;
        return bp.updateBTreeSpec(treeId, oldPageNum, flag, new Integer(super.getTxnId()), docIdArr, this.btreeType);
    }
View Full Code Here
118
119
120
121
122
123
124
125
126
     * Get a page specified by this log record.
     *
     * @return page,if sucess. Otherwise, null.
     */
    protected byte[] getPage(int newPageNum, boolean redo) throws ChaiDBException {
        PageBufferManager bp = bpm;
        byte[] page = bp.getPage(super.getTxnId(), treeId, btreeType, newPageNum, redo, locks);
        return page;
    }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
    protected boolean doRedo(byte[] page) throws ChaiDBException {
        /* redo allocate a new page function */
        /* free the allocated page function */
        try {
            /* add page to freelist of BufferedPage in memory*/
            PageBufferManager bp = bpm;
            bp.addToFreeList(treeId, super.getPageNum(), new Integer(super.getTxnId()));

            if (DataPage.isNormalDataPage((int) pageFlag)) {
                bp.removeLatestDataPage(docid, treeId, super.getPageNum(), new Integer(super.getTxnId()));
            }
            return true;
        } catch (Exception e) {
            logger.debug(e);
            throw new ChaiDBException(ErrorCode.LOG_REDO_FAILED, e.toString());
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
            /* set metadata's lowbound and uppbound data with default value */
            System.arraycopy(ByteTool.shortToBytes((short) BTreeSpec.PAGE_HEADER_SIZE), 0, page, BTreeSpec.OFF_LOWERBOUND, 2);
            System.arraycopy(ByteTool.shortToBytes((short) BTreeSpec.PAGE_SIZE), 0, page, BTreeSpec.OFF_UPPERBOUND, 2);

            /* add page to freelist of BufferedPage in memory*/
            PageBufferManager bp = bpm;
            bp.addToFreeList(treeId, super.getPageNum(), new Integer(super.getTxnId()));

            if (isDataPage(pageFlag))
                bp.removeLatestDataPage(docId, treeId, super.getPageNum(), new Integer(super.getTxnId()));

            //add 1 on the free page number in metadata page of file if it's not in freelist
        } catch (Exception e) {
            logger.debug(e);
            throw new ChaiDBException(ErrorCode.LOG_UNDO_FAILED, e.toString());
View Full Code Here
TOP

Related Classes of org.chaidb.db.index.btree.bufmgr.PageBufferManager$ThreadRecorder$PageCount

  • org.chaidb.db.helper.AbstractDaemonThread
  • org.chaidb.db.helper.cache.storage.BTreePathStorage
  • org.chaidb.db.index.btree.BTreeNode
  • org.chaidb.db.index.btree.hbt.HyperBTreeBasicIterator
  • org.chaidb.db.index.btree.hbt.HyperBTreeCachedIterator
  • org.chaidb.db.index.btree.hbt.HyperBTreeIterator
  • org.chaidb.db.index.IDBIndex
  • org.chaidb.db.log.logrecord.BTreeFreeOverflowPageLogRecord
  • org.chaidb.db.log.logrecord.BTreeFreePageLogRecord
  • org.chaidb.db.log.logrecord.BTreeFreePageWithDataLogRecord
    • 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.