def IIIII11I1IiI(ddt_entry, output):
i1I = ddt_entry.print_eid_tuple()
OoOO = ddt_entry.map_referrals_sent
if 53 - 53: Oo0Ooo
if (ddt_entry.is_auth_prefix()):
output += lispconfig.lisp_table_row(i1I, "--", "auth-prefix", "--",
OoOO)
return ([True, output])
if 29 - 29: I1ii11iIi11i + oO0o % O0
if 10 - 10: I11i / I1Ii111 - I1IiiI * iIii1I11I1II1 - I1IiiI
for OOoo0O0 in ddt_entry.delegation_set:
OO0oO0 = OOoo0O0.delegate_address
O00OOOOOoo0 = str(OOoo0O0.priority) + "/" + str(OOoo0O0.weight)
output += lispconfig.lisp_table_row(i1I, OO0oO0.print_address_no_iid(),
OOoo0O0.print_node_type(),
O00OOOOOoo0, OoOO)
if (i1I != ""):
i1I = ""
OoOO = ""
if 49 - 49: O0.iII111i
if 11 - 11: IiII * I1IiiI.iIii1I11I1II1 % OoooooooOO + iII111i
return ([True, output])
if 78 - 78: OoO0O00.OOooOOo + OoO0O00 / I11i / OoO0O00
if 54 - 54: OoOoOO00 % iII111i
if 37 - 37: OoOoOO00 * Oo0Ooo / ooOoO0o - iII111i % II111iiii.oO0o
if 88 - 88: iII111i.II111iiii * II111iiii % I1Ii111
if 15 - 15: i1IIi * I1IiiI + i11iIiiIii
if 6 - 6: ooOoO0o / i11iIiiIii + iII111i * oO0o
if 80 - 80: II111iiii
if 83 - 83: I11i.i11iIiiIii + II111iiii.o0oOOo0O0Ooo * I11i
def ii(ddt_entry, output):
oOooOOOoOo = ddt_entry.print_eid_tuple()
i1Iii1i1I = ddt_entry.map_referrals_sent
if 91 - 91: I1ii11iIi11i + I1IiiI.OOooOOo * I1ii11iIi11i + I1IiiI * Oo0Ooo
if (ddt_entry.is_auth_prefix()):
output += lispconfig.lisp_table_row(oOooOOOoOo, "--", "auth-prefix",
"--", i1Iii1i1I)
return ([True, output])
if 80 - 80: iII111i % OOooOOo % oO0o - Oo0Ooo + Oo0Ooo
if 19 - 19: OoOoOO00 * i1IIi
for i1 in ddt_entry.delegation_set:
ii111iI1iIi1 = i1.delegate_address
OOO = str(i1.priority) + "/" + str(i1.weight)
output += lispconfig.lisp_table_row(
oOooOOOoOo, ii111iI1iIi1.print_address_no_iid(),
i1.print_node_type(), OOO, i1Iii1i1I)
if (oOooOOOoOo != ""):
oOooOOOoOo = ""
i1Iii1i1I = ""
if 68 - 68: II111iiii + I11i
if 45 - 45: iII111i / iII111i + I1Ii111 + ooOoO0o
return ([True, output])
if 47 - 47: o0oOOo0O0Ooo + ooOoO0o
if 82 - 82: II111iiii.IiII - iIii1I11I1II1 - IiII * II111iiii
if 77 - 77: iIii1I11I1II1 * OoO0O00
if 95 - 95: I1IiiI + i11iIiiIii
if 6 - 6: ooOoO0o / i11iIiiIii + iII111i * oO0o
if 80 - 80: II111iiii
if 83 - 83: I11i.i11iIiiIii + II111iiii.o0oOOo0O0Ooo * I11i
if 53 - 53: II111iiii
def oOOo0(ref, output):
if 54 - 54: O0 - IiII % OOooOOo
OOoO = lisp.lisp_print_elapsed(ref.uptime)
iII = lisp.lisp_print_future(ref.expires)
ii1ii11IIIiiI = ref.print_eid_tuple()
if 67 - 67: I11i * oO0o * I1ii11iIi11i + OOooOOo / i1IIi
I1I111 = "configured" if (ref.referral_source.not_set(
)) else ref.referral_source.print_address_no_iid()
if 82 - 82: i11iIiiIii - iII111i * OoooooooOO / I11i
if 31 - 31: IiII.OoO0O00 - iIii1I11I1II1
ooOOO00Ooo = "--"
if (ref.eid.is_ultimate_root()):
IiIIIi1iIi = "root"
elif (I1I111 == "configured"):
IiIIIi1iIi = "any"
else:
IiIIIi1iIi = ref.print_referral_type()
if (ref.is_referral_negative()):
IiIIIi1iIi = lisp.red(IiIIIi1iIi, True)
if 68 - 68: i11iIiiIii % I1ii11iIi11i + i11iIiiIii
ooOOO00Ooo = "{}<br>{}".format(iII, str(ref.referral_ttl / 60))
if 31 - 31: II111iiii.I1IiiI
if 1 - 1: Oo0Ooo / o0oOOo0O0Ooo % iII111i * IiII.i11iIiiIii
if (len(ref.referral_set) == 0):
output += lispconfig.lisp_table_row(ii1ii11IIIiiI, OOoO, ooOOO00Ooo,
IiIIIi1iIi, I1I111, "--", "--",
"--")
if 2 - 2: I1ii11iIi11i * I11i - iIii1I11I1II1 + I1IiiI.oO0o % iII111i
if 92 - 92: iII111i
for O0OOO0OOoO0O in list(ref.referral_set.values()):
IIiIiiIi = O0OOO0OOoO0O.referral_address.print_address_no_iid()
IIiIiiIi += "<br>up" if O0OOO0OOoO0O.updown else "<br>down"
if 51 - 51:
I11i + iII111i % iIii1I11I1II1 / oO0o / OOooOOo % OoooooooOO
output += lispconfig.lisp_table_row(
ii1ii11IIIiiI, OOoO, ooOOO00Ooo, IiIIIi1iIi, I1I111, IIiIiiIi,
str(O0OOO0OOoO0O.priority) + "<br>" + str(O0OOO0OOoO0O.weight),
str(O0OOO0OOoO0O.map_requests_sent) + "<br>" +
str(O0OOO0OOoO0O.no_responses))
if 78 - 78: Ii1I % I1Ii111 + I1ii11iIi11i
if (ii1ii11IIIiiI != ""):
ii1ii11IIIiiI = ""
OOoO = ""
ooOOO00Ooo = ""
I1I111 = ""
IiIIIi1iIi = ""
if 64 - 64: oO0o * O0.I1IiiI + II111iiii
if 6 - 6: OoOoOO00 / iII111i.IiII.IiII
return ([True, output])
if 62 - 62: I1ii11iIi11i + IiII % iII111i + OOooOOo
if 33 - 33: O0.IiII.I1IiiI
if 72 - 72: i1IIi / OoO0O00 + OoooooooOO - Oo0Ooo
if 29 - 29: I1ii11iIi11i + oO0o % O0
if 10 - 10: I11i / I1Ii111 - I1IiiI * iIii1I11I1II1 - I1IiiI
if 97 - 97: I1ii11iIi11i + I1IiiI * Ii1I + OOooOOo % iII111i
if 74 - 74: oO0o - Oo0Ooo + OoooooooOO + I1Ii111 / OoOoOO00
if 23 - 23: O0
def iiii(ref, output):
if 1 - 1: Oo0Ooo / o0oOOo0O0Ooo % iII111i * IiII.i11iIiiIii
III1Iiii1I11 = lisp.lisp_print_elapsed(ref.uptime)
IIII = lisp.lisp_print_future(ref.expires)
iiIiI = ref.print_eid_tuple()
if 91 - 91: iII111i % i1IIi % iIii1I11I1II1
IIi1I11I1II = "configured" if (ref.referral_source.not_set(
)) else ref.referral_source.print_address_no_iid()
if 63 - 63: OoooooooOO - OoO0O00.II111iiii / o0oOOo0O0Ooo.OoOoOO00 / O0
if 84 - 84: IiII
OOO00O0O = "--"
if (ref.eid.is_ultimate_root()):
iii = "root"
elif (IIi1I11I1II == "configured"):
iii = "any"
else:
iii = ref.print_referral_type()
if (ref.is_referral_negative()):
iii = lisp.red(iii, True)
if 90 - 90: o0oOOo0O0Ooo % i1IIi / OoO0O00
OOO00O0O = "{}<br>{}".format(IIII, str(ref.referral_ttl / 60))
if 44 - 44: Oo0Ooo.OoO0O00 / I1ii11iIi11i + Ii1I
if 65 - 65: O0
if (len(ref.referral_set) == 0):
output += lispconfig.lisp_table_row(iiIiI, III1Iiii1I11, OOO00O0O, iii,
IIi1I11I1II, "--", "--", "--")
if 68 - 68: OOooOOo % I1Ii111
if 88 - 88: iIii1I11I1II1 - ooOoO0o + OOooOOo
for O0O0OoOO0 in ref.referral_set.values():
IiI111111IIII = O0O0OoOO0.referral_address.print_address_no_iid()
IiI111111IIII += "<br>up" if O0O0OoOO0.updown else "<br>down"
if 37 - 37: I1Ii111 / OoOoOO00
output += lispconfig.lisp_table_row(
iiIiI, III1Iiii1I11, OOO00O0O, iii, IIi1I11I1II, IiI111111IIII,
str(O0O0OoOO0.priority) + "<br>" + str(O0O0OoOO0.weight),
str(O0O0OoOO0.map_requests_sent) + "<br>" +
str(O0O0OoOO0.no_responses))
if 23 - 23: O0
if (iiIiI != ""):
iiIiI = ""
III1Iiii1I11 = ""
OOO00O0O = ""
IIi1I11I1II = ""
iii = ""
if 85 - 85: Ii1I
if 84 - 84:
I1IiiI.iIii1I11I1II1 % OoooooooOO + Ii1I % OoooooooOO % OoO0O00
return ([True, output])
if 42 - 42: OoO0O00 / I11i / o0oOOo0O0Ooo + iII111i / OoOoOO00
if 84 - 84: ooOoO0o * II111iiii + Oo0Ooo
if 53 - 53: iII111i % II111iiii.IiII - iIii1I11I1II1 - IiII * II111iiii
if 77 - 77: iIii1I11I1II1 * OoO0O00
if 95 - 95: I1IiiI + i11iIiiIii
if 6 - 6: ooOoO0o / i11iIiiIii + iII111i * oO0o
if 80 - 80: II111iiii
if 83 - 83: I11i.i11iIiiIii + II111iiii.o0oOOo0O0Ooo * I11i
def lisp_display_referral_cache(ref, output):
uts = lisp.lisp_print_elapsed(ref.uptime)
ets = lisp.lisp_print_future(ref.expires)
prefix = ref.print_eid_tuple()
ref_source = "configured" if (ref.referral_source.not_set()) else \
ref.referral_source.print_address_no_iid()
time_str = "--"
if (ref.eid.is_ultimate_root()):
ref_type = "root"
elif (ref_source == "configured"):
ref_type = "any"
else:
ref_type = ref.print_referral_type()
if (ref.is_referral_negative()):
ref_type = lisp.red(ref_type, True)
#endif
time_str = "{}<br>{}".format(ets, str(ref.referral_ttl / 60))
#endif
if (len(ref.referral_set) == 0):
output += lispconfig.lisp_table_row(prefix, uts, time_str, ref_type,
ref_source, "--", "--", "--")
#endif
for ref_node in ref.referral_set.values():
addr = ref_node.referral_address.print_address_no_iid()
addr += "<br>up" if ref_node.updown else "<br>down"
output += lispconfig.lisp_table_row(
prefix, uts, time_str, ref_type, ref_source, addr,
str(ref_node.priority) + "<br>" + str(ref_node.weight),
str(ref_node.map_requests_sent) + "<br>" +
str(ref_node.no_responses))
if (prefix != ""):
prefix = ""
uts = ""
time_str = ""
ref_source = ""
ref_type = ""
#endif
#endfor
return ([True, output])
def lisp_ms_display_ddt_cache(ddt_entry, output):
prefix = ddt_entry.print_eid_tuple()
mrs = ddt_entry.map_referrals_sent
if (ddt_entry.is_auth_prefix()):
output += lispconfig.lisp_table_row(prefix, "--", "auth-prefix", "--",
mrs)
return ([True, output])
#endif
for child in ddt_entry.delegation_set:
addr = child.delegate_address
pw = str(child.priority) + "/" + str(child.weight)
output += lispconfig.lisp_table_row(prefix, addr.print_address(),
child.print_node_type(), pw, mrs)
if (prefix != ""):
prefix = ""
mrs = ""
#endif
#endfor
return ([True, output])
def lisp_ms_show_site_command(parameter):
#
# Do detailed display.
#
if (parameter != ""):
if (parameter.find("@lookup") != -1):
parameter = parameter.split("@")
return (lisp_ms_show_site_lookup(parameter[0]))
#endif
eid = parameter.split("%")[0]
group = parameter.split("%")[1]
return (lisp_ms_show_site_detail_command(eid, group))
#endif
#
# Top part of display has the form for doing a specific lookup.
#
banner = "Enter EID for Site-Cache lookup:"
input_rectangle = \
lisp.lisp_eid_help_hover('<input type="text" name="eid" />')
output = '''
<form action="/lisp/show/site/lookup" method="post">
<i><font face="Courier New" size="3">
{} {}
<input style="background-color:transparent;border-radius:10px;" type="submit" value="Submit" />
</font></i></form>
'''.format(lisp.lisp_print_sans(banner), input_rectangle)
#
# First display auth-prefix and map-server-peer configuration, if any.
#
if (lisp.lisp_ddt_cache.cache_count != 0):
output += lisp_ms_show_ddt_entries()
#endif
#
# Do table display.
#
hover = ("{} sites & {} eid-prefixes configured\n{} eid-prefixes " + \
"registered").format(len(lisp_sites_by_name),
lisp.lisp_sites_by_eid.cache_size(), lisp.lisp_registered_count)
title = lisp.lisp_span("LISP-MS Site Information:", hover)
output += lispconfig.lisp_table_header(title, "Site Name",
"EID-Prefix or (S,G)", "Registered",
"Last Registerer",
"Last Registered",
"First Registered",
"Registration Flags")
for site_name in lisp_sites_by_name_sorted:
site = lisp_sites_by_name[site_name]
first = True
for key in site.allowed_prefixes_sorted:
site_eid = site.allowed_prefixes[key]
output = lisp_display_site_eid_entry(site_eid, site, first, output)
if (first): first = False
for ms_site_eid in site_eid.more_specific_registrations:
output = lisp_display_site_eid_entry(ms_site_eid, site, first,
output)
#endfor
#endfor
#endfor
output += lispconfig.lisp_table_footer()
#
# Show NAT-traversal lisp_nat_state_info table for an RTR. In the future
# show this. Problem know is that the lisp-core process will process
# Info-Requests for the control-plane port 4342.
#
# output = lispconfig.lisp_display_nat_info(output, "Control")
if (lisp.lisp_pubsub_cache == {}): return (output)
#
# Display pubsub cache.
#
title = "LISP-MS Subscriber Information:"
output += lispconfig.lisp_table_header(title, "EID-prefix",
"Uptime<br>TTL", "Subscriber RLOC",
"xTR-ID", "Nonce",
"Map-Notifies<br>Sent")
for e in lisp.lisp_pubsub_cache:
eid = e
for pubsub in lisp.lisp_pubsub_cache[e].values():
rloc_str = pubsub.itr.print_address_no_iid() + ":" + \
str(pubsub.port)
ut = lisp.lisp_print_elapsed(pubsub.uptime) + "<br>" + \
str(pubsub.ttl) + " mins"
xtr_id = "--"
if (pubsub.xtr_id != None):
xtr_id = "0x" + lisp.lisp_hex_string(pubsub.xtr_id)
#endif
nonce = "0x" + lisp.lisp_hex_string(pubsub.nonce)
c = pubsub.map_notify_count
output += lispconfig.lisp_table_row(eid, ut, rloc_str, xtr_id,
nonce, c)
eid = ""
#endfor
#endfor
output += lispconfig.lisp_table_footer()
return (output)
def lisp_display_site_eid_entry(site_eid, site, first, output):
eid_str = site_eid.print_eid_tuple()
eid_str = eid_str.replace("no-address/0", "")
#
# Create URL format for all of (*,G), (S,G), and an EID-prefix.
#
eid = site_eid.eid
group = site_eid.group
if (eid.is_null() and group.is_null() == False):
url = "{}-*-{}".format(group.instance_id, group.print_prefix_url())
eid_str = "<a href='/lisp/show/site/{}'>{}</a>".format(url, eid_str)
#endif
if (eid.is_null() == False and group.is_null()):
url = "{}".format(eid.print_prefix_url())
#
# Distinguished-Name EIDs have "'"s in them.
#
if (url.find("'") != -1):
url = url.replace("'", "name-", 1)
url = url.replace("'", "")
else:
#
# E.164 EIDs have "+"s in them.
#
url = url.replace("+", "plus-")
#endif
eid_str = "<a href='/lisp/show/site/{}'>{}</a>".format(url, eid_str)
#endif
if (eid.is_null() == False and group.is_null() == False):
url = "{}-{}".format(eid.print_prefix_url(), group.print_prefix_url())
eid_str = "<a href='/lisp/show/site/{}'>{}</a>".format(url, eid_str)
#endif
site_name = site.site_name if first else ""
flags = "--"
if (site_eid.registered): flags = site_eid.print_flags(True)
registerer = "--"
if (site_eid.last_registerer.afi != lisp.LISP_AFI_NONE):
registerer = site_eid.last_registerer.print_address()
#endif
registered = lisp.green("yes", True) if site_eid.registered else \
lisp.red("no", True)
if (site.shutdown): registered = lisp.red("admin-shutdown", True)
if (site_eid.dynamic):
registered += " (dynamic)"
elif (site_eid.accept_more_specifics):
registered = "(ams)"
#endif
lts = lisp.lisp_print_elapsed(site_eid.last_registered)
if (time.time() - site_eid.last_registered >= (site_eid.register_ttl / 2)
and lts != "never"):
lts = lisp.red(lts, True)
#endif
fts = lisp.lisp_print_elapsed(site_eid.first_registered)
if (site_eid.accept_more_specifics):
num = len(site_eid.more_specific_registrations)
hover = "{} EID-prefixes registered".format(num)
eid_str = lisp.lisp_span(eid_str, hover)
#endif
output += lispconfig.lisp_table_row(site_name, eid_str, registered,
registerer, lts, fts, flags)
return (output)
def oO0o0o0oo(parameter):
if 32 - 32: OOooOOo
if 42 - 42: IiII * O0 % i1IIi.OOooOOo / o0oOOo0O0Ooo
if 32 - 32: I1IiiI * Oo0Ooo
if 78 - 78: OOooOOo - OoooooooOO - I1ii11iIi11i / ooOoO0o / II111iiii
if (parameter != ""):
return (oOO00O(parameter))
if 29 - 29: I1IiiI % I1IiiI
if 94 - 94: iIii1I11I1II1 / Oo0Ooo % iII111i * iII111i * II111iiii
if 29 - 29: OoO0O00 + OoOoOO00 / o0oOOo0O0Ooo / OOooOOo * iIii1I11I1II1
if 62 - 62: OOooOOo / oO0o - OoO0O00.I11i
if 11 - 11: I1ii11iIi11i.OoO0O00 * IiII * OoooooooOO + ooOoO0o
IiII111i1i11 = "Enter EID for Referral-Cache lookup:"
i111iIi1i1II1 = lisp.lisp_eid_help_hover(
'<input type="text" name="eid" />')
if 86 - 86: iIii1I11I1II1 / OoOoOO00.II111iiii
Oo0O0oooo = '''
<form action="/lisp/show/referral/lookup" method="post">
<i><font face="Courier New" size="3">
{} {}
<input style="background-color:transparent;border-radius:10px;" type="submit" value="Submit" />
</font></i></form>
'''.format(lisp.lisp_print_sans(IiII111i1i11), i111iIi1i1II1)
if 19 - 19: I1ii11iIi11i % OoooooooOO % IiII * o0oOOo0O0Ooo % O0
if 67 - 67: I1IiiI.i1IIi
if 27 - 27: ooOoO0o % I1IiiI
if 73 - 73: OOooOOo
ooO = len(lisp.lisp_ddt_map_requestQ)
if (ooO != 0):
Ooo0oOooo0 = "{} entries in map-request queue".format(ooO)
oOOOoo00 = lisp.lisp_span("LISP-MR Map-Request Queue:", Ooo0oOooo0)
if 9 - 9: O0 % O0 - o0oOOo0O0Ooo
Oo0O0oooo += lispconfig.lisp_table_header(
oOOOoo00, "EID-Prefix or (S,G)", "Nonce", "Uptime",
"Map-Request Source", "Retry Count", "Tried DDT-Root",
"Last Request Sent To", "Last Map-Referral EID-Prefix")
if 51 - 51: I1IiiI.iIii1I11I1II1 - I1ii11iIi11i / O0
for OOOoO00 in lisp.lisp_ddt_map_requestQ:
IIiIi11i1i = lisp.lisp_ddt_map_requestQ[OOOoO00]
I1II1I11I1I = lisp.lisp_print_elapsed(IIiIi11i1i.uptime)
OoOO0o = IIiIi11i1i.last_request_sent_to
OoOO0o = "--" if (OoOO0o
== None) else OoOO0o.print_address_no_iid()
if 1 - 1: II111iiii
O0oOo00o = IIiIi11i1i.itr
O0oOo00o = "--" if (O0oOo00o == None) else (
O0oOo00o.print_address_no_iid() +
"<br>({}ITR)".format("P" if IIiIi11i1i.from_pitr else ""))
if 81 - 81: IiII % i1IIi.iIii1I11I1II1
if 4 - 4: i11iIiiIii % OoO0O00 % i1IIi / IiII
I11iI = IIiIi11i1i.last_cached_prefix[0]
ooOoo = IIiIi11i1i.last_cached_prefix[1]
I1III1111iIi = "--" if (
I11iI == None) else lisp.lisp_print_eid_tuple(I11iI, ooOoo)
if 38 - 38: iII111i + I11i / I1Ii111 % ooOoO0o - I1ii11iIi11i
if 14 - 14: oO0o / I1Ii111
Oo0O0oooo += lispconfig.lisp_table_row(
IIiIi11i1i.print_eid_tuple(),
"0x" + lisp.lisp_hex_string(IIiIi11i1i.nonce), I1II1I11I1I,
O0oOo00o, IIiIi11i1i.retry_count,
"yes" if IIiIi11i1i.tried_root else "no", OoOO0o, I1III1111iIi)
if 85 - 85: I11i
if 20 - 20: oO0o % IiII
Oo0O0oooo += lispconfig.lisp_table_footer()
if 19 - 19: I1ii11iIi11i % IiII + ooOoO0o / I1Ii111.ooOoO0o
if 12 - 12: i1IIi + i1IIi - I1ii11iIi11i * Oo0Ooo % Oo0Ooo - II111iiii
Ooo0oOooo0 = "{} entries in referral-cache".format(
lisp.lisp_referral_cache.cache_size())
if 52 - 52: ooOoO0o.iII111i + I1Ii111
oOOOoo00 = lisp.lisp_span("LISP-MR Referral-Cache:", Ooo0oOooo0)
if 38 - 38: i1IIi - II111iiii.I1Ii111
Oo0O0oooo += lispconfig.lisp_table_header(
oOOOoo00, "EID-Prefix or (S,G)", "Uptime", "Expires<br>TTL",
"Referral Type", "Map-Referral Source",
"Referral Address<br>Node Status", "Priority<br>Weight",
"Map-Requests Sent<br>No Responses")
if 58 - 58: I1IiiI.iII111i + OoOoOO00
Oo0O0oooo = lisp.lisp_referral_cache.walk_cache(oooO0, Oo0O0oooo)
if 66 - 66: iII111i / oO0o * OoooooooOO + OoooooooOO % I11i
Oo0O0oooo += lispconfig.lisp_table_footer()
return (Oo0O0oooo)
if 49 - 49: oO0o - i11iIiiIii.I1Ii111 * Ii1I % iII111i + i1IIi
if 71 - 71: o0oOOo0O0Ooo
if 38 - 38: oO0o % OoOoOO00 + I1ii11iIi11i.i11iIiiIii
if 53 - 53: i11iIiiIii * iII111i
if 68 - 68: iIii1I11I1II1 * iIii1I11I1II1.o0oOOo0O0Ooo / II111iiii % Oo0Ooo
if 38 - 38: ooOoO0o - OOooOOo / iII111i
if 66 - 66: O0 % I1ii11iIi11i + i11iIiiIii.OoOoOO00 / Ii1I + I1ii11iIi11i
def lisp_mr_show_referral_cache_command(parameter):
#
# Do lookup if there is a parameter supplied.
#
if (parameter != ""):
return (lisp_mr_show_referral_cache_lookup(parameter))
#endif
#
# Top part of display has the form for doing a specific lookup.
#
banner = "Enter EID for Referral-Cache lookup:"
input_rectangle = \
lisp.lisp_eid_help_hover('<input type="text" name="eid" />')
output = '''
<form action="/lisp/show/referral/lookup" method="post">
<i><font face="Courier New" size="3">
{} {}
<input style="background-color:transparent;border-radius:10px;" type="submit" value="Submit" />
</font></i></form>
'''.format(lisp.lisp_print_sans(banner), input_rectangle)
#
# Display the DDT Map-Request queue contents if anything is in it.
#
queue_size = len(lisp.lisp_ddt_map_requestQ)
if (queue_size != 0):
hover = "{} entries in map-request queue".format(queue_size)
title = lisp.lisp_span("LISP-MR Map-Request Queue:", hover)
output += lispconfig.lisp_table_header(title, "EID-Prefix or (S,G)",
"Nonce", "Uptime",
"Map-Request Source",
"Retry Count", "Tried DDT-Root",
"Last Request Sent To",
"Last Map-Referral EID-Prefix")
for key in lisp.lisp_ddt_map_requestQ:
mr = lisp.lisp_ddt_map_requestQ[key]
ut = lisp.lisp_print_elapsed(mr.uptime)
last_sent = mr.last_request_sent_to
last_sent = "--" if (last_sent == None) else \
last_sent.print_address_no_iid()
itr = mr.itr
itr = "--" if (itr == None) else (itr.print_address_no_iid() + \
"<br>({}ITR)".format("P" if mr.from_pitr else ""))
last_eid = mr.last_cached_prefix[0]
last_group = mr.last_cached_prefix[1]
last_prefix = "--" if (last_eid == None) else \
lisp.lisp_print_eid_tuple(last_eid, last_group)
output += lispconfig.lisp_table_row(
mr.print_eid_tuple(), "0x" + lisp.lisp_hex_string(mr.nonce),
ut, itr, mr.retry_count, "yes" if mr.tried_root else "no",
last_sent, last_prefix)
#endfor
output += lispconfig.lisp_table_footer()
#endif
hover = "{} entries in referral-cache".format( \
lisp.lisp_referral_cache.cache_size())
title = lisp.lisp_span("LISP-MR Referral-Cache:", hover)
output += lispconfig.lisp_table_header(
title, "EID-Prefix or (S,G)", "Uptime", "Expires<br>TTL",
"Referral Type", "Map-Referral Source",
"Referral Address<br>Node Status", "Priority<br>Weight",
"Map-Requests Sent<br>No Responses")
output = lisp.lisp_referral_cache.walk_cache(lisp_walk_referral_cache,
output)
output += lispconfig.lisp_table_footer()
return (output)
def oOOOoo0O0oO(parameter):
if 6 - 6: OOooOOo * o0oOOo0O0Ooo + iII111i
if 44 - 44: Ii1I % OoO0O00 + OoooooooOO - O0 - Ii1I - II111iiii
if 99 - 99: ooOoO0o.Ii1I + I1Ii111 + OoooooooOO % o0oOOo0O0Ooo
if 51 - 51: iIii1I11I1II1
if (parameter != ""):
return (oOoooo0O0Oo(parameter))
if 34 - 34: oO0o + I1IiiI - oO0o
if 17 - 17: II111iiii % iII111i + I11i - iII111i / OOooOOo + ooOoO0o
if 59 - 59: OOooOOo % OoOoOO00.Ii1I * I1ii11iIi11i % I11i
if 59 - 59: oO0o - iII111i
if 15 - 15: I1Ii111.i11iIiiIii.OoooooooOO / OoO0O00 % Ii1I
OooooOOoo0 = "Enter EID for Referral-Cache lookup:"
i1I1IiiIi1i = lisp.lisp_eid_help_hover('<input type="text" name="eid" />')
if 29 - 29: I1IiiI % I1IiiI
ooo0OOOoo = '''
<form action="/lisp/show/referral/lookup" method="post">
<i><font face="Courier New" size="3">
{} {}
<input style="background-color:transparent;border-radius:10px;" type="submit" value="Submit" />
</font></i></form>
'''.format(lisp.lisp_print_sans(OooooOOoo0), i1I1IiiIi1i)
if 94 - 94: iIii1I11I1II1 / Oo0Ooo % iII111i * iII111i * II111iiii
if 29 - 29: OoO0O00 + OoOoOO00 / o0oOOo0O0Ooo / OOooOOo * iIii1I11I1II1
if 62 - 62: OOooOOo / oO0o - OoO0O00.I11i
if 11 - 11: I1ii11iIi11i.OoO0O00 * IiII * OoooooooOO + ooOoO0o
IiII111i1i11 = len(lisp.lisp_ddt_map_requestQ)
if (IiII111i1i11 != 0):
i111iIi1i1II1 = "{} entries in map-request queue".format(IiII111i1i11)
oooO = lisp.lisp_span("LISP-MR Map-Request Queue:", i111iIi1i1II1)
if 26 - 26: Ii1I % I1ii11iIi11i
ooo0OOOoo += lispconfig.lisp_table_header(
oooO, "EID-Prefix or (S,G)", "Nonce", "Uptime",
"Map-Request Source", "Retry Count", "Tried DDT-Root",
"Last Request Sent To", "Last Map-Referral EID-Prefix")
if 76 - 76: IiII * iII111i
for ooooooo00o in lisp.lisp_ddt_map_requestQ:
o0oooOO00 = lisp.lisp_ddt_map_requestQ[ooooooo00o]
iiIiii1IIIII = lisp.lisp_print_elapsed(o0oooOO00.uptime)
o00o = o0oooOO00.last_request_sent_to
o00o = "--" if (o00o == None) else o00o.print_address_no_iid()
if 45 - 45:
I1ii11iIi11i.o0oOOo0O0Ooo.I1ii11iIi11i - I1IiiI.o0oOOo0O0Ooo
iiI1IIIi = o0oooOO00.itr
iiI1IIIi = "--" if (iiI1IIIi == None) else (
iiI1IIIi.print_address_no_iid() +
"<br>({}ITR)".format("P" if o0oooOO00.from_pitr else ""))
if 47 - 47: Oo0Ooo % I11i % i11iIiiIii - O0 + ooOoO0o
if 94 - 94: I1Ii111
i11II1I11I1 = o0oooOO00.last_cached_prefix[0]
OOoOO0ooo = o0oooOO00.last_cached_prefix[1]
II1iIi11 = "--" if (i11II1I11I1
== None) else lisp.lisp_print_eid_tuple(
i11II1I11I1, OOoOO0ooo)
if 12 - 12: Ii1I + i11iIiiIii * iIii1I11I1II1 / I1ii11iIi11i.I11i
if 5 - 5: i1IIi + IiII / o0oOOo0O0Ooo.iII111i / I11i
ooo0OOOoo += lispconfig.lisp_table_row(
o0oooOO00.print_eid_tuple(),
"0x" + lisp.lisp_hex_string(o0oooOO00.nonce), iiIiii1IIIII,
iiI1IIIi, o0oooOO00.retry_count,
"yes" if o0oooOO00.tried_root else "no", o00o, II1iIi11)
if 32 - 32: I1IiiI % iIii1I11I1II1 / i1IIi - I1IiiI
if 7 - 7: I1Ii111 * OoO0O00 - ooOoO0o + OOooOOo * I1IiiI % OoO0O00
ooo0OOOoo += lispconfig.lisp_table_footer()
if 15 - 15: OoOoOO00 % I1IiiI * I11i
if 81 - 81: ooOoO0o - iIii1I11I1II1 - i1IIi / I1Ii111 - O0 * I11i
i111iIi1i1II1 = "{} entries in referral-cache".format(
lisp.lisp_referral_cache.cache_size())
if 20 - 20: oO0o % IiII
oooO = lisp.lisp_span("LISP-MR Referral-Cache:", i111iIi1i1II1)
if 19 - 19: I1ii11iIi11i % IiII + ooOoO0o / I1Ii111.ooOoO0o
ooo0OOOoo += lispconfig.lisp_table_header(
oooO, "EID-Prefix or (S,G)", "Uptime", "Expires<br>TTL",
"Referral Type", "Map-Referral Source",
"Referral Address<br>Node Status", "Priority<br>Weight",
"Map-Requests Sent<br>No Responses")
if 12 - 12: i1IIi + i1IIi - I1ii11iIi11i * Oo0Ooo % Oo0Ooo - II111iiii
ooo0OOOoo = lisp.lisp_referral_cache.walk_cache(o00oO0oOo00, ooo0OOOoo)
if 52 - 52: ooOoO0o.iII111i + I1Ii111
ooo0OOOoo += lispconfig.lisp_table_footer()
return (ooo0OOOoo)
if 38 - 38: i1IIi - II111iiii.I1Ii111
if 58 - 58: I1IiiI.iII111i + OoOoOO00
if 66 - 66: iII111i / oO0o * OoooooooOO + OoooooooOO % I11i
if 49 - 49: oO0o - i11iIiiIii.I1Ii111 * Ii1I % iII111i + i1IIi
if 71 - 71: o0oOOo0O0Ooo
if 38 - 38: oO0o % OoOoOO00 + I1ii11iIi11i.i11iIiiIii
if 53 - 53: i11iIiiIii * iII111i
