Date: Tue, 26 Sep 1995 03:33:42 -0400 From: Coranth Gryphon <gryphon@healer.com> To: jdl@chromatic.com Cc: hackers@freebsd.org Subject: Re: ports startup scripts Message-ID: <199509260733.DAA16047@healer.com>
next in thread | raw e-mail | index | archive | help
From: Jon Loeliger <jdl@chrome.onramp.net>
> Well, I think these issues point to the more generalized problem
> of simply representing the "dependency graph". All of the file number
Yep. The underlying framework is the same, it comes down to how
to control sequence.
> Can we have a more abstract representation of that dependency graph?
> Then, either at like, install or boot time (ick) a topological sort is
> done on the graph and the script/script-fragment is linearly ordered
Interesting.
> The algorithm is data driven based on package parts supplied during
> the install and a well-defined although not necessarily unique ordering
Solves a lot of the static config issues.
> There are issues here still, like, how do you state dependencies against
> things that have yet to be invented? I think that's why fictitious or
> virtual nodes may be needed in the graph too. They can essentially
> arbitrarily represent the "levels" or "states" in the graph where
> certain properties are available ("NFS", "LAN", "WAN", "Single User").
Solves the dependencies problems if a specification can be coded.
> Tip-toeing back out of the warzone,
Nope, get back in here :-) This sounds like a really good idea.
So, how would you go about implementing such a dependency graph?
-coranth
------------------------------------------+------------------------+
Coranth Gryphon <gryphon@healer.com> | "Faith Manages." |
| - Satai Delenn |
Phone: 603-598-3440 Fax: 603-598-3430 +------------------------+
USMail: 3 Hansom Drive, Merrimack, NH 03054
Disclaimer: All these words are yours, except Europa...
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199509260733.DAA16047>