stasis-aries-wal/src/lladd/logger/logger2.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.
---*/

#include <config.h>
#include <lladd/common.h>

#include <lladd/logger/logger2.h>
#include "logWriter.h"
#include "inMemoryLog.h"
#include "page.h"
/*#include <lladd/bufferManager.h>*/
#include <stdio.h>
#include <assert.h>

int loggerType = LOG_TO_FILE; //MEMORY;

void genericLogWrite(LogEntry * e) { 
  assert(loggerType != -1); // Otherwise, we haven't been initialized.
  if(loggerType == LOG_TO_FILE) { 
    writeLogEntry(e);
  } else if (loggerType == LOG_TO_MEMORY) {
    writeLogEntry_InMemoryLog(e);
  }
}

int LogInit(int logType) { 
  if(LOG_TO_FILE == logType) { 
    openLogWriter();
  } else if(LOG_TO_MEMORY == logType) { 
    open_InMemoryLog();
  } else { 
    return -1;
  }
  loggerType = logType;
  return 0;
}

int LogDeinit() { 
  assert(loggerType != -1); 
  if(LOG_TO_FILE == loggerType) { 
    closeLogWriter();
  } else if(LOG_TO_MEMORY == loggerType) { 
    close_InMemoryLog();
  }
  return 0;
}

void LogForce(lsn_t lsn) { 
  assert(loggerType != -1);
  if(LOG_TO_FILE == loggerType) { 
    if(flushedLSN() < lsn) { 
      syncLog();
    }
    assert(flushedLSN() >= lsn);
  } else if(LOG_TO_MEMORY == loggerType) { 
    assert(flushedLSN_InMemoryLog() >= lsn);
  }
}
void LogTruncate(lsn_t lsn) { 
  truncateLog(lsn);
}

lsn_t LogTruncationPoint() { 
  assert(loggerType != -1);
  if(LOG_TO_FILE == loggerType) { 
    return firstLogEntry();
  } else if(LOG_TO_MEMORY == loggerType) { 
    return firstLogEntry_InMemoryLog();
  }
  abort();
}
LogEntry * LogReadLSN(lsn_t lsn) { 
  assert(loggerType != -1); 
  if(LOG_TO_FILE == loggerType) { 
    return readLSNEntry(lsn);
  } else if(LOG_TO_MEMORY == loggerType) { 
    return readLSNEntry_InMemoryLog(lsn);
  } 
  abort();
}

TransactionLog LogTransBegin(int xid) {
  TransactionLog tl;
  tl.xid = xid;
  
  DEBUG("Log Begin %d\n", xid);
  tl.prevLSN = -1;
  return tl;
}

static lsn_t LogTransCommon(TransactionLog * l, int type) {
  LogEntry * e = allocCommonLogEntry(l->prevLSN, l->xid, type);
  lsn_t ret;

  genericLogWrite(e);

  l->prevLSN = e->LSN;
  DEBUG("Log Common %d, LSN: %ld type: %ld (prevLSN %ld)\n", e->xid, 
	 (long int)e->LSN, (long int)e->type, (long int)e->prevLSN);

  ret = e->LSN;

  free(e);

  return ret;

}

