kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/databases/db5/Makefile

61 lines
1.7 KiB
Makefile
Raw Normal View History

Got rid of PLIST.MirBSD
2014-03-16 09:50:58 +01:00
# $NetBSD: Makefile,v 1.14 2014/03/16 08:50:58 adam Exp $
Berkeley DB is an embeddable database system that supports keyed access to data. The software is distributed in source code form, and developers can compile and link the source code into a single library for inclusion directly in their applications. Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: * B+tree: Stores keys in sorted order, using either a programmer-supplied ordering function or a default function that does lexicographical ordering of keys. Applications may perform equality or range searches. * Hashing: Stores records in a hash table for fast searches based on strict equality. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state. * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable or mutable, i.e., permitting new records to be inserted between existing records or requiring that new records be added only at the end of the database.
2010-06-02 14:08:48 +02:00
#
# NOTE:
# When updating this package, a change in the minor (5.n -> 5.(n+1))
# usually incurs a shlib name change. Please make sure to update the
# ABI depends in buildlink3.mk and bump PKGREVISIONs for all dependencies.
# In particular, take care to include BDB_ACCEPTED=db5 packages.
Changes 5.3.21: * Fixed incompatibility problems of Java DPL with JDK7, so DPL will now work with JDK7. * Added a flag to allow database locking to be disabled from the SQL API. * Fixed a bug that could allocate a heap data page in a region after the region creation has been undone. * Redundant whitespaces are now ignored in DB_CONFIG lines pertaining to directories, e.g. set_data_dir. * Fixed a bug that caused DB_ENV->backup to stop early if DB_BACKUP_FILES was not set and a non-DB file was in the data directory. * Fixed a rare race condition that could cause a crash if two processes opened the same database at the same time. * Fixed missing cross compiling capability for the JDBC driver. * Allow the same system/machine to host both a master and a replica database through the use of relative pathnames. * Fixed a bug in the Java API where EnvironmentConfig.setCreateDir would fail to configure the environment. * Fixed an assert failure in btreeCompare when allocating memory in the wrong thread was causing a memory leak. * Fixed a bug in the Java API where concurrent operations that change the database schema could lead to a hang. * Added JDBC code to the code base and updated the windows build files to include the JDBC solution. * Fixed a bug where the heap's region size was not getting swapped correctly in mixed-endian environments. * Fixed a bug in the db_sql_jdbc project file for vs2010 that was preventing it from building correctly.
2012-05-31 11:37:20 +02:00
DISTNAME= db-5.3.21
Berkeley DB is an embeddable database system that supports keyed access to data. The software is distributed in source code form, and developers can compile and link the source code into a single library for inclusion directly in their applications. Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: * B+tree: Stores keys in sorted order, using either a programmer-supplied ordering function or a default function that does lexicographical ordering of keys. Applications may perform equality or range searches. * Hashing: Stores records in a hash table for fast searches based on strict equality. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state. * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable or mutable, i.e., permitting new records to be inserted between existing records or requiring that new records be added only at the end of the database.
2010-06-02 14:08:48 +02:00
PKGNAME= ${DISTNAME:S/db/db5/}
CATEGORIES= databases
MASTER_SITES= http://download.oracle.com/berkeley-db/ \
http://download-uk.oracle.com/berkeley-db/
MAINTAINER= pkgsrc-users@NetBSD.org
HOMEPAGE= http://www.oracle.com/database/berkeley-db/db/index.html
COMMENT= Berkeley DB version 5 from Oracle
'The "+=" operator should only be used with lists.'
2013-04-06 21:42:41 +02:00
LICENSE= sleepycat-public
This package's licence is NOT a "modified BSD" in a common sense. Reset LICENSE, bump package revision.
2012-01-12 23:41:21 +01:00
# NOTE: it is NOT a modified BSD in a common sense:
#LICENSE=
Berkeley DB is an embeddable database system that supports keyed access to data. The software is distributed in source code form, and developers can compile and link the source code into a single library for inclusion directly in their applications. Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: * B+tree: Stores keys in sorted order, using either a programmer-supplied ordering function or a default function that does lexicographical ordering of keys. Applications may perform equality or range searches. * Hashing: Stores records in a hash table for fast searches based on strict equality. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state. * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable or mutable, i.e., permitting new records to be inserted between existing records or requiring that new records be added only at the end of the database.
2010-06-02 14:08:48 +02:00
PKG_INSTALLATION_TYPES= overwrite pkgviews
USE_LANGUAGES= c c++
USE_LIBTOOL= yes
USE_TOOLS+= pax
GNU_CONFIGURE= yes
CONFIGURE_DIRS= build_unix
CONFIGURE_SCRIPT= ../dist/configure
CONFIGURE_ARGS+= --enable-compat185
CONFIGURE_ARGS+= --enable-cxx
CONFIGURE_ARGS+= --includedir=${PREFIX}/include/db5
CONFIGURE_ARGS+= --program-transform-name=s,db_,db5_,
OPSYSVARS+= LIBSO_LIBS
LIBSO_LIBS.SunOS+= -lnsl -lrt
CONFIGURE_ENV+= LIBSO_LIBS=${LIBSO_LIBS:Q}
Changes 5.2.28: * Replication Manager now manages Group Membership. This allows sites to be added to and removed from the replication group dynamically. Replication Manager also now automatically keeps track of the group size (nsites). * Initial allocations for various non-pagebuffer (mpool) system resources may now be specified, as well as a total maximum of memory to use, rather than specifying a maximum value for each resource. * Implemented Berkeley DB globalization support architecture to enable localized and stripped error and output messages. * Added a new access method, DB_HEAP. Heap aims for efficient use (and re-use) of disk space. Keys in a heap database are automatically generated by BDB, it is recommended that one or more secondary indexes be used with a heap database. For full details on DB_HEAP, see the Programmer's Reference Guide. * Added a compatible mode for 32bit and 64bit Windows environment. * For the SQL API, concurrency between read and write transactions can now be enabled using "PRAGMA multiversion". Added several pragmas that can be used to configure the Berkeley DB datastore. * Add several new pragmas to provide in-process support for replication in the SQL API. * The Berkeley DB X/open compliant XA resource manager has been restored, including support for multi-threaded servers. * Improved the ability to recover from an application crash on connections through the SQL API. Berkeley DB will try to automatically clean up locks, mutexes and transactions from the failed process. * Add support for sequence usage in the SQL API using SQLite custom functions. * Add a pragma in the SQL API to allow execution of a cache trickle command. * Add a pragma in the SQL API to allow configuration of DB_SYSTEM_MEM environments. * The new db_env_set_win_security(SECURITY_ATTRIBUTES *) function allows an application to specify the particular Microsoft Windows security attributes to be used by Berkeley DB. This helps support applications which reduce their privileges after opening the environment.
2011-06-15 22:56:04 +02:00
CHECK_PORTABILITY_SKIP= test/xa/*/*.sh
Berkeley DB is an embeddable database system that supports keyed access to data. The software is distributed in source code form, and developers can compile and link the source code into a single library for inclusion directly in their applications. Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: * B+tree: Stores keys in sorted order, using either a programmer-supplied ordering function or a default function that does lexicographical ordering of keys. Applications may perform equality or range searches. * Hashing: Stores records in a hash table for fast searches based on strict equality. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state. * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable or mutable, i.e., permitting new records to be inserted between existing records or requiring that new records be added only at the end of the database.
2010-06-02 14:08:48 +02:00
# DB5 only want pthreads because it's really after POSIX 1003.1
# inter-process mutexes. In this case, we only care to use the native
# threads.
PTHREAD_OPTS+= native
.include "../../mk/pthread.buildlink3.mk"
Fix build of db{4,46,5} on MirBSD. The build does not create all those unnecessary shlib symlinks on MirBSD (I believe this is due to a patch I sent in years ago), so add separate PLIST.MirBSD files that do not contain these files. (BTW, I would be grateful to learn how I can achieve the same effect without copying PLISTs, but this works.)
2013-11-30 17:25:12 +01:00
.include "../../mk/bsd.prefs.mk"
Got rid of PLIST.MirBSD
2014-03-16 09:50:58 +01:00
PLIST_VARS+= shlib
.if ${OPSYS} != "MirBSD"
PLIST.shlib= yes
Fix build of db{4,46,5} on MirBSD. The build does not create all those unnecessary shlib symlinks on MirBSD (I believe this is due to a patch I sent in years ago), so add separate PLIST.MirBSD files that do not contain these files. (BTW, I would be grateful to learn how I can achieve the same effect without copying PLISTs, but this works.)
2013-11-30 17:25:12 +01:00
.endif
Berkeley DB is an embeddable database system that supports keyed access to data. The software is distributed in source code form, and developers can compile and link the source code into a single library for inclusion directly in their applications. Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: * B+tree: Stores keys in sorted order, using either a programmer-supplied ordering function or a default function that does lexicographical ordering of keys. Applications may perform equality or range searches. * Hashing: Stores records in a hash table for fast searches based on strict equality. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state. * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable or mutable, i.e., permitting new records to be inserted between existing records or requiring that new records be added only at the end of the database.
2010-06-02 14:08:48 +02:00
INSTALLATION_DIRS= include/db5 lib share/doc/db5
post-install:
chown -R ${DOCOWN}:${DOCGRP} ${DESTDIR}${PREFIX}/share/doc/db5
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink