HAMMER VFS - Do a better job with IO_DIRECT
[dragonfly.git] / usr.bin / gprof / lookup.c
blobb8c8343f0b96c8624b46c5d431f51cfa2aabbca8
1 /*
2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
33 * @(#)lookup.c 8.1 (Berkeley) 6/6/93
35 * $DragonFly: src/usr.bin/gprof/lookup.c,v 1.5 2006/01/22 03:43:37 swildner Exp $
38 #include "gprof.h"
41 * look up an address in a sorted-by-address namelist
42 * this deals with misses by mapping them to the next lower
43 * entry point.
45 nltype *
46 nllookup(unsigned long address)
48 long low;
49 long middle;
50 long high;
51 # ifdef DEBUG
52 int probes;
54 probes = 0;
55 # endif /* DEBUG */
56 for ( low = 0 , high = nname - 1 ; low != high ; ) {
57 # ifdef DEBUG
58 probes += 1;
59 # endif /* DEBUG */
60 middle = ( high + low ) >> 1;
61 if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
62 # ifdef DEBUG
63 if ( debug & LOOKUPDEBUG ) {
64 printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
66 # endif /* DEBUG */
67 return &nl[ middle ];
69 if ( nl[ middle ].value > address ) {
70 high = middle;
71 } else {
72 low = middle + 1;
75 # ifdef DEBUG
76 if ( debug & LOOKUPDEBUG ) {
77 fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
78 nname-1 );
80 # endif /* DEBUG */
81 return 0;
84 arctype *
85 arclookup(nltype *parentp, nltype *childp)
87 arctype *arcp;
89 if ( parentp == 0 || childp == 0 ) {
90 fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
91 return 0;
93 # ifdef DEBUG
94 if ( debug & LOOKUPDEBUG ) {
95 printf( "[arclookup] parent %s child %s\n" ,
96 parentp -> name , childp -> name );
98 # endif /* DEBUG */
99 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
100 # ifdef DEBUG
101 if ( debug & LOOKUPDEBUG ) {
102 printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
103 arcp -> arc_parentp -> name ,
104 arcp -> arc_childp -> name );
106 # endif /* DEBUG */
107 if ( arcp -> arc_childp == childp ) {
108 return arcp;
111 return 0;