From owner-freebsd-ports@FreeBSD.ORG Sat Dec 1 22:49:34 2007 Return-Path: Delivered-To: freebsd-ports@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id D14B316A41B for ; Sat, 1 Dec 2007 22:49:34 +0000 (UTC) (envelope-from aryeh.friedman@gmail.com) Received: from py-out-1112.google.com (py-out-1112.google.com [64.233.166.177]) by mx1.freebsd.org (Postfix) with ESMTP id 827D013C46B for ; Sat, 1 Dec 2007 22:49:34 +0000 (UTC) (envelope-from aryeh.friedman@gmail.com) Received: by py-out-1112.google.com with SMTP id u77so5907650pyb for ; Sat, 01 Dec 2007 14:49:33 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:user-agent:mime-version:to:cc:subject:references:in-reply-to:x-enigmail-version:openpgp:content-type:content-transfer-encoding; bh=f9kvbZ0mdtrUpso/WdMon8Sgmr+TlRxkUeggJQyjBXo=; b=j7bkY+cc4BREPMTdIdgV7ADasX7vXgRxPOUSLyDuFgyvSn7sZHlqGnO/2xW42GMxZ3CIk8Bg/3+K0aCIcVqFHGQpnF62VbYUoeVY8jzoyk2BSfaeBsFGlOnSFLhMk8gZcTMzrQU77pQ4GUYFhxXuMEr1+FYLxqWojJPemacjNB4= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=received:message-id:date:from:user-agent:mime-version:to:cc:subject:references:in-reply-to:x-enigmail-version:openpgp:content-type:content-transfer-encoding; b=DEbm7Ez7siLzTJcMSr+ZFqnTHeFeNrA1ZJix4SKv3ULRfAYYbEb7iUfP2Qk2k0xcTdNM7CLvvJJ3L4eaHcjFOEDsmBfk3t5i2F4HKKvm56EmkXmYQ9slrDKcpzxRVj5QRI9t9iO6+Dx4/j7/XlE3SxPHcE4fvYNSL4uDGUwn6/Y= Received: by 10.64.243.10 with SMTP id q10mr11148775qbh.1196549372903; Sat, 01 Dec 2007 14:49:32 -0800 (PST) Received: from ?192.168.2.2? ( [67.85.89.184]) by mx.google.com with ESMTPS id f15sm5907768qba.2007.12.01.14.49.31 (version=TLSv1/SSLv3 cipher=RC4-MD5); Sat, 01 Dec 2007 14:49:32 -0800 (PST) Message-ID: <4751E4F3.9010603@gmail.com> Date: Sat, 01 Dec 2007 17:49:23 -0500 From: "Aryeh M. Friedman" User-Agent: Thunderbird 2.0.0.9 (X11/20071129) MIME-Version: 1.0 To: Peter Jeremy References: <20071201204245.GA57218@lpthe.jussieu.fr> <4751CDB6.7040505@gmail.com> <20071201221533.GU50167@server.vk2pj.dyndns.org> In-Reply-To: <20071201221533.GU50167@server.vk2pj.dyndns.org> X-Enigmail-Version: 0.95.5 OpenPGP: url= Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Cc: freebsd-ports@freebsd.org Subject: Re: duration of the ports freeze X-BeenThere: freebsd-ports@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: Porting software to FreeBSD List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 01 Dec 2007 22:49:34 -0000 -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Peter Jeremy wrote: > On Sat, Dec 01, 2007 at 04:10:14PM -0500, Aryeh M. Friedman wrote: >> This is due to thinking of the port system as one would of as say >> make(1) namely a multistage transaction vs. one big atomic >> transaction. Doing first makes each port responible for most it's >> knowledge and thus open to inconsistencies and the other makes so the >> port is nothing but a node in a graph with the edges holding most of >> the knowledge instead of the nodes. > > You continue to complain that the current dependency system is broken > but you have yet to provide an alternative. Right off the top my head a simple DFS or topo sort with approriate knowledge in the edges would suffice. > >> If there was a universal way of handling stuff as recommended in >> Miller97 and most decent algorithm books. > > You also regularly references to Aegis - again with no explanation as > to what problem Aegis would solve and how it would solve it. I recall > hearing Peter Miller present his paper at AUUG'97 and I know I was > interested enough at the time to install and experiment with Aegis but > (for reasons I don't recall any longer), I have since reverted to make. First of all he was refering to cook not aegis (aegis is his alternative to CVS). I stopped using also because the scripting language is really badlly layed out semantically (basically he tried to get a functional language into the syntax of an imparative one). Other then that it is actual quite good. The altenrative is unlike make which does basically this: select some target check all dependancies on the target recursivally using this algorithm if all depends are uptodate bring the target up to date This has the weaknesses offered in the paper and other large recursive single node graph processors... yes they can solve a maze but only by trial and error instead of attempting essentially an all paths solution before selecting the optimal one (namely a well made cook project guarantees the spanning tree in all cases where make almost guarantees a non-span tree for any non-trivial source tree)... a careful read of Rivest-Korman-et. al. chapter on graphs will show the same conculsion... for a quick and dirty guide on cook read the tutorial I wrote on the cook site (Peter's main site not the aegis one) - -- Aryeh M. Friedman FloSoft Systems Developer, not business, friendly http://www.flosoft-systems.com -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.4 (FreeBSD) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHUeTz358R5LPuPvsRAuxxAJ0coFqpc7wyX9+k7rGLNPwxLxgU/gCeKYTZ YQ+1nd5ttJPoYfIrXPKUWRg= =MbCp -----END PGP SIGNATURE-----