Examples with RowLocation org.apache.derby.iapi.types.RowLocation used on opensource projects

Example 51 with RowLocation

use of org.apache.derby.iapi.types.RowLocation in project derby by apache.

the class CreateIndexConstantAction method executeConstantAction.

// INTERFACE METHODS
/**
 *	This is the guts of the Execution-time logic for
 *  creating an index.
 *
 *  <P>
 *  A index is represented as:
 *  <UL>
 *  <LI> ConglomerateDescriptor.
 *  </UL>
 *  No dependencies are created.
 *
 *  @see ConglomerateDescriptor
 *  @see SchemaDescriptor
 *	@see ConstantAction#executeConstantAction
 *
 * @exception StandardException		Thrown on failure
 */
public void executeConstantAction(Activation activation) throws StandardException {
    TableDescriptor td;
    UUID toid;
    ColumnDescriptor columnDescriptor;
    int[] baseColumnPositions;
    IndexRowGenerator indexRowGenerator = null;
    ExecRow[] baseRows;
    ExecIndexRow[] indexRows;
    ExecRow[] compactBaseRows;
    GroupFetchScanController scan;
    RowLocationRetRowSource rowSource;
    long sortId;
    int maxBaseColumnPosition = -1;
    LanguageConnectionContext lcc = activation.getLanguageConnectionContext();
    DataDictionary dd = lcc.getDataDictionary();
    DependencyManager dm = dd.getDependencyManager();
    TransactionController tc = lcc.getTransactionExecute();
    /*
		** Inform the data dictionary that we are about to write to it.
		** There are several calls to data dictionary "get" methods here
		** that might be done in "read" mode in the data dictionary, but
		** it seemed safer to do this whole operation in "write" mode.
		**
		** We tell the data dictionary we're done writing at the end of
		** the transaction.
		*/
    dd.startWriting(lcc);
    /*
		** If the schema descriptor is null, then
		** we must have just read ourselves in.  
		** So we will get the corresponding schema
		** descriptor from the data dictionary.
		*/
    SchemaDescriptor sd = dd.getSchemaDescriptor(schemaName, tc, true);
    /* Get the table descriptor. */
    /* See if we can get the TableDescriptor 
		 * from the Activation.  (Will be there
		 * for backing indexes.)
		 */
    td = activation.getDDLTableDescriptor();
    if (td == null) {
        /* tableId will be non-null if adding an index to
			 * an existing table (as opposed to creating a
			 * table with a constraint with a backing index).
			 */
        if (tableId != null) {
            td = dd.getTableDescriptor(tableId);
        } else {
            td = dd.getTableDescriptor(tableName, sd, tc);
        }
    }
    if (td == null) {
        throw StandardException.newException(SQLState.LANG_CREATE_INDEX_NO_TABLE, indexName, tableName);
    }
    if (td.getTableType() == TableDescriptor.SYSTEM_TABLE_TYPE) {
        throw StandardException.newException(SQLState.LANG_CREATE_SYSTEM_INDEX_ATTEMPTED, indexName, tableName);
    }
    /* Get a shared table lock on the table. We need to lock table before
		 * invalidate dependents, otherwise, we may interfere with the
		 * compilation/re-compilation of DML/DDL.  See beetle 4325 and $WS/
		 * docs/language/SolutionsToConcurrencyIssues.txt (point f).
		 */
    lockTableForDDL(tc, td.getHeapConglomerateId(), false);
    // depended on this table (including this one)
    if (!forCreateTable) {
        dm.invalidateFor(td, DependencyManager.CREATE_INDEX, lcc);
    }
    // Translate the base column names to column positions
    baseColumnPositions = new int[columnNames.length];
    for (int i = 0; i < columnNames.length; i++) {
        // Look up the column in the data dictionary
        columnDescriptor = td.getColumnDescriptor(columnNames[i]);
        if (columnDescriptor == null) {
            throw StandardException.newException(SQLState.LANG_COLUMN_NOT_FOUND_IN_TABLE, columnNames[i], tableName);
        }
        TypeId typeId = columnDescriptor.getType().getTypeId();
        // Don't allow a column to be created on a non-orderable type
        ClassFactory cf = lcc.getLanguageConnectionFactory().getClassFactory();
        boolean isIndexable = typeId.orderable(cf);
        if (isIndexable && typeId.userType()) {
            String userClass = typeId.getCorrespondingJavaTypeName();
            // run the compare method.
            try {
                if (cf.isApplicationClass(cf.loadApplicationClass(userClass)))
                    isIndexable = false;
            } catch (ClassNotFoundException cnfe) {
                // shouldn't happen as we just check the class is orderable
                isIndexable = false;
            }
        }
        if (!isIndexable) {
            throw StandardException.newException(SQLState.LANG_COLUMN_NOT_ORDERABLE_DURING_EXECUTION, typeId.getSQLTypeName());
        }
        // Remember the position in the base table of each column
        baseColumnPositions[i] = columnDescriptor.getPosition();
        if (maxBaseColumnPosition < baseColumnPositions[i])
            maxBaseColumnPosition = baseColumnPositions[i];
    }
    /* The code below tries to determine if the index that we're about
		 * to create can "share" a conglomerate with an existing index.
		 * If so, we will use a single physical conglomerate--namely, the
		 * one that already exists--to support both indexes. I.e. we will
		 * *not* create a new conglomerate as part of this constant action.
         *
         * Deferrable constraints are backed by indexes that are *not* shared
         * since they use physically non-unique indexes and as such are
         * different from indexes used to represent non-deferrable
         * constraints.
		 */
    // check if we have similar indices already for this table
    ConglomerateDescriptor[] congDescs = td.getConglomerateDescriptors();
    boolean shareExisting = false;
    for (int i = 0; i < congDescs.length; i++) {
        ConglomerateDescriptor cd = congDescs[i];
        if (!cd.isIndex())
            continue;
        if (droppedConglomNum == cd.getConglomerateNumber()) {
            /* We can't share with any conglomerate descriptor
				 * whose conglomerate number matches the dropped
				 * conglomerate number, because that descriptor's
				 * backing conglomerate was dropped, as well.  If
				 * we're going to share, we have to share with a
				 * descriptor whose backing physical conglomerate
				 * is still around.
				 */
            continue;
        }
        IndexRowGenerator irg = cd.getIndexDescriptor();
        int[] bcps = irg.baseColumnPositions();
        boolean[] ia = irg.isAscending();
        int j = 0;
        /* The conditions which allow an index to share an existing
			 * conglomerate are as follows:
			 *
			 * 1. the set of columns (both key and include columns) and their 
			 *  order in the index is the same as that of an existing index AND 
			 *
			 * 2. the ordering attributes are the same AND 
			 *
			 * 3. one of the following is true:
			 *    a) the existing index is unique, OR
			 *    b) the existing index is non-unique with uniqueWhenNotNulls
			 *       set to TRUE and the index being created is non-unique, OR
			 *    c) both the existing index and the one being created are
			 *       non-unique and have uniqueWithDuplicateNulls set to FALSE.
             *
             * 4. hasDeferrableChecking is FALSE.
             */
        boolean possibleShare = (irg.isUnique() || !unique) && (bcps.length == baseColumnPositions.length) && !hasDeferrableChecking;
        // is set to true (backing index for unique constraint)
        if (possibleShare && !irg.isUnique()) {
            /* If the existing index has uniqueWithDuplicateNulls set to
				 * TRUE it can be shared by other non-unique indexes; otherwise
				 * the existing non-unique index has uniqueWithDuplicateNulls
				 * set to FALSE, which means the new non-unique conglomerate
				 * can only share if it has uniqueWithDuplicateNulls set to
				 * FALSE, as well.
				 */
            possibleShare = (irg.isUniqueWithDuplicateNulls() || !uniqueWithDuplicateNulls);
        }
        if (possibleShare && indexType.equals(irg.indexType())) {
            for (; j < bcps.length; j++) {
                if ((bcps[j] != baseColumnPositions[j]) || (ia[j] != isAscending[j]))
                    break;
            }
        }
        if (// share
        j == baseColumnPositions.length) {
            /*
				 * Don't allow users to create a duplicate index. Allow if being done internally
				 * for a constraint
				 */
            if (!isConstraint) {
                activation.addWarning(StandardException.newWarning(SQLState.LANG_INDEX_DUPLICATE, indexName, cd.getConglomerateName()));
                return;
            }
            /* Sharing indexes share the physical conglomerate
				 * underneath, so pull the conglomerate number from
				 * the existing conglomerate descriptor.
				 */
            conglomId = cd.getConglomerateNumber();
            /* We create a new IndexRowGenerator because certain
				 * attributes--esp. uniqueness--may be different between
				 * the index we're creating and the conglomerate that
				 * already exists.  I.e. even though we're sharing a
				 * conglomerate, the new index is not necessarily
				 * identical to the existing conglomerate. We have to
				 * keep track of that info so that if we later drop
				 * the shared physical conglomerate, we can figure out
				 * what this index (the one we're creating now) is
				 * really supposed to look like.
				 */
            indexRowGenerator = new IndexRowGenerator(indexType, unique, uniqueWithDuplicateNulls, // uniqueDeferrable
            false, // deferrable indexes are not shared
            false, baseColumnPositions, isAscending, baseColumnPositions.length);
            // DERBY-655 and DERBY-1343
            // Sharing indexes will have unique logical conglomerate UUIDs.
            conglomerateUUID = dd.getUUIDFactory().createUUID();
            shareExisting = true;
            break;
        }
    }
    /* If we have a droppedConglomNum then the index we're about to
		 * "create" already exists--i.e. it has an index descriptor and
		 * the corresponding information is already in the system catalogs.
		 * The only thing we're missing, then, is the physical conglomerate
		 * to back the index (because the old conglomerate was dropped).
		 */
    boolean alreadyHaveConglomDescriptor = (droppedConglomNum > -1L);
    /* If this index already has an essentially same one, we share the
		 * conglomerate with the old one, and just simply add a descriptor
		 * entry into SYSCONGLOMERATES--unless we already have a descriptor,
		 * in which case we don't even need to do that.
		 */
    DataDescriptorGenerator ddg = dd.getDataDescriptorGenerator();
    if (shareExisting && !alreadyHaveConglomDescriptor) {
        ConglomerateDescriptor cgd = ddg.newConglomerateDescriptor(conglomId, indexName, true, indexRowGenerator, isConstraint, conglomerateUUID, td.getUUID(), sd.getUUID());
        dd.addDescriptor(cgd, sd, DataDictionary.SYSCONGLOMERATES_CATALOG_NUM, false, tc);
        // add newly added conglomerate to the list of conglomerate
        // descriptors in the td.
        ConglomerateDescriptorList cdl = td.getConglomerateDescriptorList();
        cdl.add(cgd);
    // can't just return yet, need to get member "indexTemplateRow"
    // because create constraint may use it
    }
    // Describe the properties of the index to the store using Properties
    // RESOLVE: The following properties assume a BTREE index.
    Properties indexProperties;
    if (properties != null) {
        indexProperties = properties;
    } else {
        indexProperties = new Properties();
    }
    // Tell it the conglomerate id of the base table
    indexProperties.put("baseConglomerateId", Long.toString(td.getHeapConglomerateId()));
    if (uniqueWithDuplicateNulls && !hasDeferrableChecking) {
        if (dd.checkVersion(DataDictionary.DD_VERSION_DERBY_10_4, null)) {
            indexProperties.put("uniqueWithDuplicateNulls", Boolean.toString(true));
        } else {
            // index creating a unique index instead.
            if (uniqueWithDuplicateNulls) {
                unique = true;
            }
        }
    }
    // All indexes are unique because they contain the RowLocation.
    // The number of uniqueness columns must include the RowLocation
    // if the user did not specify a unique index.
    indexProperties.put("nUniqueColumns", Integer.toString(unique ? baseColumnPositions.length : baseColumnPositions.length + 1));
    // By convention, the row location column is the last column
    indexProperties.put("rowLocationColumn", Integer.toString(baseColumnPositions.length));
    // For now, all columns are key fields, including the RowLocation
    indexProperties.put("nKeyFields", Integer.toString(baseColumnPositions.length + 1));
    // For now, assume that all index columns are ordered columns
    if (!shareExisting) {
        if (dd.checkVersion(DataDictionary.DD_VERSION_DERBY_10_4, null)) {
            indexRowGenerator = new IndexRowGenerator(indexType, unique, uniqueWithDuplicateNulls, uniqueDeferrable, (hasDeferrableChecking && constraintType != DataDictionary.FOREIGNKEY_CONSTRAINT), baseColumnPositions, isAscending, baseColumnPositions.length);
        } else {
            indexRowGenerator = new IndexRowGenerator(indexType, unique, false, false, false, baseColumnPositions, isAscending, baseColumnPositions.length);
        }
    }
    /* Now add the rows from the base table to the conglomerate.
		 * We do this by scanning the base table and inserting the
		 * rows into a sorter before inserting from the sorter
		 * into the index.  This gives us better performance
		 * and a more compact index.
		 */
    rowSource = null;
    sortId = 0;
    // set to true once the sorter is created
    boolean needToDropSort = false;
    /* bulkFetchSIze will be 16 (for now) unless
		 * we are creating the table in which case it
		 * will be 1.  Too hard to remove scan when
		 * creating index on new table, so minimize
		 * work where we can.
		 */
    int bulkFetchSize = (forCreateTable) ? 1 : 16;
    int numColumns = td.getNumberOfColumns();
    int approximateRowSize = 0;
    // Create the FormatableBitSet for mapping the partial to full base row
    FormatableBitSet bitSet = new FormatableBitSet(numColumns + 1);
    for (int index = 0; index < baseColumnPositions.length; index++) {
        bitSet.set(baseColumnPositions[index]);
    }
    FormatableBitSet zeroBasedBitSet = RowUtil.shift(bitSet, 1);
    // Start by opening a full scan on the base table.
    scan = tc.openGroupFetchScan(td.getHeapConglomerateId(), // hold
    false, // open base table read only
    0, TransactionController.MODE_TABLE, TransactionController.ISOLATION_SERIALIZABLE, // all fields as objects
    zeroBasedBitSet, // startKeyValue
    (DataValueDescriptor[]) null, // not used when giving null start posn.
    0, // qualifier
    null, // stopKeyValue
    (DataValueDescriptor[]) null, // not used when giving null stop posn.
    0);
    // Create an array to put base row template
    baseRows = new ExecRow[bulkFetchSize];
    indexRows = new ExecIndexRow[bulkFetchSize];
    compactBaseRows = new ExecRow[bulkFetchSize];
    try {
        // Create the array of base row template
        for (int i = 0; i < bulkFetchSize; i++) {
            // create a base row template
            baseRows[i] = activation.getExecutionFactory().getValueRow(maxBaseColumnPosition);
            // create an index row template
            indexRows[i] = indexRowGenerator.getIndexRowTemplate();
            // create a compact base row template
            compactBaseRows[i] = activation.getExecutionFactory().getValueRow(baseColumnPositions.length);
        }
        indexTemplateRow = indexRows[0];
        // Fill the partial row with nulls of the correct type
        ColumnDescriptorList cdl = td.getColumnDescriptorList();
        int cdlSize = cdl.size();
        for (int index = 0, numSet = 0; index < cdlSize; index++) {
            if (!zeroBasedBitSet.get(index)) {
                continue;
            }
            numSet++;
            ColumnDescriptor cd = cdl.elementAt(index);
            DataTypeDescriptor dts = cd.getType();
            for (int i = 0; i < bulkFetchSize; i++) {
                // Put the column in both the compact and sparse base rows
                baseRows[i].setColumn(index + 1, dts.getNull());
                compactBaseRows[i].setColumn(numSet, baseRows[i].getColumn(index + 1));
            }
            // Calculate the approximate row size for the index row
            approximateRowSize += dts.getTypeId().getApproximateLengthInBytes(dts);
        }
        // Get an array of RowLocation template
        RowLocation[] rl = new RowLocation[bulkFetchSize];
        for (int i = 0; i < bulkFetchSize; i++) {
            rl[i] = scan.newRowLocationTemplate();
            // Get an index row based on the base row
            indexRowGenerator.getIndexRow(compactBaseRows[i], rl[i], indexRows[i], bitSet);
        }
        /* now that we got indexTemplateRow, done for sharing index
			 */
        if (shareExisting)
            return;
        /* For non-unique indexes, we order by all columns + the RID.
			 * For unique indexes, we just order by the columns.
			 * We create a unique index observer for unique indexes
			 * so that we can catch duplicate key.
			 * We create a basic sort observer for non-unique indexes
			 * so that we can reuse the wrappers during an external
			 * sort.
			 */
        int numColumnOrderings;
        SortObserver sortObserver;
        Properties sortProperties = null;
        if (unique || uniqueWithDuplicateNulls || uniqueDeferrable) {
            // if the index is a constraint, use constraintname in
            // possible error message
            String indexOrConstraintName = indexName;
            if (conglomerateUUID != null) {
                ConglomerateDescriptor cd = dd.getConglomerateDescriptor(conglomerateUUID);
                if ((isConstraint) && (cd != null && cd.getUUID() != null && td != null)) {
                    ConstraintDescriptor conDesc = dd.getConstraintDescriptor(td, cd.getUUID());
                    indexOrConstraintName = conDesc.getConstraintName();
                }
            }
            if (unique || uniqueDeferrable) {
                numColumnOrderings = unique ? baseColumnPositions.length : baseColumnPositions.length + 1;
                sortObserver = new UniqueIndexSortObserver(lcc, constraintID, true, uniqueDeferrable, initiallyDeferred, indexOrConstraintName, indexTemplateRow, true, td.getName());
            } else {
                // unique with duplicate nulls allowed.
                numColumnOrderings = baseColumnPositions.length + 1;
                // tell transaction controller to use the unique with
                // duplicate nulls sorter, when making createSort() call.
                sortProperties = new Properties();
                sortProperties.put(AccessFactoryGlobals.IMPL_TYPE, AccessFactoryGlobals.SORT_UNIQUEWITHDUPLICATENULLS_EXTERNAL);
                // use sort operator which treats nulls unequal
                sortObserver = new UniqueWithDuplicateNullsIndexSortObserver(lcc, constraintID, true, (hasDeferrableChecking && constraintType != DataDictionary.FOREIGNKEY_CONSTRAINT), initiallyDeferred, indexOrConstraintName, indexTemplateRow, true, td.getName());
            }
        } else {
            numColumnOrderings = baseColumnPositions.length + 1;
            sortObserver = new BasicSortObserver(true, false, indexTemplateRow, true);
        }
        ColumnOrdering[] order = new ColumnOrdering[numColumnOrderings];
        for (int i = 0; i < numColumnOrderings; i++) {
            order[i] = new IndexColumnOrder(i, unique || i < numColumnOrderings - 1 ? isAscending[i] : true);
        }
        // create the sorter
        sortId = tc.createSort(sortProperties, indexTemplateRow.getRowArrayClone(), order, sortObserver, // not in order
        false, scan.getEstimatedRowCount(), // est row size, -1 means no idea
        approximateRowSize);
        needToDropSort = true;
        // Populate sorter and get the output of the sorter into a row
        // source.  The sorter has the indexed columns only and the columns
        // are in the correct order.
        rowSource = loadSorter(baseRows, indexRows, tc, scan, sortId, rl);
        conglomId = tc.createAndLoadConglomerate(indexType, // index row template
        indexTemplateRow.getRowArray(), // colums sort order
        order, indexRowGenerator.getColumnCollationIds(td.getColumnDescriptorList()), indexProperties, // not temporary
        TransactionController.IS_DEFAULT, rowSource, (long[]) null);
    } finally {
        /* close the table scan */
        if (scan != null)
            scan.close();
        /* close the sorter row source before throwing exception */
        if (rowSource != null)
            rowSource.closeRowSource();
        /*
			** drop the sort so that intermediate external sort run can be
			** removed from disk
			*/
        if (needToDropSort)
            tc.dropSort(sortId);
    }
    ConglomerateController indexController = tc.openConglomerate(conglomId, false, 0, TransactionController.MODE_TABLE, TransactionController.ISOLATION_SERIALIZABLE);
    // Check to make sure that the conglomerate can be used as an index
    if (!indexController.isKeyed()) {
        indexController.close();
        throw StandardException.newException(SQLState.LANG_NON_KEYED_INDEX, indexName, indexType);
    }
    indexController.close();
    // 
    if (!alreadyHaveConglomDescriptor) {
        ConglomerateDescriptor cgd = ddg.newConglomerateDescriptor(conglomId, indexName, true, indexRowGenerator, isConstraint, conglomerateUUID, td.getUUID(), sd.getUUID());
        dd.addDescriptor(cgd, sd, DataDictionary.SYSCONGLOMERATES_CATALOG_NUM, false, tc);
        // add newly added conglomerate to the list of conglomerate
        // descriptors in the td.
        ConglomerateDescriptorList cdl = td.getConglomerateDescriptorList();
        cdl.add(cgd);
        /* Since we created a new conglomerate descriptor, load
			 * its UUID into the corresponding field, to ensure that
			 * it is properly set in the StatisticsDescriptor created
			 * below.
			 */
        conglomerateUUID = cgd.getUUID();
    }
    CardinalityCounter cCount = (CardinalityCounter) rowSource;
    long numRows = cCount.getRowCount();
    if (addStatistics(dd, indexRowGenerator, numRows)) {
        long[] c = cCount.getCardinality();
        for (int i = 0; i < c.length; i++) {
            StatisticsDescriptor statDesc = new StatisticsDescriptor(dd, dd.getUUIDFactory().createUUID(), conglomerateUUID, td.getUUID(), "I", new StatisticsImpl(numRows, c[i]), i + 1);
            dd.addDescriptor(statDesc, null, DataDictionary.SYSSTATISTICS_CATALOG_NUM, true, tc);
        }
    }
}

