- Timestamp:
- 11/03/2015 09:53:34 PM (9 years ago)
- Branches:
- 2.4, ablfs-more, legacy, new_features, trunk
- Children:
- 1670a20
- Parents:
- e4b1293
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
BLFS/libs/func_dependencies
re4b1293 r7f9fa78 8 8 # tree. Everything would be "simple" without circular dependencies. We # 9 9 # would just have to build the tree using the packages.xml file, and to # 10 # a function for browsing it. But we need to be able to detect circular#11 # dependencies and to possibly change the tree depending on the user#12 # decision. This is why we keep with each node a record of the path from#13 # the root to the node, which we call *link*.#10 # provide a function for browsing it. But we need to be able to detect # 11 # circular dependencies and to possibly change the tree depending on the # 12 # user # decision. This is why we keep with each node a record of the path # 13 # from the root to the node, which we call *link*. # 14 14 # Layout of the tree: # 15 15 # Each node is a file <nodeName>.dep, which contains the names of the # … … 43 43 function: Create a subtree of the dependency tree 44 44 (recursive function) 45 input vars: $1 : file with a list of targets 45 input vars: $1 : file with a list of targets (child nodes) 46 46 the first line of the file is the link 47 47 externals: vars: BLFS_XML 48 48 DEP_LEVEL 49 modifies: vars: exchange_triplet cointains the triplet when return is 150 49 returns: 0 if the tree has been successfully created 51 50 1 if we are backing up to the parent of a circular dep 51 modifies: vars: exchange_triplet contains the triplet when return is 1 52 52 output: files: for each <pkg> with dependencies in $1, 53 53 a file <pkg>.dep and its dependencies
Note:
See TracChangeset
for help on using the changeset viewer.