extern int numActiveXactions;
/**
   @todo This belongs in logWriter.c and needs a new name.
*/
static lsn_t LogTransBundledCommit(TransactionLog * l) {
  static pthread_mutex_t check_commit = PTHREAD_MUTEX_INITIALIZER;
  static pthread_cond_t tooFewXacts = PTHREAD_COND_INITIALIZER;
  static int pendingCommits = 0;
  static int syncLogCount;

  lsn_t ret = LogTransCommon(l, XCOMMIT);

  struct timeval now;
  struct timespec timeout;
  //  int retcode;
  
  pthread_mutex_lock(&check_commit);
  if(flushedLSN() >= ret) {
    pthread_mutex_unlock(&check_commit);
    return ret;
  }
  gettimeofday(&now, NULL);
  timeout.tv_sec = now.tv_sec;
  timeout.tv_nsec = now.tv_usec * 1000;
  //                   0123456789  <- number of zeros on the next three lines...
  timeout.tv_nsec +=   100000000; // wait ten msec.
  if(timeout.tv_nsec > 1000000000) {
    timeout.tv_nsec -= 1000000000;
    timeout.tv_sec++;
  }

  pendingCommits++;
  //  if(pendingCommits <= (numActiveXactions / 2)) {
  if((numActiveXactions > 1 && pendingCommits < numActiveXactions) ||
     (numActiveXactions > 20 && pendingCommits < (int)((double)numActiveXactions * 0.95))) {
    while(ETIMEDOUT != (pthread_cond_timedwait(&tooFewXacts, &check_commit, &timeout))) {
      if(flushedLSN() >= ret) {
	pendingCommits--;
	pthread_mutex_unlock(&check_commit);
	return ret;
      }
    }
    //    printf("Timed out");
  } else {
    //     printf("Didn't wait %d < %d\n", (numActiveXactions / 2), pendingCommits);
  } 
  if(flushedLSN() < ret) {
    syncLog();
    syncLogCount++;
    //    printf(" %d ", syncLogCount);
    pthread_cond_broadcast(&tooFewXacts);
  }
  assert(flushedLSN() >= ret);
  pendingCommits--;
  pthread_mutex_unlock(&check_commit);
  return ret;
}

lsn_t LogTransCommit(TransactionLog * l) { 
  assert(loggerType != -1);
  if(LOG_TO_FILE == loggerType) { 
    return LogTransBundledCommit(l);
  } else if(LOG_TO_MEMORY == loggerType) { 
    return LogTransCommon(l, XCOMMIT); 
  }
  abort();
}

lsn_t LogTransAbort(TransactionLog * l) {
  return LogTransCommon(l, XABORT);
}

LogEntry * LogUpdate(TransactionLog * l, Page * p, recordid rid, int operation, const byte * args) {
  void * preImage = NULL;
  long argSize  = 0;
  LogEntry * e;


  if(operationsTable[operation].sizeofData == SIZEOF_RECORD) {
    argSize = rid.size;
  } else if(operationsTable[operation].sizeofData == SIZEIS_PAGEID) {
    argSize = rid.page;
 //   printf("argsize (page) %d, %d\n", argSize, sizeof(recordid) * 2 + sizeof(int) * 3);
  } else {
    argSize = operationsTable[operation].sizeofData;
  }

  if(operationsTable[operation].undo == NO_INVERSE) {
    DEBUG("Creating %ld byte physical pre-image.\n", rid.size);
    preImage = malloc(rid.size);
    if(!preImage) { perror("malloc"); abort(); }
    readRecord(l->xid, p, rid, preImage);
    DEBUG("got preimage");
  } else if (operationsTable[operation].undo == NO_INVERSE_WHOLE_PAGE) {
    DEBUG("Logging entire page\n");
    preImage = malloc(PAGE_SIZE);
    if(!preImage) { perror("malloc"); abort(); }
    memcpy(preImage, p->memAddr, PAGE_SIZE);
    DEBUG("got preimage");
  }
  
  e = allocUpdateLogEntry(l->prevLSN, l->xid, operation, rid, args, argSize, preImage);
  
  //  writeLogEntry(e); 
  genericLogWrite(e);
  DEBUG("Log Common %d, LSN: %ld type: %ld (prevLSN %ld) (argSize %ld)\n", e->xid, 
	 (long int)e->LSN, (long int)e->type, (long int)e->prevLSN, (long int) argSize);

  if(preImage) {
    free(preImage);
  }

  l->prevLSN = e->LSN;
  return e;
}

lsn_t LogCLR(int xid, lsn_t LSN, recordid rid, lsn_t prevLSN) { 
  lsn_t ret;
  LogEntry * e = allocCLRLogEntry(-1, xid, LSN, rid, prevLSN);
  genericLogWrite(e);

  DEBUG("Log CLR %d, LSN: %ld (undoing: %ld, next to undo: %ld)\n", xid, 
  	 e->LSN, LSN, prevLSN);

  ret = e->LSN;
  free(e);
  return ret;
}