Example 52 with RowLocation

use of org.apache.derby.iapi.types.RowLocation in project derby by apache.

the class BaseActivation method getRowLocationTemplate.

/**
 *		Get the saved RowLocation.
 *
 *		@param itemNumber	The saved item number.
 *
 *		@return	A RowLocation template for the conglomerate
 */
public RowLocation getRowLocationTemplate(int itemNumber) {
    if (SanityManager.DEBUG) {
        SanityManager.ASSERT(itemNumber >= 0, "itemNumber expected to be >= 0");
        if (!(getPreparedStatement().getSavedObject(itemNumber) instanceof RowLocation)) {
            SanityManager.THROWASSERT("getPreparedStatement().getSavedObject(itemNumber) expected to be " + "instance of RowLocation, not " + getPreparedStatement().getSavedObject(itemNumber).getClass().getName() + ", query is " + getPreparedStatement().getSource());
        }
    }
    RowLocation rl = (RowLocation) getPreparedStatement().getSavedObject(itemNumber);
    /* We have to return a clone of the saved RowLocation due
         * to the shared cache of SPSs.
         */
    Object rlClone = rl.cloneValue(false);
    if (SanityManager.DEBUG) {
        if (!(rlClone instanceof RowLocation)) {
            SanityManager.THROWASSERT("rl.getClone() expected to be " + "instance of RowLocation, not " + rlClone.getClass().getName() + ", query is " + getPreparedStatement().getSource());
        }
    }
    return (RowLocation) rlClone;
}

