fivedev/harbour-core
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2000-11-23 10:00 UTC+0800 Ron Pinkas <ron@profit-master.com>

Browse Source 
* source/rtl/idle.c
   * source/rtl/inkey.c
     ! Improved granularity of Idle Processing:
         - GC is called only once per Wait Session.
	 - Single Idle Task is performed for each itteration of hb_idleState() but never more than once per Wait Session.
	 - ReleaseCPU() is guaranteed to be the only code executing for the remainder of every Wait Session.

   /* Maurilio, Ryszard, Victor, could you please review and comment... */
This commit is contained in:
Ron Pinkas
2000-11-23 18:03:34 +00:00
parent bd390ae537
commit cf7e118180
3 changed files with 65 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
harbour/ChangeLog
View File

@@ -1,3 +1,13 @@
2000-11-23 10:00 UTC+0800 Ron Pinkas <ron@profit-master.com>
* source/rtl/idle.c
* source/rtl/inkey.c
! Improved granularity of Idle Processing:
- GC is called only once per Wait Session.
- Single Idle Task is performed for each itteration of hb_idleState() but never more than once per Wait Session.
- ReleaseCPU() is guaranteed to be the only code executing for the remainder of every Wait Session.
/* Maurilio, Ryszard, Victor, could you please review and comment... */
2000-11-23 13:32 GMT+1 Maurilio Longo <maurilio.longo@libero.it>
* source/rtl/teditor.prg
! fixed K_DEL handling

55
harbour/source/rtl/idle.c
View File

