From: James Ahlborn Date: Sun, 27 Feb 2011 14:11:43 +0000 (+0000) Subject: more work around interpreting index data, add support for multiple logical indexes... X-Git-Tag: jackcess-1.2.3~4 X-Git-Url: https://source.dussan.org/?a=commitdiff_plain;h=0f7f2b12b4d01615e079133356a7d390b78cb9ec;p=jackcess.git more work around interpreting index data, add support for multiple logical indexes backed by the same index data (fixes #3192058) git-svn-id: https://svn.code.sf.net/p/jackcess/code/jackcess/trunk@513 f203690c-595d-4dc9-a70b-905162fa7fd2 --- diff --git a/src/changes/changes.xml b/src/changes/changes.xml index 0808cd7..e4f2b9c 100644 --- a/src/changes/changes.xml +++ b/src/changes/changes.xml @@ -9,6 +9,10 @@ Add support for writing all fixed length column types into variable length fields. + + More fixes related to reading and interpreting index information. + Handle multiple logical indexes backed by the same index data. + Allow MSISAM files to be written (experimental). diff --git a/src/java/com/healthmarketscience/jackcess/BigIndex.java b/src/java/com/healthmarketscience/jackcess/BigIndex.java deleted file mode 100755 index 965cc96..0000000 --- a/src/java/com/healthmarketscience/jackcess/BigIndex.java +++ /dev/null @@ -1,86 +0,0 @@ -/* -Copyright (c) 2008 Health Market Science, Inc. - -This library is free software; you can redistribute it and/or -modify it under the terms of the GNU Lesser General Public -License as published by the Free Software Foundation; either -version 2.1 of the License, or (at your option) any later version. - -This library is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -Lesser General Public License for more details. - -You should have received a copy of the GNU Lesser General Public -License along with this library; if not, write to the Free Software -Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 -USA - -You can contact Health Market Science at info@healthmarketscience.com -or at the following address: - -Health Market Science -2700 Horizon Drive -Suite 200 -King of Prussia, PA 19406 -*/ - -package com.healthmarketscience.jackcess; - -import java.io.IOException; - - -/** - * Implementation of an Access table index which supports large indexes. - * @author James Ahlborn - */ -public class BigIndex extends Index { - - /** Cache which manages the index pages */ - private final IndexPageCache _pageCache; - - public BigIndex(Table table, int uniqueEntryCount, - int uniqueEntryCountOffset) { - super(table, uniqueEntryCount, uniqueEntryCountOffset); - _pageCache = new IndexPageCache(this); - } - - @Override - protected void updateImpl() throws IOException { - _pageCache.write(); - } - - @Override - protected void readIndexEntries() - throws IOException - { - _pageCache.setRootPageNumber(getRootPageNumber()); - } - - @Override - protected DataPage findDataPage(Entry entry) - throws IOException - { - return _pageCache.findCacheDataPage(entry); - } - - @Override - protected DataPage getDataPage(int pageNumber) - throws IOException - { - return _pageCache.getCacheDataPage(pageNumber); - } - - @Override - public String toString() { - return super.toString() + "\n" + _pageCache.toString(); - } - - /** - * Used by unit tests to validate the internal status of the index. - */ - void validate() throws IOException { - _pageCache.validate(); - } - -} diff --git a/src/java/com/healthmarketscience/jackcess/BigIndexData.java b/src/java/com/healthmarketscience/jackcess/BigIndexData.java new file mode 100755 index 0000000..c06af26 --- /dev/null +++ b/src/java/com/healthmarketscience/jackcess/BigIndexData.java @@ -0,0 +1,86 @@ +/* +Copyright (c) 2008 Health Market Science, Inc. + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +USA + +You can contact Health Market Science at info@healthmarketscience.com +or at the following address: + +Health Market Science +2700 Horizon Drive +Suite 200 +King of Prussia, PA 19406 +*/ + +package com.healthmarketscience.jackcess; + +import java.io.IOException; + + +/** + * Implementation of an Access table index which supports large indexes. + * @author James Ahlborn + */ +public class BigIndexData extends IndexData { + + /** Cache which manages the index pages */ + private final IndexPageCache _pageCache; + + public BigIndexData(Table table, int number, int uniqueEntryCount, + int uniqueEntryCountOffset) { + super(table, number, uniqueEntryCount, uniqueEntryCountOffset); + _pageCache = new IndexPageCache(this); + } + + @Override + protected void updateImpl() throws IOException { + _pageCache.write(); + } + + @Override + protected void readIndexEntries() + throws IOException + { + _pageCache.setRootPageNumber(getRootPageNumber()); + } + + @Override + protected DataPage findDataPage(Entry entry) + throws IOException + { + return _pageCache.findCacheDataPage(entry); + } + + @Override + protected DataPage getDataPage(int pageNumber) + throws IOException + { + return _pageCache.getCacheDataPage(pageNumber); + } + + @Override + public String toString() { + return super.toString() + "\n" + _pageCache.toString(); + } + + /** + * Used by unit tests to validate the internal status of the index. + */ + void validate() throws IOException { + _pageCache.validate(); + } + +} diff --git a/src/java/com/healthmarketscience/jackcess/Cursor.java b/src/java/com/healthmarketscience/jackcess/Cursor.java index d783925..ee8395e 100644 --- a/src/java/com/healthmarketscience/jackcess/Cursor.java +++ b/src/java/com/healthmarketscience/jackcess/Cursor.java @@ -1193,24 +1193,26 @@ public abstract class Cursor implements Iterable> /** IndexDirHandler for backward traversal */ private final IndexDirHandler _reverseDirHandler = new ReverseIndexDirHandler(); + /** logical index which this cursor is using */ + private final Index _index; /** Cursor over the entries of the relvant index */ - private final Index.EntryCursor _entryCursor; + private final IndexData.EntryCursor _entryCursor; private IndexCursor(Table table, Index index, - Index.EntryCursor entryCursor) + IndexData.EntryCursor entryCursor) throws IOException { super(new Id(table, index), table, new IndexPosition(entryCursor.getFirstEntry()), new IndexPosition(entryCursor.getLastEntry())); - - index.initialize(); + _index = index; + _index.initialize(); _entryCursor = entryCursor; } @Override public Index getIndex() { - return _entryCursor.getIndex(); + return _index; } @Override @@ -1247,7 +1249,7 @@ public abstract class Cursor implements Iterable> protected boolean findRowImpl(Column columnPattern, Object valuePattern) throws IOException { - Object[] rowValues = _entryCursor.getIndex().constructIndexRow( + Object[] rowValues = _entryCursor.getIndexData().constructIndexRow( columnPattern.getName(), valuePattern); if(rowValues == null) { @@ -1257,7 +1259,7 @@ public abstract class Cursor implements Iterable> // sweet, we can use our index _entryCursor.beforeEntry(rowValues); - Index.Entry startEntry = _entryCursor.getNextEntry(); + IndexData.Entry startEntry = _entryCursor.getNextEntry(); if(!startEntry.getRowId().isValid()) { // at end of index, no potential matches return false; @@ -1273,8 +1275,8 @@ public abstract class Cursor implements Iterable> protected boolean findRowImpl(Map rowPattern) throws IOException { - Index index = _entryCursor.getIndex(); - Object[] rowValues = index.constructIndexRow(rowPattern); + IndexData indexData = _entryCursor.getIndexData(); + Object[] rowValues = indexData.constructIndexRow(rowPattern); if(rowValues == null) { // bummer, use the default table scan @@ -1283,7 +1285,7 @@ public abstract class Cursor implements Iterable> // sweet, we can use our index _entryCursor.beforeEntry(rowValues); - Index.Entry startEntry = _entryCursor.getNextEntry(); + IndexData.Entry startEntry = _entryCursor.getNextEntry(); if(!startEntry.getRowId().isValid()) { // at end of index, no potential matches return false; @@ -1291,7 +1293,7 @@ public abstract class Cursor implements Iterable> restorePosition(new IndexPosition(startEntry)); Map indexRowPattern = null; - if(rowPattern.size() == index.getColumns().size()) { + if(rowPattern.size() == indexData.getColumns().size()) { // the rowPattern matches our index columns exactly, so we can // streamline our testing below indexRowPattern = rowPattern; @@ -1300,7 +1302,7 @@ public abstract class Cursor implements Iterable> // do more work when testing below indexRowPattern = new LinkedHashMap(); - for(Index.ColumnDescriptor idxCol : index.getColumns()) { + for(IndexData.ColumnDescriptor idxCol : indexData.getColumns()) { indexRowPattern.put(idxCol.getName(), rowValues[idxCol.getColumnIndex()]); } @@ -1336,7 +1338,7 @@ public abstract class Cursor implements Iterable> { IndexDirHandler handler = getDirHandler(moveForward); IndexPosition endPos = (IndexPosition)handler.getEndPosition(); - Index.Entry entry = handler.getAnotherEntry(); + IndexData.Entry entry = handler.getAnotherEntry(); return ((!entry.equals(endPos.getEntry())) ? new IndexPosition(entry) : endPos); } @@ -1346,7 +1348,7 @@ public abstract class Cursor implements Iterable> * cursor logic from value storage. */ private abstract class IndexDirHandler extends DirHandler { - public abstract Index.Entry getAnotherEntry() + public abstract IndexData.Entry getAnotherEntry() throws IOException; } @@ -1363,7 +1365,7 @@ public abstract class Cursor implements Iterable> return getLastPosition(); } @Override - public Index.Entry getAnotherEntry() throws IOException { + public IndexData.Entry getAnotherEntry() throws IOException { return _entryCursor.getNextEntry(); } } @@ -1381,7 +1383,7 @@ public abstract class Cursor implements Iterable> return getFirstPosition(); } @Override - public Index.Entry getAnotherEntry() throws IOException { + public IndexData.Entry getAnotherEntry() throws IOException { return _entryCursor.getPreviousEntry(); } } @@ -1521,9 +1523,9 @@ public abstract class Cursor implements Iterable> */ private static final class IndexPosition extends Position { - private final Index.Entry _entry; + private final IndexData.Entry _entry; - private IndexPosition(Index.Entry entry) { + private IndexPosition(IndexData.Entry entry) { _entry = entry; } @@ -1532,7 +1534,7 @@ public abstract class Cursor implements Iterable> return getEntry().getRowId(); } - public Index.Entry getEntry() { + public IndexData.Entry getEntry() { return _entry; } diff --git a/src/java/com/healthmarketscience/jackcess/CursorBuilder.java b/src/java/com/healthmarketscience/jackcess/CursorBuilder.java index 68df492..c1e930d 100644 --- a/src/java/com/healthmarketscience/jackcess/CursorBuilder.java +++ b/src/java/com/healthmarketscience/jackcess/CursorBuilder.java @@ -121,16 +121,16 @@ public class CursorBuilder { boolean found = false; for(Index index : _table.getIndexes()) { - Collection indexColumns = index.getColumns(); + Collection indexColumns = index.getColumns(); if(indexColumns.size() != searchColumns.size()) { continue; } Iterator sIter = searchColumns.iterator(); - Iterator iIter = indexColumns.iterator(); + Iterator iIter = indexColumns.iterator(); boolean matches = true; while(sIter.hasNext()) { Column sCol = sIter.next(); - Index.ColumnDescriptor iCol = iIter.next(); + IndexData.ColumnDescriptor iCol = iIter.next(); if(!ObjectUtils.equals(sCol.getName(), iCol.getName())) { matches = false; break; diff --git a/src/java/com/healthmarketscience/jackcess/Index.java b/src/java/com/healthmarketscience/jackcess/Index.java index 2c0645c..f5cb874 100644 --- a/src/java/com/healthmarketscience/jackcess/Index.java +++ b/src/java/com/healthmarketscience/jackcess/Index.java @@ -28,160 +28,53 @@ King of Prussia, PA 19406 package com.healthmarketscience.jackcess; import java.io.IOException; -import java.nio.ByteBuffer; -import java.nio.ByteOrder; -import java.util.ArrayList; -import java.util.Arrays; import java.util.Collections; -import java.util.Comparator; import java.util.List; import java.util.Map; import org.apache.commons.logging.Log; import org.apache.commons.logging.LogFactory; -import static com.healthmarketscience.jackcess.IndexCodes.*; -import static com.healthmarketscience.jackcess.ByteUtil.ByteStream; - /** - * Access table index + * Access table (logical) index. Logical indexes are backed for IndexData, + * where one or more logical indexes could be backed by the same data. + * * @author Tim McCune */ -public abstract class Index implements Comparable { +public class Index implements Comparable { protected static final Log LOG = LogFactory.getLog(Index.class); - - /** special entry which is less than any other entry */ - public static final Entry FIRST_ENTRY = - createSpecialEntry(RowId.FIRST_ROW_ID); - - /** special entry which is greater than any other entry */ - public static final Entry LAST_ENTRY = - createSpecialEntry(RowId.LAST_ROW_ID); - - protected static final int INVALID_INDEX_PAGE_NUMBER = 0; - - /** Max number of columns in an index */ - private static final int MAX_COLUMNS = 10; - - protected static final byte[] EMPTY_PREFIX = new byte[0]; - - private static final short COLUMN_UNUSED = -1; - - private static final byte ASCENDING_COLUMN_FLAG = (byte)0x01; - - private static final byte UNIQUE_INDEX_FLAG = (byte)0x01; - private static final byte IGNORE_NULLS_INDEX_FLAG = (byte)0x02; - + /** index type for primary key indexes */ private static final byte PRIMARY_KEY_INDEX_TYPE = (byte)1; /** index type for foreign key indexes */ private static final byte FOREIGN_KEY_INDEX_TYPE = (byte)2; - private static final int MAX_TEXT_INDEX_CHAR_LENGTH = - (JetFormat.TEXT_FIELD_MAX_LENGTH / JetFormat.TEXT_FIELD_UNIT_SIZE); - - private static final ByteOrder ENTRY_BYTE_ORDER = ByteOrder.BIG_ENDIAN; - - /** type attributes for Entries which simplify comparisons */ - public enum EntryType { - /** comparable type indicating this Entry should always compare less than - valid RowIds */ - ALWAYS_FIRST, - /** comparable type indicating this Entry should always compare less than - other valid entries with equal entryBytes */ - FIRST_VALID, - /** comparable type indicating this RowId should always compare - normally */ - NORMAL, - /** comparable type indicating this Entry should always compare greater - than other valid entries with equal entryBytes */ - LAST_VALID, - /** comparable type indicating this Entry should always compare greater - than valid RowIds */ - ALWAYS_LAST; - } - - static final Comparator BYTE_CODE_COMPARATOR = - new Comparator() { - public int compare(byte[] left, byte[] right) { - if(left == right) { - return 0; - } - if(left == null) { - return -1; - } - if(right == null) { - return 1; - } - - int len = Math.min(left.length, right.length); - int pos = 0; - while((pos < len) && (left[pos] == right[pos])) { - ++pos; - } - if(pos < len) { - return ((ByteUtil.asUnsignedByte(left[pos]) < - ByteUtil.asUnsignedByte(right[pos])) ? -1 : 1); - } - return ((left.length < right.length) ? -1 : - ((left.length > right.length) ? 1 : 0)); - } - }; - - - /** owning table */ - private final Table _table; - /** Page number of the root index data */ - private int _rootPageNumber; - /** offset within the tableDefinition buffer of the uniqueEntryCount for - this index */ - private final int _uniqueEntryCountOffset; - /** The number of unique entries which have been added to this index. note, - however, that it is never decremented, only incremented (as observed in - Access). */ - private int _uniqueEntryCount; - /** List of columns and flags */ - private final List _columns = - new ArrayList(); + /** the actual data backing this index (more than one index may be backed by + the same data */ + private final IndexData _data; /** 0-based index number */ - private int _indexNumber; - /** flags for this index */ - private byte _indexFlags; + private final int _indexNumber; /** the type of the index */ - private byte _indexType; + private final byte _indexType; /** Index name */ private String _name; - /** Usage map of pages that this index owns */ - private UsageMap _ownedPages; - /** true if the index entries have been initialized, - false otherwise */ - private boolean _initialized; - /** modification count for the table, keeps cursors up-to-date */ - private int _modCount; - /** temp buffer used to read/write the index pages */ - private final TempBufferHolder _indexBufferH = - TempBufferHolder.newHolder(TempBufferHolder.Type.SOFT, true); - /** temp buffer used to create index entries */ - private ByteStream _entryBuffer; - /** max size for all the entries written to a given index data page */ - private final int _maxPageEntrySize; - /** FIXME, for SimpleIndex, we can't write multi-page indexes or indexes using the entry compression scheme */ - private boolean _readOnly; - protected Index(Table table, int uniqueEntryCount, - int uniqueEntryCountOffset) - { - _table = table; - _uniqueEntryCount = uniqueEntryCount; - _uniqueEntryCountOffset = uniqueEntryCountOffset; - _maxPageEntrySize = calcMaxPageEntrySize(_table.getFormat()); + protected Index(IndexData data, int indexNumber, byte indexType) { + _data = data; + _indexNumber = indexNumber; + _indexType = indexType; + data.addIndex(this); + } + + public IndexData getIndexData() { + return _data; } public Table getTable() { - return _table; + return getIndexData().getTable(); } public JetFormat getFormat() { @@ -192,28 +85,20 @@ public abstract class Index implements Comparable { return getTable().getPageChannel(); } - public void setIndexNumber(int indexNumber) { - _indexNumber = indexNumber; - } - public int getIndexNumber() { return _indexNumber; } - public void setIndexType(byte indexType) { - _indexType = indexType; - } - public byte getIndexFlags() { - return _indexFlags; + return getIndexData().getIndexFlags(); } public int getUniqueEntryCount() { - return _uniqueEntryCount; + return getIndexData().getUniqueEntryCount(); } public int getUniqueEntryCountOffset() { - return _uniqueEntryCountOffset; + return getIndexData().getUniqueEntryCountOffset(); } public String getName() { @@ -236,7 +121,7 @@ public abstract class Index implements Comparable { * Whether or not {@code null} values are actually recorded in the index. */ public boolean shouldIgnoreNulls() { - return((_indexFlags & IGNORE_NULLS_INDEX_FLAG) != 0); + return getIndexData().shouldIgnoreNulls(); } /** @@ -252,56 +137,21 @@ public abstract class Index implements Comparable { * */ public boolean isUnique() { - return(isPrimaryKey() || ((_indexFlags & UNIQUE_INDEX_FLAG) != 0)); + return getIndexData().isUnique(); } /** * Returns the Columns for this index (unmodifiable) */ - public List getColumns() { - return Collections.unmodifiableList(_columns); + public List getColumns() { + return getIndexData().getColumns(); } /** * Whether or not the complete index state has been read. */ public boolean isInitialized() { - return _initialized; - } - - protected int getRootPageNumber() { - return _rootPageNumber; - } - - protected void setReadOnly() { - _readOnly = true; - } - - protected int getMaxPageEntrySize() { - return _maxPageEntrySize; - } - - void addOwnedPage(int pageNumber) throws IOException { - _ownedPages.addPageNumber(pageNumber); - } - - /** - * Returns the number of index entries in the index. Only called by unit - * tests. - *

