mirror of
https://github.com/plasma-umass/coz.git
synced 2024-09-11 04:55:25 +03:00
--HG-- rename : tests/Makefile => benchmarks/Makefile rename : tests/experiment.py => benchmarks/experiment.py rename : tests/histogram/Makefile => benchmarks/histogram/Makefile rename : tests/histogram/histogram-pthread.c => benchmarks/histogram/histogram-pthread.c rename : tests/histogram/stddefines.h => benchmarks/histogram/stddefines.h rename : tests/kmeans/Makefile => benchmarks/kmeans/Makefile rename : tests/kmeans/kmeans-pthread.c => benchmarks/kmeans/kmeans-pthread.c rename : tests/kmeans/stddefines.h => benchmarks/kmeans/stddefines.h rename : tests/linear_regression/Makefile => benchmarks/linear_regression/Makefile rename : tests/linear_regression/linear_regression-pthread.c => benchmarks/linear_regression/linear_regression-pthread.c rename : tests/linear_regression/stddefines.h => benchmarks/linear_regression/stddefines.h rename : tests/matrix_multiply/Makefile => benchmarks/matrix_multiply/Makefile rename : tests/matrix_multiply/map_reduce.h => benchmarks/matrix_multiply/map_reduce.h rename : tests/matrix_multiply/matrix_multiply-pthread.c => benchmarks/matrix_multiply/matrix_multiply-pthread.c rename : tests/matrix_multiply/stddefines.h => benchmarks/matrix_multiply/stddefines.h rename : tests/pbzip2/AUTHORS => benchmarks/pbzip2/AUTHORS rename : tests/pbzip2/BZ2StreamScanner.cpp => benchmarks/pbzip2/BZ2StreamScanner.cpp rename : tests/pbzip2/BZ2StreamScanner.h => benchmarks/pbzip2/BZ2StreamScanner.h rename : tests/pbzip2/COPYING => benchmarks/pbzip2/COPYING rename : tests/pbzip2/ErrorContext.cpp => benchmarks/pbzip2/ErrorContext.cpp rename : tests/pbzip2/ErrorContext.h => benchmarks/pbzip2/ErrorContext.h rename : tests/pbzip2/Makefile => benchmarks/pbzip2/Makefile rename : tests/pbzip2/README => benchmarks/pbzip2/README rename : tests/pbzip2/pbzip2.cpp => benchmarks/pbzip2/pbzip2.cpp rename : tests/pbzip2/pbzip2.h => benchmarks/pbzip2/pbzip2.h rename : tests/pca/Makefile => benchmarks/pca/Makefile rename : tests/pca/pca-pthread.c => benchmarks/pca/pca-pthread.c rename : tests/pca/stddefines.h => benchmarks/pca/stddefines.h rename : tests/producer_consumer/Makefile => benchmarks/producer_consumer/Makefile rename : tests/producer_consumer/producer_consumer.cpp => benchmarks/producer_consumer/producer_consumer.cpp rename : tests/string_match/Makefile => benchmarks/string_match/Makefile rename : tests/string_match/map_reduce.h => benchmarks/string_match/map_reduce.h rename : tests/string_match/stddefines.h => benchmarks/string_match/stddefines.h rename : tests/string_match/string_match-pthread.c => benchmarks/string_match/string_match-pthread.c rename : tests/unbalanced/Makefile => benchmarks/unbalanced/Makefile rename : tests/unbalanced/unbalanced.cpp => benchmarks/unbalanced/unbalanced.cpp rename : tests/word_count/Makefile => benchmarks/word_count/Makefile rename : tests/word_count/sort-pthread.c => benchmarks/word_count/sort-pthread.c rename : tests/word_count/sort-pthread.h => benchmarks/word_count/sort-pthread.h rename : tests/word_count/stddefines.h => benchmarks/word_count/stddefines.h rename : tests/word_count/word_count-pthread.c => benchmarks/word_count/word_count-pthread.c rename : tests/work_queue/Makefile => benchmarks/work_queue/Makefile rename : tests/work_queue/work_queue.cpp => benchmarks/work_queue/work_queue.cpp
363 lines
7.0 KiB
C++
363 lines
7.0 KiB
C++
/*
|
|
* File: pbzip2.h
|
|
* Author: Yavor Nikolov
|
|
*
|
|
* Created on March 6, 2010, 10:18 PM
|
|
*
|
|
* Change History:
|
|
* 2010-05-20 - by Yavor Nikolov
|
|
* - Transformed input queue as queue of queues to avoid deadlock and conten
|
|
* tion issues.
|
|
*/
|
|
|
|
#ifndef _PBZIP2_H
|
|
#define _PBZIP2_H
|
|
|
|
#include <string>
|
|
#include <cctype>
|
|
|
|
#define FILE_MODE (S_IRUSR | S_IWUSR )
|
|
|
|
#ifndef WIN32
|
|
#define OFF_T off_t
|
|
#else
|
|
#define OFF_T __int64
|
|
#endif
|
|
|
|
extern "C"
|
|
{
|
|
#ifndef WIN32
|
|
#include <utime.h>
|
|
#include <sys/time.h>
|
|
#include <unistd.h>
|
|
#else
|
|
#include <windows.h>
|
|
#include <io.h>
|
|
#endif
|
|
#ifdef __APPLE__
|
|
#include <sys/sysctl.h>
|
|
#endif
|
|
#ifdef __sun
|
|
#include <sys/loadavg.h>
|
|
#endif
|
|
#ifndef __BORLANDC__
|
|
#define __STDC_FORMAT_MACROS
|
|
#include <inttypes.h>
|
|
#else
|
|
#define PRIu64 "Lu"
|
|
#define strncasecmp(x,y,z) strncmpi(x,y,z)
|
|
#endif
|
|
#ifdef __osf__
|
|
#define PRIu64 "llu"
|
|
#endif
|
|
|
|
#include <stdio.h>
|
|
#include <pthread.h>
|
|
}
|
|
|
|
// uncomment for debug output
|
|
//#define PBZIP_DEBUG
|
|
|
|
// uncomment to disable load average code (may be required for some platforms)
|
|
//#define PBZIP_NO_LOADAVG
|
|
|
|
// detect systems that are known not to support load average code
|
|
#if defined (WIN32) || defined (__CYGWIN32__) || defined (__MINGW32__) || defined (__BORLANDC__) || defined (__hpux) || defined (__osf__) || defined(__UCLIBC__)
|
|
#define PBZIP_NO_LOADAVG
|
|
#endif
|
|
|
|
#ifdef WIN32
|
|
#define PATH_SEP '\\'
|
|
#define usleep(x) Sleep(x/1000)
|
|
#define LOW_DWORD(x) ((*(LARGE_INTEGER *)&x).LowPart)
|
|
#define HIGH_DWORD(x) ((*(LARGE_INTEGER *)&x).HighPart)
|
|
#ifndef _TIMEVAL_DEFINED /* also in winsock[2].h */
|
|
#define _TIMEVAL_DEFINED
|
|
struct timeval {
|
|
long tv_sec;
|
|
long tv_usec;
|
|
};
|
|
#endif
|
|
#else
|
|
#define PATH_SEP '/'
|
|
#endif
|
|
|
|
#ifndef O_BINARY
|
|
#define O_BINARY 0
|
|
#endif
|
|
|
|
typedef struct outBuff
|
|
{
|
|
char *buf;
|
|
unsigned int bufSize;
|
|
int blockNumber;
|
|
int sequenceNumber;
|
|
unsigned int inSize; // original size before compression/decompressoin
|
|
bool isLastInSequence;
|
|
outBuff * next; // next in longer sequence of buffers for this block
|
|
//outBuff * last; // last in sequence (here as quick hack since global one would be enough)
|
|
|
|
outBuff(
|
|
char * aBuf = NULL,
|
|
unsigned int aBufSize = 0,
|
|
int aBlockNumber = 0,
|
|
int aSequenceNumber = 0,
|
|
unsigned int aInSize = 0,
|
|
bool isLast = true,
|
|
outBuff * aNext = NULL):
|
|
buf(aBuf),
|
|
bufSize(aBufSize),
|
|
blockNumber(aBlockNumber),
|
|
sequenceNumber(aSequenceNumber),
|
|
inSize(aInSize),
|
|
isLastInSequence(isLast),
|
|
next(aNext)//,
|
|
//last(NULL)
|
|
{}
|
|
} outBuff;
|
|
|
|
typedef enum ExitFlag
|
|
{
|
|
EF_NOQUIT = 0,
|
|
EF_EXIT = 1,
|
|
EF_ABORT = 2
|
|
} ExitFlag;
|
|
|
|
typedef struct queue
|
|
{
|
|
typedef outBuff ElementType;
|
|
typedef ElementType* ElementTypePtr;
|
|
|
|
ElementTypePtr *qData;
|
|
long size;
|
|
long count; // actual element count, including tail-queue ones
|
|
long head, tail;
|
|
int full, empty;
|
|
int topLevelFull, topLevelEmpty;
|
|
pthread_mutex_t *mut;
|
|
pthread_cond_t *notFull, *notEmpty;
|
|
pthread_t *consumers;
|
|
ElementTypePtr lastElement; // most recently added element
|
|
|
|
queue(): count(0), lastElement(NULL)
|
|
{}
|
|
|
|
/**
|
|
* Reset the queue putting it to initial empty state.
|
|
*/
|
|
void clear()
|
|
{
|
|
empty = 1;
|
|
full = 0;
|
|
head = 0;
|
|
tail = 0;
|
|
count = 0;
|
|
lastElement = NULL;
|
|
topLevelFull = 0;
|
|
topLevelEmpty = 1;
|
|
}
|
|
|
|
void add(ElementTypePtr element)
|
|
{
|
|
#ifdef PBZIP_DEBUG
|
|
fprintf (stderr, "queue::add: elem=%llx\n",
|
|
(unsigned long long)element);
|
|
|
|
if (element != NULL)
|
|
{
|
|
fprintf (stderr, " queue::add: seq=%d; blk=%d; islast=%d\n",
|
|
element->sequenceNumber,
|
|
element->blockNumber,
|
|
(int)element->isLastInSequence);
|
|
}
|
|
#endif
|
|
|
|
if ( element->sequenceNumber > 1 )
|
|
{
|
|
// multi-part sequence: append to same one
|
|
lastElement->next = element;
|
|
}
|
|
else
|
|
{
|
|
// primary element (either first in sequence; or a standalone one)
|
|
qData[tail] = element;
|
|
++tail;
|
|
|
|
if (tail == size)
|
|
tail = 0;
|
|
|
|
if (tail == head)
|
|
topLevelFull = 1;
|
|
|
|
topLevelEmpty = 0;
|
|
}
|
|
|
|
lastElement = element;
|
|
++count;
|
|
|
|
if (count == size)
|
|
full = 1;
|
|
|
|
empty = 0;
|
|
}
|
|
|
|
/**
|
|
* Remove the head returning it into element. If the given element is
|
|
* tail of multi-segment sequence - just moves to next segment.
|
|
*
|
|
* @param element - removed element is copied here
|
|
* @return 1 on success; 0 - on denied request; -1 - on error
|
|
*/
|
|
int remove(ElementTypePtr & element)
|
|
{
|
|
ElementTypePtr & headElem = qData[head];
|
|
|
|
#ifdef PBZIP_DEBUG
|
|
fprintf (stderr, "queue::remove: head=%llx; elem=%llx; count=%ld\n",
|
|
(unsigned long long)headElem,
|
|
(unsigned long long)element,
|
|
count);
|
|
|
|
if (headElem != NULL)
|
|
{
|
|
fprintf (stderr, " queue::remove: head: seq=%d; blk=%d; islast=%d\n",
|
|
headElem->sequenceNumber,
|
|
headElem->blockNumber,
|
|
(int)headElem->isLastInSequence);
|
|
}
|
|
|
|
if (element != NULL)
|
|
{
|
|
fprintf (stderr, " queue::remove: element: seq=%d; blk=%d; islast=%d\n",
|
|
element->sequenceNumber,
|
|
element->blockNumber,
|
|
(int)element->isLastInSequence);
|
|
}
|
|
#endif
|
|
|
|
if ( (element != NULL) && !element->isLastInSequence )
|
|
{
|
|
if (element->next != NULL)
|
|
{
|
|
element = element->next;
|
|
}
|
|
else
|
|
{
|
|
// 2+ part of long-sequence BZ2 stream. Next
|
|
// segment is not ready yet.
|
|
return 0;
|
|
}
|
|
}
|
|
else if (topLevelEmpty)
|
|
{
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
element = headElem;
|
|
++head;
|
|
|
|
if (head == size)
|
|
head = 0;
|
|
|
|
if (head == tail)
|
|
topLevelEmpty = 1;
|
|
|
|
topLevelFull = 0;
|
|
}
|
|
|
|
--count;
|
|
|
|
if (count == 0)
|
|
empty = 1;
|
|
|
|
full = 0;
|
|
|
|
return 1;
|
|
}
|
|
|
|
} queue;
|
|
|
|
/*
|
|
*********************************************************
|
|
Print error message and optionally exit or abort
|
|
depending on exitFlag:
|
|
0 - don't quit;
|
|
1 - exit;
|
|
2 - abort.
|
|
On exit - exitCode status is used.
|
|
*/
|
|
int handle_error(ExitFlag exitFlag, int exitCode, const char *fmt, ...);
|
|
|
|
/*
|
|
* Delegate to read but keep writing until count bytes are read or
|
|
* error is encountered (on success all count bytes would be read)
|
|
*/
|
|
ssize_t do_read(int fd, void *buf, size_t count);
|
|
|
|
/*
|
|
* Delegate to write but keep writing until count bytes are written or
|
|
* error is encountered (on success all count bytes would be written)
|
|
*/
|
|
ssize_t do_write(int fd, const void *buf, size_t count);
|
|
|
|
|
|
/**
|
|
* Dispose the given buffer memory if not NULL and make it NULL. Provided
|
|
* buffer should be allocated with new[].
|
|
*/
|
|
template <typename C>
|
|
inline void disposeMemory(C *& pBuff)
|
|
{
|
|
if (pBuff != NULL)
|
|
{
|
|
delete [] pBuff;
|
|
pBuff = NULL;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Dispose the given buffer memory if not NULL and make it NULL. Provided
|
|
* buffer should be allocated with new.
|
|
*/
|
|
template <typename C>
|
|
inline void disposeMemorySingle(C *& pBuff)
|
|
{
|
|
if (pBuff != NULL)
|
|
{
|
|
delete pBuff;
|
|
pBuff = NULL;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Check if a given string ends with a given suffix ignoring case difference.
|
|
*
|
|
* @return true if str ends with suffix; false - otherwise
|
|
*/
|
|
template <typename charT>
|
|
inline bool ends_with_icase( const std::basic_string<charT> & str, const std::basic_string<charT> & suffix )
|
|
{
|
|
int ti = str.size() - suffix.size();
|
|
|
|
if ( ti < 0 )
|
|
{
|
|
return false;
|
|
}
|
|
|
|
size_t si = 0;
|
|
while ( si < suffix.size() )
|
|
{
|
|
if ( ::tolower( str[ti] ) != ::tolower( suffix[si] ) )
|
|
{
|
|
return false;
|
|
}
|
|
++si;
|
|
++ti;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#endif /* _PBZIP2_H */
|