* config/w32/install.cf
* doc/man/hbdoc.1
* doc/en/tlabel.txt
* doc/en/set.txt
* doc/en/readme.txt
* doc/hbmake.txt
* doc/es/tlabel.txt
* doc/es/rdd.txt
* doc/es/hbpplib.txt
* doc/es/treport.txt
* doc/es/dirstruc.txt
* doc/es/dir.txt
* doc/es/file.txt
* doc/es/readme.txt
* doc/whatsnew.txt
* source/rtl/setkey.c
* source/rtl/tclass.prg
* source/compiler/cmdcheck.c
* contrib/hbmysql/utils/dbf2mysq.prg
* contrib/hbw32ddr/readme.txt
* contrib/hbodbc/odbc.txt
* contrib/hbodbc/readme.txt
* contrib/hbwhat32/_wincdlg.c
* contrib/hbtpathy/ChangeLog
* contrib/hbsqlit2/tests/hbsqlite.prg
* contrib/hbapollo/ChangeLog
* contrib/hbnf/byteneg.prg
* contrib/hbnf/savearr.prg
* contrib/hbnf/fttext.c
* contrib/hbnf/restsets.prg
* contrib/hbnf/byt2bit.prg
* contrib/hbnf/byt2hex.prg
* contrib/hbnf/ftint86.ch
* contrib/hbnf/byteand.prg
* contrib/hbnf/bytexor.prg
* contrib/hbnf/byteor.prg
* contrib/hbnf/origin.c
* contrib/hbnf/bitset.prg
* contrib/hbnf/popadder.prg
* contrib/hbnf/menutonf.prg
* contrib/hbnf/ftattr.c
* contrib/hbnf/isbit.prg
* contrib/hbnf/putkey.c
* contrib/hbnf/getenvrn.c
* contrib/hbnf/bytenot.prg
* contrib/hbnf/savesets.prg
* contrib/hbnf/tbwhile.prg
* contrib/hbnf/ftmenuto.ch
* contrib/hbnf/bitclr.prg
* contrib/hbnf/readme.txt
* contrib/rddads/doc/en/adsfuncs.txt
* contrib/rddads/doc/en/readme.txt
* contrib/rddads/readme.txt
* contrib/hbgd/ChangeLog
* contrib/hbgd/readme.txt
* contrib/hbmisc/hb_f.c
* contrib/hbtip/utils.c
* contrib/hbbtree/doc/hb_btree.txt
* contrib/examples/guestbk/guestbk.txt
* contrib/examples/hscript/readme.txt
* utils/hbdoc/genos2.prg
* utils/hbdoc/genng.prg
* utils/hbdoc/genasc.prg
* utils/hbdoc/genchm.prg
* utils/hbdoc/genhpc.prg
* utils/hbdoc/html.prg
* utils/hbdoc/ft_funcs.prg
* utils/hbdoc/hbdoc.prg
* utils/hbdoc/genpdf1.prg
* utils/hbdoc/gentrf.prg
* utils/hbdoc/genrtf.prg
* utils/hbmake/checks.prg
* utils/hbmake/ft_funcs.prg
* utils/hbmake/radios.prg
* utils/hbmake/hbmake.prg
! Some more filename casing related cleanups.
345 lines
9.9 KiB
C
345 lines
9.9 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* SETKEY() and related functions
|
|
*
|
|
* Copyright 1999 A White <awhite@mail.rosecom.ca>
|
|
* www - http://www.harbour-project.org
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2, or (at your option)
|
|
* any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this software; see the file COPYING. If not, write to
|
|
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/).
|
|
*
|
|
* As a special exception, the Harbour Project gives permission for
|
|
* additional uses of the text contained in its release of Harbour.
|
|
*
|
|
* The exception is that, if you link the Harbour libraries with other
|
|
* files to produce an executable, this does not by itself cause the
|
|
* resulting executable to be covered by the GNU General Public License.
|
|
* Your use of that executable is in no way restricted on account of
|
|
* linking the Harbour library code into it.
|
|
*
|
|
* This exception does not however invalidate any other reasons why
|
|
* the executable file might be covered by the GNU General Public License.
|
|
*
|
|
* This exception applies only to the code released by the Harbour
|
|
* Project under the name Harbour. If you copy code from other
|
|
* Harbour Project or Free Software Foundation releases into a copy of
|
|
* Harbour, as the General Public License permits, the exception does
|
|
* not apply to the code that you add in this way. To avoid misleading
|
|
* anyone as to the status of such modified files, you must delete
|
|
* this exception notice from them.
|
|
*
|
|
* If you write modifications of your own for Harbour, it is your choice
|
|
* whether to permit this exception to apply to your modifications.
|
|
* If you do not wish that, delete this exception notice.
|
|
*
|
|
*/
|
|
|
|
/*
|
|
Either way you have to clean up the memory on exit. The best way to
|
|
do this is to add a hb_setkeyInit() and hb_setkeyExit() function
|
|
and call them from console.c Init/Exit functions.
|
|
*/
|
|
|
|
#include "hbvm.h"
|
|
#include "hbapi.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapigt.h"
|
|
|
|
typedef struct HB_SETKEY_
|
|
{
|
|
SHORT iKeyCode;
|
|
PHB_ITEM pAction;
|
|
PHB_ITEM pIsActive;
|
|
struct HB_SETKEY_ * next;
|
|
} HB_SETKEY, * PHB_SETKEY;
|
|
|
|
static PHB_SETKEY s_sk_list;
|
|
|
|
void hb_setkeyInit( void )
|
|
{
|
|
s_sk_list = NULL;
|
|
}
|
|
|
|
void hb_setkeyExit( void )
|
|
{
|
|
while( s_sk_list )
|
|
{
|
|
PHB_SETKEY sk_list_tmp;
|
|
|
|
hb_itemRelease( s_sk_list->pAction );
|
|
if( s_sk_list->pIsActive )
|
|
{
|
|
hb_itemRelease( s_sk_list->pIsActive );
|
|
}
|
|
sk_list_tmp = s_sk_list->next;
|
|
hb_xfree( ( void * ) s_sk_list );
|
|
s_sk_list = sk_list_tmp;
|
|
}
|
|
|
|
s_sk_list = NULL;
|
|
}
|
|
|
|
static PHB_SETKEY sk_findkey( SHORT iKeyCode, PHB_SETKEY * sk_list_end )
|
|
{
|
|
PHB_SETKEY sk_list_tmp;
|
|
|
|
*sk_list_end = NULL;
|
|
for( sk_list_tmp = s_sk_list;
|
|
sk_list_tmp && sk_list_tmp->iKeyCode != iKeyCode;
|
|
sk_list_tmp = sk_list_tmp->next )
|
|
*sk_list_end = sk_list_tmp;
|
|
|
|
return sk_list_tmp;
|
|
}
|
|
|
|
static void sk_add( BOOL bReturn, SHORT iKeyCode, PHB_ITEM pAction, PHB_ITEM pIsActive )
|
|
{
|
|
if( iKeyCode )
|
|
{
|
|
PHB_SETKEY sk_list_tmp, sk_list_end;
|
|
|
|
if( pIsActive && !HB_IS_BLOCK( pIsActive ) )
|
|
pIsActive = NULL;
|
|
if( pAction && !HB_IS_BLOCK( pAction ) )
|
|
pAction = NULL;
|
|
|
|
sk_list_tmp = sk_findkey( iKeyCode, &sk_list_end );
|
|
if( sk_list_tmp == NULL )
|
|
{
|
|
if( pAction )
|
|
{
|
|
sk_list_tmp = ( PHB_SETKEY ) hb_xgrab( sizeof( HB_SETKEY ) );
|
|
sk_list_tmp->next = NULL;
|
|
sk_list_tmp->iKeyCode = iKeyCode;
|
|
sk_list_tmp->pAction = hb_itemNew( pAction );
|
|
sk_list_tmp->pIsActive = pIsActive ? hb_itemNew( pIsActive ) : NULL;
|
|
|
|
if( sk_list_end == NULL )
|
|
s_sk_list = sk_list_tmp;
|
|
else
|
|
sk_list_end->next = sk_list_tmp;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Return the previous value */
|
|
|
|
if( bReturn )
|
|
hb_itemReturn( sk_list_tmp->pAction );
|
|
|
|
/* Free the previous values */
|
|
|
|
hb_itemRelease( sk_list_tmp->pAction );
|
|
if( sk_list_tmp->pIsActive )
|
|
{
|
|
hb_itemRelease( sk_list_tmp->pIsActive );
|
|
}
|
|
/* Set the new values or free the entry */
|
|
|
|
if( pAction )
|
|
{
|
|
sk_list_tmp->pAction = hb_itemNew( pAction );
|
|
sk_list_tmp->pIsActive = pIsActive ? hb_itemNew( pIsActive ) : NULL;
|
|
}
|
|
else
|
|
{
|
|
/* if this is true, then the key found is the first key in the list */
|
|
if( sk_list_end == NULL )
|
|
{
|
|
sk_list_tmp = s_sk_list->next;
|
|
hb_xfree( s_sk_list );
|
|
s_sk_list = sk_list_tmp;
|
|
}
|
|
else
|
|
{
|
|
sk_list_end->next = sk_list_tmp->next;
|
|
hb_xfree( sk_list_tmp );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
HB_FUNC( SETKEY )
|
|
{
|
|
PHB_ITEM pKeyCode = hb_param( 1, HB_IT_NUMERIC );
|
|
|
|
if( pKeyCode )
|
|
{
|
|
/* Get a SETKEY value */
|
|
|
|
if( hb_pcount() == 1 )
|
|
{
|
|
PHB_SETKEY sk_list_tmp, sk_list_end;
|
|
|
|
/* sk_list_end is not used in this context */
|
|
sk_list_tmp = sk_findkey( hb_itemGetNI( pKeyCode ), &sk_list_end );
|
|
|
|
if( sk_list_tmp )
|
|
{
|
|
#if defined( HB_EXTENSION )
|
|
PHB_ITEM pIsActiveResults = sk_list_tmp->pIsActive ? hb_vmEvalBlockV( sk_list_tmp->pIsActive, 1, pKeyCode ) : NULL;
|
|
|
|
if( pIsActiveResults == NULL || ! HB_IS_LOGICAL( pIsActiveResults ) || hb_itemGetL( pIsActiveResults ) )
|
|
#endif
|
|
hb_itemReturn( sk_list_tmp->pAction );
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Set a SETKEY value */
|
|
|
|
sk_add( TRUE, hb_itemGetNI( pKeyCode ),
|
|
hb_param( 2, HB_IT_BLOCK ),
|
|
#if defined( HB_EXTENSION )
|
|
hb_param( 3, HB_IT_BLOCK ) );
|
|
#else
|
|
NULL );
|
|
#endif
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Sets the same block for an array of keycodes */
|
|
|
|
HB_FUNC( HB_SETKEYARRAY )
|
|
{
|
|
PHB_ITEM pKeyCodeArray = hb_param( 1, HB_IT_ARRAY );
|
|
PHB_ITEM pAction = hb_param( 2, HB_IT_BLOCK );
|
|
|
|
if( pKeyCodeArray && pAction )
|
|
{
|
|
PHB_ITEM pIsActive = hb_param( 3, HB_IT_BLOCK );
|
|
ULONG nLen = hb_arrayLen( pKeyCodeArray );
|
|
ULONG nPos;
|
|
|
|
for( nPos = 1; nPos <= nLen; nPos++ )
|
|
sk_add( FALSE, hb_arrayGetNI( pKeyCodeArray, nPos ), pAction, pIsActive );
|
|
}
|
|
}
|
|
|
|
HB_FUNC( HB_SETKEYGET )
|
|
{
|
|
PHB_ITEM pKeyCode = hb_param( 1, HB_IT_NUMERIC );
|
|
|
|
if( pKeyCode )
|
|
{
|
|
PHB_SETKEY sk_list_tmp, sk_list_end;
|
|
|
|
/* sk_list_end is not used in this context */
|
|
sk_list_tmp = sk_findkey( hb_itemGetNI( pKeyCode ), &sk_list_end );
|
|
|
|
if( sk_list_tmp )
|
|
{
|
|
PHB_ITEM pIsActive = hb_param( 2, HB_IT_ANY );
|
|
|
|
hb_itemReturn( sk_list_tmp->pAction );
|
|
|
|
if( pIsActive )
|
|
hb_itemCopy( pIsActive, sk_list_tmp->pIsActive );
|
|
}
|
|
}
|
|
}
|
|
|
|
HB_FUNC( HB_SETKEYSAVE )
|
|
{
|
|
PHB_ITEM pKeys, pKeyElements, pParam;
|
|
PHB_SETKEY sk_list_tmp;
|
|
ULONG itemcount, nitem;
|
|
|
|
/* build an multi-dimensional array from existing hot-keys, and return it */
|
|
|
|
/* count the number of items in the list */
|
|
for( itemcount = 0, sk_list_tmp = s_sk_list;
|
|
sk_list_tmp;
|
|
itemcount++, sk_list_tmp = sk_list_tmp->next )
|
|
;
|
|
|
|
pKeys = hb_itemArrayNew( itemcount );
|
|
pKeyElements = hb_itemNew( NULL );
|
|
|
|
for( nitem = 1, sk_list_tmp = s_sk_list;
|
|
nitem <= itemcount;
|
|
nitem++, sk_list_tmp = sk_list_tmp->next )
|
|
{
|
|
hb_arrayNew( pKeyElements, 3 );
|
|
hb_arraySetNI( pKeyElements, 1, sk_list_tmp->iKeyCode );
|
|
hb_arraySet( pKeyElements, 2, sk_list_tmp->pAction );
|
|
if( sk_list_tmp->pIsActive )
|
|
hb_arraySet( pKeyElements, 3, sk_list_tmp->pIsActive );
|
|
hb_arraySetForward( pKeys, nitem, pKeyElements );
|
|
}
|
|
hb_itemRelease( pKeyElements );
|
|
hb_itemReturnRelease( pKeys );
|
|
|
|
pParam = hb_param( 1, HB_IT_ANY );
|
|
if( pParam )
|
|
{
|
|
hb_setkeyExit(); /* destroy the internal list */
|
|
|
|
if( HB_IS_ARRAY( pParam ) )
|
|
{
|
|
itemcount = hb_arrayLen( pParam );
|
|
|
|
for( nitem = 1; nitem <= itemcount; nitem++ )
|
|
{
|
|
PHB_ITEM itmKeyElements = hb_arrayGetItemPtr( pParam, nitem );
|
|
|
|
sk_add( FALSE, ( SHORT ) hb_arrayGetNI( itmKeyElements, 1 ),
|
|
hb_arrayGetItemPtr( itmKeyElements, 2 ),
|
|
hb_arrayGetItemPtr( itmKeyElements, 3 ) );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
HB_FUNC( HB_SETKEYCHECK )
|
|
{
|
|
PHB_ITEM pKeyCode = hb_param( 1, HB_IT_NUMERIC );
|
|
BOOL bIsKeySet = FALSE;
|
|
|
|
if( pKeyCode )
|
|
{
|
|
PHB_SETKEY sk_list_tmp, sk_list_end;
|
|
|
|
/* sk_list_end is not used in this context */
|
|
sk_list_tmp = sk_findkey( hb_itemGetNI( pKeyCode ), &sk_list_end );
|
|
|
|
if( sk_list_tmp )
|
|
{
|
|
PHB_ITEM pIsActiveResults = sk_list_tmp->pIsActive ? hb_vmEvalBlockV( sk_list_tmp->pIsActive, 1, pKeyCode ) : NULL;
|
|
|
|
if( pIsActiveResults == NULL || ! HB_IS_LOGICAL( pIsActiveResults ) || hb_itemGetL( pIsActiveResults ) )
|
|
{
|
|
bIsKeySet = TRUE;
|
|
|
|
switch( hb_pcount() )
|
|
{
|
|
case 1: hb_vmEvalBlockV( sk_list_tmp->pAction, 1, pKeyCode ); break;
|
|
case 2: hb_vmEvalBlockV( sk_list_tmp->pAction, 2, hb_param( 2, HB_IT_ANY ), pKeyCode ); break;
|
|
case 3: hb_vmEvalBlockV( sk_list_tmp->pAction, 3, hb_param( 2, HB_IT_ANY ), hb_param( 3, HB_IT_ANY ), pKeyCode ); break;
|
|
default: hb_vmEvalBlockV( sk_list_tmp->pAction, 4, hb_param( 2, HB_IT_ANY ), hb_param( 3, HB_IT_ANY ), hb_param( 4, HB_IT_ANY ), pKeyCode ); break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
hb_retl( bIsKeySet );
|
|
}
|