298 lines
9.6 KiB
C
298 lines
9.6 KiB
C
/*---
|
|
This software is copyrighted by the Regents of the University of
|
|
California, and other parties. The following terms apply to all files
|
|
associated with the software unless explicitly disclaimed in
|
|
individual files.
|
|
|
|
The authors hereby grant permission to use, copy, modify, distribute,
|
|
and license this software and its documentation for any purpose,
|
|
provided that existing copyright notices are retained in all copies
|
|
and that this notice is included verbatim in any distributions. No
|
|
written agreement, license, or royalty fee is required for any of the
|
|
authorized uses. Modifications to this software may be copyrighted by
|
|
their authors and need not follow the licensing terms described here,
|
|
provided that the new terms are clearly indicated on the first page of
|
|
each file where they apply.
|
|
|
|
IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
|
|
FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
|
ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
|
|
DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
|
|
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
|
|
NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, AND
|
|
THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE
|
|
MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
|
|
GOVERNMENT USE: If you are acquiring this software on behalf of the
|
|
U.S. government, the Government shall have only "Restricted Rights" in
|
|
the software and related documentation as defined in the Federal
|
|
Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you are
|
|
acquiring the software on behalf of the Department of Defense, the
|
|
software shall be classified as "Commercial Computer Software" and the
|
|
Government shall have only "Restricted Rights" as defined in Clause
|
|
252.227-7013 (c) (1) of DFARs. Notwithstanding the foregoing, the
|
|
authors grant the U.S. Government and others acting in its behalf
|
|
permission to use and distribute the software in accordance with the
|
|
terms specified in this license.
|
|
---*/
|
|
|
|
/**
|
|
|
|
@file
|
|
|
|
Generic page interface. This file handles updates to the LSN, but
|
|
leaves finer grained concurrency to the implementor of each of the
|
|
page types. This interface's primary purpose is to wrap common
|
|
functionality together, and to delegate responsibility for page
|
|
handling to other modules.
|
|
|
|
Latching summary:
|
|
|
|
Each page has an associated read/write lock. This lock only
|
|
protects the internal layout of the page, and the members of the
|
|
page struct. Here is how it is held in various circumstances:
|
|
|
|
Record allocation: Write lock
|
|
Record read: Read lock
|
|
Read LSN Read lock
|
|
Record write *READ LOCK*
|
|
Write LSN Write lock
|
|
|
|
Any circumstance where these locks are held during an I/O operation
|
|
is a bug.
|
|
|
|
*/
|
|
|
|
|
|
/* _XOPEN_SOURCE is needed for posix_memalign */
|
|
#define _XOPEN_SOURCE 600
|
|
#include <stdlib.h>
|
|
|
|
#include <config.h>
|
|
#include <lladd/common.h>
|
|
#include "latches.h"
|
|
#include "page.h"
|
|
|
|
#include <assert.h>
|
|
#include <stdio.h>
|
|
|
|
#include <lladd/constants.h>
|
|
#include <assert.h>
|
|
#include "blobManager.h"
|
|
#include <lladd/lockManager.h>
|
|
#include <lladd/compensations.h>
|
|
#include "page/slotted.h"
|
|
#include "page/fixed.h"
|
|
#include "page/indirect.h"
|
|
#include <lladd/operations/arrayList.h>
|
|
#include <lladd/bufferPool.h>
|
|
#include <lladd/truncation.h>
|
|
void pageWriteLSN(int xid, Page * page, lsn_t lsn) {
|
|
// if(!page->dirty) { // This assert belongs here, but would cause some hacked up unit tests to fail...
|
|
// assert(page->LSN < lsn);
|
|
// }
|
|
if(page->LSN < lsn) {
|
|
page->LSN = lsn;
|
|
*lsn_ptr(page) = page->LSN;
|
|
}
|
|
dirtyPages_add(page);
|
|
return;
|
|
}
|
|
|
|
lsn_t pageReadLSN(const Page * page) {
|
|
lsn_t ret;
|
|
|
|
readlock(page->rwlatch, 259);
|
|
ret = *lsn_ptr(page);
|
|
assert(ret == page->LSN);
|
|
readunlock(page->rwlatch);
|
|
|
|
return ret;
|
|
}
|
|
|
|
/* ----- (de)initialization functions. Do not need to support multithreading. -----*/
|
|
|
|
/**
|
|
* pageInit() initializes all the important variables needed in
|
|
* all the functions dealing with pages.
|
|
*/
|
|
void pageInit() {
|
|
slottedPageInit();
|
|
}
|
|
|
|
void pageDeinit() {
|
|
slottedPageDeInit();
|
|
}
|
|
|
|
/**
|
|
@todo this updates the LSN of the page that points to blob, even if the page is otherwise untouched!!
|
|
*/
|
|
void writeRecord(int xid, Page * p, lsn_t lsn, recordid rid, const void *dat) {
|
|
|
|
assert( (p->id == rid.page) && (p->memAddr != NULL) );
|
|
|
|
writelock(p->rwlatch, 225);
|
|
pageWriteLSN(xid, p, lsn);
|
|
|
|
if(rid.size > BLOB_THRESHOLD_SIZE) {
|
|
unlock(p->rwlatch);
|
|
writeBlob(xid, p, lsn, rid, dat);
|
|
} else {
|
|
if(*page_type_ptr(p) == SLOTTED_PAGE || *page_type_ptr(p) == BOUNDARY_TAG_PAGE) {
|
|
slottedWriteUnlocked(p, rid, dat);
|
|
} else if(*page_type_ptr(p) == FIXED_PAGE || *page_type_ptr(p)==ARRAY_LIST_PAGE || !*page_type_ptr(p) ) {
|
|
fixedWriteUnlocked(p, rid, dat);
|
|
} else {
|
|
abort();
|
|
}
|
|
unlock(p->rwlatch);
|
|
}
|
|
assert( (p->id == rid.page) && (p->memAddr != NULL) );
|
|
|
|
}
|
|
|
|
int readRecord(int xid, Page * p, recordid rid, void *buf) {
|
|
assert(rid.page == p->id);
|
|
|
|
int page_type = *page_type_ptr(p);
|
|
|
|
if(rid.size > BLOB_THRESHOLD_SIZE) {
|
|
readBlob(xid, p, rid, buf);
|
|
} else if(page_type == SLOTTED_PAGE || page_type == BOUNDARY_TAG_PAGE) {
|
|
slottedRead(p, rid, buf);
|
|
/* FIXED_PAGES can function correctly even if they have not been
|
|
initialized. */
|
|
} else if(page_type == FIXED_PAGE || page_type==ARRAY_LIST_PAGE || !page_type) {
|
|
fixedRead(p, rid, buf);
|
|
} else {
|
|
abort();
|
|
}
|
|
assert(rid.page == p->id);
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
int readRecordUnlocked(int xid, Page * p, recordid rid, void *buf) {
|
|
assert(rid.page == p->id);
|
|
|
|
int page_type = *page_type_ptr(p);
|
|
|
|
if(rid.size > BLOB_THRESHOLD_SIZE) {
|
|
abort(); /* Unsupported for now. */
|
|
readBlob(xid, p, rid, buf);
|
|
} else if(page_type == SLOTTED_PAGE || page_type == BOUNDARY_TAG_PAGE) {
|
|
slottedReadUnlocked(p, rid, buf);
|
|
/* FIXED_PAGES can function correctly even if they have not been
|
|
initialized. */
|
|
} else if(page_type == FIXED_PAGE || !page_type) {
|
|
fixedReadUnlocked(p, rid, buf);
|
|
} else {
|
|
abort();
|
|
}
|
|
assert(rid.page == p->id);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int getRecordTypeUnlocked(int xid, Page * p, recordid rid) {
|
|
assert(rid.page == p->id);
|
|
|
|
int page_type = *page_type_ptr(p);
|
|
if(page_type == UNINITIALIZED_PAGE) {
|
|
return UNINITIALIZED_RECORD;
|
|
|
|
} else if(page_type == SLOTTED_PAGE || page_type == BOUNDARY_TAG_PAGE) {
|
|
if(*numslots_ptr(p) <= rid.slot || *slot_ptr(p, rid.slot) == INVALID_SLOT) {
|
|
return UNINITIALIZED_PAGE;
|
|
} else if (*slot_length_ptr(p, rid.slot) == BLOB_SLOT) {
|
|
return BLOB_RECORD;
|
|
} else {
|
|
return SLOTTED_RECORD;
|
|
}
|
|
} else if(page_type == FIXED_PAGE || page_type == ARRAY_LIST_PAGE) {
|
|
return (fixedPageCount(p) > rid.slot) ?
|
|
FIXED_RECORD : UNINITIALIZED_RECORD;
|
|
} else {
|
|
return UNINITIALIZED_RECORD;
|
|
}
|
|
}
|
|
|
|
int getRecordType(int xid, Page * p, recordid rid) {
|
|
readlock(p->rwlatch, 343);
|
|
int ret = getRecordTypeUnlocked(xid, p, rid);
|
|
unlock(p->rwlatch);
|
|
return ret;
|
|
}
|
|
/** @todo implement getRecordLength for blobs and fixed length pages. */
|
|
int getRecordSize(int xid, Page * p, recordid rid) {
|
|
readlock(p->rwlatch, 353);
|
|
int ret = getRecordTypeUnlocked(xid, p, rid);
|
|
if(ret == UNINITIALIZED_RECORD) {
|
|
ret = -1;
|
|
} else if(ret == SLOTTED_RECORD) {
|
|
ret = *slot_length_ptr(p, rid.slot);
|
|
} else {
|
|
abort(); // unimplemented for fixed length pages and blobs.
|
|
}
|
|
unlock(p->rwlatch);
|
|
return ret;
|
|
}
|
|
|
|
void writeRecordUnlocked(int xid, Page * p, lsn_t lsn, recordid rid, const void *dat) {
|
|
|
|
assert( (p->id == rid.page) && (p->memAddr != NULL) );
|
|
|
|
// Need a writelock so that we can update the lsn.
|
|
|
|
writelock(p->rwlatch, 225);
|
|
pageWriteLSN(xid, p, lsn);
|
|
unlock(p->rwlatch);
|
|
|
|
|
|
if(rid.size > BLOB_THRESHOLD_SIZE) {
|
|
abort();
|
|
writeBlob(xid, p, lsn, rid, dat);
|
|
} else if(*page_type_ptr(p) == SLOTTED_PAGE || *page_type_ptr(p) == BOUNDARY_TAG_PAGE) {
|
|
slottedWriteUnlocked(p, rid, dat);
|
|
} else if(*page_type_ptr(p) == FIXED_PAGE || *page_type_ptr(p)==ARRAY_LIST_PAGE || !*page_type_ptr(p) ) {
|
|
fixedWriteUnlocked(p, rid, dat);
|
|
} else {
|
|
abort();
|
|
}
|
|
assert( (p->id == rid.page) && (p->memAddr != NULL) );
|
|
|
|
|
|
}
|
|
|
|
recordid interpretRidUnlocked(int xid, recordid rid, Page * p) {
|
|
int page_type = *page_type_ptr(p);
|
|
if(page_type == SLOTTED_PAGE || page_type == FIXED_PAGE || (!page_type) || page_type == BOUNDARY_TAG_PAGE ) {
|
|
|
|
} else if(page_type == INDIRECT_PAGE) {
|
|
rid = dereferenceRIDUnlocked(xid, rid);
|
|
} else if(page_type == ARRAY_LIST_PAGE) {
|
|
rid = dereferenceArrayListRidUnlocked(p, rid.slot);
|
|
} else {
|
|
abort();
|
|
}
|
|
return rid;
|
|
}
|
|
recordid interpretRid(int xid, recordid rid, Page * p) {
|
|
int page_type = *page_type_ptr(p);
|
|
if(page_type == SLOTTED_PAGE || page_type == FIXED_PAGE || (!page_type) || page_type == BOUNDARY_TAG_PAGE ) {
|
|
|
|
} else if(page_type == INDIRECT_PAGE) {
|
|
rid = dereferenceRID(xid, rid);
|
|
} else if(page_type == ARRAY_LIST_PAGE) {
|
|
rid = dereferenceArrayListRid(p, rid.slot);
|
|
} else {
|
|
abort();
|
|
}
|
|
return rid;
|
|
}
|
|
|