Example 53 with RowLocation

use of org.apache.derby.iapi.types.RowLocation in project derby by apache.

the class DeleteResultSet method collectAffectedRows.

boolean collectAffectedRows() throws StandardException {
    DataValueDescriptor rlColumn;
    RowLocation baseRowLocation;
    boolean rowsFound = false;
    if (cascadeDelete)
        row = getNextRowCore(source);
    while (row != null) {
        /* By convention, the last column for a delete contains a data value
			 * wrapping the RowLocation of the row to be deleted.  If we're
			 * doing a deferred delete, store the RowLocations in the
			 * temporary conglomerate.  If we're not doing a deferred delete,
			 * just delete the rows immediately.
			 */
        rowsFound = true;
        rlColumn = row.getColumn(row.nColumns());
        if (constants.deferred || cascadeDelete) {
            /*
				** If we are deferred because of a trigger or foreign
				** key, we need to save off the entire row.  Otherwise,
				** we just save the RID.
				*/
            if (noTriggersOrFks) {
                deferredRLRow.setColumn(1, rlColumn);
                rowHolder.insert(deferredRLRow);
            } else {
                rowHolder.insert(row);
            }
            /*
				** If we haven't already, lets get a template to
				** use as a template for our rescan of the base table.
				** Do this now while we have a real row to use
				** as a copy.
				**
				** There is one less column in the base row than
				** there is in source row, because the base row
				** doesn't contain the row location.
				*/
            if (deferredBaseRow == null) {
                deferredBaseRow = RowUtil.getEmptyValueRow(numberOfBaseColumns - 1, lcc);
                RowUtil.copyCloneColumns(deferredBaseRow, row, numberOfBaseColumns - 1);
                deferredSparseRow = makeDeferredSparseRow(deferredBaseRow, baseRowReadList, lcc);
            }
        } else {
            if (fkChecker != null) {
                // Argument "2" below: If a PK referenced by an FK is
                // deferred, require at least two rows to be present in the
                // primary table since we are deleting one of them below,
                // and we need at least one to fulfill the constraint.
                fkChecker.doPKCheck(activation, row, false, 2);
            }
            baseRowLocation = (RowLocation) (rlColumn).getObject();
            if (SanityManager.DEBUG) {
                SanityManager.ASSERT(baseRowLocation != null, "baseRowLocation is null");
            }
            rc.deleteRow(row, baseRowLocation);
            source.markRowAsDeleted();
        }
        rowCount++;
        // No need to do a next on a single row source
        if (constants.singleRowSource) {
            row = null;
        } else {
            row = getNextRowCore(source);
        }
    }
    return rowsFound;
}

