|
|
1.1 root 1: function neigh_state(f) {
2: if (f in states)
3: return states[f];
4:
5: return (f ? f : "unknown");
6: }
7:
8: function neigh_mode(f) {
9: if (f in modes)
10: return modes[f];
11:
12: return (f ? f : "unknown");
13: }
14:
15: function neigh_trigger(f) {
16: if (f in triggers)
17: return triggers[f];
18:
19: return (f ? f : "unknown");
20: }
21:
22: BEGIN {
23: states[1] = "Idle";
24: states[2] = "Acquisition";
25: states[3] = "Down";
26: states[4] = "Up";
27: states[5] = "Cease";
28:
29: modes[1] = "Active";
30: modes[2] = "Passive";
31:
32: triggers[1] = "Start";
33: triggers[2] = "Stop";
34:
35: mibii = 0;
36: didone = 0;
37: for (i in egpInMsgs) {
38: didone = 1;
39: if (egpAs) {
40: mibii = 1;
41: }
42:
43: printf "\n";
44:
45: if (mibii)
46: printf "\tAutonomous system %d\n\n", egpAs;
47:
48: printf "%10s %10s %10s\n",
49: "",
50: "In",
51: "Out";
52: printf "%10s %10d %10d\n",
53: "Messages",
54: egpInMsgs,
55: egpOutMsgs;
56: printf "%10s %10d %10d\n",
57: "Errors",
58: egpInErrors,
59: egpOutErrors;
60: }
61: if (!didone && DIAGNOSTIC)
62: printf "egp group: %s\n", DIAGNOSTIC;
63:
64: printf "\n"
65:
66: printf "%15s %11s",
67: "Neighbor",
68: "State";
69:
70: if (mibii)
71: printf " %5s %7s %6s %6s %6s\n",
72: "AS",
73: "Mode",
74: "Trigger",
75: "Hello",
76: "Poll";
77:
78:
79: else
80: printf "\n";
81:
82: didone = 0;
83: for (i in egpNeighAddr) {
84: didone = 1;
85:
86: printf "%15s %11s",
87: egpNeighAddr,
88: neigh_state(egpNeighState);
89: if (mibii)
90: printf " %5d %7s %6s %6d %6d\n",
91: egpNeighAs,
92: neigh_mode(egpNeighMode),
93: neigh_trigger(egpNeighEventTrigger),
94: egpNeighIntervalHello,
95: egpNeighIntervalPoll;
96: else
97: printf "\n";
98: }
99: if (!didone && DIAGNOSTIC)
100: printf "egpNeigh group: %s\n", DIAGNOSTIC;
101:
102: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.