85 lines
2.4 KiB
Java
85 lines
2.4 KiB
Java
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
*
|
|
* The contents of this file are subject to the Netscape Public
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
* implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All
|
|
* Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*/
|
|
|
|
package com.netscape.jsdebugging.jslogger;
|
|
|
|
import netscape.jsdebug.*;
|
|
|
|
class CallChain
|
|
{
|
|
// compare return codes
|
|
|
|
public static final int EQUAL = 0;
|
|
public static final int CALLER = 1;
|
|
public static final int CALLEE = 2;
|
|
public static final int DISJOINT = 3;
|
|
|
|
public CallChain( JSThreadState threadState )
|
|
{
|
|
try
|
|
{
|
|
StackFrameInfo[] infoarray = threadState.getStack();
|
|
if( null == infoarray || 0 == infoarray.length )
|
|
return;
|
|
|
|
int count = infoarray.length;
|
|
_chain = new Script[count];
|
|
|
|
for( int i = 0; i < count; i++ )
|
|
_chain[i] = ((JSPC)(infoarray[i].getPC())).getScript();
|
|
}
|
|
catch( InvalidInfoException e )
|
|
{
|
|
_chain = null;
|
|
return;
|
|
}
|
|
}
|
|
|
|
public int compare( CallChain other )
|
|
{
|
|
if( this == other )
|
|
return EQUAL;
|
|
if( null == _chain || null == other || null == other._chain )
|
|
return DISJOINT;
|
|
|
|
int count = _chain.length;
|
|
int other_count = other._chain.length;
|
|
if( 0 == count || 0 == other_count )
|
|
return DISJOINT;
|
|
|
|
int lesser_count = Math.min( count, other_count );
|
|
int i;
|
|
for( i = 0; i < lesser_count; i++ )
|
|
{
|
|
if( ! _chain[i].equals(other._chain[i]) )
|
|
return DISJOINT;
|
|
}
|
|
if( count > other_count )
|
|
return CALLER;
|
|
if( count < other_count )
|
|
return CALLEE;
|
|
return EQUAL;
|
|
}
|
|
|
|
private Script[] _chain;
|
|
}
|