@@ -56,17 +56,21 @@
/* list of background tasks */
static HB_ITEM_PTR s_pIdleTasks = NULL;
/* current task to be executed */
static USHORT s_uiIdleTask = 0;
/* number of tasks in the list */
static USHORT s_uiIdleMaxTask = 0;
/* flag to prevent recursive calls of hb_idleState() */
static BOOL s_bIamIdle = FALSE;
/* current task to be executed */
USHORT hb_vm_uiIdleTask = 0;
/* number of tasks in the list */
USHORT hb_vm_uiIdleMaxTask = 0;
/* flag to indicate GarbageCollection should be done in idle state. */
BOOL hb_vm_bCollectGarbage = TRUE;
int hb_inkeyNext( void ); /* Return the next key without extracting it */
static void hb_releaseCPU( void )
{
HB_TRACE(HB_TR_DEBUG, ("releaseCPU()"));
@@ -120,20 +124,25 @@ void hb_idleState( void )
if( ! s_bIamIdle )
{
s_bIamIdle = TRUE;
hb_gcCollectAll();
if( s_pIdleTasks )
if( hb_vm_bCollectGarbage )
{
hb_vmEvalBlock( s_pIdleTasks + s_uiIdleTask );
if( ++s_uiIdleTask == s_uiIdleMaxTask )
s_uiIdleTask = 0;
hb_vm_bCollectGarbage = FALSE;
hb_gcCollectAll();
s_bIamIdle = FALSE;
return;
}
if (hb_inkeyNext() == 0) {
hb_releaseCPU();
if( s_pIdleTasks && hb_vm_uiIdleTask < hb_vm_uiIdleMaxTask )
{
hb_vmEvalBlock( s_pIdleTasks + hb_vm_uiIdleTask );
++hb_vm_uiIdleTask;
s_bIamIdle = FALSE;
return;
}
hb_releaseCPU();
s_bIamIdle = FALSE;
}
}
@@ -144,7 +153,7 @@ void hb_idleShutDown( void )
if( s_pIdleTasks )
{
HB_ITEM_PTR pItem = s_pIdleTasks;
while( s_uiIdleMaxTask-- )
while( hb_vm_uiIdleMaxTask-- )
{
hb_gcUnlock( pItem->item.asBlock.value );
hb_itemClear( pItem );
@@ -168,16 +177,16 @@ HB_FUNC( HB_IDLEADD )
if( pBlock )
{
++s_uiIdleMaxTask;
++hb_vm_uiIdleMaxTask;
if( !s_pIdleTasks )
{
s_pIdleTasks = ( HB_ITEM_PTR ) hb_xgrab( sizeof( HB_ITEM ) );
}
else
{
s_pIdleTasks = ( HB_ITEM_PTR ) hb_xrealloc( s_pIdleTasks, sizeof( HB_ITEM ) * s_uiIdleMaxTask );
s_pIdleTasks = ( HB_ITEM_PTR ) hb_xrealloc( s_pIdleTasks, sizeof( HB_ITEM ) * hb_vm_uiIdleMaxTask );
}
hb_itemCopy( s_pIdleTasks + s_uiIdleMaxTask - 1, pBlock );
hb_itemCopy( s_pIdleTasks + hb_vm_uiIdleMaxTask - 1, pBlock );
/* prevent releasing if this block if it is no longer stored inside of
* a harbour variable
*/
@@ -201,20 +210,20 @@ HB_FUNC( HB_IDLEDEL )
HB_ITEM_PTR pItem = s_pIdleTasks;
iTask = 0;
while( iTask < s_uiIdleMaxTask && !bFound )
while( iTask < hb_vm_uiIdleMaxTask && !bFound )
{
if( ulID == ( ULONG ) pItem->item.asBlock.value )
{
hb_gcUnlockItem( pItem );
hb_itemClear( hb_itemReturn( pItem ) ); /* return a codeblock */
--s_uiIdleMaxTask;
if( s_uiIdleMaxTask )
--hb_vm_uiIdleMaxTask;
if( hb_vm_uiIdleMaxTask )
{
if( iTask != s_uiIdleMaxTask )
if( iTask != hb_vm_uiIdleMaxTask )
memcpy( &s_pIdleTasks[ iTask ], &s_pIdleTasks[ iTask + 1 ],
sizeof( HB_ITEM ) * (s_uiIdleMaxTask - iTask) );
s_pIdleTasks = ( HB_ITEM_PTR ) hb_xrealloc( s_pIdleTasks, sizeof( HB_ITEM ) * s_uiIdleMaxTask );
sizeof( HB_ITEM ) * (hb_vm_uiIdleMaxTask - iTask) );
s_pIdleTasks = ( HB_ITEM_PTR ) hb_xrealloc( s_pIdleTasks, sizeof( HB_ITEM ) * hb_vm_uiIdleMaxTask );
}
else
{

23
harbour/source/rtl/inkey.c
View File

@@ -66,6 +66,13 @@ static BOOL s_inkeyPoll; /* Flag to override no polling when TYPEAHEAD i
static int s_inkeyForce; /* Variable to hold keyboard input when TYPEAHEAD is 0 */
static HB_inkey_enum s_eventmask;
/* current task to be executed */
extern USHORT hb_vm_uiIdleTask;
/* number of tasks in the list */
extern USHORT hb_vm_uiIdleMaxTask;
/* flag to indicate GarbageCollection should be done in idle state. */
extern BOOL hb_vm_bCollectGarbage;
int hb_inkey( BOOL bWait, double dSeconds, HB_inkey_enum event_mask )
{
int key;
@@ -84,7 +91,15 @@ int hb_inkey( BOOL bWait, double dSeconds, HB_inkey_enum event_mask )
if( ( event_mask & ( INKEY_ALL + INKEY_RAW ) ) != 0 )
{
while( hb_inkeyNext() == 0 )
{
hb_idleState();
}
if( hb_vm_uiIdleTask == hb_vm_uiIdleMaxTask )
{
hb_vm_uiIdleTask = 0;
hb_vm_bCollectGarbage = TRUE;
}
}
}
else
@@ -92,7 +107,15 @@ int hb_inkey( BOOL bWait, double dSeconds, HB_inkey_enum event_mask )
clock_t end_clock = clock() + ( clock_t ) ( dSeconds * CLOCKS_PER_SEC );
while( hb_inkeyNext() == 0 && clock() < end_clock )
{
hb_idleState();
}
if( hb_vm_uiIdleTask == hb_vm_uiIdleMaxTask )
{
hb_vm_uiIdleTask = 0;
hb_vm_bCollectGarbage = TRUE;
}
}
}