Example 54 with RowLocation

use of org.apache.derby.iapi.types.RowLocation in project derby by apache.

the class B2IRowLocking3 method lockScanCommittedDeletedRow.

/**
 ************************************************************************
 * Public Methods of This class:
 **************************************************************************
 */
/**
 ************************************************************************
 * Abstract Protected lockScan*() locking methods of BTree:
 *     lockScanRow              - lock row
 *     unlockScanRecordAfterRead- unlock the scan record
 **************************************************************************
 */
/**
 * Lock a btree row to determine if it is a committed deleted row.
 * <p>
 * @see BTreeLockingPolicy#lockScanCommittedDeletedRow
 *
 * @exception  StandardException  Standard exception policy.
 */
public boolean lockScanCommittedDeletedRow(OpenBTree open_btree, LeafControlRow leaf, DataValueDescriptor[] template, FetchDescriptor lock_fetch_desc, int slot_no) throws StandardException {
    if (SanityManager.DEBUG) {
        SanityManager.ASSERT(leaf != null);
        if (slot_no <= 0 || slot_no >= leaf.getPage().recordCount()) {
            SanityManager.THROWASSERT("slot_no = " + slot_no + "; leaf.getPage().recordCount() = " + leaf.getPage().recordCount());
        }
        SanityManager.ASSERT(template != null, "template is null");
    }
    RowLocation row_loc = (RowLocation) template[((B2I) open_btree.getConglomerate()).rowLocationColumn];
    // Fetch the row location to lock.
    leaf.getPage().fetchFromSlot((RecordHandle) null, slot_no, template, lock_fetch_desc, true);
    // Request the lock NOWAIT, return status
    return (base_cc.lockRow(row_loc, ConglomerateController.LOCK_UPD, false, /* NOWAIT */
    TransactionManager.LOCK_COMMIT_DURATION));
}

