#!/usr/bin/perl
#
# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
# 	Yokogawa Electric Corporation.
# All rights reserved.
# 
# Redistribution and use of this software in source and binary
# forms, with or without modification, are permitted provided that
# the following conditions and disclaimer are agreed and accepted
# by the user:
# 
# 1. Redistributions of source code must retain the above copyright
#    notice, this list of conditions and the following disclaimer.
# 
# 2. Redistributions in binary form must reproduce the above copyright
#    notice, this list of conditions and the following disclaimer in
#    the documentation and/or other materials provided with
#    the distribution.
# 
# 3. Neither the names of the copyrighters, the name of the project
#    which is related to this software (hereinafter referred to as
#    "project") nor the names of the contributors may be used to
#    endorse or promote products derived from this software without
#    specific prior written permission.
# 
# 4. No merchantable use may be permitted without prior written
#    notification to the copyrighters.
# 
# 5. The copyrighters, the project and the contributors may prohibit
#    the use of this software at any time.
# 
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHTERS, THE PROJECT AND
# CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING
# BUT NOT LIMITED THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
# FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.  IN NO EVENT SHALL THE
# COPYRIGHTERS, THE PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
# $TAHI: ct/nd.p2/V6LC_2_1_1_A.seq,v 1.4 2005/06/14 05:54:40 akisada Exp $
#
########################################################################

use nd;

BEGIN {}
END   {}

if($V6evalTool::NutDef{'Type'} eq 'router') {
	vLogHTML('<FONT COLOR="#FF0000" SIZE="5"><U><B>TEST SETUP FOR ROUTER'.
			 '</B></U></FONT><BR>');
	if(vRemote(
			   'route.rmt',
			   'cmd=add',
			   'prefix=default',
			   "gateway=fe80::200:ff:fe00:a0a0",
			   "if=$V6evalTool::NutDef{'Link0_device'}"
			   )) {
		vLogHTML('<FONT COLOR="#FF0000"><B>'.
				 'route.rmt: Could\'t set route'.
				 '</B></FONT><BR>');
		exitFatal();
		#NOTREACHED
	}
	$NEED_COMMON_CLEANUP = 1;
}

startNdiscWorld($Link0);

if(setupCase0($Link0) < 0) {
	exitFatal();
	#NOTREACHED
}

vLogHTML('<FONT COLOR="#FF0000" SIZE="5"><U><B>TEST PROCEDURE'.
		 '</B></U></FONT><BR>');

$SeekTime = 0;

my @frames = ('ndisc_mcast_ns_sll_LL');

if($IGN_NS_SRC_ADDR) {
	push(@frames, 'ndisc_mcast_ns_sll_GL');
}

vSend($Link0, 'ndisc_ereq_LL');

my %ret = vRecvWrapper($Link0, $TimeOut, $SeekTime, 0, @frames);

if($ret{'recvCount'}) {
	foreach my $frame (@frames) {
		if($ret{'recvFrame'} eq $frame) {
			flushBuffer($Link0, $TimeOut, $TimeOut);
			exitPass();
		}
	}
}

vLogHTML('<FONT COLOR="#FF0000"><B>Could\'t observe NS</B></FONT><BR>');

exitFail();
#NOTREACHED



#
# perldoc
#
########################################################################
__END__

=head1 NAME

=begin html
<BLOCKQUOTE><TT>
V6LC_2_1_1_A - On-Link Determination (Link-local Address)

=end html

=begin html
</TT></BLOCKQUOTE>

=end html

=head1 TARGET

=begin html
<BLOCKQUOTE>
<TT>Host</TT>
</BLOCKQUOTE>

=end html

=head1 TOPOLOGY

=begin html
<BLOCKQUOTE>
<BLOCKQUOTE>
<PRE>
    TN     NUT
    |       |
