Minix/pkgsrc-ng
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Import of pkgsrc-2015Q3

Browse Source
This commit is contained in:
Lionel Sambuc
2015-10-03 03:37:01 -07:00
committed by Lionel Sambuc
parent f641581404
commit 9d819b6d54
7578 changed files with 228314 additions and 80018 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
net/librsync/DESCR Normal file
View File

@@ -0,0 +1,11 @@
Librsync is a library for calculating and applying network deltas,
with an interface designed to ease integration into diverse network
applications. Librsync encapsulates the core algorithms of the rsync
protocol, which help with efficient calculation of the differences
between two files. The rsync algorithm is different from most
differencing algorithms because it does not require the presence of
the two files to calculate the delta. Instead, it requires a set of
checksums of each block of one file, which together form a signature
for that file. Blocks at any point in the other file which have the
same checksum are likely to be identical, and whatever remains is the
difference.

24
net/librsync/Makefile Normal file
View File

@@ -0,0 +1,24 @@
# $NetBSD: Makefile,v 1.1 2015/09/12 22:54:01 joerg Exp $
DISTNAME= librsync-1.0.1
CATEGORIES= net
MASTER_SITES= ${MASTER_SITE_GITHUB:=librsync/}
MAINTAINER= pkgsrc-users@NetBSD.org
HOMEPAGE= http://librsync.sourcefrog.net/
COMMENT= rsync-like rolling checksum library
GITHUB_TAG= f32ed26d02b4d59aa0db215fb58c7a2536d19cb9
LICENSE= gnu-lgpl-v2.1
USE_LIBTOOL= yes
USE_TOOLS+= autoconf automake libtoolize perl
GNU_CONFIGURE= yes
pre-configure:
cd ${WRKSRC} && ./autogen.sh
.include "../../devel/popt/buildlink3.mk"
.include "../../mk/bsd.pkg.mk"

7
net/librsync/PLIST Normal file
View File

@@ -0,0 +1,7 @@
@comment $NetBSD: PLIST,v 1.1 2015/09/12 22:54:01 joerg Exp $
bin/rdiff
include/librsync-config.h
include/librsync.h
lib/librsync.la
man/man1/rdiff.1
man/man3/librsync.3

12
net/librsync/buildlink3.mk Normal file
View File

@@ -0,0 +1,12 @@
# $NetBSD: buildlink3.mk,v 1.1 2015/09/12 22:54:01 joerg Exp $
BUILDLINK_TREE+= librsync
.if !defined(LIBRSYNC_BUILDLINK3_MK)
LIBRSYNC_BUILDLINK3_MK:=
BUILDLINK_API_DEPENDS.librsync+= librsync>=1.0.1
BUILDLINK_PKGSRCDIR.librsync?= ../../net/librsync
.endif # LIBRSYNC_BUILDLINK3_MK
BUILDLINK_TREE+= -librsync

7
net/librsync/distinfo Normal file
View File

@@ -0,0 +1,7 @@
$NetBSD: distinfo,v 1.2 2015/09/14 13:33:21 joerg Exp $
SHA1 (librsync-1.0.1-f32ed26d02b4d59aa0db215fb58c7a2536d19cb9.tar.gz) = 72ba18f73df99ca77335d0952bad3e0ca8f53e34
RMD160 (librsync-1.0.1-f32ed26d02b4d59aa0db215fb58c7a2536d19cb9.tar.gz) = d027e202518252fd64ec11a0a21122ded262718a
Size (librsync-1.0.1-f32ed26d02b4d59aa0db215fb58c7a2536d19cb9.tar.gz) = 140956 bytes
SHA1 (patch-Makefile.am) = 196443871ed3795e62267e0a5399010d1031a584
SHA1 (patch-delta.c) = e0025f414fe4b5b32dea17be033f7e2c1978f3f1

13
net/librsync/patches/patch-Makefile.am Normal file
View File

@@ -0,0 +1,13 @@
$NetBSD: patch-Makefile.am,v 1.1 2015/09/12 22:54:01 joerg Exp $
--- Makefile.am.orig 2015-09-12 21:32:07.226531526 +0000
+++ Makefile.am
@@ -66,6 +66,7 @@ rdiff_DEPENDENCIES = librsync.la
# this script is used to build prototab.[ch]
noinst_SCRIPTS = mkprototab.pl
+prototab.c emit.c patch.c: prototab.h
# Autogenerated by a script.
-prototab.c prototab.h: $(srcdir)/mkprototab.pl
+prototab.h: $(srcdir)/mkprototab.pl
perl $(srcdir)/mkprototab.pl prototab.c prototab.h

