=============================================================================== 02006cc4 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2006cc4: 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; 2006cc8: 39 00 80 5a sethi %hi(0x2016800), %i4 2006ccc: fa 07 22 54 ld [ %i4 + 0x254 ], %i5 ! 2016a54 <_API_extensions_List> 2006cd0: b8 17 22 54 or %i4, 0x254, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006cd4: b8 07 20 04 add %i4, 4, %i4 2006cd8: 80 a7 40 1c cmp %i5, %i4 2006cdc: 02 80 00 09 be 2006d00 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2006ce0: 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)(); 2006ce4: c2 07 60 08 ld [ %i5 + 8 ], %g1 2006ce8: 9f c0 40 00 call %g1 2006cec: 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 ) { 2006cf0: 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 ); 2006cf4: 80 a7 40 1c cmp %i5, %i4 2006cf8: 32 bf ff fc bne,a 2006ce8 <_API_extensions_Run_postdriver+0x24> 2006cfc: c2 07 60 08 ld [ %i5 + 8 ], %g1 2006d00: 81 c7 e0 08 ret 2006d04: 81 e8 00 00 restore =============================================================================== 02006d08 <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 2006d08: 9d e3 bf a0 save %sp, -96, %sp 2006d0c: 39 00 80 5a sethi %hi(0x2016800), %i4 2006d10: fa 07 22 54 ld [ %i4 + 0x254 ], %i5 ! 2016a54 <_API_extensions_List> 2006d14: b8 17 22 54 or %i4, 0x254, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006d18: b8 07 20 04 add %i4, 4, %i4 2006d1c: 80 a7 40 1c cmp %i5, %i4 2006d20: 02 80 00 0a be 2006d48 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 2006d24: 37 00 80 5b sethi %hi(0x2016c00), %i3 2006d28: b6 16 e1 98 or %i3, 0x198, %i3 ! 2016d98 <_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 ); 2006d2c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2006d30: 9f c0 40 00 call %g1 2006d34: 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 ) { 2006d38: 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 ); 2006d3c: 80 a7 40 1c cmp %i5, %i4 2006d40: 32 bf ff fc bne,a 2006d30 <_API_extensions_Run_postswitch+0x28> 2006d44: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2006d48: 81 c7 e0 08 ret 2006d4c: 81 e8 00 00 restore =============================================================================== 020094e8 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 20094e8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 20094ec: 03 00 80 6b sethi %hi(0x201ac00), %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 ); 20094f0: 7f ff e8 11 call 2003534 20094f4: fa 00 60 04 ld [ %g1 + 4 ], %i5 ! 201ac04 <_Per_CPU_Information+0xc> 20094f8: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 20094fc: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 2009500: 80 a0 60 00 cmp %g1, 0 2009504: 02 80 00 2b be 20095b0 <_CORE_RWLock_Release+0xc8> 2009508: 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 ) { 200950c: 22 80 00 22 be,a 2009594 <_CORE_RWLock_Release+0xac> 2009510: 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; 2009514: 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; 2009518: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200951c: 7f ff e8 0a call 2003544 2009520: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 2009524: 40 00 07 bb call 200b410 <_Thread_queue_Dequeue> 2009528: 90 10 00 18 mov %i0, %o0 if ( next ) { 200952c: 80 a2 20 00 cmp %o0, 0 2009530: 22 80 00 24 be,a 20095c0 <_CORE_RWLock_Release+0xd8> 2009534: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 2009538: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200953c: 80 a0 60 01 cmp %g1, 1 2009540: 02 80 00 22 be 20095c8 <_CORE_RWLock_Release+0xe0> 2009544: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009548: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200954c: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 2009550: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009554: 10 80 00 09 b 2009578 <_CORE_RWLock_Release+0x90> 2009558: 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 || 200955c: 80 a0 60 01 cmp %g1, 1 2009560: 02 80 00 0b be 200958c <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 2009564: 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; 2009568: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200956c: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 2009570: 40 00 08 b6 call 200b848 <_Thread_queue_Extract> 2009574: 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 ); 2009578: 40 00 09 05 call 200b98c <_Thread_queue_First> 200957c: 90 10 00 18 mov %i0, %o0 if ( !next || 2009580: 92 92 20 00 orcc %o0, 0, %o1 2009584: 32 bf ff f6 bne,a 200955c <_CORE_RWLock_Release+0x74> 2009588: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200958c: 81 c7 e0 08 ret 2009590: 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; 2009594: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 2009598: 80 a0 60 00 cmp %g1, 0 200959c: 02 bf ff de be 2009514 <_CORE_RWLock_Release+0x2c> 20095a0: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 20095a4: 7f ff e7 e8 call 2003544 20095a8: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 20095ac: 30 80 00 05 b,a 20095c0 <_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 ); 20095b0: 7f ff e7 e5 call 2003544 20095b4: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 20095b8: 82 10 20 02 mov 2, %g1 20095bc: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 20095c0: 81 c7 e0 08 ret 20095c4: 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; 20095c8: 82 10 20 02 mov 2, %g1 20095cc: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 20095d0: 81 c7 e0 08 ret 20095d4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020095d8 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 20095d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20095dc: 90 10 00 18 mov %i0, %o0 20095e0: 40 00 06 b6 call 200b0b8 <_Thread_Get> 20095e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20095e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20095ec: 80 a0 60 00 cmp %g1, 0 20095f0: 12 80 00 08 bne 2009610 <_CORE_RWLock_Timeout+0x38> <== NEVER TAKEN 20095f4: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 20095f8: 40 00 09 27 call 200ba94 <_Thread_queue_Process_timeout> 20095fc: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2009600: 03 00 80 69 sethi %hi(0x201a400), %g1 2009604: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201a6c0 <_Thread_Dispatch_disable_level> 2009608: 84 00 bf ff add %g2, -1, %g2 200960c: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] 2009610: 81 c7 e0 08 ret 2009614: 81 e8 00 00 restore =============================================================================== 02010ac8 <_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 ) { 2010ac8: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010acc: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010ad0: 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; 2010ad4: 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; 2010ad8: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 2010adc: 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)) { 2010ae0: 80 8e e0 03 btst 3, %i3 2010ae4: 02 80 00 0a be 2010b0c <_CORE_message_queue_Initialize+0x44> 2010ae8: a0 10 00 1b mov %i3, %l0 allocated_message_size += sizeof(uint32_t); 2010aec: a0 06 e0 04 add %i3, 4, %l0 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010af0: a0 0c 3f fc and %l0, -4, %l0 } if (allocated_message_size < maximum_message_size) 2010af4: 80 a6 c0 10 cmp %i3, %l0 2010af8: 08 80 00 05 bleu 2010b0c <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2010afc: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b00: b0 0f 60 01 and %i5, 1, %i0 2010b04: 81 c7 e0 08 ret 2010b08: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 2010b0c: b8 04 20 14 add %l0, 0x14, %i4 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 2010b10: 92 10 00 1a mov %i2, %o1 2010b14: 90 10 00 1c mov %i4, %o0 2010b18: 40 00 43 2e call 20217d0 <.umul> 2010b1c: ba 10 20 00 clr %i5 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 2010b20: 80 a2 00 10 cmp %o0, %l0 2010b24: 2a bf ff f8 bcs,a 2010b04 <_CORE_message_queue_Initialize+0x3c><== NEVER TAKEN 2010b28: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010b2c: 40 00 0d 20 call 2013fac <_Workspace_Allocate> 2010b30: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010b34: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010b38: 80 a2 20 00 cmp %o0, 0 2010b3c: 02 bf ff f1 be 2010b00 <_CORE_message_queue_Initialize+0x38> 2010b40: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010b44: 90 06 20 68 add %i0, 0x68, %o0 2010b48: 94 10 00 1a mov %i2, %o2 2010b4c: 40 00 17 4f call 2016888 <_Chain_Initialize> 2010b50: 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( 2010b54: 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 ); 2010b58: 82 06 20 50 add %i0, 0x50, %g1 2010b5c: 84 18 a0 01 xor %g2, 1, %g2 2010b60: 80 a0 00 02 cmp %g0, %g2 2010b64: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010b68: 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; 2010b6c: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2010b70: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2010b74: c0 26 20 54 clr [ %i0 + 0x54 ] 2010b78: 92 60 3f ff subx %g0, -1, %o1 2010b7c: 94 10 20 80 mov 0x80, %o2 2010b80: 96 10 20 06 mov 6, %o3 2010b84: 40 00 0a 46 call 201349c <_Thread_queue_Initialize> 2010b88: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b8c: b0 0f 60 01 and %i5, 1, %i0 2010b90: 81 c7 e0 08 ret 2010b94: 81 e8 00 00 restore =============================================================================== 02007014 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2007014: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2007018: 3b 00 80 5a sethi %hi(0x2016800), %i5 200701c: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 ! 2016860 <_Thread_Dispatch_disable_level> 2007020: 80 a0 60 00 cmp %g1, 0 2007024: 02 80 00 05 be 2007038 <_CORE_mutex_Seize+0x24> 2007028: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200702c: 80 a6 a0 00 cmp %i2, 0 2007030: 12 80 00 1a bne 2007098 <_CORE_mutex_Seize+0x84> <== ALWAYS TAKEN 2007034: 03 00 80 5a sethi %hi(0x2016800), %g1 2007038: 90 10 00 18 mov %i0, %o0 200703c: 40 00 16 48 call 200c95c <_CORE_mutex_Seize_interrupt_trylock> 2007040: 92 07 a0 54 add %fp, 0x54, %o1 2007044: 80 a2 20 00 cmp %o0, 0 2007048: 02 80 00 12 be 2007090 <_CORE_mutex_Seize+0x7c> 200704c: 80 a6 a0 00 cmp %i2, 0 2007050: 02 80 00 1a be 20070b8 <_CORE_mutex_Seize+0xa4> 2007054: 01 00 00 00 nop 2007058: c4 07 60 60 ld [ %i5 + 0x60 ], %g2 200705c: 03 00 80 5b sethi %hi(0x2016c00), %g1 2007060: c2 00 61 a4 ld [ %g1 + 0x1a4 ], %g1 ! 2016da4 <_Per_CPU_Information+0xc> 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; 2007064: 86 10 20 01 mov 1, %g3 2007068: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 200706c: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2007070: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 2007074: 82 00 a0 01 add %g2, 1, %g1 2007078: c2 27 60 60 st %g1, [ %i5 + 0x60 ] 200707c: 7f ff eb b9 call 2001f60 2007080: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2007084: 90 10 00 18 mov %i0, %o0 2007088: 7f ff ff c1 call 2006f8c <_CORE_mutex_Seize_interrupt_blocking> 200708c: 92 10 00 1b mov %i3, %o1 2007090: 81 c7 e0 08 ret 2007094: 81 e8 00 00 restore 2007098: c2 00 61 bc ld [ %g1 + 0x1bc ], %g1 200709c: 80 a0 60 01 cmp %g1, 1 20070a0: 28 bf ff e7 bleu,a 200703c <_CORE_mutex_Seize+0x28> 20070a4: 90 10 00 18 mov %i0, %o0 20070a8: 90 10 20 00 clr %o0 20070ac: 92 10 20 00 clr %o1 20070b0: 40 00 01 dc call 2007820 <_Internal_error_Occurred> 20070b4: 94 10 20 12 mov 0x12, %o2 20070b8: 7f ff eb aa call 2001f60 20070bc: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20070c0: 03 00 80 5b sethi %hi(0x2016c00), %g1 20070c4: c2 00 61 a4 ld [ %g1 + 0x1a4 ], %g1 ! 2016da4 <_Per_CPU_Information+0xc> 20070c8: 84 10 20 01 mov 1, %g2 20070cc: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 20070d0: 81 c7 e0 08 ret 20070d4: 81 e8 00 00 restore =============================================================================== 0200724c <_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 ) { 200724c: 9d e3 bf a0 save %sp, -96, %sp 2007250: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007254: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2007258: 40 00 07 8d call 200908c <_Thread_queue_Dequeue> 200725c: 90 10 00 1d mov %i5, %o0 2007260: 80 a2 20 00 cmp %o0, 0 2007264: 02 80 00 04 be 2007274 <_CORE_semaphore_Surrender+0x28> 2007268: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 200726c: 81 c7 e0 08 ret 2007270: 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 ); 2007274: 7f ff eb 37 call 2001f50 2007278: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 200727c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007280: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2007284: 80 a0 40 02 cmp %g1, %g2 2007288: 1a 80 00 05 bcc 200729c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 200728c: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007290: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007294: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007298: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 200729c: 7f ff eb 31 call 2001f60 20072a0: 01 00 00 00 nop } return status; } 20072a4: 81 c7 e0 08 ret 20072a8: 81 e8 00 00 restore =============================================================================== 0200c8f4 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200c8f4: 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; 200c8f8: 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 ); 200c8fc: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c900: 80 a6 a0 00 cmp %i2, 0 200c904: 02 80 00 12 be 200c94c <_Chain_Initialize+0x58> <== NEVER TAKEN 200c908: 90 10 00 18 mov %i0, %o0 200c90c: 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; 200c910: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200c914: 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; 200c918: 10 80 00 05 b 200c92c <_Chain_Initialize+0x38> 200c91c: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c920: 84 10 00 01 mov %g1, %g2 200c924: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200c928: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200c92c: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200c930: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c934: 80 a6 a0 00 cmp %i2, 0 200c938: 12 bf ff fa bne 200c920 <_Chain_Initialize+0x2c> 200c93c: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200c940: 40 00 17 af call 20127fc <.umul> 200c944: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c948: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200c94c: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200c950: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200c954: 81 c7 e0 08 ret 200c958: 81 e8 00 00 restore =============================================================================== 02005f34 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2005f34: 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 ]; 2005f38: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 2005f3c: 7f ff f0 05 call 2001f50 2005f40: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 2005f44: b8 10 00 08 mov %o0, %i4 pending_events = api->pending_events; 2005f48: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2005f4c: 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 ) ) { 2005f50: 86 88 40 02 andcc %g1, %g2, %g3 2005f54: 02 80 00 3a be 200603c <_Event_Surrender+0x108> 2005f58: 09 00 80 5b sethi %hi(0x2016c00), %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() && 2005f5c: 88 11 21 98 or %g4, 0x198, %g4 ! 2016d98 <_Per_CPU_Information> 2005f60: f2 01 20 08 ld [ %g4 + 8 ], %i1 2005f64: 80 a6 60 00 cmp %i1, 0 2005f68: 32 80 00 1d bne,a 2005fdc <_Event_Surrender+0xa8> 2005f6c: 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); 2005f70: 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 ) ) { 2005f74: 80 89 21 00 btst 0x100, %g4 2005f78: 02 80 00 31 be 200603c <_Event_Surrender+0x108> 2005f7c: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2005f80: 02 80 00 04 be 2005f90 <_Event_Surrender+0x5c> 2005f84: 80 8e e0 02 btst 2, %i3 2005f88: 02 80 00 2d be 200603c <_Event_Surrender+0x108> <== NEVER TAKEN 2005f8c: 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; 2005f90: 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) ); 2005f94: 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 ); 2005f98: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2005f9c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005fa0: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 2005fa4: 7f ff ef ef call 2001f60 2005fa8: 90 10 00 1c mov %i4, %o0 2005fac: 7f ff ef e9 call 2001f50 2005fb0: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2005fb4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2005fb8: 80 a0 60 02 cmp %g1, 2 2005fbc: 02 80 00 22 be 2006044 <_Event_Surrender+0x110> 2005fc0: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2005fc4: 90 10 00 1c mov %i4, %o0 2005fc8: 7f ff ef e6 call 2001f60 2005fcc: 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 ); 2005fd0: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2005fd4: 40 00 0a 5d call 2008948 <_Thread_Clear_state> 2005fd8: 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() && 2005fdc: 80 a6 00 04 cmp %i0, %g4 2005fe0: 32 bf ff e5 bne,a 2005f74 <_Event_Surrender+0x40> 2005fe4: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2005fe8: 09 00 80 5c sethi %hi(0x2017000), %g4 2005fec: f2 01 21 90 ld [ %g4 + 0x190 ], %i1 ! 2017190 <_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 ) && 2005ff0: 80 a6 60 02 cmp %i1, 2 2005ff4: 02 80 00 07 be 2006010 <_Event_Surrender+0xdc> <== NEVER TAKEN 2005ff8: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2005ffc: f2 01 21 90 ld [ %g4 + 0x190 ], %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) || 2006000: 80 a6 60 01 cmp %i1, 1 2006004: 32 bf ff dc bne,a 2005f74 <_Event_Surrender+0x40> 2006008: 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) ) { 200600c: 80 a0 40 03 cmp %g1, %g3 2006010: 02 80 00 04 be 2006020 <_Event_Surrender+0xec> 2006014: 80 8e e0 02 btst 2, %i3 2006018: 02 80 00 09 be 200603c <_Event_Surrender+0x108> <== NEVER TAKEN 200601c: 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; 2006020: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006024: 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 ); 2006028: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 200602c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006030: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006034: 82 10 20 03 mov 3, %g1 2006038: c2 21 21 90 st %g1, [ %g4 + 0x190 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 200603c: 7f ff ef c9 call 2001f60 2006040: 91 e8 00 1c restore %g0, %i4, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2006044: 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 ); 2006048: 7f ff ef c6 call 2001f60 200604c: 90 10 00 1c mov %i4, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 2006050: 40 00 0f 7b call 2009e3c <_Watchdog_Remove> 2006054: 90 06 20 48 add %i0, 0x48, %o0 2006058: 33 04 00 ff sethi %hi(0x1003fc00), %i1 200605c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006060: 40 00 0a 3a call 2008948 <_Thread_Clear_state> 2006064: 81 e8 00 00 restore =============================================================================== 02006068 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006068: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 200606c: 90 10 00 18 mov %i0, %o0 2006070: 40 00 0b 31 call 2008d34 <_Thread_Get> 2006074: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006078: c2 07 bf fc ld [ %fp + -4 ], %g1 200607c: 80 a0 60 00 cmp %g1, 0 2006080: 12 80 00 15 bne 20060d4 <_Event_Timeout+0x6c> <== NEVER TAKEN 2006084: 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 ); 2006088: 7f ff ef b2 call 2001f50 200608c: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006090: 03 00 80 5b sethi %hi(0x2016c00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006094: c2 00 61 a4 ld [ %g1 + 0x1a4 ], %g1 ! 2016da4 <_Per_CPU_Information+0xc> 2006098: 80 a7 40 01 cmp %i5, %g1 200609c: 02 80 00 10 be 20060dc <_Event_Timeout+0x74> 20060a0: 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; 20060a4: 82 10 20 06 mov 6, %g1 20060a8: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20060ac: 7f ff ef ad call 2001f60 20060b0: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20060b4: 90 10 00 1d mov %i5, %o0 20060b8: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20060bc: 40 00 0a 23 call 2008948 <_Thread_Clear_state> 20060c0: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 20060c4: 03 00 80 5a sethi %hi(0x2016800), %g1 20060c8: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 2016860 <_Thread_Dispatch_disable_level> 20060cc: 84 00 bf ff add %g2, -1, %g2 20060d0: c4 20 60 60 st %g2, [ %g1 + 0x60 ] 20060d4: 81 c7 e0 08 ret 20060d8: 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 ) 20060dc: 03 00 80 5c sethi %hi(0x2017000), %g1 20060e0: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 2017190 <_Event_Sync_state> 20060e4: 80 a0 a0 01 cmp %g2, 1 20060e8: 32 bf ff f0 bne,a 20060a8 <_Event_Timeout+0x40> 20060ec: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 20060f0: 84 10 20 02 mov 2, %g2 20060f4: c4 20 61 90 st %g2, [ %g1 + 0x190 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 20060f8: 10 bf ff ec b 20060a8 <_Event_Timeout+0x40> 20060fc: 82 10 20 06 mov 6, %g1 =============================================================================== 0200cb28 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200cb28: 9d e3 bf 98 save %sp, -104, %sp 200cb2c: 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 200cb30: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200cb34: 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 ) { 200cb38: 80 a6 40 10 cmp %i1, %l0 200cb3c: 18 80 00 23 bgu 200cbc8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200cb40: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200cb44: 80 a6 e0 00 cmp %i3, 0 200cb48: 12 80 00 7d bne 200cd3c <_Heap_Allocate_aligned_with_boundary+0x214> 200cb4c: 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; 200cb50: 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 ) { 200cb54: 80 a7 40 11 cmp %i5, %l1 200cb58: 02 80 00 18 be 200cbb8 <_Heap_Allocate_aligned_with_boundary+0x90> 200cb5c: 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 200cb60: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200cb64: 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 200cb68: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200cb6c: 10 80 00 0b b 200cb98 <_Heap_Allocate_aligned_with_boundary+0x70> 200cb70: 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 ) { 200cb74: 12 80 00 17 bne 200cbd0 <_Heap_Allocate_aligned_with_boundary+0xa8> 200cb78: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cb7c: 80 a6 20 00 cmp %i0, 0 200cb80: 12 80 00 5b bne 200ccec <_Heap_Allocate_aligned_with_boundary+0x1c4> 200cb84: b8 07 20 01 inc %i4 break; } block = block->next; 200cb88: 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 ) { 200cb8c: 80 a7 40 11 cmp %i5, %l1 200cb90: 22 80 00 0b be,a 200cbbc <_Heap_Allocate_aligned_with_boundary+0x94> 200cb94: 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 ) { 200cb98: e4 04 60 04 ld [ %l1 + 4 ], %l2 200cb9c: 80 a4 00 12 cmp %l0, %l2 200cba0: 0a bf ff f5 bcs 200cb74 <_Heap_Allocate_aligned_with_boundary+0x4c> 200cba4: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200cba8: 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 ) { 200cbac: 80 a7 40 11 cmp %i5, %l1 200cbb0: 12 bf ff fa bne 200cb98 <_Heap_Allocate_aligned_with_boundary+0x70> 200cbb4: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200cbb8: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200cbbc: 80 a0 40 1c cmp %g1, %i4 200cbc0: 0a 80 00 5a bcs 200cd28 <_Heap_Allocate_aligned_with_boundary+0x200> 200cbc4: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200cbc8: 81 c7 e0 08 ret 200cbcc: 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; 200cbd0: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200cbd4: 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; 200cbd8: 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; 200cbdc: 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; 200cbe0: 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); 200cbe4: 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; 200cbe8: 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 200cbec: a4 00 40 12 add %g1, %l2, %l2 200cbf0: 40 00 17 e9 call 2012b94 <.urem> 200cbf4: 90 10 00 18 mov %i0, %o0 200cbf8: 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 ) { 200cbfc: 80 a4 80 18 cmp %l2, %i0 200cc00: 1a 80 00 06 bcc 200cc18 <_Heap_Allocate_aligned_with_boundary+0xf0> 200cc04: a8 04 60 08 add %l1, 8, %l4 200cc08: 90 10 00 12 mov %l2, %o0 200cc0c: 40 00 17 e2 call 2012b94 <.urem> 200cc10: 92 10 00 1a mov %i2, %o1 200cc14: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200cc18: 80 a6 e0 00 cmp %i3, 0 200cc1c: 02 80 00 24 be 200ccac <_Heap_Allocate_aligned_with_boundary+0x184> 200cc20: 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; 200cc24: a4 06 00 19 add %i0, %i1, %l2 200cc28: 92 10 00 1b mov %i3, %o1 200cc2c: 40 00 17 da call 2012b94 <.urem> 200cc30: 90 10 00 12 mov %l2, %o0 200cc34: 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 ) { 200cc38: 80 a6 00 08 cmp %i0, %o0 200cc3c: 1a 80 00 1b bcc 200cca8 <_Heap_Allocate_aligned_with_boundary+0x180> 200cc40: 80 a2 00 12 cmp %o0, %l2 200cc44: 1a 80 00 1a bcc 200ccac <_Heap_Allocate_aligned_with_boundary+0x184> 200cc48: 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; 200cc4c: 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 ) { 200cc50: 80 a4 c0 08 cmp %l3, %o0 200cc54: 08 80 00 08 bleu 200cc74 <_Heap_Allocate_aligned_with_boundary+0x14c> 200cc58: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cc5c: 10 bf ff c9 b 200cb80 <_Heap_Allocate_aligned_with_boundary+0x58> 200cc60: 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 ) { 200cc64: 1a 80 00 11 bcc 200cca8 <_Heap_Allocate_aligned_with_boundary+0x180> 200cc68: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200cc6c: 18 bf ff c4 bgu 200cb7c <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200cc70: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200cc74: b0 22 00 19 sub %o0, %i1, %i0 200cc78: 92 10 00 1a mov %i2, %o1 200cc7c: 40 00 17 c6 call 2012b94 <.urem> 200cc80: 90 10 00 18 mov %i0, %o0 200cc84: 92 10 00 1b mov %i3, %o1 200cc88: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200cc8c: a4 06 00 19 add %i0, %i1, %l2 200cc90: 40 00 17 c1 call 2012b94 <.urem> 200cc94: 90 10 00 12 mov %l2, %o0 200cc98: 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 ) { 200cc9c: 80 a2 00 12 cmp %o0, %l2 200cca0: 0a bf ff f1 bcs 200cc64 <_Heap_Allocate_aligned_with_boundary+0x13c> 200cca4: 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 ) { 200cca8: 80 a5 00 18 cmp %l4, %i0 200ccac: 18 80 00 22 bgu 200cd34 <_Heap_Allocate_aligned_with_boundary+0x20c> 200ccb0: 82 10 3f f8 mov -8, %g1 200ccb4: 90 10 00 18 mov %i0, %o0 200ccb8: a4 20 40 11 sub %g1, %l1, %l2 200ccbc: 92 10 00 16 mov %l6, %o1 200ccc0: 40 00 17 b5 call 2012b94 <.urem> 200ccc4: 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 ) { 200ccc8: 90 a4 80 08 subcc %l2, %o0, %o0 200cccc: 02 bf ff ad be 200cb80 <_Heap_Allocate_aligned_with_boundary+0x58> 200ccd0: 80 a6 20 00 cmp %i0, 0 200ccd4: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200ccd8: 82 40 3f ff addx %g0, -1, %g1 200ccdc: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cce0: 80 a6 20 00 cmp %i0, 0 200cce4: 02 bf ff a9 be 200cb88 <_Heap_Allocate_aligned_with_boundary+0x60> 200cce8: 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; 200ccec: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200ccf0: 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; 200ccf4: 84 00 a0 01 inc %g2 stats->searches += search_count; 200ccf8: 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; 200ccfc: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200cd00: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200cd04: 90 10 00 1d mov %i5, %o0 200cd08: 92 10 00 11 mov %l1, %o1 200cd0c: 94 10 00 18 mov %i0, %o2 200cd10: 7f ff ea 74 call 20076e0 <_Heap_Block_allocate> 200cd14: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200cd18: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200cd1c: 80 a0 40 1c cmp %g1, %i4 200cd20: 1a 80 00 03 bcc 200cd2c <_Heap_Allocate_aligned_with_boundary+0x204> 200cd24: 01 00 00 00 nop stats->max_search = search_count; 200cd28: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200cd2c: 81 c7 e0 08 ret 200cd30: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200cd34: 10 bf ff 92 b 200cb7c <_Heap_Allocate_aligned_with_boundary+0x54> 200cd38: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200cd3c: 18 bf ff a3 bgu 200cbc8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200cd40: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200cd44: 22 bf ff 83 be,a 200cb50 <_Heap_Allocate_aligned_with_boundary+0x28> 200cd48: 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; 200cd4c: 10 bf ff 82 b 200cb54 <_Heap_Allocate_aligned_with_boundary+0x2c> 200cd50: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200d050 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200d050: 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; 200d054: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d058: 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; 200d05c: 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; 200d060: 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; 200d064: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200d068: 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; 200d06c: 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 ) { 200d070: 80 a6 40 1d cmp %i1, %i5 200d074: 08 80 00 05 bleu 200d088 <_Heap_Extend+0x38> 200d078: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d07c: b0 0c 60 01 and %l1, 1, %i0 200d080: 81 c7 e0 08 ret 200d084: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200d088: 90 10 00 19 mov %i1, %o0 200d08c: 92 10 00 1a mov %i2, %o1 200d090: 94 10 00 10 mov %l0, %o2 200d094: 98 07 bf f8 add %fp, -8, %o4 200d098: 7f ff e9 ed call 200784c <_Heap_Get_first_and_last_block> 200d09c: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200d0a0: 80 8a 20 ff btst 0xff, %o0 200d0a4: 02 bf ff f6 be 200d07c <_Heap_Extend+0x2c> 200d0a8: aa 10 20 00 clr %l5 200d0ac: a2 10 00 1c mov %i4, %l1 200d0b0: ac 10 20 00 clr %l6 200d0b4: a6 10 20 00 clr %l3 200d0b8: 10 80 00 14 b 200d108 <_Heap_Extend+0xb8> 200d0bc: 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 ) { 200d0c0: 2a 80 00 02 bcs,a 200d0c8 <_Heap_Extend+0x78> 200d0c4: 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); 200d0c8: 90 10 00 1a mov %i2, %o0 200d0cc: 40 00 18 06 call 20130e4 <.urem> 200d0d0: 92 10 00 10 mov %l0, %o1 200d0d4: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d0d8: 80 a6 80 19 cmp %i2, %i1 200d0dc: 02 80 00 1c be 200d14c <_Heap_Extend+0xfc> 200d0e0: 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 ) { 200d0e4: 80 a6 40 1a cmp %i1, %i2 200d0e8: 38 80 00 02 bgu,a 200d0f0 <_Heap_Extend+0xa0> 200d0ec: 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; 200d0f0: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d0f4: 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); 200d0f8: a2 04 40 01 add %l1, %g1, %l1 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200d0fc: 80 a7 00 11 cmp %i4, %l1 200d100: 22 80 00 1b be,a 200d16c <_Heap_Extend+0x11c> 200d104: 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; 200d108: 80 a4 40 1c cmp %l1, %i4 200d10c: 02 80 00 66 be 200d2a4 <_Heap_Extend+0x254> 200d110: 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 ( 200d114: 80 a0 40 1d cmp %g1, %i5 200d118: 0a 80 00 70 bcs 200d2d8 <_Heap_Extend+0x288> 200d11c: 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 ) { 200d120: 80 a0 40 1d cmp %g1, %i5 200d124: 12 bf ff e7 bne 200d0c0 <_Heap_Extend+0x70> 200d128: 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); 200d12c: 90 10 00 1a mov %i2, %o0 200d130: 40 00 17 ed call 20130e4 <.urem> 200d134: 92 10 00 10 mov %l0, %o1 200d138: 82 06 bf f8 add %i2, -8, %g1 200d13c: 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 ) { 200d140: 80 a6 80 19 cmp %i2, %i1 200d144: 12 bf ff e8 bne 200d0e4 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200d148: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200d14c: 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; 200d150: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d154: 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); 200d158: a2 04 40 01 add %l1, %g1, %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 ); 200d15c: 80 a7 00 11 cmp %i4, %l1 200d160: 12 bf ff ea bne 200d108 <_Heap_Extend+0xb8> <== NEVER TAKEN 200d164: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200d168: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200d16c: 80 a6 40 01 cmp %i1, %g1 200d170: 3a 80 00 55 bcc,a 200d2c4 <_Heap_Extend+0x274> 200d174: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200d178: 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; 200d17c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d180: 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 ) { 200d184: 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 = 200d188: 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; 200d18c: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200d190: 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 = 200d194: 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; 200d198: 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 ) { 200d19c: 80 a1 00 01 cmp %g4, %g1 200d1a0: 08 80 00 43 bleu 200d2ac <_Heap_Extend+0x25c> 200d1a4: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200d1a8: 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 ) { 200d1ac: 80 a5 20 00 cmp %l4, 0 200d1b0: 02 80 00 63 be 200d33c <_Heap_Extend+0x2ec> 200d1b4: 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; 200d1b8: 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; 200d1bc: 92 10 00 1c mov %i4, %o1 200d1c0: 40 00 17 c9 call 20130e4 <.urem> 200d1c4: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200d1c8: 80 a2 20 00 cmp %o0, 0 200d1cc: 02 80 00 04 be 200d1dc <_Heap_Extend+0x18c> 200d1d0: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200d1d4: b2 06 40 1c add %i1, %i4, %i1 200d1d8: b2 26 40 08 sub %i1, %o0, %i1 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 = 200d1dc: 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; 200d1e0: c4 26 7f f8 st %g2, [ %i1 + -8 ] 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 = 200d1e4: 84 25 00 01 sub %l4, %g1, %g2 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; 200d1e8: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200d1ec: 90 10 00 18 mov %i0, %o0 200d1f0: 92 10 00 01 mov %g1, %o1 200d1f4: 7f ff ff 8d call 200d028 <_Heap_Free_block> 200d1f8: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d1fc: 80 a4 e0 00 cmp %l3, 0 200d200: 02 80 00 3b be 200d2ec <_Heap_Extend+0x29c> 200d204: 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); 200d208: 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( 200d20c: ba 27 40 13 sub %i5, %l3, %i5 200d210: 40 00 17 b5 call 20130e4 <.urem> 200d214: 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) 200d218: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200d21c: ba 27 40 08 sub %i5, %o0, %i5 200d220: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200d224: 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 = 200d228: 84 07 40 13 add %i5, %l3, %g2 200d22c: c2 20 a0 04 st %g1, [ %g2 + 4 ] 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; 200d230: c2 04 e0 04 ld [ %l3 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 200d234: 90 10 00 18 mov %i0, %o0 200d238: 82 08 60 01 and %g1, 1, %g1 200d23c: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200d240: ba 17 40 01 or %i5, %g1, %i5 200d244: 7f ff ff 79 call 200d028 <_Heap_Free_block> 200d248: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d24c: 80 a4 e0 00 cmp %l3, 0 200d250: 02 80 00 34 be 200d320 <_Heap_Extend+0x2d0> 200d254: 80 a5 20 00 cmp %l4, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d258: 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( 200d25c: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 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; 200d260: c4 00 60 04 ld [ %g1 + 4 ], %g2 * 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( 200d264: 86 20 c0 01 sub %g3, %g1, %g3 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; 200d268: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200d26c: 84 10 80 03 or %g2, %g3, %g2 200d270: c4 20 60 04 st %g2, [ %g1 + 4 ] _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200d274: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d278: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200d27c: a2 10 20 01 mov 1, %l1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d280: a4 20 80 12 sub %g2, %l2, %l2 /* Statistics */ stats->size += extended_size; 200d284: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200d288: 80 a6 e0 00 cmp %i3, 0 200d28c: 02 bf ff 7c be 200d07c <_Heap_Extend+0x2c> <== NEVER TAKEN 200d290: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200d294: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200d298: b0 0c 60 01 and %l1, 1, %i0 200d29c: 81 c7 e0 08 ret 200d2a0: 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; 200d2a4: 10 bf ff 9c b 200d114 <_Heap_Extend+0xc4> 200d2a8: 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 ) { 200d2ac: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200d2b0: 80 a0 40 02 cmp %g1, %g2 200d2b4: 2a bf ff be bcs,a 200d1ac <_Heap_Extend+0x15c> 200d2b8: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d2bc: 10 bf ff bd b 200d1b0 <_Heap_Extend+0x160> 200d2c0: 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 ) { 200d2c4: 80 a7 40 01 cmp %i5, %g1 200d2c8: 38 bf ff ad bgu,a 200d17c <_Heap_Extend+0x12c> 200d2cc: 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; 200d2d0: 10 bf ff ac b 200d180 <_Heap_Extend+0x130> 200d2d4: 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 ( 200d2d8: 80 a6 40 1a cmp %i1, %i2 200d2dc: 1a bf ff 92 bcc 200d124 <_Heap_Extend+0xd4> 200d2e0: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200d2e4: 10 bf ff 66 b 200d07c <_Heap_Extend+0x2c> 200d2e8: 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 ) { 200d2ec: 80 a5 60 00 cmp %l5, 0 200d2f0: 02 bf ff d7 be 200d24c <_Heap_Extend+0x1fc> 200d2f4: 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; 200d2f8: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200d2fc: c2 07 bf fc ld [ %fp + -4 ], %g1 200d300: 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 ); 200d304: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200d308: 84 10 c0 02 or %g3, %g2, %g2 200d30c: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200d310: c4 00 60 04 ld [ %g1 + 4 ], %g2 200d314: 84 10 a0 01 or %g2, 1, %g2 200d318: 10 bf ff cd b 200d24c <_Heap_Extend+0x1fc> 200d31c: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d320: 32 bf ff cf bne,a 200d25c <_Heap_Extend+0x20c> 200d324: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200d328: d2 07 bf f8 ld [ %fp + -8 ], %o1 200d32c: 7f ff ff 3f call 200d028 <_Heap_Free_block> 200d330: 90 10 00 18 mov %i0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d334: 10 bf ff ca b 200d25c <_Heap_Extend+0x20c> 200d338: 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 ) { 200d33c: 80 a5 a0 00 cmp %l6, 0 200d340: 02 bf ff b0 be 200d200 <_Heap_Extend+0x1b0> 200d344: 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; 200d348: ac 25 80 02 sub %l6, %g2, %l6 200d34c: 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 = 200d350: 10 bf ff ac b 200d200 <_Heap_Extend+0x1b0> 200d354: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200cd54 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200cd54: 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 ) { 200cd58: 80 a6 60 00 cmp %i1, 0 200cd5c: 02 80 00 56 be 200ceb4 <_Heap_Free+0x160> 200cd60: 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); 200cd64: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200cd68: 40 00 17 8b call 2012b94 <.urem> 200cd6c: 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 200cd70: 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); 200cd74: 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); 200cd78: 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; 200cd7c: 80 a7 40 01 cmp %i5, %g1 200cd80: 0a 80 00 4d bcs 200ceb4 <_Heap_Free+0x160> 200cd84: 84 10 20 00 clr %g2 200cd88: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200cd8c: 80 a7 40 04 cmp %i5, %g4 200cd90: 38 80 00 4a bgu,a 200ceb8 <_Heap_Free+0x164> 200cd94: b0 08 a0 01 and %g2, 1, %i0 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cd98: de 07 60 04 ld [ %i5 + 4 ], %o7 - 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; 200cd9c: 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); 200cda0: 86 06 40 1d add %i1, %i5, %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; 200cda4: 80 a0 40 03 cmp %g1, %g3 200cda8: 38 80 00 44 bgu,a 200ceb8 <_Heap_Free+0x164> <== NEVER TAKEN 200cdac: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cdb0: 80 a1 00 03 cmp %g4, %g3 200cdb4: 2a 80 00 41 bcs,a 200ceb8 <_Heap_Free+0x164> <== NEVER TAKEN 200cdb8: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cdbc: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200cdc0: 80 8b 60 01 btst 1, %o5 200cdc4: 02 80 00 3c be 200ceb4 <_Heap_Free+0x160> <== NEVER TAKEN 200cdc8: 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 )); 200cdcc: 80 a1 00 03 cmp %g4, %g3 200cdd0: 02 80 00 06 be 200cde8 <_Heap_Free+0x94> 200cdd4: 9a 10 20 00 clr %o5 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cdd8: 84 00 c0 0c add %g3, %o4, %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; 200cddc: da 00 a0 04 ld [ %g2 + 4 ], %o5 200cde0: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200cde4: 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 ) ) { 200cde8: 80 8b e0 01 btst 1, %o7 200cdec: 12 80 00 1c bne 200ce5c <_Heap_Free+0x108> 200cdf0: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200cdf4: 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); 200cdf8: 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; 200cdfc: 80 a0 40 0f cmp %g1, %o7 200ce00: 18 80 00 2d bgu 200ceb4 <_Heap_Free+0x160> <== NEVER TAKEN 200ce04: 84 10 20 00 clr %g2 200ce08: 80 a1 00 0f cmp %g4, %o7 200ce0c: 2a 80 00 2b bcs,a 200ceb8 <_Heap_Free+0x164> <== NEVER TAKEN 200ce10: 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; 200ce14: 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) ) { 200ce18: 80 88 60 01 btst 1, %g1 200ce1c: 02 80 00 26 be 200ceb4 <_Heap_Free+0x160> <== NEVER TAKEN 200ce20: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200ce24: 02 80 00 39 be 200cf08 <_Heap_Free+0x1b4> 200ce28: 96 06 40 0b add %i1, %o3, %o3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ce2c: c2 00 e0 08 ld [ %g3 + 8 ], %g1 200ce30: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 } 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; 200ce34: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 200ce38: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200ce3c: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200ce40: 82 00 ff ff add %g3, -1, %g1 200ce44: 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; 200ce48: 98 02 c0 0c add %o3, %o4, %o4 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ce4c: 82 13 20 01 or %o4, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200ce50: d8 23 00 0f st %o4, [ %o4 + %o7 ] 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; 200ce54: 10 80 00 0e b 200ce8c <_Heap_Free+0x138> 200ce58: 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 */ 200ce5c: 22 80 00 19 be,a 200cec0 <_Heap_Free+0x16c> 200ce60: c4 06 20 08 ld [ %i0 + 8 ], %g2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ce64: c4 00 e0 08 ld [ %g3 + 8 ], %g2 200ce68: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200ce6c: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200ce70: c2 27 60 0c st %g1, [ %i5 + 0xc ] 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 */ uintptr_t const size = block_size + next_block_size; 200ce74: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200ce78: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200ce7c: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ce80: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200ce84: d8 23 00 1d st %o4, [ %o4 + %i5 ] 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; 200ce88: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ce8c: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200ce90: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200ce94: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ce98: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200ce9c: 82 00 60 01 inc %g1 stats->free_size += block_size; 200cea0: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cea4: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200cea8: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200ceac: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200ceb0: 84 10 20 01 mov 1, %g2 } 200ceb4: b0 08 a0 01 and %g2, 1, %i0 200ceb8: 81 c7 e0 08 ret 200cebc: 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; 200cec0: 82 16 60 01 or %i1, 1, %g1 200cec4: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cec8: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200cecc: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200ced0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200ced4: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200ced8: 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; 200cedc: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200cee0: f2 26 40 1d st %i1, [ %i1 + %i5 ] } 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; 200cee4: 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 ) { 200cee8: 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; 200ceec: 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; 200cef0: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200cef4: 80 a0 40 02 cmp %g1, %g2 200cef8: 08 bf ff e5 bleu 200ce8c <_Heap_Free+0x138> 200cefc: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200cf00: 10 bf ff e3 b 200ce8c <_Heap_Free+0x138> 200cf04: 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; 200cf08: 82 12 e0 01 or %o3, 1, %g1 200cf0c: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cf10: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200cf14: d6 26 40 1d st %o3, [ %i1 + %i5 ] _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; 200cf18: 82 08 7f fe and %g1, -2, %g1 200cf1c: 10 bf ff dc b 200ce8c <_Heap_Free+0x138> 200cf20: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0200da94 <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200da94: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200da98: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200da9c: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200daa0: 92 10 20 00 clr %o1 200daa4: 90 10 00 19 mov %i1, %o0 200daa8: 40 00 0a 5b call 2010414 200daac: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200dab0: 80 a7 40 1c cmp %i5, %i4 200dab4: 02 80 00 17 be 200db10 <_Heap_Get_information+0x7c> <== NEVER TAKEN 200dab8: 01 00 00 00 nop 200dabc: 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; 200dac0: 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); 200dac4: ba 07 40 02 add %i5, %g2, %i5 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200dac8: c6 07 60 04 ld [ %i5 + 4 ], %g3 while ( the_block != end ) { 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) ) 200dacc: 80 88 e0 01 btst 1, %g3 200dad0: 02 80 00 03 be 200dadc <_Heap_Get_information+0x48> 200dad4: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200dad8: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200dadc: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200dae0: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200dae4: 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++; 200dae8: 9e 03 e0 01 inc %o7 info->total += the_size; 200daec: 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++; 200daf0: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200daf4: 80 a1 00 02 cmp %g4, %g2 200daf8: 1a 80 00 03 bcc 200db04 <_Heap_Get_information+0x70> 200dafc: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200db00: 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 ) { 200db04: 80 a7 00 1d cmp %i4, %i5 200db08: 12 bf ff ef bne 200dac4 <_Heap_Get_information+0x30> 200db0c: 84 08 ff fe and %g3, -2, %g2 200db10: 81 c7 e0 08 ret 200db14: 81 e8 00 00 restore =============================================================================== 02014734 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2014734: 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); 2014738: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 201473c: 7f ff f9 16 call 2012b94 <.urem> 2014740: 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 2014744: 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); 2014748: 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); 201474c: 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; 2014750: 80 a0 80 01 cmp %g2, %g1 2014754: 0a 80 00 16 bcs 20147ac <_Heap_Size_of_alloc_area+0x78> 2014758: 86 10 20 00 clr %g3 201475c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 2014760: 80 a0 80 04 cmp %g2, %g4 2014764: 18 80 00 13 bgu 20147b0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 2014768: 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; 201476c: f0 00 a0 04 ld [ %g2 + 4 ], %i0 2014770: 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); 2014774: 84 06 00 02 add %i0, %g2, %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; 2014778: 80 a0 40 02 cmp %g1, %g2 201477c: 18 80 00 0d bgu 20147b0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 2014780: b0 08 e0 01 and %g3, 1, %i0 2014784: 80 a1 00 02 cmp %g4, %g2 2014788: 0a 80 00 0a bcs 20147b0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201478c: 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; 2014790: 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 ) 2014794: 80 88 60 01 btst 1, %g1 2014798: 02 80 00 06 be 20147b0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201479c: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 20147a0: 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; 20147a4: 84 00 a0 04 add %g2, 4, %g2 20147a8: c4 26 80 00 st %g2, [ %i2 ] return true; } 20147ac: b0 08 e0 01 and %g3, 1, %i0 20147b0: 81 c7 e0 08 ret 20147b4: 81 e8 00 00 restore =============================================================================== 020086fc <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20086fc: 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; 2008700: 3b 00 80 21 sethi %hi(0x2008400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2008704: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 2008708: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 200870c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 2008710: 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; 2008714: 80 a6 a0 00 cmp %i2, 0 2008718: 02 80 00 04 be 2008728 <_Heap_Walk+0x2c> 200871c: ba 17 62 90 or %i5, 0x290, %i5 2008720: 3b 00 80 21 sethi %hi(0x2008400), %i5 2008724: ba 17 62 98 or %i5, 0x298, %i5 ! 2008698 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008728: 03 00 80 64 sethi %hi(0x2019000), %g1 200872c: c4 00 61 8c ld [ %g1 + 0x18c ], %g2 ! 201918c <_System_state_Current> 2008730: 80 a0 a0 03 cmp %g2, 3 2008734: 02 80 00 05 be 2008748 <_Heap_Walk+0x4c> 2008738: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 200873c: b0 08 60 01 and %g1, 1, %i0 2008740: 81 c7 e0 08 ret 2008744: 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)( 2008748: da 06 20 18 ld [ %i0 + 0x18 ], %o5 200874c: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 2008750: c4 06 20 08 ld [ %i0 + 8 ], %g2 2008754: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008758: 90 10 00 19 mov %i1, %o0 200875c: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008760: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2008764: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2008768: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 200876c: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008770: 92 10 20 00 clr %o1 2008774: 96 10 00 10 mov %l0, %o3 2008778: 15 00 80 59 sethi %hi(0x2016400), %o2 200877c: 98 10 00 1b mov %i3, %o4 2008780: 9f c7 40 00 call %i5 2008784: 94 12 a0 f8 or %o2, 0xf8, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008788: 80 a4 20 00 cmp %l0, 0 200878c: 02 80 00 28 be 200882c <_Heap_Walk+0x130> 2008790: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2008794: 12 80 00 2d bne 2008848 <_Heap_Walk+0x14c> 2008798: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200879c: 7f ff e4 cc call 2001acc <.urem> 20087a0: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20087a4: 80 a2 20 00 cmp %o0, 0 20087a8: 12 80 00 30 bne 2008868 <_Heap_Walk+0x16c> 20087ac: 90 07 20 08 add %i4, 8, %o0 20087b0: 7f ff e4 c7 call 2001acc <.urem> 20087b4: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 20087b8: 80 a2 20 00 cmp %o0, 0 20087bc: 32 80 00 33 bne,a 2008888 <_Heap_Walk+0x18c> 20087c0: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 20087c4: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20087c8: 80 8d 20 01 btst 1, %l4 20087cc: 22 80 00 36 be,a 20088a4 <_Heap_Walk+0x1a8> 20087d0: 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; 20087d4: c2 04 60 04 ld [ %l1 + 4 ], %g1 20087d8: 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); 20087dc: 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; 20087e0: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 20087e4: 80 88 a0 01 btst 1, %g2 20087e8: 02 80 00 0a be 2008810 <_Heap_Walk+0x114> 20087ec: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 20087f0: 02 80 00 33 be 20088bc <_Heap_Walk+0x1c0> 20087f4: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 20087f8: 92 10 20 01 mov 1, %o1 20087fc: 15 00 80 59 sethi %hi(0x2016400), %o2 2008800: 9f c7 40 00 call %i5 2008804: 94 12 a2 70 or %o2, 0x270, %o2 ! 2016670 <_Status_Object_name_errors_to_status+0x1f0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008808: 10 bf ff cd b 200873c <_Heap_Walk+0x40> 200880c: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2008810: 90 10 00 19 mov %i1, %o0 2008814: 92 10 20 01 mov 1, %o1 2008818: 15 00 80 59 sethi %hi(0x2016400), %o2 200881c: 9f c7 40 00 call %i5 2008820: 94 12 a2 58 or %o2, 0x258, %o2 ! 2016658 <_Status_Object_name_errors_to_status+0x1d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008824: 10 bf ff c6 b 200873c <_Heap_Walk+0x40> 2008828: 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" ); 200882c: 90 10 00 19 mov %i1, %o0 2008830: 92 10 20 01 mov 1, %o1 2008834: 15 00 80 59 sethi %hi(0x2016400), %o2 2008838: 9f c7 40 00 call %i5 200883c: 94 12 a1 90 or %o2, 0x190, %o2 ! 2016590 <_Status_Object_name_errors_to_status+0x110> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008840: 10 bf ff bf b 200873c <_Heap_Walk+0x40> 2008844: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2008848: 90 10 00 19 mov %i1, %o0 200884c: 92 10 20 01 mov 1, %o1 2008850: 96 10 00 10 mov %l0, %o3 2008854: 15 00 80 59 sethi %hi(0x2016400), %o2 2008858: 9f c7 40 00 call %i5 200885c: 94 12 a1 a8 or %o2, 0x1a8, %o2 ! 20165a8 <_Status_Object_name_errors_to_status+0x128> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008860: 10 bf ff b7 b 200873c <_Heap_Walk+0x40> 2008864: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008868: 90 10 00 19 mov %i1, %o0 200886c: 92 10 20 01 mov 1, %o1 2008870: 96 10 00 1b mov %i3, %o3 2008874: 15 00 80 59 sethi %hi(0x2016400), %o2 2008878: 9f c7 40 00 call %i5 200887c: 94 12 a1 c8 or %o2, 0x1c8, %o2 ! 20165c8 <_Status_Object_name_errors_to_status+0x148> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008880: 10 bf ff af b 200873c <_Heap_Walk+0x40> 2008884: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008888: 92 10 20 01 mov 1, %o1 200888c: 96 10 00 1c mov %i4, %o3 2008890: 15 00 80 59 sethi %hi(0x2016400), %o2 2008894: 9f c7 40 00 call %i5 2008898: 94 12 a1 f0 or %o2, 0x1f0, %o2 ! 20165f0 <_Status_Object_name_errors_to_status+0x170> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200889c: 10 bf ff a8 b 200873c <_Heap_Walk+0x40> 20088a0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 20088a4: 92 10 20 01 mov 1, %o1 20088a8: 15 00 80 59 sethi %hi(0x2016400), %o2 20088ac: 9f c7 40 00 call %i5 20088b0: 94 12 a2 28 or %o2, 0x228, %o2 ! 2016628 <_Status_Object_name_errors_to_status+0x1a8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088b4: 10 bf ff a2 b 200873c <_Heap_Walk+0x40> 20088b8: 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; 20088bc: 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; 20088c0: 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 ) { 20088c4: 80 a6 00 1a cmp %i0, %i2 20088c8: 02 80 00 0d be 20088fc <_Heap_Walk+0x200> 20088cc: 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; 20088d0: 80 a0 40 1a cmp %g1, %i2 20088d4: 28 80 00 bc bleu,a 2008bc4 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 20088d8: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 20088dc: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20088e0: 92 10 20 01 mov 1, %o1 20088e4: 96 10 00 1a mov %i2, %o3 20088e8: 15 00 80 59 sethi %hi(0x2016400), %o2 20088ec: 9f c7 40 00 call %i5 20088f0: 94 12 a2 a0 or %o2, 0x2a0, %o2 ! 20166a0 <_Status_Object_name_errors_to_status+0x220> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088f4: 10 bf ff 92 b 200873c <_Heap_Walk+0x40> 20088f8: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20088fc: 2d 00 80 5a sethi %hi(0x2016800), %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)( 2008900: 2f 00 80 5a sethi %hi(0x2016800), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008904: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008908: ac 15 a0 d0 or %l6, 0xd0, %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)( 200890c: ae 15 e0 b8 or %l7, 0xb8, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008910: 2b 00 80 5a sethi %hi(0x2016800), %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; 2008914: 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); 2008918: 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; 200891c: 80 a0 40 1a cmp %g1, %i2 2008920: 28 80 00 0b bleu,a 200894c <_Heap_Walk+0x250> <== ALWAYS TAKEN 2008924: 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)( 2008928: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200892c: 92 10 20 01 mov 1, %o1 2008930: 96 10 00 12 mov %l2, %o3 2008934: 15 00 80 59 sethi %hi(0x2016400), %o2 2008938: 98 10 00 1a mov %i2, %o4 200893c: 9f c7 40 00 call %i5 2008940: 94 12 a3 48 or %o2, 0x348, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2008944: 10 bf ff 7e b 200873c <_Heap_Walk+0x40> 2008948: 82 10 20 00 clr %g1 200894c: 80 a0 40 1a cmp %g1, %i2 2008950: 0a bf ff f7 bcs 200892c <_Heap_Walk+0x230> 2008954: 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; 2008958: 82 1c 80 11 xor %l2, %l1, %g1 200895c: 80 a0 00 01 cmp %g0, %g1 2008960: 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; 2008964: 90 10 00 13 mov %l3, %o0 2008968: c2 27 bf fc st %g1, [ %fp + -4 ] 200896c: 7f ff e4 58 call 2001acc <.urem> 2008970: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2008974: 80 a2 20 00 cmp %o0, 0 2008978: 02 80 00 05 be 200898c <_Heap_Walk+0x290> 200897c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008980: 80 88 60 ff btst 0xff, %g1 2008984: 12 80 00 76 bne 2008b5c <_Heap_Walk+0x460> 2008988: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200898c: 80 a6 c0 13 cmp %i3, %l3 2008990: 08 80 00 05 bleu 20089a4 <_Heap_Walk+0x2a8> 2008994: 80 a4 80 1a cmp %l2, %i2 2008998: 80 88 60 ff btst 0xff, %g1 200899c: 12 80 00 78 bne 2008b7c <_Heap_Walk+0x480> <== ALWAYS TAKEN 20089a0: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 20089a4: 2a 80 00 06 bcs,a 20089bc <_Heap_Walk+0x2c0> 20089a8: c2 06 a0 04 ld [ %i2 + 4 ], %g1 20089ac: 80 88 60 ff btst 0xff, %g1 20089b0: 12 80 00 7d bne 2008ba4 <_Heap_Walk+0x4a8> 20089b4: 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; 20089b8: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 20089bc: 80 88 60 01 btst 1, %g1 20089c0: 02 80 00 19 be 2008a24 <_Heap_Walk+0x328> 20089c4: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 20089c8: 80 a5 20 00 cmp %l4, 0 20089cc: 22 80 00 0e be,a 2008a04 <_Heap_Walk+0x308> 20089d0: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 20089d4: 90 10 00 19 mov %i1, %o0 20089d8: 92 10 20 00 clr %o1 20089dc: 94 10 00 17 mov %l7, %o2 20089e0: 96 10 00 12 mov %l2, %o3 20089e4: 9f c7 40 00 call %i5 20089e8: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20089ec: 80 a7 00 1a cmp %i4, %i2 20089f0: 02 80 00 42 be 2008af8 <_Heap_Walk+0x3fc> 20089f4: a4 10 00 1a mov %i2, %l2 20089f8: e8 06 a0 04 ld [ %i2 + 4 ], %l4 20089fc: 10 bf ff c6 b 2008914 <_Heap_Walk+0x218> 2008a00: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008a04: 96 10 00 12 mov %l2, %o3 2008a08: 90 10 00 19 mov %i1, %o0 2008a0c: 92 10 20 00 clr %o1 2008a10: 94 10 00 16 mov %l6, %o2 2008a14: 9f c7 40 00 call %i5 2008a18: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008a1c: 10 bf ff f5 b 20089f0 <_Heap_Walk+0x2f4> 2008a20: 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 ? 2008a24: 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)( 2008a28: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008a2c: 05 00 80 59 sethi %hi(0x2016400), %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; 2008a30: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008a34: 80 a0 40 0d cmp %g1, %o5 2008a38: 02 80 00 05 be 2008a4c <_Heap_Walk+0x350> 2008a3c: 86 10 a0 b8 or %g2, 0xb8, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008a40: 80 a6 00 0d cmp %i0, %o5 2008a44: 02 80 00 3c be 2008b34 <_Heap_Walk+0x438> 2008a48: 86 15 60 80 or %l5, 0x80, %g3 block->next, block->next == last_free_block ? 2008a4c: 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)( 2008a50: 1f 00 80 59 sethi %hi(0x2016400), %o7 2008a54: 80 a1 00 01 cmp %g4, %g1 2008a58: 02 80 00 05 be 2008a6c <_Heap_Walk+0x370> 2008a5c: 84 13 e0 d8 or %o7, 0xd8, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008a60: 80 a6 00 01 cmp %i0, %g1 2008a64: 02 80 00 31 be 2008b28 <_Heap_Walk+0x42c> 2008a68: 84 15 60 80 or %l5, 0x80, %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)( 2008a6c: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008a70: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008a74: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008a78: 90 10 00 19 mov %i1, %o0 2008a7c: 92 10 20 00 clr %o1 2008a80: 15 00 80 5a sethi %hi(0x2016800), %o2 2008a84: 96 10 00 12 mov %l2, %o3 2008a88: 94 12 a0 10 or %o2, 0x10, %o2 2008a8c: 9f c7 40 00 call %i5 2008a90: 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 ) { 2008a94: da 06 80 00 ld [ %i2 ], %o5 2008a98: 80 a4 c0 0d cmp %l3, %o5 2008a9c: 12 80 00 19 bne 2008b00 <_Heap_Walk+0x404> 2008aa0: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2008aa4: 02 80 00 27 be 2008b40 <_Heap_Walk+0x444> 2008aa8: 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; 2008aac: 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 ) { 2008ab0: 80 a6 00 01 cmp %i0, %g1 2008ab4: 02 80 00 0b be 2008ae0 <_Heap_Walk+0x3e4> <== NEVER TAKEN 2008ab8: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008abc: 80 a4 80 01 cmp %l2, %g1 2008ac0: 02 bf ff cc be 20089f0 <_Heap_Walk+0x2f4> 2008ac4: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2008ac8: 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 ) { 2008acc: 80 a6 00 01 cmp %i0, %g1 2008ad0: 12 bf ff fc bne 2008ac0 <_Heap_Walk+0x3c4> 2008ad4: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008ad8: 90 10 00 19 mov %i1, %o0 2008adc: 92 10 20 01 mov 1, %o1 2008ae0: 96 10 00 12 mov %l2, %o3 2008ae4: 15 00 80 5a sethi %hi(0x2016800), %o2 2008ae8: 9f c7 40 00 call %i5 2008aec: 94 12 a0 f8 or %o2, 0xf8, %o2 ! 20168f8 <_Status_Object_name_errors_to_status+0x478> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008af0: 10 bf ff 13 b 200873c <_Heap_Walk+0x40> 2008af4: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 2008af8: 10 bf ff 11 b 200873c <_Heap_Walk+0x40> 2008afc: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008b00: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 2008b04: 90 10 00 19 mov %i1, %o0 2008b08: 92 10 20 01 mov 1, %o1 2008b0c: 96 10 00 12 mov %l2, %o3 2008b10: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b14: 98 10 00 13 mov %l3, %o4 2008b18: 9f c7 40 00 call %i5 2008b1c: 94 12 a0 48 or %o2, 0x48, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b20: 10 bf ff 07 b 200873c <_Heap_Walk+0x40> 2008b24: 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)" : "") 2008b28: 05 00 80 59 sethi %hi(0x2016400), %g2 2008b2c: 10 bf ff d0 b 2008a6c <_Heap_Walk+0x370> 2008b30: 84 10 a0 e8 or %g2, 0xe8, %g2 ! 20164e8 <_Status_Object_name_errors_to_status+0x68> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008b34: 07 00 80 59 sethi %hi(0x2016400), %g3 2008b38: 10 bf ff c5 b 2008a4c <_Heap_Walk+0x350> 2008b3c: 86 10 e0 c8 or %g3, 0xc8, %g3 ! 20164c8 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008b40: 92 10 20 01 mov 1, %o1 2008b44: 96 10 00 12 mov %l2, %o3 2008b48: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b4c: 9f c7 40 00 call %i5 2008b50: 94 12 a0 88 or %o2, 0x88, %o2 ! 2016888 <_Status_Object_name_errors_to_status+0x408> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b54: 10 bf fe fa b 200873c <_Heap_Walk+0x40> 2008b58: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008b5c: 92 10 20 01 mov 1, %o1 2008b60: 96 10 00 12 mov %l2, %o3 2008b64: 15 00 80 59 sethi %hi(0x2016400), %o2 2008b68: 98 10 00 13 mov %l3, %o4 2008b6c: 9f c7 40 00 call %i5 2008b70: 94 12 a3 78 or %o2, 0x378, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008b74: 10 bf fe f2 b 200873c <_Heap_Walk+0x40> 2008b78: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008b7c: 90 10 00 19 mov %i1, %o0 2008b80: 92 10 20 01 mov 1, %o1 2008b84: 96 10 00 12 mov %l2, %o3 2008b88: 15 00 80 59 sethi %hi(0x2016400), %o2 2008b8c: 98 10 00 13 mov %l3, %o4 2008b90: 94 12 a3 a8 or %o2, 0x3a8, %o2 2008b94: 9f c7 40 00 call %i5 2008b98: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 2008b9c: 10 bf fe e8 b 200873c <_Heap_Walk+0x40> 2008ba0: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008ba4: 92 10 20 01 mov 1, %o1 2008ba8: 96 10 00 12 mov %l2, %o3 2008bac: 15 00 80 59 sethi %hi(0x2016400), %o2 2008bb0: 98 10 00 1a mov %i2, %o4 2008bb4: 9f c7 40 00 call %i5 2008bb8: 94 12 a3 d8 or %o2, 0x3d8, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008bbc: 10 bf fe e0 b 200873c <_Heap_Walk+0x40> 2008bc0: 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; 2008bc4: 80 a6 80 13 cmp %i2, %l3 2008bc8: 18 bf ff 46 bgu 20088e0 <_Heap_Walk+0x1e4> <== NEVER TAKEN 2008bcc: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008bd0: c2 27 bf fc st %g1, [ %fp + -4 ] 2008bd4: 90 06 a0 08 add %i2, 8, %o0 2008bd8: 7f ff e3 bd call 2001acc <.urem> 2008bdc: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008be0: 80 a2 20 00 cmp %o0, 0 2008be4: 12 80 00 36 bne 2008cbc <_Heap_Walk+0x5c0> <== NEVER TAKEN 2008be8: 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; 2008bec: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008bf0: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008bf4: 84 06 80 02 add %i2, %g2, %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; 2008bf8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008bfc: 80 88 a0 01 btst 1, %g2 2008c00: 12 80 00 27 bne 2008c9c <_Heap_Walk+0x5a0> <== NEVER TAKEN 2008c04: 84 10 00 18 mov %i0, %g2 2008c08: 10 80 00 19 b 2008c6c <_Heap_Walk+0x570> 2008c0c: 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 ) { 2008c10: 80 a6 00 1a cmp %i0, %i2 2008c14: 02 bf ff 3a be 20088fc <_Heap_Walk+0x200> 2008c18: 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; 2008c1c: 0a bf ff 31 bcs 20088e0 <_Heap_Walk+0x1e4> 2008c20: 90 10 00 19 mov %i1, %o0 2008c24: 80 a6 80 13 cmp %i2, %l3 2008c28: 18 bf ff 2f bgu 20088e4 <_Heap_Walk+0x1e8> <== NEVER TAKEN 2008c2c: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008c30: c2 27 bf fc st %g1, [ %fp + -4 ] 2008c34: 90 06 a0 08 add %i2, 8, %o0 2008c38: 7f ff e3 a5 call 2001acc <.urem> 2008c3c: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008c40: 80 a2 20 00 cmp %o0, 0 2008c44: 12 80 00 1e bne 2008cbc <_Heap_Walk+0x5c0> 2008c48: 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; 2008c4c: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c50: 84 10 00 12 mov %l2, %g2 2008c54: 86 08 ff fe and %g3, -2, %g3 block = next_block; } while ( block != first_block ); return true; } 2008c58: 86 06 80 03 add %i2, %g3, %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; 2008c5c: c6 00 e0 04 ld [ %g3 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c60: 80 88 e0 01 btst 1, %g3 2008c64: 12 80 00 0e bne 2008c9c <_Heap_Walk+0x5a0> 2008c68: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2008c6c: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2008c70: 80 a3 00 02 cmp %o4, %g2 2008c74: 22 bf ff e7 be,a 2008c10 <_Heap_Walk+0x514> 2008c78: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2008c7c: 90 10 00 19 mov %i1, %o0 2008c80: 92 10 20 01 mov 1, %o1 2008c84: 96 10 00 1a mov %i2, %o3 2008c88: 15 00 80 59 sethi %hi(0x2016400), %o2 2008c8c: 9f c7 40 00 call %i5 2008c90: 94 12 a3 10 or %o2, 0x310, %o2 ! 2016710 <_Status_Object_name_errors_to_status+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c94: 10 bf fe aa b 200873c <_Heap_Walk+0x40> 2008c98: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008c9c: 90 10 00 19 mov %i1, %o0 2008ca0: 92 10 20 01 mov 1, %o1 2008ca4: 96 10 00 1a mov %i2, %o3 2008ca8: 15 00 80 59 sethi %hi(0x2016400), %o2 2008cac: 9f c7 40 00 call %i5 2008cb0: 94 12 a2 f0 or %o2, 0x2f0, %o2 ! 20166f0 <_Status_Object_name_errors_to_status+0x270> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cb4: 10 bf fe a2 b 200873c <_Heap_Walk+0x40> 2008cb8: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008cbc: 90 10 00 19 mov %i1, %o0 2008cc0: 92 10 20 01 mov 1, %o1 2008cc4: 96 10 00 1a mov %i2, %o3 2008cc8: 15 00 80 59 sethi %hi(0x2016400), %o2 2008ccc: 9f c7 40 00 call %i5 2008cd0: 94 12 a2 c0 or %o2, 0x2c0, %o2 ! 20166c0 <_Status_Object_name_errors_to_status+0x240> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cd4: 10 bf fe 9a b 200873c <_Heap_Walk+0x40> 2008cd8: 82 10 20 00 clr %g1 =============================================================================== 02006b78 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2006b78: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2006b7c: 39 00 80 5c sethi %hi(0x2017000), %i4 2006b80: c2 07 21 d4 ld [ %i4 + 0x1d4 ], %g1 ! 20171d4 <_IO_Number_of_drivers> 2006b84: 80 a0 60 00 cmp %g1, 0 2006b88: 02 80 00 0c be 2006bb8 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2006b8c: ba 10 20 00 clr %i5 2006b90: b8 17 21 d4 or %i4, 0x1d4, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2006b94: 90 10 00 1d mov %i5, %o0 2006b98: 92 10 20 00 clr %o1 2006b9c: 40 00 17 3e call 200c894 2006ba0: 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 ++ ) 2006ba4: c2 07 00 00 ld [ %i4 ], %g1 2006ba8: ba 07 60 01 inc %i5 2006bac: 80 a0 40 1d cmp %g1, %i5 2006bb0: 18 bf ff fa bgu 2006b98 <_IO_Initialize_all_drivers+0x20> 2006bb4: 90 10 00 1d mov %i5, %o0 2006bb8: 81 c7 e0 08 ret 2006bbc: 81 e8 00 00 restore =============================================================================== 02006aac <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2006aac: 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; 2006ab0: 03 00 80 56 sethi %hi(0x2015800), %g1 2006ab4: 82 10 63 2c or %g1, 0x32c, %g1 ! 2015b2c drivers_in_table = Configuration.number_of_device_drivers; 2006ab8: f8 00 60 30 ld [ %g1 + 0x30 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2006abc: f2 00 60 2c ld [ %g1 + 0x2c ], %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 ) 2006ac0: 80 a7 00 19 cmp %i4, %i1 2006ac4: 0a 80 00 08 bcs 2006ae4 <_IO_Manager_initialization+0x38> 2006ac8: fa 00 60 34 ld [ %g1 + 0x34 ], %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; 2006acc: 03 00 80 5c sethi %hi(0x2017000), %g1 2006ad0: fa 20 61 d8 st %i5, [ %g1 + 0x1d8 ] ! 20171d8 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2006ad4: 03 00 80 5c sethi %hi(0x2017000), %g1 2006ad8: f8 20 61 d4 st %i4, [ %g1 + 0x1d4 ] ! 20171d4 <_IO_Number_of_drivers> return; 2006adc: 81 c7 e0 08 ret 2006ae0: 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 ) 2006ae4: 83 2e 60 03 sll %i1, 3, %g1 2006ae8: b5 2e 60 05 sll %i1, 5, %i2 2006aec: 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( 2006af0: 40 00 0d 5d call 200a064 <_Workspace_Allocate_or_fatal_error> 2006af4: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2006af8: 03 00 80 5c sethi %hi(0x2017000), %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 *) 2006afc: 37 00 80 5c sethi %hi(0x2017000), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2006b00: f2 20 61 d4 st %i1, [ %g1 + 0x1d4 ] /* * 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 *) 2006b04: d0 26 e1 d8 st %o0, [ %i3 + 0x1d8 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2006b08: 92 10 20 00 clr %o1 2006b0c: 40 00 23 f9 call 200faf0 2006b10: 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++ ) 2006b14: 80 a7 20 00 cmp %i4, 0 2006b18: 02 bf ff f1 be 2006adc <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2006b1c: f6 06 e1 d8 ld [ %i3 + 0x1d8 ], %i3 2006b20: 82 10 20 00 clr %g1 2006b24: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 2006b28: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2006b2c: 86 07 40 01 add %i5, %g1, %g3 2006b30: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 2006b34: f4 00 e0 04 ld [ %g3 + 4 ], %i2 2006b38: 84 06 c0 01 add %i3, %g1, %g2 2006b3c: f4 20 a0 04 st %i2, [ %g2 + 4 ] 2006b40: 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++ ) 2006b44: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 2006b48: f4 20 a0 08 st %i2, [ %g2 + 8 ] 2006b4c: 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++ ) 2006b50: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 2006b54: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 2006b58: 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++ ) 2006b5c: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 2006b60: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 2006b64: 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++ ) 2006b68: 12 bf ff f0 bne 2006b28 <_IO_Manager_initialization+0x7c> 2006b6c: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2006b70: 81 c7 e0 08 ret 2006b74: 81 e8 00 00 restore =============================================================================== 020078d4 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20078d4: 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 ) 20078d8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20078dc: 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 ) 20078e0: 80 a0 60 00 cmp %g1, 0 20078e4: 02 80 00 19 be 2007948 <_Objects_Allocate+0x74> <== NEVER TAKEN 20078e8: 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 ); 20078ec: b8 07 60 20 add %i5, 0x20, %i4 20078f0: 7f ff fd 64 call 2006e80 <_Chain_Get> 20078f4: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 20078f8: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 20078fc: 80 a0 60 00 cmp %g1, 0 2007900: 02 80 00 12 be 2007948 <_Objects_Allocate+0x74> 2007904: 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 ) { 2007908: 80 a2 20 00 cmp %o0, 0 200790c: 02 80 00 11 be 2007950 <_Objects_Allocate+0x7c> 2007910: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007914: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007918: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 200791c: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007920: 40 00 2b f1 call 20128e4 <.udiv> 2007924: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007928: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200792c: 91 2a 20 02 sll %o0, 2, %o0 2007930: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007934: 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 ]--; 2007938: 86 00 ff ff add %g3, -1, %g3 200793c: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007940: 82 00 bf ff add %g2, -1, %g1 2007944: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007948: 81 c7 e0 08 ret 200794c: 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 ); 2007950: 40 00 00 10 call 2007990 <_Objects_Extend_information> 2007954: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007958: 7f ff fd 4a call 2006e80 <_Chain_Get> 200795c: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007960: b0 92 20 00 orcc %o0, 0, %i0 2007964: 32 bf ff ed bne,a 2007918 <_Objects_Allocate+0x44> 2007968: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 200796c: 81 c7 e0 08 ret 2007970: 81 e8 00 00 restore =============================================================================== 02007990 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007990: 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 ) 2007994: 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 ); 2007998: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 200799c: 80 a4 20 00 cmp %l0, 0 20079a0: 02 80 00 a6 be 2007c38 <_Objects_Extend_information+0x2a8> 20079a4: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 20079a8: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 20079ac: b3 2e 60 10 sll %i1, 0x10, %i1 20079b0: 92 10 00 1a mov %i2, %o1 20079b4: 40 00 2b cc call 20128e4 <.udiv> 20079b8: 91 36 60 10 srl %i1, 0x10, %o0 20079bc: a7 2a 20 10 sll %o0, 0x10, %l3 20079c0: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 20079c4: 80 a4 e0 00 cmp %l3, 0 20079c8: 02 80 00 a3 be 2007c54 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 20079cc: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 20079d0: 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 ); 20079d4: 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 ) { 20079d8: 80 a0 60 00 cmp %g1, 0 20079dc: 12 80 00 08 bne 20079fc <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 20079e0: b6 10 20 00 clr %i3 do_extend = false; 20079e4: 10 80 00 a0 b 2007c64 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 20079e8: 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 ) { 20079ec: c2 04 00 01 ld [ %l0 + %g1 ], %g1 20079f0: 80 a0 60 00 cmp %g1, 0 20079f4: 22 80 00 08 be,a 2007a14 <_Objects_Extend_information+0x84> 20079f8: 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++ ) { 20079fc: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007a00: 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++ ) { 2007a04: 80 a4 c0 1b cmp %l3, %i3 2007a08: 18 bf ff f9 bgu 20079ec <_Objects_Extend_information+0x5c> 2007a0c: 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; 2007a10: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007a14: 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 ) { 2007a18: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007a1c: 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 ) { 2007a20: 82 10 63 ff or %g1, 0x3ff, %g1 2007a24: 80 a6 40 01 cmp %i1, %g1 2007a28: 18 80 00 93 bgu 2007c74 <_Objects_Extend_information+0x2e4> 2007a2c: 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; 2007a30: 40 00 2b 73 call 20127fc <.umul> 2007a34: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007a38: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007a3c: 80 a0 60 00 cmp %g1, 0 2007a40: 02 80 00 6a be 2007be8 <_Objects_Extend_information+0x258> 2007a44: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007a48: 40 00 09 79 call 200a02c <_Workspace_Allocate> 2007a4c: 01 00 00 00 nop if ( !new_object_block ) 2007a50: a0 92 20 00 orcc %o0, 0, %l0 2007a54: 02 80 00 88 be 2007c74 <_Objects_Extend_information+0x2e4> 2007a58: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2007a5c: 80 8e a0 ff btst 0xff, %i2 2007a60: 22 80 00 3f be,a 2007b5c <_Objects_Extend_information+0x1cc> 2007a64: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007a68: 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 *)) + 2007a6c: 91 2e a0 01 sll %i2, 1, %o0 2007a70: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2007a74: 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 *)) + 2007a78: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007a7c: 40 00 09 6c call 200a02c <_Workspace_Allocate> 2007a80: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2007a84: a2 92 20 00 orcc %o0, 0, %l1 2007a88: 02 80 00 79 be 2007c6c <_Objects_Extend_information+0x2dc> 2007a8c: 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 ) { 2007a90: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007a94: 80 a7 00 01 cmp %i4, %g1 2007a98: a4 04 40 1a add %l1, %i2, %l2 2007a9c: 0a 80 00 57 bcs 2007bf8 <_Objects_Extend_information+0x268> 2007aa0: 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++ ) { 2007aa4: 80 a7 20 00 cmp %i4, 0 2007aa8: 02 80 00 07 be 2007ac4 <_Objects_Extend_information+0x134><== NEVER TAKEN 2007aac: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007ab0: 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++ ) { 2007ab4: 82 00 60 01 inc %g1 2007ab8: 80 a7 00 01 cmp %i4, %g1 2007abc: 18 bf ff fd bgu 2007ab0 <_Objects_Extend_information+0x120><== NEVER TAKEN 2007ac0: c0 20 80 1a clr [ %g2 + %i2 ] 2007ac4: 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 ); 2007ac8: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2007acc: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007ad0: 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 ; 2007ad4: 80 a7 40 03 cmp %i5, %g3 2007ad8: 1a 80 00 0a bcc 2007b00 <_Objects_Extend_information+0x170><== NEVER TAKEN 2007adc: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007ae0: 83 2f 60 02 sll %i5, 2, %g1 2007ae4: 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 ; 2007ae8: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2007aec: 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++ ) { 2007af0: 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 ; 2007af4: 80 a0 c0 02 cmp %g3, %g2 2007af8: 18 bf ff fd bgu 2007aec <_Objects_Extend_information+0x15c> 2007afc: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2007b00: 7f ff e9 14 call 2001f50 2007b04: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2007b08: 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( 2007b0c: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2007b10: 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; 2007b14: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2007b18: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007b1c: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2007b20: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2007b24: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2007b28: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007b2c: 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) | 2007b30: 03 00 00 40 sethi %hi(0x10000), %g1 2007b34: b3 36 60 10 srl %i1, 0x10, %i1 2007b38: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007b3c: 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) | 2007b40: 82 10 40 19 or %g1, %i1, %g1 2007b44: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2007b48: 7f ff e9 06 call 2001f60 2007b4c: 01 00 00 00 nop _Workspace_Free( old_tables ); 2007b50: 40 00 09 3f call 200a04c <_Workspace_Free> 2007b54: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007b58: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2007b5c: b7 2e e0 02 sll %i3, 2, %i3 2007b60: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007b64: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2007b68: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2007b6c: d2 00 40 1b ld [ %g1 + %i3 ], %o1 2007b70: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2007b74: 90 07 bf f4 add %fp, -12, %o0 2007b78: 40 00 13 5f call 200c8f4 <_Chain_Initialize> 2007b7c: 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 ) { 2007b80: 10 80 00 0d b 2007bb4 <_Objects_Extend_information+0x224> 2007b84: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 2007b88: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2007b8c: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007b90: 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) | 2007b94: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007b98: 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) | 2007b9c: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007ba0: 90 10 00 1a mov %i2, %o0 2007ba4: 92 10 00 01 mov %g1, %o1 index++; 2007ba8: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007bac: 7f ff fc a1 call 2006e30 <_Chain_Append> 2007bb0: 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 ) { 2007bb4: 7f ff fc b3 call 2006e80 <_Chain_Get> 2007bb8: 90 07 bf f4 add %fp, -12, %o0 2007bbc: 82 92 20 00 orcc %o0, 0, %g1 2007bc0: 32 bf ff f2 bne,a 2007b88 <_Objects_Extend_information+0x1f8> 2007bc4: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007bc8: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2007bcc: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2007bd0: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007bd4: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2007bd8: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2007bdc: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2007be0: 81 c7 e0 08 ret 2007be4: 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 ); 2007be8: 40 00 09 1f call 200a064 <_Workspace_Allocate_or_fatal_error> 2007bec: 01 00 00 00 nop 2007bf0: 10 bf ff 9b b 2007a5c <_Objects_Extend_information+0xcc> 2007bf4: 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, 2007bf8: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2007bfc: 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, 2007c00: 40 00 1f 80 call 200fa00 2007c04: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2007c08: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2007c0c: 94 10 00 13 mov %l3, %o2 2007c10: 40 00 1f 7c call 200fa00 2007c14: 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 *) ); 2007c18: 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, 2007c1c: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2007c20: 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, 2007c24: 90 10 00 1a mov %i2, %o0 2007c28: 40 00 1f 76 call 200fa00 2007c2c: 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 ); 2007c30: 10 bf ff a7 b 2007acc <_Objects_Extend_information+0x13c> 2007c34: 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 ) 2007c38: 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 ); 2007c3c: 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; 2007c40: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2007c44: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2007c48: a6 10 20 00 clr %l3 2007c4c: 10 bf ff 72 b 2007a14 <_Objects_Extend_information+0x84> 2007c50: 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 ); 2007c54: 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; 2007c58: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2007c5c: 10 bf ff 6e b 2007a14 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2007c60: b6 10 20 00 clr %i3 <== NOT EXECUTED 2007c64: 10 bf ff 6c b 2007a14 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2007c68: 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 ); 2007c6c: 40 00 08 f8 call 200a04c <_Workspace_Free> 2007c70: 90 10 00 10 mov %l0, %o0 return; 2007c74: 81 c7 e0 08 ret 2007c78: 81 e8 00 00 restore =============================================================================== 02007d20 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2007d20: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007d24: 80 a6 60 00 cmp %i1, 0 2007d28: 02 80 00 17 be 2007d84 <_Objects_Get_information+0x64> 2007d2c: 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 ); 2007d30: 40 00 14 7d call 200cf24 <_Objects_API_maximum_class> 2007d34: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007d38: 80 a2 20 00 cmp %o0, 0 2007d3c: 02 80 00 12 be 2007d84 <_Objects_Get_information+0x64> 2007d40: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2007d44: 0a 80 00 10 bcs 2007d84 <_Objects_Get_information+0x64> 2007d48: 03 00 80 59 sethi %hi(0x2016400), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007d4c: b1 2e 20 02 sll %i0, 2, %i0 2007d50: 82 10 63 c8 or %g1, 0x3c8, %g1 2007d54: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2007d58: 80 a0 60 00 cmp %g1, 0 2007d5c: 02 80 00 0a be 2007d84 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d60: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007d64: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2007d68: 80 a7 60 00 cmp %i5, 0 2007d6c: 02 80 00 06 be 2007d84 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d70: 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 ) 2007d74: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2007d78: 80 a0 00 01 cmp %g0, %g1 2007d7c: 82 60 20 00 subx %g0, 0, %g1 2007d80: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2007d84: 81 c7 e0 08 ret 2007d88: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02009ab0 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009ab0: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009ab4: 80 a6 60 00 cmp %i1, 0 2009ab8: 02 80 00 41 be 2009bbc <_Objects_Get_name_as_string+0x10c> 2009abc: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2009ac0: 02 80 00 3a be 2009ba8 <_Objects_Get_name_as_string+0xf8> 2009ac4: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009ac8: 02 80 00 3a be 2009bb0 <_Objects_Get_name_as_string+0x100> 2009acc: 03 00 80 81 sethi %hi(0x2020400), %g1 information = _Objects_Get_information_id( tmpId ); 2009ad0: 7f ff ff ba call 20099b8 <_Objects_Get_information_id> 2009ad4: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009ad8: ba 92 20 00 orcc %o0, 0, %i5 2009adc: 02 80 00 38 be 2009bbc <_Objects_Get_name_as_string+0x10c> 2009ae0: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009ae4: 40 00 00 3f call 2009be0 <_Objects_Get> 2009ae8: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009aec: c2 07 bf fc ld [ %fp + -4 ], %g1 2009af0: 80 a0 60 00 cmp %g1, 0 2009af4: 32 80 00 33 bne,a 2009bc0 <_Objects_Get_name_as_string+0x110> 2009af8: b4 10 20 00 clr %i2 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 2009afc: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1 2009b00: 80 a0 60 00 cmp %g1, 0 2009b04: 32 80 00 31 bne,a 2009bc8 <_Objects_Get_name_as_string+0x118> 2009b08: 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; 2009b0c: 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'; 2009b10: 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; 2009b14: 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; 2009b18: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b1c: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009b20: 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; 2009b24: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b28: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 2009b2c: c2 2f bf f3 stb %g1, [ %fp + -13 ] lname[ 4 ] = '\0'; s = lname; 2009b30: 84 07 bf f0 add %fp, -16, %g2 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b34: b2 86 7f ff addcc %i1, -1, %i1 2009b38: 02 80 00 1a be 2009ba0 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 2009b3c: 82 10 00 1a mov %i2, %g1 2009b40: c8 48 80 00 ldsb [ %g2 ], %g4 2009b44: 80 a1 20 00 cmp %g4, 0 2009b48: 02 80 00 16 be 2009ba0 <_Objects_Get_name_as_string+0xf0> 2009b4c: c6 08 80 00 ldub [ %g2 ], %g3 2009b50: 31 00 80 7d sethi %hi(0x201f400), %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( 2009b54: b2 06 80 19 add %i2, %i1, %i1 2009b58: 10 80 00 05 b 2009b6c <_Objects_Get_name_as_string+0xbc> 2009b5c: b0 16 20 54 or %i0, 0x54, %i0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b60: 80 a1 20 00 cmp %g4, 0 2009b64: 02 80 00 0f be 2009ba0 <_Objects_Get_name_as_string+0xf0> 2009b68: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009b6c: fa 06 00 00 ld [ %i0 ], %i5 2009b70: 88 08 e0 ff and %g3, 0xff, %g4 2009b74: 88 07 40 04 add %i5, %g4, %g4 2009b78: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2009b7c: 80 89 20 97 btst 0x97, %g4 2009b80: 12 80 00 03 bne 2009b8c <_Objects_Get_name_as_string+0xdc> 2009b84: 84 00 a0 01 inc %g2 2009b88: 86 10 20 2a mov 0x2a, %g3 2009b8c: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b90: 82 00 60 01 inc %g1 2009b94: 80 a0 40 19 cmp %g1, %i1 2009b98: 32 bf ff f2 bne,a 2009b60 <_Objects_Get_name_as_string+0xb0> 2009b9c: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009ba0: 40 00 03 a5 call 200aa34 <_Thread_Enable_dispatch> 2009ba4: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 2009ba8: 81 c7 e0 08 ret 2009bac: 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; 2009bb0: c2 00 63 44 ld [ %g1 + 0x344 ], %g1 2009bb4: 10 bf ff c7 b 2009ad0 <_Objects_Get_name_as_string+0x20> 2009bb8: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009bbc: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009bc0: 81 c7 e0 08 ret 2009bc4: 91 e8 00 1a restore %g0, %i2, %o0 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 2009bc8: 80 a0 a0 00 cmp %g2, 0 2009bcc: 12 bf ff da bne 2009b34 <_Objects_Get_name_as_string+0x84> 2009bd0: 82 10 00 1a mov %i2, %g1 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009bd4: 40 00 03 98 call 200aa34 <_Thread_Enable_dispatch> 2009bd8: c0 28 40 00 clrb [ %g1 ] 2009bdc: 30 bf ff f3 b,a 2009ba8 <_Objects_Get_name_as_string+0xf8> =============================================================================== 02007f9c <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2007f9c: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2007fa0: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2007fa4: 80 a6 20 00 cmp %i0, 0 2007fa8: 02 80 00 19 be 200800c <_Objects_Get_next+0x70> 2007fac: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2007fb0: 80 a6 a0 00 cmp %i2, 0 2007fb4: 02 80 00 16 be 200800c <_Objects_Get_next+0x70> 2007fb8: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2007fbc: 02 80 00 14 be 200800c <_Objects_Get_next+0x70> 2007fc0: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2007fc4: 80 a0 60 00 cmp %g1, 0 2007fc8: 22 80 00 13 be,a 2008014 <_Objects_Get_next+0x78> 2007fcc: 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) 2007fd0: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2007fd4: 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); 2007fd8: 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) 2007fdc: 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); 2007fe0: 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) 2007fe4: 80 a0 80 01 cmp %g2, %g1 2007fe8: 0a 80 00 13 bcs 2008034 <_Objects_Get_next+0x98> 2007fec: 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); 2007ff0: 40 00 00 18 call 2008050 <_Objects_Get> 2007ff4: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2007ff8: c2 06 80 00 ld [ %i2 ], %g1 2007ffc: 80 a0 60 00 cmp %g1, 0 2008000: 32 bf ff f5 bne,a 2007fd4 <_Objects_Get_next+0x38> 2008004: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2008008: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 200800c: 81 c7 e0 08 ret 2008010: 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) 2008014: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008018: 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); 200801c: 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) 2008020: 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); 2008024: 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) 2008028: 80 a0 80 01 cmp %g2, %g1 200802c: 1a bf ff f1 bcc 2007ff0 <_Objects_Get_next+0x54> <== ALWAYS TAKEN 2008030: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2008034: 82 10 20 01 mov 1, %g1 2008038: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 200803c: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2008040: 82 10 3f ff mov -1, %g1 2008044: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2008048: 81 c7 e0 08 ret 200804c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020095b0 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 20095b0: 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; 20095b4: 80 a6 20 00 cmp %i0, 0 20095b8: 12 80 00 06 bne 20095d0 <_Objects_Id_to_name+0x20> 20095bc: 83 36 20 18 srl %i0, 0x18, %g1 20095c0: 03 00 80 7d sethi %hi(0x201f400), %g1 20095c4: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 ! 201f414 <_Per_CPU_Information+0xc> 20095c8: f0 00 60 08 ld [ %g1 + 8 ], %i0 20095cc: 83 36 20 18 srl %i0, 0x18, %g1 20095d0: 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 ) 20095d4: 84 00 7f ff add %g1, -1, %g2 20095d8: 80 a0 a0 02 cmp %g2, 2 20095dc: 18 80 00 12 bgu 2009624 <_Objects_Id_to_name+0x74> 20095e0: 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 ] ) 20095e4: 83 28 60 02 sll %g1, 2, %g1 20095e8: 05 00 80 7b sethi %hi(0x201ec00), %g2 20095ec: 84 10 a2 38 or %g2, 0x238, %g2 ! 201ee38 <_Objects_Information_table> 20095f0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 20095f4: 80 a0 60 00 cmp %g1, 0 20095f8: 02 80 00 0b be 2009624 <_Objects_Id_to_name+0x74> 20095fc: 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 ]; 2009600: 85 28 a0 02 sll %g2, 2, %g2 2009604: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2009608: 80 a2 20 00 cmp %o0, 0 200960c: 02 80 00 06 be 2009624 <_Objects_Id_to_name+0x74> <== NEVER TAKEN 2009610: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2009614: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2009618: 80 a0 60 00 cmp %g1, 0 200961c: 02 80 00 04 be 200962c <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN 2009620: 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; } 2009624: 81 c7 e0 08 ret 2009628: 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 ); 200962c: 7f ff ff c4 call 200953c <_Objects_Get> 2009630: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2009634: 80 a2 20 00 cmp %o0, 0 2009638: 02 bf ff fb be 2009624 <_Objects_Id_to_name+0x74> 200963c: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2009640: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009644: 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(); 2009648: 40 00 03 a7 call 200a4e4 <_Thread_Enable_dispatch> 200964c: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009650: 30 bf ff f5 b,a 2009624 <_Objects_Id_to_name+0x74> =============================================================================== 02008058 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2008058: 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 ); 200805c: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 2008060: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2008064: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2008068: 92 10 00 1c mov %i4, %o1 200806c: 40 00 2a 1e call 20128e4 <.udiv> 2008070: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2008074: 80 a2 20 00 cmp %o0, 0 2008078: 02 80 00 34 be 2008148 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 200807c: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2008080: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2008084: c2 01 00 00 ld [ %g4 ], %g1 2008088: 80 a7 00 01 cmp %i4, %g1 200808c: 02 80 00 0f be 20080c8 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2008090: 82 10 20 00 clr %g1 2008094: 10 80 00 07 b 20080b0 <_Objects_Shrink_information+0x58> 2008098: b6 10 20 04 mov 4, %i3 200809c: 86 06 e0 04 add %i3, 4, %g3 20080a0: 80 a7 00 02 cmp %i4, %g2 20080a4: 02 80 00 0a be 20080cc <_Objects_Shrink_information+0x74> 20080a8: ba 07 40 1c add %i5, %i4, %i5 20080ac: 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++ ) { 20080b0: 82 00 60 01 inc %g1 20080b4: 80 a0 40 08 cmp %g1, %o0 20080b8: 32 bf ff f9 bne,a 200809c <_Objects_Shrink_information+0x44> 20080bc: c4 01 00 1b ld [ %g4 + %i3 ], %g2 20080c0: 81 c7 e0 08 ret 20080c4: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 20080c8: 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; 20080cc: 10 80 00 06 b 20080e4 <_Objects_Shrink_information+0x8c> 20080d0: 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 ); 20080d4: 80 a7 20 00 cmp %i4, 0 20080d8: 22 80 00 12 be,a 2008120 <_Objects_Shrink_information+0xc8> 20080dc: 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; 20080e0: 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 ); 20080e4: 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) && 20080e8: 80 a0 40 1d cmp %g1, %i5 20080ec: 0a bf ff fa bcs 20080d4 <_Objects_Shrink_information+0x7c> 20080f0: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 20080f4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20080f8: 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) && 20080fc: 80 a0 40 02 cmp %g1, %g2 2008100: 1a bf ff f6 bcc 20080d8 <_Objects_Shrink_information+0x80> 2008104: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 2008108: 7f ff fb 55 call 2006e5c <_Chain_Extract> 200810c: 01 00 00 00 nop } } while ( the_object ); 2008110: 80 a7 20 00 cmp %i4, 0 2008114: 12 bf ff f4 bne 20080e4 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 2008118: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 200811c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2008120: 40 00 07 cb call 200a04c <_Workspace_Free> 2008124: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 2008128: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 200812c: 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; 2008130: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 2008134: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 2008138: 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; 200813c: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 2008140: 82 20 80 01 sub %g2, %g1, %g1 2008144: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2008148: 81 c7 e0 08 ret 200814c: 81 e8 00 00 restore =============================================================================== 0200b4b0 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b4b0: 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( 200b4b4: 11 00 80 9e sethi %hi(0x2027800), %o0 200b4b8: 92 10 00 18 mov %i0, %o1 200b4bc: 90 12 20 8c or %o0, 0x8c, %o0 200b4c0: 40 00 0d 0d call 200e8f4 <_Objects_Get> 200b4c4: 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 ) { 200b4c8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b4cc: 80 a0 60 00 cmp %g1, 0 200b4d0: 22 80 00 08 be,a 200b4f0 <_POSIX_Message_queue_Receive_support+0x40> 200b4d4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b4d8: 40 00 2c 4f call 2016614 <__errno> 200b4dc: b0 10 3f ff mov -1, %i0 200b4e0: 82 10 20 09 mov 9, %g1 200b4e4: c2 22 00 00 st %g1, [ %o0 ] } 200b4e8: 81 c7 e0 08 ret 200b4ec: 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 ) { 200b4f0: 84 08 60 03 and %g1, 3, %g2 200b4f4: 80 a0 a0 01 cmp %g2, 1 200b4f8: 02 80 00 37 be 200b5d4 <_POSIX_Message_queue_Receive_support+0x124> 200b4fc: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200b500: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b504: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b508: 80 a0 80 1a cmp %g2, %i2 200b50c: 18 80 00 21 bgu 200b590 <_POSIX_Message_queue_Receive_support+0xe0> 200b510: 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; 200b514: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b518: 80 a7 20 00 cmp %i4, 0 200b51c: 12 80 00 18 bne 200b57c <_POSIX_Message_queue_Receive_support+0xcc><== ALWAYS TAKEN 200b520: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b524: 9a 10 00 1d mov %i5, %o5 200b528: 90 02 20 1c add %o0, 0x1c, %o0 200b52c: 92 10 00 18 mov %i0, %o1 200b530: 94 10 00 19 mov %i1, %o2 200b534: 96 07 bf fc add %fp, -4, %o3 200b538: 40 00 08 8b call 200d764 <_CORE_message_queue_Seize> 200b53c: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b540: 40 00 10 a1 call 200f7c4 <_Thread_Enable_dispatch> 200b544: 3b 00 80 9e sethi %hi(0x2027800), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b548: ba 17 60 f8 or %i5, 0xf8, %i5 ! 20278f8 <_Per_CPU_Information> 200b54c: 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); 200b550: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 if ( !_Thread_Executing->Wait.return_code ) 200b554: c6 00 60 34 ld [ %g1 + 0x34 ], %g3 200b558: 83 38 a0 1f sra %g2, 0x1f, %g1 200b55c: 84 18 40 02 xor %g1, %g2, %g2 200b560: 82 20 80 01 sub %g2, %g1, %g1 200b564: 80 a0 e0 00 cmp %g3, 0 200b568: 12 80 00 12 bne 200b5b0 <_POSIX_Message_queue_Receive_support+0x100> 200b56c: c2 26 c0 00 st %g1, [ %i3 ] return length_out; 200b570: f0 07 bf fc ld [ %fp + -4 ], %i0 200b574: 81 c7 e0 08 ret 200b578: 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; 200b57c: 05 00 00 10 sethi %hi(0x4000), %g2 200b580: 82 08 40 02 and %g1, %g2, %g1 200b584: 80 a0 00 01 cmp %g0, %g1 200b588: 10 bf ff e7 b 200b524 <_POSIX_Message_queue_Receive_support+0x74> 200b58c: 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(); 200b590: 40 00 10 8d call 200f7c4 <_Thread_Enable_dispatch> 200b594: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b598: 40 00 2c 1f call 2016614 <__errno> 200b59c: 01 00 00 00 nop 200b5a0: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b5a4: c2 22 00 00 st %g1, [ %o0 ] 200b5a8: 81 c7 e0 08 ret 200b5ac: 81 e8 00 00 restore _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200b5b0: 40 00 2c 19 call 2016614 <__errno> 200b5b4: b0 10 3f ff mov -1, %i0 200b5b8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b5bc: b6 10 00 08 mov %o0, %i3 200b5c0: 40 00 00 a3 call 200b84c <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b5c4: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b5c8: d0 26 c0 00 st %o0, [ %i3 ] 200b5cc: 81 c7 e0 08 ret 200b5d0: 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(); 200b5d4: 40 00 10 7c call 200f7c4 <_Thread_Enable_dispatch> 200b5d8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200b5dc: 40 00 2c 0e call 2016614 <__errno> 200b5e0: 01 00 00 00 nop 200b5e4: 82 10 20 09 mov 9, %g1 ! 9 200b5e8: c2 22 00 00 st %g1, [ %o0 ] 200b5ec: 81 c7 e0 08 ret 200b5f0: 81 e8 00 00 restore =============================================================================== 0200bf84 <_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 ]; 200bf84: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200bf88: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200bf8c: 80 a0 a0 00 cmp %g2, 0 200bf90: 12 80 00 06 bne 200bfa8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200bf94: 01 00 00 00 nop 200bf98: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200bf9c: 80 a0 a0 01 cmp %g2, 1 200bfa0: 22 80 00 05 be,a 200bfb4 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200bfa4: 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(); 200bfa8: 82 13 c0 00 mov %o7, %g1 200bfac: 7f ff f4 33 call 2009078 <_Thread_Enable_dispatch> 200bfb0: 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 && 200bfb4: 80 a0 60 00 cmp %g1, 0 200bfb8: 02 bf ff fc be 200bfa8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200bfbc: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 200bfc0: 03 00 80 5f sethi %hi(0x2017c00), %g1 200bfc4: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 2017d30 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200bfc8: 92 10 3f ff mov -1, %o1 200bfcc: 84 00 bf ff add %g2, -1, %g2 200bfd0: c4 20 61 30 st %g2, [ %g1 + 0x130 ] 200bfd4: 82 13 c0 00 mov %o7, %g1 200bfd8: 40 00 01 d7 call 200c734 <_POSIX_Thread_Exit> 200bfdc: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200d3e8 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200d3e8: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200d3ec: d0 06 40 00 ld [ %i1 ], %o0 200d3f0: 7f ff ff f1 call 200d3b4 <_POSIX_Priority_Is_valid> 200d3f4: ba 10 00 18 mov %i0, %i5 200d3f8: 80 8a 20 ff btst 0xff, %o0 200d3fc: 02 80 00 34 be 200d4cc <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN 200d400: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200d404: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; 200d408: c0 26 c0 00 clr [ %i3 ] if ( policy == SCHED_OTHER ) { 200d40c: 80 a7 60 00 cmp %i5, 0 200d410: 02 80 00 2d be 200d4c4 <_POSIX_Thread_Translate_sched_param+0xdc> 200d414: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200d418: 80 a7 60 01 cmp %i5, 1 200d41c: 02 80 00 2c be 200d4cc <_POSIX_Thread_Translate_sched_param+0xe4> 200d420: 80 a7 60 02 cmp %i5, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200d424: 02 80 00 2c be 200d4d4 <_POSIX_Thread_Translate_sched_param+0xec> 200d428: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200d42c: 12 80 00 28 bne 200d4cc <_POSIX_Thread_Translate_sched_param+0xe4> 200d430: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200d434: c2 06 60 08 ld [ %i1 + 8 ], %g1 200d438: 80 a0 60 00 cmp %g1, 0 200d43c: 32 80 00 07 bne,a 200d458 <_POSIX_Thread_Translate_sched_param+0x70> 200d440: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d444: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200d448: 80 a0 60 00 cmp %g1, 0 200d44c: 02 80 00 23 be 200d4d8 <_POSIX_Thread_Translate_sched_param+0xf0> 200d450: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200d454: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d458: 80 a0 60 00 cmp %g1, 0 200d45c: 12 80 00 06 bne 200d474 <_POSIX_Thread_Translate_sched_param+0x8c> 200d460: 01 00 00 00 nop 200d464: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d468: 80 a0 60 00 cmp %g1, 0 200d46c: 02 80 00 18 be 200d4cc <_POSIX_Thread_Translate_sched_param+0xe4> 200d470: 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 ) < 200d474: 7f ff f5 b6 call 200ab4c <_Timespec_To_ticks> 200d478: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200d47c: 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 ) < 200d480: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200d484: 7f ff f5 b2 call 200ab4c <_Timespec_To_ticks> 200d488: 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 ) < 200d48c: 80 a7 40 08 cmp %i5, %o0 200d490: 0a 80 00 12 bcs 200d4d8 <_POSIX_Thread_Translate_sched_param+0xf0> 200d494: 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 ) ) 200d498: 7f ff ff c7 call 200d3b4 <_POSIX_Priority_Is_valid> 200d49c: d0 06 60 04 ld [ %i1 + 4 ], %o0 200d4a0: 80 8a 20 ff btst 0xff, %o0 200d4a4: 02 80 00 0a be 200d4cc <_POSIX_Thread_Translate_sched_param+0xe4> 200d4a8: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200d4ac: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200d4b0: 03 00 80 1a sethi %hi(0x2006800), %g1 200d4b4: 82 10 63 94 or %g1, 0x394, %g1 ! 2006b94 <_POSIX_Threads_Sporadic_budget_callout> 200d4b8: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200d4bc: 81 c7 e0 08 ret 200d4c0: 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; 200d4c4: 82 10 20 01 mov 1, %g1 200d4c8: c2 26 80 00 st %g1, [ %i2 ] return 0; 200d4cc: 81 c7 e0 08 ret 200d4d0: 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; 200d4d4: fa 26 80 00 st %i5, [ %i2 ] return 0; 200d4d8: 81 c7 e0 08 ret 200d4dc: 81 e8 00 00 restore =============================================================================== 02006894 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2006894: 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; 2006898: 03 00 80 75 sethi %hi(0x201d400), %g1 200689c: 82 10 60 74 or %g1, 0x74, %g1 ! 201d474 maximum = Configuration_POSIX_API.number_of_initialization_threads; 20068a0: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 20068a4: 80 a6 e0 00 cmp %i3, 0 20068a8: 02 80 00 18 be 2006908 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20068ac: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 20068b0: 80 a7 60 00 cmp %i5, 0 20068b4: 02 80 00 15 be 2006908 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20068b8: 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 ); 20068bc: 40 00 1b 09 call 200d4e0 20068c0: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 20068c4: 92 10 20 02 mov 2, %o1 20068c8: 40 00 1b 12 call 200d510 20068cc: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 20068d0: d2 07 60 04 ld [ %i5 + 4 ], %o1 20068d4: 40 00 1b 1f call 200d550 20068d8: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 20068dc: d4 07 40 00 ld [ %i5 ], %o2 20068e0: 90 07 bf fc add %fp, -4, %o0 20068e4: 92 07 bf bc add %fp, -68, %o1 20068e8: 7f ff ff 29 call 200658c 20068ec: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20068f0: 94 92 20 00 orcc %o0, 0, %o2 20068f4: 12 80 00 07 bne 2006910 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 20068f8: 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++ ) { 20068fc: 80 a6 c0 1c cmp %i3, %i4 2006900: 18 bf ff ef bgu 20068bc <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 2006904: ba 07 60 08 add %i5, 8, %i5 2006908: 81 c7 e0 08 ret 200690c: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2006910: 90 10 20 02 mov 2, %o0 2006914: 40 00 08 47 call 2008a30 <_Internal_error_Occurred> 2006918: 92 10 20 01 mov 1, %o1 =============================================================================== 0200c210 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200c210: 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 ]; 200c214: 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 ); 200c218: 40 00 04 08 call 200d238 <_Timespec_To_ticks> 200c21c: 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); 200c220: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200c224: 03 00 80 56 sethi %hi(0x2015800), %g1 200c228: d2 08 63 6c ldub [ %g1 + 0x36c ], %o1 ! 2015b6c */ #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 ) { 200c22c: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200c230: 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; 200c234: d0 26 60 78 st %o0, [ %i1 + 0x78 ] */ #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 ) { 200c238: 80 a0 60 00 cmp %g1, 0 200c23c: 12 80 00 06 bne 200c254 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200c240: 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 ) { 200c244: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200c248: 80 a0 40 09 cmp %g1, %o1 200c24c: 38 80 00 09 bgu,a 200c270 <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200c250: 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 ); 200c254: 40 00 03 f9 call 200d238 <_Timespec_To_ticks> 200c258: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200c25c: 31 00 80 5a sethi %hi(0x2016800), %i0 200c260: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200c264: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200c268: 7f ff f6 8e call 2009ca0 <_Watchdog_Insert> 200c26c: 91 ee 21 24 restore %i0, 0x124, %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 ); 200c270: 7f ff f1 6c call 2008820 <_Thread_Change_priority> 200c274: 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 ); 200c278: 40 00 03 f0 call 200d238 <_Timespec_To_ticks> 200c27c: 90 07 60 90 add %i5, 0x90, %o0 200c280: 31 00 80 5a sethi %hi(0x2016800), %i0 200c284: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200c288: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200c28c: 7f ff f6 85 call 2009ca0 <_Watchdog_Insert> 200c290: 91 ee 21 24 restore %i0, 0x124, %o0 =============================================================================== 0200c294 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200c294: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200c298: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200c29c: 05 00 80 56 sethi %hi(0x2015800), %g2 200c2a0: d2 08 a3 6c ldub [ %g2 + 0x36c ], %o1 ! 2015b6c */ #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 ) { 200c2a4: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200c2a8: 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 */ 200c2ac: 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; 200c2b0: 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 ) { 200c2b4: 80 a0 a0 00 cmp %g2, 0 200c2b8: 12 80 00 06 bne 200c2d0 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200c2bc: c6 22 20 78 st %g3, [ %o0 + 0x78 ] /* * 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 ) { 200c2c0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200c2c4: 80 a0 40 09 cmp %g1, %o1 200c2c8: 0a 80 00 04 bcs 200c2d8 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200c2cc: 94 10 20 01 mov 1, %o2 200c2d0: 81 c3 e0 08 retl <== NOT EXECUTED 200c2d4: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200c2d8: 82 13 c0 00 mov %o7, %g1 200c2dc: 7f ff f1 51 call 2008820 <_Thread_Change_priority> 200c2e0: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200e6b4 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200e6b4: 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 ]; 200e6b8: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200e6bc: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200e6c0: 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 ); 200e6c4: b6 07 20 e8 add %i4, 0xe8, %i3 200e6c8: 80 a0 40 1b cmp %g1, %i3 200e6cc: 02 80 00 14 be 200e71c <_POSIX_Threads_cancel_run+0x68> 200e6d0: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200e6d4: 7f ff ce 1f call 2001f50 200e6d8: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200e6dc: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200e6e0: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200e6e4: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200e6e8: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200e6ec: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200e6f0: 7f ff ce 1c call 2001f60 200e6f4: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200e6f8: c2 07 60 08 ld [ %i5 + 8 ], %g1 200e6fc: 9f c0 40 00 call %g1 200e700: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200e704: 7f ff ee 52 call 200a04c <_Workspace_Free> 200e708: 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 ) ) { 200e70c: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200e710: 80 a0 40 1b cmp %g1, %i3 200e714: 12 bf ff f0 bne 200e6d4 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200e718: 01 00 00 00 nop 200e71c: 81 c7 e0 08 ret 200e720: 81 e8 00 00 restore =============================================================================== 02006654 <_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) { 2006654: 9d e3 bf a0 save %sp, -96, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2006658: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 200665c: 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; 2006660: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006664: 80 a0 60 00 cmp %g1, 0 2006668: 12 80 00 0e bne 20066a0 <_POSIX_Timer_TSR+0x4c> 200666c: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 2006670: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2006674: 80 a0 60 00 cmp %g1, 0 2006678: 32 80 00 0b bne,a 20066a4 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 200667c: 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; 2006680: 82 10 20 04 mov 4, %g1 2006684: 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 ) ) { 2006688: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 200668c: 40 00 19 90 call 200cccc 2006690: 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; 2006694: c0 26 60 68 clr [ %i1 + 0x68 ] 2006698: 81 c7 e0 08 ret 200669c: 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( 20066a0: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 20066a4: d4 06 60 08 ld [ %i1 + 8 ], %o2 20066a8: 90 06 60 10 add %i1, 0x10, %o0 20066ac: 98 10 00 19 mov %i1, %o4 20066b0: 17 00 80 19 sethi %hi(0x2006400), %o3 20066b4: 40 00 1a ad call 200d168 <_POSIX_Timer_Insert_helper> 20066b8: 96 12 e2 54 or %o3, 0x254, %o3 ! 2006654 <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 20066bc: 80 8a 20 ff btst 0xff, %o0 20066c0: 02 bf ff f6 be 2006698 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 20066c4: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 20066c8: 40 00 05 db call 2007e34 <_TOD_Get> 20066cc: 90 06 60 6c add %i1, 0x6c, %o0 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20066d0: 82 10 20 03 mov 3, %g1 20066d4: 10 bf ff ed b 2006688 <_POSIX_Timer_TSR+0x34> 20066d8: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200e7dc <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200e7dc: 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, 200e7e0: 98 10 20 01 mov 1, %o4 200e7e4: 90 10 00 18 mov %i0, %o0 200e7e8: 92 10 00 19 mov %i1, %o1 200e7ec: 94 07 bf f4 add %fp, -12, %o2 200e7f0: 40 00 00 2e call 200e8a8 <_POSIX_signals_Clear_signals> 200e7f4: 96 10 00 1a mov %i2, %o3 200e7f8: 80 8a 20 ff btst 0xff, %o0 200e7fc: 02 80 00 23 be 200e888 <_POSIX_signals_Check_signal+0xac> 200e800: 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 ) 200e804: 85 2e 60 02 sll %i1, 2, %g2 200e808: 37 00 80 5b sethi %hi(0x2016c00), %i3 200e80c: b9 2e 60 04 sll %i1, 4, %i4 200e810: b6 16 e1 f0 or %i3, 0x1f0, %i3 200e814: b8 27 00 02 sub %i4, %g2, %i4 200e818: 84 06 c0 1c add %i3, %i4, %g2 200e81c: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200e820: 80 a7 60 01 cmp %i5, 1 200e824: 02 80 00 19 be 200e888 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200e828: 21 00 80 5b sethi %hi(0x2016c00), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200e82c: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200e830: 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, 200e834: a0 14 21 98 or %l0, 0x198, %l0 200e838: 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; 200e83c: 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, 200e840: 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; 200e844: 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, 200e848: 92 02 60 20 add %o1, 0x20, %o1 200e84c: 40 00 04 6d call 200fa00 200e850: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200e854: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200e858: 80 a0 60 02 cmp %g1, 2 200e85c: 02 80 00 0e be 200e894 <_POSIX_signals_Check_signal+0xb8> 200e860: 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 ); 200e864: 9f c7 40 00 call %i5 200e868: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200e86c: d0 04 20 0c ld [ %l0 + 0xc ], %o0 200e870: 92 07 bf cc add %fp, -52, %o1 200e874: 90 02 20 20 add %o0, 0x20, %o0 200e878: 40 00 04 62 call 200fa00 200e87c: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200e880: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200e884: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200e888: b0 08 60 01 and %g1, 1, %i0 200e88c: 81 c7 e0 08 ret 200e890: 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)( 200e894: 92 07 bf f4 add %fp, -12, %o1 200e898: 9f c7 40 00 call %i5 200e89c: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200e8a0: 10 bf ff f4 b 200e870 <_POSIX_signals_Check_signal+0x94> 200e8a4: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 0200f080 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200f080: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200f084: 7f ff cb b3 call 2001f50 200f088: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200f08c: 85 2e 20 04 sll %i0, 4, %g2 200f090: 83 2e 20 02 sll %i0, 2, %g1 200f094: 82 20 80 01 sub %g2, %g1, %g1 200f098: 05 00 80 5b sethi %hi(0x2016c00), %g2 200f09c: 84 10 a1 f0 or %g2, 0x1f0, %g2 ! 2016df0 <_POSIX_signals_Vectors> 200f0a0: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200f0a4: 80 a0 a0 02 cmp %g2, 2 200f0a8: 02 80 00 0b be 200f0d4 <_POSIX_signals_Clear_process_signals+0x54> 200f0ac: 05 00 80 5b sethi %hi(0x2016c00), %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200f0b0: 03 00 80 5b sethi %hi(0x2016c00), %g1 200f0b4: c4 00 63 e4 ld [ %g1 + 0x3e4 ], %g2 ! 2016fe4 <_POSIX_signals_Pending> 200f0b8: 86 10 20 01 mov 1, %g3 200f0bc: b0 06 3f ff add %i0, -1, %i0 200f0c0: b1 28 c0 18 sll %g3, %i0, %i0 200f0c4: b0 28 80 18 andn %g2, %i0, %i0 200f0c8: f0 20 63 e4 st %i0, [ %g1 + 0x3e4 ] } _ISR_Enable( level ); 200f0cc: 7f ff cb a5 call 2001f60 200f0d0: 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 ] ) ) 200f0d4: 84 10 a3 e8 or %g2, 0x3e8, %g2 200f0d8: c6 00 40 02 ld [ %g1 + %g2 ], %g3 200f0dc: 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 ); 200f0e0: 82 00 60 04 add %g1, 4, %g1 200f0e4: 80 a0 c0 01 cmp %g3, %g1 200f0e8: 02 bf ff f3 be 200f0b4 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN 200f0ec: 03 00 80 5b sethi %hi(0x2016c00), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 200f0f0: 7f ff cb 9c call 2001f60 <== NOT EXECUTED 200f0f4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 020070bc <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20070bc: 82 10 20 1b mov 0x1b, %g1 20070c0: 86 10 20 01 mov 1, %g3 #include #include #include #include int _POSIX_signals_Get_lowest( 20070c4: 84 00 7f ff add %g1, -1, %g2 20070c8: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20070cc: 80 88 80 08 btst %g2, %o0 20070d0: 12 80 00 11 bne 2007114 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20070d4: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20070d8: 82 00 60 01 inc %g1 20070dc: 80 a0 60 20 cmp %g1, 0x20 20070e0: 12 bf ff fa bne 20070c8 <_POSIX_signals_Get_lowest+0xc> 20070e4: 84 00 7f ff add %g1, -1, %g2 20070e8: 82 10 20 01 mov 1, %g1 20070ec: 10 80 00 05 b 2007100 <_POSIX_signals_Get_lowest+0x44> 20070f0: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 20070f4: 80 a0 60 1b cmp %g1, 0x1b 20070f8: 02 80 00 07 be 2007114 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20070fc: 01 00 00 00 nop #include #include #include #include int _POSIX_signals_Get_lowest( 2007100: 84 00 7f ff add %g1, -1, %g2 2007104: 85 28 c0 02 sll %g3, %g2, %g2 #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2007108: 80 88 80 08 btst %g2, %o0 200710c: 22 bf ff fa be,a 20070f4 <_POSIX_signals_Get_lowest+0x38> 2007110: 82 00 60 01 inc %g1 * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 2007114: 81 c3 e0 08 retl 2007118: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200bdcc <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200bdcc: 9d e3 bf a0 save %sp, -96, %sp POSIX_API_Control *api; int signo; ISR_Level level; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200bdd0: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200bdd4: 80 a7 20 00 cmp %i4, 0 200bdd8: 02 80 00 34 be 200bea8 <_POSIX_signals_Post_switch_extension+0xdc> 200bddc: 01 00 00 00 nop * * 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 ); 200bde0: 7f ff d8 5c call 2001f50 200bde4: 37 00 80 5b sethi %hi(0x2016c00), %i3 200bde8: b0 10 00 08 mov %o0, %i0 200bdec: b6 16 e3 e4 or %i3, 0x3e4, %i3 if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200bdf0: c6 06 c0 00 ld [ %i3 ], %g3 200bdf4: 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 & 200bdf8: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200bdfc: 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 & 200be00: 80 a8 40 02 andncc %g1, %g2, %g0 200be04: 02 80 00 27 be 200bea0 <_POSIX_signals_Post_switch_extension+0xd4> 200be08: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200be0c: 7f ff d8 55 call 2001f60 200be10: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200be14: 92 10 00 1d mov %i5, %o1 200be18: 94 10 20 00 clr %o2 200be1c: 40 00 0a 70 call 200e7dc <_POSIX_signals_Check_signal> 200be20: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200be24: 92 10 00 1d mov %i5, %o1 200be28: 90 10 00 1c mov %i4, %o0 200be2c: 40 00 0a 6c call 200e7dc <_POSIX_signals_Check_signal> 200be30: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200be34: ba 07 60 01 inc %i5 200be38: 80 a7 60 20 cmp %i5, 0x20 200be3c: 12 bf ff f7 bne 200be18 <_POSIX_signals_Post_switch_extension+0x4c> 200be40: 92 10 00 1d mov %i5, %o1 200be44: 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 ); 200be48: 92 10 00 1d mov %i5, %o1 200be4c: 94 10 20 00 clr %o2 200be50: 40 00 0a 63 call 200e7dc <_POSIX_signals_Check_signal> 200be54: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200be58: 92 10 00 1d mov %i5, %o1 200be5c: 90 10 00 1c mov %i4, %o0 200be60: 40 00 0a 5f call 200e7dc <_POSIX_signals_Check_signal> 200be64: 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++ ) { 200be68: ba 07 60 01 inc %i5 200be6c: 80 a7 60 1b cmp %i5, 0x1b 200be70: 12 bf ff f7 bne 200be4c <_POSIX_signals_Post_switch_extension+0x80> 200be74: 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 ); 200be78: 7f ff d8 36 call 2001f50 200be7c: 01 00 00 00 nop 200be80: b0 10 00 08 mov %o0, %i0 if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200be84: c6 06 c0 00 ld [ %i3 ], %g3 200be88: 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 & 200be8c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200be90: 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 & 200be94: 80 a8 40 02 andncc %g1, %g2, %g0 200be98: 12 bf ff dd bne 200be0c <_POSIX_signals_Post_switch_extension+0x40><== NEVER TAKEN 200be9c: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200bea0: 7f ff d8 30 call 2001f60 200bea4: 81 e8 00 00 restore 200bea8: 81 c7 e0 08 ret 200beac: 81 e8 00 00 restore =============================================================================== 020237f8 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20237f8: 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 ) ) { 20237fc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2023800: 05 04 00 20 sethi %hi(0x10008000), %g2 2023804: 86 10 20 01 mov 1, %g3 2023808: ba 06 7f ff add %i1, -1, %i5 202380c: 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 ]; 2023810: 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 ) ) { 2023814: 80 a1 00 02 cmp %g4, %g2 2023818: 02 80 00 1c be 2023888 <_POSIX_signals_Unblock_thread+0x90> 202381c: 9f 28 c0 1d sll %g3, %i5, %o7 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 2023820: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2 2023824: 80 ab c0 02 andncc %o7, %g2, %g0 2023828: 02 80 00 15 be 202387c <_POSIX_signals_Unblock_thread+0x84> 202382c: ba 10 20 00 clr %i5 2023830: 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 ) ) { 2023834: 80 88 40 02 btst %g1, %g2 2023838: 02 80 00 29 be 20238dc <_POSIX_signals_Unblock_thread+0xe4> 202383c: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 2023840: 84 10 20 04 mov 4, %g2 2023844: 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); 2023848: 05 00 00 ef sethi %hi(0x3bc00), %g2 202384c: 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) ) 2023850: 80 88 40 02 btst %g1, %g2 2023854: 12 80 00 36 bne 202392c <_POSIX_signals_Unblock_thread+0x134> 2023858: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 202385c: 22 80 00 09 be,a 2023880 <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN 2023860: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 2023864: 7f ff b0 70 call 200fa24 <_Watchdog_Remove> 2023868: 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 ); 202386c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2023870: 90 10 00 18 mov %i0, %o0 2023874: 7f ff ab 2f call 200e530 <_Thread_Clear_state> 2023878: 92 12 63 f8 or %o1, 0x3f8, %o1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 202387c: b0 0f 60 01 and %i5, 1, %i0 2023880: 81 c7 e0 08 ret 2023884: 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) ) { 2023888: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 202388c: 80 8b c0 01 btst %o7, %g1 2023890: 22 80 00 21 be,a 2023914 <_POSIX_signals_Unblock_thread+0x11c> 2023894: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 2023898: 82 10 20 04 mov 4, %g1 202389c: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 20238a0: 80 a6 a0 00 cmp %i2, 0 20238a4: 02 80 00 27 be 2023940 <_POSIX_signals_Unblock_thread+0x148> 20238a8: 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; 20238ac: c4 06 80 00 ld [ %i2 ], %g2 20238b0: c4 20 40 00 st %g2, [ %g1 ] 20238b4: c4 06 a0 04 ld [ %i2 + 4 ], %g2 20238b8: c4 20 60 04 st %g2, [ %g1 + 4 ] 20238bc: c4 06 a0 08 ld [ %i2 + 8 ], %g2 20238c0: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 20238c4: 90 10 00 18 mov %i0, %o0 20238c8: 7f ff ad f9 call 200f0ac <_Thread_queue_Extract_with_proxy> 20238cc: ba 10 20 01 mov 1, %i5 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 20238d0: b0 0f 60 01 and %i5, 1, %i0 20238d4: 81 c7 e0 08 ret 20238d8: 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 ) { 20238dc: 12 bf ff e8 bne 202387c <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN 20238e0: 03 00 80 9d sethi %hi(0x2027400), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20238e4: 82 10 62 68 or %g1, 0x268, %g1 ! 2027668 <_Per_CPU_Information> 20238e8: c4 00 60 08 ld [ %g1 + 8 ], %g2 20238ec: 80 a0 a0 00 cmp %g2, 0 20238f0: 22 bf ff e4 be,a 2023880 <_POSIX_signals_Unblock_thread+0x88> 20238f4: b0 0f 60 01 and %i5, 1, %i0 20238f8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20238fc: 80 a6 00 02 cmp %i0, %g2 2023900: 22 bf ff df be,a 202387c <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN 2023904: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] 2023908: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 202390c: 81 c7 e0 08 ret <== NOT EXECUTED 2023910: 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) ) { 2023914: 80 ab c0 01 andncc %o7, %g1, %g0 2023918: 12 bf ff e0 bne 2023898 <_POSIX_signals_Unblock_thread+0xa0> 202391c: ba 10 20 00 clr %i5 2023920: b0 0f 60 01 and %i5, 1, %i0 2023924: 81 c7 e0 08 ret 2023928: 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 ); 202392c: 7f ff ad e0 call 200f0ac <_Thread_queue_Extract_with_proxy> 2023930: 90 10 00 18 mov %i0, %o0 2023934: b0 0f 60 01 and %i5, 1, %i0 2023938: 81 c7 e0 08 ret 202393c: 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; 2023940: 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; 2023944: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 2023948: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 202394c: 10 bf ff de b 20238c4 <_POSIX_signals_Unblock_thread+0xcc> 2023950: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 02008e40 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008e40: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 2008e44: 80 a6 60 00 cmp %i1, 0 2008e48: 02 80 00 4c be 2008f78 <_RBTree_Extract_unprotected+0x138> 2008e4c: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008e50: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008e54: 80 a0 40 19 cmp %g1, %i1 2008e58: 02 80 00 61 be 2008fdc <_RBTree_Extract_unprotected+0x19c> 2008e5c: 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]) { 2008e60: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008e64: 80 a0 80 19 cmp %g2, %i1 2008e68: 02 80 00 51 be 2008fac <_RBTree_Extract_unprotected+0x16c> 2008e6c: f8 06 60 04 ld [ %i1 + 4 ], %i4 * 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]) { 2008e70: ba 97 20 00 orcc %i4, 0, %i5 2008e74: 22 80 00 54 be,a 2008fc4 <_RBTree_Extract_unprotected+0x184><== ALWAYS TAKEN 2008e78: b8 90 60 00 orcc %g1, 0, %i4 2008e7c: 80 a0 60 00 cmp %g1, 0 2008e80: 32 80 00 05 bne,a 2008e94 <_RBTree_Extract_unprotected+0x54><== NEVER TAKEN 2008e84: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED * 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; 2008e88: 10 80 00 3e b 2008f80 <_RBTree_Extract_unprotected+0x140> 2008e8c: c2 06 40 00 ld [ %i1 ], %g1 * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 2008e90: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2008e94: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2008e98: 32 bf ff fe bne,a 2008e90 <_RBTree_Extract_unprotected+0x50><== NOT EXECUTED 2008e9c: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED * 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]; 2008ea0: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED if(leaf) { 2008ea4: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 2008ea8: 02 80 00 52 be 2008ff0 <_RBTree_Extract_unprotected+0x1b0><== NOT EXECUTED 2008eac: 01 00 00 00 nop <== NOT EXECUTED leaf->parent = target->parent; 2008eb0: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008eb4: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED } 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]; 2008eb8: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008ebc: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED } 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]; 2008ec0: c8 00 a0 04 ld [ %g2 + 4 ], %g4 <== NOT EXECUTED * 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; target->color = the_node->color; 2008ec4: c6 06 60 10 ld [ %i1 + 0x10 ], %g3 <== NOT EXECUTED } 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]; 2008ec8: 88 19 00 1d xor %g4, %i5, %g4 <== NOT EXECUTED 2008ecc: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008ed0: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED target->parent->child[dir] = leaf; 2008ed4: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008ed8: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED 2008edc: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008ee0: c8 00 60 04 ld [ %g1 + 4 ], %g4 <== NOT EXECUTED 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; 2008ee4: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 <== NOT EXECUTED dir = target != target->parent->child[0]; target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008ee8: 88 19 00 19 xor %g4, %i1, %g4 <== NOT EXECUTED 2008eec: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008ef0: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED the_node->parent->child[dir] = target; 2008ef4: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008ef8: 82 00 40 04 add %g1, %g4, %g1 <== NOT EXECUTED 2008efc: fa 20 60 04 st %i5, [ %g1 + 4 ] <== NOT EXECUTED /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008f00: c2 06 60 08 ld [ %i1 + 8 ], %g1 <== NOT EXECUTED * 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; target->color = the_node->color; 2008f04: c6 27 60 10 st %g3, [ %i5 + 0x10 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008f08: c2 27 60 08 st %g1, [ %i5 + 8 ] <== NOT EXECUTED the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008f0c: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008f10: c6 06 60 08 ld [ %i1 + 8 ], %g3 <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008f14: c2 27 60 04 st %g1, [ %i5 + 4 ] <== NOT EXECUTED the_node->child[RBT_LEFT]->parent = target; 2008f18: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008f1c: fa 20 c0 00 st %i5, [ %g3 ] <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; the_node->child[RBT_LEFT]->parent = target; 2008f20: fa 20 40 00 st %i5, [ %g1 ] <== NOT EXECUTED /* 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; 2008f24: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED 2008f28: c2 27 40 00 st %g1, [ %i5 ] <== NOT EXECUTED * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node and the child is red. Paint child black. * 3. Deleted a black node and its child is black. This requires some * care and rotations. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 2008f2c: 80 a0 a0 00 cmp %g2, 0 2008f30: 32 80 00 0c bne,a 2008f60 <_RBTree_Extract_unprotected+0x120> 2008f34: c2 06 20 04 ld [ %i0 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008f38: 80 a7 20 00 cmp %i4, 0 2008f3c: 22 80 00 09 be,a 2008f60 <_RBTree_Extract_unprotected+0x120> 2008f40: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008f44: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2008f48: 80 a0 60 01 cmp %g1, 1 2008f4c: 22 80 00 04 be,a 2008f5c <_RBTree_Extract_unprotected+0x11c><== ALWAYS TAKEN 2008f50: c0 27 20 10 clr [ %i4 + 0x10 ] if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008f54: 7f ff fe e8 call 2008af4 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008f58: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* 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; 2008f5c: 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; 2008f60: c0 26 60 08 clr [ %i1 + 8 ] 2008f64: c0 26 60 04 clr [ %i1 + 4 ] 2008f68: 80 a0 60 00 cmp %g1, 0 2008f6c: 02 80 00 03 be 2008f78 <_RBTree_Extract_unprotected+0x138> 2008f70: c0 26 40 00 clr [ %i1 ] 2008f74: c0 20 60 10 clr [ %g1 + 0x10 ] 2008f78: 81 c7 e0 08 ret 2008f7c: 81 e8 00 00 restore * 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; 2008f80: 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]; 2008f84: 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; 2008f88: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008f8c: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008f90: 86 18 c0 19 xor %g3, %i1, %g3 2008f94: 80 a0 00 03 cmp %g0, %g3 2008f98: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 2008f9c: 87 28 e0 02 sll %g3, 2, %g3 2008fa0: 82 00 40 03 add %g1, %g3, %g1 2008fa4: 10 bf ff e2 b 2008f2c <_RBTree_Extract_unprotected+0xec> 2008fa8: f8 20 60 04 st %i4, [ %g1 + 4 ] 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]) 2008fac: 80 a7 20 00 cmp %i4, 0 2008fb0: 02 80 00 19 be 2009014 <_RBTree_Extract_unprotected+0x1d4> 2008fb4: ba 97 20 00 orcc %i4, 0, %i5 * 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]) { 2008fb8: 12 bf ff b1 bne 2008e7c <_RBTree_Extract_unprotected+0x3c><== ALWAYS TAKEN 2008fbc: f8 26 20 0c st %i4, [ %i0 + 0xc ] * 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]; if( leaf ) { 2008fc0: b8 90 60 00 orcc %g1, 0, %i4 <== NOT EXECUTED 2008fc4: 32 bf ff ef bne,a 2008f80 <_RBTree_Extract_unprotected+0x140> 2008fc8: 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); 2008fcc: 7f ff fe ca call 2008af4 <_RBTree_Extract_validate_unprotected> 2008fd0: 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]; 2008fd4: 10 bf ff ed b 2008f88 <_RBTree_Extract_unprotected+0x148> 2008fd8: 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]) 2008fdc: 80 a0 60 00 cmp %g1, 0 2008fe0: 22 80 00 08 be,a 2009000 <_RBTree_Extract_unprotected+0x1c0> 2008fe4: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008fe8: 10 bf ff 9e b 2008e60 <_RBTree_Extract_unprotected+0x20> 2008fec: c2 26 20 08 st %g1, [ %i0 + 8 ] 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); 2008ff0: 7f ff fe c1 call 2008af4 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008ff4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED } victim_color = target->color; dir = target != target->parent->child[0]; 2008ff8: 10 bf ff b1 b 2008ebc <_RBTree_Extract_unprotected+0x7c> <== NOT EXECUTED 2008ffc: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED 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, 2009000: 80 a6 00 02 cmp %i0, %g2 2009004: 12 bf ff 97 bne 2008e60 <_RBTree_Extract_unprotected+0x20> 2009008: c4 26 20 08 st %g2, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 200900c: 10 bf ff 95 b 2008e60 <_RBTree_Extract_unprotected+0x20> 2009010: c0 26 20 08 clr [ %i0 + 8 ] /* 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]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; 2009014: c4 06 40 00 ld [ %i1 ], %g2 if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2009018: 80 a6 00 02 cmp %i0, %g2 200901c: 12 bf ff 95 bne 2008e70 <_RBTree_Extract_unprotected+0x30> 2009020: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 2009024: 10 bf ff 93 b 2008e70 <_RBTree_Extract_unprotected+0x30> 2009028: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 02008af4 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008af4: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 2008af8: c4 06 00 00 ld [ %i0 ], %g2 if(!parent->parent) return; 2008afc: c2 00 80 00 ld [ %g2 ], %g1 2008b00: 80 a0 60 00 cmp %g1, 0 2008b04: 02 80 00 cd be 2008e38 <_RBTree_Extract_validate_unprotected+0x344> 2008b08: 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]) 2008b0c: c2 00 a0 04 ld [ %g2 + 4 ], %g1 2008b10: 80 a6 00 01 cmp %i0, %g1 2008b14: 22 80 00 02 be,a 2008b1c <_RBTree_Extract_validate_unprotected+0x28> 2008b18: c2 00 a0 08 ld [ %g2 + 8 ], %g1 /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008b1c: 96 10 20 01 mov 1, %o3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008b20: 80 a6 20 00 cmp %i0, 0 2008b24: 22 80 00 07 be,a 2008b40 <_RBTree_Extract_validate_unprotected+0x4c><== NEVER TAKEN 2008b28: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED 2008b2c: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 2008b30: 80 a0 e0 01 cmp %g3, 1 2008b34: 22 80 00 5b be,a 2008ca0 <_RBTree_Extract_validate_unprotected+0x1ac> 2008b38: 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) { 2008b3c: c6 00 80 00 ld [ %g2 ], %g3 2008b40: 80 a0 e0 00 cmp %g3, 0 2008b44: 02 80 00 56 be 2008c9c <_RBTree_Extract_validate_unprotected+0x1a8> 2008b48: 80 a0 60 00 cmp %g1, 0 2008b4c: 02 bf ff f6 be 2008b24 <_RBTree_Extract_validate_unprotected+0x30><== NEVER TAKEN 2008b50: 80 a6 20 00 cmp %i0, 0 2008b54: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 2008b58: 80 a1 20 01 cmp %g4, 1 2008b5c: 22 80 00 27 be,a 2008bf8 <_RBTree_Extract_validate_unprotected+0x104> 2008b60: de 00 a0 04 ld [ %g2 + 4 ], %o7 sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008b64: c6 00 60 08 ld [ %g1 + 8 ], %g3 2008b68: 80 a0 e0 00 cmp %g3, 0 2008b6c: 22 80 00 07 be,a 2008b88 <_RBTree_Extract_validate_unprotected+0x94> 2008b70: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008b74: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008b78: 80 a0 e0 01 cmp %g3, 1 2008b7c: 22 80 00 57 be,a 2008cd8 <_RBTree_Extract_validate_unprotected+0x1e4> 2008b80: c6 00 a0 04 ld [ %g2 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2008b84: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008b88: 80 a0 e0 00 cmp %g3, 0 2008b8c: 22 80 00 07 be,a 2008ba8 <_RBTree_Extract_validate_unprotected+0xb4> 2008b90: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008b94: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008b98: 80 a0 e0 01 cmp %g3, 1 2008b9c: 22 80 00 4f be,a 2008cd8 <_RBTree_Extract_validate_unprotected+0x1e4> 2008ba0: c6 00 a0 04 ld [ %g2 + 4 ], %g3 sibling->color = RBT_RED; 2008ba4: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008ba8: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008bac: 80 a0 60 01 cmp %g1, 1 2008bb0: 22 80 00 3b be,a 2008c9c <_RBTree_Extract_validate_unprotected+0x1a8> 2008bb4: c0 20 a0 10 clr [ %g2 + 0x10 ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 2008bb8: c6 00 80 00 ld [ %g2 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008bbc: 80 a0 e0 00 cmp %g3, 0 2008bc0: 02 80 00 3e be 2008cb8 <_RBTree_Extract_validate_unprotected+0x1c4><== NEVER TAKEN 2008bc4: b0 10 00 02 mov %g2, %i0 if(!(the_node->parent->parent)) return NULL; 2008bc8: c2 00 c0 00 ld [ %g3 ], %g1 2008bcc: 80 a0 60 00 cmp %g1, 0 2008bd0: 02 80 00 3d be 2008cc4 <_RBTree_Extract_validate_unprotected+0x1d0> 2008bd4: 82 10 20 00 clr %g1 if(the_node == the_node->parent->child[RBT_LEFT]) 2008bd8: c2 00 e0 04 ld [ %g3 + 4 ], %g1 2008bdc: 80 a0 80 01 cmp %g2, %g1 2008be0: 02 80 00 3b be 2008ccc <_RBTree_Extract_validate_unprotected+0x1d8> 2008be4: 80 a6 20 00 cmp %i0, 0 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008be8: 12 bf ff d1 bne 2008b2c <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 2008bec: 84 10 00 03 mov %g3, %g2 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) { 2008bf0: 10 bf ff d4 b 2008b40 <_RBTree_Extract_validate_unprotected+0x4c><== NOT EXECUTED 2008bf4: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED * 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; 2008bf8: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008bfc: 9e 1b c0 18 xor %o7, %i0, %o7 2008c00: 80 a0 00 0f cmp %g0, %o7 2008c04: 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; 2008c08: 88 21 00 0d sub %g4, %o5, %g4 2008c0c: 89 29 20 02 sll %g4, 2, %g4 2008c10: 88 00 80 04 add %g2, %g4, %g4 2008c14: de 01 20 04 ld [ %g4 + 4 ], %o7 2008c18: 80 a3 e0 00 cmp %o7, 0 2008c1c: 02 80 00 16 be 2008c74 <_RBTree_Extract_validate_unprotected+0x180><== NEVER TAKEN 2008c20: c0 20 60 10 clr [ %g1 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008c24: 83 2b 60 02 sll %o5, 2, %g1 2008c28: 98 03 c0 01 add %o7, %g1, %o4 2008c2c: d4 03 20 04 ld [ %o4 + 4 ], %o2 2008c30: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 2008c34: c8 03 20 04 ld [ %o4 + 4 ], %g4 2008c38: 80 a1 20 00 cmp %g4, 0 2008c3c: 02 80 00 04 be 2008c4c <_RBTree_Extract_validate_unprotected+0x158><== NEVER TAKEN 2008c40: 82 03 c0 01 add %o7, %g1, %g1 c->child[dir]->parent = the_node; 2008c44: c4 21 00 00 st %g2, [ %g4 ] 2008c48: c6 00 80 00 ld [ %g2 ], %g3 c->child[dir] = the_node; 2008c4c: c4 20 60 04 st %g2, [ %g1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008c50: c2 00 e0 04 ld [ %g3 + 4 ], %g1 c->parent = the_node->parent; 2008c54: 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; 2008c58: 82 18 80 01 xor %g2, %g1, %g1 c->parent = the_node->parent; the_node->parent = c; 2008c5c: de 20 80 00 st %o7, [ %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; 2008c60: 80 a0 00 01 cmp %g0, %g1 2008c64: 82 40 20 00 addx %g0, 0, %g1 2008c68: 83 28 60 02 sll %g1, 2, %g1 2008c6c: 86 00 c0 01 add %g3, %g1, %g3 2008c70: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 2008c74: 80 a0 00 0d cmp %g0, %o5 2008c78: 82 60 3f ff subx %g0, -1, %g1 2008c7c: 83 28 60 02 sll %g1, 2, %g1 2008c80: 82 00 80 01 add %g2, %g1, %g1 2008c84: c2 00 60 04 ld [ %g1 + 4 ], %g1 } /* sibling is black, see if both of its children are also black. */ if (sibling && 2008c88: 80 a0 60 00 cmp %g1, 0 2008c8c: 32 bf ff b7 bne,a 2008b68 <_RBTree_Extract_validate_unprotected+0x74><== ALWAYS TAKEN 2008c90: c6 00 60 08 ld [ %g1 + 8 ], %g3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008c94: 10 bf ff a4 b 2008b24 <_RBTree_Extract_validate_unprotected+0x30><== NOT EXECUTED 2008c98: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008c9c: c2 06 00 00 ld [ %i0 ], %g1 2008ca0: c2 00 40 00 ld [ %g1 ], %g1 2008ca4: 80 a0 60 00 cmp %g1, 0 2008ca8: 22 80 00 02 be,a 2008cb0 <_RBTree_Extract_validate_unprotected+0x1bc> 2008cac: c0 26 20 10 clr [ %i0 + 0x10 ] 2008cb0: 81 c7 e0 08 ret 2008cb4: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008cb8: 82 10 20 00 clr %g1 <== NOT EXECUTED 2008cbc: 10 bf ff 99 b 2008b20 <_RBTree_Extract_validate_unprotected+0x2c><== NOT EXECUTED 2008cc0: 84 10 20 00 clr %g2 <== NOT EXECUTED if(!(the_node->parent->parent)) return NULL; 2008cc4: 10 bf ff 97 b 2008b20 <_RBTree_Extract_validate_unprotected+0x2c> 2008cc8: 84 10 00 03 mov %g3, %g2 if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 2008ccc: c2 00 e0 08 ld [ %g3 + 8 ], %g1 2008cd0: 10 bf ff 94 b 2008b20 <_RBTree_Extract_validate_unprotected+0x2c> 2008cd4: 84 10 00 03 mov %g3, %g2 * 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]; 2008cd8: 86 18 c0 18 xor %g3, %i0, %g3 2008cdc: 80 a0 00 03 cmp %g0, %g3 2008ce0: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 2008ce4: 80 a0 00 03 cmp %g0, %g3 2008ce8: 9e 60 3f ff subx %g0, -1, %o7 2008cec: 9f 2b e0 02 sll %o7, 2, %o7 2008cf0: 88 00 40 0f add %g1, %o7, %g4 2008cf4: 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); 2008cf8: 80 a1 20 00 cmp %g4, 0 2008cfc: 22 80 00 07 be,a 2008d18 <_RBTree_Extract_validate_unprotected+0x224> 2008d00: 89 28 e0 02 sll %g3, 2, %g4 2008d04: da 01 20 10 ld [ %g4 + 0x10 ], %o5 2008d08: 80 a3 60 01 cmp %o5, 1 2008d0c: 22 80 00 28 be,a 2008dac <_RBTree_Extract_validate_unprotected+0x2b8> 2008d10: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 2008d14: 89 28 e0 02 sll %g3, 2, %g4 2008d18: 88 00 40 04 add %g1, %g4, %g4 _RBTree_Rotate(sibling, !dir); 2008d1c: 98 18 e0 01 xor %g3, 1, %o4 * 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; sibling->child[dir]->color = RBT_BLACK; 2008d20: 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; 2008d24: 88 10 20 01 mov 1, %g4 2008d28: c8 20 60 10 st %g4, [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008d2c: 88 21 00 0c sub %g4, %o4, %g4 2008d30: 9b 29 20 02 sll %g4, 2, %o5 2008d34: 9a 00 40 0d add %g1, %o5, %o5 2008d38: c8 03 60 04 ld [ %o5 + 4 ], %g4 2008d3c: 80 a1 20 00 cmp %g4, 0 2008d40: 02 80 00 16 be 2008d98 <_RBTree_Extract_validate_unprotected+0x2a4><== NEVER TAKEN 2008d44: c0 22 e0 10 clr [ %o3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008d48: 99 2b 20 02 sll %o4, 2, %o4 2008d4c: 96 01 00 0c add %g4, %o4, %o3 2008d50: d4 02 e0 04 ld [ %o3 + 4 ], %o2 2008d54: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 2008d58: da 02 e0 04 ld [ %o3 + 4 ], %o5 2008d5c: 80 a3 60 00 cmp %o5, 0 2008d60: 32 80 00 02 bne,a 2008d68 <_RBTree_Extract_validate_unprotected+0x274> 2008d64: c2 23 40 00 st %g1, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d68: da 00 40 00 ld [ %g1 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008d6c: 98 01 00 0c add %g4, %o4, %o4 2008d70: c2 23 20 04 st %g1, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d74: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 2008d78: 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; 2008d7c: 98 18 40 0c xor %g1, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 2008d80: c8 20 40 00 st %g4, [ %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; 2008d84: 80 a0 00 0c cmp %g0, %o4 2008d88: 82 40 20 00 addx %g0, 0, %g1 2008d8c: 83 28 60 02 sll %g1, 2, %g1 2008d90: 9a 03 40 01 add %o5, %g1, %o5 2008d94: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 2008d98: 82 00 80 0f add %g2, %o7, %g1 2008d9c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008da0: 9e 00 40 0f add %g1, %o7, %o7 2008da4: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 2008da8: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 2008dac: de 20 60 10 st %o7, [ %g1 + 0x10 ] parent->color = RBT_BLACK; 2008db0: c0 20 a0 10 clr [ %g2 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008db4: 9e 10 20 01 mov 1, %o7 2008db8: 9e 23 c0 03 sub %o7, %g3, %o7 2008dbc: 9f 2b e0 02 sll %o7, 2, %o7 2008dc0: 9e 00 80 0f add %g2, %o7, %o7 2008dc4: c2 03 e0 04 ld [ %o7 + 4 ], %g1 2008dc8: 80 a0 60 00 cmp %g1, 0 2008dcc: 02 bf ff b4 be 2008c9c <_RBTree_Extract_validate_unprotected+0x1a8><== NEVER TAKEN 2008dd0: c0 21 20 10 clr [ %g4 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008dd4: 87 28 e0 02 sll %g3, 2, %g3 2008dd8: 88 00 40 03 add %g1, %g3, %g4 2008ddc: da 01 20 04 ld [ %g4 + 4 ], %o5 2008de0: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 2008de4: c8 01 20 04 ld [ %g4 + 4 ], %g4 2008de8: 80 a1 20 00 cmp %g4, 0 2008dec: 32 80 00 02 bne,a 2008df4 <_RBTree_Extract_validate_unprotected+0x300> 2008df0: c4 21 00 00 st %g2, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008df4: c8 00 80 00 ld [ %g2 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008df8: 86 00 40 03 add %g1, %g3, %g3 2008dfc: c4 20 e0 04 st %g2, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008e00: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 2008e04: c8 20 40 00 st %g4, [ %g1 ] the_node->parent = c; 2008e08: c2 20 80 00 st %g1, [ %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; 2008e0c: 86 18 c0 02 xor %g3, %g2, %g3 2008e10: 80 a0 00 03 cmp %g0, %g3 2008e14: 84 40 20 00 addx %g0, 0, %g2 2008e18: 85 28 a0 02 sll %g2, 2, %g2 2008e1c: 88 01 00 02 add %g4, %g2, %g4 2008e20: c2 21 20 04 st %g1, [ %g4 + 4 ] sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008e24: c2 06 00 00 ld [ %i0 ], %g1 2008e28: c2 00 40 00 ld [ %g1 ], %g1 2008e2c: 80 a0 60 00 cmp %g1, 0 2008e30: 22 bf ff a0 be,a 2008cb0 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 2008e34: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 2008e38: 81 c7 e0 08 ret 2008e3c: 81 e8 00 00 restore =============================================================================== 020090a0 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 20090a0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 20090a4: 7f ff e6 59 call 2002a08 20090a8: 01 00 00 00 nop return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); return return_node; } 20090ac: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 20090b0: 80 a6 20 00 cmp %i0, 0 20090b4: 32 80 00 0b bne,a 20090e0 <_RBTree_Find+0x40> <== ALWAYS TAKEN 20090b8: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20090bc: 30 80 00 0c b,a 20090ec <_RBTree_Find+0x4c> <== NOT EXECUTED if (the_value == iter_node->value) return(iter_node); RBTree_Direction dir = the_value > iter_node->value; 20090c0: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 20090c4: 83 28 60 02 sll %g1, 2, %g1 20090c8: b0 06 00 01 add %i0, %g1, %i0 20090cc: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 20090d0: 80 a6 20 00 cmp %i0, 0 20090d4: 02 80 00 06 be 20090ec <_RBTree_Find+0x4c> <== NEVER TAKEN 20090d8: 01 00 00 00 nop if (the_value == iter_node->value) return(iter_node); 20090dc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20090e0: 80 a6 40 01 cmp %i1, %g1 20090e4: 12 bf ff f7 bne 20090c0 <_RBTree_Find+0x20> 20090e8: 80 a0 40 19 cmp %g1, %i1 RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 20090ec: 7f ff e6 4b call 2002a18 20090f0: 01 00 00 00 nop return return_node; } 20090f4: 81 c7 e0 08 ret 20090f8: 81 e8 00 00 restore =============================================================================== 02009054 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2009054: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 2009058: 7f ff e6 6c call 2002a08 200905c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected( RBTree_Node *the_node ) { if(!the_node) return NULL; 2009060: 80 a6 20 00 cmp %i0, 0 2009064: 02 80 00 0b be 2009090 <_RBTree_Find_header+0x3c> <== NEVER TAKEN 2009068: ba 10 20 00 clr %i5 if(!(the_node->parent)) return NULL; 200906c: fa 06 00 00 ld [ %i0 ], %i5 2009070: 80 a7 60 00 cmp %i5, 0 2009074: 32 80 00 04 bne,a 2009084 <_RBTree_Find_header+0x30> <== ALWAYS TAKEN 2009078: c2 07 40 00 ld [ %i5 ], %g1 200907c: 30 80 00 05 b,a 2009090 <_RBTree_Find_header+0x3c> <== NOT EXECUTED 2009080: c2 07 40 00 ld [ %i5 ], %g1 while(the_node->parent) the_node = the_node->parent; 2009084: 80 a0 60 00 cmp %g1, 0 2009088: 32 bf ff fe bne,a 2009080 <_RBTree_Find_header+0x2c> 200908c: ba 10 00 01 mov %g1, %i5 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 2009090: 7f ff e6 62 call 2002a18 2009094: b0 10 00 1d mov %i5, %i0 return return_header; } 2009098: 81 c7 e0 08 ret 200909c: 81 e8 00 00 restore =============================================================================== 020092e8 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 20092e8: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 20092ec: 80 a6 60 00 cmp %i1, 0 20092f0: 02 80 00 14 be 2009340 <_RBTree_Insert_unprotected+0x58> <== NEVER TAKEN 20092f4: 82 10 3f ff mov -1, %g1 RBTree_Node *iter_node = the_rbtree->root; 20092f8: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (!iter_node) { /* special case: first node inserted */ 20092fc: 80 a0 60 00 cmp %g1, 0 2009300: 22 80 00 23 be,a 200938c <_RBTree_Insert_unprotected+0xa4> 2009304: c0 26 60 10 clr [ %i1 + 0x10 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 2009308: 10 80 00 0a b 2009330 <_RBTree_Insert_unprotected+0x48> 200930c: c6 06 60 0c ld [ %i1 + 0xc ], %g3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; 2009310: 9e 40 20 00 addx %g0, 0, %o7 if (!iter_node->child[dir]) { 2009314: 89 2b e0 02 sll %o7, 2, %g4 2009318: 88 00 40 04 add %g1, %g4, %g4 200931c: c4 01 20 04 ld [ %g4 + 4 ], %g2 2009320: 80 a0 a0 00 cmp %g2, 0 2009324: 22 80 00 09 be,a 2009348 <_RBTree_Insert_unprotected+0x60> 2009328: c0 26 60 08 clr [ %i1 + 8 ] 200932c: 82 10 00 02 mov %g2, %g1 the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); 2009330: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2009334: 80 a0 c0 02 cmp %g3, %g2 2009338: 12 bf ff f6 bne 2009310 <_RBTree_Insert_unprotected+0x28> 200933c: 80 a0 80 03 cmp %g2, %g3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 2009340: 81 c7 e0 08 ret 2009344: 91 e8 00 01 restore %g0, %g1, %o0 /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2009348: c0 26 60 04 clr [ %i1 + 4 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200934c: 9e 03 e0 02 add %o7, 2, %o7 2009350: 9f 2b e0 02 sll %o7, 2, %o7 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2009354: c4 06 00 0f ld [ %i0 + %o7 ], %g2 while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2009358: 86 10 20 01 mov 1, %g3 iter_node->child[dir] = the_node; 200935c: f2 21 20 04 st %i1, [ %g4 + 4 ] while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2009360: c6 26 60 10 st %g3, [ %i1 + 0x10 ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2009364: 80 a0 40 02 cmp %g1, %g2 2009368: 02 80 00 07 be 2009384 <_RBTree_Insert_unprotected+0x9c> 200936c: c2 26 40 00 st %g1, [ %i1 ] } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 2009370: 7f ff ff 72 call 2009138 <_RBTree_Validate_insert_unprotected> 2009374: 90 10 00 19 mov %i1, %o0 } return (RBTree_Node*)0; 2009378: 82 10 20 00 clr %g1 } 200937c: 81 c7 e0 08 ret 2009380: 91 e8 00 01 restore %g0, %g1, %o0 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 2009384: 10 bf ff fb b 2009370 <_RBTree_Insert_unprotected+0x88> 2009388: f2 26 00 0f st %i1, [ %i0 + %o7 ] RBTree_Node *iter_node = the_rbtree->root; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 200938c: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 2009390: f2 26 20 0c st %i1, [ %i0 + 0xc ] 2009394: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 2009398: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200939c: c0 26 60 08 clr [ %i1 + 8 ] 20093a0: 10 bf ff e8 b 2009340 <_RBTree_Insert_unprotected+0x58> 20093a4: c0 26 60 04 clr [ %i1 + 4 ] =============================================================================== 02009138 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2009138: 9d e3 bf a0 save %sp, -96, %sp } 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) { 200913c: 96 10 20 01 mov 1, %o3 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009140: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 2009144: c4 00 40 00 ld [ %g1 ], %g2 2009148: 86 90 a0 00 orcc %g2, 0, %g3 200914c: 22 80 00 06 be,a 2009164 <_RBTree_Validate_insert_unprotected+0x2c> 2009150: c0 26 20 10 clr [ %i0 + 0x10 ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009154: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 2009158: 80 a1 20 01 cmp %g4, 1 200915c: 22 80 00 04 be,a 200916c <_RBTree_Validate_insert_unprotected+0x34> 2009160: c8 00 80 00 ld [ %g2 ], %g4 2009164: 81 c7 e0 08 ret 2009168: 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; 200916c: 80 a1 20 00 cmp %g4, 0 2009170: 02 80 00 0c be 20091a0 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 2009174: 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]) 2009178: 80 a0 40 0f cmp %g1, %o7 200917c: 02 80 00 59 be 20092e0 <_RBTree_Validate_insert_unprotected+0x1a8> 2009180: 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); 2009184: 80 a1 20 00 cmp %g4, 0 2009188: 22 80 00 07 be,a 20091a4 <_RBTree_Validate_insert_unprotected+0x6c> 200918c: c8 00 60 04 ld [ %g1 + 4 ], %g4 2009190: da 01 20 10 ld [ %g4 + 0x10 ], %o5 2009194: 80 a3 60 01 cmp %o5, 1 2009198: 22 80 00 4c be,a 20092c8 <_RBTree_Validate_insert_unprotected+0x190> 200919c: c0 20 60 10 clr [ %g1 + 0x10 ] 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]; 20091a0: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 20091a4: 9e 18 40 0f xor %g1, %o7, %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]; 20091a8: 88 19 00 18 xor %g4, %i0, %g4 20091ac: 80 a0 00 04 cmp %g0, %g4 20091b0: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 20091b4: 80 a0 00 0f cmp %g0, %o7 20091b8: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 20091bc: 80 a3 40 04 cmp %o5, %g4 20091c0: 02 80 00 46 be 20092d8 <_RBTree_Validate_insert_unprotected+0x1a0> 20091c4: 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; 20091c8: 98 22 c0 04 sub %o3, %g4, %o4 20091cc: 9b 2b 20 02 sll %o4, 2, %o5 20091d0: 9a 00 40 0d add %g1, %o5, %o5 20091d4: de 03 60 04 ld [ %o5 + 4 ], %o7 20091d8: 80 a3 e0 00 cmp %o7, 0 20091dc: 02 80 00 16 be 2009234 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 20091e0: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 20091e4: 94 03 c0 04 add %o7, %g4, %o2 20091e8: d2 02 a0 04 ld [ %o2 + 4 ], %o1 20091ec: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 20091f0: da 02 a0 04 ld [ %o2 + 4 ], %o5 20091f4: 80 a3 60 00 cmp %o5, 0 20091f8: 22 80 00 05 be,a 200920c <_RBTree_Validate_insert_unprotected+0xd4> 20091fc: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 2009200: c2 23 40 00 st %g1, [ %o5 ] 2009204: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 2009208: 9a 03 c0 04 add %o7, %g4, %o5 200920c: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009210: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 2009214: 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; 2009218: 9a 18 40 0d xor %g1, %o5, %o5 c->parent = the_node->parent; the_node->parent = c; 200921c: 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; 2009220: 80 a0 00 0d cmp %g0, %o5 2009224: 82 40 20 00 addx %g0, 0, %g1 2009228: 83 28 60 02 sll %g1, 2, %g1 200922c: 84 00 80 01 add %g2, %g1, %g2 2009230: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 2009234: b0 06 00 04 add %i0, %g4, %i0 2009238: f0 06 20 04 ld [ %i0 + 4 ], %i0 200923c: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 2009240: c0 20 60 10 clr [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2009244: 88 00 c0 04 add %g3, %g4, %g4 2009248: c2 01 20 04 ld [ %g4 + 4 ], %g1 200924c: 80 a0 60 00 cmp %g1, 0 2009250: 02 bf ff bc be 2009140 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN 2009254: d6 20 e0 10 st %o3, [ %g3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009258: 99 2b 20 02 sll %o4, 2, %o4 200925c: 84 00 40 0c add %g1, %o4, %g2 2009260: de 00 a0 04 ld [ %g2 + 4 ], %o7 2009264: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 2009268: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200926c: 80 a0 a0 00 cmp %g2, 0 2009270: 32 80 00 02 bne,a 2009278 <_RBTree_Validate_insert_unprotected+0x140> 2009274: c6 20 80 00 st %g3, [ %g2 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009278: c4 00 c0 00 ld [ %g3 ], %g2 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200927c: 98 00 40 0c add %g1, %o4, %o4 2009280: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009284: c8 00 a0 04 ld [ %g2 + 4 ], %g4 c->parent = the_node->parent; 2009288: c4 20 40 00 st %g2, [ %g1 ] the_node->parent = c; 200928c: c2 20 c0 00 st %g1, [ %g3 ] 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; 2009290: 88 19 00 03 xor %g4, %g3, %g4 2009294: 80 a0 00 04 cmp %g0, %g4 2009298: 86 40 20 00 addx %g0, 0, %g3 200929c: 87 28 e0 02 sll %g3, 2, %g3 20092a0: 84 00 80 03 add %g2, %g3, %g2 20092a4: c2 20 a0 04 st %g1, [ %g2 + 4 ] ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 20092a8: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 20092ac: c4 00 40 00 ld [ %g1 ], %g2 20092b0: 86 90 a0 00 orcc %g2, 0, %g3 20092b4: 32 bf ff a9 bne,a 2009158 <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 20092b8: c8 00 60 10 ld [ %g1 + 0x10 ], %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; 20092bc: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 20092c0: 81 c7 e0 08 ret <== NOT EXECUTED 20092c4: 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; 20092c8: c0 21 20 10 clr [ %g4 + 0x10 ] g->color = RBT_RED; 20092cc: da 20 a0 10 st %o5, [ %g2 + 0x10 ] 20092d0: 10 bf ff 9c b 2009140 <_RBTree_Validate_insert_unprotected+0x8> 20092d4: b0 10 00 02 mov %g2, %i0 20092d8: 10 bf ff da b 2009240 <_RBTree_Validate_insert_unprotected+0x108> 20092dc: 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]; 20092e0: 10 bf ff a9 b 2009184 <_RBTree_Validate_insert_unprotected+0x4c> 20092e4: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 020067ac <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 20067ac: 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; 20067b0: 03 00 80 56 sethi %hi(0x2015800), %g1 20067b4: 82 10 63 74 or %g1, 0x374, %g1 ! 2015b74 20067b8: 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 ) 20067bc: 80 a7 60 00 cmp %i5, 0 20067c0: 02 80 00 18 be 2006820 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 20067c4: 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++ ) { 20067c8: 80 a6 e0 00 cmp %i3, 0 20067cc: 02 80 00 15 be 2006820 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 20067d0: b8 10 20 00 clr %i4 return_value = rtems_task_create( 20067d4: d4 07 60 04 ld [ %i5 + 4 ], %o2 20067d8: d0 07 40 00 ld [ %i5 ], %o0 20067dc: d2 07 60 08 ld [ %i5 + 8 ], %o1 20067e0: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 20067e4: d8 07 60 0c ld [ %i5 + 0xc ], %o4 20067e8: 7f ff ff 70 call 20065a8 20067ec: 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 ) ) 20067f0: 94 92 20 00 orcc %o0, 0, %o2 20067f4: 12 80 00 0d bne 2006828 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 20067f8: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 20067fc: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2006800: 40 00 00 0e call 2006838 2006804: 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 ) ) 2006808: 94 92 20 00 orcc %o0, 0, %o2 200680c: 12 80 00 07 bne 2006828 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006810: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006814: 80 a7 00 1b cmp %i4, %i3 2006818: 12 bf ff ef bne 20067d4 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 200681c: ba 07 60 1c add %i5, 0x1c, %i5 2006820: 81 c7 e0 08 ret 2006824: 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 ); 2006828: 90 10 20 01 mov 1, %o0 200682c: 40 00 03 fd call 2007820 <_Internal_error_Occurred> 2006830: 92 10 20 01 mov 1, %o1 =============================================================================== 0200c5bc <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200c5bc: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200c5c0: 80 a0 60 00 cmp %g1, 0 200c5c4: 22 80 00 0c be,a 200c5f4 <_RTEMS_tasks_Switch_extension+0x38> 200c5c8: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200c5cc: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200c5d0: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200c5d4: c8 00 80 00 ld [ %g2 ], %g4 200c5d8: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200c5dc: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c5e0: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200c5e4: 80 a0 60 00 cmp %g1, 0 200c5e8: 32 bf ff fa bne,a 200c5d0 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200c5ec: 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; 200c5f0: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200c5f4: 80 a0 60 00 cmp %g1, 0 200c5f8: 02 80 00 0b be 200c624 <_RTEMS_tasks_Switch_extension+0x68> 200c5fc: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200c600: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200c604: 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; 200c608: c8 00 80 00 ld [ %g2 ], %g4 200c60c: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200c610: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c614: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200c618: 80 a0 60 00 cmp %g1, 0 200c61c: 32 bf ff fa bne,a 200c604 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200c620: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200c624: 81 c3 e0 08 retl =============================================================================== 02007a74 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007a74: 9d e3 bf 98 save %sp, -104, %sp 2007a78: 11 00 80 7d sethi %hi(0x201f400), %o0 2007a7c: 92 10 00 18 mov %i0, %o1 2007a80: 90 12 20 04 or %o0, 4, %o0 2007a84: 40 00 08 41 call 2009b88 <_Objects_Get> 2007a88: 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 ) { 2007a8c: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a90: 80 a0 60 00 cmp %g1, 0 2007a94: 12 80 00 16 bne 2007aec <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 2007a98: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007a9c: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007aa0: 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); 2007aa4: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007aa8: 80 88 80 01 btst %g2, %g1 2007aac: 22 80 00 08 be,a 2007acc <_Rate_monotonic_Timeout+0x58> 2007ab0: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ab4: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007ab8: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007abc: 80 a0 80 01 cmp %g2, %g1 2007ac0: 02 80 00 19 be 2007b24 <_Rate_monotonic_Timeout+0xb0> 2007ac4: 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 ) { 2007ac8: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007acc: 80 a0 60 01 cmp %g1, 1 2007ad0: 02 80 00 09 be 2007af4 <_Rate_monotonic_Timeout+0x80> 2007ad4: 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; 2007ad8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2007adc: 03 00 80 7d sethi %hi(0x201f400), %g1 2007ae0: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 201f570 <_Thread_Dispatch_disable_level> 2007ae4: 84 00 bf ff add %g2, -1, %g2 2007ae8: c4 20 61 70 st %g2, [ %g1 + 0x170 ] 2007aec: 81 c7 e0 08 ret 2007af0: 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; 2007af4: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007af8: 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; 2007afc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007b00: 7f ff fe 5c call 2007470 <_Rate_monotonic_Initiate_statistics> 2007b04: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b08: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b0c: 11 00 80 7d sethi %hi(0x201f400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b10: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b14: 90 12 22 34 or %o0, 0x234, %o0 2007b18: 40 00 10 2a call 200bbc0 <_Watchdog_Insert> 2007b1c: 92 07 60 10 add %i5, 0x10, %o1 2007b20: 30 bf ff ef b,a 2007adc <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007b24: 40 00 0a eb call 200a6d0 <_Thread_Clear_state> 2007b28: 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 ); 2007b2c: 10 bf ff f5 b 2007b00 <_Rate_monotonic_Timeout+0x8c> 2007b30: 90 10 00 1d mov %i5, %o0 =============================================================================== 02008994 <_Scheduler_simple_Ready_queue_Enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2008994: 03 00 80 59 sethi %hi(0x2016400), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2008998: c2 00 63 14 ld [ %g1 + 0x314 ], %g1 ! 2016714 <_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 ) { 200899c: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 20089a0: c2 00 40 00 ld [ %g1 ], %g1 20089a4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 20089a8: 80 a0 80 03 cmp %g2, %g3 20089ac: 3a 80 00 08 bcc,a 20089cc <_Scheduler_simple_Ready_queue_Enqueue_first+0x38> 20089b0: 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 ) { 20089b4: 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 ) { 20089b8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 20089bc: 80 a0 80 03 cmp %g2, %g3 20089c0: 2a bf ff fe bcs,a 20089b8 <_Scheduler_simple_Ready_queue_Enqueue_first+0x24><== NEVER TAKEN 20089c4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 20089c8: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 20089cc: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 20089d0: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 20089d4: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 20089d8: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 20089dc: 81 c3 e0 08 retl 20089e0: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 0200748c <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 200748c: 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(); 2007490: 03 00 80 7c sethi %hi(0x201f000), %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; 2007494: 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) || 2007498: 80 a6 20 00 cmp %i0, 0 200749c: 02 80 00 2c be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 20074a0: d2 00 60 98 ld [ %g1 + 0x98 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 20074a4: 11 00 03 d0 sethi %hi(0xf4000), %o0 20074a8: 40 00 4c 33 call 201a574 <.udiv> 20074ac: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20074b0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20074b4: 80 a2 00 01 cmp %o0, %g1 20074b8: 28 80 00 26 bleu,a 2007550 <_TOD_Validate+0xc4> 20074bc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 20074c0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20074c4: 80 a0 60 3b cmp %g1, 0x3b 20074c8: 38 80 00 22 bgu,a 2007550 <_TOD_Validate+0xc4> 20074cc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20074d0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20074d4: 80 a0 60 3b cmp %g1, 0x3b 20074d8: 38 80 00 1e bgu,a 2007550 <_TOD_Validate+0xc4> 20074dc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20074e0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20074e4: 80 a0 60 17 cmp %g1, 0x17 20074e8: 38 80 00 1a bgu,a 2007550 <_TOD_Validate+0xc4> 20074ec: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 20074f0: 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) || 20074f4: 80 a0 60 00 cmp %g1, 0 20074f8: 02 80 00 15 be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 20074fc: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007500: 38 80 00 14 bgu,a 2007550 <_TOD_Validate+0xc4> 2007504: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007508: 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) || 200750c: 80 a0 a7 c3 cmp %g2, 0x7c3 2007510: 28 80 00 10 bleu,a 2007550 <_TOD_Validate+0xc4> 2007514: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007518: 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) || 200751c: 80 a0 e0 00 cmp %g3, 0 2007520: 02 80 00 0b be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 2007524: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007528: 32 80 00 0c bne,a 2007558 <_TOD_Validate+0xcc> 200752c: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2007530: 82 00 60 0d add %g1, 0xd, %g1 2007534: 05 00 80 76 sethi %hi(0x201d800), %g2 2007538: 83 28 60 02 sll %g1, 2, %g1 200753c: 84 10 a3 f0 or %g2, 0x3f0, %g2 2007540: 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( 2007544: 80 a0 40 03 cmp %g1, %g3 2007548: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 200754c: b0 0f 60 01 and %i5, 1, %i0 2007550: 81 c7 e0 08 ret 2007554: 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 ]; 2007558: 05 00 80 76 sethi %hi(0x201d800), %g2 200755c: 84 10 a3 f0 or %g2, 0x3f0, %g2 ! 201dbf0 <_TOD_Days_per_month> 2007560: 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( 2007564: 80 a0 40 03 cmp %g1, %g3 2007568: 10 bf ff f9 b 200754c <_TOD_Validate+0xc0> 200756c: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02008820 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008820: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008824: 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 ); 2008828: 40 00 03 a0 call 20096a8 <_Thread_Set_transient> 200882c: 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 ) 2008830: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008834: 80 a0 40 19 cmp %g1, %i1 2008838: 02 80 00 05 be 200884c <_Thread_Change_priority+0x2c> 200883c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008840: 90 10 00 18 mov %i0, %o0 2008844: 40 00 03 7f call 2009640 <_Thread_Set_priority> 2008848: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200884c: 7f ff e5 c1 call 2001f50 2008850: 01 00 00 00 nop 2008854: b0 10 00 08 mov %o0, %i0 /* * 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; 2008858: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 200885c: 80 a6 e0 04 cmp %i3, 4 2008860: 02 80 00 18 be 20088c0 <_Thread_Change_priority+0xa0> 2008864: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008868: 02 80 00 0b be 2008894 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200886c: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2008870: 7f ff e5 bc call 2001f60 <== NOT EXECUTED 2008874: 90 10 00 18 mov %i0, %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); 2008878: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200887c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008880: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2008884: 32 80 00 0d bne,a 20088b8 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2008888: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200888c: 81 c7 e0 08 ret 2008890: 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 ); 2008894: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008898: 7f ff e5 b2 call 2001f60 200889c: 90 10 00 18 mov %i0, %o0 20088a0: 03 00 00 ef sethi %hi(0x3bc00), %g1 20088a4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20088a8: 80 8e c0 01 btst %i3, %g1 20088ac: 02 bf ff f8 be 200888c <_Thread_Change_priority+0x6c> 20088b0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20088b4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 20088b8: 40 00 03 32 call 2009580 <_Thread_queue_Requeue> 20088bc: 93 e8 00 1d restore %g0, %i5, %o1 20088c0: 39 00 80 57 sethi %hi(0x2015c00), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 20088c4: 12 80 00 08 bne 20088e4 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 20088c8: b8 17 20 14 or %i4, 0x14, %i4 ! 2015c14 <_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 ) 20088cc: 80 a6 a0 00 cmp %i2, 0 20088d0: 02 80 00 1a be 2008938 <_Thread_Change_priority+0x118> 20088d4: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 20088d8: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 20088dc: 9f c0 40 00 call %g1 20088e0: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 20088e4: 7f ff e5 9f call 2001f60 20088e8: 90 10 00 18 mov %i0, %o0 20088ec: 7f ff e5 99 call 2001f50 20088f0: 01 00 00 00 nop * 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(); 20088f4: c2 07 20 08 ld [ %i4 + 8 ], %g1 20088f8: 9f c0 40 00 call %g1 20088fc: 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 ); 2008900: 03 00 80 5b sethi %hi(0x2016c00), %g1 2008904: 82 10 61 98 or %g1, 0x198, %g1 ! 2016d98 <_Per_CPU_Information> 2008908: 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() && 200890c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008910: 80 a0 80 03 cmp %g2, %g3 2008914: 02 80 00 07 be 2008930 <_Thread_Change_priority+0x110> 2008918: 01 00 00 00 nop 200891c: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008920: 80 a0 a0 00 cmp %g2, 0 2008924: 02 80 00 03 be 2008930 <_Thread_Change_priority+0x110> 2008928: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200892c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008930: 7f ff e5 8c call 2001f60 2008934: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008938: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200893c: 9f c0 40 00 call %g1 2008940: 90 10 00 1d mov %i5, %o0 2008944: 30 bf ff e8 b,a 20088e4 <_Thread_Change_priority+0xc4> =============================================================================== 02008b54 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008b54: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008b58: 90 10 00 18 mov %i0, %o0 2008b5c: 40 00 00 76 call 2008d34 <_Thread_Get> 2008b60: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008b64: c2 07 bf fc ld [ %fp + -4 ], %g1 2008b68: 80 a0 60 00 cmp %g1, 0 2008b6c: 12 80 00 08 bne 2008b8c <_Thread_Delay_ended+0x38> <== NEVER TAKEN 2008b70: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2008b74: 7f ff ff 75 call 2008948 <_Thread_Clear_state> 2008b78: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 2008b7c: 03 00 80 5a sethi %hi(0x2016800), %g1 2008b80: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 2016860 <_Thread_Dispatch_disable_level> 2008b84: 84 00 bf ff add %g2, -1, %g2 2008b88: c4 20 60 60 st %g2, [ %g1 + 0x60 ] 2008b8c: 81 c7 e0 08 ret 2008b90: 81 e8 00 00 restore =============================================================================== 02008b94 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2008b94: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 2008b98: 37 00 80 5b sethi %hi(0x2016c00), %i3 2008b9c: b6 16 e1 98 or %i3, 0x198, %i3 ! 2016d98 <_Per_CPU_Information> _ISR_Disable( level ); 2008ba0: 7f ff e4 ec call 2001f50 2008ba4: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 2008ba8: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2008bac: 80 a0 60 00 cmp %g1, 0 2008bb0: 02 80 00 4e be 2008ce8 <_Thread_Dispatch+0x154> 2008bb4: 31 00 80 5a sethi %hi(0x2016800), %i0 heir = _Thread_Heir; 2008bb8: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 _Thread_Dispatch_disable_level = 1; 2008bbc: 82 10 20 01 mov 1, %g1 2008bc0: c2 26 20 60 st %g1, [ %i0 + 0x60 ] _Thread_Dispatch_necessary = false; 2008bc4: c0 2e e0 18 clrb [ %i3 + 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 ) 2008bc8: 80 a7 40 1c cmp %i5, %i4 2008bcc: 02 80 00 47 be 2008ce8 <_Thread_Dispatch+0x154> 2008bd0: f8 26 e0 0c st %i4, [ %i3 + 0xc ] 2008bd4: 35 00 80 5a sethi %hi(0x2016800), %i2 2008bd8: 23 00 80 5a sethi %hi(0x2016800), %l1 2008bdc: b4 16 a1 10 or %i2, 0x110, %i2 2008be0: a2 14 60 e8 or %l1, 0xe8, %l1 #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; 2008be4: 27 00 80 59 sethi %hi(0x2016400), %l3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008be8: a0 10 00 1a mov %i2, %l0 #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 ); 2008bec: 33 00 80 5a sethi %hi(0x2016800), %i1 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 2008bf0: 10 80 00 38 b 2008cd0 <_Thread_Dispatch+0x13c> 2008bf4: a4 10 20 01 mov 1, %l2 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; _ISR_Enable( level ); 2008bf8: 7f ff e4 da call 2001f60 2008bfc: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008c00: 40 00 0f af call 200cabc <_TOD_Get_uptime> 2008c04: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 2008c08: 90 10 00 10 mov %l0, %o0 2008c0c: 92 07 bf f0 add %fp, -16, %o1 2008c10: 40 00 03 4e call 2009948 <_Timespec_Subtract> 2008c14: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008c18: 90 07 60 84 add %i5, 0x84, %o0 2008c1c: 40 00 03 32 call 20098e4 <_Timespec_Add_to> 2008c20: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2008c24: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c28: c2 04 40 00 ld [ %l1 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 2008c2c: c4 26 80 00 st %g2, [ %i2 ] 2008c30: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c34: 80 a0 60 00 cmp %g1, 0 2008c38: 02 80 00 06 be 2008c50 <_Thread_Dispatch+0xbc> <== NEVER TAKEN 2008c3c: c4 26 a0 04 st %g2, [ %i2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 2008c40: c4 00 40 00 ld [ %g1 ], %g2 2008c44: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2008c48: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2008c4c: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008c50: 90 10 00 1d mov %i5, %o0 2008c54: 40 00 04 01 call 2009c58 <_User_extensions_Thread_switch> 2008c58: 92 10 00 1c mov %i4, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2008c5c: 90 07 60 c8 add %i5, 0xc8, %o0 2008c60: 40 00 05 4a call 200a188 <_CPU_Context_switch> 2008c64: 92 07 20 c8 add %i4, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2008c68: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2008c6c: 80 a0 60 00 cmp %g1, 0 2008c70: 02 80 00 0c be 2008ca0 <_Thread_Dispatch+0x10c> 2008c74: d0 06 60 e4 ld [ %i1 + 0xe4 ], %o0 2008c78: 80 a7 40 08 cmp %i5, %o0 2008c7c: 02 80 00 09 be 2008ca0 <_Thread_Dispatch+0x10c> 2008c80: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008c84: 02 80 00 04 be 2008c94 <_Thread_Dispatch+0x100> 2008c88: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2008c8c: 40 00 05 05 call 200a0a0 <_CPU_Context_save_fp> 2008c90: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008c94: 40 00 05 20 call 200a114 <_CPU_Context_restore_fp> 2008c98: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2008c9c: fa 26 60 e4 st %i5, [ %i1 + 0xe4 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2008ca0: 7f ff e4 ac call 2001f50 2008ca4: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2008ca8: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2008cac: 80 a0 60 00 cmp %g1, 0 2008cb0: 02 80 00 0e be 2008ce8 <_Thread_Dispatch+0x154> 2008cb4: 01 00 00 00 nop heir = _Thread_Heir; 2008cb8: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 _Thread_Dispatch_disable_level = 1; 2008cbc: e4 26 20 60 st %l2, [ %i0 + 0x60 ] _Thread_Dispatch_necessary = false; 2008cc0: c0 2e e0 18 clrb [ %i3 + 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 ) 2008cc4: 80 a7 00 1d cmp %i4, %i5 2008cc8: 02 80 00 08 be 2008ce8 <_Thread_Dispatch+0x154> <== NEVER TAKEN 2008ccc: f8 26 e0 0c st %i4, [ %i3 + 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 ) 2008cd0: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 2008cd4: 80 a0 60 01 cmp %g1, 1 2008cd8: 12 bf ff c8 bne 2008bf8 <_Thread_Dispatch+0x64> 2008cdc: c2 04 e3 c4 ld [ %l3 + 0x3c4 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008ce0: 10 bf ff c6 b 2008bf8 <_Thread_Dispatch+0x64> 2008ce4: c2 27 20 78 st %g1, [ %i4 + 0x78 ] _ISR_Disable( level ); } post_switch: _Thread_Dispatch_disable_level = 0; 2008ce8: c0 26 20 60 clr [ %i0 + 0x60 ] _ISR_Enable( level ); 2008cec: 7f ff e4 9d call 2001f60 2008cf0: 01 00 00 00 nop _API_extensions_Run_postswitch(); 2008cf4: 7f ff f8 05 call 2006d08 <_API_extensions_Run_postswitch> 2008cf8: 01 00 00 00 nop } 2008cfc: 81 c7 e0 08 ret 2008d00: 81 e8 00 00 restore =============================================================================== 0200ee24 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200ee24: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200ee28: 03 00 80 5b sethi %hi(0x2016c00), %g1 200ee2c: fa 00 61 a4 ld [ %g1 + 0x1a4 ], %i5 ! 2016da4 <_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(); 200ee30: 3f 00 80 3b sethi %hi(0x200ec00), %i7 200ee34: be 17 e2 24 or %i7, 0x224, %i7 ! 200ee24 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200ee38: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200ee3c: 7f ff cc 49 call 2001f60 200ee40: 91 2a 20 08 sll %o0, 8, %o0 doneConstructors = 1; #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200ee44: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200ee48: 03 00 80 59 sethi %hi(0x2016400), %g1 doneConstructors = 1; 200ee4c: 86 10 20 01 mov 1, %g3 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200ee50: f6 08 61 2c ldub [ %g1 + 0x12c ], %i3 doneConstructors = 1; #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200ee54: 80 a0 a0 00 cmp %g2, 0 200ee58: 02 80 00 0c be 200ee88 <_Thread_Handler+0x64> 200ee5c: c6 28 61 2c stb %g3, [ %g1 + 0x12c ] #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 ); 200ee60: 39 00 80 5a sethi %hi(0x2016800), %i4 200ee64: d0 07 20 e4 ld [ %i4 + 0xe4 ], %o0 ! 20168e4 <_Thread_Allocated_fp> 200ee68: 80 a7 40 08 cmp %i5, %o0 200ee6c: 02 80 00 07 be 200ee88 <_Thread_Handler+0x64> 200ee70: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200ee74: 22 80 00 05 be,a 200ee88 <_Thread_Handler+0x64> 200ee78: fa 27 20 e4 st %i5, [ %i4 + 0xe4 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200ee7c: 7f ff ec 89 call 200a0a0 <_CPU_Context_save_fp> 200ee80: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200ee84: fa 27 20 e4 st %i5, [ %i4 + 0xe4 ] /* * 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 ); 200ee88: 7f ff ea f2 call 2009a50 <_User_extensions_Thread_begin> 200ee8c: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200ee90: 7f ff e7 9d call 2008d04 <_Thread_Enable_dispatch> 200ee94: b7 2e e0 18 sll %i3, 0x18, %i3 /* * _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 (!doneCons) /* && (volatile void *)_init) */ { 200ee98: 80 a6 e0 00 cmp %i3, 0 200ee9c: 02 80 00 0e be 200eed4 <_Thread_Handler+0xb0> 200eea0: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200eea4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200eea8: 80 a0 60 00 cmp %g1, 0 200eeac: 02 80 00 0e be 200eee4 <_Thread_Handler+0xc0> 200eeb0: 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 ) { 200eeb4: 22 80 00 11 be,a 200eef8 <_Thread_Handler+0xd4> <== ALWAYS TAKEN 200eeb8: c2 07 60 90 ld [ %i5 + 0x90 ], %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 ); 200eebc: 7f ff ea f9 call 2009aa0 <_User_extensions_Thread_exitted> 200eec0: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200eec4: 90 10 20 00 clr %o0 200eec8: 92 10 20 01 mov 1, %o1 200eecc: 7f ff e2 55 call 2007820 <_Internal_error_Occurred> 200eed0: 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 (!doneCons) /* && (volatile void *)_init) */ { INIT_NAME (); 200eed4: 40 00 1b 07 call 2015af0 <_init> 200eed8: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200eedc: 10 bf ff f3 b 200eea8 <_Thread_Handler+0x84> 200eee0: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200eee4: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200eee8: 9f c0 40 00 call %g1 200eeec: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200eef0: 10 bf ff f3 b 200eebc <_Thread_Handler+0x98> 200eef4: 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)( 200eef8: 9f c0 40 00 call %g1 200eefc: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 200ef00: 10 bf ff ef b 200eebc <_Thread_Handler+0x98> 200ef04: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 02008de0 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008de0: 9d e3 bf a0 save %sp, -96, %sp 2008de4: 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; 2008de8: c0 26 61 58 clr [ %i1 + 0x158 ] 2008dec: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008df0: 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 ) { 2008df4: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2008df8: 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 ) { 2008dfc: 80 a6 a0 00 cmp %i2, 0 2008e00: 02 80 00 6b be 2008fac <_Thread_Initialize+0x1cc> 2008e04: 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; 2008e08: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 2008e0c: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008e10: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 2008e14: d0 26 60 b8 st %o0, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 2008e18: 80 a7 20 00 cmp %i4, 0 2008e1c: 12 80 00 48 bne 2008f3c <_Thread_Initialize+0x15c> 2008e20: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e24: 39 00 80 5a sethi %hi(0x2016800), %i4 2008e28: c2 07 20 f4 ld [ %i4 + 0xf4 ], %g1 ! 20168f4 <_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; 2008e2c: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2008e30: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008e34: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008e38: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008e3c: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e40: 80 a0 60 00 cmp %g1, 0 2008e44: 12 80 00 46 bne 2008f5c <_Thread_Initialize+0x17c> 2008e48: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2008e4c: 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; 2008e50: 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; 2008e54: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008e58: e2 2e 60 a0 stb %l1, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 2008e5c: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2008e60: 80 a4 20 02 cmp %l0, 2 2008e64: 12 80 00 05 bne 2008e78 <_Thread_Initialize+0x98> 2008e68: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ] 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; 2008e6c: 03 00 80 59 sethi %hi(0x2016400), %g1 2008e70: c2 00 63 c4 ld [ %g1 + 0x3c4 ], %g1 ! 20167c4 <_Thread_Ticks_per_timeslice> 2008e74: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008e78: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2008e7c: 03 00 80 57 sethi %hi(0x2015c00), %g1 2008e80: c2 00 60 2c ld [ %g1 + 0x2c ], %g1 ! 2015c2c <_Scheduler+0x18> 2008e84: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2008e88: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 2008e8c: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2008e90: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008e94: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2008e98: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2008e9c: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2008ea0: 9f c0 40 00 call %g1 2008ea4: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2008ea8: b8 92 20 00 orcc %o0, 0, %i4 2008eac: 22 80 00 13 be,a 2008ef8 <_Thread_Initialize+0x118> 2008eb0: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2008eb4: 90 10 00 19 mov %i1, %o0 2008eb8: 40 00 01 e2 call 2009640 <_Thread_Set_priority> 2008ebc: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008ec0: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008ec4: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 2008ec8: c0 26 60 84 clr [ %i1 + 0x84 ] 2008ecc: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008ed0: 83 28 60 02 sll %g1, 2, %g1 2008ed4: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008ed8: 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 ); 2008edc: 90 10 00 19 mov %i1, %o0 2008ee0: 40 00 03 17 call 2009b3c <_User_extensions_Thread_create> 2008ee4: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008ee8: 80 8a 20 ff btst 0xff, %o0 2008eec: 32 80 00 12 bne,a 2008f34 <_Thread_Initialize+0x154> 2008ef0: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 2008ef4: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 2008ef8: 40 00 04 55 call 200a04c <_Workspace_Free> 2008efc: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 2008f00: 40 00 04 53 call 200a04c <_Workspace_Free> 2008f04: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008f08: 40 00 04 51 call 200a04c <_Workspace_Free> 2008f0c: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 2008f10: 40 00 04 4f call 200a04c <_Workspace_Free> 2008f14: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2008f18: 40 00 04 4d call 200a04c <_Workspace_Free> 2008f1c: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 2008f20: 40 00 04 4b call 200a04c <_Workspace_Free> 2008f24: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 2008f28: 40 00 02 0a call 2009750 <_Thread_Stack_Free> 2008f2c: 90 10 00 19 mov %i1, %o0 return false; } 2008f30: b0 0e 20 01 and %i0, 1, %i0 2008f34: 81 c7 e0 08 ret 2008f38: 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 ); 2008f3c: 40 00 04 3c call 200a02c <_Workspace_Allocate> 2008f40: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008f44: b6 92 20 00 orcc %o0, 0, %i3 2008f48: 32 bf ff b8 bne,a 2008e28 <_Thread_Initialize+0x48> 2008f4c: 39 00 80 5a sethi %hi(0x2016800), %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; 2008f50: 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; 2008f54: 10 bf ff e8 b 2008ef4 <_Thread_Initialize+0x114> 2008f58: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 2008f5c: 82 00 60 01 inc %g1 2008f60: 40 00 04 33 call 200a02c <_Workspace_Allocate> 2008f64: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008f68: b4 92 20 00 orcc %o0, 0, %i2 2008f6c: 02 80 00 1d be 2008fe0 <_Thread_Initialize+0x200> 2008f70: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2008f74: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 2008f78: c8 07 20 f4 ld [ %i4 + 0xf4 ], %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++ ) 2008f7c: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2008f80: 10 80 00 03 b 2008f8c <_Thread_Initialize+0x1ac> 2008f84: 82 10 20 00 clr %g1 2008f88: 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; 2008f8c: 85 28 a0 02 sll %g2, 2, %g2 2008f90: 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++ ) 2008f94: 82 00 60 01 inc %g1 2008f98: 80 a0 40 04 cmp %g1, %g4 2008f9c: 08 bf ff fb bleu 2008f88 <_Thread_Initialize+0x1a8> 2008fa0: 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; 2008fa4: 10 bf ff ad b 2008e58 <_Thread_Initialize+0x78> 2008fa8: 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 ); 2008fac: 90 10 00 19 mov %i1, %o0 2008fb0: 40 00 01 cd call 20096e4 <_Thread_Stack_Allocate> 2008fb4: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008fb8: 80 a2 00 1b cmp %o0, %i3 2008fbc: 0a 80 00 07 bcs 2008fd8 <_Thread_Initialize+0x1f8> 2008fc0: 80 a2 20 00 cmp %o0, 0 2008fc4: 02 80 00 05 be 2008fd8 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 2008fc8: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 2008fcc: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 2008fd0: 10 bf ff 90 b 2008e10 <_Thread_Initialize+0x30> 2008fd4: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] 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 */ 2008fd8: 10 bf ff d6 b 2008f30 <_Thread_Initialize+0x150> 2008fdc: 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; 2008fe0: 10 bf ff c5 b 2008ef4 <_Thread_Initialize+0x114> 2008fe4: b8 10 20 00 clr %i4 =============================================================================== 02009830 <_Thread_Tickle_timeslice>: * * Output parameters: NONE */ void _Thread_Tickle_timeslice( void ) { 2009830: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 2009834: 03 00 80 5b sethi %hi(0x2016c00), %g1 2009838: d0 00 61 a4 ld [ %g1 + 0x1a4 ], %o0 ! 2016da4 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 200983c: c2 0a 20 74 ldub [ %o0 + 0x74 ], %g1 2009840: 80 a0 60 00 cmp %g1, 0 2009844: 02 80 00 26 be 20098dc <_Thread_Tickle_timeslice+0xac> 2009848: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 200984c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2009850: 80 a0 60 00 cmp %g1, 0 2009854: 12 80 00 22 bne 20098dc <_Thread_Tickle_timeslice+0xac> 2009858: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 200985c: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 2009860: 80 a0 60 01 cmp %g1, 1 2009864: 0a 80 00 07 bcs 2009880 <_Thread_Tickle_timeslice+0x50> 2009868: 80 a0 60 02 cmp %g1, 2 200986c: 28 80 00 10 bleu,a 20098ac <_Thread_Tickle_timeslice+0x7c> 2009870: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009874: 80 a0 60 03 cmp %g1, 3 2009878: 22 80 00 04 be,a 2009888 <_Thread_Tickle_timeslice+0x58> <== ALWAYS TAKEN 200987c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009880: 81 c7 e0 08 ret 2009884: 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 ) 2009888: 82 00 7f ff add %g1, -1, %g1 200988c: 80 a0 60 00 cmp %g1, 0 2009890: 12 bf ff fc bne 2009880 <_Thread_Tickle_timeslice+0x50> 2009894: c2 22 20 78 st %g1, [ %o0 + 0x78 ] (*executing->budget_callout)( executing ); 2009898: c2 02 20 80 ld [ %o0 + 0x80 ], %g1 200989c: 9f c0 40 00 call %g1 20098a0: 01 00 00 00 nop 20098a4: 81 c7 e0 08 ret 20098a8: 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 ) { 20098ac: 82 00 7f ff add %g1, -1, %g1 20098b0: 80 a0 60 00 cmp %g1, 0 20098b4: 14 bf ff f3 bg 2009880 <_Thread_Tickle_timeslice+0x50> 20098b8: c2 22 20 78 st %g1, [ %o0 + 0x78 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 20098bc: 03 00 80 57 sethi %hi(0x2015c00), %g1 20098c0: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 ! 2015c20 <_Scheduler+0xc> 20098c4: 9f c0 40 00 call %g1 20098c8: 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; 20098cc: 03 00 80 59 sethi %hi(0x2016400), %g1 20098d0: d0 07 bf fc ld [ %fp + -4 ], %o0 20098d4: c2 00 63 c4 ld [ %g1 + 0x3c4 ], %g1 20098d8: c2 22 20 78 st %g1, [ %o0 + 0x78 ] 20098dc: 81 c7 e0 08 ret 20098e0: 81 e8 00 00 restore =============================================================================== 02009580 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009580: 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 ) 2009584: 80 a6 20 00 cmp %i0, 0 2009588: 02 80 00 13 be 20095d4 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200958c: 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 ) { 2009590: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2009594: 80 a7 20 01 cmp %i4, 1 2009598: 02 80 00 04 be 20095a8 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200959c: 01 00 00 00 nop 20095a0: 81 c7 e0 08 ret <== NOT EXECUTED 20095a4: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 20095a8: 7f ff e2 6a call 2001f50 20095ac: 01 00 00 00 nop 20095b0: ba 10 00 08 mov %o0, %i5 20095b4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 20095b8: 03 00 00 ef sethi %hi(0x3bc00), %g1 20095bc: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 20095c0: 80 88 80 01 btst %g2, %g1 20095c4: 12 80 00 06 bne 20095dc <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 20095c8: 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 ); 20095cc: 7f ff e2 65 call 2001f60 20095d0: 90 10 00 1d mov %i5, %o0 20095d4: 81 c7 e0 08 ret 20095d8: 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 ); 20095dc: 92 10 00 19 mov %i1, %o1 20095e0: 94 10 20 01 mov 1, %o2 20095e4: 40 00 0e b9 call 200d0c8 <_Thread_queue_Extract_priority_helper> 20095e8: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 20095ec: 90 10 00 18 mov %i0, %o0 20095f0: 92 10 00 19 mov %i1, %o1 20095f4: 7f ff ff 37 call 20092d0 <_Thread_queue_Enqueue_priority> 20095f8: 94 07 bf fc add %fp, -4, %o2 20095fc: 30 bf ff f4 b,a 20095cc <_Thread_queue_Requeue+0x4c> =============================================================================== 02009600 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009600: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009604: 90 10 00 18 mov %i0, %o0 2009608: 7f ff fd cb call 2008d34 <_Thread_Get> 200960c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009610: c2 07 bf fc ld [ %fp + -4 ], %g1 2009614: 80 a0 60 00 cmp %g1, 0 2009618: 12 80 00 08 bne 2009638 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 200961c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009620: 40 00 0e e3 call 200d1ac <_Thread_queue_Process_timeout> 2009624: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2009628: 03 00 80 5a sethi %hi(0x2016800), %g1 200962c: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 2016860 <_Thread_Dispatch_disable_level> 2009630: 84 00 bf ff add %g2, -1, %g2 2009634: c4 20 60 60 st %g2, [ %g1 + 0x60 ] 2009638: 81 c7 e0 08 ret 200963c: 81 e8 00 00 restore =============================================================================== 02016520 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2016520: 9d e3 bf 88 save %sp, -120, %sp 2016524: 23 00 80 f7 sethi %hi(0x203dc00), %l1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016528: a6 07 bf e8 add %fp, -24, %l3 201652c: b2 07 bf ec add %fp, -20, %i1 2016530: b6 07 bf f4 add %fp, -12, %i3 2016534: a4 07 bf f8 add %fp, -8, %l2 2016538: 21 00 80 f6 sethi %hi(0x203d800), %l0 201653c: 29 00 80 f6 sethi %hi(0x203d800), %l4 2016540: f2 27 bf e8 st %i1, [ %fp + -24 ] head->previous = NULL; 2016544: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2016548: e6 27 bf f0 st %l3, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 201654c: e4 27 bf f4 st %l2, [ %fp + -12 ] head->previous = NULL; 2016550: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2016554: f6 27 bf fc st %i3, [ %fp + -4 ] 2016558: a2 14 60 44 or %l1, 0x44, %l1 201655c: b8 06 20 30 add %i0, 0x30, %i4 2016560: a0 14 23 bc or %l0, 0x3bc, %l0 2016564: b4 06 20 68 add %i0, 0x68, %i2 2016568: a8 15 23 30 or %l4, 0x330, %l4 201656c: ae 06 20 08 add %i0, 8, %l7 2016570: ac 06 20 40 add %i0, 0x40, %l6 _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; 2016574: aa 10 20 01 mov 1, %l5 { /* * 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; 2016578: e6 26 20 78 st %l3, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 201657c: c2 04 40 00 ld [ %l1 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016580: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016584: 94 10 00 1b mov %i3, %o2 2016588: 90 10 00 1c mov %i4, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 201658c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016590: 40 00 13 24 call 201b220 <_Watchdog_Adjust_to_chain> 2016594: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016598: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 201659c: fa 04 00 00 ld [ %l0 ], %i5 /* * 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 ) { 20165a0: 80 a7 40 0a cmp %i5, %o2 20165a4: 18 80 00 2e bgu 201665c <_Timer_server_Body+0x13c> 20165a8: 92 27 40 0a sub %i5, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 20165ac: 80 a7 40 0a cmp %i5, %o2 20165b0: 0a 80 00 2f bcs 201666c <_Timer_server_Body+0x14c> 20165b4: 90 10 00 1a mov %i2, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 20165b8: fa 26 20 74 st %i5, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20165bc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20165c0: 40 00 03 17 call 201721c <_Chain_Get> 20165c4: 01 00 00 00 nop if ( timer == NULL ) { 20165c8: 92 92 20 00 orcc %o0, 0, %o1 20165cc: 02 80 00 10 be 201660c <_Timer_server_Body+0xec> 20165d0: 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 ) { 20165d4: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 20165d8: 80 a0 60 01 cmp %g1, 1 20165dc: 02 80 00 28 be 201667c <_Timer_server_Body+0x15c> 20165e0: 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 ) { 20165e4: 12 bf ff f6 bne 20165bc <_Timer_server_Body+0x9c> <== NEVER TAKEN 20165e8: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20165ec: 40 00 13 3f call 201b2e8 <_Watchdog_Insert> 20165f0: 90 10 00 1a mov %i2, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20165f4: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20165f8: 40 00 03 09 call 201721c <_Chain_Get> 20165fc: 01 00 00 00 nop if ( timer == NULL ) { 2016600: 92 92 20 00 orcc %o0, 0, %o1 2016604: 32 bf ff f5 bne,a 20165d8 <_Timer_server_Body+0xb8> <== NEVER TAKEN 2016608: 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 ); 201660c: 7f ff e2 33 call 200eed8 2016610: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2016614: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016618: 80 a0 40 19 cmp %g1, %i1 201661c: 02 80 00 1c be 201668c <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 2016620: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2016624: 7f ff e2 31 call 200eee8 <== NOT EXECUTED 2016628: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 201662c: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016630: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016634: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED 2016638: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 201663c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016640: 40 00 12 f8 call 201b220 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 2016644: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016648: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 201664c: fa 04 00 00 ld [ %l0 ], %i5 <== NOT EXECUTED /* * 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 ) { 2016650: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED 2016654: 08 bf ff d7 bleu 20165b0 <_Timer_server_Body+0x90> <== NOT EXECUTED 2016658: 92 27 40 0a sub %i5, %o2, %o1 <== NOT EXECUTED /* * 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 ); 201665c: 90 10 00 1a mov %i2, %o0 2016660: 40 00 12 f0 call 201b220 <_Watchdog_Adjust_to_chain> 2016664: 94 10 00 1b mov %i3, %o2 2016668: 30 bf ff d4 b,a 20165b8 <_Timer_server_Body+0x98> /* * 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 ); 201666c: 92 10 20 01 mov 1, %o1 2016670: 40 00 12 bd call 201b164 <_Watchdog_Adjust> 2016674: 94 22 80 1d sub %o2, %i5, %o2 2016678: 30 bf ff d0 b,a 20165b8 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201667c: 90 10 00 1c mov %i4, %o0 2016680: 40 00 13 1a call 201b2e8 <_Watchdog_Insert> 2016684: 92 02 60 10 add %o1, 0x10, %o1 2016688: 30 bf ff cd b,a 20165bc <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 201668c: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2016690: 7f ff e2 16 call 200eee8 2016694: 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 ) ) { 2016698: c2 07 bf f4 ld [ %fp + -12 ], %g1 201669c: 80 a0 40 12 cmp %g1, %l2 20166a0: 12 80 00 0c bne 20166d0 <_Timer_server_Body+0x1b0> 20166a4: 01 00 00 00 nop 20166a8: 30 80 00 13 b,a 20166f4 <_Timer_server_Body+0x1d4> 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; 20166ac: f6 20 60 04 st %i3, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 20166b0: c2 27 bf f4 st %g1, [ %fp + -12 ] * 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; 20166b4: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 20166b8: 7f ff e2 0c call 200eee8 20166bc: 01 00 00 00 nop /* * 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 ); 20166c0: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 20166c4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20166c8: 9f c0 40 00 call %g1 20166cc: d2 07 60 24 ld [ %i5 + 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 ); 20166d0: 7f ff e2 02 call 200eed8 20166d4: 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; 20166d8: fa 07 bf f4 ld [ %fp + -12 ], %i5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 20166dc: 80 a7 40 12 cmp %i5, %l2 20166e0: 32 bf ff f3 bne,a 20166ac <_Timer_server_Body+0x18c> 20166e4: c2 07 40 00 ld [ %i5 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 20166e8: 7f ff e2 00 call 200eee8 20166ec: 01 00 00 00 nop 20166f0: 30 bf ff a2 b,a 2016578 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20166f4: c0 2e 20 7c clrb [ %i0 + 0x7c ] 20166f8: c2 05 00 00 ld [ %l4 ], %g1 20166fc: 82 00 60 01 inc %g1 2016700: c2 25 00 00 st %g1, [ %l4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016704: d0 06 00 00 ld [ %i0 ], %o0 2016708: 40 00 10 ce call 201aa40 <_Thread_Set_state> 201670c: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2016710: 7f ff ff 5c call 2016480 <_Timer_server_Reset_interval_system_watchdog> 2016714: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016718: 7f ff ff 6e call 20164d0 <_Timer_server_Reset_tod_system_watchdog> 201671c: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2016720: 40 00 0e 4d call 201a054 <_Thread_Enable_dispatch> 2016724: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016728: 90 10 00 17 mov %l7, %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; 201672c: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016730: 40 00 13 55 call 201b484 <_Watchdog_Remove> 2016734: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016738: 40 00 13 53 call 201b484 <_Watchdog_Remove> 201673c: 90 10 00 16 mov %l6, %o0 2016740: 30 bf ff 8e b,a 2016578 <_Timer_server_Body+0x58> =============================================================================== 02016744 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2016744: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2016748: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 201674c: 80 a0 60 00 cmp %g1, 0 2016750: 02 80 00 05 be 2016764 <_Timer_server_Schedule_operation_method+0x20> 2016754: 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 ); 2016758: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 201675c: 40 00 02 9c call 20171cc <_Chain_Append> 2016760: 81 e8 00 00 restore 2016764: 03 00 80 f6 sethi %hi(0x203d800), %g1 2016768: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 203db30 <_Thread_Dispatch_disable_level> 201676c: 84 00 a0 01 inc %g2 2016770: c4 20 63 30 st %g2, [ %g1 + 0x330 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2016774: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2016778: 80 a0 60 01 cmp %g1, 1 201677c: 02 80 00 28 be 201681c <_Timer_server_Schedule_operation_method+0xd8> 2016780: 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 ) { 2016784: 02 80 00 04 be 2016794 <_Timer_server_Schedule_operation_method+0x50> 2016788: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 201678c: 40 00 0e 32 call 201a054 <_Thread_Enable_dispatch> 2016790: 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 ); 2016794: 7f ff e1 d1 call 200eed8 2016798: 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; 201679c: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 20167a0: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20167a4: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20167a8: 03 00 80 f6 sethi %hi(0x203d800), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 20167ac: 80 a0 80 04 cmp %g2, %g4 20167b0: 02 80 00 0d be 20167e4 <_Timer_server_Schedule_operation_method+0xa0> 20167b4: c2 00 63 bc ld [ %g1 + 0x3bc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 20167b8: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 if ( snapshot > last_snapshot ) { 20167bc: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 20167c0: 88 03 c0 03 add %o7, %g3, %g4 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 ) { 20167c4: 08 80 00 07 bleu 20167e0 <_Timer_server_Schedule_operation_method+0x9c> 20167c8: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 20167cc: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 20167d0: 80 a3 c0 03 cmp %o7, %g3 20167d4: 08 80 00 03 bleu 20167e0 <_Timer_server_Schedule_operation_method+0x9c><== NEVER TAKEN 20167d8: 88 10 20 00 clr %g4 delta_interval -= delta; 20167dc: 88 23 c0 03 sub %o7, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 20167e0: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 20167e4: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 20167e8: 7f ff e1 c0 call 200eee8 20167ec: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20167f0: 90 06 20 68 add %i0, 0x68, %o0 20167f4: 40 00 12 bd call 201b2e8 <_Watchdog_Insert> 20167f8: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167fc: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016800: 80 a0 60 00 cmp %g1, 0 2016804: 12 bf ff e2 bne 201678c <_Timer_server_Schedule_operation_method+0x48> 2016808: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 201680c: 7f ff ff 31 call 20164d0 <_Timer_server_Reset_tod_system_watchdog> 2016810: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016814: 40 00 0e 10 call 201a054 <_Thread_Enable_dispatch> 2016818: 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 ); 201681c: 7f ff e1 af call 200eed8 2016820: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016824: 05 00 80 f7 sethi %hi(0x203dc00), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016828: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201682c: c4 00 a0 44 ld [ %g2 + 0x44 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2016830: 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 ); 2016834: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2016838: 80 a0 40 03 cmp %g1, %g3 201683c: 02 80 00 08 be 201685c <_Timer_server_Schedule_operation_method+0x118> 2016840: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2016844: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 2016848: 80 a1 00 0f cmp %g4, %o7 201684c: 1a 80 00 03 bcc 2016858 <_Timer_server_Schedule_operation_method+0x114> 2016850: 86 10 20 00 clr %g3 delta_interval -= delta; 2016854: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2016858: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 201685c: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2016860: 7f ff e1 a2 call 200eee8 2016864: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2016868: 90 06 20 30 add %i0, 0x30, %o0 201686c: 40 00 12 9f call 201b2e8 <_Watchdog_Insert> 2016870: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2016874: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016878: 80 a0 60 00 cmp %g1, 0 201687c: 12 bf ff c4 bne 201678c <_Timer_server_Schedule_operation_method+0x48> 2016880: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2016884: 7f ff fe ff call 2016480 <_Timer_server_Reset_interval_system_watchdog> 2016888: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 201688c: 40 00 0d f2 call 201a054 <_Thread_Enable_dispatch> 2016890: 81 e8 00 00 restore =============================================================================== 02009aec <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 2009aec: 9d e3 bf a0 save %sp, -96, %sp 2009af0: 39 00 80 5a sethi %hi(0x2016800), %i4 2009af4: b8 17 22 48 or %i4, 0x248, %i4 ! 2016a48 <_User_extensions_List> 2009af8: 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 ); 2009afc: 80 a7 40 1c cmp %i5, %i4 2009b00: 02 80 00 0d be 2009b34 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 2009b04: 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 ) 2009b08: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009b0c: 80 a0 60 00 cmp %g1, 0 2009b10: 02 80 00 05 be 2009b24 <_User_extensions_Fatal+0x38> 2009b14: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 2009b18: 92 10 00 19 mov %i1, %o1 2009b1c: 9f c0 40 00 call %g1 2009b20: 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 ) { 2009b24: 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 ); 2009b28: 80 a7 40 1c cmp %i5, %i4 2009b2c: 32 bf ff f8 bne,a 2009b0c <_User_extensions_Fatal+0x20> 2009b30: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009b34: 81 c7 e0 08 ret 2009b38: 81 e8 00 00 restore =============================================================================== 02009998 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009998: 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; 200999c: 07 00 80 56 sethi %hi(0x2015800), %g3 20099a0: 86 10 e3 2c or %g3, 0x32c, %g3 ! 2015b2c initial_extensions = Configuration.User_extension_table; 20099a4: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3 20099a8: 3b 00 80 5a sethi %hi(0x2016800), %i5 20099ac: 09 00 80 5a sethi %hi(0x2016800), %g4 20099b0: 84 17 62 48 or %i5, 0x248, %g2 20099b4: 82 11 20 64 or %g4, 0x64, %g1 20099b8: b4 00 a0 04 add %g2, 4, %i2 20099bc: b8 00 60 04 add %g1, 4, %i4 20099c0: f4 27 62 48 st %i2, [ %i5 + 0x248 ] head->previous = NULL; 20099c4: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 20099c8: 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; 20099cc: f8 21 20 64 st %i4, [ %g4 + 0x64 ] head->previous = NULL; 20099d0: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 20099d4: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 20099d8: 80 a6 e0 00 cmp %i3, 0 20099dc: 02 80 00 1b be 2009a48 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 20099e0: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 20099e4: 83 2e a0 02 sll %i2, 2, %g1 20099e8: b9 2e a0 04 sll %i2, 4, %i4 20099ec: b8 27 00 01 sub %i4, %g1, %i4 20099f0: b8 07 00 1a add %i4, %i2, %i4 20099f4: 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 *) 20099f8: 40 00 01 9b call 200a064 <_Workspace_Allocate_or_fatal_error> 20099fc: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009a00: 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 *) 2009a04: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009a08: 40 00 18 3a call 200faf0 2009a0c: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009a10: 80 a6 a0 00 cmp %i2, 0 2009a14: 02 80 00 0d be 2009a48 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009a18: 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; 2009a1c: 92 10 00 1b mov %i3, %o1 2009a20: 94 10 20 20 mov 0x20, %o2 2009a24: 40 00 17 f7 call 200fa00 2009a28: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 2009a2c: 40 00 0e 21 call 200d2b0 <_User_extensions_Add_set> 2009a30: 90 10 00 1d mov %i5, %o0 2009a34: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009a38: 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++ ) { 2009a3c: 80 a7 00 1a cmp %i4, %i2 2009a40: 12 bf ff f7 bne 2009a1c <_User_extensions_Handler_initialization+0x84> 2009a44: b6 06 e0 20 add %i3, 0x20, %i3 2009a48: 81 c7 e0 08 ret 2009a4c: 81 e8 00 00 restore =============================================================================== 02009a50 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 2009a50: 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; 2009a54: 39 00 80 5a sethi %hi(0x2016800), %i4 2009a58: fa 07 22 48 ld [ %i4 + 0x248 ], %i5 ! 2016a48 <_User_extensions_List> 2009a5c: b8 17 22 48 or %i4, 0x248, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009a60: b8 07 20 04 add %i4, 4, %i4 2009a64: 80 a7 40 1c cmp %i5, %i4 2009a68: 02 80 00 0c be 2009a98 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 2009a6c: 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 ) 2009a70: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009a74: 80 a0 60 00 cmp %g1, 0 2009a78: 02 80 00 04 be 2009a88 <_User_extensions_Thread_begin+0x38> 2009a7c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 2009a80: 9f c0 40 00 call %g1 2009a84: 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 ) { 2009a88: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009a8c: 80 a7 40 1c cmp %i5, %i4 2009a90: 32 bf ff f9 bne,a 2009a74 <_User_extensions_Thread_begin+0x24> 2009a94: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009a98: 81 c7 e0 08 ret 2009a9c: 81 e8 00 00 restore =============================================================================== 02009b3c <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 2009b3c: 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; 2009b40: 39 00 80 5a sethi %hi(0x2016800), %i4 2009b44: fa 07 22 48 ld [ %i4 + 0x248 ], %i5 ! 2016a48 <_User_extensions_List> 2009b48: b8 17 22 48 or %i4, 0x248, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 2009b4c: b8 07 20 04 add %i4, 4, %i4 2009b50: 80 a7 40 1c cmp %i5, %i4 2009b54: 02 80 00 12 be 2009b9c <_User_extensions_Thread_create+0x60><== NEVER TAKEN 2009b58: 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)( 2009b5c: 37 00 80 5b sethi %hi(0x2016c00), %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 ) { 2009b60: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2009b64: 80 a0 60 00 cmp %g1, 0 2009b68: 02 80 00 08 be 2009b88 <_User_extensions_Thread_create+0x4c> 2009b6c: 84 16 e1 98 or %i3, 0x198, %g2 status = (*the_extension->Callouts.thread_create)( 2009b70: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009b74: 9f c0 40 00 call %g1 2009b78: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 2009b7c: 80 8a 20 ff btst 0xff, %o0 2009b80: 02 80 00 0a be 2009ba8 <_User_extensions_Thread_create+0x6c> 2009b84: 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 ) { 2009b88: 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 ); 2009b8c: 80 a7 40 1c cmp %i5, %i4 2009b90: 32 bf ff f5 bne,a 2009b64 <_User_extensions_Thread_create+0x28> 2009b94: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 2009b98: 82 10 20 01 mov 1, %g1 } 2009b9c: b0 08 60 01 and %g1, 1, %i0 2009ba0: 81 c7 e0 08 ret 2009ba4: 81 e8 00 00 restore 2009ba8: b0 08 60 01 and %g1, 1, %i0 2009bac: 81 c7 e0 08 ret 2009bb0: 81 e8 00 00 restore =============================================================================== 02009bb4 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 2009bb4: 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; 2009bb8: 39 00 80 5a sethi %hi(0x2016800), %i4 2009bbc: b8 17 22 48 or %i4, 0x248, %i4 ! 2016a48 <_User_extensions_List> 2009bc0: 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 ); 2009bc4: 80 a7 40 1c cmp %i5, %i4 2009bc8: 02 80 00 0d be 2009bfc <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 2009bcc: 37 00 80 5b sethi %hi(0x2016c00), %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 ) 2009bd0: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 2009bd4: 80 a0 60 00 cmp %g1, 0 2009bd8: 02 80 00 05 be 2009bec <_User_extensions_Thread_delete+0x38> 2009bdc: 84 16 e1 98 or %i3, 0x198, %g2 (*the_extension->Callouts.thread_delete)( 2009be0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009be4: 9f c0 40 00 call %g1 2009be8: 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 ) { 2009bec: 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 ); 2009bf0: 80 a7 40 1c cmp %i5, %i4 2009bf4: 32 bf ff f8 bne,a 2009bd4 <_User_extensions_Thread_delete+0x20> 2009bf8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 2009bfc: 81 c7 e0 08 ret 2009c00: 81 e8 00 00 restore =============================================================================== 02009aa0 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 2009aa0: 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; 2009aa4: 39 00 80 5a sethi %hi(0x2016800), %i4 2009aa8: b8 17 22 48 or %i4, 0x248, %i4 ! 2016a48 <_User_extensions_List> 2009aac: 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 ); 2009ab0: 80 a7 40 1c cmp %i5, %i4 2009ab4: 02 80 00 0c be 2009ae4 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 2009ab8: 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 ) 2009abc: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009ac0: 80 a0 60 00 cmp %g1, 0 2009ac4: 02 80 00 04 be 2009ad4 <_User_extensions_Thread_exitted+0x34> 2009ac8: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 2009acc: 9f c0 40 00 call %g1 2009ad0: 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 ) { 2009ad4: 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 ); 2009ad8: 80 a7 40 1c cmp %i5, %i4 2009adc: 32 bf ff f9 bne,a 2009ac0 <_User_extensions_Thread_exitted+0x20> 2009ae0: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009ae4: 81 c7 e0 08 ret 2009ae8: 81 e8 00 00 restore =============================================================================== 0200a940 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200a940: 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; 200a944: 39 00 80 78 sethi %hi(0x201e000), %i4 200a948: fa 07 23 98 ld [ %i4 + 0x398 ], %i5 ! 201e398 <_User_extensions_List> 200a94c: b8 17 23 98 or %i4, 0x398, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a950: b8 07 20 04 add %i4, 4, %i4 200a954: 80 a7 40 1c cmp %i5, %i4 200a958: 02 80 00 0d be 200a98c <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200a95c: 37 00 80 79 sethi %hi(0x201e400), %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 ) 200a960: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a964: 80 a0 60 00 cmp %g1, 0 200a968: 02 80 00 05 be 200a97c <_User_extensions_Thread_restart+0x3c> 200a96c: 84 16 e2 e8 or %i3, 0x2e8, %g2 (*the_extension->Callouts.thread_restart)( 200a970: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a974: 9f c0 40 00 call %g1 200a978: 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 ) { 200a97c: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a980: 80 a7 40 1c cmp %i5, %i4 200a984: 32 bf ff f8 bne,a 200a964 <_User_extensions_Thread_restart+0x24> 200a988: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a98c: 81 c7 e0 08 ret 200a990: 81 e8 00 00 restore =============================================================================== 02009c04 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 2009c04: 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; 2009c08: 39 00 80 5a sethi %hi(0x2016800), %i4 2009c0c: fa 07 22 48 ld [ %i4 + 0x248 ], %i5 ! 2016a48 <_User_extensions_List> 2009c10: b8 17 22 48 or %i4, 0x248, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009c14: b8 07 20 04 add %i4, 4, %i4 2009c18: 80 a7 40 1c cmp %i5, %i4 2009c1c: 02 80 00 0d be 2009c50 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 2009c20: 37 00 80 5b sethi %hi(0x2016c00), %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 ) 2009c24: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2009c28: 80 a0 60 00 cmp %g1, 0 2009c2c: 02 80 00 05 be 2009c40 <_User_extensions_Thread_start+0x3c> 2009c30: 84 16 e1 98 or %i3, 0x198, %g2 (*the_extension->Callouts.thread_start)( 2009c34: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009c38: 9f c0 40 00 call %g1 2009c3c: 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 ) { 2009c40: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009c44: 80 a7 40 1c cmp %i5, %i4 2009c48: 32 bf ff f8 bne,a 2009c28 <_User_extensions_Thread_start+0x24> 2009c4c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2009c50: 81 c7 e0 08 ret 2009c54: 81 e8 00 00 restore =============================================================================== 02009c58 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 2009c58: 9d e3 bf a0 save %sp, -96, %sp 2009c5c: 39 00 80 5a sethi %hi(0x2016800), %i4 2009c60: fa 07 20 64 ld [ %i4 + 0x64 ], %i5 ! 2016864 <_User_extensions_Switches_list> 2009c64: b8 17 20 64 or %i4, 0x64, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 2009c68: b8 07 20 04 add %i4, 4, %i4 2009c6c: 80 a7 40 1c cmp %i5, %i4 2009c70: 02 80 00 0a be 2009c98 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 2009c74: 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 ); 2009c78: c2 07 60 08 ld [ %i5 + 8 ], %g1 2009c7c: 90 10 00 18 mov %i0, %o0 2009c80: 9f c0 40 00 call %g1 2009c84: 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 ) { 2009c88: 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 ); 2009c8c: 80 a7 40 1c cmp %i5, %i4 2009c90: 32 bf ff fb bne,a 2009c7c <_User_extensions_Thread_switch+0x24> 2009c94: c2 07 60 08 ld [ %i5 + 8 ], %g1 2009c98: 81 c7 e0 08 ret 2009c9c: 81 e8 00 00 restore =============================================================================== 0200bc74 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200bc74: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200bc78: 7f ff dc 94 call 2002ec8 200bc7c: 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; 200bc80: 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 ); 200bc84: 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 ) ) { 200bc88: 80 a0 40 1b cmp %g1, %i3 200bc8c: 02 80 00 1e be 200bd04 <_Watchdog_Adjust+0x90> 200bc90: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200bc94: 12 80 00 1e bne 200bd0c <_Watchdog_Adjust+0x98> 200bc98: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bc9c: 80 a6 a0 00 cmp %i2, 0 200bca0: 02 80 00 19 be 200bd04 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bca4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bca8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bcac: 80 a6 80 1c cmp %i2, %i4 200bcb0: 1a 80 00 0a bcc 200bcd8 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200bcb4: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200bcb8: 10 80 00 1c b 200bd28 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200bcbc: 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 ) { 200bcc0: 02 80 00 11 be 200bd04 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bcc4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bcc8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bccc: 80 a7 00 1a cmp %i4, %i2 200bcd0: 38 80 00 16 bgu,a 200bd28 <_Watchdog_Adjust+0xb4> 200bcd4: 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; 200bcd8: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200bcdc: 7f ff dc 7f call 2002ed8 200bce0: 01 00 00 00 nop _Watchdog_Tickle( header ); 200bce4: 40 00 00 b0 call 200bfa4 <_Watchdog_Tickle> 200bce8: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200bcec: 7f ff dc 77 call 2002ec8 200bcf0: 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; 200bcf4: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200bcf8: 80 a6 c0 01 cmp %i3, %g1 200bcfc: 32 bf ff f1 bne,a 200bcc0 <_Watchdog_Adjust+0x4c> 200bd00: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200bd04: 7f ff dc 75 call 2002ed8 200bd08: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bd0c: 12 bf ff fe bne 200bd04 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bd10: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bd14: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bd18: b4 00 80 1a add %g2, %i2, %i2 200bd1c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bd20: 7f ff dc 6e call 2002ed8 200bd24: 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; 200bd28: 10 bf ff f7 b 200bd04 <_Watchdog_Adjust+0x90> 200bd2c: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 02009e3c <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009e3c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009e40: 7f ff e0 44 call 2001f50 2009e44: 01 00 00 00 nop previous_state = the_watchdog->state; 2009e48: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 2009e4c: 80 a7 60 01 cmp %i5, 1 2009e50: 02 80 00 2a be 2009ef8 <_Watchdog_Remove+0xbc> 2009e54: 03 00 80 5a sethi %hi(0x2016800), %g1 2009e58: 1a 80 00 09 bcc 2009e7c <_Watchdog_Remove+0x40> 2009e5c: 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; 2009e60: 03 00 80 5a sethi %hi(0x2016800), %g1 2009e64: c2 00 61 74 ld [ %g1 + 0x174 ], %g1 ! 2016974 <_Watchdog_Ticks_since_boot> 2009e68: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 2009e6c: 7f ff e0 3d call 2001f60 2009e70: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 2009e74: 81 c7 e0 08 ret 2009e78: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 2009e7c: 18 bf ff fa bgu 2009e64 <_Watchdog_Remove+0x28> <== NEVER TAKEN 2009e80: 03 00 80 5a sethi %hi(0x2016800), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 2009e84: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009e88: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 2009e8c: c4 00 40 00 ld [ %g1 ], %g2 2009e90: 80 a0 a0 00 cmp %g2, 0 2009e94: 02 80 00 07 be 2009eb0 <_Watchdog_Remove+0x74> 2009e98: 05 00 80 5a sethi %hi(0x2016800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 2009e9c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009ea0: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2009ea4: 84 00 c0 02 add %g3, %g2, %g2 2009ea8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 2009eac: 05 00 80 5a sethi %hi(0x2016800), %g2 2009eb0: c4 00 a1 70 ld [ %g2 + 0x170 ], %g2 ! 2016970 <_Watchdog_Sync_count> 2009eb4: 80 a0 a0 00 cmp %g2, 0 2009eb8: 22 80 00 07 be,a 2009ed4 <_Watchdog_Remove+0x98> 2009ebc: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 2009ec0: 05 00 80 5b sethi %hi(0x2016c00), %g2 2009ec4: c6 00 a1 a0 ld [ %g2 + 0x1a0 ], %g3 ! 2016da0 <_Per_CPU_Information+0x8> 2009ec8: 05 00 80 5a sethi %hi(0x2016800), %g2 2009ecc: c6 20 a1 08 st %g3, [ %g2 + 0x108 ] ! 2016908 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2009ed0: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 2009ed4: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 2009ed8: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009edc: 03 00 80 5a sethi %hi(0x2016800), %g1 2009ee0: c2 00 61 74 ld [ %g1 + 0x174 ], %g1 ! 2016974 <_Watchdog_Ticks_since_boot> 2009ee4: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 2009ee8: 7f ff e0 1e call 2001f60 2009eec: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 2009ef0: 81 c7 e0 08 ret 2009ef4: 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; 2009ef8: c2 00 61 74 ld [ %g1 + 0x174 ], %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; 2009efc: 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; 2009f00: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 2009f04: 7f ff e0 17 call 2001f60 2009f08: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 2009f0c: 81 c7 e0 08 ret 2009f10: 81 e8 00 00 restore =============================================================================== 0200b468 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b468: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b46c: 7f ff dd 6a call 2002a14 200b470: 01 00 00 00 nop 200b474: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200b478: 11 00 80 75 sethi %hi(0x201d400), %o0 200b47c: 94 10 00 19 mov %i1, %o2 200b480: 92 10 00 18 mov %i0, %o1 200b484: 7f ff e4 7e call 200467c 200b488: 90 12 20 88 or %o0, 0x88, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b48c: 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 ); 200b490: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200b494: 80 a7 00 19 cmp %i4, %i1 200b498: 02 80 00 0f be 200b4d4 <_Watchdog_Report_chain+0x6c> 200b49c: 11 00 80 75 sethi %hi(0x201d400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b4a0: 92 10 00 1c mov %i4, %o1 200b4a4: 40 00 00 0f call 200b4e0 <_Watchdog_Report> 200b4a8: 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 ) 200b4ac: 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 ) ; 200b4b0: 80 a7 00 19 cmp %i4, %i1 200b4b4: 12 bf ff fc bne 200b4a4 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b4b8: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b4bc: 11 00 80 75 sethi %hi(0x201d400), %o0 200b4c0: 92 10 00 18 mov %i0, %o1 200b4c4: 7f ff e4 6e call 200467c 200b4c8: 90 12 20 a0 or %o0, 0xa0, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b4cc: 7f ff dd 56 call 2002a24 200b4d0: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b4d4: 7f ff e4 6a call 200467c 200b4d8: 90 12 20 b0 or %o0, 0xb0, %o0 200b4dc: 30 bf ff fc b,a 200b4cc <_Watchdog_Report_chain+0x64> =============================================================================== 02006434 : int adjtime( struct timeval *delta, struct timeval *olddelta ) { 2006434: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2006438: ba 96 20 00 orcc %i0, 0, %i5 200643c: 02 80 00 53 be 2006588 2006440: 03 00 03 d0 sethi %hi(0xf4000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 2006444: c4 07 60 04 ld [ %i5 + 4 ], %g2 2006448: 82 10 62 3f or %g1, 0x23f, %g1 200644c: 80 a0 80 01 cmp %g2, %g1 2006450: 18 80 00 4e bgu 2006588 2006454: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 2006458: 22 80 00 06 be,a 2006470 200645c: c2 07 40 00 ld [ %i5 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 2006460: c0 26 60 04 clr [ %i1 + 4 ] 2006464: 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; 2006468: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 200646c: c2 07 40 00 ld [ %i5 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2006470: 07 00 80 75 sethi %hi(0x201d400), %g3 2006474: c8 00 e3 d8 ld [ %g3 + 0x3d8 ], %g4 ! 201d7d8 olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2006478: 9f 28 60 08 sll %g1, 8, %o7 200647c: 87 28 60 03 sll %g1, 3, %g3 2006480: 86 23 c0 03 sub %o7, %g3, %g3 2006484: 9f 28 e0 06 sll %g3, 6, %o7 2006488: 86 23 c0 03 sub %o7, %g3, %g3 200648c: 82 00 c0 01 add %g3, %g1, %g1 2006490: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 2006494: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2006498: 80 a0 80 04 cmp %g2, %g4 200649c: 0a 80 00 39 bcs 2006580 20064a0: b0 10 20 00 clr %i0 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 20064a4: 03 00 80 79 sethi %hi(0x201e400), %g1 20064a8: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201e630 <_Thread_Dispatch_disable_level> 20064ac: 84 00 a0 01 inc %g2 20064b0: c4 20 62 30 st %g2, [ %g1 + 0x230 ] * This prevents context switches while we are adjusting the TOD */ _Thread_Disable_dispatch(); _TOD_Get( &ts ); 20064b4: 40 00 06 67 call 2007e50 <_TOD_Get> 20064b8: 90 07 bf f8 add %fp, -8, %o0 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064bc: c2 07 60 04 ld [ %i5 + 4 ], %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064c0: c8 07 bf f8 ld [ %fp + -8 ], %g4 20064c4: c4 07 40 00 ld [ %i5 ], %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064c8: 87 28 60 02 sll %g1, 2, %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064cc: 84 01 00 02 add %g4, %g2, %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064d0: 89 28 60 07 sll %g1, 7, %g4 20064d4: 86 21 00 03 sub %g4, %g3, %g3 20064d8: 82 00 c0 01 add %g3, %g1, %g1 20064dc: c6 07 bf fc ld [ %fp + -4 ], %g3 20064e0: 83 28 60 03 sll %g1, 3, %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064e4: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064e8: 82 00 40 03 add %g1, %g3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20064ec: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 20064f0: 86 10 e1 ff or %g3, 0x1ff, %g3 ! 3b9ac9ff 20064f4: 80 a0 40 03 cmp %g1, %g3 20064f8: 08 80 00 0a bleu 2006520 20064fc: c2 27 bf fc st %g1, [ %fp + -4 ] ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2006500: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006504: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 2006508: 82 00 40 04 add %g1, %g4, %g1 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 ) { 200650c: 80 a0 40 03 cmp %g1, %g3 2006510: 18 bf ff fe bgu 2006508 <== NEVER TAKEN 2006514: 84 00 a0 01 inc %g2 2006518: c2 27 bf fc st %g1, [ %fp + -4 ] 200651c: c4 27 bf f8 st %g2, [ %fp + -8 ] 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) ) { 2006520: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006524: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 2006528: 80 a0 40 04 cmp %g1, %g4 200652c: 18 80 00 0a bgu 2006554 <== NEVER TAKEN 2006530: c4 07 bf f8 ld [ %fp + -8 ], %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2006534: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 2006538: 86 10 e2 00 or %g3, 0x200, %g3 ! 3b9aca00 200653c: 82 00 40 03 add %g1, %g3, %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) ) { 2006540: 80 a0 40 04 cmp %g1, %g4 2006544: 08 bf ff fe bleu 200653c 2006548: 84 00 bf ff add %g2, -1, %g2 200654c: c2 27 bf fc st %g1, [ %fp + -4 ] 2006550: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; ts.tv_sec--; } _TOD_Set( &ts ); 2006554: 40 00 06 69 call 2007ef8 <_TOD_Set> 2006558: 90 07 bf f8 add %fp, -8, %o0 _Thread_Enable_dispatch(); 200655c: 40 00 0c cf call 2009898 <_Thread_Enable_dispatch> 2006560: b0 10 20 00 clr %i0 /* set the user's output */ if ( olddelta ) 2006564: 80 a6 60 00 cmp %i1, 0 2006568: 02 80 00 0c be 2006598 200656c: 01 00 00 00 nop *olddelta = *delta; 2006570: c2 07 40 00 ld [ %i5 ], %g1 2006574: c2 26 40 00 st %g1, [ %i1 ] 2006578: c2 07 60 04 ld [ %i5 + 4 ], %g1 200657c: c2 26 60 04 st %g1, [ %i1 + 4 ] return 0; } 2006580: 81 c7 e0 08 ret 2006584: 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 ); 2006588: 40 00 26 1f call 200fe04 <__errno> 200658c: b0 10 3f ff mov -1, %i0 2006590: 82 10 20 16 mov 0x16, %g1 2006594: c2 22 00 00 st %g1, [ %o0 ] 2006598: 81 c7 e0 08 ret 200659c: 81 e8 00 00 restore =============================================================================== 02006ca4 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2006ca4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2006ca8: 3b 00 80 66 sethi %hi(0x2019800), %i5 2006cac: 40 00 04 8f call 2007ee8 2006cb0: 90 17 61 0c or %i5, 0x10c, %o0 ! 201990c if (fcntl (fildes, F_GETFD) < 0) { 2006cb4: 90 10 00 18 mov %i0, %o0 2006cb8: 40 00 1d f8 call 200e498 2006cbc: 92 10 20 01 mov 1, %o1 2006cc0: 80 a2 20 00 cmp %o0, 0 2006cc4: 06 80 00 6c bl 2006e74 2006cc8: 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) { 2006ccc: 02 80 00 3b be 2006db8 2006cd0: 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) { 2006cd4: f8 06 40 00 ld [ %i1 ], %i4 2006cd8: 80 a7 00 18 cmp %i4, %i0 2006cdc: 12 80 00 2f bne 2006d98 2006ce0: 90 17 61 0c or %i5, 0x10c, %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); 2006ce4: 92 10 00 1c mov %i4, %o1 2006ce8: 11 00 80 66 sethi %hi(0x2019800), %o0 2006cec: 94 10 20 00 clr %o2 2006cf0: 40 00 00 cc call 2007020 2006cf4: 90 12 21 54 or %o0, 0x154, %o0 if (r_chain == NULL) { 2006cf8: b0 92 20 00 orcc %o0, 0, %i0 2006cfc: 22 80 00 0f be,a 2006d38 2006d00: ba 17 61 0c or %i5, 0x10c, %i5 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006d04: b8 06 20 1c add %i0, 0x1c, %i4 2006d08: 40 00 04 78 call 2007ee8 2006d0c: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006d10: 92 10 00 19 mov %i1, %o1 2006d14: 40 00 01 e4 call 20074a4 2006d18: 90 06 20 08 add %i0, 8, %o0 2006d1c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2006d20: 40 00 04 92 call 2007f68 2006d24: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006d28: 40 00 04 90 call 2007f68 2006d2c: 90 17 61 0c or %i5, 0x10c, %o0 return result; } return AIO_ALLDONE; } 2006d30: 81 c7 e0 08 ret 2006d34: 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)) { 2006d38: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006d3c: 82 07 60 58 add %i5, 0x58, %g1 2006d40: 80 a0 80 01 cmp %g2, %g1 2006d44: 02 80 00 0f be 2006d80 <== NEVER TAKEN 2006d48: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006d4c: 92 10 00 1c mov %i4, %o1 2006d50: 40 00 00 b4 call 2007020 2006d54: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006d58: 80 a2 20 00 cmp %o0, 0 2006d5c: 02 80 00 0e be 2006d94 2006d60: 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); 2006d64: 40 00 01 d0 call 20074a4 2006d68: 90 02 20 08 add %o0, 8, %o0 2006d6c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006d70: 40 00 04 7e call 2007f68 2006d74: 90 10 00 1d mov %i5, %o0 return result; 2006d78: 81 c7 e0 08 ret 2006d7c: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006d80: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006d84: 40 00 04 79 call 2007f68 2006d88: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006d8c: 81 c7 e0 08 ret 2006d90: 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); 2006d94: 90 10 00 1d mov %i5, %o0 2006d98: 40 00 04 74 call 2007f68 2006d9c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2006da0: 40 00 2c 10 call 2011de0 <__errno> 2006da4: 01 00 00 00 nop 2006da8: 82 10 20 16 mov 0x16, %g1 ! 16 2006dac: c2 22 00 00 st %g1, [ %o0 ] 2006db0: 81 c7 e0 08 ret 2006db4: 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); 2006db8: 11 00 80 66 sethi %hi(0x2019800), %o0 2006dbc: 94 10 20 00 clr %o2 2006dc0: 40 00 00 98 call 2007020 2006dc4: 90 12 21 54 or %o0, 0x154, %o0 if (r_chain == NULL) { 2006dc8: b8 92 20 00 orcc %o0, 0, %i4 2006dcc: 02 80 00 0f be 2006e08 2006dd0: b2 07 20 1c add %i4, 0x1c, %i1 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006dd4: 40 00 04 45 call 2007ee8 2006dd8: 90 10 00 19 mov %i1, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006ddc: 40 00 0a ff call 20099d8 <_Chain_Extract> 2006de0: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006de4: 40 00 01 9c call 2007454 2006de8: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2006dec: 40 00 04 5f call 2007f68 2006df0: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006df4: 90 17 61 0c or %i5, 0x10c, %o0 2006df8: 40 00 04 5c call 2007f68 2006dfc: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006e00: 81 c7 e0 08 ret 2006e04: 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; 2006e08: ba 17 61 0c or %i5, 0x10c, %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)) { 2006e0c: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006e10: 82 07 60 58 add %i5, 0x58, %g1 2006e14: 80 a0 80 01 cmp %g2, %g1 2006e18: 02 bf ff da be 2006d80 <== NEVER TAKEN 2006e1c: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006e20: 92 10 00 18 mov %i0, %o1 2006e24: 40 00 00 7f call 2007020 2006e28: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006e2c: b8 92 20 00 orcc %o0, 0, %i4 2006e30: 22 bf ff d5 be,a 2006d84 2006e34: 90 10 00 1d mov %i5, %o0 2006e38: 40 00 0a e8 call 20099d8 <_Chain_Extract> 2006e3c: 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); 2006e40: 40 00 01 85 call 2007454 2006e44: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006e48: 40 00 03 7e call 2007c40 2006e4c: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 2006e50: 40 00 02 9e call 20078c8 2006e54: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006e58: 7f ff f2 03 call 2003664 2006e5c: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2006e60: 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); 2006e64: 40 00 04 41 call 2007f68 2006e68: 90 10 00 1d mov %i5, %o0 return AIO_CANCELED; 2006e6c: 81 c7 e0 08 ret 2006e70: 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); 2006e74: 40 00 04 3d call 2007f68 2006e78: 90 17 61 0c or %i5, 0x10c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2006e7c: 40 00 2b d9 call 2011de0 <__errno> 2006e80: b0 10 3f ff mov -1, %i0 2006e84: 82 10 20 09 mov 9, %g1 2006e88: c2 22 00 00 st %g1, [ %o0 ] 2006e8c: 81 c7 e0 08 ret 2006e90: 81 e8 00 00 restore =============================================================================== 02006e9c : int aio_fsync( int op, struct aiocb *aiocbp ) { 2006e9c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2006ea0: 03 00 00 08 sethi %hi(0x2000), %g1 2006ea4: 80 a6 00 01 cmp %i0, %g1 2006ea8: 12 80 00 14 bne 2006ef8 2006eac: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006eb0: d0 06 40 00 ld [ %i1 ], %o0 2006eb4: 40 00 1d 79 call 200e498 2006eb8: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2006ebc: 90 0a 20 03 and %o0, 3, %o0 2006ec0: 90 02 3f ff add %o0, -1, %o0 2006ec4: 80 a2 20 01 cmp %o0, 1 2006ec8: 18 80 00 0c bgu 2006ef8 2006ecc: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2006ed0: 7f ff f3 70 call 2003c90 2006ed4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2006ed8: 80 a2 20 00 cmp %o0, 0 2006edc: 02 80 00 06 be 2006ef4 <== NEVER TAKEN 2006ee0: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2006ee4: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2006ee8: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2006eec: 40 00 01 8a call 2007514 2006ef0: 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); 2006ef4: ba 10 20 0b mov 0xb, %i5 2006ef8: 82 10 3f ff mov -1, %g1 2006efc: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2006f00: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2006f04: 40 00 2b b7 call 2011de0 <__errno> 2006f08: b0 10 3f ff mov -1, %i0 2006f0c: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2006f10: 81 c7 e0 08 ret 2006f14: 81 e8 00 00 restore =============================================================================== 020076f8 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20076f8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20076fc: d0 06 00 00 ld [ %i0 ], %o0 2007700: 40 00 1b 66 call 200e498 2007704: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007708: 90 0a 20 03 and %o0, 3, %o0 200770c: 80 a2 20 02 cmp %o0, 2 2007710: 12 80 00 1b bne 200777c 2007714: 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) 2007718: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200771c: 80 a0 60 00 cmp %g1, 0 2007720: 12 80 00 0f bne 200775c 2007724: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007728: c2 06 20 08 ld [ %i0 + 8 ], %g1 200772c: 80 a0 60 00 cmp %g1, 0 2007730: 06 80 00 0c bl 2007760 2007734: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007738: 7f ff f1 56 call 2003c90 200773c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007740: 80 a2 20 00 cmp %o0, 0 2007744: 02 80 00 12 be 200778c <== NEVER TAKEN 2007748: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 200774c: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2007750: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007754: 7f ff ff 70 call 2007514 2007758: 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); 200775c: 82 10 3f ff mov -1, %g1 2007760: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007764: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2007768: 40 00 29 9e call 2011de0 <__errno> 200776c: b0 10 3f ff mov -1, %i0 2007770: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2007774: 81 c7 e0 08 ret 2007778: 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))) 200777c: 02 bf ff e7 be 2007718 <== NEVER TAKEN 2007780: 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); 2007784: 10 bf ff f7 b 2007760 2007788: 82 10 3f ff mov -1, %g1 200778c: 10 bf ff f4 b 200775c <== NOT EXECUTED 2007790: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 0200779c : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 200779c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20077a0: d0 06 00 00 ld [ %i0 ], %o0 20077a4: 40 00 1b 3d call 200e498 20077a8: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20077ac: 90 0a 20 03 and %o0, 3, %o0 20077b0: 90 02 3f ff add %o0, -1, %o0 20077b4: 80 a2 20 01 cmp %o0, 1 20077b8: 18 80 00 14 bgu 2007808 20077bc: 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) 20077c0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20077c4: 80 a0 60 00 cmp %g1, 0 20077c8: 12 80 00 10 bne 2007808 20077cc: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20077d0: c2 06 20 08 ld [ %i0 + 8 ], %g1 20077d4: 80 a0 60 00 cmp %g1, 0 20077d8: 06 80 00 0d bl 200780c 20077dc: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20077e0: 7f ff f1 2c call 2003c90 20077e4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20077e8: 80 a2 20 00 cmp %o0, 0 20077ec: 02 80 00 06 be 2007804 <== NEVER TAKEN 20077f0: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20077f4: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 20077f8: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20077fc: 7f ff ff 46 call 2007514 2007800: 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); 2007804: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2007808: 82 10 3f ff mov -1, %g1 200780c: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007810: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2007814: 40 00 29 73 call 2011de0 <__errno> 2007818: b0 10 3f ff mov -1, %i0 200781c: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2007820: 81 c7 e0 08 ret 2007824: 81 e8 00 00 restore =============================================================================== 0200629c : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 200629c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 20062a0: 80 a6 60 00 cmp %i1, 0 20062a4: 02 80 00 20 be 2006324 20062a8: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 20062ac: 02 80 00 19 be 2006310 20062b0: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 20062b4: 02 80 00 12 be 20062fc <== NEVER TAKEN 20062b8: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { 20062bc: 02 80 00 10 be 20062fc 20062c0: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) 20062c4: 02 80 00 08 be 20062e4 20062c8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 20062cc: 40 00 28 57 call 2010428 <__errno> 20062d0: b0 10 3f ff mov -1, %i0 ! ffffffff 20062d4: 82 10 20 16 mov 0x16, %g1 20062d8: c2 22 00 00 st %g1, [ %o0 ] return 0; } 20062dc: 81 c7 e0 08 ret 20062e0: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); 20062e4: 40 00 28 51 call 2010428 <__errno> 20062e8: b0 10 3f ff mov -1, %i0 20062ec: 82 10 20 58 mov 0x58, %g1 20062f0: c2 22 00 00 st %g1, [ %o0 ] 20062f4: 81 c7 e0 08 ret 20062f8: 81 e8 00 00 restore } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { _TOD_Get_uptime_as_timespec( tp ); 20062fc: 90 10 00 19 mov %i1, %o0 2006300: 40 00 08 31 call 20083c4 <_TOD_Get_uptime_as_timespec> 2006304: b0 10 20 00 clr %i0 return 0; 2006308: 81 c7 e0 08 ret 200630c: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); 2006310: 90 10 00 19 mov %i1, %o0 2006314: 40 00 08 11 call 2008358 <_TOD_Get> 2006318: b0 10 20 00 clr %i0 return 0; 200631c: 81 c7 e0 08 ret 2006320: 81 e8 00 00 restore clockid_t clock_id, struct timespec *tp ) { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006324: 40 00 28 41 call 2010428 <__errno> 2006328: b0 10 3f ff mov -1, %i0 200632c: 82 10 20 16 mov 0x16, %g1 2006330: c2 22 00 00 st %g1, [ %o0 ] 2006334: 81 c7 e0 08 ret 2006338: 81 e8 00 00 restore =============================================================================== 0200633c : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 200633c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2006340: 80 a6 60 00 cmp %i1, 0 2006344: 02 80 00 24 be 20063d4 <== NEVER TAKEN 2006348: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 200634c: 02 80 00 0c be 200637c 2006350: 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 ) 2006354: 02 80 00 1a be 20063bc 2006358: 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 ) 200635c: 02 80 00 18 be 20063bc 2006360: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2006364: 40 00 28 31 call 2010428 <__errno> 2006368: b0 10 3f ff mov -1, %i0 ! ffffffff 200636c: 82 10 20 16 mov 0x16, %g1 2006370: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2006374: 81 c7 e0 08 ret 2006378: 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 ) 200637c: c4 06 40 00 ld [ %i1 ], %g2 2006380: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2006384: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2006388: 80 a0 80 01 cmp %g2, %g1 200638c: 08 80 00 12 bleu 20063d4 2006390: 03 00 80 7c sethi %hi(0x201f000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2006394: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201f1c0 <_Thread_Dispatch_disable_level> 2006398: 84 00 a0 01 inc %g2 200639c: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); 20063a0: 90 10 00 19 mov %i1, %o0 20063a4: 40 00 08 20 call 2008424 <_TOD_Set> 20063a8: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20063ac: 40 00 0e 86 call 2009dc4 <_Thread_Enable_dispatch> 20063b0: 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; 20063b4: 81 c7 e0 08 ret 20063b8: 81 e8 00 00 restore else if ( clock_id == CLOCK_PROCESS_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); 20063bc: 40 00 28 1b call 2010428 <__errno> 20063c0: b0 10 3f ff mov -1, %i0 20063c4: 82 10 20 58 mov 0x58, %g1 20063c8: c2 22 00 00 st %g1, [ %o0 ] 20063cc: 81 c7 e0 08 ret 20063d0: 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 ); 20063d4: 40 00 28 15 call 2010428 <__errno> 20063d8: b0 10 3f ff mov -1, %i0 20063dc: 82 10 20 16 mov 0x16, %g1 20063e0: c2 22 00 00 st %g1, [ %o0 ] 20063e4: 81 c7 e0 08 ret 20063e8: 81 e8 00 00 restore =============================================================================== 020234bc : int killinfo( pid_t pid, int sig, const union sigval *value ) { 20234bc: 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() ) 20234c0: 7f ff ff 3a call 20231a8 20234c4: 01 00 00 00 nop 20234c8: 80 a2 00 18 cmp %o0, %i0 20234cc: 12 80 00 ae bne 2023784 20234d0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 20234d4: 02 80 00 b2 be 202379c 20234d8: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 20234dc: 80 a0 60 1f cmp %g1, 0x1f 20234e0: 18 80 00 af bgu 202379c 20234e4: 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 ) 20234e8: 39 00 80 9d sethi %hi(0x2027400), %i4 20234ec: a1 2e 60 04 sll %i1, 4, %l0 20234f0: b8 17 22 c0 or %i4, 0x2c0, %i4 20234f4: 84 24 00 1b sub %l0, %i3, %g2 20234f8: 84 07 00 02 add %i4, %g2, %g2 20234fc: c4 00 a0 08 ld [ %g2 + 8 ], %g2 2023500: 80 a0 a0 01 cmp %g2, 1 2023504: 02 80 00 3e be 20235fc 2023508: 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 ) ) 202350c: 80 a6 60 04 cmp %i1, 4 2023510: 02 80 00 3d be 2023604 2023514: 80 a6 60 08 cmp %i1, 8 2023518: 02 80 00 3b be 2023604 202351c: 80 a6 60 0b cmp %i1, 0xb 2023520: 02 80 00 39 be 2023604 2023524: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 2023528: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 202352c: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 2023530: 80 a6 a0 00 cmp %i2, 0 2023534: 02 80 00 3a be 202361c 2023538: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 202353c: c2 06 80 00 ld [ %i2 ], %g1 2023540: c2 27 bf fc st %g1, [ %fp + -4 ] 2023544: 03 00 80 9c sethi %hi(0x2027000), %g1 2023548: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 2027130 <_Thread_Dispatch_disable_level> 202354c: 84 00 a0 01 inc %g2 2023550: c4 20 61 30 st %g2, [ %g1 + 0x130 ] /* * 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; 2023554: 03 00 80 9d sethi %hi(0x2027400), %g1 2023558: d0 00 62 74 ld [ %g1 + 0x274 ], %o0 ! 2027674 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 202355c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 2023560: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 2023564: 80 af 40 01 andncc %i5, %g1, %g0 2023568: 12 80 00 16 bne 20235c0 202356c: 07 00 80 9e sethi %hi(0x2027800), %g3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2023570: d0 00 e0 4c ld [ %g3 + 0x4c ], %o0 ! 202784c <_POSIX_signals_Wait_queue> 2023574: 86 10 e0 4c or %g3, 0x4c, %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 ); 2023578: 86 00 e0 04 add %g3, 4, %g3 202357c: 80 a2 00 03 cmp %o0, %g3 2023580: 32 80 00 0d bne,a 20235b4 2023584: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 2023588: 10 80 00 27 b 2023624 202358c: 03 00 80 98 sethi %hi(0x2026000), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 2023590: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1 2023594: 80 af 40 01 andncc %i5, %g1, %g0 2023598: 12 80 00 0b bne 20235c4 202359c: 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 ) { 20235a0: 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 ); 20235a4: 80 a2 00 03 cmp %o0, %g3 20235a8: 02 80 00 1f be 2023624 <== ALWAYS TAKEN 20235ac: 03 00 80 98 sethi %hi(0x2026000), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 20235b0: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 20235b4: 80 8f 40 01 btst %i5, %g1 20235b8: 02 bf ff f6 be 2023590 20235bc: 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 ) ) { 20235c0: 92 10 00 19 mov %i1, %o1 20235c4: 40 00 00 8d call 20237f8 <_POSIX_signals_Unblock_thread> 20235c8: 94 07 bf f4 add %fp, -12, %o2 20235cc: 80 8a 20 ff btst 0xff, %o0 20235d0: 12 80 00 5a bne 2023738 20235d4: 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 ); 20235d8: 40 00 00 7f call 20237d4 <_POSIX_signals_Set_process_signals> 20235dc: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 20235e0: b6 24 00 1b sub %l0, %i3, %i3 20235e4: c2 07 00 1b ld [ %i4 + %i3 ], %g1 20235e8: 80 a0 60 02 cmp %g1, 2 20235ec: 02 80 00 57 be 2023748 20235f0: 11 00 80 9e sethi %hi(0x2027800), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 20235f4: 7f ff ac be call 200e8ec <_Thread_Enable_dispatch> 20235f8: b0 10 20 00 clr %i0 return 0; } 20235fc: 81 c7 e0 08 ret 2023600: 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 ); 2023604: 40 00 01 0f call 2023a40 2023608: 01 00 00 00 nop 202360c: 40 00 00 d2 call 2023954 2023610: 92 10 00 19 mov %i1, %o1 2023614: 81 c7 e0 08 ret 2023618: 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; 202361c: 10 bf ff ca b 2023544 2023620: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 2023624: c8 08 62 cc ldub [ %g1 + 0x2cc ], %g4 2023628: 1b 00 80 9c sethi %hi(0x2027000), %o5 202362c: 88 01 20 01 inc %g4 2023630: 9a 13 60 a0 or %o5, 0xa0, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 2023634: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2023638: 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); 202363c: 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 ] ) 2023640: c2 03 40 00 ld [ %o5 ], %g1 2023644: 80 a0 60 00 cmp %g1, 0 2023648: 22 80 00 31 be,a 202370c <== NEVER TAKEN 202364c: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 2023650: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 2023654: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2023658: 80 a6 a0 00 cmp %i2, 0 202365c: 02 80 00 2b be 2023708 2023660: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 2023664: 82 10 20 01 mov 1, %g1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2023668: 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 ]; 202366c: c4 06 00 02 ld [ %i0 + %g2 ], %g2 if ( !the_thread ) 2023670: 80 a0 a0 00 cmp %g2, 0 2023674: 22 80 00 22 be,a 20236fc 2023678: 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 ) 202367c: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 2023680: 80 a0 c0 04 cmp %g3, %g4 2023684: 38 80 00 1e bgu,a 20236fc 2023688: 82 00 60 01 inc %g1 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 202368c: de 00 a1 5c ld [ %g2 + 0x15c ], %o7 2023690: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 2023694: 80 af 40 0f andncc %i5, %o7, %g0 2023698: 22 80 00 19 be,a 20236fc 202369c: 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 ) { 20236a0: 80 a0 c0 04 cmp %g3, %g4 20236a4: 2a 80 00 14 bcs,a 20236f4 20236a8: 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 ) ) { 20236ac: 80 a2 20 00 cmp %o0, 0 20236b0: 22 80 00 13 be,a 20236fc <== NEVER TAKEN 20236b4: 82 00 60 01 inc %g1 <== NOT EXECUTED 20236b8: de 02 20 10 ld [ %o0 + 0x10 ], %o7 20236bc: 80 a3 e0 00 cmp %o7, 0 20236c0: 22 80 00 0f be,a 20236fc <== NEVER TAKEN 20236c4: 82 00 60 01 inc %g1 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 20236c8: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3 20236cc: 80 a2 e0 00 cmp %o3, 0 20236d0: 22 80 00 09 be,a 20236f4 20236d4: 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) ) { 20236d8: 80 8b c0 0a btst %o7, %o2 20236dc: 32 80 00 08 bne,a 20236fc 20236e0: 82 00 60 01 inc %g1 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 20236e4: 80 8a c0 0a btst %o3, %o2 20236e8: 22 80 00 05 be,a 20236fc 20236ec: 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 ) ) { 20236f0: 88 10 00 03 mov %g3, %g4 20236f4: 90 10 00 02 mov %g2, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 20236f8: 82 00 60 01 inc %g1 20236fc: 80 a6 80 01 cmp %i2, %g1 2023700: 1a bf ff db bcc 202366c 2023704: 85 28 60 02 sll %g1, 2, %g2 2023708: 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++) { 202370c: 80 a3 40 0c cmp %o5, %o4 2023710: 32 bf ff cd bne,a 2023644 2023714: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 2023718: 80 a2 20 00 cmp %o0, 0 202371c: 02 bf ff af be 20235d8 2023720: 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 ) ) { 2023724: 40 00 00 35 call 20237f8 <_POSIX_signals_Unblock_thread> 2023728: 94 07 bf f4 add %fp, -12, %o2 202372c: 80 8a 20 ff btst 0xff, %o0 2023730: 02 bf ff aa be 20235d8 <== ALWAYS TAKEN 2023734: 01 00 00 00 nop _Thread_Enable_dispatch(); 2023738: 7f ff ac 6d call 200e8ec <_Thread_Enable_dispatch> 202373c: b0 10 20 00 clr %i0 ! 0 return 0; 2023740: 81 c7 e0 08 ret 2023744: 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 *) 2023748: 7f ff a4 c4 call 200ca58 <_Chain_Get> 202374c: 90 12 20 40 or %o0, 0x40, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 2023750: 92 92 20 00 orcc %o0, 0, %o1 2023754: 02 80 00 18 be 20237b4 2023758: 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 ); 202375c: 11 00 80 9e sethi %hi(0x2027800), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 2023760: c2 22 60 08 st %g1, [ %o1 + 8 ] 2023764: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 2023768: 90 12 20 b8 or %o0, 0xb8, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 202376c: c2 22 60 0c st %g1, [ %o1 + 0xc ] 2023770: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 2023774: 90 02 00 1b add %o0, %i3, %o0 2023778: 7f ff a4 a4 call 200ca08 <_Chain_Append> 202377c: c2 22 60 10 st %g1, [ %o1 + 0x10 ] 2023780: 30 bf ff 9d b,a 20235f4 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 2023784: 7f ff c5 6f call 2014d40 <__errno> 2023788: b0 10 3f ff mov -1, %i0 202378c: 82 10 20 03 mov 3, %g1 2023790: c2 22 00 00 st %g1, [ %o0 ] 2023794: 81 c7 e0 08 ret 2023798: 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 ); 202379c: 7f ff c5 69 call 2014d40 <__errno> 20237a0: b0 10 3f ff mov -1, %i0 20237a4: 82 10 20 16 mov 0x16, %g1 20237a8: c2 22 00 00 st %g1, [ %o0 ] 20237ac: 81 c7 e0 08 ret 20237b0: 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(); 20237b4: 7f ff ac 4e call 200e8ec <_Thread_Enable_dispatch> 20237b8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 20237bc: 7f ff c5 61 call 2014d40 <__errno> 20237c0: 01 00 00 00 nop 20237c4: 82 10 20 0b mov 0xb, %g1 ! b 20237c8: c2 22 00 00 st %g1, [ %o0 ] 20237cc: 81 c7 e0 08 ret 20237d0: 81 e8 00 00 restore =============================================================================== 0200b2c0 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 200b2c0: 9d e3 bf 90 save %sp, -112, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200b2c4: 03 00 80 9c sethi %hi(0x2027000), %g1 200b2c8: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20273c0 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200b2cc: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200b2d0: 84 00 a0 01 inc %g2 200b2d4: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200b2d8: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200b2dc: fa 27 a0 58 st %i5, [ %fp + 0x58 ] 200b2e0: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] POSIX_Message_queue_Control_fd *the_mq_fd; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200b2e4: a0 8e 62 00 andcc %i1, 0x200, %l0 200b2e8: 12 80 00 34 bne 200b3b8 200b2ec: 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 *) 200b2f0: 39 00 80 9e sethi %hi(0x2027800), %i4 200b2f4: 40 00 0c 35 call 200e3c8 <_Objects_Allocate> 200b2f8: 90 17 20 8c or %i4, 0x8c, %o0 ! 202788c <_POSIX_Message_queue_Information_fds> attr = (struct mq_attr *) va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200b2fc: ba 92 20 00 orcc %o0, 0, %i5 200b300: 02 80 00 37 be 200b3dc <== NEVER TAKEN 200b304: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 200b308: f2 27 60 14 st %i1, [ %i5 + 0x14 ] status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id ); 200b30c: 90 10 00 18 mov %i0, %o0 200b310: 40 00 1e 13 call 2012b5c <_POSIX_Message_queue_Name_to_id> 200b314: 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 ) { 200b318: b6 92 20 00 orcc %o0, 0, %i3 200b31c: 22 80 00 0f be,a 200b358 200b320: 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) ) ) { 200b324: 80 a6 e0 02 cmp %i3, 2 200b328: 02 80 00 40 be 200b428 200b32c: 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 ); 200b330: 90 17 20 8c or %i4, 0x8c, %o0 200b334: 40 00 0d 0f call 200e770 <_Objects_Free> 200b338: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200b33c: 40 00 11 22 call 200f7c4 <_Thread_Enable_dispatch> 200b340: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 200b344: 40 00 2c b4 call 2016614 <__errno> 200b348: 01 00 00 00 nop 200b34c: f6 22 00 00 st %i3, [ %o0 ] 200b350: 81 c7 e0 08 ret 200b354: 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) ) { 200b358: 80 a6 6a 00 cmp %i1, 0xa00 200b35c: 02 80 00 28 be 200b3fc 200b360: 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 *) 200b364: 94 07 bf fc add %fp, -4, %o2 200b368: 11 00 80 9d sethi %hi(0x2027400), %o0 200b36c: 40 00 0d 62 call 200e8f4 <_Objects_Get> 200b370: 90 12 23 00 or %o0, 0x300, %o0 ! 2027700 <_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; 200b374: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b378: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 200b37c: 84 00 a0 01 inc %g2 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b380: b8 17 20 8c or %i4, 0x8c, %i4 /* * 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; 200b384: c4 22 20 18 st %g2, [ %o0 + 0x18 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b388: 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 ); 200b38c: d0 27 bf f8 st %o0, [ %fp + -8 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 200b390: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 200b394: 83 28 60 02 sll %g1, 2, %g1 200b398: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b39c: 40 00 11 0a call 200f7c4 <_Thread_Enable_dispatch> 200b3a0: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 200b3a4: 40 00 11 08 call 200f7c4 <_Thread_Enable_dispatch> 200b3a8: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 200b3ac: f0 07 60 08 ld [ %i5 + 8 ], %i0 200b3b0: 81 c7 e0 08 ret 200b3b4: 81 e8 00 00 restore _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); attr = (struct mq_attr *) va_arg( arg, struct mq_attr * ); 200b3b8: 82 07 a0 54 add %fp, 0x54, %g1 200b3bc: f4 07 a0 50 ld [ %fp + 0x50 ], %i2 200b3c0: 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 *) 200b3c4: 39 00 80 9e sethi %hi(0x2027800), %i4 200b3c8: 40 00 0c 00 call 200e3c8 <_Objects_Allocate> 200b3cc: 90 17 20 8c or %i4, 0x8c, %o0 ! 202788c <_POSIX_Message_queue_Information_fds> va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200b3d0: ba 92 20 00 orcc %o0, 0, %i5 200b3d4: 32 bf ff ce bne,a 200b30c 200b3d8: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 200b3dc: 40 00 10 fa call 200f7c4 <_Thread_Enable_dispatch> 200b3e0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 200b3e4: 40 00 2c 8c call 2016614 <__errno> 200b3e8: 01 00 00 00 nop 200b3ec: 82 10 20 17 mov 0x17, %g1 ! 17 200b3f0: c2 22 00 00 st %g1, [ %o0 ] 200b3f4: 81 c7 e0 08 ret 200b3f8: 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 ); 200b3fc: 90 17 20 8c or %i4, 0x8c, %o0 200b400: 40 00 0c dc call 200e770 <_Objects_Free> 200b404: 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(); 200b408: 40 00 10 ef call 200f7c4 <_Thread_Enable_dispatch> 200b40c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 200b410: 40 00 2c 81 call 2016614 <__errno> 200b414: 01 00 00 00 nop 200b418: 82 10 20 11 mov 0x11, %g1 ! 11 200b41c: c2 22 00 00 st %g1, [ %o0 ] 200b420: 81 c7 e0 08 ret 200b424: 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) ) ) { 200b428: 02 bf ff c3 be 200b334 200b42c: 90 17 20 8c or %i4, 0x8c, %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( 200b430: 90 10 00 18 mov %i0, %o0 200b434: 92 10 20 01 mov 1, %o1 200b438: 94 10 00 1a mov %i2, %o2 200b43c: 40 00 1d 64 call 20129cc <_POSIX_Message_queue_Create_support> 200b440: 96 07 bf f8 add %fp, -8, %o3 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 200b444: 80 a2 3f ff cmp %o0, -1 200b448: 02 80 00 0d be 200b47c 200b44c: c6 07 bf f8 ld [ %fp + -8 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b450: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b454: b8 17 20 8c or %i4, 0x8c, %i4 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b458: 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; 200b45c: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200b460: 83 28 60 02 sll %g1, 2, %g1 200b464: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b468: 40 00 10 d7 call 200f7c4 <_Thread_Enable_dispatch> 200b46c: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 200b470: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 200b474: 81 c7 e0 08 ret 200b478: 81 e8 00 00 restore 200b47c: 90 17 20 8c or %i4, 0x8c, %o0 200b480: 92 10 00 1d mov %i5, %o1 200b484: 40 00 0c bb call 200e770 <_Objects_Free> 200b488: 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(); 200b48c: 40 00 10 ce call 200f7c4 <_Thread_Enable_dispatch> 200b490: 01 00 00 00 nop return (mqd_t) -1; 200b494: 81 c7 e0 08 ret 200b498: 81 e8 00 00 restore =============================================================================== 0200b904 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b904: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b908: 80 a0 60 00 cmp %g1, 0 200b90c: 02 80 00 06 be 200b924 200b910: 90 10 20 16 mov 0x16, %o0 200b914: c4 00 40 00 ld [ %g1 ], %g2 200b918: 80 a0 a0 00 cmp %g2, 0 200b91c: 12 80 00 04 bne 200b92c 200b920: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200b924: 81 c3 e0 08 retl 200b928: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200b92c: 18 80 00 09 bgu 200b950 200b930: 84 10 20 01 mov 1, %g2 ! 1 200b934: 85 28 80 09 sll %g2, %o1, %g2 200b938: 80 88 a0 17 btst 0x17, %g2 200b93c: 02 80 00 05 be 200b950 <== NEVER TAKEN 200b940: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b944: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200b948: 81 c3 e0 08 retl 200b94c: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200b950: 81 c3 e0 08 retl 200b954: 90 10 20 86 mov 0x86, %o0 =============================================================================== 02006848 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2006848: 9d e3 bf 90 save %sp, -112, %sp 200684c: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2006850: 80 a7 60 00 cmp %i5, 0 2006854: 02 80 00 26 be 20068ec 2006858: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 200685c: 80 a6 a0 00 cmp %i2, 0 2006860: 02 80 00 23 be 20068ec 2006864: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2006868: 02 80 00 23 be 20068f4 200686c: 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 ) 2006870: c2 06 40 00 ld [ %i1 ], %g1 2006874: 80 a0 60 00 cmp %g1, 0 2006878: 02 80 00 1d be 20068ec 200687c: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2006880: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006884: 80 a0 60 00 cmp %g1, 0 2006888: 12 80 00 19 bne 20068ec <== NEVER TAKEN 200688c: 03 00 80 60 sethi %hi(0x2018000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2006890: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 2018180 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006894: c0 27 bf f0 clr [ %fp + -16 ] 2006898: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 200689c: f4 27 bf f4 st %i2, [ %fp + -12 ] 20068a0: c4 20 61 80 st %g2, [ %g1 + 0x180 ] * 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 *) 20068a4: 37 00 80 61 sethi %hi(0x2018400), %i3 20068a8: 40 00 08 bb call 2008b94 <_Objects_Allocate> 20068ac: 90 16 e1 40 or %i3, 0x140, %o0 ! 2018540 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 20068b0: b8 92 20 00 orcc %o0, 0, %i4 20068b4: 02 80 00 14 be 2006904 20068b8: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 20068bc: 40 00 06 03 call 20080c8 <_CORE_barrier_Initialize> 20068c0: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20068c4: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; _Thread_Enable_dispatch(); return 0; } 20068c8: b6 16 e1 40 or %i3, 0x140, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20068cc: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20068d0: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20068d4: 85 28 a0 02 sll %g2, 2, %g2 20068d8: 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; 20068dc: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 20068e0: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20068e4: 40 00 0d 8c call 2009f14 <_Thread_Enable_dispatch> 20068e8: b0 10 20 00 clr %i0 return 0; } 20068ec: 81 c7 e0 08 ret 20068f0: 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 ); 20068f4: 7f ff ff 9d call 2006768 20068f8: 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 ) 20068fc: 10 bf ff de b 2006874 2006900: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 2006904: 40 00 0d 84 call 2009f14 <_Thread_Enable_dispatch> 2006908: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 200690c: 81 c7 e0 08 ret 2006910: 81 e8 00 00 restore =============================================================================== 020060c8 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 20060c8: 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 ) 20060cc: 80 a6 20 00 cmp %i0, 0 20060d0: 02 80 00 15 be 2006124 20060d4: 01 00 00 00 nop rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 20060d8: 03 00 80 61 sethi %hi(0x2018400), %g1 20060dc: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20185e0 <_Thread_Dispatch_disable_level> 20060e0: 84 00 a0 01 inc %g2 20060e4: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 20060e8: 40 00 12 be call 200abe0 <_Workspace_Allocate> 20060ec: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 20060f0: 80 a2 20 00 cmp %o0, 0 20060f4: 02 80 00 0a be 200611c <== NEVER TAKEN 20060f8: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20060fc: 03 00 80 62 sethi %hi(0x2018800), %g1 2006100: c2 00 63 24 ld [ %g1 + 0x324 ], %g1 ! 2018b24 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 2006104: 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; 2006108: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 200610c: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 2006110: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2006114: 40 00 06 32 call 20079dc <_Chain_Append> 2006118: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 200611c: 40 00 0d b9 call 2009800 <_Thread_Enable_dispatch> 2006120: 81 e8 00 00 restore 2006124: 81 c7 e0 08 ret 2006128: 81 e8 00 00 restore =============================================================================== 02007050 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2007050: 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; 2007054: 80 a6 60 00 cmp %i1, 0 2007058: 02 80 00 26 be 20070f0 200705c: 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 ) 2007060: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007064: 80 a0 60 01 cmp %g1, 1 2007068: 02 80 00 20 be 20070e8 <== NEVER TAKEN 200706c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2007070: c2 06 40 00 ld [ %i1 ], %g1 2007074: 80 a0 60 00 cmp %g1, 0 2007078: 02 80 00 1c be 20070e8 200707c: 03 00 80 64 sethi %hi(0x2019000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2007080: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 20192b0 <_Thread_Dispatch_disable_level> 2007084: 84 00 a0 01 inc %g2 2007088: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 200708c: 37 00 80 65 sethi %hi(0x2019400), %i3 2007090: 40 00 0a 27 call 200992c <_Objects_Allocate> 2007094: 90 16 e3 08 or %i3, 0x308, %o0 ! 2019708 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2007098: b8 92 20 00 orcc %o0, 0, %i4 200709c: 02 80 00 18 be 20070fc 20070a0: 90 07 20 18 add %i4, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070a4: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070a8: 92 10 20 00 clr %o1 20070ac: 15 04 00 02 sethi %hi(0x10000800), %o2 20070b0: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070b4: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070b8: 40 00 11 24 call 200b548 <_Thread_queue_Initialize> 20070bc: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20070c0: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 20070c4: b6 16 e3 08 or %i3, 0x308, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20070c8: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20070cc: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20070d0: 85 28 a0 02 sll %g2, 2, %g2 20070d4: 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; 20070d8: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 20070dc: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20070e0: 40 00 0e f3 call 200acac <_Thread_Enable_dispatch> 20070e4: b0 10 20 00 clr %i0 return 0; } 20070e8: 81 c7 e0 08 ret 20070ec: 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; 20070f0: 33 00 80 5e sethi %hi(0x2017800), %i1 20070f4: 10 bf ff db b 2007060 20070f8: b2 16 62 7c or %i1, 0x27c, %i1 ! 2017a7c <_POSIX_Condition_variables_Default_attributes> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 20070fc: 40 00 0e ec call 200acac <_Thread_Enable_dispatch> 2007100: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2007104: 81 c7 e0 08 ret 2007108: 81 e8 00 00 restore =============================================================================== 02006eb4 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006eb4: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006eb8: 80 a0 60 00 cmp %g1, 0 2006ebc: 02 80 00 06 be 2006ed4 2006ec0: 90 10 20 16 mov 0x16, %o0 2006ec4: c4 00 40 00 ld [ %g1 ], %g2 2006ec8: 80 a0 a0 00 cmp %g2, 0 2006ecc: 32 80 00 04 bne,a 2006edc <== ALWAYS TAKEN 2006ed0: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 2006ed4: 81 c3 e0 08 retl 2006ed8: 01 00 00 00 nop 2006edc: 81 c3 e0 08 retl 2006ee0: 90 10 20 00 clr %o0 ! 0 =============================================================================== 0200658c : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 200658c: 9d e3 bf 58 save %sp, -168, %sp 2006590: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2006594: 80 a6 a0 00 cmp %i2, 0 2006598: 02 80 00 63 be 2006724 200659c: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20065a0: 80 a6 60 00 cmp %i1, 0 20065a4: 22 80 00 62 be,a 200672c 20065a8: 33 00 80 71 sethi %hi(0x201c400), %i1 if ( !the_attr->is_initialized ) 20065ac: c2 06 40 00 ld [ %i1 ], %g1 20065b0: 80 a0 60 00 cmp %g1, 0 20065b4: 02 80 00 5c be 2006724 20065b8: 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) ) 20065bc: c2 06 60 04 ld [ %i1 + 4 ], %g1 20065c0: 80 a0 60 00 cmp %g1, 0 20065c4: 02 80 00 07 be 20065e0 20065c8: 03 00 80 75 sethi %hi(0x201d400), %g1 20065cc: c4 06 60 08 ld [ %i1 + 8 ], %g2 20065d0: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 20065d4: 80 a0 80 01 cmp %g2, %g1 20065d8: 0a 80 00 83 bcs 20067e4 20065dc: 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 ) { 20065e0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20065e4: 80 a0 60 01 cmp %g1, 1 20065e8: 02 80 00 53 be 2006734 20065ec: 80 a0 60 02 cmp %g1, 2 20065f0: 12 80 00 4d bne 2006724 20065f4: b0 10 20 16 mov 0x16, %i0 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 20065f8: da 06 60 18 ld [ %i1 + 0x18 ], %o5 20065fc: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2006600: f0 06 60 20 ld [ %i1 + 0x20 ], %i0 2006604: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 2006608: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 200660c: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 2006610: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006614: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 2006618: da 27 bf dc st %o5, [ %fp + -36 ] 200661c: de 27 bf e0 st %o7, [ %fp + -32 ] 2006620: f0 27 bf e4 st %i0, [ %fp + -28 ] 2006624: c8 27 bf e8 st %g4, [ %fp + -24 ] 2006628: c6 27 bf ec st %g3, [ %fp + -20 ] 200662c: c4 27 bf f0 st %g2, [ %fp + -16 ] 2006630: 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 ) 2006634: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2006638: 80 a0 60 00 cmp %g1, 0 200663c: 12 80 00 3a bne 2006724 2006640: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2006644: d0 07 bf dc ld [ %fp + -36 ], %o0 2006648: 40 00 1b 5b call 200d3b4 <_POSIX_Priority_Is_valid> 200664c: b0 10 20 16 mov 0x16, %i0 2006650: 80 8a 20 ff btst 0xff, %o0 2006654: 02 80 00 34 be 2006724 <== NEVER TAKEN 2006658: 03 00 80 75 sethi %hi(0x201d400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 200665c: 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); 2006660: e6 08 60 6c ldub [ %g1 + 0x6c ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2006664: 90 10 00 1c mov %i4, %o0 2006668: 92 07 bf dc add %fp, -36, %o1 200666c: 94 07 bf f8 add %fp, -8, %o2 2006670: 40 00 1b 5e call 200d3e8 <_POSIX_Thread_Translate_sched_param> 2006674: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2006678: b0 92 20 00 orcc %o0, 0, %i0 200667c: 12 80 00 2a bne 2006724 2006680: 23 00 80 78 sethi %hi(0x201e000), %l1 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2006684: d0 04 61 f4 ld [ %l1 + 0x1f4 ], %o0 ! 201e1f4 <_RTEMS_Allocator_Mutex> 2006688: 40 00 06 4e call 2007fc0 <_API_Mutex_Lock> 200668c: 29 00 80 78 sethi %hi(0x201e000), %l4 * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 2006690: 40 00 09 15 call 2008ae4 <_Objects_Allocate> 2006694: 90 15 23 90 or %l4, 0x390, %o0 ! 201e390 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2006698: a0 92 20 00 orcc %o0, 0, %l0 200669c: 02 80 00 1f be 2006718 20066a0: 05 00 80 75 sethi %hi(0x201d400), %g2 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066a4: 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 ) 20066a8: d6 00 a0 70 ld [ %g2 + 0x70 ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066ac: 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 ) 20066b0: 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( 20066b4: 80 a2 c0 01 cmp %o3, %g1 20066b8: 1a 80 00 03 bcc 20066c4 20066bc: d4 06 60 04 ld [ %i1 + 4 ], %o2 20066c0: 96 10 00 01 mov %g1, %o3 20066c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20066c8: 9a 0c e0 ff and %l3, 0xff, %o5 20066cc: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 20066d0: 82 10 20 01 mov 1, %g1 20066d4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20066d8: c2 07 bf fc ld [ %fp + -4 ], %g1 20066dc: c0 23 a0 68 clr [ %sp + 0x68 ] 20066e0: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 20066e4: 82 07 bf d4 add %fp, -44, %g1 20066e8: 90 15 23 90 or %l4, 0x390, %o0 20066ec: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20066f0: 92 10 00 10 mov %l0, %o1 20066f4: 98 10 20 01 mov 1, %o4 20066f8: 40 00 0e 12 call 2009f40 <_Thread_Initialize> 20066fc: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2006700: 80 8a 20 ff btst 0xff, %o0 2006704: 12 80 00 1f bne 2006780 2006708: 11 00 80 78 sethi %hi(0x201e000), %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 200670c: 92 10 00 10 mov %l0, %o1 2006710: 40 00 09 df call 2008e8c <_Objects_Free> 2006714: 90 12 23 90 or %o0, 0x390, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006718: d0 04 61 f4 ld [ %l1 + 0x1f4 ], %o0 200671c: 40 00 06 3e call 2008014 <_API_Mutex_Unlock> 2006720: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006724: 81 c7 e0 08 ret 2006728: 81 e8 00 00 restore int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 200672c: 10 bf ff a0 b 20065ac 2006730: b2 16 63 34 or %i1, 0x334, %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 ]; 2006734: 03 00 80 79 sethi %hi(0x201e400), %g1 2006738: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 201e694 <_Per_CPU_Information+0xc> 200673c: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006740: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 2006744: da 00 60 8c ld [ %g1 + 0x8c ], %o5 2006748: de 00 60 90 ld [ %g1 + 0x90 ], %o7 200674c: f0 00 60 94 ld [ %g1 + 0x94 ], %i0 2006750: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 2006754: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 2006758: 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; 200675c: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 2006760: d8 27 bf dc st %o4, [ %fp + -36 ] 2006764: da 27 bf e0 st %o5, [ %fp + -32 ] 2006768: de 27 bf e4 st %o7, [ %fp + -28 ] 200676c: f0 27 bf e8 st %i0, [ %fp + -24 ] 2006770: c8 27 bf ec st %g4, [ %fp + -20 ] 2006774: c6 27 bf f0 st %g3, [ %fp + -16 ] break; 2006778: 10 bf ff af b 2006634 200677c: c4 27 bf f4 st %g2, [ %fp + -12 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2006780: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 api->Attributes = *the_attr; 2006784: 92 10 00 19 mov %i1, %o1 2006788: 94 10 20 40 mov 0x40, %o2 200678c: 40 00 28 39 call 2010870 2006790: 90 10 00 12 mov %l2, %o0 api->detachstate = the_attr->detachstate; 2006794: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006798: 92 07 bf dc add %fp, -36, %o1 200679c: 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; 20067a0: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] api->schedpolicy = schedpolicy; 20067a4: f8 24 a0 84 st %i4, [ %l2 + 0x84 ] api->schedparam = schedparam; 20067a8: 40 00 28 32 call 2010870 20067ac: 90 04 a0 88 add %l2, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 20067b0: 90 10 00 10 mov %l0, %o0 20067b4: 92 10 20 01 mov 1, %o1 20067b8: 94 10 00 1a mov %i2, %o2 20067bc: 96 10 00 1b mov %i3, %o3 20067c0: 40 00 10 61 call 200a944 <_Thread_Start> 20067c4: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 20067c8: 80 a7 20 04 cmp %i4, 4 20067cc: 02 80 00 08 be 20067ec 20067d0: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20067d4: c2 04 20 08 ld [ %l0 + 8 ], %g1 _RTEMS_Unlock_allocator(); 20067d8: d0 04 61 f4 ld [ %l1 + 0x1f4 ], %o0 20067dc: 40 00 06 0e call 2008014 <_API_Mutex_Unlock> 20067e0: c2 27 40 00 st %g1, [ %i5 ] return 0; 20067e4: 81 c7 e0 08 ret 20067e8: 81 e8 00 00 restore return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 20067ec: 40 00 10 d8 call 200ab4c <_Timespec_To_ticks> 20067f0: 90 04 a0 90 add %l2, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20067f4: 92 04 a0 a8 add %l2, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20067f8: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20067fc: 11 00 80 78 sethi %hi(0x201e000), %o0 2006800: 40 00 11 c3 call 200af0c <_Watchdog_Insert> 2006804: 90 12 22 14 or %o0, 0x214, %o0 ! 201e214 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2006808: 10 bf ff f4 b 20067d8 200680c: c2 04 20 08 ld [ %l0 + 8 ], %g1 =============================================================================== 02023954 : int pthread_kill( pthread_t thread, int sig ) { 2023954: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 2023958: 80 a6 60 00 cmp %i1, 0 202395c: 02 80 00 2d be 2023a10 2023960: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2023964: 80 a6 e0 1f cmp %i3, 0x1f 2023968: 18 80 00 2a bgu 2023a10 202396c: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 2023970: 7f ff ab eb call 200e91c <_Thread_Get> 2023974: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2023978: c2 07 bf fc ld [ %fp + -4 ], %g1 202397c: 80 a0 60 00 cmp %g1, 0 2023980: 12 80 00 2a bne 2023a28 <== NEVER TAKEN 2023984: 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 ) { 2023988: 83 2e 60 02 sll %i1, 2, %g1 202398c: 85 2e 60 04 sll %i1, 4, %g2 2023990: 84 20 80 01 sub %g2, %g1, %g2 2023994: 03 00 80 9d sethi %hi(0x2027400), %g1 2023998: 82 10 62 c0 or %g1, 0x2c0, %g1 ! 20276c0 <_POSIX_signals_Vectors> 202399c: 82 00 40 02 add %g1, %g2, %g1 20239a0: c4 00 60 08 ld [ %g1 + 8 ], %g2 20239a4: 80 a0 a0 01 cmp %g2, 1 20239a8: 02 80 00 14 be 20239f8 20239ac: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20239b0: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 20239b4: b8 10 20 01 mov 1, %i4 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20239b8: 92 10 00 19 mov %i1, %o1 20239bc: b7 2f 00 1b sll %i4, %i3, %i3 20239c0: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20239c4: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20239c8: 7f ff ff 8c call 20237f8 <_POSIX_signals_Unblock_thread> 20239cc: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20239d0: 03 00 80 9d sethi %hi(0x2027400), %g1 20239d4: 82 10 62 68 or %g1, 0x268, %g1 ! 2027668 <_Per_CPU_Information> 20239d8: c4 00 60 08 ld [ %g1 + 8 ], %g2 20239dc: 80 a0 a0 00 cmp %g2, 0 20239e0: 02 80 00 06 be 20239f8 20239e4: 01 00 00 00 nop 20239e8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20239ec: 80 a7 40 02 cmp %i5, %g2 20239f0: 02 80 00 06 be 2023a08 20239f4: 01 00 00 00 nop _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 20239f8: 7f ff ab bd call 200e8ec <_Thread_Enable_dispatch> 20239fc: b0 10 20 00 clr %i0 ! 0 return 0; 2023a00: 81 c7 e0 08 ret 2023a04: 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; 2023a08: f8 28 60 18 stb %i4, [ %g1 + 0x18 ] 2023a0c: 30 bf ff fb b,a 20239f8 if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 2023a10: 7f ff c4 cc call 2014d40 <__errno> 2023a14: b0 10 3f ff mov -1, %i0 2023a18: 82 10 20 16 mov 0x16, %g1 2023a1c: c2 22 00 00 st %g1, [ %o0 ] 2023a20: 81 c7 e0 08 ret 2023a24: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 2023a28: 7f ff c4 c6 call 2014d40 <__errno> <== NOT EXECUTED 2023a2c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2023a30: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 2023a34: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 2023a38: 81 c7 e0 08 ret <== NOT EXECUTED 2023a3c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008510 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2008510: 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 ); 2008514: 90 10 00 19 mov %i1, %o0 2008518: 40 00 00 37 call 20085f4 <_POSIX_Absolute_timeout_to_ticks> 200851c: 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 ); 2008520: 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 ); 2008524: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008528: 80 a7 60 03 cmp %i5, 3 200852c: 02 80 00 09 be 2008550 2008530: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008534: 7f ff ff be call 200842c <_POSIX_Mutex_Lock_support> 2008538: 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) ) { 200853c: 80 a2 20 10 cmp %o0, 0x10 2008540: 02 80 00 08 be 2008560 <== ALWAYS TAKEN 2008544: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008548: 81 c7 e0 08 ret 200854c: 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 ); 2008550: 7f ff ff b7 call 200842c <_POSIX_Mutex_Lock_support> 2008554: 92 10 20 01 mov 1, %o1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008558: 81 c7 e0 08 ret 200855c: 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 ) 2008560: 32 80 00 04 bne,a 2008570 <== ALWAYS TAKEN 2008564: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 2008568: 10 bf ff f8 b 2008548 <== NOT EXECUTED 200856c: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008570: 80 a7 60 01 cmp %i5, 1 2008574: 28 bf ff f5 bleu,a 2008548 <== ALWAYS TAKEN 2008578: 90 10 20 74 mov 0x74, %o0 200857c: 30 bf ff f3 b,a 2008548 <== NOT EXECUTED =============================================================================== 02005e0c : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005e0c: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2005e10: 80 a0 60 00 cmp %g1, 0 2005e14: 02 80 00 06 be 2005e2c 2005e18: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005e1c: c4 00 40 00 ld [ %g1 ], %g2 2005e20: 80 a0 a0 00 cmp %g2, 0 2005e24: 12 80 00 04 bne 2005e34 2005e28: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 2005e2c: 81 c3 e0 08 retl 2005e30: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 2005e34: 02 bf ff fe be 2005e2c <== NEVER TAKEN 2005e38: 01 00 00 00 nop return EINVAL; *type = attr->type; 2005e3c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2005e40: 90 10 20 00 clr %o0 } 2005e44: 81 c3 e0 08 retl 2005e48: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 020080e8 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 20080e8: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20080ec: 80 a0 60 00 cmp %g1, 0 20080f0: 02 80 00 06 be 2008108 20080f4: 90 10 20 16 mov 0x16, %o0 20080f8: c4 00 40 00 ld [ %g1 ], %g2 20080fc: 80 a0 a0 00 cmp %g2, 0 2008100: 12 80 00 04 bne 2008110 2008104: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2008108: 81 c3 e0 08 retl 200810c: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2008110: 18 bf ff fe bgu 2008108 <== NEVER TAKEN 2008114: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2008118: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 200811c: 81 c3 e0 08 retl 2008120: 90 10 20 00 clr %o0 =============================================================================== 02005ea0 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 2005ea0: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2005ea4: 80 a0 60 00 cmp %g1, 0 2005ea8: 02 80 00 06 be 2005ec0 2005eac: 90 10 20 16 mov 0x16, %o0 2005eb0: c4 00 40 00 ld [ %g1 ], %g2 2005eb4: 80 a0 a0 00 cmp %g2, 0 2005eb8: 12 80 00 04 bne 2005ec8 <== ALWAYS TAKEN 2005ebc: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 2005ec0: 81 c3 e0 08 retl 2005ec4: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 2005ec8: 18 bf ff fe bgu 2005ec0 2005ecc: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2005ed0: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 2005ed4: 81 c3 e0 08 retl 2005ed8: 90 10 20 00 clr %o0 =============================================================================== 02006c2c : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2006c2c: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2006c30: 80 a6 60 00 cmp %i1, 0 2006c34: 12 80 00 04 bne 2006c44 2006c38: ba 10 00 18 mov %i0, %i5 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006c3c: 81 c7 e0 08 ret 2006c40: 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 ) 2006c44: 80 a6 20 00 cmp %i0, 0 2006c48: 22 80 00 13 be,a 2006c94 2006c4c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 2006c50: c2 06 20 04 ld [ %i0 + 4 ], %g1 2006c54: 80 a0 60 00 cmp %g1, 0 2006c58: 12 80 00 0f bne 2006c94 2006c5c: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2006c60: 90 10 21 00 mov 0x100, %o0 2006c64: 92 10 21 00 mov 0x100, %o1 2006c68: 40 00 03 0c call 2007898 2006c6c: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2006c70: c2 07 60 04 ld [ %i5 + 4 ], %g1 2006c74: 80 a0 60 00 cmp %g1, 0 2006c78: 02 80 00 09 be 2006c9c <== ALWAYS TAKEN 2006c7c: 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); 2006c80: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 2006c84: 92 10 21 00 mov 0x100, %o1 2006c88: 94 07 bf fc add %fp, -4, %o2 2006c8c: 40 00 03 03 call 2007898 2006c90: b0 10 20 00 clr %i0 2006c94: 81 c7 e0 08 ret 2006c98: 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; 2006c9c: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2006ca0: 9f c6 40 00 call %i1 2006ca4: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2006ca8: 10 bf ff f7 b 2006c84 2006cac: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 020073a8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20073a8: 9d e3 bf 90 save %sp, -112, %sp 20073ac: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20073b0: 80 a7 60 00 cmp %i5, 0 20073b4: 02 80 00 23 be 2007440 20073b8: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20073bc: 80 a6 60 00 cmp %i1, 0 20073c0: 02 80 00 22 be 2007448 20073c4: 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 ) 20073c8: c2 06 40 00 ld [ %i1 ], %g1 20073cc: 80 a0 60 00 cmp %g1, 0 20073d0: 02 80 00 1c be 2007440 <== NEVER TAKEN 20073d4: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20073d8: c2 06 60 04 ld [ %i1 + 4 ], %g1 20073dc: 80 a0 60 00 cmp %g1, 0 20073e0: 12 80 00 18 bne 2007440 <== NEVER TAKEN 20073e4: 03 00 80 69 sethi %hi(0x201a400), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 20073e8: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201a6c0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20073ec: c0 27 bf fc clr [ %fp + -4 ] 20073f0: 84 00 a0 01 inc %g2 20073f4: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] * 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 *) 20073f8: 37 00 80 6a sethi %hi(0x201a800), %i3 20073fc: 40 00 0a 43 call 2009d08 <_Objects_Allocate> 2007400: 90 16 e0 c0 or %i3, 0xc0, %o0 ! 201a8c0 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2007404: b8 92 20 00 orcc %o0, 0, %i4 2007408: 02 80 00 14 be 2007458 200740c: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2007410: 40 00 07 d4 call 2009360 <_CORE_RWLock_Initialize> 2007414: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007418: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 200741c: b6 16 e0 c0 or %i3, 0xc0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007420: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007424: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007428: 85 28 a0 02 sll %g2, 2, %g2 200742c: 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; 2007430: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007434: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007438: 40 00 0f 14 call 200b088 <_Thread_Enable_dispatch> 200743c: b0 10 20 00 clr %i0 return 0; } 2007440: 81 c7 e0 08 ret 2007444: 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 ); 2007448: 40 00 02 6c call 2007df8 200744c: 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 ) 2007450: 10 bf ff df b 20073cc 2007454: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 2007458: 40 00 0f 0c call 200b088 <_Thread_Enable_dispatch> 200745c: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2007460: 81 c7 e0 08 ret 2007464: 81 e8 00 00 restore =============================================================================== 020074d8 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20074d8: 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 ) 20074dc: 80 a6 20 00 cmp %i0, 0 20074e0: 02 80 00 24 be 2007570 20074e4: 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 ); 20074e8: 92 07 bf fc add %fp, -4, %o1 20074ec: 40 00 1b fb call 200e4d8 <_POSIX_Absolute_timeout_to_ticks> 20074f0: 90 10 00 19 mov %i1, %o0 20074f4: d2 06 00 00 ld [ %i0 ], %o1 20074f8: b8 10 00 08 mov %o0, %i4 20074fc: 94 07 bf f8 add %fp, -8, %o2 2007500: 11 00 80 6a sethi %hi(0x201a800), %o0 2007504: 40 00 0b 4c call 200a234 <_Objects_Get> 2007508: 90 12 20 c0 or %o0, 0xc0, %o0 ! 201a8c0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 200750c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007510: 80 a0 60 00 cmp %g1, 0 2007514: 12 80 00 17 bne 2007570 2007518: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 200751c: 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, 2007520: 82 1f 20 03 xor %i4, 3, %g1 2007524: 90 02 20 10 add %o0, 0x10, %o0 2007528: 80 a0 00 01 cmp %g0, %g1 200752c: 98 10 20 00 clr %o4 2007530: b6 60 3f ff subx %g0, -1, %i3 2007534: 40 00 07 95 call 2009388 <_CORE_RWLock_Obtain_for_reading> 2007538: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 200753c: 40 00 0e d3 call 200b088 <_Thread_Enable_dispatch> 2007540: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007544: 03 00 80 6b sethi %hi(0x201ac00), %g1 2007548: c2 00 60 04 ld [ %g1 + 4 ], %g1 ! 201ac04 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 200754c: 80 a6 e0 00 cmp %i3, 0 2007550: 12 80 00 05 bne 2007564 2007554: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007558: 80 a2 20 02 cmp %o0, 2 200755c: 02 80 00 07 be 2007578 2007560: 80 a7 20 00 cmp %i4, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007564: 40 00 00 39 call 2007648 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007568: 01 00 00 00 nop 200756c: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007570: 81 c7 e0 08 ret 2007574: 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 ) 2007578: 02 bf ff fe be 2007570 <== NEVER TAKEN 200757c: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007580: 80 a7 20 01 cmp %i4, 1 2007584: 18 bf ff f8 bgu 2007564 <== NEVER TAKEN 2007588: ba 10 20 74 mov 0x74, %i5 200758c: 30 bf ff f9 b,a 2007570 =============================================================================== 02007590 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007590: 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 ) 2007594: 80 a6 20 00 cmp %i0, 0 2007598: 02 80 00 24 be 2007628 200759c: 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 ); 20075a0: 92 07 bf fc add %fp, -4, %o1 20075a4: 40 00 1b cd call 200e4d8 <_POSIX_Absolute_timeout_to_ticks> 20075a8: 90 10 00 19 mov %i1, %o0 20075ac: d2 06 00 00 ld [ %i0 ], %o1 20075b0: b8 10 00 08 mov %o0, %i4 20075b4: 94 07 bf f8 add %fp, -8, %o2 20075b8: 11 00 80 6a sethi %hi(0x201a800), %o0 20075bc: 40 00 0b 1e call 200a234 <_Objects_Get> 20075c0: 90 12 20 c0 or %o0, 0xc0, %o0 ! 201a8c0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20075c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20075c8: 80 a0 60 00 cmp %g1, 0 20075cc: 12 80 00 17 bne 2007628 20075d0: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20075d4: 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, 20075d8: 82 1f 20 03 xor %i4, 3, %g1 20075dc: 90 02 20 10 add %o0, 0x10, %o0 20075e0: 80 a0 00 01 cmp %g0, %g1 20075e4: 98 10 20 00 clr %o4 20075e8: b6 60 3f ff subx %g0, -1, %i3 20075ec: 40 00 07 9d call 2009460 <_CORE_RWLock_Obtain_for_writing> 20075f0: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20075f4: 40 00 0e a5 call 200b088 <_Thread_Enable_dispatch> 20075f8: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 20075fc: 03 00 80 6b sethi %hi(0x201ac00), %g1 2007600: c2 00 60 04 ld [ %g1 + 4 ], %g1 ! 201ac04 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2007604: 80 a6 e0 00 cmp %i3, 0 2007608: 12 80 00 05 bne 200761c 200760c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007610: 80 a2 20 02 cmp %o0, 2 2007614: 02 80 00 07 be 2007630 2007618: 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( 200761c: 40 00 00 0b call 2007648 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007620: 01 00 00 00 nop 2007624: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007628: 81 c7 e0 08 ret 200762c: 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 ) 2007630: 02 bf ff fe be 2007628 <== NEVER TAKEN 2007634: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007638: 80 a7 20 01 cmp %i4, 1 200763c: 18 bf ff f8 bgu 200761c <== NEVER TAKEN 2007640: ba 10 20 74 mov 0x74, %i5 2007644: 30 bf ff f9 b,a 2007628 =============================================================================== 02007e20 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007e20: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007e24: 80 a0 60 00 cmp %g1, 0 2007e28: 02 80 00 06 be 2007e40 2007e2c: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007e30: c4 00 40 00 ld [ %g1 ], %g2 2007e34: 80 a0 a0 00 cmp %g2, 0 2007e38: 12 80 00 04 bne 2007e48 2007e3c: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2007e40: 81 c3 e0 08 retl 2007e44: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2007e48: 18 bf ff fe bgu 2007e40 <== NEVER TAKEN 2007e4c: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007e50: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2007e54: 81 c3 e0 08 retl 2007e58: 90 10 20 00 clr %o0 =============================================================================== 02008de4 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008de4: 9d e3 bf 90 save %sp, -112, %sp 2008de8: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2008dec: 80 a6 a0 00 cmp %i2, 0 2008df0: 02 80 00 38 be 2008ed0 2008df4: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 2008df8: 90 10 00 19 mov %i1, %o0 2008dfc: 92 10 00 1a mov %i2, %o1 2008e00: 94 07 bf f4 add %fp, -12, %o2 2008e04: 40 00 19 c0 call 200f504 <_POSIX_Thread_Translate_sched_param> 2008e08: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 2008e0c: b0 92 20 00 orcc %o0, 0, %i0 2008e10: 12 80 00 30 bne 2008ed0 2008e14: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 2008e18: 40 00 0c 36 call 200bef0 <_Thread_Get> 2008e1c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008e20: c2 07 bf fc ld [ %fp + -4 ], %g1 2008e24: 80 a0 60 00 cmp %g1, 0 2008e28: 12 80 00 2c bne 2008ed8 2008e2c: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2008e30: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2008e34: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2008e38: 80 a0 60 04 cmp %g1, 4 2008e3c: 02 80 00 33 be 2008f08 2008e40: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 2008e44: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008e48: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008e4c: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 2008e50: c2 27 60 88 st %g1, [ %i5 + 0x88 ] 2008e54: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008e58: c4 27 60 8c st %g2, [ %i5 + 0x8c ] 2008e5c: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2008e60: c4 27 60 90 st %g2, [ %i5 + 0x90 ] 2008e64: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 2008e68: c4 27 60 94 st %g2, [ %i5 + 0x94 ] 2008e6c: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 2008e70: c4 27 60 98 st %g2, [ %i5 + 0x98 ] 2008e74: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 2008e78: c4 27 60 9c st %g2, [ %i5 + 0x9c ] 2008e7c: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 2008e80: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 2008e84: c4 07 bf f4 ld [ %fp + -12 ], %g2 2008e88: c4 27 20 7c st %g2, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008e8c: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 2008e90: 06 80 00 0e bl 2008ec8 <== NEVER TAKEN 2008e94: c4 27 20 80 st %g2, [ %i4 + 0x80 ] 2008e98: 80 a6 60 02 cmp %i1, 2 2008e9c: 04 80 00 11 ble 2008ee0 2008ea0: 07 00 80 6c sethi %hi(0x201b000), %g3 2008ea4: 80 a6 60 04 cmp %i1, 4 2008ea8: 12 80 00 08 bne 2008ec8 <== NEVER TAKEN 2008eac: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008eb0: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 2008eb4: 40 00 10 d1 call 200d1f8 <_Watchdog_Remove> 2008eb8: 90 07 60 a8 add %i5, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008ebc: 90 10 20 00 clr %o0 2008ec0: 7f ff ff 7e call 2008cb8 <_POSIX_Threads_Sporadic_budget_TSR> 2008ec4: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008ec8: 40 00 0b fe call 200bec0 <_Thread_Enable_dispatch> 2008ecc: 01 00 00 00 nop return 0; 2008ed0: 81 c7 e0 08 ret 2008ed4: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return ESRCH; } 2008ed8: 81 c7 e0 08 ret 2008edc: 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; 2008ee0: 05 00 80 6f sethi %hi(0x201bc00), %g2 2008ee4: d2 08 e0 fc ldub [ %g3 + 0xfc ], %o1 2008ee8: c4 00 a1 a4 ld [ %g2 + 0x1a4 ], %g2 2008eec: 92 22 40 01 sub %o1, %g1, %o1 2008ef0: c4 27 20 78 st %g2, [ %i4 + 0x78 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008ef4: 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 = 2008ef8: d2 27 20 18 st %o1, [ %i4 + 0x18 ] _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008efc: 40 00 0a b8 call 200b9dc <_Thread_Change_priority> 2008f00: 94 10 20 01 mov 1, %o2 the_thread, the_thread->real_priority, true ); break; 2008f04: 30 bf ff f1 b,a 2008ec8 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 2008f08: 40 00 10 bc call 200d1f8 <_Watchdog_Remove> 2008f0c: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2008f10: 10 bf ff ce b 2008e48 2008f14: f2 27 60 84 st %i1, [ %i5 + 0x84 ] =============================================================================== 020068c4 : * * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20068c4: 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() ) 20068c8: 3b 00 80 62 sethi %hi(0x2018800), %i5 20068cc: ba 17 63 18 or %i5, 0x318, %i5 ! 2018b18 <_Per_CPU_Information> 20068d0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20068d4: 80 a0 60 00 cmp %g1, 0 20068d8: 12 80 00 15 bne 200692c <== NEVER TAKEN 20068dc: 01 00 00 00 nop 20068e0: 03 00 80 61 sethi %hi(0x2018400), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20068e4: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20068e8: c6 00 61 e0 ld [ %g1 + 0x1e0 ], %g3 20068ec: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 20068f0: 86 00 e0 01 inc %g3 20068f4: c6 20 61 e0 st %g3, [ %g1 + 0x1e0 ] _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 20068f8: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 20068fc: 80 a0 60 00 cmp %g1, 0 2006900: 12 80 00 0d bne 2006934 <== NEVER TAKEN 2006904: 01 00 00 00 nop 2006908: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 200690c: 80 a0 60 00 cmp %g1, 0 2006910: 02 80 00 09 be 2006934 2006914: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2006918: 40 00 0b ba call 2009800 <_Thread_Enable_dispatch> 200691c: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2006920: f0 07 60 0c ld [ %i5 + 0xc ], %i0 2006924: 40 00 19 88 call 200cf44 <_POSIX_Thread_Exit> 2006928: 81 e8 00 00 restore 200692c: 81 c7 e0 08 ret 2006930: 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(); 2006934: 40 00 0b b3 call 2009800 <_Thread_Enable_dispatch> 2006938: 81 e8 00 00 restore =============================================================================== 02007514 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2007514: 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); 2007518: 3b 00 80 66 sethi %hi(0x2019800), %i5 200751c: 40 00 02 73 call 2007ee8 2007520: 90 17 61 0c or %i5, 0x10c, %o0 ! 201990c if (result != 0) { 2007524: b8 92 20 00 orcc %o0, 0, %i4 2007528: 12 80 00 31 bne 20075ec <== NEVER TAKEN 200752c: 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); 2007530: 40 00 04 a3 call 20087bc 2007534: b6 17 61 0c or %i5, 0x10c, %i3 2007538: 92 07 bf fc add %fp, -4, %o1 200753c: 40 00 03 91 call 2008380 2007540: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2007544: 40 00 04 9e call 20087bc 2007548: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 200754c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2007550: 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; 2007554: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 2007558: 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; 200755c: 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 (); 2007560: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007564: 84 20 c0 02 sub %g3, %g2, %g2 2007568: 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) && 200756c: 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; 2007570: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 2007574: 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; 2007578: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 200757c: 80 a0 a0 00 cmp %g2, 0 2007580: 12 80 00 06 bne 2007598 <== NEVER TAKEN 2007584: d2 00 40 00 ld [ %g1 ], %o1 2007588: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2 200758c: 80 a0 a0 04 cmp %g2, 4 2007590: 24 80 00 1b ble,a 20075fc 2007594: 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, 2007598: 94 10 20 00 clr %o2 200759c: 11 00 80 66 sethi %hi(0x2019800), %o0 20075a0: 7f ff fe a0 call 2007020 20075a4: 90 12 21 54 or %o0, 0x154, %o0 ! 2019954 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20075a8: b4 92 20 00 orcc %o0, 0, %i2 20075ac: 22 80 00 31 be,a 2007670 20075b0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 20075b4: b6 06 a0 1c add %i2, 0x1c, %i3 20075b8: 40 00 02 4c call 2007ee8 20075bc: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20075c0: 90 06 a0 08 add %i2, 8, %o0 20075c4: 7f ff ff 89 call 20073e8 20075c8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20075cc: 40 00 01 24 call 2007a5c 20075d0: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20075d4: 40 00 02 65 call 2007f68 20075d8: 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); 20075dc: 40 00 02 63 call 2007f68 20075e0: 90 17 61 0c or %i5, 0x10c, %o0 return 0; } 20075e4: 81 c7 e0 08 ret 20075e8: 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); 20075ec: 7f ff f0 1e call 2003664 <== NOT EXECUTED 20075f0: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 20075f4: 81 c7 e0 08 ret <== NOT EXECUTED 20075f8: 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); 20075fc: 7f ff fe 89 call 2007020 2007600: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007604: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 2007608: 80 a0 60 01 cmp %g1, 1 200760c: 12 bf ff ea bne 20075b4 2007610: b4 10 00 08 mov %o0, %i2 RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 2007614: 90 02 20 08 add %o0, 8, %o0 2007618: 40 00 09 08 call 2009a38 <_Chain_Insert> 200761c: 92 10 00 18 mov %i0, %o1 rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 2007620: 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; 2007624: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007628: 40 00 01 d9 call 2007d8c 200762c: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2007630: 92 10 20 00 clr %o1 2007634: 40 00 00 db call 20079a0 2007638: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 200763c: 90 07 bf f8 add %fp, -8, %o0 2007640: 92 06 e0 08 add %i3, 8, %o1 2007644: 96 10 00 1a mov %i2, %o3 2007648: 15 00 80 1c sethi %hi(0x2007000), %o2 200764c: 40 00 02 ac call 20080fc 2007650: 94 12 a1 7c or %o2, 0x17c, %o2 ! 200717c rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007654: 82 92 20 00 orcc %o0, 0, %g1 2007658: 12 80 00 25 bne 20076ec <== NEVER TAKEN 200765c: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2007660: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2007664: 82 00 60 01 inc %g1 2007668: 10 bf ff dd b 20075dc 200766c: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007670: 11 00 80 66 sethi %hi(0x2019800), %o0 2007674: d2 00 40 00 ld [ %g1 ], %o1 2007678: 90 12 21 60 or %o0, 0x160, %o0 200767c: 7f ff fe 69 call 2007020 2007680: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007684: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007688: b4 10 00 08 mov %o0, %i2 200768c: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 2007690: 80 a0 60 01 cmp %g1, 1 2007694: 02 80 00 0b be 20076c0 2007698: 90 02 20 08 add %o0, 8, %o0 r_chain->new_fd = 0; 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); 200769c: 7f ff ff 53 call 20073e8 20076a0: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 20076a4: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20076a8: 80 a0 60 00 cmp %g1, 0 20076ac: 04 bf ff cc ble 20075dc <== ALWAYS TAKEN 20076b0: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 20076b4: 40 00 00 ea call 2007a5c <== NOT EXECUTED 20076b8: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED 20076bc: 30 bf ff c8 b,a 20075dc <== NOT EXECUTED 20076c0: 40 00 08 de call 2009a38 <_Chain_Insert> 20076c4: 01 00 00 00 nop /* 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); 20076c8: 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; 20076cc: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 20076d0: 40 00 01 af call 2007d8c 20076d4: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 20076d8: 90 06 a0 20 add %i2, 0x20, %o0 20076dc: 40 00 00 b1 call 20079a0 20076e0: 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) 20076e4: 10 bf ff f1 b 20076a8 20076e8: 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); 20076ec: 40 00 02 1f call 2007f68 <== NOT EXECUTED 20076f0: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED return result; 20076f4: 30 bf ff bc b,a 20075e4 <== NOT EXECUTED =============================================================================== 0200717c : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 200717c: 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); 2007180: 37 00 80 66 sethi %hi(0x2019800), %i3 2007184: b8 06 20 1c add %i0, 0x1c, %i4 2007188: b6 16 e1 0c or %i3, 0x10c, %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, 200718c: b4 10 00 1b mov %i3, %i2 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)) { 2007190: b2 06 e0 58 add %i3, 0x58, %i1 --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2007194: a0 06 e0 04 add %i3, 4, %l0 /* 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); 2007198: 40 00 03 54 call 2007ee8 200719c: 90 10 00 1c mov %i4, %o0 if (result != 0) 20071a0: 80 a2 20 00 cmp %o0, 0 20071a4: 12 80 00 2b bne 2007250 <== NEVER TAKEN 20071a8: 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; 20071ac: 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 ); 20071b0: 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)) { 20071b4: 80 a7 40 01 cmp %i5, %g1 20071b8: 02 80 00 41 be 20072bc 20071bc: 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); 20071c0: 40 00 05 7f call 20087bc 20071c4: 01 00 00 00 nop 20071c8: 92 07 bf fc add %fp, -4, %o1 20071cc: 40 00 04 6d call 2008380 20071d0: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 20071d4: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 20071d8: 40 00 05 79 call 20087bc 20071dc: c2 27 bf d8 st %g1, [ %fp + -40 ] 20071e0: d2 07 60 08 ld [ %i5 + 8 ], %o1 20071e4: 40 00 05 7a call 20087cc 20071e8: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20071ec: 40 00 09 fb call 20099d8 <_Chain_Extract> 20071f0: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 20071f4: 40 00 03 5d call 2007f68 20071f8: 90 10 00 1c mov %i4, %o0 switch (req->aiocbp->aio_lio_opcode) { 20071fc: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 2007200: c2 04 60 30 ld [ %l1 + 0x30 ], %g1 2007204: 80 a0 60 02 cmp %g1, 2 2007208: 22 80 00 25 be,a 200729c 200720c: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 2007210: 80 a0 60 03 cmp %g1, 3 2007214: 02 80 00 1e be 200728c <== NEVER TAKEN 2007218: 01 00 00 00 nop 200721c: 80 a0 60 01 cmp %g1, 1 2007220: 22 80 00 0e be,a 2007258 <== ALWAYS TAKEN 2007224: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2007228: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 200722c: 40 00 2a ed call 2011de0 <__errno> <== NOT EXECUTED 2007230: c2 24 60 38 st %g1, [ %l1 + 0x38 ] <== NOT EXECUTED 2007234: 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); 2007238: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 200723c: 40 00 03 2b call 2007ee8 <== NOT EXECUTED 2007240: c2 24 60 34 st %g1, [ %l1 + 0x34 ] <== NOT EXECUTED if (result != 0) 2007244: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2007248: 22 bf ff da be,a 20071b0 <== NOT EXECUTED 200724c: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 2007250: 81 c7 e0 08 ret 2007254: 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, 2007258: d0 04 40 00 ld [ %l1 ], %o0 200725c: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 2007260: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 2007264: 96 10 00 02 mov %g2, %o3 2007268: 40 00 2d fa call 2012a50 200726c: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 2007270: 80 a2 3f ff cmp %o0, -1 2007274: 22 bf ff ed be,a 2007228 <== NEVER TAKEN 2007278: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 <== NOT EXECUTED req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 200727c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2007280: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2007284: 10 bf ff c5 b 2007198 2007288: 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); 200728c: 40 00 1d 06 call 200e6a4 <== NOT EXECUTED 2007290: d0 04 40 00 ld [ %l1 ], %o0 <== NOT EXECUTED break; 2007294: 10 bf ff f8 b 2007274 <== NOT EXECUTED 2007298: 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, 200729c: d0 04 40 00 ld [ %l1 ], %o0 20072a0: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 20072a4: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 20072a8: 96 10 00 02 mov %g2, %o3 20072ac: 40 00 2e 27 call 2012b48 20072b0: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 20072b4: 10 bf ff f0 b 2007274 20072b8: 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); 20072bc: 40 00 03 2b call 2007f68 20072c0: 90 10 00 1c mov %i4, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 20072c4: 40 00 03 09 call 2007ee8 20072c8: 90 10 00 1b mov %i3, %o0 if (rtems_chain_is_empty (chain)) 20072cc: c2 06 20 08 ld [ %i0 + 8 ], %g1 20072d0: 80 a7 40 01 cmp %i5, %g1 20072d4: 02 80 00 05 be 20072e8 <== ALWAYS TAKEN 20072d8: 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); 20072dc: 40 00 03 23 call 2007f68 20072e0: 90 10 00 1b mov %i3, %o0 20072e4: 30 bf ff ad b,a 2007198 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 20072e8: 40 00 01 50 call 2007828 20072ec: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20072f0: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20072f4: 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; 20072f8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20072fc: 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; 2007300: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007304: 90 10 00 1d mov %i5, %o0 2007308: 92 10 00 1a mov %i2, %o1 200730c: 40 00 01 f3 call 2007ad8 2007310: 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) { 2007314: 80 a2 20 74 cmp %o0, 0x74 2007318: 12 bf ff f1 bne 20072dc <== NEVER TAKEN 200731c: 01 00 00 00 nop 2007320: 40 00 09 ae call 20099d8 <_Chain_Extract> 2007324: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2007328: 40 00 02 46 call 2007c40 200732c: 90 10 00 1c mov %i4, %o0 pthread_cond_destroy (&r_chain->cond); 2007330: 40 00 01 66 call 20078c8 2007334: 90 10 00 1d mov %i5, %o0 free (r_chain); 2007338: 7f ff f0 cb call 2003664 200733c: 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; 2007340: 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)) { 2007344: 80 a6 00 19 cmp %i0, %i1 2007348: 22 80 00 0e be,a 2007380 200734c: 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; 2007350: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2 ++aio_request_queue.active_threads; 2007354: c2 06 a0 64 ld [ %i2 + 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; 2007358: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 200735c: 82 00 60 01 inc %g1 2007360: 90 10 00 18 mov %i0, %o0 } } /* 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; 2007364: c4 26 a0 68 st %g2, [ %i2 + 0x68 ] 2007368: 40 00 09 9c call 20099d8 <_Chain_Extract> 200736c: c2 26 a0 64 st %g1, [ %i2 + 0x64 ] 2007370: b8 06 20 1c add %i0, 0x1c, %i4 node = rtems_chain_first (&aio_request_queue.idle_req); rtems_chain_extract (node); r_chain = (rtems_aio_request_chain *) node; rtems_aio_move_to_work (r_chain); 2007374: 7f ff ff 64 call 2007104 2007378: 90 10 00 18 mov %i0, %o0 200737c: 30 bf ff d8 b,a 20072dc 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; 2007380: 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; 2007384: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 2007388: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 200738c: 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; 2007390: c4 26 e0 68 st %g2, [ %i3 + 0x68 ] --aio_request_queue.active_threads; 2007394: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 2007398: 40 00 01 24 call 2007828 200739c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20073a0: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20073a4: 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; 20073a8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073ac: 90 10 00 10 mov %l0, %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; 20073b0: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073b4: 92 10 00 1b mov %i3, %o1 20073b8: 40 00 01 c8 call 2007ad8 20073bc: 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) { 20073c0: 80 a2 20 74 cmp %o0, 0x74 20073c4: 22 80 00 04 be,a 20073d4 <== ALWAYS TAKEN 20073c8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20073cc: 10 bf ff e1 b 2007350 <== NOT EXECUTED 20073d0: 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); 20073d4: 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; 20073d8: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20073dc: 40 00 02 e3 call 2007f68 20073e0: c2 26 e0 68 st %g1, [ %i3 + 0x68 ] return NULL; 20073e4: 30 bf ff 9b b,a 2007250 =============================================================================== 02006f18 : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2006f18: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006f1c: 3b 00 80 66 sethi %hi(0x2019800), %i5 2006f20: 40 00 04 5c call 2008090 2006f24: 90 17 61 14 or %i5, 0x114, %o0 ! 2019914 if (result != 0) 2006f28: b0 92 20 00 orcc %o0, 0, %i0 2006f2c: 12 80 00 23 bne 2006fb8 <== NEVER TAKEN 2006f30: 90 17 61 14 or %i5, 0x114, %o0 return result; result = 2006f34: 40 00 04 63 call 20080c0 2006f38: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006f3c: 80 a2 20 00 cmp %o0, 0 2006f40: 12 80 00 20 bne 2006fc0 <== NEVER TAKEN 2006f44: 39 00 80 66 sethi %hi(0x2019800), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006f48: 92 10 20 00 clr %o1 2006f4c: 40 00 03 90 call 2007d8c 2006f50: 90 17 21 0c or %i4, 0x10c, %o0 if (result != 0) 2006f54: 80 a2 20 00 cmp %o0, 0 2006f58: 12 80 00 23 bne 2006fe4 <== NEVER TAKEN 2006f5c: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006f60: 11 00 80 66 sethi %hi(0x2019800), %o0 2006f64: 40 00 02 8f call 20079a0 2006f68: 90 12 21 10 or %o0, 0x110, %o0 ! 2019910 if (result != 0) { 2006f6c: b0 92 20 00 orcc %o0, 0, %i0 2006f70: 12 80 00 26 bne 2007008 <== NEVER TAKEN 2006f74: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f78: b8 17 21 0c or %i4, 0x10c, %i4 head->previous = NULL; tail->previous = head; 2006f7c: 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; 2006f80: 88 07 20 4c add %i4, 0x4c, %g4 head->previous = NULL; tail->previous = head; 2006f84: 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; 2006f88: 84 07 20 58 add %i4, 0x58, %g2 head->previous = NULL; tail->previous = head; 2006f8c: 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; 2006f90: c8 27 20 48 st %g4, [ %i4 + 0x48 ] head->previous = NULL; 2006f94: c0 27 20 4c clr [ %i4 + 0x4c ] tail->previous = head; 2006f98: 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; 2006f9c: c4 27 20 54 st %g2, [ %i4 + 0x54 ] head->previous = NULL; 2006fa0: 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; 2006fa4: c0 27 20 64 clr [ %i4 + 0x64 ] aio_request_queue.idle_threads = 0; 2006fa8: c0 27 20 68 clr [ %i4 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006fac: 03 00 00 2c sethi %hi(0xb000), %g1 2006fb0: 82 10 60 0b or %g1, 0xb, %g1 ! b00b 2006fb4: c2 27 20 60 st %g1, [ %i4 + 0x60 ] return result; } 2006fb8: 81 c7 e0 08 ret 2006fbc: 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); 2006fc0: 40 00 04 28 call 2008060 <== NOT EXECUTED 2006fc4: 90 17 61 14 or %i5, 0x114, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006fc8: 39 00 80 66 sethi %hi(0x2019800), %i4 <== NOT EXECUTED 2006fcc: 92 10 20 00 clr %o1 <== NOT EXECUTED 2006fd0: 40 00 03 6f call 2007d8c <== NOT EXECUTED 2006fd4: 90 17 21 0c or %i4, 0x10c, %o0 <== NOT EXECUTED if (result != 0) 2006fd8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2006fdc: 02 bf ff e1 be 2006f60 <== NOT EXECUTED 2006fe0: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006fe4: 40 00 04 1f call 2008060 <== NOT EXECUTED 2006fe8: 90 17 61 14 or %i5, 0x114, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006fec: 92 10 20 00 clr %o1 <== NOT EXECUTED 2006ff0: 11 00 80 66 sethi %hi(0x2019800), %o0 <== NOT EXECUTED 2006ff4: 40 00 02 6b call 20079a0 <== NOT EXECUTED 2006ff8: 90 12 21 10 or %o0, 0x110, %o0 ! 2019910 <== NOT EXECUTED if (result != 0) { 2006ffc: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2007000: 22 bf ff df be,a 2006f7c <== NOT EXECUTED 2007004: b8 17 21 0c or %i4, 0x10c, %i4 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 2007008: 40 00 03 0e call 2007c40 <== NOT EXECUTED 200700c: 90 17 21 0c or %i4, 0x10c, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007010: 40 00 04 14 call 2008060 <== NOT EXECUTED 2007014: 90 17 61 14 or %i5, 0x114, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007018: 10 bf ff d9 b 2006f7c <== NOT EXECUTED 200701c: b8 17 21 0c or %i4, 0x10c, %i4 <== NOT EXECUTED =============================================================================== 020073e8 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 20073e8: 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; 20073ec: 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 ); 20073f0: 84 06 20 04 add %i0, 4, %g2 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 20073f4: 80 a0 40 02 cmp %g1, %g2 20073f8: 02 80 00 15 be 200744c <== NEVER TAKEN 20073fc: 86 10 00 19 mov %i1, %g3 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 && 2007400: de 06 60 14 ld [ %i1 + 0x14 ], %o7 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; 2007404: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2007408: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 200740c: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 2007410: 80 a1 00 0f cmp %g4, %o7 2007414: 26 80 00 07 bl,a 2007430 <== NEVER TAKEN 2007418: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 200741c: 10 80 00 0b b 2007448 2007420: f0 00 60 04 ld [ %g1 + 4 ], %i0 2007424: 22 80 00 09 be,a 2007448 <== NOT EXECUTED 2007428: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 200742c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007430: 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 && 2007434: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 2007438: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 200743c: 06 bf ff fa bl 2007424 <== NOT EXECUTED 2007440: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007444: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 2007448: b2 10 00 03 mov %g3, %i1 200744c: 40 00 09 7b call 2009a38 <_Chain_Insert> 2007450: 81 e8 00 00 restore =============================================================================== 02007104 : * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007104: 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; 2007108: 05 00 80 66 sethi %hi(0x2019800), %g2 200710c: 84 10 a1 0c or %g2, 0x10c, %g2 ! 201990c 2007110: c2 00 a0 48 ld [ %g2 + 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 && 2007114: de 06 20 14 ld [ %i0 + 0x14 ], %o7 2007118: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 200711c: b2 10 00 18 mov %i0, %i1 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 && 2007120: 80 a1 00 0f cmp %g4, %o7 2007124: 16 80 00 10 bge 2007164 <== NEVER TAKEN 2007128: 86 10 00 01 mov %g1, %g3 200712c: 84 00 a0 4c add %g2, 0x4c, %g2 2007130: 80 a0 40 02 cmp %g1, %g2 2007134: 32 80 00 08 bne,a 2007154 <== ALWAYS TAKEN 2007138: c6 00 40 00 ld [ %g1 ], %g3 200713c: 10 80 00 0b b 2007168 2007140: f0 00 e0 04 ld [ %g3 + 4 ], %i0 2007144: 80 a0 c0 02 cmp %g3, %g2 2007148: 02 80 00 0a be 2007170 <== NEVER TAKEN 200714c: 86 10 00 02 mov %g2, %g3 } } AIO_printf ("Thread finished\n"); return NULL; } 2007150: c6 00 40 00 ld [ %g1 ], %g3 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 && 2007154: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 2007158: 80 a1 00 0f cmp %g4, %o7 200715c: 06 bf ff fa bl 2007144 2007160: 82 10 00 03 mov %g3, %g1 2007164: f0 00 e0 04 ld [ %g3 + 4 ], %i0 2007168: 40 00 0a 34 call 2009a38 <_Chain_Insert> 200716c: 81 e8 00 00 restore 2007170: f0 00 e0 04 ld [ %g3 + 4 ], %i0 2007174: 40 00 0a 31 call 2009a38 <_Chain_Insert> <== NOT EXECUTED 2007178: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007454 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2007454: 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; 2007458: 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; 200745c: 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)); 2007460: 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)) 2007464: 80 a7 40 18 cmp %i5, %i0 2007468: 02 80 00 0d be 200749c <== NEVER TAKEN 200746c: b6 10 3f ff mov -1, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007470: 40 00 09 5a call 20099d8 <_Chain_Extract> 2007474: 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; 2007478: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } } AIO_printf ("Thread finished\n"); return NULL; } 200747c: f8 07 40 00 ld [ %i5 ], %i4 rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; req->aiocbp->return_value = -1; free (req); 2007480: 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; 2007484: f4 20 60 34 st %i2, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 2007488: 7f ff f0 77 call 2003664 200748c: 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)) 2007490: 80 a7 00 18 cmp %i4, %i0 2007494: 12 bf ff f7 bne 2007470 2007498: ba 10 00 1c mov %i4, %i5 200749c: 81 c7 e0 08 ret 20074a0: 81 e8 00 00 restore =============================================================================== 020074a4 : * 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) { 20074a4: 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; 20074a8: 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 ); 20074ac: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 20074b0: 80 a7 40 01 cmp %i5, %g1 20074b4: 12 80 00 06 bne 20074cc 20074b8: b0 10 20 02 mov 2, %i0 20074bc: 30 80 00 14 b,a 200750c 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) { 20074c0: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 20074c4: 02 80 00 10 be 2007504 <== NOT EXECUTED 20074c8: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED 20074cc: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 20074d0: 80 a0 80 19 cmp %g2, %i1 20074d4: 32 bf ff fb bne,a 20074c0 <== NEVER TAKEN 20074d8: fa 07 40 00 ld [ %i5 ], %i5 20074dc: 40 00 09 3f call 20099d8 <_Chain_Extract> 20074e0: 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; 20074e4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20074e8: 84 10 20 8c mov 0x8c, %g2 20074ec: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 20074f0: 84 10 3f ff mov -1, %g2 free (current); 20074f4: 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; 20074f8: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 20074fc: 7f ff f0 5a call 2003664 2007500: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2007504: 81 c7 e0 08 ret 2007508: 81 e8 00 00 restore } 200750c: 81 c7 e0 08 ret 2007510: 81 e8 00 00 restore =============================================================================== 02007144 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007144: 9d e3 bf 98 save %sp, -104, %sp 2007148: 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 ); 200714c: 40 00 01 9b call 20077b8 <_Chain_Get> 2007150: 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( 2007154: 92 10 20 00 clr %o1 2007158: b8 10 00 08 mov %o0, %i4 200715c: 94 10 00 1a mov %i2, %o2 2007160: 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 2007164: 80 a7 20 00 cmp %i4, 0 2007168: 12 80 00 0a bne 2007190 200716c: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2007170: 7f ff fc f6 call 2006548 2007174: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2007178: 80 a2 20 00 cmp %o0, 0 200717c: 02 bf ff f4 be 200714c <== NEVER TAKEN 2007180: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 2007184: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007188: 81 c7 e0 08 ret 200718c: 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 2007190: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2007194: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007198: 81 c7 e0 08 ret 200719c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007dc0 : 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 ) { 2007dc0: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007dc4: 03 00 80 6b sethi %hi(0x201ac00), %g1 2007dc8: c4 00 62 d0 ld [ %g1 + 0x2d0 ], %g2 ! 201aed0 <_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 ) { 2007dcc: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2007dd0: 03 00 80 6c sethi %hi(0x201b000), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2007dd4: 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() ) 2007dd8: 80 a0 a0 00 cmp %g2, 0 2007ddc: 02 80 00 04 be 2007dec 2007de0: de 00 63 04 ld [ %g1 + 0x304 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007de4: 81 c7 e0 08 ret 2007de8: 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 ) 2007dec: 80 a6 a0 00 cmp %i2, 0 2007df0: 02 80 00 3f be 2007eec 2007df4: 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 ) 2007df8: 02 80 00 3d be 2007eec 2007dfc: 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; 2007e00: c4 06 40 00 ld [ %i1 ], %g2 2007e04: 80 a0 a0 00 cmp %g2, 0 2007e08: 22 80 00 36 be,a 2007ee0 2007e0c: 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 ) 2007e10: 80 a3 c0 18 cmp %o7, %i0 2007e14: 08 bf ff f4 bleu 2007de4 2007e18: 88 10 20 0a mov 0xa, %g4 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2007e1c: 05 00 80 6a sethi %hi(0x201a800), %g2 2007e20: c8 00 a1 90 ld [ %g2 + 0x190 ], %g4 ! 201a990 <_Thread_Dispatch_disable_level> 2007e24: 88 01 20 01 inc %g4 2007e28: c8 20 a1 90 st %g4, [ %g2 + 0x190 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2007e2c: 80 a6 20 00 cmp %i0, 0 2007e30: 12 80 00 32 bne 2007ef8 2007e34: 1f 00 80 6c sethi %hi(0x201b000), %o7 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2007e38: c8 00 63 04 ld [ %g1 + 0x304 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2007e3c: 80 a1 20 00 cmp %g4, 0 2007e40: 02 80 00 45 be 2007f54 <== NEVER TAKEN 2007e44: c2 03 e3 08 ld [ %o7 + 0x308 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e48: 10 80 00 06 b 2007e60 2007e4c: 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 ) { 2007e50: 80 a6 00 04 cmp %i0, %g4 2007e54: 02 80 00 35 be 2007f28 2007e58: 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; 2007e5c: c4 00 40 00 ld [ %g1 ], %g2 2007e60: 80 a0 a0 00 cmp %g2, 0 2007e64: 32 bf ff fb bne,a 2007e50 2007e68: b0 06 20 01 inc %i0 2007e6c: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007e70: 80 a0 a0 00 cmp %g2, 0 2007e74: 32 bf ff f7 bne,a 2007e50 2007e78: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007e7c: f0 26 80 00 st %i0, [ %i2 ] 2007e80: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2007e84: 80 a1 00 18 cmp %g4, %i0 2007e88: 02 80 00 29 be 2007f2c <== NEVER TAKEN 2007e8c: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007e90: c8 00 c0 00 ld [ %g3 ], %g4 2007e94: c4 03 e3 08 ld [ %o7 + 0x308 ], %g2 2007e98: 82 23 40 01 sub %o5, %g1, %g1 2007e9c: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2007ea0: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2007ea4: 82 00 80 01 add %g2, %g1, %g1 2007ea8: c8 20 60 04 st %g4, [ %g1 + 4 ] 2007eac: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007eb0: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007eb4: c4 20 60 08 st %g2, [ %g1 + 8 ] 2007eb8: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007ebc: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007ec0: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2007ec4: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2007ec8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2007ecc: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2007ed0: 40 00 08 64 call 200a060 <_Thread_Enable_dispatch> 2007ed4: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2007ed8: 40 00 23 4c call 2010c08 2007edc: 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; 2007ee0: 80 a0 a0 00 cmp %g2, 0 2007ee4: 12 bf ff cc bne 2007e14 2007ee8: 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; 2007eec: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007ef0: 81 c7 e0 08 ret 2007ef4: 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; 2007ef8: c8 03 e3 08 ld [ %o7 + 0x308 ], %g4 2007efc: 83 2e 20 03 sll %i0, 3, %g1 2007f00: 9b 2e 20 05 sll %i0, 5, %o5 2007f04: 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; 2007f08: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2007f0c: 80 a3 20 00 cmp %o4, 0 2007f10: 02 80 00 0b be 2007f3c 2007f14: 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(); 2007f18: 40 00 08 52 call 200a060 <_Thread_Enable_dispatch> 2007f1c: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2007f20: 10 bf ff b1 b 2007de4 2007f24: 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; 2007f28: 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(); 2007f2c: 40 00 08 4d call 200a060 <_Thread_Enable_dispatch> 2007f30: 01 00 00 00 nop return sc; 2007f34: 10 bf ff ac b 2007de4 2007f38: 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; 2007f3c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2007f40: 80 a0 a0 00 cmp %g2, 0 2007f44: 12 bf ff f5 bne 2007f18 2007f48: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2007f4c: 10 bf ff d1 b 2007e90 2007f50: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007f54: 10 bf ff f6 b 2007f2c <== NOT EXECUTED 2007f58: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 020094f4 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 20094f4: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 20094f8: 80 a6 20 00 cmp %i0, 0 20094fc: 02 80 00 20 be 200957c <== NEVER TAKEN 2009500: 37 00 80 80 sethi %hi(0x2020000), %i3 2009504: b6 16 e1 2c or %i3, 0x12c, %i3 ! 202012c <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 2009508: 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 ]; 200950c: c2 06 c0 00 ld [ %i3 ], %g1 2009510: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 2009514: 80 a7 20 00 cmp %i4, 0 2009518: 22 80 00 16 be,a 2009570 200951c: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009520: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 2009524: 84 90 60 00 orcc %g1, 0, %g2 2009528: 22 80 00 12 be,a 2009570 200952c: b6 06 e0 04 add %i3, 4, %i3 2009530: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 2009534: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 2009538: 83 2f 60 02 sll %i5, 2, %g1 200953c: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 2009540: 90 90 60 00 orcc %g1, 0, %o0 2009544: 02 80 00 05 be 2009558 2009548: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 200954c: 9f c6 00 00 call %i0 2009550: 01 00 00 00 nop 2009554: 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++ ) { 2009558: 83 28 a0 10 sll %g2, 0x10, %g1 200955c: 83 30 60 10 srl %g1, 0x10, %g1 2009560: 80 a0 40 1d cmp %g1, %i5 2009564: 3a bf ff f5 bcc,a 2009538 2009568: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200956c: 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++ ) { 2009570: 80 a6 c0 1a cmp %i3, %i2 2009574: 32 bf ff e7 bne,a 2009510 2009578: c2 06 c0 00 ld [ %i3 ], %g1 200957c: 81 c7 e0 08 ret 2009580: 81 e8 00 00 restore =============================================================================== 02008168 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 2008168: 9d e3 bf a0 save %sp, -96, %sp 200816c: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 2008170: 80 a6 a0 00 cmp %i2, 0 2008174: 02 80 00 21 be 20081f8 2008178: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 200817c: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 2008180: 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 ); 2008184: 40 00 07 71 call 2009f48 <_Objects_Get_information> 2008188: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 200818c: 80 a2 20 00 cmp %o0, 0 2008190: 02 80 00 1a be 20081f8 2008194: 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; 2008198: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 200819c: 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; 20081a0: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 20081a4: 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; 20081a8: 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; 20081ac: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 20081b0: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 20081b4: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 20081b8: 80 a1 20 00 cmp %g4, 0 20081bc: 02 80 00 0d be 20081f0 <== NEVER TAKEN 20081c0: 84 10 20 00 clr %g2 20081c4: de 02 20 1c ld [ %o0 + 0x1c ], %o7 20081c8: 86 10 20 01 mov 1, %g3 20081cc: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 20081d0: 87 28 e0 02 sll %g3, 2, %g3 20081d4: 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++ ) 20081d8: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 20081dc: 80 a0 00 03 cmp %g0, %g3 20081e0: 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++ ) 20081e4: 80 a1 00 01 cmp %g4, %g1 20081e8: 1a bf ff fa bcc 20081d0 20081ec: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 20081f0: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 20081f4: b0 10 20 00 clr %i0 } 20081f8: 81 c7 e0 08 ret 20081fc: 81 e8 00 00 restore =============================================================================== 02013e74 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2013e74: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013e78: 80 a6 20 00 cmp %i0, 0 2013e7c: 12 80 00 04 bne 2013e8c 2013e80: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013e84: 81 c7 e0 08 ret 2013e88: 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 ) 2013e8c: 80 a6 60 00 cmp %i1, 0 2013e90: 02 bf ff fd be 2013e84 2013e94: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013e98: 80 a7 60 00 cmp %i5, 0 2013e9c: 02 bf ff fa be 2013e84 <== NEVER TAKEN 2013ea0: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013ea4: 02 bf ff f8 be 2013e84 2013ea8: 82 10 20 08 mov 8, %g1 2013eac: 80 a6 a0 00 cmp %i2, 0 2013eb0: 02 bf ff f5 be 2013e84 2013eb4: 80 a6 80 1b cmp %i2, %i3 2013eb8: 0a bf ff f3 bcs 2013e84 2013ebc: 80 8e e0 07 btst 7, %i3 2013ec0: 12 bf ff f1 bne 2013e84 2013ec4: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2013ec8: 12 bf ff ef bne 2013e84 2013ecc: 82 10 20 09 mov 9, %g1 2013ed0: 03 00 80 f6 sethi %hi(0x203d800), %g1 2013ed4: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 203db30 <_Thread_Dispatch_disable_level> 2013ed8: 84 00 a0 01 inc %g2 2013edc: c4 20 63 30 st %g2, [ %g1 + 0x330 ] * 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 ); 2013ee0: 23 00 80 f6 sethi %hi(0x203d800), %l1 2013ee4: 40 00 13 40 call 2018be4 <_Objects_Allocate> 2013ee8: 90 14 61 44 or %l1, 0x144, %o0 ! 203d944 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2013eec: a0 92 20 00 orcc %o0, 0, %l0 2013ef0: 02 80 00 1a be 2013f58 2013ef4: 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; 2013ef8: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2013efc: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2013f00: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2013f04: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2013f08: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2013f0c: 40 00 65 2f call 202d3c8 <.udiv> 2013f10: 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, 2013f14: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2013f18: 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, 2013f1c: 96 10 00 1b mov %i3, %o3 2013f20: b8 04 20 24 add %l0, 0x24, %i4 2013f24: 40 00 0c cd call 2017258 <_Chain_Initialize> 2013f28: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013f2c: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013f30: a2 14 61 44 or %l1, 0x144, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013f34: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013f38: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013f3c: 85 28 a0 02 sll %g2, 2, %g2 2013f40: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2013f44: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2013f48: 40 00 18 43 call 201a054 <_Thread_Enable_dispatch> 2013f4c: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2013f50: 10 bf ff cd b 2013e84 2013f54: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2013f58: 40 00 18 3f call 201a054 <_Thread_Enable_dispatch> 2013f5c: 01 00 00 00 nop return RTEMS_TOO_MANY; 2013f60: 10 bf ff c9 b 2013e84 2013f64: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 020075d0 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 20075d0: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get ( Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) 20075d4: 11 00 80 7d sethi %hi(0x201f400), %o0 20075d8: 92 10 00 18 mov %i0, %o1 20075dc: 90 12 20 04 or %o0, 4, %o0 20075e0: 40 00 09 6a call 2009b88 <_Objects_Get> 20075e4: 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 ) { 20075e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20075ec: 80 a0 60 00 cmp %g1, 0 20075f0: 12 80 00 0d bne 2007624 20075f4: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 20075f8: 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 ); 20075fc: 39 00 80 7e sethi %hi(0x201f800), %i4 2007600: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201faa8 <_Per_CPU_Information> 2007604: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007608: 80 a0 80 01 cmp %g2, %g1 200760c: 02 80 00 08 be 200762c 2007610: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 2007614: 40 00 0d 1e call 200aa8c <_Thread_Enable_dispatch> 2007618: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 200761c: 81 c7 e0 08 ret 2007620: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007624: 81 c7 e0 08 ret 2007628: 91 e8 20 04 restore %g0, 4, %o0 if ( !_Thread_Is_executing( the_period->owner ) ) { _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { 200762c: 12 80 00 0e bne 2007664 2007630: 01 00 00 00 nop switch ( the_period->state ) { 2007634: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007638: 80 a0 60 04 cmp %g1, 4 200763c: 18 80 00 06 bgu 2007654 <== NEVER TAKEN 2007640: b0 10 20 00 clr %i0 2007644: 83 28 60 02 sll %g1, 2, %g1 2007648: 05 00 80 74 sethi %hi(0x201d000), %g2 200764c: 84 10 a1 fc or %g2, 0x1fc, %g2 ! 201d1fc 2007650: 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 ); _Thread_Enable_dispatch(); 2007654: 40 00 0d 0e call 200aa8c <_Thread_Enable_dispatch> 2007658: 01 00 00 00 nop return RTEMS_TIMEOUT; 200765c: 81 c7 e0 08 ret 2007660: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 2007664: 7f ff ed e2 call 2002dec 2007668: 01 00 00 00 nop 200766c: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2007670: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 2007674: 80 a6 e0 00 cmp %i3, 0 2007678: 02 80 00 14 be 20076c8 200767c: 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 ) { 2007680: 02 80 00 29 be 2007724 2007684: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2007688: 12 bf ff e5 bne 200761c <== NEVER TAKEN 200768c: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2007690: 7f ff ff 92 call 20074d8 <_Rate_monotonic_Update_statistics> 2007694: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 2007698: 7f ff ed d9 call 2002dfc 200769c: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20076a0: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076a4: 92 07 60 10 add %i5, 0x10, %o1 20076a8: 11 00 80 7d sethi %hi(0x201f400), %o0 the_period->next_length = length; 20076ac: f2 27 60 3c st %i1, [ %i5 + 0x3c ] 20076b0: 90 12 22 34 or %o0, 0x234, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 20076b4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076b8: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076bc: 40 00 11 41 call 200bbc0 <_Watchdog_Insert> 20076c0: b0 10 20 06 mov 6, %i0 20076c4: 30 bf ff e4 b,a 2007654 return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 20076c8: 7f ff ed cd call 2002dfc 20076cc: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20076d0: 7f ff ff 68 call 2007470 <_Rate_monotonic_Initiate_statistics> 20076d4: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20076d8: 82 10 20 02 mov 2, %g1 20076dc: 92 07 60 10 add %i5, 0x10, %o1 20076e0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20076e4: 11 00 80 7d sethi %hi(0x201f400), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076e8: 03 00 80 1e sethi %hi(0x2007800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076ec: 90 12 22 34 or %o0, 0x234, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076f0: 82 10 62 74 or %g1, 0x274, %g1 the_watchdog->id = id; 20076f4: f0 27 60 30 st %i0, [ %i5 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076f8: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20076fc: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 2007700: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 2007704: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007708: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200770c: 40 00 11 2d call 200bbc0 <_Watchdog_Insert> 2007710: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 2007714: 40 00 0c de call 200aa8c <_Thread_Enable_dispatch> 2007718: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 200771c: 81 c7 e0 08 ret 2007720: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007724: 7f ff ff 6d call 20074d8 <_Rate_monotonic_Update_statistics> 2007728: 90 10 00 1d mov %i5, %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; 200772c: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007730: f2 27 60 3c st %i1, [ %i5 + 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; 2007734: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007738: 7f ff ed b1 call 2002dfc 200773c: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007740: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007744: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007748: 90 10 00 01 mov %g1, %o0 200774c: 13 00 00 10 sethi %hi(0x4000), %o1 2007750: 40 00 0f 26 call 200b3e8 <_Thread_Set_state> 2007754: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007758: 7f ff ed a5 call 2002dec 200775c: 01 00 00 00 nop local_state = the_period->state; 2007760: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 2007764: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007768: 7f ff ed a5 call 2002dfc 200776c: 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 ) 2007770: 80 a6 a0 03 cmp %i2, 3 2007774: 22 80 00 06 be,a 200778c 2007778: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 200777c: 40 00 0c c4 call 200aa8c <_Thread_Enable_dispatch> 2007780: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2007784: 81 c7 e0 08 ret 2007788: 81 e8 00 00 restore /* * 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 ); 200778c: 40 00 0b d1 call 200a6d0 <_Thread_Clear_state> 2007790: 13 00 00 10 sethi %hi(0x4000), %o1 2007794: 30 bf ff fa b,a 200777c =============================================================================== 02007798 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007798: 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 ) 200779c: 80 a6 60 00 cmp %i1, 0 20077a0: 02 80 00 48 be 20078c0 <== NEVER TAKEN 20077a4: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 20077a8: 13 00 80 74 sethi %hi(0x201d000), %o1 20077ac: 9f c6 40 00 call %i1 20077b0: 92 12 62 10 or %o1, 0x210, %o1 ! 201d210 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 20077b4: 90 10 00 18 mov %i0, %o0 20077b8: 13 00 80 74 sethi %hi(0x201d000), %o1 20077bc: 9f c6 40 00 call %i1 20077c0: 92 12 62 30 or %o1, 0x230, %o1 ! 201d230 (*print)( context, "--- Wall times are in seconds ---\n" ); 20077c4: 90 10 00 18 mov %i0, %o0 20077c8: 13 00 80 74 sethi %hi(0x201d000), %o1 20077cc: 9f c6 40 00 call %i1 20077d0: 92 12 62 58 or %o1, 0x258, %o1 ! 201d258 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 20077d4: 90 10 00 18 mov %i0, %o0 20077d8: 13 00 80 74 sethi %hi(0x201d000), %o1 20077dc: 9f c6 40 00 call %i1 20077e0: 92 12 62 80 or %o1, 0x280, %o1 ! 201d280 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 20077e4: 90 10 00 18 mov %i0, %o0 20077e8: 13 00 80 74 sethi %hi(0x201d000), %o1 20077ec: 9f c6 40 00 call %i1 20077f0: 92 12 62 d0 or %o1, 0x2d0, %o1 ! 201d2d0 /* * 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 ; 20077f4: 39 00 80 7d sethi %hi(0x201f400), %i4 20077f8: b8 17 20 04 or %i4, 4, %i4 ! 201f404 <_Rate_monotonic_Information> 20077fc: fa 07 20 08 ld [ %i4 + 8 ], %i5 2007800: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007804: 80 a7 40 01 cmp %i5, %g1 2007808: 18 80 00 2e bgu 20078c0 <== NEVER TAKEN 200780c: 35 00 80 74 sethi %hi(0x201d000), %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, 2007810: 23 00 80 74 sethi %hi(0x201d000), %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, 2007814: 21 00 80 74 sethi %hi(0x201d000), %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007818: 37 00 80 71 sethi %hi(0x201c400), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200781c: b4 16 a3 20 or %i2, 0x320, %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, 2007820: a2 14 63 38 or %l1, 0x338, %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, 2007824: a0 14 23 58 or %l0, 0x358, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007828: 10 80 00 06 b 2007840 200782c: b6 16 e1 18 or %i3, 0x118, %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++ ) { 2007830: 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 ; 2007834: 80 a0 40 1d cmp %g1, %i5 2007838: 0a 80 00 22 bcs 20078c0 200783c: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007840: 90 10 00 1d mov %i5, %o0 2007844: 40 00 1b 27 call 200e4e0 2007848: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 200784c: 80 a2 20 00 cmp %o0, 0 2007850: 32 bf ff f8 bne,a 2007830 2007854: 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 ); 2007858: 92 07 bf d8 add %fp, -40, %o1 200785c: 40 00 1b 50 call 200e59c 2007860: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2007864: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007868: 92 10 20 05 mov 5, %o1 200786c: 40 00 00 b2 call 2007b34 2007870: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007874: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2007878: 92 10 00 1a mov %i2, %o1 200787c: 94 10 00 1d mov %i5, %o2 2007880: 90 10 00 18 mov %i0, %o0 2007884: 9f c6 40 00 call %i1 2007888: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 200788c: 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 ); 2007890: 94 07 bf f0 add %fp, -16, %o2 2007894: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007898: 80 a0 60 00 cmp %g1, 0 200789c: 12 80 00 0b bne 20078c8 20078a0: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 20078a4: 9f c6 40 00 call %i1 20078a8: 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 ; 20078ac: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20078b0: 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 ; 20078b4: 80 a0 40 1d cmp %g1, %i5 20078b8: 1a bf ff e3 bcc 2007844 <== ALWAYS TAKEN 20078bc: 90 10 00 1d mov %i5, %o0 20078c0: 81 c7 e0 08 ret 20078c4: 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 ); 20078c8: 40 00 0f 82 call 200b6d0 <_Timespec_Divide_by_integer> 20078cc: 92 10 00 01 mov %g1, %o1 (*print)( context, 20078d0: d0 07 bf ac ld [ %fp + -84 ], %o0 20078d4: 40 00 49 71 call 2019e98 <.div> 20078d8: 92 10 23 e8 mov 0x3e8, %o1 20078dc: aa 10 00 08 mov %o0, %l5 20078e0: d0 07 bf b4 ld [ %fp + -76 ], %o0 20078e4: 40 00 49 6d call 2019e98 <.div> 20078e8: 92 10 23 e8 mov 0x3e8, %o1 20078ec: c2 07 bf f0 ld [ %fp + -16 ], %g1 20078f0: a6 10 00 08 mov %o0, %l3 20078f4: d0 07 bf f4 ld [ %fp + -12 ], %o0 20078f8: e4 07 bf a8 ld [ %fp + -88 ], %l2 20078fc: e8 07 bf b0 ld [ %fp + -80 ], %l4 2007900: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007904: 40 00 49 65 call 2019e98 <.div> 2007908: 92 10 23 e8 mov 0x3e8, %o1 200790c: 96 10 00 15 mov %l5, %o3 2007910: 98 10 00 14 mov %l4, %o4 2007914: 9a 10 00 13 mov %l3, %o5 2007918: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 200791c: 92 10 00 11 mov %l1, %o1 2007920: 94 10 00 12 mov %l2, %o2 2007924: 9f c6 40 00 call %i1 2007928: 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); 200792c: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007930: 94 07 bf f0 add %fp, -16, %o2 2007934: 40 00 0f 67 call 200b6d0 <_Timespec_Divide_by_integer> 2007938: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 200793c: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007940: 40 00 49 56 call 2019e98 <.div> 2007944: 92 10 23 e8 mov 0x3e8, %o1 2007948: a8 10 00 08 mov %o0, %l4 200794c: d0 07 bf cc ld [ %fp + -52 ], %o0 2007950: 40 00 49 52 call 2019e98 <.div> 2007954: 92 10 23 e8 mov 0x3e8, %o1 2007958: c2 07 bf f0 ld [ %fp + -16 ], %g1 200795c: a4 10 00 08 mov %o0, %l2 2007960: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007964: ea 07 bf c0 ld [ %fp + -64 ], %l5 2007968: e6 07 bf c8 ld [ %fp + -56 ], %l3 200796c: 92 10 23 e8 mov 0x3e8, %o1 2007970: 40 00 49 4a call 2019e98 <.div> 2007974: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007978: 92 10 00 10 mov %l0, %o1 200797c: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007980: 94 10 00 15 mov %l5, %o2 2007984: 90 10 00 18 mov %i0, %o0 2007988: 96 10 00 14 mov %l4, %o3 200798c: 98 10 00 13 mov %l3, %o4 2007990: 9f c6 40 00 call %i1 2007994: 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 ; 2007998: 10 bf ff a6 b 2007830 200799c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 020079b8 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 20079b8: 9d e3 bf a0 save %sp, -96, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 20079bc: 03 00 80 7d sethi %hi(0x201f400), %g1 20079c0: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 201f570 <_Thread_Dispatch_disable_level> 20079c4: 84 00 a0 01 inc %g2 20079c8: c4 20 61 70 st %g2, [ %g1 + 0x170 ] /* * 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 ; 20079cc: 39 00 80 7d sethi %hi(0x201f400), %i4 20079d0: b8 17 20 04 or %i4, 4, %i4 ! 201f404 <_Rate_monotonic_Information> 20079d4: fa 07 20 08 ld [ %i4 + 8 ], %i5 20079d8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20079dc: 80 a7 40 01 cmp %i5, %g1 20079e0: 18 80 00 09 bgu 2007a04 <== NEVER TAKEN 20079e4: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 20079e8: 40 00 00 09 call 2007a0c 20079ec: 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 ; 20079f0: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20079f4: 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 ; 20079f8: 80 a0 40 1d cmp %g1, %i5 20079fc: 1a bf ff fb bcc 20079e8 2007a00: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2007a04: 40 00 0c 22 call 200aa8c <_Thread_Enable_dispatch> 2007a08: 81 e8 00 00 restore =============================================================================== 02015418 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2015418: 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 ) 201541c: 80 a6 60 00 cmp %i1, 0 2015420: 12 80 00 04 bne 2015430 2015424: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015428: 81 c7 e0 08 ret 201542c: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2015430: 90 10 00 18 mov %i0, %o0 2015434: 40 00 13 14 call 201a084 <_Thread_Get> 2015438: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201543c: c2 07 bf fc ld [ %fp + -4 ], %g1 2015440: 80 a0 60 00 cmp %g1, 0 2015444: 12 80 00 20 bne 20154c4 2015448: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 201544c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2015450: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2015454: 80 a0 60 00 cmp %g1, 0 2015458: 02 80 00 1e be 20154d0 201545c: 01 00 00 00 nop if ( asr->is_enabled ) { 2015460: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2015464: 80 a0 60 00 cmp %g1, 0 2015468: 02 80 00 1e be 20154e0 201546c: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015470: 7f ff e6 9a call 200eed8 2015474: 01 00 00 00 nop *signal_set |= signals; 2015478: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 201547c: b2 10 40 19 or %g1, %i1, %i1 2015480: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2015484: 7f ff e6 99 call 200eee8 2015488: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201548c: 03 00 80 f8 sethi %hi(0x203e000), %g1 2015490: 82 10 60 70 or %g1, 0x70, %g1 ! 203e070 <_Per_CPU_Information> 2015494: c4 00 60 08 ld [ %g1 + 8 ], %g2 2015498: 80 a0 a0 00 cmp %g2, 0 201549c: 02 80 00 06 be 20154b4 20154a0: 01 00 00 00 nop 20154a4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20154a8: 80 a7 00 02 cmp %i4, %g2 20154ac: 02 80 00 15 be 2015500 <== ALWAYS TAKEN 20154b0: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 20154b4: 40 00 12 e8 call 201a054 <_Thread_Enable_dispatch> 20154b8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20154bc: 10 bf ff db b 2015428 20154c0: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20154c4: 82 10 20 04 mov 4, %g1 } 20154c8: 81 c7 e0 08 ret 20154cc: 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(); 20154d0: 40 00 12 e1 call 201a054 <_Thread_Enable_dispatch> 20154d4: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 20154d8: 10 bf ff d4 b 2015428 20154dc: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 20154e0: 7f ff e6 7e call 200eed8 20154e4: 01 00 00 00 nop *signal_set |= signals; 20154e8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20154ec: b2 10 40 19 or %g1, %i1, %i1 20154f0: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 20154f4: 7f ff e6 7d call 200eee8 20154f8: 01 00 00 00 nop 20154fc: 30 bf ff ee b,a 20154b4 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; 2015500: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015504: 30 bf ff ec b,a 20154b4 =============================================================================== 0200ea60 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200ea60: 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 ) 200ea64: 80 a6 a0 00 cmp %i2, 0 200ea68: 02 80 00 3b be 200eb54 200ea6c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200ea70: 21 00 80 5b sethi %hi(0x2016c00), %l0 200ea74: a0 14 21 98 or %l0, 0x198, %l0 ! 2016d98 <_Per_CPU_Information> 200ea78: 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; 200ea7c: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200ea80: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200ea84: 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 ]; 200ea88: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200ea8c: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200ea90: 80 a0 60 00 cmp %g1, 0 200ea94: 12 80 00 40 bne 200eb94 200ea98: 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; 200ea9c: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 200eaa0: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200eaa4: 7f ff ee 14 call 200a2f4 <_CPU_ISR_Get_level> 200eaa8: 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; 200eaac: a3 2c 60 0a sll %l1, 0xa, %l1 200eab0: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200eab4: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200eab8: 80 8e 61 00 btst 0x100, %i1 200eabc: 02 80 00 06 be 200ead4 200eac0: 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; 200eac4: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200eac8: 80 a0 00 01 cmp %g0, %g1 200eacc: 82 60 3f ff subx %g0, -1, %g1 200ead0: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200ead4: 80 8e 62 00 btst 0x200, %i1 200ead8: 12 80 00 21 bne 200eb5c 200eadc: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200eae0: 80 8e 60 0f btst 0xf, %i1 200eae4: 12 80 00 27 bne 200eb80 200eae8: 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 ) { 200eaec: 80 8e 64 00 btst 0x400, %i1 200eaf0: 02 80 00 14 be 200eb40 200eaf4: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200eaf8: 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; 200eafc: 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( 200eb00: 80 a0 00 18 cmp %g0, %i0 200eb04: 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 ) { 200eb08: 80 a0 80 01 cmp %g2, %g1 200eb0c: 22 80 00 0e be,a 200eb44 200eb10: 03 00 80 5a sethi %hi(0x2016800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200eb14: 7f ff cd 0f call 2001f50 200eb18: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 200eb1c: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200eb20: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 200eb24: 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; 200eb28: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200eb2c: 7f ff cd 0d call 2001f60 200eb30: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200eb34: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200eb38: 80 a0 00 01 cmp %g0, %g1 200eb3c: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200eb40: 03 00 80 5a sethi %hi(0x2016800), %g1 200eb44: c4 00 61 bc ld [ %g1 + 0x1bc ], %g2 ! 20169bc <_System_state_Current> 200eb48: 80 a0 a0 03 cmp %g2, 3 200eb4c: 02 80 00 1f be 200ebc8 200eb50: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 200eb54: 81 c7 e0 08 ret 200eb58: 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) ) { 200eb5c: 22 bf ff e1 be,a 200eae0 200eb60: c0 27 60 7c clr [ %i5 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200eb64: 03 00 80 59 sethi %hi(0x2016400), %g1 200eb68: c2 00 63 c4 ld [ %g1 + 0x3c4 ], %g1 ! 20167c4 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200eb6c: 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; 200eb70: c2 27 60 78 st %g1, [ %i5 + 0x78 ] 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; 200eb74: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200eb78: 02 bf ff dd be 200eaec 200eb7c: c2 27 60 7c st %g1, [ %i5 + 0x7c ] */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 200eb80: 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 ) ); 200eb84: 7f ff cc f7 call 2001f60 200eb88: 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 ) { 200eb8c: 10 bf ff d9 b 200eaf0 200eb90: 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; 200eb94: 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; 200eb98: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200eb9c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200eba0: 7f ff ed d5 call 200a2f4 <_CPU_ISR_Get_level> 200eba4: 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; 200eba8: a3 2c 60 0a sll %l1, 0xa, %l1 200ebac: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200ebb0: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200ebb4: 80 8e 61 00 btst 0x100, %i1 200ebb8: 02 bf ff c7 be 200ead4 200ebbc: 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; 200ebc0: 10 bf ff c2 b 200eac8 200ebc4: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 200ebc8: 80 88 e0 ff btst 0xff, %g3 200ebcc: 12 80 00 0a bne 200ebf4 200ebd0: c4 04 20 0c ld [ %l0 + 0xc ], %g2 200ebd4: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 200ebd8: 80 a0 80 03 cmp %g2, %g3 200ebdc: 02 bf ff de be 200eb54 200ebe0: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200ebe4: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200ebe8: 80 a0 a0 00 cmp %g2, 0 200ebec: 02 bf ff da be 200eb54 <== NEVER TAKEN 200ebf0: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200ebf4: 82 10 20 01 mov 1, %g1 ! 1 200ebf8: 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(); 200ebfc: 7f ff e7 e6 call 2008b94 <_Thread_Dispatch> 200ec00: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200ec04: 82 10 20 00 clr %g1 ! 0 } 200ec08: 81 c7 e0 08 ret 200ec0c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200b1b0 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200b1b0: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200b1b4: 80 a6 60 00 cmp %i1, 0 200b1b8: 02 80 00 07 be 200b1d4 200b1bc: 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 ) ); 200b1c0: 03 00 80 69 sethi %hi(0x201a400), %g1 200b1c4: c2 08 61 6c ldub [ %g1 + 0x16c ], %g1 ! 201a56c */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200b1c8: 80 a6 40 01 cmp %i1, %g1 200b1cc: 18 80 00 1c bgu 200b23c 200b1d0: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200b1d4: 80 a6 a0 00 cmp %i2, 0 200b1d8: 02 80 00 19 be 200b23c 200b1dc: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200b1e0: 40 00 09 d4 call 200d930 <_Thread_Get> 200b1e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b1e8: c2 07 bf fc ld [ %fp + -4 ], %g1 200b1ec: 80 a0 60 00 cmp %g1, 0 200b1f0: 12 80 00 13 bne 200b23c 200b1f4: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b1f8: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b1fc: 80 a6 60 00 cmp %i1, 0 200b200: 02 80 00 0d be 200b234 200b204: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b208: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b20c: 80 a0 60 00 cmp %g1, 0 200b210: 02 80 00 06 be 200b228 200b214: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200b218: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b21c: 80 a6 40 01 cmp %i1, %g1 200b220: 1a 80 00 05 bcc 200b234 <== ALWAYS TAKEN 200b224: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200b228: 92 10 00 19 mov %i1, %o1 200b22c: 40 00 08 7c call 200d41c <_Thread_Change_priority> 200b230: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b234: 40 00 09 b3 call 200d900 <_Thread_Enable_dispatch> 200b238: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200b23c: 81 c7 e0 08 ret 200b240: 81 e8 00 00 restore =============================================================================== 02007608 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 2007608: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 200760c: 80 a6 60 00 cmp %i1, 0 2007610: 02 80 00 1e be 2007688 2007614: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 2007618: 90 10 00 18 mov %i0, %o0 200761c: 40 00 09 58 call 2009b7c <_Thread_Get> 2007620: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007624: c2 07 bf fc ld [ %fp + -4 ], %g1 2007628: 80 a0 60 00 cmp %g1, 0 200762c: 12 80 00 19 bne 2007690 2007630: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2007634: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2007638: 80 a0 60 00 cmp %g1, 0 200763c: 02 80 00 10 be 200767c 2007640: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007644: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007648: 80 a0 80 19 cmp %g2, %i1 200764c: 32 80 00 09 bne,a 2007670 2007650: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2007654: 10 80 00 18 b 20076b4 2007658: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 200765c: 80 a0 80 19 cmp %g2, %i1 2007660: 22 80 00 0e be,a 2007698 2007664: c4 02 40 00 ld [ %o1 ], %g2 2007668: 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; 200766c: 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) { 2007670: 80 a2 60 00 cmp %o1, 0 2007674: 32 bf ff fa bne,a 200765c <== ALWAYS TAKEN 2007678: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 200767c: 40 00 09 34 call 2009b4c <_Thread_Enable_dispatch> 2007680: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2007684: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007688: 81 c7 e0 08 ret 200768c: 91 e8 00 01 restore %g0, %g1, %o0 2007690: 81 c7 e0 08 ret 2007694: 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; 2007698: 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 ); 200769c: 40 00 00 2d call 2007750 <_RTEMS_Tasks_Invoke_task_variable_dtor> 20076a0: 01 00 00 00 nop _Thread_Enable_dispatch(); 20076a4: 40 00 09 2a call 2009b4c <_Thread_Enable_dispatch> 20076a8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20076ac: 10 bf ff f7 b 2007688 20076b0: 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; 20076b4: 92 10 00 01 mov %g1, %o1 20076b8: 10 bf ff f9 b 200769c 20076bc: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020076c0 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20076c0: 9d e3 bf 98 save %sp, -104, %sp 20076c4: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 20076c8: 80 a6 60 00 cmp %i1, 0 20076cc: 02 80 00 1b be 2007738 20076d0: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 20076d4: 80 a6 a0 00 cmp %i2, 0 20076d8: 02 80 00 1c be 2007748 20076dc: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20076e0: 40 00 09 27 call 2009b7c <_Thread_Get> 20076e4: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20076e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20076ec: 80 a0 60 00 cmp %g1, 0 20076f0: 12 80 00 12 bne 2007738 20076f4: 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; 20076f8: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 20076fc: 80 a0 60 00 cmp %g1, 0 2007700: 32 80 00 07 bne,a 200771c 2007704: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007708: 30 80 00 0e b,a 2007740 200770c: 80 a0 60 00 cmp %g1, 0 2007710: 02 80 00 0c be 2007740 <== NEVER TAKEN 2007714: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007718: c4 00 60 04 ld [ %g1 + 4 ], %g2 200771c: 80 a0 80 19 cmp %g2, %i1 2007720: 32 bf ff fb bne,a 200770c 2007724: 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; 2007728: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 200772c: 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(); 2007730: 40 00 09 07 call 2009b4c <_Thread_Enable_dispatch> 2007734: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2007738: 81 c7 e0 08 ret 200773c: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2007740: 40 00 09 03 call 2009b4c <_Thread_Enable_dispatch> 2007744: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 2007748: 81 c7 e0 08 ret 200774c: 81 e8 00 00 restore =============================================================================== 02015e70 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2015e70: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015e74: 11 00 80 f9 sethi %hi(0x203e400), %o0 2015e78: 92 10 00 18 mov %i0, %o1 2015e7c: 90 12 20 a4 or %o0, 0xa4, %o0 2015e80: 40 00 0c b4 call 2019150 <_Objects_Get> 2015e84: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015e88: c2 07 bf fc ld [ %fp + -4 ], %g1 2015e8c: 80 a0 60 00 cmp %g1, 0 2015e90: 12 80 00 0c bne 2015ec0 2015e94: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015e98: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015e9c: 80 a0 60 04 cmp %g1, 4 2015ea0: 02 80 00 04 be 2015eb0 <== NEVER TAKEN 2015ea4: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015ea8: 40 00 15 77 call 201b484 <_Watchdog_Remove> 2015eac: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2015eb0: 40 00 10 69 call 201a054 <_Thread_Enable_dispatch> 2015eb4: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2015eb8: 81 c7 e0 08 ret 2015ebc: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015ec0: 81 c7 e0 08 ret 2015ec4: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02016394 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016394: 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; 2016398: 03 00 80 f9 sethi %hi(0x203e400), %g1 201639c: fa 00 60 e4 ld [ %g1 + 0xe4 ], %i5 ! 203e4e4 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20163a0: 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 ) 20163a4: 80 a7 60 00 cmp %i5, 0 20163a8: 02 80 00 32 be 2016470 20163ac: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 20163b0: 03 00 80 f6 sethi %hi(0x203d800), %g1 20163b4: c2 08 63 40 ldub [ %g1 + 0x340 ], %g1 ! 203db40 <_TOD_Is_set> 20163b8: 80 a0 60 00 cmp %g1, 0 20163bc: 02 80 00 2d be 2016470 <== NEVER TAKEN 20163c0: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 20163c4: 80 a6 a0 00 cmp %i2, 0 20163c8: 02 80 00 2a be 2016470 20163cc: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 20163d0: 90 10 00 19 mov %i1, %o0 20163d4: 7f ff f3 df call 2013350 <_TOD_Validate> 20163d8: b0 10 20 14 mov 0x14, %i0 20163dc: 80 8a 20 ff btst 0xff, %o0 20163e0: 02 80 00 24 be 2016470 20163e4: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 20163e8: 7f ff f3 a6 call 2013280 <_TOD_To_seconds> 20163ec: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 20163f0: 21 00 80 f6 sethi %hi(0x203d800), %l0 20163f4: c2 04 23 bc ld [ %l0 + 0x3bc ], %g1 ! 203dbbc <_TOD_Now> 20163f8: 80 a2 00 01 cmp %o0, %g1 20163fc: 08 80 00 1d bleu 2016470 2016400: b2 10 00 08 mov %o0, %i1 2016404: 92 10 00 1c mov %i4, %o1 2016408: 11 00 80 f9 sethi %hi(0x203e400), %o0 201640c: 94 07 bf fc add %fp, -4, %o2 2016410: 40 00 0b 50 call 2019150 <_Objects_Get> 2016414: 90 12 20 a4 or %o0, 0xa4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016418: c2 07 bf fc ld [ %fp + -4 ], %g1 201641c: 80 a0 60 00 cmp %g1, 0 2016420: 12 80 00 16 bne 2016478 2016424: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2016428: 40 00 14 17 call 201b484 <_Watchdog_Remove> 201642c: 90 02 20 10 add %o0, 0x10, %o0 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(); 2016430: c4 04 23 bc ld [ %l0 + 0x3bc ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016434: c2 07 60 04 ld [ %i5 + 4 ], %g1 2016438: 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(); 201643c: b2 26 40 02 sub %i1, %g2, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016440: 90 10 00 1d mov %i5, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2016444: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2016448: f4 26 20 2c st %i2, [ %i0 + 0x2c ] 201644c: c4 26 20 38 st %g2, [ %i0 + 0x38 ] the_watchdog->id = id; 2016450: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 2016454: f6 26 20 34 st %i3, [ %i0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2016458: f2 26 20 1c st %i1, [ %i0 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 201645c: c0 26 20 18 clr [ %i0 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2016460: 9f c0 40 00 call %g1 2016464: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2016468: 40 00 0e fb call 201a054 <_Thread_Enable_dispatch> 201646c: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2016470: 81 c7 e0 08 ret 2016474: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016478: 81 c7 e0 08 ret 201647c: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02006cc0 : #include int sched_get_priority_max( int policy ) { 2006cc0: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006cc4: 80 a6 20 04 cmp %i0, 4 2006cc8: 08 80 00 08 bleu 2006ce8 2006ccc: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006cd0: 40 00 24 ad call 200ff84 <__errno> 2006cd4: b0 10 3f ff mov -1, %i0 2006cd8: 82 10 20 16 mov 0x16, %g1 2006cdc: c2 22 00 00 st %g1, [ %o0 ] 2006ce0: 81 c7 e0 08 ret 2006ce4: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2006ce8: b1 28 40 18 sll %g1, %i0, %i0 2006cec: 80 8e 20 17 btst 0x17, %i0 2006cf0: 02 bf ff f8 be 2006cd0 <== NEVER TAKEN 2006cf4: 03 00 80 75 sethi %hi(0x201d400), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2006cf8: f0 08 60 6c ldub [ %g1 + 0x6c ], %i0 ! 201d46c } 2006cfc: 81 c7 e0 08 ret 2006d00: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006d04 : #include int sched_get_priority_min( int policy ) { 2006d04: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006d08: 80 a6 20 04 cmp %i0, 4 2006d0c: 08 80 00 09 bleu 2006d30 2006d10: 84 10 20 01 mov 1, %g2 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006d14: 40 00 24 9c call 200ff84 <__errno> 2006d18: 01 00 00 00 nop 2006d1c: 82 10 3f ff mov -1, %g1 ! ffffffff 2006d20: 84 10 20 16 mov 0x16, %g2 2006d24: c4 22 00 00 st %g2, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006d28: 81 c7 e0 08 ret 2006d2c: 91 e8 00 01 restore %g0, %g1, %o0 int sched_get_priority_min( int policy ) { switch ( policy ) { 2006d30: b1 28 80 18 sll %g2, %i0, %i0 2006d34: 80 8e 20 17 btst 0x17, %i0 2006d38: 02 bf ff f7 be 2006d14 <== NEVER TAKEN 2006d3c: 82 10 20 01 mov 1, %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006d40: 81 c7 e0 08 ret 2006d44: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006d48 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2006d48: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006d4c: 80 a6 20 00 cmp %i0, 0 2006d50: 12 80 00 0a bne 2006d78 <== ALWAYS TAKEN 2006d54: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 2006d58: 02 80 00 13 be 2006da4 2006d5c: 03 00 80 78 sethi %hi(0x201e000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006d60: d0 00 60 b4 ld [ %g1 + 0xb4 ], %o0 ! 201e0b4 <_Thread_Ticks_per_timeslice> 2006d64: 92 10 00 19 mov %i1, %o1 2006d68: 40 00 0f 50 call 200aaa8 <_Timespec_From_ticks> 2006d6c: b0 10 20 00 clr %i0 return 0; } 2006d70: 81 c7 e0 08 ret 2006d74: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006d78: 7f ff f1 5d call 20032ec 2006d7c: 01 00 00 00 nop 2006d80: 80 a2 00 18 cmp %o0, %i0 2006d84: 02 bf ff f5 be 2006d58 2006d88: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2006d8c: 40 00 24 7e call 200ff84 <__errno> 2006d90: b0 10 3f ff mov -1, %i0 2006d94: 82 10 20 03 mov 3, %g1 2006d98: c2 22 00 00 st %g1, [ %o0 ] 2006d9c: 81 c7 e0 08 ret 2006da0: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006da4: 40 00 24 78 call 200ff84 <__errno> 2006da8: b0 10 3f ff mov -1, %i0 2006dac: 82 10 20 16 mov 0x16, %g1 2006db0: c2 22 00 00 st %g1, [ %o0 ] 2006db4: 81 c7 e0 08 ret 2006db8: 81 e8 00 00 restore =============================================================================== 0200960c : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 200960c: 9d e3 bf 90 save %sp, -112, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2009610: 03 00 80 8c sethi %hi(0x2023000), %g1 2009614: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 20230f0 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2009618: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200961c: 84 00 a0 01 inc %g2 2009620: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2009624: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2009628: fa 27 a0 58 st %i5, [ %fp + 0x58 ] 200962c: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2009630: b8 8e 62 00 andcc %i1, 0x200, %i4 2009634: 12 80 00 25 bne 20096c8 2009638: ba 10 20 00 clr %i5 mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 200963c: 90 10 00 18 mov %i0, %o0 2009640: 40 00 1b 65 call 20103d4 <_POSIX_Semaphore_Name_to_id> 2009644: 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 ) { 2009648: b6 92 20 00 orcc %o0, 0, %i3 200964c: 22 80 00 0e be,a 2009684 2009650: 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) ) ) { 2009654: 80 a6 e0 02 cmp %i3, 2 2009658: 12 80 00 04 bne 2009668 <== NEVER TAKEN 200965c: 80 a7 20 00 cmp %i4, 0 2009660: 12 80 00 1e bne 20096d8 2009664: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 2009668: 40 00 0c 79 call 200c84c <_Thread_Enable_dispatch> 200966c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 2009670: 40 00 27 ef call 201362c <__errno> 2009674: 01 00 00 00 nop 2009678: f6 22 00 00 st %i3, [ %o0 ] 200967c: 81 c7 e0 08 ret 2009680: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2009684: 80 a6 6a 00 cmp %i1, 0xa00 2009688: 02 80 00 20 be 2009708 200968c: d2 07 bf f4 ld [ %fp + -12 ], %o1 2009690: 94 07 bf fc add %fp, -4, %o2 2009694: 11 00 80 8c sethi %hi(0x2023000), %o0 2009698: 40 00 08 b9 call 200b97c <_Objects_Get> 200969c: 90 12 23 b0 or %o0, 0x3b0, %o0 ! 20233b0 <_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; 20096a0: 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 ); 20096a4: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 20096a8: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 20096ac: 40 00 0c 68 call 200c84c <_Thread_Enable_dispatch> 20096b0: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 20096b4: 40 00 0c 66 call 200c84c <_Thread_Enable_dispatch> 20096b8: 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; 20096bc: f0 07 bf f8 ld [ %fp + -8 ], %i0 } 20096c0: 81 c7 e0 08 ret 20096c4: 91 ee 20 08 restore %i0, 8, %o0 _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 20096c8: 82 07 a0 54 add %fp, 0x54, %g1 20096cc: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 20096d0: 10 bf ff db b 200963c 20096d4: 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( 20096d8: 92 10 20 00 clr %o1 20096dc: 96 07 bf f8 add %fp, -8, %o3 20096e0: 40 00 1a e2 call 2010268 <_POSIX_Semaphore_Create_support> 20096e4: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 20096e8: 40 00 0c 59 call 200c84c <_Thread_Enable_dispatch> 20096ec: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 20096f0: 80 a7 7f ff cmp %i5, -1 20096f4: 02 bf ff e2 be 200967c 20096f8: 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; 20096fc: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009700: 81 c7 e0 08 ret 2009704: 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(); 2009708: 40 00 0c 51 call 200c84c <_Thread_Enable_dispatch> 200970c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2009710: 40 00 27 c7 call 201362c <__errno> 2009714: 01 00 00 00 nop 2009718: 82 10 20 11 mov 0x11, %g1 ! 11 200971c: c2 22 00 00 st %g1, [ %o0 ] 2009720: 81 c7 e0 08 ret 2009724: 81 e8 00 00 restore =============================================================================== 02009784 : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 2009784: 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 ); 2009788: 90 10 00 19 mov %i1, %o0 200978c: 40 00 18 50 call 200f8cc <_POSIX_Absolute_timeout_to_ticks> 2009790: 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 ); 2009794: 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 ) 2009798: 80 a2 20 03 cmp %o0, 3 200979c: 02 80 00 06 be 20097b4 <== ALWAYS TAKEN 20097a0: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 20097a4: 40 00 1b 2e call 201045c <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 20097a8: 92 10 20 00 clr %o1 <== NOT EXECUTED 20097ac: 81 c7 e0 08 ret <== NOT EXECUTED 20097b0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 20097b4: 40 00 1b 2a call 201045c <_POSIX_Semaphore_Wait_support> 20097b8: 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; } 20097bc: 81 c7 e0 08 ret 20097c0: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006c34 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 2006c34: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2006c38: 80 a6 a0 00 cmp %i2, 0 2006c3c: 02 80 00 0d be 2006c70 2006c40: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 2006c44: 05 00 80 7d sethi %hi(0x201f400), %g2 2006c48: 83 2e 20 04 sll %i0, 4, %g1 2006c4c: 84 10 a3 50 or %g2, 0x350, %g2 2006c50: 82 20 40 03 sub %g1, %g3, %g1 2006c54: c6 00 80 01 ld [ %g2 + %g1 ], %g3 2006c58: 82 00 80 01 add %g2, %g1, %g1 2006c5c: c6 26 80 00 st %g3, [ %i2 ] 2006c60: c4 00 60 04 ld [ %g1 + 4 ], %g2 2006c64: c4 26 a0 04 st %g2, [ %i2 + 4 ] 2006c68: c2 00 60 08 ld [ %g1 + 8 ], %g1 2006c6c: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 2006c70: 80 a6 20 00 cmp %i0, 0 2006c74: 02 80 00 33 be 2006d40 2006c78: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006c7c: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006c80: 80 a0 60 1f cmp %g1, 0x1f 2006c84: 18 80 00 2f bgu 2006d40 2006c88: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006c8c: 02 80 00 2d be 2006d40 2006c90: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006c94: 02 80 00 1a be 2006cfc <== NEVER TAKEN 2006c98: 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 ); 2006c9c: 7f ff ee 2b call 2002548 2006ca0: 01 00 00 00 nop 2006ca4: b4 10 00 08 mov %o0, %i2 if ( act->sa_handler == SIG_DFL ) { 2006ca8: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006cac: 80 a0 60 00 cmp %g1, 0 2006cb0: 02 80 00 15 be 2006d04 2006cb4: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 2006cb8: 40 00 19 3e call 200d1b0 <_POSIX_signals_Clear_process_signals> 2006cbc: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2006cc0: c4 06 40 00 ld [ %i1 ], %g2 2006cc4: 87 2e 20 02 sll %i0, 2, %g3 2006cc8: 03 00 80 7d sethi %hi(0x201f400), %g1 2006ccc: b1 2e 20 04 sll %i0, 4, %i0 2006cd0: 82 10 63 50 or %g1, 0x350, %g1 2006cd4: b0 26 00 03 sub %i0, %g3, %i0 2006cd8: c4 20 40 18 st %g2, [ %g1 + %i0 ] 2006cdc: c4 06 60 04 ld [ %i1 + 4 ], %g2 2006ce0: b0 00 40 18 add %g1, %i0, %i0 2006ce4: c4 26 20 04 st %g2, [ %i0 + 4 ] 2006ce8: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006cec: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 2006cf0: 7f ff ee 1a call 2002558 2006cf4: 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; 2006cf8: 82 10 20 00 clr %g1 } 2006cfc: 81 c7 e0 08 ret 2006d00: 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 ]; 2006d04: b1 2e 20 04 sll %i0, 4, %i0 2006d08: b0 26 00 01 sub %i0, %g1, %i0 2006d0c: 03 00 80 76 sethi %hi(0x201d800), %g1 2006d10: 82 10 62 14 or %g1, 0x214, %g1 ! 201da14 <_POSIX_signals_Default_vectors> 2006d14: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2006d18: 82 00 40 18 add %g1, %i0, %g1 2006d1c: c6 00 60 04 ld [ %g1 + 4 ], %g3 2006d20: c4 00 60 08 ld [ %g1 + 8 ], %g2 2006d24: 03 00 80 7d sethi %hi(0x201f400), %g1 2006d28: 82 10 63 50 or %g1, 0x350, %g1 ! 201f750 <_POSIX_signals_Vectors> 2006d2c: c8 20 40 18 st %g4, [ %g1 + %i0 ] 2006d30: b0 00 40 18 add %g1, %i0, %i0 2006d34: c6 26 20 04 st %g3, [ %i0 + 4 ] 2006d38: 10 bf ff ee b 2006cf0 2006d3c: 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 ); 2006d40: 40 00 25 ba call 2010428 <__errno> 2006d44: 01 00 00 00 nop 2006d48: 84 10 20 16 mov 0x16, %g2 ! 16 2006d4c: 82 10 3f ff mov -1, %g1 2006d50: 10 bf ff eb b 2006cfc 2006d54: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 0200711c : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 200711c: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2007120: ba 96 20 00 orcc %i0, 0, %i5 2007124: 02 80 00 83 be 2007330 2007128: 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 ) { 200712c: 02 80 00 5b be 2007298 2007130: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 2007134: 40 00 0f 78 call 200af14 <_Timespec_Is_valid> 2007138: 90 10 00 1a mov %i2, %o0 200713c: 80 8a 20 ff btst 0xff, %o0 2007140: 02 80 00 7c be 2007330 2007144: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2007148: 40 00 0f 98 call 200afa8 <_Timespec_To_ticks> 200714c: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2007150: a0 92 20 00 orcc %o0, 0, %l0 2007154: 02 80 00 77 be 2007330 <== NEVER TAKEN 2007158: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 200715c: 02 80 00 52 be 20072a4 <== NEVER TAKEN 2007160: 39 00 80 7f sethi %hi(0x201fc00), %i4 the_thread = _Thread_Executing; 2007164: 39 00 80 7f sethi %hi(0x201fc00), %i4 2007168: b8 17 23 58 or %i4, 0x358, %i4 ! 201ff58 <_Per_CPU_Information> 200716c: f0 07 20 0c ld [ %i4 + 0xc ], %i0 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2007170: 7f ff ed d1 call 20028b4 2007174: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 2007178: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 200717c: c2 07 40 00 ld [ %i5 ], %g1 2007180: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 2007184: 80 88 40 02 btst %g1, %g2 2007188: 12 80 00 52 bne 20072d0 200718c: 01 00 00 00 nop return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2007190: 05 00 80 80 sethi %hi(0x2020000), %g2 2007194: c4 00 a1 a4 ld [ %g2 + 0x1a4 ], %g2 ! 20201a4 <_POSIX_signals_Pending> 2007198: 80 88 40 02 btst %g1, %g2 200719c: 12 80 00 2e bne 2007254 20071a0: 03 00 80 7e sethi %hi(0x201f800), %g1 20071a4: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 201fa20 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 20071a8: 86 10 3f ff mov -1, %g3 20071ac: c6 26 40 00 st %g3, [ %i1 ] 20071b0: 84 00 a0 01 inc %g2 20071b4: c4 20 62 20 st %g2, [ %g1 + 0x220 ] _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 20071b8: 82 10 20 04 mov 4, %g1 20071bc: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_thread->Wait.option = *set; 20071c0: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 20071c4: 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; 20071c8: 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; 20071cc: b6 10 20 01 mov 1, %i3 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 20071d0: 23 00 80 80 sethi %hi(0x2020000), %l1 20071d4: a2 14 61 3c or %l1, 0x13c, %l1 ! 202013c <_POSIX_signals_Wait_queue> 20071d8: e2 26 20 44 st %l1, [ %i0 + 0x44 ] 20071dc: 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 ); 20071e0: 7f ff ed b9 call 20028c4 20071e4: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 20071e8: 90 10 00 11 mov %l1, %o0 20071ec: 92 10 00 10 mov %l0, %o1 20071f0: 15 00 80 2a sethi %hi(0x200a800), %o2 20071f4: 40 00 0d 80 call 200a7f4 <_Thread_queue_Enqueue_with_handler> 20071f8: 94 12 a3 cc or %o2, 0x3cc, %o2 ! 200abcc <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 20071fc: 40 00 0c 35 call 200a2d0 <_Thread_Enable_dispatch> 2007200: 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 ); 2007204: d2 06 40 00 ld [ %i1 ], %o1 2007208: 90 10 00 1a mov %i2, %o0 200720c: 94 10 00 19 mov %i1, %o2 2007210: 96 10 20 00 clr %o3 2007214: 40 00 19 f9 call 200d9f8 <_POSIX_signals_Clear_signals> 2007218: 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) 200721c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007220: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007224: 80 a0 60 04 cmp %g1, 4 2007228: 12 80 00 3b bne 2007314 200722c: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2007230: f0 06 40 00 ld [ %i1 ], %i0 2007234: c2 07 40 00 ld [ %i5 ], %g1 2007238: 84 06 3f ff add %i0, -1, %g2 200723c: b7 2e c0 02 sll %i3, %g2, %i3 2007240: 80 8e c0 01 btst %i3, %g1 2007244: 02 80 00 34 be 2007314 2007248: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 200724c: 81 c7 e0 08 ret 2007250: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2007254: 7f ff ff 9a call 20070bc <_POSIX_signals_Get_lowest> 2007258: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 200725c: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2007260: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2007264: 96 10 20 01 mov 1, %o3 2007268: 90 10 00 1a mov %i2, %o0 200726c: 92 10 00 18 mov %i0, %o1 2007270: 40 00 19 e2 call 200d9f8 <_POSIX_signals_Clear_signals> 2007274: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2007278: 7f ff ed 93 call 20028c4 200727c: 90 10 00 1b mov %i3, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2007280: 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; 2007284: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2007288: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 200728c: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2007290: 81 c7 e0 08 ret 2007294: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2007298: 12 bf ff b3 bne 2007164 200729c: a0 10 20 00 clr %l0 the_thread = _Thread_Executing; 20072a0: 39 00 80 7f sethi %hi(0x201fc00), %i4 20072a4: b8 17 23 58 or %i4, 0x358, %i4 ! 201ff58 <_Per_CPU_Information> 20072a8: f0 07 20 0c ld [ %i4 + 0xc ], %i0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 20072ac: b2 07 bf f4 add %fp, -12, %i1 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 20072b0: 7f ff ed 81 call 20028b4 20072b4: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 20072b8: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 20072bc: c2 07 40 00 ld [ %i5 ], %g1 20072c0: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 20072c4: 80 88 40 02 btst %g1, %g2 20072c8: 22 bf ff b3 be,a 2007194 20072cc: 05 00 80 80 sethi %hi(0x2020000), %g2 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 20072d0: 7f ff ff 7b call 20070bc <_POSIX_signals_Get_lowest> 20072d4: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( 20072d8: 94 10 00 19 mov %i1, %o2 /* 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 ); 20072dc: 92 10 00 08 mov %o0, %o1 20072e0: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 20072e4: 96 10 20 00 clr %o3 20072e8: 90 10 00 1a mov %i2, %o0 20072ec: 40 00 19 c3 call 200d9f8 <_POSIX_signals_Clear_signals> 20072f0: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 20072f4: 7f ff ed 74 call 20028c4 20072f8: 90 10 00 1b mov %i3, %o0 the_info->si_code = SI_USER; 20072fc: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2007300: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2007304: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2007308: f0 06 40 00 ld [ %i1 ], %i0 200730c: 81 c7 e0 08 ret 2007310: 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; 2007314: 40 00 26 25 call 2010ba8 <__errno> 2007318: b0 10 3f ff mov -1, %i0 200731c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007320: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007324: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2007328: 81 c7 e0 08 ret 200732c: 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 ); 2007330: 40 00 26 1e call 2010ba8 <__errno> 2007334: b0 10 3f ff mov -1, %i0 2007338: 82 10 20 16 mov 0x16, %g1 200733c: c2 22 00 00 st %g1, [ %o0 ] 2007340: 81 c7 e0 08 ret 2007344: 81 e8 00 00 restore =============================================================================== 02008f4c : int sigwait( const sigset_t *set, int *sig ) { 2008f4c: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008f50: 92 10 20 00 clr %o1 2008f54: 90 10 00 18 mov %i0, %o0 2008f58: 7f ff ff 6e call 2008d10 2008f5c: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008f60: 80 a2 3f ff cmp %o0, -1 2008f64: 02 80 00 07 be 2008f80 2008f68: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008f6c: 02 80 00 03 be 2008f78 <== NEVER TAKEN 2008f70: b0 10 20 00 clr %i0 *sig = status; 2008f74: d0 26 40 00 st %o0, [ %i1 ] 2008f78: 81 c7 e0 08 ret 2008f7c: 81 e8 00 00 restore return 0; } return errno; 2008f80: 40 00 25 4b call 20124ac <__errno> 2008f84: 01 00 00 00 nop 2008f88: f0 02 00 00 ld [ %o0 ], %i0 } 2008f8c: 81 c7 e0 08 ret 2008f90: 81 e8 00 00 restore =============================================================================== 02005f34 : */ long sysconf( int name ) { 2005f34: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005f38: 80 a6 20 02 cmp %i0, 2 2005f3c: 02 80 00 10 be 2005f7c 2005f40: 03 00 80 5b sethi %hi(0x2016c00), %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005f44: 80 a6 20 04 cmp %i0, 4 2005f48: 02 80 00 0b be 2005f74 2005f4c: c2 00 63 e0 ld [ %g1 + 0x3e0 ], %g1 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005f50: 80 a6 20 33 cmp %i0, 0x33 2005f54: 02 80 00 08 be 2005f74 2005f58: 82 10 24 00 mov 0x400, %g1 return 1024; if ( name == _SC_PAGESIZE ) 2005f5c: 80 a6 20 08 cmp %i0, 8 2005f60: 02 80 00 05 be 2005f74 2005f64: 03 00 00 04 sethi %hi(0x1000), %g1 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005f68: 80 a6 22 03 cmp %i0, 0x203 2005f6c: 12 80 00 0c bne 2005f9c <== ALWAYS TAKEN 2005f70: 82 10 20 00 clr %g1 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2005f74: 81 c7 e0 08 ret 2005f78: 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()); 2005f7c: 03 00 80 5b sethi %hi(0x2016c00), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 2005f80: d2 00 62 a8 ld [ %g1 + 0x2a8 ], %o1 ! 2016ea8 2005f84: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005f88: 40 00 35 21 call 201340c <.udiv> 2005f8c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005f90: 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 ); } 2005f94: 81 c7 e0 08 ret 2005f98: 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 ); 2005f9c: 40 00 25 d7 call 200f6f8 <__errno> 2005fa0: 01 00 00 00 nop 2005fa4: 84 10 20 16 mov 0x16, %g2 ! 16 2005fa8: 82 10 3f ff mov -1, %g1 2005fac: 10 bf ff f2 b 2005f74 2005fb0: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 020062e0 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 20062e0: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 20062e4: 80 a6 20 01 cmp %i0, 1 20062e8: 12 80 00 3d bne 20063dc 20062ec: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 20062f0: 02 80 00 3b be 20063dc 20062f4: 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) { 20062f8: 02 80 00 0e be 2006330 20062fc: 03 00 80 78 sethi %hi(0x201e000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2006300: c2 06 40 00 ld [ %i1 ], %g1 2006304: 82 00 7f ff add %g1, -1, %g1 2006308: 80 a0 60 01 cmp %g1, 1 200630c: 18 80 00 34 bgu 20063dc <== NEVER TAKEN 2006310: 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 ) 2006314: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006318: 80 a0 60 00 cmp %g1, 0 200631c: 02 80 00 30 be 20063dc <== NEVER TAKEN 2006320: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2006324: 80 a0 60 1f cmp %g1, 0x1f 2006328: 18 80 00 2d bgu 20063dc <== NEVER TAKEN 200632c: 03 00 80 78 sethi %hi(0x201e000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2006330: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201e150 <_Thread_Dispatch_disable_level> 2006334: 84 00 a0 01 inc %g2 2006338: c4 20 61 50 st %g2, [ %g1 + 0x150 ] * 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 ); 200633c: 3b 00 80 79 sethi %hi(0x201e400), %i5 2006340: 40 00 08 47 call 200845c <_Objects_Allocate> 2006344: 90 17 60 50 or %i5, 0x50, %o0 ! 201e450 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2006348: 80 a2 20 00 cmp %o0, 0 200634c: 02 80 00 2a be 20063f4 2006350: 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; 2006354: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2006358: 03 00 80 79 sethi %hi(0x201e400), %g1 200635c: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 201e694 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2006360: 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; 2006364: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2006368: 02 80 00 08 be 2006388 200636c: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2006370: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 2006374: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 2006378: 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; 200637c: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2006380: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2006384: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006388: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 _Objects_Open_u32(&_POSIX_Timer_Information, &ptimer->Object, 0); *timerid = ptimer->Object.id; _Thread_Enable_dispatch(); return 0; } 200638c: ba 17 60 50 or %i5, 0x50, %i5 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006390: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 ptimer->inf.sigev_notify = evp->sigev_notify; ptimer->inf.sigev_signo = evp->sigev_signo; ptimer->inf.sigev_value = evp->sigev_value; } ptimer->overrun = 0; 2006394: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2006398: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 200639c: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 20063a0: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 20063a4: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20063a8: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 20063ac: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 20063b0: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 20063b4: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20063b8: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20063bc: 85 28 a0 02 sll %g2, 2, %g2 20063c0: 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; 20063c4: 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; 20063c8: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 20063cc: 40 00 0d 04 call 20097dc <_Thread_Enable_dispatch> 20063d0: b0 10 20 00 clr %i0 return 0; } 20063d4: 81 c7 e0 08 ret 20063d8: 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 ); 20063dc: 40 00 26 eb call 200ff88 <__errno> 20063e0: b0 10 3f ff mov -1, %i0 20063e4: 82 10 20 16 mov 0x16, %g1 20063e8: c2 22 00 00 st %g1, [ %o0 ] 20063ec: 81 c7 e0 08 ret 20063f0: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 20063f4: 40 00 0c fa call 20097dc <_Thread_Enable_dispatch> 20063f8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 20063fc: 40 00 26 e3 call 200ff88 <__errno> 2006400: 01 00 00 00 nop 2006404: 82 10 20 0b mov 0xb, %g1 ! b 2006408: c2 22 00 00 st %g1, [ %o0 ] 200640c: 81 c7 e0 08 ret 2006410: 81 e8 00 00 restore =============================================================================== 02006414 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2006414: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2006418: 80 a6 a0 00 cmp %i2, 0 200641c: 02 80 00 88 be 200663c <== NEVER TAKEN 2006420: 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) ) ) { 2006424: 40 00 10 11 call 200a468 <_Timespec_Is_valid> 2006428: 90 06 a0 08 add %i2, 8, %o0 200642c: 80 8a 20 ff btst 0xff, %o0 2006430: 02 80 00 83 be 200663c 2006434: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2006438: 40 00 10 0c call 200a468 <_Timespec_Is_valid> 200643c: 90 10 00 1a mov %i2, %o0 2006440: 80 8a 20 ff btst 0xff, %o0 2006444: 02 80 00 7e be 200663c <== NEVER TAKEN 2006448: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 200644c: 12 80 00 7a bne 2006634 2006450: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2006454: c8 06 80 00 ld [ %i2 ], %g4 2006458: c6 06 a0 04 ld [ %i2 + 4 ], %g3 200645c: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2006460: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2006464: c8 27 bf e4 st %g4, [ %fp + -28 ] 2006468: c6 27 bf e8 st %g3, [ %fp + -24 ] 200646c: c4 27 bf ec st %g2, [ %fp + -20 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2006470: 80 a6 60 04 cmp %i1, 4 2006474: 02 80 00 3b be 2006560 2006478: c2 27 bf f0 st %g1, [ %fp + -16 ] RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 200647c: 92 10 00 18 mov %i0, %o1 2006480: 11 00 80 79 sethi %hi(0x201e400), %o0 2006484: 94 07 bf fc add %fp, -4, %o2 2006488: 40 00 09 40 call 2008988 <_Objects_Get> 200648c: 90 12 20 50 or %o0, 0x50, %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 ) { 2006490: c2 07 bf fc ld [ %fp + -4 ], %g1 2006494: 80 a0 60 00 cmp %g1, 0 2006498: 12 80 00 46 bne 20065b0 <== NEVER TAKEN 200649c: ba 10 00 08 mov %o0, %i5 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 ) { 20064a0: c2 07 bf ec ld [ %fp + -20 ], %g1 20064a4: 80 a0 60 00 cmp %g1, 0 20064a8: 12 80 00 05 bne 20064bc 20064ac: c2 07 bf f0 ld [ %fp + -16 ], %g1 20064b0: 80 a0 60 00 cmp %g1, 0 20064b4: 02 80 00 45 be 20065c8 20064b8: 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 ); 20064bc: 40 00 10 10 call 200a4fc <_Timespec_To_ticks> 20064c0: 90 10 00 1a mov %i2, %o0 20064c4: d0 27 60 64 st %o0, [ %i5 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 20064c8: 40 00 10 0d call 200a4fc <_Timespec_To_ticks> 20064cc: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 20064d0: d4 07 60 08 ld [ %i5 + 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 ); 20064d4: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 20064d8: 98 10 00 1d mov %i5, %o4 20064dc: 90 07 60 10 add %i5, 0x10, %o0 20064e0: 17 00 80 19 sethi %hi(0x2006400), %o3 20064e4: 40 00 1b 21 call 200d168 <_POSIX_Timer_Insert_helper> 20064e8: 96 12 e2 54 or %o3, 0x254, %o3 ! 2006654 <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 20064ec: 80 8a 20 ff btst 0xff, %o0 20064f0: 02 80 00 18 be 2006550 20064f4: 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 ) 20064f8: 02 80 00 0b be 2006524 20064fc: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 2006500: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006504: c2 26 c0 00 st %g1, [ %i3 ] 2006508: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 200650c: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2006510: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 2006514: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2006518: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 200651c: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 2006520: c2 07 bf e4 ld [ %fp + -28 ], %g1 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; _TOD_Get( &ptimer->time ); 2006524: 90 07 60 6c add %i5, 0x6c, %o0 * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) *ovalue = ptimer->timer_data; ptimer->timer_data = normalize; 2006528: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 200652c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2006530: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 2006534: c2 07 bf ec ld [ %fp + -20 ], %g1 2006538: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 200653c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006540: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2006544: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 2006548: 40 00 06 3b call 2007e34 <_TOD_Get> 200654c: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] _Thread_Enable_dispatch(); 2006550: 40 00 0c a3 call 20097dc <_Thread_Enable_dispatch> 2006554: b0 10 20 00 clr %i0 return 0; 2006558: 81 c7 e0 08 ret 200655c: 81 e8 00 00 restore normalize = *value; /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); 2006560: 40 00 06 35 call 2007e34 <_TOD_Get> 2006564: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2006568: 90 07 bf f4 add %fp, -12, %o0 200656c: 40 00 0f ad call 200a420 <_Timespec_Greater_than> 2006570: 92 07 bf ec add %fp, -20, %o1 2006574: 80 8a 20 ff btst 0xff, %o0 2006578: 12 80 00 31 bne 200663c 200657c: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2006580: 90 07 bf f4 add %fp, -12, %o0 2006584: 40 00 0f ca call 200a4ac <_Timespec_Subtract> 2006588: 94 10 00 09 mov %o1, %o2 200658c: 92 10 00 18 mov %i0, %o1 2006590: 11 00 80 79 sethi %hi(0x201e400), %o0 2006594: 94 07 bf fc add %fp, -4, %o2 2006598: 40 00 08 fc call 2008988 <_Objects_Get> 200659c: 90 12 20 50 or %o0, 0x50, %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 ) { 20065a0: c2 07 bf fc ld [ %fp + -4 ], %g1 20065a4: 80 a0 60 00 cmp %g1, 0 20065a8: 02 bf ff be be 20064a0 20065ac: ba 10 00 08 mov %o0, %i5 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 20065b0: 40 00 26 76 call 200ff88 <__errno> 20065b4: b0 10 3f ff mov -1, %i0 20065b8: 82 10 20 16 mov 0x16, %g1 20065bc: c2 22 00 00 st %g1, [ %o0 ] } 20065c0: 81 c7 e0 08 ret 20065c4: 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 ); 20065c8: 40 00 11 14 call 200aa18 <_Watchdog_Remove> 20065cc: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 20065d0: 80 a6 e0 00 cmp %i3, 0 20065d4: 02 80 00 0b be 2006600 20065d8: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 20065dc: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 20065e0: c2 26 c0 00 st %g1, [ %i3 ] 20065e4: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 20065e8: c2 26 e0 04 st %g1, [ %i3 + 4 ] 20065ec: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 20065f0: c2 26 e0 08 st %g1, [ %i3 + 8 ] 20065f4: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 20065f8: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 20065fc: c2 07 bf e4 ld [ %fp + -28 ], %g1 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; /* Returns with success */ _Thread_Enable_dispatch(); return 0; 2006600: b0 10 20 00 clr %i0 (void) _Watchdog_Remove( &ptimer->Timer ); /* The old data of the timer are returned */ if ( ovalue ) *ovalue = ptimer->timer_data; /* The new data are set */ ptimer->timer_data = normalize; 2006604: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 2006608: c2 07 bf e8 ld [ %fp + -24 ], %g1 200660c: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 2006610: c2 07 bf ec ld [ %fp + -20 ], %g1 2006614: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 2006618: c2 07 bf f0 ld [ %fp + -16 ], %g1 200661c: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006620: 82 10 20 04 mov 4, %g1 /* Returns with success */ _Thread_Enable_dispatch(); 2006624: 40 00 0c 6e call 20097dc <_Thread_Enable_dispatch> 2006628: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] return 0; 200662c: 81 c7 e0 08 ret 2006630: 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 ) { 2006634: 22 bf ff 89 be,a 2006458 2006638: 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 ); 200663c: 40 00 26 53 call 200ff88 <__errno> 2006640: b0 10 3f ff mov -1, %i0 2006644: 82 10 20 16 mov 0x16, %g1 2006648: c2 22 00 00 st %g1, [ %o0 ] 200664c: 81 c7 e0 08 ret 2006650: 81 e8 00 00 restore =============================================================================== 0200620c : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 200620c: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2006210: 3b 00 80 64 sethi %hi(0x2019000), %i5 2006214: ba 17 63 f8 or %i5, 0x3f8, %i5 ! 20193f8 <_POSIX_signals_Ualarm_timer> 2006218: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200621c: 80 a0 60 00 cmp %g1, 0 2006220: 02 80 00 24 be 20062b0 2006224: 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 ); 2006228: 40 00 10 c7 call 200a544 <_Watchdog_Remove> 200622c: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2006230: 90 02 3f fe add %o0, -2, %o0 2006234: 80 a2 20 01 cmp %o0, 1 2006238: 08 80 00 26 bleu 20062d0 <== ALWAYS TAKEN 200623c: 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 ) { 2006240: 80 a7 20 00 cmp %i4, 0 2006244: 02 80 00 19 be 20062a8 2006248: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 200624c: 90 10 00 1c mov %i4, %o0 2006250: 40 00 39 86 call 2014868 <.udiv> 2006254: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2006258: 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; 200625c: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2006260: 40 00 3a 2e call 2014b18 <.urem> 2006264: 90 10 00 1c mov %i4, %o0 2006268: 87 2a 20 07 sll %o0, 7, %g3 200626c: 82 10 00 08 mov %o0, %g1 2006270: 85 2a 20 02 sll %o0, 2, %g2 2006274: 84 20 c0 02 sub %g3, %g2, %g2 2006278: 82 00 80 01 add %g2, %g1, %g1 200627c: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 2006280: 90 07 bf f8 add %fp, -8, %o0 2006284: 40 00 0f 3a call 2009f6c <_Timespec_To_ticks> 2006288: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 200628c: 40 00 0f 38 call 2009f6c <_Timespec_To_ticks> 2006290: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006294: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2006298: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200629c: 11 00 80 62 sethi %hi(0x2018800), %o0 20062a0: 40 00 10 42 call 200a3a8 <_Watchdog_Insert> 20062a4: 90 12 23 b4 or %o0, 0x3b4, %o0 ! 2018bb4 <_Watchdog_Ticks_chain> } return remaining; } 20062a8: 81 c7 e0 08 ret 20062ac: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20062b0: 03 00 80 18 sethi %hi(0x2006000), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20062b4: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 20062b8: 82 10 61 e0 or %g1, 0x1e0, %g1 the_watchdog->id = id; 20062bc: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20062c0: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 20062c4: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 20062c8: 10 bf ff de b 2006240 20062cc: 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); 20062d0: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20062d4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20062d8: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20062dc: 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); 20062e0: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20062e4: 40 00 0e f9 call 2009ec8 <_Timespec_From_ticks> 20062e8: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 20062ec: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 20062f0: 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; 20062f4: 85 28 60 03 sll %g1, 3, %g2 20062f8: 87 28 60 08 sll %g1, 8, %g3 20062fc: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 2006300: 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; 2006304: b1 28 a0 06 sll %g2, 6, %i0 2006308: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 200630c: 40 00 39 59 call 2014870 <.div> 2006310: 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; 2006314: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2006318: 10 bf ff ca b 2006240 200631c: b0 02 00 18 add %o0, %i0, %i0