- * Forces index initialization. - */ - protected int getEntryCount() - throws IOException - { - initialize(); - EntryCursor cursor = cursor(); - Entry endEntry = cursor.getLastEntry(); - int count = 0; - while(!endEntry.equals(cursor.getNextEntry())) { - ++count; - } - return count; + return getIndexData().isInitialized(); } /** @@ -310,10 +160,7 @@ public abstract class Index implements Comparable { * actually needed. */ public void initialize() throws IOException { - if(!_initialized) { - readIndexEntries(); - _initialized = true; - } + getIndexData().initialize(); } /** @@ -321,56 +168,8 @@ public abstract class Index implements Comparable { *

* Forces index initialization. */ - public void update() throws IOException - { - // make sure we've parsed the entries - initialize(); - - if(_readOnly) { - throw new UnsupportedOperationException( - "FIXME cannot write indexes of this type yet, see Database javadoc for info on enabling large index support"); - } - updateImpl(); - } - - /** - * Read the index info from a tableBuffer - * @param tableBuffer table definition buffer to read from initial info - * @param availableColumns Columns that this index may use - */ - public void read(ByteBuffer tableBuffer, List availableColumns) - throws IOException - { - for (int i = 0; i < MAX_COLUMNS; i++) { - short columnNumber = tableBuffer.getShort(); - byte colFlags = tableBuffer.get(); - if (columnNumber != COLUMN_UNUSED) { - // find the desired column by column number (which is not necessarily - // the same as the column index) - Column idxCol = null; - for(Column col : availableColumns) { - if(col.getColumnNumber() == columnNumber) { - idxCol = col; - break; - } - } - if(idxCol == null) { - throw new IOException("Could not find column with number " - + columnNumber + " for index " + getName()); - } - _columns.add(newColumnDescriptor(idxCol, colFlags)); - } - } - - int umapRowNum = tableBuffer.get(); - int umapPageNum = ByteUtil.get3ByteInt(tableBuffer); - _ownedPages = UsageMap.read(getTable().getDatabase(), umapPageNum, - umapRowNum, false); - - _rootPageNumber = tableBuffer.getInt(); - ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX_FLAGS); //Forward past Unknown - _indexFlags = tableBuffer.get(); - ByteUtil.forward(tableBuffer, getFormat().SKIP_AFTER_INDEX_FLAGS); //Forward past other stuff + public void update() throws IOException { + getIndexData().update(); } /** @@ -384,68 +183,7 @@ public abstract class Index implements Comparable { public void addRow(Object[] row, RowId rowId) throws IOException { - int nullCount = countNullValues(row); - boolean isNullEntry = (nullCount == _columns.size()); - if(shouldIgnoreNulls() && isNullEntry) { - // nothing to do - return; - } - if(isPrimaryKey() && (nullCount > 0)) { - throw new IOException("Null value found in row " + Arrays.asList(row) - + " for primary key index " + this); - } - - // make sure we've parsed the entries - initialize(); - - Entry newEntry = new Entry(createEntryBytes(row), rowId); - if(addEntry(newEntry, isNullEntry, row)) { - ++_modCount; - } else { - LOG.warn("Added duplicate index entry " + newEntry + " for row: " + - Arrays.asList(row)); - } - } - - /** - * Adds an entry to the correct index dataPage, maintaining the order. - */ - private boolean addEntry(Entry newEntry, boolean isNullEntry, Object[] row) - throws IOException - { - DataPage dataPage = findDataPage(newEntry); - int idx = dataPage.findEntry(newEntry); - if(idx < 0) { - // this is a new entry - idx = missingIndexToInsertionPoint(idx); - - Position newPos = new Position(dataPage, idx, newEntry, true); - Position nextPos = getNextPosition(newPos); - Position prevPos = getPreviousPosition(newPos); - - // determine if the addition of this entry would break the uniqueness - // constraint. See isUnique() for some notes about uniqueness as - // defined by Access. - boolean isDupeEntry = - (((nextPos != null) && - newEntry.equalsEntryBytes(nextPos.getEntry())) || - ((prevPos != null) && - newEntry.equalsEntryBytes(prevPos.getEntry()))); - if(isUnique() && !isNullEntry && isDupeEntry) - { - throw new IOException( - "New row " + Arrays.asList(row) + - " violates uniqueness constraint for index " + this); - } - - if(!isDupeEntry) { - ++_uniqueEntryCount; - } - - dataPage.addEntry(idx, newEntry); - return true; - } - return false; + getIndexData().addRow(row, rowId); } /** @@ -459,61 +197,7 @@ public abstract class Index implements Comparable { public void deleteRow(Object[] row, RowId rowId) throws IOException { - int nullCount = countNullValues(row); - if(shouldIgnoreNulls() && (nullCount == _columns.size())) { - // nothing to do - return; - } - - // make sure we've parsed the entries - initialize(); - - Entry oldEntry = new Entry(createEntryBytes(row), rowId); - if(removeEntry(oldEntry)) { - ++_modCount; - } else { - LOG.warn("Failed removing index entry " + oldEntry + " for row: " + - Arrays.asList(row)); - } - } - - /** - * Removes an entry from the relevant index dataPage, maintaining the order. - * Will search by RowId if entry is not found (in case a partial entry was - * provided). - */ - private boolean removeEntry(Entry oldEntry) - throws IOException - { - DataPage dataPage = findDataPage(oldEntry); - int idx = dataPage.findEntry(oldEntry); - boolean doRemove = false; - if(idx < 0) { - // the caller may have only read some of the row data, if this is the - // case, just search for the page/row numbers - // FIXME, we could force caller to get relevant values? - EntryCursor cursor = cursor(); - Position tmpPos = null; - Position endPos = cursor._lastPos; - while(!endPos.equals( - tmpPos = cursor.getAnotherPosition(Cursor.MOVE_FORWARD))) { - if(tmpPos.getEntry().getRowId().equals(oldEntry.getRowId())) { - dataPage = tmpPos.getDataPage(); - idx = tmpPos.getIndex(); - doRemove = true; - break; - } - } - } else { - doRemove = true; - } - - if(doRemove) { - // found it! - dataPage.removeEntry(idx); - } - - return doRemove; + getIndexData().deleteRow(row, rowId); } /** @@ -521,7 +205,7 @@ public abstract class Index implements Comparable { *

* Forces index initialization. */ - public EntryCursor cursor() + public IndexData.EntryCursor cursor() throws IOException { return cursor(null, true, null, true); @@ -540,114 +224,14 @@ public abstract class Index implements Comparable { * the last entry * @param endInclusive whether or not endRow is inclusive or exclusive */ - public EntryCursor cursor(Object[] startRow, - boolean startInclusive, - Object[] endRow, - boolean endInclusive) - throws IOException - { - initialize(); - Entry startEntry = FIRST_ENTRY; - byte[] startEntryBytes = null; - if(startRow != null) { - startEntryBytes = createEntryBytes(startRow); - startEntry = new Entry(startEntryBytes, - (startInclusive ? - RowId.FIRST_ROW_ID : RowId.LAST_ROW_ID)); - } - Entry endEntry = LAST_ENTRY; - if(endRow != null) { - // reuse startEntryBytes if startRow and endRow are same array. this is - // common for "lookup" code - byte[] endEntryBytes = ((startRow == endRow) ? - startEntryBytes : - createEntryBytes(endRow)); - endEntry = new Entry(endEntryBytes, - (endInclusive ? - RowId.LAST_ROW_ID : RowId.FIRST_ROW_ID)); - } - return new EntryCursor(findEntryPosition(startEntry), - findEntryPosition(endEntry)); - } - - private Position findEntryPosition(Entry entry) - throws IOException - { - DataPage dataPage = findDataPage(entry); - int idx = dataPage.findEntry(entry); - boolean between = false; - if(idx < 0) { - // given entry was not found exactly. our current position is now - // really between two indexes, but we cannot support that as an integer - // value, so we set a flag instead - idx = missingIndexToInsertionPoint(idx); - between = true; - } - return new Position(dataPage, idx, entry, between); - } - - private Position getNextPosition(Position curPos) - throws IOException - { - // get the next index (between-ness is handled internally) - int nextIdx = curPos.getNextIndex(); - Position nextPos = null; - if(nextIdx < curPos.getDataPage().getEntries().size()) { - nextPos = new Position(curPos.getDataPage(), nextIdx); - } else { - int nextPageNumber = curPos.getDataPage().getNextPageNumber(); - DataPage nextDataPage = null; - while(nextPageNumber != INVALID_INDEX_PAGE_NUMBER) { - DataPage dp = getDataPage(nextPageNumber); - if(!dp.isEmpty()) { - nextDataPage = dp; - break; - } - nextPageNumber = dp.getNextPageNumber(); - } - if(nextDataPage != null) { - nextPos = new Position(nextDataPage, 0); - } - } - return nextPos; - } - - /** - * Returns the Position before the given one, or {@code null} if none. - */ - private Position getPreviousPosition(Position curPos) + public IndexData.EntryCursor cursor(Object[] startRow, + boolean startInclusive, + Object[] endRow, + boolean endInclusive) throws IOException { - // get the previous index (between-ness is handled internally) - int prevIdx = curPos.getPrevIndex(); - Position prevPos = null; - if(prevIdx >= 0) { - prevPos = new Position(curPos.getDataPage(), prevIdx); - } else { - int prevPageNumber = curPos.getDataPage().getPrevPageNumber(); - DataPage prevDataPage = null; - while(prevPageNumber != INVALID_INDEX_PAGE_NUMBER) { - DataPage dp = getDataPage(prevPageNumber); - if(!dp.isEmpty()) { - prevDataPage = dp; - break; - } - prevPageNumber = dp.getPrevPageNumber(); - } - if(prevDataPage != null) { - prevPos = new Position(prevDataPage, - (prevDataPage.getEntries().size() - 1)); - } - } - return prevPos; - } - - /** - * Returns the valid insertion point for an index indicating a missing - * entry. - */ - protected static int missingIndexToInsertionPoint(int idx) { - return -(idx + 1); + return getIndexData().cursor(startRow, startInclusive, endRow, + endInclusive); } /** @@ -659,17 +243,7 @@ public abstract class Index implements Comparable { */ public Object[] constructIndexRowFromEntry(Object... values) { - if(values.length != _columns.size()) { - throw new IllegalArgumentException( - "Wrong number of column values given " + values.length + - ", expected " + _columns.size()); - } - int valIdx = 0; - Object[] idxRow = new Object[getTable().getColumnCount()]; - for(ColumnDescriptor col : _columns) { - idxRow[col.getColumnIndex()] = values[valIdx++]; - } - return idxRow; + return getIndexData().constructIndexRowFromEntry(values); } /** @@ -691,38 +265,17 @@ public abstract class Index implements Comparable { */ public Object[] constructIndexRow(Map row) { - for(ColumnDescriptor col : _columns) { - if(!row.containsKey(col.getName())) { - return null; - } - } - - Object[] idxRow = new Object[getTable().getColumnCount()]; - for(ColumnDescriptor col : _columns) { - idxRow[col.getColumnIndex()] = row.get(col.getName()); - } - return idxRow; + return getIndexData().constructIndexRow(row); } @Override public String toString() { StringBuilder rtn = new StringBuilder(); - rtn.append("\tName: (" + _table.getName() + ") " + _name); + rtn.append("\tName: (" + getTable().getName() + ") " + _name); rtn.append("\n\tNumber: " + _indexNumber); - rtn.append("\n\tPage number: " + _rootPageNumber); rtn.append("\n\tIs Primary Key: " + isPrimaryKey()); rtn.append("\n\tIs Foreign Key: " + isForeignKey()); - rtn.append("\n\tIs Unique: " + isUnique()); - rtn.append("\n\tIgnore Nulls: " + shouldIgnoreNulls()); - rtn.append("\n\tColumns: " + _columns); - rtn.append("\n\tInitialized: " + _initialized); - if(_initialized) { - try { - rtn.append("\n\tEntryCount: " + getEntryCount()); - } catch(IOException e) { - throw new RuntimeException(e); - } - } + rtn.append(_data.toString()); rtn.append("\n\n"); return rtn.toString(); } @@ -737,1742 +290,4 @@ public abstract class Index implements Comparable { } } - /** - * Write the given index page out to a buffer - */ - protected void writeDataPage(DataPage dataPage) - throws IOException - { - if(dataPage.getCompressedEntrySize() > _maxPageEntrySize) { - if(this instanceof SimpleIndex) { - throw new UnsupportedOperationException( - "FIXME cannot write large index yet, see Database javadoc for info on enabling large index support"); - } - throw new IllegalStateException("data page is too large"); - } - - ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel()); - buffer.put(dataPage.isLeaf() ? - PageTypes.INDEX_LEAF : - PageTypes.INDEX_NODE ); //Page type - buffer.put((byte) 0x01); //Unknown - buffer.putShort((short) 0); //Free space - buffer.putInt(getTable().getTableDefPageNumber()); - - buffer.putInt(0); //Unknown - buffer.putInt(dataPage.getPrevPageNumber()); //Prev page - buffer.putInt(dataPage.getNextPageNumber()); //Next page - buffer.putInt(dataPage.getChildTailPageNumber()); //ChildTail page - - byte[] entryPrefix = dataPage.getEntryPrefix(); - buffer.putShort((short) entryPrefix.length); // entry prefix byte count - buffer.put((byte) 0); //Unknown - - byte[] entryMask = new byte[getFormat().SIZE_INDEX_ENTRY_MASK]; - // first entry includes the prefix - int totalSize = entryPrefix.length; - for(Entry entry : dataPage.getEntries()) { - totalSize += (entry.size() - entryPrefix.length); - int idx = totalSize / 8; - entryMask[idx] |= (1 << (totalSize % 8)); - } - buffer.put(entryMask); - - // first entry includes the prefix - buffer.put(entryPrefix); - - for(Entry entry : dataPage.getEntries()) { - entry.write(buffer, entryPrefix); - } - - // update free space - buffer.putShort(2, (short) (getFormat().PAGE_SIZE - buffer.position())); - - getPageChannel().writePage(buffer, dataPage.getPageNumber()); - } - - /** - * Reads an index page, populating the correct collection based on the page - * type (node or leaf). - */ - protected void readDataPage(DataPage dataPage) - throws IOException - { - ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel()); - getPageChannel().readPage(buffer, dataPage.getPageNumber()); - - boolean isLeaf = isLeafPage(buffer); - dataPage.setLeaf(isLeaf); - - // note, "header" data is in LITTLE_ENDIAN format, entry data is in - // BIG_ENDIAN format - int entryPrefixLength = ByteUtil.getUnsignedShort( - buffer, getFormat().OFFSET_INDEX_COMPRESSED_BYTE_COUNT); - int entryMaskLength = getFormat().SIZE_INDEX_ENTRY_MASK; - int entryMaskPos = getFormat().OFFSET_INDEX_ENTRY_MASK; - int entryPos = entryMaskPos + entryMaskLength; - int lastStart = 0; - int totalEntrySize = 0; - byte[] entryPrefix = null; - List entries = new ArrayList(); - TempBufferHolder tmpEntryBufferH = - TempBufferHolder.newHolder(TempBufferHolder.Type.HARD, true, - ENTRY_BYTE_ORDER); - - Entry prevEntry = FIRST_ENTRY; - for (int i = 0; i < entryMaskLength; i++) { - byte entryMask = buffer.get(entryMaskPos + i); - for (int j = 0; j < 8; j++) { - if ((entryMask & (1 << j)) != 0) { - int length = (i * 8) + j - lastStart; - buffer.position(entryPos + lastStart); - - // determine if we can read straight from the index page (if no - // entryPrefix). otherwise, create temp buf with complete entry. - ByteBuffer curEntryBuffer = buffer; - int curEntryLen = length; - if(entryPrefix != null) { - curEntryBuffer = getTempEntryBuffer( - buffer, length, entryPrefix, tmpEntryBufferH); - curEntryLen += entryPrefix.length; - } - totalEntrySize += curEntryLen; - - Entry entry = newEntry(curEntryBuffer, curEntryLen, isLeaf); - if(prevEntry.compareTo(entry) >= 0) { - throw new IOException("Unexpected order in index entries, " + - prevEntry + " >= " + entry); - } - - entries.add(entry); - - if((entries.size() == 1) && (entryPrefixLength > 0)) { - // read any shared entry prefix - entryPrefix = new byte[entryPrefixLength]; - buffer.position(entryPos + lastStart); - buffer.get(entryPrefix); - } - - lastStart += length; - prevEntry = entry; - } - } - } - - dataPage.setEntryPrefix(entryPrefix != null ? entryPrefix : EMPTY_PREFIX); - dataPage.setEntries(entries); - dataPage.setTotalEntrySize(totalEntrySize); - - int prevPageNumber = buffer.getInt(getFormat().OFFSET_PREV_INDEX_PAGE); - int nextPageNumber = buffer.getInt(getFormat().OFFSET_NEXT_INDEX_PAGE); - int childTailPageNumber = - buffer.getInt(getFormat().OFFSET_CHILD_TAIL_INDEX_PAGE); - - dataPage.setPrevPageNumber(prevPageNumber); - dataPage.setNextPageNumber(nextPageNumber); - dataPage.setChildTailPageNumber(childTailPageNumber); - } - - /** - * Returns a new Entry of the correct type for the given data and page type. - */ - private Entry newEntry(ByteBuffer buffer, int entryLength, boolean isLeaf) - throws IOException - { - if(isLeaf) { - return new Entry(buffer, entryLength); - } - return new NodeEntry(buffer, entryLength); - } - - /** - * Returns an entry buffer containing the relevant data for an entry given - * the valuePrefix. - */ - private ByteBuffer getTempEntryBuffer( - ByteBuffer indexPage, int entryLen, byte[] valuePrefix, - TempBufferHolder tmpEntryBufferH) - { - ByteBuffer tmpEntryBuffer = tmpEntryBufferH.getBuffer( - getPageChannel(), valuePrefix.length + entryLen); - - // combine valuePrefix and rest of entry from indexPage, then prep for - // reading - tmpEntryBuffer.put(valuePrefix); - tmpEntryBuffer.put(indexPage.array(), indexPage.position(), entryLen); - tmpEntryBuffer.flip(); - - return tmpEntryBuffer; - } - - /** - * Determines if the given index page is a leaf or node page. - */ - private static boolean isLeafPage(ByteBuffer buffer) - throws IOException - { - byte pageType = buffer.get(0); - if(pageType == PageTypes.INDEX_LEAF) { - return true; - } else if(pageType == PageTypes.INDEX_NODE) { - return false; - } - throw new IOException("Unexpected page type " + pageType); - } - - /** - * Determines the number of {@code null} values for this index from the - * given row. - */ - private int countNullValues(Object[] values) - { - if(values == null) { - return _columns.size(); - } - - // annoyingly, the values array could come from different sources, one - // of which will make it a different size than the other. we need to - // handle both situations. - int nullCount = 0; - for(ColumnDescriptor col : _columns) { - Object value = values[col.getColumnIndex()]; - if(col.isNullValue(value)) { - ++nullCount; - } - } - - return nullCount; - } - - /** - * Creates the entry bytes for a row of values. - */ - private byte[] createEntryBytes(Object[] values) throws IOException - { - if(values == null) { - return null; - } - - if(_entryBuffer == null) { - _entryBuffer = new ByteStream(); - } - _entryBuffer.reset(); - - for(ColumnDescriptor col : _columns) { - Object value = values[col.getColumnIndex()]; - if(Column.isRawData(value)) { - // ignore it, we could not parse it - continue; - } - - col.writeValue(value, _entryBuffer); - } - - return _entryBuffer.toByteArray(); - } - - /** - * Writes the current index state to the database. Index has already been - * initialized. - */ - protected abstract void updateImpl() throws IOException; - - /** - * Reads the actual index entries. - */ - protected abstract void readIndexEntries() - throws IOException; - - /** - * Finds the data page for the given entry. - */ - protected abstract DataPage findDataPage(Entry entry) - throws IOException; - - /** - * Gets the data page for the pageNumber. - */ - protected abstract DataPage getDataPage(int pageNumber) - throws IOException; - - /** - * Flips the first bit in the byte at the given index. - */ - private static byte[] flipFirstBitInByte(byte[] value, int index) - { - value[index] = (byte)(value[index] ^ 0x80); - - return value; - } - - /** - * Flips all the bits in the byte array. - */ - private static byte[] flipBytes(byte[] value) { - return flipBytes(value, 0, value.length); - } - - /** - * Flips the bits in the specified bytes in the byte array. - */ - private static byte[] flipBytes(byte[] value, int offset, int length) { - for(int i = offset; i < (offset + length); ++i) { - value[i] = (byte)(~value[i]); - } - return value; - } - - /** - * Writes the value of the given column type to a byte array and returns it. - */ - private static byte[] encodeNumberColumnValue(Object value, Column column) - throws IOException - { - // always write in big endian order - return column.write(value, 0, ENTRY_BYTE_ORDER).array(); - } - - /** - * Converts an index value for a text column into the entry value (which - * is based on a variety of nifty codes). - */ - private static void writeNonNullIndexTextValue( - Object value, ByteStream bout, boolean isAscending) - throws IOException - { - // first, convert to string - String str = Column.toCharSequence(value).toString(); - - // all text columns (including memos) are only indexed up to the max - // number of chars in a VARCHAR column - if(str.length() > MAX_TEXT_INDEX_CHAR_LENGTH) { - str = str.substring(0, MAX_TEXT_INDEX_CHAR_LENGTH); - } - - // record pprevious entry length so we can do any post-processing - // necessary for this entry (handling descending) - int prevLength = bout.getLength(); - - // now, convert each character to a "code" of one or more bytes - ExtraCodesStream extraCodes = null; - ByteStream unprintableCodes = null; - ByteStream crazyCodes = null; - int charOffset = 0; - for(int i = 0; i < str.length(); ++i) { - - char c = str.charAt(i); - CharHandler ch = getCharHandler(c); - - int curCharOffset = charOffset; - byte[] bytes = ch.getInlineBytes(); - if(bytes != null) { - // write the "inline" codes immediately - bout.write(bytes); - - // only increment the charOffset for chars with inline codes - ++charOffset; - } - - if(ch.getType() == Type.SIMPLE) { - // common case, skip further code handling - continue; - } - - bytes = ch.getExtraBytes(); - byte extraCodeModifier = ch.getExtraByteModifier(); - if((bytes != null) || (extraCodeModifier != 0)) { - if(extraCodes == null) { - extraCodes = new ExtraCodesStream(str.length()); - } - - // keep track of the extra codes for later - writeExtraCodes(curCharOffset, bytes, extraCodeModifier, extraCodes); - } - - bytes = ch.getUnprintableBytes(); - if(bytes != null) { - if(unprintableCodes == null) { - unprintableCodes = new ByteStream(); - } - - // keep track of the unprintable codes for later - writeUnprintableCodes(curCharOffset, bytes, unprintableCodes, - extraCodes); - } - - byte crazyFlag = ch.getCrazyFlag(); - if(crazyFlag != 0) { - if(crazyCodes == null) { - crazyCodes = new ByteStream(); - } - - // keep track of the crazy flags for later - crazyCodes.write(crazyFlag); - } - } - - // write end text flag - bout.write(END_TEXT); - - boolean hasExtraCodes = trimExtraCodes( - extraCodes, (byte)0, INTERNATIONAL_EXTRA_PLACEHOLDER); - boolean hasUnprintableCodes = (unprintableCodes != null); - boolean hasCrazyCodes = (crazyCodes != null); - if(hasExtraCodes || hasUnprintableCodes || hasCrazyCodes) { - - // we write all the international extra bytes first - if(hasExtraCodes) { - extraCodes.writeTo(bout); - } - - if(hasCrazyCodes || hasUnprintableCodes) { - - // write 2 more end flags - bout.write(END_TEXT); - bout.write(END_TEXT); - - // next come the crazy flags - if(hasCrazyCodes) { - - writeCrazyCodes(crazyCodes, bout); - - // if we are writing unprintable codes after this, tack on another - // code - if(hasUnprintableCodes) { - bout.write(CRAZY_CODES_UNPRINT_SUFFIX); - } - } - - // then we write all the unprintable extra bytes - if(hasUnprintableCodes) { - - // write another end flag - bout.write(END_TEXT); - - unprintableCodes.writeTo(bout); - } - } - } - - // handle descending order by inverting the bytes - if(!isAscending) { - - // we actually write the end byte before flipping the bytes, and write - // another one after flipping - bout.write(END_EXTRA_TEXT); - - // flip the bytes that we have written thus far for this text value - flipBytes(bout.getBytes(), prevLength, (bout.getLength() - prevLength)); - } - - // write end extra text - bout.write(END_EXTRA_TEXT); - } - - /** - * Encodes the given extra code info in the given stream. - */ - private static void writeExtraCodes( - int charOffset, byte[] bytes, byte extraCodeModifier, - ExtraCodesStream extraCodes) - throws IOException - { - // we fill in a placeholder value for any chars w/out extra codes - int numChars = extraCodes.getNumChars(); - if(numChars < charOffset) { - int fillChars = charOffset - numChars; - extraCodes.writeFill(fillChars, INTERNATIONAL_EXTRA_PLACEHOLDER); - extraCodes.incrementNumChars(fillChars); - } - - if(bytes != null) { - - // write the actual extra codes and update the number of chars - extraCodes.write(bytes); - extraCodes.incrementNumChars(1); - - } else { - - // extra code modifiers modify the existing extra code bytes and do not - // count as additional extra code chars - int lastIdx = extraCodes.getLength() - 1; - if(lastIdx >= 0) { - - // the extra code modifier is added to the last extra code written - byte lastByte = extraCodes.get(lastIdx); - lastByte += extraCodeModifier; - extraCodes.set(lastIdx, lastByte); - - } else { - - // there is no previous extra code, add a new code (but keep track of - // this "unprintable code" prefix) - extraCodes.write(extraCodeModifier); - extraCodes.setUnprintablePrefixLen(1); - } - } - } - - /** - * Trims any bytes in the given range off of the end of the given stream, - * returning whether or not there are any bytes left in the given stream - * after trimming. - */ - private static boolean trimExtraCodes(ByteStream extraCodes, - byte minTrimCode, byte maxTrimCode) - throws IOException - { - if(extraCodes == null) { - return false; - } - - extraCodes.trimTrailing(minTrimCode, maxTrimCode); - - // anything left? - return (extraCodes.getLength() > 0); - } - - /** - * Encodes the given unprintable char codes in the given stream. - */ - private static void writeUnprintableCodes( - int charOffset, byte[] bytes, ByteStream unprintableCodes, - ExtraCodesStream extraCodes) - throws IOException - { - // the offset seems to be calculated based on the number of bytes in the - // "extra codes" part of the entry (even if there are no extra codes bytes - // actually written in the final entry). - int unprintCharOffset = charOffset; - if(extraCodes != null) { - // we need to account for some extra codes which have not been written - // yet. additionally, any unprintable bytes added to the beginning of - // the extra codes are ignored. - unprintCharOffset = extraCodes.getLength() + - (charOffset - extraCodes.getNumChars()) - - extraCodes.getUnprintablePrefixLen(); - } - - // we write a whacky combo of bytes for each unprintable char which - // includes a funky offset and extra char itself - int offset = - (UNPRINTABLE_COUNT_START + - (UNPRINTABLE_COUNT_MULTIPLIER * unprintCharOffset)) - | UNPRINTABLE_OFFSET_FLAGS; - - // write offset as big-endian short - unprintableCodes.write((offset >> 8) & 0xFF); - unprintableCodes.write(offset & 0xFF); - - unprintableCodes.write(UNPRINTABLE_MIDFIX); - unprintableCodes.write(bytes); - } - - /** - * Encode the given crazy code bytes into the given byte stream. - */ - private static void writeCrazyCodes(ByteStream crazyCodes, ByteStream bout) - throws IOException - { - // CRAZY_CODE_2 flags at the end are ignored, so ditch them - trimExtraCodes(crazyCodes, CRAZY_CODE_2, CRAZY_CODE_2); - - if(crazyCodes.getLength() > 0) { - - // the crazy codes get encoded into 6 bit sequences where each code is 2 - // bits (where the first 2 bits in the byte are a common prefix). - byte curByte = CRAZY_CODE_START; - int idx = 0; - for(int i = 0; i < crazyCodes.getLength(); ++i) { - byte nextByte = crazyCodes.get(i); - nextByte <<= ((2 - idx) * 2); - curByte |= nextByte; - - ++idx; - if(idx == 3) { - // write current byte and reset - bout.write(curByte); - curByte = CRAZY_CODE_START; - idx = 0; - } - } - - // write last byte - if(idx > 0) { - bout.write(curByte); - } - } - - // write crazy code suffix (note, we write this even if all the codes are - // trimmed - bout.write(CRAZY_CODES_SUFFIX); - } - - /** - * Creates one of the special index entries. - */ - private static Entry createSpecialEntry(RowId rowId) { - return new Entry((byte[])null, rowId); - } - - /** - * Constructs a ColumnDescriptor of the relevant type for the given Column. - */ - private ColumnDescriptor newColumnDescriptor(Column col, byte flags) - throws IOException - { - switch(col.getType()) { - case TEXT: - case MEMO: - return new TextColumnDescriptor(col, flags); - case INT: - case LONG: - case MONEY: - return new IntegerColumnDescriptor(col, flags); - case FLOAT: - case DOUBLE: - case SHORT_DATE_TIME: - return new FloatingPointColumnDescriptor(col, flags); - case NUMERIC: - return new FixedPointColumnDescriptor(col, flags); - case BYTE: - return new ByteColumnDescriptor(col, flags); - case BOOLEAN: - return new BooleanColumnDescriptor(col, flags); - case GUID: - return new GuidColumnDescriptor(col, flags); - - default: - // FIXME we can't modify this index at this point in time - setReadOnly(); - return new ReadOnlyColumnDescriptor(col, flags); - } - } - - /** - * Returns the EntryType based on the given entry info. - */ - private static EntryType determineEntryType(byte[] entryBytes, RowId rowId) - { - if(entryBytes != null) { - return ((rowId.getType() == RowId.Type.NORMAL) ? - EntryType.NORMAL : - ((rowId.getType() == RowId.Type.ALWAYS_FIRST) ? - EntryType.FIRST_VALID : EntryType.LAST_VALID)); - } else if(!rowId.isValid()) { - // this is a "special" entry (first/last) - return ((rowId.getType() == RowId.Type.ALWAYS_FIRST) ? - EntryType.ALWAYS_FIRST : EntryType.ALWAYS_LAST); - } - throw new IllegalArgumentException("Values was null for valid entry"); - } - - /** - * Returns the maximum amount of entry data which can be encoded on any - * index page. - */ - private static int calcMaxPageEntrySize(JetFormat format) - { - // the max data we can fit on a page is the min of the space on the page - // vs the number of bytes which can be encoded in the entry mask - int pageDataSize = (format.PAGE_SIZE - - (format.OFFSET_INDEX_ENTRY_MASK + - format.SIZE_INDEX_ENTRY_MASK)); - int entryMaskSize = (format.SIZE_INDEX_ENTRY_MASK * 8); - return Math.min(pageDataSize, entryMaskSize); - } - - /** - * Information about the columns in an index. Also encodes new index - * values. - */ - public static abstract class ColumnDescriptor - { - private final Column _column; - private final byte _flags; - - private ColumnDescriptor(Column column, byte flags) - throws IOException - { - _column = column; - _flags = flags; - } - - public Column getColumn() { - return _column; - } - - public byte getFlags() { - return _flags; - } - - public boolean isAscending() { - return((getFlags() & ASCENDING_COLUMN_FLAG) != 0); - } - - public int getColumnIndex() { - return getColumn().getColumnIndex(); - } - - public String getName() { - return getColumn().getName(); - } - - protected boolean isNullValue(Object value) { - return (value == null); - } - - protected final void writeValue(Object value, ByteStream bout) - throws IOException - { - if(isNullValue(value)) { - // write null value - bout.write(getNullEntryFlag(isAscending())); - return; - } - - // write the start flag - bout.write(getStartEntryFlag(isAscending())); - // write the rest of the value - writeNonNullValue(value, bout); - } - - protected abstract void writeNonNullValue( - Object value, ByteStream bout) - throws IOException; - - @Override - public String toString() { - return "ColumnDescriptor " + getColumn() + "\nflags: " + getFlags(); - } - } - - /** - * ColumnDescriptor for integer based columns. - */ - private static final class IntegerColumnDescriptor extends ColumnDescriptor - { - private IntegerColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); - - // bit twiddling rules: - // - isAsc => flipFirstBit - // - !isAsc => flipFirstBit, flipBytes - - flipFirstBitInByte(valueBytes, 0); - if(!isAscending()) { - flipBytes(valueBytes); - } - - bout.write(valueBytes); - } - } - - /** - * ColumnDescriptor for floating point based columns. - */ - private static final class FloatingPointColumnDescriptor - extends ColumnDescriptor - { - private FloatingPointColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); - - // determine if the number is negative by testing if the first bit is - // set - boolean isNegative = ((valueBytes[0] & 0x80) != 0); - - // bit twiddling rules: - // isAsc && !isNeg => flipFirstBit - // isAsc && isNeg => flipBytes - // !isAsc && !isNeg => flipFirstBit, flipBytes - // !isAsc && isNeg => nothing - - if(!isNegative) { - flipFirstBitInByte(valueBytes, 0); - } - if(isNegative == isAscending()) { - flipBytes(valueBytes); - } - - bout.write(valueBytes); - } - } - - /** - * ColumnDescriptor for fixed point based columns. - */ - private static final class FixedPointColumnDescriptor - extends ColumnDescriptor - { - private FixedPointColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); - - // determine if the number is negative by testing if the first bit is - // set - boolean isNegative = ((valueBytes[0] & 0x80) != 0); - - // bit twiddling rules: - // isAsc && !isNeg => setReverseSignByte => FF 00 00 ... - // isAsc && isNeg => flipBytes, setReverseSignByte => 00 FF FF ... - // !isAsc && !isNeg => flipBytes, setReverseSignByte => FF FF FF ... - // !isAsc && isNeg => setReverseSignByte => 00 00 00 ... - - // v2007 bit twiddling rules (old ordering was a bug, MS kb 837148): - // isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ... - // isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ... - // !isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ... - // !isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ... - - boolean alwaysRevFirstByte = getColumn().getFormat().REVERSE_FIRST_BYTE_IN_DESC_NUMERIC_INDEXES; - if(alwaysRevFirstByte) { - // reverse the sign byte (before any byte flipping) - valueBytes[0] = (byte)0xFF; - } - - if(isNegative == isAscending()) { - flipBytes(valueBytes); - } - - if(!alwaysRevFirstByte) { - // reverse the sign byte (after any previous byte flipping) - valueBytes[0] = (isNegative ? (byte)0x00 : (byte)0xFF); - } - - bout.write(valueBytes); - } - } - - /** - * ColumnDescriptor for byte based columns. - */ - private static final class ByteColumnDescriptor extends ColumnDescriptor - { - private ByteColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); - - // bit twiddling rules: - // - isAsc => nothing - // - !isAsc => flipBytes - if(!isAscending()) { - flipBytes(valueBytes); - } - - bout.write(valueBytes); - } - } - - /** - * ColumnDescriptor for boolean columns. - */ - private static final class BooleanColumnDescriptor extends ColumnDescriptor - { - private BooleanColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected boolean isNullValue(Object value) { - // null values are handled as booleans - return false; - } - - @Override - protected void writeNonNullValue(Object value, ByteStream bout) - throws IOException - { - bout.write( - Column.toBooleanValue(value) ? - (isAscending() ? ASC_BOOLEAN_TRUE : DESC_BOOLEAN_TRUE) : - (isAscending() ? ASC_BOOLEAN_FALSE : DESC_BOOLEAN_FALSE)); - } - } - - /** - * ColumnDescriptor for text based columns. - */ - private static final class TextColumnDescriptor extends ColumnDescriptor - { - private TextColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - writeNonNullIndexTextValue(value, bout, isAscending()); - } - } - - /** - * ColumnDescriptor for guid columns. - */ - private static final class GuidColumnDescriptor extends ColumnDescriptor - { - private GuidColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue( - Object value, ByteStream bout) - throws IOException - { - byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); - - // index format <8-bytes> 0x09 <8-bytes> 0x08 - - // bit twiddling rules: - // - isAsc => nothing - // - !isAsc => flipBytes, _but keep 09 unflipped_! - if(!isAscending()) { - flipBytes(valueBytes); - } - - bout.write(valueBytes, 0, 8); - bout.write(MID_GUID); - bout.write(valueBytes, 8, 8); - bout.write(isAscending() ? ASC_END_GUID : DESC_END_GUID); - } - } - - - /** - * ColumnDescriptor for columns which we cannot currently write. - */ - private static final class ReadOnlyColumnDescriptor extends ColumnDescriptor - { - private ReadOnlyColumnDescriptor(Column column, byte flags) - throws IOException - { - super(column, flags); - } - - @Override - protected void writeNonNullValue(Object value, ByteStream bout) - throws IOException - { - throw new UnsupportedOperationException("should not be called"); - } - } - - /** - * A single leaf entry in an index (points to a single row) - */ - public static class Entry implements Comparable - { - /** page/row on which this row is stored */ - private final RowId _rowId; - /** the entry value */ - private final byte[] _entryBytes; - /** comparable type for the entry */ - private final EntryType _type; - - /** - * Create a new entry - * @param entryBytes encoded bytes for this index entry - * @param rowId rowId in which the row is stored - * @param type the type of the entry - */ - private Entry(byte[] entryBytes, RowId rowId, EntryType type) { - _rowId = rowId; - _entryBytes = entryBytes; - _type = type; - } - - /** - * Create a new entry - * @param entryBytes encoded bytes for this index entry - * @param rowId rowId in which the row is stored - */ - private Entry(byte[] entryBytes, RowId rowId) - { - this(entryBytes, rowId, determineEntryType(entryBytes, rowId)); - } - - /** - * Read an existing entry in from a buffer - */ - private Entry(ByteBuffer buffer, int entryLen) - throws IOException - { - this(buffer, entryLen, 0); - } - - /** - * Read an existing entry in from a buffer - */ - private Entry(ByteBuffer buffer, int entryLen, int extraTrailingLen) - throws IOException - { - // we need 4 trailing bytes for the rowId, plus whatever the caller - // wants - int colEntryLen = entryLen - (4 + extraTrailingLen); - - // read the entry bytes - _entryBytes = new byte[colEntryLen]; - buffer.get(_entryBytes); - - // read the rowId - int page = ByteUtil.get3ByteInt(buffer, ENTRY_BYTE_ORDER); - int row = ByteUtil.getUnsignedByte(buffer); - - _rowId = new RowId(page, row); - _type = EntryType.NORMAL; - } - - public RowId getRowId() { - return _rowId; - } - - public EntryType getType() { - return _type; - } - - public Integer getSubPageNumber() { - throw new UnsupportedOperationException(); - } - - public boolean isLeafEntry() { - return true; - } - - public boolean isValid() { - return(_entryBytes != null); - } - - protected final byte[] getEntryBytes() { - return _entryBytes; - } - - /** - * Size of this entry in the db. - */ - protected int size() { - // need 4 trailing bytes for the rowId - return _entryBytes.length + 4; - } - - /** - * Write this entry into a buffer - */ - protected void write(ByteBuffer buffer, - byte[] prefix) - throws IOException - { - if(prefix.length <= _entryBytes.length) { - - // write entry bytes, not including prefix - buffer.put(_entryBytes, prefix.length, - (_entryBytes.length - prefix.length)); - ByteUtil.put3ByteInt(buffer, getRowId().getPageNumber(), - ENTRY_BYTE_ORDER); - - } else if(prefix.length <= (_entryBytes.length + 3)) { - - // the prefix includes part of the page number, write to temp buffer - // and copy last bytes to output buffer - ByteBuffer tmp = ByteBuffer.allocate(3); - ByteUtil.put3ByteInt(tmp, getRowId().getPageNumber(), - ENTRY_BYTE_ORDER); - tmp.flip(); - tmp.position(prefix.length - _entryBytes.length); - buffer.put(tmp); - - } else { - - // since the row number would never be the same if the page number is - // the same, nothing past the page number should ever be included in - // the prefix. - // FIXME, this could happen if page has only one row... - throw new IllegalStateException("prefix should never be this long"); - } - - buffer.put((byte)getRowId().getRowNumber()); - } - - protected final String entryBytesToString() { - return (isValid() ? ", Bytes = " + ByteUtil.toHexString( - ByteBuffer.wrap(_entryBytes), _entryBytes.length) : - ""); - } - - @Override - public String toString() { - return "RowId = " + _rowId + entryBytesToString() + "\n"; - } - - @Override - public int hashCode() { - return _rowId.hashCode(); - } - - @Override - public boolean equals(Object o) { - return((this == o) || - ((o != null) && (getClass() == o.getClass()) && - (compareTo((Entry)o) == 0))); - } - - /** - * @return {@code true} iff the entryBytes are equal between this - * Entry and the given Entry - */ - public boolean equalsEntryBytes(Entry o) { - return(BYTE_CODE_COMPARATOR.compare(_entryBytes, o._entryBytes) == 0); - } - - public int compareTo(Entry other) { - if (this == other) { - return 0; - } - - if(isValid() && other.isValid()) { - - // comparing two valid entries. first, compare by actual byte values - int entryCmp = BYTE_CODE_COMPARATOR.compare( - _entryBytes, other._entryBytes); - if(entryCmp != 0) { - return entryCmp; - } - - } else { - - // if the entries are of mixed validity (or both invalid), we defer - // next to the EntryType - int typeCmp = _type.compareTo(other._type); - if(typeCmp != 0) { - return typeCmp; - } - } - - // at this point we let the RowId decide the final result - return _rowId.compareTo(other.getRowId()); - } - - /** - * Returns a copy of this entry as a node Entry with the given - * subPageNumber. - */ - protected Entry asNodeEntry(Integer subPageNumber) { - return new NodeEntry(_entryBytes, _rowId, _type, subPageNumber); - } - - } - - /** - * A single node entry in an index (points to a sub-page in the index) - */ - private static final class NodeEntry extends Entry { - - /** index page number of the page to which this node entry refers */ - private final Integer _subPageNumber; - - /** - * Create a new node entry - * @param entryBytes encoded bytes for this index entry - * @param rowId rowId in which the row is stored - * @param type the type of the entry - * @param subPageNumber the sub-page to which this node entry refers - */ - private NodeEntry(byte[] entryBytes, RowId rowId, EntryType type, - Integer subPageNumber) { - super(entryBytes, rowId, type); - _subPageNumber = subPageNumber; - } - - /** - * Read an existing node entry in from a buffer - */ - private NodeEntry(ByteBuffer buffer, int entryLen) - throws IOException - { - // we need 4 trailing bytes for the sub-page number - super(buffer, entryLen, 4); - - _subPageNumber = ByteUtil.getInt(buffer, ENTRY_BYTE_ORDER); - } - - @Override - public Integer getSubPageNumber() { - return _subPageNumber; - } - - @Override - public boolean isLeafEntry() { - return false; - } - - @Override - protected int size() { - // need 4 trailing bytes for the sub-page number - return super.size() + 4; - } - - @Override - protected void write(ByteBuffer buffer, byte[] prefix) throws IOException { - super.write(buffer, prefix); - ByteUtil.putInt(buffer, _subPageNumber, ENTRY_BYTE_ORDER); - } - - @Override - public boolean equals(Object o) { - return((this == o) || - ((o != null) && (getClass() == o.getClass()) && - (compareTo((Entry)o) == 0) && - (getSubPageNumber().equals(((Entry)o).getSubPageNumber())))); - } - - @Override - public String toString() { - return ("Node RowId = " + getRowId() + - ", SubPage = " + _subPageNumber + entryBytesToString() + "\n"); - } - - } - - /** - * Utility class to traverse the entries in the Index. Remains valid in the - * face of index entry modifications. - */ - public final class EntryCursor - { - /** handler for moving the page cursor forward */ - private final DirHandler _forwardDirHandler = new ForwardDirHandler(); - /** handler for moving the page cursor backward */ - private final DirHandler _reverseDirHandler = new ReverseDirHandler(); - /** the first (exclusive) row id for this cursor */ - private Position _firstPos; - /** the last (exclusive) row id for this cursor */ - private Position _lastPos; - /** the current entry */ - private Position _curPos; - /** the previous entry */ - private Position _prevPos; - /** the last read modification count on the Index. we track this so that - the cursor can detect updates to the index while traversing and act - accordingly */ - private int _lastModCount; - - private EntryCursor(Position firstPos, Position lastPos) - { - _firstPos = firstPos; - _lastPos = lastPos; - _lastModCount = getIndexModCount(); - reset(); - } - - /** - * Returns the DirHandler for the given direction - */ - private DirHandler getDirHandler(boolean moveForward) { - return (moveForward ? _forwardDirHandler : _reverseDirHandler); - } - - public Index getIndex() { - return Index.this; - } - - private int getIndexModCount() { - return Index.this._modCount; - } - - /** - * Returns the first entry (exclusive) as defined by this cursor. - */ - public Entry getFirstEntry() { - return _firstPos.getEntry(); - } - - /** - * Returns the last entry (exclusive) as defined by this cursor. - */ - public Entry getLastEntry() { - return _lastPos.getEntry(); - } - - /** - * Returns {@code true} if this cursor is up-to-date with respect to its - * index. - */ - public boolean isUpToDate() { - return(getIndexModCount() == _lastModCount); - } - - public void reset() { - beforeFirst(); - } - - public void beforeFirst() { - reset(Cursor.MOVE_FORWARD); - } - - public void afterLast() { - reset(Cursor.MOVE_REVERSE); - } - - protected void reset(boolean moveForward) - { - _curPos = getDirHandler(moveForward).getBeginningPosition(); - _prevPos = _curPos; - } - - /** - * Repositions the cursor so that the next row will be the first entry - * >= the given row. - */ - public void beforeEntry(Object[] row) - throws IOException - { - restorePosition( - new Entry(Index.this.createEntryBytes(row), RowId.FIRST_ROW_ID)); - } - - /** - * Repositions the cursor so that the previous row will be the first - * entry <= the given row. - */ - public void afterEntry(Object[] row) - throws IOException - { - restorePosition( - new Entry(Index.this.createEntryBytes(row), RowId.LAST_ROW_ID)); - } - - /** - * @return valid entry if there was a next entry, - * {@code #getLastEntry} otherwise - */ - public Entry getNextEntry() throws IOException { - return getAnotherPosition(Cursor.MOVE_FORWARD).getEntry(); - } - - /** - * @return valid entry if there was a next entry, - * {@code #getFirstEntry} otherwise - */ - public Entry getPreviousEntry() throws IOException { - return getAnotherPosition(Cursor.MOVE_REVERSE).getEntry(); - } - - /** - * Restores a current position for the cursor (current position becomes - * previous position). - */ - protected void restorePosition(Entry curEntry) - throws IOException - { - restorePosition(curEntry, _curPos.getEntry()); - } - - /** - * Restores a current and previous position for the cursor. - */ - protected void restorePosition(Entry curEntry, Entry prevEntry) - throws IOException - { - if(!_curPos.equalsEntry(curEntry) || - !_prevPos.equalsEntry(prevEntry)) - { - if(!isUpToDate()) { - updateBounds(); - _lastModCount = getIndexModCount(); - } - _prevPos = updatePosition(prevEntry); - _curPos = updatePosition(curEntry); - } else { - checkForModification(); - } - } - - /** - * Gets another entry in the given direction, returning the new entry. - */ - private Position getAnotherPosition(boolean moveForward) - throws IOException - { - DirHandler handler = getDirHandler(moveForward); - if(_curPos.equals(handler.getEndPosition())) { - if(!isUpToDate()) { - restorePosition(_prevPos.getEntry()); - // drop through and retry moving to another entry - } else { - // at end, no more - return _curPos; - } - } - - checkForModification(); - - _prevPos = _curPos; - _curPos = handler.getAnotherPosition(_curPos); - return _curPos; - } - - /** - * Checks the index for modifications and updates state accordingly. - */ - private void checkForModification() - throws IOException - { - if(!isUpToDate()) { - updateBounds(); - _prevPos = updatePosition(_prevPos.getEntry()); - _curPos = updatePosition(_curPos.getEntry()); - _lastModCount = getIndexModCount(); - } - } - - /** - * Updates the given position, taking boundaries into account. - */ - private Position updatePosition(Entry entry) - throws IOException - { - if(!entry.isValid()) { - // no use searching if "updating" the first/last pos - if(_firstPos.equalsEntry(entry)) { - return _firstPos; - } else if(_lastPos.equalsEntry(entry)) { - return _lastPos; - } else { - throw new IllegalArgumentException("Invalid entry given " + entry); - } - } - - Position pos = findEntryPosition(entry); - if(pos.compareTo(_lastPos) >= 0) { - return _lastPos; - } else if(pos.compareTo(_firstPos) <= 0) { - return _firstPos; - } - return pos; - } - - /** - * Updates any the boundary info (_firstPos/_lastPos). - */ - private void updateBounds() - throws IOException - { - _firstPos = findEntryPosition(_firstPos.getEntry()); - _lastPos = findEntryPosition(_lastPos.getEntry()); - } - - @Override - public String toString() { - return getClass().getSimpleName() + " CurPosition " + _curPos + - ", PrevPosition " + _prevPos; - } - - /** - * Handles moving the cursor in a given direction. Separates cursor - * logic from value storage. - */ - private abstract class DirHandler { - public abstract Position getAnotherPosition(Position curPos) - throws IOException; - public abstract Position getBeginningPosition(); - public abstract Position getEndPosition(); - } - - /** - * Handles moving the cursor forward. - */ - private final class ForwardDirHandler extends DirHandler { - @Override - public Position getAnotherPosition(Position curPos) - throws IOException - { - Position newPos = getNextPosition(curPos); - if((newPos == null) || (newPos.compareTo(_lastPos) >= 0)) { - newPos = _lastPos; - } - return newPos; - } - @Override - public Position getBeginningPosition() { - return _firstPos; - } - @Override - public Position getEndPosition() { - return _lastPos; - } - } - - /** - * Handles moving the cursor backward. - */ - private final class ReverseDirHandler extends DirHandler { - @Override - public Position getAnotherPosition(Position curPos) - throws IOException - { - Position newPos = getPreviousPosition(curPos); - if((newPos == null) || (newPos.compareTo(_firstPos) <= 0)) { - newPos = _firstPos; - } - return newPos; - } - @Override - public Position getBeginningPosition() { - return _lastPos; - } - @Override - public Position getEndPosition() { - return _firstPos; - } - } - } - - /** - * Simple value object for maintaining some cursor state. - */ - private static final class Position implements Comparable { - /** the last known page of the given entry */ - private final DataPage _dataPage; - /** the last known index of the given entry */ - private final int _idx; - /** the entry at the given index */ - private final Entry _entry; - /** {@code true} if this entry does not currently exist in the entry list, - {@code false} otherwise (this is equivalent to adding -0.5 to the - _idx) */ - private final boolean _between; - - private Position(DataPage dataPage, int idx) - { - this(dataPage, idx, dataPage.getEntries().get(idx), false); - } - - private Position(DataPage dataPage, int idx, Entry entry, boolean between) - { - _dataPage = dataPage; - _idx = idx; - _entry = entry; - _between = between; - } - - public DataPage getDataPage() { - return _dataPage; - } - - public int getIndex() { - return _idx; - } - - public int getNextIndex() { - // note, _idx does not need to be advanced if it was pointing at a - // between position - return(_between ? _idx : (_idx + 1)); - } - - public int getPrevIndex() { - // note, we ignore the between flag here because the index will be - // pointing at the correct next index in either the between or - // non-between case - return(_idx - 1); - } - - public Entry getEntry() { - return _entry; - } - - public boolean isBetween() { - return _between; - } - - public boolean equalsEntry(Entry entry) { - return _entry.equals(entry); - } - - public int compareTo(Position other) - { - if(this == other) { - return 0; - } - - if(_dataPage.equals(other._dataPage)) { - // "simple" index comparison (handle between-ness) - int idxCmp = ((_idx < other._idx) ? -1 : - ((_idx > other._idx) ? 1 : - ((_between == other._between) ? 0 : - (_between ? -1 : 1)))); - if(idxCmp != 0) { - return idxCmp; - } - } - - // compare the entries. - return _entry.compareTo(other._entry); - } - - @Override - public int hashCode() { - return _entry.hashCode(); - } - - @Override - public boolean equals(Object o) { - return((this == o) || - ((o != null) && (getClass() == o.getClass()) && - (compareTo((Position)o) == 0))); - } - - @Override - public String toString() { - return "Page = " + _dataPage.getPageNumber() + ", Idx = " + _idx + - ", Entry = " + _entry + ", Between = " + _between; - } - } - - /** - * Object used to maintain state about an Index page. - */ - protected static abstract class DataPage { - - public abstract int getPageNumber(); - - public abstract boolean isLeaf(); - public abstract void setLeaf(boolean isLeaf); - - public abstract int getPrevPageNumber(); - public abstract void setPrevPageNumber(int pageNumber); - public abstract int getNextPageNumber(); - public abstract void setNextPageNumber(int pageNumber); - public abstract int getChildTailPageNumber(); - public abstract void setChildTailPageNumber(int pageNumber); - - public abstract int getTotalEntrySize(); - public abstract void setTotalEntrySize(int totalSize); - public abstract byte[] getEntryPrefix(); - public abstract void setEntryPrefix(byte[] entryPrefix); - - public abstract List getEntries(); - public abstract void setEntries(List entries); - - public abstract void addEntry(int idx, Entry entry) - throws IOException; - public abstract void removeEntry(int idx) - throws IOException; - - public final boolean isEmpty() { - return getEntries().isEmpty(); - } - - public final int getCompressedEntrySize() { - // when written to the index page, the entryPrefix bytes will only be - // written for the first entry, so we subtract the entry prefix size - // from all the other entries to determine the compressed size - return getTotalEntrySize() - - (getEntryPrefix().length * (getEntries().size() - 1)); - } - - public final int findEntry(Entry entry) { - return Collections.binarySearch(getEntries(), entry); - } - - @Override - public final int hashCode() { - return getPageNumber(); - } - - @Override - public final boolean equals(Object o) { - return((this == o) || - ((o != null) && (getClass() == o.getClass()) && - (getPageNumber() == ((DataPage)o).getPageNumber()))); - } - - @Override - public final String toString() { - List entries = getEntries(); - return (isLeaf() ? "Leaf" : "Node") + "DataPage[" + getPageNumber() + - "] " + getPrevPageNumber() + ", " + getNextPageNumber() + ", (" + - getChildTailPageNumber() + "), " + - ((isLeaf() && !entries.isEmpty()) ? - ("[" + entries.get(0) + ", " + - entries.get(entries.size() - 1) + "]") : - entries); - } - } - - - /** - * Extension of ByteStream which keeps track of an additional char count and - * the length of any "unprintable" code prefix. - */ - private static final class ExtraCodesStream extends ByteStream - { - private int _numChars; - private int _unprintablePrefixLen; - - private ExtraCodesStream(int length) { - super(length); - } - - public int getNumChars() { - return _numChars; - } - - public void incrementNumChars(int inc) { - _numChars += inc; - } - - public int getUnprintablePrefixLen() { - return _unprintablePrefixLen; - } - - public void setUnprintablePrefixLen(int len) { - _unprintablePrefixLen = len; - } - } - } diff --git a/src/java/com/healthmarketscience/jackcess/IndexData.java b/src/java/com/healthmarketscience/jackcess/IndexData.java new file mode 100644 index 0000000..995e308 --- /dev/null +++ b/src/java/com/healthmarketscience/jackcess/IndexData.java @@ -0,0 +1,2481 @@ +/* +Copyright (c) 2005 Health Market Science, Inc. + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +USA + +You can contact Health Market Science at info@healthmarketscience.com +or at the following address: + +Health Market Science +2700 Horizon Drive +Suite 200 +King of Prussia, PA 19406 +*/ + +package com.healthmarketscience.jackcess; + +import java.io.IOException; +import java.nio.ByteBuffer; +import java.nio.ByteOrder; +import java.util.ArrayList; +import java.util.Arrays; +import java.util.Collections; +import java.util.Comparator; +import java.util.List; +import java.util.Map; + +import org.apache.commons.logging.Log; +import org.apache.commons.logging.LogFactory; + +import static com.healthmarketscience.jackcess.IndexCodes.*; +import static com.healthmarketscience.jackcess.ByteUtil.ByteStream; + + +/** + * Access table index data. This is the actual data which backs a logical + * Index, where one or more logical indexes can be backed by the same index + * data. + * + * @author Tim McCune + */ +public abstract class IndexData { + + protected static final Log LOG = LogFactory.getLog(Index.class); + + /** special entry which is less than any other entry */ + public static final Entry FIRST_ENTRY = + createSpecialEntry(RowId.FIRST_ROW_ID); + + /** special entry which is greater than any other entry */ + public static final Entry LAST_ENTRY = + createSpecialEntry(RowId.LAST_ROW_ID); + + protected static final int INVALID_INDEX_PAGE_NUMBER = 0; + + /** Max number of columns in an index */ + private static final int MAX_COLUMNS = 10; + + protected static final byte[] EMPTY_PREFIX = new byte[0]; + + private static final short COLUMN_UNUSED = -1; + + private static final byte ASCENDING_COLUMN_FLAG = (byte)0x01; + + private static final byte UNIQUE_INDEX_FLAG = (byte)0x01; + private static final byte IGNORE_NULLS_INDEX_FLAG = (byte)0x02; + + private static final int MAX_TEXT_INDEX_CHAR_LENGTH = + (JetFormat.TEXT_FIELD_MAX_LENGTH / JetFormat.TEXT_FIELD_UNIT_SIZE); + + private static final ByteOrder ENTRY_BYTE_ORDER = ByteOrder.BIG_ENDIAN; + + /** type attributes for Entries which simplify comparisons */ + public enum EntryType { + /** comparable type indicating this Entry should always compare less than + valid RowIds */ + ALWAYS_FIRST, + /** comparable type indicating this Entry should always compare less than + other valid entries with equal entryBytes */ + FIRST_VALID, + /** comparable type indicating this RowId should always compare + normally */ + NORMAL, + /** comparable type indicating this Entry should always compare greater + than other valid entries with equal entryBytes */ + LAST_VALID, + /** comparable type indicating this Entry should always compare greater + than valid RowIds */ + ALWAYS_LAST; + } + + static final Comparator BYTE_CODE_COMPARATOR = + new Comparator() { + public int compare(byte[] left, byte[] right) { + if(left == right) { + return 0; + } + if(left == null) { + return -1; + } + if(right == null) { + return 1; + } + + int len = Math.min(left.length, right.length); + int pos = 0; + while((pos < len) && (left[pos] == right[pos])) { + ++pos; + } + if(pos < len) { + return ((ByteUtil.asUnsignedByte(left[pos]) < + ByteUtil.asUnsignedByte(right[pos])) ? -1 : 1); + } + return ((left.length < right.length) ? -1 : + ((left.length > right.length) ? 1 : 0)); + } + }; + + + /** owning table */ + private final Table _table; + /** 0-based index data number */ + private final int _number; + /** Page number of the root index data */ + private int _rootPageNumber; + /** offset within the tableDefinition buffer of the uniqueEntryCount for + this index */ + private final int _uniqueEntryCountOffset; + /** The number of unique entries which have been added to this index. note, + however, that it is never decremented, only incremented (as observed in + Access). */ + private int _uniqueEntryCount; + /** List of columns and flags */ + private final List _columns = + new ArrayList(); + /** the logical indexes which this index data backs */ + private final List _indexes = new ArrayList(); + /** flags for this index */ + private byte _indexFlags; + /** Usage map of pages that this index owns */ + private UsageMap _ownedPages; + /** true if the index entries have been initialized, + false otherwise */ + private boolean _initialized; + /** modification count for the table, keeps cursors up-to-date */ + private int _modCount; + /** temp buffer used to read/write the index pages */ + private final TempBufferHolder _indexBufferH = + TempBufferHolder.newHolder(TempBufferHolder.Type.SOFT, true); + /** temp buffer used to create index entries */ + private ByteStream _entryBuffer; + /** max size for all the entries written to a given index data page */ + private final int _maxPageEntrySize; + /** whether or not this index data is backing a primary key logical index */ + private boolean _primaryKey; + /** FIXME, for SimpleIndex, we can't write multi-page indexes or indexes using the entry compression scheme */ + private boolean _readOnly; + + protected IndexData(Table table, int number, int uniqueEntryCount, + int uniqueEntryCountOffset) + { + _table = table; + _number = number; + _uniqueEntryCount = uniqueEntryCount; + _uniqueEntryCountOffset = uniqueEntryCountOffset; + _maxPageEntrySize = calcMaxPageEntrySize(_table.getFormat()); + } + + public Table getTable() { + return _table; + } + + public JetFormat getFormat() { + return getTable().getFormat(); + } + + public PageChannel getPageChannel() { + return getTable().getPageChannel(); + } + + /** + * @return the "main" logical index which is backed by this data. + */ + public Index getPrimaryIndex() { + return _indexes.get(0); + } + + /** + * @return All of the Indexes backed by this data (unmodifiable List) + */ + public List getIndexes() { + return Collections.unmodifiableList(_indexes); + } + + /** + * Adds a logical index which this data is backing. + */ + void addIndex(Index index) { + + // we keep foreign key indexes at the back of the list. this way the + // primary index will be a non-foreign key index (if any) + if(index.isForeignKey()) { + _indexes.add(index); + } else { + int pos = _indexes.size(); + while(pos > 0) { + if(!_indexes.get(pos - 1).isForeignKey()) { + break; + } + --pos; + } + _indexes.add(pos, index); + + // also, keep track of whether or not this is a primary key index + _primaryKey |= index.isPrimaryKey(); + } + } + + public byte getIndexFlags() { + return _indexFlags; + } + + public int getIndexDataNumber() { + return _number; + } + + public int getUniqueEntryCount() { + return _uniqueEntryCount; + } + + public int getUniqueEntryCountOffset() { + return _uniqueEntryCountOffset; + } + + protected boolean isBackingPrimaryKey() { + return _primaryKey; + } + + /** + * Whether or not {@code null} values are actually recorded in the index. + */ + public boolean shouldIgnoreNulls() { + return((_indexFlags & IGNORE_NULLS_INDEX_FLAG) != 0); + } + + /** + * Whether or not index entries must be unique. + *

+ * Some notes about uniqueness: + *

    + *
  • Access does not seem to consider multiple {@code null} entries + * invalid for a unique index
    • + *
  • text indexes collapse case, and Access seems to compare only + * the index entry bytes, therefore two strings which differ only in + * case will violate the unique constraint
    • + *
+ */ + public boolean isUnique() { + return(isBackingPrimaryKey() || ((_indexFlags & UNIQUE_INDEX_FLAG) != 0)); + } + + /** + * Returns the Columns for this index (unmodifiable) + */ + public List getColumns() { + return Collections.unmodifiableList(_columns); + } + + /** + * Whether or not the complete index state has been read. + */ + public boolean isInitialized() { + return _initialized; + } + + protected int getRootPageNumber() { + return _rootPageNumber; + } + + protected void setReadOnly() { + _readOnly = true; + } + + protected int getMaxPageEntrySize() { + return _maxPageEntrySize; + } + + void addOwnedPage(int pageNumber) throws IOException { + _ownedPages.addPageNumber(pageNumber); + } + + /** + * Returns the number of index entries in the index. Only called by unit + * tests. + *

+ * Forces index initialization. + */ + protected int getEntryCount() + throws IOException + { + initialize(); + EntryCursor cursor = cursor(); + Entry endEntry = cursor.getLastEntry(); + int count = 0; + while(!endEntry.equals(cursor.getNextEntry())) { + ++count; + } + return count; + } + + /** + * Forces initialization of this index (actual parsing of index pages). + * normally, the index will not be initialized until the entries are + * actually needed. + */ + public void initialize() throws IOException { + if(!_initialized) { + readIndexEntries(); + _initialized = true; + } + } + + /** + * Writes the current index state to the database. + *

+ * Forces index initialization. + */ + public void update() throws IOException + { + // make sure we've parsed the entries + initialize(); + + if(_readOnly) { + throw new UnsupportedOperationException( + "FIXME cannot write indexes of this type yet, see Database javadoc for info on enabling large index support"); + } + updateImpl(); + } + + /** + * Read the index info from a tableBuffer + * @param tableBuffer table definition buffer to read from initial info + * @param availableColumns Columns that this index may use + */ + public void read(ByteBuffer tableBuffer, List availableColumns) + throws IOException + { + for (int i = 0; i < MAX_COLUMNS; i++) { + short columnNumber = tableBuffer.getShort(); + byte colFlags = tableBuffer.get(); + if (columnNumber != COLUMN_UNUSED) { + // find the desired column by column number (which is not necessarily + // the same as the column index) + Column idxCol = null; + for(Column col : availableColumns) { + if(col.getColumnNumber() == columnNumber) { + idxCol = col; + break; + } + } + if(idxCol == null) { + throw new IOException("Could not find column with number " + + columnNumber + " for index"); + } + _columns.add(newColumnDescriptor(idxCol, colFlags)); + } + } + + int umapRowNum = tableBuffer.get(); + int umapPageNum = ByteUtil.get3ByteInt(tableBuffer); + _ownedPages = UsageMap.read(getTable().getDatabase(), umapPageNum, + umapRowNum, false); + + _rootPageNumber = tableBuffer.getInt(); + ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX_FLAGS); //Forward past Unknown + _indexFlags = tableBuffer.get(); + ByteUtil.forward(tableBuffer, getFormat().SKIP_AFTER_INDEX_FLAGS); //Forward past other stuff + } + + /** + * Adds a row to this index + *

+ * Forces index initialization. + * + * @param row Row to add + * @param rowId rowId of the row to be added + */ + public void addRow(Object[] row, RowId rowId) + throws IOException + { + int nullCount = countNullValues(row); + boolean isNullEntry = (nullCount == _columns.size()); + if(shouldIgnoreNulls() && isNullEntry) { + // nothing to do + return; + } + if(isBackingPrimaryKey() && (nullCount > 0)) { + throw new IOException("Null value found in row " + Arrays.asList(row) + + " for primary key index " + this); + } + + // make sure we've parsed the entries + initialize(); + + Entry newEntry = new Entry(createEntryBytes(row), rowId); + if(addEntry(newEntry, isNullEntry, row)) { + ++_modCount; + } else { + LOG.warn("Added duplicate index entry " + newEntry + " for row: " + + Arrays.asList(row)); + } + } + + /** + * Adds an entry to the correct index dataPage, maintaining the order. + */ + private boolean addEntry(Entry newEntry, boolean isNullEntry, Object[] row) + throws IOException + { + DataPage dataPage = findDataPage(newEntry); + int idx = dataPage.findEntry(newEntry); + if(idx < 0) { + // this is a new entry + idx = missingIndexToInsertionPoint(idx); + + Position newPos = new Position(dataPage, idx, newEntry, true); + Position nextPos = getNextPosition(newPos); + Position prevPos = getPreviousPosition(newPos); + + // determine if the addition of this entry would break the uniqueness + // constraint. See isUnique() for some notes about uniqueness as + // defined by Access. + boolean isDupeEntry = + (((nextPos != null) && + newEntry.equalsEntryBytes(nextPos.getEntry())) || + ((prevPos != null) && + newEntry.equalsEntryBytes(prevPos.getEntry()))); + if(isUnique() && !isNullEntry && isDupeEntry) + { + throw new IOException( + "New row " + Arrays.asList(row) + + " violates uniqueness constraint for index " + this); + } + + if(!isDupeEntry) { + ++_uniqueEntryCount; + } + + dataPage.addEntry(idx, newEntry); + return true; + } + return false; + } + + /** + * Removes a row from this index + *

+ * Forces index initialization. + * + * @param row Row to remove + * @param rowId rowId of the row to be removed + */ + public void deleteRow(Object[] row, RowId rowId) + throws IOException + { + int nullCount = countNullValues(row); + if(shouldIgnoreNulls() && (nullCount == _columns.size())) { + // nothing to do + return; + } + + // make sure we've parsed the entries + initialize(); + + Entry oldEntry = new Entry(createEntryBytes(row), rowId); + if(removeEntry(oldEntry)) { + ++_modCount; + } else { + LOG.warn("Failed removing index entry " + oldEntry + " for row: " + + Arrays.asList(row)); + } + } + + /** + * Removes an entry from the relevant index dataPage, maintaining the order. + * Will search by RowId if entry is not found (in case a partial entry was + * provided). + */ + private boolean removeEntry(Entry oldEntry) + throws IOException + { + DataPage dataPage = findDataPage(oldEntry); + int idx = dataPage.findEntry(oldEntry); + boolean doRemove = false; + if(idx < 0) { + // the caller may have only read some of the row data, if this is the + // case, just search for the page/row numbers + // FIXME, we could force caller to get relevant values? + EntryCursor cursor = cursor(); + Position tmpPos = null; + Position endPos = cursor._lastPos; + while(!endPos.equals( + tmpPos = cursor.getAnotherPosition(Cursor.MOVE_FORWARD))) { + if(tmpPos.getEntry().getRowId().equals(oldEntry.getRowId())) { + dataPage = tmpPos.getDataPage(); + idx = tmpPos.getIndex(); + doRemove = true; + break; + } + } + } else { + doRemove = true; + } + + if(doRemove) { + // found it! + dataPage.removeEntry(idx); + } + + return doRemove; + } + + /** + * Gets a new cursor for this index. + *

+ * Forces index initialization. + */ + public EntryCursor cursor() + throws IOException + { + return cursor(null, true, null, true); + } + + /** + * Gets a new cursor for this index, narrowed to the range defined by the + * given startRow and endRow. + *

+ * Forces index initialization. + * + * @param startRow the first row of data for the cursor, or {@code null} for + * the first entry + * @param startInclusive whether or not startRow is inclusive or exclusive + * @param endRow the last row of data for the cursor, or {@code null} for + * the last entry + * @param endInclusive whether or not endRow is inclusive or exclusive + */ + public EntryCursor cursor(Object[] startRow, + boolean startInclusive, + Object[] endRow, + boolean endInclusive) + throws IOException + { + initialize(); + Entry startEntry = FIRST_ENTRY; + byte[] startEntryBytes = null; + if(startRow != null) { + startEntryBytes = createEntryBytes(startRow); + startEntry = new Entry(startEntryBytes, + (startInclusive ? + RowId.FIRST_ROW_ID : RowId.LAST_ROW_ID)); + } + Entry endEntry = LAST_ENTRY; + if(endRow != null) { + // reuse startEntryBytes if startRow and endRow are same array. this is + // common for "lookup" code + byte[] endEntryBytes = ((startRow == endRow) ? + startEntryBytes : + createEntryBytes(endRow)); + endEntry = new Entry(endEntryBytes, + (endInclusive ? + RowId.LAST_ROW_ID : RowId.FIRST_ROW_ID)); + } + return new EntryCursor(findEntryPosition(startEntry), + findEntryPosition(endEntry)); + } + + private Position findEntryPosition(Entry entry) + throws IOException + { + DataPage dataPage = findDataPage(entry); + int idx = dataPage.findEntry(entry); + boolean between = false; + if(idx < 0) { + // given entry was not found exactly. our current position is now + // really between two indexes, but we cannot support that as an integer + // value, so we set a flag instead + idx = missingIndexToInsertionPoint(idx); + between = true; + } + return new Position(dataPage, idx, entry, between); + } + + private Position getNextPosition(Position curPos) + throws IOException + { + // get the next index (between-ness is handled internally) + int nextIdx = curPos.getNextIndex(); + Position nextPos = null; + if(nextIdx < curPos.getDataPage().getEntries().size()) { + nextPos = new Position(curPos.getDataPage(), nextIdx); + } else { + int nextPageNumber = curPos.getDataPage().getNextPageNumber(); + DataPage nextDataPage = null; + while(nextPageNumber != INVALID_INDEX_PAGE_NUMBER) { + DataPage dp = getDataPage(nextPageNumber); + if(!dp.isEmpty()) { + nextDataPage = dp; + break; + } + nextPageNumber = dp.getNextPageNumber(); + } + if(nextDataPage != null) { + nextPos = new Position(nextDataPage, 0); + } + } + return nextPos; + } + + /** + * Returns the Position before the given one, or {@code null} if none. + */ + private Position getPreviousPosition(Position curPos) + throws IOException + { + // get the previous index (between-ness is handled internally) + int prevIdx = curPos.getPrevIndex(); + Position prevPos = null; + if(prevIdx >= 0) { + prevPos = new Position(curPos.getDataPage(), prevIdx); + } else { + int prevPageNumber = curPos.getDataPage().getPrevPageNumber(); + DataPage prevDataPage = null; + while(prevPageNumber != INVALID_INDEX_PAGE_NUMBER) { + DataPage dp = getDataPage(prevPageNumber); + if(!dp.isEmpty()) { + prevDataPage = dp; + break; + } + prevPageNumber = dp.getPrevPageNumber(); + } + if(prevDataPage != null) { + prevPos = new Position(prevDataPage, + (prevDataPage.getEntries().size() - 1)); + } + } + return prevPos; + } + + /** + * Returns the valid insertion point for an index indicating a missing + * entry. + */ + protected static int missingIndexToInsertionPoint(int idx) { + return -(idx + 1); + } + + /** + * Constructs an array of values appropriate for this index from the given + * column values, expected to match the columns for this index. + * @return the appropriate sparse array of data + * @throws IllegalArgumentException if the wrong number of values are + * provided + */ + public Object[] constructIndexRowFromEntry(Object... values) + { + if(values.length != _columns.size()) { + throw new IllegalArgumentException( + "Wrong number of column values given " + values.length + + ", expected " + _columns.size()); + } + int valIdx = 0; + Object[] idxRow = new Object[getTable().getColumnCount()]; + for(ColumnDescriptor col : _columns) { + idxRow[col.getColumnIndex()] = values[valIdx++]; + } + return idxRow; + } + + /** + * Constructs an array of values appropriate for this index from the given + * column value. + * @return the appropriate sparse array of data or {@code null} if not all + * columns for this index were provided + */ + public Object[] constructIndexRow(String colName, Object value) + { + return constructIndexRow(Collections.singletonMap(colName, value)); + } + + /** + * Constructs an array of values appropriate for this index from the given + * column values. + * @return the appropriate sparse array of data or {@code null} if not all + * columns for this index were provided + */ + public Object[] constructIndexRow(Map row) + { + for(ColumnDescriptor col : _columns) { + if(!row.containsKey(col.getName())) { + return null; + } + } + + Object[] idxRow = new Object[getTable().getColumnCount()]; + for(ColumnDescriptor col : _columns) { + idxRow[col.getColumnIndex()] = row.get(col.getName()); + } + return idxRow; + } + + @Override + public String toString() { + StringBuilder rtn = new StringBuilder(); + rtn.append("\n\tData number: " + _number); + rtn.append("\n\tPage number: " + _rootPageNumber); + rtn.append("\n\tIs Backing Primary Key: " + isBackingPrimaryKey()); + rtn.append("\n\tIs Unique: " + isUnique()); + rtn.append("\n\tIgnore Nulls: " + shouldIgnoreNulls()); + rtn.append("\n\tColumns: " + _columns); + rtn.append("\n\tInitialized: " + _initialized); + if(_initialized) { + try { + rtn.append("\n\tEntryCount: " + getEntryCount()); + } catch(IOException e) { + throw new RuntimeException(e); + } + } + return rtn.toString(); + } + + /** + * Write the given index page out to a buffer + */ + protected void writeDataPage(DataPage dataPage) + throws IOException + { + if(dataPage.getCompressedEntrySize() > _maxPageEntrySize) { + if(this instanceof SimpleIndexData) { + throw new UnsupportedOperationException( + "FIXME cannot write large index yet, see Database javadoc for info on enabling large index support"); + } + throw new IllegalStateException("data page is too large"); + } + + ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel()); + buffer.put(dataPage.isLeaf() ? + PageTypes.INDEX_LEAF : + PageTypes.INDEX_NODE ); //Page type + buffer.put((byte) 0x01); //Unknown + buffer.putShort((short) 0); //Free space + buffer.putInt(getTable().getTableDefPageNumber()); + + buffer.putInt(0); //Unknown + buffer.putInt(dataPage.getPrevPageNumber()); //Prev page + buffer.putInt(dataPage.getNextPageNumber()); //Next page + buffer.putInt(dataPage.getChildTailPageNumber()); //ChildTail page + + byte[] entryPrefix = dataPage.getEntryPrefix(); + buffer.putShort((short) entryPrefix.length); // entry prefix byte count + buffer.put((byte) 0); //Unknown + + byte[] entryMask = new byte[getFormat().SIZE_INDEX_ENTRY_MASK]; + // first entry includes the prefix + int totalSize = entryPrefix.length; + for(Entry entry : dataPage.getEntries()) { + totalSize += (entry.size() - entryPrefix.length); + int idx = totalSize / 8; + entryMask[idx] |= (1 << (totalSize % 8)); + } + buffer.put(entryMask); + + // first entry includes the prefix + buffer.put(entryPrefix); + + for(Entry entry : dataPage.getEntries()) { + entry.write(buffer, entryPrefix); + } + + // update free space + buffer.putShort(2, (short) (getFormat().PAGE_SIZE - buffer.position())); + + getPageChannel().writePage(buffer, dataPage.getPageNumber()); + } + + /** + * Reads an index page, populating the correct collection based on the page + * type (node or leaf). + */ + protected void readDataPage(DataPage dataPage) + throws IOException + { + ByteBuffer buffer = _indexBufferH.getPageBuffer(getPageChannel()); + getPageChannel().readPage(buffer, dataPage.getPageNumber()); + + boolean isLeaf = isLeafPage(buffer); + dataPage.setLeaf(isLeaf); + + // note, "header" data is in LITTLE_ENDIAN format, entry data is in + // BIG_ENDIAN format + int entryPrefixLength = ByteUtil.getUnsignedShort( + buffer, getFormat().OFFSET_INDEX_COMPRESSED_BYTE_COUNT); + int entryMaskLength = getFormat().SIZE_INDEX_ENTRY_MASK; + int entryMaskPos = getFormat().OFFSET_INDEX_ENTRY_MASK; + int entryPos = entryMaskPos + entryMaskLength; + int lastStart = 0; + int totalEntrySize = 0; + byte[] entryPrefix = null; + List entries = new ArrayList(); + TempBufferHolder tmpEntryBufferH = + TempBufferHolder.newHolder(TempBufferHolder.Type.HARD, true, + ENTRY_BYTE_ORDER); + + Entry prevEntry = FIRST_ENTRY; + for (int i = 0; i < entryMaskLength; i++) { + byte entryMask = buffer.get(entryMaskPos + i); + for (int j = 0; j < 8; j++) { + if ((entryMask & (1 << j)) != 0) { + int length = (i * 8) + j - lastStart; + buffer.position(entryPos + lastStart); + + // determine if we can read straight from the index page (if no + // entryPrefix). otherwise, create temp buf with complete entry. + ByteBuffer curEntryBuffer = buffer; + int curEntryLen = length; + if(entryPrefix != null) { + curEntryBuffer = getTempEntryBuffer( + buffer, length, entryPrefix, tmpEntryBufferH); + curEntryLen += entryPrefix.length; + } + totalEntrySize += curEntryLen; + + Entry entry = newEntry(curEntryBuffer, curEntryLen, isLeaf); + if(prevEntry.compareTo(entry) >= 0) { + throw new IOException("Unexpected order in index entries, " + + prevEntry + " >= " + entry); + } + + entries.add(entry); + + if((entries.size() == 1) && (entryPrefixLength > 0)) { + // read any shared entry prefix + entryPrefix = new byte[entryPrefixLength]; + buffer.position(entryPos + lastStart); + buffer.get(entryPrefix); + } + + lastStart += length; + prevEntry = entry; + } + } + } + + dataPage.setEntryPrefix(entryPrefix != null ? entryPrefix : EMPTY_PREFIX); + dataPage.setEntries(entries); + dataPage.setTotalEntrySize(totalEntrySize); + + int prevPageNumber = buffer.getInt(getFormat().OFFSET_PREV_INDEX_PAGE); + int nextPageNumber = buffer.getInt(getFormat().OFFSET_NEXT_INDEX_PAGE); + int childTailPageNumber = + buffer.getInt(getFormat().OFFSET_CHILD_TAIL_INDEX_PAGE); + + dataPage.setPrevPageNumber(prevPageNumber); + dataPage.setNextPageNumber(nextPageNumber); + dataPage.setChildTailPageNumber(childTailPageNumber); + } + + /** + * Returns a new Entry of the correct type for the given data and page type. + */ + private Entry newEntry(ByteBuffer buffer, int entryLength, boolean isLeaf) + throws IOException + { + if(isLeaf) { + return new Entry(buffer, entryLength); + } + return new NodeEntry(buffer, entryLength); + } + + /** + * Returns an entry buffer containing the relevant data for an entry given + * the valuePrefix. + */ + private ByteBuffer getTempEntryBuffer( + ByteBuffer indexPage, int entryLen, byte[] valuePrefix, + TempBufferHolder tmpEntryBufferH) + { + ByteBuffer tmpEntryBuffer = tmpEntryBufferH.getBuffer( + getPageChannel(), valuePrefix.length + entryLen); + + // combine valuePrefix and rest of entry from indexPage, then prep for + // reading + tmpEntryBuffer.put(valuePrefix); + tmpEntryBuffer.put(indexPage.array(), indexPage.position(), entryLen); + tmpEntryBuffer.flip(); + + return tmpEntryBuffer; + } + + /** + * Determines if the given index page is a leaf or node page. + */ + private static boolean isLeafPage(ByteBuffer buffer) + throws IOException + { + byte pageType = buffer.get(0); + if(pageType == PageTypes.INDEX_LEAF) { + return true; + } else if(pageType == PageTypes.INDEX_NODE) { + return false; + } + throw new IOException("Unexpected page type " + pageType); + } + + /** + * Determines the number of {@code null} values for this index from the + * given row. + */ + private int countNullValues(Object[] values) + { + if(values == null) { + return _columns.size(); + } + + // annoyingly, the values array could come from different sources, one + // of which will make it a different size than the other. we need to + // handle both situations. + int nullCount = 0; + for(ColumnDescriptor col : _columns) { + Object value = values[col.getColumnIndex()]; + if(col.isNullValue(value)) { + ++nullCount; + } + } + + return nullCount; + } + + /** + * Creates the entry bytes for a row of values. + */ + private byte[] createEntryBytes(Object[] values) throws IOException + { + if(values == null) { + return null; + } + + if(_entryBuffer == null) { + _entryBuffer = new ByteStream(); + } + _entryBuffer.reset(); + + for(ColumnDescriptor col : _columns) { + Object value = values[col.getColumnIndex()]; + if(Column.isRawData(value)) { + // ignore it, we could not parse it + continue; + } + + col.writeValue(value, _entryBuffer); + } + + return _entryBuffer.toByteArray(); + } + + /** + * Writes the current index state to the database. Index has already been + * initialized. + */ + protected abstract void updateImpl() throws IOException; + + /** + * Reads the actual index entries. + */ + protected abstract void readIndexEntries() + throws IOException; + + /** + * Finds the data page for the given entry. + */ + protected abstract DataPage findDataPage(Entry entry) + throws IOException; + + /** + * Gets the data page for the pageNumber. + */ + protected abstract DataPage getDataPage(int pageNumber) + throws IOException; + + /** + * Flips the first bit in the byte at the given index. + */ + private static byte[] flipFirstBitInByte(byte[] value, int index) + { + value[index] = (byte)(value[index] ^ 0x80); + + return value; + } + + /** + * Flips all the bits in the byte array. + */ + private static byte[] flipBytes(byte[] value) { + return flipBytes(value, 0, value.length); + } + + /** + * Flips the bits in the specified bytes in the byte array. + */ + private static byte[] flipBytes(byte[] value, int offset, int length) { + for(int i = offset; i < (offset + length); ++i) { + value[i] = (byte)(~value[i]); + } + return value; + } + + /** + * Writes the value of the given column type to a byte array and returns it. + */ + private static byte[] encodeNumberColumnValue(Object value, Column column) + throws IOException + { + // always write in big endian order + return column.write(value, 0, ENTRY_BYTE_ORDER).array(); + } + + /** + * Converts an index value for a text column into the entry value (which + * is based on a variety of nifty codes). + */ + private static void writeNonNullIndexTextValue( + Object value, ByteStream bout, boolean isAscending) + throws IOException + { + // first, convert to string + String str = Column.toCharSequence(value).toString(); + + // all text columns (including memos) are only indexed up to the max + // number of chars in a VARCHAR column + if(str.length() > MAX_TEXT_INDEX_CHAR_LENGTH) { + str = str.substring(0, MAX_TEXT_INDEX_CHAR_LENGTH); + } + + // record pprevious entry length so we can do any post-processing + // necessary for this entry (handling descending) + int prevLength = bout.getLength(); + + // now, convert each character to a "code" of one or more bytes + ExtraCodesStream extraCodes = null; + ByteStream unprintableCodes = null; + ByteStream crazyCodes = null; + int charOffset = 0; + for(int i = 0; i < str.length(); ++i) { + + char c = str.charAt(i); + CharHandler ch = getCharHandler(c); + + int curCharOffset = charOffset; + byte[] bytes = ch.getInlineBytes(); + if(bytes != null) { + // write the "inline" codes immediately + bout.write(bytes); + + // only increment the charOffset for chars with inline codes + ++charOffset; + } + + if(ch.getType() == Type.SIMPLE) { + // common case, skip further code handling + continue; + } + + bytes = ch.getExtraBytes(); + byte extraCodeModifier = ch.getExtraByteModifier(); + if((bytes != null) || (extraCodeModifier != 0)) { + if(extraCodes == null) { + extraCodes = new ExtraCodesStream(str.length()); + } + + // keep track of the extra codes for later + writeExtraCodes(curCharOffset, bytes, extraCodeModifier, extraCodes); + } + + bytes = ch.getUnprintableBytes(); + if(bytes != null) { + if(unprintableCodes == null) { + unprintableCodes = new ByteStream(); + } + + // keep track of the unprintable codes for later + writeUnprintableCodes(curCharOffset, bytes, unprintableCodes, + extraCodes); + } + + byte crazyFlag = ch.getCrazyFlag(); + if(crazyFlag != 0) { + if(crazyCodes == null) { + crazyCodes = new ByteStream(); + } + + // keep track of the crazy flags for later + crazyCodes.write(crazyFlag); + } + } + + // write end text flag + bout.write(END_TEXT); + + boolean hasExtraCodes = trimExtraCodes( + extraCodes, (byte)0, INTERNATIONAL_EXTRA_PLACEHOLDER); + boolean hasUnprintableCodes = (unprintableCodes != null); + boolean hasCrazyCodes = (crazyCodes != null); + if(hasExtraCodes || hasUnprintableCodes || hasCrazyCodes) { + + // we write all the international extra bytes first + if(hasExtraCodes) { + extraCodes.writeTo(bout); + } + + if(hasCrazyCodes || hasUnprintableCodes) { + + // write 2 more end flags + bout.write(END_TEXT); + bout.write(END_TEXT); + + // next come the crazy flags + if(hasCrazyCodes) { + + writeCrazyCodes(crazyCodes, bout); + + // if we are writing unprintable codes after this, tack on another + // code + if(hasUnprintableCodes) { + bout.write(CRAZY_CODES_UNPRINT_SUFFIX); + } + } + + // then we write all the unprintable extra bytes + if(hasUnprintableCodes) { + + // write another end flag + bout.write(END_TEXT); + + unprintableCodes.writeTo(bout); + } + } + } + + // handle descending order by inverting the bytes + if(!isAscending) { + + // we actually write the end byte before flipping the bytes, and write + // another one after flipping + bout.write(END_EXTRA_TEXT); + + // flip the bytes that we have written thus far for this text value + flipBytes(bout.getBytes(), prevLength, (bout.getLength() - prevLength)); + } + + // write end extra text + bout.write(END_EXTRA_TEXT); + } + + /** + * Encodes the given extra code info in the given stream. + */ + private static void writeExtraCodes( + int charOffset, byte[] bytes, byte extraCodeModifier, + ExtraCodesStream extraCodes) + throws IOException + { + // we fill in a placeholder value for any chars w/out extra codes + int numChars = extraCodes.getNumChars(); + if(numChars < charOffset) { + int fillChars = charOffset - numChars; + extraCodes.writeFill(fillChars, INTERNATIONAL_EXTRA_PLACEHOLDER); + extraCodes.incrementNumChars(fillChars); + } + + if(bytes != null) { + + // write the actual extra codes and update the number of chars + extraCodes.write(bytes); + extraCodes.incrementNumChars(1); + + } else { + + // extra code modifiers modify the existing extra code bytes and do not + // count as additional extra code chars + int lastIdx = extraCodes.getLength() - 1; + if(lastIdx >= 0) { + + // the extra code modifier is added to the last extra code written + byte lastByte = extraCodes.get(lastIdx); + lastByte += extraCodeModifier; + extraCodes.set(lastIdx, lastByte); + + } else { + + // there is no previous extra code, add a new code (but keep track of + // this "unprintable code" prefix) + extraCodes.write(extraCodeModifier); + extraCodes.setUnprintablePrefixLen(1); + } + } + } + + /** + * Trims any bytes in the given range off of the end of the given stream, + * returning whether or not there are any bytes left in the given stream + * after trimming. + */ + private static boolean trimExtraCodes(ByteStream extraCodes, + byte minTrimCode, byte maxTrimCode) + throws IOException + { + if(extraCodes == null) { + return false; + } + + extraCodes.trimTrailing(minTrimCode, maxTrimCode); + + // anything left? + return (extraCodes.getLength() > 0); + } + + /** + * Encodes the given unprintable char codes in the given stream. + */ + private static void writeUnprintableCodes( + int charOffset, byte[] bytes, ByteStream unprintableCodes, + ExtraCodesStream extraCodes) + throws IOException + { + // the offset seems to be calculated based on the number of bytes in the + // "extra codes" part of the entry (even if there are no extra codes bytes + // actually written in the final entry). + int unprintCharOffset = charOffset; + if(extraCodes != null) { + // we need to account for some extra codes which have not been written + // yet. additionally, any unprintable bytes added to the beginning of + // the extra codes are ignored. + unprintCharOffset = extraCodes.getLength() + + (charOffset - extraCodes.getNumChars()) - + extraCodes.getUnprintablePrefixLen(); + } + + // we write a whacky combo of bytes for each unprintable char which + // includes a funky offset and extra char itself + int offset = + (UNPRINTABLE_COUNT_START + + (UNPRINTABLE_COUNT_MULTIPLIER * unprintCharOffset)) + | UNPRINTABLE_OFFSET_FLAGS; + + // write offset as big-endian short + unprintableCodes.write((offset >> 8) & 0xFF); + unprintableCodes.write(offset & 0xFF); + + unprintableCodes.write(UNPRINTABLE_MIDFIX); + unprintableCodes.write(bytes); + } + + /** + * Encode the given crazy code bytes into the given byte stream. + */ + private static void writeCrazyCodes(ByteStream crazyCodes, ByteStream bout) + throws IOException + { + // CRAZY_CODE_2 flags at the end are ignored, so ditch them + trimExtraCodes(crazyCodes, CRAZY_CODE_2, CRAZY_CODE_2); + + if(crazyCodes.getLength() > 0) { + + // the crazy codes get encoded into 6 bit sequences where each code is 2 + // bits (where the first 2 bits in the byte are a common prefix). + byte curByte = CRAZY_CODE_START; + int idx = 0; + for(int i = 0; i < crazyCodes.getLength(); ++i) { + byte nextByte = crazyCodes.get(i); + nextByte <<= ((2 - idx) * 2); + curByte |= nextByte; + + ++idx; + if(idx == 3) { + // write current byte and reset + bout.write(curByte); + curByte = CRAZY_CODE_START; + idx = 0; + } + } + + // write last byte + if(idx > 0) { + bout.write(curByte); + } + } + + // write crazy code suffix (note, we write this even if all the codes are + // trimmed + bout.write(CRAZY_CODES_SUFFIX); + } + + /** + * Creates one of the special index entries. + */ + private static Entry createSpecialEntry(RowId rowId) { + return new Entry((byte[])null, rowId); + } + + /** + * Constructs a ColumnDescriptor of the relevant type for the given Column. + */ + private ColumnDescriptor newColumnDescriptor(Column col, byte flags) + throws IOException + { + switch(col.getType()) { + case TEXT: + case MEMO: + return new TextColumnDescriptor(col, flags); + case INT: + case LONG: + case MONEY: + return new IntegerColumnDescriptor(col, flags); + case FLOAT: + case DOUBLE: + case SHORT_DATE_TIME: + return new FloatingPointColumnDescriptor(col, flags); + case NUMERIC: + return new FixedPointColumnDescriptor(col, flags); + case BYTE: + return new ByteColumnDescriptor(col, flags); + case BOOLEAN: + return new BooleanColumnDescriptor(col, flags); + case GUID: + return new GuidColumnDescriptor(col, flags); + + default: + // FIXME we can't modify this index at this point in time + setReadOnly(); + return new ReadOnlyColumnDescriptor(col, flags); + } + } + + /** + * Returns the EntryType based on the given entry info. + */ + private static EntryType determineEntryType(byte[] entryBytes, RowId rowId) + { + if(entryBytes != null) { + return ((rowId.getType() == RowId.Type.NORMAL) ? + EntryType.NORMAL : + ((rowId.getType() == RowId.Type.ALWAYS_FIRST) ? + EntryType.FIRST_VALID : EntryType.LAST_VALID)); + } else if(!rowId.isValid()) { + // this is a "special" entry (first/last) + return ((rowId.getType() == RowId.Type.ALWAYS_FIRST) ? + EntryType.ALWAYS_FIRST : EntryType.ALWAYS_LAST); + } + throw new IllegalArgumentException("Values was null for valid entry"); + } + + /** + * Returns the maximum amount of entry data which can be encoded on any + * index page. + */ + private static int calcMaxPageEntrySize(JetFormat format) + { + // the max data we can fit on a page is the min of the space on the page + // vs the number of bytes which can be encoded in the entry mask + int pageDataSize = (format.PAGE_SIZE - + (format.OFFSET_INDEX_ENTRY_MASK + + format.SIZE_INDEX_ENTRY_MASK)); + int entryMaskSize = (format.SIZE_INDEX_ENTRY_MASK * 8); + return Math.min(pageDataSize, entryMaskSize); + } + + /** + * Information about the columns in an index. Also encodes new index + * values. + */ + public static abstract class ColumnDescriptor + { + private final Column _column; + private final byte _flags; + + private ColumnDescriptor(Column column, byte flags) + throws IOException + { + _column = column; + _flags = flags; + } + + public Column getColumn() { + return _column; + } + + public byte getFlags() { + return _flags; + } + + public boolean isAscending() { + return((getFlags() & ASCENDING_COLUMN_FLAG) != 0); + } + + public int getColumnIndex() { + return getColumn().getColumnIndex(); + } + + public String getName() { + return getColumn().getName(); + } + + protected boolean isNullValue(Object value) { + return (value == null); + } + + protected final void writeValue(Object value, ByteStream bout) + throws IOException + { + if(isNullValue(value)) { + // write null value + bout.write(getNullEntryFlag(isAscending())); + return; + } + + // write the start flag + bout.write(getStartEntryFlag(isAscending())); + // write the rest of the value + writeNonNullValue(value, bout); + } + + protected abstract void writeNonNullValue( + Object value, ByteStream bout) + throws IOException; + + @Override + public String toString() { + return "ColumnDescriptor " + getColumn() + "\nflags: " + getFlags(); + } + } + + /** + * ColumnDescriptor for integer based columns. + */ + private static final class IntegerColumnDescriptor extends ColumnDescriptor + { + private IntegerColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); + + // bit twiddling rules: + // - isAsc => flipFirstBit + // - !isAsc => flipFirstBit, flipBytes + + flipFirstBitInByte(valueBytes, 0); + if(!isAscending()) { + flipBytes(valueBytes); + } + + bout.write(valueBytes); + } + } + + /** + * ColumnDescriptor for floating point based columns. + */ + private static final class FloatingPointColumnDescriptor + extends ColumnDescriptor + { + private FloatingPointColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); + + // determine if the number is negative by testing if the first bit is + // set + boolean isNegative = ((valueBytes[0] & 0x80) != 0); + + // bit twiddling rules: + // isAsc && !isNeg => flipFirstBit + // isAsc && isNeg => flipBytes + // !isAsc && !isNeg => flipFirstBit, flipBytes + // !isAsc && isNeg => nothing + + if(!isNegative) { + flipFirstBitInByte(valueBytes, 0); + } + if(isNegative == isAscending()) { + flipBytes(valueBytes); + } + + bout.write(valueBytes); + } + } + + /** + * ColumnDescriptor for fixed point based columns. + */ + private static final class FixedPointColumnDescriptor + extends ColumnDescriptor + { + private FixedPointColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); + + // determine if the number is negative by testing if the first bit is + // set + boolean isNegative = ((valueBytes[0] & 0x80) != 0); + + // bit twiddling rules: + // isAsc && !isNeg => setReverseSignByte => FF 00 00 ... + // isAsc && isNeg => flipBytes, setReverseSignByte => 00 FF FF ... + // !isAsc && !isNeg => flipBytes, setReverseSignByte => FF FF FF ... + // !isAsc && isNeg => setReverseSignByte => 00 00 00 ... + + // v2007 bit twiddling rules (old ordering was a bug, MS kb 837148): + // isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ... + // isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ... + // !isAsc && !isNeg => setSignByte 0xFF => FF 00 00 ... + // !isAsc && isNeg => setSignByte 0xFF, flipBytes => 00 FF FF ... + + boolean alwaysRevFirstByte = getColumn().getFormat().REVERSE_FIRST_BYTE_IN_DESC_NUMERIC_INDEXES; + if(alwaysRevFirstByte) { + // reverse the sign byte (before any byte flipping) + valueBytes[0] = (byte)0xFF; + } + + if(isNegative == isAscending()) { + flipBytes(valueBytes); + } + + if(!alwaysRevFirstByte) { + // reverse the sign byte (after any previous byte flipping) + valueBytes[0] = (isNegative ? (byte)0x00 : (byte)0xFF); + } + + bout.write(valueBytes); + } + } + + /** + * ColumnDescriptor for byte based columns. + */ + private static final class ByteColumnDescriptor extends ColumnDescriptor + { + private ByteColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); + + // bit twiddling rules: + // - isAsc => nothing + // - !isAsc => flipBytes + if(!isAscending()) { + flipBytes(valueBytes); + } + + bout.write(valueBytes); + } + } + + /** + * ColumnDescriptor for boolean columns. + */ + private static final class BooleanColumnDescriptor extends ColumnDescriptor + { + private BooleanColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected boolean isNullValue(Object value) { + // null values are handled as booleans + return false; + } + + @Override + protected void writeNonNullValue(Object value, ByteStream bout) + throws IOException + { + bout.write( + Column.toBooleanValue(value) ? + (isAscending() ? ASC_BOOLEAN_TRUE : DESC_BOOLEAN_TRUE) : + (isAscending() ? ASC_BOOLEAN_FALSE : DESC_BOOLEAN_FALSE)); + } + } + + /** + * ColumnDescriptor for text based columns. + */ + private static final class TextColumnDescriptor extends ColumnDescriptor + { + private TextColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + writeNonNullIndexTextValue(value, bout, isAscending()); + } + } + + /** + * ColumnDescriptor for guid columns. + */ + private static final class GuidColumnDescriptor extends ColumnDescriptor + { + private GuidColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue( + Object value, ByteStream bout) + throws IOException + { + byte[] valueBytes = encodeNumberColumnValue(value, getColumn()); + + // index format <8-bytes> 0x09 <8-bytes> 0x08 + + // bit twiddling rules: + // - isAsc => nothing + // - !isAsc => flipBytes, _but keep 09 unflipped_! + if(!isAscending()) { + flipBytes(valueBytes); + } + + bout.write(valueBytes, 0, 8); + bout.write(MID_GUID); + bout.write(valueBytes, 8, 8); + bout.write(isAscending() ? ASC_END_GUID : DESC_END_GUID); + } + } + + + /** + * ColumnDescriptor for columns which we cannot currently write. + */ + private static final class ReadOnlyColumnDescriptor extends ColumnDescriptor + { + private ReadOnlyColumnDescriptor(Column column, byte flags) + throws IOException + { + super(column, flags); + } + + @Override + protected void writeNonNullValue(Object value, ByteStream bout) + throws IOException + { + throw new UnsupportedOperationException("should not be called"); + } + } + + /** + * A single leaf entry in an index (points to a single row) + */ + public static class Entry implements Comparable + { + /** page/row on which this row is stored */ + private final RowId _rowId; + /** the entry value */ + private final byte[] _entryBytes; + /** comparable type for the entry */ + private final EntryType _type; + + /** + * Create a new entry + * @param entryBytes encoded bytes for this index entry + * @param rowId rowId in which the row is stored + * @param type the type of the entry + */ + private Entry(byte[] entryBytes, RowId rowId, EntryType type) { + _rowId = rowId; + _entryBytes = entryBytes; + _type = type; + } + + /** + * Create a new entry + * @param entryBytes encoded bytes for this index entry + * @param rowId rowId in which the row is stored + */ + private Entry(byte[] entryBytes, RowId rowId) + { + this(entryBytes, rowId, determineEntryType(entryBytes, rowId)); + } + + /** + * Read an existing entry in from a buffer + */ + private Entry(ByteBuffer buffer, int entryLen) + throws IOException + { + this(buffer, entryLen, 0); + } + + /** + * Read an existing entry in from a buffer + */ + private Entry(ByteBuffer buffer, int entryLen, int extraTrailingLen) + throws IOException + { + // we need 4 trailing bytes for the rowId, plus whatever the caller + // wants + int colEntryLen = entryLen - (4 + extraTrailingLen); + + // read the entry bytes + _entryBytes = new byte[colEntryLen]; + buffer.get(_entryBytes); + + // read the rowId + int page = ByteUtil.get3ByteInt(buffer, ENTRY_BYTE_ORDER); + int row = ByteUtil.getUnsignedByte(buffer); + + _rowId = new RowId(page, row); + _type = EntryType.NORMAL; + } + + public RowId getRowId() { + return _rowId; + } + + public EntryType getType() { + return _type; + } + + public Integer getSubPageNumber() { + throw new UnsupportedOperationException(); + } + + public boolean isLeafEntry() { + return true; + } + + public boolean isValid() { + return(_entryBytes != null); + } + + protected final byte[] getEntryBytes() { + return _entryBytes; + } + + /** + * Size of this entry in the db. + */ + protected int size() { + // need 4 trailing bytes for the rowId + return _entryBytes.length + 4; + } + + /** + * Write this entry into a buffer + */ + protected void write(ByteBuffer buffer, + byte[] prefix) + throws IOException + { + if(prefix.length <= _entryBytes.length) { + + // write entry bytes, not including prefix + buffer.put(_entryBytes, prefix.length, + (_entryBytes.length - prefix.length)); + ByteUtil.put3ByteInt(buffer, getRowId().getPageNumber(), + ENTRY_BYTE_ORDER); + + } else if(prefix.length <= (_entryBytes.length + 3)) { + + // the prefix includes part of the page number, write to temp buffer + // and copy last bytes to output buffer + ByteBuffer tmp = ByteBuffer.allocate(3); + ByteUtil.put3ByteInt(tmp, getRowId().getPageNumber(), + ENTRY_BYTE_ORDER); + tmp.flip(); + tmp.position(prefix.length - _entryBytes.length); + buffer.put(tmp); + + } else { + + // since the row number would never be the same if the page number is + // the same, nothing past the page number should ever be included in + // the prefix. + // FIXME, this could happen if page has only one row... + throw new IllegalStateException("prefix should never be this long"); + } + + buffer.put((byte)getRowId().getRowNumber()); + } + + protected final String entryBytesToString() { + return (isValid() ? ", Bytes = " + ByteUtil.toHexString( + ByteBuffer.wrap(_entryBytes), _entryBytes.length) : + ""); + } + + @Override + public String toString() { + return "RowId = " + _rowId + entryBytesToString() + "\n"; + } + + @Override + public int hashCode() { + return _rowId.hashCode(); + } + + @Override + public boolean equals(Object o) { + return((this == o) || + ((o != null) && (getClass() == o.getClass()) && + (compareTo((Entry)o) == 0))); + } + + /** + * @return {@code true} iff the entryBytes are equal between this + * Entry and the given Entry + */ + public boolean equalsEntryBytes(Entry o) { + return(BYTE_CODE_COMPARATOR.compare(_entryBytes, o._entryBytes) == 0); + } + + public int compareTo(Entry other) { + if (this == other) { + return 0; + } + + if(isValid() && other.isValid()) { + + // comparing two valid entries. first, compare by actual byte values + int entryCmp = BYTE_CODE_COMPARATOR.compare( + _entryBytes, other._entryBytes); + if(entryCmp != 0) { + return entryCmp; + } + + } else { + + // if the entries are of mixed validity (or both invalid), we defer + // next to the EntryType + int typeCmp = _type.compareTo(other._type); + if(typeCmp != 0) { + return typeCmp; + } + } + + // at this point we let the RowId decide the final result + return _rowId.compareTo(other.getRowId()); + } + + /** + * Returns a copy of this entry as a node Entry with the given + * subPageNumber. + */ + protected Entry asNodeEntry(Integer subPageNumber) { + return new NodeEntry(_entryBytes, _rowId, _type, subPageNumber); + } + + } + + /** + * A single node entry in an index (points to a sub-page in the index) + */ + private static final class NodeEntry extends Entry { + + /** index page number of the page to which this node entry refers */ + private final Integer _subPageNumber; + + /** + * Create a new node entry + * @param entryBytes encoded bytes for this index entry + * @param rowId rowId in which the row is stored + * @param type the type of the entry + * @param subPageNumber the sub-page to which this node entry refers + */ + private NodeEntry(byte[] entryBytes, RowId rowId, EntryType type, + Integer subPageNumber) { + super(entryBytes, rowId, type); + _subPageNumber = subPageNumber; + } + + /** + * Read an existing node entry in from a buffer + */ + private NodeEntry(ByteBuffer buffer, int entryLen) + throws IOException + { + // we need 4 trailing bytes for the sub-page number + super(buffer, entryLen, 4); + + _subPageNumber = ByteUtil.getInt(buffer, ENTRY_BYTE_ORDER); + } + + @Override + public Integer getSubPageNumber() { + return _subPageNumber; + } + + @Override + public boolean isLeafEntry() { + return false; + } + + @Override + protected int size() { + // need 4 trailing bytes for the sub-page number + return super.size() + 4; + } + + @Override + protected void write(ByteBuffer buffer, byte[] prefix) throws IOException { + super.write(buffer, prefix); + ByteUtil.putInt(buffer, _subPageNumber, ENTRY_BYTE_ORDER); + } + + @Override + public boolean equals(Object o) { + return((this == o) || + ((o != null) && (getClass() == o.getClass()) && + (compareTo((Entry)o) == 0) && + (getSubPageNumber().equals(((Entry)o).getSubPageNumber())))); + } + + @Override + public String toString() { + return ("Node RowId = " + getRowId() + + ", SubPage = " + _subPageNumber + entryBytesToString() + "\n"); + } + + } + + /** + * Utility class to traverse the entries in the Index. Remains valid in the + * face of index entry modifications. + */ + public final class EntryCursor + { + /** handler for moving the page cursor forward */ + private final DirHandler _forwardDirHandler = new ForwardDirHandler(); + /** handler for moving the page cursor backward */ + private final DirHandler _reverseDirHandler = new ReverseDirHandler(); + /** the first (exclusive) row id for this cursor */ + private Position _firstPos; + /** the last (exclusive) row id for this cursor */ + private Position _lastPos; + /** the current entry */ + private Position _curPos; + /** the previous entry */ + private Position _prevPos; + /** the last read modification count on the Index. we track this so that + the cursor can detect updates to the index while traversing and act + accordingly */ + private int _lastModCount; + + private EntryCursor(Position firstPos, Position lastPos) + { + _firstPos = firstPos; + _lastPos = lastPos; + _lastModCount = getIndexModCount(); + reset(); + } + + /** + * Returns the DirHandler for the given direction + */ + private DirHandler getDirHandler(boolean moveForward) { + return (moveForward ? _forwardDirHandler : _reverseDirHandler); + } + + public IndexData getIndexData() { + return IndexData.this; + } + + private int getIndexModCount() { + return IndexData.this._modCount; + } + + /** + * Returns the first entry (exclusive) as defined by this cursor. + */ + public Entry getFirstEntry() { + return _firstPos.getEntry(); + } + + /** + * Returns the last entry (exclusive) as defined by this cursor. + */ + public Entry getLastEntry() { + return _lastPos.getEntry(); + } + + /** + * Returns {@code true} if this cursor is up-to-date with respect to its + * index. + */ + public boolean isUpToDate() { + return(getIndexModCount() == _lastModCount); + } + + public void reset() { + beforeFirst(); + } + + public void beforeFirst() { + reset(Cursor.MOVE_FORWARD); + } + + public void afterLast() { + reset(Cursor.MOVE_REVERSE); + } + + protected void reset(boolean moveForward) + { + _curPos = getDirHandler(moveForward).getBeginningPosition(); + _prevPos = _curPos; + } + + /** + * Repositions the cursor so that the next row will be the first entry + * >= the given row. + */ + public void beforeEntry(Object[] row) + throws IOException + { + restorePosition( + new Entry(IndexData.this.createEntryBytes(row), RowId.FIRST_ROW_ID)); + } + + /** + * Repositions the cursor so that the previous row will be the first + * entry <= the given row. + */ + public void afterEntry(Object[] row) + throws IOException + { + restorePosition( + new Entry(IndexData.this.createEntryBytes(row), RowId.LAST_ROW_ID)); + } + + /** + * @return valid entry if there was a next entry, + * {@code #getLastEntry} otherwise + */ + public Entry getNextEntry() throws IOException { + return getAnotherPosition(Cursor.MOVE_FORWARD).getEntry(); + } + + /** + * @return valid entry if there was a next entry, + * {@code #getFirstEntry} otherwise + */ + public Entry getPreviousEntry() throws IOException { + return getAnotherPosition(Cursor.MOVE_REVERSE).getEntry(); + } + + /** + * Restores a current position for the cursor (current position becomes + * previous position). + */ + protected void restorePosition(Entry curEntry) + throws IOException + { + restorePosition(curEntry, _curPos.getEntry()); + } + + /** + * Restores a current and previous position for the cursor. + */ + protected void restorePosition(Entry curEntry, Entry prevEntry) + throws IOException + { + if(!_curPos.equalsEntry(curEntry) || + !_prevPos.equalsEntry(prevEntry)) + { + if(!isUpToDate()) { + updateBounds(); + _lastModCount = getIndexModCount(); + } + _prevPos = updatePosition(prevEntry); + _curPos = updatePosition(curEntry); + } else { + checkForModification(); + } + } + + /** + * Gets another entry in the given direction, returning the new entry. + */ + private Position getAnotherPosition(boolean moveForward) + throws IOException + { + DirHandler handler = getDirHandler(moveForward); + if(_curPos.equals(handler.getEndPosition())) { + if(!isUpToDate()) { + restorePosition(_prevPos.getEntry()); + // drop through and retry moving to another entry + } else { + // at end, no more + return _curPos; + } + } + + checkForModification(); + + _prevPos = _curPos; + _curPos = handler.getAnotherPosition(_curPos); + return _curPos; + } + + /** + * Checks the index for modifications and updates state accordingly. + */ + private void checkForModification() + throws IOException + { + if(!isUpToDate()) { + updateBounds(); + _prevPos = updatePosition(_prevPos.getEntry()); + _curPos = updatePosition(_curPos.getEntry()); + _lastModCount = getIndexModCount(); + } + } + + /** + * Updates the given position, taking boundaries into account. + */ + private Position updatePosition(Entry entry) + throws IOException + { + if(!entry.isValid()) { + // no use searching if "updating" the first/last pos + if(_firstPos.equalsEntry(entry)) { + return _firstPos; + } else if(_lastPos.equalsEntry(entry)) { + return _lastPos; + } else { + throw new IllegalArgumentException("Invalid entry given " + entry); + } + } + + Position pos = findEntryPosition(entry); + if(pos.compareTo(_lastPos) >= 0) { + return _lastPos; + } else if(pos.compareTo(_firstPos) <= 0) { + return _firstPos; + } + return pos; + } + + /** + * Updates any the boundary info (_firstPos/_lastPos). + */ + private void updateBounds() + throws IOException + { + _firstPos = findEntryPosition(_firstPos.getEntry()); + _lastPos = findEntryPosition(_lastPos.getEntry()); + } + + @Override + public String toString() { + return getClass().getSimpleName() + " CurPosition " + _curPos + + ", PrevPosition " + _prevPos; + } + + /** + * Handles moving the cursor in a given direction. Separates cursor + * logic from value storage. + */ + private abstract class DirHandler { + public abstract Position getAnotherPosition(Position curPos) + throws IOException; + public abstract Position getBeginningPosition(); + public abstract Position getEndPosition(); + } + + /** + * Handles moving the cursor forward. + */ + private final class ForwardDirHandler extends DirHandler { + @Override + public Position getAnotherPosition(Position curPos) + throws IOException + { + Position newPos = getNextPosition(curPos); + if((newPos == null) || (newPos.compareTo(_lastPos) >= 0)) { + newPos = _lastPos; + } + return newPos; + } + @Override + public Position getBeginningPosition() { + return _firstPos; + } + @Override + public Position getEndPosition() { + return _lastPos; + } + } + + /** + * Handles moving the cursor backward. + */ + private final class ReverseDirHandler extends DirHandler { + @Override + public Position getAnotherPosition(Position curPos) + throws IOException + { + Position newPos = getPreviousPosition(curPos); + if((newPos == null) || (newPos.compareTo(_firstPos) <= 0)) { + newPos = _firstPos; + } + return newPos; + } + @Override + public Position getBeginningPosition() { + return _lastPos; + } + @Override + public Position getEndPosition() { + return _firstPos; + } + } + } + + /** + * Simple value object for maintaining some cursor state. + */ + private static final class Position implements Comparable { + /** the last known page of the given entry */ + private final DataPage _dataPage; + /** the last known index of the given entry */ + private final int _idx; + /** the entry at the given index */ + private final Entry _entry; + /** {@code true} if this entry does not currently exist in the entry list, + {@code false} otherwise (this is equivalent to adding -0.5 to the + _idx) */ + private final boolean _between; + + private Position(DataPage dataPage, int idx) + { + this(dataPage, idx, dataPage.getEntries().get(idx), false); + } + + private Position(DataPage dataPage, int idx, Entry entry, boolean between) + { + _dataPage = dataPage; + _idx = idx; + _entry = entry; + _between = between; + } + + public DataPage getDataPage() { + return _dataPage; + } + + public int getIndex() { + return _idx; + } + + public int getNextIndex() { + // note, _idx does not need to be advanced if it was pointing at a + // between position + return(_between ? _idx : (_idx + 1)); + } + + public int getPrevIndex() { + // note, we ignore the between flag here because the index will be + // pointing at the correct next index in either the between or + // non-between case + return(_idx - 1); + } + + public Entry getEntry() { + return _entry; + } + + public boolean isBetween() { + return _between; + } + + public boolean equalsEntry(Entry entry) { + return _entry.equals(entry); + } + + public int compareTo(Position other) + { + if(this == other) { + return 0; + } + + if(_dataPage.equals(other._dataPage)) { + // "simple" index comparison (handle between-ness) + int idxCmp = ((_idx < other._idx) ? -1 : + ((_idx > other._idx) ? 1 : + ((_between == other._between) ? 0 : + (_between ? -1 : 1)))); + if(idxCmp != 0) { + return idxCmp; + } + } + + // compare the entries. + return _entry.compareTo(other._entry); + } + + @Override + public int hashCode() { + return _entry.hashCode(); + } + + @Override + public boolean equals(Object o) { + return((this == o) || + ((o != null) && (getClass() == o.getClass()) && + (compareTo((Position)o) == 0))); + } + + @Override + public String toString() { + return "Page = " + _dataPage.getPageNumber() + ", Idx = " + _idx + + ", Entry = " + _entry + ", Between = " + _between; + } + } + + /** + * Object used to maintain state about an Index page. + */ + protected static abstract class DataPage { + + public abstract int getPageNumber(); + + public abstract boolean isLeaf(); + public abstract void setLeaf(boolean isLeaf); + + public abstract int getPrevPageNumber(); + public abstract void setPrevPageNumber(int pageNumber); + public abstract int getNextPageNumber(); + public abstract void setNextPageNumber(int pageNumber); + public abstract int getChildTailPageNumber(); + public abstract void setChildTailPageNumber(int pageNumber); + + public abstract int getTotalEntrySize(); + public abstract void setTotalEntrySize(int totalSize); + public abstract byte[] getEntryPrefix(); + public abstract void setEntryPrefix(byte[] entryPrefix); + + public abstract List getEntries(); + public abstract void setEntries(List entries); + + public abstract void addEntry(int idx, Entry entry) + throws IOException; + public abstract void removeEntry(int idx) + throws IOException; + + public final boolean isEmpty() { + return getEntries().isEmpty(); + } + + public final int getCompressedEntrySize() { + // when written to the index page, the entryPrefix bytes will only be + // written for the first entry, so we subtract the entry prefix size + // from all the other entries to determine the compressed size + return getTotalEntrySize() - + (getEntryPrefix().length * (getEntries().size() - 1)); + } + + public final int findEntry(Entry entry) { + return Collections.binarySearch(getEntries(), entry); + } + + @Override + public final int hashCode() { + return getPageNumber(); + } + + @Override + public final boolean equals(Object o) { + return((this == o) || + ((o != null) && (getClass() == o.getClass()) && + (getPageNumber() == ((DataPage)o).getPageNumber()))); + } + + @Override + public final String toString() { + List entries = getEntries(); + return (isLeaf() ? "Leaf" : "Node") + "DataPage[" + getPageNumber() + + "] " + getPrevPageNumber() + ", " + getNextPageNumber() + ", (" + + getChildTailPageNumber() + "), " + + ((isLeaf() && !entries.isEmpty()) ? + ("[" + entries.get(0) + ", " + + entries.get(entries.size() - 1) + "]") : + entries); + } + } + + + /** + * Extension of ByteStream which keeps track of an additional char count and + * the length of any "unprintable" code prefix. + */ + private static final class ExtraCodesStream extends ByteStream + { + private int _numChars; + private int _unprintablePrefixLen; + + private ExtraCodesStream(int length) { + super(length); + } + + public int getNumChars() { + return _numChars; + } + + public void incrementNumChars(int inc) { + _numChars += inc; + } + + public int getUnprintablePrefixLen() { + return _unprintablePrefixLen; + } + + public void setUnprintablePrefixLen(int len) { + _unprintablePrefixLen = len; + } + } + +} diff --git a/src/java/com/healthmarketscience/jackcess/IndexPageCache.java b/src/java/com/healthmarketscience/jackcess/IndexPageCache.java index 62bd1c9..56cb44a 100644 --- a/src/java/com/healthmarketscience/jackcess/IndexPageCache.java +++ b/src/java/com/healthmarketscience/jackcess/IndexPageCache.java @@ -40,7 +40,7 @@ import java.util.Map; import java.util.RandomAccess; -import static com.healthmarketscience.jackcess.Index.*; +import static com.healthmarketscience.jackcess.IndexData.*; /** * Manager of the index pages for a BigIndex. @@ -53,7 +53,7 @@ public class IndexPageCache } /** the index whose pages this cache is managing */ - private final BigIndex _index; + private final BigIndexData _indexData; /** the root page for the index */ private DataPageMain _rootPage; /** the currently loaded pages for this index, pageNumber -> page */ @@ -63,16 +63,16 @@ public class IndexPageCache private final List _modifiedPages = new ArrayList(); - public IndexPageCache(BigIndex index) { - _index = index; + public IndexPageCache(BigIndexData indexData) { + _indexData = indexData; } - public BigIndex getIndex() { - return _index; + public BigIndexData getIndexData() { + return _indexData; } public PageChannel getPageChannel() { - return getIndex().getPageChannel(); + return getIndexData().getPageChannel(); } /** @@ -129,7 +129,7 @@ public class IndexPageCache private void preparePagesForWriting() throws IOException { boolean splitPages = false; - int maxPageEntrySize = getIndex().getMaxPageEntrySize(); + int maxPageEntrySize = getIndexData().getMaxPageEntrySize(); // we need to continue looping through all the pages until we do not split // any pages (because a split may cascade up the tree) @@ -224,7 +224,7 @@ public class IndexPageCache private void writeDataPage(CacheDataPage cacheDataPage) throws IOException { - getIndex().writeDataPage(cacheDataPage); + getIndexData().writeDataPage(cacheDataPage); // lastly, mark the page as no longer modified cacheDataPage._extra._modified = false; @@ -255,7 +255,7 @@ public class IndexPageCache DataPageMain dataPage = new DataPageMain(pageNumber); DataPageExtra extra = new DataPageExtra(); CacheDataPage cacheDataPage = new CacheDataPage(dataPage, extra); - getIndex().readDataPage(cacheDataPage); + getIndexData().readDataPage(cacheDataPage); // associate the extra info with the main data page dataPage.setExtra(extra); @@ -742,7 +742,7 @@ public class IndexPageCache _dataPages.put(dpMain._pageNumber, dpMain); // update owned pages cache - _index.addOwnedPage(dpMain._pageNumber); + _indexData.addOwnedPage(dpMain._pageNumber); // needs to be written out CacheDataPage cacheDataPage = new CacheDataPage(dpMain, dpExtra); @@ -980,7 +980,7 @@ public class IndexPageCache */ private void validateEntries(DataPageExtra dpExtra) throws IOException { int entrySize = 0; - Entry prevEntry = Index.FIRST_ENTRY; + Entry prevEntry = IndexData.FIRST_ENTRY; for(Entry e : dpExtra._entries) { entrySize += e.size(); if(prevEntry.compareTo(e) >= 0) { @@ -1290,7 +1290,7 @@ public class IndexPageCache * IndexPageCache implementation of an Index {@link DataPage}. */ public static final class CacheDataPage - extends Index.DataPage + extends IndexData.DataPage { public final DataPageMain _main; public final DataPageExtra _extra; diff --git a/src/java/com/healthmarketscience/jackcess/SimpleIndex.java b/src/java/com/healthmarketscience/jackcess/SimpleIndex.java deleted file mode 100644 index 60117e5..0000000 --- a/src/java/com/healthmarketscience/jackcess/SimpleIndex.java +++ /dev/null @@ -1,230 +0,0 @@ -/* -Copyright (c) 2008 Health Market Science, Inc. - -This library is free software; you can redistribute it and/or -modify it under the terms of the GNU Lesser General Public -License as published by the Free Software Foundation; either -version 2.1 of the License, or (at your option) any later version. - -This library is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -Lesser General Public License for more details. - -You should have received a copy of the GNU Lesser General Public -License along with this library; if not, write to the Free Software -Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 -USA - -You can contact Health Market Science at info@healthmarketscience.com -or at the following address: - -Health Market Science -2700 Horizon Drive -Suite 200 -King of Prussia, PA 19406 -*/ - -package com.healthmarketscience.jackcess; - -import java.io.IOException; -import java.util.List; - - -/** - * Simple implementation of an Access table index - * @author Tim McCune - */ -public class SimpleIndex extends Index { - - /** data for the single index page. if this data came from multiple pages, - the index is read-only. */ - private SimpleDataPage _dataPage; - - public SimpleIndex(Table table, int uniqueEntryCount, - int uniqueEntryCountOffset) - { - super(table, uniqueEntryCount, uniqueEntryCountOffset); - } - - @Override - protected void updateImpl() throws IOException { - writeDataPage(_dataPage); - } - - @Override - protected void readIndexEntries() - throws IOException - { - // find first leaf page - int nextPageNumber = getRootPageNumber(); - SimpleDataPage indexPage = null; - while(true) { - indexPage = new SimpleDataPage(nextPageNumber); - readDataPage(indexPage); - - if(!indexPage.isLeaf()) { - // FIXME we can't modify this index at this point in time - setReadOnly(); - - // found another node page - if(!indexPage.getEntries().isEmpty()) { - nextPageNumber = indexPage.getEntries().get(0).getSubPageNumber(); - } else { - // try tail page - nextPageNumber = indexPage.getChildTailPageNumber(); - } - indexPage = null; - } else { - // found first leaf - break; - } - } - - // save the first leaf page - _dataPage = indexPage; - nextPageNumber = indexPage.getNextPageNumber(); - _dataPage.setNextPageNumber(INVALID_INDEX_PAGE_NUMBER); - indexPage = null; - - // read all leaf pages. - while(nextPageNumber != INVALID_INDEX_PAGE_NUMBER) { - - // FIXME we can't modify this index at this point in time - setReadOnly(); - - // found another one - indexPage = new SimpleDataPage(nextPageNumber); - readDataPage(indexPage); - - // since we read all the entries in sort order, we can insert them - // directly into the entries list - _dataPage.getEntries().addAll(indexPage.getEntries()); - int totalSize = (_dataPage.getTotalEntrySize() + - indexPage.getTotalEntrySize()); - _dataPage.setTotalEntrySize(totalSize); - nextPageNumber = indexPage.getNextPageNumber(); - } - - // check the entry order, just to be safe - List entries = _dataPage.getEntries(); - for(int i = 0; i < (entries.size() - 1); ++i) { - Entry e1 = entries.get(i); - Entry e2 = entries.get(i + 1); - if(e1.compareTo(e2) > 0) { - throw new IOException("Unexpected order in index entries, " + - e1 + " is greater than " + e2); - } - } - } - - @Override - protected DataPage findDataPage(Entry entry) - throws IOException - { - return _dataPage; - } - - @Override - protected DataPage getDataPage(int pageNumber) - throws IOException - { - throw new UnsupportedOperationException(); - } - - - /** - * Simple implementation of a DataPage - */ - private static final class SimpleDataPage extends DataPage { - private final int _pageNumber; - private boolean _leaf; - private int _nextPageNumber; - private int _totalEntrySize; - private int _childTailPageNumber; - private List _entries; - - private SimpleDataPage(int pageNumber) { - _pageNumber = pageNumber; - } - - @Override - public int getPageNumber() { - return _pageNumber; - } - - @Override - public boolean isLeaf() { - return _leaf; - } - @Override - public void setLeaf(boolean isLeaf) { - _leaf = isLeaf; - } - - @Override - public int getPrevPageNumber() { return 0; } - @Override - public void setPrevPageNumber(int pageNumber) { - // ignored - } - @Override - public int getNextPageNumber() { - return _nextPageNumber; - } - @Override - public void setNextPageNumber(int pageNumber) { - _nextPageNumber = pageNumber; - } - @Override - public int getChildTailPageNumber() { - return _childTailPageNumber; - } - @Override - public void setChildTailPageNumber(int pageNumber) { - _childTailPageNumber = pageNumber; - } - - @Override - public int getTotalEntrySize() { - return _totalEntrySize; - } - @Override - public void setTotalEntrySize(int totalSize) { - _totalEntrySize = totalSize; - } - @Override - public byte[] getEntryPrefix() { - return EMPTY_PREFIX; - } - @Override - public void setEntryPrefix(byte[] entryPrefix) { - // ignored - } - - @Override - public List getEntries() { - return _entries; - } - - @Override - public void setEntries(List entries) { - - _entries = entries; - } - - @Override - public void addEntry(int idx, Entry entry) { - _entries.add(idx, entry); - _totalEntrySize += entry.size(); - } - - @Override - public void removeEntry(int idx) { - Entry oldEntry = _entries.remove(idx); - _totalEntrySize -= oldEntry.size(); - } - - } - -} diff --git a/src/java/com/healthmarketscience/jackcess/SimpleIndexData.java b/src/java/com/healthmarketscience/jackcess/SimpleIndexData.java new file mode 100644 index 0000000..42d8030 --- /dev/null +++ b/src/java/com/healthmarketscience/jackcess/SimpleIndexData.java @@ -0,0 +1,230 @@ +/* +Copyright (c) 2008 Health Market Science, Inc. + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +USA + +You can contact Health Market Science at info@healthmarketscience.com +or at the following address: + +Health Market Science +2700 Horizon Drive +Suite 200 +King of Prussia, PA 19406 +*/ + +package com.healthmarketscience.jackcess; + +import java.io.IOException; +import java.util.List; + + +/** + * Simple implementation of an Access table index + * @author Tim McCune + */ +public class SimpleIndexData extends IndexData { + + /** data for the single index page. if this data came from multiple pages, + the index is read-only. */ + private SimpleDataPage _dataPage; + + public SimpleIndexData(Table table, int number, int uniqueEntryCount, + int uniqueEntryCountOffset) + { + super(table, number, uniqueEntryCount, uniqueEntryCountOffset); + } + + @Override + protected void updateImpl() throws IOException { + writeDataPage(_dataPage); + } + + @Override + protected void readIndexEntries() + throws IOException + { + // find first leaf page + int nextPageNumber = getRootPageNumber(); + SimpleDataPage indexPage = null; + while(true) { + indexPage = new SimpleDataPage(nextPageNumber); + readDataPage(indexPage); + + if(!indexPage.isLeaf()) { + // FIXME we can't modify this index at this point in time + setReadOnly(); + + // found another node page + if(!indexPage.getEntries().isEmpty()) { + nextPageNumber = indexPage.getEntries().get(0).getSubPageNumber(); + } else { + // try tail page + nextPageNumber = indexPage.getChildTailPageNumber(); + } + indexPage = null; + } else { + // found first leaf + break; + } + } + + // save the first leaf page + _dataPage = indexPage; + nextPageNumber = indexPage.getNextPageNumber(); + _dataPage.setNextPageNumber(INVALID_INDEX_PAGE_NUMBER); + indexPage = null; + + // read all leaf pages. + while(nextPageNumber != INVALID_INDEX_PAGE_NUMBER) { + + // FIXME we can't modify this index at this point in time + setReadOnly(); + + // found another one + indexPage = new SimpleDataPage(nextPageNumber); + readDataPage(indexPage); + + // since we read all the entries in sort order, we can insert them + // directly into the entries list + _dataPage.getEntries().addAll(indexPage.getEntries()); + int totalSize = (_dataPage.getTotalEntrySize() + + indexPage.getTotalEntrySize()); + _dataPage.setTotalEntrySize(totalSize); + nextPageNumber = indexPage.getNextPageNumber(); + } + + // check the entry order, just to be safe + List entries = _dataPage.getEntries(); + for(int i = 0; i < (entries.size() - 1); ++i) { + Entry e1 = entries.get(i); + Entry e2 = entries.get(i + 1); + if(e1.compareTo(e2) > 0) { + throw new IOException("Unexpected order in index entries, " + + e1 + " is greater than " + e2); + } + } + } + + @Override + protected DataPage findDataPage(Entry entry) + throws IOException + { + return _dataPage; + } + + @Override + protected DataPage getDataPage(int pageNumber) + throws IOException + { + throw new UnsupportedOperationException(); + } + + + /** + * Simple implementation of a DataPage + */ + private static final class SimpleDataPage extends DataPage { + private final int _pageNumber; + private boolean _leaf; + private int _nextPageNumber; + private int _totalEntrySize; + private int _childTailPageNumber; + private List _entries; + + private SimpleDataPage(int pageNumber) { + _pageNumber = pageNumber; + } + + @Override + public int getPageNumber() { + return _pageNumber; + } + + @Override + public boolean isLeaf() { + return _leaf; + } + @Override + public void setLeaf(boolean isLeaf) { + _leaf = isLeaf; + } + + @Override + public int getPrevPageNumber() { return 0; } + @Override + public void setPrevPageNumber(int pageNumber) { + // ignored + } + @Override + public int getNextPageNumber() { + return _nextPageNumber; + } + @Override + public void setNextPageNumber(int pageNumber) { + _nextPageNumber = pageNumber; + } + @Override + public int getChildTailPageNumber() { + return _childTailPageNumber; + } + @Override + public void setChildTailPageNumber(int pageNumber) { + _childTailPageNumber = pageNumber; + } + + @Override + public int getTotalEntrySize() { + return _totalEntrySize; + } + @Override + public void setTotalEntrySize(int totalSize) { + _totalEntrySize = totalSize; + } + @Override + public byte[] getEntryPrefix() { + return EMPTY_PREFIX; + } + @Override + public void setEntryPrefix(byte[] entryPrefix) { + // ignored + } + + @Override + public List getEntries() { + return _entries; + } + + @Override + public void setEntries(List entries) { + + _entries = entries; + } + + @Override + public void addEntry(int idx, Entry entry) { + _entries.add(idx, entry); + _totalEntrySize += entry.size(); + } + + @Override + public void removeEntry(int idx) { + Entry oldEntry = _entries.remove(idx); + _totalEntrySize -= oldEntry.size(); + } + + } + +} diff --git a/src/java/com/healthmarketscience/jackcess/Table.java b/src/java/com/healthmarketscience/jackcess/Table.java index f6e7541..c25934b 100644 --- a/src/java/com/healthmarketscience/jackcess/Table.java +++ b/src/java/com/healthmarketscience/jackcess/Table.java @@ -104,10 +104,10 @@ public class Table private final Database _database; /** Type of the table (either TYPE_SYSTEM or TYPE_USER) */ private byte _tableType; - /** Number of indexes on the table */ + /** Number of actual indexes on the table */ private int _indexCount; - /** Number of index slots for the table */ - private int _indexSlotCount; + /** Number of logical indexes for the table */ + private int _logicalIndexCount; /** Number of rows in the table */ private int _rowCount; /** last long auto number for the table */ @@ -122,8 +122,12 @@ public class Table private List _columns = new ArrayList(); /** List of variable length columns in this table, ordered by offset */ private List _varColumns = new ArrayList(); - /** List of indexes on this table */ + /** List of indexes on this table (multiple logical indexes may be backed by + the same index data) */ private List _indexes = new ArrayList(); + /** List of index datas on this table (the actual backing data for an + index) */ + private List _indexDatas = new ArrayList(); /** Table name as stored in Database */ private final String _name; /** Usage map of pages that this table owns */ @@ -337,11 +341,18 @@ public class Table " does not exist on this table"); } + /** + * @return All of the IndexData on this table (unmodifiable List) + */ + List getIndexDatas() { + return Collections.unmodifiableList(_indexDatas); + } + /** * Only called by unit tests */ - int getIndexSlotCount() { - return _indexSlotCount; + int getLogicalIndexCount() { + return _logicalIndexCount; } /** @@ -376,7 +387,7 @@ public class Table int rowNumber = rowState.getHeaderRowId().getRowNumber(); // use any read rowValues to help update the indexes - Object[] rowValues = (!_indexes.isEmpty() ? + Object[] rowValues = (!_indexDatas.isEmpty() ? rowState.getRowValues() : null); int rowIndex = getRowStartOffset(rowNumber, getFormat()); @@ -385,8 +396,8 @@ public class Table writeDataPage(rowBuffer, pageNumber); // update the indexes - for(Index index : _indexes) { - index.deleteRow(rowValues, rowId); + for(IndexData indexData : _indexDatas) { + indexData.deleteRow(rowValues, rowId); } // make sure table def gets updated @@ -1067,7 +1078,7 @@ public class Table _maxColumnCount = tableBuffer.getShort(getFormat().OFFSET_MAX_COLS); _maxVarColumnCount = tableBuffer.getShort(getFormat().OFFSET_NUM_VAR_COLS); short columnCount = tableBuffer.getShort(getFormat().OFFSET_NUM_COLS); - _indexSlotCount = tableBuffer.getInt(getFormat().OFFSET_NUM_INDEX_SLOTS); + _logicalIndexCount = tableBuffer.getInt(getFormat().OFFSET_NUM_INDEX_SLOTS); _indexCount = tableBuffer.getInt(getFormat().OFFSET_NUM_INDEXES); int rowNum = ByteUtil.getUnsignedByte( @@ -1084,7 +1095,8 @@ public class Table (getFormat().OFFSET_INDEX_DEF_BLOCK + (i * getFormat().SIZE_INDEX_DEFINITION) + 4); int uniqueEntryCount = tableBuffer.getInt(uniqueEntryCountOffset); - _indexes.add(createIndex(uniqueEntryCount, uniqueEntryCountOffset)); + _indexDatas.add(createIndexData(i, uniqueEntryCount, + uniqueEntryCountOffset)); } int colOffset = getFormat().OFFSET_INDEX_DEF_BLOCK + @@ -1117,60 +1129,34 @@ public class Table // sort variable length columns based on their index into the variable // length offset table, because we will write the columns in this order Collections.sort(_varColumns, VAR_LEN_COLUMN_COMPARATOR); - - int idxOffset = tableBuffer.position(); - tableBuffer.position(idxOffset + - (getFormat().OFFSET_INDEX_NUMBER_BLOCK * _indexCount)); - // if there are more index slots than indexes, the initial slots are - // always empty/invalid, so we skip that data - int firstRealIdx = (_indexSlotCount - _indexCount); - - for (int i = 0; i < _indexSlotCount; i++) { + // read index column information + for (int i = 0; i < _indexCount; i++) { + ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX); //Forward past Unknown + _indexDatas.get(i).read(tableBuffer, _columns); + } + + // read logical index info (may be more logical indexes than index datas) + for (int i = 0; i < _logicalIndexCount; i++) { ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX_SLOT); //Forward past Unknown - tableBuffer.getInt(); //Forward past alternate index number int indexNumber = tableBuffer.getInt(); + int indexDataNumber = tableBuffer.getInt(); ByteUtil.forward(tableBuffer, 11); byte indexType = tableBuffer.get(); ByteUtil.forward(tableBuffer, getFormat().SKIP_AFTER_INDEX_SLOT); //Skip past Unknown - if(i < firstRealIdx) { - // ignore this info - continue; - } - - Index index = _indexes.get(i - firstRealIdx); - index.setIndexNumber(indexNumber); - index.setIndexType(indexType); + IndexData indexData = _indexDatas.get(indexDataNumber); + _indexes.add(new Index(indexData, indexNumber, indexType)); } - // read actual index names - for (int i = 0; i < _indexSlotCount; i++) { - if(i < firstRealIdx) { - // for each empty index slot, there is some weird sort of name, skip - // it - skipName(tableBuffer); - continue; - } - - _indexes.get(i - firstRealIdx) - .setName(readName(tableBuffer)); + // read logical index names + for (int i = 0; i < _logicalIndexCount; i++) { + _indexes.get(i).setName(readName(tableBuffer)); } - int idxEndOffset = tableBuffer.position(); Collections.sort(_indexes); - // go back to index column info after sorting - tableBuffer.position(idxOffset); - for (int i = 0; i < _indexCount; i++) { - ByteUtil.forward(tableBuffer, getFormat().SKIP_BEFORE_INDEX); //Forward past Unknown - _indexes.get(i).read(tableBuffer, _columns); - } - - // reset to end of index info - tableBuffer.position(idxEndOffset); - // re-sort columns if necessary if(getDatabase().getColumnOrder() != ColumnOrder.DATA) { Collections.sort(_columns, DISPLAY_ORDER_COMPARATOR); @@ -1180,11 +1166,15 @@ public class Table /** * Creates an index with the given initial info. */ - private Index createIndex(int uniqueEntryCount, int uniqueEntryCountOffset) + private IndexData createIndexData(int indexDataNumber, + int uniqueEntryCount, + int uniqueEntryCountOffset) { return(_useBigIndex ? - new BigIndex(this, uniqueEntryCount, uniqueEntryCountOffset) : - new SimpleIndex(this, uniqueEntryCount, uniqueEntryCountOffset)); + new BigIndexData(this, indexDataNumber, uniqueEntryCount, + uniqueEntryCountOffset) : + new SimpleIndexData(this, indexDataNumber, uniqueEntryCount, + uniqueEntryCountOffset)); } /** @@ -1359,8 +1349,8 @@ public class Table // update the indexes RowId rowId = new RowId(pageNumber, rowNum); - for(Index index : _indexes) { - index.addRow(rows.get(i), rowId); + for(IndexData indexData : _indexDatas) { + indexData.addRow(rows.get(i), rowId); } } @@ -1422,12 +1412,12 @@ public class Table " is too large"); } - Object[] oldRowValues = (!_indexes.isEmpty() ? + Object[] oldRowValues = (!_indexDatas.isEmpty() ? rowState.getRowValues() : null); // delete old values from indexes - for(Index index : _indexes) { - index.deleteRow(oldRowValues, rowId); + for(IndexData indexData : _indexDatas) { + indexData.deleteRow(oldRowValues, rowId); } // see if we can squeeze the new row data into the existing row @@ -1488,8 +1478,8 @@ public class Table } // update the indexes - for(Index index : _indexes) { - index.addRow(row, rowId); + for(IndexData indexData : _indexDatas) { + indexData.addRow(row, rowId); } writeDataPage(dataPage, pageNumber); @@ -1557,13 +1547,13 @@ public class Table tdefPage.putInt(getFormat().OFFSET_NEXT_AUTO_NUMBER, _lastLongAutoNumber); // write any index changes - for (Index index : _indexes) { + for (IndexData indexData : _indexDatas) { // write the unique entry count for the index to the table definition // page - tdefPage.putInt(index.getUniqueEntryCountOffset(), - index.getUniqueEntryCount()); + tdefPage.putInt(indexData.getUniqueEntryCountOffset(), + indexData.getUniqueEntryCount()); // write the entry page for the index - index.update(); + indexData.update(); } // write modified table definition diff --git a/test/src/java/com/healthmarketscience/jackcess/BigIndexTest.java b/test/src/java/com/healthmarketscience/jackcess/BigIndexTest.java index 4f79602..5c4ce48 100644 --- a/test/src/java/com/healthmarketscience/jackcess/BigIndexTest.java +++ b/test/src/java/com/healthmarketscience/jackcess/BigIndexTest.java @@ -74,7 +74,7 @@ public class BigIndexTest extends TestCase { Index index = t.getIndex("CD_AGENTE"); assertFalse(index.isInitialized()); assertEquals(512, countRows(t)); - assertEquals(512, index.getEntryCount()); + assertEquals(512, index.getIndexData().getEntryCount()); db.close(); } } @@ -88,7 +88,7 @@ public class BigIndexTest extends TestCase { Index index = t.getIndex("col1"); assertFalse(index.isInitialized()); assertEquals(0, countRows(t)); - assertEquals(0, index.getEntryCount()); + assertEquals(0, index.getIndexData().getEntryCount()); db.close(); DatabaseTest._autoSync = false; @@ -130,7 +130,7 @@ public class BigIndexTest extends TestCase { } } - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); db.flush(); t = db.getTable("Table1"); @@ -158,7 +158,7 @@ public class BigIndexTest extends TestCase { assertEquals(2000, rowCount); - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); // delete an entry in the middle Cursor cursor = Cursor.createIndexCursor(t, index); @@ -175,7 +175,7 @@ public class BigIndexTest extends TestCase { cursor.deleteCurrentRow(); } - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); List found = new ArrayList(); for(Map row : Cursor.createIndexCursor(t, index)) { @@ -194,7 +194,7 @@ public class BigIndexTest extends TestCase { assertFalse(cursor.moveToNextRow()); assertFalse(cursor.moveToPreviousRow()); - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); // add 50 (pseudo) random entries to the table rand = new Random(42L); @@ -207,14 +207,14 @@ public class BigIndexTest extends TestCase { t.addRow(nextVal, "this is some row data " + nextInt); } - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); cursor = Cursor.createIndexCursor(t, index); while(cursor.moveToNextRow()) { cursor.deleteCurrentRow(); } - ((BigIndex)index).validate(); + ((BigIndexData)index.getIndexData()).validate(); db.close(); diff --git a/test/src/java/com/healthmarketscience/jackcess/DatabaseTest.java b/test/src/java/com/healthmarketscience/jackcess/DatabaseTest.java index a6d9a17..1359d4b 100644 --- a/test/src/java/com/healthmarketscience/jackcess/DatabaseTest.java +++ b/test/src/java/com/healthmarketscience/jackcess/DatabaseTest.java @@ -1254,9 +1254,9 @@ public class DatabaseTest extends TestCase { static void dumpIndex(Index index, PrintWriter writer) throws Exception { writer.println("INDEX: " + index); - Index.EntryCursor ec = index.cursor(); - Index.Entry lastE = ec.getLastEntry(); - Index.Entry e = null; + IndexData.EntryCursor ec = index.cursor(); + IndexData.Entry lastE = ec.getLastEntry(); + IndexData.Entry e = null; while((e = ec.getNextEntry()) != lastE) { writer.println(e); } diff --git a/test/src/java/com/healthmarketscience/jackcess/IndexCodesTest.java b/test/src/java/com/healthmarketscience/jackcess/IndexCodesTest.java index 53370a4..cff03d7 100644 --- a/test/src/java/com/healthmarketscience/jackcess/IndexCodesTest.java +++ b/test/src/java/com/healthmarketscience/jackcess/IndexCodesTest.java @@ -584,7 +584,7 @@ public class IndexCodesTest extends TestCase { { Field eField = curPos.getClass().getDeclaredField("_entry"); eField.setAccessible(true); - Index.Entry entry = (Index.Entry)eField.get(curPos); + IndexData.Entry entry = (IndexData.Entry)eField.get(curPos); Field ebField = entry.getClass().getDeclaredField("_entryBytes"); ebField.setAccessible(true); byte[] entryBytes = (byte[])ebField.get(entry); diff --git a/test/src/java/com/healthmarketscience/jackcess/IndexTest.java b/test/src/java/com/healthmarketscience/jackcess/IndexTest.java index 1738b07..a2f00ca 100644 --- a/test/src/java/com/healthmarketscience/jackcess/IndexTest.java +++ b/test/src/java/com/healthmarketscience/jackcess/IndexTest.java @@ -77,7 +77,7 @@ public class IndexTest extends TestCase { List expectedList = Arrays.asList(b0, b1, b2, b3, b4, b5, b6, b7, b8); SortedSet sortedSet = new TreeSet( - Index.BYTE_CODE_COMPARATOR); + IndexData.BYTE_CODE_COMPARATOR); sortedSet.addAll(expectedList); assertEquals(expectedList, new ArrayList(sortedSet)); @@ -98,7 +98,7 @@ public class IndexTest extends TestCase { } } - public void testIndexSlots() throws Exception + public void testLogicalIndexes() throws Exception { for (final TestDB testDB : TestDB.getSupportedForBasename(Basename.INDEX, true)) { Database mdb = open(testDB); @@ -108,7 +108,7 @@ public class IndexTest extends TestCase { idx.initialize(); } assertEquals(4, table.getIndexes().size()); - assertEquals(4, table.getIndexSlotCount()); + assertEquals(4, table.getLogicalIndexCount()); checkIndexColumns(table, "id", "id", "PrimaryKey", "id", @@ -121,21 +121,43 @@ public class IndexTest extends TestCase { for(Index idx : table.getIndexes()) { idx.initialize(); } - assertEquals(2, table.getIndexes().size()); - assertEquals(3, table.getIndexSlotCount()); + assertEquals(3, table.getIndexes().size()); + assertEquals(2, table.getIndexDatas().size()); + assertEquals(3, table.getLogicalIndexCount()); checkIndexColumns(table, "id", "id", - "PrimaryKey", "id"); + "PrimaryKey", "id", + ".rC", "id"); + + Index pkIdx = table.getIndex("PrimaryKey"); + Index fkIdx = table.getIndex(".rC"); + assertNotSame(pkIdx, fkIdx); + assertTrue(fkIdx.isForeignKey()); + assertSame(pkIdx.getIndexData(), fkIdx.getIndexData()); + IndexData indexData = pkIdx.getIndexData(); + assertEquals(Arrays.asList(pkIdx, fkIdx), indexData.getIndexes()); + assertSame(pkIdx, indexData.getPrimaryIndex()); table = mdb.getTable("Table3"); for(Index idx : table.getIndexes()) { idx.initialize(); } - assertEquals(2, table.getIndexes().size()); - assertEquals(3, table.getIndexSlotCount()); + assertEquals(3, table.getIndexes().size()); + assertEquals(2, table.getIndexDatas().size()); + assertEquals(3, table.getLogicalIndexCount()); checkIndexColumns(table, "id", "id", - "PrimaryKey", "id"); + "PrimaryKey", "id", + ".rC", "id"); + + pkIdx = table.getIndex("PrimaryKey"); + fkIdx = table.getIndex(".rC"); + assertNotSame(pkIdx, fkIdx); + assertTrue(fkIdx.isForeignKey()); + assertSame(pkIdx.getIndexData(), fkIdx.getIndexData()); + indexData = pkIdx.getIndexData(); + assertEquals(Arrays.asList(pkIdx, fkIdx), indexData.getIndexes()); + assertSame(pkIdx, indexData.getPrimaryIndex()); } } @@ -148,7 +170,7 @@ public class IndexTest extends TestCase { Index index = t.getIndexes().get(0); assertFalse(index.isInitialized()); assertEquals(512, countRows(t)); - assertEquals(512, index.getEntryCount()); + assertEquals(512, index.getIndexData().getEntryCount()); db.close(); // copy to temp file and attempt to edit @@ -159,13 +181,13 @@ public class IndexTest extends TestCase { System.out.println("IndexTest: Index type: " + index.getClass()); try { t.addRow(99, "abc", "def"); - if(index instanceof SimpleIndex) { + if(index.getIndexData() instanceof SimpleIndexData) { // SimpleIndex doesn't support writing these indexes fail("Should have thrown UnsupportedOperationException"); } } catch(UnsupportedOperationException e) { // success - if(index instanceof BigIndex) { + if(index.getIndexData() instanceof BigIndexData) { throw e; } } @@ -184,7 +206,7 @@ public class IndexTest extends TestCase { assertRowCount(12, table); for(Index index : table.getIndexes()) { - assertEquals(12, index.getEntryCount()); + assertEquals(12, index.getIndexData().getEntryCount()); } table.reset(); @@ -205,7 +227,7 @@ public class IndexTest extends TestCase { assertRowCount(8, table); for(Index index : table.getIndexes()) { - assertEquals(8, index.getEntryCount()); + assertEquals(8, index.getIndexData().getEntryCount()); } } } @@ -235,7 +257,8 @@ public class IndexTest extends TestCase { temp.addRow(orig.asRow(row)); } - assertEquals(origI.getEntryCount(), tempI.getEntryCount()); + assertEquals(origI.getIndexData().getEntryCount(), + tempI.getIndexData().getEntryCount()); Cursor origC = Cursor.createIndexCursor(orig, origI); Cursor tempC = Cursor.createIndexCursor(temp, tempI); @@ -342,8 +365,8 @@ public class IndexTest extends TestCase { 13 * i, (6.7d / i), null, null, true); } - assertEquals(12, indA.getEntryCount()); - assertEquals(12, indB.getEntryCount()); + assertEquals(12, indA.getIndexData().getEntryCount()); + assertEquals(12, indB.getIndexData().getEntryCount()); assertEquals(12, indA.getUniqueEntryCount()); assertEquals(8, indB.getUniqueEntryCount()); @@ -356,8 +379,8 @@ public class IndexTest extends TestCase { indA = table.getIndex("PrimaryKey"); indB = table.getIndex("B"); - assertEquals(12, indA.getEntryCount()); - assertEquals(12, indB.getEntryCount()); + assertEquals(12, indA.getIndexData().getEntryCount()); + assertEquals(12, indB.getIndexData().getEntryCount()); assertEquals(12, indA.getUniqueEntryCount()); assertEquals(8, indB.getUniqueEntryCount()); @@ -374,8 +397,8 @@ public class IndexTest extends TestCase { } c.deleteCurrentRow(); - assertEquals(11, indA.getEntryCount()); - assertEquals(11, indB.getEntryCount()); + assertEquals(11, indA.getIndexData().getEntryCount()); + assertEquals(11, indB.getIndexData().getEntryCount()); assertEquals(12, indA.getUniqueEntryCount()); assertEquals(8, indB.getUniqueEntryCount());