Chris Johns 3162858a3a gdb-python: Update so 'rtems task' lists the classic tasks.
This is a first pass at cleaning up the support. To use:

 $ waf configure --prefix=$HOME/development/rtems/4.11
 $ waf build install

Start GDB and break at Init:

 (gdb) py import rtems
 (gdb) rtems task

will list the classic API tasks.
2014-08-26 14:57:57 +10:00

80 lines
2.5 KiB
Python

# RTEMS Tools Project (http://www.rtems.org/)
# Copyright 2010-2014 Chris Johns (chrisj@rtems.org)
# All rights reserved.
#
# This file is part of the RTEMS Tools package in 'rtems-tools'.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
#
# RTEMS Chains Support
#
import gdb
class node:
"""Manage the Chain_Node."""
def __init__(self, node_val):
self.node_val = node_val
def null(self):
if not self.node_val:
return True
return False
def next(self):
if not self.null():
self.node_val = self.node_val['next']
def previous(self):
if not self.null():
self.node_val = self.node_val['previous']
def cast(self, typename):
if not self.null():
nodetype = gdb.lookup_type(typename)
return self.node_val.cast(nodetype)
return None
def to_string(self):
return self.node_val['next'] + "Prev: "+self.node_val['previous']
class control:
"""Manage the Chain_Control."""
def __init__(self, ctrl):
self.ctrl = ctrl
def first(self):
t = node(self.ctrl['Head']['Node'])
return t
def last(self):
return node(self.ctrl['Tail']['Node'])
def empty(self):
if self.last() == self.first().next():
return True