2011-03-18 22:37:00 +00:00
|
|
|
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
|
//
|
|
|
|
|
// See port_example.h for documentation for the following types/functions.
|
|
|
|
|
|
|
|
|
|
#ifndef STORAGE_LEVELDB_PORT_PORT_POSIX_H_
|
|
|
|
|
#define STORAGE_LEVELDB_PORT_PORT_POSIX_H_
|
|
|
|
|
|
2012-03-05 18:35:46 +00:00
|
|
|
|
#if defined(OS_MACOSX)
|
2011-06-29 00:30:50 +00:00
|
|
|
|
#include <machine/endian.h>
|
|
|
|
|
#elif defined(OS_SOLARIS)
|
|
|
|
|
#include <sys/isa_defs.h>
|
|
|
|
|
#ifdef _LITTLE_ENDIAN
|
|
|
|
|
#define LITTLE_ENDIAN
|
|
|
|
|
#else
|
|
|
|
|
#define BIG_ENDIAN
|
|
|
|
|
#endif
|
2012-03-05 18:35:46 +00:00
|
|
|
|
#elif defined(OS_FREEBSD) || defined(OS_OPENBSD) || defined(OS_NETBSD) ||\
|
|
|
|
|
defined(OS_DRAGONFLYBSD)
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
#include <sys/endian.h>
|
2011-06-29 00:30:50 +00:00
|
|
|
|
#else
|
|
|
|
|
#include <endian.h>
|
|
|
|
|
#endif
|
2011-03-18 22:37:00 +00:00
|
|
|
|
#include <pthread.h>
|
2011-06-22 02:36:45 +00:00
|
|
|
|
#ifdef SNAPPY
|
|
|
|
|
#include <snappy.h>
|
|
|
|
|
#endif
|
2012-06-29 02:26:43 +00:00
|
|
|
|
|
2012-06-28 06:41:33 +00:00
|
|
|
|
#ifdef ZLIB
|
|
|
|
|
#include <zlib.h>
|
|
|
|
|
#endif
|
2012-06-29 02:26:43 +00:00
|
|
|
|
|
|
|
|
|
#ifdef BZIP2
|
|
|
|
|
#include <bzlib.h>
|
|
|
|
|
#endif
|
|
|
|
|
|
2011-03-18 22:37:00 +00:00
|
|
|
|
#include <stdint.h>
|
|
|
|
|
#include <string>
|
2012-06-28 06:41:33 +00:00
|
|
|
|
#include <string.h>
|
2011-06-29 00:30:50 +00:00
|
|
|
|
#include "port/atomic_pointer.h"
|
|
|
|
|
|
|
|
|
|
#ifdef LITTLE_ENDIAN
|
|
|
|
|
#define IS_LITTLE_ENDIAN true
|
|
|
|
|
#else
|
|
|
|
|
#define IS_LITTLE_ENDIAN (__BYTE_ORDER == __LITTLE_ENDIAN)
|
|
|
|
|
#endif
|
|
|
|
|
|
2012-03-05 18:35:46 +00:00
|
|
|
|
#if defined(OS_MACOSX) || defined(OS_SOLARIS) || defined(OS_FREEBSD) ||\
|
|
|
|
|
defined(OS_NETBSD) || defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD)
|
|
|
|
|
// Use fread/fwrite/fflush on platforms without _unlocked variants
|
2011-06-29 00:30:50 +00:00
|
|
|
|
#define fread_unlocked fread
|
|
|
|
|
#define fwrite_unlocked fwrite
|
|
|
|
|
#define fflush_unlocked fflush
|
|
|
|
|
#endif
|
|
|
|
|
|
2012-03-05 18:35:46 +00:00
|
|
|
|
#if defined(OS_MACOSX) || defined(OS_FREEBSD) ||\
|
|
|
|
|
defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD)
|
|
|
|
|
// Use fsync() on platforms without fdatasync()
|
2011-06-29 00:30:50 +00:00
|
|
|
|
#define fdatasync fsync
|
|
|
|
|
#endif
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
|
|
namespace leveldb {
|
|
|
|
|
namespace port {
|
|
|
|
|
|
2011-06-29 00:30:50 +00:00
|
|
|
|
static const bool kLittleEndian = IS_LITTLE_ENDIAN;
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
|
|
class CondVar;
|
|
|
|
|
|
|
|
|
|
class Mutex {
|
|
|
|
|
public:
|
|
|
|
|
Mutex();
|
|
|
|
|
~Mutex();
|
|
|
|
|
|
|
|
|
|
void Lock();
|
|
|
|
|
void Unlock();
|
|
|
|
|
void AssertHeld() { }
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
friend class CondVar;
|
|
|
|
|
pthread_mutex_t mu_;
|
|
|
|
|
|
|
|
|
|
// No copying
|
|
|
|
|
Mutex(const Mutex&);
|
|
|
|
|
void operator=(const Mutex&);
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
class CondVar {
|
|
|
|
|
public:
|
|
|
|
|
explicit CondVar(Mutex* mu);
|
|
|
|
|
~CondVar();
|
|
|
|
|
void Wait();
|
|
|
|
|
void Signal();
|
|
|
|
|
void SignalAll();
|
|
|
|
|
private:
|
|
|
|
|
pthread_cond_t cv_;
|
|
|
|
|
Mutex* mu_;
|
|
|
|
|
};
|
|
|
|
|
|
2011-07-21 02:40:18 +00:00
|
|
|
|
inline bool Snappy_Compress(const char* input, size_t length,
|
2011-06-29 00:30:50 +00:00
|
|
|
|
::std::string* output) {
|
2011-06-22 02:36:45 +00:00
|
|
|
|
#ifdef SNAPPY
|
2011-07-21 02:40:18 +00:00
|
|
|
|
output->resize(snappy::MaxCompressedLength(length));
|
2011-06-22 02:36:45 +00:00
|
|
|
|
size_t outlen;
|
2011-07-21 02:40:18 +00:00
|
|
|
|
snappy::RawCompress(input, length, &(*output)[0], &outlen);
|
2011-06-22 02:36:45 +00:00
|
|
|
|
output->resize(outlen);
|
|
|
|
|
return true;
|
|
|
|
|
#endif
|
|
|
|
|
|
2011-03-22 23:24:02 +00:00
|
|
|
|
return false;
|
2011-03-18 22:37:00 +00:00
|
|
|
|
}
|
|
|
|
|
|
2011-07-21 02:40:18 +00:00
|
|
|
|
inline bool Snappy_GetUncompressedLength(const char* input, size_t length,
|
|
|
|
|
size_t* result) {
|
2011-06-22 02:36:45 +00:00
|
|
|
|
#ifdef SNAPPY
|
2011-07-21 02:40:18 +00:00
|
|
|
|
return snappy::GetUncompressedLength(input, length, result);
|
|
|
|
|
#else
|
|
|
|
|
return false;
|
2011-06-22 02:36:45 +00:00
|
|
|
|
#endif
|
2011-07-21 02:40:18 +00:00
|
|
|
|
}
|
2011-06-22 02:36:45 +00:00
|
|
|
|
|
2011-07-21 02:40:18 +00:00
|
|
|
|
inline bool Snappy_Uncompress(const char* input, size_t length,
|
|
|
|
|
char* output) {
|
|
|
|
|
#ifdef SNAPPY
|
|
|
|
|
return snappy::RawUncompress(input, length, output);
|
|
|
|
|
#else
|
2011-03-22 23:24:02 +00:00
|
|
|
|
return false;
|
2011-07-21 02:40:18 +00:00
|
|
|
|
#endif
|
2011-03-18 22:37:00 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-06-28 06:41:33 +00:00
|
|
|
|
inline bool Zlib_Compress(const char* input, size_t length,
|
|
|
|
|
::std::string* output, int windowBits = 15, int level = -1,
|
|
|
|
|
int strategy = 0) {
|
|
|
|
|
#ifdef ZLIB
|
|
|
|
|
// The memLevel parameter specifies how much memory should be allocated for
|
|
|
|
|
// the internal compression state.
|
|
|
|
|
// memLevel=1 uses minimum memory but is slow and reduces compression ratio.
|
|
|
|
|
// memLevel=9 uses maximum memory for optimal speed.
|
|
|
|
|
// The default value is 8. See zconf.h for more details.
|
|
|
|
|
static const int memLevel = 8;
|
|
|
|
|
z_stream _stream;
|
|
|
|
|
memset(&_stream, 0, sizeof(z_stream));
|
|
|
|
|
int st = deflateInit2(&_stream, level, Z_DEFLATED, windowBits,
|
|
|
|
|
memLevel, strategy);
|
|
|
|
|
if (st != Z_OK) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Resize output to be the plain data length.
|
|
|
|
|
// This may not be big enough if the compression actually expands data.
|
|
|
|
|
output->resize(length);
|
|
|
|
|
|
|
|
|
|
// Compress the input, and put compressed data in output.
|
|
|
|
|
_stream.next_in = (Bytef *)input;
|
|
|
|
|
_stream.avail_in = length;
|
|
|
|
|
|
|
|
|
|
// Initialize the output size.
|
|
|
|
|
_stream.avail_out = length;
|
|
|
|
|
_stream.next_out = (Bytef *)&(*output)[0];
|
|
|
|
|
|
|
|
|
|
int old_sz =0, new_sz =0;
|
|
|
|
|
while(_stream.next_in != NULL && _stream.avail_in != 0) {
|
|
|
|
|
int st = deflate(&_stream, Z_FINISH);
|
|
|
|
|
switch (st) {
|
|
|
|
|
case Z_STREAM_END:
|
|
|
|
|
break;
|
|
|
|
|
case Z_OK:
|
|
|
|
|
// No output space. Increase the output space by 20%.
|
|
|
|
|
// (Should we fail the compression since it expands the size?)
|
|
|
|
|
old_sz = output->size();
|
2012-07-03 00:30:32 +00:00
|
|
|
|
new_sz = (int)(output->size() * 1.2);
|
2012-06-28 06:41:33 +00:00
|
|
|
|
output->resize(new_sz);
|
|
|
|
|
// Set more output.
|
|
|
|
|
_stream.next_out = (Bytef *)&(*output)[old_sz];
|
|
|
|
|
_stream.avail_out = new_sz - old_sz;
|
|
|
|
|
break;
|
|
|
|
|
case Z_BUF_ERROR:
|
|
|
|
|
default:
|
|
|
|
|
deflateEnd(&_stream);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
output->resize(output->size() - _stream.avail_out);
|
|
|
|
|
deflateEnd(&_stream);
|
|
|
|
|
return true;
|
|
|
|
|
#endif
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inline char* Zlib_Uncompress(const char* input_data, size_t input_length,
|
|
|
|
|
int* decompress_size, int windowBits = 15) {
|
|
|
|
|
#ifdef ZLIB
|
|
|
|
|
z_stream _stream;
|
|
|
|
|
memset(&_stream, 0, sizeof(z_stream));
|
|
|
|
|
|
|
|
|
|
// For raw inflate, the windowBits should be <20>8..<2E>15.
|
|
|
|
|
// If windowBits is bigger than zero, it will use either zlib
|
|
|
|
|
// header or gzip header. Adding 32 to it will do automatic detection.
|
|
|
|
|
int st = inflateInit2(&_stream,
|
|
|
|
|
windowBits > 0 ? windowBits + 32 : windowBits);
|
|
|
|
|
if (st != Z_OK) {
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
_stream.next_in = (Bytef *)input_data;
|
|
|
|
|
_stream.avail_in = input_length;
|
|
|
|
|
|
|
|
|
|
// Assume the decompressed data size will 5x of compressed size.
|
|
|
|
|
int output_len = input_length * 5;
|
|
|
|
|
char* output = new char[output_len];
|
|
|
|
|
int old_sz = output_len;
|
|
|
|
|
|
|
|
|
|
_stream.next_out = (Bytef *)output;
|
|
|
|
|
_stream.avail_out = output_len;
|
|
|
|
|
|
|
|
|
|
char* tmp = NULL;
|
|
|
|
|
|
|
|
|
|
while(_stream.next_in != NULL && _stream.avail_in != 0) {
|
|
|
|
|
int st = inflate(&_stream, Z_SYNC_FLUSH);
|
|
|
|
|
switch (st) {
|
|
|
|
|
case Z_STREAM_END:
|
|
|
|
|
break;
|
|
|
|
|
case Z_OK:
|
|
|
|
|
// No output space. Increase the output space by 20%.
|
|
|
|
|
old_sz = output_len;
|
2012-07-03 00:30:32 +00:00
|
|
|
|
output_len = (int)(output_len * 1.2);
|
2012-06-28 06:41:33 +00:00
|
|
|
|
tmp = new char[output_len];
|
|
|
|
|
memcpy(tmp, output, old_sz);
|
|
|
|
|
delete[] output;
|
|
|
|
|
output = tmp;
|
|
|
|
|
|
|
|
|
|
// Set more output.
|
|
|
|
|
_stream.next_out = (Bytef *)(output + old_sz);
|
|
|
|
|
_stream.avail_out = output_len - old_sz;
|
|
|
|
|
break;
|
|
|
|
|
case Z_BUF_ERROR:
|
|
|
|
|
default:
|
|
|
|
|
delete[] output;
|
|
|
|
|
inflateEnd(&_stream);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*decompress_size = output_len - _stream.avail_out;
|
|
|
|
|
inflateEnd(&_stream);
|
|
|
|
|
return output;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2012-06-29 02:26:43 +00:00
|
|
|
|
inline bool BZip2_Compress(const char* input, size_t length,
|
|
|
|
|
::std::string* output) {
|
|
|
|
|
#ifdef BZIP2
|
|
|
|
|
bz_stream _stream;
|
|
|
|
|
memset(&_stream, 0, sizeof(bz_stream));
|
|
|
|
|
|
|
|
|
|
// Block size 1 is 100K.
|
|
|
|
|
// 0 is for silent.
|
|
|
|
|
// 30 is the default workFactor
|
|
|
|
|
int st = BZ2_bzCompressInit(&_stream, 1, 0, 30);
|
|
|
|
|
if (st != BZ_OK) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Resize output to be the plain data length.
|
|
|
|
|
// This may not be big enough if the compression actually expands data.
|
|
|
|
|
output->resize(length);
|
|
|
|
|
|
|
|
|
|
// Compress the input, and put compressed data in output.
|
|
|
|
|
_stream.next_in = (char *)input;
|
|
|
|
|
_stream.avail_in = length;
|
|
|
|
|
|
|
|
|
|
// Initialize the output size.
|
|
|
|
|
_stream.next_out = (char *)&(*output)[0];
|
|
|
|
|
_stream.avail_out = length;
|
|
|
|
|
|
|
|
|
|
int old_sz =0, new_sz =0;
|
|
|
|
|
while(_stream.next_in != NULL && _stream.avail_in != 0) {
|
|
|
|
|
int st = BZ2_bzCompress(&_stream, BZ_FINISH);
|
|
|
|
|
switch (st) {
|
|
|
|
|
case BZ_STREAM_END:
|
|
|
|
|
break;
|
|
|
|
|
case BZ_FINISH_OK:
|
|
|
|
|
// No output space. Increase the output space by 20%.
|
|
|
|
|
// (Should we fail the compression since it expands the size?)
|
|
|
|
|
old_sz = output->size();
|
2012-07-03 00:30:32 +00:00
|
|
|
|
new_sz = (int)(output->size() * 1.2);
|
2012-06-29 02:26:43 +00:00
|
|
|
|
output->resize(new_sz);
|
|
|
|
|
// Set more output.
|
|
|
|
|
_stream.next_out = (char *)&(*output)[old_sz];
|
|
|
|
|
_stream.avail_out = new_sz - old_sz;
|
|
|
|
|
break;
|
|
|
|
|
case Z_BUF_ERROR:
|
|
|
|
|
default:
|
|
|
|
|
BZ2_bzCompressEnd(&_stream);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
output->resize(output->size() - _stream.avail_out);
|
|
|
|
|
BZ2_bzCompressEnd(&_stream);
|
|
|
|
|
return true;
|
|
|
|
|
return output;
|
|
|
|
|
#endif
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inline char* BZip2_Uncompress(const char* input_data, size_t input_length,
|
|
|
|
|
int* decompress_size) {
|
|
|
|
|
#ifdef BZIP2
|
|
|
|
|
bz_stream _stream;
|
|
|
|
|
memset(&_stream, 0, sizeof(bz_stream));
|
|
|
|
|
|
|
|
|
|
int st = BZ2_bzDecompressInit(&_stream, 0, 0);
|
|
|
|
|
if (st != BZ_OK) {
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
_stream.next_in = (char *)input_data;
|
|
|
|
|
_stream.avail_in = input_length;
|
|
|
|
|
|
|
|
|
|
// Assume the decompressed data size will be 5x of compressed size.
|
|
|
|
|
int output_len = input_length * 5;
|
|
|
|
|
char* output = new char[output_len];
|
|
|
|
|
int old_sz = output_len;
|
|
|
|
|
|
|
|
|
|
_stream.next_out = (char *)output;
|
|
|
|
|
_stream.avail_out = output_len;
|
|
|
|
|
|
|
|
|
|
char* tmp = NULL;
|
|
|
|
|
|
|
|
|
|
while(_stream.next_in != NULL && _stream.avail_in != 0) {
|
|
|
|
|
int st = BZ2_bzDecompress(&_stream);
|
|
|
|
|
switch (st) {
|
|
|
|
|
case BZ_STREAM_END:
|
|
|
|
|
break;
|
|
|
|
|
case Z_OK:
|
|
|
|
|
// No output space. Increase the output space by 20%.
|
|
|
|
|
old_sz = output_len;
|
2012-07-03 00:30:32 +00:00
|
|
|
|
output_len = (int)(output_len * 1.2);
|
2012-06-29 02:26:43 +00:00
|
|
|
|
tmp = new char[output_len];
|
|
|
|
|
memcpy(tmp, output, old_sz);
|
|
|
|
|
delete[] output;
|
|
|
|
|
output = tmp;
|
|
|
|
|
|
|
|
|
|
// Set more output.
|
|
|
|
|
_stream.next_out = (char *)(output + old_sz);
|
|
|
|
|
_stream.avail_out = output_len - old_sz;
|
|
|
|
|
break;
|
|
|
|
|
case Z_BUF_ERROR:
|
|
|
|
|
default:
|
|
|
|
|
delete[] output;
|
|
|
|
|
BZ2_bzDecompressEnd(&_stream);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*decompress_size = output_len - _stream.avail_out;
|
|
|
|
|
BZ2_bzDecompressEnd(&_stream);
|
|
|
|
|
return output;
|
|
|
|
|
#endif
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-18 22:37:00 +00:00
|
|
|
|
inline bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2011-06-29 00:30:50 +00:00
|
|
|
|
} // namespace port
|
|
|
|
|
} // namespace leveldb
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
|
|
#endif // STORAGE_LEVELDB_PORT_PORT_POSIX_H_
|