----+-------+--- Link0
</PRE>
</BLOCKQUOTE>
<P>
<TABLE BORDER>
<TR>
<TD><TT>Link0</TT></TD>
<TD><TT>link-local</TT></TD>
<TD><TT>fe80::/64</TT></TD>
</TR>
<TR>
<TD ROWSPAN="2"><TT>TN</TT></TD>
<TD><TT>link-local</TT></TD>
<TD><TT>fe80::&lt;TnDef.Link0_addr&gt;</TT></TD>
</TR>
<TR>
<TD><TT>ether</TT></TD>
<TD><TT>&lt;TnDef.Link0_addr&gt;</TT></TD>
</TR>
<TR>
<TD ROWSPAN="2"><TT>NUT</TT></TD>
<TD><TT>link-local</TT></TD>
<TD><TT>fe80::&lt;NutDef.Link0_addr&gt;</TT></TD>
</TR>
<TR>
<TD><TT>ether</TT></TD>
<TD><TT>&lt;NutDef.Link0_addr&gt;</TT></TD>
</TR>
</TABLE>
</BLOCKQUOTE>

=end html

=head1 SETUP

=begin html
<BLOCKQUOTE>
<PRE>
If the NUT is a router, configure a default route with TR1 as next hop.
</PRE>
</BLOCKQUOTE>

=end html

=head1 TEST PROCEDURE

=begin html
<BLOCKQUOTE>
<TT><B>- Verify that NUT assumes the destination is on-link</B></TT><BR>
<BLOCKQUOTE>
<PRE>
    TN     NUT
    |       |
    | ----> | Echo Request
    |   <-- | NS (multicast) [<A HREF="#PRC1">Judgment #1</A>]
    |   <-- | NS (multicast)
    |   <-- | NS (multicast)
    |       |
    V       V
</PRE>
</BLOCKQUOTE>
<P>
<PRE>
    State: <FONT COLOR="#FF0000">NONE</FONT> (TN) (link-local)
</PRE>
<PRE>
1. Send Echo Request
</PRE>
<PRE>
        IPv6 header
            source      = TN  (link-local)
            destination = NUT (link-local)
        Echo Request
</PRE>
<PRE>
    State: <FONT COLOR="#FF0000">INCOMPLETE</FONT> (TN) (link-local)
</PRE>
<PRE>
<A NAME="PRC1">2. Observe MAX_MULTICAST_SOLICIT NSs [<A HREF="#JDG1">Judgment #1</A>]
</PRE>
<PRE>
        IPv6 header
            hop limit   = 255
            source      = NUT (link-local)
            destination = TN  (solicited-node multicast address)
        NS
            target      = TN  (link-local)
        SLL option
</PRE>
<PRE>
        Node constants:
            MAX_MULTICAST_SOLICIT: 3 transmissions
</PRE>
<PRE>
    State: <FONT COLOR="#FF0000">NONE</FONT> (TN) (link-local)
</PRE>
</BLOCKQUOTE>

=end html

=head1 JUDGEMENT

=begin html
<BLOCKQUOTE>
<PRE>
<A NAME="JDG1">[<A HREF="#PRC1">Judgment #1</A>] NUT must transmit 3 NSs to TN (solicited-node multicast address)
</PRE>
</BLOCKQUOTE>

=end html

=head1 CLEANUP

=begin html
<BLOCKQUOTE>
<PRE>
none
</PRE>
</BLOCKQUOTE>

=end html

=cut

# =head1 REFERENCE
# 
# =begin html
# <BLOCKQUOTE>
# <FONT SIZE="+1"><TT>RFC2461 Neighbor Discovery for IPv6</TT></FONT>
# <HR>
# <PRE>
# 5.2.  Conceptual Sending Algorithm
# </PRE>
# <PRE>
#    Next-hop determination for a given unicast destination operates as
#    follows.  The sender performs a longest prefix match against the
#    Prefix List to determine whether the packet's destination is on- or
#    off-link.  <U><B>If the destination is on-link, the next-hop address is the</B></U>
#    <U><B>same as the packet's destination address.</B></U>  Otherwise, the sender
#    selects a router from the Default Router List (following the rules
#    described in Section 6.3.6).  If the Default Router List is empty,
#    the sender assumes that the destination is on-link.
# </PRE>
# </BLOCKQUOTE>
# 
# =end html
# 

=pod

=head1 REFERENCE

=begin html
<BLOCKQUOTE>
<PRE>
RFC 2461 - Neighbor Discovery for IPv6
</PRE>
</BLOCKQUOTE>

=end html

=cut