2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1983, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 static char sccsid[] = "@(#)lookup.c 8.1 (Berkeley) 6/6/93";
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
44 * look up an address in a sorted-by-address namelist
45 * this deals with misses by mapping them to the next lower
49 nllookup(unsigned long address)
59 for ( low = 0 , high = nname - 1 ; low != high ; ) {
63 middle = ( high + low ) >> 1;
64 if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
66 if ( debug & LOOKUPDEBUG ) {
67 printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
71 if (nl[middle].name[0] == '$' &&
72 nl[middle-1].value == nl[middle].value)
78 if ( nl[ middle ].value > address ) {
85 if ( debug & LOOKUPDEBUG ) {
86 fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
94 arclookup(nltype *parentp, nltype *childp)
98 if ( parentp == 0 || childp == 0 ) {
99 fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
103 if ( debug & LOOKUPDEBUG ) {
104 printf( "[arclookup] parent %s child %s\n" ,
105 parentp -> name , childp -> name );
108 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
110 if ( debug & LOOKUPDEBUG ) {
111 printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
112 arcp -> arc_parentp -> name ,
113 arcp -> arc_childp -> name );
116 if ( arcp -> arc_childp == childp ) {