MibTree.cs 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. using System.Collections.Generic;
  2. using Lextm.SharpSnmpLib.Mib.Elements.Entities;
  3. namespace Lextm.SharpSnmpLib.Mib
  4. {
  5. /// <summary>
  6. /// Builds up a tree from a single MIB
  7. /// </summary>
  8. public class MibTree
  9. {
  10. private readonly List<MibTreeNode> _root = new List<MibTreeNode>();
  11. public MibTree(MibModule module)
  12. {
  13. IList<IEntity> entities = module.Entities;
  14. if (entities.Count > 0)
  15. {
  16. // try to find module identity as root
  17. foreach (IEntity element in entities)
  18. {
  19. ModuleIdentity mi = element as ModuleIdentity;
  20. if (mi != null)
  21. {
  22. _root.Add(new MibTreeNode(null, mi));
  23. }
  24. }
  25. // find OID assignments as root, if there are any that are not below ModuleIdentity
  26. foreach (IEntity element in entities)
  27. {
  28. OidValueAssignment oa = element as OidValueAssignment;
  29. if (oa != null)
  30. {
  31. _root.Add(new MibTreeNode(null, oa));
  32. }
  33. }
  34. FilterRealRoots (entities);
  35. foreach (MibTreeNode mibTreeNode in _root)
  36. {
  37. entities.Remove (mibTreeNode.Entity);
  38. }
  39. if (_root.Count == 0)
  40. {
  41. //no module identity, assume first entity is root
  42. _root.Add(new MibTreeNode(null, entities[0]));
  43. }
  44. foreach (MibTreeNode mibTreeNode in _root)
  45. {
  46. if (entities.Contains (mibTreeNode.Entity))
  47. {
  48. entities.Remove (mibTreeNode.Entity);
  49. }
  50. BuildTree(mibTreeNode, entities);
  51. UpdateTreeNodeTypes(mibTreeNode);
  52. }
  53. }
  54. }
  55. public IList<MibTreeNode> Root
  56. {
  57. get { return _root; }
  58. }
  59. private bool EntityExists(IList<IEntity> entities, string name)
  60. {
  61. foreach(IEntity entity in entities)
  62. {
  63. if (entity.Name == name)
  64. {
  65. return true;
  66. }
  67. }
  68. return false;
  69. }
  70. private void FilterRealRoots(IList<IEntity> entities)
  71. {
  72. int i = 0;
  73. while (i < _root.Count)
  74. {
  75. if (EntityExists(entities, _root[i].Entity.Parent))
  76. {
  77. _root.RemoveAt(i);
  78. }
  79. else
  80. {
  81. i++;
  82. }
  83. }
  84. }
  85. private void BuildTree(MibTreeNode node, IList<IEntity> entities)
  86. {
  87. int i = 0;
  88. while (i < entities.Count)
  89. {
  90. if (entities[i].Parent == node.Entity.Name)
  91. {
  92. node.AddChild(entities[i]);
  93. entities.RemoveAt(i);
  94. }
  95. else
  96. {
  97. i++;
  98. }
  99. }
  100. foreach (MibTreeNode childNode in node.ChildNodes)
  101. {
  102. BuildTree(childNode, entities);
  103. }
  104. }
  105. private void UpdateTreeNodeTypes(MibTreeNode node)
  106. {
  107. node.UpdateNodeType();
  108. foreach (MibTreeNode childNode in node.ChildNodes)
  109. {
  110. UpdateTreeNodeTypes(childNode);
  111. }
  112. }
  113. }
  114. }