Package net.sf.joafip.kvstore.service

Examples of net.sf.joafip.kvstore.service.HeapException

593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
   * @throws HeapException
   */
  private boolean assertRecordSizeValue(final boolean freeRecord)
      throws HeapException {
    if (recordSize <= 0) {
      throw new HeapException("record size must be defined");
    }
    final int minimal;
    if (freeRecord) {
      minimal = FREE_RECORD_HEADER_SIZE;
    } else {
      minimal = DATA_RECORD_HEADER_SIZE;
    }
    if (recordSize < minimal) {
      throw new HeapException("record size too small: areaSize="
          + recordSize + ", minimal=" + minimal + ", free record="
          + freeRecord);
    }
    return true;
  }
View Full Code Here
682
683
684
685
686
687
688
689
690
  /**
   * @throws HeapException
   */
  private boolean assertRecordSizeKnew() throws HeapException {
    if (recordSize <= 0) {
      throw new HeapException("record size is unknow");
    }
    return true;
  }
View Full Code Here
692
693
694
695
696
697
698
699
700
  /**
   * @throws HeapException
   */
  private boolean assertDataAssociatedSizeKnew() throws HeapException {
    if (dataAssociatedSize == null) {
      throw new HeapException("data associated size is unknow");
    }
    return true;
  }
View Full Code Here
759
760
761
762
763
764
765
766
767
768
769
    // final int offset=numberOfByteReadWrote;
    final int read = readFileToIoBuffer(dataAssociatedSize + 4);// +4 for
    // crc32
    // AS-SERT
    if (read != dataAssociatedSize + 4) {
      throw new HeapException("expected " + (dataAssociatedSize + 4)
          + " but read " + read);
    }
    dataAssociated = readBytes(dataAssociatedSize);
    readAndCheckCrc32(0);
  }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
          lastHeapRecord = heapRecord;
          heapRecord = heapRecordIterator.getNextHeapRecord();
        }
        final long nextId = header.getNextDataRecordIdentifier();
        if (nextId <= identifier) {
          throw new HeapException("bad data record identifier");
        }
        checkLastRecord(header, lastHeapRecord);
      } catch (RBTException exception) {
        throw new HeapException(exception);
      }

      checkTotalNumberOfRecord(freeRecordCount, dataRecordCount);
    }
  }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
  }

  private void checkFreeNodeInTree(final HeapRecord heapRecord)
      throws RBTException, HeapException {
    if (!heapRecord.isFreeRecord()) {
      throw new HeapException("must be a free node");
    }
    final HeapFreeNode node = (HeapFreeNode) heapRecord.getFreeNode();
    if (node.getPositionInFile() != heapRecord.getPositionInFile()) {
      throw new HeapException(
          "position in file mismatch: heap record is "
              + heapRecord.getPositionInFile()
              + " and free node is " + node.getPositionInFile());
    }
    if (node.getRecordSize() != heapRecord.getRecordSize()) {
      throw new HeapException("area size mismatch: heap record is "
          + heapRecord.getRecordSize() + " and free node is "
          + node.getRecordSize());
    }

    HeapFreeNode found;
    found = (HeapFreeNode) freeNodeTree.search(heapRecord.getRecordSize());
    if (found == null) {
      throw new HeapException("free record must exist in free tree\n"
          + heapRecord);
    }
    while (found.getPositionInFile() != heapRecord.getPositionInFile()) {
      found = (HeapFreeNode) freeNodeTree.next(found);
      if (found == null
          || found.getRecordSize() != heapRecord.getRecordSize()) {
        throw new HeapException("free record must exist in free tree");
      }
    }
  }
View Full Code Here
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
   * @throws RBTException
   */
  private void checkDataNodeInTree(final HeapRecord heapRecord)
      throws HeapException, RBTException {
    if (heapRecord.isFreeRecord()) {
      throw new HeapException("must be a data record");
    }
    final DataRecordIdentifier identifier = heapRecord.getNodeIdentifier();
    final HeapIdNode foundIdNode = (HeapIdNode) idNodeTree
        .search(identifier);
    if (foundIdNode == null) {
      throw new HeapException("record for data, node #" + identifier
          + " must be in node identifier tree");
    }
    if (foundIdNode.getPositionInFile() != heapRecord.getPositionInFile()) {
      throw new HeapException("data record detached from id tree");
    }
  }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
  private void checkLastRecord(final HeapHeader header,
      final HeapRecord lastHeapRecord) throws HeapException {
    if (lastHeapRecord == null) {
      if (header.getLastRecordPositionInFile() != -1) {
        throw new HeapException(
            "last record position in file must be undefined");
      }
      if (header.getEndOfRecordPositionInFile() != HeapHeader.HEAP_HEADER_SIZE) {
        throw new HeapException(
            "end of record position in file must be end of header size");
      }
    } else {
      if (header.getLastRecordPositionInFile() != lastHeapRecord
          .getPositionInFile()) {
        throw new HeapException(
            "last record position in file must be last record position");
      }
      if (header.getEndOfRecordPositionInFile() != lastHeapRecord
          .getPositionInFile() + lastHeapRecord.getRecordSize()) {
        throw new HeapException(
            "end of record position in file must be end of last record");
      }
    }
  }
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
    final RedBlackTreeIntegrityChecker<DataRecordIdentifier> idNodeTreeChecker =
    /**/new RedBlackTreeIntegrityChecker<DataRecordIdentifier>(idNodeTree);
    try {
      idNodeTreeChecker.checkTree();
    } catch (RBTException exception) {
      throw new HeapException("identifier tree corruption", exception);
    }
    final RedBlackTreeIntegrityChecker<Integer> freeNodeTreeChecker =
    /**/new RedBlackTreeIntegrityChecker<Integer>(freeNodeTree);
    try {
      freeNodeTreeChecker.checkTree();
    } catch (RBTException exception) {
      throw new HeapException("free node tree corruption", exception);
    }
  }
View Full Code Here
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
      final int dataRecordCount) throws HeapException {
    try {
      final int numberOfRecord = idNodeTree.getNumberOfElement()
          + freeNodeTree.getNumberOfElement();
      if (dataRecordCount + freeRecordCount != numberOfRecord) {
        throw new HeapException(
            "bad number of record count: dataRecordCount="
                + dataRecordCount + ", freeRecordCount="
                + freeRecordCount + ", idNode="
                + idNodeTree.getNumberOfElement()
                + ", freeNode="
                + freeNodeTree.getNumberOfElement()
                + ", freeNode+idNode=" + numberOfRecord);
      }
    } catch (RBTException exception) {
      throw new HeapException("failed get number of element", exception);
    }
  }
View Full Code Here
TOP

Related Classes of net.sf.joafip.kvstore.service.HeapException

  • net.sf.joafip.btreeplus.entity.DataBlockPage
  • net.sf.joafip.btreeplus.entity.FreePage
  • net.sf.joafip.btreeplus.entity.HeaderPage
  • net.sf.joafip.btreeplus.entity.LeafPage
  • net.sf.joafip.btreeplus.entity.NonTerminalPage
  • net.sf.joafip.btreeplus.entity.PageRecord
  • net.sf.joafip.btreeplus.service.BtreePlusDataMgrIntegrityChecker
  • net.sf.joafip.btreeplus.service.BtreePlusElementMgr
  • net.sf.joafip.btreeplus.service.BtreePlusNonTerminalPageBalanceMergeTest
  • net.sf.joafip.heapfile.record.entity.HeapHeader
    • 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.