head 1.4; access; symbols pkgsrc-2023Q4:1.4.0.120 pkgsrc-2023Q4-base:1.4 pkgsrc-2023Q3:1.4.0.118 pkgsrc-2023Q3-base:1.4 pkgsrc-2023Q2:1.4.0.116 pkgsrc-2023Q2-base:1.4 pkgsrc-2023Q1:1.4.0.114 pkgsrc-2023Q1-base:1.4 pkgsrc-2022Q4:1.4.0.112 pkgsrc-2022Q4-base:1.4 pkgsrc-2022Q3:1.4.0.110 pkgsrc-2022Q3-base:1.4 pkgsrc-2022Q2:1.4.0.108 pkgsrc-2022Q2-base:1.4 pkgsrc-2022Q1:1.4.0.106 pkgsrc-2022Q1-base:1.4 pkgsrc-2021Q4:1.4.0.104 pkgsrc-2021Q4-base:1.4 pkgsrc-2021Q3:1.4.0.102 pkgsrc-2021Q3-base:1.4 pkgsrc-2021Q2:1.4.0.100 pkgsrc-2021Q2-base:1.4 pkgsrc-2021Q1:1.4.0.98 pkgsrc-2021Q1-base:1.4 pkgsrc-2020Q4:1.4.0.96 pkgsrc-2020Q4-base:1.4 pkgsrc-2020Q3:1.4.0.94 pkgsrc-2020Q3-base:1.4 pkgsrc-2020Q2:1.4.0.90 pkgsrc-2020Q2-base:1.4 pkgsrc-2020Q1:1.4.0.70 pkgsrc-2020Q1-base:1.4 pkgsrc-2019Q4:1.4.0.92 pkgsrc-2019Q4-base:1.4 pkgsrc-2019Q3:1.4.0.88 pkgsrc-2019Q3-base:1.4 pkgsrc-2019Q2:1.4.0.86 pkgsrc-2019Q2-base:1.4 pkgsrc-2019Q1:1.4.0.84 pkgsrc-2019Q1-base:1.4 pkgsrc-2018Q4:1.4.0.82 pkgsrc-2018Q4-base:1.4 pkgsrc-2018Q3:1.4.0.80 pkgsrc-2018Q3-base:1.4 pkgsrc-2018Q2:1.4.0.78 pkgsrc-2018Q2-base:1.4 pkgsrc-2018Q1:1.4.0.76 pkgsrc-2018Q1-base:1.4 pkgsrc-2017Q4:1.4.0.74 pkgsrc-2017Q4-base:1.4 pkgsrc-2017Q3:1.4.0.72 pkgsrc-2017Q3-base:1.4 pkgsrc-2017Q2:1.4.0.68 pkgsrc-2017Q2-base:1.4 pkgsrc-2017Q1:1.4.0.66 pkgsrc-2017Q1-base:1.4 pkgsrc-2016Q4:1.4.0.64 pkgsrc-2016Q4-base:1.4 pkgsrc-2016Q3:1.4.0.62 pkgsrc-2016Q3-base:1.4 pkgsrc-2016Q2:1.4.0.60 pkgsrc-2016Q2-base:1.4 pkgsrc-2016Q1:1.4.0.58 pkgsrc-2016Q1-base:1.4 pkgsrc-2015Q4:1.4.0.56 pkgsrc-2015Q4-base:1.4 pkgsrc-2015Q3:1.4.0.54 pkgsrc-2015Q3-base:1.4 pkgsrc-2015Q2:1.4.0.52 pkgsrc-2015Q2-base:1.4 pkgsrc-2015Q1:1.4.0.50 pkgsrc-2015Q1-base:1.4 pkgsrc-2014Q4:1.4.0.48 pkgsrc-2014Q4-base:1.4 pkgsrc-2014Q3:1.4.0.46 pkgsrc-2014Q3-base:1.4 pkgsrc-2014Q2:1.4.0.44 pkgsrc-2014Q2-base:1.4 pkgsrc-2014Q1:1.4.0.42 pkgsrc-2014Q1-base:1.4 pkgsrc-2013Q4:1.4.0.40 pkgsrc-2013Q4-base:1.4 pkgsrc-2013Q3:1.4.0.38 pkgsrc-2013Q3-base:1.4 pkgsrc-2013Q2:1.4.0.36 pkgsrc-2013Q2-base:1.4 pkgsrc-2013Q1:1.4.0.34 pkgsrc-2013Q1-base:1.4 pkgsrc-2012Q4:1.4.0.32 pkgsrc-2012Q4-base:1.4 pkgsrc-2012Q3:1.4.0.30 pkgsrc-2012Q3-base:1.4 pkgsrc-2012Q2:1.4.0.28 pkgsrc-2012Q2-base:1.4 pkgsrc-2012Q1:1.4.0.26 pkgsrc-2012Q1-base:1.4 pkgsrc-2011Q4:1.4.0.24 pkgsrc-2011Q4-base:1.4 pkgsrc-2011Q3:1.4.0.22 pkgsrc-2011Q3-base:1.4 pkgsrc-2011Q2:1.4.0.20 pkgsrc-2011Q2-base:1.4 pkgsrc-2011Q1:1.4.0.18 pkgsrc-2011Q1-base:1.4 pkgsrc-2010Q4:1.4.0.16 pkgsrc-2010Q4-base:1.4 pkgsrc-2010Q3:1.4.0.14 pkgsrc-2010Q3-base:1.4 pkgsrc-2010Q2:1.4.0.12 pkgsrc-2010Q2-base:1.4 pkgsrc-2010Q1:1.4.0.10 pkgsrc-2010Q1-base:1.4 pkgsrc-2009Q4:1.4.0.8 pkgsrc-2009Q4-base:1.4 pkgsrc-2009Q3:1.4.0.6 pkgsrc-2009Q3-base:1.4 pkgsrc-2009Q2:1.4.0.4 pkgsrc-2009Q2-base:1.4 pkgsrc-2009Q1:1.4.0.2 pkgsrc-2009Q1-base:1.4 pkgsrc-2008Q4:1.3.0.24 pkgsrc-2008Q4-base:1.3 pkgsrc-2008Q3:1.3.0.22 pkgsrc-2008Q3-base:1.3 cube-native-xorg:1.3.0.20 cube-native-xorg-base:1.3 pkgsrc-2008Q2:1.3.0.18 pkgsrc-2008Q2-base:1.3 cwrapper:1.3.0.16 pkgsrc-2008Q1:1.3.0.14 pkgsrc-2008Q1-base:1.3 pkgsrc-2007Q4:1.3.0.12 pkgsrc-2007Q4-base:1.3 pkgsrc-2007Q3:1.3.0.10 pkgsrc-2007Q3-base:1.3 pkgsrc-2007Q2:1.3.0.8 pkgsrc-2007Q2-base:1.3 pkgsrc-2007Q1:1.3.0.6 pkgsrc-2007Q1-base:1.3 pkgsrc-2006Q4:1.3.0.4 pkgsrc-2006Q4-base:1.3 pkgsrc-2006Q3:1.3.0.2 pkgsrc-2006Q3-base:1.3 pkgsrc-2006Q2:1.1.1.1.0.2 pkgsrc-2006Q2-base:1.1.1.1 pkgsrc-base:1.1.1.1 TNF:1.1.1; locks; strict; comment @# @; 1.4 date 2009.03.20.19.24.29; author joerg; state Exp; branches; next 1.3; 1.3 date 2006.07.08.23.10.48; author jlam; state Exp; branches; next 1.2; 1.2 date 2006.07.08.22.39.15; author jlam; state Exp; branches; next 1.1; 1.1 date 2006.05.04.09.35.33; author minskim; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2006.05.04.09.35.33; author minskim; state Exp; branches; next ; desc @@ 1.4 log @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. @ text @# $NetBSD: buildlink3.mk,v 1.3 2006/07/08 23:10:48 jlam Exp $ BUILDLINK_TREE+= sgb .if !defined(SGB_BUILDLINK3_MK) SGB_BUILDLINK3_MK:= BUILDLINK_API_DEPENDS.sgb+= sgb>=0pre20050409 BUILDLINK_PKGSRCDIR.sgb?= ../../devel/sgb .endif # SGB_BUILDLINK3_MK BUILDLINK_TREE+= -sgb @ 1.3 log @Change the format of BUILDLINK_ORDER to contain depth information as well, and add a new helper target and script, "show-buildlink3", that outputs a listing of the buildlink3.mk files included as well as the depth at which they are included. For example, "make show-buildlink3" in fonts/Xft2 displays: zlib fontconfig iconv zlib freetype2 expat freetype2 Xrender renderproto @ text @d1 1 a1 1 # $NetBSD: buildlink3.mk,v 1.2 2006/07/08 22:39:15 jlam Exp $ d3 1 a3 2 BUILDLINK_DEPTH:= ${BUILDLINK_DEPTH}+ SGB_BUILDLINK3_MK:= ${SGB_BUILDLINK3_MK}+ d5 2 a6 3 .if !empty(BUILDLINK_DEPTH:M+) BUILDLINK_DEPENDS+= sgb .endif a7 5 BUILDLINK_PACKAGES:= ${BUILDLINK_PACKAGES:Nsgb} BUILDLINK_PACKAGES+= sgb BUILDLINK_ORDER:= ${BUILDLINK_ORDER} ${BUILDLINK_DEPTH}sgb .if !empty(SGB_BUILDLINK3_MK:M+) d10 1 a10 1 .endif # SGB_BUILDLINK3_MK d12 1 a12 1 BUILDLINK_DEPTH:= ${BUILDLINK_DEPTH:S/+$//} @ 1.2 log @Track information in a new variable BUILDLINK_ORDER that informs us of the order in which buildlink3.mk files are (recursively) included by a package Makefile. @ text @d1 1 a1 1 # $NetBSD: buildlink3.mk,v 1.1.1.1 2006/05/04 09:35:33 minskim Exp $ d12 1 a12 1 BUILDLINK_ORDER+= sgb @ 1.1 log @Initial revision @ text @d1 1 a1 1 # $NetBSD$ d12 1 @ 1.1.1.1 log @Import sgb. The Stanford GraphBase is a highly portable collection of programs and data for researchers who study combinatorial algorithms and data structures. All files are in the public domain and usable with only one restriction: They must not be changed! A ``change file'' mechanism allows local customization while the master files stay intact. The programs are intended to be interesting in themselves as examples of ``literate programming.'' Thus, the Stanford GraphBase can also be regarded as a collection of approximately 30 essays for programmers to enjoy reading, whether or not they are doing algorithmic research. The programs are written in CWEB, a combination of TeX and C that is easy to use by anyone who knows those languages and easy to read by anyone familiar with the rudiments of C. @ text @@