1 | # RTEMS Tools Project (http://www.rtems.org/) |
---|
2 | # Copyright 2010-2014 Chris Johns (chrisj@rtems.org) |
---|
3 | # All rights reserved. |
---|
4 | # |
---|
5 | # This file is part of the RTEMS Tools package in 'rtems-tools'. |
---|
6 | # |
---|
7 | # Redistribution and use in source and binary forms, with or without |
---|
8 | # modification, are permitted provided that the following conditions are met: |
---|
9 | # |
---|
10 | # 1. Redistributions of source code must retain the above copyright notice, |
---|
11 | # this list of conditions and the following disclaimer. |
---|
12 | # |
---|
13 | # 2. Redistributions in binary form must reproduce the above copyright notice, |
---|
14 | # this list of conditions and the following disclaimer in the documentation |
---|
15 | # and/or other materials provided with the distribution. |
---|
16 | # |
---|
17 | # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
18 | # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
19 | # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
20 | # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
---|
21 | # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
22 | # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
23 | # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
24 | # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
25 | # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
26 | # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
27 | # POSSIBILITY OF SUCH DAMAGE. |
---|
28 | # |
---|
29 | |
---|
30 | # |
---|
31 | # RTEMS Chains Support |
---|
32 | # |
---|
33 | |
---|
34 | import gdb |
---|
35 | |
---|
36 | class node: |
---|
37 | """Manage the Chain_Node.""" |
---|
38 | |
---|
39 | def __init__(self, node_val): |
---|
40 | self.node_val = node_val |
---|
41 | |
---|
42 | def null(self): |
---|
43 | if not self.node_val: |
---|
44 | return True |
---|
45 | return False |
---|
46 | |
---|
47 | def next(self): |
---|
48 | if not self.null(): |
---|
49 | self.node_val = self.node_val['next'] |
---|
50 | |
---|
51 | def previous(self): |
---|
52 | if not self.null(): |
---|
53 | self.node_val = self.node_val['previous'] |
---|
54 | |
---|
55 | def cast(self, typename): |
---|
56 | if not self.null(): |
---|
57 | nodetype = gdb.lookup_type(typename) |
---|
58 | return self.node_val.cast(nodetype) |
---|
59 | return None |
---|
60 | |
---|
61 | def to_string(self): |
---|
62 | return self.node_val['next'] + "Prev: "+self.node_val['previous'] |
---|
63 | |
---|
64 | class control: |
---|
65 | """Manage the Chain_Control.""" |
---|
66 | |
---|
67 | def __init__(self, ctrl): |
---|
68 | self.ctrl = ctrl |
---|
69 | |
---|
70 | def first(self): |
---|
71 | t = node(self.ctrl['Head']['Node']) |
---|
72 | return t |
---|
73 | |
---|
74 | def last(self): |
---|
75 | return node(self.ctrl['Tail']['Node']) |
---|
76 | |
---|
77 | def empty(self): |
---|
78 | if self.last() == self.first().next(): |
---|
79 | return True |
---|