/*
* Process Hacker -
* ITreeModel implementation for the process tree
*
* Copyright (C) 2008-2009 wj32
*
* This file is part of Process Hacker.
*
* Process Hacker is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Process Hacker 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 Process Hacker. If not, see .
*/
using System;
using System.Collections.Generic;
using Aga.Controls.Tree;
using System.Windows.Forms;
namespace ProcessHacker
{
public class ProcessTreeModel : ITreeModel
{
private ProcessTree _tree;
private Dictionary _processes = new Dictionary();
private List _roots = new List();
public ProcessTreeModel(ProcessTree tree)
{
_tree = tree;
}
public void Add(ProcessItem item)
{
ProcessNode itemNode = new ProcessNode(item);
// find this process' parent
if (item.HasParent && _processes.ContainsKey(item.ParentPID))
_processes[item.ParentPID].Children.Add(itemNode);
else
_roots.Add(itemNode);
_processes.Add(item.PID, itemNode);
ProcessNode[] rootNodes = _roots.ToArray();
// find this process' children
foreach (ProcessNode node in rootNodes)
{
if (node.ProcessItem.HasParent && node.PPID == item.PID)
{
_roots.Remove(node);
itemNode.Children.Add(node);
}
}
this.StructureChanged(this, new TreePathEventArgs(new TreePath()));
}
public void Modify(ProcessItem oldItem, ProcessItem newItem)
{
_processes[newItem.PID].ProcessItem = newItem;
ProcessNode node = _processes[newItem.PID];
if (node.ProcessItem.HasParent && node.PPID != -1)
this.NodesChanged(this, new TreeModelEventArgs(this.GetPath(
_processes.ContainsKey(node.PPID) ? _processes[node.PPID] : null),
new object[] { node }));
}
public void Remove(ProcessItem item)
{
ProcessNode targetNode = _processes[item.PID];
ProcessNode[] nodes = _roots.ToArray();
ProcessNode[] targetChildren = null;
foreach (ProcessNode node in nodes)
{
if (node.PID == item.PID)
{
_roots.Remove(node);
this.MoveChildrenToRoot(node);
break;
}
else if (targetNode.ProcessItem.HasParent && _processes.ContainsKey(targetNode.PPID))
{
ProcessNode foundNode = _processes[targetNode.PPID];
if (foundNode != null)
{
foundNode.Children.Remove(targetNode);
targetChildren = targetNode.Children.ToArray();
this.MoveChildrenToRoot(targetNode);
break;
}
}
}
_processes.Remove(item.PID);
this.StructureChanged(this, new TreePathEventArgs(new TreePath()));
foreach (ProcessNode n in targetChildren)
{
try
{
_tree.FindTreeNode(n).ExpandAll();
}
catch
{ }
}
_tree.Invalidate();
}
public TreePath GetPath(ProcessNode node)
{
if (this.GetSortColumn() != "")
return new TreePath(node);
if (node == null)
return TreePath.Empty;
else
{
ProcessNode currentNode = node;
Stack stack = new Stack();
while (true)
{
stack.Push(currentNode);
if (currentNode.ProcessItem.HasParent && _processes.ContainsKey(currentNode.PPID))
{
ProcessNode newNode = _processes[currentNode.PPID];
if (newNode == currentNode)
break;
currentNode = newNode;
}
else
{
break;
}
}
return new TreePath(stack.ToArray());
}
}
public void MoveChildrenToRoot(ProcessNode node)
{
ProcessNode[] children = node.Children.ToArray();
_roots.AddRange(children);
}
public Dictionary Nodes
{
get { return _processes; }
}
public string GetSortColumn()
{
foreach (TreeColumn column in _tree.Tree.Columns)
if (column.SortOrder != SortOrder.None)
return column.Header.ToLower();
return "";
}
public SortOrder GetSortOrder()
{
foreach (TreeColumn column in _tree.Tree.Columns)
if (column.SortOrder != SortOrder.None)
return column.SortOrder;
return SortOrder.None;
}
public int ModifySort(int sortResult, SortOrder order)
{
if (order == SortOrder.Ascending)
return sortResult * -1;
else if (order == SortOrder.Descending)
return sortResult;
else
return 0;
}
public System.Collections.IEnumerable GetChildren(TreePath treePath)
{
if (this.GetSortColumn() != "")
{
List nodes = new List();
string sortC = this.GetSortColumn();
SortOrder sortO = this.GetSortOrder();
nodes.AddRange(_processes.Values);
nodes.Sort(new Comparison(delegate(ProcessNode n1, ProcessNode n2)
{
if (sortC == "name")
return ModifySort(n1.Name.CompareTo(n2.Name), sortO);
else if (sortC == "pid")
return ModifySort(n1.PID.CompareTo(n2.PID), sortO);
else if (sortC == "pvt. memory")
return ModifySort(n1.ProcessItem.MemoryUsage.CompareTo(n2.ProcessItem.MemoryUsage), sortO);
else if (sortC == "cpu")
return ModifySort(n1.ProcessItem.CPUUsage.CompareTo(n2.ProcessItem.CPUUsage), sortO);
else if (sortC == "username")
return ModifySort(n1.Username.CompareTo(n2.Username), sortO);
else if (sortC == "description")
return ModifySort(n1.Description.CompareTo(n2.Description), sortO);
else
return 0;
}));
return nodes;
}
if (treePath.IsEmpty())
return _roots;
else
return (treePath.LastNode as ProcessNode).Children;
}
public bool IsLeaf(TreePath treePath)
{
if (this.GetSortColumn() != "")
return true;
if (treePath.IsEmpty())
return false;
else
return (treePath.LastNode as ProcessNode).Children.Count == 0;
}
public event EventHandler NodesChanged;
public event EventHandler NodesInserted;
public event EventHandler NodesRemoved;
public event EventHandler StructureChanged;
public void CallStructureChanged(TreePathEventArgs args)
{
this.StructureChanged(this, args);
}
}
}