From 5489fcc3d9dbb1f529dddb19b615e23d8ed59dc7 Mon Sep 17 00:00:00 2001
From: Ken Raeburn <raeburn@cygnus>
Date: Tue, 7 Feb 1995 22:34:18 +0000
Subject: Lots of changes from David Mosberger-Tang; see ChangeLog and NOTES
 for details: Alpha support. Long options. New file format to support more
 information; backwards compatibility. Line-level profiling, on systems where
 bfd_find_nearest_line works. Selective display of data.

---
 gprof/lookup.c | 140 ---------------------------------------------------------
 1 file changed, 140 deletions(-)
 delete mode 100644 gprof/lookup.c

(limited to 'gprof/lookup.c')

diff --git a/gprof/lookup.c b/gprof/lookup.c
deleted file mode 100644
index 56ded06..0000000
--- a/gprof/lookup.c
+++ /dev/null
@@ -1,140 +0,0 @@
-/*
- * Copyright (c) 1983 Regents of the University of California.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms are permitted
- * provided that: (1) source distributions retain this entire copyright
- * notice and comment, and (2) distributions including binaries display
- * the following acknowledgement:  ``This product includes software
- * developed by the University of California, Berkeley and its contributors''
- * in the documentation or other materials provided with the distribution
- * and in all advertising materials mentioning features or use of this
- * software. Neither the name of the University nor the names of its
- * contributors may be used to endorse or promote products derived
- * from this software without specific prior written permission.
- * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
- */
-
-#ifndef lint
-static char sccsid[] = "@(#)lookup.c	5.4 (Berkeley) 6/1/90";
-#endif /* not lint */
-
-#include "gprof.h"
-
-    /*
-     *	look up an address in a sorted-by-address namelist
-     *	    this deals with misses by mapping them to the next lower 
-     *	    entry point.
-     */
-#ifdef DEBUG
-nltype *dbg_nllookup();
-#endif
-     
-nltype *
-nllookup( address )
-    unsigned long	address;
-{
-    register long	low;
-    register long	middle;
-    register long	high;
-#   ifdef DEBUG
-	register int	probes;
-
-	probes = 0;
-#   endif DEBUG
-    for ( low = 0 , high = nname - 1 ; low != high ; ) {
-#	ifdef DEBUG
-	    probes += 1;
-#	endif DEBUG
-	middle = ( high + low ) >> 1;
-	if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
-#	    ifdef DEBUG
-		if ( debug & LOOKUPDEBUG ) {
-		    printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
-		}
-#	    endif DEBUG
-	    return &nl[ middle ];
-	}
-	if ( nl[ middle ].value > address ) {
-	    high = middle;
-	} else {
-	    low = middle + 1;
-	}
-    }
-    if(nl[middle+1].value <= address) {
-#	    ifdef DEBUG
-      if (debug & LOOKUPDEBUG ) {
-	printf("[nllookup] %d (%d) probes, fall off\n", probes, nname-1);
-      }
-#	    endif
-      return &nl[middle+1];
-    }
-    fprintf( stderr , "[nllookup] binary search fails???\n" );
-#ifdef DEBUG
-    dbg_nllookup(address);
-#endif    
-    return 0;
-}
-
-#ifdef DEBUG
-nltype *
-dbg_nllookup( address )
-    unsigned long	address;
-{
-    register long	low;
-    register long	middle;
-    register long	high;
-    fprintf(stderr,"[nllookup] address 0x%x\n",address);
-    
-    for ( low = 0 , high = nname - 1 ; low != high ; ) {
-      
-      middle = ( high + low ) >> 1;
-      fprintf(stderr, "[nllookup] low 0x%x middle 0x%x high 0x%x nl[m] 0x%x nl[m+1] 0x%x\n",
-	      low,middle,high,nl[middle].value,nl[middle+1].value);
-      if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address) {
-	return &nl[ middle ];
-      }
-      if ( nl[ middle ].value > address ) {
-	high = middle;
-      } else {
-	low = middle + 1;
-      }
-    }
-    fprintf( stderr , "[nllookup] binary search fails???\n" );
-    return 0;
-}
-#endif DEBUG
-
-arctype *
-arclookup( parentp , childp )
-    nltype	*parentp;
-    nltype	*childp;
-{
-    arctype	*arcp;
-
-    if ( parentp == 0 || childp == 0 ) {
-	printf( "[arclookup] parentp == 0 || childp == 0\n" );
-	return 0;
-    }
-#   ifdef DEBUG
-	if ( debug & LOOKUPDEBUG ) {
-	    printf( "[arclookup] parent %s child %s\n" ,
-		    parentp -> name , childp -> name );
-	}
-#   endif DEBUG
-    for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
-#	ifdef DEBUG
-	    if ( debug & LOOKUPDEBUG ) {
-		printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
-			arcp -> arc_parentp -> name ,
-			arcp -> arc_childp -> name );
-	    }
-#	endif DEBUG
-	if ( arcp -> arc_childp == childp ) {
-	    return arcp;
-	}
-    }
-    return 0;
-}
-- 
cgit v1.1