77
net/librsync/patches/patch-delta.c Normal file
View File

@@ -0,0 +1,77 @@
$NetBSD: patch-delta.c,v 1.1 2015/09/14 13:33:21 joerg Exp $
--- delta.c.orig 2015-09-14 08:28:47.000000000 +0000
+++ delta.c
@@ -126,12 +126,12 @@ static rs_result rs_delta_s_scan(rs_job_
static rs_result rs_delta_s_flush(rs_job_t *job);
static rs_result rs_delta_s_end(rs_job_t *job);
void rs_getinput(rs_job_t *job);
-inline int rs_findmatch(rs_job_t *job, rs_long_t *match_pos, size_t *match_len);
-inline rs_result rs_appendmatch(rs_job_t *job, rs_long_t match_pos, size_t match_len);
-inline rs_result rs_appendmiss(rs_job_t *job, size_t miss_len);
-inline rs_result rs_appendflush(rs_job_t *job);
-inline rs_result rs_processmatch(rs_job_t *job);
-inline rs_result rs_processmiss(rs_job_t *job);
+static inline int rs_findmatch(rs_job_t *job, rs_long_t *match_pos, size_t *match_len);
+static inline rs_result rs_appendmatch(rs_job_t *job, rs_long_t match_pos, size_t match_len);
+static inline rs_result rs_appendmiss(rs_job_t *job, size_t miss_len);
+static inline rs_result rs_appendflush(rs_job_t *job);
+static inline rs_result rs_processmatch(rs_job_t *job);
+static inline rs_result rs_processmiss(rs_job_t *job);
/**
* \brief Get a block of data if possible, and see if it matches.
@@ -255,7 +255,7 @@ void rs_getinput(rs_job_t *job) {
* forwards beyond the block boundaries. Extending backwards would require
* decrementing scoop_pos as appropriate.
*/
-inline int rs_findmatch(rs_job_t *job, rs_long_t *match_pos, size_t *match_len) {
+static inline int rs_findmatch(rs_job_t *job, rs_long_t *match_pos, size_t *match_len) {
/* calculate the weak_sum if we don't have one */
if (job->weak_sum.count == 0) {
/* set match_len to min(block_len, scan_avail) */
@@ -282,7 +282,7 @@ inline int rs_findmatch(rs_job_t *job, r
/**
* Append a match at match_pos of length match_len to the delta, extending
* a previous match if possible, or flushing any previous miss/match. */
-inline rs_result rs_appendmatch(rs_job_t *job, rs_long_t match_pos, size_t match_len)
+static inline rs_result rs_appendmatch(rs_job_t *job, rs_long_t match_pos, size_t match_len)
{
rs_result result=RS_DONE;
@@ -313,7 +313,7 @@ inline rs_result rs_appendmatch(rs_job_t
*
* This also breaks misses up into block_len segments to avoid accumulating
* too much in memory. */
-inline rs_result rs_appendmiss(rs_job_t *job, size_t miss_len)
+static inline rs_result rs_appendmiss(rs_job_t *job, size_t miss_len)
{
rs_result result=RS_DONE;
@@ -330,7 +330,7 @@ inline rs_result rs_appendmiss(rs_job_t
/**
* Flush any accumulating hit or miss, appending it to the delta.
*/
-inline rs_result rs_appendflush(rs_job_t *job)
+static inline rs_result rs_appendflush(rs_job_t *job)
{
/* if last is a match, emit it and reset last by resetting basis_len */
if (job->basis_len) {
@@ -361,7 +361,7 @@ inline rs_result rs_appendflush(rs_job_t
* scoop_pos appropriately. In the future this could be used for something
* like context compressing of miss data. Note that it also calls
* rs_tube_catchup to output any pending output. */
-inline rs_result rs_processmatch(rs_job_t *job)
+static inline rs_result rs_processmatch(rs_job_t *job)
{
job->scoop_avail-=job->scoop_pos;
job->scoop_next+=job->scoop_pos;
@@ -383,7 +383,7 @@ inline rs_result rs_processmatch(rs_job_
*
* In the future this could do compression of miss data before outputing
* it. */
-inline rs_result rs_processmiss(rs_job_t *job)
+static inline rs_result rs_processmiss(rs_job_t *job)
{
rs_tube_copy(job, job->scoop_pos);
job->scoop_pos=0;