Example 55 with RowLocation

use of org.apache.derby.iapi.types.RowLocation in project derby by apache.

the class GenericScanController method fetchRows.

/**
 * Fetch the next N rows from the table.
 * <p>
 * Utility routine used by both fetchSet() and fetchNextGroup().
 *
 * @exception  StandardException  Standard exception policy.
 */
protected int fetchRows(DataValueDescriptor[][] row_array, RowLocation[] rowloc_array, BackingStoreHashtable hash_table, long max_rowcnt, int[] key_column_numbers) throws StandardException {
    int ret_row_count = 0;
    DataValueDescriptor[] fetch_row = null;
    if (max_rowcnt == -1)
        max_rowcnt = Long.MAX_VALUE;
    if (SanityManager.DEBUG) {
        if (row_array != null) {
            SanityManager.ASSERT(row_array[0] != null, "first array slot in fetchNextGroup() must be non-null.");
            SanityManager.ASSERT(hash_table == null);
        } else {
            SanityManager.ASSERT(hash_table != null);
        }
    }
    if (this.scan_state == SCAN_INPROGRESS) {
        positionAtResumeScan(scan_position);
    } else if (this.scan_state == SCAN_INIT) {
        positionAtStartForForwardScan(scan_position);
    } else if (this.scan_state == SCAN_HOLD_INPROGRESS) {
        reopenAfterEndTransaction();
        if (SanityManager.DEBUG) {
            SanityManager.ASSERT(scan_position.current_rh != null, this.toString());
        }
        // reposition the scan at the row just before the next one to
        // return.
        // This routine handles the mess of repositioning if the row or
        // the page has disappeared. This can happen if a lock was not
        // held on the row while not holding the latch.
        open_conglom.latchPageAndRepositionScan(scan_position);
        this.scan_state = SCAN_INPROGRESS;
    } else if (this.scan_state == SCAN_HOLD_INIT) {
        reopenAfterEndTransaction();
        positionAtStartForForwardScan(scan_position);
    } else {
        if (SanityManager.DEBUG)
            SanityManager.ASSERT(this.scan_state == SCAN_DONE);
        return (0);
    }
    while (scan_position.current_page != null) {
        while ((scan_position.current_slot + 1) < scan_position.current_page.recordCount()) {
            // unlock the previous row.
            if (scan_position.current_rh != null) {
                open_conglom.unlockPositionAfterRead(scan_position);
            }
            // Allocate a new row to read the row into.
            if (fetch_row == null) {
                if (hash_table == null) {
                    // point at allocated row in array if one exists.
                    if (row_array[ret_row_count] == null) {
                        row_array[ret_row_count] = open_conglom.getRuntimeMem().get_row_for_export(open_conglom.getRawTran());
                    }
                    fetch_row = row_array[ret_row_count];
                } else {
                    fetch_row = open_conglom.getRuntimeMem().get_row_for_export(open_conglom.getRawTran());
                }
            }
            // move scan current position forward.
            scan_position.positionAtNextSlot();
            // Lock the row.
            boolean lock_granted_while_latch_held = open_conglom.lockPositionForRead(scan_position, (RowPosition) null, true, true);
            if (!lock_granted_while_latch_held) {
                if (scan_position.current_page == null) {
                    break;
                } else if (scan_position.current_slot == -1) {
                    if (SanityManager.DEBUG) {
                        SanityManager.ASSERT(scan_position.current_rh == null);
                    }
                    continue;
                }
            }
            this.stat_numrows_visited++;
            // lockRowAtPosition set pos.current_rh as part of getting lock.
            if (SanityManager.DEBUG) {
                SanityManager.ASSERT(scan_position.current_rh != null);
                // make sure current_rh and current_slot are in sync
                if (scan_position.current_slot != scan_position.current_page.getSlotNumber(scan_position.current_rh)) {
                    SanityManager.THROWASSERT("current_slot = " + scan_position.current_slot + "current_rh = " + scan_position.current_rh + "current_rh.slot = " + scan_position.current_page.getSlotNumber(scan_position.current_rh));
                }
            }
            // fetchFromSlot returns null if row does not qualify.
            scan_position.current_rh_qualified = (scan_position.current_page.fetchFromSlot(scan_position.current_rh, scan_position.current_slot, fetch_row, init_fetchDesc, false) != null);
            if (scan_position.current_rh_qualified) {
                // held).
                if (SanityManager.DEBUG) {
                    // make sure current_rh and current_slot are in sync
                    SanityManager.ASSERT(scan_position.current_slot == scan_position.current_page.getSlotNumber(scan_position.current_rh));
                }
                // Found qualifying row.  Done fetching rows for the group?
                ret_row_count++;
                stat_numrows_qualified++;
                if (hash_table == null) {
                    if (rowloc_array != null) {
                        // if requested return the associated row location.
                        setRowLocationArray(rowloc_array, ret_row_count - 1, scan_position);
                    }
                    fetch_row = null;
                } else {
                    RowLocation rowLocation = hash_table.includeRowLocations() ? makeRowLocation(scan_position) : null;
                    if (hash_table.putRow(false, fetch_row, rowLocation)) {
                        // The row was inserted into the hash table so we
                        // need to create a new row next time through.
                        fetch_row = null;
                    }
                }
                if (max_rowcnt <= ret_row_count) {
                    // exit fetch row loop and return to the client.
                    scan_position.unlatch();
                    if (SanityManager.DEBUG) {
                        SanityManager.ASSERT(scan_position.current_rh != null);
                    }
                    return (ret_row_count);
                }
            }
        }
        positionAtNextPage(scan_position);
        this.stat_numpages_visited++;
    }
    // Reached last page of scan.
    positionAtDoneScan(scan_position);
    // we need to decrement when we stop scan at the end of the table.
    this.stat_numpages_visited--;
    return (ret_row_count);
}