source: trunk/kernel/kern/scheduler.c @ 675

Last change on this file since 675 was 669, checked in by alain, 4 years ago

1) Introduce up to 4 command lines arguments in the KSH "load" command.
These arguments are transfered to the user process through the
argc/argv mechanism, using the user space "args" vseg.

2) Introduce the named and anonymous "pipes", for inter-process communication
through the pipe() and mkfifo() syscalls.

3) Introduce the "chat" application to validate the two above mechanisms.

4) Improve printk() and assert() fonctions in printk.c.

File size: 23.8 KB
Line 
1/*
2 * scheduler.c - Core scheduler implementation.
3 *
4 * Author    Alain Greiner (2016,2017,2018)
5 *
6 * Copyright (c)  UPMC Sorbonne Universites
7 *
8 * This file is part of ALMOS-MKH.
9 *
10 * ALMOS-MKH. is free software; you can redistribute it and/or modify it
11 * under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; version 2.0 of the License.
13 *
14 * ALMOS-MKH. is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
17 * General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with ALMOS-MKH.; if not, write to the Free Software Foundation,
21 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 */
23
24#include <kernel_config.h>
25#include <hal_kernel_types.h>
26#include <hal_switch.h>
27#include <hal_irqmask.h>
28#include <hal_context.h>
29#include <printk.h>
30#include <list.h>
31#include <rpc.h>
32#include <core.h>
33#include <thread.h>
34#include <chdev.h>
35#include <scheduler.h>
36
37
38///////////////////////////////////////////////////////////////////////////////////////////
39//         global variables
40///////////////////////////////////////////////////////////////////////////////////////////
41
42extern chdev_directory_t    chdev_dir;          // allocated in kernel_init.c
43extern process_t            process_zero;       // allocated in kernel_init.c
44
45///////////////////////////////////////////////////////////////////////////////////////////
46//         private functions
47///////////////////////////////////////////////////////////////////////////////////////////
48
49
50////////////////////////////////////////////////////////////////////////////////////////////
51// This static function does NOT modify the scheduler state.
52// It just select a thread in the list of attached threads, implementing the following
53// three steps policy:
54// 1) It scan the list of kernel threads, from the next thread after the last executed one,
55//    and returns the first runnable found : not IDLE, not blocked, client queue not empty.
56//    It can be the current thread.
57// 2) If no kernel thread found, it scan the list of user thread, from the next thread after
58//    the last executed one, and returns the first runable found : not blocked.
59//    It can be the current thread.
60// 3) If no runable thread found, it returns the idle thread.
61////////////////////////////////////////////////////////////////////////////////////////////
62// @ sched   : local pointer on scheduler.
63// @ returns pointer on selected thread descriptor
64////////////////////////////////////////////////////////////////////////////////////////////
65static thread_t * sched_select( scheduler_t * sched )
66{
67    thread_t     * thread;
68    list_entry_t * current;
69    list_entry_t * last;
70    list_entry_t * root;
71    bool_t         done;
72    uint32_t       count;
73
74    // first : scan the kernel threads list if not empty
75    if( list_is_empty( &sched->k_root ) == false )
76    {
77        root    = &sched->k_root;
78        last    = sched->k_last;
79        done    = false;
80        count   = 0;
81        current = last;
82
83        while( done == false )
84        {
85
86// check kernel threads list
87assert( __FUNCTION__, (count < sched->k_threads_nr), "bad kernel threads list" );
88
89            // get next entry in kernel list
90            current = current->next;
91
92            // check exit condition
93            if( current == last ) done = true;
94
95            // skip the root that does not contain a thread
96            if( current == root ) continue;
97            else                  count++;
98
99            // get thread pointer for this entry
100            thread = LIST_ELEMENT( current , thread_t , sched_list );
101
102            // select kernel thread if non blocked and non THREAD_IDLE
103            if( (thread->blocked == 0)  && (thread->type != THREAD_IDLE) ) return thread;
104
105        } // end loop on kernel threads
106    } // end kernel threads
107
108    // second : scan the user threads list if not empty
109    if( list_is_empty( &sched->u_root ) == false )
110    {
111        root    = &sched->u_root;
112        last    = sched->u_last;
113        done    = false;
114        count   = 0;
115        current = last;
116
117        while( done == false )
118        {
119
120// check user threads list
121assert( __FUNCTION__, (count < sched->u_threads_nr), "bad user threads list" );
122
123            // get next entry in user list
124            current = current->next;
125
126            // check exit condition
127            if( current == last ) done = true;
128
129            // skip the root that does not contain a thread
130            if( current == root ) continue;
131            else                  count++;
132
133            // get thread pointer for this entry
134            thread = LIST_ELEMENT( current , thread_t , sched_list );
135
136            // select thread if non blocked
137            if( thread->blocked == 0 )  return thread;
138
139        } // end loop on user threads
140    } // end user threads
141
142    // third : return idle thread if no other runnable thread
143    return sched->idle;
144
145}  // end sched_select()
146
147////////////////////////////////////////////////////////////////////////////////////////////
148// This static function is the only function that can actually delete a thread,
149// (and the associated process descriptor if required).
150// It is private, because it is only called by the sched_yield() public function.
151// It scan all threads attached to a given scheduler, and executes the relevant
152// actions for two types of pending requests:
153//
154// - REQ_ACK : it checks that target thread is blocked, decrements the response counter
155//   to acknowledge the client thread, and reset the pending request.
156// - REQ_DELETE : it removes the target thread from the process th_tbl[], remove it
157//   from the scheduler list, and release the memory allocated to thread descriptor.
158//   For an user thread, it destroys the process descriptor it the target thread is
159//   the last thread in the local process descriptor.
160//
161// Implementation note:
162// We use a while to scan the threads in scheduler lists, because some threads can
163// be destroyed, and we want not use a LIST_FOREACH()
164////////////////////////////////////////////////////////////////////////////////////////////
165// @ core    : local pointer on the core descriptor.
166////////////////////////////////////////////////////////////////////////////////////////////
167static void sched_handle_signals( core_t * core )
168{
169
170    list_entry_t * iter;
171    list_entry_t * root;
172    thread_t     * thread;
173    process_t    * process;
174    scheduler_t  * sched;
175    uint32_t       threads_nr;   // number of threads in scheduler list
176    ltid_t         ltid;         // thread local index
177    uint32_t       count;        // number of threads in local process
178
179    // get pointer on scheduler
180    sched = &core->scheduler;
181
182    ////////////////// scan user threads to handle ACK and DELETE requests
183    root = &sched->u_root;
184    iter = root->next;
185    while( iter != root )
186    {
187        // get pointer on thread
188        thread = LIST_ELEMENT( iter , thread_t , sched_list );
189
190        // increment iterator
191        iter = iter->next;
192
193        // handle REQ_ACK
194        if( thread->flags & THREAD_FLAG_REQ_ACK )
195        {
196
197// check target thread blocked
198assert( __FUNCTION__, (thread->blocked & THREAD_BLOCKED_GLOBAL) , "thread not blocked" );
199 
200            // decrement response counter
201            hal_atomic_add( thread->ack_rsp_count , -1 );
202
203            // reset REQ_ACK in thread descriptor
204            thread_reset_req_ack( thread );
205        }
206
207        // handle REQ_DELETE only if target thread != calling thread
208        if( thread->flags & THREAD_FLAG_REQ_DELETE )
209        {
210
211// check calling thread != target thread
212assert( __FUNCTION__, (thread != CURRENT_THREAD) , "calling thread cannot delete itself" );
213 
214            // get thread process descriptor
215            process = thread->process;
216
217            // get thread ltid
218            ltid = LTID_FROM_TRDID( thread->trdid);
219
220            // take the lock protecting sheduler state
221            busylock_acquire( &sched->lock );
222
223            // update scheduler state
224            threads_nr = sched->u_threads_nr;
225            sched->u_threads_nr = threads_nr - 1;
226            list_unlink( &thread->sched_list );
227            if( sched->u_last == &thread->sched_list )
228            {
229                if( threads_nr == 1 ) 
230                {
231                    sched->u_last = NULL;
232                }
233                else if( sched->u_root.next == &thread->sched_list )
234                {
235                    sched->u_last = sched->u_root.pred;
236                }
237                else
238                {
239                    sched->u_last = sched->u_root.next;
240                }
241            }
242
243            // release the lock protecting sheduler state
244            busylock_release( &sched->lock );
245
246            // release memory allocated for thread
247            count = thread_destroy( thread );
248
249            hal_fence();
250
251#if DEBUG_SCHED_HANDLE_SIGNALS
252uint32_t cycle = (uint32_t)hal_get_cycles();
253if( DEBUG_SCHED_HANDLE_SIGNALS < cycle )
254printk("\n[%s] thread[%x,%x] on core[%x,%d] deleted / cycle %d\n",
255__FUNCTION__, process->pid, thread->trdid, local_cxy, thread->core->lid, cycle );
256#endif
257            // destroy process descriptor if last thread
258            if( count == 1 ) 
259            {
260                // delete process   
261                process_destroy( process );
262
263#if DEBUG_SCHED_HANDLE_SIGNALS
264cycle = (uint32_t)hal_get_cycles();
265if( DEBUG_SCHED_HANDLE_SIGNALS < cycle )
266printk("\n[%s] process %x in cluster %x deleted / cycle %d\n",
267__FUNCTION__ , process->pid , local_cxy , cycle );
268#endif
269            }
270        }
271    }  // end user threads
272
273    ///////////// scan kernel threads for DELETE only
274    root = &sched->k_root;
275    iter = root->next;
276    while( iter != root )
277    {
278        // get pointer on thread
279        thread = LIST_ELEMENT( iter , thread_t , sched_list );
280
281        // increment iterator
282        iter = iter->next;
283
284        // handle REQ_DELETE only if target thread != calling thread
285        if( (thread->flags & THREAD_FLAG_REQ_DELETE) && (thread != CURRENT_THREAD) )
286        {
287
288// check process descriptor is local kernel process
289assert( __FUNCTION__, ( thread->process == &process_zero ) , "illegal process descriptor");
290
291            // get thread ltid
292            ltid = LTID_FROM_TRDID( thread->trdid);
293
294            // take the lock protecting sheduler state
295            busylock_acquire( &sched->lock );
296
297            // update scheduler state
298            threads_nr = sched->k_threads_nr;
299            sched->k_threads_nr = threads_nr - 1;
300            list_unlink( &thread->sched_list );
301            if( sched->k_last == &thread->sched_list )
302            {
303                if( threads_nr == 1 ) 
304                {
305                    sched->k_last = NULL;
306                }
307                else if( sched->k_root.next == &thread->sched_list )
308                {
309                    sched->k_last = sched->k_root.pred;
310                }
311                else
312                {
313                    sched->k_last = sched->k_root.next;
314                }
315            }
316
317            // release the lock protecting sheduler state
318            busylock_release( &sched->lock );
319
320            // get number of threads in local kernel process
321            count = process_zero.th_nr;
322
323// check th_nr value
324assert( __FUNCTION__, (process_zero.th_nr > 0) , "kernel process th_nr cannot be 0" );
325
326            // remove thread from process th_tbl[]
327            process_zero.th_tbl[ltid] = NULL;
328            hal_atomic_add( &process_zero.th_nr , - 1 );
329 
330            // delete thread descriptor
331            thread_destroy( thread );
332
333#if DEBUG_SCHED_HANDLE_SIGNALS
334uint32_t cycle = (uint32_t)hal_get_cycles();
335if( DEBUG_SCHED_HANDLE_SIGNALS < cycle )
336printk("\n[%s] thread[%x,%x] on core[%x,%d] deleted / cycle %d\n",
337__FUNCTION__ , process_zero.pid , thread->trdid , local_cxy , thread->core->lid , cycle );
338#endif
339        }
340    }
341} // end sched_handle_signals()
342
343////////////////////////////////////////////////////////////////////////////////////////////
344// This static function is called by the sched_yield function when the RFC_FIFO
345// associated to the core is not empty.
346// It search an idle RPC thread for this core, and unblock it if found.
347// It creates a new RPC thread if no idle RPC thread is found.
348////////////////////////////////////////////////////////////////////////////////////////////
349// @ sched   : local pointer on scheduler.
350////////////////////////////////////////////////////////////////////////////////////////////
351static void sched_rpc_activate( scheduler_t * sched )
352{
353    error_t         error;
354    thread_t      * thread; 
355    list_entry_t  * iter;
356    lid_t           lid = CURRENT_THREAD->core->lid;
357    bool_t          found = false;
358
359    // search one IDLE RPC thread associated to the selected core   
360    LIST_FOREACH( &sched->k_root , iter )
361    {
362        thread = LIST_ELEMENT( iter , thread_t , sched_list );
363
364        if( (thread->type == THREAD_RPC) && 
365            (thread->blocked == THREAD_BLOCKED_IDLE ) ) 
366        {
367            found = true;
368            break;
369        }
370    }
371
372    if( found == false )     // create new RPC thread     
373    {
374        error = thread_kernel_create( &thread,
375                                      THREAD_RPC, 
376                                              &rpc_server_func, 
377                                      NULL,
378                                          lid );
379        // check memory
380        if ( error )
381        {
382            printk("\n[ERROR] in %s : no memory to create a RPC thread in cluster %x\n",
383            __FUNCTION__, local_cxy );
384        }
385        else
386        {
387            // unblock created RPC thread
388            thread->blocked = 0;
389
390            // update RPC threads counter 
391            hal_atomic_add( &LOCAL_CLUSTER->rpc_threads[lid] , 1 );
392
393#if DEBUG_SCHED_RPC_ACTIVATE
394uint32_t cycle = (uint32_t)hal_get_cycles();
395if( DEBUG_SCHED_RPC_ACTIVATE < cycle ) 
396printk("\n[%s] new RPC thread %x created for core[%x,%d] / total %d / cycle %d\n",
397__FUNCTION__, thread->trdid, local_cxy, lid, LOCAL_CLUSTER->rpc_threads[lid], cycle );
398#endif
399        }
400    }
401    else                 // RPC thread found => unblock it
402    {
403        // unblock found RPC thread
404        thread_unblock( XPTR( local_cxy , thread ) , THREAD_BLOCKED_IDLE );
405
406#if DEBUG_SCHED_RPC_ACTIVATE
407uint32_t cycle = (uint32_t)hal_get_cycles();
408if( DEBUG_SCHED_RPC_ACTIVATE < cycle ) 
409printk("\n[%s] idle RPC thread %x unblocked for core[%x,%d] / cycle %d\n",
410__FUNCTION__, thread->trdid, local_cxy, lid, cycle );
411#endif
412
413    }
414
415} // end sched_rpc_activate()
416
417
418
419///////////////////////////////////////////////////////////////////////////////////////////
420//         public functions
421///////////////////////////////////////////////////////////////////////////////////////////
422
423////////////////////////////////
424void sched_init( core_t * core )
425{
426    scheduler_t * sched = &core->scheduler;
427
428    sched->u_threads_nr   = 0;
429    sched->k_threads_nr   = 0;
430
431    sched->current        = CURRENT_THREAD;
432    sched->idle           = NULL;               // initialized in kernel_init()
433    sched->u_last         = NULL;               // initialized in sched_register_thread()
434    sched->k_last         = NULL;               // initialized in sched_register_thread()
435
436    // initialise threads lists
437    list_root_init( &sched->u_root );
438    list_root_init( &sched->k_root );
439
440    // init lock
441    busylock_init( &sched->lock , LOCK_SCHED_STATE );
442
443    sched->req_ack_pending = false;             // no pending request
444    sched->trace           = false;             // context switches trace desactivated
445
446}  // end sched_init()
447
448////////////////////////////////////////////
449void sched_register_thread( core_t   * core,
450                            thread_t * thread )
451{
452    scheduler_t * sched = &core->scheduler;
453    thread_type_t type  = thread->type;
454
455    // take lock protecting sheduler state
456    busylock_acquire( &sched->lock );
457
458    if( type == THREAD_USER )
459    {
460        list_add_last( &sched->u_root , &thread->sched_list );
461        sched->u_threads_nr++;
462        if( sched->u_last == NULL ) sched->u_last = &thread->sched_list;
463    }
464    else // kernel thread
465    {
466        list_add_last( &sched->k_root , &thread->sched_list );
467        sched->k_threads_nr++;
468        if( sched->k_last == NULL ) sched->k_last = &thread->sched_list; 
469    }
470
471    // release lock
472    busylock_release( &sched->lock );
473
474}  // end sched_register_thread()
475
476//////////////////////////////////////////////////////////////////
477void sched_yield( const char * cause __attribute__((__unused__)) )
478{
479    thread_t      * next;
480    thread_t      * current = CURRENT_THREAD;
481    core_t        * core    = current->core;
482    lid_t           lid     = core->lid;
483    scheduler_t   * sched   = &core->scheduler;
484    remote_fifo_t * fifo    = &LOCAL_CLUSTER->rpc_fifo[lid]; 
485 
486#if DEBUG_SCHED_YIELD
487uint32_t cycle = (uint32_t)hal_get_cycles();
488#endif
489
490#if (DEBUG_SCHED_YIELD & 0x1)
491if( sched->trace || (cycle > DEBUG_SCHED_YIELD) )
492sched_remote_display( local_cxy , lid );
493#endif
494
495// This assert should always be true, as this check has been
496// done before, by any function that can possibly deschedule...
497assert( __FUNCTION__, (current->busylocks == 0),
498"current thread hold %d busylocks\n", current->busylocks ); 
499
500    // activate or create an RPC thread if RPC_FIFO non empty
501    if( remote_fifo_is_empty( fifo ) == false )  sched_rpc_activate( sched );
502
503    // disable IRQs / save SR in current thread descriptor
504    hal_disable_irq( &current->save_sr );
505
506    // take lock protecting sheduler state
507    busylock_acquire( &sched->lock );
508   
509    // select next thread
510    next = sched_select( sched );
511
512// check next thread kernel_stack overflow
513assert( __FUNCTION__, (next->signature == THREAD_SIGNATURE),
514"kernel stack overflow for thread %x on core[%x,%d]", next, local_cxy, lid );
515
516// check next thread attached to same core as the current thread
517assert( __FUNCTION__, (next->core == current->core),
518"next_core_lid %d / current_core_lid %d", current->core->lid, next->core->lid );
519   
520// check next thread not blocked when type != IDLE
521assert( __FUNCTION__, ((next->blocked == 0) || (next->type == THREAD_IDLE)) ,
522"next thread %x (%s) is blocked on core[%x,%d]", 
523next->trdid , thread_type_str(next->type) , local_cxy , lid );
524
525    // switch contexts and update scheduler state if next != current
526        if( next != current )
527    {
528        // update scheduler
529        sched->current = next;
530        if( next->type == THREAD_USER ) sched->u_last = &next->sched_list;
531        else                            sched->k_last = &next->sched_list;
532
533        // handle FPU ownership
534            if( next->type == THREAD_USER )
535        {
536                if( next == current->core->fpu_owner )  hal_fpu_enable();
537                else                                    hal_fpu_disable();
538        }
539
540        // release lock protecting scheduler state
541        busylock_release( &sched->lock );
542
543#if DEBUG_SCHED_YIELD
544if( sched->trace || (cycle > DEBUG_SCHED_YIELD) )
545printk("\n[%s] core[%x,%d] / cause = %s\n"
546"      thread %x (%s) (%x,%x) => thread %x (%s) (%x,%x) / cycle %d\n",
547__FUNCTION__, local_cxy, lid, cause, 
548current, thread_type_str(current->type), current->process->pid, current->trdid,next ,
549thread_type_str(next->type) , next->process->pid , next->trdid , cycle );
550#endif
551
552        // switch CPU from current thread context to new thread context
553        hal_do_cpu_switch( current->cpu_context, next->cpu_context );
554    }
555    else
556    {
557        // release lock protecting scheduler state
558        busylock_release( &sched->lock );
559
560#if DEBUG_SCHED_YIELD
561if( sched->trace || (cycle > DEBUG_SCHED_YIELD) )
562printk("\n[%s] core[%x,%d] / cause = %s\n"
563"      thread %x (%s) (%x,%x) continue / cycle %d\n",
564__FUNCTION__, local_cxy, lid, cause, current, thread_type_str(current->type),
565current->process->pid, current->trdid, (uint32_t)hal_get_cycles() );
566#endif
567
568    }
569
570    // handle pending requests for all threads executing on this core.
571    sched_handle_signals( core );
572
573    // exit critical section / restore SR from current thread descriptor
574    hal_restore_irq( CURRENT_THREAD->save_sr );
575
576}  // end sched_yield()
577
578
579/////////////////////////////////////
580void sched_remote_display( cxy_t cxy,
581                           lid_t lid )
582{
583    thread_t     * thread;
584
585    // get local pointer on target scheduler
586    core_t      * core  = &LOCAL_CLUSTER->core_tbl[lid];
587    scheduler_t * sched = &core->scheduler;
588
589    // get local pointer on current thread in target scheduler
590    thread_t * current = hal_remote_lpt( XPTR( cxy, &sched->current ) );
591
592    // get local pointer on the first kernel and user threads list_entry
593    list_entry_t * k_entry = hal_remote_lpt( XPTR( cxy , &sched->k_root.next ) );
594    list_entry_t * u_entry = hal_remote_lpt( XPTR( cxy , &sched->u_root.next ) );
595   
596    // get pointers on TXT0 chdev
597    xptr_t    txt0_xp  = chdev_dir.txt_tx[0];
598    cxy_t     txt0_cxy = GET_CXY( txt0_xp );
599    chdev_t * txt0_ptr = GET_PTR( txt0_xp );
600
601    // get extended pointer on remote TXT0 chdev lock
602    xptr_t  lock_xp = XPTR( txt0_cxy , &txt0_ptr->wait_lock );
603
604    // get TXT0 lock
605    remote_busylock_acquire( lock_xp );
606
607    // get rpc_threads
608    uint32_t rpcs = hal_remote_l32( XPTR( cxy , &LOCAL_CLUSTER->rpc_threads[lid] ) );
609 
610    // display header
611    nolock_printk("\n***** threads on core[%x,%d] / current %x / rpc_threads %d / cycle %d\n",
612    cxy , lid, current, rpcs, (uint32_t)hal_get_cycles() );
613    nolock_printk("  type | pid        | trdid      | desc       | block      | flags      | func\n");
614
615    // display kernel threads
616    while( k_entry != &sched->k_root )
617    {
618        // get local pointer on kernel_thread
619        thread = LIST_ELEMENT( k_entry , thread_t , sched_list );
620
621        // get relevant thead info
622        thread_type_t type    = hal_remote_l32 ( XPTR( cxy , &thread->type ) );
623        trdid_t       trdid   = hal_remote_l32 ( XPTR( cxy , &thread->trdid ) );
624        uint32_t      blocked = hal_remote_l32 ( XPTR( cxy , &thread->blocked ) );
625        uint32_t      flags   = hal_remote_l32 ( XPTR( cxy , &thread->flags ) );
626        process_t *   process = hal_remote_lpt ( XPTR( cxy , &thread->process ) );
627        pid_t         pid     = hal_remote_l32 ( XPTR( cxy , &process->pid ) );
628
629        // display thread info
630        if (type == THREAD_DEV) 
631        {
632            char      name[16];
633            chdev_t * chdev = hal_remote_lpt( XPTR( cxy , &thread->chdev ) );
634            hal_remote_strcpy( XPTR( local_cxy , name ), XPTR( cxy , chdev->name ) );
635
636            nolock_printk(" - %s | %X | %X | %X | %X | %X | %s\n",
637            thread_type_str( type ), pid, trdid, thread, blocked, flags, name );
638        }
639        else
640        {
641            nolock_printk(" - %s | %X | %X | %X | %X | %X |\n",
642            thread_type_str( type ), pid, trdid, thread, blocked, flags );
643        }
644
645        // get next remote kernel thread list_entry
646        k_entry = hal_remote_lpt( XPTR( cxy , &k_entry->next ) );
647    }
648
649    // display user threads
650    while( u_entry != &sched->u_root )
651    {
652        // get local pointer on user_thread
653        thread = LIST_ELEMENT( u_entry , thread_t , sched_list );
654
655        // get relevant thead info
656        thread_type_t type    = hal_remote_l32 ( XPTR( cxy , &thread->type ) );
657        trdid_t       trdid   = hal_remote_l32 ( XPTR( cxy , &thread->trdid ) );
658        uint32_t      blocked = hal_remote_l32 ( XPTR( cxy , &thread->blocked ) );
659        uint32_t      flags   = hal_remote_l32 ( XPTR( cxy , &thread->flags ) );
660        process_t *   process = hal_remote_lpt ( XPTR( cxy , &thread->process ) );
661        pid_t         pid     = hal_remote_l32 ( XPTR( cxy , &process->pid ) );
662        void      *   func    = hal_remote_lpt ( XPTR( cxy , &thread->entry_func ) );
663
664        nolock_printk(" - %s | %X | %X | %X | %X | %X | %x\n",
665        thread_type_str( type ), pid, trdid, thread, blocked, flags, (uint32_t)func );
666
667        // get next user thread list_entry
668        u_entry = hal_remote_lpt( XPTR( cxy , &u_entry->next ) );
669    }
670
671    // release TXT0 lock
672    remote_busylock_release( lock_xp );
673
674}  // end sched_remote_display()
675
676
Note: See TracBrowser for help on using the repository browser.