Gecko [ dallasfobana2023.variationbd.com ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
__init__.py	0 B	-rw-r--r--
capabilities.py	7.28 KB	-rw-r--r--
cldetect.py	2.97 KB	-rw-r--r--
clientCaps.py	2.16 KB	-rw-r--r--
clpwd.py	3.56 KB	-rw-r--r--
config.py	12.5 KB	-rw-r--r--
debUtils.py	2.73 KB	-rw-r--r--
getMethod.py	4.2 KB	-rw-r--r--
haltree.py	4.53 KB	-rw-r--r--
hardware.py	31.91 KB	-rw-r--r--
hardware_gudev.py	12.89 KB	-rw-r--r--
hardware_hal.py	11.32 KB	-rw-r--r--
hardware_udev.py	12.99 KB	-rw-r--r--
pkgUtils.py	295 B	-rw-r--r--
pkgplatform.py	309 B	-rw-r--r--
pmPlugin.py	2.79 KB	-rw-r--r--
rhnChannel.py	4.4 KB	-rw-r--r--
rhnHardware.py	328 B	-rw-r--r--
rhnPackageInfo.py	2.21 KB	-rw-r--r--
rhncli.py	9.12 KB	-rw-r--r--
rhnreg.py	32.72 KB	-rw-r--r--
rhnreg_constants.py	18.13 KB	-rw-r--r--
rhnserver.py	8.66 KB	-rw-r--r--
rpcServer.py	10.96 KB	-rw-r--r--
rpmUtils.py	5.2 KB	-rw-r--r--
transaction.py	4.09 KB	-rw-r--r--
tui.py	43.7 KB	-rw-r--r--
up2dateAuth.py	9.29 KB	-rw-r--r--
up2dateErrors.py	10.26 KB	-rw-r--r--
up2dateLog.py	2.06 KB	-rw-r--r--
up2dateUtils.py	5.06 KB	-rw-r--r--

Code Editor : haltree.py

# HalTree Purpose:
#
# HalTree is a way to organize the mess of data you get from hal.  In general,
# if you want to get all the information about every device in the system, you
# end up with a list of dicts, where each dict contains the property name/values
# for a device.  This list isn't very useful as the hal data is actually
# organized into a tree.  For example, you have the computer as the head, then
# there may be a scsi card plugged in.  That in turn will have scsi channels
# and luns, which scsi devices may be connected to.  So this module will help
# you reorganize your hal data back to the way they were intended.
#
# HalTree Usage:
#
# The tree gets built one device at a time.  Once you've created a HalTree
# object, devices get added to the tree with HalTree.add(hw_dev_dict).  The
# devices can be added in any particular order, and the tree gets properly
# structured as the devices get added.  But the tree structure isn't likely
# to be ready until all the devices have been added.  Those devices without a
# parent get stuck in the no_parent_yet list.
#
# When a device gets added, it is no longer a plain dict.  It is stored in a
# HalDevice.  The original dict can be found in HalDevice.properties.

try: # python2
    from types import StringType, IntType
except ImportError: # python3
    StringType = bytes
    IntType = int

class HalDevice:
    "An object containing its udi, properties and children"
    def __init__ (self, properties):
        self.udi = properties['info.udi']

self.properties = properties
        self.children = []
        self.classification = None

if 'info.parent' in properties:
            self.parent_udi = properties['info.parent']
        else:
            self.parent_udi = None

self.parent = None

def print_properties(self):
        print(self.udi, ":")
        for property, value in self.properties.items():
            print("    ", property," ==> ",  value)

class HalTree:
    def __init__ (self):
        self.head = None
        self.no_parent_yet = []

def add(self, hal_device):
        if hal_device.parent_udi:
            parent = self.__find_node(hal_device.parent_udi)
            if parent:
                parent.children.append(hal_device)
                hal_device.parent = parent
            else:  #parent isn't in the main tree yet, stick it in waiting
                self.no_parent_yet.append(hal_device)
        else: #if it doesn't have a parent, it must be the head 'computer'
            self.head = hal_device

#check to see if there are any children waiting for this dev
        self.__get_lost_children(hal_device)

def __get_lost_children(self, hal_device):
        found_list = []
        indexes = []
        no_parent_yet_copy = self.no_parent_yet[:]
        for dev in no_parent_yet_copy:
            if dev.parent_udi == hal_device.udi:
                dev.parent = hal_device
                hal_device.children.append(dev)
                self.no_parent_yet.remove(dev)

def __find_node(self, udi):
        """
        This takes a node in the HalDevice tree and returns the HalDevice with
        the given udi.
        """
        if self.head:
            node = HalTree.__find_node_worker(self.head, udi)
            if node:
                return node

for node in self.no_parent_yet:
            found_node = HalTree.__find_node_worker(node, udi)
            if found_node:
                return found_node
        return None

@staticmethod
    def __find_node_worker(node, udi):
        if node.udi == udi:
            return node
        for device in node.children:
            res = HalTree.__find_node_worker(device, udi)
            if res:
                return res
        return None

def print_tree(self):
        self.__print_dev_tree(self.head, "")

def __print_dev_tree(self, node, indent):
        print(indent, node.udi)
        print(indent, "CLASS:", node.classification)
        for name, property in node.properties.items():
            if (type(property) == StringType):
                if property.isdigit():
                    print(indent + "    ", "%-20s ==> %s" % (name, hex(int(property))))
                else:
                    print(indent + "    ", "%-20s ==> %s" % (name, property))
            elif (type(property) == IntType):
                print(indent + "    ", "%-20s ==> %s" % (name, hex(int(property))))
            else:
                print(indent + "    ", "%-20s ==> %s" % (name, property))
        print
        for child in node.children:
            self.__print_dev_tree(child, indent + "    ")

${this.title}

Code Editor : haltree.py