## Copyright (c) 1996 Regents of the University of California.# All rights reserved.# # Redistribution and use in source and binary forms, with or without# modification, are permitted provided that the following conditions# are met:# 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. All advertising materials mentioning features or use of this software#    must display the following acknowledgement:# 	This product includes software developed by the MASH Research# 	Group at the University of California Berkeley.# 4. Neither the name of the University nor of the Research Group may be#    used to endorse or promote products derived from this software without#    specific prior written permission.# # THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE# ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS 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.### THE CODE INCLUDED IN THIS FILE IS USED FOR BACKWARD COMPATIBILITY ONLY# for now creating a new class for hier-node for the sake of minimum overlap. # However this may be combined with ns-node at a later date when hierarchical routing# gets to become stable & operational.Class HierNode -superclass NodeHierNode instproc init {args} {	$self instvar address_	set haddress $args        set address_ $args	set args [lreplace $args 0 1]	$self next $args        set address_ $haddress}# Wan: set as the first level of classifier for every hierNode# so that every hierNode has hawaii classifier as first level# if HawaiiRouting is TrueHierNode instproc mk-default-classifier {} {    global HawaiiRouting;	$self instvar np_ id_ classifiers_ agents_ dmux_ neighbor_ address_ 	# puts "id=$id_"	set levels [AddrParams set hlevel_]	for {set n 1} {$n <= $levels} {incr n} {		set classifiers_($n) [new Classifier/Addr]		$classifiers_($n) set mask_ [AddrParams set NodeMask_($n)]		$classifiers_($n) set shift_ [AddrParams set NodeShift_($n)]	}        # Add by Wan:        if { $HawaiiRouting == 1 } {            $classifiers_(1) set top_ 1            $classifiers_(1) set mynode_ $self        }}HierNode instproc entry {} {    $self instvar ns_    if ![info exist ns_] {	set ns_ [Simulator instance]    }    if [$ns_ multicast?] {	$self instvar switch_	return $switch_    }    $self instvar classifiers_    return $classifiers_(1)}HierNode instproc enable-mcast sim {	$self instvar classifiers_ multiclassifier_ ns_ switch_ mcastproto_	$self set ns_ $sim	$self set switch_ [new Classifier/Addr]	#	# set up switch to route unicast packet to slot 0 and	# multicast packets to slot 1	#		[$self set switch_] set mask_ [AddrParams set McastMask_]	[$self set switch_] set shift_ [AddrParams set McastShift_]	#	# create a classifier for multicast routing	#	$self set multiclassifier_ [new Classifier/Multicast/Replicator]	[$self set multiclassifier_] set node_ $self		[$self set switch_] install 0 $classifiers_(1)	[$self set switch_] install 1 $multiclassifier_	#	# Create a prune agent.  Each multicast routing node	# has a private prune agent that sends and receives	# prune/graft messages and dispatches them to the	# appropriate replicator object.	#	$self set mrtObject_ [new mrtObject $self]}HierNode instproc add-hroute { dst target } {	$self instvar classifiers_ rtsize_	set al [$self split-addrstr $dst]	set l [llength $al]	for {set i 1} {$i <= $l} {incr i} {		set d [lindex $al [expr $i-1]]		if {$i == $l} {			$classifiers_($i) install $d $target		} else {			$classifiers_($i) install $d $classifiers_([expr $i + 1]) 		}	}    #    # increase the routing table size counter - keeps track of rtg table size for     # each node    set rtsize_ [expr $rtsize_ + 1]}## split up hier address string #HierNode instproc split-addrstr addrstr {	set L [split $addrstr .]	return $L}#HierNode instproc node-addr {} {#	$self instvar address_#        puts "H $address_"#	return $address_#}# as of now, hierarchical routing support not extended for equal cost multi path routing### feature may be added in future