symcomp.c
来自「开放源码的编译器open watcom 1.6.0版的源代码」· C语言 代码 · 共 111 行
C
111 行
/****************************************************************************
*
* Open Watcom Project
*
* Portions Copyright (c) 1983-2002 Sybase, Inc. All Rights Reserved.
*
* ========================================================================
*
* This file contains Original Code and/or Modifications of Original
* Code as defined in and that are subject to the Sybase Open Watcom
* Public License version 1.0 (the 'License'). You may not use this file
* except in compliance with the License. BY USING THIS FILE YOU AGREE TO
* ALL TERMS AND CONDITIONS OF THE LICENSE. A copy of the License is
* provided with the Original Code and Modifications, and is also
* available at www.sybase.com/developer/opensource.
*
* The Original Code and all software distributed under the License are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, AND SYBASE AND ALL CONTRIBUTORS HEREBY DISCLAIM
* ALL SUCH WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR
* NON-INFRINGEMENT. Please see the License for the specific language
* governing rights and limitations under the License.
*
* ========================================================================
*
* Description: WHEN YOU FIGURE OUT WHAT THIS FILE DOES, PLEASE
* DESCRIBE IT HERE!
*
****************************************************************************/
#include "dbgdefn.h"
#include "dbginfo.h"
#include "dbglit.h"
#include "namelist.h"
#include "dui.h"
#include <string.h>
typedef struct sorted_names {
struct sorted_names *next;
bool code;
bool data;
bool d2_only;
bool dup_ok;
mod_handle mod;
name_list list;
} sorted_names;
sorted_names *SortedNames = NULL;
extern char *TxtBuff;
name_list *SymCompInit( bool code, bool data, bool d2_only, bool dup_ok, mod_handle mod )
{
void *old;
sorted_names *curr;
for( curr = SortedNames; curr != NULL; curr = curr->next ) {
if( code != curr->code ) continue;
if( data != curr->data ) continue;
if( d2_only != curr->d2_only ) continue;
if( dup_ok != curr->dup_ok ) continue;
if( mod != curr->mod ) continue;
return( &curr->list );
}
old = DUIHourGlass( NULL );
_Alloc( curr, sizeof( *curr ) );
NameListInit( &curr->list, ( code ? WF_CODE : 0 ) + ( data ? WF_DATA : 0 ) );
NameListAddModules( &curr->list, mod, d2_only, dup_ok );
DUIHourGlass( old );
curr->next = SortedNames;
SortedNames = curr;
curr->code = code;
curr->data = data;
curr->d2_only = d2_only;
curr->dup_ok = dup_ok;
curr->mod = mod;
return( &curr->list );
}
extern void SymCompFini()
{
sorted_names *curr, *next;
for( curr = SortedNames; curr != NULL; curr = next ) {
next = curr->next;
NameListFree( &curr->list );
_Free( curr );
}
SortedNames = NULL;
}
extern void SymCompMatches( name_list *list, char *match, unsigned *pfirst, unsigned *plast )
{
unsigned first,last;
unsigned len;
len = strlen( match );
for( first = 0; first < NameListNumRows( list ); ++first ) {
NameListName( list, first, TxtBuff, SN_SOURCE );
if( strnicmp( match, TxtBuff, len ) == 0 ) break;
}
for( last = first; last < NameListNumRows( list ); ++last ) {
NameListName( list, last, TxtBuff, SN_SOURCE );
if( strnicmp( match, TxtBuff, len ) != 0 ) break;
}
*pfirst = first;
*plast = last;
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?