cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
3e01a2ffa1
openbsd-ports/misc/dnetc/Makefile

55 lines
1.1 KiB
Makefile
Raw Normal View History

properly handle SUPDISTFILES and restore checksums; ok xsa@
2005-01-05 14:40:33 -05:00
# $OpenBSD: Makefile,v 1.11 2005/01/05 19:40:33 naddy Exp $
ONLY_FOR_ARCHS= i386 m68k sparc
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
COMMENT= "official distributed.net client"
properly handle SUPDISTFILES and restore checksums; ok xsa@
2005-01-05 14:40:33 -05:00
A-i386= x86-elf
V-i386= 2.9008
SV-i386= 491
A-m68k= m68k
V-m68k= 2.9005
SV-m68k= 483
A-sparc= sparc-aout
V-sparc= 2.9002
SV-sparc= 479
.for m in ${ONLY_FOR_ARCHS}
. if ${MACHINE_ARCH} == "$m"
A= ${A-$m}
V= ${V-$m}
SV= ${SV-$m}
. else
SUPDISTFILES+= dnetc${SV-$m}-openbsd-${A-$m}${EXTRACT_SUFX}
. endif
.endfor
- add support for sparc architecture with version 2.8015.469 - clean master site. - i386 still at version 2.8010.463.
2001-06-13 11:52:52 -04:00
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
PKGNAME= dnetc-${V}.${SV}
update misc/dnetc for i386 to 2.9007.486; thanks to Michael Coulter <mjc (at) bitz.ca>
2003-12-12 09:45:08 -05:00
DISTNAME= dnetc${SV}-openbsd-${A}
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
CATEGORIES= misc
HOMEPAGE= http://www.distributed.net/
- add support for sparc architecture with version 2.8015.469 - clean master site. - i386 still at version 2.8010.463.
2001-06-13 11:52:52 -04:00
MASTER_SITES= http://http.distributed.net/pub/dcti/v${V}/
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
update the i386 version to 2.9008/491 from new maintainer Sico Bruins <openbsd at msh.xs4all.nl>
2004-12-04 10:32:24 -05:00
MAINTAINER= Sico Bruins <openbsd@msh.xs4all.nl>
mention why this package can't be distributed
2004-09-14 20:35:29 -04:00
PERMIT_PACKAGE_CDROM= "no redistribution"
PERMIT_PACKAGE_FTP= "no redistribution"
PERMIT_DISTFILES_CDROM= "no redistribution"
PERMIT_DISTFILES_FTP= "no redistribution"
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
NO_BUILD= Yes
No regression tests available.
2002-10-27 16:07:53 -05:00
NO_REGRESS= Yes
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
update misc/dnetc for i386 to 2.9007.486; thanks to Michael Coulter <mjc (at) bitz.ca>
2003-12-12 09:45:08 -05:00
WRKSRC= ${WRKDIR}/dnetc${SV}-openbsd-${A}
initial import of dnetc-2.8010.463: -- RC5-64: distributed.net's longest-running project is the RC5-64 challenge. We're now cracking at 127.24 billion keys per second and are moving through the keyspace faster every day. Optimal 24 Mark Golomb Rulers: Essentially, a Golomb Ruler is a mathematical term given to a set of whole numbers where no two pairs of numbers have the same difference. An Optimal Golomb Ruler (OGR) is just like an everyday ruler, except that the marks are placed so that no two pairs of marks measure the same distance. OGR's have many uses in the real world; for more information about them and the status of the project, please visit our pages devoted to our OGR effort. We're now testing at 182.49 billion nodes per second.
2001-05-06 10:36:05 -04:00
do-install:
${INSTALL_PROGRAM} ${WRKSRC}/dnetc ${PREFIX}/bin/
${INSTALL_DATA} ${WRKSRC}/dnetc.1 ${PREFIX}/man/man1/
.include <bsd.port.mk>
Reference in New Issue Copy Permalink