1 /***************************************************************************
2 * Copyright (C) 2007 by www.databasecache.com *
3 * Contact: praba_tuty@databasecache.com *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 ***************************************************************************/
17 #include<CatalogTables.h>
23 #include<PredicateImpl.h>
27 DbRetVal
TableImpl::bindFld(const char *name
, void *val
)
29 //set it in the field list
30 DbRetVal rv
= fldList_
.updateBindVal(name
, val
);
32 printError(ErrNotExists
, "Field %s does not exist", name
);
38 bool TableImpl::isFldNull(const char *name
){
39 int colpos
= fldList_
.getFieldPosition(name
);
42 printError(ErrNotExists
, "Field %s does not exist", name
);
46 return isFldNull(colpos
);
49 bool TableImpl::isFldNull(int colpos
)
51 if (!curTuple_
) return false;
52 if (colpos
<1 || colpos
> numFlds_
) return false;
53 char *nullOffset
= (char*)curTuple_
- 4;
54 if (isIntUsedForNULL
) {
55 int nullVal
= *(int*)((char*)curTuple_
+ (length_
- 4));
56 if (BITSET(nullVal
, colpos
)) return true;
59 char *nullOffset
= (char*)curTuple_
- os::align(numFlds_
);
60 if (nullOffset
[colpos
-1]) return true;
64 void TableImpl::markFldNull(char const* name
)
66 int colpos
= fldList_
.getFieldPosition(name
);
69 printError(ErrNotExists
, "Field %s does not exist", name
);
75 void TableImpl::markFldNull(int fldpos
)
77 if (fldpos
<1 || fldpos
> numFlds_
) return;
78 if (isIntUsedForNULL
) {
79 if (!BITSET(iNotNullInfo
, fldpos
)) SETBIT(iNullInfo
, fldpos
);
82 if (!BITSET(iNotNullInfo
, fldpos
)) cNullInfo
[fldpos
-1] = 1;
86 void TableImpl::clearFldNull(const char *name
)
88 int colpos
= fldList_
.getFieldPosition(name
);
91 printError(ErrNotExists
, "Field %s does not exist", name
);
98 void TableImpl::clearFldNull(int colpos
)
100 if (colpos
<1 || colpos
> numFlds_
) return;
101 if (isIntUsedForNULL
) {
102 CLEARBIT(iNullInfo
, colpos
);
105 cNullInfo
[colpos
-1] = 0;
110 DbRetVal
TableImpl::execute()
114 printError(ErrAlready
,"Scan already open:Close and re execute");
117 //table ptr is set in predicate because it needs to access the
118 //type and length to evaluate
121 PredicateImpl
*pred
= (PredicateImpl
*) pred_
;
122 pred
->setTable(this);
129 printError(ErrSysInternal
,"Unable to create the plan");
130 return ErrSysInternal
;
133 iter
= new TupleIterator(pred_
, scanType_
, idxInfo
[useIndex_
], chunkPtr_
, sysDB_
->procSlot
);
134 else if (scanType_
== fullTableScan
)
135 iter
= new TupleIterator(pred_
, scanType_
, NULL
, chunkPtr_
, sysDB_
->procSlot
);
138 printError(ErrSysFatal
,"Unable to create tuple iterator");//should never happen
144 printError(ErrSysInternal
,"Unable to open the iterator");
145 return ErrSysInternal
;
151 DbRetVal
TableImpl::createPlan()
154 //will do early return here. plan is generated only when setPredicate is called.
155 if (scanType_
== unknownScan
) return ErrSysFatal
; //this should never happen
159 //if there are no predicates then go for full scan
160 //if there are no indexes then go for full scan
161 if (NULL
== pred_
|| NULL
== indexPtr_
)
163 scanType_
= fullTableScan
;
164 isPlanCreated
= true;
167 if (NULL
!= indexPtr_
)
169 PredicateImpl
*pred
= (PredicateImpl
*)pred_
;
170 printDebug(DM_Predicate
, "predicate does not involve NOT , OR operator");
171 if (!pred
->isNotOrInvolved())
173 printDebug(DM_Predicate
, "predicate does not involve NOT , OR operator");
174 for (int i
=0; i
< numIndexes_
; i
++)
176 char *fName
= ((SingleFieldHashIndexInfo
*)idxInfo
[i
])->fldName
;
177 if (pred
->pointLookupInvolved(fName
))
179 printDebug(DM_Predicate
, "point lookup involved for field %s",fName
);
180 scanType_
= hashIndexScan
;
182 isPlanCreated
= true;
188 scanType_
= fullTableScan
;
189 isPlanCreated
= true;
193 void* TableImpl::fetch()
196 if (NULL
== curTuple_
) return curTuple_
;
197 copyValuesToBindBuffer(curTuple_
);
200 void* TableImpl::fetch(DbRetVal
&rv
)
203 if (NULL
== curTuple_
) return curTuple_
;
204 copyValuesToBindBuffer(curTuple_
);
208 void* TableImpl::fetchNoBind()
212 printError(ErrNotOpen
,"Scan not open or Scan is closed\n");
215 curTuple_
= iter
->next();
216 if (NULL
== curTuple_
)
220 DbRetVal lockRet
= OK
;
221 if ((*trans
)->isoLevel_
== READ_REPEATABLE
) {
222 lockRet
= lMgr_
->getSharedLock(curTuple_
, trans
);
225 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
231 else if ((*trans
)->isoLevel_
== READ_COMMITTED
)
233 //if iso level is read committed, operation duration lock is sufficent
234 //so release it here itself.
236 struct timeval timeout
;
237 timeout
.tv_sec
= Conf::config
.getMutexSecs();
238 timeout
.tv_usec
= Conf::config
.getMutexUSecs();
242 lockRet
= lMgr_
->isExclusiveLocked( curTuple_
, trans
, status
);
245 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
251 if (tries
== 0) break;
252 os::select(0, 0, 0, 0, &timeout
);
257 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
265 void* TableImpl::fetchNoBind(DbRetVal
&rv
)
270 printError(ErrNotOpen
,"Scan not open or Scan is closed\n");
274 curTuple_
= iter
->next();
275 if (NULL
== curTuple_
)
279 DbRetVal lockRet
= OK
;
280 if ((*trans
)->isoLevel_
== READ_REPEATABLE
) {
281 lockRet
= lMgr_
->getSharedLock(curTuple_
, trans
);
284 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
291 else if ((*trans
)->isoLevel_
== READ_COMMITTED
)
293 //if iso level is read committed, operation duration lock is sufficent
294 //so release it here itself.
296 struct timeval timeout
;
297 timeout
.tv_sec
= Conf::config
.getMutexSecs();
298 timeout
.tv_usec
= Conf::config
.getMutexUSecs();
302 lockRet
= lMgr_
->isExclusiveLocked( curTuple_
, trans
, status
);
305 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
312 if (tries
== 0) break;
313 os::select(0, 0, 0, 0, &timeout
);
318 printError(lockRet
, "Unable to get the lock for the tuple %x", curTuple_
);
327 DbRetVal
TableImpl::insertTuple()
330 void *tptr
= ((Chunk
*)chunkPtr_
)->allocate(db_
, &ret
);
333 printError(ret
, "Unable to allocate record from chunk");
337 ret
= lMgr_
->getExclusiveLock(tptr
, trans
);
340 ((Chunk
*)chunkPtr_
)->free(db_
, tptr
);
341 printError(ret
, "Could not get lock for the insert tuple %x", tptr
);
342 return ErrLockTimeOut
;
346 ret
= copyValuesFromBindBuffer(tptr
);
349 printError(ret
, "Unable to copy values from bind buffer");
350 (*trans
)->removeFromHasList(db_
, tptr
);
351 lMgr_
->releaseLock(tptr
);
352 ((Chunk
*)chunkPtr_
)->free(db_
, tptr
);
360 *(int*)((char*)(tptr
) + (length_
-addSize
)) = iNullInfo
;
364 addSize
= os::align(numFlds_
);
365 os::memcpy(((char*)(tptr
) + (length_
-addSize
)), cNullInfo
, addSize
);
368 //int tupleSize = length_ + addSize;
369 if (NULL
!= indexPtr_
)
373 for (i
= 0; i
< numIndexes_
; i
++)
375 ret
= insertIndexNode(*trans
, indexPtr_
[i
], idxInfo
[i
], tptr
);
376 if (ret
!= OK
) { printError(ret
, "Error in inserting to index"); break;}
378 if (i
!= numIndexes_
)
380 for (int j
= 0; j
< i
; j
++) {
381 printError(ErrWarning
, "Deleting index node");
382 deleteIndexNode(*trans
, indexPtr_
[j
], idxInfo
[j
], tptr
);
384 lMgr_
->releaseLock(tptr
);
385 (*trans
)->removeFromHasList(db_
, tptr
);
386 ((Chunk
*)chunkPtr_
)->free(db_
, tptr
);
387 printError(ret
, "Unable to insert index node for tuple %x", tptr
);
392 ret
= (*trans
)->appendUndoLog(sysDB_
, InsertOperation
, tptr
, length_
);
396 DbRetVal
TableImpl::deleteTuple()
398 if (NULL
== curTuple_
)
400 printError(ErrNotOpen
, "Scan not open: No Current tuple");
403 DbRetVal ret
= lMgr_
->getExclusiveLock(curTuple_
, trans
);
406 printError(ret
, "Could not get lock for the delete tuple %x", curTuple_
);
407 return ErrLockTimeOut
;
410 if (NULL
!= indexPtr_
)
414 for (i
= 0; i
< numIndexes_
; i
++)
416 ret
= deleteIndexNode(*trans
, indexPtr_
[i
], idxInfo
[i
], curTuple_
);
417 if (ret
!= OK
) break;
419 if (i
!= numIndexes_
)
421 for (int j
= 0; j
< i
; j
++)
422 insertIndexNode(*trans
, indexPtr_
[j
], idxInfo
[j
], curTuple_
);
423 lMgr_
->releaseLock(curTuple_
);
424 (*trans
)->removeFromHasList(db_
, curTuple_
);
425 printError(ret
, "Unable to insert index node for tuple %x", curTuple_
);
429 ((Chunk
*)chunkPtr_
)->free(db_
, curTuple_
);
431 ret
= (*trans
)->appendUndoLog(sysDB_
, DeleteOperation
, curTuple_
, length_
);
435 int TableImpl::deleteWhere()
437 int tuplesDeleted
= 0;
440 if (rv
!=OK
) return (int) rv
;
443 if (rv
!= OK
) { tuplesDeleted
= (int)rv
; break; }
444 if (NULL
== curTuple_
) break;
447 printError(rv
, "Error: Could only delete %d tuples", tuplesDeleted
);
454 return tuplesDeleted
;
457 int TableImpl::truncate()
459 //take exclusive lock on the table
460 //get the chunk ptr of the table
461 //traverse the tablechunks and free all the pages except the first one
462 //get the chunk ptr of all its indexes
463 //traverse the indexchunks and free all the pages except the first one
468 Predicate
* tmpPred
= pred_
;
470 isPlanCreated
= false;
471 int tuplesDeleted
= deleteWhere();
472 isPlanCreated
= false;
474 return tuplesDeleted
;
477 DbRetVal
TableImpl::updateTuple()
479 if (NULL
== curTuple_
)
481 printError(ErrNotOpen
, "Scan not open: No Current tuple");
484 DbRetVal ret
= lMgr_
->getExclusiveLock(curTuple_
, trans
);
487 printError(ret
, "Could not get lock for the update tuple %x", curTuple_
);
488 return ErrLockTimeOut
;
490 if (NULL
!= indexPtr_
)
493 //TODO::If it fails while updating index node, we have to undo all the updates
494 //on other indexes on the table.Currently it will leave the database in an
495 //inconsistent state.
496 for (int i
= 0; i
< numIndexes_
; i
++)
498 ret
= updateIndexNode(*trans
, indexPtr_
[i
], idxInfo
[i
], curTuple_
);
501 lMgr_
->releaseLock(curTuple_
);
502 (*trans
)->removeFromHasList(db_
, curTuple_
);
503 printError(ret
, "Unable to update index node for tuple %x", curTuple_
);
509 ret
= (*trans
)->appendUndoLog(sysDB_
, UpdateOperation
, curTuple_
, length_
);
510 if (ret
!= OK
) return ret
;
515 *(int*)((char*)(curTuple_
) + (length_
-addSize
)) |= iNullInfo
;
519 addSize
= os::align(numFlds_
);
520 //TODO::Do not do blind memcpy. It should OR each and every char
521 //os::memcpy(((char*)(curTuple_) + (length_-addSize)), cNullInfo, addSize);
525 DbRetVal rv
= copyValuesFromBindBuffer(curTuple_
, false);
527 lMgr_
->releaseLock(curTuple_
);
528 (*trans
)->removeFromHasList(db_
, curTuple_
);
534 void TableImpl::printInfo()
536 printf(" <TableName> %s </TableName>\n", tblName_
);
537 printf(" <TupleCount> %d </TupleCount>\n", numTuples());
538 printf(" <PagesUsed> %d </PagesUsed>\n", pagesUsed());
539 printf(" <SpaceUsed> %d </SpaceUsed>\n", spaceUsed());
540 printf(" <Indexes> %d <Indexes>\n", numIndexes_
);
541 printf(" <TupleLength> %d </TupleLength>\n", length_
);
542 printf(" <Fields> %d </Fields>\n", numFlds_
);
543 printf(" <Indexes>\n");
544 for (int i
=0; i
<numIndexes_
; i
++)
545 printf("<IndexName> %s </IndexName>\n", CatalogTableINDEX::getName(indexPtr_
[i
]));
546 printf(" </Indexes>\n");
550 DbRetVal
TableImpl::copyValuesFromBindBuffer(void *tuplePtr
, bool isInsert
)
552 //Iterate through the bind list and copy the value here
553 FieldIterator fIter
= fldList_
.getIterator();
554 char *colPtr
= (char*) tuplePtr
;
556 while (fIter
.hasElement())
558 FieldDef def
= fIter
.nextElement();
559 if (def
.isNull_
&& !def
.isDefault_
&& NULL
== def
.bindVal_
&& isInsert
)
561 printError(ErrNullViolation
, "NOT NULL constraint violation for field %s\n", def
.fldName_
);
562 return ErrNullViolation
;
564 if (def
.isDefault_
&& NULL
== def
.bindVal_
&& isInsert
)
566 void *dest
= AllDataType::alloc(def
.type_
, def
.length_
);
567 AllDataType::convert(typeString
, def
.defaultValueBuf_
, def
.type_
, dest
);
568 AllDataType::copyVal(colPtr
, dest
, def
.type_
, def
.length_
);
569 colPtr
= colPtr
+ os::align(AllDataType::size(def
.type_
, def
.length_
));
577 if (NULL
!= def
.bindVal_
)
579 strcpy((char*)colPtr
, (char*)def
.bindVal_
);
580 *(((char*)colPtr
) + (def
.length_
-1)) = '\0';
582 else if (!def
.isNull_
&& isInsert
) setNullBit(fldpos
);
583 colPtr
= colPtr
+ os::align(def
.length_
);
586 if (NULL
!= def
.bindVal_
)
587 os::memcpy((char*)colPtr
, (char*)def
.bindVal_
, def
.length_
);
588 else if (!def
.isNull_
&& isInsert
) setNullBit(fldpos
);
589 colPtr
= colPtr
+ os::align(def
.length_
);
592 if (NULL
!= def
.bindVal_
)
593 AllDataType::copyVal(colPtr
, def
.bindVal_
, def
.type_
);
594 else { if (!def
.isNull_
&& isInsert
) setNullBit(fldpos
); }
595 colPtr
= colPtr
+ os::align(AllDataType::size(def
.type_
));
602 void TableImpl::setNullBit(int fldpos
)
604 if (isIntUsedForNULL
)
605 SETBIT(iNullInfo
, fldpos
);
607 cNullInfo
[fldpos
-1] = 1;
609 DbRetVal
TableImpl::copyValuesToBindBuffer(void *tuplePtr
)
611 //Iterate through the bind list and copy the value here
612 FieldIterator fIter
= fldList_
.getIterator();
613 char *colPtr
= (char*) tuplePtr
;
614 while (fIter
.hasElement())
616 FieldDef def
= fIter
.nextElement();
620 if (NULL
!= def
.bindVal_
)
621 strcpy((char*)def
.bindVal_
, (char*)colPtr
);
622 colPtr
= colPtr
+ os::align(def
.length_
);
625 if (NULL
!= def
.bindVal_
)
626 os::memcpy((char*)def
.bindVal_
, (char*)colPtr
, def
.length_
);
627 colPtr
= colPtr
+ os::align(def
.length_
);
630 if (NULL
!= def
.bindVal_
)
631 AllDataType::copyVal(def
.bindVal_
, colPtr
, def
.type_
);
632 colPtr
= colPtr
+ os::align(AllDataType::size(def
.type_
));
639 //-1 index not supported
640 DbRetVal
TableImpl::insertIndexNode(Transaction
*tr
, void *indexPtr
, IndexInfo
*info
, void *tuple
)
642 INDEX
*iptr
= (INDEX
*)indexPtr
;
644 printDebug(DM_Table
, "Inside insertIndexNode type %d", iptr
->indexType_
);
645 Index
* idx
= Index::getIndex(iptr
->indexType_
);
646 ret
= idx
->insert(this, tr
, indexPtr
, info
, tuple
,undoFlag
);
650 DbRetVal
TableImpl::deleteIndexNode(Transaction
*tr
, void *indexPtr
, IndexInfo
*info
, void *tuple
)
652 INDEX
*iptr
= (INDEX
*)indexPtr
;
654 Index
* idx
= Index::getIndex(iptr
->indexType_
);
655 ret
= idx
->remove(this, tr
, indexPtr
, info
, tuple
, undoFlag
);
658 void TableImpl::printSQLIndexString()
660 CatalogTableINDEXFIELD
cIndexField(sysDB_
);
661 char fName
[IDENTIFIER_LENGTH
];
662 char *fldName
= fName
;
664 for (int i
= 0; i
< numIndexes_
; i
++)
666 INDEX
*iptr
= (INDEX
*) indexPtr_
[i
];
667 cIndexField
.getFieldNameAndType((void*)iptr
, fldName
, type
);
668 printf("CREATE INDEX %s on %s ( %s ) ", iptr
->indName_
, getName(), fldName
);
669 if (((SingleFieldHashIndexInfo
*) idxInfo
[i
])->isUnique
) printf(" UNIQUE;\n"); else printf(";\n");
674 DbRetVal
TableImpl::updateIndexNode(Transaction
*tr
, void *indexPtr
, IndexInfo
*info
, void *tuple
)
676 INDEX
*iptr
= (INDEX
*)indexPtr
;
678 Index
* idx
= Index::getIndex(iptr
->indexType_
);
679 //TODO::currently it updates irrespective of whether the key changed or not
680 //because of this commenting the whole index update code. relook at it and uncomment
682 //ret = idx->update(this, tr, indexPtr, info, tuple, undoFlag);
688 void TableImpl::setTableInfo(char *name
, int tblid
, size_t length
,
689 int numFld
, int numIdx
, void *chunk
)
691 strcpy(tblName_
, name
);
695 numIndexes_
= numIdx
;
699 long TableImpl::spaceUsed()
701 Chunk
*chk
= (Chunk
*)chunkPtr_
;
702 long totSize
= chk
->getTotalDataNodes() * chk
->getSize();
703 totSize
= totSize
+ (chk
->totalPages() * sizeof (PageInfo
));
707 int TableImpl::pagesUsed()
709 Chunk
*chk
= (Chunk
*)chunkPtr_
;
710 return chk
->totalPages();
713 long TableImpl::numTuples()
715 return ((Chunk
*)chunkPtr_
)->getTotalDataNodes();
718 List
TableImpl::getFieldNameList()
721 FieldIterator fIter
= fldList_
.getIterator();
722 while (fIter
.hasElement())
724 FieldDef def
= fIter
.nextElement();
725 Identifier
*elem
= new Identifier();
726 strcpy(elem
->name
, def
.fldName_
);
727 fldNameList
.append(elem
);
731 DbRetVal
TableImpl::close()
735 printError(ErrNotOpen
,"Scan not open");
743 DbRetVal
TableImpl::lock(bool shared
)
749 ret = lMgr_->getSharedLock(chunkPtr_, NULL);
751 ret = lMgr_->getExclusiveLock(chunkPtr_, NULL);
754 printError(ret, "Could not exclusive lock on the table %x", chunkPtr_);
756 //do not append for S to X upgrade
757 if (!ProcessManager::hasLockList.exists(chunkPtr_))
758 ProcessManager::hasLockList.append(chunkPtr_);
763 DbRetVal
TableImpl::unlock()
766 if (!ProcessManager::hasLockList.exists(chunkPtr_)) return OK;
767 DbRetVal ret = lMgr_->releaseLock(chunkPtr_);
770 printError(ret, "Could not release exclusive lock on the table %x", chunkPtr_);
773 ProcessManager::hasLockList.remove(chunkPtr_);
779 TableImpl::~TableImpl()
781 if (NULL
!= iter
) { delete iter
; iter
= NULL
; }
782 if (NULL
!= indexPtr_
) { delete[] indexPtr_
; indexPtr_
= NULL
; }
785 for (int i
= 0; i
< numIndexes_
; i
++) delete idxInfo
[i
];
789 if (numFlds_
> 31 && cNullInfo
!= NULL
) { free(cNullInfo
); cNullInfo
= NULL
; }
791 fldList_
.removeAll();