=============================================================================== 02007c0c <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2007c0c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007c10: 39 00 80 7d sethi %hi(0x201f400), %i4 2007c14: fa 07 22 b4 ld [ %i4 + 0x2b4 ], %i5 ! 201f6b4 <_API_extensions_List> 2007c18: b8 17 22 b4 or %i4, 0x2b4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007c1c: b8 07 20 04 add %i4, 4, %i4 2007c20: 80 a7 40 1c cmp %i5, %i4 2007c24: 02 80 00 09 be 2007c48 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2007c28: 01 00 00 00 nop * Currently all APIs configure this hook so it is always non-NULL. */ #if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API) if ( the_extension->postdriver_hook ) #endif (*the_extension->postdriver_hook)(); 2007c2c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007c30: 9f c0 40 00 call %g1 2007c34: 01 00 00 00 nop Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 2007c38: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007c3c: 80 a7 40 1c cmp %i5, %i4 2007c40: 32 bf ff fc bne,a 2007c30 <_API_extensions_Run_postdriver+0x24> 2007c44: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007c48: 81 c7 e0 08 ret 2007c4c: 81 e8 00 00 restore =============================================================================== 02007c50 <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 2007c50: 9d e3 bf a0 save %sp, -96, %sp 2007c54: 39 00 80 7d sethi %hi(0x201f400), %i4 2007c58: fa 07 22 b4 ld [ %i4 + 0x2b4 ], %i5 ! 201f6b4 <_API_extensions_List> 2007c5c: b8 17 22 b4 or %i4, 0x2b4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007c60: b8 07 20 04 add %i4, 4, %i4 2007c64: 80 a7 40 1c cmp %i5, %i4 2007c68: 02 80 00 0a be 2007c90 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 2007c6c: 37 00 80 7e sethi %hi(0x201f800), %i3 2007c70: b6 16 e2 00 or %i3, 0x200, %i3 ! 201fa00 <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 2007c74: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007c78: 9f c0 40 00 call %g1 2007c7c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 2007c80: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007c84: 80 a7 40 1c cmp %i5, %i4 2007c88: 32 bf ff fc bne,a 2007c78 <_API_extensions_Run_postswitch+0x28> 2007c8c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007c90: 81 c7 e0 08 ret 2007c94: 81 e8 00 00 restore =============================================================================== 0200a308 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200a308: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 200a30c: 03 00 80 8a sethi %hi(0x2022800), %g1 * Otherwise, we have to block. * If locked for reading and no waiters, then OK to read. * If any thread is waiting, then we wait. */ _ISR_Disable( level ); 200a310: 7f ff e5 7c call 2003900 200a314: fa 00 62 1c ld [ %g1 + 0x21c ], %i5 ! 2022a1c <_Per_CPU_Information+0xc> 200a318: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 200a31c: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200a320: 80 a0 60 00 cmp %g1, 0 200a324: 02 80 00 2b be 200a3d0 <_CORE_RWLock_Release+0xc8> 200a328: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 200a32c: 22 80 00 22 be,a 200a3b4 <_CORE_RWLock_Release+0xac> 200a330: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 return CORE_RWLOCK_SUCCESSFUL; } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 200a334: c0 27 60 34 clr [ %i5 + 0x34 ] /* * Implicitly transition to "unlocked" and find another thread interested * in obtaining this rwlock. */ the_rwlock->current_state = CORE_RWLOCK_UNLOCKED; 200a338: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200a33c: 7f ff e5 75 call 2003910 200a340: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 200a344: 40 00 08 1d call 200c3b8 <_Thread_queue_Dequeue> 200a348: 90 10 00 18 mov %i0, %o0 if ( next ) { 200a34c: 80 a2 20 00 cmp %o0, 0 200a350: 22 80 00 24 be,a 200a3e0 <_CORE_RWLock_Release+0xd8> 200a354: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200a358: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200a35c: 80 a0 60 01 cmp %g1, 1 200a360: 02 80 00 22 be 200a3e8 <_CORE_RWLock_Release+0xe0> 200a364: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200a368: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200a36c: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200a370: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200a374: 10 80 00 09 b 200a398 <_CORE_RWLock_Release+0x90> 200a378: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); if ( !next || 200a37c: 80 a0 60 01 cmp %g1, 1 200a380: 02 80 00 0b be 200a3ac <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 200a384: 90 10 00 18 mov %i0, %o0 next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) return CORE_RWLOCK_SUCCESSFUL; the_rwlock->number_of_readers += 1; 200a388: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200a38c: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200a390: 40 00 09 1a call 200c7f8 <_Thread_queue_Extract> 200a394: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); 200a398: 40 00 09 69 call 200c93c <_Thread_queue_First> 200a39c: 90 10 00 18 mov %i0, %o0 if ( !next || 200a3a0: 92 92 20 00 orcc %o0, 0, %o1 200a3a4: 32 bf ff f6 bne,a 200a37c <_CORE_RWLock_Release+0x74> 200a3a8: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200a3ac: 81 c7 e0 08 ret 200a3b0: 91 e8 20 00 restore %g0, 0, %o0 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { the_rwlock->number_of_readers -= 1; 200a3b4: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200a3b8: 80 a0 60 00 cmp %g1, 0 200a3bc: 02 bf ff de be 200a334 <_CORE_RWLock_Release+0x2c> 200a3c0: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 200a3c4: 7f ff e5 53 call 2003910 200a3c8: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 200a3cc: 30 80 00 05 b,a 200a3e0 <_CORE_RWLock_Release+0xd8> * If any thread is waiting, then we wait. */ _ISR_Disable( level ); if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ _ISR_Enable( level ); 200a3d0: 7f ff e5 50 call 2003910 200a3d4: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200a3d8: 82 10 20 02 mov 2, %g1 200a3dc: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200a3e0: 81 c7 e0 08 ret 200a3e4: 81 e8 00 00 restore next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); if ( next ) { if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 200a3e8: 82 10 20 02 mov 2, %g1 200a3ec: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200a3f0: 81 c7 e0 08 ret 200a3f4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200a3f8 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200a3f8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a3fc: 90 10 00 18 mov %i0, %o0 200a400: 40 00 07 17 call 200c05c <_Thread_Get> 200a404: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a408: c2 07 bf fc ld [ %fp + -4 ], %g1 200a40c: 80 a0 60 00 cmp %g1, 0 200a410: 12 80 00 09 bne 200a434 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 200a414: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200a418: 40 00 09 8b call 200ca44 <_Thread_queue_Process_timeout> 200a41c: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a420: 03 00 80 89 sethi %hi(0x2022400), %g1 200a424: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 20224d0 <_Thread_Dispatch_disable_level> 200a428: 84 00 bf ff add %g2, -1, %g2 200a42c: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 200a430: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 200a434: 81 c7 e0 08 ret 200a438: 81 e8 00 00 restore =============================================================================== 02011fac <_CORE_message_queue_Initialize>: CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 2011fac: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2011fb0: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2011fb4: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; the_message_queue->maximum_message_size = maximum_message_size; 2011fb8: f6 26 20 4c st %i3, [ %i0 + 0x4c ] CORE_message_queue_Control *the_message_queue, CORE_message_queue_Notify_Handler the_handler, void *the_argument ) { the_message_queue->notify_handler = the_handler; 2011fbc: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 2011fc0: c0 26 20 64 clr [ %i0 + 0x64 ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2011fc4: 80 8e e0 03 btst 3, %i3 2011fc8: 02 80 00 0a be 2011ff0 <_CORE_message_queue_Initialize+0x44> 2011fcc: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 2011fd0: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2011fd4: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 2011fd8: 80 a6 c0 1c cmp %i3, %i4 2011fdc: 08 80 00 05 bleu 2011ff0 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2011fe0: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011fe4: b0 0f 60 01 and %i5, 1, %i0 2011fe8: 81 c7 e0 08 ret 2011fec: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2011ff0: b8 07 20 14 add %i4, 0x14, %i4 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2011ff4: 90 10 20 00 clr %o0 2011ff8: 92 10 00 1a mov %i2, %o1 2011ffc: 94 10 20 00 clr %o2 2012000: 96 10 00 1c mov %i4, %o3 2012004: 40 00 4b a0 call 2024e84 <__muldi3> 2012008: ba 10 20 00 clr %i5 if ( x > SIZE_MAX ) 201200c: 80 a2 20 00 cmp %o0, 0 2012010: 34 bf ff f6 bg,a 2011fe8 <_CORE_message_queue_Initialize+0x3c> 2012014: b0 0f 60 01 and %i5, 1, %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2012018: 40 00 0d 1c call 2015488 <_Workspace_Allocate> 201201c: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2012020: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2012024: 80 a2 20 00 cmp %o0, 0 2012028: 02 bf ff ef be 2011fe4 <_CORE_message_queue_Initialize+0x38> 201202c: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2012030: 90 06 20 68 add %i0, 0x68, %o0 2012034: 94 10 00 1a mov %i2, %o2 2012038: 40 00 1a 26 call 20188d0 <_Chain_Initialize> 201203c: 96 10 00 1c mov %i4, %o3 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2012040: c4 06 40 00 ld [ %i1 ], %g2 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2012044: 82 06 20 50 add %i0, 0x50, %g1 2012048: 84 18 a0 01 xor %g2, 1, %g2 201204c: 80 a0 00 02 cmp %g0, %g2 2012050: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2012054: c2 26 20 58 st %g1, [ %i0 + 0x58 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2012058: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 201205c: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2012060: c0 26 20 54 clr [ %i0 + 0x54 ] 2012064: 92 60 3f ff subx %g0, -1, %o1 2012068: 94 10 20 80 mov 0x80, %o2 201206c: 96 10 20 06 mov 6, %o3 2012070: 40 00 0a 9a call 2014ad8 <_Thread_queue_Initialize> 2012074: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2012078: b0 0f 60 01 and %i5, 1, %i0 201207c: 81 c7 e0 08 ret 2012080: 81 e8 00 00 restore =============================================================================== 0200800c <_CORE_mutex_Seize_interrupt_blocking>: void _CORE_mutex_Seize_interrupt_blocking( CORE_mutex_Control *the_mutex, Watchdog_Interval timeout ) { 200800c: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED Thread_Control *executing; executing = _Thread_Executing; if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) ) { 2008010: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 <== NOT EXECUTED Watchdog_Interval timeout ) { Thread_Control *executing; executing = _Thread_Executing; 2008014: 05 00 80 7e sethi %hi(0x201f800), %g2 <== NOT EXECUTED if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) ) { 2008018: 80 a0 60 02 cmp %g1, 2 <== NOT EXECUTED 200801c: 02 80 00 0c be 200804c <_CORE_mutex_Seize_interrupt_blocking+0x40><== NOT EXECUTED 2008020: fa 00 a2 0c ld [ %g2 + 0x20c ], %i5 <== NOT EXECUTED false ); } } the_mutex->blocked_count++; 2008024: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 <== NOT EXECUTED _Thread_queue_Enqueue( &the_mutex->Wait_queue, timeout ); 2008028: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED false ); } } the_mutex->blocked_count++; 200802c: 82 00 60 01 inc %g1 <== NOT EXECUTED _Thread_queue_Enqueue( &the_mutex->Wait_queue, timeout ); 2008030: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2008034: 15 00 80 29 sethi %hi(0x200a400), %o2 <== NOT EXECUTED 2008038: 94 12 a3 30 or %o2, 0x330, %o2 ! 200a730 <_Thread_queue_Timeout><== NOT EXECUTED 200803c: 40 00 08 c5 call 200a350 <_Thread_queue_Enqueue_with_handler><== NOT EXECUTED 2008040: c2 26 20 58 st %g1, [ %i0 + 0x58 ] <== NOT EXECUTED _Thread_Enable_dispatch(); 2008044: 40 00 07 78 call 2009e24 <_Thread_Enable_dispatch> <== NOT EXECUTED 2008048: 81 e8 00 00 restore <== NOT EXECUTED { Thread_Control *executing; executing = _Thread_Executing; if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) ) { if ( _Scheduler_Is_priority_higher_than( 200804c: c4 06 20 5c ld [ %i0 + 0x5c ], %g2 <== NOT EXECUTED 2008050: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 <== NOT EXECUTED 2008054: 03 00 80 7a sethi %hi(0x201e800), %g1 <== NOT EXECUTED 2008058: c2 00 60 78 ld [ %g1 + 0x78 ], %g1 ! 201e878 <_Scheduler+0x30><== NOT EXECUTED 200805c: 9f c0 40 00 call %g1 <== NOT EXECUTED 2008060: d2 00 a0 14 ld [ %g2 + 0x14 ], %o1 <== NOT EXECUTED 2008064: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2008068: 24 bf ff f0 ble,a 2008028 <_CORE_mutex_Seize_interrupt_blocking+0x1c><== NOT EXECUTED 200806c: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 <== NOT EXECUTED executing->current_priority, the_mutex->holder->current_priority)) { _Thread_Change_priority( 2008070: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 <== NOT EXECUTED 2008074: d2 07 60 14 ld [ %i5 + 0x14 ], %o1 <== NOT EXECUTED 2008078: 40 00 06 2e call 2009930 <_Thread_Change_priority> <== NOT EXECUTED 200807c: 94 10 20 00 clr %o2 <== NOT EXECUTED false ); } } the_mutex->blocked_count++; 2008080: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 <== NOT EXECUTED _Thread_queue_Enqueue( &the_mutex->Wait_queue, timeout ); 2008084: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED false ); } } the_mutex->blocked_count++; 2008088: 82 00 60 01 inc %g1 <== NOT EXECUTED _Thread_queue_Enqueue( &the_mutex->Wait_queue, timeout ); 200808c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2008090: 15 00 80 29 sethi %hi(0x200a400), %o2 <== NOT EXECUTED 2008094: 94 12 a3 30 or %o2, 0x330, %o2 ! 200a730 <_Thread_queue_Timeout><== NOT EXECUTED 2008098: 40 00 08 ae call 200a350 <_Thread_queue_Enqueue_with_handler><== NOT EXECUTED 200809c: c2 26 20 58 st %g1, [ %i0 + 0x58 ] <== NOT EXECUTED _Thread_Enable_dispatch(); 20080a0: 40 00 07 61 call 2009e24 <_Thread_Enable_dispatch> <== NOT EXECUTED 20080a4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200821c <_CORE_semaphore_Surrender>: CORE_semaphore_Status _CORE_semaphore_Surrender( CORE_semaphore_Control *the_semaphore, Objects_Id id, CORE_semaphore_API_mp_support_callout api_semaphore_mp_support ) { 200821c: 9d e3 bf a0 save %sp, -96, %sp 2008220: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008224: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008228: 40 00 07 e3 call 200a1b4 <_Thread_queue_Dequeue> 200822c: 90 10 00 1d mov %i5, %o0 2008230: 80 a2 20 00 cmp %o0, 0 2008234: 02 80 00 04 be 2008244 <_CORE_semaphore_Surrender+0x28> 2008238: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 200823c: 81 c7 e0 08 ret 2008240: 81 e8 00 00 restore if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 2008244: 7f ff e8 c6 call 200255c 2008248: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 200824c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008250: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008254: 80 a0 40 02 cmp %g1, %g2 2008258: 1a 80 00 05 bcc 200826c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 200825c: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008260: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008264: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008268: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 200826c: 7f ff e8 c0 call 200256c 2008270: 01 00 00 00 nop } return status; } 2008274: 81 c7 e0 08 ret 2008278: 81 e8 00 00 restore =============================================================================== 0200e430 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200e430: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; 200e434: c0 26 20 04 clr [ %i0 + 4 ] size_t node_size ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 200e438: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200e43c: 80 a6 a0 00 cmp %i2, 0 200e440: 02 80 00 12 be 200e488 <_Chain_Initialize+0x58> <== NEVER TAKEN 200e444: 90 10 00 18 mov %i0, %o0 200e448: b4 06 bf ff add %i2, -1, %i2 { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; 200e44c: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200e450: 92 10 00 1a mov %i2, %o1 ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 200e454: 10 80 00 05 b 200e468 <_Chain_Initialize+0x38> 200e458: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200e45c: 84 10 00 01 mov %g1, %g2 200e460: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200e464: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200e468: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200e46c: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200e470: 80 a6 a0 00 cmp %i2, 0 200e474: 12 bf ff fa bne 200e45c <_Chain_Initialize+0x2c> 200e478: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200e47c: 40 00 2f ae call 201a334 <.umul> 200e480: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200e484: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200e488: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200e48c: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200e490: 81 c7 e0 08 ret 200e494: 81 e8 00 00 restore =============================================================================== 02006e20 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2006e20: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2006e24: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 2006e28: 7f ff ed cd call 200255c 2006e2c: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 2006e30: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2006e34: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2006e38: 86 88 40 02 andcc %g1, %g2, %g3 2006e3c: 02 80 00 39 be 2006f20 <_Event_Surrender+0x100> 2006e40: 09 00 80 7e sethi %hi(0x201f800), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 2006e44: 88 11 22 00 or %g4, 0x200, %g4 ! 201fa00 <_Per_CPU_Information> 2006e48: f2 01 20 08 ld [ %g4 + 8 ], %i1 2006e4c: 80 a6 60 00 cmp %i1, 0 2006e50: 32 80 00 1c bne,a 2006ec0 <_Event_Surrender+0xa0> 2006e54: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 2006e58: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2006e5c: 80 89 21 00 btst 0x100, %g4 2006e60: 02 80 00 30 be 2006f20 <_Event_Surrender+0x100> 2006e64: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2006e68: 02 80 00 04 be 2006e78 <_Event_Surrender+0x58> 2006e6c: 80 8f 20 02 btst 2, %i4 2006e70: 02 80 00 2c be 2006f20 <_Event_Surrender+0x100> <== NEVER TAKEN 2006e74: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006e78: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear( rtems_event_set the_event_set, rtems_event_set the_mask ) { return ( the_event_set & ~(the_mask) ); 2006e7c: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2006e80: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006e84: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006e88: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 2006e8c: 7f ff ed b8 call 200256c 2006e90: 01 00 00 00 nop 2006e94: 7f ff ed b2 call 200255c 2006e98: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2006e9c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2006ea0: 80 a0 60 02 cmp %g1, 2 2006ea4: 02 80 00 21 be 2006f28 <_Event_Surrender+0x108> 2006ea8: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2006eac: 7f ff ed b0 call 200256c 2006eb0: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006eb4: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006eb8: 40 00 0a e9 call 2009a5c <_Thread_Clear_state> 2006ebc: 81 e8 00 00 restore /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 2006ec0: 80 a6 00 04 cmp %i0, %g4 2006ec4: 32 bf ff e6 bne,a 2006e5c <_Event_Surrender+0x3c> 2006ec8: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006ecc: 09 00 80 7f sethi %hi(0x201fc00), %g4 2006ed0: f2 01 22 00 ld [ %g4 + 0x200 ], %i1 ! 201fe00 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 2006ed4: 80 a6 60 02 cmp %i1, 2 2006ed8: 02 80 00 07 be 2006ef4 <_Event_Surrender+0xd4> <== NEVER TAKEN 2006edc: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006ee0: f2 01 22 00 ld [ %g4 + 0x200 ], %i1 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006ee4: 80 a6 60 01 cmp %i1, 1 2006ee8: 32 bf ff dd bne,a 2006e5c <_Event_Surrender+0x3c> 2006eec: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2006ef0: 80 a0 40 03 cmp %g1, %g3 2006ef4: 02 80 00 04 be 2006f04 <_Event_Surrender+0xe4> 2006ef8: 80 8f 20 02 btst 2, %i4 2006efc: 02 80 00 09 be 2006f20 <_Event_Surrender+0x100> <== NEVER TAKEN 2006f00: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006f04: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006f08: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2006f0c: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006f10: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006f14: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006f18: 82 10 20 03 mov 3, %g1 2006f1c: c2 21 22 00 st %g1, [ %g4 + 0x200 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2006f20: 7f ff ed 93 call 200256c 2006f24: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2006f28: c2 26 20 50 st %g1, [ %i0 + 0x50 ] if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2006f2c: 7f ff ed 90 call 200256c 2006f30: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 2006f34: 40 00 0f b0 call 200adf4 <_Watchdog_Remove> 2006f38: 90 06 20 48 add %i0, 0x48, %o0 2006f3c: b2 16 63 f8 or %i1, 0x3f8, %i1 2006f40: 40 00 0a c7 call 2009a5c <_Thread_Clear_state> 2006f44: 81 e8 00 00 restore =============================================================================== 02006f48 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006f48: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006f4c: 90 10 00 18 mov %i0, %o0 2006f50: 40 00 0b c2 call 2009e58 <_Thread_Get> 2006f54: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006f58: c2 07 bf fc ld [ %fp + -4 ], %g1 2006f5c: 80 a0 60 00 cmp %g1, 0 2006f60: 12 80 00 16 bne 2006fb8 <_Event_Timeout+0x70> <== NEVER TAKEN 2006f64: ba 10 00 08 mov %o0, %i5 * * If it is not satisfied, then it is "nothing happened" and * this is the "timeout" transition. After a request is satisfied, * a timeout is not allowed to occur. */ _ISR_Disable( level ); 2006f68: 7f ff ed 7d call 200255c 2006f6c: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006f70: 03 00 80 7e sethi %hi(0x201f800), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006f74: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201fa0c <_Per_CPU_Information+0xc> 2006f78: 80 a7 40 01 cmp %i5, %g1 2006f7c: 02 80 00 11 be 2006fc0 <_Event_Timeout+0x78> 2006f80: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006f84: 82 10 20 06 mov 6, %g1 2006f88: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2006f8c: 7f ff ed 78 call 200256c 2006f90: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006f94: 90 10 00 1d mov %i5, %o0 2006f98: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2006f9c: 40 00 0a b0 call 2009a5c <_Thread_Clear_state> 2006fa0: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2006fa4: 03 00 80 7d sethi %hi(0x201f400), %g1 2006fa8: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201f4c0 <_Thread_Dispatch_disable_level> 2006fac: 84 00 bf ff add %g2, -1, %g2 2006fb0: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2006fb4: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 2006fb8: 81 c7 e0 08 ret 2006fbc: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 2006fc0: 03 00 80 7f sethi %hi(0x201fc00), %g1 2006fc4: c4 00 62 00 ld [ %g1 + 0x200 ], %g2 ! 201fe00 <_Event_Sync_state> 2006fc8: 80 a0 a0 01 cmp %g2, 1 2006fcc: 32 bf ff ef bne,a 2006f88 <_Event_Timeout+0x40> 2006fd0: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006fd4: 84 10 20 02 mov 2, %g2 2006fd8: c4 20 62 00 st %g2, [ %g1 + 0x200 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006fdc: 10 bf ff eb b 2006f88 <_Event_Timeout+0x40> 2006fe0: 82 10 20 06 mov 6, %g1 =============================================================================== 0200e644 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200e644: 9d e3 bf 98 save %sp, -104, %sp 200e648: ba 10 00 18 mov %i0, %i5 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200e64c: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200e650: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200e654: 80 a6 40 10 cmp %i1, %l0 200e658: 18 80 00 23 bgu 200e6e4 <_Heap_Allocate_aligned_with_boundary+0xa0> 200e65c: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200e660: 80 a6 e0 00 cmp %i3, 0 200e664: 12 80 00 7d bne 200e858 <_Heap_Allocate_aligned_with_boundary+0x214> 200e668: 80 a6 40 1b cmp %i1, %i3 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200e66c: e2 07 60 08 ld [ %i5 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e670: 80 a7 40 11 cmp %i5, %l1 200e674: 02 80 00 18 be 200e6d4 <_Heap_Allocate_aligned_with_boundary+0x90> 200e678: b8 10 20 00 clr %i4 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e67c: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e680: ae 10 20 04 mov 4, %l7 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e684: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e688: 10 80 00 0b b 200e6b4 <_Heap_Allocate_aligned_with_boundary+0x70> 200e68c: ae 25 c0 19 sub %l7, %i1, %l7 * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { if ( alignment == 0 ) { 200e690: 12 80 00 17 bne 200e6ec <_Heap_Allocate_aligned_with_boundary+0xa8> 200e694: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e698: 80 a6 20 00 cmp %i0, 0 200e69c: 12 80 00 5b bne 200e808 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200e6a0: b8 07 20 01 inc %i4 break; } block = block->next; 200e6a4: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e6a8: 80 a7 40 11 cmp %i5, %l1 200e6ac: 22 80 00 0b be,a 200e6d8 <_Heap_Allocate_aligned_with_boundary+0x94> 200e6b0: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 200e6b4: e4 04 60 04 ld [ %l1 + 4 ], %l2 200e6b8: 80 a4 00 12 cmp %l0, %l2 200e6bc: 0a bf ff f5 bcs 200e690 <_Heap_Allocate_aligned_with_boundary+0x4c> 200e6c0: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200e6c4: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e6c8: 80 a7 40 11 cmp %i5, %l1 200e6cc: 12 bf ff fa bne 200e6b4 <_Heap_Allocate_aligned_with_boundary+0x70> 200e6d0: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e6d4: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200e6d8: 80 a0 40 1c cmp %g1, %i4 200e6dc: 0a 80 00 5a bcs 200e844 <_Heap_Allocate_aligned_with_boundary+0x200> 200e6e0: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200e6e4: 81 c7 e0 08 ret 200e6e8: 81 e8 00 00 restore uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200e6ec: c4 07 bf fc ld [ %fp + -4 ], %g2 uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200e6f0: ea 07 60 14 ld [ %i5 + 0x14 ], %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e6f4: a4 0c bf fe and %l2, -2, %l2 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200e6f8: 82 20 80 15 sub %g2, %l5, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200e6fc: a4 04 40 12 add %l1, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e700: 92 10 00 1a mov %i2, %o1 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; 200e704: b0 05 c0 12 add %l7, %l2, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e708: a4 00 40 12 add %g1, %l2, %l2 200e70c: 40 00 2f f0 call 201a6cc <.urem> 200e710: 90 10 00 18 mov %i0, %o0 200e714: b0 26 00 08 sub %i0, %o0, %i0 uintptr_t alloc_begin = alloc_end - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { 200e718: 80 a4 80 18 cmp %l2, %i0 200e71c: 1a 80 00 06 bcc 200e734 <_Heap_Allocate_aligned_with_boundary+0xf0> 200e720: a8 04 60 08 add %l1, 8, %l4 200e724: 90 10 00 12 mov %l2, %o0 200e728: 40 00 2f e9 call 201a6cc <.urem> 200e72c: 92 10 00 1a mov %i2, %o1 200e730: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200e734: 80 a6 e0 00 cmp %i3, 0 200e738: 02 80 00 24 be 200e7c8 <_Heap_Allocate_aligned_with_boundary+0x184> 200e73c: 80 a5 00 18 cmp %l4, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200e740: a4 06 00 19 add %i0, %i1, %l2 200e744: 92 10 00 1b mov %i3, %o1 200e748: 40 00 2f e1 call 201a6cc <.urem> 200e74c: 90 10 00 12 mov %l2, %o0 200e750: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e754: 80 a6 00 08 cmp %i0, %o0 200e758: 1a 80 00 1b bcc 200e7c4 <_Heap_Allocate_aligned_with_boundary+0x180> 200e75c: 80 a2 00 12 cmp %o0, %l2 200e760: 1a 80 00 1a bcc 200e7c8 <_Heap_Allocate_aligned_with_boundary+0x184> 200e764: 80 a5 00 18 cmp %l4, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200e768: a6 05 00 19 add %l4, %i1, %l3 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200e76c: 80 a4 c0 08 cmp %l3, %o0 200e770: 08 80 00 08 bleu 200e790 <_Heap_Allocate_aligned_with_boundary+0x14c> 200e774: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e778: 10 bf ff c9 b 200e69c <_Heap_Allocate_aligned_with_boundary+0x58> 200e77c: 80 a6 20 00 cmp %i0, 0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e780: 1a 80 00 11 bcc 200e7c4 <_Heap_Allocate_aligned_with_boundary+0x180> 200e784: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200e788: 18 bf ff c4 bgu 200e698 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200e78c: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200e790: b0 22 00 19 sub %o0, %i1, %i0 200e794: 92 10 00 1a mov %i2, %o1 200e798: 40 00 2f cd call 201a6cc <.urem> 200e79c: 90 10 00 18 mov %i0, %o0 200e7a0: 92 10 00 1b mov %i3, %o1 200e7a4: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200e7a8: a4 06 00 19 add %i0, %i1, %l2 200e7ac: 40 00 2f c8 call 201a6cc <.urem> 200e7b0: 90 10 00 12 mov %l2, %o0 200e7b4: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e7b8: 80 a2 00 12 cmp %o0, %l2 200e7bc: 0a bf ff f1 bcs 200e780 <_Heap_Allocate_aligned_with_boundary+0x13c> 200e7c0: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200e7c4: 80 a5 00 18 cmp %l4, %i0 200e7c8: 18 80 00 22 bgu 200e850 <_Heap_Allocate_aligned_with_boundary+0x20c> 200e7cc: 82 10 3f f8 mov -8, %g1 200e7d0: 90 10 00 18 mov %i0, %o0 200e7d4: a4 20 40 11 sub %g1, %l1, %l2 200e7d8: 92 10 00 16 mov %l6, %o1 200e7dc: 40 00 2f bc call 201a6cc <.urem> 200e7e0: a4 04 80 18 add %l2, %i0, %l2 uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; if ( free_size >= min_block_size || free_size == 0 ) { 200e7e4: 90 a4 80 08 subcc %l2, %o0, %o0 200e7e8: 02 bf ff ad be 200e69c <_Heap_Allocate_aligned_with_boundary+0x58> 200e7ec: 80 a6 20 00 cmp %i0, 0 200e7f0: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200e7f4: 82 40 3f ff addx %g0, -1, %g1 200e7f8: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e7fc: 80 a6 20 00 cmp %i0, 0 200e800: 02 bf ff a9 be 200e6a4 <_Heap_Allocate_aligned_with_boundary+0x60> 200e804: b8 07 20 01 inc %i4 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e808: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200e80c: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e810: 84 00 a0 01 inc %g2 stats->searches += search_count; 200e814: 82 00 40 1c add %g1, %i4, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e818: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200e81c: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200e820: 90 10 00 1d mov %i5, %o0 200e824: 92 10 00 11 mov %l1, %o1 200e828: 94 10 00 18 mov %i0, %o2 200e82c: 7f ff e7 ad call 20086e0 <_Heap_Block_allocate> 200e830: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e834: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200e838: 80 a0 40 1c cmp %g1, %i4 200e83c: 1a 80 00 03 bcc 200e848 <_Heap_Allocate_aligned_with_boundary+0x204> 200e840: 01 00 00 00 nop stats->max_search = search_count; 200e844: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200e848: 81 c7 e0 08 ret 200e84c: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200e850: 10 bf ff 92 b 200e698 <_Heap_Allocate_aligned_with_boundary+0x54> 200e854: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200e858: 18 bf ff a3 bgu 200e6e4 <_Heap_Allocate_aligned_with_boundary+0xa0> 200e85c: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200e860: 22 bf ff 83 be,a 200e66c <_Heap_Allocate_aligned_with_boundary+0x28> 200e864: b4 10 00 16 mov %l6, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200e868: 10 bf ff 82 b 200e670 <_Heap_Allocate_aligned_with_boundary+0x2c> 200e86c: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200e85c <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200e85c: 9d e3 bf 98 save %sp, -104, %sp Heap_Block *start_block = first_block; Heap_Block *merge_below_block = NULL; Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; 200e860: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200e864: c0 27 bf fc clr [ %fp + -4 ] uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; 200e868: ba 06 40 1a add %i1, %i2, %i5 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200e86c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200e870: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200e874: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 200e878: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200e87c: 80 a6 40 1d cmp %i1, %i5 200e880: 08 80 00 05 bleu 200e894 <_Heap_Extend+0x38> 200e884: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200e888: b0 0c 60 01 and %l1, 1, %i0 200e88c: 81 c7 e0 08 ret 200e890: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200e894: 90 10 00 19 mov %i1, %o0 200e898: 92 10 00 1a mov %i2, %o1 200e89c: 94 10 00 10 mov %l0, %o2 200e8a0: 98 07 bf f8 add %fp, -8, %o4 200e8a4: 7f ff e7 26 call 200853c <_Heap_Get_first_and_last_block> 200e8a8: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200e8ac: 80 8a 20 ff btst 0xff, %o0 200e8b0: 02 bf ff f6 be 200e888 <_Heap_Extend+0x2c> 200e8b4: aa 10 20 00 clr %l5 200e8b8: a2 10 00 1c mov %i4, %l1 200e8bc: ac 10 20 00 clr %l6 200e8c0: a6 10 20 00 clr %l3 200e8c4: 10 80 00 14 b 200e914 <_Heap_Extend+0xb8> 200e8c8: a8 10 20 00 clr %l4 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200e8cc: 2a 80 00 02 bcs,a 200e8d4 <_Heap_Extend+0x78> 200e8d0: ac 10 00 11 mov %l1, %l6 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e8d4: 90 10 00 1a mov %i2, %o0 200e8d8: 40 00 30 4d call 201aa0c <.urem> 200e8dc: 92 10 00 10 mov %l0, %o1 200e8e0: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e8e4: 80 a6 80 19 cmp %i2, %i1 200e8e8: 02 80 00 1c be 200e958 <_Heap_Extend+0xfc> 200e8ec: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200e8f0: 80 a6 40 1a cmp %i1, %i2 200e8f4: 38 80 00 02 bgu,a 200e8fc <_Heap_Extend+0xa0> 200e8f8: aa 10 00 01 mov %g1, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e8fc: e2 00 60 04 ld [ %g1 + 4 ], %l1 200e900: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e904: a2 00 40 11 add %g1, %l1, %l1 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e908: 80 a7 00 11 cmp %i4, %l1 200e90c: 22 80 00 1b be,a 200e978 <_Heap_Extend+0x11c> 200e910: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200e914: 80 a4 40 1c cmp %l1, %i4 200e918: 02 80 00 72 be 200eae0 <_Heap_Extend+0x284> 200e91c: 82 10 00 11 mov %l1, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200e920: 80 a0 40 1d cmp %g1, %i5 200e924: 0a 80 00 7c bcs 200eb14 <_Heap_Extend+0x2b8> 200e928: f4 04 40 00 ld [ %l1 ], %i2 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200e92c: 80 a0 40 1d cmp %g1, %i5 200e930: 12 bf ff e7 bne 200e8cc <_Heap_Extend+0x70> 200e934: 80 a7 40 1a cmp %i5, %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e938: 90 10 00 1a mov %i2, %o0 200e93c: 40 00 30 34 call 201aa0c <.urem> 200e940: 92 10 00 10 mov %l0, %o1 200e944: 82 06 bf f8 add %i2, -8, %g1 200e948: a8 10 00 11 mov %l1, %l4 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e94c: 80 a6 80 19 cmp %i2, %i1 200e950: 12 bf ff e8 bne 200e8f0 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200e954: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200e958: fa 24 40 00 st %i5, [ %l1 ] - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e95c: e2 00 60 04 ld [ %g1 + 4 ], %l1 200e960: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e964: a2 00 40 11 add %g1, %l1, %l1 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e968: 80 a7 00 11 cmp %i4, %l1 200e96c: 12 bf ff ea bne 200e914 <_Heap_Extend+0xb8> <== NEVER TAKEN 200e970: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200e974: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200e978: 80 a6 40 01 cmp %i1, %g1 200e97c: 3a 80 00 61 bcc,a 200eb00 <_Heap_Extend+0x2a4> 200e980: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200e984: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200e988: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e98c: c4 07 bf fc ld [ %fp + -4 ], %g2 extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200e990: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200e994: 86 20 80 01 sub %g2, %g1, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; 200e998: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200e99c: b8 10 e0 01 or %g3, 1, %i4 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 200e9a0: f8 20 60 04 st %i4, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200e9a4: c6 20 80 00 st %g3, [ %g2 ] extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200e9a8: 80 a1 00 01 cmp %g4, %g1 200e9ac: 08 80 00 4f bleu 200eae8 <_Heap_Extend+0x28c> 200e9b0: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200e9b4: c2 26 20 20 st %g1, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200e9b8: 80 a5 20 00 cmp %l4, 0 200e9bc: 02 80 00 76 be 200eb94 <_Heap_Extend+0x338> 200e9c0: b2 06 60 08 add %i1, 8, %i1 Heap_Control *heap, uintptr_t extend_area_begin, Heap_Block *first_block ) { uintptr_t const page_size = heap->page_size; 200e9c4: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200e9c8: 92 10 00 1c mov %i4, %o1 200e9cc: 40 00 30 10 call 201aa0c <.urem> 200e9d0: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200e9d4: 80 a2 20 00 cmp %o0, 0 200e9d8: 02 80 00 04 be 200e9e8 <_Heap_Extend+0x18c> 200e9dc: c8 05 00 00 ld [ %l4 ], %g4 return value - remainder + alignment; 200e9e0: b2 06 40 1c add %i1, %i4, %i1 200e9e4: b2 26 40 08 sub %i1, %o0, %i1 static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200e9e8: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 --stats->frees; 200e9ec: c6 06 20 50 ld [ %i0 + 0x50 ], %g3 ) { uintptr_t const page_size = heap->page_size; uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = 200e9f0: 82 06 7f f8 add %i1, -8, %g1 uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; 200e9f4: c8 26 7f f8 st %g4, [ %i1 + -8 ] static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200e9f8: 84 00 a0 01 inc %g2 uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = new_first_block_alloc_begin - HEAP_BLOCK_HEADER_SIZE; uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = 200e9fc: 88 25 00 01 sub %l4, %g1, %g4 { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; --stats->frees; 200ea00: 82 00 ff ff add %g3, -1, %g1 uintptr_t const new_first_block_size = first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; new_first_block->size_and_flag = new_first_block_size | HEAP_PREV_BLOCK_USED; 200ea04: 88 11 20 01 or %g4, 1, %g4 200ea08: c8 26 7f fc st %g4, [ %i1 + -4 ] static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200ea0c: c4 26 20 40 st %g2, [ %i0 + 0x40 ] --stats->frees; 200ea10: c2 26 20 50 st %g1, [ %i0 + 0x50 ] _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( block )); 200ea14: 90 10 00 18 mov %i0, %o0 200ea18: 40 00 00 66 call 200ebb0 <_Heap_Free> 200ea1c: 92 10 00 19 mov %i1, %o1 link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200ea20: 80 a4 e0 00 cmp %l3, 0 200ea24: 02 80 00 41 be 200eb28 <_Heap_Extend+0x2cc> 200ea28: ba 07 7f f8 add %i5, -8, %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200ea2c: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 uintptr_t extend_area_end ) { uintptr_t const page_size = heap->page_size; uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const last_block_new_size = _Heap_Align_down( 200ea30: ba 27 40 13 sub %i5, %l3, %i5 200ea34: 40 00 2f f6 call 201aa0c <.urem> 200ea38: 90 10 00 1d mov %i5, %o0 ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = (last_block->size_and_flag - last_block_new_size) 200ea3c: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200ea40: ba 27 40 08 sub %i5, %o0, %i5 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200ea44: 84 07 40 13 add %i5, %l3, %g2 (last_block->size_and_flag - last_block_new_size) 200ea48: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200ea4c: 82 10 60 01 or %g1, 1, %g1 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200ea50: c2 20 a0 04 st %g1, [ %g2 + 4 ] static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200ea54: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200ea58: c6 04 e0 04 ld [ %l3 + 4 ], %g3 --stats->frees; 200ea5c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200ea60: 86 08 e0 01 and %g3, 1, %g3 static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200ea64: 84 00 a0 01 inc %g2 block->size_and_flag = size | flag; 200ea68: ba 17 40 03 or %i5, %g3, %i5 --stats->frees; 200ea6c: 82 00 7f ff add %g1, -1, %g1 200ea70: fa 24 e0 04 st %i5, [ %l3 + 4 ] static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200ea74: c4 26 20 40 st %g2, [ %i0 + 0x40 ] --stats->frees; 200ea78: c2 26 20 50 st %g1, [ %i0 + 0x50 ] _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( block )); 200ea7c: 90 10 00 18 mov %i0, %o0 200ea80: 40 00 00 4c call 200ebb0 <_Heap_Free> 200ea84: 92 04 e0 08 add %l3, 8, %o1 extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200ea88: 80 a4 e0 00 cmp %l3, 0 200ea8c: 02 80 00 34 be 200eb5c <_Heap_Extend+0x300> 200ea90: 80 a5 20 00 cmp %l4, 0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200ea94: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200ea98: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200ea9c: c8 00 60 04 ld [ %g1 + 4 ], %g4 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200eaa0: c4 06 20 2c ld [ %i0 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200eaa4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200eaa8: ba 27 40 01 sub %i5, %g1, %i5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200eaac: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200eab0: 88 17 40 04 or %i5, %g4, %g4 200eab4: c8 20 60 04 st %g4, [ %g1 + 4 ] 200eab8: a4 20 c0 12 sub %g3, %l2, %l2 /* Statistics */ stats->size += extended_size; 200eabc: 82 00 80 12 add %g2, %l2, %g1 200eac0: c2 26 20 2c st %g1, [ %i0 + 0x2c ] if ( extended_size_ptr != NULL ) 200eac4: 80 a6 e0 00 cmp %i3, 0 200eac8: 02 bf ff 70 be 200e888 <_Heap_Extend+0x2c> <== NEVER TAKEN 200eacc: a2 10 20 01 mov 1, %l1 *extended_size_ptr = extended_size; 200ead0: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200ead4: b0 0c 60 01 and %l1, 1, %i0 200ead8: 81 c7 e0 08 ret 200eadc: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200eae0: 10 bf ff 90 b 200e920 <_Heap_Extend+0xc4> 200eae4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200eae8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200eaec: 80 a0 40 02 cmp %g1, %g2 200eaf0: 2a bf ff b2 bcs,a 200e9b8 <_Heap_Extend+0x15c> 200eaf4: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200eaf8: 10 bf ff b1 b 200e9bc <_Heap_Extend+0x160> 200eafc: 80 a5 20 00 cmp %l4, 0 start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); if ( extend_area_begin < heap->area_begin ) { heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { 200eb00: 80 a7 40 01 cmp %i5, %g1 200eb04: 38 bf ff a1 bgu,a 200e988 <_Heap_Extend+0x12c> 200eb08: fa 26 20 1c st %i5, [ %i0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200eb0c: 10 bf ff a0 b 200e98c <_Heap_Extend+0x130> 200eb10: c2 07 bf f8 ld [ %fp + -8 ], %g1 (uintptr_t) start_block : heap->area_begin; uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200eb14: 80 a6 40 1a cmp %i1, %i2 200eb18: 1a bf ff 86 bcc 200e930 <_Heap_Extend+0xd4> 200eb1c: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200eb20: 10 bf ff 5a b 200e888 <_Heap_Extend+0x2c> 200eb24: a2 10 20 00 clr %l1 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200eb28: 80 a5 60 00 cmp %l5, 0 200eb2c: 02 bf ff d7 be 200ea88 <_Heap_Extend+0x22c> 200eb30: c4 07 bf f8 ld [ %fp + -8 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200eb34: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200eb38: c2 07 bf fc ld [ %fp + -4 ], %g1 200eb3c: 86 08 e0 01 and %g3, 1, %g3 ) { uintptr_t const link_begin = (uintptr_t) link; uintptr_t const first_block_begin = (uintptr_t) first_block; _Heap_Block_set_size( link, first_block_begin - link_begin ); 200eb40: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200eb44: 84 10 80 03 or %g2, %g3, %g2 200eb48: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200eb4c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200eb50: 84 10 a0 01 or %g2, 1, %g2 200eb54: 10 bf ff cd b 200ea88 <_Heap_Extend+0x22c> 200eb58: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200eb5c: 32 bf ff cf bne,a 200ea98 <_Heap_Extend+0x23c> 200eb60: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200eb64: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 --stats->frees; 200eb68: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( block )); 200eb6c: d2 07 bf f8 ld [ %fp + -8 ], %o1 static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200eb70: 84 00 a0 01 inc %g2 --stats->frees; 200eb74: 82 00 7f ff add %g1, -1, %g1 static void _Heap_Free_block( Heap_Control *heap, Heap_Block *block ) { Heap_Statistics *const stats = &heap->stats; /* Statistics */ ++stats->used_blocks; 200eb78: c4 26 20 40 st %g2, [ %i0 + 0x40 ] --stats->frees; 200eb7c: c2 26 20 50 st %g1, [ %i0 + 0x50 ] _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( block )); 200eb80: 90 10 00 18 mov %i0, %o0 200eb84: 40 00 00 0b call 200ebb0 <_Heap_Free> 200eb88: 92 02 60 08 add %o1, 8, %o1 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200eb8c: 10 bf ff c3 b 200ea98 <_Heap_Extend+0x23c> 200eb90: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200eb94: 80 a5 a0 00 cmp %l6, 0 200eb98: 02 bf ff a3 be 200ea24 <_Heap_Extend+0x1c8> 200eb9c: 80 a4 e0 00 cmp %l3, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 200eba0: ac 25 80 02 sub %l6, %g2, %l6 200eba4: ac 15 a0 01 or %l6, 1, %l6 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 200eba8: 10 bf ff 9f b 200ea24 <_Heap_Extend+0x1c8> 200ebac: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200e870 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200e870: 9d e3 bf a0 save %sp, -96, %sp /* * If NULL return true so a free on NULL is considered a valid release. This * is a special case that could be handled by the in heap check how-ever that * would result in false being returned which is wrong. */ if ( alloc_begin_ptr == NULL ) { 200e874: 80 a6 60 00 cmp %i1, 0 200e878: 02 80 00 57 be 200e9d4 <_Heap_Free+0x164> 200e87c: 84 10 20 01 mov 1, %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e880: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e884: 40 00 2f 92 call 201a6cc <.urem> 200e888: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 200e88c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e890: ba 06 7f f8 add %i1, -8, %i5 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200e894: ba 27 40 08 sub %i5, %o0, %i5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e898: 80 a7 40 01 cmp %i5, %g1 200e89c: 0a 80 00 4e bcs 200e9d4 <_Heap_Free+0x164> 200e8a0: 84 10 20 00 clr %g2 200e8a4: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200e8a8: 80 a7 40 04 cmp %i5, %g4 200e8ac: 38 80 00 4b bgu,a 200e9d8 <_Heap_Free+0x168> 200e8b0: b0 08 a0 01 and %g2, 1, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e8b4: de 07 60 04 ld [ %i5 + 4 ], %o7 200e8b8: b2 0b ff fe and %o7, -2, %i1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e8bc: 86 07 40 19 add %i5, %i1, %g3 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e8c0: 80 a0 40 03 cmp %g1, %g3 200e8c4: 38 80 00 45 bgu,a 200e9d8 <_Heap_Free+0x168> <== NEVER TAKEN 200e8c8: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200e8cc: 80 a1 00 03 cmp %g4, %g3 200e8d0: 2a 80 00 42 bcs,a 200e9d8 <_Heap_Free+0x168> <== NEVER TAKEN 200e8d4: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e8d8: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200e8dc: 80 8b 60 01 btst 1, %o5 200e8e0: 02 80 00 3d be 200e9d4 <_Heap_Free+0x164> 200e8e4: 98 0b 7f fe and %o5, -2, %o4 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200e8e8: 80 a1 00 03 cmp %g4, %g3 200e8ec: 02 80 00 06 be 200e904 <_Heap_Free+0x94> 200e8f0: 9a 10 20 00 clr %o5 200e8f4: 84 00 c0 0c add %g3, %o4, %g2 200e8f8: da 00 a0 04 ld [ %g2 + 4 ], %o5 200e8fc: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200e900: 9a 1b 60 01 xor %o5, 1, %o5 next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200e904: 80 8b e0 01 btst 1, %o7 200e908: 12 80 00 1d bne 200e97c <_Heap_Free+0x10c> 200e90c: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200e910: d6 07 40 00 ld [ %i5 ], %o3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e914: 9e 27 40 0b sub %i5, %o3, %o7 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e918: 80 a0 40 0f cmp %g1, %o7 200e91c: 18 80 00 2e bgu 200e9d4 <_Heap_Free+0x164> <== NEVER TAKEN 200e920: 84 10 20 00 clr %g2 200e924: 80 a1 00 0f cmp %g4, %o7 200e928: 2a 80 00 2c bcs,a 200e9d8 <_Heap_Free+0x168> <== NEVER TAKEN 200e92c: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e930: c2 03 e0 04 ld [ %o7 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200e934: 80 88 60 01 btst 1, %g1 200e938: 02 80 00 27 be 200e9d4 <_Heap_Free+0x164> <== NEVER TAKEN 200e93c: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200e940: 22 80 00 3a be,a 200ea28 <_Heap_Free+0x1b8> 200e944: 96 06 40 0b add %i1, %o3, %o3 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200e948: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200e94c: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200e950: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200e954: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200e958: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200e95c: 82 00 ff ff add %g3, -1, %g1 200e960: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200e964: 98 06 40 0c add %i1, %o4, %o4 200e968: 96 03 00 0b add %o4, %o3, %o3 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e96c: 82 12 e0 01 or %o3, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200e970: d6 23 c0 0b st %o3, [ %o7 + %o3 ] if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e974: 10 80 00 0e b 200e9ac <_Heap_Free+0x13c> 200e978: c2 23 e0 04 st %g1, [ %o7 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200e97c: 22 80 00 19 be,a 200e9e0 <_Heap_Free+0x170> 200e980: c4 06 20 08 ld [ %i0 + 8 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200e984: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200e988: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200e98c: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200e990: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200e994: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200e998: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200e99c: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e9a0: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200e9a4: d8 27 40 0c st %o4, [ %i5 + %o4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e9a8: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e9ac: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200e9b0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200e9b4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e9b8: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200e9bc: 82 00 60 01 inc %g1 stats->free_size += block_size; 200e9c0: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e9c4: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200e9c8: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200e9cc: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200e9d0: 84 10 20 01 mov 1, %g2 } 200e9d4: b0 08 a0 01 and %g2, 1, %i0 200e9d8: 81 c7 e0 08 ret 200e9dc: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200e9e0: 82 16 60 01 or %i1, 1, %g1 200e9e4: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e9e8: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200e9ec: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200e9f0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200e9f4: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200e9f8: fa 20 a0 0c st %i5, [ %g2 + 0xc ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e9fc: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200ea00: f2 27 40 19 st %i1, [ %i5 + %i1 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ea04: c4 20 e0 04 st %g2, [ %g3 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { 200ea08: c4 06 20 3c ld [ %i0 + 0x3c ], %g2 block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200ea0c: 82 00 60 01 inc %g1 { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; block_before->next = new_block; 200ea10: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200ea14: 80 a0 40 02 cmp %g1, %g2 200ea18: 08 bf ff e5 bleu 200e9ac <_Heap_Free+0x13c> 200ea1c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200ea20: 10 bf ff e3 b 200e9ac <_Heap_Free+0x13c> 200ea24: c2 26 20 3c st %g1, [ %i0 + 0x3c ] next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ea28: 82 12 e0 01 or %o3, 1, %g1 200ea2c: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ea30: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200ea34: d6 27 40 19 st %o3, [ %i5 + %i1 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ea38: 82 08 7f fe and %g1, -2, %g1 200ea3c: 10 bf ff dc b 200e9ac <_Heap_Free+0x13c> 200ea40: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 020084dc <_Heap_Get_first_and_last_block>: uintptr_t page_size, uintptr_t min_block_size, Heap_Block **first_block_ptr, Heap_Block **last_block_ptr ) { 20084dc: 9d e3 bf a0 save %sp, -96, %sp uintptr_t const heap_area_end = heap_area_begin + heap_area_size; uintptr_t const alloc_area_begin = _Heap_Align_up( heap_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); 20084e0: a0 06 20 08 add %i0, 8, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 20084e4: 92 10 00 1a mov %i2, %o1 20084e8: 40 00 48 79 call 201a6cc <.urem> 20084ec: 90 10 00 10 mov %l0, %o0 if ( remainder != 0 ) { 20084f0: 80 a2 20 00 cmp %o0, 0 20084f4: 02 80 00 04 be 2008504 <_Heap_Get_first_and_last_block+0x28> 20084f8: 84 06 40 18 add %i1, %i0, %g2 return value - remainder + alignment; 20084fc: a0 06 80 10 add %i2, %l0, %l0 2008500: a0 24 00 08 sub %l0, %o0, %l0 uintptr_t const first_block_begin = alloc_area_begin - HEAP_BLOCK_HEADER_SIZE; uintptr_t const overhead = 2008504: 82 24 00 18 sub %l0, %i0, %g1 _Heap_Align_down( heap_area_size - overhead, page_size ); Heap_Block *const first_block = (Heap_Block *) first_block_begin; Heap_Block *const last_block = _Heap_Block_at( first_block, first_block_size ); if ( 2008508: 80 a0 40 19 cmp %g1, %i1 200850c: 1a 80 00 13 bcc 2008558 <_Heap_Get_first_and_last_block+0x7c> 2008510: a0 04 3f f8 add %l0, -8, %l0 2008514: 80 a0 80 18 cmp %g2, %i0 2008518: 0a 80 00 10 bcs 2008558 <_Heap_Get_first_and_last_block+0x7c><== NEVER TAKEN 200851c: b2 26 40 01 sub %i1, %g1, %i1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 2008520: 92 10 00 1a mov %i2, %o1 2008524: 40 00 48 6a call 201a6cc <.urem> 2008528: 90 10 00 19 mov %i1, %o0 200852c: b2 26 40 08 sub %i1, %o0, %i1 heap_area_end < heap_area_begin || heap_area_size <= overhead || first_block_size < min_block_size 2008530: 80 a6 c0 19 cmp %i3, %i1 2008534: 18 80 00 06 bgu 200854c <_Heap_Get_first_and_last_block+0x70><== NEVER TAKEN 2008538: b0 10 20 00 clr %i0 ) { /* Invalid area or area too small */ return false; } *first_block_ptr = first_block; 200853c: e0 27 00 00 st %l0, [ %i4 ] RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008540: b2 06 40 10 add %i1, %l0, %i1 *last_block_ptr = last_block; return true; 2008544: b0 10 20 01 mov 1, %i0 /* Invalid area or area too small */ return false; } *first_block_ptr = first_block; *last_block_ptr = last_block; 2008548: f2 27 40 00 st %i1, [ %i5 ] return true; } 200854c: b0 0e 20 01 and %i0, 1, %i0 2008550: 81 c7 e0 08 ret 2008554: 81 e8 00 00 restore heap_area_end < heap_area_begin || heap_area_size <= overhead || first_block_size < min_block_size ) { /* Invalid area or area too small */ return false; 2008558: b0 10 20 00 clr %i0 *first_block_ptr = first_block; *last_block_ptr = last_block; return true; } 200855c: b0 0e 20 01 and %i0, 1, %i0 2008560: 81 c7 e0 08 ret 2008564: 81 e8 00 00 restore =============================================================================== 0200f364 <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200f364: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200f368: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200f36c: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200f370: 92 10 20 00 clr %o1 200f374: 90 10 00 19 mov %i1, %o0 200f378: 40 00 0c e3 call 2012704 200f37c: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200f380: 80 a7 40 1c cmp %i5, %i4 200f384: 02 80 00 17 be 200f3e0 <_Heap_Get_information+0x7c> <== NEVER TAKEN 200f388: 01 00 00 00 nop 200f38c: c6 07 60 04 ld [ %i5 + 4 ], %g3 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200f390: 84 08 ff fe and %g3, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200f394: ba 07 40 02 add %i5, %g2, %i5 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200f398: c6 07 60 04 ld [ %i5 + 4 ], %g3 uintptr_t const the_size = _Heap_Block_size(the_block); Heap_Block *const next_block = _Heap_Block_at(the_block, the_size); Heap_Information *info; if ( _Heap_Is_prev_used(next_block) ) 200f39c: 80 88 e0 01 btst 1, %g3 200f3a0: 02 80 00 03 be 200f3ac <_Heap_Get_information+0x48> 200f3a4: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200f3a8: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200f3ac: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200f3b0: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200f3b4: c8 00 60 04 ld [ %g1 + 4 ], %g4 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200f3b8: 9e 03 e0 01 inc %o7 info->total += the_size; 200f3bc: b0 06 00 02 add %i0, %g2, %i0 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200f3c0: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200f3c4: 80 a1 00 02 cmp %g4, %g2 200f3c8: 1a 80 00 03 bcc 200f3d4 <_Heap_Get_information+0x70> 200f3cc: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200f3d0: c4 20 60 04 st %g2, [ %g1 + 4 ] Heap_Block *the_block = the_heap->first_block; Heap_Block *const end = the_heap->last_block; memset(the_info, 0, sizeof(*the_info)); while ( the_block != end ) { 200f3d4: 80 a7 00 1d cmp %i4, %i5 200f3d8: 12 bf ff ef bne 200f394 <_Heap_Get_information+0x30> 200f3dc: 84 08 ff fe and %g3, -2, %g2 200f3e0: 81 c7 e0 08 ret 200f3e4: 81 e8 00 00 restore =============================================================================== 0200eb64 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200eb64: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200eb68: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200eb6c: 40 00 2e d8 call 201a6cc <.urem> 200eb70: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 200eb74: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200eb78: 84 06 7f f8 add %i1, -8, %g2 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200eb7c: 84 20 80 08 sub %g2, %o0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200eb80: 80 a0 80 01 cmp %g2, %g1 200eb84: 0a 80 00 16 bcs 200ebdc <_Heap_Size_of_alloc_area+0x78> 200eb88: 86 10 20 00 clr %g3 200eb8c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200eb90: 80 a0 80 04 cmp %g2, %g4 200eb94: 18 80 00 13 bgu 200ebe0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200eb98: b0 08 e0 01 and %g3, 1, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200eb9c: f0 00 a0 04 ld [ %g2 + 4 ], %i0 200eba0: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200eba4: 84 00 80 18 add %g2, %i0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200eba8: 80 a0 40 02 cmp %g1, %g2 200ebac: 18 80 00 0d bgu 200ebe0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200ebb0: b0 08 e0 01 and %g3, 1, %i0 200ebb4: 80 a1 00 02 cmp %g4, %g2 200ebb8: 0a 80 00 0a bcs 200ebe0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200ebbc: 01 00 00 00 nop block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200ebc0: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 200ebc4: 80 88 60 01 btst 1, %g1 200ebc8: 02 80 00 06 be 200ebe0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200ebcc: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200ebd0: 86 10 20 01 mov 1, %g3 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 200ebd4: 84 00 a0 04 add %g2, 4, %g2 200ebd8: c4 26 80 00 st %g2, [ %i2 ] return true; } 200ebdc: b0 08 e0 01 and %g3, 1, %i0 200ebe0: 81 c7 e0 08 ret 200ebe4: 81 e8 00 00 restore =============================================================================== 020094bc <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20094bc: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 20094c0: 3b 00 80 25 sethi %hi(0x2009400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 20094c4: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 20094c8: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 20094cc: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 20094d0: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 20094d4: 80 a6 a0 00 cmp %i2, 0 20094d8: 02 80 00 04 be 20094e8 <_Heap_Walk+0x2c> 20094dc: ba 17 60 50 or %i5, 0x50, %i5 20094e0: 3b 00 80 25 sethi %hi(0x2009400), %i5 20094e4: ba 17 60 58 or %i5, 0x58, %i5 ! 2009458 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20094e8: 03 00 80 86 sethi %hi(0x2021800), %g1 20094ec: c4 00 63 18 ld [ %g1 + 0x318 ], %g2 ! 2021b18 <_System_state_Current> 20094f0: 80 a0 a0 03 cmp %g2, 3 20094f4: 02 80 00 05 be 2009508 <_Heap_Walk+0x4c> 20094f8: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 20094fc: b0 08 60 01 and %g1, 1, %i0 2009500: 81 c7 e0 08 ret 2009504: 81 e8 00 00 restore Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 2009508: da 06 20 18 ld [ %i0 + 0x18 ], %o5 200950c: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 2009510: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009514: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009518: 90 10 00 19 mov %i1, %o0 200951c: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2009520: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2009524: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2009528: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 200952c: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2009530: 92 10 20 00 clr %o1 2009534: 96 10 00 10 mov %l0, %o3 2009538: 15 00 80 79 sethi %hi(0x201e400), %o2 200953c: 98 10 00 1b mov %i3, %o4 2009540: 9f c7 40 00 call %i5 2009544: 94 12 a1 98 or %o2, 0x198, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009548: 80 a4 20 00 cmp %l0, 0 200954c: 02 80 00 28 be 20095ec <_Heap_Walk+0x130> 2009550: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009554: 12 80 00 2d bne 2009608 <_Heap_Walk+0x14c> 2009558: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200955c: 7f ff e1 64 call 2001aec <.urem> 2009560: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009564: 80 a2 20 00 cmp %o0, 0 2009568: 12 80 00 30 bne 2009628 <_Heap_Walk+0x16c> 200956c: 90 07 20 08 add %i4, 8, %o0 2009570: 7f ff e1 5f call 2001aec <.urem> 2009574: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 2009578: 80 a2 20 00 cmp %o0, 0 200957c: 32 80 00 33 bne,a 2009648 <_Heap_Walk+0x18c> 2009580: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2009584: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2009588: 80 8d 20 01 btst 1, %l4 200958c: 22 80 00 36 be,a 2009664 <_Heap_Walk+0x1a8> 2009590: 90 10 00 19 mov %i1, %o0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2009594: c2 04 60 04 ld [ %l1 + 4 ], %g1 2009598: 82 08 7f fe and %g1, -2, %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200959c: 82 04 40 01 add %l1, %g1, %g1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 20095a0: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 20095a4: 80 88 a0 01 btst 1, %g2 20095a8: 02 80 00 0a be 20095d0 <_Heap_Walk+0x114> 20095ac: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 20095b0: 02 80 00 33 be 200967c <_Heap_Walk+0x1c0> 20095b4: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 20095b8: 92 10 20 01 mov 1, %o1 20095bc: 15 00 80 79 sethi %hi(0x201e400), %o2 20095c0: 9f c7 40 00 call %i5 20095c4: 94 12 a3 10 or %o2, 0x310, %o2 ! 201e710 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20095c8: 10 bf ff cd b 20094fc <_Heap_Walk+0x40> 20095cc: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 20095d0: 90 10 00 19 mov %i1, %o0 20095d4: 92 10 20 01 mov 1, %o1 20095d8: 15 00 80 79 sethi %hi(0x201e400), %o2 20095dc: 9f c7 40 00 call %i5 20095e0: 94 12 a2 f8 or %o2, 0x2f8, %o2 ! 201e6f8 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20095e4: 10 bf ff c6 b 20094fc <_Heap_Walk+0x40> 20095e8: 82 10 20 00 clr %g1 first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 20095ec: 90 10 00 19 mov %i1, %o0 20095f0: 92 10 20 01 mov 1, %o1 20095f4: 15 00 80 79 sethi %hi(0x201e400), %o2 20095f8: 9f c7 40 00 call %i5 20095fc: 94 12 a2 30 or %o2, 0x230, %o2 ! 201e630 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009600: 10 bf ff bf b 20094fc <_Heap_Walk+0x40> 2009604: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2009608: 90 10 00 19 mov %i1, %o0 200960c: 92 10 20 01 mov 1, %o1 2009610: 96 10 00 10 mov %l0, %o3 2009614: 15 00 80 79 sethi %hi(0x201e400), %o2 2009618: 9f c7 40 00 call %i5 200961c: 94 12 a2 48 or %o2, 0x248, %o2 ! 201e648 <__log2table+0x210> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009620: 10 bf ff b7 b 20094fc <_Heap_Walk+0x40> 2009624: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2009628: 90 10 00 19 mov %i1, %o0 200962c: 92 10 20 01 mov 1, %o1 2009630: 96 10 00 1b mov %i3, %o3 2009634: 15 00 80 79 sethi %hi(0x201e400), %o2 2009638: 9f c7 40 00 call %i5 200963c: 94 12 a2 68 or %o2, 0x268, %o2 ! 201e668 <__log2table+0x230> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009640: 10 bf ff af b 20094fc <_Heap_Walk+0x40> 2009644: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2009648: 92 10 20 01 mov 1, %o1 200964c: 96 10 00 1c mov %i4, %o3 2009650: 15 00 80 79 sethi %hi(0x201e400), %o2 2009654: 9f c7 40 00 call %i5 2009658: 94 12 a2 90 or %o2, 0x290, %o2 ! 201e690 <__log2table+0x258> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200965c: 10 bf ff a8 b 20094fc <_Heap_Walk+0x40> 2009660: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2009664: 92 10 20 01 mov 1, %o1 2009668: 15 00 80 79 sethi %hi(0x201e400), %o2 200966c: 9f c7 40 00 call %i5 2009670: 94 12 a2 c8 or %o2, 0x2c8, %o2 ! 201e6c8 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009674: 10 bf ff a2 b 20094fc <_Heap_Walk+0x40> 2009678: 82 10 20 00 clr %g1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200967c: f4 06 20 08 ld [ %i0 + 8 ], %i2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 2009680: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 2009684: 80 a6 00 1a cmp %i0, %i2 2009688: 02 80 00 0d be 20096bc <_Heap_Walk+0x200> 200968c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2009690: 80 a0 40 1a cmp %g1, %i2 2009694: 28 80 00 bc bleu,a 2009984 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 2009698: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 200969c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20096a0: 92 10 20 01 mov 1, %o1 20096a4: 96 10 00 1a mov %i2, %o3 20096a8: 15 00 80 79 sethi %hi(0x201e400), %o2 20096ac: 9f c7 40 00 call %i5 20096b0: 94 12 a3 40 or %o2, 0x340, %o2 ! 201e740 <__log2table+0x308> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20096b4: 10 bf ff 92 b 20094fc <_Heap_Walk+0x40> 20096b8: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20096bc: 2d 00 80 7a sethi %hi(0x201e800), %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 20096c0: 2f 00 80 7a sethi %hi(0x201e800), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 20096c4: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20096c8: ac 15 a1 70 or %l6, 0x170, %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 20096cc: ae 15 e1 58 or %l7, 0x158, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20096d0: 2b 00 80 7a sethi %hi(0x201e800), %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 20096d4: a6 0d 3f fe and %l4, -2, %l3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20096d8: b4 04 c0 12 add %l3, %l2, %i2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 20096dc: 80 a0 40 1a cmp %g1, %i2 20096e0: 28 80 00 0b bleu,a 200970c <_Heap_Walk+0x250> <== ALWAYS TAKEN 20096e4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 20096e8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20096ec: 92 10 20 01 mov 1, %o1 20096f0: 96 10 00 12 mov %l2, %o3 20096f4: 15 00 80 79 sethi %hi(0x201e400), %o2 20096f8: 98 10 00 1a mov %i2, %o4 20096fc: 9f c7 40 00 call %i5 2009700: 94 12 a3 e8 or %o2, 0x3e8, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2009704: 10 bf ff 7e b 20094fc <_Heap_Walk+0x40> 2009708: 82 10 20 00 clr %g1 200970c: 80 a0 40 1a cmp %g1, %i2 2009710: 0a bf ff f7 bcs 20096ec <_Heap_Walk+0x230> 2009714: 90 10 00 19 mov %i1, %o0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; 2009718: 82 1c 80 11 xor %l2, %l1, %g1 200971c: 80 a0 00 01 cmp %g0, %g1 2009720: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009724: 90 10 00 13 mov %l3, %o0 2009728: c2 27 bf fc st %g1, [ %fp + -4 ] 200972c: 7f ff e0 f0 call 2001aec <.urem> 2009730: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2009734: 80 a2 20 00 cmp %o0, 0 2009738: 02 80 00 05 be 200974c <_Heap_Walk+0x290> 200973c: c2 07 bf fc ld [ %fp + -4 ], %g1 2009740: 80 88 60 ff btst 0xff, %g1 2009744: 12 80 00 76 bne 200991c <_Heap_Walk+0x460> 2009748: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200974c: 80 a6 c0 13 cmp %i3, %l3 2009750: 08 80 00 05 bleu 2009764 <_Heap_Walk+0x2a8> 2009754: 80 a4 80 1a cmp %l2, %i2 2009758: 80 88 60 ff btst 0xff, %g1 200975c: 12 80 00 78 bne 200993c <_Heap_Walk+0x480> <== ALWAYS TAKEN 2009760: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2009764: 2a 80 00 06 bcs,a 200977c <_Heap_Walk+0x2c0> 2009768: c2 06 a0 04 ld [ %i2 + 4 ], %g1 200976c: 80 88 60 ff btst 0xff, %g1 2009770: 12 80 00 7d bne 2009964 <_Heap_Walk+0x4a8> 2009774: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2009778: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200977c: 80 88 60 01 btst 1, %g1 2009780: 02 80 00 19 be 20097e4 <_Heap_Walk+0x328> 2009784: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2009788: 80 a5 20 00 cmp %l4, 0 200978c: 22 80 00 0e be,a 20097c4 <_Heap_Walk+0x308> 2009790: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 2009794: 90 10 00 19 mov %i1, %o0 2009798: 92 10 20 00 clr %o1 200979c: 94 10 00 17 mov %l7, %o2 20097a0: 96 10 00 12 mov %l2, %o3 20097a4: 9f c7 40 00 call %i5 20097a8: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20097ac: 80 a7 00 1a cmp %i4, %i2 20097b0: 02 80 00 42 be 20098b8 <_Heap_Walk+0x3fc> 20097b4: a4 10 00 1a mov %i2, %l2 20097b8: e8 06 a0 04 ld [ %i2 + 4 ], %l4 20097bc: 10 bf ff c6 b 20096d4 <_Heap_Walk+0x218> 20097c0: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20097c4: 96 10 00 12 mov %l2, %o3 20097c8: 90 10 00 19 mov %i1, %o0 20097cc: 92 10 20 00 clr %o1 20097d0: 94 10 00 16 mov %l6, %o2 20097d4: 9f c7 40 00 call %i5 20097d8: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20097dc: 10 bf ff f5 b 20097b0 <_Heap_Walk+0x2f4> 20097e0: 80 a7 00 1a cmp %i4, %i2 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 20097e4: da 04 a0 0c ld [ %l2 + 0xc ], %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 20097e8: c2 06 20 08 ld [ %i0 + 8 ], %g1 20097ec: 05 00 80 79 sethi %hi(0x201e400), %g2 return _Heap_Free_list_head(heap)->next; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 20097f0: c8 06 20 0c ld [ %i0 + 0xc ], %g4 20097f4: 80 a0 40 0d cmp %g1, %o5 20097f8: 02 80 00 05 be 200980c <_Heap_Walk+0x350> 20097fc: 86 10 a1 58 or %g2, 0x158, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2009800: 80 a6 00 0d cmp %i0, %o5 2009804: 02 80 00 3c be 20098f4 <_Heap_Walk+0x438> 2009808: 86 15 61 20 or %l5, 0x120, %g3 block->next, block->next == last_free_block ? 200980c: c2 04 a0 08 ld [ %l2 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2009810: 1f 00 80 79 sethi %hi(0x201e400), %o7 2009814: 80 a1 00 01 cmp %g4, %g1 2009818: 02 80 00 05 be 200982c <_Heap_Walk+0x370> 200981c: 84 13 e1 78 or %o7, 0x178, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2009820: 80 a6 00 01 cmp %i0, %g1 2009824: 02 80 00 31 be 20098e8 <_Heap_Walk+0x42c> 2009828: 84 15 61 20 or %l5, 0x120, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200982c: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2009830: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2009834: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2009838: 90 10 00 19 mov %i1, %o0 200983c: 92 10 20 00 clr %o1 2009840: 15 00 80 7a sethi %hi(0x201e800), %o2 2009844: 96 10 00 12 mov %l2, %o3 2009848: 94 12 a0 b0 or %o2, 0xb0, %o2 200984c: 9f c7 40 00 call %i5 2009850: 98 10 00 13 mov %l3, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2009854: da 06 80 00 ld [ %i2 ], %o5 2009858: 80 a4 c0 0d cmp %l3, %o5 200985c: 12 80 00 19 bne 20098c0 <_Heap_Walk+0x404> 2009860: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2009864: 02 80 00 27 be 2009900 <_Heap_Walk+0x444> 2009868: 90 10 00 19 mov %i1, %o0 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200986c: c2 06 20 08 ld [ %i0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2009870: 80 a6 00 01 cmp %i0, %g1 2009874: 02 80 00 0b be 20098a0 <_Heap_Walk+0x3e4> <== NEVER TAKEN 2009878: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200987c: 80 a4 80 01 cmp %l2, %g1 2009880: 02 bf ff cc be 20097b0 <_Heap_Walk+0x2f4> 2009884: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2009888: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 200988c: 80 a6 00 01 cmp %i0, %g1 2009890: 12 bf ff fc bne 2009880 <_Heap_Walk+0x3c4> 2009894: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2009898: 90 10 00 19 mov %i1, %o0 200989c: 92 10 20 01 mov 1, %o1 20098a0: 96 10 00 12 mov %l2, %o3 20098a4: 15 00 80 7a sethi %hi(0x201e800), %o2 20098a8: 9f c7 40 00 call %i5 20098ac: 94 12 a1 98 or %o2, 0x198, %o2 ! 201e998 <__log2table+0x560> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 20098b0: 10 bf ff 13 b 20094fc <_Heap_Walk+0x40> 20098b4: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 20098b8: 10 bf ff 11 b 20094fc <_Heap_Walk+0x40> 20098bc: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 20098c0: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 20098c4: 90 10 00 19 mov %i1, %o0 20098c8: 92 10 20 01 mov 1, %o1 20098cc: 96 10 00 12 mov %l2, %o3 20098d0: 15 00 80 7a sethi %hi(0x201e800), %o2 20098d4: 98 10 00 13 mov %l3, %o4 20098d8: 9f c7 40 00 call %i5 20098dc: 94 12 a0 e8 or %o2, 0xe8, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 20098e0: 10 bf ff 07 b 20094fc <_Heap_Walk+0x40> 20098e4: 82 10 20 00 clr %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20098e8: 05 00 80 79 sethi %hi(0x201e400), %g2 20098ec: 10 bf ff d0 b 200982c <_Heap_Walk+0x370> 20098f0: 84 10 a1 88 or %g2, 0x188, %g2 ! 201e588 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 20098f4: 07 00 80 79 sethi %hi(0x201e400), %g3 20098f8: 10 bf ff c5 b 200980c <_Heap_Walk+0x350> 20098fc: 86 10 e1 68 or %g3, 0x168, %g3 ! 201e568 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 2009900: 92 10 20 01 mov 1, %o1 2009904: 96 10 00 12 mov %l2, %o3 2009908: 15 00 80 7a sethi %hi(0x201e800), %o2 200990c: 9f c7 40 00 call %i5 2009910: 94 12 a1 28 or %o2, 0x128, %o2 ! 201e928 <__log2table+0x4f0> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2009914: 10 bf fe fa b 20094fc <_Heap_Walk+0x40> 2009918: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200991c: 92 10 20 01 mov 1, %o1 2009920: 96 10 00 12 mov %l2, %o3 2009924: 15 00 80 7a sethi %hi(0x201e800), %o2 2009928: 98 10 00 13 mov %l3, %o4 200992c: 9f c7 40 00 call %i5 2009930: 94 12 a0 18 or %o2, 0x18, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2009934: 10 bf fe f2 b 20094fc <_Heap_Walk+0x40> 2009938: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 200993c: 90 10 00 19 mov %i1, %o0 2009940: 92 10 20 01 mov 1, %o1 2009944: 96 10 00 12 mov %l2, %o3 2009948: 15 00 80 7a sethi %hi(0x201e800), %o2 200994c: 98 10 00 13 mov %l3, %o4 2009950: 94 12 a0 48 or %o2, 0x48, %o2 2009954: 9f c7 40 00 call %i5 2009958: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 200995c: 10 bf fe e8 b 20094fc <_Heap_Walk+0x40> 2009960: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2009964: 92 10 20 01 mov 1, %o1 2009968: 96 10 00 12 mov %l2, %o3 200996c: 15 00 80 7a sethi %hi(0x201e800), %o2 2009970: 98 10 00 1a mov %i2, %o4 2009974: 9f c7 40 00 call %i5 2009978: 94 12 a0 78 or %o2, 0x78, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200997c: 10 bf fe e0 b 20094fc <_Heap_Walk+0x40> 2009980: 82 10 20 00 clr %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2009984: 80 a4 c0 1a cmp %l3, %i2 2009988: 0a bf ff 46 bcs 20096a0 <_Heap_Walk+0x1e4> <== NEVER TAKEN 200998c: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009990: c2 27 bf fc st %g1, [ %fp + -4 ] 2009994: 90 06 a0 08 add %i2, 8, %o0 2009998: 7f ff e0 55 call 2001aec <.urem> 200999c: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 20099a0: 80 a2 20 00 cmp %o0, 0 20099a4: 12 80 00 36 bne 2009a7c <_Heap_Walk+0x5c0> <== NEVER TAKEN 20099a8: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 20099ac: c4 06 a0 04 ld [ %i2 + 4 ], %g2 20099b0: 84 08 bf fe and %g2, -2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 20099b4: 84 06 80 02 add %i2, %g2, %g2 20099b8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 20099bc: 80 88 a0 01 btst 1, %g2 20099c0: 12 80 00 27 bne 2009a5c <_Heap_Walk+0x5a0> <== NEVER TAKEN 20099c4: 84 10 00 18 mov %i0, %g2 20099c8: 10 80 00 19 b 2009a2c <_Heap_Walk+0x570> 20099cc: a4 10 00 1a mov %i2, %l2 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 20099d0: 80 a6 00 1a cmp %i0, %i2 20099d4: 02 bf ff 3a be 20096bc <_Heap_Walk+0x200> 20099d8: 80 a6 80 01 cmp %i2, %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 20099dc: 0a bf ff 31 bcs 20096a0 <_Heap_Walk+0x1e4> 20099e0: 90 10 00 19 mov %i1, %o0 20099e4: 80 a6 80 13 cmp %i2, %l3 20099e8: 18 bf ff 2f bgu 20096a4 <_Heap_Walk+0x1e8> <== NEVER TAKEN 20099ec: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20099f0: c2 27 bf fc st %g1, [ %fp + -4 ] 20099f4: 90 06 a0 08 add %i2, 8, %o0 20099f8: 7f ff e0 3d call 2001aec <.urem> 20099fc: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2009a00: 80 a2 20 00 cmp %o0, 0 2009a04: 12 80 00 1e bne 2009a7c <_Heap_Walk+0x5c0> 2009a08: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2009a0c: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2009a10: 84 10 00 12 mov %l2, %g2 2009a14: 86 08 ff fe and %g3, -2, %g3 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2009a18: 86 00 c0 1a add %g3, %i2, %g3 2009a1c: c6 00 e0 04 ld [ %g3 + 4 ], %g3 2009a20: 80 88 e0 01 btst 1, %g3 2009a24: 12 80 00 0e bne 2009a5c <_Heap_Walk+0x5a0> 2009a28: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2009a2c: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2009a30: 80 a3 00 02 cmp %o4, %g2 2009a34: 22 bf ff e7 be,a 20099d0 <_Heap_Walk+0x514> 2009a38: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2009a3c: 90 10 00 19 mov %i1, %o0 2009a40: 92 10 20 01 mov 1, %o1 2009a44: 96 10 00 1a mov %i2, %o3 2009a48: 15 00 80 79 sethi %hi(0x201e400), %o2 2009a4c: 9f c7 40 00 call %i5 2009a50: 94 12 a3 b0 or %o2, 0x3b0, %o2 ! 201e7b0 <__log2table+0x378> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009a54: 10 bf fe aa b 20094fc <_Heap_Walk+0x40> 2009a58: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2009a5c: 90 10 00 19 mov %i1, %o0 2009a60: 92 10 20 01 mov 1, %o1 2009a64: 96 10 00 1a mov %i2, %o3 2009a68: 15 00 80 79 sethi %hi(0x201e400), %o2 2009a6c: 9f c7 40 00 call %i5 2009a70: 94 12 a3 90 or %o2, 0x390, %o2 ! 201e790 <__log2table+0x358> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009a74: 10 bf fe a2 b 20094fc <_Heap_Walk+0x40> 2009a78: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2009a7c: 90 10 00 19 mov %i1, %o0 2009a80: 92 10 20 01 mov 1, %o1 2009a84: 96 10 00 1a mov %i2, %o3 2009a88: 15 00 80 79 sethi %hi(0x201e400), %o2 2009a8c: 9f c7 40 00 call %i5 2009a90: 94 12 a3 60 or %o2, 0x360, %o2 ! 201e760 <__log2table+0x328> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009a94: 10 bf fe 9a b 20094fc <_Heap_Walk+0x40> 2009a98: 82 10 20 00 clr %g1 =============================================================================== 02007ac0 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2007ac0: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2007ac4: 39 00 80 7f sethi %hi(0x201fc00), %i4 2007ac8: c2 07 22 44 ld [ %i4 + 0x244 ], %g1 ! 201fe44 <_IO_Number_of_drivers> 2007acc: 80 a0 60 00 cmp %g1, 0 2007ad0: 02 80 00 0c be 2007b00 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2007ad4: ba 10 20 00 clr %i5 2007ad8: b8 17 22 44 or %i4, 0x244, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2007adc: 90 10 00 1d mov %i5, %o0 2007ae0: 92 10 20 00 clr %o1 2007ae4: 40 00 1a 3b call 200e3d0 2007ae8: 94 10 20 00 clr %o2 void _IO_Initialize_all_drivers( void ) { rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2007aec: c2 07 00 00 ld [ %i4 ], %g1 2007af0: ba 07 60 01 inc %i5 2007af4: 80 a0 40 1d cmp %g1, %i5 2007af8: 18 bf ff fa bgu 2007ae0 <_IO_Initialize_all_drivers+0x20> 2007afc: 90 10 00 1d mov %i5, %o0 2007b00: 81 c7 e0 08 ret 2007b04: 81 e8 00 00 restore =============================================================================== 020079f4 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 20079f4: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 20079f8: 03 00 80 79 sethi %hi(0x201e400), %g1 20079fc: 82 10 63 5c or %g1, 0x35c, %g1 ! 201e75c drivers_in_table = Configuration.number_of_device_drivers; 2007a00: f8 00 60 34 ld [ %g1 + 0x34 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2007a04: f2 00 60 30 ld [ %g1 + 0x30 ], %i1 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 2007a08: 80 a7 00 19 cmp %i4, %i1 2007a0c: 0a 80 00 08 bcs 2007a2c <_IO_Manager_initialization+0x38> 2007a10: fa 00 60 38 ld [ %g1 + 0x38 ], %i5 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 2007a14: 03 00 80 7f sethi %hi(0x201fc00), %g1 2007a18: fa 20 62 48 st %i5, [ %g1 + 0x248 ] ! 201fe48 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2007a1c: 03 00 80 7f sethi %hi(0x201fc00), %g1 2007a20: f8 20 62 44 st %i4, [ %g1 + 0x244 ] ! 201fe44 <_IO_Number_of_drivers> return; 2007a24: 81 c7 e0 08 ret 2007a28: 81 e8 00 00 restore * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) 2007a2c: 83 2e 60 03 sll %i1, 3, %g1 2007a30: b5 2e 60 05 sll %i1, 5, %i2 2007a34: b4 26 80 01 sub %i2, %g1, %i2 * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( 2007a38: 40 00 0d 7f call 200b034 <_Workspace_Allocate_or_fatal_error> 2007a3c: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2007a40: 03 00 80 7f sethi %hi(0x201fc00), %g1 /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 2007a44: 37 00 80 7f sethi %hi(0x201fc00), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2007a48: f2 20 62 44 st %i1, [ %g1 + 0x244 ] /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 2007a4c: d0 26 e2 48 st %o0, [ %i3 + 0x248 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2007a50: 92 10 20 00 clr %o1 2007a54: 40 00 29 77 call 2012030 2007a58: 94 10 00 1a mov %i2, %o2 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007a5c: 80 a7 20 00 cmp %i4, 0 2007a60: 02 bf ff f1 be 2007a24 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2007a64: f6 06 e2 48 ld [ %i3 + 0x248 ], %i3 2007a68: 82 10 20 00 clr %g1 2007a6c: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007a70: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2007a74: 86 07 40 01 add %i5, %g1, %g3 2007a78: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 2007a7c: f4 00 e0 04 ld [ %g3 + 4 ], %i2 2007a80: 84 06 c0 01 add %i3, %g1, %g2 2007a84: f4 20 a0 04 st %i2, [ %g2 + 4 ] 2007a88: f4 00 e0 08 ld [ %g3 + 8 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007a8c: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007a90: f4 20 a0 08 st %i2, [ %g2 + 8 ] 2007a94: f4 00 e0 0c ld [ %g3 + 0xc ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007a98: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 2007a9c: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 2007aa0: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007aa4: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 2007aa8: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 2007aac: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007ab0: 12 bf ff f0 bne 2007a70 <_IO_Manager_initialization+0x7c> 2007ab4: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2007ab8: 81 c7 e0 08 ret 2007abc: 81 e8 00 00 restore =============================================================================== 020088c0 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20088c0: 9d e3 bf a0 save %sp, -96, %sp * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 20088c4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20088c8: ba 10 00 18 mov %i0, %i5 * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 20088cc: 80 a0 60 00 cmp %g1, 0 20088d0: 02 80 00 19 be 2008934 <_Objects_Allocate+0x74> <== NEVER TAKEN 20088d4: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20088d8: b8 07 60 20 add %i5, 0x20, %i4 20088dc: 7f ff fd 3c call 2007dcc <_Chain_Get> 20088e0: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 20088e4: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 20088e8: 80 a0 60 00 cmp %g1, 0 20088ec: 02 80 00 12 be 2008934 <_Objects_Allocate+0x74> 20088f0: b0 10 00 08 mov %o0, %i0 /* * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { 20088f4: 80 a2 20 00 cmp %o0, 0 20088f8: 02 80 00 11 be 200893c <_Objects_Allocate+0x7c> 20088fc: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2008900: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2008904: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2008908: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 200890c: 40 00 46 c4 call 201a41c <.udiv> 2008910: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2008914: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2008918: 91 2a 20 02 sll %o0, 2, %o0 200891c: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2008920: c4 17 60 2c lduh [ %i5 + 0x2c ], %g2 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 2008924: 86 00 ff ff add %g3, -1, %g3 2008928: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 200892c: 82 00 bf ff add %g2, -1, %g1 2008930: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2008934: 81 c7 e0 08 ret 2008938: 81 e8 00 00 restore * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { _Objects_Extend_information( information ); 200893c: 40 00 00 10 call 200897c <_Objects_Extend_information> 2008940: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2008944: 7f ff fd 22 call 2007dcc <_Chain_Get> 2008948: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 200894c: b0 92 20 00 orcc %o0, 0, %i0 2008950: 32 bf ff ed bne,a 2008904 <_Objects_Allocate+0x44> 2008954: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2008958: 81 c7 e0 08 ret 200895c: 81 e8 00 00 restore =============================================================================== 0200897c <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 200897c: 9d e3 bf 90 save %sp, -112, %sp minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2008980: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2008984: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2008988: 80 a4 20 00 cmp %l0, 0 200898c: 02 80 00 a6 be 2008c24 <_Objects_Extend_information+0x2a8> 2008990: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2008994: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 2008998: b3 2e 60 10 sll %i1, 0x10, %i1 200899c: 92 10 00 1a mov %i2, %o1 20089a0: 40 00 46 9f call 201a41c <.udiv> 20089a4: 91 36 60 10 srl %i1, 0x10, %o0 20089a8: a7 2a 20 10 sll %o0, 0x10, %l3 20089ac: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 20089b0: 80 a4 e0 00 cmp %l3, 0 20089b4: 02 80 00 a3 be 2008c40 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 20089b8: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 20089bc: c2 04 00 00 ld [ %l0 ], %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20089c0: ba 10 00 1c mov %i4, %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 20089c4: 80 a0 60 00 cmp %g1, 0 20089c8: 12 80 00 08 bne 20089e8 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 20089cc: b6 10 20 00 clr %i3 do_extend = false; 20089d0: 10 80 00 a0 b 2008c50 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 20089d4: b4 10 20 00 clr %i2 <== NOT EXECUTED block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 20089d8: c2 04 00 01 ld [ %l0 + %g1 ], %g1 20089dc: 80 a0 60 00 cmp %g1, 0 20089e0: 22 80 00 08 be,a 2008a00 <_Objects_Extend_information+0x84> 20089e4: b4 10 20 00 clr %i2 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 20089e8: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 20089ec: ba 07 40 1a add %i5, %i2, %i5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 20089f0: 80 a4 c0 1b cmp %l3, %i3 20089f4: 18 bf ff f9 bgu 20089d8 <_Objects_Extend_information+0x5c> 20089f8: 83 2e e0 02 sll %i3, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20089fc: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2008a00: b3 36 60 10 srl %i1, 0x10, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2008a04: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2008a08: b2 06 40 08 add %i1, %o0, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2008a0c: 82 10 63 ff or %g1, 0x3ff, %g1 2008a10: 80 a6 40 01 cmp %i1, %g1 2008a14: 18 80 00 93 bgu 2008c60 <_Objects_Extend_information+0x2e4> 2008a18: 01 00 00 00 nop /* * Allocate the name table, and the objects and if it fails either return or * generate a fatal error depending on auto-extending being active. */ block_size = information->allocation_size * information->size; 2008a1c: 40 00 46 46 call 201a334 <.umul> 2008a20: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2008a24: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2008a28: 80 a0 60 00 cmp %g1, 0 2008a2c: 02 80 00 6a be 2008bd4 <_Objects_Extend_information+0x258> 2008a30: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2008a34: 40 00 09 72 call 200affc <_Workspace_Allocate> 2008a38: 01 00 00 00 nop if ( !new_object_block ) 2008a3c: a0 92 20 00 orcc %o0, 0, %l0 2008a40: 02 80 00 88 be 2008c60 <_Objects_Extend_information+0x2e4> 2008a44: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2008a48: 80 8e a0 ff btst 0xff, %i2 2008a4c: 22 80 00 3f be,a 2008b48 <_Objects_Extend_information+0x1cc> 2008a50: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2008a54: b4 04 e0 01 add %l3, 1, %i2 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2008a58: 91 2e a0 01 sll %i2, 1, %o0 2008a5c: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2008a60: 90 06 40 08 add %i1, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2008a64: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2008a68: 40 00 09 65 call 200affc <_Workspace_Allocate> 2008a6c: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2008a70: a2 92 20 00 orcc %o0, 0, %l1 2008a74: 02 80 00 79 be 2008c58 <_Objects_Extend_information+0x2dc> 2008a78: b5 2e a0 02 sll %i2, 2, %i2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2008a7c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2008a80: 80 a7 00 01 cmp %i4, %g1 2008a84: a4 04 40 1a add %l1, %i2, %l2 2008a88: 0a 80 00 57 bcs 2008be4 <_Objects_Extend_information+0x268> 2008a8c: b4 04 80 1a add %l2, %i2, %i2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2008a90: 80 a7 20 00 cmp %i4, 0 2008a94: 02 80 00 07 be 2008ab0 <_Objects_Extend_information+0x134><== NEVER TAKEN 2008a98: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2008a9c: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2008aa0: 82 00 60 01 inc %g1 2008aa4: 80 a7 00 01 cmp %i4, %g1 2008aa8: 18 bf ff fd bgu 2008a9c <_Objects_Extend_information+0x120><== NEVER TAKEN 2008aac: c0 20 80 1a clr [ %g2 + %i2 ] 2008ab0: a7 2c e0 02 sll %l3, 2, %l3 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2008ab4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2008ab8: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2008abc: 86 07 40 03 add %i5, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008ac0: 80 a7 40 03 cmp %i5, %g3 2008ac4: 1a 80 00 0a bcc 2008aec <_Objects_Extend_information+0x170><== NEVER TAKEN 2008ac8: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2008acc: 83 2f 60 02 sll %i5, 2, %g1 2008ad0: 84 10 00 1d mov %i5, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008ad4: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2008ad8: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 2008adc: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008ae0: 80 a0 c0 02 cmp %g3, %g2 2008ae4: 18 bf ff fd bgu 2008ad8 <_Objects_Extend_information+0x15c> 2008ae8: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2008aec: 7f ff e6 9c call 200255c 2008af0: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008af4: c6 06 00 00 ld [ %i0 ], %g3 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2008af8: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2008afc: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2008b00: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2008b04: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008b08: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2008b0c: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2008b10: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2008b14: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2008b18: b3 2e 60 10 sll %i1, 0x10, %i1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008b1c: 03 00 00 40 sethi %hi(0x10000), %g1 2008b20: b3 36 60 10 srl %i1, 0x10, %i1 2008b24: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008b28: 82 10 40 02 or %g1, %g2, %g1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008b2c: 82 10 40 19 or %g1, %i1, %g1 2008b30: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2008b34: 7f ff e6 8e call 200256c 2008b38: 01 00 00 00 nop _Workspace_Free( old_tables ); 2008b3c: 40 00 09 38 call 200b01c <_Workspace_Free> 2008b40: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2008b44: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2008b48: b7 2e e0 02 sll %i3, 2, %i3 2008b4c: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2008b50: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2008b54: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2008b58: d2 00 40 1b ld [ %g1 + %i3 ], %o1 2008b5c: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2008b60: 90 07 bf f4 add %fp, -12, %o0 2008b64: 40 00 16 33 call 200e430 <_Chain_Initialize> 2008b68: 39 00 00 40 sethi %hi(0x10000), %i4 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2008b6c: 10 80 00 0d b 2008ba0 <_Objects_Extend_information+0x224> 2008b70: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 2008b74: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2008b78: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008b7c: 87 28 e0 1b sll %g3, 0x1b, %g3 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008b80: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008b84: 84 10 80 03 or %g2, %g3, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008b88: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008b8c: 90 10 00 1a mov %i2, %o0 2008b90: 92 10 00 01 mov %g1, %o1 index++; 2008b94: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008b98: 7f ff fc 79 call 2007d7c <_Chain_Append> 2008b9c: c4 20 60 08 st %g2, [ %g1 + 8 ] /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2008ba0: 7f ff fc 8b call 2007dcc <_Chain_Get> 2008ba4: 90 07 bf f4 add %fp, -12, %o0 2008ba8: 82 92 20 00 orcc %o0, 0, %g1 2008bac: 32 bf ff f2 bne,a 2008b74 <_Objects_Extend_information+0x1f8> 2008bb0: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2008bb4: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2008bb8: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2008bbc: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2008bc0: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2008bc4: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2008bc8: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2008bcc: 81 c7 e0 08 ret 2008bd0: 81 e8 00 00 restore if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 2008bd4: 40 00 09 18 call 200b034 <_Workspace_Allocate_or_fatal_error> 2008bd8: 01 00 00 00 nop 2008bdc: 10 bf ff 9b b 2008a48 <_Objects_Extend_information+0xcc> 2008be0: a0 10 00 08 mov %o0, %l0 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2008be4: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2008be8: a7 2c e0 02 sll %l3, 2, %l3 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2008bec: 40 00 24 d5 call 2011f40 2008bf0: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2008bf4: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2008bf8: 94 10 00 13 mov %l3, %o2 2008bfc: 40 00 24 d1 call 2011f40 2008c00: 90 10 00 12 mov %l2, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2008c04: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2008c08: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2008c0c: b8 07 00 01 add %i4, %g1, %i4 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2008c10: 90 10 00 1a mov %i2, %o0 2008c14: 40 00 24 cb call 2011f40 2008c18: 95 2f 20 02 sll %i4, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2008c1c: 10 bf ff a7 b 2008ab8 <_Objects_Extend_information+0x13c> 2008c20: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2008c24: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2008c28: ba 10 00 1c mov %i4, %i5 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2008c2c: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2008c30: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2008c34: a6 10 20 00 clr %l3 2008c38: 10 bf ff 72 b 2008a00 <_Objects_Extend_information+0x84> 2008c3c: b3 2e 60 10 sll %i1, 0x10, %i1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2008c40: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2008c44: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2008c48: 10 bf ff 6e b 2008a00 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2008c4c: b6 10 20 00 clr %i3 <== NOT EXECUTED 2008c50: 10 bf ff 6c b 2008a00 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2008c54: b6 10 20 00 clr %i3 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 2008c58: 40 00 08 f1 call 200b01c <_Workspace_Free> 2008c5c: 90 10 00 10 mov %l0, %o0 return; 2008c60: 81 c7 e0 08 ret 2008c64: 81 e8 00 00 restore =============================================================================== 02008d0c <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2008d0c: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2008d10: 80 a6 60 00 cmp %i1, 0 2008d14: 02 80 00 17 be 2008d70 <_Objects_Get_information+0x64> 2008d18: ba 10 20 00 clr %i5 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 2008d1c: 40 00 17 b3 call 200ebe8 <_Objects_API_maximum_class> 2008d20: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2008d24: 80 a2 20 00 cmp %o0, 0 2008d28: 02 80 00 12 be 2008d70 <_Objects_Get_information+0x64> 2008d2c: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2008d30: 0a 80 00 10 bcs 2008d70 <_Objects_Get_information+0x64> 2008d34: 03 00 80 7d sethi %hi(0x201f400), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2008d38: b1 2e 20 02 sll %i0, 2, %i0 2008d3c: 82 10 60 28 or %g1, 0x28, %g1 2008d40: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2008d44: 80 a0 60 00 cmp %g1, 0 2008d48: 02 80 00 0a be 2008d70 <_Objects_Get_information+0x64> <== NEVER TAKEN 2008d4c: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2008d50: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2008d54: 80 a7 60 00 cmp %i5, 0 2008d58: 02 80 00 06 be 2008d70 <_Objects_Get_information+0x64> <== NEVER TAKEN 2008d5c: 01 00 00 00 nop * In a multprocessing configuration, we may access remote objects. * Thus we may have 0 local instances and still have a valid object * pointer. */ #if !defined(RTEMS_MULTIPROCESSING) if ( info->maximum == 0 ) 2008d60: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2008d64: 80 a0 00 01 cmp %g0, %g1 2008d68: 82 60 20 00 subx %g0, 0, %g1 2008d6c: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2008d70: 81 c7 e0 08 ret 2008d74: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 0200a658 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 200a658: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 200a65c: 80 a6 60 00 cmp %i1, 0 200a660: 02 80 00 41 be 200a764 <_Objects_Get_name_as_string+0x10c> 200a664: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 200a668: 02 80 00 3a be 200a750 <_Objects_Get_name_as_string+0xf8> 200a66c: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 200a670: 02 80 00 3a be 200a758 <_Objects_Get_name_as_string+0x100> 200a674: 03 00 80 89 sethi %hi(0x2022400), %g1 information = _Objects_Get_information_id( tmpId ); 200a678: 7f ff ff ba call 200a560 <_Objects_Get_information_id> 200a67c: 90 10 00 18 mov %i0, %o0 if ( !information ) 200a680: ba 92 20 00 orcc %o0, 0, %i5 200a684: 02 80 00 38 be 200a764 <_Objects_Get_name_as_string+0x10c> 200a688: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 200a68c: 40 00 00 3f call 200a788 <_Objects_Get> 200a690: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 200a694: c2 07 bf fc ld [ %fp + -4 ], %g1 200a698: 80 a0 60 00 cmp %g1, 0 200a69c: 32 80 00 33 bne,a 200a768 <_Objects_Get_name_as_string+0x110> 200a6a0: b4 10 20 00 clr %i2 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 200a6a4: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1 200a6a8: 80 a0 60 00 cmp %g1, 0 200a6ac: 32 80 00 31 bne,a 200a770 <_Objects_Get_name_as_string+0x118> 200a6b0: c4 02 20 0c ld [ %o0 + 0xc ], %g2 s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 200a6b4: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 200a6b8: c0 2f bf f4 clrb [ %fp + -12 ] { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 200a6bc: 85 30 60 08 srl %g1, 8, %g2 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 200a6c0: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 200a6c4: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 200a6c8: c4 2f bf f2 stb %g2, [ %fp + -14 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 200a6cc: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 200a6d0: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 200a6d4: c2 2f bf f3 stb %g1, [ %fp + -13 ] lname[ 4 ] = '\0'; s = lname; 200a6d8: 84 07 bf f0 add %fp, -16, %g2 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 200a6dc: b2 86 7f ff addcc %i1, -1, %i1 200a6e0: 02 80 00 1a be 200a748 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 200a6e4: 82 10 00 1a mov %i2, %g1 200a6e8: c8 48 80 00 ldsb [ %g2 ], %g4 200a6ec: 80 a1 20 00 cmp %g4, 0 200a6f0: 02 80 00 16 be 200a748 <_Objects_Get_name_as_string+0xf0> 200a6f4: c6 08 80 00 ldub [ %g2 ], %g3 200a6f8: 31 00 80 84 sethi %hi(0x2021000), %i0 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 200a6fc: b2 06 80 19 add %i2, %i1, %i1 200a700: 10 80 00 05 b 200a714 <_Objects_Get_name_as_string+0xbc> 200a704: b0 16 21 d4 or %i0, 0x1d4, %i0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 200a708: 80 a1 20 00 cmp %g4, 0 200a70c: 02 80 00 0f be 200a748 <_Objects_Get_name_as_string+0xf0> 200a710: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 200a714: fa 06 00 00 ld [ %i0 ], %i5 200a718: 88 08 e0 ff and %g3, 0xff, %g4 200a71c: 88 07 40 04 add %i5, %g4, %g4 200a720: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 200a724: 80 89 20 97 btst 0x97, %g4 200a728: 12 80 00 03 bne 200a734 <_Objects_Get_name_as_string+0xdc> 200a72c: 84 00 a0 01 inc %g2 200a730: 86 10 20 2a mov 0x2a, %g3 200a734: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 200a738: 82 00 60 01 inc %g1 200a73c: 80 a0 40 19 cmp %g1, %i1 200a740: 32 bf ff f2 bne,a 200a708 <_Objects_Get_name_as_string+0xb0> 200a744: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 200a748: 40 00 03 f2 call 200b710 <_Thread_Enable_dispatch> 200a74c: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 200a750: 81 c7 e0 08 ret 200a754: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 200a758: c2 00 60 bc ld [ %g1 + 0xbc ], %g1 200a75c: 10 bf ff c7 b 200a678 <_Objects_Get_name_as_string+0x20> 200a760: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 200a764: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 200a768: 81 c7 e0 08 ret 200a76c: 91 e8 00 1a restore %g0, %i2, %o0 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 200a770: 80 a0 a0 00 cmp %g2, 0 200a774: 12 bf ff da bne 200a6dc <_Objects_Get_name_as_string+0x84> 200a778: 82 10 00 1a mov %i2, %g1 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 200a77c: 40 00 03 e5 call 200b710 <_Thread_Enable_dispatch> 200a780: c0 28 40 00 clrb [ %g1 ] 200a784: 30 bf ff f3 b,a 200a750 <_Objects_Get_name_as_string+0xf8> =============================================================================== 02008d38 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2008d38: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2008d3c: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2008d40: 80 a6 20 00 cmp %i0, 0 2008d44: 02 80 00 19 be 2008da8 <_Objects_Get_next+0x70> 2008d48: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2008d4c: 80 a6 a0 00 cmp %i2, 0 2008d50: 02 80 00 16 be 2008da8 <_Objects_Get_next+0x70> 2008d54: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2008d58: 02 80 00 14 be 2008da8 <_Objects_Get_next+0x70> 2008d5c: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2008d60: 80 a0 60 00 cmp %g1, 0 2008d64: 22 80 00 13 be,a 2008db0 <_Objects_Get_next+0x78> 2008d68: f2 06 20 08 ld [ %i0 + 8 ], %i1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008d6c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008d70: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008d74: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008d78: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008d7c: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008d80: 80 a0 80 01 cmp %g2, %g1 2008d84: 0a 80 00 13 bcs 2008dd0 <_Objects_Get_next+0x98> 2008d88: 94 10 00 1a mov %i2, %o2 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008d8c: 40 00 00 18 call 2008dec <_Objects_Get> 2008d90: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2008d94: c2 06 80 00 ld [ %i2 ], %g1 2008d98: 80 a0 60 00 cmp %g1, 0 2008d9c: 32 bf ff f5 bne,a 2008d70 <_Objects_Get_next+0x38> 2008da0: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2008da4: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2008da8: 81 c7 e0 08 ret 2008dac: 91 e8 00 08 restore %g0, %o0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008db0: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008db4: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008db8: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008dbc: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008dc0: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008dc4: 80 a0 80 01 cmp %g2, %g1 2008dc8: 1a bf ff f1 bcc 2008d8c <_Objects_Get_next+0x54> <== ALWAYS TAKEN 2008dcc: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2008dd0: 82 10 20 01 mov 1, %g1 2008dd4: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2008dd8: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2008ddc: 82 10 3f ff mov -1, %g1 2008de0: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2008de4: 81 c7 e0 08 ret 2008de8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020098cc <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 20098cc: 9d e3 bf 98 save %sp, -104, %sp /* * Caller is trusted for name != NULL. */ tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 20098d0: 80 a6 20 00 cmp %i0, 0 20098d4: 12 80 00 06 bne 20098ec <_Objects_Id_to_name+0x20> 20098d8: 83 36 20 18 srl %i0, 0x18, %g1 20098dc: 03 00 80 83 sethi %hi(0x2020c00), %g1 20098e0: c2 00 62 9c ld [ %g1 + 0x29c ], %g1 ! 2020e9c <_Per_CPU_Information+0xc> 20098e4: f0 00 60 08 ld [ %g1 + 8 ], %i0 20098e8: 83 36 20 18 srl %i0, 0x18, %g1 20098ec: 82 08 60 07 and %g1, 7, %g1 */ RTEMS_INLINE_ROUTINE bool _Objects_Is_api_valid( uint32_t the_api ) { if ( !the_api || the_api > OBJECTS_APIS_LAST ) 20098f0: 84 00 7f ff add %g1, -1, %g2 20098f4: 80 a0 a0 02 cmp %g2, 2 20098f8: 18 80 00 12 bgu 2009940 <_Objects_Id_to_name+0x74> 20098fc: ba 10 20 03 mov 3, %i5 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 2009900: 83 28 60 02 sll %g1, 2, %g1 2009904: 05 00 80 82 sethi %hi(0x2020800), %g2 2009908: 84 10 a0 b8 or %g2, 0xb8, %g2 ! 20208b8 <_Objects_Information_table> 200990c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009910: 80 a0 60 00 cmp %g1, 0 2009914: 02 80 00 0b be 2009940 <_Objects_Id_to_name+0x74> 2009918: 85 36 20 1b srl %i0, 0x1b, %g2 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 200991c: 85 28 a0 02 sll %g2, 2, %g2 2009920: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2009924: 80 a2 20 00 cmp %o0, 0 2009928: 02 80 00 06 be 2009940 <_Objects_Id_to_name+0x74> <== NEVER TAKEN 200992c: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2009930: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2009934: 80 a0 60 00 cmp %g1, 0 2009938: 02 80 00 04 be 2009948 <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN 200993c: 92 10 00 18 mov %i0, %o1 return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2009940: 81 c7 e0 08 ret 2009944: 91 e8 00 1d restore %g0, %i5, %o0 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2009948: 7f ff ff c3 call 2009854 <_Objects_Get> 200994c: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2009950: 80 a2 20 00 cmp %o0, 0 2009954: 02 bf ff fb be 2009940 <_Objects_Id_to_name+0x74> 2009958: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200995c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009960: ba 10 20 00 clr %i5 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 2009964: 40 00 03 c7 call 200a880 <_Thread_Enable_dispatch> 2009968: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 200996c: 30 bf ff f5 b,a 2009940 <_Objects_Id_to_name+0x74> =============================================================================== 02009018 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2009018: 9d e3 bf a0 save %sp, -96, %sp /* * Search the list to find block or chunk with all objects inactive. */ index_base = _Objects_Get_index( information->minimum_id ); 200901c: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 2009020: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2009024: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2009028: 92 10 00 1c mov %i4, %o1 200902c: 40 00 44 fc call 201a41c <.udiv> 2009030: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009034: 80 a2 20 00 cmp %o0, 0 2009038: 02 80 00 34 be 2009108 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 200903c: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2009040: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2009044: c2 01 00 00 ld [ %g4 ], %g1 2009048: 80 a7 00 01 cmp %i4, %g1 200904c: 02 80 00 0f be 2009088 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2009050: 82 10 20 00 clr %g1 2009054: 10 80 00 07 b 2009070 <_Objects_Shrink_information+0x58> 2009058: b6 10 20 04 mov 4, %i3 * the_block - the block to remove * * Output parameters: NONE */ void _Objects_Shrink_information( 200905c: 86 06 e0 04 add %i3, 4, %g3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 2009060: 80 a7 00 02 cmp %i4, %g2 2009064: 02 80 00 0a be 200908c <_Objects_Shrink_information+0x74> 2009068: ba 07 40 1c add %i5, %i4, %i5 200906c: b6 10 00 03 mov %g3, %i3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009070: 82 00 60 01 inc %g1 2009074: 80 a0 40 08 cmp %g1, %o0 2009078: 32 bf ff f9 bne,a 200905c <_Objects_Shrink_information+0x44> 200907c: c4 01 00 1b ld [ %g4 + %i3 ], %g2 2009080: 81 c7 e0 08 ret 2009084: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2009088: b6 10 20 00 clr %i3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200908c: 10 80 00 06 b 20090a4 <_Objects_Shrink_information+0x8c> 2009090: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2009094: 80 a7 20 00 cmp %i4, 0 2009098: 22 80 00 12 be,a 20090e0 <_Objects_Shrink_information+0xc8> 200909c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 20090a0: 90 10 00 1c mov %i4, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 20090a4: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 20090a8: 80 a0 40 1d cmp %g1, %i5 20090ac: 0a bf ff fa bcs 2009094 <_Objects_Shrink_information+0x7c> 20090b0: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 20090b4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20090b8: 84 07 40 02 add %i5, %g2, %g2 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 20090bc: 80 a0 40 02 cmp %g1, %g2 20090c0: 1a bf ff f6 bcc 2009098 <_Objects_Shrink_information+0x80> 20090c4: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 20090c8: 7f ff fb 38 call 2007da8 <_Chain_Extract> 20090cc: 01 00 00 00 nop } } while ( the_object ); 20090d0: 80 a7 20 00 cmp %i4, 0 20090d4: 12 bf ff f4 bne 20090a4 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 20090d8: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 20090dc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 20090e0: 40 00 07 cf call 200b01c <_Workspace_Free> 20090e4: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 20090e8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 20090ec: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 20090f0: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 20090f4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 20090f8: c2 16 20 14 lduh [ %i0 + 0x14 ], %g1 * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; 20090fc: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 2009100: 82 20 80 01 sub %g2, %g1, %g1 2009104: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2009108: 81 c7 e0 08 ret 200910c: 81 e8 00 00 restore =============================================================================== 02010bb8 <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 2010bb8: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 2010bbc: f4 06 20 08 ld [ %i0 + 8 ], %i2 2010bc0: 3b 00 80 7e sethi %hi(0x201f800), %i5 2010bc4: b3 36 a0 18 srl %i2, 0x18, %i1 2010bc8: ba 17 60 d8 or %i5, 0xd8, %i5 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 2010bcc: b5 2e a0 10 sll %i2, 0x10, %i2 2010bd0: b2 0e 60 07 and %i1, 7, %i1 2010bd4: b5 36 a0 0e srl %i2, 0xe, %i2 2010bd8: b2 06 60 04 add %i1, 4, %i1 2010bdc: b3 2e 60 02 sll %i1, 2, %i1 Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 2010be0: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 2010be4: 80 a6 e0 00 cmp %i3, 0 2010be8: 02 80 00 20 be 2010c68 <_POSIX_Keys_Run_destructors+0xb0> 2010bec: b8 10 20 01 mov 1, %i4 2010bf0: 84 10 20 01 mov 1, %g2 POSIX_Keys_Control *key = (POSIX_Keys_Control *) 2010bf4: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 _POSIX_Keys_Information.local_table [ index ]; 2010bf8: 83 2f 20 10 sll %i4, 0x10, %g1 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 2010bfc: 83 30 60 0e srl %g1, 0xe, %g1 2010c00: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 2010c04: 80 a0 60 00 cmp %g1, 0 2010c08: 02 80 00 10 be 2010c48 <_POSIX_Keys_Run_destructors+0x90> 2010c0c: 86 00 40 19 add %g1, %i1, %g3 2010c10: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 2010c14: 80 a1 20 00 cmp %g4, 0 2010c18: 22 80 00 0d be,a 2010c4c <_POSIX_Keys_Run_destructors+0x94> 2010c1c: b8 07 20 01 inc %i4 void *value = key->Values [ thread_api ][ thread_index ]; 2010c20: c6 00 e0 04 ld [ %g3 + 4 ], %g3 2010c24: d0 00 c0 1a ld [ %g3 + %i2 ], %o0 if ( value != NULL ) { 2010c28: 80 a2 20 00 cmp %o0, 0 2010c2c: 22 80 00 08 be,a 2010c4c <_POSIX_Keys_Run_destructors+0x94><== ALWAYS TAKEN 2010c30: b8 07 20 01 inc %i4 key->Values [ thread_api ][ thread_index ] = NULL; 2010c34: c0 20 c0 1a clr [ %g3 + %i2 ] <== NOT EXECUTED (*key->destructor)( value ); 2010c38: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED 2010c3c: 9f c0 40 00 call %g1 <== NOT EXECUTED 2010c40: 01 00 00 00 nop <== NOT EXECUTED done = false; 2010c44: 84 10 20 00 clr %g2 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 2010c48: b8 07 20 01 inc %i4 2010c4c: 83 2f 20 10 sll %i4, 0x10, %g1 2010c50: 83 30 60 10 srl %g1, 0x10, %g1 2010c54: 80 a6 c0 01 cmp %i3, %g1 2010c58: 1a bf ff e7 bcc 2010bf4 <_POSIX_Keys_Run_destructors+0x3c> 2010c5c: 80 88 a0 ff btst 0xff, %g2 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 2010c60: 22 bf ff e1 be,a 2010be4 <_POSIX_Keys_Run_destructors+0x2c><== NEVER TAKEN 2010c64: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 <== NOT EXECUTED 2010c68: 81 c7 e0 08 ret 2010c6c: 81 e8 00 00 restore =============================================================================== 0200c754 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200c754: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *_POSIX_Message_queue_Get_fd ( mqd_t id, Objects_Locations *location ) { return (POSIX_Message_queue_Control_fd *) _Objects_Get( 200c758: 11 00 80 b4 sethi %hi(0x202d000), %o0 200c75c: 92 10 00 18 mov %i0, %o1 200c760: 90 12 20 2c or %o0, 0x2c, %o0 200c764: 40 00 0d ba call 200fe4c <_Objects_Get> 200c768: 94 07 bf f8 add %fp, -8, %o2 Objects_Locations location; size_t length_out; bool do_wait; the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { 200c76c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200c770: 80 a0 60 00 cmp %g1, 0 200c774: 22 80 00 08 be,a 200c794 <_POSIX_Message_queue_Receive_support+0x40> 200c778: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200c77c: 40 00 32 1c call 2018fec <__errno> 200c780: b0 10 3f ff mov -1, %i0 200c784: 82 10 20 09 mov 9, %g1 200c788: c2 22 00 00 st %g1, [ %o0 ] } 200c78c: 81 c7 e0 08 ret 200c790: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200c794: 84 08 60 03 and %g1, 3, %g2 200c798: 80 a0 a0 01 cmp %g2, 1 200c79c: 02 80 00 3a be 200c884 <_POSIX_Message_queue_Receive_support+0x130> 200c7a0: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200c7a4: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200c7a8: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200c7ac: 80 a0 80 1a cmp %g2, %i2 200c7b0: 18 80 00 24 bgu 200c840 <_POSIX_Message_queue_Receive_support+0xec> 200c7b4: 84 10 3f ff mov -1, %g2 /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200c7b8: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200c7bc: 80 a7 20 00 cmp %i4, 0 200c7c0: 12 80 00 1b bne 200c82c <_POSIX_Message_queue_Receive_support+0xd8> 200c7c4: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200c7c8: 9a 10 00 1d mov %i5, %o5 200c7cc: 90 02 20 1c add %o0, 0x1c, %o0 200c7d0: 92 10 00 18 mov %i0, %o1 200c7d4: 94 10 00 19 mov %i1, %o2 200c7d8: 96 07 bf fc add %fp, -4, %o3 200c7dc: 40 00 09 0b call 200ec08 <_CORE_message_queue_Seize> 200c7e0: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200c7e4: 40 00 11 9b call 2010e50 <_Thread_Enable_dispatch> 200c7e8: 3b 00 80 b4 sethi %hi(0x202d000), %i5 if (msg_prio) { 200c7ec: 80 a6 e0 00 cmp %i3, 0 *msg_prio = _POSIX_Message_queue_Priority_from_core( _Thread_Executing->Wait.count 200c7f0: ba 17 60 a0 or %i5, 0xa0, %i5 do_wait, timeout ); _Thread_Enable_dispatch(); if (msg_prio) { 200c7f4: 02 80 00 07 be 200c810 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN 200c7f8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core( CORE_message_queue_Submit_types priority ) { /* absolute value without a library dependency */ return ((priority >= 0) ? priority : -priority); 200c7fc: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 200c800: 85 38 e0 1f sra %g3, 0x1f, %g2 200c804: 86 18 80 03 xor %g2, %g3, %g3 200c808: 84 20 c0 02 sub %g3, %g2, %g2 *msg_prio = _POSIX_Message_queue_Priority_from_core( 200c80c: c4 26 c0 00 st %g2, [ %i3 ] _Thread_Executing->Wait.count ); } if ( !_Thread_Executing->Wait.return_code ) 200c810: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200c814: 80 a0 60 00 cmp %g1, 0 200c818: 12 80 00 12 bne 200c860 <_POSIX_Message_queue_Receive_support+0x10c> 200c81c: 01 00 00 00 nop return length_out; 200c820: f0 07 bf fc ld [ %fp + -4 ], %i0 200c824: 81 c7 e0 08 ret 200c828: 81 e8 00 00 restore /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200c82c: 05 00 00 10 sethi %hi(0x4000), %g2 200c830: 82 08 40 02 and %g1, %g2, %g1 200c834: 80 a0 00 01 cmp %g0, %g1 200c838: 10 bf ff e4 b 200c7c8 <_POSIX_Message_queue_Receive_support+0x74> 200c83c: 98 60 3f ff subx %g0, -1, %o4 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { _Thread_Enable_dispatch(); 200c840: 40 00 11 84 call 2010e50 <_Thread_Enable_dispatch> 200c844: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200c848: 40 00 31 e9 call 2018fec <__errno> 200c84c: 01 00 00 00 nop 200c850: 82 10 20 7a mov 0x7a, %g1 ! 7a 200c854: c2 22 00 00 st %g1, [ %o0 ] 200c858: 81 c7 e0 08 ret 200c85c: 81 e8 00 00 restore } if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200c860: 40 00 31 e3 call 2018fec <__errno> 200c864: b0 10 3f ff mov -1, %i0 200c868: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200c86c: b6 10 00 08 mov %o0, %i3 200c870: 40 00 00 a3 call 200cafc <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200c874: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200c878: d0 26 c0 00 st %o0, [ %i3 ] 200c87c: 81 c7 e0 08 ret 200c880: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { _Thread_Enable_dispatch(); 200c884: 40 00 11 73 call 2010e50 <_Thread_Enable_dispatch> 200c888: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200c88c: 40 00 31 d8 call 2018fec <__errno> 200c890: 01 00 00 00 nop 200c894: 82 10 20 09 mov 9, %g1 ! 9 200c898: c2 22 00 00 st %g1, [ %o0 ] 200c89c: 81 c7 e0 08 ret 200c8a0: 81 e8 00 00 restore =============================================================================== 0200d870 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch>: Thread_Control *the_thread ) { POSIX_API_Control *thread_support; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d870: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200d874: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200d878: 80 a0 a0 00 cmp %g2, 0 200d87c: 12 80 00 06 bne 200d894 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200d880: 01 00 00 00 nop 200d884: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200d888: 80 a0 a0 01 cmp %g2, 1 200d88c: 22 80 00 05 be,a 200d8a0 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200d890: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); } else _Thread_Enable_dispatch(); 200d894: 82 13 c0 00 mov %o7, %g1 200d898: 7f ff f1 af call 2009f54 <_Thread_Enable_dispatch> 200d89c: 9e 10 40 00 mov %g1, %o7 POSIX_API_Control *thread_support; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200d8a0: 80 a0 60 00 cmp %g1, 0 200d8a4: 02 bf ff fc be 200d894 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200d8a8: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200d8ac: 03 00 80 7e sethi %hi(0x201f800), %g1 200d8b0: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 201f9e0 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200d8b4: 92 10 3f ff mov -1, %o1 200d8b8: 84 00 bf ff add %g2, -1, %g2 200d8bc: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return _Thread_Dispatch_disable_level; 200d8c0: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 200d8c4: 82 13 c0 00 mov %o7, %g1 200d8c8: 40 00 01 da call 200e030 <_POSIX_Thread_Exit> 200d8cc: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200ed94 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200ed94: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200ed98: d0 06 40 00 ld [ %i1 ], %o0 200ed9c: 7f ff ff f1 call 200ed60 <_POSIX_Priority_Is_valid> 200eda0: ba 10 00 18 mov %i0, %i5 200eda4: 80 8a 20 ff btst 0xff, %o0 200eda8: 02 80 00 34 be 200ee78 <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN 200edac: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200edb0: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; 200edb4: c0 26 c0 00 clr [ %i3 ] if ( policy == SCHED_OTHER ) { 200edb8: 80 a7 60 00 cmp %i5, 0 200edbc: 02 80 00 2d be 200ee70 <_POSIX_Thread_Translate_sched_param+0xdc> 200edc0: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200edc4: 80 a7 60 01 cmp %i5, 1 200edc8: 02 80 00 2c be 200ee78 <_POSIX_Thread_Translate_sched_param+0xe4> 200edcc: 80 a7 60 02 cmp %i5, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200edd0: 02 80 00 2c be 200ee80 <_POSIX_Thread_Translate_sched_param+0xec> 200edd4: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200edd8: 12 80 00 28 bne 200ee78 <_POSIX_Thread_Translate_sched_param+0xe4> 200eddc: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200ede0: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ede4: 80 a0 60 00 cmp %g1, 0 200ede8: 32 80 00 07 bne,a 200ee04 <_POSIX_Thread_Translate_sched_param+0x70> 200edec: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200edf0: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200edf4: 80 a0 60 00 cmp %g1, 0 200edf8: 02 80 00 23 be 200ee84 <_POSIX_Thread_Translate_sched_param+0xf0> 200edfc: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200ee00: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ee04: 80 a0 60 00 cmp %g1, 0 200ee08: 12 80 00 06 bne 200ee20 <_POSIX_Thread_Translate_sched_param+0x8c> 200ee0c: 01 00 00 00 nop 200ee10: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200ee14: 80 a0 60 00 cmp %g1, 0 200ee18: 02 80 00 18 be 200ee78 <_POSIX_Thread_Translate_sched_param+0xe4> 200ee1c: b0 10 20 16 mov 0x16, %i0 (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200ee20: 7f ff f2 d7 call 200b97c <_Timespec_To_ticks> 200ee24: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200ee28: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_init_budget.tv_sec == 0) && (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200ee2c: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200ee30: 7f ff f2 d3 call 200b97c <_Timespec_To_ticks> 200ee34: 90 06 60 10 add %i1, 0x10, %o0 if ( (param->sched_ss_init_budget.tv_sec == 0) && (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200ee38: 80 a7 40 08 cmp %i5, %o0 200ee3c: 0a 80 00 12 bcs 200ee84 <_POSIX_Thread_Translate_sched_param+0xf0> 200ee40: 01 00 00 00 nop _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; if ( !_POSIX_Priority_Is_valid( param->sched_ss_low_priority ) ) 200ee44: 7f ff ff c7 call 200ed60 <_POSIX_Priority_Is_valid> 200ee48: d0 06 60 04 ld [ %i1 + 4 ], %o0 200ee4c: 80 8a 20 ff btst 0xff, %o0 200ee50: 02 80 00 0a be 200ee78 <_POSIX_Thread_Translate_sched_param+0xe4> 200ee54: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200ee58: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200ee5c: 03 00 80 1e sethi %hi(0x2007800), %g1 200ee60: 82 10 60 dc or %g1, 0xdc, %g1 ! 20078dc <_POSIX_Threads_Sporadic_budget_callout> 200ee64: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200ee68: 81 c7 e0 08 ret 200ee6c: 91 e8 20 00 restore %g0, 0, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200ee70: 82 10 20 01 mov 1, %g1 200ee74: c2 26 80 00 st %g1, [ %i2 ] return 0; 200ee78: 81 c7 e0 08 ret 200ee7c: 81 e8 00 00 restore *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200ee80: fa 26 80 00 st %i5, [ %i2 ] return 0; 200ee84: 81 c7 e0 08 ret 200ee88: 81 e8 00 00 restore =============================================================================== 0200dbac <_POSIX_Threads_Delete_extension>: */ void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200dbac: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; void **value_ptr; api = deleted->API_Extensions[ THREAD_API_POSIX ]; 200dbb0: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200dbb4: 40 00 0b e5 call 2010b48 <_POSIX_Threads_cancel_run> 200dbb8: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200dbbc: 90 10 00 19 mov %i1, %o0 200dbc0: 40 00 0b fe call 2010bb8 <_POSIX_Keys_Run_destructors> 200dbc4: ba 06 20 44 add %i0, 0x44, %i5 /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200dbc8: 10 80 00 03 b 200dbd4 <_POSIX_Threads_Delete_extension+0x28> 200dbcc: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200dbd0: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200dbd4: 7f ff f1 78 call 200a1b4 <_Thread_queue_Dequeue> 200dbd8: 90 10 00 1d mov %i5, %o0 200dbdc: 80 a2 20 00 cmp %o0, 0 200dbe0: 32 bf ff fc bne,a 200dbd0 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200dbe4: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200dbe8: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200dbec: 80 a0 60 04 cmp %g1, 4 200dbf0: 02 80 00 05 be 200dc04 <_POSIX_Threads_Delete_extension+0x58> 200dbf4: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200dbf8: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200dbfc: 7f ff f5 08 call 200b01c <_Workspace_Free> 200dc00: 81 e8 00 00 restore while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200dc04: 7f ff f4 7c call 200adf4 <_Watchdog_Remove> 200dc08: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200dc0c: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200dc10: 7f ff f5 03 call 200b01c <_Workspace_Free> 200dc14: 81 e8 00 00 restore =============================================================================== 020075dc <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 20075dc: 9d e3 bf 58 save %sp, -168, %sp uint32_t maximum; posix_initialization_threads_table *user_threads; pthread_t thread_id; pthread_attr_t attr; user_threads = Configuration_POSIX_API.User_initialization_threads_table; 20075e0: 03 00 80 8d sethi %hi(0x2023400), %g1 20075e4: 82 10 61 48 or %g1, 0x148, %g1 ! 2023548 maximum = Configuration_POSIX_API.number_of_initialization_threads; 20075e8: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 20075ec: 80 a6 e0 00 cmp %i3, 0 20075f0: 02 80 00 18 be 2007650 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20075f4: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 20075f8: 80 a7 60 00 cmp %i5, 0 20075fc: 02 80 00 15 be 2007650 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2007600: b8 10 20 00 clr %i4 for ( index=0 ; index < maximum ; index++ ) { /* * There is no way for these calls to fail in this situation. */ (void) pthread_attr_init( &attr ); 2007604: 40 00 1e 22 call 200ee8c 2007608: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 200760c: 92 10 20 02 mov 2, %o1 2007610: 40 00 1e 2b call 200eebc 2007614: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2007618: d2 07 60 04 ld [ %i5 + 4 ], %o1 200761c: 40 00 1e 38 call 200eefc 2007620: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 2007624: d4 07 40 00 ld [ %i5 ], %o2 2007628: 90 07 bf fc add %fp, -4, %o0 200762c: 92 07 bf bc add %fp, -68, %o1 2007630: 7f ff fe fd call 2007224 2007634: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 2007638: 94 92 20 00 orcc %o0, 0, %o2 200763c: 12 80 00 07 bne 2007658 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 2007640: b8 07 20 01 inc %i4 * * Setting the attributes explicitly is critical, since we don't want * to inherit the idle tasks attributes. */ for ( index=0 ; index < maximum ; index++ ) { 2007644: 80 a6 c0 1c cmp %i3, %i4 2007648: 18 bf ff ef bgu 2007604 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 200764c: ba 07 60 08 add %i5, 8, %i5 2007650: 81 c7 e0 08 ret 2007654: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2007658: 90 10 20 02 mov 2, %o0 200765c: 40 00 08 89 call 2009880 <_Internal_error_Occurred> 2007660: 92 10 20 01 mov 1, %o1 =============================================================================== 0200dd4c <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200dd4c: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; the_thread = argument; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200dd50: fa 06 61 5c ld [ %i1 + 0x15c ], %i5 /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget ); 200dd54: 40 00 04 6a call 200eefc <_Timespec_To_ticks> 200dd58: 90 07 60 98 add %i5, 0x98, %o0 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 200dd5c: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200dd60: 03 00 80 79 sethi %hi(0x201e400), %g1 200dd64: d2 08 63 a0 ldub [ %g1 + 0x3a0 ], %o1 ! 201e7a0 */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200dd68: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200dd6c: 92 22 40 02 sub %o1, %g2, %o1 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget ); the_thread->cpu_time_budget = ticks; 200dd70: d0 26 60 74 st %o0, [ %i1 + 0x74 ] */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200dd74: 80 a0 60 00 cmp %g1, 0 200dd78: 12 80 00 06 bne 200dd90 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200dd7c: d2 26 60 18 st %o1, [ %i1 + 0x18 ] /* * If this would make them less important, then do not change it. */ if ( the_thread->current_priority > new_priority ) { 200dd80: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200dd84: 80 a0 40 09 cmp %g1, %o1 200dd88: 38 80 00 09 bgu,a 200ddac <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200dd8c: 90 10 00 19 mov %i1, %o0 #endif } } /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period ); 200dd90: 40 00 04 5b call 200eefc <_Timespec_To_ticks> 200dd94: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200dd98: 31 00 80 7d sethi %hi(0x201f400), %i0 200dd9c: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200dda0: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200dda4: 7f ff f3 b2 call 200ac6c <_Watchdog_Insert> 200dda8: 91 ee 21 80 restore %i0, 0x180, %o0 if ( the_thread->resource_count == 0 ) { /* * If this would make them less important, then do not change it. */ if ( the_thread->current_priority > new_priority ) { _Thread_Change_priority( the_thread, new_priority, true ); 200ddac: 7f ff ee e1 call 2009930 <_Thread_Change_priority> 200ddb0: 94 10 20 01 mov 1, %o2 #endif } } /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period ); 200ddb4: 40 00 04 52 call 200eefc <_Timespec_To_ticks> 200ddb8: 90 07 60 90 add %i5, 0x90, %o0 200ddbc: 31 00 80 7d sethi %hi(0x201f400), %i0 200ddc0: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200ddc4: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200ddc8: 7f ff f3 a9 call 200ac6c <_Watchdog_Insert> 200ddcc: 91 ee 21 80 restore %i0, 0x180, %o0 =============================================================================== 0200ddd0 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200ddd0: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200ddd4: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200ddd8: 05 00 80 79 sethi %hi(0x201e400), %g2 200dddc: d2 08 a3 a0 ldub [ %g2 + 0x3a0 ], %o1 ! 201e7a0 */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200dde0: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200dde4: 92 22 40 03 sub %o1, %g3, %o1 /* * This will prevent the thread from consuming its entire "budget" * while at low priority. */ the_thread->cpu_time_budget = 0xFFFFFFFF; /* XXX should be based on MAX_U32 */ 200dde8: 86 10 3f ff mov -1, %g3 new_priority = _POSIX_Priority_To_core(api->schedparam.sched_ss_low_priority); the_thread->real_priority = new_priority; 200ddec: d2 22 20 18 st %o1, [ %o0 + 0x18 ] */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200ddf0: 80 a0 a0 00 cmp %g2, 0 200ddf4: 12 80 00 06 bne 200de0c <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200ddf8: c6 22 20 74 st %g3, [ %o0 + 0x74 ] /* * Make sure we are actually lowering it. If they have lowered it * to logically lower than sched_ss_low_priority, then we do not want to * change it. */ if ( the_thread->current_priority < new_priority ) { 200ddfc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200de00: 80 a0 40 09 cmp %g1, %o1 200de04: 0a 80 00 04 bcs 200de14 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200de08: 94 10 20 01 mov 1, %o2 200de0c: 81 c3 e0 08 retl <== NOT EXECUTED 200de10: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200de14: 82 13 c0 00 mov %o7, %g1 200de18: 7f ff ee c6 call 2009930 <_Thread_Change_priority> 200de1c: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02010b48 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 2010b48: 9d e3 bf a0 save %sp, -96, %sp POSIX_Cancel_Handler_control *handler; Chain_Control *handler_stack; POSIX_API_Control *thread_support; ISR_Level level; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2010b4c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 2010b50: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 2010b54: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2010b58: b6 07 20 e8 add %i4, 0xe8, %i3 2010b5c: 80 a0 40 1b cmp %g1, %i3 2010b60: 02 80 00 14 be 2010bb0 <_POSIX_Threads_cancel_run+0x68> 2010b64: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 2010b68: 7f ff c6 7d call 200255c 2010b6c: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 2010b70: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2010b74: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 2010b78: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 2010b7c: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 2010b80: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 2010b84: 7f ff c6 7a call 200256c 2010b88: 01 00 00 00 nop (*handler->routine)( handler->arg ); 2010b8c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2010b90: 9f c0 40 00 call %g1 2010b94: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 2010b98: 7f ff e9 21 call 200b01c <_Workspace_Free> 2010b9c: 90 10 00 1d mov %i5, %o0 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; while ( !_Chain_Is_empty( handler_stack ) ) { 2010ba0: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 2010ba4: 80 a0 40 1b cmp %g1, %i3 2010ba8: 12 bf ff f0 bne 2010b68 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 2010bac: 01 00 00 00 nop 2010bb0: 81 c7 e0 08 ret 2010bb4: 81 e8 00 00 restore =============================================================================== 0200708c <_POSIX_Timer_TSR>: * This is the operation that is run when a timer expires */ void _POSIX_Timer_TSR( Objects_Id timer __attribute__((unused)), void *data) { 200708c: 9d e3 bf 98 save %sp, -104, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2007090: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007094: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2007098: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 200709c: 80 a0 60 00 cmp %g1, 0 20070a0: 12 80 00 0e bne 20070d8 <_POSIX_Timer_TSR+0x4c> 20070a4: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 20070a8: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 20070ac: 80 a0 60 00 cmp %g1, 0 20070b0: 32 80 00 0b bne,a 20070dc <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 20070b4: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; } else { /* Indicates that the timer is stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 20070b8: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 20070bc: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] <== NOT EXECUTED /* * The sending of the signal to the process running the handling function * specified for that signal is simulated */ if ( pthread_kill ( ptimer->thread_id, ptimer->inf.sigev_signo ) ) { 20070c0: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 20070c4: 40 00 1c 89 call 200e2e8 20070c8: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 20070cc: c0 26 60 68 clr [ %i1 + 0x68 ] 20070d0: 81 c7 e0 08 ret 20070d4: 81 e8 00 00 restore ptimer->overrun = ptimer->overrun + 1; /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 20070d8: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 20070dc: d4 06 60 08 ld [ %i1 + 8 ], %o2 20070e0: 90 06 60 10 add %i1, 0x10, %o0 20070e4: 98 10 00 19 mov %i1, %o4 20070e8: 17 00 80 1c sethi %hi(0x2007000), %o3 20070ec: 40 00 1d a6 call 200e784 <_POSIX_Timer_Insert_helper> 20070f0: 96 12 e0 8c or %o3, 0x8c, %o3 ! 200708c <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 20070f4: 80 8a 20 ff btst 0xff, %o0 20070f8: 02 bf ff f6 be 20070d0 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 20070fc: 01 00 00 00 nop struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007100: 40 00 06 16 call 2008958 <_TOD_Get_as_timestamp> 2007104: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007108: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 200710c: 94 10 20 00 clr %o2 2007110: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007114: 90 10 00 1c mov %i4, %o0 2007118: 96 12 e2 00 or %o3, 0x200, %o3 200711c: 40 00 51 51 call 201b660 <__divdi3> 2007120: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007124: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007128: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 200712c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007130: 90 10 00 1c mov %i4, %o0 2007134: 96 12 e2 00 or %o3, 0x200, %o3 2007138: 40 00 52 30 call 201b9f8 <__moddi3> 200713c: 92 10 00 1d mov %i5, %o1 /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2007140: 82 10 20 03 mov 3, %g1 2007144: d2 26 60 70 st %o1, [ %i1 + 0x70 ] 2007148: 10 bf ff de b 20070c0 <_POSIX_Timer_TSR+0x34> 200714c: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 02010c70 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 2010c70: 9d e3 bf 68 save %sp, -152, %sp siginfo_t siginfo_struct; sigset_t saved_signals_blocked; Thread_Wait_information stored_thread_wait_information; if ( ! _POSIX_signals_Clear_signals( api, signo, &siginfo_struct, 2010c74: 98 10 20 01 mov 1, %o4 2010c78: 90 10 00 18 mov %i0, %o0 2010c7c: 92 10 00 19 mov %i1, %o1 2010c80: 94 07 bf f4 add %fp, -12, %o2 2010c84: 40 00 00 2e call 2010d3c <_POSIX_signals_Clear_signals> 2010c88: 96 10 00 1a mov %i2, %o3 2010c8c: 80 8a 20 ff btst 0xff, %o0 2010c90: 02 80 00 23 be 2010d1c <_POSIX_signals_Check_signal+0xac> 2010c94: 82 10 20 00 clr %g1 #endif /* * Just to prevent sending a signal which is currently being ignored. */ if ( _POSIX_signals_Vectors[ signo ].sa_handler == SIG_IGN ) 2010c98: 85 2e 60 02 sll %i1, 2, %g2 2010c9c: 37 00 80 7e sethi %hi(0x201f800), %i3 2010ca0: b9 2e 60 04 sll %i1, 4, %i4 2010ca4: b6 16 e2 60 or %i3, 0x260, %i3 2010ca8: b8 27 00 02 sub %i4, %g2, %i4 2010cac: 84 06 c0 1c add %i3, %i4, %g2 2010cb0: fa 00 a0 08 ld [ %g2 + 8 ], %i5 2010cb4: 80 a7 60 01 cmp %i5, 1 2010cb8: 02 80 00 19 be 2010d1c <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 2010cbc: 21 00 80 7e sethi %hi(0x201f800), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 2010cc0: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 2010cc4: c2 00 a0 04 ld [ %g2 + 4 ], %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 2010cc8: a0 14 22 00 or %l0, 0x200, %l0 2010ccc: d2 04 20 0c ld [ %l0 + 0xc ], %o1 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 2010cd0: 82 10 40 1a or %g1, %i2, %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 2010cd4: 90 07 bf cc add %fp, -52, %o0 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 2010cd8: c2 26 20 d0 st %g1, [ %i0 + 0xd0 ] /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 2010cdc: 92 02 60 20 add %o1, 0x20, %o1 2010ce0: 40 00 04 98 call 2011f40 2010ce4: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 2010ce8: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 2010cec: 80 a0 60 02 cmp %g1, 2 2010cf0: 02 80 00 0e be 2010d28 <_POSIX_signals_Check_signal+0xb8> 2010cf4: 90 10 00 19 mov %i1, %o0 &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 2010cf8: 9f c7 40 00 call %i5 2010cfc: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 2010d00: d0 04 20 0c ld [ %l0 + 0xc ], %o0 2010d04: 92 07 bf cc add %fp, -52, %o1 2010d08: 90 02 20 20 add %o0, 0x20, %o0 2010d0c: 40 00 04 8d call 2011f40 2010d10: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 2010d14: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 2010d18: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 2010d1c: b0 08 60 01 and %g1, 1, %i0 2010d20: 81 c7 e0 08 ret 2010d24: 81 e8 00 00 restore /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 2010d28: 92 07 bf f4 add %fp, -12, %o1 2010d2c: 9f c7 40 00 call %i5 2010d30: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 2010d34: 10 bf ff f4 b 2010d04 <_POSIX_signals_Check_signal+0x94> 2010d38: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 02011524 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 2011524: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 2011528: 7f ff c4 0d call 200255c 201152c: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 2011530: 85 2e 20 04 sll %i0, 4, %g2 2011534: 83 2e 20 02 sll %i0, 2, %g1 2011538: 82 20 80 01 sub %g2, %g1, %g1 201153c: 05 00 80 7e sethi %hi(0x201f800), %g2 2011540: 84 10 a2 60 or %g2, 0x260, %g2 ! 201fa60 <_POSIX_signals_Vectors> 2011544: c4 00 80 01 ld [ %g2 + %g1 ], %g2 2011548: 80 a0 a0 02 cmp %g2, 2 201154c: 02 80 00 0b be 2011578 <_POSIX_signals_Clear_process_signals+0x54> 2011550: 05 00 80 7f sethi %hi(0x201fc00), %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 2011554: 03 00 80 7f sethi %hi(0x201fc00), %g1 2011558: c4 00 60 54 ld [ %g1 + 0x54 ], %g2 ! 201fc54 <_POSIX_signals_Pending> 201155c: 86 10 20 01 mov 1, %g3 2011560: b0 06 3f ff add %i0, -1, %i0 2011564: b1 28 c0 18 sll %g3, %i0, %i0 2011568: b0 28 80 18 andn %g2, %i0, %i0 201156c: f0 20 60 54 st %i0, [ %g1 + 0x54 ] } _ISR_Enable( level ); 2011570: 7f ff c3 ff call 200256c 2011574: 91 e8 00 08 restore %g0, %o0, %o0 ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 2011578: 84 10 a0 58 or %g2, 0x58, %g2 201157c: c6 00 40 02 ld [ %g1 + %g2 ], %g3 2011580: 82 00 40 02 add %g1, %g2, %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2011584: 82 00 60 04 add %g1, 4, %g1 2011588: 80 a0 c0 01 cmp %g3, %g1 201158c: 02 bf ff f3 be 2011558 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN 2011590: 03 00 80 7f sethi %hi(0x201fc00), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 2011594: 7f ff c3 f6 call 200256c <== NOT EXECUTED 2011598: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02007f00 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2007f00: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED 2007f04: 86 10 20 01 mov 1, %g3 <== NOT EXECUTED #include #include #include #include int _POSIX_signals_Get_lowest( 2007f08: 84 00 7f ff add %g1, -1, %g2 <== NOT EXECUTED 2007f0c: 85 28 c0 02 sll %g3, %g2, %g2 <== NOT EXECUTED ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2007f10: 80 88 80 08 btst %g2, %o0 <== NOT EXECUTED 2007f14: 12 80 00 11 bne 2007f58 <_POSIX_signals_Get_lowest+0x58> <== NOT EXECUTED 2007f18: 01 00 00 00 nop <== NOT EXECUTED sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2007f1c: 82 00 60 01 inc %g1 <== NOT EXECUTED 2007f20: 80 a0 60 20 cmp %g1, 0x20 <== NOT EXECUTED 2007f24: 12 bf ff fa bne 2007f0c <_POSIX_signals_Get_lowest+0xc> <== NOT EXECUTED 2007f28: 84 00 7f ff add %g1, -1, %g2 <== NOT EXECUTED 2007f2c: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2007f30: 10 80 00 05 b 2007f44 <_POSIX_signals_Get_lowest+0x44> <== NOT EXECUTED 2007f34: 86 10 20 01 mov 1, %g3 <== NOT EXECUTED */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2007f38: 80 a0 60 1b cmp %g1, 0x1b <== NOT EXECUTED 2007f3c: 02 80 00 07 be 2007f58 <_POSIX_signals_Get_lowest+0x58> <== NOT EXECUTED 2007f40: 01 00 00 00 nop <== NOT EXECUTED #include #include #include #include int _POSIX_signals_Get_lowest( 2007f44: 84 00 7f ff add %g1, -1, %g2 <== NOT EXECUTED 2007f48: 85 28 c0 02 sll %g3, %g2, %g2 <== NOT EXECUTED #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2007f4c: 80 88 80 08 btst %g2, %o0 <== NOT EXECUTED 2007f50: 22 bf ff fa be,a 2007f38 <_POSIX_signals_Get_lowest+0x38><== NOT EXECUTED 2007f54: 82 00 60 01 inc %g1 <== NOT EXECUTED * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 2007f58: 81 c3 e0 08 retl <== NOT EXECUTED 2007f5c: 90 10 00 01 mov %g1, %o0 <== NOT EXECUTED =============================================================================== 0200d8fc <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200d8fc: 9d e3 bf a0 save %sp, -96, %sp /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d900: 35 00 80 7e sethi %hi(0x201f800), %i2 POSIX_API_Control *api; int signo; ISR_Level level; int hold_errno; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d904: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d908: b4 16 a2 00 or %i2, 0x200, %i2 200d90c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200d910: 80 a7 20 00 cmp %i4, 0 200d914: 02 80 00 34 be 200d9e4 <_POSIX_signals_Post_switch_extension+0xe8> 200d918: f2 00 60 34 ld [ %g1 + 0x34 ], %i1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200d91c: 7f ff d3 10 call 200255c 200d920: 37 00 80 7f sethi %hi(0x201fc00), %i3 200d924: b6 16 e0 54 or %i3, 0x54, %i3 ! 201fc54 <_POSIX_signals_Pending> if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d928: c6 06 c0 00 ld [ %i3 ], %g3 200d92c: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d930: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d934: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d938: 80 a8 40 02 andncc %g1, %g2, %g0 200d93c: 02 80 00 26 be 200d9d4 <_POSIX_signals_Post_switch_extension+0xd8> 200d940: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200d944: 7f ff d3 0a call 200256c 200d948: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d94c: 92 10 00 1d mov %i5, %o1 200d950: 94 10 20 00 clr %o2 200d954: 40 00 0c c7 call 2010c70 <_POSIX_signals_Check_signal> 200d958: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d95c: 92 10 00 1d mov %i5, %o1 200d960: 90 10 00 1c mov %i4, %o0 200d964: 40 00 0c c3 call 2010c70 <_POSIX_signals_Check_signal> 200d968: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200d96c: ba 07 60 01 inc %i5 200d970: 80 a7 60 20 cmp %i5, 0x20 200d974: 12 bf ff f7 bne 200d950 <_POSIX_signals_Post_switch_extension+0x54> 200d978: 92 10 00 1d mov %i5, %o1 200d97c: ba 10 20 01 mov 1, %i5 _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d980: 92 10 00 1d mov %i5, %o1 200d984: 94 10 20 00 clr %o2 200d988: 40 00 0c ba call 2010c70 <_POSIX_signals_Check_signal> 200d98c: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d990: 92 10 00 1d mov %i5, %o1 200d994: 90 10 00 1c mov %i4, %o0 200d998: 40 00 0c b6 call 2010c70 <_POSIX_signals_Check_signal> 200d99c: 94 10 20 01 mov 1, %o2 _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 200d9a0: ba 07 60 01 inc %i5 200d9a4: 80 a7 60 1b cmp %i5, 0x1b 200d9a8: 12 bf ff f7 bne 200d984 <_POSIX_signals_Post_switch_extension+0x88> 200d9ac: 92 10 00 1d mov %i5, %o1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200d9b0: 7f ff d2 eb call 200255c 200d9b4: 01 00 00 00 nop if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d9b8: c6 06 c0 00 ld [ %i3 ], %g3 200d9bc: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d9c0: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d9c4: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d9c8: 80 a8 40 02 andncc %g1, %g2, %g0 200d9cc: 12 bf ff de bne 200d944 <_POSIX_signals_Post_switch_extension+0x48><== NEVER TAKEN 200d9d0: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200d9d4: 7f ff d2 e6 call 200256c 200d9d8: 01 00 00 00 nop _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } } _Thread_Executing->Wait.return_code = hold_errno; 200d9dc: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 200d9e0: f2 20 60 34 st %i1, [ %g1 + 0x34 ] 200d9e4: 81 c7 e0 08 ret 200d9e8: 81 e8 00 00 restore =============================================================================== 0201c2a0 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201c2a0: 9d e3 bf a0 save %sp, -96, %sp /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201c2a4: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201c2a8: 05 04 00 20 sethi %hi(0x10008000), %g2 201c2ac: 86 10 20 01 mov 1, %g3 201c2b0: ba 06 7f ff add %i1, -1, %i5 201c2b4: 88 08 40 02 and %g1, %g2, %g4 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201c2b8: da 06 21 5c ld [ %i0 + 0x15c ], %o5 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201c2bc: 80 a1 00 02 cmp %g4, %g2 201c2c0: 02 80 00 1c be 201c330 <_POSIX_signals_Unblock_thread+0x90> 201c2c4: 9f 28 c0 1d sll %g3, %i5, %o7 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201c2c8: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2 201c2cc: 80 ab c0 02 andncc %o7, %g2, %g0 201c2d0: 02 80 00 15 be 201c324 <_POSIX_signals_Unblock_thread+0x84> 201c2d4: ba 10 20 00 clr %i5 201c2d8: 05 04 00 00 sethi %hi(0x10000000), %g2 * it is not blocked, THEN * we need to dispatch at the end of this ISR. * + Any other combination, do nothing. */ if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) { 201c2dc: 80 88 40 02 btst %g1, %g2 201c2e0: 02 80 00 29 be 201c384 <_POSIX_signals_Unblock_thread+0xe4> 201c2e4: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201c2e8: 84 10 20 04 mov 4, %g2 201c2ec: c4 26 20 34 st %g2, [ %i0 + 0x34 ] */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 201c2f0: 05 00 00 ef sethi %hi(0x3bc00), %g2 201c2f4: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) 201c2f8: 80 88 40 02 btst %g1, %g2 201c2fc: 12 80 00 36 bne 201c3d4 <_POSIX_signals_Unblock_thread+0x134> 201c300: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201c304: 22 80 00 09 be,a 201c328 <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN 201c308: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201c30c: 7f ff ba ba call 200adf4 <_Watchdog_Remove> 201c310: 90 06 20 48 add %i0, 0x48, %o0 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 201c314: 13 04 00 ff sethi %hi(0x1003fc00), %o1 201c318: 90 10 00 18 mov %i0, %o0 201c31c: 7f ff b5 d0 call 2009a5c <_Thread_Clear_state> 201c320: 92 12 63 f8 or %o1, 0x3f8, %o1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201c324: b0 0f 60 01 and %i5, 1, %i0 201c328: 81 c7 e0 08 ret 201c32c: 81 e8 00 00 restore * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201c330: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201c334: 80 8b c0 01 btst %o7, %g1 201c338: 22 80 00 21 be,a 201c3bc <_POSIX_signals_Unblock_thread+0x11c> 201c33c: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201c340: 82 10 20 04 mov 4, %g1 201c344: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201c348: 80 a6 a0 00 cmp %i2, 0 201c34c: 02 80 00 27 be 201c3e8 <_POSIX_signals_Unblock_thread+0x148> 201c350: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 the_info->si_signo = signo; the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; } else { *the_info = *info; 201c354: c4 06 80 00 ld [ %i2 ], %g2 201c358: c4 20 40 00 st %g2, [ %g1 ] 201c35c: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201c360: c4 20 60 04 st %g2, [ %g1 + 4 ] 201c364: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201c368: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201c36c: 90 10 00 18 mov %i0, %o0 201c370: 7f ff b8 a1 call 200a5f4 <_Thread_queue_Extract_with_proxy> 201c374: ba 10 20 01 mov 1, %i5 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201c378: b0 0f 60 01 and %i5, 1, %i0 201c37c: 81 c7 e0 08 ret 201c380: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 201c384: 12 bf ff e8 bne 201c324 <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN 201c388: 03 00 80 7e sethi %hi(0x201f800), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201c38c: 82 10 62 00 or %g1, 0x200, %g1 ! 201fa00 <_Per_CPU_Information> 201c390: c4 00 60 08 ld [ %g1 + 8 ], %g2 201c394: 80 a0 a0 00 cmp %g2, 0 201c398: 22 bf ff e4 be,a 201c328 <_POSIX_signals_Unblock_thread+0x88> 201c39c: b0 0f 60 01 and %i5, 1, %i0 201c3a0: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201c3a4: 80 a6 00 02 cmp %i0, %g2 201c3a8: 22 bf ff df be,a 201c324 <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN 201c3ac: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] 201c3b0: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 201c3b4: 81 c7 e0 08 ret <== NOT EXECUTED 201c3b8: 81 e8 00 00 restore <== NOT EXECUTED * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201c3bc: 80 ab c0 01 andncc %o7, %g1, %g0 201c3c0: 12 bf ff e0 bne 201c340 <_POSIX_signals_Unblock_thread+0xa0> 201c3c4: ba 10 20 00 clr %i5 201c3c8: b0 0f 60 01 and %i5, 1, %i0 201c3cc: 81 c7 e0 08 ret 201c3d0: 81 e8 00 00 restore /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 201c3d4: 7f ff b8 88 call 200a5f4 <_Thread_queue_Extract_with_proxy> 201c3d8: 90 10 00 18 mov %i0, %o0 201c3dc: b0 0f 60 01 and %i5, 1, %i0 201c3e0: 81 c7 e0 08 ret 201c3e4: 81 e8 00 00 restore the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 201c3e8: 84 10 20 01 mov 1, %g2 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 201c3ec: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201c3f0: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201c3f4: 10 bf ff de b 201c36c <_POSIX_signals_Unblock_thread+0xcc> 201c3f8: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 0200f8ec <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200f8ec: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200f8f0: 80 a6 60 00 cmp %i1, 0 200f8f4: 02 80 00 4c be 200fa24 <_RBTree_Extract_unprotected+0x138> 200f8f8: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200f8fc: c2 06 20 08 ld [ %i0 + 8 ], %g1 200f900: 80 a0 40 19 cmp %g1, %i1 200f904: 22 80 00 59 be,a 200fa68 <_RBTree_Extract_unprotected+0x17c> 200f908: c2 06 60 08 ld [ %i1 + 8 ], %g1 the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200f90c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200f910: 80 a0 40 19 cmp %g1, %i1 200f914: 22 80 00 46 be,a 200fa2c <_RBTree_Extract_unprotected+0x140> 200f918: c2 06 60 04 ld [ %i1 + 4 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200f91c: fa 06 60 04 ld [ %i1 + 4 ], %i5 200f920: 80 a7 60 00 cmp %i5, 0 200f924: 22 80 00 4a be,a 200fa4c <_RBTree_Extract_unprotected+0x160> 200f928: f8 06 60 08 ld [ %i1 + 8 ], %i4 200f92c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200f930: 80 a0 60 00 cmp %g1, 0 200f934: 32 80 00 05 bne,a 200f948 <_RBTree_Extract_unprotected+0x5c> 200f938: c2 07 60 08 ld [ %i5 + 8 ], %g1 200f93c: 10 80 00 50 b 200fa7c <_RBTree_Extract_unprotected+0x190> 200f940: b8 10 00 1d mov %i5, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 200f944: c2 07 60 08 ld [ %i5 + 8 ], %g1 200f948: 80 a0 60 00 cmp %g1, 0 200f94c: 32 bf ff fe bne,a 200f944 <_RBTree_Extract_unprotected+0x58> 200f950: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 200f954: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200f958: 80 a7 20 00 cmp %i4, 0 200f95c: 02 80 00 54 be 200faac <_RBTree_Extract_unprotected+0x1c0> 200f960: 01 00 00 00 nop leaf->parent = target->parent; 200f964: c2 07 40 00 ld [ %i5 ], %g1 200f968: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200f96c: c4 07 40 00 ld [ %i5 ], %g2 target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200f970: c2 06 40 00 ld [ %i1 ], %g1 } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200f974: c8 00 a0 04 ld [ %g2 + 4 ], %g4 leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 200f978: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200f97c: 88 19 00 1d xor %g4, %i5, %g4 200f980: 80 a0 00 04 cmp %g0, %g4 200f984: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200f988: 89 29 20 02 sll %g4, 2, %g4 200f98c: 84 00 80 04 add %g2, %g4, %g2 200f990: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200f994: c4 00 60 04 ld [ %g1 + 4 ], %g2 200f998: 84 18 80 19 xor %g2, %i1, %g2 200f99c: 80 a0 00 02 cmp %g0, %g2 200f9a0: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200f9a4: 85 28 a0 02 sll %g2, 2, %g2 200f9a8: 82 00 40 02 add %g1, %g2, %g1 200f9ac: fa 20 60 04 st %i5, [ %g1 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 200f9b0: c2 06 60 08 ld [ %i1 + 8 ], %g1 200f9b4: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200f9b8: c2 06 60 08 ld [ %i1 + 8 ], %g1 200f9bc: 80 a0 60 00 cmp %g1, 0 200f9c0: 32 80 00 02 bne,a 200f9c8 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200f9c4: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200f9c8: c2 06 60 04 ld [ %i1 + 4 ], %g1 200f9cc: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200f9d0: c2 06 60 04 ld [ %i1 + 4 ], %g1 200f9d4: 80 a0 60 00 cmp %g1, 0 200f9d8: 32 80 00 02 bne,a 200f9e0 <_RBTree_Extract_unprotected+0xf4> 200f9dc: fa 20 40 00 st %i5, [ %g1 ] /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200f9e0: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200f9e4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200f9e8: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200f9ec: c2 27 60 0c st %g1, [ %i5 + 0xc ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 200f9f0: 80 a0 e0 00 cmp %g3, 0 200f9f4: 32 80 00 06 bne,a 200fa0c <_RBTree_Extract_unprotected+0x120> 200f9f8: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200f9fc: 80 a7 20 00 cmp %i4, 0 200fa00: 32 80 00 02 bne,a 200fa08 <_RBTree_Extract_unprotected+0x11c> 200fa04: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 200fa08: c2 06 20 04 ld [ %i0 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE void _RBTree_Set_off_rbtree( RBTree_Node *node ) { node->parent = node->child[RBT_LEFT] = node->child[RBT_RIGHT] = NULL; 200fa0c: c0 26 60 08 clr [ %i1 + 8 ] 200fa10: c0 26 60 04 clr [ %i1 + 4 ] 200fa14: 80 a0 60 00 cmp %g1, 0 200fa18: 02 80 00 03 be 200fa24 <_RBTree_Extract_unprotected+0x138> 200fa1c: c0 26 40 00 clr [ %i1 ] 200fa20: c0 20 60 0c clr [ %g1 + 0xc ] 200fa24: 81 c7 e0 08 ret 200fa28: 81 e8 00 00 restore the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 200fa2c: 80 a0 60 00 cmp %g1, 0 200fa30: 22 80 00 28 be,a 200fad0 <_RBTree_Extract_unprotected+0x1e4> 200fa34: c2 06 40 00 ld [ %i1 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200fa38: fa 06 60 04 ld [ %i1 + 4 ], %i5 200fa3c: 80 a7 60 00 cmp %i5, 0 200fa40: 12 bf ff bb bne 200f92c <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN 200fa44: c2 26 20 0c st %g1, [ %i0 + 0xc ] * the_node's location in the tree. This may cause the coloring to be * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; 200fa48: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED if( leaf ) { 200fa4c: 80 a7 20 00 cmp %i4, 0 200fa50: 32 80 00 0c bne,a 200fa80 <_RBTree_Extract_unprotected+0x194> 200fa54: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); 200fa58: 7f ff fe e0 call 200f5d8 <_RBTree_Extract_validate_unprotected> 200fa5c: 90 10 00 19 mov %i1, %o0 } victim_color = the_node->color; /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200fa60: 10 80 00 0a b 200fa88 <_RBTree_Extract_unprotected+0x19c> 200fa64: c2 06 40 00 ld [ %i1 ], %g1 if (!the_node) return; /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) 200fa68: 80 a0 60 00 cmp %g1, 0 200fa6c: 22 80 00 14 be,a 200fabc <_RBTree_Extract_unprotected+0x1d0> 200fa70: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 200fa74: 10 bf ff a6 b 200f90c <_RBTree_Extract_unprotected+0x20> 200fa78: c2 26 20 08 st %g1, [ %i0 + 8 ] * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 200fa7c: c2 06 40 00 ld [ %i1 ], %g1 200fa80: c2 27 00 00 st %g1, [ %i4 ] _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200fa84: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; 200fa88: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200fa8c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200fa90: 84 18 80 19 xor %g2, %i1, %g2 200fa94: 80 a0 00 02 cmp %g0, %g2 200fa98: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200fa9c: 85 28 a0 02 sll %g2, 2, %g2 200faa0: 82 00 40 02 add %g1, %g2, %g1 200faa4: 10 bf ff d3 b 200f9f0 <_RBTree_Extract_unprotected+0x104> 200faa8: f8 20 60 04 st %i4, [ %g1 + 4 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 200faac: 7f ff fe cb call 200f5d8 <_RBTree_Extract_validate_unprotected> 200fab0: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200fab4: 10 bf ff af b 200f970 <_RBTree_Extract_unprotected+0x84> 200fab8: c4 07 40 00 ld [ %i5 ], %g2 if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200fabc: 80 a6 00 01 cmp %i0, %g1 200fac0: 12 bf ff 93 bne 200f90c <_RBTree_Extract_unprotected+0x20> 200fac4: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 200fac8: 10 bf ff 91 b 200f90c <_RBTree_Extract_unprotected+0x20> 200facc: c0 26 20 08 clr [ %i0 + 8 ] if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200fad0: 80 a6 00 01 cmp %i0, %g1 200fad4: 12 bf ff 92 bne 200f91c <_RBTree_Extract_unprotected+0x30> 200fad8: c2 26 20 0c st %g1, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 200fadc: 10 bf ff 90 b 200f91c <_RBTree_Extract_unprotected+0x30> 200fae0: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 0200f5d8 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 200f5d8: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200f5dc: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; 200f5e0: c4 00 40 00 ld [ %g1 ], %g2 200f5e4: 80 a0 a0 00 cmp %g2, 0 200f5e8: 02 80 00 bf be 200f8e4 <_RBTree_Extract_validate_unprotected+0x30c> 200f5ec: 01 00 00 00 nop { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200f5f0: c4 00 60 04 ld [ %g1 + 4 ], %g2 200f5f4: 80 a6 00 02 cmp %i0, %g2 200f5f8: 22 80 00 02 be,a 200f600 <_RBTree_Extract_validate_unprotected+0x28> 200f5fc: c4 00 60 08 ld [ %g1 + 8 ], %g2 } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 200f600: 98 10 20 01 mov 1, %o4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200f604: c6 06 20 0c ld [ %i0 + 0xc ], %g3 200f608: 80 a0 e0 01 cmp %g3, 1 200f60c: 22 80 00 58 be,a 200f76c <_RBTree_Extract_validate_unprotected+0x194> 200f610: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 200f614: c6 00 40 00 ld [ %g1 ], %g3 200f618: 80 a0 e0 00 cmp %g3, 0 200f61c: 02 80 00 53 be 200f768 <_RBTree_Extract_validate_unprotected+0x190> 200f620: 80 a0 a0 00 cmp %g2, 0 200f624: 22 80 00 07 be,a 200f640 <_RBTree_Extract_validate_unprotected+0x68><== NEVER TAKEN 200f628: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200f62c: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200f630: 80 a1 20 01 cmp %g4, 1 200f634: 22 80 00 28 be,a 200f6d4 <_RBTree_Extract_validate_unprotected+0xfc> 200f638: de 00 60 04 ld [ %g1 + 4 ], %o7 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 200f63c: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200f640: 80 a0 e0 00 cmp %g3, 0 200f644: 22 80 00 07 be,a 200f660 <_RBTree_Extract_validate_unprotected+0x88> 200f648: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200f64c: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200f650: 80 a0 e0 01 cmp %g3, 1 200f654: 22 80 00 4c be,a 200f784 <_RBTree_Extract_validate_unprotected+0x1ac> 200f658: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200f65c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200f660: 80 a0 e0 00 cmp %g3, 0 200f664: 22 80 00 07 be,a 200f680 <_RBTree_Extract_validate_unprotected+0xa8> 200f668: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 200f66c: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200f670: 80 a0 e0 01 cmp %g3, 1 200f674: 22 80 00 44 be,a 200f784 <_RBTree_Extract_validate_unprotected+0x1ac> 200f678: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200f67c: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 200f680: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200f684: 80 a0 a0 01 cmp %g2, 1 200f688: 22 80 00 38 be,a 200f768 <_RBTree_Extract_validate_unprotected+0x190> 200f68c: c0 20 60 0c clr [ %g1 + 0xc ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 200f690: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200f694: 80 a0 e0 00 cmp %g3, 0 200f698: 02 80 00 0a be 200f6c0 <_RBTree_Extract_validate_unprotected+0xe8><== NEVER TAKEN 200f69c: 84 10 20 00 clr %g2 if(!(the_node->parent->parent)) return NULL; 200f6a0: c8 00 c0 00 ld [ %g3 ], %g4 200f6a4: 80 a1 20 00 cmp %g4, 0 200f6a8: 02 80 00 07 be 200f6c4 <_RBTree_Extract_validate_unprotected+0xec> 200f6ac: b0 10 00 01 mov %g1, %i0 if(the_node == the_node->parent->child[RBT_LEFT]) 200f6b0: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200f6b4: 80 a0 40 02 cmp %g1, %g2 200f6b8: 22 80 00 05 be,a 200f6cc <_RBTree_Extract_validate_unprotected+0xf4> 200f6bc: c4 00 e0 08 ld [ %g3 + 8 ], %g2 c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; the_node->parent = c; 200f6c0: b0 10 00 01 mov %g1, %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200f6c4: 10 bf ff d0 b 200f604 <_RBTree_Extract_validate_unprotected+0x2c> 200f6c8: 82 10 00 03 mov %g3, %g1 200f6cc: 10 bf ff ce b 200f604 <_RBTree_Extract_validate_unprotected+0x2c> 200f6d0: 82 10 00 03 mov %g3, %g1 * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 200f6d4: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200f6d8: 9e 1b c0 18 xor %o7, %i0, %o7 200f6dc: 80 a0 00 0f cmp %g0, %o7 200f6e0: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200f6e4: 88 21 00 0d sub %g4, %o5, %g4 200f6e8: 89 29 20 02 sll %g4, 2, %g4 200f6ec: 88 00 40 04 add %g1, %g4, %g4 200f6f0: de 01 20 04 ld [ %g4 + 4 ], %o7 200f6f4: 80 a3 e0 00 cmp %o7, 0 200f6f8: 02 80 00 16 be 200f750 <_RBTree_Extract_validate_unprotected+0x178><== NEVER TAKEN 200f6fc: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200f700: 85 2b 60 02 sll %o5, 2, %g2 200f704: 96 03 c0 02 add %o7, %g2, %o3 200f708: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200f70c: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 200f710: c8 02 e0 04 ld [ %o3 + 4 ], %g4 200f714: 80 a1 20 00 cmp %g4, 0 200f718: 02 80 00 04 be 200f728 <_RBTree_Extract_validate_unprotected+0x150><== NEVER TAKEN 200f71c: 84 03 c0 02 add %o7, %g2, %g2 c->child[dir]->parent = the_node; 200f720: c2 21 00 00 st %g1, [ %g4 ] 200f724: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200f728: c2 20 a0 04 st %g1, [ %g2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f72c: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200f730: c6 23 c0 00 st %g3, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f734: 84 18 40 02 xor %g1, %g2, %g2 c->parent = the_node->parent; the_node->parent = c; 200f738: de 20 40 00 st %o7, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f73c: 80 a0 00 02 cmp %g0, %g2 200f740: 84 40 20 00 addx %g0, 0, %g2 200f744: 85 28 a0 02 sll %g2, 2, %g2 200f748: 86 00 c0 02 add %g3, %g2, %g3 200f74c: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 200f750: 80 a0 00 0d cmp %g0, %o5 200f754: 84 60 3f ff subx %g0, -1, %g2 200f758: 85 28 a0 02 sll %g2, 2, %g2 200f75c: 84 00 40 02 add %g1, %g2, %g2 200f760: 10 bf ff b7 b 200f63c <_RBTree_Extract_validate_unprotected+0x64> 200f764: c4 00 a0 04 ld [ %g2 + 4 ], %g2 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200f768: c2 06 00 00 ld [ %i0 ], %g1 200f76c: c2 00 40 00 ld [ %g1 ], %g1 200f770: 80 a0 60 00 cmp %g1, 0 200f774: 22 80 00 02 be,a 200f77c <_RBTree_Extract_validate_unprotected+0x1a4> 200f778: c0 26 20 0c clr [ %i0 + 0xc ] 200f77c: 81 c7 e0 08 ret 200f780: 81 e8 00 00 restore * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 200f784: 86 18 c0 18 xor %g3, %i0, %g3 200f788: 80 a0 00 03 cmp %g0, %g3 200f78c: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 200f790: 80 a0 00 03 cmp %g0, %g3 200f794: 9e 60 3f ff subx %g0, -1, %o7 200f798: 9f 2b e0 02 sll %o7, 2, %o7 200f79c: 88 00 80 0f add %g2, %o7, %g4 200f7a0: c8 01 20 04 ld [ %g4 + 4 ], %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200f7a4: 80 a1 20 00 cmp %g4, 0 200f7a8: 22 80 00 07 be,a 200f7c4 <_RBTree_Extract_validate_unprotected+0x1ec> 200f7ac: 89 28 e0 02 sll %g3, 2, %g4 200f7b0: da 01 20 0c ld [ %g4 + 0xc ], %o5 200f7b4: 80 a3 60 01 cmp %o5, 1 200f7b8: 22 80 00 28 be,a 200f858 <_RBTree_Extract_validate_unprotected+0x280> 200f7bc: de 00 60 0c ld [ %g1 + 0xc ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200f7c0: 89 28 e0 02 sll %g3, 2, %g4 200f7c4: 88 00 80 04 add %g2, %g4, %g4 200f7c8: d6 01 20 04 ld [ %g4 + 4 ], %o3 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 200f7cc: 88 10 20 01 mov 1, %g4 sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); 200f7d0: 98 18 e0 01 xor %g3, 1, %o4 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 200f7d4: c8 20 a0 0c st %g4, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200f7d8: 9a 21 00 0c sub %g4, %o4, %o5 200f7dc: 9b 2b 60 02 sll %o5, 2, %o5 200f7e0: 9a 00 80 0d add %g2, %o5, %o5 200f7e4: c8 03 60 04 ld [ %o5 + 4 ], %g4 200f7e8: 80 a1 20 00 cmp %g4, 0 200f7ec: 02 80 00 16 be 200f844 <_RBTree_Extract_validate_unprotected+0x26c><== NEVER TAKEN 200f7f0: c0 22 e0 0c clr [ %o3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200f7f4: 99 2b 20 02 sll %o4, 2, %o4 200f7f8: 96 01 00 0c add %g4, %o4, %o3 200f7fc: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200f800: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 200f804: da 02 e0 04 ld [ %o3 + 4 ], %o5 200f808: 80 a3 60 00 cmp %o5, 0 200f80c: 32 80 00 02 bne,a 200f814 <_RBTree_Extract_validate_unprotected+0x23c> 200f810: c4 23 40 00 st %g2, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f814: da 00 80 00 ld [ %g2 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200f818: 98 01 00 0c add %g4, %o4, %o4 200f81c: c4 23 20 04 st %g2, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f820: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 200f824: da 21 00 00 st %o5, [ %g4 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f828: 98 18 80 0c xor %g2, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 200f82c: c8 20 80 00 st %g4, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f830: 80 a0 00 0c cmp %g0, %o4 200f834: 84 40 20 00 addx %g0, 0, %g2 200f838: 85 28 a0 02 sll %g2, 2, %g2 200f83c: 9a 03 40 02 add %o5, %g2, %o5 200f840: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 200f844: 84 00 40 0f add %g1, %o7, %g2 200f848: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200f84c: 9e 00 80 0f add %g2, %o7, %o7 200f850: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 200f854: de 00 60 0c ld [ %g1 + 0xc ], %o7 200f858: de 20 a0 0c st %o7, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200f85c: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200f860: 9e 10 20 01 mov 1, %o7 200f864: 9e 23 c0 03 sub %o7, %g3, %o7 200f868: 9f 2b e0 02 sll %o7, 2, %o7 200f86c: 9e 00 40 0f add %g1, %o7, %o7 200f870: c4 03 e0 04 ld [ %o7 + 4 ], %g2 200f874: 80 a0 a0 00 cmp %g2, 0 200f878: 02 bf ff bc be 200f768 <_RBTree_Extract_validate_unprotected+0x190><== NEVER TAKEN 200f87c: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200f880: 87 28 e0 02 sll %g3, 2, %g3 200f884: 88 00 80 03 add %g2, %g3, %g4 200f888: da 01 20 04 ld [ %g4 + 4 ], %o5 200f88c: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 200f890: c8 01 20 04 ld [ %g4 + 4 ], %g4 200f894: 80 a1 20 00 cmp %g4, 0 200f898: 32 80 00 02 bne,a 200f8a0 <_RBTree_Extract_validate_unprotected+0x2c8> 200f89c: c2 21 00 00 st %g1, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f8a0: c8 00 40 00 ld [ %g1 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200f8a4: 86 00 80 03 add %g2, %g3, %g3 200f8a8: c2 20 e0 04 st %g1, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f8ac: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 200f8b0: c8 20 80 00 st %g4, [ %g2 ] the_node->parent = c; 200f8b4: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200f8b8: 86 18 40 03 xor %g1, %g3, %g3 200f8bc: 80 a0 00 03 cmp %g0, %g3 200f8c0: 82 40 20 00 addx %g0, 0, %g1 200f8c4: 83 28 60 02 sll %g1, 2, %g1 200f8c8: 88 01 00 01 add %g4, %g1, %g4 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200f8cc: c2 06 00 00 ld [ %i0 ], %g1 200f8d0: c4 21 20 04 st %g2, [ %g4 + 4 ] 200f8d4: c2 00 40 00 ld [ %g1 ], %g1 200f8d8: 80 a0 60 00 cmp %g1, 0 200f8dc: 22 bf ff a8 be,a 200f77c <_RBTree_Extract_validate_unprotected+0x1a4><== NEVER TAKEN 200f8e0: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 200f8e4: 81 c7 e0 08 ret 200f8e8: 81 e8 00 00 restore =============================================================================== 0200acd0 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200acd0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200acd4: 7f ff e3 e7 call 2003c70 200acd8: b8 10 00 18 mov %i0, %i4 200acdc: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 200ace0: f6 06 20 04 ld [ %i0 + 4 ], %i3 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200ace4: 80 a6 e0 00 cmp %i3, 0 200ace8: 02 80 00 15 be 200ad3c <_RBTree_Find+0x6c> <== NEVER TAKEN 200acec: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200acf0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200acf4: 92 10 00 1b mov %i3, %o1 200acf8: 9f c0 40 00 call %g1 200acfc: 90 10 00 19 mov %i1, %o0 if (compare_result == 0) { 200ad00: 80 a2 20 00 cmp %o0, 0 200ad04: 12 80 00 06 bne 200ad1c <_RBTree_Find+0x4c> 200ad08: 82 1a 20 01 xor %o0, 1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200ad0c: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200ad10: 80 a0 a0 00 cmp %g2, 0 200ad14: 12 80 00 0e bne 200ad4c <_RBTree_Find+0x7c> 200ad18: b0 10 00 1b mov %i3, %i0 break; } RBTree_Direction dir = (compare_result == 1); 200ad1c: 80 a0 00 01 cmp %g0, %g1 200ad20: 82 60 3f ff subx %g0, -1, %g1 iter_node = iter_node->child[dir]; 200ad24: 83 28 60 02 sll %g1, 2, %g1 200ad28: b6 06 c0 01 add %i3, %g1, %i3 200ad2c: f6 06 e0 04 ld [ %i3 + 4 ], %i3 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200ad30: 80 a6 e0 00 cmp %i3, 0 200ad34: 32 bf ff f0 bne,a 200acf4 <_RBTree_Find+0x24> 200ad38: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200ad3c: 7f ff e3 d1 call 2003c80 200ad40: 90 10 00 1d mov %i5, %o0 return return_node; } 200ad44: 81 c7 e0 08 ret 200ad48: 81 e8 00 00 restore RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200ad4c: 7f ff e3 cd call 2003c80 200ad50: 90 10 00 1d mov %i5, %o0 return return_node; } 200ad54: 81 c7 e0 08 ret 200ad58: 81 e8 00 00 restore =============================================================================== 0200b048 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200b048: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200b04c: 80 a6 20 00 cmp %i0, 0 200b050: 02 80 00 0f be 200b08c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200b054: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200b058: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200b05c: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200b060: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200b064: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200b068: f2 26 20 10 st %i1, [ %i0 + 0x10 ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200b06c: 02 80 00 08 be 200b08c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200b070: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert(the_rbtree, next); 200b074: 92 10 00 1a mov %i2, %o1 200b078: 7f ff ff ef call 200b034 <_RBTree_Insert> 200b07c: 90 10 00 18 mov %i0, %o0 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200b080: b6 86 ff ff addcc %i3, -1, %i3 200b084: 12 bf ff fc bne 200b074 <_RBTree_Initialize+0x2c> 200b088: b4 06 80 1c add %i2, %i4, %i2 200b08c: 81 c7 e0 08 ret 200b090: 81 e8 00 00 restore =============================================================================== 0200fb0c <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 200fb0c: 9d e3 bf a0 save %sp, -96, %sp /* if uncle is red, repaint uncle/parent black and grandparent red */ if(_RBTree_Is_red(u)) { the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; 200fb10: c2 06 00 00 ld [ %i0 ], %g1 } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200fb14: 96 10 20 01 mov 1, %o3 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200fb18: c4 00 40 00 ld [ %g1 ], %g2 200fb1c: 86 90 a0 00 orcc %g2, 0, %g3 200fb20: 22 80 00 06 be,a 200fb38 <_RBTree_Validate_insert_unprotected+0x2c> 200fb24: c0 26 20 0c clr [ %i0 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200fb28: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200fb2c: 80 a1 20 01 cmp %g4, 1 200fb30: 22 80 00 04 be,a 200fb40 <_RBTree_Validate_insert_unprotected+0x34> 200fb34: d8 00 80 00 ld [ %g2 ], %o4 200fb38: 81 c7 e0 08 ret 200fb3c: 81 e8 00 00 restore ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(!(the_node->parent->parent->parent)) return NULL; 200fb40: 80 a3 20 00 cmp %o4, 0 200fb44: 02 80 00 0c be 200fb74 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 200fb48: de 00 a0 04 ld [ %g2 + 4 ], %o7 { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200fb4c: 80 a3 c0 01 cmp %o7, %g1 200fb50: 02 80 00 5a be 200fcb8 <_RBTree_Validate_insert_unprotected+0x1ac> 200fb54: 88 10 00 0f mov %o7, %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200fb58: 80 a1 20 00 cmp %g4, 0 200fb5c: 22 80 00 07 be,a 200fb78 <_RBTree_Validate_insert_unprotected+0x6c> 200fb60: c8 00 60 04 ld [ %g1 + 4 ], %g4 200fb64: da 01 20 0c ld [ %g4 + 0xc ], %o5 200fb68: 80 a3 60 01 cmp %o5, 1 200fb6c: 22 80 00 4c be,a 200fc9c <_RBTree_Validate_insert_unprotected+0x190> 200fb70: c0 20 60 0c clr [ %g1 + 0xc ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200fb74: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 200fb78: 9e 1b c0 01 xor %o7, %g1, %o7 the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200fb7c: 88 19 00 18 xor %g4, %i0, %g4 200fb80: 80 a0 00 04 cmp %g0, %g4 200fb84: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200fb88: 80 a0 00 0f cmp %g0, %o7 200fb8c: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200fb90: 80 a3 40 04 cmp %o5, %g4 200fb94: 02 80 00 47 be 200fcb0 <_RBTree_Validate_insert_unprotected+0x1a4> 200fb98: 98 22 c0 0d sub %o3, %o5, %o4 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200fb9c: 98 22 c0 04 sub %o3, %g4, %o4 200fba0: 9b 2b 20 02 sll %o4, 2, %o5 200fba4: 9a 00 40 0d add %g1, %o5, %o5 200fba8: de 03 60 04 ld [ %o5 + 4 ], %o7 200fbac: 80 a3 e0 00 cmp %o7, 0 200fbb0: 02 80 00 16 be 200fc08 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 200fbb4: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200fbb8: 94 03 c0 04 add %o7, %g4, %o2 200fbbc: d2 02 a0 04 ld [ %o2 + 4 ], %o1 200fbc0: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 200fbc4: da 02 a0 04 ld [ %o2 + 4 ], %o5 200fbc8: 80 a3 60 00 cmp %o5, 0 200fbcc: 22 80 00 05 be,a 200fbe0 <_RBTree_Validate_insert_unprotected+0xd4> 200fbd0: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 200fbd4: c2 23 40 00 st %g1, [ %o5 ] 200fbd8: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200fbdc: 9a 03 c0 04 add %o7, %g4, %o5 200fbe0: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fbe4: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 200fbe8: c4 23 c0 00 st %g2, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fbec: 9a 1b 40 01 xor %o5, %g1, %o5 c->parent = the_node->parent; the_node->parent = c; 200fbf0: de 20 40 00 st %o7, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fbf4: 80 a0 00 0d cmp %g0, %o5 200fbf8: 82 40 20 00 addx %g0, 0, %g1 200fbfc: 83 28 60 02 sll %g1, 2, %g1 200fc00: 84 00 80 01 add %g2, %g1, %g2 200fc04: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200fc08: b0 06 00 04 add %i0, %g4, %i0 200fc0c: f0 06 20 04 ld [ %i0 + 4 ], %i0 200fc10: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 200fc14: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200fc18: 88 00 c0 04 add %g3, %g4, %g4 200fc1c: c4 01 20 04 ld [ %g4 + 4 ], %g2 200fc20: 80 a0 a0 00 cmp %g2, 0 200fc24: 02 bf ff bd be 200fb18 <_RBTree_Validate_insert_unprotected+0xc><== NEVER TAKEN 200fc28: d6 20 e0 0c st %o3, [ %g3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200fc2c: 99 2b 20 02 sll %o4, 2, %o4 200fc30: 82 00 80 0c add %g2, %o4, %g1 200fc34: de 00 60 04 ld [ %g1 + 4 ], %o7 200fc38: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 200fc3c: c2 00 60 04 ld [ %g1 + 4 ], %g1 200fc40: 80 a0 60 00 cmp %g1, 0 200fc44: 32 80 00 02 bne,a 200fc4c <_RBTree_Validate_insert_unprotected+0x140> 200fc48: c6 20 40 00 st %g3, [ %g1 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fc4c: c8 00 c0 00 ld [ %g3 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200fc50: 98 00 80 0c add %g2, %o4, %o4 the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; 200fc54: c8 20 80 00 st %g4, [ %g2 ] the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200fc58: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fc5c: de 01 20 04 ld [ %g4 + 4 ], %o7 c->parent = the_node->parent; the_node->parent = c; 200fc60: c4 20 c0 00 st %g2, [ %g3 ] 200fc64: c2 06 00 00 ld [ %i0 ], %g1 if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200fc68: 86 1b c0 03 xor %o7, %g3, %g3 200fc6c: 80 a0 00 03 cmp %g0, %g3 200fc70: 86 40 20 00 addx %g0, 0, %g3 200fc74: 87 28 e0 02 sll %g3, 2, %g3 200fc78: 88 01 00 03 add %g4, %g3, %g4 200fc7c: c4 21 20 04 st %g2, [ %g4 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200fc80: c4 00 40 00 ld [ %g1 ], %g2 200fc84: 86 90 a0 00 orcc %g2, 0, %g3 200fc88: 32 bf ff a9 bne,a 200fb2c <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 200fc8c: c8 00 60 0c ld [ %g1 + 0xc ], %g4 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200fc90: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 200fc94: 81 c7 e0 08 ret <== NOT EXECUTED 200fc98: 81 e8 00 00 restore <== NOT EXECUTED g = the_node->parent->parent; /* if uncle is red, repaint uncle/parent black and grandparent red */ if(_RBTree_Is_red(u)) { the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; 200fc9c: c0 21 20 0c clr [ %g4 + 0xc ] g->color = RBT_RED; 200fca0: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200fca4: 82 10 00 0c mov %o4, %g1 200fca8: 10 bf ff 9c b 200fb18 <_RBTree_Validate_insert_unprotected+0xc> 200fcac: b0 10 00 02 mov %g2, %i0 200fcb0: 10 bf ff d9 b 200fc14 <_RBTree_Validate_insert_unprotected+0x108> 200fcb4: 89 2b 60 02 sll %o5, 2, %g4 if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 200fcb8: 10 bf ff a8 b 200fb58 <_RBTree_Validate_insert_unprotected+0x4c> 200fcbc: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 02007698 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2007698: 9d e3 bf 98 save %sp, -104, %sp rtems_initialization_tasks_table *user_tasks; /* * Move information into local variables */ user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table; 200769c: 03 00 80 79 sethi %hi(0x201e400), %g1 20076a0: 82 10 63 a8 or %g1, 0x3a8, %g1 ! 201e7a8 20076a4: fa 00 60 2c ld [ %g1 + 0x2c ], %i5 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 20076a8: 80 a7 60 00 cmp %i5, 0 20076ac: 02 80 00 18 be 200770c <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 20076b0: f6 00 60 28 ld [ %g1 + 0x28 ], %i3 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 20076b4: 80 a6 e0 00 cmp %i3, 0 20076b8: 02 80 00 15 be 200770c <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 20076bc: b8 10 20 00 clr %i4 return_value = rtems_task_create( 20076c0: d4 07 60 04 ld [ %i5 + 4 ], %o2 20076c4: d0 07 40 00 ld [ %i5 ], %o0 20076c8: d2 07 60 08 ld [ %i5 + 8 ], %o1 20076cc: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 20076d0: d8 07 60 0c ld [ %i5 + 0xc ], %o4 20076d4: 7f ff ff 70 call 2007494 20076d8: 9a 07 bf fc add %fp, -4, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 20076dc: 94 92 20 00 orcc %o0, 0, %o2 20076e0: 12 80 00 0d bne 2007714 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 20076e4: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 20076e8: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 20076ec: 40 00 00 0e call 2007724 20076f0: d2 07 60 10 ld [ %i5 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 20076f4: 94 92 20 00 orcc %o0, 0, %o2 20076f8: 12 80 00 07 bne 2007714 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 20076fc: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2007700: 80 a7 00 1b cmp %i4, %i3 2007704: 12 bf ff ef bne 20076c0 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2007708: ba 07 60 1c add %i5, 0x1c, %i5 200770c: 81 c7 e0 08 ret 2007710: 81 e8 00 00 restore id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); 2007714: 90 10 20 01 mov 1, %o0 2007718: 40 00 04 3d call 200880c <_Internal_error_Occurred> 200771c: 92 10 20 01 mov 1, %o1 =============================================================================== 0200e0f8 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200e0f8: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200e0fc: 80 a0 60 00 cmp %g1, 0 200e100: 22 80 00 0c be,a 200e130 <_RTEMS_tasks_Switch_extension+0x38> 200e104: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200e108: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200e10c: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200e110: c8 00 80 00 ld [ %g2 ], %g4 200e114: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200e118: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200e11c: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200e120: 80 a0 60 00 cmp %g1, 0 200e124: 32 bf ff fa bne,a 200e10c <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200e128: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED tvp->tval = *tvp->ptr; *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; 200e12c: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200e130: 80 a0 60 00 cmp %g1, 0 200e134: 02 80 00 0b be 200e160 <_RTEMS_tasks_Switch_extension+0x68> 200e138: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200e13c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200e140: c6 00 60 0c ld [ %g1 + 0xc ], %g3 tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { tvp->gval = *tvp->ptr; 200e144: c8 00 80 00 ld [ %g2 ], %g4 200e148: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200e14c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200e150: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200e154: 80 a0 60 00 cmp %g1, 0 200e158: 32 bf ff fa bne,a 200e140 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200e15c: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200e160: 81 c3 e0 08 retl =============================================================================== 02007d6c <_Rate_monotonic_Get_status>: bool _Rate_monotonic_Get_status( Rate_monotonic_Control *the_period, Rate_monotonic_Period_time_t *wall_since_last_period, Thread_CPU_usage_t *cpu_since_last_period ) { 2007d6c: 9d e3 bf 98 save %sp, -104, %sp #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2007d70: fa 06 20 40 ld [ %i0 + 0x40 ], %i5 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2007d74: 40 00 07 43 call 2009a80 <_TOD_Get_uptime> 2007d78: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2007d7c: d8 1e 20 50 ldd [ %i0 + 0x50 ], %o4 _Timestamp_Subtract( 2007d80: c4 1f bf f8 ldd [ %fp + -8 ], %g2 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2007d84: 03 00 80 86 sethi %hi(0x2021800), %g1 2007d88: 82 10 62 80 or %g1, 0x280, %g1 ! 2021a80 <_Per_CPU_Information> 2007d8c: c8 00 60 0c ld [ %g1 + 0xc ], %g4 2007d90: 9a a0 c0 0d subcc %g3, %o5, %o5 2007d94: 98 60 80 0c subx %g2, %o4, %o4 2007d98: d8 3e 40 00 std %o4, [ %i1 ] 2007d9c: 80 a1 00 1d cmp %g4, %i5 #endif /* * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; 2007da0: d8 1f 60 80 ldd [ %i5 + 0x80 ], %o4 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2007da4: 02 80 00 05 be 2007db8 <_Rate_monotonic_Get_status+0x4c> 2007da8: b2 10 20 01 mov 1, %i1 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 2007dac: b0 0e 60 01 and %i1, 1, %i0 2007db0: 81 c7 e0 08 ret 2007db4: 81 e8 00 00 restore 2007db8: d4 18 60 20 ldd [ %g1 + 0x20 ], %o2 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007dbc: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 2007dc0: 86 a0 c0 0b subcc %g3, %o3, %g3 2007dc4: 84 60 80 0a subx %g2, %o2, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2007dc8: 86 83 40 03 addcc %o5, %g3, %g3 2007dcc: 84 43 00 02 addx %o4, %g2, %g2 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2007dd0: 80 a6 00 02 cmp %i0, %g2 2007dd4: 34 bf ff f6 bg,a 2007dac <_Rate_monotonic_Get_status+0x40><== NEVER TAKEN 2007dd8: b2 10 20 00 clr %i1 <== NOT EXECUTED 2007ddc: 02 80 00 09 be 2007e00 <_Rate_monotonic_Get_status+0x94> <== ALWAYS TAKEN 2007de0: 80 a6 40 03 cmp %i1, %g3 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2007de4: 86 a0 c0 19 subcc %g3, %i1, %g3 <== NOT EXECUTED if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2007de8: b2 10 20 01 mov 1, %i1 2007dec: 84 60 80 18 subx %g2, %i0, %g2 } 2007df0: b0 0e 60 01 and %i1, 1, %i0 2007df4: c4 3e 80 00 std %g2, [ %i2 ] 2007df8: 81 c7 e0 08 ret 2007dfc: 81 e8 00 00 restore /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2007e00: 28 bf ff fa bleu,a 2007de8 <_Rate_monotonic_Get_status+0x7c> 2007e04: 86 a0 c0 19 subcc %g3, %i1, %g3 return false; 2007e08: 10 bf ff e9 b 2007dac <_Rate_monotonic_Get_status+0x40> 2007e0c: b2 10 20 00 clr %i1 =============================================================================== 02008560 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2008560: 9d e3 bf 98 save %sp, -104, %sp 2008564: 11 00 80 84 sethi %hi(0x2021000), %o0 2008568: 92 10 00 18 mov %i0, %o1 200856c: 90 12 23 d4 or %o0, 0x3d4, %o0 2008570: 40 00 08 6c call 200a720 <_Objects_Get> 2008574: 94 07 bf fc add %fp, -4, %o2 /* * When we get here, the Timer is already off the chain so we do not * have to worry about that -- hence no _Watchdog_Remove(). */ the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 2008578: c2 07 bf fc ld [ %fp + -4 ], %g1 200857c: 80 a0 60 00 cmp %g1, 0 2008580: 12 80 00 17 bne 20085dc <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2008584: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2008588: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 200858c: 03 00 00 10 sethi %hi(0x4000), %g1 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_period ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_PERIOD); 2008590: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2008594: 80 88 80 01 btst %g2, %g1 2008598: 22 80 00 08 be,a 20085b8 <_Rate_monotonic_Timeout+0x58> 200859c: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20085a0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 20085a4: c2 07 60 08 ld [ %i5 + 8 ], %g1 20085a8: 80 a0 80 01 cmp %g2, %g1 20085ac: 02 80 00 1a be 2008614 <_Rate_monotonic_Timeout+0xb4> 20085b0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 20085b4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20085b8: 80 a0 60 01 cmp %g1, 1 20085bc: 02 80 00 0a be 20085e4 <_Rate_monotonic_Timeout+0x84> 20085c0: 82 10 20 04 mov 4, %g1 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 20085c4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 20085c8: 03 00 80 85 sethi %hi(0x2021400), %g1 20085cc: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2021540 <_Thread_Dispatch_disable_level> 20085d0: 84 00 bf ff add %g2, -1, %g2 20085d4: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 20085d8: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 20085dc: 81 c7 e0 08 ret 20085e0: 81 e8 00 00 restore _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 20085e4: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 20085e8: 90 10 00 1d mov %i5, %o0 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 20085ec: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 20085f0: 7f ff fe 08 call 2007e10 <_Rate_monotonic_Initiate_statistics> 20085f4: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20085f8: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20085fc: 11 00 80 85 sethi %hi(0x2021400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2008600: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2008604: 90 12 22 00 or %o0, 0x200, %o0 2008608: 40 00 10 28 call 200c6a8 <_Watchdog_Insert> 200860c: 92 07 60 10 add %i5, 0x10, %o1 2008610: 30 bf ff ee b,a 20085c8 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2008614: 40 00 0b 5f call 200b390 <_Thread_Clear_state> 2008618: 92 12 63 f8 or %o1, 0x3f8, %o1 the_thread = the_period->owner; if ( _States_Is_waiting_for_period( the_thread->current_state ) && the_thread->Wait.id == the_period->Object.id ) { _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 200861c: 10 bf ff f5 b 20085f0 <_Rate_monotonic_Timeout+0x90> 2008620: 90 10 00 1d mov %i5, %o0 =============================================================================== 02007e94 <_Rate_monotonic_Update_statistics>: void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 2007e94: 9d e3 bf 98 save %sp, -104, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2007e98: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2007e9c: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2007ea0: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2007ea4: 80 a0 60 04 cmp %g1, 4 2007ea8: 02 80 00 4b be 2007fd4 <_Rate_monotonic_Update_statistics+0x140> 2007eac: c4 26 20 58 st %g2, [ %i0 + 0x58 ] ) { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2007eb0: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2007eb4: 40 00 06 f3 call 2009a80 <_TOD_Get_uptime> 2007eb8: 90 07 bf f8 add %fp, -8, %o0 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2007ebc: 03 00 80 86 sethi %hi(0x2021800), %g1 2007ec0: 82 10 62 80 or %g1, 0x280, %g1 ! 2021a80 <_Per_CPU_Information> 2007ec4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007ec8: d0 1e 20 50 ldd [ %i0 + 0x50 ], %o0 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2007ecc: d4 1f bf f8 ldd [ %fp + -8 ], %o2 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2007ed0: 80 a6 c0 02 cmp %i3, %g2 2007ed4: 02 80 00 4e be 200800c <_Rate_monotonic_Update_statistics+0x178><== ALWAYS TAKEN 2007ed8: d8 1e e0 80 ldd [ %i3 + 0x80 ], %o4 2007edc: c4 1e 20 70 ldd [ %i0 + 0x70 ], %g2 * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 2007ee0: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2007ee4: 86 80 c0 1d addcc %g3, %i5, %g3 2007ee8: 84 40 80 1c addx %g2, %i4, %g2 2007eec: 80 a0 40 1c cmp %g1, %i4 2007ef0: 04 80 00 1d ble 2007f64 <_Rate_monotonic_Update_statistics+0xd0> 2007ef4: c4 3e 20 70 std %g2, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 2007ef8: f8 3e 20 60 std %i4, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2007efc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 2007f00: 80 a0 40 1c cmp %g1, %i4 2007f04: 26 80 00 05 bl,a 2007f18 <_Rate_monotonic_Update_statistics+0x84><== NEVER TAKEN 2007f08: f8 3e 20 68 std %i4, [ %i0 + 0x68 ] <== NOT EXECUTED 2007f0c: 80 a0 40 1c cmp %g1, %i4 2007f10: 22 80 00 2c be,a 2007fc0 <_Rate_monotonic_Update_statistics+0x12c><== ALWAYS TAKEN 2007f14: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 2007f18: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2007f1c: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2007f20: 86 a2 c0 09 subcc %o3, %o1, %g3 2007f24: 84 62 80 08 subx %o2, %o0, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2007f28: ba 87 40 03 addcc %i5, %g3, %i5 2007f2c: b8 47 00 02 addx %i4, %g2, %i4 2007f30: 80 a0 40 02 cmp %g1, %g2 2007f34: 14 80 00 1e bg 2007fac <_Rate_monotonic_Update_statistics+0x118> 2007f38: f8 3e 20 88 std %i4, [ %i0 + 0x88 ] 2007f3c: 80 a0 40 02 cmp %g1, %g2 2007f40: 22 80 00 18 be,a 2007fa0 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 2007f44: c2 06 20 7c ld [ %i0 + 0x7c ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2007f48: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2007f4c: 80 a0 40 02 cmp %g1, %g2 2007f50: 16 80 00 0d bge 2007f84 <_Rate_monotonic_Update_statistics+0xf0><== ALWAYS TAKEN 2007f54: 01 00 00 00 nop stats->max_wall_time = since_last_period; 2007f58: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 2007f5c: 81 c7 e0 08 ret 2007f60: 81 e8 00 00 restore * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 2007f64: 32 bf ff e7 bne,a 2007f00 <_Rate_monotonic_Update_statistics+0x6c><== NEVER TAKEN 2007f68: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 2007f6c: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 2007f70: 80 a0 40 1d cmp %g1, %i5 2007f74: 28 bf ff e3 bleu,a 2007f00 <_Rate_monotonic_Update_statistics+0x6c> 2007f78: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 2007f7c: 10 bf ff e0 b 2007efc <_Rate_monotonic_Update_statistics+0x68> 2007f80: f8 3e 20 60 std %i4, [ %i0 + 0x60 ] _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2007f84: 12 bf ff f6 bne 2007f5c <_Rate_monotonic_Update_statistics+0xc8><== NEVER TAKEN 2007f88: 01 00 00 00 nop 2007f8c: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2007f90: 80 a0 40 03 cmp %g1, %g3 2007f94: 2a bf ff f2 bcs,a 2007f5c <_Rate_monotonic_Update_statistics+0xc8> 2007f98: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 2007f9c: 30 bf ff f0 b,a 2007f5c <_Rate_monotonic_Update_statistics+0xc8> * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2007fa0: 80 a0 40 03 cmp %g1, %g3 2007fa4: 28 bf ff ea bleu,a 2007f4c <_Rate_monotonic_Update_statistics+0xb8> 2007fa8: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2007fac: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2007fb0: 80 a0 40 02 cmp %g1, %g2 2007fb4: 06 bf ff e9 bl 2007f58 <_Rate_monotonic_Update_statistics+0xc4><== NEVER TAKEN 2007fb8: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 2007fbc: 30 bf ff f2 b,a 2007f84 <_Rate_monotonic_Update_statistics+0xf0> _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) stats->min_cpu_time = executed; if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2007fc0: 80 a0 40 1d cmp %g1, %i5 2007fc4: 3a bf ff d6 bcc,a 2007f1c <_Rate_monotonic_Update_statistics+0x88> 2007fc8: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 stats->max_cpu_time = executed; 2007fcc: 10 bf ff d3 b 2007f18 <_Rate_monotonic_Update_statistics+0x84> 2007fd0: f8 3e 20 68 std %i4, [ %i0 + 0x68 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2007fd4: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 ) { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2007fd8: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2007fdc: 82 00 60 01 inc %g1 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2007fe0: 90 07 bf f8 add %fp, -8, %o0 2007fe4: 40 00 06 a7 call 2009a80 <_TOD_Get_uptime> 2007fe8: c2 26 20 5c st %g1, [ %i0 + 0x5c ] * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2007fec: 03 00 80 86 sethi %hi(0x2021800), %g1 2007ff0: 82 10 62 80 or %g1, 0x280, %g1 ! 2021a80 <_Per_CPU_Information> 2007ff4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007ff8: d0 1e 20 50 ldd [ %i0 + 0x50 ], %o0 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2007ffc: d4 1f bf f8 ldd [ %fp + -8 ], %o2 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2008000: 80 a6 c0 02 cmp %i3, %g2 2008004: 12 bf ff b6 bne 2007edc <_Rate_monotonic_Update_statistics+0x48><== NEVER TAKEN 2008008: d8 1e e0 80 ldd [ %i3 + 0x80 ], %o4 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200800c: c4 18 60 20 ldd [ %g1 + 0x20 ], %g2 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2008010: f8 1e 20 48 ldd [ %i0 + 0x48 ], %i4 2008014: 86 a2 c0 03 subcc %o3, %g3, %g3 2008018: 84 62 80 02 subx %o2, %g2, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200801c: 86 83 40 03 addcc %o5, %g3, %g3 2008020: 84 43 00 02 addx %o4, %g2, %g2 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2008024: 80 a7 00 02 cmp %i4, %g2 2008028: 14 bf ff cd bg 2007f5c <_Rate_monotonic_Update_statistics+0xc8><== NEVER TAKEN 200802c: 01 00 00 00 nop 2008030: 02 80 00 05 be 2008044 <_Rate_monotonic_Update_statistics+0x1b0> 2008034: 80 a7 40 03 cmp %i5, %g3 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2008038: ba a0 c0 1d subcc %g3, %i5, %i5 200803c: 10 bf ff a8 b 2007edc <_Rate_monotonic_Update_statistics+0x48> 2008040: b8 60 80 1c subx %g2, %i4, %i4 2008044: 18 bf ff c6 bgu 2007f5c <_Rate_monotonic_Update_statistics+0xc8> 2008048: ba a0 c0 1d subcc %g3, %i5, %i5 200804c: 10 bf ff a4 b 2007edc <_Rate_monotonic_Update_statistics+0x48> 2008050: b8 60 80 1c subx %g2, %i4, %i4 =============================================================================== 0200b1d8 <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200b1d8: 9d e3 bf 98 save %sp, -104, %sp Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server_id server_id; /* Put violating task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200b1dc: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200b1e0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b1e4: 80 a0 40 09 cmp %g1, %o1 200b1e8: 32 80 00 02 bne,a 200b1f0 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200b1ec: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200b1f0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200b1f4: 80 a0 40 09 cmp %g1, %o1 200b1f8: 02 80 00 04 be 200b208 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200b1fc: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200b200: 40 00 01 a0 call 200b880 <_Thread_Change_priority> 200b204: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200b208: f0 06 20 88 ld [ %i0 + 0x88 ], %i0 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200b20c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b210: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200b214: 80 a0 a0 00 cmp %g2, 0 200b218: 02 80 00 09 be 200b23c <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200b21c: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200b220: d0 00 40 00 ld [ %g1 ], %o0 200b224: 7f ff ff d1 call 200b168 <_Scheduler_CBS_Get_server_id> 200b228: 92 07 bf fc add %fp, -4, %o1 sched_info->cbs_server->task_id, &server_id ); sched_info->cbs_server->cbs_budget_overrun( server_id ); 200b22c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b230: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200b234: 9f c0 40 00 call %g1 200b238: d0 07 bf fc ld [ %fp + -4 ], %o0 200b23c: 81 c7 e0 08 ret 200b240: 81 e8 00 00 restore =============================================================================== 0200ad40 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200ad40: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200ad44: 39 00 80 88 sethi %hi(0x2022000), %i4 200ad48: c2 07 20 64 ld [ %i4 + 0x64 ], %g1 ! 2022064 <_Scheduler_CBS_Maximum_servers> 200ad4c: 80 a0 60 00 cmp %g1, 0 200ad50: 02 80 00 18 be 200adb0 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200ad54: 03 00 80 8c sethi %hi(0x2023000), %g1 200ad58: 37 00 80 8c sethi %hi(0x2023000), %i3 200ad5c: c4 06 e2 b8 ld [ %i3 + 0x2b8 ], %g2 ! 20232b8 <_Scheduler_CBS_Server_list> 200ad60: ba 10 20 00 clr %i5 200ad64: b8 17 20 64 or %i4, 0x64, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200ad68: 83 2f 60 02 sll %i5, 2, %g1 200ad6c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200ad70: 80 a0 60 00 cmp %g1, 0 200ad74: 02 80 00 05 be 200ad88 <_Scheduler_CBS_Cleanup+0x48> 200ad78: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200ad7c: 40 00 00 45 call 200ae90 <_Scheduler_CBS_Destroy_server> 200ad80: 01 00 00 00 nop 200ad84: c4 06 e2 b8 ld [ %i3 + 0x2b8 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200ad88: c2 07 00 00 ld [ %i4 ], %g1 200ad8c: ba 07 60 01 inc %i5 200ad90: 80 a0 40 1d cmp %g1, %i5 200ad94: 18 bf ff f6 bgu 200ad6c <_Scheduler_CBS_Cleanup+0x2c> 200ad98: 83 2f 60 02 sll %i5, 2, %g1 if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); return SCHEDULER_CBS_OK; } 200ad9c: b0 10 20 00 clr %i0 for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); 200ada0: 40 00 08 73 call 200cf6c <_Workspace_Free> 200ada4: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200ada8: 81 c7 e0 08 ret 200adac: 81 e8 00 00 restore int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200adb0: 10 bf ff fb b 200ad9c <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200adb4: c4 00 62 b8 ld [ %g1 + 0x2b8 ], %g2 <== NOT EXECUTED =============================================================================== 0200adb8 <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200adb8: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200adbc: c2 06 20 04 ld [ %i0 + 4 ], %g1 int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200adc0: ba 10 00 18 mov %i0, %i5 unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200adc4: 80 a0 60 00 cmp %g1, 0 200adc8: 04 80 00 30 ble 200ae88 <_Scheduler_CBS_Create_server+0xd0> 200adcc: b0 10 3f ee mov -18, %i0 200add0: c2 07 40 00 ld [ %i5 ], %g1 200add4: 80 a0 60 00 cmp %g1, 0 200add8: 04 80 00 2c ble 200ae88 <_Scheduler_CBS_Create_server+0xd0> 200addc: 03 00 80 88 sethi %hi(0x2022000), %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200ade0: c6 00 60 64 ld [ %g1 + 0x64 ], %g3 ! 2022064 <_Scheduler_CBS_Maximum_servers> 200ade4: 80 a0 e0 00 cmp %g3, 0 200ade8: 02 80 00 28 be 200ae88 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN 200adec: b0 10 3f e6 mov -26, %i0 if ( !_Scheduler_CBS_Server_list[i] ) 200adf0: 37 00 80 8c sethi %hi(0x2023000), %i3 200adf4: f8 06 e2 b8 ld [ %i3 + 0x2b8 ], %i4 ! 20232b8 <_Scheduler_CBS_Server_list> 200adf8: c2 07 00 00 ld [ %i4 ], %g1 200adfc: 80 a0 60 00 cmp %g1, 0 200ae00: 02 80 00 0e be 200ae38 <_Scheduler_CBS_Create_server+0x80> 200ae04: 82 10 20 00 clr %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200ae08: 10 80 00 07 b 200ae24 <_Scheduler_CBS_Create_server+0x6c> 200ae0c: 82 00 60 01 inc %g1 if ( !_Scheduler_CBS_Server_list[i] ) 200ae10: c4 07 00 18 ld [ %i4 + %i0 ], %g2 200ae14: 80 a0 a0 00 cmp %g2, 0 200ae18: 22 80 00 0a be,a 200ae40 <_Scheduler_CBS_Create_server+0x88> 200ae1c: c2 26 80 00 st %g1, [ %i2 ] params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200ae20: 82 00 60 01 inc %g1 200ae24: 80 a0 40 03 cmp %g1, %g3 200ae28: 12 bf ff fa bne 200ae10 <_Scheduler_CBS_Create_server+0x58> 200ae2c: b1 28 60 02 sll %g1, 2, %i0 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 200ae30: 81 c7 e0 08 ret 200ae34: 91 e8 3f e6 restore %g0, -26, %o0 params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( !_Scheduler_CBS_Server_list[i] ) 200ae38: b0 10 20 00 clr %i0 } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; 200ae3c: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200ae40: 40 00 08 43 call 200cf4c <_Workspace_Allocate> 200ae44: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200ae48: c2 06 80 00 ld [ %i2 ], %g1 if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 200ae4c: d0 27 00 18 st %o0, [ %i4 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200ae50: c4 06 e2 b8 ld [ %i3 + 0x2b8 ], %g2 200ae54: 83 28 60 02 sll %g1, 2, %g1 200ae58: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200ae5c: 80 a0 60 00 cmp %g1, 0 200ae60: 02 80 00 0a be 200ae88 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN 200ae64: b0 10 3f ef mov -17, %i0 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200ae68: c4 07 40 00 ld [ %i5 ], %g2 the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; 200ae6c: b0 10 20 00 clr %i0 _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200ae70: c4 20 60 04 st %g2, [ %g1 + 4 ] 200ae74: c4 07 60 04 ld [ %i5 + 4 ], %g2 the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200ae78: f2 20 60 0c st %i1, [ %g1 + 0xc ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200ae7c: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; 200ae80: 84 10 3f ff mov -1, %g2 200ae84: c4 20 40 00 st %g2, [ %g1 ] the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; } 200ae88: 81 c7 e0 08 ret 200ae8c: 81 e8 00 00 restore =============================================================================== 0200af00 <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200af00: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Thread_Control *the_thread; Scheduler_CBS_Per_thread *sched_info; the_thread = _Thread_Get(task_id, &location); 200af04: 92 07 bf fc add %fp, -4, %o1 200af08: 40 00 03 a8 call 200bda8 <_Thread_Get> 200af0c: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200af10: ba 92 20 00 orcc %o0, 0, %i5 200af14: 22 80 00 05 be,a 200af28 <_Scheduler_CBS_Detach_thread+0x28> 200af18: 03 00 80 88 sethi %hi(0x2022000), %g1 _Thread_Enable_dispatch(); 200af1c: 40 00 03 96 call 200bd74 <_Thread_Enable_dispatch> 200af20: 01 00 00 00 nop } if ( server_id < 0 || server_id >= _Scheduler_CBS_Maximum_servers ) 200af24: 03 00 80 88 sethi %hi(0x2022000), %g1 200af28: c4 00 60 64 ld [ %g1 + 0x64 ], %g2 ! 2022064 <_Scheduler_CBS_Maximum_servers> 200af2c: 80 a0 80 18 cmp %g2, %i0 200af30: 08 80 00 1b bleu 200af9c <_Scheduler_CBS_Detach_thread+0x9c> 200af34: 82 10 3f ee mov -18, %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) 200af38: 80 a7 60 00 cmp %i5, 0 200af3c: 02 80 00 18 be 200af9c <_Scheduler_CBS_Detach_thread+0x9c> 200af40: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 200af44: 03 00 80 8c sethi %hi(0x2023000), %g1 200af48: c2 00 62 b8 ld [ %g1 + 0x2b8 ], %g1 ! 20232b8 <_Scheduler_CBS_Server_list> 200af4c: b1 2e 20 02 sll %i0, 2, %i0 200af50: c4 00 40 18 ld [ %g1 + %i0 ], %g2 200af54: 80 a0 a0 00 cmp %g2, 0 200af58: 02 80 00 11 be 200af9c <_Scheduler_CBS_Detach_thread+0x9c> 200af5c: 82 10 3f e7 mov -25, %g1 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 200af60: c6 00 80 00 ld [ %g2 ], %g3 200af64: 80 a0 c0 19 cmp %g3, %i1 200af68: 12 80 00 0d bne 200af9c <_Scheduler_CBS_Detach_thread+0x9c><== NEVER TAKEN 200af6c: 82 10 3f ee mov -18, %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200af70: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 200af74: 82 10 3f ff mov -1, %g1 sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200af78: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 200af7c: c2 20 80 00 st %g1, [ %g2 ] sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; 200af80: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; 200af84: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200af88: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; 200af8c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200af90: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200af94: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; 200af98: 82 10 20 00 clr %g1 } 200af9c: 81 c7 e0 08 ret 200afa0: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200b168 <_Scheduler_CBS_Get_server_id>: int _Scheduler_CBS_Get_server_id ( rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { 200b168: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b16c: 03 00 80 88 sethi %hi(0x2022000), %g1 200b170: c2 00 60 64 ld [ %g1 + 0x64 ], %g1 ! 2022064 <_Scheduler_CBS_Maximum_servers> int _Scheduler_CBS_Get_server_id ( rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { 200b174: 84 10 00 18 mov %i0, %g2 unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b178: 80 a0 60 00 cmp %g1, 0 200b17c: 02 80 00 13 be 200b1c8 <_Scheduler_CBS_Get_server_id+0x60><== NEVER TAKEN 200b180: b0 10 3f e7 mov -25, %i0 200b184: 07 00 80 8c sethi %hi(0x2023000), %g3 200b188: de 00 e2 b8 ld [ %g3 + 0x2b8 ], %o7 ! 20232b8 <_Scheduler_CBS_Server_list> 200b18c: 86 10 20 00 clr %g3 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200b190: 89 28 e0 02 sll %g3, 2, %g4 Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && 200b194: c8 03 c0 04 ld [ %o7 + %g4 ], %g4 200b198: 80 a1 20 00 cmp %g4, 0 200b19c: 22 80 00 07 be,a 200b1b8 <_Scheduler_CBS_Get_server_id+0x50> 200b1a0: 86 00 e0 01 inc %g3 200b1a4: c8 01 00 00 ld [ %g4 ], %g4 200b1a8: 80 a1 00 02 cmp %g4, %g2 200b1ac: 22 80 00 09 be,a 200b1d0 <_Scheduler_CBS_Get_server_id+0x68> 200b1b0: c6 26 40 00 st %g3, [ %i1 ] rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b1b4: 86 00 e0 01 inc %g3 200b1b8: 80 a0 c0 01 cmp %g3, %g1 200b1bc: 12 bf ff f6 bne 200b194 <_Scheduler_CBS_Get_server_id+0x2c> 200b1c0: 89 28 e0 02 sll %g3, 2, %g4 _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; 200b1c4: b0 10 3f e7 mov -25, %i0 } 200b1c8: 81 c7 e0 08 ret 200b1cc: 81 e8 00 00 restore unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; 200b1d0: 81 c7 e0 08 ret 200b1d4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200b244 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200b244: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); 200b248: 3b 00 80 88 sethi %hi(0x2022000), %i5 200b24c: d0 07 60 64 ld [ %i5 + 0x64 ], %o0 ! 2022064 <_Scheduler_CBS_Maximum_servers> if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 200b250: b0 10 3f ef mov -17, %i0 } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200b254: 40 00 07 3e call 200cf4c <_Workspace_Allocate> 200b258: 91 2a 20 02 sll %o0, 2, %o0 200b25c: 09 00 80 8c sethi %hi(0x2023000), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200b260: 80 a2 20 00 cmp %o0, 0 200b264: 02 80 00 0f be 200b2a0 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200b268: d0 21 22 b8 st %o0, [ %g4 + 0x2b8 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b26c: c6 07 60 64 ld [ %i5 + 0x64 ], %g3 200b270: 80 a0 e0 00 cmp %g3, 0 200b274: 02 80 00 0b be 200b2a0 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200b278: b0 10 20 00 clr %i0 200b27c: 10 80 00 03 b 200b288 <_Scheduler_CBS_Initialize+0x44> 200b280: 82 10 20 00 clr %g1 200b284: d0 01 22 b8 ld [ %g4 + 0x2b8 ], %o0 _Scheduler_CBS_Server_list[i] = NULL; 200b288: 85 28 60 02 sll %g1, 2, %g2 unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b28c: 82 00 60 01 inc %g1 200b290: 80 a0 40 03 cmp %g1, %g3 200b294: 12 bf ff fc bne 200b284 <_Scheduler_CBS_Initialize+0x40> 200b298: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200b29c: b0 10 20 00 clr %i0 } 200b2a0: 81 c7 e0 08 ret 200b2a4: 81 e8 00 00 restore =============================================================================== 02009cc8 <_Scheduler_CBS_Release_job>: { Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; Scheduler_CBS_Server *serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 2009cc8: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 2009ccc: 80 a2 60 00 cmp %o1, 0 2009cd0: 02 80 00 11 be 2009d14 <_Scheduler_CBS_Release_job+0x4c> 2009cd4: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 2009cd8: 80 a0 60 00 cmp %g1, 0 2009cdc: 02 80 00 13 be 2009d28 <_Scheduler_CBS_Release_job+0x60> 2009ce0: 07 00 80 84 sethi %hi(0x2021000), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 2009ce4: c4 00 60 04 ld [ %g1 + 4 ], %g2 2009ce8: d2 00 e1 60 ld [ %g3 + 0x160 ], %o1 2009cec: 92 02 40 02 add %o1, %g2, %o1 2009cf0: 05 20 00 00 sethi %hi(0x80000000), %g2 2009cf4: 92 2a 40 02 andn %o1, %g2, %o1 new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) the_thread->cpu_time_budget = serv_info->parameters.budget; 2009cf8: c2 00 60 08 ld [ %g1 + 8 ], %g1 2009cfc: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 2009d00: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 2009d04: 94 10 20 01 mov 1, %o2 2009d08: 82 13 c0 00 mov %o7, %g1 2009d0c: 40 00 01 4c call 200a23c <_Thread_Change_priority> 2009d10: 9e 10 40 00 mov %g1, %o7 /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) 2009d14: 80 a0 60 00 cmp %g1, 0 2009d18: 12 bf ff f8 bne 2009cf8 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 2009d1c: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 2009d20: 10 bf ff f9 b 2009d04 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 2009d24: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED /* Initializing or shifting deadline. */ if (serv_info) new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) & ~SCHEDULER_EDF_PRIO_MSB; else new_priority = (_Watchdog_Ticks_since_boot + deadline) 2009d28: 03 00 80 84 sethi %hi(0x2021000), %g1 2009d2c: c2 00 61 60 ld [ %g1 + 0x160 ], %g1 ! 2021160 <_Watchdog_Ticks_since_boot> 2009d30: 92 02 40 01 add %o1, %g1, %o1 2009d34: 03 20 00 00 sethi %hi(0x80000000), %g1 2009d38: 10 bf ff f2 b 2009d00 <_Scheduler_CBS_Release_job+0x38> 2009d3c: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 02009d40 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 2009d40: 9d e3 bf a0 save %sp, -96, %sp Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server *serv_info; Priority_Control new_priority; _Scheduler_EDF_Enqueue(the_thread); 2009d44: 40 00 00 5b call 2009eb0 <_Scheduler_EDF_Enqueue> 2009d48: 90 10 00 18 mov %i0, %o0 /* TODO: flash critical section? */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 2009d4c: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 2009d50: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 * Late unblock rule for deadline-driven tasks. The remaining time to * deadline must be sufficient to serve the remaining computation time * without increased utilization of this task. It might cause a deadline * miss of another task. */ if (serv_info) { 2009d54: 80 a7 60 00 cmp %i5, 0 2009d58: 02 80 00 19 be 2009dbc <_Scheduler_CBS_Unblock+0x7c> 2009d5c: 03 00 80 84 sethi %hi(0x2021000), %g1 time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 2009d60: d2 07 60 04 ld [ %i5 + 4 ], %o1 */ if (serv_info) { time_t deadline = serv_info->parameters.deadline; time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - 2009d64: d0 00 61 60 ld [ %g1 + 0x160 ], %o0 2009d68: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 2009d6c: 40 00 47 c1 call 201bc70 <.umul> 2009d70: 90 27 00 08 sub %i4, %o0, %o0 2009d74: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 2009d78: b6 10 00 08 mov %o0, %i3 2009d7c: 40 00 47 bd call 201bc70 <.umul> 2009d80: d0 07 60 08 ld [ %i5 + 8 ], %o0 2009d84: 80 a6 c0 08 cmp %i3, %o0 2009d88: 24 80 00 0e ble,a 2009dc0 <_Scheduler_CBS_Unblock+0x80> 2009d8c: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 /* Put late unblocked task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 2009d90: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 2009d94: 80 a7 00 09 cmp %i4, %o1 2009d98: 32 80 00 02 bne,a 2009da0 <_Scheduler_CBS_Unblock+0x60> 2009d9c: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 2009da0: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 2009da4: 80 a2 00 09 cmp %o0, %o1 2009da8: 02 80 00 07 be 2009dc4 <_Scheduler_CBS_Unblock+0x84> 2009dac: 3b 00 80 85 sethi %hi(0x2021400), %i5 _Thread_Change_priority(the_thread, new_priority, true); 2009db0: 90 10 00 18 mov %i0, %o0 2009db4: 40 00 01 22 call 200a23c <_Thread_Change_priority> 2009db8: 94 10 20 01 mov 1, %o2 2009dbc: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, 2009dc0: 3b 00 80 85 sethi %hi(0x2021400), %i5 2009dc4: ba 17 61 90 or %i5, 0x190, %i5 ! 2021590 <_Per_CPU_Information> 2009dc8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2009dcc: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 2009dd0: 03 00 80 80 sethi %hi(0x2020000), %g1 2009dd4: c2 00 63 98 ld [ %g1 + 0x398 ], %g1 ! 2020398 <_Scheduler+0x30> 2009dd8: 9f c0 40 00 call %g1 2009ddc: 01 00 00 00 nop 2009de0: 80 a2 20 00 cmp %o0, 0 2009de4: 04 80 00 0a ble 2009e0c <_Scheduler_CBS_Unblock+0xcc> 2009de8: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 2009dec: c2 07 60 0c ld [ %i5 + 0xc ], %g1 * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; 2009df0: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 2009df4: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 2009df8: 80 a0 60 00 cmp %g1, 0 2009dfc: 22 80 00 06 be,a 2009e14 <_Scheduler_CBS_Unblock+0xd4> 2009e00: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 2009e04: 82 10 20 01 mov 1, %g1 2009e08: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 2009e0c: 81 c7 e0 08 ret 2009e10: 81 e8 00 00 restore * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 2009e14: 80 a0 60 00 cmp %g1, 0 2009e18: 12 bf ff fd bne 2009e0c <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 2009e1c: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 2009e20: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 2009e24: 30 bf ff fa b,a 2009e0c <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 02009e28 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 2009e28: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 2009e2c: 40 00 06 e6 call 200b9c4 <_Workspace_Allocate> 2009e30: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 2009e34: 80 a2 20 00 cmp %o0, 0 2009e38: 02 80 00 05 be 2009e4c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 2009e3c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 2009e40: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 2009e44: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 2009e48: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 2009e4c: 81 c7 e0 08 ret 2009e50: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009ecc <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 2009ecc: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 2009ed0: 7f ff ff a0 call 2009d50 <_Scheduler_EDF_Enqueue> 2009ed4: 90 10 00 18 mov %i0, %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( 2009ed8: 3b 00 80 85 sethi %hi(0x2021400), %i5 2009edc: ba 17 60 f0 or %i5, 0xf0, %i5 ! 20214f0 <_Per_CPU_Information> 2009ee0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2009ee4: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 2009ee8: 03 00 80 80 sethi %hi(0x2020000), %g1 2009eec: c2 00 62 f8 ld [ %g1 + 0x2f8 ], %g1 ! 20202f8 <_Scheduler+0x30> 2009ef0: 9f c0 40 00 call %g1 2009ef4: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 2009ef8: 80 a2 20 00 cmp %o0, 0 2009efc: 26 80 00 04 bl,a 2009f0c <_Scheduler_EDF_Unblock+0x40> 2009f00: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2009f04: 81 c7 e0 08 ret 2009f08: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 2009f0c: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 2009f10: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 2009f14: 80 a0 60 00 cmp %g1, 0 2009f18: 22 80 00 06 be,a 2009f30 <_Scheduler_EDF_Unblock+0x64> 2009f1c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 2009f20: 82 10 20 01 mov 1, %g1 2009f24: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 2009f28: 81 c7 e0 08 ret 2009f2c: 81 e8 00 00 restore */ if ( _Scheduler_Is_priority_lower_than( _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 2009f30: 80 a0 60 00 cmp %g1, 0 2009f34: 12 bf ff f4 bne 2009f04 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 2009f38: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 2009f3c: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 2009f40: 30 bf ff fa b,a 2009f28 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 02009658 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 2009658: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 200965c: 03 00 80 7e sethi %hi(0x201f800), %g1 2009660: d0 00 62 0c ld [ %g1 + 0x20c ], %o0 ! 201fa0c <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009664: c2 0a 20 70 ldub [ %o0 + 0x70 ], %g1 2009668: 80 a0 60 00 cmp %g1, 0 200966c: 02 80 00 26 be 2009704 <_Scheduler_priority_Tick+0xac> 2009670: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009674: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2009678: 80 a0 60 00 cmp %g1, 0 200967c: 12 80 00 22 bne 2009704 <_Scheduler_priority_Tick+0xac> 2009680: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009684: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009688: 80 a0 60 01 cmp %g1, 1 200968c: 0a 80 00 07 bcs 20096a8 <_Scheduler_priority_Tick+0x50> 2009690: 80 a0 60 02 cmp %g1, 2 2009694: 28 80 00 10 bleu,a 20096d4 <_Scheduler_priority_Tick+0x7c> 2009698: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 200969c: 80 a0 60 03 cmp %g1, 3 20096a0: 22 80 00 04 be,a 20096b0 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN 20096a4: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 20096a8: 81 c7 e0 08 ret 20096ac: 81 e8 00 00 restore } break; #if defined(RTEMS_SCORE_THREAD_ENABLE_SCHEDULER_CALLOUT) case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: if ( --executing->cpu_time_budget == 0 ) 20096b0: 82 00 7f ff add %g1, -1, %g1 20096b4: 80 a0 60 00 cmp %g1, 0 20096b8: 12 bf ff fc bne 20096a8 <_Scheduler_priority_Tick+0x50> 20096bc: c2 22 20 74 st %g1, [ %o0 + 0x74 ] (*executing->budget_callout)( executing ); 20096c0: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 20096c4: 9f c0 40 00 call %g1 20096c8: 01 00 00 00 nop 20096cc: 81 c7 e0 08 ret 20096d0: 81 e8 00 00 restore case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: #endif if ( (int)(--executing->cpu_time_budget) <= 0 ) { 20096d4: 82 00 7f ff add %g1, -1, %g1 20096d8: 80 a0 60 00 cmp %g1, 0 20096dc: 14 bf ff f3 bg 20096a8 <_Scheduler_priority_Tick+0x50> 20096e0: c2 22 20 74 st %g1, [ %o0 + 0x74 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 20096e4: 03 00 80 7a sethi %hi(0x201e800), %g1 20096e8: c2 00 60 54 ld [ %g1 + 0x54 ], %g1 ! 201e854 <_Scheduler+0xc> 20096ec: 9f c0 40 00 call %g1 20096f0: d0 27 bf fc st %o0, [ %fp + -4 ] * executing thread's timeslice is reset. Otherwise, the * currently executing thread is placed at the rear of the * FIFO for this priority and a new heir is selected. */ _Scheduler_Yield(); executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 20096f4: 03 00 80 7d sethi %hi(0x201f400), %g1 20096f8: d0 07 bf fc ld [ %fp + -4 ], %o0 20096fc: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2009700: c2 22 20 74 st %g1, [ %o0 + 0x74 ] 2009704: 81 c7 e0 08 ret 2009708: 81 e8 00 00 restore =============================================================================== 02009ec4 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2009ec4: 03 00 80 7e sethi %hi(0x201f800), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009ec8: c2 00 60 08 ld [ %g1 + 8 ], %g1 ! 201f808 <_Scheduler> */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 2009ecc: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 2009ed0: c2 00 40 00 ld [ %g1 ], %g1 2009ed4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009ed8: 80 a0 80 03 cmp %g2, %g3 2009edc: 3a 80 00 08 bcc,a 2009efc <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 2009ee0: c2 00 60 04 ld [ %g1 + 4 ], %g1 * Do NOT need to check for end of chain because there is always * at least one task on the ready chain -- the IDLE task. It can * never block, should never attempt to obtain a semaphore or mutex, * and thus will always be there. */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { 2009ee4: c2 00 40 00 ld [ %g1 ], %g1 current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 2009ee8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009eec: 80 a0 80 03 cmp %g2, %g3 2009ef0: 2a bf ff fe bcs,a 2009ee8 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 2009ef4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 2009ef8: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2009efc: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2009f00: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2009f04: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 2009f08: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 2009f0c: 81 c3 e0 08 retl 2009f10: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 020082f0 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 20082f0: 9d e3 bf a0 save %sp, -96, %sp static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 20082f4: 09 00 80 7d sethi %hi(0x201f400), %g4 Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 20082f8: 05 00 80 79 sethi %hi(0x201e400), %g2 20082fc: d8 19 21 40 ldd [ %g4 + 0x140 ], %o4 2008300: c6 00 a3 6c ld [ %g2 + 0x36c ], %g3 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008304: 03 00 80 7d sethi %hi(0x201f400), %g1 2008308: f8 18 61 50 ldd [ %g1 + 0x150 ], %i4 ! 201f550 <_TOD_Now> 200830c: 9f 28 e0 07 sll %g3, 7, %o7 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008310: 37 00 80 7d sethi %hi(0x201f400), %i3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2008314: 85 28 e0 02 sll %g3, 2, %g2 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008318: f4 06 e1 d0 ld [ %i3 + 0x1d0 ], %i2 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 200831c: 84 23 c0 02 sub %o7, %g2, %g2 2008320: 84 00 80 03 add %g2, %g3, %g2 2008324: 85 28 a0 03 sll %g2, 3, %g2 2008328: 86 10 00 02 mov %g2, %g3 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200832c: 9a 80 c0 0d addcc %g3, %o5, %o5 2008330: 84 10 20 00 clr %g2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008334: 92 10 00 1d mov %i5, %o1 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008338: 98 40 80 0c addx %g2, %o4, %o4 Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; *_time += *_add; 200833c: ba 80 c0 1d addcc %g3, %i5, %i5 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008340: b4 06 a0 01 inc %i2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008344: 94 10 20 00 clr %o2 2008348: f4 26 e1 d0 st %i2, [ %i3 + 0x1d0 ] 200834c: 90 10 00 1c mov %i4, %o0 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008350: d8 39 21 40 std %o4, [ %g4 + 0x140 ] Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; *_time += *_add; 2008354: b8 40 80 1c addx %g2, %i4, %i4 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008358: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 *_time += *_add; 200835c: f8 38 61 50 std %i4, [ %g1 + 0x150 ] static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008360: 40 00 49 87 call 201a97c <__divdi3> 2008364: 96 12 e2 00 or %o3, 0x200, %o3 *_time += *_add; if ( ((*_time) / 1000000000L) != _start ) { 2008368: 94 10 20 00 clr %o2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 200836c: b6 10 00 08 mov %o0, %i3 2008370: b4 10 00 09 mov %o1, %i2 *_time += *_add; if ( ((*_time) / 1000000000L) != _start ) { 2008374: 90 10 00 1c mov %i4, %o0 2008378: 92 10 00 1d mov %i5, %o1 200837c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2008380: 40 00 49 7f call 201a97c <__divdi3> 2008384: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _Timestamp_Add_to( &_TOD_Uptime, &tick ); /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); while ( seconds ) { 2008388: 80 a6 c0 08 cmp %i3, %o0 200838c: 02 80 00 05 be 20083a0 <_TOD_Tickle_ticks+0xb0> <== ALWAYS TAKEN 2008390: 80 a6 80 09 cmp %i2, %o1 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 2008394: 31 00 80 7d sethi %hi(0x201f400), %i0 <== NOT EXECUTED 2008398: 40 00 0a cd call 200aecc <_Watchdog_Tickle> 200839c: 91 ee 21 74 restore %i0, 0x174, %o0 20083a0: 12 bf ff fe bne 2008398 <_TOD_Tickle_ticks+0xa8> 20083a4: 31 00 80 7d sethi %hi(0x201f400), %i0 20083a8: 81 c7 e0 08 ret 20083ac: 81 e8 00 00 restore =============================================================================== 02007f78 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007f78: 9d e3 bf a0 save %sp, -96, %sp uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 2007f7c: 03 00 80 83 sethi %hi(0x2020c00), %g1 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) return false; 2007f80: ba 10 20 00 clr %i5 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007f84: 80 a6 20 00 cmp %i0, 0 2007f88: 02 80 00 2c be 2008038 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007f8c: d2 00 62 0c ld [ %g1 + 0x20c ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2007f90: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007f94: 40 00 51 1d call 201c408 <.udiv> 2007f98: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007f9c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2007fa0: 80 a2 00 01 cmp %o0, %g1 2007fa4: 28 80 00 26 bleu,a 200803c <_TOD_Validate+0xc4> 2007fa8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2007fac: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007fb0: 80 a0 60 3b cmp %g1, 0x3b 2007fb4: 38 80 00 22 bgu,a 200803c <_TOD_Validate+0xc4> 2007fb8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2007fbc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2007fc0: 80 a0 60 3b cmp %g1, 0x3b 2007fc4: 38 80 00 1e bgu,a 200803c <_TOD_Validate+0xc4> 2007fc8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2007fcc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2007fd0: 80 a0 60 17 cmp %g1, 0x17 2007fd4: 38 80 00 1a bgu,a 200803c <_TOD_Validate+0xc4> 2007fd8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2007fdc: c2 06 20 04 ld [ %i0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 2007fe0: 80 a0 60 00 cmp %g1, 0 2007fe4: 02 80 00 15 be 2008038 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007fe8: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007fec: 38 80 00 14 bgu,a 200803c <_TOD_Validate+0xc4> 2007ff0: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007ff4: c4 06 00 00 ld [ %i0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 2007ff8: 80 a0 a7 c3 cmp %g2, 0x7c3 2007ffc: 28 80 00 10 bleu,a 200803c <_TOD_Validate+0xc4> 2008000: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008004: c6 06 20 08 ld [ %i0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008008: 80 a0 e0 00 cmp %g3, 0 200800c: 02 80 00 0b be 2008038 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008010: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2008014: 32 80 00 0c bne,a 2008044 <_TOD_Validate+0xcc> 2008018: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 200801c: 82 00 60 0d add %g1, 0xd, %g1 2008020: 05 00 80 7e sethi %hi(0x201f800), %g2 2008024: 83 28 60 02 sll %g1, 2, %g1 2008028: 84 10 a1 70 or %g2, 0x170, %g2 200802c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2008030: 80 a0 40 03 cmp %g1, %g3 2008034: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 2008038: b0 0f 60 01 and %i5, 1, %i0 200803c: 81 c7 e0 08 ret 2008040: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2008044: 05 00 80 7e sethi %hi(0x201f800), %g2 2008048: 84 10 a1 70 or %g2, 0x170, %g2 ! 201f970 <_TOD_Days_per_month> 200804c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2008050: 80 a0 40 03 cmp %g1, %g3 2008054: 10 bf ff f9 b 2008038 <_TOD_Validate+0xc0> 2008058: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02009930 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2009930: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2009934: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 2009938: 40 00 03 a9 call 200a7dc <_Thread_Set_transient> 200993c: 90 10 00 18 mov %i0, %o0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 2009940: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2009944: 80 a0 40 19 cmp %g1, %i1 2009948: 02 80 00 05 be 200995c <_Thread_Change_priority+0x2c> 200994c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2009950: 90 10 00 18 mov %i0, %o0 2009954: 40 00 03 88 call 200a774 <_Thread_Set_priority> 2009958: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200995c: 7f ff e3 00 call 200255c 2009960: 01 00 00 00 nop 2009964: b2 10 00 08 mov %o0, %i1 /* * If the thread has more than STATES_TRANSIENT set, then it is blocked, * If it is blocked on a thread queue, then we need to requeue it. */ state = the_thread->current_state; 2009968: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 200996c: 80 a6 e0 04 cmp %i3, 4 2009970: 02 80 00 18 be 20099d0 <_Thread_Change_priority+0xa0> 2009974: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2009978: 02 80 00 0b be 20099a4 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200997c: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2009980: 7f ff e2 fb call 200256c <== NOT EXECUTED 2009984: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 2009988: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200998c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2009990: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2009994: 32 80 00 0d bne,a 20099c8 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2009998: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200999c: 81 c7 e0 08 ret 20099a0: 81 e8 00 00 restore */ state = the_thread->current_state; if ( state != STATES_TRANSIENT ) { /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 20099a4: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 20099a8: 7f ff e2 f1 call 200256c 20099ac: 90 10 00 19 mov %i1, %o0 20099b0: 03 00 00 ef sethi %hi(0x3bc00), %g1 20099b4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20099b8: 80 8e c0 01 btst %i3, %g1 20099bc: 02 bf ff f8 be 200999c <_Thread_Change_priority+0x6c> 20099c0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20099c4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 20099c8: 40 00 03 3a call 200a6b0 <_Thread_queue_Requeue> 20099cc: 93 e8 00 1d restore %g0, %i5, %o1 20099d0: 39 00 80 7a sethi %hi(0x201e800), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 20099d4: 12 80 00 08 bne 20099f4 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 20099d8: b8 17 20 48 or %i4, 0x48, %i4 ! 201e848 <_Scheduler> * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); if ( prepend_it ) 20099dc: 80 a6 a0 00 cmp %i2, 0 20099e0: 02 80 00 1b be 2009a4c <_Thread_Change_priority+0x11c> 20099e4: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 20099e8: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 20099ec: 9f c0 40 00 call %g1 20099f0: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 20099f4: 7f ff e2 de call 200256c 20099f8: 90 10 00 19 mov %i1, %o0 20099fc: 7f ff e2 d8 call 200255c 2009a00: 01 00 00 00 nop 2009a04: b0 10 00 08 mov %o0, %i0 * This kernel routine implements the scheduling decision logic for * the scheduler. It does NOT dispatch. */ RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( void ) { _Scheduler.Operations.schedule(); 2009a08: c2 07 20 08 ld [ %i4 + 8 ], %g1 2009a0c: 9f c0 40 00 call %g1 2009a10: 01 00 00 00 nop * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 2009a14: 03 00 80 7e sethi %hi(0x201f800), %g1 2009a18: 82 10 62 00 or %g1, 0x200, %g1 ! 201fa00 <_Per_CPU_Information> 2009a1c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Scheduler_Schedule(); if ( !_Thread_Is_executing_also_the_heir() && 2009a20: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009a24: 80 a0 80 03 cmp %g2, %g3 2009a28: 02 80 00 07 be 2009a44 <_Thread_Change_priority+0x114> 2009a2c: 01 00 00 00 nop 2009a30: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 2009a34: 80 a0 a0 00 cmp %g2, 0 2009a38: 02 80 00 03 be 2009a44 <_Thread_Change_priority+0x114> 2009a3c: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2009a40: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2009a44: 7f ff e2 ca call 200256c 2009a48: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2009a4c: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 2009a50: 9f c0 40 00 call %g1 2009a54: 90 10 00 1d mov %i5, %o0 2009a58: 30 bf ff e7 b,a 20099f4 <_Thread_Change_priority+0xc4> =============================================================================== 02009c74 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009c74: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009c78: 90 10 00 18 mov %i0, %o0 2009c7c: 40 00 00 77 call 2009e58 <_Thread_Get> 2009c80: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009c84: c2 07 bf fc ld [ %fp + -4 ], %g1 2009c88: 80 a0 60 00 cmp %g1, 0 2009c8c: 12 80 00 09 bne 2009cb0 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2009c90: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2009c94: 7f ff ff 72 call 2009a5c <_Thread_Clear_state> 2009c98: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2009c9c: 03 00 80 7d sethi %hi(0x201f400), %g1 2009ca0: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201f4c0 <_Thread_Dispatch_disable_level> 2009ca4: 84 00 bf ff add %g2, -1, %g2 2009ca8: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2009cac: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 2009cb0: 81 c7 e0 08 ret 2009cb4: 81 e8 00 00 restore =============================================================================== 02009cb8 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2009cb8: 9d e3 bf 98 save %sp, -104, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2009cbc: 31 00 80 7d sethi %hi(0x201f400), %i0 2009cc0: c2 06 20 c0 ld [ %i0 + 0xc0 ], %g1 ! 201f4c0 <_Thread_Dispatch_disable_level> 2009cc4: 82 00 60 01 inc %g1 2009cc8: c2 26 20 c0 st %g1, [ %i0 + 0xc0 ] return _Thread_Dispatch_disable_level; 2009ccc: c2 06 20 c0 ld [ %i0 + 0xc0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 2009cd0: 39 00 80 7e sethi %hi(0x201f800), %i4 2009cd4: b8 17 22 00 or %i4, 0x200, %i4 ! 201fa00 <_Per_CPU_Information> _ISR_Disable( level ); 2009cd8: 7f ff e2 21 call 200255c 2009cdc: fa 07 20 0c ld [ %i4 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 2009ce0: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 2009ce4: 80 a0 60 00 cmp %g1, 0 2009ce8: 02 80 00 45 be 2009dfc <_Thread_Dispatch+0x144> 2009cec: 01 00 00 00 nop heir = _Thread_Heir; 2009cf0: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 2009cf4: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2009cf8: 80 a7 40 1b cmp %i5, %i3 2009cfc: 02 80 00 40 be 2009dfc <_Thread_Dispatch+0x144> 2009d00: f6 27 20 0c st %i3, [ %i4 + 0xc ] 2009d04: 33 00 80 7d sethi %hi(0x201f400), %i1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009d08: 21 00 80 7d sethi %hi(0x201f400), %l0 2009d0c: b2 16 61 4c or %i1, 0x14c, %i1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 2009d10: 10 80 00 35 b 2009de4 <_Thread_Dispatch+0x12c> 2009d14: 35 00 80 7d sethi %hi(0x201f400), %i2 _ISR_Enable( level ); 2009d18: 7f ff e2 15 call 200256c 2009d1c: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2009d20: 40 00 12 37 call 200e5fc <_TOD_Get_uptime> 2009d24: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2009d28: c4 1f 20 20 ldd [ %i4 + 0x20 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2009d2c: d4 1f 60 80 ldd [ %i5 + 0x80 ], %o2 _Timestamp_Subtract( 2009d30: d8 1f bf f8 ldd [ %fp + -8 ], %o4 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2009d34: c2 06 40 00 ld [ %i1 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2009d38: 86 a3 40 03 subcc %o5, %g3, %g3 2009d3c: 84 63 00 02 subx %o4, %g2, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2009d40: 86 82 c0 03 addcc %o3, %g3, %g3 2009d44: 84 42 80 02 addx %o2, %g2, %g2 2009d48: c4 3f 60 80 std %g2, [ %i5 + 0x80 ] 2009d4c: 80 a0 60 00 cmp %g1, 0 2009d50: 02 80 00 06 be 2009d68 <_Thread_Dispatch+0xb0> <== NEVER TAKEN 2009d54: d8 3f 20 20 std %o4, [ %i4 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 2009d58: c4 00 40 00 ld [ %g1 ], %g2 2009d5c: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2009d60: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2 2009d64: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2009d68: 90 10 00 1d mov %i5, %o0 2009d6c: 40 00 03 ae call 200ac24 <_User_extensions_Thread_switch> 2009d70: 92 10 00 1b mov %i3, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2009d74: 90 07 60 c8 add %i5, 0xc8, %o0 2009d78: 40 00 04 f8 call 200b158 <_CPU_Context_switch> 2009d7c: 92 06 e0 c8 add %i3, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2009d80: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2009d84: 80 a0 60 00 cmp %g1, 0 2009d88: 02 80 00 0c be 2009db8 <_Thread_Dispatch+0x100> 2009d8c: d0 06 a1 48 ld [ %i2 + 0x148 ], %o0 2009d90: 80 a7 40 08 cmp %i5, %o0 2009d94: 02 80 00 09 be 2009db8 <_Thread_Dispatch+0x100> 2009d98: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2009d9c: 02 80 00 04 be 2009dac <_Thread_Dispatch+0xf4> 2009da0: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2009da4: 40 00 04 b3 call 200b070 <_CPU_Context_save_fp> 2009da8: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2009dac: 40 00 04 ce call 200b0e4 <_CPU_Context_restore_fp> 2009db0: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2009db4: fa 26 a1 48 st %i5, [ %i2 + 0x148 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2009db8: 7f ff e1 e9 call 200255c 2009dbc: fa 07 20 0c ld [ %i4 + 0xc ], %i5 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2009dc0: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 2009dc4: 80 a0 60 00 cmp %g1, 0 2009dc8: 02 80 00 0d be 2009dfc <_Thread_Dispatch+0x144> 2009dcc: 01 00 00 00 nop heir = _Thread_Heir; 2009dd0: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 2009dd4: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2009dd8: 80 a6 c0 1d cmp %i3, %i5 2009ddc: 02 80 00 08 be 2009dfc <_Thread_Dispatch+0x144> <== NEVER TAKEN 2009de0: f6 27 20 0c st %i3, [ %i4 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 2009de4: c2 06 e0 78 ld [ %i3 + 0x78 ], %g1 2009de8: 80 a0 60 01 cmp %g1, 1 2009dec: 12 bf ff cb bne 2009d18 <_Thread_Dispatch+0x60> 2009df0: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009df4: 10 bf ff c9 b 2009d18 <_Thread_Dispatch+0x60> 2009df8: c2 26 e0 74 st %g1, [ %i3 + 0x74 ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 2009dfc: 7f ff e1 dc call 200256c 2009e00: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2009e04: c2 06 20 c0 ld [ %i0 + 0xc0 ], %g1 2009e08: 82 00 7f ff add %g1, -1, %g1 2009e0c: c2 26 20 c0 st %g1, [ %i0 + 0xc0 ] return _Thread_Dispatch_disable_level; 2009e10: c2 06 20 c0 ld [ %i0 + 0xc0 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 2009e14: 7f ff f7 8f call 2007c50 <_API_extensions_Run_postswitch> 2009e18: 01 00 00 00 nop } 2009e1c: 81 c7 e0 08 ret 2009e20: 81 e8 00 00 restore =============================================================================== 02011368 <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 2011368: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 201136c: 03 00 80 7e sethi %hi(0x201f800), %g1 2011370: fa 00 62 0c ld [ %g1 + 0x20c ], %i5 ! 201fa0c <_Per_CPU_Information+0xc> /* * Some CPUs need to tinker with the call frame or registers when the * thread actually begins to execute for the first time. This is a * hook point where the port gets a shot at doing whatever it requires. */ _Context_Initialization_at_thread_begin(); 2011374: 3f 00 80 44 sethi %hi(0x2011000), %i7 2011378: be 17 e3 68 or %i7, 0x368, %i7 ! 2011368 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 201137c: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 2011380: 7f ff c4 7b call 200256c 2011384: 91 2a 20 08 sll %o0, 8, %o0 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2011388: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 201138c: 03 00 80 7c sethi %hi(0x201f000), %g1 doneConstructors = true; 2011390: 86 10 20 01 mov 1, %g3 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 2011394: f6 08 61 98 ldub [ %g1 + 0x198 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2011398: 80 a0 a0 00 cmp %g2, 0 201139c: 02 80 00 0c be 20113cc <_Thread_Handler+0x64> 20113a0: c6 28 61 98 stb %g3, [ %g1 + 0x198 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 20113a4: 39 00 80 7d sethi %hi(0x201f400), %i4 20113a8: d0 07 21 48 ld [ %i4 + 0x148 ], %o0 ! 201f548 <_Thread_Allocated_fp> 20113ac: 80 a7 40 08 cmp %i5, %o0 20113b0: 02 80 00 07 be 20113cc <_Thread_Handler+0x64> 20113b4: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 20113b8: 22 80 00 05 be,a 20113cc <_Thread_Handler+0x64> 20113bc: fa 27 21 48 st %i5, [ %i4 + 0x148 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 20113c0: 7f ff e7 2c call 200b070 <_CPU_Context_save_fp> 20113c4: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 20113c8: fa 27 21 48 st %i5, [ %i4 + 0x148 ] /* * Take care that 'begin' extensions get to complete before * 'switch' extensions can run. This means must keep dispatch * disabled until all 'begin' extensions complete. */ _User_extensions_Thread_begin( executing ); 20113cc: 7f ff e5 94 call 200aa1c <_User_extensions_Thread_begin> 20113d0: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 20113d4: 7f ff e2 94 call 2009e24 <_Thread_Enable_dispatch> 20113d8: 01 00 00 00 nop /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { 20113dc: 80 8e e0 ff btst 0xff, %i3 20113e0: 02 80 00 0e be 2011418 <_Thread_Handler+0xb0> 20113e4: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 20113e8: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 20113ec: 80 a0 60 00 cmp %g1, 0 20113f0: 02 80 00 0e be 2011428 <_Thread_Handler+0xc0> 20113f4: 80 a0 60 01 cmp %g1, 1 (*(Thread_Entry_numeric) executing->Start.entry_point)( executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 20113f8: 22 80 00 11 be,a 201143c <_Thread_Handler+0xd4> <== ALWAYS TAKEN 20113fc: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 2011400: 7f ff e5 9b call 200aa6c <_User_extensions_Thread_exitted> 2011404: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 2011408: 90 10 20 00 clr %o0 201140c: 92 10 20 01 mov 1, %o1 2011410: 7f ff dc ff call 200880c <_Internal_error_Occurred> 2011414: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { INIT_NAME (); 2011418: 40 00 34 c0 call 201e718 <_init> 201141c: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 2011420: 10 bf ff f3 b 20113ec <_Thread_Handler+0x84> 2011424: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 2011428: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 201142c: 9f c0 40 00 call %g1 2011430: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 2011434: 10 bf ff f3 b 2011400 <_Thread_Handler+0x98> 2011438: d0 27 60 28 st %o0, [ %i5 + 0x28 ] ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 201143c: 9f c0 40 00 call %g1 2011440: d0 07 60 94 ld [ %i5 + 0x94 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 2011444: 10 bf ff ef b 2011400 <_Thread_Handler+0x98> 2011448: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 02009f08 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2009f08: 9d e3 bf a0 save %sp, -96, %sp 2009f0c: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 2009f10: c0 26 61 58 clr [ %i1 + 0x158 ] 2009f14: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2009f18: c0 26 61 54 clr [ %i1 + 0x154 ] Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2009f1c: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2009f20: e4 00 40 00 ld [ %g1 ], %l2 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 2009f24: 80 a6 a0 00 cmp %i2, 0 2009f28: 02 80 00 6b be 200a0d4 <_Thread_Initialize+0x1cc> 2009f2c: e2 0f a0 5f ldub [ %fp + 0x5f ], %l1 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 2009f30: c0 2e 60 b0 clrb [ %i1 + 0xb0 ] 2009f34: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2009f38: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ] the_stack->size = size; 2009f3c: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 2009f40: 80 a7 20 00 cmp %i4, 0 2009f44: 12 80 00 48 bne 200a064 <_Thread_Initialize+0x15c> 2009f48: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009f4c: 39 00 80 7d sethi %hi(0x201f400), %i4 2009f50: c2 07 21 58 ld [ %i4 + 0x158 ], %g1 ! 201f558 <_Thread_Maximum_extensions> fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 2009f54: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2009f58: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2009f5c: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2009f60: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2009f64: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009f68: 80 a0 60 00 cmp %g1, 0 2009f6c: 12 80 00 46 bne 200a084 <_Thread_Initialize+0x17c> 2009f70: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009f74: c0 26 61 60 clr [ %i1 + 0x160 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 2009f78: b4 10 20 00 clr %i2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2009f7c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2009f80: e2 2e 60 9c stb %l1, [ %i1 + 0x9c ] the_thread->Start.budget_algorithm = budget_algorithm; 2009f84: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2009f88: 80 a4 20 02 cmp %l0, 2 2009f8c: 12 80 00 05 bne 2009fa0 <_Thread_Initialize+0x98> 2009f90: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009f94: 03 00 80 7d sethi %hi(0x201f400), %g1 2009f98: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 ! 201f424 <_Thread_Ticks_per_timeslice> 2009f9c: c2 26 60 74 st %g1, [ %i1 + 0x74 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009fa0: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2009fa4: 03 00 80 7a sethi %hi(0x201e800), %g1 2009fa8: c2 00 60 60 ld [ %g1 + 0x60 ], %g1 ! 201e860 <_Scheduler+0x18> 2009fac: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 2009fb0: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 2009fb4: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2009fb8: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2009fbc: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2009fc0: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2009fc4: fa 26 60 ac st %i5, [ %i1 + 0xac ] 2009fc8: 9f c0 40 00 call %g1 2009fcc: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2009fd0: b8 92 20 00 orcc %o0, 0, %i4 2009fd4: 22 80 00 13 be,a 200a020 <_Thread_Initialize+0x118> 2009fd8: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2009fdc: 90 10 00 19 mov %i1, %o0 2009fe0: 40 00 01 e5 call 200a774 <_Thread_Set_priority> 2009fe4: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009fe8: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009fec: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 2009ff0: c0 26 60 80 clr [ %i1 + 0x80 ] 2009ff4: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009ff8: 83 28 60 02 sll %g1, 2, %g1 2009ffc: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200a000: e4 26 60 0c st %l2, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 200a004: 90 10 00 19 mov %i1, %o0 200a008: 40 00 02 c0 call 200ab08 <_User_extensions_Thread_create> 200a00c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 200a010: 80 8a 20 ff btst 0xff, %o0 200a014: 32 80 00 12 bne,a 200a05c <_Thread_Initialize+0x154> 200a018: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200a01c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 200a020: 40 00 03 ff call 200b01c <_Workspace_Free> 200a024: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200a028: 40 00 03 fd call 200b01c <_Workspace_Free> 200a02c: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 200a030: 40 00 03 fb call 200b01c <_Workspace_Free> 200a034: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200a038: 40 00 03 f9 call 200b01c <_Workspace_Free> 200a03c: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200a040: 40 00 03 f7 call 200b01c <_Workspace_Free> 200a044: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200a048: 40 00 03 f5 call 200b01c <_Workspace_Free> 200a04c: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200a050: 40 00 02 0d call 200a884 <_Thread_Stack_Free> 200a054: 90 10 00 19 mov %i1, %o0 return false; } 200a058: b0 0e 20 01 and %i0, 1, %i0 200a05c: 81 c7 e0 08 ret 200a060: 81 e8 00 00 restore /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 200a064: 40 00 03 e6 call 200affc <_Workspace_Allocate> 200a068: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200a06c: b6 92 20 00 orcc %o0, 0, %i3 200a070: 32 bf ff b8 bne,a 2009f50 <_Thread_Initialize+0x48> 200a074: 39 00 80 7d sethi %hi(0x201f400), %i4 * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200a078: b4 10 20 00 clr %i2 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 200a07c: 10 bf ff e8 b 200a01c <_Thread_Initialize+0x114> 200a080: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200a084: 82 00 60 01 inc %g1 200a088: 40 00 03 dd call 200affc <_Workspace_Allocate> 200a08c: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200a090: b4 92 20 00 orcc %o0, 0, %i2 200a094: 02 80 00 1d be 200a108 <_Thread_Initialize+0x200> 200a098: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200a09c: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 200a0a0: c8 07 21 58 ld [ %i4 + 0x158 ], %g4 * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 200a0a4: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a0a8: 10 80 00 03 b 200a0b4 <_Thread_Initialize+0x1ac> 200a0ac: 82 10 20 00 clr %g1 200a0b0: c6 06 61 60 ld [ %i1 + 0x160 ], %g3 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 200a0b4: 85 28 a0 02 sll %g2, 2, %g2 200a0b8: c0 20 c0 02 clr [ %g3 + %g2 ] * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 200a0bc: 82 00 60 01 inc %g1 200a0c0: 80 a0 40 04 cmp %g1, %g4 200a0c4: 08 bf ff fb bleu 200a0b0 <_Thread_Initialize+0x1a8> 200a0c8: 84 10 00 01 mov %g1, %g2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 200a0cc: 10 bf ff ad b 2009f80 <_Thread_Initialize+0x78> 200a0d0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 200a0d4: 90 10 00 19 mov %i1, %o0 200a0d8: 40 00 01 d0 call 200a818 <_Thread_Stack_Allocate> 200a0dc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200a0e0: 80 a2 00 1b cmp %o0, %i3 200a0e4: 0a 80 00 07 bcs 200a100 <_Thread_Initialize+0x1f8> 200a0e8: 80 a2 20 00 cmp %o0, 0 200a0ec: 02 80 00 05 be 200a100 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 200a0f0: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200a0f4: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2 the_thread->Start.core_allocated_stack = true; 200a0f8: 10 bf ff 90 b 2009f38 <_Thread_Initialize+0x30> 200a0fc: c2 2e 60 b0 stb %g1, [ %i1 + 0xb0 ] stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 200a100: 10 bf ff d6 b 200a058 <_Thread_Initialize+0x150> 200a104: b0 10 20 00 clr %i0 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 200a108: 10 bf ff c5 b 200a01c <_Thread_Initialize+0x114> 200a10c: b8 10 20 00 clr %i4 =============================================================================== 0200a884 <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 200a884: 9d e3 bf a0 save %sp, -96, %sp #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200a888: c2 0e 20 b0 ldub [ %i0 + 0xb0 ], %g1 200a88c: 80 a0 60 00 cmp %g1, 0 200a890: 02 80 00 0b be 200a8bc <_Thread_Stack_Free+0x38> <== NEVER TAKEN 200a894: 01 00 00 00 nop * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ if ( Configuration.stack_free_hook ) 200a898: 03 00 80 79 sethi %hi(0x201e400), %g1 200a89c: c2 00 63 84 ld [ %g1 + 0x384 ], %g1 ! 201e784 200a8a0: 80 a0 60 00 cmp %g1, 0 200a8a4: 22 80 00 08 be,a 200a8c4 <_Thread_Stack_Free+0x40> 200a8a8: f0 06 20 b8 ld [ %i0 + 0xb8 ], %i0 (*Configuration.stack_free_hook)( the_thread->Start.Initial_stack.area ); 200a8ac: 9f c0 40 00 call %g1 200a8b0: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0 200a8b4: 81 c7 e0 08 ret 200a8b8: 81 e8 00 00 restore 200a8bc: 81 c7 e0 08 ret <== NOT EXECUTED 200a8c0: 81 e8 00 00 restore <== NOT EXECUTED else _Workspace_Free( the_thread->Start.Initial_stack.area ); 200a8c4: 40 00 01 d6 call 200b01c <_Workspace_Free> 200a8c8: 81 e8 00 00 restore =============================================================================== 0200a6b0 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200a6b0: 9d e3 bf 98 save %sp, -104, %sp /* * Just in case the thread really wasn't blocked on a thread queue * when we get here. */ if ( !the_thread_queue ) 200a6b4: 80 a6 20 00 cmp %i0, 0 200a6b8: 02 80 00 13 be 200a704 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200a6bc: 01 00 00 00 nop /* * If queueing by FIFO, there is nothing to do. This only applies to * priority blocking discipline. */ if ( the_thread_queue->discipline == THREAD_QUEUE_DISCIPLINE_PRIORITY ) { 200a6c0: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 200a6c4: 80 a7 20 01 cmp %i4, 1 200a6c8: 02 80 00 04 be 200a6d8 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200a6cc: 01 00 00 00 nop 200a6d0: 81 c7 e0 08 ret <== NOT EXECUTED 200a6d4: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200a6d8: 7f ff df a1 call 200255c 200a6dc: 01 00 00 00 nop 200a6e0: ba 10 00 08 mov %o0, %i5 200a6e4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200a6e8: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a6ec: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200a6f0: 80 88 80 01 btst %g2, %g1 200a6f4: 12 80 00 06 bne 200a70c <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200a6f8: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); } _ISR_Enable( level ); 200a6fc: 7f ff df 9c call 200256c 200a700: 90 10 00 1d mov %i5, %o0 200a704: 81 c7 e0 08 ret 200a708: 81 e8 00 00 restore ISR_Level level_ignored; _ISR_Disable( level ); if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 200a70c: 92 10 00 19 mov %i1, %o1 200a710: 94 10 20 01 mov 1, %o2 200a714: 40 00 11 9e call 200ed8c <_Thread_queue_Extract_priority_helper> 200a718: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200a71c: 90 10 00 18 mov %i0, %o0 200a720: 92 10 00 19 mov %i1, %o1 200a724: 7f ff ff 35 call 200a3f8 <_Thread_queue_Enqueue_priority> 200a728: 94 07 bf fc add %fp, -4, %o2 200a72c: 30 bf ff f4 b,a 200a6fc <_Thread_queue_Requeue+0x4c> =============================================================================== 0200a730 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a730: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a734: 90 10 00 18 mov %i0, %o0 200a738: 7f ff fd c8 call 2009e58 <_Thread_Get> 200a73c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a740: c2 07 bf fc ld [ %fp + -4 ], %g1 200a744: 80 a0 60 00 cmp %g1, 0 200a748: 12 80 00 09 bne 200a76c <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 200a74c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200a750: 40 00 11 c8 call 200ee70 <_Thread_queue_Process_timeout> 200a754: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a758: 03 00 80 7d sethi %hi(0x201f400), %g1 200a75c: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201f4c0 <_Thread_Dispatch_disable_level> 200a760: 84 00 bf ff add %g2, -1, %g2 200a764: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 200a768: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 200a76c: 81 c7 e0 08 ret 200a770: 81 e8 00 00 restore =============================================================================== 020173cc <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 20173cc: 9d e3 bf 78 save %sp, -136, %sp 20173d0: 21 00 80 f5 sethi %hi(0x203d400), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20173d4: a4 07 bf e8 add %fp, -24, %l2 20173d8: b4 07 bf ec add %fp, -20, %i2 20173dc: b8 07 bf f4 add %fp, -12, %i4 20173e0: a2 07 bf f8 add %fp, -8, %l1 20173e4: 33 00 80 f5 sethi %hi(0x203d400), %i1 20173e8: 2b 00 80 f5 sethi %hi(0x203d400), %l5 20173ec: 82 06 20 34 add %i0, 0x34, %g1 20173f0: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 20173f4: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20173f8: e4 27 bf f0 st %l2, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20173fc: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 2017400: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2017404: f8 27 bf fc st %i4, [ %fp + -4 ] 2017408: a0 14 23 40 or %l0, 0x340, %l0 201740c: ba 06 20 30 add %i0, 0x30, %i5 2017410: b2 16 62 c0 or %i1, 0x2c0, %i1 2017414: b6 06 20 68 add %i0, 0x68, %i3 2017418: aa 15 62 30 or %l5, 0x230, %l5 201741c: a8 06 20 08 add %i0, 8, %l4 2017420: c2 27 bf e4 st %g1, [ %fp + -28 ] 2017424: a6 06 20 40 add %i0, 0x40, %l3 2017428: ae 06 20 6c add %i0, 0x6c, %l7 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 201742c: ac 10 20 01 mov 1, %l6 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 2017430: e4 26 20 78 st %l2, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2017434: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2017438: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201743c: 90 10 00 1d mov %i5, %o0 2017440: 92 20 40 09 sub %g1, %o1, %o1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2017444: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2017448: 40 00 13 15 call 201c09c <_Watchdog_Adjust_to_chain> 201744c: 94 10 00 1c mov %i4, %o2 2017450: d0 1e 40 00 ldd [ %i1 ], %o0 2017454: 94 10 20 00 clr %o2 2017458: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 201745c: 40 00 58 0a call 202d484 <__divdi3> 2017460: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2017464: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 2017468: 80 a2 40 0a cmp %o1, %o2 201746c: 18 80 00 2d bgu 2017520 <_Timer_server_Body+0x154> 2017470: 82 10 00 09 mov %o1, %g1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2017474: 80 a2 40 0a cmp %o1, %o2 2017478: 0a 80 00 20 bcs 20174f8 <_Timer_server_Body+0x12c> 201747c: 94 22 80 01 sub %o2, %g1, %o2 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2017480: c2 26 20 74 st %g1, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2017484: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2017488: 40 00 02 fa call 2018070 <_Chain_Get> 201748c: 01 00 00 00 nop if ( timer == NULL ) { 2017490: 92 92 20 00 orcc %o0, 0, %o1 2017494: 02 80 00 10 be 20174d4 <_Timer_server_Body+0x108> 2017498: 01 00 00 00 nop static void _Timer_server_Insert_timer( Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201749c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 20174a0: 80 a0 60 01 cmp %g1, 1 20174a4: 02 80 00 1b be 2017510 <_Timer_server_Body+0x144> 20174a8: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20174ac: 12 bf ff f6 bne 2017484 <_Timer_server_Body+0xb8> <== NEVER TAKEN 20174b0: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20174b4: 40 00 13 2b call 201c160 <_Watchdog_Insert> 20174b8: 90 10 00 1b mov %i3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20174bc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20174c0: 40 00 02 ec call 2018070 <_Chain_Get> 20174c4: 01 00 00 00 nop if ( timer == NULL ) { 20174c8: 92 92 20 00 orcc %o0, 0, %o1 20174cc: 32 bf ff f5 bne,a 20174a0 <_Timer_server_Body+0xd4> <== NEVER TAKEN 20174d0: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 20174d4: 7f ff df 62 call 200f25c 20174d8: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 20174dc: c2 07 bf e8 ld [ %fp + -24 ], %g1 20174e0: 80 a0 40 1a cmp %g1, %i2 20174e4: 02 80 00 16 be 201753c <_Timer_server_Body+0x170> <== ALWAYS TAKEN 20174e8: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 20174ec: 7f ff df 60 call 200f26c <== NOT EXECUTED 20174f0: 01 00 00 00 nop <== NOT EXECUTED 20174f4: 30 bf ff d0 b,a 2017434 <_Timer_server_Body+0x68> <== NOT EXECUTED /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 20174f8: c2 27 bf e0 st %g1, [ %fp + -32 ] 20174fc: 90 10 00 1b mov %i3, %o0 2017500: 40 00 12 b8 call 201bfe0 <_Watchdog_Adjust> 2017504: 92 10 20 01 mov 1, %o1 2017508: 10 bf ff de b 2017480 <_Timer_server_Body+0xb4> 201750c: c2 07 bf e0 ld [ %fp + -32 ], %g1 Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2017510: 90 10 00 1d mov %i5, %o0 2017514: 40 00 13 13 call 201c160 <_Watchdog_Insert> 2017518: 92 02 60 10 add %o1, 0x10, %o1 201751c: 30 bf ff da b,a 2017484 <_Timer_server_Body+0xb8> /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2017520: 92 22 40 0a sub %o1, %o2, %o1 2017524: c2 27 bf e0 st %g1, [ %fp + -32 ] 2017528: 90 10 00 1b mov %i3, %o0 201752c: 40 00 12 dc call 201c09c <_Watchdog_Adjust_to_chain> 2017530: 94 10 00 1c mov %i4, %o2 2017534: 10 bf ff d3 b 2017480 <_Timer_server_Body+0xb4> 2017538: c2 07 bf e0 ld [ %fp + -32 ], %g1 */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 201753c: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2017540: 7f ff df 4b call 200f26c 2017544: 01 00 00 00 nop _Chain_Initialize_empty( &fire_chain ); while ( true ) { _Timer_server_Get_watchdogs_that_fire_now( ts, &insert_chain, &fire_chain ); if ( !_Chain_Is_empty( &fire_chain ) ) { 2017548: c2 07 bf f4 ld [ %fp + -12 ], %g1 201754c: 80 a0 40 11 cmp %g1, %l1 2017550: 12 80 00 0d bne 2017584 <_Timer_server_Body+0x1b8> 2017554: 01 00 00 00 nop 2017558: 30 80 00 14 b,a 20175a8 <_Timer_server_Body+0x1dc> Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; new_first->previous = head; 201755c: f8 20 60 04 st %i4, [ %g1 + 4 ] * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 2017560: c0 20 a0 08 clr [ %g2 + 8 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 2017564: c2 27 bf f4 st %g1, [ %fp + -12 ] _ISR_Enable( level ); 2017568: 7f ff df 41 call 200f26c 201756c: c4 27 bf dc st %g2, [ %fp + -36 ] /* * The timer server may block here and wait for resources or time. * The system watchdogs are inactive and will remain inactive since * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); 2017570: c4 07 bf dc ld [ %fp + -36 ], %g2 2017574: d0 00 a0 20 ld [ %g2 + 0x20 ], %o0 2017578: c2 00 a0 1c ld [ %g2 + 0x1c ], %g1 201757c: 9f c0 40 00 call %g1 2017580: d2 00 a0 24 ld [ %g2 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2017584: 7f ff df 36 call 200f25c 2017588: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201758c: c4 07 bf f4 ld [ %fp + -12 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 2017590: 80 a0 80 11 cmp %g2, %l1 2017594: 32 bf ff f2 bne,a 201755c <_Timer_server_Body+0x190> 2017598: c2 00 80 00 ld [ %g2 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 201759c: 7f ff df 34 call 200f26c 20175a0: 01 00 00 00 nop 20175a4: 30 bf ff a3 b,a 2017430 <_Timer_server_Body+0x64> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20175a8: c0 2e 20 7c clrb [ %i0 + 0x7c ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20175ac: c2 05 40 00 ld [ %l5 ], %g1 20175b0: 82 00 60 01 inc %g1 20175b4: c2 25 40 00 st %g1, [ %l5 ] return _Thread_Dispatch_disable_level; 20175b8: c2 05 40 00 ld [ %l5 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 20175bc: d0 06 00 00 ld [ %i0 ], %o0 20175c0: 40 00 11 3d call 201bab4 <_Thread_Set_state> 20175c4: 92 10 20 08 mov 8, %o1 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20175c8: 40 00 13 48 call 201c2e8 <_Watchdog_Remove> 20175cc: 90 10 00 14 mov %l4, %o0 { ISR_Level level; _Timer_server_Stop_interval_system_watchdog( ts ); _ISR_Disable( level ); 20175d0: 7f ff df 23 call 200f25c 20175d4: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20175d8: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20175dc: c4 07 bf e4 ld [ %fp + -28 ], %g2 20175e0: 80 a0 40 02 cmp %g1, %g2 20175e4: 02 80 00 25 be 2017678 <_Timer_server_Body+0x2ac> 20175e8: 01 00 00 00 nop Watchdog_Interval delta_interval = 20175ec: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 _Watchdog_First( &ts->Interval_watchdogs.Chain )->delta_interval; _ISR_Enable( level ); 20175f0: 7f ff df 1f call 200f26c 20175f4: c2 27 bf e0 st %g1, [ %fp + -32 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20175f8: c2 07 bf e0 ld [ %fp + -32 ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20175fc: 92 10 00 14 mov %l4, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2017600: c2 26 20 14 st %g1, [ %i0 + 0x14 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2017604: 11 00 80 f5 sethi %hi(0x203d400), %o0 2017608: 40 00 12 d6 call 201c160 <_Watchdog_Insert> 201760c: 90 12 22 f0 or %o0, 0x2f0, %o0 ! 203d6f0 <_Watchdog_Ticks_chain> static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2017610: 40 00 13 36 call 201c2e8 <_Watchdog_Remove> 2017614: 90 10 00 13 mov %l3, %o0 { ISR_Level level; _Timer_server_Stop_tod_system_watchdog( ts ); _ISR_Disable( level ); 2017618: 7f ff df 11 call 200f25c 201761c: 01 00 00 00 nop 2017620: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017624: 80 a0 40 17 cmp %g1, %l7 2017628: 02 80 00 1e be 20176a0 <_Timer_server_Body+0x2d4> 201762c: 01 00 00 00 nop Watchdog_Interval delta_interval = 2017630: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 _Watchdog_First( &ts->TOD_watchdogs.Chain )->delta_interval; _ISR_Enable( level ); 2017634: 7f ff df 0e call 200f26c 2017638: c2 27 bf e0 st %g1, [ %fp + -32 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 201763c: c2 07 bf e0 ld [ %fp + -32 ], %g1 _Watchdog_Insert( &_Watchdog_Seconds_chain, the_watchdog ); 2017640: 11 00 80 f5 sethi %hi(0x203d400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2017644: c2 26 20 4c st %g1, [ %i0 + 0x4c ] _Watchdog_Insert( &_Watchdog_Seconds_chain, the_watchdog ); 2017648: 90 12 22 e4 or %o0, 0x2e4, %o0 201764c: 40 00 12 c5 call 201c160 <_Watchdog_Insert> 2017650: 92 10 00 13 mov %l3, %o1 */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); 2017654: 40 00 0e 98 call 201b0b4 <_Thread_Enable_dispatch> 2017658: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201765c: 90 10 00 14 mov %l4, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 2017660: ec 2e 20 7c stb %l6, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2017664: 40 00 13 21 call 201c2e8 <_Watchdog_Remove> 2017668: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 201766c: 40 00 13 1f call 201c2e8 <_Watchdog_Remove> 2017670: 90 10 00 13 mov %l3, %o0 2017674: 30 bf ff 6f b,a 2017430 <_Timer_server_Body+0x64> _Watchdog_Insert_ticks( &ts->Interval_watchdogs.System_watchdog, delta_interval ); } else { _ISR_Enable( level ); 2017678: 7f ff de fd call 200f26c 201767c: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2017680: 40 00 13 1a call 201c2e8 <_Watchdog_Remove> 2017684: 90 10 00 13 mov %l3, %o0 { ISR_Level level; _Timer_server_Stop_tod_system_watchdog( ts ); _ISR_Disable( level ); 2017688: 7f ff de f5 call 200f25c 201768c: 01 00 00 00 nop 2017690: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017694: 80 a0 40 17 cmp %g1, %l7 2017698: 32 bf ff e7 bne,a 2017634 <_Timer_server_Body+0x268> 201769c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 _Watchdog_Insert_seconds( &ts->TOD_watchdogs.System_watchdog, delta_interval ); } else { _ISR_Enable( level ); 20176a0: 7f ff de f3 call 200f26c 20176a4: 01 00 00 00 nop 20176a8: 30 bf ff eb b,a 2017654 <_Timer_server_Body+0x288> =============================================================================== 020171e4 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20171e4: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20171e8: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20171ec: 80 a0 60 00 cmp %g1, 0 20171f0: 02 80 00 05 be 2017204 <_Timer_server_Schedule_operation_method+0x20> 20171f4: ba 10 00 19 mov %i1, %i5 * server is not preemptible, so we must be in interrupt context here. No * thread dispatch will happen until the timer server finishes its * critical section. We have to use the protected chain methods because * we may be interrupted by a higher priority interrupt. */ _Chain_Append( ts->insert_chain, &timer->Object.Node ); 20171f8: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 20171fc: 40 00 03 89 call 2018020 <_Chain_Append> 2017200: 81 e8 00 00 restore * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2017204: 03 00 80 f5 sethi %hi(0x203d400), %g1 2017208: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 203d630 <_Thread_Dispatch_disable_level> 201720c: 84 00 a0 01 inc %g2 2017210: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 2017214: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2017218: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 201721c: 80 a0 60 01 cmp %g1, 1 2017220: 02 80 00 3b be 201730c <_Timer_server_Schedule_operation_method+0x128> 2017224: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); if ( !ts->active ) { _Timer_server_Reset_interval_system_watchdog( ts ); } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2017228: 02 80 00 04 be 2017238 <_Timer_server_Schedule_operation_method+0x54> 201722c: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2017230: 40 00 0f a1 call 201b0b4 <_Thread_Enable_dispatch> 2017234: 81 e8 00 00 restore } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2017238: 7f ff e0 09 call 200f25c 201723c: 01 00 00 00 nop 2017240: b8 10 00 08 mov %o0, %i4 2017244: 03 00 80 f5 sethi %hi(0x203d400), %g1 2017248: d0 18 62 c0 ldd [ %g1 + 0x2c0 ], %o0 ! 203d6c0 <_TOD_Now> 201724c: 94 10 20 00 clr %o2 2017250: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017254: 40 00 58 8c call 202d484 <__divdi3> 2017258: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201725c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2017260: c4 06 20 74 ld [ %i0 + 0x74 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2017264: b6 06 20 6c add %i0, 0x6c, %i3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017268: 80 a0 40 1b cmp %g1, %i3 201726c: 02 80 00 0c be 201729c <_Timer_server_Schedule_operation_method+0xb8> 2017270: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2017274: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2017278: 86 01 00 02 add %g4, %g2, %g3 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 201727c: 08 80 00 07 bleu 2017298 <_Timer_server_Schedule_operation_method+0xb4> 2017280: 86 20 c0 09 sub %g3, %o1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2017284: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 2017288: 80 a1 00 02 cmp %g4, %g2 201728c: 08 80 00 03 bleu 2017298 <_Timer_server_Schedule_operation_method+0xb4><== NEVER TAKEN 2017290: 86 10 20 00 clr %g3 delta_interval -= delta; 2017294: 86 21 00 02 sub %g4, %g2, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2017298: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 201729c: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 20172a0: 7f ff df f3 call 200f26c 20172a4: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20172a8: 90 06 20 68 add %i0, 0x68, %o0 20172ac: 40 00 13 ad call 201c160 <_Watchdog_Insert> 20172b0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20172b4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20172b8: 80 a0 60 00 cmp %g1, 0 20172bc: 12 bf ff dd bne 2017230 <_Timer_server_Schedule_operation_method+0x4c> 20172c0: b8 06 20 40 add %i0, 0x40, %i4 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20172c4: 40 00 14 09 call 201c2e8 <_Watchdog_Remove> 20172c8: 90 10 00 1c mov %i4, %o0 { ISR_Level level; _Timer_server_Stop_tod_system_watchdog( ts ); _ISR_Disable( level ); 20172cc: 7f ff df e4 call 200f25c 20172d0: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20172d4: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 20172d8: 80 a6 c0 01 cmp %i3, %g1 20172dc: 02 80 00 38 be 20173bc <_Timer_server_Schedule_operation_method+0x1d8><== NEVER TAKEN 20172e0: 01 00 00 00 nop Watchdog_Interval delta_interval = 20172e4: fa 00 60 10 ld [ %g1 + 0x10 ], %i5 _Watchdog_First( &ts->TOD_watchdogs.Chain )->delta_interval; _ISR_Enable( level ); 20172e8: 7f ff df e1 call 200f26c 20172ec: 01 00 00 00 nop ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Seconds_chain, the_watchdog ); 20172f0: 92 10 00 1c mov %i4, %o1 20172f4: 11 00 80 f5 sethi %hi(0x203d400), %o0 20172f8: 90 12 22 e4 or %o0, 0x2e4, %o0 ! 203d6e4 <_Watchdog_Seconds_chain> 20172fc: 40 00 13 99 call 201c160 <_Watchdog_Insert> 2017300: fa 26 20 4c st %i5, [ %i0 + 0x4c ] if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2017304: 40 00 0f 6c call 201b0b4 <_Thread_Enable_dispatch> 2017308: 81 e8 00 00 restore if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 201730c: 7f ff df d4 call 200f25c 2017310: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2017314: 05 00 80 f5 sethi %hi(0x203d400), %g2 2017318: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201731c: c4 00 a3 40 ld [ %g2 + 0x340 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2017320: c8 06 20 3c ld [ %i0 + 0x3c ], %g4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2017324: b8 06 20 34 add %i0, 0x34, %i4 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2017328: 80 a0 40 1c cmp %g1, %i4 201732c: 02 80 00 08 be 201734c <_Timer_server_Schedule_operation_method+0x168> 2017330: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2017334: f6 00 60 10 ld [ %g1 + 0x10 ], %i3 if (delta_interval > delta) { 2017338: 80 a1 00 1b cmp %g4, %i3 201733c: 1a 80 00 03 bcc 2017348 <_Timer_server_Schedule_operation_method+0x164> 2017340: 86 10 20 00 clr %g3 delta_interval -= delta; 2017344: 86 26 c0 04 sub %i3, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2017348: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 201734c: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2017350: 7f ff df c7 call 200f26c 2017354: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2017358: 90 06 20 30 add %i0, 0x30, %o0 201735c: 40 00 13 81 call 201c160 <_Watchdog_Insert> 2017360: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017364: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017368: 80 a0 60 00 cmp %g1, 0 201736c: 12 bf ff b1 bne 2017230 <_Timer_server_Schedule_operation_method+0x4c> 2017370: b6 06 20 08 add %i0, 8, %i3 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2017374: 40 00 13 dd call 201c2e8 <_Watchdog_Remove> 2017378: 90 10 00 1b mov %i3, %o0 { ISR_Level level; _Timer_server_Stop_interval_system_watchdog( ts ); _ISR_Disable( level ); 201737c: 7f ff df b8 call 200f25c 2017380: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2017384: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2017388: 80 a7 00 01 cmp %i4, %g1 201738c: 02 80 00 0c be 20173bc <_Timer_server_Schedule_operation_method+0x1d8> 2017390: 01 00 00 00 nop Watchdog_Interval delta_interval = 2017394: fa 00 60 10 ld [ %g1 + 0x10 ], %i5 _Watchdog_First( &ts->Interval_watchdogs.Chain )->delta_interval; _ISR_Enable( level ); 2017398: 7f ff df b5 call 200f26c 201739c: 01 00 00 00 nop ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20173a0: 92 10 00 1b mov %i3, %o1 20173a4: 11 00 80 f5 sethi %hi(0x203d400), %o0 20173a8: 90 12 22 f0 or %o0, 0x2f0, %o0 ! 203d6f0 <_Watchdog_Ticks_chain> 20173ac: 40 00 13 6d call 201c160 <_Watchdog_Insert> 20173b0: fa 26 20 14 st %i5, [ %i0 + 0x14 ] if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20173b4: 40 00 0f 40 call 201b0b4 <_Thread_Enable_dispatch> 20173b8: 81 e8 00 00 restore _Watchdog_Insert_seconds( &ts->TOD_watchdogs.System_watchdog, delta_interval ); } else { _ISR_Enable( level ); 20173bc: 7f ff df ac call 200f26c 20173c0: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20173c4: 40 00 0f 3c call 201b0b4 <_Thread_Enable_dispatch> 20173c8: 81 e8 00 00 restore =============================================================================== 0200c810 <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 200c810: 9d e3 bf a0 save %sp, -96, %sp 200c814: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200c818: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 200c81c: c8 00 60 04 ld [ %g1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 200c820: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 200c824: c4 06 60 04 ld [ %i1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200c828: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 200c82c: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200c830: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200c834: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 200c838: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 200c83c: 80 a0 80 04 cmp %g2, %g4 200c840: 08 80 00 0b bleu 200c86c <_Timespec_Add_to+0x5c> <== ALWAYS TAKEN 200c844: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200c848: 1f 31 19 4d sethi %hi(0xc4653400), %o7 <== NOT EXECUTED 200c84c: 9e 13 e2 00 or %o7, 0x200, %o7 ! c4653600 <== NOT EXECUTED 200c850: 84 00 80 0f add %g2, %o7, %g2 <== NOT EXECUTED time->tv_sec++; 200c854: 86 00 e0 01 inc %g3 <== NOT EXECUTED /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200c858: 80 a0 80 04 cmp %g2, %g4 <== NOT EXECUTED 200c85c: 18 bf ff fd bgu 200c850 <_Timespec_Add_to+0x40> <== NOT EXECUTED 200c860: b0 06 20 01 inc %i0 <== NOT EXECUTED 200c864: c4 20 60 04 st %g2, [ %g1 + 4 ] <== NOT EXECUTED 200c868: c6 20 40 00 st %g3, [ %g1 ] <== NOT EXECUTED time->tv_sec++; seconds++; } return seconds; } 200c86c: 81 c7 e0 08 ret 200c870: 81 e8 00 00 restore =============================================================================== 0200a2d0 <_Timespec_Divide>: const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200a2d0: 9d e3 bf 88 save %sp, -120, %sp * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a2d4: da 06 40 00 ld [ %i1 ], %o5 right += rhs->tv_nsec; 200a2d8: ea 06 60 04 ld [ %i1 + 4 ], %l5 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a2dc: 99 3b 60 1f sra %o5, 0x1f, %o4 200a2e0: 83 2b 20 03 sll %o4, 3, %g1 200a2e4: 87 2b 60 03 sll %o5, 3, %g3 200a2e8: 89 33 60 1d srl %o5, 0x1d, %g4 200a2ec: 84 11 00 01 or %g4, %g1, %g2 200a2f0: 83 30 e0 1b srl %g3, 0x1b, %g1 200a2f4: 95 28 a0 05 sll %g2, 5, %o2 200a2f8: 97 28 e0 05 sll %g3, 5, %o3 200a2fc: 94 10 40 0a or %g1, %o2, %o2 200a300: 96 a2 c0 03 subcc %o3, %g3, %o3 200a304: 83 32 e0 1a srl %o3, 0x1a, %g1 200a308: 94 62 80 02 subx %o2, %g2, %o2 200a30c: 93 2a e0 06 sll %o3, 6, %o1 200a310: 91 2a a0 06 sll %o2, 6, %o0 200a314: 96 a2 40 0b subcc %o1, %o3, %o3 200a318: 90 10 40 08 or %g1, %o0, %o0 200a31c: 94 62 00 0a subx %o0, %o2, %o2 200a320: 96 82 c0 0d addcc %o3, %o5, %o3 200a324: 83 32 e0 1e srl %o3, 0x1e, %g1 200a328: 94 42 80 0c addx %o2, %o4, %o2 200a32c: bb 2a e0 02 sll %o3, 2, %i5 200a330: b9 2a a0 02 sll %o2, 2, %i4 200a334: 96 82 c0 1d addcc %o3, %i5, %o3 200a338: b8 10 40 1c or %g1, %i4, %i4 200a33c: 83 32 e0 1e srl %o3, 0x1e, %g1 200a340: 94 42 80 1c addx %o2, %i4, %o2 200a344: a3 2a e0 02 sll %o3, 2, %l1 200a348: a1 2a a0 02 sll %o2, 2, %l0 200a34c: 96 82 c0 11 addcc %o3, %l1, %o3 200a350: a0 10 40 10 or %g1, %l0, %l0 200a354: 83 32 e0 1e srl %o3, 0x1e, %g1 200a358: 94 42 80 10 addx %o2, %l0, %o2 200a35c: a7 2a e0 02 sll %o3, 2, %l3 200a360: a5 2a a0 02 sll %o2, 2, %l2 200a364: 96 82 c0 13 addcc %o3, %l3, %o3 200a368: a4 10 40 12 or %g1, %l2, %l2 200a36c: 83 2a e0 09 sll %o3, 9, %g1 200a370: 94 42 80 12 addx %o2, %l2, %o2 200a374: 87 32 e0 17 srl %o3, 0x17, %g3 200a378: 85 2a a0 09 sll %o2, 9, %g2 right += rhs->tv_nsec; 200a37c: 96 80 40 15 addcc %g1, %l5, %o3 200a380: a9 3d 60 1f sra %l5, 0x1f, %l4 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a384: 94 10 c0 02 or %g3, %g2, %o2 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a388: c8 06 00 00 ld [ %i0 ], %g4 left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; 200a38c: 94 42 80 14 addx %o2, %l4, %o2 if ( right == 0 ) { 200a390: 80 92 80 0b orcc %o2, %o3, %g0 200a394: 02 80 00 64 be 200a524 <_Timespec_Divide+0x254> <== ALWAYS TAKEN 200a398: c2 06 20 04 ld [ %i0 + 4 ], %g1 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; 200a39c: c2 27 bf ec st %g1, [ %fp + -20 ] <== NOT EXECUTED 200a3a0: 83 38 60 1f sra %g1, 0x1f, %g1 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a3a4: 9f 31 20 1d srl %g4, 0x1d, %o7 <== NOT EXECUTED 200a3a8: ba 10 00 04 mov %g4, %i5 <== NOT EXECUTED 200a3ac: b9 39 20 1f sra %g4, 0x1f, %i4 <== NOT EXECUTED 200a3b0: 9b 2f 60 03 sll %i5, 3, %o5 <== NOT EXECUTED 200a3b4: 89 2f 20 03 sll %i4, 3, %g4 <== NOT EXECUTED left += lhs->tv_nsec; 200a3b8: c2 27 bf e8 st %g1, [ %fp + -24 ] <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a3bc: 87 2b 60 05 sll %o5, 5, %g3 <== NOT EXECUTED 200a3c0: 86 a0 c0 0d subcc %g3, %o5, %g3 <== NOT EXECUTED 200a3c4: 83 30 e0 1a srl %g3, 0x1a, %g1 <== NOT EXECUTED 200a3c8: 98 13 c0 04 or %o7, %g4, %o4 <== NOT EXECUTED 200a3cc: 93 28 e0 06 sll %g3, 6, %o1 <== NOT EXECUTED 200a3d0: 89 33 60 1b srl %o5, 0x1b, %g4 <== NOT EXECUTED 200a3d4: 85 2b 20 05 sll %o4, 5, %g2 <== NOT EXECUTED 200a3d8: 84 11 00 02 or %g4, %g2, %g2 <== NOT EXECUTED 200a3dc: 84 60 80 0c subx %g2, %o4, %g2 <== NOT EXECUTED 200a3e0: 86 a2 40 03 subcc %o1, %g3, %g3 <== NOT EXECUTED 200a3e4: 91 28 a0 06 sll %g2, 6, %o0 <== NOT EXECUTED 200a3e8: 90 10 40 08 or %g1, %o0, %o0 <== NOT EXECUTED 200a3ec: 84 62 00 02 subx %o0, %g2, %g2 <== NOT EXECUTED 200a3f0: 86 80 c0 1d addcc %g3, %i5, %g3 <== NOT EXECUTED 200a3f4: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200a3f8: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED 200a3fc: a3 28 e0 02 sll %g3, 2, %l1 <== NOT EXECUTED 200a400: a1 28 a0 02 sll %g2, 2, %l0 <== NOT EXECUTED 200a404: 86 80 c0 11 addcc %g3, %l1, %g3 <== NOT EXECUTED 200a408: a0 10 40 10 or %g1, %l0, %l0 <== NOT EXECUTED 200a40c: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200a410: 84 40 80 10 addx %g2, %l0, %g2 <== NOT EXECUTED 200a414: a7 28 e0 02 sll %g3, 2, %l3 <== NOT EXECUTED 200a418: a5 28 a0 02 sll %g2, 2, %l2 <== NOT EXECUTED 200a41c: 86 80 c0 13 addcc %g3, %l3, %g3 <== NOT EXECUTED 200a420: a4 10 40 12 or %g1, %l2, %l2 <== NOT EXECUTED 200a424: b3 28 e0 02 sll %g3, 2, %i1 <== NOT EXECUTED 200a428: 84 40 80 12 addx %g2, %l2, %g2 <== NOT EXECUTED 200a42c: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200a430: b1 28 a0 02 sll %g2, 2, %i0 <== NOT EXECUTED 200a434: 86 80 c0 19 addcc %g3, %i1, %g3 <== NOT EXECUTED 200a438: b0 10 40 18 or %g1, %i0, %i0 <== NOT EXECUTED 200a43c: b9 30 e0 17 srl %g3, 0x17, %i4 <== NOT EXECUTED 200a440: 84 40 80 18 addx %g2, %i0, %g2 <== NOT EXECUTED 200a444: 89 28 a0 09 sll %g2, 9, %g4 <== NOT EXECUTED 200a448: 84 17 00 04 or %i4, %g4, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200a44c: f8 1f bf e8 ldd [ %fp + -24 ], %i4 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200a450: 83 28 e0 09 sll %g3, 9, %g1 <== NOT EXECUTED left += lhs->tv_nsec; 200a454: 9a 80 40 1d addcc %g1, %i5, %o5 <== NOT EXECUTED 200a458: 98 40 80 1c addx %g2, %i4, %o4 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200a45c: 85 33 60 1e srl %o5, 0x1e, %g2 <== NOT EXECUTED 200a460: 83 2b 20 02 sll %o4, 2, %g1 <== NOT EXECUTED 200a464: af 2b 60 02 sll %o5, 2, %l7 <== NOT EXECUTED 200a468: ac 10 80 01 or %g2, %g1, %l6 <== NOT EXECUTED 200a46c: ab 2d e0 05 sll %l7, 5, %l5 <== NOT EXECUTED 200a470: 83 35 e0 1b srl %l7, 0x1b, %g1 <== NOT EXECUTED 200a474: 86 a5 40 17 subcc %l5, %l7, %g3 <== NOT EXECUTED 200a478: a9 2d a0 05 sll %l6, 5, %l4 <== NOT EXECUTED 200a47c: a8 10 40 14 or %g1, %l4, %l4 <== NOT EXECUTED 200a480: 84 65 00 16 subx %l4, %l6, %g2 <== NOT EXECUTED 200a484: 86 80 c0 0d addcc %g3, %o5, %g3 <== NOT EXECUTED 200a488: 84 40 80 0c addx %g2, %o4, %g2 <== NOT EXECUTED 200a48c: b9 28 e0 02 sll %g3, 2, %i4 <== NOT EXECUTED 200a490: bb 28 a0 02 sll %g2, 2, %i5 <== NOT EXECUTED 200a494: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200a498: f8 27 bf fc st %i4, [ %fp + -4 ] <== NOT EXECUTED 200a49c: 88 10 40 1d or %g1, %i5, %g4 <== NOT EXECUTED 200a4a0: c8 27 bf f8 st %g4, [ %fp + -8 ] <== NOT EXECUTED 200a4a4: f8 1f bf f8 ldd [ %fp + -8 ], %i4 <== NOT EXECUTED 200a4a8: 86 80 c0 1d addcc %g3, %i5, %g3 <== NOT EXECUTED 200a4ac: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED 200a4b0: b9 28 e0 02 sll %g3, 2, %i4 <== NOT EXECUTED 200a4b4: bb 28 a0 02 sll %g2, 2, %i5 <== NOT EXECUTED 200a4b8: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200a4bc: f8 27 bf f4 st %i4, [ %fp + -12 ] <== NOT EXECUTED 200a4c0: 88 10 40 1d or %g1, %i5, %g4 <== NOT EXECUTED 200a4c4: c8 27 bf f0 st %g4, [ %fp + -16 ] <== NOT EXECUTED 200a4c8: f8 1f bf f0 ldd [ %fp + -16 ], %i4 <== NOT EXECUTED 200a4cc: 92 80 c0 1d addcc %g3, %i5, %o1 <== NOT EXECUTED 200a4d0: 90 40 80 1c addx %g2, %i4, %o0 <== NOT EXECUTED 200a4d4: 87 32 60 1b srl %o1, 0x1b, %g3 <== NOT EXECUTED 200a4d8: 83 2a 60 05 sll %o1, 5, %g1 <== NOT EXECUTED 200a4dc: 85 2a 20 05 sll %o0, 5, %g2 <== NOT EXECUTED 200a4e0: 92 10 00 01 mov %g1, %o1 <== NOT EXECUTED 200a4e4: 40 00 41 f4 call 201acb4 <__udivdi3> <== NOT EXECUTED 200a4e8: 90 10 c0 02 or %g3, %g2, %o0 <== NOT EXECUTED *ival_percentage = answer / 1000; 200a4ec: 94 10 20 00 clr %o2 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200a4f0: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED 200a4f4: b8 10 00 09 mov %o1, %i4 <== NOT EXECUTED *ival_percentage = answer / 1000; 200a4f8: 40 00 41 ef call 201acb4 <__udivdi3> <== NOT EXECUTED 200a4fc: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED *fval_percentage = answer % 1000; 200a500: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; *ival_percentage = answer / 1000; 200a504: d2 26 80 00 st %o1, [ %i2 ] <== NOT EXECUTED *fval_percentage = answer % 1000; 200a508: 94 10 20 00 clr %o2 <== NOT EXECUTED 200a50c: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200a510: 40 00 42 be call 201b008 <__umoddi3> <== NOT EXECUTED 200a514: 92 10 00 1c mov %i4, %o1 <== NOT EXECUTED 200a518: d2 26 c0 00 st %o1, [ %i3 ] <== NOT EXECUTED 200a51c: 81 c7 e0 08 ret <== NOT EXECUTED 200a520: 81 e8 00 00 restore <== NOT EXECUTED left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; if ( right == 0 ) { *ival_percentage = 0; 200a524: c0 26 80 00 clr [ %i2 ] *fval_percentage = 0; 200a528: c0 26 c0 00 clr [ %i3 ] return; 200a52c: 81 c7 e0 08 ret 200a530: 81 e8 00 00 restore =============================================================================== 0200c250 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200c250: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200c254: d4 1e 40 00 ldd [ %i1 ], %o2 200c258: 80 92 80 0b orcc %o2, %o3, %g0 200c25c: 22 80 00 2f be,a 200c318 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200c260: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200c264: f8 1e 00 00 ldd [ %i0 ], %i4 200c268: 83 2f 20 02 sll %i4, 2, %g1 200c26c: 9b 2f 60 02 sll %i5, 2, %o5 200c270: 89 37 60 1e srl %i5, 0x1e, %g4 200c274: 98 11 00 01 or %g4, %g1, %o4 200c278: 83 33 60 1b srl %o5, 0x1b, %g1 200c27c: 85 2b 20 05 sll %o4, 5, %g2 200c280: 87 2b 60 05 sll %o5, 5, %g3 200c284: 84 10 40 02 or %g1, %g2, %g2 200c288: 86 a0 c0 0d subcc %g3, %o5, %g3 200c28c: 84 60 80 0c subx %g2, %o4, %g2 200c290: 86 80 c0 1d addcc %g3, %i5, %g3 200c294: 83 30 e0 1e srl %g3, 0x1e, %g1 200c298: 84 40 80 1c addx %g2, %i4, %g2 200c29c: 93 28 e0 02 sll %g3, 2, %o1 200c2a0: 91 28 a0 02 sll %g2, 2, %o0 200c2a4: 86 80 c0 09 addcc %g3, %o1, %g3 200c2a8: 90 10 40 08 or %g1, %o0, %o0 200c2ac: 83 30 e0 1e srl %g3, 0x1e, %g1 200c2b0: 84 40 80 08 addx %g2, %o0, %g2 200c2b4: b3 28 e0 02 sll %g3, 2, %i1 200c2b8: b1 28 a0 02 sll %g2, 2, %i0 200c2bc: 92 80 c0 19 addcc %g3, %i1, %o1 200c2c0: b0 10 40 18 or %g1, %i0, %i0 200c2c4: 87 32 60 1b srl %o1, 0x1b, %g3 200c2c8: 90 40 80 18 addx %g2, %i0, %o0 200c2cc: 83 2a 60 05 sll %o1, 5, %g1 200c2d0: 85 2a 20 05 sll %o0, 5, %g2 200c2d4: 92 10 00 01 mov %g1, %o1 200c2d8: 40 00 41 a4 call 201c968 <__divdi3> 200c2dc: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200c2e0: 94 10 20 00 clr %o2 * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200c2e4: b0 10 00 08 mov %o0, %i0 200c2e8: b8 10 00 09 mov %o1, %i4 *_ival_percentage = answer / 1000; 200c2ec: 40 00 41 9f call 201c968 <__divdi3> 200c2f0: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200c2f4: 90 10 00 18 mov %i0, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200c2f8: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200c2fc: 94 10 20 00 clr %o2 200c300: 96 10 23 e8 mov 0x3e8, %o3 200c304: 40 00 42 7f call 201cd00 <__moddi3> 200c308: 92 10 00 1c mov %i4, %o1 200c30c: d2 26 c0 00 st %o1, [ %i3 ] 200c310: 81 c7 e0 08 ret 200c314: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200c318: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200c31c: 81 c7 e0 08 ret <== NOT EXECUTED 200c320: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200aab8 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200aab8: 9d e3 bf a0 save %sp, -96, %sp 200aabc: 39 00 80 7d sethi %hi(0x201f400), %i4 200aac0: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201f6a8 <_User_extensions_List> 200aac4: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200aac8: 80 a7 40 1c cmp %i5, %i4 200aacc: 02 80 00 0d be 200ab00 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200aad0: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 200aad4: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200aad8: 80 a0 60 00 cmp %g1, 0 200aadc: 02 80 00 05 be 200aaf0 <_User_extensions_Fatal+0x38> 200aae0: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200aae4: 92 10 00 19 mov %i1, %o1 200aae8: 9f c0 40 00 call %g1 200aaec: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200aaf0: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200aaf4: 80 a7 40 1c cmp %i5, %i4 200aaf8: 32 bf ff f8 bne,a 200aad8 <_User_extensions_Fatal+0x20> 200aafc: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200ab00: 81 c7 e0 08 ret 200ab04: 81 e8 00 00 restore =============================================================================== 0200a964 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200a964: 9d e3 bf a0 save %sp, -96, %sp User_extensions_Control *extension; uint32_t i; uint32_t number_of_extensions; User_extensions_Table *initial_extensions; number_of_extensions = Configuration.number_of_initial_extensions; 200a968: 07 00 80 79 sethi %hi(0x201e400), %g3 200a96c: 86 10 e3 5c or %g3, 0x35c, %g3 ! 201e75c initial_extensions = Configuration.User_extension_table; 200a970: f6 00 e0 40 ld [ %g3 + 0x40 ], %i3 200a974: 3b 00 80 7d sethi %hi(0x201f400), %i5 200a978: 09 00 80 7d sethi %hi(0x201f400), %g4 200a97c: 84 17 62 a8 or %i5, 0x2a8, %g2 200a980: 82 11 20 c4 or %g4, 0xc4, %g1 200a984: b4 00 a0 04 add %g2, 4, %i2 200a988: b8 00 60 04 add %g1, 4, %i4 200a98c: f4 27 62 a8 st %i2, [ %i5 + 0x2a8 ] head->previous = NULL; 200a990: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 200a994: c4 20 a0 08 st %g2, [ %g2 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200a998: f8 21 20 c4 st %i4, [ %g4 + 0xc4 ] head->previous = NULL; 200a99c: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200a9a0: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200a9a4: 80 a6 e0 00 cmp %i3, 0 200a9a8: 02 80 00 1b be 200aa14 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200a9ac: f4 00 e0 3c ld [ %g3 + 0x3c ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 200a9b0: 83 2e a0 02 sll %i2, 2, %g1 200a9b4: b9 2e a0 04 sll %i2, 4, %i4 200a9b8: b8 27 00 01 sub %i4, %g1, %i4 200a9bc: b8 07 00 1a add %i4, %i2, %i4 200a9c0: b9 2f 20 02 sll %i4, 2, %i4 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200a9c4: 40 00 01 9c call 200b034 <_Workspace_Allocate_or_fatal_error> 200a9c8: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200a9cc: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200a9d0: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200a9d4: 40 00 1d 97 call 2012030 200a9d8: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200a9dc: 80 a6 a0 00 cmp %i2, 0 200a9e0: 02 80 00 0d be 200aa14 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200a9e4: b8 10 20 00 clr %i4 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 200a9e8: 92 10 00 1b mov %i3, %o1 200a9ec: 94 10 20 20 mov 0x20, %o2 200a9f0: 40 00 1d 54 call 2011f40 200a9f4: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 200a9f8: 40 00 11 62 call 200ef80 <_User_extensions_Add_set> 200a9fc: 90 10 00 1d mov %i5, %o0 200aa00: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200aa04: ba 07 60 34 add %i5, 0x34, %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200aa08: 80 a7 00 1a cmp %i4, %i2 200aa0c: 12 bf ff f7 bne 200a9e8 <_User_extensions_Handler_initialization+0x84> 200aa10: b6 06 e0 20 add %i3, 0x20, %i3 200aa14: 81 c7 e0 08 ret 200aa18: 81 e8 00 00 restore =============================================================================== 0200aa1c <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 200aa1c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200aa20: 39 00 80 7d sethi %hi(0x201f400), %i4 200aa24: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201f6a8 <_User_extensions_List> 200aa28: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aa2c: b8 07 20 04 add %i4, 4, %i4 200aa30: 80 a7 40 1c cmp %i5, %i4 200aa34: 02 80 00 0c be 200aa64 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200aa38: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 200aa3c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200aa40: 80 a0 60 00 cmp %g1, 0 200aa44: 02 80 00 04 be 200aa54 <_User_extensions_Thread_begin+0x38> 200aa48: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200aa4c: 9f c0 40 00 call %g1 200aa50: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200aa54: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aa58: 80 a7 40 1c cmp %i5, %i4 200aa5c: 32 bf ff f9 bne,a 200aa40 <_User_extensions_Thread_begin+0x24> 200aa60: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200aa64: 81 c7 e0 08 ret 200aa68: 81 e8 00 00 restore =============================================================================== 0200ab08 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200ab08: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200ab0c: 39 00 80 7d sethi %hi(0x201f400), %i4 200ab10: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201f6a8 <_User_extensions_List> 200ab14: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200ab18: b8 07 20 04 add %i4, 4, %i4 200ab1c: 80 a7 40 1c cmp %i5, %i4 200ab20: 02 80 00 12 be 200ab68 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 200ab24: 82 10 20 01 mov 1, %g1 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 200ab28: 37 00 80 7e sethi %hi(0x201f800), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 200ab2c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200ab30: 80 a0 60 00 cmp %g1, 0 200ab34: 02 80 00 08 be 200ab54 <_User_extensions_Thread_create+0x4c> 200ab38: 84 16 e2 00 or %i3, 0x200, %g2 status = (*the_extension->Callouts.thread_create)( 200ab3c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200ab40: 9f c0 40 00 call %g1 200ab44: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200ab48: 80 8a 20 ff btst 0xff, %o0 200ab4c: 02 80 00 0a be 200ab74 <_User_extensions_Thread_create+0x6c> 200ab50: 82 10 20 00 clr %g1 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200ab54: fa 07 40 00 ld [ %i5 ], %i5 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200ab58: 80 a7 40 1c cmp %i5, %i4 200ab5c: 32 bf ff f5 bne,a 200ab30 <_User_extensions_Thread_create+0x28> 200ab60: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200ab64: 82 10 20 01 mov 1, %g1 } 200ab68: b0 08 60 01 and %g1, 1, %i0 200ab6c: 81 c7 e0 08 ret 200ab70: 81 e8 00 00 restore 200ab74: b0 08 60 01 and %g1, 1, %i0 200ab78: 81 c7 e0 08 ret 200ab7c: 81 e8 00 00 restore =============================================================================== 0200ab80 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200ab80: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200ab84: 39 00 80 7d sethi %hi(0x201f400), %i4 200ab88: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201f6a8 <_User_extensions_List> 200ab8c: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200ab90: 80 a7 40 1c cmp %i5, %i4 200ab94: 02 80 00 0d be 200abc8 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200ab98: 37 00 80 7e sethi %hi(0x201f800), %i3 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 200ab9c: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200aba0: 80 a0 60 00 cmp %g1, 0 200aba4: 02 80 00 05 be 200abb8 <_User_extensions_Thread_delete+0x38> 200aba8: 84 16 e2 00 or %i3, 0x200, %g2 (*the_extension->Callouts.thread_delete)( 200abac: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200abb0: 9f c0 40 00 call %g1 200abb4: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200abb8: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200abbc: 80 a7 40 1c cmp %i5, %i4 200abc0: 32 bf ff f8 bne,a 200aba0 <_User_extensions_Thread_delete+0x20> 200abc4: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200abc8: 81 c7 e0 08 ret 200abcc: 81 e8 00 00 restore =============================================================================== 0200aa6c <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200aa6c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200aa70: 39 00 80 7d sethi %hi(0x201f400), %i4 200aa74: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201f6a8 <_User_extensions_List> 200aa78: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200aa7c: 80 a7 40 1c cmp %i5, %i4 200aa80: 02 80 00 0c be 200aab0 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200aa84: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 200aa88: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200aa8c: 80 a0 60 00 cmp %g1, 0 200aa90: 02 80 00 04 be 200aaa0 <_User_extensions_Thread_exitted+0x34> 200aa94: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200aa98: 9f c0 40 00 call %g1 200aa9c: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200aaa0: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200aaa4: 80 a7 40 1c cmp %i5, %i4 200aaa8: 32 bf ff f9 bne,a 200aa8c <_User_extensions_Thread_exitted+0x20> 200aaac: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200aab0: 81 c7 e0 08 ret 200aab4: 81 e8 00 00 restore =============================================================================== 0200b410 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200b410: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200b414: 39 00 80 80 sethi %hi(0x2020000), %i4 200b418: fa 07 21 b8 ld [ %i4 + 0x1b8 ], %i5 ! 20201b8 <_User_extensions_List> 200b41c: b8 17 21 b8 or %i4, 0x1b8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b420: b8 07 20 04 add %i4, 4, %i4 200b424: 80 a7 40 1c cmp %i5, %i4 200b428: 02 80 00 0d be 200b45c <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200b42c: 37 00 80 81 sethi %hi(0x2020400), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 200b430: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200b434: 80 a0 60 00 cmp %g1, 0 200b438: 02 80 00 05 be 200b44c <_User_extensions_Thread_restart+0x3c> 200b43c: 84 16 e1 10 or %i3, 0x110, %g2 (*the_extension->Callouts.thread_restart)( 200b440: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b444: 9f c0 40 00 call %g1 200b448: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b44c: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b450: 80 a7 40 1c cmp %i5, %i4 200b454: 32 bf ff f8 bne,a 200b434 <_User_extensions_Thread_restart+0x24> 200b458: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200b45c: 81 c7 e0 08 ret 200b460: 81 e8 00 00 restore =============================================================================== 0200abd0 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200abd0: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200abd4: 39 00 80 7d sethi %hi(0x201f400), %i4 200abd8: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201f6a8 <_User_extensions_List> 200abdc: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200abe0: b8 07 20 04 add %i4, 4, %i4 200abe4: 80 a7 40 1c cmp %i5, %i4 200abe8: 02 80 00 0d be 200ac1c <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200abec: 37 00 80 7e sethi %hi(0x201f800), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 200abf0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200abf4: 80 a0 60 00 cmp %g1, 0 200abf8: 02 80 00 05 be 200ac0c <_User_extensions_Thread_start+0x3c> 200abfc: 84 16 e2 00 or %i3, 0x200, %g2 (*the_extension->Callouts.thread_start)( 200ac00: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200ac04: 9f c0 40 00 call %g1 200ac08: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200ac0c: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200ac10: 80 a7 40 1c cmp %i5, %i4 200ac14: 32 bf ff f8 bne,a 200abf4 <_User_extensions_Thread_start+0x24> 200ac18: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200ac1c: 81 c7 e0 08 ret 200ac20: 81 e8 00 00 restore =============================================================================== 0200ac24 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200ac24: 9d e3 bf a0 save %sp, -96, %sp 200ac28: 39 00 80 7d sethi %hi(0x201f400), %i4 200ac2c: fa 07 20 c4 ld [ %i4 + 0xc4 ], %i5 ! 201f4c4 <_User_extensions_Switches_list> 200ac30: b8 17 20 c4 or %i4, 0xc4, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200ac34: b8 07 20 04 add %i4, 4, %i4 200ac38: 80 a7 40 1c cmp %i5, %i4 200ac3c: 02 80 00 0a be 200ac64 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200ac40: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 200ac44: c2 07 60 08 ld [ %i5 + 8 ], %g1 200ac48: 90 10 00 18 mov %i0, %o0 200ac4c: 9f c0 40 00 call %g1 200ac50: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 200ac54: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200ac58: 80 a7 40 1c cmp %i5, %i4 200ac5c: 32 bf ff fb bne,a 200ac48 <_User_extensions_Thread_switch+0x24> 200ac60: c2 07 60 08 ld [ %i5 + 8 ], %g1 200ac64: 81 c7 e0 08 ret 200ac68: 81 e8 00 00 restore =============================================================================== 0200c66c <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200c66c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200c670: 7f ff db 0e call 20032a8 200c674: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c678: c2 06 00 00 ld [ %i0 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200c67c: b6 06 20 04 add %i0, 4, %i3 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200c680: 80 a0 40 1b cmp %g1, %i3 200c684: 02 80 00 1e be 200c6fc <_Watchdog_Adjust+0x90> 200c688: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200c68c: 12 80 00 1e bne 200c704 <_Watchdog_Adjust+0x98> 200c690: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200c694: 80 a6 a0 00 cmp %i2, 0 200c698: 02 80 00 19 be 200c6fc <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200c69c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200c6a0: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200c6a4: 80 a6 80 1c cmp %i2, %i4 200c6a8: 1a 80 00 0a bcc 200c6d0 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200c6ac: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200c6b0: 10 80 00 1c b 200c720 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200c6b4: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200c6b8: 02 80 00 11 be 200c6fc <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200c6bc: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200c6c0: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200c6c4: 80 a7 00 1a cmp %i4, %i2 200c6c8: 38 80 00 16 bgu,a 200c720 <_Watchdog_Adjust+0xb4> 200c6cc: b8 27 00 1a sub %i4, %i2, %i4 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200c6d0: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200c6d4: 7f ff da f9 call 20032b8 200c6d8: 01 00 00 00 nop _Watchdog_Tickle( header ); 200c6dc: 40 00 00 ab call 200c988 <_Watchdog_Tickle> 200c6e0: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200c6e4: 7f ff da f1 call 20032a8 200c6e8: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c6ec: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200c6f0: 80 a6 c0 01 cmp %i3, %g1 200c6f4: 32 bf ff f1 bne,a 200c6b8 <_Watchdog_Adjust+0x4c> 200c6f8: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200c6fc: 7f ff da ef call 20032b8 200c700: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200c704: 12 bf ff fe bne 200c6fc <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200c708: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200c70c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200c710: b4 00 80 1a add %g2, %i2, %i2 200c714: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200c718: 7f ff da e8 call 20032b8 200c71c: 91 e8 00 08 restore %g0, %o0, %o0 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; 200c720: 10 bf ff f7 b 200c6fc <_Watchdog_Adjust+0x90> 200c724: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200adf4 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200adf4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200adf8: 7f ff dd d9 call 200255c 200adfc: 01 00 00 00 nop previous_state = the_watchdog->state; 200ae00: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200ae04: 80 a7 60 01 cmp %i5, 1 200ae08: 02 80 00 2a be 200aeb0 <_Watchdog_Remove+0xbc> 200ae0c: 03 00 80 7d sethi %hi(0x201f400), %g1 200ae10: 1a 80 00 09 bcc 200ae34 <_Watchdog_Remove+0x40> 200ae14: 80 a7 60 03 cmp %i5, 3 _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200ae18: 03 00 80 7d sethi %hi(0x201f400), %g1 200ae1c: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 ! 201f5d0 <_Watchdog_Ticks_since_boot> 200ae20: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200ae24: 7f ff dd d2 call 200256c 200ae28: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200ae2c: 81 c7 e0 08 ret 200ae30: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200ae34: 18 bf ff fa bgu 200ae1c <_Watchdog_Remove+0x28> <== NEVER TAKEN 200ae38: 03 00 80 7d sethi %hi(0x201f400), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200ae3c: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200ae40: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200ae44: c4 00 40 00 ld [ %g1 ], %g2 200ae48: 80 a0 a0 00 cmp %g2, 0 200ae4c: 02 80 00 07 be 200ae68 <_Watchdog_Remove+0x74> 200ae50: 05 00 80 7d sethi %hi(0x201f400), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200ae54: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200ae58: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200ae5c: 84 00 c0 02 add %g3, %g2, %g2 200ae60: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200ae64: 05 00 80 7d sethi %hi(0x201f400), %g2 200ae68: c4 00 a1 cc ld [ %g2 + 0x1cc ], %g2 ! 201f5cc <_Watchdog_Sync_count> 200ae6c: 80 a0 a0 00 cmp %g2, 0 200ae70: 22 80 00 07 be,a 200ae8c <_Watchdog_Remove+0x98> 200ae74: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200ae78: 05 00 80 7e sethi %hi(0x201f800), %g2 200ae7c: c6 00 a2 08 ld [ %g2 + 0x208 ], %g3 ! 201fa08 <_Per_CPU_Information+0x8> 200ae80: 05 00 80 7d sethi %hi(0x201f400), %g2 200ae84: c6 20 a1 6c st %g3, [ %g2 + 0x16c ] ! 201f56c <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200ae88: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200ae8c: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200ae90: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200ae94: 03 00 80 7d sethi %hi(0x201f400), %g1 200ae98: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 ! 201f5d0 <_Watchdog_Ticks_since_boot> 200ae9c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200aea0: 7f ff dd b3 call 200256c 200aea4: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200aea8: 81 c7 e0 08 ret 200aeac: 81 e8 00 00 restore _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200aeb0: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 /* * It is not actually on the chain so just change the state and * the Insert operation we interrupted will be aborted. */ the_watchdog->state = WATCHDOG_INACTIVE; 200aeb4: c0 26 20 08 clr [ %i0 + 8 ] _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200aeb8: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200aebc: 7f ff dd ac call 200256c 200aec0: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200aec4: 81 c7 e0 08 ret 200aec8: 81 e8 00 00 restore =============================================================================== 0200c00c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200c00c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200c010: 7f ff db 87 call 2002e2c 200c014: 01 00 00 00 nop 200c018: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200c01c: 11 00 80 7c sethi %hi(0x201f000), %o0 200c020: 94 10 00 19 mov %i1, %o2 200c024: 92 10 00 18 mov %i0, %o1 200c028: 7f ff e3 22 call 2004cb0 200c02c: 90 12 23 80 or %o0, 0x380, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c030: f8 06 40 00 ld [ %i1 ], %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200c034: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200c038: 80 a7 00 19 cmp %i4, %i1 200c03c: 02 80 00 0f be 200c078 <_Watchdog_Report_chain+0x6c> 200c040: 11 00 80 7c sethi %hi(0x201f000), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200c044: 92 10 00 1c mov %i4, %o1 200c048: 40 00 00 0f call 200c084 <_Watchdog_Report> 200c04c: 90 10 20 00 clr %o0 _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; node != _Chain_Tail(header) ; node = node->next ) 200c050: f8 07 00 00 ld [ %i4 ], %i4 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200c054: 80 a7 00 19 cmp %i4, %i1 200c058: 12 bf ff fc bne 200c048 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200c05c: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200c060: 11 00 80 7c sethi %hi(0x201f000), %o0 200c064: 92 10 00 18 mov %i0, %o1 200c068: 7f ff e3 12 call 2004cb0 200c06c: 90 12 23 98 or %o0, 0x398, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200c070: 7f ff db 73 call 2002e3c 200c074: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200c078: 7f ff e3 0e call 2004cb0 200c07c: 90 12 23 a8 or %o0, 0x3a8, %o0 200c080: 30 bf ff fc b,a 200c070 <_Watchdog_Report_chain+0x64> =============================================================================== 0200af74 <_Workspace_Handler_initialization>: /* * _Workspace_Handler_initialization */ void _Workspace_Handler_initialization(void) { 200af74: 9d e3 bf a0 save %sp, -96, %sp uintptr_t memory_available = 0; void *starting_address = rtems_configuration_get_work_space_start(); 200af78: 05 00 80 79 sethi %hi(0x201e400), %g2 200af7c: 82 10 a3 5c or %g2, 0x35c, %g1 ! 201e75c uintptr_t size = rtems_configuration_get_work_space_size(); 200af80: c6 08 60 2e ldub [ %g1 + 0x2e ], %g3 * _Workspace_Handler_initialization */ void _Workspace_Handler_initialization(void) { uintptr_t memory_available = 0; void *starting_address = rtems_configuration_get_work_space_start(); 200af84: f8 00 a3 5c ld [ %g2 + 0x35c ], %i4 uintptr_t size = rtems_configuration_get_work_space_size(); 200af88: fa 00 60 04 ld [ %g1 + 4 ], %i5 200af8c: 80 a0 e0 00 cmp %g3, 0 200af90: 12 80 00 03 bne 200af9c <_Workspace_Handler_initialization+0x28><== NEVER TAKEN 200af94: 84 10 20 00 clr %g2 200af98: c4 00 60 08 ld [ %g1 + 8 ], %g2 if ( rtems_configuration_get_do_zero_of_workspace() ) 200af9c: c2 08 60 2c ldub [ %g1 + 0x2c ], %g1 200afa0: 80 a0 60 00 cmp %g1, 0 200afa4: 12 80 00 0d bne 200afd8 <_Workspace_Handler_initialization+0x64> 200afa8: ba 00 80 1d add %g2, %i5, %i5 memset( starting_address, 0, size ); memory_available = _Heap_Initialize( 200afac: 92 10 00 1c mov %i4, %o1 200afb0: 11 00 80 7d sethi %hi(0x201f400), %o0 200afb4: 94 10 00 1d mov %i5, %o2 200afb8: 90 12 20 e0 or %o0, 0xe0, %o0 200afbc: 7f ff f5 6b call 2008568 <_Heap_Initialize> 200afc0: 96 10 20 08 mov 8, %o3 starting_address, size, CPU_HEAP_ALIGNMENT ); if ( memory_available == 0 ) 200afc4: 80 a2 20 00 cmp %o0, 0 200afc8: 02 80 00 0a be 200aff0 <_Workspace_Handler_initialization+0x7c> 200afcc: 92 10 20 01 mov 1, %o1 200afd0: 81 c7 e0 08 ret 200afd4: 81 e8 00 00 restore uintptr_t memory_available = 0; void *starting_address = rtems_configuration_get_work_space_start(); uintptr_t size = rtems_configuration_get_work_space_size(); if ( rtems_configuration_get_do_zero_of_workspace() ) memset( starting_address, 0, size ); 200afd8: 90 10 00 1c mov %i4, %o0 200afdc: 92 10 20 00 clr %o1 200afe0: 40 00 1c 14 call 2012030 200afe4: 94 10 00 1d mov %i5, %o2 memory_available = _Heap_Initialize( 200afe8: 10 bf ff f2 b 200afb0 <_Workspace_Handler_initialization+0x3c> 200afec: 92 10 00 1c mov %i4, %o1 size, CPU_HEAP_ALIGNMENT ); if ( memory_available == 0 ) _Internal_error_Occurred( 200aff0: 7f ff f6 07 call 200880c <_Internal_error_Occurred> 200aff4: 94 10 20 02 mov 2, %o2 =============================================================================== 020070cc : int adjtime( struct timeval *delta, struct timeval *olddelta ) { 20070cc: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 20070d0: ba 96 20 00 orcc %i0, 0, %i5 20070d4: 02 80 00 89 be 20072f8 20070d8: 03 00 03 d0 sethi %hi(0xf4000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 20070dc: c4 07 60 04 ld [ %i5 + 4 ], %g2 20070e0: 82 10 62 3f or %g1, 0x23f, %g1 20070e4: 80 a0 80 01 cmp %g2, %g1 20070e8: 18 80 00 84 bgu 20072f8 20070ec: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 20070f0: 22 80 00 06 be,a 2007108 20070f4: c2 07 40 00 ld [ %i5 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 20070f8: c0 26 60 04 clr [ %i1 + 4 ] 20070fc: c4 07 60 04 ld [ %i5 + 4 ], %g2 if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { olddelta->tv_sec = 0; 2007100: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007104: c2 07 40 00 ld [ %i5 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007108: 07 00 80 84 sethi %hi(0x2021000), %g3 200710c: c8 00 e3 3c ld [ %g3 + 0x33c ], %g4 ! 202133c olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007110: b5 28 60 08 sll %g1, 8, %i2 2007114: 87 28 60 03 sll %g1, 3, %g3 2007118: 86 26 80 03 sub %i2, %g3, %g3 200711c: b5 28 e0 06 sll %g3, 6, %i2 2007120: 86 26 80 03 sub %i2, %g3, %g3 2007124: 82 00 c0 01 add %g3, %g1, %g1 2007128: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 200712c: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007130: 80 a0 80 04 cmp %g2, %g4 2007134: 0a 80 00 6f bcs 20072f0 2007138: b0 10 20 00 clr %i0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200713c: 03 00 80 88 sethi %hi(0x2022000), %g1 2007140: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 20221c0 <_Thread_Dispatch_disable_level> 2007144: 84 00 a0 01 inc %g2 2007148: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 200714c: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007150: 40 00 07 12 call 2008d98 <_TOD_Get_as_timestamp> 2007154: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007158: f4 1f bf f8 ldd [ %fp + -8 ], %i2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 200715c: 94 10 20 00 clr %o2 2007160: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007164: 90 10 00 1a mov %i2, %o0 2007168: 96 12 e2 00 or %o3, 0x200, %o3 200716c: 40 00 58 34 call 201d23c <__divdi3> 2007170: 92 10 00 1b mov %i3, %o1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2007174: e0 07 40 00 ld [ %i5 ], %l0 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007178: 94 10 20 00 clr %o2 200717c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007180: a0 04 00 09 add %l0, %o1, %l0 2007184: 96 12 e2 00 or %o3, 0x200, %o3 2007188: 90 10 00 1a mov %i2, %o0 200718c: 40 00 59 12 call 201d5d4 <__moddi3> 2007190: 92 10 00 1b mov %i3, %o1 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007194: c2 07 60 04 ld [ %i5 + 4 ], %g1 2007198: 87 28 60 07 sll %g1, 7, %g3 200719c: 85 28 60 02 sll %g1, 2, %g2 20071a0: 84 20 c0 02 sub %g3, %g2, %g2 20071a4: 82 00 80 01 add %g2, %g1, %g1 20071a8: 83 28 60 03 sll %g1, 3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20071ac: 05 0e e6 b2 sethi %hi(0x3b9ac800), %g2 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20071b0: 92 02 40 01 add %o1, %g1, %o1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20071b4: 84 10 a1 ff or %g2, 0x1ff, %g2 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 20071b8: 07 31 19 4d sethi %hi(0xc4653400), %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20071bc: 82 10 00 09 mov %o1, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20071c0: 80 a2 40 02 cmp %o1, %g2 20071c4: 08 80 00 07 bleu 20071e0 20071c8: 86 10 e2 00 or %g3, 0x200, %g3 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 20071cc: 92 02 40 03 add %o1, %g3, %o1 ts.tv_sec++; 20071d0: a0 04 20 01 inc %l0 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20071d4: 80 a2 40 02 cmp %o1, %g2 20071d8: 18 bf ff fd bgu 20071cc <== NEVER TAKEN 20071dc: 82 10 00 09 mov %o1, %g1 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 20071e0: 07 31 19 4d sethi %hi(0xc4653400), %g3 20071e4: 86 10 e2 00 or %g3, 0x200, %g3 ! c4653600 20071e8: 80 a2 40 03 cmp %o1, %g3 20071ec: 18 80 00 08 bgu 200720c <== NEVER TAKEN 20071f0: 05 0e e6 b2 sethi %hi(0x3b9ac800), %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 20071f4: 84 10 a2 00 or %g2, 0x200, %g2 ! 3b9aca00 20071f8: 92 02 40 02 add %o1, %g2, %o1 ts.tv_sec--; 20071fc: a0 04 3f ff add %l0, -1, %l0 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007200: 80 a2 40 03 cmp %o1, %g3 2007204: 08 bf ff fd bleu 20071f8 2007208: 82 10 00 09 mov %o1, %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 200720c: 99 3c 20 1f sra %l0, 0x1f, %o4 2007210: ae 10 00 01 mov %g1, %l7 2007214: ad 38 60 1f sra %g1, 0x1f, %l6 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2007218: 83 2b 20 03 sll %o4, 3, %g1 200721c: b7 2c 20 03 sll %l0, 3, %i3 2007220: 89 34 20 1d srl %l0, 0x1d, %g4 2007224: b4 11 00 01 or %g4, %g1, %i2 2007228: 83 36 e0 1b srl %i3, 0x1b, %g1 200722c: 85 2e a0 05 sll %i2, 5, %g2 2007230: 87 2e e0 05 sll %i3, 5, %g3 2007234: 84 10 40 02 or %g1, %g2, %g2 2007238: 86 a0 c0 1b subcc %g3, %i3, %g3 200723c: 83 30 e0 1a srl %g3, 0x1a, %g1 2007240: 84 60 80 1a subx %g2, %i2, %g2 2007244: 97 28 e0 06 sll %g3, 6, %o3 2007248: 95 28 a0 06 sll %g2, 6, %o2 200724c: 86 a2 c0 03 subcc %o3, %g3, %g3 2007250: 94 10 40 0a or %g1, %o2, %o2 2007254: 84 62 80 02 subx %o2, %g2, %g2 2007258: 86 80 c0 10 addcc %g3, %l0, %g3 200725c: 83 30 e0 1e srl %g3, 0x1e, %g1 2007260: 84 40 80 0c addx %g2, %o4, %g2 2007264: a3 28 e0 02 sll %g3, 2, %l1 2007268: a1 28 a0 02 sll %g2, 2, %l0 200726c: 86 80 c0 11 addcc %g3, %l1, %g3 2007270: a0 10 40 10 or %g1, %l0, %l0 2007274: 83 30 e0 1e srl %g3, 0x1e, %g1 2007278: 84 40 80 10 addx %g2, %l0, %g2 200727c: a7 28 e0 02 sll %g3, 2, %l3 2007280: a5 28 a0 02 sll %g2, 2, %l2 2007284: 86 80 c0 13 addcc %g3, %l3, %g3 2007288: a4 10 40 12 or %g1, %l2, %l2 200728c: ab 28 e0 02 sll %g3, 2, %l5 2007290: 84 40 80 12 addx %g2, %l2, %g2 2007294: 83 30 e0 1e srl %g3, 0x1e, %g1 2007298: a9 28 a0 02 sll %g2, 2, %l4 200729c: 86 80 c0 15 addcc %g3, %l5, %g3 20072a0: a8 10 40 14 or %g1, %l4, %l4 20072a4: 84 40 80 14 addx %g2, %l4, %g2 20072a8: 83 28 e0 09 sll %g3, 9, %g1 20072ac: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 20072b0: 90 07 bf f8 add %fp, -8, %o0 20072b4: b5 30 e0 17 srl %g3, 0x17, %i2 20072b8: 86 85 c0 01 addcc %l7, %g1, %g3 20072bc: 84 16 80 04 or %i2, %g4, %g2 20072c0: 84 45 80 02 addx %l6, %g2, %g2 20072c4: 40 00 06 d2 call 2008e0c <_TOD_Set_with_timestamp> 20072c8: c4 3f bf f8 std %g2, [ %fp + -8 ] ts.tv_sec--; } _TOD_Set( &ts ); _Thread_Enable_dispatch(); 20072cc: 40 00 0d 9e call 200a944 <_Thread_Enable_dispatch> 20072d0: b0 10 20 00 clr %i0 /* set the user's output */ if ( olddelta ) 20072d4: 80 a6 60 00 cmp %i1, 0 20072d8: 02 80 00 0c be 2007308 20072dc: 01 00 00 00 nop *olddelta = *delta; 20072e0: c2 07 40 00 ld [ %i5 ], %g1 20072e4: c2 26 40 00 st %g1, [ %i1 ] 20072e8: c2 07 60 04 ld [ %i5 + 4 ], %g1 20072ec: c2 26 60 04 st %g1, [ %i1 + 4 ] return 0; } 20072f0: 81 c7 e0 08 ret 20072f4: 81 e8 00 00 restore */ if ( !delta ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); 20072f8: 40 00 2b d5 call 201224c <__errno> 20072fc: b0 10 3f ff mov -1, %i0 2007300: 82 10 20 16 mov 0x16, %g1 2007304: c2 22 00 00 st %g1, [ %o0 ] 2007308: 81 c7 e0 08 ret 200730c: 81 e8 00 00 restore =============================================================================== 020074b0 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 20074b0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 20074b4: 3b 00 80 86 sethi %hi(0x2021800), %i5 20074b8: 40 00 04 f6 call 2008890 20074bc: 90 17 63 4c or %i5, 0x34c, %o0 ! 2021b4c if (fcntl (fildes, F_GETFD) < 0) { 20074c0: 90 10 00 18 mov %i0, %o0 20074c4: 40 00 20 a0 call 200f744 20074c8: 92 10 20 01 mov 1, %o1 20074cc: 80 a2 20 00 cmp %o0, 0 20074d0: 06 80 00 6c bl 2007680 20074d4: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EBADF); } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 20074d8: 02 80 00 3b be 20075c4 20074dc: 92 10 00 18 mov %i0, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 20074e0: f8 06 40 00 ld [ %i1 ], %i4 20074e4: 80 a7 00 18 cmp %i4, %i0 20074e8: 12 80 00 2f bne 20075a4 20074ec: 90 17 63 4c or %i5, 0x34c, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 20074f0: 92 10 00 1c mov %i4, %o1 20074f4: 11 00 80 86 sethi %hi(0x2021800), %o0 20074f8: 94 10 20 00 clr %o2 20074fc: 40 00 01 77 call 2007ad8 2007500: 90 12 23 94 or %o0, 0x394, %o0 if (r_chain == NULL) { 2007504: b0 92 20 00 orcc %o0, 0, %i0 2007508: 22 80 00 0f be,a 2007544 200750c: ba 17 63 4c or %i5, 0x34c, %i5 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007510: b8 06 20 1c add %i0, 0x1c, %i4 2007514: 40 00 04 df call 2008890 2007518: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 200751c: 92 10 00 19 mov %i1, %o1 2007520: 40 00 01 f4 call 2007cf0 2007524: 90 06 20 08 add %i0, 8, %o0 2007528: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 200752c: 40 00 04 f9 call 2008910 2007530: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007534: 40 00 04 f7 call 2008910 2007538: 90 17 63 4c or %i5, 0x34c, %o0 return result; } return AIO_ALLDONE; } 200753c: 81 c7 e0 08 ret 2007540: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007544: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2007548: 82 07 60 58 add %i5, 0x58, %g1 200754c: 80 a0 80 01 cmp %g2, %g1 2007550: 02 80 00 0f be 200758c <== NEVER TAKEN 2007554: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007558: 92 10 00 1c mov %i4, %o1 200755c: 40 00 01 5f call 2007ad8 2007560: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007564: 80 a2 20 00 cmp %o0, 0 2007568: 02 80 00 0e be 20075a0 200756c: 92 10 00 19 mov %i1, %o1 rtems_set_errno_and_return_minus_one (EINVAL); } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007570: 40 00 01 e0 call 2007cf0 2007574: 90 02 20 08 add %o0, 8, %o0 2007578: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 200757c: 40 00 04 e5 call 2008910 2007580: 90 10 00 1d mov %i5, %o0 return result; 2007584: 81 c7 e0 08 ret 2007588: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 200758c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2007590: 40 00 04 e0 call 2008910 2007594: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2007598: 81 c7 e0 08 ret 200759c: 81 e8 00 00 restore r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock (&aio_request_queue.mutex); 20075a0: 90 10 00 1d mov %i5, %o0 20075a4: 40 00 04 db call 2008910 20075a8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 20075ac: 40 00 31 56 call 2013b04 <__errno> 20075b0: 01 00 00 00 nop 20075b4: 82 10 20 16 mov 0x16, %g1 ! 16 20075b8: c2 22 00 00 st %g1, [ %o0 ] 20075bc: 81 c7 e0 08 ret 20075c0: 81 e8 00 00 restore /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { AIO_printf ("Cancel all requests\n"); r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 20075c4: 11 00 80 86 sethi %hi(0x2021800), %o0 20075c8: 94 10 20 00 clr %o2 20075cc: 40 00 01 43 call 2007ad8 20075d0: 90 12 23 94 or %o0, 0x394, %o0 if (r_chain == NULL) { 20075d4: b8 92 20 00 orcc %o0, 0, %i4 20075d8: 02 80 00 0f be 2007614 20075dc: b2 07 20 1c add %i4, 0x1c, %i1 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 20075e0: 40 00 04 ac call 2008890 20075e4: 90 10 00 19 mov %i1, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20075e8: 40 00 0b 8b call 200a414 <_Chain_Extract> 20075ec: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 20075f0: 40 00 01 ac call 2007ca0 20075f4: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 20075f8: 40 00 04 c6 call 2008910 20075fc: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007600: 90 17 63 4c or %i5, 0x34c, %o0 2007604: 40 00 04 c3 call 2008910 2007608: b0 10 20 00 clr %i0 return AIO_CANCELED; 200760c: 81 c7 e0 08 ret 2007610: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2007614: ba 17 63 4c or %i5, 0x34c, %i5 r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007618: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200761c: 82 07 60 58 add %i5, 0x58, %g1 2007620: 80 a0 80 01 cmp %g2, %g1 2007624: 02 bf ff da be 200758c <== NEVER TAKEN 2007628: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200762c: 92 10 00 18 mov %i0, %o1 2007630: 40 00 01 2a call 2007ad8 2007634: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007638: b8 92 20 00 orcc %o0, 0, %i4 200763c: 22 bf ff d5 be,a 2007590 2007640: 90 10 00 1d mov %i5, %o0 2007644: 40 00 0b 74 call 200a414 <_Chain_Extract> 2007648: b2 07 20 1c add %i4, 0x1c, %i1 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 200764c: 40 00 01 95 call 2007ca0 2007650: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2007654: 40 00 03 e4 call 20085e4 2007658: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 200765c: 40 00 03 03 call 2008268 2007660: 90 10 00 19 mov %i1, %o0 free (r_chain); 2007664: 7f ff f0 8c call 2003894 2007668: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 200766c: b0 10 20 00 clr %i0 rtems_aio_remove_fd (r_chain); pthread_mutex_destroy (&r_chain->mutex); pthread_cond_destroy (&r_chain->mutex); free (r_chain); pthread_mutex_unlock (&aio_request_queue.mutex); 2007670: 40 00 04 a8 call 2008910 2007674: 90 10 00 1d mov %i5, %o0 return AIO_CANCELED; 2007678: 81 c7 e0 08 ret 200767c: 81 e8 00 00 restore int result; pthread_mutex_lock (&aio_request_queue.mutex); if (fcntl (fildes, F_GETFD) < 0) { pthread_mutex_unlock(&aio_request_queue.mutex); 2007680: 40 00 04 a4 call 2008910 2007684: 90 17 63 4c or %i5, 0x34c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2007688: 40 00 31 1f call 2013b04 <__errno> 200768c: b0 10 3f ff mov -1, %i0 2007690: 82 10 20 09 mov 9, %g1 2007694: c2 22 00 00 st %g1, [ %o0 ] 2007698: 81 c7 e0 08 ret 200769c: 81 e8 00 00 restore =============================================================================== 020076a8 : int aio_fsync( int op, struct aiocb *aiocbp ) { 20076a8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 20076ac: 03 00 00 08 sethi %hi(0x2000), %g1 20076b0: 80 a6 00 01 cmp %i0, %g1 20076b4: 12 80 00 14 bne 2007704 20076b8: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20076bc: d0 06 40 00 ld [ %i1 ], %o0 20076c0: 40 00 20 21 call 200f744 20076c4: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20076c8: 90 0a 20 03 and %o0, 3, %o0 20076cc: 90 02 3f ff add %o0, -1, %o0 20076d0: 80 a2 20 01 cmp %o0, 1 20076d4: 18 80 00 0c bgu 2007704 20076d8: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20076dc: 7f ff f2 4a call 2004004 20076e0: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20076e4: 80 a2 20 00 cmp %o0, 0 20076e8: 02 80 00 06 be 2007700 <== NEVER TAKEN 20076ec: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20076f0: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 20076f4: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 20076f8: 40 00 01 9a call 2007d60 20076fc: 91 e8 00 08 restore %g0, %o0, %o0 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007700: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2007704: 82 10 3f ff mov -1, %g1 2007708: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 200770c: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2007710: 40 00 30 fd call 2013b04 <__errno> 2007714: b0 10 3f ff mov -1, %i0 2007718: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 200771c: 81 c7 e0 08 ret 2007720: 81 e8 00 00 restore =============================================================================== 0200805c : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 200805c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008060: d0 06 00 00 ld [ %i0 ], %o0 2008064: 40 00 1d b8 call 200f744 2008068: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 200806c: 90 0a 20 03 and %o0, 3, %o0 2008070: 80 a2 20 02 cmp %o0, 2 2008074: 12 80 00 1b bne 20080e0 2008078: 80 a2 20 00 cmp %o0, 0 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 200807c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008080: 80 a0 60 00 cmp %g1, 0 2008084: 12 80 00 0f bne 20080c0 2008088: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 200808c: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008090: 80 a0 60 00 cmp %g1, 0 2008094: 06 80 00 0c bl 20080c4 2008098: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 200809c: 7f ff ef da call 2004004 20080a0: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20080a4: 80 a2 20 00 cmp %o0, 0 20080a8: 02 80 00 12 be 20080f0 <== NEVER TAKEN 20080ac: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20080b0: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 20080b4: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20080b8: 7f ff ff 2a call 2007d60 20080bc: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20080c0: 82 10 3f ff mov -1, %g1 20080c4: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 20080c8: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 20080cc: 40 00 2e 8e call 2013b04 <__errno> 20080d0: b0 10 3f ff mov -1, %i0 20080d4: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 20080d8: 81 c7 e0 08 ret 20080dc: 81 e8 00 00 restore { rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20080e0: 02 bf ff e7 be 200807c <== NEVER TAKEN 20080e4: ba 10 20 09 mov 9, %i5 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20080e8: 10 bf ff f7 b 20080c4 20080ec: 82 10 3f ff mov -1, %g1 20080f0: 10 bf ff f4 b 20080c0 <== NOT EXECUTED 20080f4: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 02008100 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2008100: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008104: d0 06 00 00 ld [ %i0 ], %o0 2008108: 40 00 1d 8f call 200f744 200810c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2008110: 90 0a 20 03 and %o0, 3, %o0 2008114: 90 02 3f ff add %o0, -1, %o0 2008118: 80 a2 20 01 cmp %o0, 1 200811c: 18 80 00 14 bgu 200816c 2008120: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2008124: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008128: 80 a0 60 00 cmp %g1, 0 200812c: 12 80 00 10 bne 200816c 2008130: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2008134: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008138: 80 a0 60 00 cmp %g1, 0 200813c: 06 80 00 0d bl 2008170 2008140: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2008144: 7f ff ef b0 call 2004004 2008148: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 200814c: 80 a2 20 00 cmp %o0, 0 2008150: 02 80 00 06 be 2008168 <== NEVER TAKEN 2008154: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2008158: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 200815c: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2008160: 7f ff ff 00 call 2007d60 2008164: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2008168: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 200816c: 82 10 3f ff mov -1, %g1 2008170: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2008174: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2008178: 40 00 2e 63 call 2013b04 <__errno> 200817c: b0 10 3f ff mov -1, %i0 2008180: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2008184: 81 c7 e0 08 ret 2008188: 81 e8 00 00 restore =============================================================================== 02006f34 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2006f34: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2006f38: 80 a6 60 00 cmp %i1, 0 2006f3c: 02 80 00 2f be 2006ff8 2006f40: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2006f44: 02 80 00 19 be 2006fa8 2006f48: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2006f4c: 02 80 00 12 be 2006f94 <== NEVER TAKEN 2006f50: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 2006f54: 02 80 00 10 be 2006f94 2006f58: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2006f5c: 02 80 00 08 be 2006f7c 2006f60: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2006f64: 40 00 2e 1c call 20127d4 <__errno> 2006f68: b0 10 3f ff mov -1, %i0 ! ffffffff 2006f6c: 82 10 20 16 mov 0x16, %g1 2006f70: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2006f74: 81 c7 e0 08 ret 2006f78: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 2006f7c: 40 00 2e 16 call 20127d4 <__errno> 2006f80: b0 10 3f ff mov -1, %i0 2006f84: 82 10 20 58 mov 0x58, %g1 2006f88: c2 22 00 00 st %g1, [ %o0 ] 2006f8c: 81 c7 e0 08 ret 2006f90: 81 e8 00 00 restore } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { _TOD_Get_uptime_as_timespec( tp ); 2006f94: 90 10 00 19 mov %i1, %o0 2006f98: 40 00 08 a2 call 2009220 <_TOD_Get_uptime_as_timespec> 2006f9c: b0 10 20 00 clr %i0 return 0; 2006fa0: 81 c7 e0 08 ret 2006fa4: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2006fa8: 40 00 08 8c call 20091d8 <_TOD_Get_as_timestamp> 2006fac: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2006fb0: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006fb4: 94 10 20 00 clr %o2 2006fb8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006fbc: 90 10 00 1c mov %i4, %o0 2006fc0: 96 12 e2 00 or %o3, 0x200, %o3 2006fc4: 40 00 5b ff call 201dfc0 <__divdi3> 2006fc8: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006fcc: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006fd0: d2 26 40 00 st %o1, [ %i1 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006fd4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006fd8: 90 10 00 1c mov %i4, %o0 2006fdc: 96 12 e2 00 or %o3, 0x200, %o3 2006fe0: 92 10 00 1d mov %i5, %o1 2006fe4: 40 00 5c dd call 201e358 <__moddi3> 2006fe8: b0 10 20 00 clr %i0 2006fec: d2 26 60 04 st %o1, [ %i1 + 4 ] if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); return 0; 2006ff0: 81 c7 e0 08 ret 2006ff4: 81 e8 00 00 restore clockid_t clock_id, struct timespec *tp ) { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006ff8: 40 00 2d f7 call 20127d4 <__errno> 2006ffc: b0 10 3f ff mov -1, %i0 2007000: 82 10 20 16 mov 0x16, %g1 2007004: c2 22 00 00 st %g1, [ %o0 ] 2007008: 81 c7 e0 08 ret 200700c: 81 e8 00 00 restore =============================================================================== 02007010 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2007010: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2007014: 80 a6 60 00 cmp %i1, 0 2007018: 02 80 00 54 be 2007168 <== NEVER TAKEN 200701c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2007020: 02 80 00 0c be 2007050 2007024: 80 a6 20 02 cmp %i0, 2 _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) 2007028: 02 80 00 4a be 2007150 200702c: 80 a6 20 03 cmp %i0, 3 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2007030: 02 80 00 48 be 2007150 2007034: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2007038: 40 00 2d e7 call 20127d4 <__errno> 200703c: b0 10 3f ff mov -1, %i0 ! ffffffff 2007040: 82 10 20 16 mov 0x16, %g1 2007044: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2007048: 81 c7 e0 08 ret 200704c: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2007050: c4 06 40 00 ld [ %i1 ], %g2 2007054: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2007058: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 200705c: 80 a0 80 01 cmp %g2, %g1 2007060: 08 80 00 42 bleu 2007168 2007064: 03 00 80 8a sethi %hi(0x2022800), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007068: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 2022a80 <_Thread_Dispatch_disable_level> 200706c: 84 00 a0 01 inc %g2 2007070: c4 20 62 80 st %g2, [ %g1 + 0x280 ] return _Thread_Dispatch_disable_level; 2007074: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2007078: d6 06 40 00 ld [ %i1 ], %o3 200707c: e6 06 60 04 ld [ %i1 + 4 ], %l3 2007080: 95 3a e0 1f sra %o3, 0x1f, %o2 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2007084: 83 2a a0 03 sll %o2, 3, %g1 2007088: 9b 2a e0 03 sll %o3, 3, %o5 200708c: 89 32 e0 1d srl %o3, 0x1d, %g4 2007090: 98 11 00 01 or %g4, %g1, %o4 2007094: 83 33 60 1b srl %o5, 0x1b, %g1 2007098: 85 2b 20 05 sll %o4, 5, %g2 200709c: 87 2b 60 05 sll %o5, 5, %g3 20070a0: 84 10 40 02 or %g1, %g2, %g2 20070a4: 86 a0 c0 0d subcc %g3, %o5, %g3 20070a8: 83 30 e0 1a srl %g3, 0x1a, %g1 20070ac: 84 60 80 0c subx %g2, %o4, %g2 20070b0: bb 28 e0 06 sll %g3, 6, %i5 20070b4: b9 28 a0 06 sll %g2, 6, %i4 20070b8: 86 a7 40 03 subcc %i5, %g3, %g3 20070bc: b8 10 40 1c or %g1, %i4, %i4 20070c0: 84 67 00 02 subx %i4, %g2, %g2 20070c4: 86 80 c0 0b addcc %g3, %o3, %g3 20070c8: 83 30 e0 1e srl %g3, 0x1e, %g1 20070cc: 84 40 80 0a addx %g2, %o2, %g2 20070d0: b7 28 e0 02 sll %g3, 2, %i3 20070d4: b5 28 a0 02 sll %g2, 2, %i2 20070d8: 86 80 c0 1b addcc %g3, %i3, %g3 20070dc: b4 10 40 1a or %g1, %i2, %i2 20070e0: 83 30 e0 1e srl %g3, 0x1e, %g1 20070e4: 84 40 80 1a addx %g2, %i2, %g2 20070e8: b3 28 e0 02 sll %g3, 2, %i1 20070ec: b1 28 a0 02 sll %g2, 2, %i0 20070f0: 86 80 c0 19 addcc %g3, %i1, %g3 20070f4: b0 10 40 18 or %g1, %i0, %i0 20070f8: a3 28 e0 02 sll %g3, 2, %l1 20070fc: 84 40 80 18 addx %g2, %i0, %g2 2007100: 83 30 e0 1e srl %g3, 0x1e, %g1 2007104: a1 28 a0 02 sll %g2, 2, %l0 2007108: 86 80 c0 11 addcc %g3, %l1, %g3 200710c: a0 10 40 10 or %g1, %l0, %l0 2007110: 84 40 80 10 addx %g2, %l0, %g2 2007114: 83 28 e0 09 sll %g3, 9, %g1 2007118: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 200711c: 90 07 bf f8 add %fp, -8, %o0 2007120: b9 30 e0 17 srl %g3, 0x17, %i4 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2007124: a5 3c e0 1f sra %l3, 0x1f, %l2 2007128: 86 84 c0 01 addcc %l3, %g1, %g3 200712c: 84 17 00 04 or %i4, %g4, %g2 2007130: 84 44 80 02 addx %l2, %g2, %g2 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 2007134: b0 10 20 00 clr %i0 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2007138: 40 00 08 59 call 200929c <_TOD_Set_with_timestamp> 200713c: c4 3f bf f8 std %g2, [ %fp + -8 ] if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); 2007140: 40 00 0f 25 call 200add4 <_Thread_Enable_dispatch> 2007144: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 2007148: 81 c7 e0 08 ret 200714c: 81 e8 00 00 restore else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 2007150: 40 00 2d a1 call 20127d4 <__errno> 2007154: b0 10 3f ff mov -1, %i0 2007158: 82 10 20 58 mov 0x58, %g1 200715c: c2 22 00 00 st %g1, [ %o0 ] 2007160: 81 c7 e0 08 ret 2007164: 81 e8 00 00 restore if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007168: 40 00 2d 9b call 20127d4 <__errno> 200716c: b0 10 3f ff mov -1, %i0 2007170: 82 10 20 16 mov 0x16, %g1 2007174: c2 22 00 00 st %g1, [ %o0 ] 2007178: 81 c7 e0 08 ret 200717c: 81 e8 00 00 restore =============================================================================== 0201bf60 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201bf60: 9d e3 bf 90 save %sp, -112, %sp POSIX_signals_Siginfo_node *psiginfo; /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) 201bf64: 7f ff ff 3a call 201bc4c 201bf68: 01 00 00 00 nop 201bf6c: 80 a2 00 18 cmp %o0, %i0 201bf70: 12 80 00 af bne 201c22c 201bf74: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201bf78: 02 80 00 b3 be 201c244 201bf7c: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201bf80: 80 a0 60 1f cmp %g1, 0x1f 201bf84: 18 80 00 b0 bgu 201c244 201bf88: b7 2e 60 02 sll %i1, 2, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 201bf8c: 39 00 80 7e sethi %hi(0x201f800), %i4 201bf90: a1 2e 60 04 sll %i1, 4, %l0 201bf94: b8 17 22 60 or %i4, 0x260, %i4 201bf98: 84 24 00 1b sub %l0, %i3, %g2 201bf9c: 84 07 00 02 add %i4, %g2, %g2 201bfa0: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201bfa4: 80 a0 a0 01 cmp %g2, 1 201bfa8: 02 80 00 3f be 201c0a4 201bfac: b0 10 20 00 clr %i0 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 201bfb0: 80 a6 60 04 cmp %i1, 4 201bfb4: 02 80 00 3e be 201c0ac 201bfb8: 80 a6 60 08 cmp %i1, 8 201bfbc: 02 80 00 3c be 201c0ac 201bfc0: 80 a6 60 0b cmp %i1, 0xb 201bfc4: 02 80 00 3a be 201c0ac 201bfc8: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201bfcc: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201bfd0: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201bfd4: 80 a6 a0 00 cmp %i2, 0 201bfd8: 02 80 00 3b be 201c0c4 201bfdc: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201bfe0: c2 06 80 00 ld [ %i2 ], %g1 201bfe4: c2 27 bf fc st %g1, [ %fp + -4 ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 201bfe8: 03 00 80 7d sethi %hi(0x201f400), %g1 201bfec: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201f4c0 <_Thread_Dispatch_disable_level> 201bff0: 84 00 a0 01 inc %g2 201bff4: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 201bff8: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 /* * Is the currently executing thread interested? If so then it will * get it an execute it as soon as the dispatcher executes. */ the_thread = _Thread_Executing; 201bffc: 03 00 80 7e sethi %hi(0x201f800), %g1 201c000: d0 00 62 0c ld [ %g1 + 0x20c ], %o0 ! 201fa0c <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201c004: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201c008: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201c00c: 80 af 40 01 andncc %i5, %g1, %g0 201c010: 12 80 00 16 bne 201c068 201c014: 07 00 80 7e sethi %hi(0x201f800), %g3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201c018: d0 00 e3 ec ld [ %g3 + 0x3ec ], %o0 ! 201fbec <_POSIX_signals_Wait_queue> 201c01c: 86 10 e3 ec or %g3, 0x3ec, %g3 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201c020: 86 00 e0 04 add %g3, 4, %g3 201c024: 80 a2 00 03 cmp %o0, %g3 201c028: 32 80 00 0d bne,a 201c05c 201c02c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201c030: 10 80 00 27 b 201c0cc 201c034: 03 00 80 79 sethi %hi(0x201e400), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201c038: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1 201c03c: 80 af 40 01 andncc %i5, %g1, %g0 201c040: 12 80 00 0b bne 201c06c 201c044: 92 10 00 19 mov %i1, %o1 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201c048: d0 02 00 00 ld [ %o0 ], %o0 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201c04c: 80 a2 00 03 cmp %o0, %g3 201c050: 02 80 00 1f be 201c0cc <== ALWAYS TAKEN 201c054: 03 00 80 79 sethi %hi(0x201e400), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201c058: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 201c05c: 80 8f 40 01 btst %i5, %g1 201c060: 02 bf ff f6 be 201c038 201c064: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201c068: 92 10 00 19 mov %i1, %o1 201c06c: 40 00 00 8d call 201c2a0 <_POSIX_signals_Unblock_thread> 201c070: 94 07 bf f4 add %fp, -12, %o2 201c074: 80 8a 20 ff btst 0xff, %o0 201c078: 12 80 00 5a bne 201c1e0 201c07c: 01 00 00 00 nop /* * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); 201c080: 40 00 00 7f call 201c27c <_POSIX_signals_Set_process_signals> 201c084: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201c088: b6 24 00 1b sub %l0, %i3, %i3 201c08c: c2 07 00 1b ld [ %i4 + %i3 ], %g1 201c090: 80 a0 60 02 cmp %g1, 2 201c094: 02 80 00 57 be 201c1f0 201c098: 11 00 80 7e sethi %hi(0x201f800), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 201c09c: 7f ff b7 62 call 2009e24 <_Thread_Enable_dispatch> 201c0a0: b0 10 20 00 clr %i0 return 0; } 201c0a4: 81 c7 e0 08 ret 201c0a8: 81 e8 00 00 restore * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) return pthread_kill( pthread_self(), sig ); 201c0ac: 40 00 01 0f call 201c4e8 201c0b0: 01 00 00 00 nop 201c0b4: 40 00 00 d2 call 201c3fc 201c0b8: 92 10 00 19 mov %i1, %o1 201c0bc: 81 c7 e0 08 ret 201c0c0: 91 e8 00 08 restore %g0, %o0, %o0 */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; if ( !value ) { siginfo->si_value.sival_int = 0; 201c0c4: 10 bf ff c9 b 201bfe8 201c0c8: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201c0cc: c8 08 63 a0 ldub [ %g1 + 0x3a0 ], %g4 201c0d0: 1b 00 80 7d sethi %hi(0x201f400), %o5 201c0d4: 88 01 20 01 inc %g4 201c0d8: 9a 13 60 30 or %o5, 0x30, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201c0dc: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201c0e0: 98 03 60 08 add %o5, 8, %o4 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 201c0e4: 15 04 00 00 sethi %hi(0x10000000), %o2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 201c0e8: c2 03 40 00 ld [ %o5 ], %g1 201c0ec: 80 a0 60 00 cmp %g1, 0 201c0f0: 22 80 00 31 be,a 201c1b4 <== NEVER TAKEN 201c0f4: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201c0f8: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201c0fc: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201c100: 80 a6 a0 00 cmp %i2, 0 201c104: 02 80 00 2b be 201c1b0 201c108: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 201c10c: 82 10 20 01 mov 1, %g1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201c110: 85 28 60 02 sll %g1, 2, %g2 maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { the_thread = (Thread_Control *) object_table[ index ]; 201c114: c4 06 00 02 ld [ %i0 + %g2 ], %g2 if ( !the_thread ) 201c118: 80 a0 a0 00 cmp %g2, 0 201c11c: 22 80 00 22 be,a 201c1a4 201c120: 82 00 60 01 inc %g1 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201c124: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 201c128: 80 a0 c0 04 cmp %g3, %g4 201c12c: 38 80 00 1e bgu,a 201c1a4 201c130: 82 00 60 01 inc %g1 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201c134: de 00 a1 5c ld [ %g2 + 0x15c ], %o7 201c138: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201c13c: 80 af 40 0f andncc %i5, %o7, %g0 201c140: 22 80 00 19 be,a 201c1a4 201c144: 82 00 60 01 inc %g1 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 201c148: 80 a0 c0 04 cmp %g3, %g4 201c14c: 2a 80 00 14 bcs,a 201c19c 201c150: 88 10 00 03 mov %g3, %g4 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201c154: 80 a2 20 00 cmp %o0, 0 201c158: 22 80 00 13 be,a 201c1a4 <== NEVER TAKEN 201c15c: 82 00 60 01 inc %g1 <== NOT EXECUTED 201c160: de 02 20 10 ld [ %o0 + 0x10 ], %o7 201c164: 80 a3 e0 00 cmp %o7, 0 201c168: 22 80 00 0f be,a 201c1a4 <== NEVER TAKEN 201c16c: 82 00 60 01 inc %g1 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201c170: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3 201c174: 80 a2 e0 00 cmp %o3, 0 201c178: 22 80 00 09 be,a 201c19c 201c17c: 88 10 00 03 mov %g3, %g4 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201c180: 80 8b c0 0a btst %o7, %o2 201c184: 32 80 00 08 bne,a 201c1a4 201c188: 82 00 60 01 inc %g1 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201c18c: 80 8a c0 0a btst %o3, %o2 201c190: 22 80 00 05 be,a 201c1a4 201c194: 82 00 60 01 inc %g1 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201c198: 88 10 00 03 mov %g3, %g4 201c19c: 90 10 00 02 mov %g2, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201c1a0: 82 00 60 01 inc %g1 201c1a4: 80 a6 80 01 cmp %i2, %g1 201c1a8: 1a bf ff db bcc 201c114 201c1ac: 85 28 60 02 sll %g1, 2, %g2 201c1b0: 9a 03 60 04 add %o5, 4, %o5 * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201c1b4: 80 a3 40 0c cmp %o5, %o4 201c1b8: 32 bf ff cd bne,a 201c0ec 201c1bc: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201c1c0: 80 a2 20 00 cmp %o0, 0 201c1c4: 02 bf ff af be 201c080 201c1c8: 92 10 00 19 mov %i1, %o1 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201c1cc: 40 00 00 35 call 201c2a0 <_POSIX_signals_Unblock_thread> 201c1d0: 94 07 bf f4 add %fp, -12, %o2 201c1d4: 80 8a 20 ff btst 0xff, %o0 201c1d8: 02 bf ff aa be 201c080 <== ALWAYS TAKEN 201c1dc: 01 00 00 00 nop _Thread_Enable_dispatch(); 201c1e0: 7f ff b7 11 call 2009e24 <_Thread_Enable_dispatch> 201c1e4: b0 10 20 00 clr %i0 ! 0 return 0; 201c1e8: 81 c7 e0 08 ret 201c1ec: 81 e8 00 00 restore */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 201c1f0: 7f ff ae f7 call 2007dcc <_Chain_Get> 201c1f4: 90 12 23 e0 or %o0, 0x3e0, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201c1f8: 92 92 20 00 orcc %o0, 0, %o1 201c1fc: 02 80 00 18 be 201c25c 201c200: c2 07 bf f4 ld [ %fp + -12 ], %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201c204: 11 00 80 7f sethi %hi(0x201fc00), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201c208: c2 22 60 08 st %g1, [ %o1 + 8 ] 201c20c: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201c210: 90 12 20 58 or %o0, 0x58, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201c214: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201c218: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201c21c: 90 02 00 1b add %o0, %i3, %o0 201c220: 7f ff ae d7 call 2007d7c <_Chain_Append> 201c224: c2 22 60 10 st %g1, [ %o1 + 0x10 ] 201c228: 30 bf ff 9d b,a 201c09c /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201c22c: 7f ff d4 e9 call 20115d0 <__errno> 201c230: b0 10 3f ff mov -1, %i0 201c234: 82 10 20 03 mov 3, %g1 201c238: c2 22 00 00 st %g1, [ %o0 ] 201c23c: 81 c7 e0 08 ret 201c240: 81 e8 00 00 restore */ if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201c244: 7f ff d4 e3 call 20115d0 <__errno> 201c248: b0 10 3f ff mov -1, %i0 201c24c: 82 10 20 16 mov 0x16, %g1 201c250: c2 22 00 00 st %g1, [ %o0 ] 201c254: 81 c7 e0 08 ret 201c258: 81 e8 00 00 restore if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { _Thread_Enable_dispatch(); 201c25c: 7f ff b6 f2 call 2009e24 <_Thread_Enable_dispatch> 201c260: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201c264: 7f ff d4 db call 20115d0 <__errno> 201c268: 01 00 00 00 nop 201c26c: 82 10 20 0b mov 0xb, %g1 ! b 201c270: c2 22 00 00 st %g1, [ %o0 ] 201c274: 81 c7 e0 08 ret 201c278: 81 e8 00 00 restore =============================================================================== 0200c560 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 200c560: 9d e3 bf 90 save %sp, -112, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200c564: 03 00 80 b2 sethi %hi(0x202c800), %g1 200c568: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 202cb60 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200c56c: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200c570: 84 00 a0 01 inc %g2 200c574: c4 20 63 60 st %g2, [ %g1 + 0x360 ] return _Thread_Dispatch_disable_level; 200c578: c2 00 63 60 ld [ %g1 + 0x360 ], %g1 200c57c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200c580: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200c584: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Message_queue_Control_fd *the_mq_fd; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200c588: a0 8e 62 00 andcc %i1, 0x200, %l0 200c58c: 12 80 00 34 bne 200c65c 200c590: b4 10 20 00 clr %i2 */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 200c594: 39 00 80 b4 sethi %hi(0x202d000), %i4 200c598: 40 00 0c e2 call 200f920 <_Objects_Allocate> 200c59c: 90 17 20 2c or %i4, 0x2c, %o0 ! 202d02c <_POSIX_Message_queue_Information_fds> attr = va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200c5a0: ba 92 20 00 orcc %o0, 0, %i5 200c5a4: 02 80 00 37 be 200c680 <== NEVER TAKEN 200c5a8: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 200c5ac: f2 27 60 14 st %i1, [ %i5 + 0x14 ] status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id ); 200c5b0: 90 10 00 18 mov %i0, %o0 200c5b4: 40 00 21 a9 call 2014c58 <_POSIX_Message_queue_Name_to_id> 200c5b8: 92 07 bf f4 add %fp, -12, %o1 * If the name to id translation worked, then the message queue exists * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "message queue does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 200c5bc: b6 92 20 00 orcc %o0, 0, %i3 200c5c0: 22 80 00 0f be,a 200c5fc 200c5c4: b2 0e 6a 00 and %i1, 0xa00, %i1 /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 200c5c8: 80 a6 e0 02 cmp %i3, 2 200c5cc: 02 80 00 40 be 200c6cc 200c5d0: 80 a4 20 00 cmp %l0, 0 RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 200c5d4: 90 17 20 2c or %i4, 0x2c, %o0 200c5d8: 40 00 0d bc call 200fcc8 <_Objects_Free> 200c5dc: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200c5e0: 40 00 12 1c call 2010e50 <_Thread_Enable_dispatch> 200c5e4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 200c5e8: 40 00 32 81 call 2018fec <__errno> 200c5ec: 01 00 00 00 nop 200c5f0: f6 22 00 00 st %i3, [ %o0 ] 200c5f4: 81 c7 e0 08 ret 200c5f8: 81 e8 00 00 restore } else { /* name -> ID translation succeeded */ /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 200c5fc: 80 a6 6a 00 cmp %i1, 0xa00 200c600: 02 80 00 28 be 200c6a0 200c604: d2 07 bf f4 ld [ %fp + -12 ], %o1 RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get ( Objects_Id id, Objects_Locations *location ) { return (POSIX_Message_queue_Control *) 200c608: 94 07 bf fc add %fp, -4, %o2 200c60c: 11 00 80 b3 sethi %hi(0x202cc00), %o0 200c610: 40 00 0e 0f call 200fe4c <_Objects_Get> 200c614: 90 12 22 a0 or %o0, 0x2a0, %o0 ! 202cea0 <_POSIX_Message_queue_Information> /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); the_mq->open_count += 1; 200c618: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200c61c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 200c620: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200c624: b8 17 20 2c or %i4, 0x2c, %i4 200c628: c4 22 20 18 st %g2, [ %o0 + 0x18 ] 200c62c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); 200c630: d0 27 bf f8 st %o0, [ %fp + -8 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 200c634: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 200c638: 83 28 60 02 sll %g1, 2, %g1 200c63c: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200c640: 40 00 12 04 call 2010e50 <_Thread_Enable_dispatch> 200c644: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 200c648: 40 00 12 02 call 2010e50 <_Thread_Enable_dispatch> 200c64c: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 200c650: f0 07 60 08 ld [ %i5 + 8 ], %i0 200c654: 81 c7 e0 08 ret 200c658: 81 e8 00 00 restore _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = va_arg( arg, mode_t ); attr = va_arg( arg, struct mq_attr * ); 200c65c: 82 07 a0 54 add %fp, 0x54, %g1 200c660: f4 07 a0 50 ld [ %fp + 0x50 ], %i2 200c664: c2 27 bf f0 st %g1, [ %fp + -16 ] */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 200c668: 39 00 80 b4 sethi %hi(0x202d000), %i4 200c66c: 40 00 0c ad call 200f920 <_Objects_Allocate> 200c670: 90 17 20 2c or %i4, 0x2c, %o0 ! 202d02c <_POSIX_Message_queue_Information_fds> va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200c674: ba 92 20 00 orcc %o0, 0, %i5 200c678: 32 bf ff ce bne,a 200c5b0 200c67c: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 200c680: 40 00 11 f4 call 2010e50 <_Thread_Enable_dispatch> 200c684: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 200c688: 40 00 32 59 call 2018fec <__errno> 200c68c: 01 00 00 00 nop 200c690: 82 10 20 17 mov 0x17, %g1 ! 17 200c694: c2 22 00 00 st %g1, [ %o0 ] 200c698: 81 c7 e0 08 ret 200c69c: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 200c6a0: 90 17 20 2c or %i4, 0x2c, %o0 200c6a4: 40 00 0d 89 call 200fcc8 <_Objects_Free> 200c6a8: 92 10 00 1d mov %i5, %o1 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200c6ac: 40 00 11 e9 call 2010e50 <_Thread_Enable_dispatch> 200c6b0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 200c6b4: 40 00 32 4e call 2018fec <__errno> 200c6b8: 01 00 00 00 nop 200c6bc: 82 10 20 11 mov 0x11, %g1 ! 11 200c6c0: c2 22 00 00 st %g1, [ %o0 ] 200c6c4: 81 c7 e0 08 ret 200c6c8: 81 e8 00 00 restore if ( status ) { /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 200c6cc: 02 bf ff c3 be 200c5d8 200c6d0: 90 17 20 2c or %i4, 0x2c, %o0 /* * At this point, the message queue does not exist and everything has been * checked. We should go ahead and create a message queue. */ status = _POSIX_Message_queue_Create_support( 200c6d4: 90 10 00 18 mov %i0, %o0 200c6d8: 92 10 20 01 mov 1, %o1 200c6dc: 94 10 00 1a mov %i2, %o2 200c6e0: 40 00 20 f9 call 2014ac4 <_POSIX_Message_queue_Create_support> 200c6e4: 96 07 bf f8 add %fp, -8, %o3 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 200c6e8: 80 a2 3f ff cmp %o0, -1 200c6ec: 02 80 00 0d be 200c720 200c6f0: c6 07 bf f8 ld [ %fp + -8 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200c6f4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200c6f8: b8 17 20 2c or %i4, 0x2c, %i4 200c6fc: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); return (mqd_t) -1; } the_mq_fd->Queue = the_mq; 200c700: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200c704: 83 28 60 02 sll %g1, 2, %g1 200c708: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200c70c: 40 00 11 d1 call 2010e50 <_Thread_Enable_dispatch> 200c710: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 200c714: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 200c718: 81 c7 e0 08 ret 200c71c: 81 e8 00 00 restore 200c720: 90 17 20 2c or %i4, 0x2c, %o0 200c724: 92 10 00 1d mov %i5, %o1 200c728: 40 00 0d 68 call 200fcc8 <_Objects_Free> 200c72c: b0 10 3f ff mov -1, %i0 /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200c730: 40 00 11 c8 call 2010e50 <_Thread_Enable_dispatch> 200c734: 01 00 00 00 nop return (mqd_t) -1; 200c738: 81 c7 e0 08 ret 200c73c: 81 e8 00 00 restore =============================================================================== 0200c4c8 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200c4c8: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200c4cc: 80 a0 60 00 cmp %g1, 0 200c4d0: 02 80 00 06 be 200c4e8 200c4d4: 90 10 20 16 mov 0x16, %o0 200c4d8: c4 00 40 00 ld [ %g1 ], %g2 200c4dc: 80 a0 a0 00 cmp %g2, 0 200c4e0: 12 80 00 04 bne 200c4f0 200c4e4: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200c4e8: 81 c3 e0 08 retl 200c4ec: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200c4f0: 18 80 00 09 bgu 200c514 200c4f4: 84 10 20 01 mov 1, %g2 ! 1 200c4f8: 85 28 80 09 sll %g2, %o1, %g2 200c4fc: 80 88 a0 17 btst 0x17, %g2 200c500: 02 80 00 05 be 200c514 <== NEVER TAKEN 200c504: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200c508: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200c50c: 81 c3 e0 08 retl 200c510: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200c514: 81 c3 e0 08 retl 200c518: 90 10 20 86 mov 0x86, %o0 =============================================================================== 020074e0 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 20074e0: 9d e3 bf 90 save %sp, -112, %sp 20074e4: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 20074e8: 80 a7 60 00 cmp %i5, 0 20074ec: 02 80 00 27 be 2007588 20074f0: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 20074f4: 80 a6 a0 00 cmp %i2, 0 20074f8: 02 80 00 24 be 2007588 20074fc: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007500: 02 80 00 24 be 2007590 2007504: 90 07 bf f8 add %fp, -8, %o0 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 2007508: c2 06 40 00 ld [ %i1 ], %g1 200750c: 80 a0 60 00 cmp %g1, 0 2007510: 02 80 00 1e be 2007588 2007514: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2007518: c2 06 60 04 ld [ %i1 + 4 ], %g1 200751c: 80 a0 60 00 cmp %g1, 0 2007520: 12 80 00 1a bne 2007588 <== NEVER TAKEN 2007524: 03 00 80 82 sethi %hi(0x2020800), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007528: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 2020b00 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 200752c: c0 27 bf f0 clr [ %fp + -16 ] 2007530: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 2007534: f4 27 bf f4 st %i2, [ %fp + -12 ] 2007538: c4 20 63 00 st %g2, [ %g1 + 0x300 ] return _Thread_Dispatch_disable_level; 200753c: c2 00 63 00 ld [ %g1 + 0x300 ], %g1 * This function allocates a barrier control block from * the inactive chain of free barrier control blocks. */ RTEMS_INLINE_ROUTINE POSIX_Barrier_Control *_POSIX_Barrier_Allocate( void ) { return (POSIX_Barrier_Control *) 2007540: 37 00 80 83 sethi %hi(0x2020c00), %i3 2007544: 40 00 08 fc call 2009934 <_Objects_Allocate> 2007548: 90 16 e2 c0 or %i3, 0x2c0, %o0 ! 2020ec0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 200754c: b8 92 20 00 orcc %o0, 0, %i4 2007550: 02 80 00 14 be 20075a0 2007554: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2007558: 40 00 06 1c call 2008dc8 <_CORE_barrier_Initialize> 200755c: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007560: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007564: b6 16 e2 c0 or %i3, 0x2c0, %i3 2007568: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200756c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007570: 85 28 a0 02 sll %g2, 2, %g2 2007574: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2007578: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 200757c: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007580: 40 00 0e 1a call 200ade8 <_Thread_Enable_dispatch> 2007584: b0 10 20 00 clr %i0 return 0; } 2007588: 81 c7 e0 08 ret 200758c: 81 e8 00 00 restore * If the user passed in NULL, use the default attributes */ if ( attr ) { the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 2007590: 7f ff ff 9c call 2007400 2007594: b2 07 bf f8 add %fp, -8, %i1 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 2007598: 10 bf ff dd b 200750c 200759c: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 20075a0: 40 00 0e 12 call 200ade8 <_Thread_Enable_dispatch> 20075a4: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20075a8: 81 c7 e0 08 ret 20075ac: 81 e8 00 00 restore =============================================================================== 02006d7c : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2006d7c: 9d e3 bf a0 save %sp, -96, %sp /* * The POSIX standard does not address what to do when the routine * is NULL. It also does not address what happens when we cannot * allocate memory or anything else bad happens. */ if ( !routine ) 2006d80: 80 a6 20 00 cmp %i0, 0 2006d84: 02 80 00 16 be 2006ddc 2006d88: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006d8c: 03 00 80 80 sethi %hi(0x2020000), %g1 2006d90: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 2020340 <_Thread_Dispatch_disable_level> 2006d94: 84 00 a0 01 inc %g2 2006d98: c4 20 63 40 st %g2, [ %g1 + 0x340 ] return _Thread_Dispatch_disable_level; 2006d9c: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2006da0: 40 00 13 12 call 200b9e8 <_Workspace_Allocate> 2006da4: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2006da8: 80 a2 20 00 cmp %o0, 0 2006dac: 02 80 00 0a be 2006dd4 <== NEVER TAKEN 2006db0: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006db4: 03 00 80 82 sethi %hi(0x2020800), %g1 2006db8: c2 00 60 8c ld [ %g1 + 0x8c ], %g1 ! 202088c <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 2006dbc: 92 10 00 08 mov %o0, %o1 handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); if ( handler ) { thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; handler_stack = &thread_support->Cancellation_Handlers; 2006dc0: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 2006dc4: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 2006dc8: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2006dcc: 40 00 06 62 call 2008754 <_Chain_Append> 2006dd0: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 2006dd4: 40 00 0e 5e call 200a74c <_Thread_Enable_dispatch> 2006dd8: 81 e8 00 00 restore 2006ddc: 81 c7 e0 08 ret 2006de0: 81 e8 00 00 restore =============================================================================== 02007d24 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2007d24: 9d e3 bf a0 save %sp, -96, %sp POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; 2007d28: 80 a6 60 00 cmp %i1, 0 2007d2c: 02 80 00 27 be 2007dc8 2007d30: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2007d34: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007d38: 80 a0 60 01 cmp %g1, 1 2007d3c: 02 80 00 21 be 2007dc0 <== NEVER TAKEN 2007d40: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2007d44: c2 06 40 00 ld [ %i1 ], %g1 2007d48: 80 a0 60 00 cmp %g1, 0 2007d4c: 02 80 00 1d be 2007dc0 2007d50: 03 00 80 87 sethi %hi(0x2021c00), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007d54: c4 00 61 20 ld [ %g1 + 0x120 ], %g2 ! 2021d20 <_Thread_Dispatch_disable_level> 2007d58: 84 00 a0 01 inc %g2 2007d5c: c4 20 61 20 st %g2, [ %g1 + 0x120 ] return _Thread_Dispatch_disable_level; 2007d60: c2 00 61 20 ld [ %g1 + 0x120 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2007d64: 37 00 80 88 sethi %hi(0x2022000), %i3 2007d68: 40 00 0a af call 200a824 <_Objects_Allocate> 2007d6c: 90 16 e1 78 or %i3, 0x178, %o0 ! 2022178 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2007d70: b8 92 20 00 orcc %o0, 0, %i4 2007d74: 02 80 00 18 be 2007dd4 2007d78: 90 07 20 18 add %i4, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2007d7c: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2007d80: 92 10 20 00 clr %o1 2007d84: 15 04 00 02 sethi %hi(0x10000800), %o2 2007d88: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2007d8c: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2007d90: 40 00 11 fd call 200c584 <_Thread_queue_Initialize> 2007d94: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007d98: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007d9c: b6 16 e1 78 or %i3, 0x178, %i3 2007da0: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007da4: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007da8: 85 28 a0 02 sll %g2, 2, %g2 2007dac: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2007db0: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2007db4: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007db8: 40 00 0f c8 call 200bcd8 <_Thread_Enable_dispatch> 2007dbc: b0 10 20 00 clr %i0 return 0; } 2007dc0: 81 c7 e0 08 ret 2007dc4: 81 e8 00 00 restore { POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; else the_attr = &_POSIX_Condition_variables_Default_attributes; 2007dc8: 33 00 80 7f sethi %hi(0x201fc00), %i1 2007dcc: 10 bf ff da b 2007d34 2007dd0: b2 16 60 04 or %i1, 4, %i1 ! 201fc04 <_POSIX_Condition_variables_Default_attributes> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 2007dd4: 40 00 0f c1 call 200bcd8 <_Thread_Enable_dispatch> 2007dd8: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2007ddc: 81 c7 e0 08 ret 2007de0: 81 e8 00 00 restore =============================================================================== 02007b88 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2007b88: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2007b8c: 80 a0 60 00 cmp %g1, 0 2007b90: 02 80 00 06 be 2007ba8 2007b94: 90 10 20 16 mov 0x16, %o0 2007b98: c4 00 40 00 ld [ %g1 ], %g2 2007b9c: 80 a0 a0 00 cmp %g2, 0 2007ba0: 32 80 00 04 bne,a 2007bb0 <== ALWAYS TAKEN 2007ba4: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 2007ba8: 81 c3 e0 08 retl 2007bac: 01 00 00 00 nop 2007bb0: 81 c3 e0 08 retl 2007bb4: 90 10 20 00 clr %o0 ! 0 =============================================================================== 02007224 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 2007224: 9d e3 bf 58 save %sp, -168, %sp 2007228: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 200722c: 80 a6 a0 00 cmp %i2, 0 2007230: 02 80 00 63 be 20073bc 2007234: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2007238: 80 a6 60 00 cmp %i1, 0 200723c: 22 80 00 62 be,a 20073c4 2007240: 33 00 80 88 sethi %hi(0x2022000), %i1 if ( !the_attr->is_initialized ) 2007244: c2 06 40 00 ld [ %i1 ], %g1 2007248: 80 a0 60 00 cmp %g1, 0 200724c: 02 80 00 5c be 20073bc 2007250: b0 10 20 16 mov 0x16, %i0 * stack space if it is allowed to allocate it itself. * * NOTE: If the user provides the stack we will let it drop below * twice the minimum. */ if ( the_attr->stackaddr && !_Stack_Is_enough(the_attr->stacksize) ) 2007254: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007258: 80 a0 60 00 cmp %g1, 0 200725c: 02 80 00 07 be 2007278 2007260: 03 00 80 8d sethi %hi(0x2023400), %g1 2007264: c4 06 60 08 ld [ %i1 + 8 ], %g2 2007268: c2 00 61 44 ld [ %g1 + 0x144 ], %g1 200726c: 80 a0 80 01 cmp %g2, %g1 2007270: 0a 80 00 83 bcs 200747c 2007274: 01 00 00 00 nop * If inheritsched is set to PTHREAD_INHERIT_SCHED, then this thread * inherits scheduling attributes from the creating thread. If it is * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { 2007278: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200727c: 80 a0 60 01 cmp %g1, 1 2007280: 02 80 00 53 be 20073cc 2007284: 80 a0 60 02 cmp %g1, 2 2007288: 12 80 00 4d bne 20073bc 200728c: b0 10 20 16 mov 0x16, %i0 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2007290: da 06 60 18 ld [ %i1 + 0x18 ], %o5 2007294: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2007298: f0 06 60 20 ld [ %i1 + 0x20 ], %i0 200729c: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 20072a0: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 20072a4: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 20072a8: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 20072ac: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 20072b0: da 27 bf dc st %o5, [ %fp + -36 ] 20072b4: de 27 bf e0 st %o7, [ %fp + -32 ] 20072b8: f0 27 bf e4 st %i0, [ %fp + -28 ] 20072bc: c8 27 bf e8 st %g4, [ %fp + -24 ] 20072c0: c6 27 bf ec st %g3, [ %fp + -20 ] 20072c4: c4 27 bf f0 st %g2, [ %fp + -16 ] 20072c8: c2 27 bf f4 st %g1, [ %fp + -12 ] /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 20072cc: c2 06 60 0c ld [ %i1 + 0xc ], %g1 20072d0: 80 a0 60 00 cmp %g1, 0 20072d4: 12 80 00 3a bne 20073bc 20072d8: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 20072dc: d0 07 bf dc ld [ %fp + -36 ], %o0 20072e0: 40 00 1e a0 call 200ed60 <_POSIX_Priority_Is_valid> 20072e4: b0 10 20 16 mov 0x16, %i0 20072e8: 80 8a 20 ff btst 0xff, %o0 20072ec: 02 80 00 34 be 20073bc <== NEVER TAKEN 20072f0: 03 00 80 8d sethi %hi(0x2023400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 20072f4: e4 07 bf dc ld [ %fp + -36 ], %l2 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 20072f8: e6 08 61 40 ldub [ %g1 + 0x140 ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 20072fc: 90 10 00 1c mov %i4, %o0 2007300: 92 07 bf dc add %fp, -36, %o1 2007304: 94 07 bf f8 add %fp, -8, %o2 2007308: 40 00 1e a3 call 200ed94 <_POSIX_Thread_Translate_sched_param> 200730c: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2007310: b0 92 20 00 orcc %o0, 0, %i0 2007314: 12 80 00 2a bne 20073bc 2007318: 23 00 80 90 sethi %hi(0x2024000), %l1 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 200731c: d0 04 62 f8 ld [ %l1 + 0x2f8 ], %o0 ! 20242f8 <_RTEMS_Allocator_Mutex> 2007320: 40 00 06 93 call 2008d6c <_API_Mutex_Lock> 2007324: 29 00 80 91 sethi %hi(0x2024400), %l4 * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 2007328: 40 00 09 83 call 2009934 <_Objects_Allocate> 200732c: 90 15 20 90 or %l4, 0x90, %o0 ! 2024490 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2007330: a0 92 20 00 orcc %o0, 0, %l0 2007334: 02 80 00 1f be 20073b0 2007338: 05 00 80 8d sethi %hi(0x2023400), %g2 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 200733c: c2 06 60 08 ld [ %i1 + 8 ], %g1 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 2007340: d6 00 a1 44 ld [ %g2 + 0x144 ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007344: c0 27 bf d4 clr [ %fp + -44 ] static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 2007348: 97 2a e0 01 sll %o3, 1, %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 200734c: 80 a2 c0 01 cmp %o3, %g1 2007350: 1a 80 00 03 bcc 200735c 2007354: d4 06 60 04 ld [ %i1 + 4 ], %o2 2007358: 96 10 00 01 mov %g1, %o3 200735c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007360: 9a 0c e0 ff and %l3, 0xff, %o5 2007364: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2007368: 82 10 20 01 mov 1, %g1 200736c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007370: c2 07 bf fc ld [ %fp + -4 ], %g1 2007374: c0 23 a0 68 clr [ %sp + 0x68 ] 2007378: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 200737c: 82 07 bf d4 add %fp, -44, %g1 2007380: 90 15 20 90 or %l4, 0x90, %o0 2007384: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2007388: 92 10 00 10 mov %l0, %o1 200738c: 98 10 20 01 mov 1, %o4 2007390: 40 00 0e cf call 200aecc <_Thread_Initialize> 2007394: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2007398: 80 8a 20 ff btst 0xff, %o0 200739c: 12 80 00 1f bne 2007418 20073a0: 11 00 80 91 sethi %hi(0x2024400), %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 20073a4: 92 10 00 10 mov %l0, %o1 20073a8: 40 00 0a 4d call 2009cdc <_Objects_Free> 20073ac: 90 12 20 90 or %o0, 0x90, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 20073b0: d0 04 62 f8 ld [ %l1 + 0x2f8 ], %o0 20073b4: 40 00 06 83 call 2008dc0 <_API_Mutex_Unlock> 20073b8: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20073bc: 81 c7 e0 08 ret 20073c0: 81 e8 00 00 restore int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20073c4: 10 bf ff a0 b 2007244 20073c8: b2 16 61 2c or %i1, 0x12c, %i1 * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { case PTHREAD_INHERIT_SCHED: api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20073cc: 03 00 80 91 sethi %hi(0x2024400), %g1 20073d0: c2 00 63 9c ld [ %g1 + 0x39c ], %g1 ! 202479c <_Per_CPU_Information+0xc> 20073d4: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 20073d8: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 20073dc: da 00 60 8c ld [ %g1 + 0x8c ], %o5 20073e0: de 00 60 90 ld [ %g1 + 0x90 ], %o7 20073e4: f0 00 60 94 ld [ %g1 + 0x94 ], %i0 20073e8: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 20073ec: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 20073f0: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 * attributes structure. */ switch ( the_attr->inheritsched ) { case PTHREAD_INHERIT_SCHED: api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; schedpolicy = api->schedpolicy; 20073f4: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 20073f8: d8 27 bf dc st %o4, [ %fp + -36 ] 20073fc: da 27 bf e0 st %o5, [ %fp + -32 ] 2007400: de 27 bf e4 st %o7, [ %fp + -28 ] 2007404: f0 27 bf e8 st %i0, [ %fp + -24 ] 2007408: c8 27 bf ec st %g4, [ %fp + -20 ] 200740c: c6 27 bf f0 st %g3, [ %fp + -16 ] break; 2007410: 10 bf ff af b 20072cc 2007414: c4 27 bf f4 st %g2, [ %fp + -12 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2007418: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 api->Attributes = *the_attr; 200741c: 92 10 00 19 mov %i1, %o1 2007420: 94 10 20 40 mov 0x40, %o2 2007424: 40 00 2d d0 call 2012b64 2007428: 90 10 00 12 mov %l2, %o0 api->detachstate = the_attr->detachstate; 200742c: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2007430: 92 07 bf dc add %fp, -36, %o1 2007434: 94 10 20 1c mov 0x1c, %o2 * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; 2007438: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] api->schedpolicy = schedpolicy; 200743c: f8 24 a0 84 st %i4, [ %l2 + 0x84 ] api->schedparam = schedparam; 2007440: 40 00 2d c9 call 2012b64 2007444: 90 04 a0 88 add %l2, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 2007448: 90 10 00 10 mov %l0, %o0 200744c: 92 10 20 01 mov 1, %o1 2007450: 94 10 00 1a mov %i2, %o2 2007454: 96 10 00 1b mov %i3, %o3 2007458: 40 00 11 21 call 200b8dc <_Thread_Start> 200745c: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2007460: 80 a7 20 04 cmp %i4, 4 2007464: 02 80 00 08 be 2007484 2007468: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 200746c: c2 04 20 08 ld [ %l0 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2007470: d0 04 62 f8 ld [ %l1 + 0x2f8 ], %o0 2007474: 40 00 06 53 call 2008dc0 <_API_Mutex_Unlock> 2007478: c2 27 40 00 st %g1, [ %i5 ] return 0; 200747c: 81 c7 e0 08 ret 2007480: 81 e8 00 00 restore return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 2007484: 40 00 11 3e call 200b97c <_Timespec_To_ticks> 2007488: 90 04 a0 90 add %l2, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200748c: 92 04 a0 a8 add %l2, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007490: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007494: 11 00 80 90 sethi %hi(0x2024000), %o0 2007498: 40 00 12 2c call 200bd48 <_Watchdog_Insert> 200749c: 90 12 23 10 or %o0, 0x310, %o0 ! 2024310 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20074a0: 10 bf ff f4 b 2007470 20074a4: c2 04 20 08 ld [ %l0 + 8 ], %g1 =============================================================================== 0201c3fc : int pthread_kill( pthread_t thread, int sig ) { 201c3fc: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201c400: 80 a6 60 00 cmp %i1, 0 201c404: 02 80 00 2d be 201c4b8 201c408: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201c40c: 80 a6 e0 1f cmp %i3, 0x1f 201c410: 18 80 00 2a bgu 201c4b8 201c414: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 201c418: 7f ff b6 90 call 2009e58 <_Thread_Get> 201c41c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201c420: c2 07 bf fc ld [ %fp + -4 ], %g1 201c424: 80 a0 60 00 cmp %g1, 0 201c428: 12 80 00 2a bne 201c4d0 <== NEVER TAKEN 201c42c: ba 10 00 08 mov %o0, %i5 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 201c430: 83 2e 60 02 sll %i1, 2, %g1 201c434: 85 2e 60 04 sll %i1, 4, %g2 201c438: 84 20 80 01 sub %g2, %g1, %g2 201c43c: 03 00 80 7e sethi %hi(0x201f800), %g1 201c440: 82 10 62 60 or %g1, 0x260, %g1 ! 201fa60 <_POSIX_signals_Vectors> 201c444: 82 00 40 02 add %g1, %g2, %g1 201c448: c4 00 60 08 ld [ %g1 + 8 ], %g2 201c44c: 80 a0 a0 01 cmp %g2, 1 201c450: 02 80 00 14 be 201c4a0 201c454: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201c458: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201c45c: b8 10 20 01 mov 1, %i4 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201c460: 92 10 00 19 mov %i1, %o1 201c464: b7 2f 00 1b sll %i4, %i3, %i3 201c468: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201c46c: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201c470: 7f ff ff 8c call 201c2a0 <_POSIX_signals_Unblock_thread> 201c474: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201c478: 03 00 80 7e sethi %hi(0x201f800), %g1 201c47c: 82 10 62 00 or %g1, 0x200, %g1 ! 201fa00 <_Per_CPU_Information> 201c480: c4 00 60 08 ld [ %g1 + 8 ], %g2 201c484: 80 a0 a0 00 cmp %g2, 0 201c488: 02 80 00 06 be 201c4a0 201c48c: 01 00 00 00 nop 201c490: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201c494: 80 a7 40 02 cmp %i5, %g2 201c498: 02 80 00 06 be 201c4b0 201c49c: 01 00 00 00 nop _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 201c4a0: 7f ff b6 61 call 2009e24 <_Thread_Enable_dispatch> 201c4a4: b0 10 20 00 clr %i0 ! 0 return 0; 201c4a8: 81 c7 e0 08 ret 201c4ac: 81 e8 00 00 restore api->signals_pending |= signo_to_mask( sig ); (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; 201c4b0: f8 28 60 18 stb %i4, [ %g1 + 0x18 ] 201c4b4: 30 bf ff fb b,a 201c4a0 if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201c4b8: 7f ff d4 46 call 20115d0 <__errno> 201c4bc: b0 10 3f ff mov -1, %i0 201c4c0: 82 10 20 16 mov 0x16, %g1 201c4c4: c2 22 00 00 st %g1, [ %o0 ] 201c4c8: 81 c7 e0 08 ret 201c4cc: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201c4d0: 7f ff d4 40 call 20115d0 <__errno> <== NOT EXECUTED 201c4d4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201c4d8: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 201c4dc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 201c4e0: 81 c7 e0 08 ret <== NOT EXECUTED 201c4e4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200926c : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 200926c: 9d e3 bf 98 save %sp, -104, %sp * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2009270: 90 10 00 19 mov %i1, %o0 2009274: 40 00 00 37 call 2009350 <_POSIX_Absolute_timeout_to_ticks> 2009278: 92 07 bf fc add %fp, -4, %o1 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 200927c: d4 07 bf fc ld [ %fp + -4 ], %o2 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2009280: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009284: 80 a7 60 03 cmp %i5, 3 2009288: 02 80 00 09 be 20092ac 200928c: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009290: 7f ff ff be call 2009188 <_POSIX_Mutex_Lock_support> 2009294: 92 10 20 00 clr %o1 * This service only gives us the option to block. We used a polling * attempt to lock if the abstime was not in the future. If we did * not obtain the mutex, then not look at the status immediately, * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { 2009298: 80 a2 20 10 cmp %o0, 0x10 200929c: 02 80 00 08 be 20092bc 20092a0: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 20092a4: 81 c7 e0 08 ret 20092a8: 91 e8 00 08 restore %g0, %o0, %o0 */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 20092ac: 7f ff ff b7 call 2009188 <_POSIX_Mutex_Lock_support> 20092b0: 92 10 20 01 mov 1, %o1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 20092b4: 81 c7 e0 08 ret 20092b8: 91 e8 00 08 restore %g0, %o0, %o0 * attempt to lock if the abstime was not in the future. If we did * not obtain the mutex, then not look at the status immediately, * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20092bc: 32 80 00 04 bne,a 20092cc <== ALWAYS TAKEN 20092c0: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 20092c4: 10 bf ff f8 b 20092a4 <== NOT EXECUTED 20092c8: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20092cc: 80 a7 60 01 cmp %i5, 1 20092d0: 28 bf ff f5 bleu,a 20092a4 <== ALWAYS TAKEN 20092d4: 90 10 20 74 mov 0x74, %o0 20092d8: 30 bf ff f3 b,a 20092a4 <== NOT EXECUTED =============================================================================== 02006aa4 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2006aa4: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2006aa8: 80 a0 60 00 cmp %g1, 0 2006aac: 02 80 00 06 be 2006ac4 2006ab0: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2006ab4: c4 00 40 00 ld [ %g1 ], %g2 2006ab8: 80 a0 a0 00 cmp %g2, 0 2006abc: 12 80 00 04 bne 2006acc 2006ac0: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 2006ac4: 81 c3 e0 08 retl 2006ac8: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 2006acc: 02 bf ff fe be 2006ac4 <== NEVER TAKEN 2006ad0: 01 00 00 00 nop return EINVAL; *type = attr->type; 2006ad4: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2006ad8: 90 10 20 00 clr %o0 } 2006adc: 81 c3 e0 08 retl 2006ae0: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 02008e40 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2008e40: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2008e44: 80 a0 60 00 cmp %g1, 0 2008e48: 02 80 00 06 be 2008e60 2008e4c: 90 10 20 16 mov 0x16, %o0 2008e50: c4 00 40 00 ld [ %g1 ], %g2 2008e54: 80 a0 a0 00 cmp %g2, 0 2008e58: 12 80 00 04 bne 2008e68 2008e5c: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2008e60: 81 c3 e0 08 retl 2008e64: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2008e68: 18 bf ff fe bgu 2008e60 <== NEVER TAKEN 2008e6c: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2008e70: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2008e74: 81 c3 e0 08 retl 2008e78: 90 10 20 00 clr %o0 =============================================================================== 02006b38 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 2006b38: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2006b3c: 80 a0 60 00 cmp %g1, 0 2006b40: 02 80 00 06 be 2006b58 2006b44: 90 10 20 16 mov 0x16, %o0 2006b48: c4 00 40 00 ld [ %g1 ], %g2 2006b4c: 80 a0 a0 00 cmp %g2, 0 2006b50: 12 80 00 04 bne 2006b60 <== ALWAYS TAKEN 2006b54: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 2006b58: 81 c3 e0 08 retl 2006b5c: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 2006b60: 18 bf ff fe bgu 2006b58 2006b64: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2006b68: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 2006b6c: 81 c3 e0 08 retl 2006b70: 90 10 20 00 clr %o0 =============================================================================== 02007974 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2007974: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2007978: 80 a6 60 00 cmp %i1, 0 200797c: 12 80 00 04 bne 200798c 2007980: ba 10 00 18 mov %i0, %i5 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2007984: 81 c7 e0 08 ret 2007988: 91 e8 20 16 restore %g0, 0x16, %o0 int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) 200798c: 80 a6 20 00 cmp %i0, 0 2007990: 22 80 00 13 be,a 20079dc 2007994: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 2007998: c2 06 20 04 ld [ %i0 + 4 ], %g1 200799c: 80 a0 60 00 cmp %g1, 0 20079a0: 12 80 00 0f bne 20079dc 20079a4: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20079a8: 90 10 21 00 mov 0x100, %o0 20079ac: 92 10 21 00 mov 0x100, %o1 20079b0: 40 00 03 0e call 20085e8 20079b4: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 20079b8: c2 07 60 04 ld [ %i5 + 4 ], %g1 20079bc: 80 a0 60 00 cmp %g1, 0 20079c0: 02 80 00 09 be 20079e4 <== ALWAYS TAKEN 20079c4: 82 10 20 01 mov 1, %g1 once_control->is_initialized = true; once_control->init_executed = true; (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20079c8: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 20079cc: 92 10 21 00 mov 0x100, %o1 20079d0: 94 07 bf fc add %fp, -4, %o2 20079d4: 40 00 03 05 call 20085e8 20079d8: b0 10 20 00 clr %i0 20079dc: 81 c7 e0 08 ret 20079e0: 81 e8 00 00 restore if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); if ( !once_control->init_executed ) { once_control->is_initialized = true; 20079e4: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 20079e8: 9f c6 40 00 call %i1 20079ec: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20079f0: 10 bf ff f7 b 20079cc 20079f4: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 0200808c : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 200808c: 9d e3 bf 90 save %sp, -112, %sp 2008090: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 2008094: 80 a7 60 00 cmp %i5, 0 2008098: 02 80 00 24 be 2008128 200809c: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20080a0: 80 a6 60 00 cmp %i1, 0 20080a4: 02 80 00 23 be 2008130 20080a8: 90 07 bf f4 add %fp, -12, %o0 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 20080ac: c2 06 40 00 ld [ %i1 ], %g1 20080b0: 80 a0 60 00 cmp %g1, 0 20080b4: 02 80 00 1d be 2008128 <== NEVER TAKEN 20080b8: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20080bc: c2 06 60 04 ld [ %i1 + 4 ], %g1 20080c0: 80 a0 60 00 cmp %g1, 0 20080c4: 12 80 00 19 bne 2008128 <== NEVER TAKEN 20080c8: 03 00 80 89 sethi %hi(0x2022400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20080cc: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 20224d0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20080d0: c0 27 bf fc clr [ %fp + -4 ] 20080d4: 84 00 a0 01 inc %g2 20080d8: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 20080dc: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 * This function allocates a RWLock control block from * the inactive chain of free RWLock control blocks. */ RTEMS_INLINE_ROUTINE POSIX_RWLock_Control *_POSIX_RWLock_Allocate( void ) { return (POSIX_RWLock_Control *) 20080e0: 37 00 80 89 sethi %hi(0x2022400), %i3 20080e4: 40 00 0a a4 call 200ab74 <_Objects_Allocate> 20080e8: 90 16 e2 d0 or %i3, 0x2d0, %o0 ! 20226d0 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 20080ec: b8 92 20 00 orcc %o0, 0, %i4 20080f0: 02 80 00 14 be 2008140 20080f4: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 20080f8: 40 00 08 22 call 200a180 <_CORE_RWLock_Initialize> 20080fc: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008100: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008104: b6 16 e2 d0 or %i3, 0x2d0, %i3 2008108: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200810c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008110: 85 28 a0 02 sll %g2, 2, %g2 2008114: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2008118: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 200811c: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2008120: 40 00 0f c2 call 200c028 <_Thread_Enable_dispatch> 2008124: b0 10 20 00 clr %i0 return 0; } 2008128: 81 c7 e0 08 ret 200812c: 81 e8 00 00 restore * If the user passed in NULL, use the default attributes */ if ( attr ) { the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 2008130: 40 00 02 80 call 2008b30 2008134: b2 07 bf f4 add %fp, -12, %i1 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 2008138: 10 bf ff de b 20080b0 200813c: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 2008140: 40 00 0f ba call 200c028 <_Thread_Enable_dispatch> 2008144: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2008148: 81 c7 e0 08 ret 200814c: 81 e8 00 00 restore =============================================================================== 020081c0 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20081c0: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 20081c4: 80 a6 20 00 cmp %i0, 0 20081c8: 02 80 00 24 be 2008258 20081cc: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 20081d0: 92 07 bf fc add %fp, -4, %o1 20081d4: 40 00 1f 30 call 200fe94 <_POSIX_Absolute_timeout_to_ticks> 20081d8: 90 10 00 19 mov %i1, %o0 20081dc: d2 06 00 00 ld [ %i0 ], %o1 20081e0: b8 10 00 08 mov %o0, %i4 20081e4: 94 07 bf f8 add %fp, -8, %o2 20081e8: 11 00 80 89 sethi %hi(0x2022400), %o0 20081ec: 40 00 0b ad call 200b0a0 <_Objects_Get> 20081f0: 90 12 22 d0 or %o0, 0x2d0, %o0 ! 20226d0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20081f4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20081f8: 80 a0 60 00 cmp %g1, 0 20081fc: 12 80 00 17 bne 2008258 2008200: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2008204: d2 06 00 00 ld [ %i0 ], %o1 int _EXFUN(pthread_rwlock_init, (pthread_rwlock_t *__rwlock, _CONST pthread_rwlockattr_t *__attr)); int _EXFUN(pthread_rwlock_destroy, (pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_rdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_tryrdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedrdlock, 2008208: 82 1f 20 03 xor %i4, 3, %g1 200820c: 90 02 20 10 add %o0, 0x10, %o0 2008210: 80 a0 00 01 cmp %g0, %g1 2008214: 98 10 20 00 clr %o4 2008218: b6 60 3f ff subx %g0, -1, %i3 200821c: 40 00 07 e3 call 200a1a8 <_CORE_RWLock_Obtain_for_reading> 2008220: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008224: 40 00 0f 81 call 200c028 <_Thread_Enable_dispatch> 2008228: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 200822c: 03 00 80 8a sethi %hi(0x2022800), %g1 2008230: c2 00 62 1c ld [ %g1 + 0x21c ], %g1 ! 2022a1c <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 2008234: 80 a6 e0 00 cmp %i3, 0 2008238: 12 80 00 05 bne 200824c 200823c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2008240: 80 a2 20 02 cmp %o0, 2 2008244: 02 80 00 07 be 2008260 2008248: 80 a7 20 00 cmp %i4, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 200824c: 40 00 00 39 call 2008330 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008250: 01 00 00 00 nop 2008254: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2008258: 81 c7 e0 08 ret 200825c: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008260: 02 bf ff fe be 2008258 <== NEVER TAKEN 2008264: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008268: 80 a7 20 01 cmp %i4, 1 200826c: 18 bf ff f8 bgu 200824c <== NEVER TAKEN 2008270: ba 10 20 74 mov 0x74, %i5 2008274: 30 bf ff f9 b,a 2008258 =============================================================================== 02008278 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008278: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 200827c: 80 a6 20 00 cmp %i0, 0 2008280: 02 80 00 24 be 2008310 2008284: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2008288: 92 07 bf fc add %fp, -4, %o1 200828c: 40 00 1f 02 call 200fe94 <_POSIX_Absolute_timeout_to_ticks> 2008290: 90 10 00 19 mov %i1, %o0 2008294: d2 06 00 00 ld [ %i0 ], %o1 2008298: b8 10 00 08 mov %o0, %i4 200829c: 94 07 bf f8 add %fp, -8, %o2 20082a0: 11 00 80 89 sethi %hi(0x2022400), %o0 20082a4: 40 00 0b 7f call 200b0a0 <_Objects_Get> 20082a8: 90 12 22 d0 or %o0, 0x2d0, %o0 ! 20226d0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20082ac: c2 07 bf f8 ld [ %fp + -8 ], %g1 20082b0: 80 a0 60 00 cmp %g1, 0 20082b4: 12 80 00 17 bne 2008310 20082b8: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20082bc: d2 06 00 00 ld [ %i0 ], %o1 (pthread_rwlock_t *__rwlock, _CONST struct timespec *__abstime)); int _EXFUN(pthread_rwlock_unlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_wrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_trywrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedwrlock, 20082c0: 82 1f 20 03 xor %i4, 3, %g1 20082c4: 90 02 20 10 add %o0, 0x10, %o0 20082c8: 80 a0 00 01 cmp %g0, %g1 20082cc: 98 10 20 00 clr %o4 20082d0: b6 60 3f ff subx %g0, -1, %i3 20082d4: 40 00 07 eb call 200a280 <_CORE_RWLock_Obtain_for_writing> 20082d8: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20082dc: 40 00 0f 53 call 200c028 <_Thread_Enable_dispatch> 20082e0: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 20082e4: 03 00 80 8a sethi %hi(0x2022800), %g1 20082e8: c2 00 62 1c ld [ %g1 + 0x21c ], %g1 ! 2022a1c <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 20082ec: 80 a6 e0 00 cmp %i3, 0 20082f0: 12 80 00 05 bne 2008304 20082f4: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 20082f8: 80 a2 20 02 cmp %o0, 2 20082fc: 02 80 00 07 be 2008318 2008300: 80 a7 20 00 cmp %i4, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008304: 40 00 00 0b call 2008330 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008308: 01 00 00 00 nop 200830c: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2008310: 81 c7 e0 08 ret 2008314: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008318: 02 bf ff fe be 2008310 <== NEVER TAKEN 200831c: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008320: 80 a7 20 01 cmp %i4, 1 2008324: 18 bf ff f8 bgu 2008304 <== NEVER TAKEN 2008328: ba 10 20 74 mov 0x74, %i5 200832c: 30 bf ff f9 b,a 2008310 =============================================================================== 02008b58 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2008b58: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2008b5c: 80 a0 60 00 cmp %g1, 0 2008b60: 02 80 00 06 be 2008b78 2008b64: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2008b68: c4 00 40 00 ld [ %g1 ], %g2 2008b6c: 80 a0 a0 00 cmp %g2, 0 2008b70: 12 80 00 04 bne 2008b80 2008b74: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2008b78: 81 c3 e0 08 retl 2008b7c: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2008b80: 18 bf ff fe bgu 2008b78 <== NEVER TAKEN 2008b84: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2008b88: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2008b8c: 81 c3 e0 08 retl 2008b90: 90 10 20 00 clr %o0 =============================================================================== 02009c2c : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2009c2c: 9d e3 bf 90 save %sp, -112, %sp 2009c30: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2009c34: 80 a6 a0 00 cmp %i2, 0 2009c38: 02 80 00 38 be 2009d18 2009c3c: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 2009c40: 90 10 00 19 mov %i1, %o0 2009c44: 92 10 00 1a mov %i2, %o1 2009c48: 94 07 bf f4 add %fp, -12, %o2 2009c4c: 40 00 1c f1 call 2011010 <_POSIX_Thread_Translate_sched_param> 2009c50: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 2009c54: b0 92 20 00 orcc %o0, 0, %i0 2009c58: 12 80 00 30 bne 2009d18 2009c5c: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 2009c60: 40 00 0c ca call 200cf88 <_Thread_Get> 2009c64: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009c68: c2 07 bf fc ld [ %fp + -4 ], %g1 2009c6c: 80 a0 60 00 cmp %g1, 0 2009c70: 12 80 00 2c bne 2009d20 2009c74: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2009c78: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2009c7c: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2009c80: 80 a0 60 04 cmp %g1, 4 2009c84: 02 80 00 33 be 2009d50 2009c88: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 2009c8c: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2009c90: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2009c94: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 2009c98: c2 27 60 88 st %g1, [ %i5 + 0x88 ] 2009c9c: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2009ca0: c4 27 60 8c st %g2, [ %i5 + 0x8c ] 2009ca4: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2009ca8: c4 27 60 90 st %g2, [ %i5 + 0x90 ] 2009cac: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 2009cb0: c4 27 60 94 st %g2, [ %i5 + 0x94 ] 2009cb4: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 2009cb8: c4 27 60 98 st %g2, [ %i5 + 0x98 ] 2009cbc: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 2009cc0: c4 27 60 9c st %g2, [ %i5 + 0x9c ] 2009cc4: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 2009cc8: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 2009ccc: c4 07 bf f4 ld [ %fp + -12 ], %g2 2009cd0: c4 27 20 78 st %g2, [ %i4 + 0x78 ] the_thread->budget_callout = budget_callout; 2009cd4: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 2009cd8: 06 80 00 0e bl 2009d10 <== NEVER TAKEN 2009cdc: c4 27 20 7c st %g2, [ %i4 + 0x7c ] 2009ce0: 80 a6 60 02 cmp %i1, 2 2009ce4: 04 80 00 11 ble 2009d28 2009ce8: 07 00 80 8e sethi %hi(0x2023800), %g3 2009cec: 80 a6 60 04 cmp %i1, 4 2009cf0: 12 80 00 08 bne 2009d10 <== NEVER TAKEN 2009cf4: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2009cf8: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 2009cfc: 40 00 11 21 call 200e180 <_Watchdog_Remove> 2009d00: 90 07 60 a8 add %i5, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2009d04: 90 10 20 00 clr %o0 2009d08: 7f ff ff 7e call 2009b00 <_POSIX_Threads_Sporadic_budget_TSR> 2009d0c: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2009d10: 40 00 0c 91 call 200cf54 <_Thread_Enable_dispatch> 2009d14: 01 00 00 00 nop return 0; 2009d18: 81 c7 e0 08 ret 2009d1c: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return ESRCH; } 2009d20: 81 c7 e0 08 ret 2009d24: 91 e8 20 03 restore %g0, 3, %o0 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009d28: 05 00 80 92 sethi %hi(0x2024800), %g2 2009d2c: d2 08 e3 b0 ldub [ %g3 + 0x3b0 ], %o1 2009d30: c4 00 a0 94 ld [ %g2 + 0x94 ], %g2 2009d34: 92 22 40 01 sub %o1, %g1, %o1 2009d38: c4 27 20 74 st %g2, [ %i4 + 0x74 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2009d3c: 90 10 00 1c mov %i4, %o0 case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; the_thread->real_priority = 2009d40: d2 27 20 18 st %o1, [ %i4 + 0x18 ] _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2009d44: 40 00 0b 47 call 200ca60 <_Thread_Change_priority> 2009d48: 94 10 20 01 mov 1, %o2 the_thread, the_thread->real_priority, true ); break; 2009d4c: 30 bf ff f1 b,a 2009d10 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 2009d50: 40 00 11 0c call 200e180 <_Watchdog_Remove> 2009d54: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2009d58: 10 bf ff ce b 2009c90 2009d5c: f2 27 60 84 st %i1, [ %i5 + 0x84 ] =============================================================================== 020075d4 : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20075d4: 9d e3 bf a0 save %sp, -96, %sp * Don't even think about deleting a resource from an ISR. * Besides this request is supposed to be for _Thread_Executing * and the ISR context is not a thread. */ if ( _ISR_Is_in_progress() ) 20075d8: 3b 00 80 82 sethi %hi(0x2020800), %i5 20075dc: ba 17 60 80 or %i5, 0x80, %i5 ! 2020880 <_Per_CPU_Information> 20075e0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20075e4: 80 a0 60 00 cmp %g1, 0 20075e8: 12 80 00 16 bne 2007640 <== NEVER TAKEN 20075ec: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20075f0: 03 00 80 80 sethi %hi(0x2020000), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20075f4: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20075f8: c6 00 63 40 ld [ %g1 + 0x340 ], %g3 20075fc: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 2007600: 86 00 e0 01 inc %g3 2007604: c6 20 63 40 st %g3, [ %g1 + 0x340 ] return _Thread_Dispatch_disable_level; 2007608: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200760c: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 2007610: 80 a0 60 00 cmp %g1, 0 2007614: 12 80 00 0d bne 2007648 <== NEVER TAKEN 2007618: 01 00 00 00 nop 200761c: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 2007620: 80 a0 60 00 cmp %g1, 0 2007624: 02 80 00 09 be 2007648 2007628: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 200762c: 40 00 0c 48 call 200a74c <_Thread_Enable_dispatch> 2007630: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2007634: f0 07 60 0c ld [ %i5 + 0xc ], %i0 2007638: 40 00 1c a1 call 200e8bc <_POSIX_Thread_Exit> 200763c: 81 e8 00 00 restore 2007640: 81 c7 e0 08 ret <== NOT EXECUTED 2007644: 81 e8 00 00 restore <== NOT EXECUTED _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2007648: 40 00 0c 41 call 200a74c <_Thread_Enable_dispatch> 200764c: 81 e8 00 00 restore =============================================================================== 02007d60 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2007d60: 9d e3 bf 78 save %sp, -136, %sp struct sched_param param; /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); 2007d64: 3b 00 80 86 sethi %hi(0x2021800), %i5 2007d68: 40 00 02 ca call 2008890 2007d6c: 90 17 63 4c or %i5, 0x34c, %o0 ! 2021b4c if (result != 0) { 2007d70: b8 92 20 00 orcc %o0, 0, %i4 2007d74: 12 80 00 46 bne 2007e8c <== NEVER TAKEN 2007d78: 90 10 00 18 mov %i0, %o0 return result; } /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); 2007d7c: 40 00 05 09 call 20091a0 2007d80: b6 17 63 4c or %i5, 0x34c, %i3 2007d84: 92 07 bf fc add %fp, -4, %o1 2007d88: 40 00 03 f7 call 2008d64 2007d8c: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2007d90: 40 00 05 04 call 20091a0 2007d94: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007d98: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2007d9c: c6 07 bf fc ld [ %fp + -4 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007da0: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 2007da4: c6 26 20 08 st %g3, [ %i0 + 8 ] /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007da8: c6 07 bf dc ld [ %fp + -36 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); 2007dac: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007db0: 84 20 c0 02 sub %g3, %g2, %g2 2007db4: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2007db8: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2007dbc: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 2007dc0: c0 20 60 38 clr [ %g1 + 0x38 ] pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2007dc4: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2007dc8: 80 a0 a0 00 cmp %g2, 0 2007dcc: 12 80 00 06 bne 2007de4 <== NEVER TAKEN 2007dd0: d2 00 40 00 ld [ %g1 ], %o1 2007dd4: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2 2007dd8: 80 a0 a0 04 cmp %g2, 4 2007ddc: 24 80 00 30 ble,a 2007e9c 2007de0: 90 06 e0 48 add %i3, 0x48, %o0 else { /* the maximum number of threads has been already created even though some of them might be idle. The request belongs to one of the active fd chain */ r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, 2007de4: 94 10 20 00 clr %o2 2007de8: 11 00 80 86 sethi %hi(0x2021800), %o0 2007dec: 7f ff ff 3b call 2007ad8 2007df0: 90 12 23 94 or %o0, 0x394, %o0 ! 2021b94 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 2007df4: b4 92 20 00 orcc %o0, 0, %i2 2007df8: 22 80 00 4a be,a 2007f20 2007dfc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 2007e00: b6 06 a0 1c add %i2, 0x1c, %i3 2007e04: 40 00 02 a3 call 2008890 2007e08: 90 10 00 1b mov %i3, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007e0c: c2 06 a0 08 ld [ %i2 + 8 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007e10: 86 06 a0 0c add %i2, 0xc, %g3 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2007e14: 80 a0 40 03 cmp %g1, %g3 2007e18: 02 80 00 13 be 2007e64 <== NEVER TAKEN 2007e1c: 90 06 a0 08 add %i2, 8, %o0 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007e20: c8 06 20 14 ld [ %i0 + 0x14 ], %g4 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007e24: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 while (req->aiocbp->aio_reqprio > prio && 2007e28: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 2007e2c: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 2007e30: 80 a0 80 04 cmp %g2, %g4 2007e34: 06 80 00 09 bl 2007e58 <== NEVER TAKEN 2007e38: 80 a0 c0 01 cmp %g3, %g1 RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2007e3c: 10 80 00 0a b 2007e64 2007e40: d0 00 60 04 ld [ %g1 + 4 ], %o0 !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007e44: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007e48: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 <== NOT EXECUTED 2007e4c: 80 a0 80 04 cmp %g2, %g4 <== NOT EXECUTED 2007e50: 16 80 00 04 bge 2007e60 <== NOT EXECUTED 2007e54: 80 a0 c0 01 cmp %g3, %g1 <== NOT EXECUTED 2007e58: 32 bf ff fb bne,a 2007e44 <== NOT EXECUTED 2007e5c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2007e60: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED 2007e64: 40 00 09 84 call 200a474 <_Chain_Insert> 2007e68: 92 10 00 18 mov %i0, %o1 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) { pthread_mutex_lock (&r_chain->mutex); rtems_aio_insert_prio (&r_chain->perfd, req); pthread_cond_signal (&r_chain->cond); 2007e6c: 40 00 01 65 call 2008400 2007e70: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007e74: 40 00 02 a7 call 2008910 2007e78: 90 10 00 1b mov %i3, %o0 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 2007e7c: 40 00 02 a5 call 2008910 2007e80: 90 17 63 4c or %i5, 0x34c, %o0 return 0; } 2007e84: 81 c7 e0 08 ret 2007e88: 91 e8 00 1c restore %g0, %i4, %o0 /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); if (result != 0) { free (req); 2007e8c: 7f ff ee 82 call 2003894 <== NOT EXECUTED 2007e90: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 2007e94: 81 c7 e0 08 ret <== NOT EXECUTED 2007e98: 81 e8 00 00 restore <== NOT EXECUTED if ((aio_request_queue.idle_threads == 0) && aio_request_queue.active_threads < AIO_MAX_THREADS) /* we still have empty places on the active_threads chain */ { chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007e9c: 7f ff ff 0f call 2007ad8 2007ea0: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007ea4: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 2007ea8: 80 a0 60 01 cmp %g1, 1 2007eac: 02 80 00 46 be 2007fc4 2007eb0: b4 10 00 08 mov %o0, %i2 } ++aio_request_queue.active_threads; } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 2007eb4: b6 02 20 1c add %o0, 0x1c, %i3 2007eb8: 40 00 02 76 call 2008890 2007ebc: 90 10 00 1b mov %i3, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007ec0: c2 06 a0 08 ld [ %i2 + 8 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007ec4: 88 06 a0 0c add %i2, 0xc, %g4 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2007ec8: 80 a0 40 04 cmp %g1, %g4 2007ecc: 02 bf ff e6 be 2007e64 <== NEVER TAKEN 2007ed0: 90 06 a0 08 add %i2, 8, %o0 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007ed4: c6 06 20 14 ld [ %i0 + 0x14 ], %g3 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007ed8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 while (req->aiocbp->aio_reqprio > prio && 2007edc: c6 00 e0 18 ld [ %g3 + 0x18 ], %g3 2007ee0: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 2007ee4: 80 a0 80 03 cmp %g2, %g3 2007ee8: 26 80 00 07 bl,a 2007f04 <== NEVER TAKEN 2007eec: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2007ef0: 10 bf ff dd b 2007e64 2007ef4: d0 00 60 04 ld [ %g1 + 4 ], %o0 2007ef8: 22 bf ff db be,a 2007e64 <== NOT EXECUTED 2007efc: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2007f00: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007f04: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007f08: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 <== NOT EXECUTED 2007f0c: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED 2007f10: 06 bf ff fa bl 2007ef8 <== NOT EXECUTED 2007f14: 80 a0 40 04 cmp %g1, %g4 <== NOT EXECUTED 2007f18: 10 bf ff d3 b 2007e64 <== NOT EXECUTED 2007f1c: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007f20: 11 00 80 86 sethi %hi(0x2021800), %o0 2007f24: d2 00 40 00 ld [ %g1 ], %o1 2007f28: 90 12 23 a0 or %o0, 0x3a0, %o0 2007f2c: 7f ff fe eb call 2007ad8 2007f30: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007f34: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 2007f38: 80 a0 60 01 cmp %g1, 1 2007f3c: 02 80 00 39 be 2008020 2007f40: b4 10 00 08 mov %o0, %i2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007f44: c2 02 20 08 ld [ %o0 + 8 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007f48: 88 02 20 0c add %o0, 0xc, %g4 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2007f4c: 80 a0 40 04 cmp %g1, %g4 2007f50: 02 80 00 0a be 2007f78 <== NEVER TAKEN 2007f54: 90 02 20 08 add %o0, 8, %o0 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007f58: c6 06 20 14 ld [ %i0 + 0x14 ], %g3 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007f5c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 while (req->aiocbp->aio_reqprio > prio && 2007f60: c6 00 e0 18 ld [ %g3 + 0x18 ], %g3 2007f64: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 2007f68: 80 a0 80 03 cmp %g2, %g3 2007f6c: 26 80 00 0f bl,a 2007fa8 <== NEVER TAKEN 2007f70: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2007f74: d0 00 60 04 ld [ %g1 + 4 ], %o0 2007f78: 40 00 09 3f call 200a474 <_Chain_Insert> 2007f7c: 92 10 00 18 mov %i0, %o1 pthread_mutex_init (&r_chain->mutex, NULL); pthread_cond_init (&r_chain->cond, NULL); } else /* just insert the request in the existing fd chain */ rtems_aio_insert_prio (&r_chain->perfd, req); if (aio_request_queue.idle_threads > 0) 2007f80: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 2007f84: 80 a0 60 00 cmp %g1, 0 2007f88: 04 bf ff bd ble 2007e7c <== ALWAYS TAKEN 2007f8c: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 2007f90: 40 00 01 1c call 2008400 <== NOT EXECUTED 2007f94: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED 2007f98: 30 bf ff b9 b,a 2007e7c <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007f9c: 22 bf ff f7 be,a 2007f78 <== NOT EXECUTED 2007fa0: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2007fa4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007fa8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007fac: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 <== NOT EXECUTED 2007fb0: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED 2007fb4: 06 bf ff fa bl 2007f9c <== NOT EXECUTED 2007fb8: 80 a0 40 04 cmp %g1, %g4 <== NOT EXECUTED 2007fbc: 10 bf ff ef b 2007f78 <== NOT EXECUTED 2007fc0: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 2007fc4: 90 02 20 08 add %o0, 8, %o0 2007fc8: 40 00 09 2b call 200a474 <_Chain_Insert> 2007fcc: 92 10 00 18 mov %i0, %o1 r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); if (r_chain->new_fd == 1) { rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 2007fd0: 92 10 20 00 clr %o1 chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); if (r_chain->new_fd == 1) { rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 2007fd4: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007fd8: 40 00 01 d6 call 2008730 2007fdc: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2007fe0: 92 10 20 00 clr %o1 2007fe4: 40 00 00 d7 call 2008340 2007fe8: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007fec: 90 07 bf f8 add %fp, -8, %o0 2007ff0: 92 06 e0 08 add %i3, 8, %o1 2007ff4: 96 10 00 1a mov %i2, %o3 2007ff8: 15 00 80 1d sethi %hi(0x2007400), %o2 2007ffc: 40 00 02 b9 call 2008ae0 2008000: 94 12 a3 24 or %o2, 0x324, %o2 ! 2007724 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2008004: 82 92 20 00 orcc %o0, 0, %g1 2008008: 12 80 00 12 bne 2008050 <== NEVER TAKEN 200800c: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2008010: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2008014: 82 00 60 01 inc %g1 2008018: 10 bf ff 99 b 2007e7c 200801c: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] 2008020: 92 10 00 18 mov %i0, %o1 2008024: 40 00 09 14 call 200a474 <_Chain_Insert> 2008028: 90 02 20 08 add %o0, 8, %o0 /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 200802c: 90 06 a0 1c add %i2, 0x1c, %o0 if (r_chain->new_fd == 1) { /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 2008030: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2008034: 40 00 01 bf call 2008730 2008038: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 200803c: 90 06 a0 20 add %i2, 0x20, %o0 2008040: 40 00 00 c0 call 2008340 2008044: 92 10 20 00 clr %o1 } else /* just insert the request in the existing fd chain */ rtems_aio_insert_prio (&r_chain->perfd, req); if (aio_request_queue.idle_threads > 0) 2008048: 10 bf ff cf b 2007f84 200804c: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, rtems_aio_handle, (void *) r_chain); if (result != 0) { pthread_mutex_unlock (&aio_request_queue.mutex); 2008050: 40 00 02 30 call 2008910 <== NOT EXECUTED 2008054: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED return result; 2008058: 30 bf ff 8b b,a 2007e84 <== NOT EXECUTED =============================================================================== 02007724 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2007724: 9d e3 bf 78 save %sp, -136, %sp struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); 2007728: 37 00 80 86 sethi %hi(0x2021800), %i3 200772c: b8 06 20 1c add %i0, 0x1c, %i4 2007730: b6 16 e3 4c or %i3, 0x34c, %i3 if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007734: b2 10 00 1b mov %i3, %i1 2007738: a0 10 00 1b mov %i3, %l0 pthread_cond_destroy (&r_chain->cond); free (r_chain); /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 200773c: a2 06 e0 58 add %i3, 0x58, %l1 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007740: b4 06 e0 4c add %i3, 0x4c, %i2 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2007744: 40 00 04 53 call 2008890 2007748: 90 10 00 1c mov %i4, %o0 if (result != 0) 200774c: 80 a2 20 00 cmp %o0, 0 2007750: 12 80 00 2b bne 20077fc <== NEVER TAKEN 2007754: 01 00 00 00 nop 2007758: fa 06 20 08 ld [ %i0 + 8 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200775c: 82 06 20 0c add %i0, 0xc, %g1 /* If the locked chain is not empty, take the first request extract it, unlock the chain and process the request, in this way the user can supply more requests to this fd chain */ if (!rtems_chain_is_empty (chain)) { 2007760: 80 a7 40 01 cmp %i5, %g1 2007764: 02 80 00 41 be 2007868 2007768: 01 00 00 00 nop node = rtems_chain_first (chain); req = (rtems_aio_request *) node; /* See _POSIX_PRIORITIZE_IO and _POSIX_PRIORITY_SCHEDULING discussion in rtems_aio_enqueue () */ pthread_getschedparam (pthread_self(), &policy, ¶m); 200776c: 40 00 06 8d call 20091a0 2007770: 01 00 00 00 nop 2007774: 92 07 bf fc add %fp, -4, %o1 2007778: 40 00 05 7b call 2008d64 200777c: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2007780: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2007784: 40 00 06 87 call 20091a0 2007788: c2 27 bf d8 st %g1, [ %fp + -40 ] 200778c: d2 07 60 08 ld [ %i5 + 8 ], %o1 2007790: 40 00 06 88 call 20091b0 2007794: 94 07 bf d8 add %fp, -40, %o2 2007798: 40 00 0b 1f call 200a414 <_Chain_Extract> 200779c: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 20077a0: 40 00 04 5c call 2008910 20077a4: 90 10 00 1c mov %i4, %o0 switch (req->aiocbp->aio_lio_opcode) { 20077a8: e4 07 60 14 ld [ %i5 + 0x14 ], %l2 20077ac: c2 04 a0 30 ld [ %l2 + 0x30 ], %g1 20077b0: 80 a0 60 02 cmp %g1, 2 20077b4: 22 80 00 25 be,a 2007848 20077b8: c4 1c a0 08 ldd [ %l2 + 8 ], %g2 20077bc: 80 a0 60 03 cmp %g1, 3 20077c0: 02 80 00 1e be 2007838 <== NEVER TAKEN 20077c4: 01 00 00 00 nop 20077c8: 80 a0 60 01 cmp %g1, 1 20077cc: 22 80 00 0e be,a 2007804 <== ALWAYS TAKEN 20077d0: c4 1c a0 08 ldd [ %l2 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 20077d4: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 20077d8: 40 00 30 cb call 2013b04 <__errno> <== NOT EXECUTED 20077dc: c2 24 a0 38 st %g1, [ %l2 + 0x38 ] <== NOT EXECUTED 20077e0: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 20077e4: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 20077e8: 40 00 04 2a call 2008890 <== NOT EXECUTED 20077ec: c2 24 a0 34 st %g1, [ %l2 + 0x34 ] <== NOT EXECUTED if (result != 0) 20077f0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20077f4: 22 bf ff da be,a 200775c <== NOT EXECUTED 20077f8: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 20077fc: 81 c7 e0 08 ret 2007800: 91 e8 20 00 restore %g0, 0, %o0 pthread_mutex_unlock (&r_chain->mutex); switch (req->aiocbp->aio_lio_opcode) { case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2007804: d0 04 80 00 ld [ %l2 ], %o0 2007808: d2 04 a0 10 ld [ %l2 + 0x10 ], %o1 200780c: d4 04 a0 14 ld [ %l2 + 0x14 ], %o2 2007810: 96 10 00 02 mov %g2, %o3 2007814: 40 00 33 cb call 2014740 2007818: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 200781c: 80 a2 3f ff cmp %o0, -1 2007820: 22 bf ff ed be,a 20077d4 <== NEVER TAKEN 2007824: e4 07 60 14 ld [ %i5 + 0x14 ], %l2 <== NOT EXECUTED req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 2007828: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200782c: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2007830: 10 bf ff c5 b 2007744 2007834: c0 20 60 34 clr [ %g1 + 0x34 ] req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2007838: 40 00 20 46 call 200f950 <== NOT EXECUTED 200783c: d0 04 80 00 ld [ %l2 ], %o0 <== NOT EXECUTED break; 2007840: 10 bf ff f8 b 2007820 <== NOT EXECUTED 2007844: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2007848: d0 04 80 00 ld [ %l2 ], %o0 200784c: d2 04 a0 10 ld [ %l2 + 0x10 ], %o1 2007850: d4 04 a0 14 ld [ %l2 + 0x14 ], %o2 2007854: 96 10 00 02 mov %g2, %o3 2007858: 40 00 33 f8 call 2014838 200785c: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2007860: 10 bf ff f0 b 2007820 2007864: 80 a2 3f ff cmp %o0, -1 struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); 2007868: 40 00 04 2a call 2008910 200786c: 90 10 00 1c mov %i4, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2007870: 40 00 04 08 call 2008890 2007874: 90 10 00 1b mov %i3, %o0 if (rtems_chain_is_empty (chain)) 2007878: c2 06 20 08 ld [ %i0 + 8 ], %g1 200787c: 80 a7 40 01 cmp %i5, %g1 2007880: 02 80 00 05 be 2007894 <== ALWAYS TAKEN 2007884: 92 07 bf f4 add %fp, -12, %o1 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 2007888: 40 00 04 22 call 2008910 200788c: 90 10 00 1b mov %i3, %o0 2007890: 30 bf ff ad b,a 2007744 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 2007894: 40 00 02 3e call 200818c 2007898: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 200789c: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20078a0: c0 27 bf f8 clr [ %fp + -8 ] pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20078a4: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20078a8: ba 06 20 20 add %i0, 0x20, %i5 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20078ac: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20078b0: 90 10 00 1d mov %i5, %o0 20078b4: 92 10 00 19 mov %i1, %o1 20078b8: 40 00 02 f1 call 200847c 20078bc: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no requests were added to the chain we delete the fd chain from the queue and start working with idle fd chains */ if (result == ETIMEDOUT) { 20078c0: 80 a2 20 74 cmp %o0, 0x74 20078c4: 12 bf ff f1 bne 2007888 <== NEVER TAKEN 20078c8: 01 00 00 00 nop 20078cc: 40 00 0a d2 call 200a414 <_Chain_Extract> 20078d0: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 20078d4: 40 00 03 44 call 20085e4 20078d8: 90 10 00 1c mov %i4, %o0 pthread_cond_destroy (&r_chain->cond); 20078dc: 40 00 02 63 call 2008268 20078e0: 90 10 00 1d mov %i5, %o0 free (r_chain); 20078e4: 7f ff ef ec call 2003894 20078e8: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20078ec: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 20078f0: 80 a6 00 11 cmp %i0, %l1 20078f4: 22 80 00 1d be,a 2007968 20078f8: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 20078fc: c4 04 20 68 ld [ %l0 + 0x68 ], %g2 ++aio_request_queue.active_threads; 2007900: c2 04 20 64 ld [ %l0 + 0x64 ], %g1 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2007904: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 2007908: 82 00 60 01 inc %g1 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 200790c: c4 24 20 68 st %g2, [ %l0 + 0x68 ] ++aio_request_queue.active_threads; 2007910: c2 24 20 64 st %g1, [ %l0 + 0x64 ] 2007914: 40 00 0a c0 call 200a414 <_Chain_Extract> 2007918: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200791c: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007920: c6 06 20 14 ld [ %i0 + 0x14 ], %g3 2007924: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2007928: 80 a0 80 03 cmp %g2, %g3 200792c: 06 80 00 08 bl 200794c <== ALWAYS TAKEN 2007930: 80 a0 40 1a cmp %g1, %i2 RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2007934: 10 80 00 09 b 2007958 <== NOT EXECUTED 2007938: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED 200793c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2007940: 80 a0 c0 02 cmp %g3, %g2 2007944: 04 80 00 04 ble 2007954 2007948: 80 a0 40 1a cmp %g1, %i2 200794c: 32 bf ff fc bne,a 200793c <== ALWAYS TAKEN 2007950: c2 00 40 00 ld [ %g1 ], %g1 2007954: d0 00 60 04 ld [ %g1 + 4 ], %o0 2007958: 92 10 00 18 mov %i0, %o1 200795c: 40 00 0a c6 call 200a474 <_Chain_Insert> 2007960: b8 06 20 1c add %i0, 0x1c, %i4 2007964: 30 bf ff c9 b,a 2007888 signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; 2007968: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 200796c: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 2007970: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2007974: 92 07 bf f4 add %fp, -12, %o1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 2007978: c4 26 e0 68 st %g2, [ %i3 + 0x68 ] --aio_request_queue.active_threads; 200797c: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 2007980: 40 00 02 03 call 200818c 2007984: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2007988: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 200798c: c0 27 bf f8 clr [ %fp + -8 ] AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2007990: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2007994: 90 06 e0 04 add %i3, 4, %o0 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2007998: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 200799c: 92 10 00 1b mov %i3, %o1 20079a0: 40 00 02 b7 call 200847c 20079a4: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { 20079a8: 80 a2 20 74 cmp %o0, 0x74 20079ac: 22 80 00 04 be,a 20079bc <== ALWAYS TAKEN 20079b0: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20079b4: 10 bf ff d2 b 20078fc <== NOT EXECUTED 20079b8: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 <== NOT EXECUTED AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 20079bc: 90 10 00 1b mov %i3, %o0 /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 20079c0: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20079c4: 40 00 03 d3 call 2008910 20079c8: c2 26 e0 68 st %g1, [ %i3 + 0x68 ] return NULL; 20079cc: 30 bf ff 8c b,a 20077fc =============================================================================== 020079d0 : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 20079d0: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 20079d4: 3b 00 80 86 sethi %hi(0x2021800), %i5 20079d8: 40 00 04 27 call 2008a74 20079dc: 90 17 63 54 or %i5, 0x354, %o0 ! 2021b54 if (result != 0) 20079e0: b0 92 20 00 orcc %o0, 0, %i0 20079e4: 12 80 00 23 bne 2007a70 <== NEVER TAKEN 20079e8: 90 17 63 54 or %i5, 0x354, %o0 return result; result = 20079ec: 40 00 04 2e call 2008aa4 20079f0: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 20079f4: 80 a2 20 00 cmp %o0, 0 20079f8: 12 80 00 20 bne 2007a78 <== NEVER TAKEN 20079fc: 39 00 80 86 sethi %hi(0x2021800), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2007a00: 92 10 20 00 clr %o1 2007a04: 40 00 03 4b call 2008730 2007a08: 90 17 23 4c or %i4, 0x34c, %o0 if (result != 0) 2007a0c: 80 a2 20 00 cmp %o0, 0 2007a10: 12 80 00 23 bne 2007a9c <== NEVER TAKEN 2007a14: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2007a18: 11 00 80 86 sethi %hi(0x2021800), %o0 2007a1c: 40 00 02 49 call 2008340 2007a20: 90 12 23 50 or %o0, 0x350, %o0 ! 2021b50 if (result != 0) { 2007a24: b0 92 20 00 orcc %o0, 0, %i0 2007a28: 12 80 00 26 bne 2007ac0 <== NEVER TAKEN 2007a2c: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007a30: b8 17 23 4c or %i4, 0x34c, %i4 head->previous = NULL; tail->previous = head; 2007a34: 82 07 20 54 add %i4, 0x54, %g1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007a38: 88 07 20 4c add %i4, 0x4c, %g4 head->previous = NULL; tail->previous = head; 2007a3c: 86 07 20 48 add %i4, 0x48, %g3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007a40: 84 07 20 58 add %i4, 0x58, %g2 head->previous = NULL; tail->previous = head; 2007a44: c2 27 20 5c st %g1, [ %i4 + 0x5c ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007a48: c8 27 20 48 st %g4, [ %i4 + 0x48 ] head->previous = NULL; 2007a4c: c0 27 20 4c clr [ %i4 + 0x4c ] tail->previous = head; 2007a50: c6 27 20 50 st %g3, [ %i4 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007a54: c4 27 20 54 st %g2, [ %i4 + 0x54 ] head->previous = NULL; 2007a58: c0 27 20 58 clr [ %i4 + 0x58 ] } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 2007a5c: c0 27 20 64 clr [ %i4 + 0x64 ] aio_request_queue.idle_threads = 0; 2007a60: c0 27 20 68 clr [ %i4 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2007a64: 03 00 00 2c sethi %hi(0xb000), %g1 2007a68: 82 10 60 0b or %g1, 0xb, %g1 ! b00b 2007a6c: c2 27 20 60 st %g1, [ %i4 + 0x60 ] return result; } 2007a70: 81 c7 e0 08 ret 2007a74: 81 e8 00 00 restore result = pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) pthread_attr_destroy (&aio_request_queue.attr); 2007a78: 40 00 03 f3 call 2008a44 <== NOT EXECUTED 2007a7c: 90 17 63 54 or %i5, 0x354, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2007a80: 39 00 80 86 sethi %hi(0x2021800), %i4 <== NOT EXECUTED 2007a84: 92 10 20 00 clr %o1 <== NOT EXECUTED 2007a88: 40 00 03 2a call 2008730 <== NOT EXECUTED 2007a8c: 90 17 23 4c or %i4, 0x34c, %o0 <== NOT EXECUTED if (result != 0) 2007a90: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2007a94: 02 bf ff e1 be 2007a18 <== NOT EXECUTED 2007a98: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007a9c: 40 00 03 ea call 2008a44 <== NOT EXECUTED 2007aa0: 90 17 63 54 or %i5, 0x354, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2007aa4: 92 10 20 00 clr %o1 <== NOT EXECUTED 2007aa8: 11 00 80 86 sethi %hi(0x2021800), %o0 <== NOT EXECUTED 2007aac: 40 00 02 25 call 2008340 <== NOT EXECUTED 2007ab0: 90 12 23 50 or %o0, 0x350, %o0 ! 2021b50 <== NOT EXECUTED if (result != 0) { 2007ab4: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2007ab8: 22 bf ff df be,a 2007a34 <== NOT EXECUTED 2007abc: b8 17 23 4c or %i4, 0x34c, %i4 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 2007ac0: 40 00 02 c9 call 20085e4 <== NOT EXECUTED 2007ac4: 90 17 23 4c or %i4, 0x34c, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007ac8: 40 00 03 df call 2008a44 <== NOT EXECUTED 2007acc: 90 17 63 54 or %i5, 0x354, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007ad0: 10 bf ff d9 b 2007a34 <== NOT EXECUTED 2007ad4: b8 17 23 4c or %i4, 0x34c, %i4 <== NOT EXECUTED =============================================================================== 02007c34 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 2007c34: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007c38: c2 06 00 00 ld [ %i0 ], %g1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007c3c: 84 06 20 04 add %i0, 4, %g2 <== NOT EXECUTED rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2007c40: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007c44: 02 80 00 15 be 2007c98 <== NOT EXECUTED 2007c48: 86 10 00 19 mov %i1, %g3 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007c4c: de 06 60 14 ld [ %i1 + 0x14 ], %o7 <== NOT EXECUTED if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007c50: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED while (req->aiocbp->aio_reqprio > prio && 2007c54: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 <== NOT EXECUTED 2007c58: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 2007c5c: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2007c60: 26 80 00 07 bl,a 2007c7c <== NOT EXECUTED 2007c64: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2007c68: 10 80 00 0b b 2007c94 <== NOT EXECUTED 2007c6c: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 2007c70: 22 80 00 09 be,a 2007c94 <== NOT EXECUTED 2007c74: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2007c78: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007c7c: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007c80: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 2007c84: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2007c88: 06 bf ff fa bl 2007c70 <== NOT EXECUTED 2007c8c: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007c90: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 2007c94: b2 10 00 03 mov %g3, %i1 <== NOT EXECUTED 2007c98: 40 00 09 f7 call 200a474 <_Chain_Insert> <== NOT EXECUTED 2007c9c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007bbc : * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007bbc: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007bc0: 05 00 80 86 sethi %hi(0x2021800), %g2 <== NOT EXECUTED 2007bc4: 84 10 a3 4c or %g2, 0x34c, %g2 ! 2021b4c <== NOT EXECUTED 2007bc8: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 <== NOT EXECUTED rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007bcc: de 06 20 14 ld [ %i0 + 0x14 ], %o7 <== NOT EXECUTED 2007bd0: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007bd4: b2 10 00 18 mov %i0, %i1 <== NOT EXECUTED rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007bd8: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2007bdc: 16 80 00 10 bge 2007c1c <== NOT EXECUTED 2007be0: 86 10 00 01 mov %g1, %g3 <== NOT EXECUTED 2007be4: 84 00 a0 4c add %g2, 0x4c, %g2 <== NOT EXECUTED 2007be8: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007bec: 32 80 00 08 bne,a 2007c0c <== NOT EXECUTED 2007bf0: c6 00 40 00 ld [ %g1 ], %g3 <== NOT EXECUTED 2007bf4: 10 80 00 0b b 2007c20 <== NOT EXECUTED 2007bf8: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007bfc: 80 a0 c0 02 cmp %g3, %g2 <== NOT EXECUTED 2007c00: 02 80 00 0a be 2007c28 <== NOT EXECUTED 2007c04: 86 10 00 02 mov %g2, %g3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2007c08: c6 00 40 00 ld [ %g1 ], %g3 <== NOT EXECUTED 2007c0c: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 <== NOT EXECUTED 2007c10: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2007c14: 06 bf ff fa bl 2007bfc <== NOT EXECUTED 2007c18: 82 10 00 03 mov %g3, %g1 <== NOT EXECUTED 2007c1c: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007c20: 40 00 0a 15 call 200a474 <_Chain_Insert> <== NOT EXECUTED 2007c24: 81 e8 00 00 restore <== NOT EXECUTED 2007c28: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007c2c: 40 00 0a 12 call 200a474 <_Chain_Insert> <== NOT EXECUTED 2007c30: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007ca0 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2007ca0: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007ca4: fa 06 20 08 ld [ %i0 + 8 ], %i5 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 2007ca8: b4 10 20 8c mov 0x8c, %i2 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 2007cac: b0 06 20 0c add %i0, 0xc, %i0 rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2007cb0: 80 a7 40 18 cmp %i5, %i0 2007cb4: 02 80 00 0d be 2007ce8 <== NEVER TAKEN 2007cb8: b6 10 3f ff mov -1, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007cbc: 40 00 09 d6 call 200a414 <_Chain_Extract> 2007cc0: 90 10 00 1d mov %i5, %o0 { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 2007cc4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2007cc8: f8 07 40 00 ld [ %i5 ], %i4 req->aiocbp->return_value = -1; free (req); 2007ccc: 90 10 00 1d mov %i5, %o0 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 2007cd0: f4 20 60 34 st %i2, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 2007cd4: 7f ff ee f0 call 2003894 2007cd8: f6 20 60 38 st %i3, [ %g1 + 0x38 ] rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2007cdc: 80 a7 00 18 cmp %i4, %i0 2007ce0: 12 bf ff f7 bne 2007cbc 2007ce4: ba 10 00 1c mov %i4, %i5 2007ce8: 81 c7 e0 08 ret 2007cec: 81 e8 00 00 restore =============================================================================== 02007cf0 : * AIO_NOTCANCELED - if request was not canceled * AIO_CANCELED - if request was canceled */ int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp) { 2007cf0: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2007cf4: fa 06 00 00 ld [ %i0 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007cf8: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2007cfc: 80 a7 40 01 cmp %i5, %g1 2007d00: 12 80 00 06 bne 2007d18 2007d04: b0 10 20 02 mov 2, %i0 2007d08: 30 80 00 14 b,a 2007d58 rtems_chain_node *node = rtems_chain_first (chain); rtems_aio_request *current; current = (rtems_aio_request *) node; while (!rtems_chain_is_tail (chain, node) && current->aiocbp != aiocbp) { 2007d0c: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2007d10: 02 80 00 10 be 2007d50 <== NOT EXECUTED 2007d14: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED 2007d18: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2007d1c: 80 a0 80 19 cmp %g2, %i1 2007d20: 32 bf ff fb bne,a 2007d0c <== NEVER TAKEN 2007d24: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2007d28: 40 00 09 bb call 200a414 <_Chain_Extract> 2007d2c: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; 2007d30: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2007d34: 84 10 20 8c mov 0x8c, %g2 2007d38: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2007d3c: 84 10 3f ff mov -1, %g2 free (current); 2007d40: 90 10 00 1d mov %i5, %o0 return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; current->aiocbp->return_value = -1; 2007d44: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2007d48: 7f ff ee d3 call 2003894 2007d4c: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2007d50: 81 c7 e0 08 ret 2007d54: 81 e8 00 00 restore } 2007d58: 81 c7 e0 08 ret 2007d5c: 81 e8 00 00 restore =============================================================================== 02007ec8 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007ec8: 9d e3 bf 98 save %sp, -104, %sp 2007ecc: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2007ed0: 40 00 01 b2 call 2008598 <_Chain_Get> 2007ed4: 90 10 00 1d mov %i5, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2007ed8: 92 10 20 00 clr %o1 2007edc: b8 10 00 08 mov %o0, %i4 2007ee0: 94 10 00 1a mov %i2, %o2 2007ee4: 90 10 00 19 mov %i1, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007ee8: 80 a7 20 00 cmp %i4, 0 2007eec: 12 80 00 0a bne 2007f14 2007ef0: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2007ef4: 7f ff fc f4 call 20072c4 2007ef8: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2007efc: 80 a2 20 00 cmp %o0, 0 2007f00: 02 bf ff f4 be 2007ed0 <== NEVER TAKEN 2007f04: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 2007f08: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007f0c: 81 c7 e0 08 ret 2007f10: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007f14: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2007f18: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007f1c: 81 c7 e0 08 ret 2007f20: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02008c38 : rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2008c38: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2008c3c: 03 00 80 90 sethi %hi(0x2024000), %g1 2008c40: c4 00 62 08 ld [ %g1 + 0x208 ], %g2 ! 2024208 <_Per_CPU_Information+0x8> rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2008c44: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2008c48: 03 00 80 91 sethi %hi(0x2024400), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2008c4c: 88 10 20 12 mov 0x12, %g4 rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2008c50: 80 a0 a0 00 cmp %g2, 0 2008c54: 02 80 00 04 be 2008c64 2008c58: de 00 62 44 ld [ %g1 + 0x244 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2008c5c: 81 c7 e0 08 ret 2008c60: 91 e8 00 04 restore %g0, %g4, %o0 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 2008c64: 80 a6 a0 00 cmp %i2, 0 2008c68: 02 80 00 40 be 2008d68 2008c6c: 80 a6 60 00 cmp %i1, 0 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 2008c70: 02 80 00 3e be 2008d68 2008c74: de 26 80 00 st %o7, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008c78: c4 06 40 00 ld [ %i1 ], %g2 2008c7c: 80 a0 a0 00 cmp %g2, 0 2008c80: 22 80 00 37 be,a 2008d5c 2008c84: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 2008c88: 80 a3 c0 18 cmp %o7, %i0 2008c8c: 08 bf ff f4 bleu 2008c5c 2008c90: 88 10 20 0a mov 0xa, %g4 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008c94: 05 00 80 8f sethi %hi(0x2023c00), %g2 2008c98: c8 00 a0 c0 ld [ %g2 + 0xc0 ], %g4 ! 2023cc0 <_Thread_Dispatch_disable_level> 2008c9c: 88 01 20 01 inc %g4 2008ca0: c8 20 a0 c0 st %g4, [ %g2 + 0xc0 ] return _Thread_Dispatch_disable_level; 2008ca4: c4 00 a0 c0 ld [ %g2 + 0xc0 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2008ca8: 80 a6 20 00 cmp %i0, 0 2008cac: 12 80 00 32 bne 2008d74 2008cb0: 1f 00 80 91 sethi %hi(0x2024400), %o7 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2008cb4: c8 00 62 44 ld [ %g1 + 0x244 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2008cb8: 80 a1 20 00 cmp %g4, 0 2008cbc: 02 80 00 45 be 2008dd0 <== NEVER TAKEN 2008cc0: c2 03 e2 48 ld [ %o7 + 0x248 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008cc4: 10 80 00 06 b 2008cdc 2008cc8: c4 00 40 00 ld [ %g1 ], %g2 rtems_device_major_number n = _IO_Number_of_drivers; rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2008ccc: 80 a6 00 04 cmp %i0, %g4 2008cd0: 02 80 00 35 be 2008da4 2008cd4: 82 00 60 18 add %g1, 0x18, %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008cd8: c4 00 40 00 ld [ %g1 ], %g2 2008cdc: 80 a0 a0 00 cmp %g2, 0 2008ce0: 32 bf ff fb bne,a 2008ccc 2008ce4: b0 06 20 01 inc %i0 2008ce8: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008cec: 80 a0 a0 00 cmp %g2, 0 2008cf0: 32 bf ff f7 bne,a 2008ccc 2008cf4: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2008cf8: f0 26 80 00 st %i0, [ %i2 ] 2008cfc: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2008d00: 80 a1 00 18 cmp %g4, %i0 2008d04: 02 80 00 29 be 2008da8 <== NEVER TAKEN 2008d08: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2008d0c: c8 00 c0 00 ld [ %g3 ], %g4 2008d10: c4 03 e2 48 ld [ %o7 + 0x248 ], %g2 2008d14: 82 23 40 01 sub %o5, %g1, %g1 2008d18: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2008d1c: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2008d20: 82 00 80 01 add %g2, %g1, %g1 2008d24: c8 20 60 04 st %g4, [ %g1 + 4 ] 2008d28: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2008d2c: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2008d30: c4 20 60 08 st %g2, [ %g1 + 8 ] 2008d34: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2008d38: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2008d3c: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2008d40: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2008d44: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2008d48: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2008d4c: 40 00 08 52 call 200ae94 <_Thread_Enable_dispatch> 2008d50: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2008d54: 40 00 27 6c call 2012b04 2008d58: 81 e8 00 00 restore static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008d5c: 80 a0 a0 00 cmp %g2, 0 2008d60: 12 bf ff cb bne 2008c8c 2008d64: 80 a3 c0 18 cmp %o7, %i0 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 2008d68: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2008d6c: 81 c7 e0 08 ret 2008d70: 91 e8 00 04 restore %g0, %g4, %o0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 2008d74: c8 03 e2 48 ld [ %o7 + 0x248 ], %g4 2008d78: 83 2e 20 03 sll %i0, 3, %g1 2008d7c: 9b 2e 20 05 sll %i0, 5, %o5 2008d80: 84 23 40 01 sub %o5, %g1, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008d84: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2008d88: 80 a3 20 00 cmp %o4, 0 2008d8c: 02 80 00 0b be 2008db8 2008d90: 84 01 00 02 add %g4, %g2, %g2 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 2008d94: 40 00 08 40 call 200ae94 <_Thread_Enable_dispatch> 2008d98: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2008d9c: 10 bf ff b0 b 2008c5c 2008da0: 88 10 20 0c mov 0xc, %g4 ! c if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2008da4: f0 26 80 00 st %i0, [ %i2 ] if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2008da8: 40 00 08 3b call 200ae94 <_Thread_Enable_dispatch> 2008dac: 01 00 00 00 nop return sc; 2008db0: 10 bf ff ab b 2008c5c 2008db4: 88 10 20 05 mov 5, %g4 ! 5 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008db8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2008dbc: 80 a0 a0 00 cmp %g2, 0 2008dc0: 12 bf ff f5 bne 2008d94 2008dc4: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2008dc8: 10 bf ff d1 b 2008d0c 2008dcc: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2008dd0: 10 bf ff f6 b 2008da8 <== NOT EXECUTED 2008dd4: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 0200a09c : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 200a09c: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200a0a0: 80 a6 20 00 cmp %i0, 0 200a0a4: 02 80 00 20 be 200a124 <== NEVER TAKEN 200a0a8: 37 00 80 87 sethi %hi(0x2021c00), %i3 200a0ac: b6 16 e2 9c or %i3, 0x29c, %i3 ! 2021e9c <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200a0b0: b4 06 e0 0c add %i3, 0xc, %i2 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 200a0b4: c2 06 c0 00 ld [ %i3 ], %g1 200a0b8: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 200a0bc: 80 a7 20 00 cmp %i4, 0 200a0c0: 22 80 00 16 be,a 200a118 200a0c4: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200a0c8: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 200a0cc: 84 90 60 00 orcc %g1, 0, %g2 200a0d0: 22 80 00 12 be,a 200a118 200a0d4: b6 06 e0 04 add %i3, 4, %i3 200a0d8: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 200a0dc: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200a0e0: 83 2f 60 02 sll %i5, 2, %g1 200a0e4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 200a0e8: 90 90 60 00 orcc %g1, 0, %o0 200a0ec: 02 80 00 05 be 200a100 200a0f0: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 200a0f4: 9f c6 00 00 call %i0 200a0f8: 01 00 00 00 nop 200a0fc: c4 17 20 10 lduh [ %i4 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200a100: 83 28 a0 10 sll %g2, 0x10, %g1 200a104: 83 30 60 10 srl %g1, 0x10, %g1 200a108: 80 a0 40 1d cmp %g1, %i5 200a10c: 3a bf ff f5 bcc,a 200a0e0 200a110: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200a114: b6 06 e0 04 add %i3, 4, %i3 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 200a118: 80 a6 c0 1a cmp %i3, %i2 200a11c: 32 bf ff e7 bne,a 200a0b8 200a120: c2 06 c0 00 ld [ %i3 ], %g1 200a124: 81 c7 e0 08 ret 200a128: 81 e8 00 00 restore =============================================================================== 02008b38 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 2008b38: 9d e3 bf a0 save %sp, -96, %sp 2008b3c: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 2008b40: 80 a6 a0 00 cmp %i2, 0 2008b44: 02 80 00 21 be 2008bc8 2008b48: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008b4c: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 2008b50: b0 10 20 0a mov 0xa, %i0 * Validate parameters and look up information structure. */ if ( !info ) return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008b54: 40 00 07 a4 call 200a9e4 <_Objects_Get_information> 2008b58: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 2008b5c: 80 a2 20 00 cmp %o0, 0 2008b60: 02 80 00 1a be 2008bc8 2008b64: 01 00 00 00 nop /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 2008b68: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 2008b6c: c8 12 20 10 lduh [ %o0 + 0x10 ], %g4 return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 2008b70: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008b74: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 2008b78: c4 26 a0 04 st %g2, [ %i2 + 4 ] return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 2008b7c: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008b80: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 2008b84: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2008b88: 80 a1 20 00 cmp %g4, 0 2008b8c: 02 80 00 0d be 2008bc0 <== NEVER TAKEN 2008b90: 84 10 20 00 clr %g2 2008b94: de 02 20 1c ld [ %o0 + 0x1c ], %o7 2008b98: 86 10 20 01 mov 1, %g3 2008b9c: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 2008ba0: 87 28 e0 02 sll %g3, 2, %g3 2008ba4: c6 03 c0 03 ld [ %o7 + %g3 ], %g3 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2008ba8: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 2008bac: 80 a0 00 03 cmp %g0, %g3 2008bb0: 84 60 bf ff subx %g2, -1, %g2 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2008bb4: 80 a1 00 01 cmp %g4, %g1 2008bb8: 1a bf ff fa bcc 2008ba0 2008bbc: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 2008bc0: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 2008bc4: b0 10 20 00 clr %i0 } 2008bc8: 81 c7 e0 08 ret 2008bcc: 81 e8 00 00 restore =============================================================================== 02014880 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2014880: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2014884: 80 a6 20 00 cmp %i0, 0 2014888: 12 80 00 04 bne 2014898 201488c: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2014890: 81 c7 e0 08 ret 2014894: 91 e8 00 01 restore %g0, %g1, %o0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) return RTEMS_INVALID_NAME; if ( !starting_address ) 2014898: 80 a6 60 00 cmp %i1, 0 201489c: 02 bf ff fd be 2014890 20148a0: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 20148a4: 80 a7 60 00 cmp %i5, 0 20148a8: 02 bf ff fa be 2014890 <== NEVER TAKEN 20148ac: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 20148b0: 02 bf ff f8 be 2014890 20148b4: 82 10 20 08 mov 8, %g1 20148b8: 80 a6 a0 00 cmp %i2, 0 20148bc: 02 bf ff f5 be 2014890 20148c0: 80 a6 80 1b cmp %i2, %i3 20148c4: 0a bf ff f3 bcs 2014890 20148c8: 80 8e e0 07 btst 7, %i3 20148cc: 12 bf ff f1 bne 2014890 20148d0: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 20148d4: 12 bf ff ef bne 2014890 20148d8: 82 10 20 09 mov 9, %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20148dc: 03 00 80 f5 sethi %hi(0x203d400), %g1 20148e0: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 203d630 <_Thread_Dispatch_disable_level> 20148e4: 84 00 a0 01 inc %g2 20148e8: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 20148ec: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 * This function allocates a partition control block from * the inactive chain of free partition control blocks. */ RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void ) { return (Partition_Control *) _Objects_Allocate( &_Partition_Information ); 20148f0: 23 00 80 f5 sethi %hi(0x203d400), %l1 20148f4: 40 00 14 87 call 2019b10 <_Objects_Allocate> 20148f8: 90 14 60 4c or %l1, 0x4c, %o0 ! 203d44c <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 20148fc: a0 92 20 00 orcc %o0, 0, %l0 2014900: 02 80 00 1a be 2014968 2014904: 92 10 00 1b mov %i3, %o1 #endif the_partition->starting_address = starting_address; the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; 2014908: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 201490c: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2014910: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2014914: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2014918: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 201491c: 40 00 61 50 call 202ce5c <.udiv> 2014920: 90 10 00 1a mov %i2, %o0 the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 2014924: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2014928: 94 10 00 08 mov %o0, %o2 the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 201492c: 96 10 00 1b mov %i3, %o3 2014930: b8 04 20 24 add %l0, 0x24, %i4 2014934: 40 00 0d de call 20180ac <_Chain_Initialize> 2014938: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 201493c: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014940: a2 14 60 4c or %l1, 0x4c, %l1 2014944: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014948: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 201494c: 85 28 a0 02 sll %g2, 2, %g2 2014950: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2014954: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2014958: 40 00 19 d7 call 201b0b4 <_Thread_Enable_dispatch> 201495c: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2014960: 10 bf ff cc b 2014890 2014964: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2014968: 40 00 19 d3 call 201b0b4 <_Thread_Enable_dispatch> 201496c: 01 00 00 00 nop return RTEMS_TOO_MANY; 2014970: 10 bf ff c8 b 2014890 2014974: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 02008054 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2008054: 9d e3 bf 90 save %sp, -112, %sp RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get ( Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) 2008058: 11 00 80 84 sethi %hi(0x2021000), %o0 200805c: 92 10 00 18 mov %i0, %o1 2008060: 90 12 23 d4 or %o0, 0x3d4, %o0 2008064: 40 00 09 af call 200a720 <_Objects_Get> 2008068: 94 07 bf fc add %fp, -4, %o2 rtems_rate_monotonic_period_states local_state; ISR_Level level; the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 200806c: c2 07 bf fc ld [ %fp + -4 ], %g1 rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2008070: ba 10 00 18 mov %i0, %i5 2008074: b8 10 00 08 mov %o0, %i4 rtems_rate_monotonic_period_states local_state; ISR_Level level; the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 2008078: 80 a0 60 00 cmp %g1, 0 200807c: 12 80 00 0b bne 20080a8 2008080: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2008084: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2008088: 31 00 80 86 sethi %hi(0x2021800), %i0 200808c: b0 16 22 80 or %i0, 0x280, %i0 ! 2021a80 <_Per_CPU_Information> 2008090: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008094: 80 a0 80 01 cmp %g2, %g1 2008098: 02 80 00 06 be 20080b0 200809c: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 20080a0: 40 00 0d ae call 200b758 <_Thread_Enable_dispatch> 20080a4: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 20080a8: 81 c7 e0 08 ret 20080ac: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 20080b0: 12 80 00 0e bne 20080e8 20080b4: 01 00 00 00 nop switch ( the_period->state ) { 20080b8: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 20080bc: 80 a0 60 04 cmp %g1, 4 20080c0: 18 80 00 06 bgu 20080d8 <== NEVER TAKEN 20080c4: b0 10 20 00 clr %i0 20080c8: 83 28 60 02 sll %g1, 2, %g1 20080cc: 05 00 80 7c sethi %hi(0x201f000), %g2 20080d0: 84 10 a1 cc or %g2, 0x1cc, %g2 ! 201f1cc 20080d4: f0 00 80 01 ld [ %g2 + %g1 ], %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Scheduler_Release_job(the_period->owner, the_period->next_length); _Thread_Enable_dispatch(); 20080d8: 40 00 0d a0 call 200b758 <_Thread_Enable_dispatch> 20080dc: 01 00 00 00 nop return RTEMS_TIMEOUT; 20080e0: 81 c7 e0 08 ret 20080e4: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 20080e8: 7f ff ec 2d call 200319c 20080ec: 01 00 00 00 nop 20080f0: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 20080f4: f6 07 20 38 ld [ %i4 + 0x38 ], %i3 20080f8: 80 a6 e0 00 cmp %i3, 0 20080fc: 02 80 00 19 be 2008160 2008100: 80 a6 e0 02 cmp %i3, 2 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 2008104: 02 80 00 3b be 20081f0 2008108: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 200810c: 12 bf ff e7 bne 20080a8 <== NEVER TAKEN 2008110: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2008114: 7f ff ff 60 call 2007e94 <_Rate_monotonic_Update_statistics> 2008118: 90 10 00 1c mov %i4, %o0 _ISR_Enable( level ); 200811c: 7f ff ec 24 call 20031ac 2008120: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2008124: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2008128: 92 07 20 10 add %i4, 0x10, %o1 200812c: c2 27 20 38 st %g1, [ %i4 + 0x38 ] the_period->next_length = length; 2008130: f2 27 20 3c st %i1, [ %i4 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2008134: f2 27 20 1c st %i1, [ %i4 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2008138: 11 00 80 85 sethi %hi(0x2021400), %o0 200813c: 40 00 11 5b call 200c6a8 <_Watchdog_Insert> 2008140: 90 12 22 00 or %o0, 0x200, %o0 ! 2021600 <_Watchdog_Ticks_chain> 2008144: d0 07 20 40 ld [ %i4 + 0x40 ], %o0 2008148: d2 07 20 3c ld [ %i4 + 0x3c ], %o1 200814c: 03 00 80 82 sethi %hi(0x2020800), %g1 2008150: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 202080c <_Scheduler+0x34> 2008154: 9f c0 40 00 call %g1 2008158: b0 10 20 06 mov 6, %i0 200815c: 30 bf ff df b,a 20080d8 return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 2008160: 7f ff ec 13 call 20031ac 2008164: 01 00 00 00 nop void _Rate_monotonic_Initiate_statistics( Rate_monotonic_Control *the_period ) { Thread_Control *owning_thread = the_period->owner; 2008168: f6 07 20 40 ld [ %i4 + 0x40 ], %i3 _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); the_period->next_length = length; 200816c: f2 27 20 3c st %i1, [ %i4 + 0x3c ] * If using nanosecond statistics, we need to obtain the uptime. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; _TOD_Get_uptime( &uptime ); 2008170: 40 00 06 44 call 2009a80 <_TOD_Get_uptime> 2008174: 90 07 bf f0 add %fp, -16, %o0 the_period->time_period_initiated = uptime; #else the_period->time_period_initiated = _Watchdog_Ticks_since_boot; #endif the_period->cpu_usage_period_initiated = owning_thread->cpu_time_used; 2008178: d4 1e e0 80 ldd [ %i3 + 0x80 ], %o2 /* * Set the starting point and the CPU time used for the statistics. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ the_period->time_period_initiated = uptime; 200817c: c4 1f bf f0 ldd [ %fp + -16 ], %g2 * routine is invoked from rtems_rate_monotonic_period, the owner will * be the executing thread. When this routine is invoked from * _Rate_monotonic_Timeout, it will not. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2008180: c2 06 20 0c ld [ %i0 + 0xc ], %g1 /* * Set the starting point and the CPU time used for the statistics. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ the_period->time_period_initiated = uptime; 2008184: c4 3f 20 50 std %g2, [ %i4 + 0x50 ] * routine is invoked from rtems_rate_monotonic_period, the owner will * be the executing thread. When this routine is invoked from * _Rate_monotonic_Timeout, it will not. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2008188: 80 a6 c0 01 cmp %i3, %g1 200818c: 02 80 00 33 be 2008258 <== ALWAYS TAKEN 2008190: d4 3f 20 48 std %o2, [ %i4 + 0x48 ] 2008194: d0 07 20 40 ld [ %i4 + 0x40 ], %o0 2008198: d2 07 20 3c ld [ %i4 + 0x3c ], %o1 200819c: 03 00 80 82 sethi %hi(0x2020800), %g1 20081a0: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 202080c <_Scheduler+0x34> 20081a4: 9f c0 40 00 call %g1 20081a8: b0 10 20 00 clr %i0 /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); the_period->state = RATE_MONOTONIC_ACTIVE; 20081ac: 82 10 20 02 mov 2, %g1 20081b0: 92 07 20 10 add %i4, 0x10, %o1 20081b4: c2 27 20 38 st %g1, [ %i4 + 0x38 ] 20081b8: 11 00 80 85 sethi %hi(0x2021400), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20081bc: 03 00 80 21 sethi %hi(0x2008400), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20081c0: 90 12 22 00 or %o0, 0x200, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20081c4: 82 10 61 60 or %g1, 0x160, %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20081c8: c0 27 20 18 clr [ %i4 + 0x18 ] the_watchdog->routine = routine; 20081cc: c2 27 20 2c st %g1, [ %i4 + 0x2c ] the_watchdog->id = id; 20081d0: fa 27 20 30 st %i5, [ %i4 + 0x30 ] the_watchdog->user_data = user_data; 20081d4: c0 27 20 34 clr [ %i4 + 0x34 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20081d8: 40 00 11 34 call 200c6a8 <_Watchdog_Insert> 20081dc: f2 27 20 1c st %i1, [ %i4 + 0x1c ] id, NULL ); _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 20081e0: 40 00 0d 5e call 200b758 <_Thread_Enable_dispatch> 20081e4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20081e8: 81 c7 e0 08 ret 20081ec: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 20081f0: 7f ff ff 29 call 2007e94 <_Rate_monotonic_Update_statistics> 20081f4: 90 10 00 1c mov %i4, %o0 /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 20081f8: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 20081fc: f2 27 20 3c st %i1, [ %i4 + 0x3c ] /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 2008200: c2 27 20 38 st %g1, [ %i4 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2008204: 7f ff eb ea call 20031ac 2008208: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 200820c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008210: c4 07 20 08 ld [ %i4 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2008214: 90 10 00 01 mov %g1, %o0 2008218: 13 00 00 10 sethi %hi(0x4000), %o1 200821c: 40 00 0f ab call 200c0c8 <_Thread_Set_state> 2008220: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2008224: 7f ff eb de call 200319c 2008228: 01 00 00 00 nop local_state = the_period->state; 200822c: fa 07 20 38 ld [ %i4 + 0x38 ], %i5 the_period->state = RATE_MONOTONIC_ACTIVE; 2008230: f6 27 20 38 st %i3, [ %i4 + 0x38 ] _ISR_Enable( level ); 2008234: 7f ff eb de call 20031ac 2008238: 01 00 00 00 nop /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) 200823c: 80 a7 60 03 cmp %i5, 3 2008240: 22 80 00 0d be,a 2008274 2008244: d0 06 20 0c ld [ %i0 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 2008248: 40 00 0d 44 call 200b758 <_Thread_Enable_dispatch> 200824c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2008250: 81 c7 e0 08 ret 2008254: 81 e8 00 00 restore 2008258: d8 1e 20 20 ldd [ %i0 + 0x20 ], %o4 200825c: 86 a0 c0 0d subcc %g3, %o5, %g3 2008260: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008264: 86 82 c0 03 addcc %o3, %g3, %g3 2008268: 84 42 80 02 addx %o2, %g2, %g2 200826c: 10 bf ff ca b 2008194 2008270: c4 3f 20 48 std %g2, [ %i4 + 0x48 ] /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2008274: 40 00 0c 47 call 200b390 <_Thread_Clear_state> 2008278: 13 00 00 10 sethi %hi(0x4000), %o1 200827c: 30 bf ff f3 b,a 2008248 =============================================================================== 02008280 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2008280: 9d e3 bf 38 save %sp, -200, %sp rtems_id id; rtems_rate_monotonic_period_statistics the_stats; rtems_rate_monotonic_period_status the_status; char name[5]; if ( !print ) 2008284: 80 a6 60 00 cmp %i1, 0 2008288: 02 80 00 48 be 20083a8 <== NEVER TAKEN 200828c: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 2008290: 13 00 80 7c sethi %hi(0x201f000), %o1 2008294: 9f c6 40 00 call %i1 2008298: 92 12 61 e0 or %o1, 0x1e0, %o1 ! 201f1e0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 200829c: 90 10 00 18 mov %i0, %o0 20082a0: 13 00 80 7c sethi %hi(0x201f000), %o1 20082a4: 9f c6 40 00 call %i1 20082a8: 92 12 62 00 or %o1, 0x200, %o1 ! 201f200 (*print)( context, "--- Wall times are in seconds ---\n" ); 20082ac: 90 10 00 18 mov %i0, %o0 20082b0: 13 00 80 7c sethi %hi(0x201f000), %o1 20082b4: 9f c6 40 00 call %i1 20082b8: 92 12 62 28 or %o1, 0x228, %o1 ! 201f228 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 20082bc: 90 10 00 18 mov %i0, %o0 20082c0: 13 00 80 7c sethi %hi(0x201f000), %o1 20082c4: 9f c6 40 00 call %i1 20082c8: 92 12 62 50 or %o1, 0x250, %o1 ! 201f250 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 20082cc: 90 10 00 18 mov %i0, %o0 20082d0: 13 00 80 7c sethi %hi(0x201f000), %o1 20082d4: 9f c6 40 00 call %i1 20082d8: 92 12 62 a0 or %o1, 0x2a0, %o1 ! 201f2a0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20082dc: 39 00 80 84 sethi %hi(0x2021000), %i4 20082e0: b8 17 23 d4 or %i4, 0x3d4, %i4 ! 20213d4 <_Rate_monotonic_Information> 20082e4: fa 07 20 08 ld [ %i4 + 8 ], %i5 20082e8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20082ec: 80 a7 40 01 cmp %i5, %g1 20082f0: 18 80 00 2e bgu 20083a8 <== NEVER TAKEN 20082f4: 35 00 80 7c sethi %hi(0x201f000), %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 20082f8: 23 00 80 7c sethi %hi(0x201f000), %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 20082fc: 21 00 80 7c sethi %hi(0x201f000), %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2008300: 37 00 80 78 sethi %hi(0x201e000), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2008304: b4 16 a2 f0 or %i2, 0x2f0, %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 2008308: a2 14 63 08 or %l1, 0x308, %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 200830c: a0 14 23 28 or %l0, 0x328, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2008310: 10 80 00 06 b 2008328 2008314: b6 16 e2 f8 or %i3, 0x2f8, %i3 * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2008318: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 200831c: 80 a0 40 1d cmp %g1, %i5 2008320: 0a 80 00 22 bcs 20083a8 2008324: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2008328: 90 10 00 1d mov %i5, %o0 200832c: 40 00 1d cf call 200fa68 2008330: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 2008334: 80 a2 20 00 cmp %o0, 0 2008338: 32 bf ff f8 bne,a 2008318 200833c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 #if defined(RTEMS_DEBUG) status = rtems_rate_monotonic_get_status( id, &the_status ); if ( status != RTEMS_SUCCESSFUL ) continue; #else (void) rtems_rate_monotonic_get_status( id, &the_status ); 2008340: 92 07 bf d8 add %fp, -40, %o1 2008344: 40 00 1e 3b call 200fc30 2008348: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 200834c: d0 07 bf d8 ld [ %fp + -40 ], %o0 2008350: 92 10 20 05 mov 5, %o1 2008354: 40 00 00 b4 call 2008624 2008358: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200835c: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2008360: 92 10 00 1a mov %i2, %o1 2008364: 94 10 00 1d mov %i5, %o2 2008368: 90 10 00 18 mov %i0, %o0 200836c: 9f c6 40 00 call %i1 2008370: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2008374: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2008378: 94 07 bf f0 add %fp, -16, %o2 200837c: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2008380: 80 a0 60 00 cmp %g1, 0 2008384: 12 80 00 0b bne 20083b0 2008388: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 200838c: 9f c6 40 00 call %i1 2008390: 90 10 00 18 mov %i0, %o0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2008394: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2008398: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 200839c: 80 a0 40 1d cmp %g1, %i5 20083a0: 1a bf ff e3 bcc 200832c <== ALWAYS TAKEN 20083a4: 90 10 00 1d mov %i5, %o0 20083a8: 81 c7 e0 08 ret 20083ac: 81 e8 00 00 restore struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 20083b0: 40 00 0f ba call 200c298 <_Timespec_Divide_by_integer> 20083b4: 92 10 00 01 mov %g1, %o1 (*print)( context, 20083b8: d0 07 bf ac ld [ %fp + -84 ], %o0 20083bc: 40 00 4e f0 call 201bf7c <.div> 20083c0: 92 10 23 e8 mov 0x3e8, %o1 20083c4: aa 10 00 08 mov %o0, %l5 20083c8: d0 07 bf b4 ld [ %fp + -76 ], %o0 20083cc: 40 00 4e ec call 201bf7c <.div> 20083d0: 92 10 23 e8 mov 0x3e8, %o1 20083d4: c2 07 bf f0 ld [ %fp + -16 ], %g1 20083d8: a6 10 00 08 mov %o0, %l3 20083dc: d0 07 bf f4 ld [ %fp + -12 ], %o0 20083e0: e4 07 bf a8 ld [ %fp + -88 ], %l2 20083e4: e8 07 bf b0 ld [ %fp + -80 ], %l4 20083e8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20083ec: 40 00 4e e4 call 201bf7c <.div> 20083f0: 92 10 23 e8 mov 0x3e8, %o1 20083f4: 96 10 00 15 mov %l5, %o3 20083f8: 98 10 00 14 mov %l4, %o4 20083fc: 9a 10 00 13 mov %l3, %o5 2008400: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2008404: 92 10 00 11 mov %l1, %o1 2008408: 94 10 00 12 mov %l2, %o2 200840c: 9f c6 40 00 call %i1 2008410: 90 10 00 18 mov %i0, %o0 struct timespec wall_average; struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); 2008414: d2 07 bf a0 ld [ %fp + -96 ], %o1 2008418: 94 07 bf f0 add %fp, -16, %o2 200841c: 40 00 0f 9f call 200c298 <_Timespec_Divide_by_integer> 2008420: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2008424: d0 07 bf c4 ld [ %fp + -60 ], %o0 2008428: 40 00 4e d5 call 201bf7c <.div> 200842c: 92 10 23 e8 mov 0x3e8, %o1 2008430: a8 10 00 08 mov %o0, %l4 2008434: d0 07 bf cc ld [ %fp + -52 ], %o0 2008438: 40 00 4e d1 call 201bf7c <.div> 200843c: 92 10 23 e8 mov 0x3e8, %o1 2008440: c2 07 bf f0 ld [ %fp + -16 ], %g1 2008444: a4 10 00 08 mov %o0, %l2 2008448: d0 07 bf f4 ld [ %fp + -12 ], %o0 200844c: ea 07 bf c0 ld [ %fp + -64 ], %l5 2008450: e6 07 bf c8 ld [ %fp + -56 ], %l3 2008454: 92 10 23 e8 mov 0x3e8, %o1 2008458: 40 00 4e c9 call 201bf7c <.div> 200845c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2008460: 92 10 00 10 mov %l0, %o1 2008464: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2008468: 94 10 00 15 mov %l5, %o2 200846c: 90 10 00 18 mov %i0, %o0 2008470: 96 10 00 14 mov %l4, %o3 2008474: 98 10 00 13 mov %l3, %o4 2008478: 9f c6 40 00 call %i1 200847c: 9a 10 00 12 mov %l2, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2008480: 10 bf ff a6 b 2008318 2008484: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 020084a0 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 20084a0: 9d e3 bf a0 save %sp, -96, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20084a4: 03 00 80 85 sethi %hi(0x2021400), %g1 20084a8: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2021540 <_Thread_Dispatch_disable_level> 20084ac: 84 00 a0 01 inc %g2 20084b0: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 20084b4: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20084b8: 39 00 80 84 sethi %hi(0x2021000), %i4 20084bc: b8 17 23 d4 or %i4, 0x3d4, %i4 ! 20213d4 <_Rate_monotonic_Information> 20084c0: fa 07 20 08 ld [ %i4 + 8 ], %i5 20084c4: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20084c8: 80 a7 40 01 cmp %i5, %g1 20084cc: 18 80 00 09 bgu 20084f0 <== NEVER TAKEN 20084d0: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 20084d4: 40 00 00 09 call 20084f8 20084d8: 90 10 00 1d mov %i5, %o0 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20084dc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20084e0: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20084e4: 80 a0 40 1d cmp %g1, %i5 20084e8: 1a bf ff fb bcc 20084d4 20084ec: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 20084f0: 40 00 0c 9a call 200b758 <_Thread_Enable_dispatch> 20084f4: 81 e8 00 00 restore =============================================================================== 02016110 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2016110: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 2016114: 80 a6 60 00 cmp %i1, 0 2016118: 12 80 00 04 bne 2016128 201611c: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016120: 81 c7 e0 08 ret 2016124: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2016128: 90 10 00 18 mov %i0, %o0 201612c: 40 00 13 ef call 201b0e8 <_Thread_Get> 2016130: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2016134: c2 07 bf fc ld [ %fp + -4 ], %g1 2016138: 80 a0 60 00 cmp %g1, 0 201613c: 12 80 00 20 bne 20161bc 2016140: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2016144: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2016148: c2 07 60 0c ld [ %i5 + 0xc ], %g1 201614c: 80 a0 60 00 cmp %g1, 0 2016150: 02 80 00 1e be 20161c8 2016154: 01 00 00 00 nop if ( asr->is_enabled ) { 2016158: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 201615c: 80 a0 60 00 cmp %g1, 0 2016160: 02 80 00 1e be 20161d8 2016164: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016168: 7f ff e4 3d call 200f25c 201616c: 01 00 00 00 nop *signal_set |= signals; 2016170: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2016174: b2 10 40 19 or %g1, %i1, %i1 2016178: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 201617c: 7f ff e4 3c call 200f26c 2016180: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2016184: 03 00 80 f6 sethi %hi(0x203d800), %g1 2016188: 82 10 63 70 or %g1, 0x370, %g1 ! 203db70 <_Per_CPU_Information> 201618c: c4 00 60 08 ld [ %g1 + 8 ], %g2 2016190: 80 a0 a0 00 cmp %g2, 0 2016194: 02 80 00 06 be 20161ac 2016198: 01 00 00 00 nop 201619c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20161a0: 80 a7 00 02 cmp %i4, %g2 20161a4: 02 80 00 15 be 20161f8 <== ALWAYS TAKEN 20161a8: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 20161ac: 40 00 13 c2 call 201b0b4 <_Thread_Enable_dispatch> 20161b0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20161b4: 10 bf ff db b 2016120 20161b8: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20161bc: 82 10 20 04 mov 4, %g1 } 20161c0: 81 c7 e0 08 ret 20161c4: 91 e8 00 01 restore %g0, %g1, %o0 _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 20161c8: 40 00 13 bb call 201b0b4 <_Thread_Enable_dispatch> 20161cc: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 20161d0: 10 bf ff d4 b 2016120 20161d4: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 20161d8: 7f ff e4 21 call 200f25c 20161dc: 01 00 00 00 nop *signal_set |= signals; 20161e0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20161e4: b2 10 40 19 or %g1, %i1, %i1 20161e8: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 20161ec: 7f ff e4 20 call 200f26c 20161f0: 01 00 00 00 nop 20161f4: 30 bf ff ee b,a 20161ac if ( ! _ASR_Is_null_handler( asr->handler ) ) { if ( asr->is_enabled ) { _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; 20161f8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 20161fc: 30 bf ff ec b,a 20161ac =============================================================================== 02010fa4 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 2010fa4: 9d e3 bf a0 save %sp, -96, %sp ASR_Information *asr; bool is_asr_enabled = false; bool needs_asr_dispatching = false; rtems_mode old_mode; if ( !previous_mode_set ) 2010fa8: 80 a6 a0 00 cmp %i2, 0 2010fac: 02 80 00 3b be 2011098 2010fb0: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 2010fb4: 21 00 80 7e sethi %hi(0x201f800), %l0 2010fb8: a0 14 22 00 or %l0, 0x200, %l0 ! 201fa00 <_Per_CPU_Information> 2010fbc: fa 04 20 0c ld [ %l0 + 0xc ], %i5 api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010fc0: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 2010fc4: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010fc8: 80 a0 00 02 cmp %g0, %g2 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 2010fcc: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010fd0: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 2010fd4: 80 a0 60 00 cmp %g1, 0 2010fd8: 12 80 00 40 bne 20110d8 2010fdc: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 2010fe0: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 2010fe4: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 2010fe8: 7f ff e8 b7 call 200b2c4 <_CPU_ISR_Get_level> 2010fec: a2 60 3f ff subx %g0, -1, %l1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 2010ff0: a3 2c 60 0a sll %l1, 0xa, %l1 2010ff4: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 2010ff8: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 2010ffc: 80 8e 61 00 btst 0x100, %i1 2011000: 02 80 00 06 be 2011018 2011004: f6 26 80 00 st %i3, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 2011008: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 201100c: 80 a0 00 01 cmp %g0, %g1 2011010: 82 60 3f ff subx %g0, -1, %g1 2011014: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 2011018: 80 8e 62 00 btst 0x200, %i1 201101c: 12 80 00 21 bne 20110a0 2011020: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 2011024: 80 8e 60 0f btst 0xf, %i1 2011028: 12 80 00 27 bne 20110c4 201102c: 01 00 00 00 nop * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 2011030: 80 8e 64 00 btst 0x400, %i1 2011034: 02 80 00 14 be 2011084 2011038: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 201103c: c4 0f 20 08 ldub [ %i4 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 2011040: b0 0e 24 00 and %i0, 0x400, %i0 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 2011044: 80 a0 00 18 cmp %g0, %i0 2011048: 82 60 3f ff subx %g0, -1, %g1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 201104c: 80 a0 80 01 cmp %g2, %g1 2011050: 22 80 00 0e be,a 2011088 2011054: 03 00 80 7d sethi %hi(0x201f400), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 2011058: 7f ff c5 41 call 200255c 201105c: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 2011060: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 2011064: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 2011068: c4 27 20 14 st %g2, [ %i4 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 201106c: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 2011070: 7f ff c5 3f call 200256c 2011074: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 2011078: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 201107c: 80 a0 00 01 cmp %g0, %g1 2011080: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 2011084: 03 00 80 7d sethi %hi(0x201f400), %g1 2011088: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 201f618 <_System_state_Current> 201108c: 80 a0 a0 03 cmp %g2, 3 2011090: 02 80 00 1f be 201110c 2011094: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 2011098: 81 c7 e0 08 ret 201109c: 91 e8 00 01 restore %g0, %g1, %o0 */ if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { 20110a0: 22 bf ff e1 be,a 2011024 20110a4: c0 27 60 78 clr [ %i5 + 0x78 ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 20110a8: 03 00 80 7d sethi %hi(0x201f400), %g1 20110ac: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 ! 201f424 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 20110b0: 80 8e 60 0f btst 0xf, %i1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 20110b4: c2 27 60 74 st %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 20110b8: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 20110bc: 02 bf ff dd be 2011030 20110c0: c2 27 60 78 st %g1, [ %i5 + 0x78 ] */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 20110c4: 90 0e 20 0f and %i0, 0xf, %o0 */ RTEMS_INLINE_ROUTINE void _Modes_Set_interrupt_level ( Modes_Control mode_set ) { _ISR_Set_level( _Modes_Get_interrupt_level( mode_set ) ); 20110c8: 7f ff c5 29 call 200256c 20110cc: 91 2a 20 08 sll %o0, 8, %o0 * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 20110d0: 10 bf ff d9 b 2011034 20110d4: 80 8e 64 00 btst 0x400, %i1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 20110d8: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 20110dc: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 20110e0: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 20110e4: 7f ff e8 78 call 200b2c4 <_CPU_ISR_Get_level> 20110e8: a2 60 3f ff subx %g0, -1, %l1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 20110ec: a3 2c 60 0a sll %l1, 0xa, %l1 20110f0: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 20110f4: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 20110f8: 80 8e 61 00 btst 0x100, %i1 20110fc: 02 bf ff c7 be 2011018 2011100: f6 26 80 00 st %i3, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 2011104: 10 bf ff c2 b 201100c 2011108: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 201110c: 80 88 e0 ff btst 0xff, %g3 2011110: 12 80 00 0a bne 2011138 2011114: c4 04 20 0c ld [ %l0 + 0xc ], %g2 2011118: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 201111c: 80 a0 80 03 cmp %g2, %g3 2011120: 02 bf ff de be 2011098 2011124: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 2011128: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 201112c: 80 a0 a0 00 cmp %g2, 0 2011130: 02 bf ff da be 2011098 <== NEVER TAKEN 2011134: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 2011138: 82 10 20 01 mov 1, %g1 ! 1 201113c: c2 2c 20 18 stb %g1, [ %l0 + 0x18 ] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 2011140: 7f ff e2 de call 2009cb8 <_Thread_Dispatch> 2011144: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 2011148: 82 10 20 00 clr %g1 ! 0 } 201114c: 81 c7 e0 08 ret 2011150: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200c68c : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200c68c: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200c690: 80 a6 60 00 cmp %i1, 0 200c694: 02 80 00 07 be 200c6b0 200c698: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200c69c: 03 00 80 8e sethi %hi(0x2023800), %g1 200c6a0: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 ! 2023870 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200c6a4: 80 a6 40 01 cmp %i1, %g1 200c6a8: 18 80 00 1c bgu 200c718 200c6ac: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200c6b0: 80 a6 a0 00 cmp %i2, 0 200c6b4: 02 80 00 19 be 200c718 200c6b8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200c6bc: 40 00 0a 44 call 200efcc <_Thread_Get> 200c6c0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200c6c4: c2 07 bf fc ld [ %fp + -4 ], %g1 200c6c8: 80 a0 60 00 cmp %g1, 0 200c6cc: 12 80 00 13 bne 200c718 200c6d0: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200c6d4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200c6d8: 80 a6 60 00 cmp %i1, 0 200c6dc: 02 80 00 0d be 200c710 200c6e0: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200c6e4: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200c6e8: 80 a0 60 00 cmp %g1, 0 200c6ec: 02 80 00 06 be 200c704 200c6f0: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200c6f4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200c6f8: 80 a6 40 01 cmp %i1, %g1 200c6fc: 1a 80 00 05 bcc 200c710 <== ALWAYS TAKEN 200c700: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200c704: 92 10 00 19 mov %i1, %o1 200c708: 40 00 08 e7 call 200eaa4 <_Thread_Change_priority> 200c70c: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200c710: 40 00 0a 22 call 200ef98 <_Thread_Enable_dispatch> 200c714: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200c718: 81 c7 e0 08 ret 200c71c: 81 e8 00 00 restore =============================================================================== 0200831c : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 200831c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 2008320: 80 a6 60 00 cmp %i1, 0 2008324: 02 80 00 1e be 200839c 2008328: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 200832c: 90 10 00 18 mov %i0, %o0 2008330: 40 00 09 e6 call 200aac8 <_Thread_Get> 2008334: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2008338: c2 07 bf fc ld [ %fp + -4 ], %g1 200833c: 80 a0 60 00 cmp %g1, 0 2008340: 12 80 00 19 bne 20083a4 2008344: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2008348: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200834c: 80 a0 60 00 cmp %g1, 0 2008350: 02 80 00 10 be 2008390 2008354: 01 00 00 00 nop if (tvp->ptr == ptr) { 2008358: c4 00 60 04 ld [ %g1 + 4 ], %g2 200835c: 80 a0 80 19 cmp %g2, %i1 2008360: 32 80 00 09 bne,a 2008384 2008364: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2008368: 10 80 00 18 b 20083c8 200836c: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2008370: 80 a0 80 19 cmp %g2, %i1 2008374: 22 80 00 0e be,a 20083ac 2008378: c4 02 40 00 ld [ %o1 ], %g2 200837c: 82 10 00 09 mov %o1, %g1 _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; 2008380: d2 00 40 00 ld [ %g1 ], %o1 the_thread = _Thread_Get (tid, &location); switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { 2008384: 80 a2 60 00 cmp %o1, 0 2008388: 32 bf ff fa bne,a 2008370 <== ALWAYS TAKEN 200838c: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2008390: 40 00 09 c1 call 200aa94 <_Thread_Enable_dispatch> 2008394: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2008398: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200839c: 81 c7 e0 08 ret 20083a0: 91 e8 00 01 restore %g0, %g1, %o0 20083a4: 81 c7 e0 08 ret 20083a8: 91 e8 00 01 restore %g0, %g1, %o0 case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; 20083ac: c4 20 40 00 st %g2, [ %g1 ] else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); 20083b0: 40 00 00 2d call 2008464 <_RTEMS_Tasks_Invoke_task_variable_dtor> 20083b4: 01 00 00 00 nop _Thread_Enable_dispatch(); 20083b8: 40 00 09 b7 call 200aa94 <_Thread_Enable_dispatch> 20083bc: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20083c0: 10 bf ff f7 b 200839c 20083c4: 82 10 20 00 clr %g1 ! 0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 20083c8: 92 10 00 01 mov %g1, %o1 20083cc: 10 bf ff f9 b 20083b0 20083d0: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020083d4 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20083d4: 9d e3 bf 98 save %sp, -104, %sp 20083d8: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 20083dc: 80 a6 60 00 cmp %i1, 0 20083e0: 02 80 00 1b be 200844c 20083e4: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 20083e8: 80 a6 a0 00 cmp %i2, 0 20083ec: 02 80 00 1c be 200845c 20083f0: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20083f4: 40 00 09 b5 call 200aac8 <_Thread_Get> 20083f8: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20083fc: c2 07 bf fc ld [ %fp + -4 ], %g1 2008400: 80 a0 60 00 cmp %g1, 0 2008404: 12 80 00 12 bne 200844c 2008408: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 200840c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2008410: 80 a0 60 00 cmp %g1, 0 2008414: 32 80 00 07 bne,a 2008430 2008418: c4 00 60 04 ld [ %g1 + 4 ], %g2 200841c: 30 80 00 0e b,a 2008454 2008420: 80 a0 60 00 cmp %g1, 0 2008424: 02 80 00 0c be 2008454 <== NEVER TAKEN 2008428: 01 00 00 00 nop if (tvp->ptr == ptr) { 200842c: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008430: 80 a0 80 19 cmp %g2, %i1 2008434: 32 bf ff fb bne,a 2008420 2008438: c2 00 40 00 ld [ %g1 ], %g1 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; 200843c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 2008440: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 2008444: 40 00 09 94 call 200aa94 <_Thread_Enable_dispatch> 2008448: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 200844c: 81 c7 e0 08 ret 2008450: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2008454: 40 00 09 90 call 200aa94 <_Thread_Enable_dispatch> 2008458: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 200845c: 81 c7 e0 08 ret 2008460: 81 e8 00 00 restore =============================================================================== 02016b94 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2016b94: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2016b98: 11 00 80 f7 sethi %hi(0x203dc00), %o0 2016b9c: 92 10 00 18 mov %i0, %o1 2016ba0: 90 12 23 b4 or %o0, 0x3b4, %o0 2016ba4: 40 00 0d 36 call 201a07c <_Objects_Get> 2016ba8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016bac: c2 07 bf fc ld [ %fp + -4 ], %g1 2016bb0: 80 a0 60 00 cmp %g1, 0 2016bb4: 12 80 00 0c bne 2016be4 2016bb8: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2016bbc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2016bc0: 80 a0 60 04 cmp %g1, 4 2016bc4: 02 80 00 04 be 2016bd4 <== NEVER TAKEN 2016bc8: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2016bcc: 40 00 15 c7 call 201c2e8 <_Watchdog_Remove> 2016bd0: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2016bd4: 40 00 11 38 call 201b0b4 <_Thread_Enable_dispatch> 2016bd8: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2016bdc: 81 c7 e0 08 ret 2016be0: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016be4: 81 c7 e0 08 ret 2016be8: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 020170d8 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20170d8: 9d e3 bf 98 save %sp, -104, %sp Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; 20170dc: 03 00 80 f7 sethi %hi(0x203dc00), %g1 20170e0: fa 00 63 f4 ld [ %g1 + 0x3f4 ], %i5 ! 203dff4 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20170e4: b8 10 00 18 mov %i0, %i4 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 20170e8: 80 a7 60 00 cmp %i5, 0 20170ec: 02 80 00 3a be 20171d4 20170f0: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 20170f4: 03 00 80 f5 sethi %hi(0x203d400), %g1 20170f8: c2 08 62 40 ldub [ %g1 + 0x240 ], %g1 ! 203d640 <_TOD_Is_set> 20170fc: 80 a0 60 00 cmp %g1, 0 2017100: 02 80 00 35 be 20171d4 <== NEVER TAKEN 2017104: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2017108: 80 a6 a0 00 cmp %i2, 0 201710c: 02 80 00 32 be 20171d4 2017110: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2017114: 90 10 00 19 mov %i1, %o0 2017118: 7f ff f3 10 call 2013d58 <_TOD_Validate> 201711c: b0 10 20 14 mov 0x14, %i0 2017120: 80 8a 20 ff btst 0xff, %o0 2017124: 02 80 00 2c be 20171d4 2017128: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 201712c: 7f ff f2 d0 call 2013c6c <_TOD_To_seconds> 2017130: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2017134: 21 00 80 f5 sethi %hi(0x203d400), %l0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017138: b2 10 00 08 mov %o0, %i1 201713c: d0 1c 22 c0 ldd [ %l0 + 0x2c0 ], %o0 2017140: 94 10 20 00 clr %o2 2017144: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017148: 40 00 58 cf call 202d484 <__divdi3> 201714c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 if ( seconds <= _TOD_Seconds_since_epoch() ) 2017150: 80 a6 40 09 cmp %i1, %o1 2017154: 08 80 00 20 bleu 20171d4 2017158: 92 10 00 1c mov %i4, %o1 201715c: 11 00 80 f7 sethi %hi(0x203dc00), %o0 2017160: 94 07 bf fc add %fp, -4, %o2 2017164: 40 00 0b c6 call 201a07c <_Objects_Get> 2017168: 90 12 23 b4 or %o0, 0x3b4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 201716c: c2 07 bf fc ld [ %fp + -4 ], %g1 2017170: 80 a0 60 00 cmp %g1, 0 2017174: 12 80 00 1a bne 20171dc 2017178: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 201717c: 40 00 14 5b call 201c2e8 <_Watchdog_Remove> 2017180: 90 02 20 10 add %o0, 0x10, %o0 2017184: d0 1c 22 c0 ldd [ %l0 + 0x2c0 ], %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2017188: 82 10 20 03 mov 3, %g1 201718c: 94 10 20 00 clr %o2 2017190: c2 26 20 38 st %g1, [ %i0 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2017194: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 2017198: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 201719c: f6 26 20 34 st %i3, [ %i0 + 0x34 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20171a0: c0 26 20 18 clr [ %i0 + 0x18 ] 20171a4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20171a8: 40 00 58 b7 call 202d484 <__divdi3> 20171ac: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 20171b0: c2 07 60 04 ld [ %i5 + 4 ], %g1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20171b4: b2 26 40 09 sub %i1, %o1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 20171b8: 90 10 00 1d mov %i5, %o0 20171bc: 92 10 00 18 mov %i0, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20171c0: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 20171c4: 9f c0 40 00 call %g1 20171c8: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20171cc: 40 00 0f ba call 201b0b4 <_Thread_Enable_dispatch> 20171d0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20171d4: 81 c7 e0 08 ret 20171d8: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20171dc: 81 c7 e0 08 ret 20171e0: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02007a08 : #include int sched_get_priority_max( int policy ) { 2007a08: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2007a0c: 80 a6 20 04 cmp %i0, 4 2007a10: 08 80 00 08 bleu 2007a30 2007a14: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2007a18: 40 00 29 f7 call 20121f4 <__errno> 2007a1c: b0 10 3f ff mov -1, %i0 2007a20: 82 10 20 16 mov 0x16, %g1 2007a24: c2 22 00 00 st %g1, [ %o0 ] 2007a28: 81 c7 e0 08 ret 2007a2c: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2007a30: b1 28 40 18 sll %g1, %i0, %i0 2007a34: 80 8e 20 17 btst 0x17, %i0 2007a38: 02 bf ff f8 be 2007a18 <== NEVER TAKEN 2007a3c: 03 00 80 8d sethi %hi(0x2023400), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2007a40: f0 08 61 40 ldub [ %g1 + 0x140 ], %i0 ! 2023540 } 2007a44: 81 c7 e0 08 ret 2007a48: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02007a4c : #include int sched_get_priority_min( int policy ) { 2007a4c: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2007a50: 80 a6 20 04 cmp %i0, 4 2007a54: 08 80 00 09 bleu 2007a78 2007a58: 84 10 20 01 mov 1, %g2 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2007a5c: 40 00 29 e6 call 20121f4 <__errno> 2007a60: 01 00 00 00 nop 2007a64: 82 10 3f ff mov -1, %g1 ! ffffffff 2007a68: 84 10 20 16 mov 0x16, %g2 2007a6c: c4 22 00 00 st %g2, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2007a70: 81 c7 e0 08 ret 2007a74: 91 e8 00 01 restore %g0, %g1, %o0 int sched_get_priority_min( int policy ) { switch ( policy ) { 2007a78: b1 28 80 18 sll %g2, %i0, %i0 2007a7c: 80 8e 20 17 btst 0x17, %i0 2007a80: 02 bf ff f7 be 2007a5c <== NEVER TAKEN 2007a84: 82 10 20 01 mov 1, %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2007a88: 81 c7 e0 08 ret 2007a8c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02007a90 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2007a90: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2007a94: 80 a6 20 00 cmp %i0, 0 2007a98: 12 80 00 0a bne 2007ac0 <== ALWAYS TAKEN 2007a9c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 2007aa0: 02 80 00 13 be 2007aec 2007aa4: 03 00 80 90 sethi %hi(0x2024000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2007aa8: d0 00 61 b4 ld [ %g1 + 0x1b4 ], %o0 ! 20241b4 <_Thread_Ticks_per_timeslice> 2007aac: 92 10 00 19 mov %i1, %o1 2007ab0: 40 00 0f 9e call 200b928 <_Timespec_From_ticks> 2007ab4: b0 10 20 00 clr %i0 return 0; } 2007ab8: 81 c7 e0 08 ret 2007abc: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2007ac0: 7f ff ef ae call 2003978 2007ac4: 01 00 00 00 nop 2007ac8: 80 a2 00 18 cmp %o0, %i0 2007acc: 02 bf ff f5 be 2007aa0 2007ad0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2007ad4: 40 00 29 c8 call 20121f4 <__errno> 2007ad8: b0 10 3f ff mov -1, %i0 2007adc: 82 10 20 03 mov 3, %g1 2007ae0: c2 22 00 00 st %g1, [ %o0 ] 2007ae4: 81 c7 e0 08 ret 2007ae8: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007aec: 40 00 29 c2 call 20121f4 <__errno> 2007af0: b0 10 3f ff mov -1, %i0 2007af4: 82 10 20 16 mov 0x16, %g1 2007af8: c2 22 00 00 st %g1, [ %o0 ] 2007afc: 81 c7 e0 08 ret 2007b00: 81 e8 00 00 restore =============================================================================== 0200a44c : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 200a44c: 9d e3 bf 90 save %sp, -112, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200a450: 03 00 80 a1 sethi %hi(0x2028400), %g1 200a454: c4 00 63 80 ld [ %g1 + 0x380 ], %g2 ! 2028780 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200a458: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200a45c: 84 00 a0 01 inc %g2 200a460: c4 20 63 80 st %g2, [ %g1 + 0x380 ] return _Thread_Dispatch_disable_level; 200a464: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 200a468: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200a46c: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200a470: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200a474: b8 8e 62 00 andcc %i1, 0x200, %i4 200a478: 12 80 00 25 bne 200a50c 200a47c: ba 10 20 00 clr %i5 mode = va_arg( arg, mode_t ); value = va_arg( arg, unsigned int ); va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 200a480: 90 10 00 18 mov %i0, %o0 200a484: 40 00 1e 8b call 2011eb0 <_POSIX_Semaphore_Name_to_id> 200a488: 92 07 bf f4 add %fp, -12, %o1 * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "semaphore does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 200a48c: b6 92 20 00 orcc %o0, 0, %i3 200a490: 22 80 00 0e be,a 200a4c8 200a494: b2 0e 6a 00 and %i1, 0xa00, %i1 /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 200a498: 80 a6 e0 02 cmp %i3, 2 200a49c: 12 80 00 04 bne 200a4ac <== NEVER TAKEN 200a4a0: 80 a7 20 00 cmp %i4, 0 200a4a4: 12 80 00 1e bne 200a51c 200a4a8: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 200a4ac: 40 00 0d 08 call 200d8cc <_Thread_Enable_dispatch> 200a4b0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 200a4b4: 40 00 2d 89 call 2015ad8 <__errno> 200a4b8: 01 00 00 00 nop 200a4bc: f6 22 00 00 st %i3, [ %o0 ] 200a4c0: 81 c7 e0 08 ret 200a4c4: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 200a4c8: 80 a6 6a 00 cmp %i1, 0xa00 200a4cc: 02 80 00 20 be 200a54c 200a4d0: d2 07 bf f4 ld [ %fp + -12 ], %o1 200a4d4: 94 07 bf fc add %fp, -4, %o2 200a4d8: 11 00 80 a2 sethi %hi(0x2028800), %o0 200a4dc: 40 00 08 fb call 200c8c8 <_Objects_Get> 200a4e0: 90 12 22 40 or %o0, 0x240, %o0 ! 2028a40 <_POSIX_Semaphore_Information> _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 200a4e4: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); 200a4e8: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 200a4ec: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 200a4f0: 40 00 0c f7 call 200d8cc <_Thread_Enable_dispatch> 200a4f4: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 200a4f8: 40 00 0c f5 call 200d8cc <_Thread_Enable_dispatch> 200a4fc: 01 00 00 00 nop the_semaphore->Semaphore_id = the_semaphore->Object.id; id = &the_semaphore->Semaphore_id; #else id = (sem_t *)&the_semaphore->Object.id; #endif return id; 200a500: f0 07 bf f8 ld [ %fp + -8 ], %i0 } 200a504: 81 c7 e0 08 ret 200a508: 91 ee 20 08 restore %i0, 8, %o0 _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = va_arg( arg, mode_t ); value = va_arg( arg, unsigned int ); 200a50c: 82 07 a0 54 add %fp, 0x54, %g1 200a510: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 200a514: 10 bf ff db b 200a480 200a518: c2 27 bf f0 st %g1, [ %fp + -16 ] /* * At this point, the semaphore does not exist and everything has been * checked. We should go ahead and create a semaphore. */ status =_POSIX_Semaphore_Create_support( 200a51c: 92 10 20 00 clr %o1 200a520: 96 07 bf f8 add %fp, -8, %o3 200a524: 40 00 1e 07 call 2011d40 <_POSIX_Semaphore_Create_support> 200a528: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 200a52c: 40 00 0c e8 call 200d8cc <_Thread_Enable_dispatch> 200a530: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 200a534: 80 a7 7f ff cmp %i5, -1 200a538: 02 bf ff e2 be 200a4c0 200a53c: b0 10 3f ff mov -1, %i0 the_semaphore->Semaphore_id = the_semaphore->Object.id; id = &the_semaphore->Semaphore_id; #else id = (sem_t *)&the_semaphore->Object.id; #endif return id; 200a540: f0 07 bf f8 ld [ %fp + -8 ], %i0 200a544: 81 c7 e0 08 ret 200a548: 91 ee 20 08 restore %i0, 8, %o0 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); 200a54c: 40 00 0c e0 call 200d8cc <_Thread_Enable_dispatch> 200a550: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 200a554: 40 00 2d 61 call 2015ad8 <__errno> 200a558: 01 00 00 00 nop 200a55c: 82 10 20 11 mov 0x11, %g1 ! 11 200a560: c2 22 00 00 st %g1, [ %o0 ] 200a564: 81 c7 e0 08 ret 200a568: 81 e8 00 00 restore =============================================================================== 0200a5c8 : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 200a5c8: 9d e3 bf 98 save %sp, -104, %sp * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 200a5cc: 90 10 00 19 mov %i1, %o0 200a5d0: 40 00 1b 63 call 201135c <_POSIX_Absolute_timeout_to_ticks> 200a5d4: 92 07 bf fc add %fp, -4, %o1 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 200a5d8: d4 07 bf fc ld [ %fp + -4 ], %o2 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 200a5dc: 80 a2 20 03 cmp %o0, 3 200a5e0: 02 80 00 06 be 200a5f8 <== ALWAYS TAKEN 200a5e4: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 200a5e8: 40 00 1e 54 call 2011f38 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 200a5ec: 92 10 20 00 clr %o1 <== NOT EXECUTED 200a5f0: 81 c7 e0 08 ret <== NOT EXECUTED 200a5f4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 200a5f8: 40 00 1e 50 call 2011f38 <_POSIX_Semaphore_Wait_support> 200a5fc: 92 10 20 01 mov 1, %o1 lock_status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) rtems_set_errno_and_return_minus_one( ETIMEDOUT ); } return lock_status; } 200a600: 81 c7 e0 08 ret 200a604: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020079cc : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 20079cc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 20079d0: 80 a6 a0 00 cmp %i2, 0 20079d4: 02 80 00 0d be 2007a08 20079d8: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 20079dc: 05 00 80 8c sethi %hi(0x2023000), %g2 20079e0: 83 2e 20 04 sll %i0, 4, %g1 20079e4: 84 10 a0 20 or %g2, 0x20, %g2 20079e8: 82 20 40 03 sub %g1, %g3, %g1 20079ec: c6 00 80 01 ld [ %g2 + %g1 ], %g3 20079f0: 82 00 80 01 add %g2, %g1, %g1 20079f4: c6 26 80 00 st %g3, [ %i2 ] 20079f8: c4 00 60 04 ld [ %g1 + 4 ], %g2 20079fc: c4 26 a0 04 st %g2, [ %i2 + 4 ] 2007a00: c2 00 60 08 ld [ %g1 + 8 ], %g1 2007a04: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 2007a08: 80 a6 20 00 cmp %i0, 0 2007a0c: 02 80 00 33 be 2007ad8 2007a10: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2007a14: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2007a18: 80 a0 60 1f cmp %g1, 0x1f 2007a1c: 18 80 00 2f bgu 2007ad8 2007a20: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2007a24: 02 80 00 2d be 2007ad8 2007a28: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2007a2c: 02 80 00 1a be 2007a94 <== NEVER TAKEN 2007a30: 82 10 20 00 clr %g1 /* * Unless the user is installing the default signal actions, then * we can just copy the provided sigaction structure into the vectors. */ _ISR_Disable( level ); 2007a34: 7f ff eb b4 call 2002904 2007a38: 01 00 00 00 nop 2007a3c: b4 10 00 08 mov %o0, %i2 if ( act->sa_handler == SIG_DFL ) { 2007a40: c2 06 60 08 ld [ %i1 + 8 ], %g1 2007a44: 80 a0 60 00 cmp %g1, 0 2007a48: 02 80 00 15 be 2007a9c 2007a4c: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 2007a50: 40 00 1c 63 call 200ebdc <_POSIX_signals_Clear_process_signals> 2007a54: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2007a58: c4 06 40 00 ld [ %i1 ], %g2 2007a5c: 87 2e 20 02 sll %i0, 2, %g3 2007a60: 03 00 80 8c sethi %hi(0x2023000), %g1 2007a64: b1 2e 20 04 sll %i0, 4, %i0 2007a68: 82 10 60 20 or %g1, 0x20, %g1 2007a6c: b0 26 00 03 sub %i0, %g3, %i0 2007a70: c4 20 40 18 st %g2, [ %g1 + %i0 ] 2007a74: c4 06 60 04 ld [ %i1 + 4 ], %g2 2007a78: b0 00 40 18 add %g1, %i0, %i0 2007a7c: c4 26 20 04 st %g2, [ %i0 + 4 ] 2007a80: c2 06 60 08 ld [ %i1 + 8 ], %g1 2007a84: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 2007a88: 7f ff eb a3 call 2002914 2007a8c: 90 10 00 1a mov %i2, %o0 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 2007a90: 82 10 20 00 clr %g1 } 2007a94: 81 c7 e0 08 ret 2007a98: 91 e8 00 01 restore %g0, %g1, %o0 * we can just copy the provided sigaction structure into the vectors. */ _ISR_Disable( level ); if ( act->sa_handler == SIG_DFL ) { _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 2007a9c: b1 2e 20 04 sll %i0, 4, %i0 2007aa0: b0 26 00 01 sub %i0, %g1, %i0 2007aa4: 03 00 80 82 sethi %hi(0x2020800), %g1 2007aa8: 82 10 63 d4 or %g1, 0x3d4, %g1 ! 2020bd4 <_POSIX_signals_Default_vectors> 2007aac: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2007ab0: 82 00 40 18 add %g1, %i0, %g1 2007ab4: c6 00 60 04 ld [ %g1 + 4 ], %g3 2007ab8: c4 00 60 08 ld [ %g1 + 8 ], %g2 2007abc: 03 00 80 8c sethi %hi(0x2023000), %g1 2007ac0: 82 10 60 20 or %g1, 0x20, %g1 ! 2023020 <_POSIX_signals_Vectors> 2007ac4: c8 20 40 18 st %g4, [ %g1 + %i0 ] 2007ac8: b0 00 40 18 add %g1, %i0, %i0 2007acc: c6 26 20 04 st %g3, [ %i0 + 4 ] 2007ad0: 10 bf ff ee b 2007a88 2007ad4: c4 26 20 08 st %g2, [ %i0 + 8 ] * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007ad8: 40 00 2b 3f call 20127d4 <__errno> 2007adc: 01 00 00 00 nop 2007ae0: 84 10 20 16 mov 0x16, %g2 ! 16 2007ae4: 82 10 3f ff mov -1, %g1 2007ae8: 10 bf ff eb b 2007a94 2007aec: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02007f60 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2007f60: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2007f64: ba 96 20 00 orcc %i0, 0, %i5 2007f68: 02 80 00 aa be 2008210 2007f6c: 80 a6 a0 00 cmp %i2, 0 /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2007f70: 02 80 00 6f be 200812c 2007f74: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 2007f78: 40 00 0f fc call 200bf68 <_Timespec_Is_valid> 2007f7c: 90 10 00 1a mov %i2, %o0 2007f80: 80 8a 20 ff btst 0xff, %o0 2007f84: 02 80 00 a3 be 2008210 2007f88: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2007f8c: 40 00 10 08 call 200bfac <_Timespec_To_ticks> 2007f90: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2007f94: a0 92 20 00 orcc %o0, 0, %l0 2007f98: 02 80 00 9e be 2008210 <== NEVER TAKEN 2007f9c: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2007fa0: 02 80 00 66 be 2008138 <== NEVER TAKEN 2007fa4: 39 00 80 8d sethi %hi(0x2023400), %i4 the_thread = _Thread_Executing; 2007fa8: 39 00 80 8d sethi %hi(0x2023400), %i4 2007fac: b8 17 21 70 or %i4, 0x170, %i4 ! 2023570 <_Per_CPU_Information> 2007fb0: f0 07 20 0c ld [ %i4 + 0xc ], %i0 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2007fb4: 7f ff eb 2f call 2002c70 2007fb8: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 2007fbc: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 2007fc0: c4 07 40 00 ld [ %i5 ], %g2 2007fc4: c2 06 a0 d4 ld [ %i2 + 0xd4 ], %g1 2007fc8: 80 88 80 01 btst %g2, %g1 2007fcc: 12 80 00 67 bne 2008168 2007fd0: 92 10 20 1b mov 0x1b, %o1 return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2007fd4: 03 00 80 8d sethi %hi(0x2023400), %g1 2007fd8: c2 00 63 c4 ld [ %g1 + 0x3c4 ], %g1 ! 20237c4 <_POSIX_signals_Pending> 2007fdc: 80 88 80 01 btst %g2, %g1 2007fe0: 32 80 00 30 bne,a 20080a0 2007fe4: b0 10 20 1b mov 0x1b, %i0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007fe8: 03 00 80 8c sethi %hi(0x2023000), %g1 2007fec: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 ! 2023030 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 2007ff0: 86 10 3f ff mov -1, %g3 2007ff4: c6 26 40 00 st %g3, [ %i1 ] 2007ff8: 84 00 a0 01 inc %g2 2007ffc: c4 20 60 30 st %g2, [ %g1 + 0x30 ] return _Thread_Dispatch_disable_level; 2008000: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2008004: 82 10 20 04 mov 4, %g1 2008008: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_thread->Wait.option = *set; 200800c: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2008010: f2 26 20 28 st %i1, [ %i0 + 0x28 ] the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; 2008014: c2 26 20 30 st %g1, [ %i0 + 0x30 ] RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008018: b6 10 20 01 mov 1, %i3 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 200801c: 23 00 80 8d sethi %hi(0x2023400), %l1 2008020: a2 14 63 5c or %l1, 0x35c, %l1 ! 202375c <_POSIX_signals_Wait_queue> 2008024: e2 26 20 44 st %l1, [ %i0 + 0x44 ] 2008028: f6 24 60 30 st %i3, [ %l1 + 0x30 ] the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; the_thread->Wait.return_argument = the_info; _Thread_queue_Enter_critical_section( &_POSIX_signals_Wait_queue ); _ISR_Enable( level ); 200802c: 7f ff eb 15 call 2002c80 2008030: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2008034: 90 10 00 11 mov %l1, %o0 2008038: 92 10 00 10 mov %l0, %o1 200803c: 15 00 80 2f sethi %hi(0x200bc00), %o2 2008040: 40 00 0e 45 call 200b954 <_Thread_queue_Enqueue_with_handler> 2008044: 94 12 a1 34 or %o2, 0x134, %o2 ! 200bd34 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2008048: 40 00 0c f8 call 200b428 <_Thread_Enable_dispatch> 200804c: 01 00 00 00 nop /* * When the thread is set free by a signal, it is need to eliminate * the signal. */ _POSIX_signals_Clear_signals( api, the_info->si_signo, the_info, false, false ); 2008050: d2 06 40 00 ld [ %i1 ], %o1 2008054: 90 10 00 1a mov %i2, %o0 2008058: 94 10 00 19 mov %i1, %o2 200805c: 96 10 20 00 clr %o3 2008060: 40 00 1d 44 call 200f570 <_POSIX_signals_Clear_signals> 2008064: 98 10 20 00 clr %o4 /* Set errno only if return code is not EINTR or * if EINTR was caused by a signal being caught, which * was not in our set. */ if ( (_Thread_Executing->Wait.return_code != EINTR) 2008068: c2 07 20 0c ld [ %i4 + 0xc ], %g1 200806c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008070: 80 a0 60 04 cmp %g1, 4 2008074: 12 80 00 60 bne 20081f4 2008078: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 200807c: f0 06 40 00 ld [ %i1 ], %i0 2008080: c2 07 40 00 ld [ %i5 ], %g1 2008084: 84 06 3f ff add %i0, -1, %g2 2008088: b7 2e c0 02 sll %i3, %g2, %i3 200808c: 80 8e c0 01 btst %i3, %g1 2008090: 02 80 00 59 be 20081f4 2008094: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 2008098: 81 c7 e0 08 ret 200809c: 81 e8 00 00 restore 20080a0: 86 10 20 01 mov 1, %g3 /* 3.3.8 Synchronously Accept a Signal, P1003.1b-1993, p. 76 NOTE: P1003.1c/D10, p. 39 adds sigwait(). */ int _EXFUN(sigwaitinfo, (const sigset_t *set, siginfo_t *info)); int _EXFUN(sigtimedwait, 20080a4: 84 06 3f ff add %i0, -1, %g2 20080a8: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20080ac: 80 88 80 01 btst %g2, %g1 20080b0: 12 80 00 12 bne 20080f8 <== NEVER TAKEN 20080b4: 90 10 00 1a mov %i2, %o0 sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20080b8: b0 06 20 01 inc %i0 20080bc: 80 a6 20 20 cmp %i0, 0x20 20080c0: 12 bf ff fa bne 20080a8 20080c4: 84 06 3f ff add %i0, -1, %g2 20080c8: b0 10 20 01 mov 1, %i0 20080cc: 10 80 00 05 b 20080e0 20080d0: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 20080d4: 80 a6 20 1b cmp %i0, 0x1b 20080d8: 02 80 00 08 be 20080f8 <== NEVER TAKEN 20080dc: 90 10 00 1a mov %i2, %o0 20080e0: 84 06 3f ff add %i0, -1, %g2 20080e4: 85 28 c0 02 sll %g3, %g2, %g2 if ( set & signo_to_mask( signo ) ) { 20080e8: 80 88 80 01 btst %g2, %g1 20080ec: 22 bf ff fa be,a 20080d4 20080f0: b0 06 20 01 inc %i0 /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 20080f4: 90 10 00 1a mov %i2, %o0 20080f8: 92 10 00 18 mov %i0, %o1 20080fc: 94 10 00 19 mov %i1, %o2 2008100: 96 10 20 01 mov 1, %o3 2008104: 40 00 1d 1b call 200f570 <_POSIX_signals_Clear_signals> 2008108: 98 10 20 00 clr %o4 _ISR_Enable( level ); 200810c: 7f ff ea dd call 2002c80 2008110: 90 10 00 1b mov %i3, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2008114: 82 10 20 01 mov 1, %g1 if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); _ISR_Enable( level ); the_info->si_signo = signo; 2008118: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 200811c: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2008120: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2008124: 81 c7 e0 08 ret 2008128: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 200812c: 12 bf ff 9f bne 2007fa8 2008130: a0 10 20 00 clr %l0 the_thread = _Thread_Executing; 2008134: 39 00 80 8d sethi %hi(0x2023400), %i4 2008138: b8 17 21 70 or %i4, 0x170, %i4 ! 2023570 <_Per_CPU_Information> 200813c: f0 07 20 0c ld [ %i4 + 0xc ], %i0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008140: b2 07 bf f4 add %fp, -12, %i1 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2008144: 7f ff ea cb call 2002c70 2008148: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 200814c: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 2008150: c4 07 40 00 ld [ %i5 ], %g2 2008154: c2 06 a0 d4 ld [ %i2 + 0xd4 ], %g1 2008158: 80 88 80 01 btst %g2, %g1 200815c: 22 bf ff 9f be,a 2007fd8 2008160: 03 00 80 8d sethi %hi(0x2023400), %g1 2008164: 92 10 20 1b mov 0x1b, %o1 2008168: 86 10 20 01 mov 1, %g3 200816c: 84 02 7f ff add %o1, -1, %g2 2008170: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2008174: 80 88 80 01 btst %g2, %g1 2008178: 32 80 00 12 bne,a 20081c0 <== NEVER TAKEN 200817c: d2 26 40 00 st %o1, [ %i1 ] <== NOT EXECUTED sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2008180: 92 02 60 01 inc %o1 2008184: 80 a2 60 20 cmp %o1, 0x20 2008188: 12 bf ff fa bne 2008170 200818c: 84 02 7f ff add %o1, -1, %g2 2008190: 92 10 20 01 mov 1, %o1 2008194: 10 80 00 05 b 20081a8 2008198: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 200819c: 80 a2 60 1b cmp %o1, 0x1b 20081a0: 22 80 00 08 be,a 20081c0 <== NEVER TAKEN 20081a4: d2 26 40 00 st %o1, [ %i1 ] <== NOT EXECUTED 20081a8: 84 02 7f ff add %o1, -1, %g2 20081ac: 85 28 c0 02 sll %g3, %g2, %g2 if ( set & signo_to_mask( signo ) ) { 20081b0: 80 88 80 01 btst %g2, %g1 20081b4: 22 bf ff fa be,a 200819c 20081b8: 92 02 60 01 inc %o1 /* API signals pending? */ _ISR_Disable( level ); if ( *set & api->signals_pending ) { /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 20081bc: d2 26 40 00 st %o1, [ %i1 ] _POSIX_signals_Clear_signals( 20081c0: 90 10 00 1a mov %i2, %o0 20081c4: 94 10 00 19 mov %i1, %o2 20081c8: 96 10 20 00 clr %o3 20081cc: 40 00 1c e9 call 200f570 <_POSIX_signals_Clear_signals> 20081d0: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 20081d4: 7f ff ea ab call 2002c80 20081d8: 90 10 00 1b mov %i3, %o0 the_info->si_code = SI_USER; 20081dc: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 20081e0: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 20081e4: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 20081e8: f0 06 40 00 ld [ %i1 ], %i0 20081ec: 81 c7 e0 08 ret 20081f0: 81 e8 00 00 restore * was not in our set. */ if ( (_Thread_Executing->Wait.return_code != EINTR) || !(*set & signo_to_mask( the_info->si_signo )) ) { errno = _Thread_Executing->Wait.return_code; 20081f4: 40 00 2b 7f call 2012ff0 <__errno> 20081f8: b0 10 3f ff mov -1, %i0 20081fc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2008200: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008204: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2008208: 81 c7 e0 08 ret 200820c: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 2008210: 40 00 2b 78 call 2012ff0 <__errno> 2008214: b0 10 3f ff mov -1, %i0 2008218: 82 10 20 16 mov 0x16, %g1 200821c: c2 22 00 00 st %g1, [ %o0 ] 2008220: 81 c7 e0 08 ret 2008224: 81 e8 00 00 restore =============================================================================== 02009e2c : int sigwait( const sigset_t *set, int *sig ) { 2009e2c: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2009e30: 92 10 20 00 clr %o1 2009e34: 90 10 00 18 mov %i0, %o0 2009e38: 7f ff ff 47 call 2009b54 2009e3c: 94 10 20 00 clr %o2 if ( status != -1 ) { 2009e40: 80 a2 3f ff cmp %o0, -1 2009e44: 02 80 00 07 be 2009e60 2009e48: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2009e4c: 02 80 00 03 be 2009e58 <== NEVER TAKEN 2009e50: b0 10 20 00 clr %i0 *sig = status; 2009e54: d0 26 40 00 st %o0, [ %i1 ] 2009e58: 81 c7 e0 08 ret 2009e5c: 81 e8 00 00 restore return 0; } return errno; 2009e60: 40 00 2a 97 call 20148bc <__errno> 2009e64: 01 00 00 00 nop 2009e68: f0 02 00 00 ld [ %o0 ], %i0 } 2009e6c: 81 c7 e0 08 ret 2009e70: 81 e8 00 00 restore =============================================================================== 02006bd8 : */ long sysconf( int name ) { 2006bd8: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2006bdc: 80 a6 20 02 cmp %i0, 2 2006be0: 02 80 00 10 be 2006c20 2006be4: 03 00 80 7b sethi %hi(0x201ec00), %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2006be8: 80 a6 20 04 cmp %i0, 4 2006bec: 02 80 00 0b be 2006c18 2006bf0: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2006bf4: 80 a6 20 33 cmp %i0, 0x33 2006bf8: 02 80 00 08 be 2006c18 2006bfc: 82 10 24 00 mov 0x400, %g1 return 1024; if ( name == _SC_PAGESIZE ) 2006c00: 80 a6 20 08 cmp %i0, 8 2006c04: 02 80 00 05 be 2006c18 2006c08: 03 00 00 04 sethi %hi(0x1000), %g1 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2006c0c: 80 a6 22 03 cmp %i0, 0x203 2006c10: 12 80 00 0c bne 2006c40 <== ALWAYS TAKEN 2006c14: 82 10 20 00 clr %g1 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2006c18: 81 c7 e0 08 ret 2006c1c: 91 e8 00 01 restore %g0, %g1, %o0 int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); 2006c20: 03 00 80 7a sethi %hi(0x201e800), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 2006c24: d2 00 63 4c ld [ %g1 + 0x34c ], %o1 ! 201eb4c 2006c28: 11 00 03 d0 sethi %hi(0xf4000), %o0 2006c2c: 40 00 4e e4 call 201a7bc <.udiv> 2006c30: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2006c34: 82 10 00 08 mov %o0, %g1 if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2006c38: 81 c7 e0 08 ret 2006c3c: 91 e8 00 01 restore %g0, %g1, %o0 #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2006c40: 40 00 2b 4c call 2011970 <__errno> 2006c44: 01 00 00 00 nop 2006c48: 84 10 20 16 mov 0x16, %g2 ! 16 2006c4c: 82 10 3f ff mov -1, %g1 2006c50: 10 bf ff f2 b 2006c18 2006c54: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02006c9c : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2006c9c: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2006ca0: 80 a6 20 01 cmp %i0, 1 2006ca4: 12 80 00 3e bne 2006d9c 2006ca8: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2006cac: 02 80 00 3c be 2006d9c 2006cb0: 80 a6 60 00 cmp %i1, 0 /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 2006cb4: 02 80 00 0e be 2006cec 2006cb8: 03 00 80 80 sethi %hi(0x2020000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2006cbc: c2 06 40 00 ld [ %i1 ], %g1 2006cc0: 82 00 7f ff add %g1, -1, %g1 2006cc4: 80 a0 60 01 cmp %g1, 1 2006cc8: 18 80 00 35 bgu 2006d9c <== NEVER TAKEN 2006ccc: 01 00 00 00 nop ( evp->sigev_notify != SIGEV_SIGNAL ) ) { /* The value of the field sigev_notify is not valid */ rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !evp->sigev_signo ) 2006cd0: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006cd4: 80 a0 60 00 cmp %g1, 0 2006cd8: 02 80 00 31 be 2006d9c <== NEVER TAKEN 2006cdc: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2006ce0: 80 a0 60 1f cmp %g1, 0x1f 2006ce4: 18 80 00 2e bgu 2006d9c <== NEVER TAKEN 2006ce8: 03 00 80 80 sethi %hi(0x2020000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006cec: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 2020020 <_Thread_Dispatch_disable_level> 2006cf0: 84 00 a0 01 inc %g2 2006cf4: c4 20 60 20 st %g2, [ %g1 + 0x20 ] return _Thread_Dispatch_disable_level; 2006cf8: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 * the inactive chain of free timer control blocks. */ RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Allocate( void ) { return (POSIX_Timer_Control *) _Objects_Allocate( &_POSIX_Timer_Information ); 2006cfc: 3b 00 80 80 sethi %hi(0x2020000), %i5 2006d00: 40 00 08 a7 call 2008f9c <_Objects_Allocate> 2006d04: 90 17 63 20 or %i5, 0x320, %o0 ! 2020320 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2006d08: 80 a2 20 00 cmp %o0, 0 2006d0c: 02 80 00 2a be 2006db4 2006d10: 82 10 20 02 mov 2, %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } /* The data of the created timer are stored to use them later */ ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; 2006d14: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2006d18: 03 00 80 81 sethi %hi(0x2020400), %g1 2006d1c: c2 00 61 6c ld [ %g1 + 0x16c ], %g1 ! 202056c <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2006d20: 80 a6 60 00 cmp %i1, 0 } /* The data of the created timer are stored to use them later */ ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; ptimer->thread_id = _Thread_Executing->Object.id; 2006d24: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2006d28: 02 80 00 08 be 2006d48 2006d2c: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2006d30: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 2006d34: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 2006d38: c2 06 60 08 ld [ %i1 + 8 ], %g1 ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; ptimer->thread_id = _Thread_Executing->Object.id; if ( evp != NULL ) { ptimer->inf.sigev_notify = evp->sigev_notify; 2006d3c: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2006d40: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2006d44: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006d48: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006d4c: ba 17 63 20 or %i5, 0x320, %i5 2006d50: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 } ptimer->overrun = 0; 2006d54: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2006d58: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2006d5c: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2006d60: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2006d64: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2006d68: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2006d6c: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2006d70: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2006d74: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006d78: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006d7c: 85 28 a0 02 sll %g2, 2, %g2 2006d80: d0 20 c0 02 st %o0, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2006d84: c0 22 20 0c clr [ %o0 + 0xc ] _Watchdog_Initialize( &ptimer->Timer, NULL, 0, NULL ); _Objects_Open_u32(&_POSIX_Timer_Information, &ptimer->Object, 0); *timerid = ptimer->Object.id; 2006d88: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2006d8c: 40 00 0d b1 call 200a450 <_Thread_Enable_dispatch> 2006d90: b0 10 20 00 clr %i0 return 0; } 2006d94: 81 c7 e0 08 ret 2006d98: 81 e8 00 00 restore if ( !evp->sigev_signo ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006d9c: 40 00 2c 7e call 2011f94 <__errno> 2006da0: b0 10 3f ff mov -1, %i0 2006da4: 82 10 20 16 mov 0x16, %g1 2006da8: c2 22 00 00 st %g1, [ %o0 ] 2006dac: 81 c7 e0 08 ret 2006db0: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 2006db4: 40 00 0d a7 call 200a450 <_Thread_Enable_dispatch> 2006db8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 2006dbc: 40 00 2c 76 call 2011f94 <__errno> 2006dc0: 01 00 00 00 nop 2006dc4: 82 10 20 0b mov 0xb, %g1 ! b 2006dc8: c2 22 00 00 st %g1, [ %o0 ] 2006dcc: 81 c7 e0 08 ret 2006dd0: 81 e8 00 00 restore =============================================================================== 02006dd4 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2006dd4: 9d e3 bf 78 save %sp, -136, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2006dd8: 80 a6 a0 00 cmp %i2, 0 2006ddc: 02 80 00 a6 be 2007074 <== NEVER TAKEN 2006de0: 01 00 00 00 nop /* * First, it verifies if the structure "value" is correct * if the number of nanoseconds is not correct return EINVAL */ if ( !_Timespec_Is_valid( &(value->it_value) ) ) { 2006de4: 40 00 10 6b call 200af90 <_Timespec_Is_valid> 2006de8: 90 06 a0 08 add %i2, 8, %o0 2006dec: 80 8a 20 ff btst 0xff, %o0 2006df0: 02 80 00 a1 be 2007074 2006df4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2006df8: 40 00 10 66 call 200af90 <_Timespec_Is_valid> 2006dfc: 90 10 00 1a mov %i2, %o0 2006e00: 80 8a 20 ff btst 0xff, %o0 2006e04: 02 80 00 9c be 2007074 <== NEVER TAKEN 2006e08: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2006e0c: 12 80 00 98 bne 200706c 2006e10: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2006e14: c8 06 80 00 ld [ %i2 ], %g4 2006e18: c6 06 a0 04 ld [ %i2 + 4 ], %g3 2006e1c: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2006e20: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2006e24: c8 27 bf d8 st %g4, [ %fp + -40 ] 2006e28: c6 27 bf dc st %g3, [ %fp + -36 ] 2006e2c: c4 27 bf e0 st %g2, [ %fp + -32 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2006e30: 80 a6 60 04 cmp %i1, 4 2006e34: 02 80 00 4a be 2006f5c 2006e38: c2 27 bf e4 st %g1, [ %fp + -28 ] RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 2006e3c: 92 10 00 18 mov %i0, %o1 2006e40: 11 00 80 80 sethi %hi(0x2020000), %o0 2006e44: 94 07 bf fc add %fp, -4, %o2 2006e48: 40 00 09 a0 call 20094c8 <_Objects_Get> 2006e4c: 90 12 23 20 or %o0, 0x320, %o0 * something with the structure of times of the timer: to stop, start * or start it again */ ptimer = _POSIX_Timer_Get( timerid, &location ); switch ( location ) { 2006e50: c2 07 bf fc ld [ %fp + -4 ], %g1 2006e54: 80 a0 60 00 cmp %g1, 0 2006e58: 12 80 00 64 bne 2006fe8 <== NEVER TAKEN 2006e5c: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { 2006e60: c2 07 bf e0 ld [ %fp + -32 ], %g1 2006e64: 80 a0 60 00 cmp %g1, 0 2006e68: 12 80 00 05 bne 2006e7c 2006e6c: c2 07 bf e4 ld [ %fp + -28 ], %g1 2006e70: 80 a0 60 00 cmp %g1, 0 2006e74: 02 80 00 63 be 2007000 2006e78: 01 00 00 00 nop _Thread_Enable_dispatch(); return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); 2006e7c: 40 00 10 7c call 200b06c <_Timespec_To_ticks> 2006e80: 90 10 00 1a mov %i2, %o0 2006e84: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006e88: 40 00 10 79 call 200b06c <_Timespec_To_ticks> 2006e8c: 90 07 bf e0 add %fp, -32, %o0 activated = _POSIX_Timer_Insert_helper( 2006e90: d4 06 20 08 ld [ %i0 + 8 ], %o2 return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006e94: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2006e98: 98 10 00 18 mov %i0, %o4 2006e9c: 90 06 20 10 add %i0, 0x10, %o0 2006ea0: 17 00 80 1c sethi %hi(0x2007000), %o3 2006ea4: 40 00 1e 38 call 200e784 <_POSIX_Timer_Insert_helper> 2006ea8: 96 12 e0 8c or %o3, 0x8c, %o3 ! 200708c <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 2006eac: 80 8a 20 ff btst 0xff, %o0 2006eb0: 02 80 00 27 be 2006f4c 2006eb4: 80 a6 e0 00 cmp %i3, 0 /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 2006eb8: 02 80 00 0b be 2006ee4 2006ebc: c2 07 bf d8 ld [ %fp + -40 ], %g1 *ovalue = ptimer->timer_data; 2006ec0: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 2006ec4: c2 26 c0 00 st %g1, [ %i3 ] 2006ec8: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 2006ecc: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2006ed0: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2006ed4: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2006ed8: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2006edc: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 2006ee0: c2 07 bf d8 ld [ %fp + -40 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2006ee4: 90 07 bf e8 add %fp, -24, %o0 2006ee8: c2 26 20 54 st %g1, [ %i0 + 0x54 ] 2006eec: c2 07 bf dc ld [ %fp + -36 ], %g1 2006ef0: c2 26 20 58 st %g1, [ %i0 + 0x58 ] 2006ef4: c2 07 bf e0 ld [ %fp + -32 ], %g1 2006ef8: c2 26 20 5c st %g1, [ %i0 + 0x5c ] 2006efc: c2 07 bf e4 ld [ %fp + -28 ], %g1 2006f00: c2 26 20 60 st %g1, [ %i0 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2006f04: 82 10 20 03 mov 3, %g1 2006f08: 40 00 06 94 call 2008958 <_TOD_Get_as_timestamp> 2006f0c: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2006f10: f8 1f bf e8 ldd [ %fp + -24 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006f14: 94 10 20 00 clr %o2 2006f18: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006f1c: 90 10 00 1c mov %i4, %o0 2006f20: 96 12 e2 00 or %o3, 0x200, %o3 2006f24: 40 00 51 cf call 201b660 <__divdi3> 2006f28: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006f2c: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006f30: d2 26 20 6c st %o1, [ %i0 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006f34: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006f38: 90 10 00 1c mov %i4, %o0 2006f3c: 96 12 e2 00 or %o3, 0x200, %o3 2006f40: 40 00 52 ae call 201b9f8 <__moddi3> 2006f44: 92 10 00 1d mov %i5, %o1 2006f48: d2 26 20 70 st %o1, [ %i0 + 0x70 ] _TOD_Get( &ptimer->time ); _Thread_Enable_dispatch(); 2006f4c: 40 00 0d 41 call 200a450 <_Thread_Enable_dispatch> 2006f50: b0 10 20 00 clr %i0 return 0; 2006f54: 81 c7 e0 08 ret 2006f58: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2006f5c: 40 00 06 7f call 2008958 <_TOD_Get_as_timestamp> 2006f60: 90 07 bf e8 add %fp, -24, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2006f64: f8 1f bf e8 ldd [ %fp + -24 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006f68: 94 10 20 00 clr %o2 2006f6c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006f70: 90 10 00 1c mov %i4, %o0 2006f74: 96 12 e2 00 or %o3, 0x200, %o3 2006f78: 40 00 51 ba call 201b660 <__divdi3> 2006f7c: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006f80: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2006f84: d2 27 bf f4 st %o1, [ %fp + -12 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2006f88: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2006f8c: 90 10 00 1c mov %i4, %o0 2006f90: 96 12 e2 00 or %o3, 0x200, %o3 2006f94: 40 00 52 99 call 201b9f8 <__moddi3> 2006f98: 92 10 00 1d mov %i5, %o1 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2006f9c: 90 07 bf e0 add %fp, -32, %o0 2006fa0: d2 27 bf f8 st %o1, [ %fp + -8 ] 2006fa4: 40 00 10 0c call 200afd4 <_Timespec_Less_than> 2006fa8: 92 07 bf f4 add %fp, -12, %o1 2006fac: 80 8a 20 ff btst 0xff, %o0 2006fb0: 12 80 00 31 bne 2007074 2006fb4: 92 07 bf e0 add %fp, -32, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2006fb8: 90 07 bf f4 add %fp, -12, %o0 2006fbc: 40 00 10 18 call 200b01c <_Timespec_Subtract> 2006fc0: 94 10 00 09 mov %o1, %o2 2006fc4: 92 10 00 18 mov %i0, %o1 2006fc8: 11 00 80 80 sethi %hi(0x2020000), %o0 2006fcc: 94 07 bf fc add %fp, -4, %o2 2006fd0: 40 00 09 3e call 20094c8 <_Objects_Get> 2006fd4: 90 12 23 20 or %o0, 0x320, %o0 * something with the structure of times of the timer: to stop, start * or start it again */ ptimer = _POSIX_Timer_Get( timerid, &location ); switch ( location ) { 2006fd8: c2 07 bf fc ld [ %fp + -4 ], %g1 2006fdc: 80 a0 60 00 cmp %g1, 0 2006fe0: 02 bf ff a0 be 2006e60 2006fe4: b0 10 00 08 mov %o0, %i0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2006fe8: 40 00 2b eb call 2011f94 <__errno> 2006fec: b0 10 3f ff mov -1, %i0 2006ff0: 82 10 20 16 mov 0x16, %g1 2006ff4: c2 22 00 00 st %g1, [ %o0 ] } 2006ff8: 81 c7 e0 08 ret 2006ffc: 81 e8 00 00 restore case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 2007000: 40 00 11 60 call 200b580 <_Watchdog_Remove> 2007004: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2007008: 80 a6 e0 00 cmp %i3, 0 200700c: 02 80 00 0b be 2007038 2007010: c2 07 bf d8 ld [ %fp + -40 ], %g1 *ovalue = ptimer->timer_data; 2007014: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 2007018: c2 26 c0 00 st %g1, [ %i3 ] 200701c: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 2007020: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2007024: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2007028: c2 26 e0 08 st %g1, [ %i3 + 8 ] 200702c: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2007030: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 2007034: c2 07 bf d8 ld [ %fp + -40 ], %g1 2007038: c2 26 20 54 st %g1, [ %i0 + 0x54 ] 200703c: c2 07 bf dc ld [ %fp + -36 ], %g1 2007040: c2 26 20 58 st %g1, [ %i0 + 0x58 ] 2007044: c2 07 bf e0 ld [ %fp + -32 ], %g1 2007048: c2 26 20 5c st %g1, [ %i0 + 0x5c ] 200704c: c2 07 bf e4 ld [ %fp + -28 ], %g1 2007050: c2 26 20 60 st %g1, [ %i0 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2007054: 82 10 20 04 mov 4, %g1 2007058: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] /* Returns with success */ _Thread_Enable_dispatch(); 200705c: 40 00 0c fd call 200a450 <_Thread_Enable_dispatch> 2007060: b0 10 20 00 clr %i0 return 0; 2007064: 81 c7 e0 08 ret 2007068: 81 e8 00 00 restore } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 200706c: 22 bf ff 6b be,a 2006e18 2007070: c8 06 80 00 ld [ %i2 ], %g4 if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007074: 40 00 2b c8 call 2011f94 <__errno> 2007078: b0 10 3f ff mov -1, %i0 200707c: 82 10 20 16 mov 0x16, %g1 2007080: c2 22 00 00 st %g1, [ %o0 ] 2007084: 81 c7 e0 08 ret 2007088: 81 e8 00 00 restore =============================================================================== 0200701c : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 200701c: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2007020: 3b 00 80 86 sethi %hi(0x2021800), %i5 2007024: ba 17 61 b8 or %i5, 0x1b8, %i5 ! 20219b8 <_POSIX_signals_Ualarm_timer> 2007028: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200702c: 80 a0 60 00 cmp %g1, 0 2007030: 02 80 00 24 be 20070c0 2007034: b8 10 00 18 mov %i0, %i4 _Watchdog_Initialize( the_timer, _POSIX_signals_Ualarm_TSR, 0, NULL ); } else { Watchdog_States state; state = _Watchdog_Remove( the_timer ); 2007038: 40 00 11 03 call 200b444 <_Watchdog_Remove> 200703c: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2007040: 90 02 3f fe add %o0, -2, %o0 2007044: 80 a2 20 01 cmp %o0, 1 2007048: 08 80 00 26 bleu 20070e0 <== ALWAYS TAKEN 200704c: b0 10 20 00 clr %i0 /* * If useconds is non-zero, then the caller wants to schedule * the alarm repeatedly at that interval. If the interval is * less than a single clock tick, then fudge it to a clock tick. */ if ( useconds ) { 2007050: 80 a7 20 00 cmp %i4, 0 2007054: 02 80 00 19 be 20070b8 2007058: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 200705c: 90 10 00 1c mov %i4, %o0 2007060: 40 00 54 d1 call 201c3a4 <.udiv> 2007064: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007068: 92 16 e2 40 or %i3, 0x240, %o1 * less than a single clock tick, then fudge it to a clock tick. */ if ( useconds ) { Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 200706c: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007070: 40 00 55 79 call 201c654 <.urem> 2007074: 90 10 00 1c mov %i4, %o0 2007078: 87 2a 20 07 sll %o0, 7, %g3 200707c: 82 10 00 08 mov %o0, %g1 2007080: 85 2a 20 02 sll %o0, 2, %g2 2007084: 84 20 c0 02 sub %g3, %g2, %g2 2007088: 82 00 80 01 add %g2, %g1, %g1 200708c: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 2007090: 90 07 bf f8 add %fp, -8, %o0 2007094: 40 00 0f 78 call 200ae74 <_Timespec_To_ticks> 2007098: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 200709c: 40 00 0f 76 call 200ae74 <_Timespec_To_ticks> 20070a0: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20070a4: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20070a8: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20070ac: 11 00 80 84 sethi %hi(0x2021000), %o0 20070b0: 40 00 10 83 call 200b2bc <_Watchdog_Insert> 20070b4: 90 12 21 60 or %o0, 0x160, %o0 ! 2021160 <_Watchdog_Ticks_chain> } return remaining; } 20070b8: 81 c7 e0 08 ret 20070bc: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20070c0: 03 00 80 1b sethi %hi(0x2006c00), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20070c4: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 20070c8: 82 10 63 f0 or %g1, 0x3f0, %g1 the_watchdog->id = id; 20070cc: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20070d0: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 20070d4: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 20070d8: 10 bf ff de b 2007050 20070dc: b0 10 20 00 clr %i0 * boot. Since alarm() is dealing in seconds, we must account for * this. */ ticks = the_timer->initial; ticks -= (the_timer->stop_time - the_timer->start_time); 20070e0: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20070e4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20070e8: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20070ec: 92 07 bf f8 add %fp, -8, %o1 * boot. Since alarm() is dealing in seconds, we must account for * this. */ ticks = the_timer->initial; ticks -= (the_timer->stop_time - the_timer->start_time); 20070f0: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20070f4: 40 00 0f 4b call 200ae20 <_Timespec_From_ticks> 20070f8: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 20070fc: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2007100: d0 07 bf fc ld [ %fp + -4 ], %o0 ticks = the_timer->initial; ticks -= (the_timer->stop_time - the_timer->start_time); /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007104: 85 28 60 03 sll %g1, 3, %g2 2007108: 87 28 60 08 sll %g1, 8, %g3 200710c: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 2007110: 92 10 23 e8 mov 0x3e8, %o1 ticks = the_timer->initial; ticks -= (the_timer->stop_time - the_timer->start_time); /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007114: b1 28 a0 06 sll %g2, 6, %i0 2007118: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 200711c: 40 00 54 a4 call 201c3ac <.div> 2007120: b0 06 00 01 add %i0, %g1, %i0 ticks = the_timer->initial; ticks -= (the_timer->stop_time - the_timer->start_time); /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007124: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2007128: 10 bf ff ca b 2007050 200712c: b0 02 00 18 add %o0, %i0, %i0