dictionaryRandomAccess.c File Reference

#include "lz4.h"
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>

Macros
#define	MIN(x, y)

Enumerations
enum	{ BLOCK_BYTES = 1024 , DICTIONARY_BYTES = 1024 , MAX_BLOCKS = 1024 }

Functions
void	write_int (FILE *fp, int i)
void	write_bin (FILE *fp, const void *array, size_t arrayBytes)
void	read_int (FILE *fp, int *i)
size_t	read_bin (FILE *fp, void *array, size_t arrayBytes)
void	seek_bin (FILE *fp, long offset, int origin)
void	test_compress (FILE *outFp, FILE *inpFp, void *dict, int dictSize)
void	test_decompress (FILE *outFp, FILE *inpFp, void *dict, int dictSize, int offset, int length)
int	compare (FILE *fp0, FILE *fp1, int length)
int	main (int argc, char *argv[])

Variables
const char	kTestMagic [] = { 'T', 'E', 'S', 'T' }

Macro Definition Documentation

MIN

#define MIN	(		x,
			y )

Value:

((x) < (y) ? (x) : (y))

Enumeration Type Documentation

anonymous enum

anonymous enum

Enumerator
BLOCK_BYTES
DICTIONARY_BYTES
MAX_BLOCKS

Function Documentation

compare()

int compare	(	FILE *	fp0,
		FILE *	fp1,
		int	length )

main()

int main	(	int	argc,
		char *	argv[] )

read_bin()

size_t read_bin	(	FILE *	fp,
		void *	array,
		size_t	arrayBytes )

read_int()

void read_int	(	FILE *	fp,
		int *	i )

seek_bin()

void seek_bin	(	FILE *	fp,
		long	offset,
		int	origin )

test_compress()

void test_compress	(	FILE *	outFp,
		FILE *	inpFp,
		void *	dict,
		int	dictSize )

test_decompress()

void test_decompress	(	FILE *	outFp,
		FILE *	inpFp,
		void *	dict,
		int	dictSize,
		int	offset,
		int	length )

write_bin()

void write_bin	(	FILE *	fp,
		const void *	array,
		size_t	arrayBytes )

write_int()

void write_int	(	FILE *	fp,
		int	i )

Variable Documentation

kTestMagic

const char kTestMagic[] = { 'T', 'E', 'S', 'T' }

Magic bytes for this test case. This is not a great magic number because it is a common word in ASCII. However, it is important to have some versioning system in your format.