Imported Upstream version 1.1.11upstream/1.1.11upstream

1 files changed, 210 insertions, 0 deletions

diff --git a/libparanoia/p_block.h b/libparanoia/p_block.h
new file mode 100644
index 0000000..418c193
--- /dev/null
+++ b/libparanoia/p_block.h
@@ -0,0 +1,210 @@
+/*
+ * This file has been modified for the cdrkit suite.
+ *
+ * The behaviour and appearence of the program code below can differ to a major
+ * extent from the version distributed by the original author(s).
+ *
+ * For details, see Changelog file distributed with the cdrkit package. If you
+ * received this file from another source then ask the distributing person for
+ * a log of modifications.
+ *
+ */
+
+/* @(#)p_block.h	1.16 04/02/20 J. Schilling from cdparanoia-III-alpha9.8 */
+/*
+ *	Modifications to make the code portable Copyright (c) 2002 J. Schilling
+ */
+/*
+ * CopyPolicy: GNU Public License 2 applies
+ * Copyright (C) by Monty (xiphmont@mit.edu)
+ */
+
+#ifndef	_p_block_h_
+#define	_p_block_h_
+
+#define	MIN_WORDS_OVERLAP	  64	/* 16 bit words */
+#define	MIN_WORDS_SEARCH	  64	/* 16 bit words */
+#define	MIN_WORDS_RIFT		  16	/* 16 bit words */
+#define	MAX_SECTOR_OVERLAP	  32	/* sectors */
+#define	MIN_SECTOR_EPSILON	 128	/* words */
+#define	MIN_SECTOR_BACKUP	  16	/* sectors */
+#define	JIGGLE_MODULO		  15	/* sectors */
+#define	MIN_SILENCE_BOUNDARY	1024	/* 16 bit words */
+
+#define	min(x, y) ((x) > (y)?(y):(x))
+#define	max(x, y) ((x) < (y)?(y):(x))
+
+#include "isort.h"
+
+typedef struct linked_list {
+	/* linked list */
+	struct linked_element	*head;
+	struct linked_element	*tail;
+
+	void			*(*new_poly)(void);
+	void			(*free_poly)(void *poly);
+	long			current;
+	long			active;
+
+} linked_list;
+
+typedef struct linked_element {
+	void			*ptr;
+	struct linked_element	*prev;
+	struct linked_element	*next;
+
+	struct linked_list	*list;
+	int			stamp;
+} linked_element;
+
+extern linked_list	*new_list(void *(*newp) (void),
+										 void (*freep) (void *));
+extern linked_element	*new_elem(linked_list *list);
+extern linked_element	*add_elem(linked_list *list, void *elem);
+extern void		free_list(linked_list *list, int free_ptr);	/* unlink or free */
+extern void		free_elem(linked_element *e, int free_ptr);	/* unlink or free */
+extern void		*get_elem(linked_element *e);
+extern linked_list	*copy_list(linked_list *list);	/* shallow; doesn't copy */
+									/* contained structures */
+
+typedef struct c_block {
+	/* The buffer */
+	Int16_t		*vector;
+	long		begin;
+	long		size;
+
+	/* auxiliary support structures */
+	unsigned char 	*flags;
+				/*
+				 * 1    known boundaries in read data
+				 * 2    known blanked data
+				 * 4    matched sample
+				 * 8    reserved
+				 * 16   reserved
+				 * 32   reserved
+				 * 64   reserved
+				 * 128  reserved
+				 */
+
+	/* end of session cases */
+	long		lastsector;
+	struct cdrom_paranoia	*p;
+	struct linked_element	*e;
+} c_block;
+
+extern void	free_c_block(c_block *c);
+extern void	i_cblock_destructor(c_block *c);
+extern c_block	*new_c_block(struct cdrom_paranoia *p);
+
+typedef struct v_fragment {
+	c_block		*one;
+
+	long		begin;
+	long		size;
+	Int16_t		*vector;
+
+	/* end of session cases */
+	long		lastsector;
+
+	/* linked list */
+	struct cdrom_paranoia	*p;
+	struct linked_element	*e;
+
+} v_fragment;
+
+extern void	free_v_fragment(v_fragment *c);
+extern v_fragment *new_v_fragment(struct cdrom_paranoia *p, c_block *one,
+											 long begin, long end,
+											 int lastsector);
+extern Int16_t	*v_buffer(v_fragment *v);
+
+extern c_block	*c_first(struct cdrom_paranoia *p);
+extern c_block	*c_last(struct cdrom_paranoia *p);
+extern c_block	*c_next(c_block *c);
+extern c_block	*c_prev(c_block *c);
+
+extern v_fragment *v_first(struct cdrom_paranoia *p);
+extern v_fragment *v_last(struct cdrom_paranoia *p);
+extern v_fragment *v_next(v_fragment *v);
+extern v_fragment *v_prev(v_fragment *v);
+
+typedef struct root_block {
+	long		returnedlimit;
+	long		lastsector;
+	struct cdrom_paranoia	*p;
+
+	c_block		*vector;	/* doesn't use any sorting */
+	int		silenceflag;
+	long		silencebegin;
+} root_block;
+
+typedef struct offsets {
+	long	offpoints;
+	long	newpoints;
+	long	offaccum;
+	long	offdiff;
+	long	offmin;
+	long	offmax;
+
+} offsets;
+
+typedef struct cdrom_paranoia {
+	void		*d;		/* A pointer to the driver interface */
+	int		nsectors;	/* # of sectors that fit into DMA buf */
+
+	root_block	root;		/* verified/reconstructed cached data */
+	linked_list	*cache;		/* our data as read from the cdrom */
+	long		cache_limit;
+	linked_list	*fragments;	/* fragments of blocks that have been */
+					/* 'verified' */
+	sort_info	*sortcache;
+
+	int		readahead;	/* sectors of readahead in each readop */
+	int		jitter;
+	long		lastread;
+
+	int		enable;
+	long		cursor;
+	long		current_lastsector;
+	long		current_firstsector;
+
+	/* statistics for drift/overlap */
+	struct offsets	stage1;
+	struct offsets	stage2;
+
+	long		mindynoverlap;
+	long		maxdynoverlap;
+	long		dynoverlap;
+	long		dyndrift;
+
+	/* statistics for verification */
+
+} cdrom_paranoia;
+
+extern c_block	*c_alloc(Int16_t *vector, long begin, long size);
+extern void	c_set(c_block *v, long begin);
+extern void	c_insert(c_block *v, long pos, Int16_t *b, long size);
+extern void	c_remove(c_block *v, long cutpos, long cutsize);
+extern void	c_overwrite(c_block *v, long pos, Int16_t *b, long size);
+extern void	c_append(c_block *v, Int16_t *vector, long size);
+extern void	c_removef(c_block *v, long cut);
+
+#define	ce(v)	((v)->begin + (v)->size)
+#define	cb(v)	((v)->begin)
+#define	cs(v)	((v)->size)
+
+/*
+ * pos here is vector position from zero
+ */
+extern void	recover_cache(cdrom_paranoia *p);
+extern void	i_paranoia_firstlast(cdrom_paranoia *p);
+
+#define	cv(c)	((c)->vector)
+
+#define	fe(f)	((f)->begin + (f)->size)
+#define	fb(f)	((f)->begin)
+#define	fs(f)	((f)->size)
+#define	fv(f)	(v_buffer(f))
+
+#define	CDP_COMPILE
+#endif