Jump to content
  • 0
daemonbsd56

Source code dependency resolving algorithm

Question

Hello everybody,

Could somebody give me some hints finding a detailed howto /eventually the git page about the algorithm used by Funtoo/Gentoo. I'd like to understand the way it calculates the dependency resolution.

As far as i can understand, this is made during the emerge -(p)vDuna @world option. Am i right if i am saying this is done through the root/trunk/leave node dependency calculation (written in python?).

Share this post


Link to post
Share on other sites

2 answers to this question

Recommended Posts

  • 1

Yes -- the current code is fairly convoluted. It uses a depgraph to build up a dependency tree and then starts with the leaf nodes and works its way up the tree. The source code is here:

https://github.com/gentoo/portage/blob/master/pym/_emerge/depgraph.py

I've begun working on adding clearer documentation to the code but there is a lot more work to do on that front.

Share this post


Link to post
Share on other sites
  • 0

Thanks a lot Daniel. It will help me a lot understanding the Gentoo basics and certainly the Funtoo evolution to kits. I am just astonished about the packaging management behind those systems. It 's just fun and rock proof for managing a linux system. Combined with LFS as learning tool , it allowed me to better understand Gentoo and now Funtoo.

Cheers. :) 

Share this post


Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.


×
×
  • Create New...