/usr/lib/python2.7/dist-packages/rekall/plugins/linux/pstree.py is in python-rekall-core 1.6.0+dfsg-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | # This file is part of Rekall Memory Forensics.
# Copyright (C) 2007-2013 Volatility Foundation
# Copyright 2013 Google Inc. All Rights Reserved.
#
# Rekall Memory Forensics is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License Version 2 as
# published by the Free Software Foundation. You may not use, modify or
# distribute this program under any other version of the GNU General
# Public License.
#
# Rekall Memory Forensics is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with Rekall Memory Forensics. If not, see <http://www.gnu.org/licenses/>.
#
"""
@author: Andrew Case
@license: GNU General Public License 2.0
@contact: atcuno@gmail.com
@organization:
"""
from rekall.plugins.linux import common
class LinPSTree(common.LinuxPlugin):
"""Shows the parent/child relationship between processes.
This plugin prints a parent/child relationship tree by walking the
task_struct.children and task_struct.sibling members.
"""
__name = "pstree"
def render(self, renderer):
renderer.table_header([("Pid", "pid", ">6"),
("Ppid", "ppid", ">6"),
("Uid", "uid", ">6"),
("", "depth", "0"),
("Name", "name", "<30"),
])
root_task = self.profile.get_constant_object(
"init_task", target="task_struct")
for task, level in self.recurse_task(root_task, 0):
renderer.table_row(
task.pid, task.parent.pid, task.uid,
"." * level, task.commandline)
def recurse_task(self, task, level):
"""Yields all the children of this task."""
yield task, level
for child in task.children.list_of_type("task_struct", "sibling"):
for subtask, sublevel in self.recurse_task(child, level + 1):
yield subtask, sublevel
|