Add functionality for maintaining neighbor status

struct hrdw_addr needs fields describing the local clock and remote
status (failure status and clock time) of a neighbor. The first 31
bits of remote_sc are the remote node's clock, and the 32nd bit of
remote_rc is the failure status (0 for failed, 1 for alive).
local_c is 32 bits of the local clock. Seqlocks are used to prevent
concurrent writes to the variables

All clock times are taken from the lower 32 bits of the wall time,
measured in seconds. When two remote clock values need to be
directly compared (only the lower 31 bits represent the clock), the
function clockcmp31() should be used, which is a wrapper for
clockcmp32(). When two local clocks need to be compared (where all
32 bits represent the clock), clockcmp32() can be directly called.
These functions correctly handle overflow of clock values.

Because neighbors now have a status associated with them, NWP
needs methods of disseminating that information. To do this,
the routines for announcing and sending neighbor lists must
be amended to include status information, and the packet definitions
for announcements and neighbor lists must be amended. A node will
only send information about a failed neighbor if it is within a
time bound defined by NWP_LIST_TIME_MAX so that failed neighbors
are not cyclically added and deleted from neighbor lists in the LAN.

Status information can be taken from announcement and neighbor list
packets in read_announcement() and process_neigh_list(), and can be
passed to functions that create and insert neighbors, such as
new_ha(), add_ha(), and insert_neigh().

main_newroute() in net/xia/ppal_hid/main.c must also be altered
to match the change in function signature for insert_neigh(),
and the function prototype must be changed in
include/net/xia_hid.h.
Move error checks for packet dropping

struct general_hdr is not general enough for all types of NWP
packets; only the first two fields are necessary. Therefore, the
error-checking code for the number of HIDs and the hardware
address length should be moved to more local code for
announcements and neighbor lists.
Implement efficient monitoring algorithm

Every struct hid_dev now has a timer to periodically begin a
monitoring interval. It is also necessary to allocate memory
for the hardware address of a temporary target for each
monitoring interval.

There are also bools for whether monitoring is currently
occuring, for determining whether contact has been made with
any neighbor during the current monitoring interval (to
diagnose network partitions), and for whether the neighbor has
yet been remonitored if failure is suspected.

Upon arrival of a neighbor list, the monitoring algorithm may
begin in process_neigh_list(). monitor() initiates a monitoring
interval, using pick_random_neigh() to select a random target
to monitor.

To accomplish this, the monitoring algorithm first pings the
selected target, which may result in a timer expiration and
callback of end_ping_failure(). In that case, investigative
neighbors may be used to verify that the given target has
failed. If, at the end of the investigative time period, no
response from the target has been received, a timer expiry
callbacks into end_interval_failure(), which may declare a
node as failed.

A function find_update_neigh_sc() is added to update the status
of a hardware address for which we don't have a struct
hrdw_addr reference. If we're updating a node that has failed,
we need to estimate the remote clock time using the difference
between the old clock time and the new clock time.

The forward declaration of end_interval_failure() is necessary
because of the cyclic nature between monitor(),
end_ping_failure(), and end_interval_failure().

In order to send monitoring packets, send_monitoring() is
implemented. Note that const u8 *inv should not be used
for Ping and Ack packets, and in those cases should be set to
NULL.

nwp_rcv() may now accept monitoring packets and distribute
them to process_monitoring(), which updates clocks, changes
timers, and dispatches packets as necessary depending on the
type of packet that has been received. When a monitoring
iteration is successful (an Ack is received), the monitoring
interval will end in end_interval_success().

Periodically, the neighbor list should be cleaned of any failed
nodes that have been declared dead for some time. The function
clean_neigh_list() is therefore added, which is periodically
called upon timer expiration.
Fix spelling of announcement

Fixed all spelling mistakes for "announcement."
Disable deletion of manually-entered neighbors

When a neighbor is manually added to the neighbor list via the xip
utility, that neighbor should not participate in NWP and should not
be removed from the neighbor list. These nodes are kept in the
neighbor list to keep routing compatible in other XIA implementations,
but they should not be sent in neighbor lists or monitored.

To do this, insert_neigh() and new_ha() are given an additional
parameter perm, which requires a change in the prototype of
insert_neigh() in include/net/xia_hid.h. If this parameter is true,
then the node has been manually inserted. Every struct hrdw_addr now
has a bool permanent to reflect this as well.

clean_neigh_list() also should therefore not discard any neighbor who
is considered permanent.