kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/libmaa/buildlink3.mk

13 lines
299 B
Makefile
Raw Normal View History

Closes PR pkg/44850, oked by wiz@ and reed@ devel/libmaa updated to 1.3.0 recursive bump pkgrevisions of dependent packages due to ABI change
2011-05-07 12:06:02 +02:00
# $NetBSD: buildlink3.mk,v 1.4 2011/05/07 10:06:02 cheusov Exp $
Import libmaa-1.1.0 from pkgsrc-wip. Packaged by Aleksey Cheusov. The LIBMAA library provides many low-level data structures which are helpful for writing compilers, including hash tables, sets, lists, debugging support, and memory management. Although LIBMAA was designed and implemented as a foundation for the Khepera Transformation System, the data structures are generally applicable to a wide range of programming problems. The memory management routines are especially helpful for improving the performance of memory-intensive applications.
2009-03-12 01:50:20 +01:00
Simply and speed up buildlink3.mk files and processing. This changes the buildlink3.mk files to use an include guard for the recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS, BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of enter/exit marker, which can be used to reconstruct the tree and to determine first level includes. Avoiding := for large variables (BUILDLINK_ORDER) speeds up parse time as += has linear complexity. The include guard reduces system time by avoiding reading files over and over again. For complex packages this reduces both %user and %sys time to half of the former time.
2009-03-20 20:23:50 +01:00
BUILDLINK_TREE+= libmaa
Import libmaa-1.1.0 from pkgsrc-wip. Packaged by Aleksey Cheusov. The LIBMAA library provides many low-level data structures which are helpful for writing compilers, including hash tables, sets, lists, debugging support, and memory management. Although LIBMAA was designed and implemented as a foundation for the Khepera Transformation System, the data structures are generally applicable to a wide range of programming problems. The memory management routines are especially helpful for improving the performance of memory-intensive applications.
2009-03-12 01:50:20 +01:00
Simply and speed up buildlink3.mk files and processing. This changes the buildlink3.mk files to use an include guard for the recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS, BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of enter/exit marker, which can be used to reconstruct the tree and to determine first level includes. Avoiding := for large variables (BUILDLINK_ORDER) speeds up parse time as += has linear complexity. The include guard reduces system time by avoiding reading files over and over again. For complex packages this reduces both %user and %sys time to half of the former time.
2009-03-20 20:23:50 +01:00
.if !defined(LIBMAA_BUILDLINK3_MK)
LIBMAA_BUILDLINK3_MK:=
Import libmaa-1.1.0 from pkgsrc-wip. Packaged by Aleksey Cheusov. The LIBMAA library provides many low-level data structures which are helpful for writing compilers, including hash tables, sets, lists, debugging support, and memory management. Although LIBMAA was designed and implemented as a foundation for the Khepera Transformation System, the data structures are generally applicable to a wide range of programming problems. The memory management routines are especially helpful for improving the performance of memory-intensive applications.
2009-03-12 01:50:20 +01:00
Closes PR pkg/44850, oked by wiz@ and reed@ devel/libmaa updated to 1.3.0 recursive bump pkgrevisions of dependent packages due to ABI change
2011-05-07 12:06:02 +02:00
BUILDLINK_API_DEPENDS.libmaa+= libmaa>=1.3.0
Import libmaa-1.1.0 from pkgsrc-wip. Packaged by Aleksey Cheusov. The LIBMAA library provides many low-level data structures which are helpful for writing compilers, including hash tables, sets, lists, debugging support, and memory management. Although LIBMAA was designed and implemented as a foundation for the Khepera Transformation System, the data structures are generally applicable to a wide range of programming problems. The memory management routines are especially helpful for improving the performance of memory-intensive applications.
2009-03-12 01:50:20 +01:00
BUILDLINK_PKGSRCDIR.libmaa?= ../../devel/libmaa
Simply and speed up buildlink3.mk files and processing. This changes the buildlink3.mk files to use an include guard for the recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS, BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of enter/exit marker, which can be used to reconstruct the tree and to determine first level includes. Avoiding := for large variables (BUILDLINK_ORDER) speeds up parse time as += has linear complexity. The include guard reduces system time by avoiding reading files over and over again. For complex packages this reduces both %user and %sys time to half of the former time.
2009-03-20 20:23:50 +01:00
.endif # LIBMAA_BUILDLINK3_MK
Import libmaa-1.1.0 from pkgsrc-wip. Packaged by Aleksey Cheusov. The LIBMAA library provides many low-level data structures which are helpful for writing compilers, including hash tables, sets, lists, debugging support, and memory management. Although LIBMAA was designed and implemented as a foundation for the Khepera Transformation System, the data structures are generally applicable to a wide range of programming problems. The memory management routines are especially helpful for improving the performance of memory-intensive applications.
2009-03-12 01:50:20 +01:00
Simply and speed up buildlink3.mk files and processing. This changes the buildlink3.mk files to use an include guard for the recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS, BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of enter/exit marker, which can be used to reconstruct the tree and to determine first level includes. Avoiding := for large variables (BUILDLINK_ORDER) speeds up parse time as += has linear complexity. The include guard reduces system time by avoiding reading files over and over again. For complex packages this reduces both %user and %sys time to half of the former time.
2009-03-20 20:23:50 +01:00
BUILDLINK_TREE+= -libmaa
Reference in a new issue Copy permalink