Commit graph

6 commits

Author SHA1 Message Date
cheusov
efc47d97e0 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 10:06:02 +00:00
reed
1032395771 From PR:
pkg/42344: update for devel/libmaa [patch]

update devel/libmaa to 1.2.0.

Major changes in upstream:

  For better conformance with POSIX/SUS xmalloc, xrealloc and xcalloc
  functions take 'size_t' args, not 'unsigned int'.
  Due to change in API a major shared library number is bumped from 1 to 2

  New trivial test for log.c

  fix for sltest.c: on OpenBSD intptr_t is defined in stdint.h

  Makefile.in: GNU make is not required anymore, bsd make is enough
2009-11-19 01:19:23 +00:00
joerg
bacea7cad5 Remove @dirrm entries from PLISTs 2009-06-14 17:48:39 +00:00
darcy
0105decc39 Change MAINTAINER email address at his request. 2009-03-21 16:07:02 +00:00
joerg
2d1ba244e9 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 19:23:50 +00:00
minskim
194d7cfc85 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 00:50:20 +00:00