=============================================================================== 0200906c <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200906c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 2009070: 03 00 80 67 sethi %hi(0x2019c00), %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 ); 2009074: 7f ff e9 7e call 200366c 2009078: fa 00 61 e4 ld [ %g1 + 0x1e4 ], %i5 ! 2019de4 <_Per_CPU_Information+0xc> 200907c: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 2009080: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 2009084: 80 a0 60 00 cmp %g1, 0 2009088: 12 80 00 08 bne 20090a8 <_CORE_RWLock_Release+0x3c> 200908c: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); 2009090: 7f ff e9 7b call 200367c 2009094: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 2009098: 82 10 20 02 mov 2, %g1 200909c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] 20090a0: 81 c7 e0 08 ret 20090a4: 81 e8 00 00 restore return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 20090a8: 32 80 00 0b bne,a 20090d4 <_CORE_RWLock_Release+0x68> 20090ac: c0 27 60 34 clr [ %i5 + 0x34 ] the_rwlock->number_of_readers -= 1; 20090b0: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 20090b4: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 20090b8: 80 a0 60 00 cmp %g1, 0 20090bc: 02 80 00 05 be 20090d0 <_CORE_RWLock_Release+0x64> 20090c0: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 20090c4: 7f ff e9 6e call 200367c 20090c8: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 20090cc: 30 80 00 24 b,a 200915c <_CORE_RWLock_Release+0xf0> } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 20090d0: 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; 20090d4: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 20090d8: 7f ff e9 69 call 200367c 20090dc: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 20090e0: 40 00 07 42 call 200ade8 <_Thread_queue_Dequeue> 20090e4: 90 10 00 18 mov %i0, %o0 if ( next ) { 20090e8: 80 a2 20 00 cmp %o0, 0 20090ec: 22 80 00 1c be,a 200915c <_CORE_RWLock_Release+0xf0> 20090f0: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 20090f4: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 20090f8: 80 a0 60 01 cmp %g1, 1 20090fc: 32 80 00 05 bne,a 2009110 <_CORE_RWLock_Release+0xa4> 2009100: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 2009104: 82 10 20 02 mov 2, %g1 return CORE_RWLOCK_SUCCESSFUL; 2009108: 10 80 00 14 b 2009158 <_CORE_RWLock_Release+0xec> 200910c: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009110: 82 00 60 01 inc %g1 2009114: c2 26 20 48 st %g1, [ %i0 + 0x48 ] the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 2009118: 82 10 20 01 mov 1, %g1 200911c: c2 26 20 44 st %g1, [ %i0 + 0x44 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); 2009120: 40 00 08 6c call 200b2d0 <_Thread_queue_First> 2009124: 90 10 00 18 mov %i0, %o0 if ( !next || 2009128: 92 92 20 00 orcc %o0, 0, %o1 200912c: 22 80 00 0c be,a 200915c <_CORE_RWLock_Release+0xf0> 2009130: b0 10 20 00 clr %i0 2009134: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 2009138: 80 a0 60 01 cmp %g1, 1 200913c: 02 80 00 07 be 2009158 <_CORE_RWLock_Release+0xec> <== NEVER TAKEN 2009140: 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; 2009144: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009148: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200914c: 40 00 08 12 call 200b194 <_Thread_queue_Extract> 2009150: c2 26 20 48 st %g1, [ %i0 + 0x48 ] } 2009154: 30 bf ff f3 b,a 2009120 <_CORE_RWLock_Release+0xb4> } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 2009158: b0 10 20 00 clr %i0 200915c: 81 c7 e0 08 ret 2009160: 81 e8 00 00 restore =============================================================================== 02009164 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 2009164: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009168: 90 10 00 18 mov %i0, %o0 200916c: 40 00 06 50 call 200aaac <_Thread_Get> 2009170: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009174: c2 07 bf fc ld [ %fp + -4 ], %g1 2009178: 80 a0 60 00 cmp %g1, 0 200917c: 12 80 00 08 bne 200919c <_CORE_RWLock_Timeout+0x38> <== NEVER TAKEN 2009180: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009184: 40 00 08 91 call 200b3c8 <_Thread_queue_Process_timeout> 2009188: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 200918c: 03 00 80 66 sethi %hi(0x2019800), %g1 2009190: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 ! 20198a0 <_Thread_Dispatch_disable_level> 2009194: 84 00 bf ff add %g2, -1, %g2 2009198: c4 20 60 a0 st %g2, [ %g1 + 0xa0 ] 200919c: 81 c7 e0 08 ret 20091a0: 81 e8 00 00 restore =============================================================================== 0200fbc4 <_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 ) { 200fbc4: 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; 200fbc8: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; 200fbcc: c0 26 20 48 clr [ %i0 + 0x48 ] the_message_queue->maximum_message_size = maximum_message_size; 200fbd0: 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; 200fbd4: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 200fbd8: 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)) { 200fbdc: 80 8e e0 03 btst 3, %i3 200fbe0: 02 80 00 07 be 200fbfc <_CORE_message_queue_Initialize+0x38> 200fbe4: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 200fbe8: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 200fbec: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 200fbf0: 80 a7 00 1b cmp %i4, %i3 200fbf4: 0a 80 00 22 bcs 200fc7c <_CORE_message_queue_Initialize+0xb8><== NEVER TAKEN 200fbf8: a0 10 20 00 clr %l0 /* * 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)); 200fbfc: ba 07 20 14 add %i4, 0x14, %i5 /* * 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 * 200fc00: 92 10 00 1a mov %i2, %o1 200fc04: 90 10 00 1d mov %i5, %o0 200fc08: 40 00 40 b7 call 201fee4 <.umul> 200fc0c: a0 10 20 00 clr %l0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 200fc10: 80 a2 00 1c cmp %o0, %i4 200fc14: 2a 80 00 1b bcs,a 200fc80 <_CORE_message_queue_Initialize+0xbc><== NEVER TAKEN 200fc18: b0 0c 20 01 and %l0, 1, %i0 <== NOT EXECUTED /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 200fc1c: 40 00 0c 3e call 2012d14 <_Workspace_Allocate> 200fc20: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 200fc24: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 200fc28: 80 a2 20 00 cmp %o0, 0 200fc2c: 02 80 00 14 be 200fc7c <_CORE_message_queue_Initialize+0xb8> 200fc30: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 200fc34: 90 06 20 68 add %i0, 0x68, %o0 200fc38: 94 10 00 1a mov %i2, %o2 200fc3c: 40 00 15 b5 call 2015310 <_Chain_Initialize> 200fc40: 96 10 00 1d mov %i5, %o3 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 ); 200fc44: 82 06 20 50 add %i0, 0x50, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 200fc48: c2 26 20 58 st %g1, [ %i0 + 0x58 ] allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 200fc4c: c2 06 40 00 ld [ %i1 ], %g1 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 ); 200fc50: 84 06 20 54 add %i0, 0x54, %g2 200fc54: 82 18 60 01 xor %g1, 1, %g1 200fc58: 80 a0 00 01 cmp %g0, %g1 head->next = tail; 200fc5c: c4 26 20 50 st %g2, [ %i0 + 0x50 ] head->previous = NULL; 200fc60: c0 26 20 54 clr [ %i0 + 0x54 ] 200fc64: 90 10 00 18 mov %i0, %o0 200fc68: 92 60 3f ff subx %g0, -1, %o1 200fc6c: 94 10 20 80 mov 0x80, %o2 200fc70: 96 10 20 06 mov 6, %o3 200fc74: 40 00 09 a2 call 20122fc <_Thread_queue_Initialize> 200fc78: a0 10 20 01 mov 1, %l0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 200fc7c: b0 0c 20 01 and %l0, 1, %i0 200fc80: 81 c7 e0 08 ret 200fc84: 81 e8 00 00 restore =============================================================================== 02006a6c <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2006a6c: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2006a70: 03 00 80 56 sethi %hi(0x2015800), %g1 2006a74: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 20158e0 <_Thread_Dispatch_disable_level> 2006a78: 80 a0 60 00 cmp %g1, 0 2006a7c: 02 80 00 0d be 2006ab0 <_CORE_mutex_Seize+0x44> 2006a80: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2006a84: 80 a6 a0 00 cmp %i2, 0 2006a88: 02 80 00 0b be 2006ab4 <_CORE_mutex_Seize+0x48> <== NEVER TAKEN 2006a8c: 90 10 00 18 mov %i0, %o0 2006a90: 03 00 80 56 sethi %hi(0x2015800), %g1 2006a94: c2 00 62 3c ld [ %g1 + 0x23c ], %g1 ! 2015a3c <_System_state_Current> 2006a98: 80 a0 60 01 cmp %g1, 1 2006a9c: 08 80 00 05 bleu 2006ab0 <_CORE_mutex_Seize+0x44> 2006aa0: 90 10 20 00 clr %o0 2006aa4: 92 10 20 00 clr %o1 2006aa8: 40 00 01 dc call 2007218 <_Internal_error_Occurred> 2006aac: 94 10 20 12 mov 0x12, %o2 2006ab0: 90 10 00 18 mov %i0, %o0 2006ab4: 40 00 14 ad call 200bd68 <_CORE_mutex_Seize_interrupt_trylock> 2006ab8: 92 07 a0 54 add %fp, 0x54, %o1 2006abc: 80 a2 20 00 cmp %o0, 0 2006ac0: 02 80 00 0a be 2006ae8 <_CORE_mutex_Seize+0x7c> 2006ac4: 80 a6 a0 00 cmp %i2, 0 2006ac8: 12 80 00 0a bne 2006af0 <_CORE_mutex_Seize+0x84> 2006acc: 82 10 20 01 mov 1, %g1 2006ad0: 7f ff ed 00 call 2001ed0 2006ad4: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2006ad8: 03 00 80 57 sethi %hi(0x2015c00), %g1 2006adc: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 ! 2015e24 <_Per_CPU_Information+0xc> 2006ae0: 84 10 20 01 mov 1, %g2 2006ae4: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2006ae8: 81 c7 e0 08 ret 2006aec: 81 e8 00 00 restore 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; 2006af0: c2 26 20 30 st %g1, [ %i0 + 0x30 ] 2006af4: 03 00 80 57 sethi %hi(0x2015c00), %g1 2006af8: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 ! 2015e24 <_Per_CPU_Information+0xc> 2006afc: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2006b00: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 2006b04: 03 00 80 56 sethi %hi(0x2015800), %g1 2006b08: c4 00 60 e0 ld [ %g1 + 0xe0 ], %g2 ! 20158e0 <_Thread_Dispatch_disable_level> 2006b0c: 84 00 a0 01 inc %g2 2006b10: c4 20 60 e0 st %g2, [ %g1 + 0xe0 ] 2006b14: 7f ff ec ef call 2001ed0 2006b18: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2006b1c: 90 10 00 18 mov %i0, %o0 2006b20: 7f ff ff bb call 2006a0c <_CORE_mutex_Seize_interrupt_blocking> 2006b24: 92 10 00 1b mov %i3, %o1 2006b28: 81 c7 e0 08 ret 2006b2c: 81 e8 00 00 restore =============================================================================== 02006ca4 <_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 ) { 2006ca4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2006ca8: 90 10 00 18 mov %i0, %o0 2006cac: 40 00 07 20 call 200892c <_Thread_queue_Dequeue> 2006cb0: ba 10 00 18 mov %i0, %i5 2006cb4: 80 a2 20 00 cmp %o0, 0 2006cb8: 12 80 00 0e bne 2006cf0 <_CORE_semaphore_Surrender+0x4c> 2006cbc: b0 10 20 00 clr %i0 if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 2006cc0: 7f ff ec 80 call 2001ec0 2006cc4: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2006cc8: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2006ccc: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2006cd0: 80 a0 40 02 cmp %g1, %g2 2006cd4: 1a 80 00 05 bcc 2006ce8 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 2006cd8: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2006cdc: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2006ce0: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2006ce4: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2006ce8: 7f ff ec 7a call 2001ed0 2006cec: 01 00 00 00 nop } return status; } 2006cf0: 81 c7 e0 08 ret 2006cf4: 81 e8 00 00 restore =============================================================================== 02005a44 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2005a44: 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 ]; 2005a48: f8 06 21 58 ld [ %i0 + 0x158 ], %i4 option_set = (rtems_option) the_thread->Wait.option; 2005a4c: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 _ISR_Disable( level ); 2005a50: 7f ff f1 1c call 2001ec0 2005a54: ba 10 00 18 mov %i0, %i5 2005a58: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 2005a5c: c4 07 00 00 ld [ %i4 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2005a60: c6 07 60 24 ld [ %i5 + 0x24 ], %g3 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2005a64: 82 88 c0 02 andcc %g3, %g2, %g1 2005a68: 02 80 00 44 be 2005b78 <_Event_Surrender+0x134> 2005a6c: 01 00 00 00 nop /* * 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() && 2005a70: 09 00 80 57 sethi %hi(0x2015c00), %g4 2005a74: 88 11 22 18 or %g4, 0x218, %g4 ! 2015e18 <_Per_CPU_Information> 2005a78: f2 01 20 08 ld [ %g4 + 8 ], %i1 2005a7c: 80 a6 60 00 cmp %i1, 0 2005a80: 22 80 00 1d be,a 2005af4 <_Event_Surrender+0xb0> 2005a84: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 2005a88: c8 01 20 0c ld [ %g4 + 0xc ], %g4 2005a8c: 80 a7 40 04 cmp %i5, %g4 2005a90: 32 80 00 19 bne,a 2005af4 <_Event_Surrender+0xb0> 2005a94: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2005a98: 09 00 80 58 sethi %hi(0x2016000), %g4 2005a9c: f2 01 22 10 ld [ %g4 + 0x210 ], %i1 ! 2016210 <_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 ) && 2005aa0: 80 a6 60 02 cmp %i1, 2 2005aa4: 02 80 00 07 be 2005ac0 <_Event_Surrender+0x7c> <== NEVER TAKEN 2005aa8: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2005aac: c8 01 22 10 ld [ %g4 + 0x210 ], %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() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2005ab0: 80 a1 20 01 cmp %g4, 1 2005ab4: 32 80 00 10 bne,a 2005af4 <_Event_Surrender+0xb0> 2005ab8: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2005abc: 80 a0 40 03 cmp %g1, %g3 2005ac0: 02 80 00 04 be 2005ad0 <_Event_Surrender+0x8c> 2005ac4: 80 8e e0 02 btst 2, %i3 2005ac8: 02 80 00 2c be 2005b78 <_Event_Surrender+0x134> <== NEVER TAKEN 2005acc: 01 00 00 00 nop 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) ); 2005ad0: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2005ad4: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005ad8: c4 07 60 28 ld [ %i5 + 0x28 ], %g2 _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 ); the_thread->Wait.count = 0; 2005adc: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005ae0: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2005ae4: 84 10 20 03 mov 3, %g2 2005ae8: 03 00 80 58 sethi %hi(0x2016000), %g1 2005aec: c4 20 62 10 st %g2, [ %g1 + 0x210 ] ! 2016210 <_Event_Sync_state> 2005af0: 30 80 00 22 b,a 2005b78 <_Event_Surrender+0x134> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2005af4: 80 89 21 00 btst 0x100, %g4 2005af8: 02 80 00 20 be 2005b78 <_Event_Surrender+0x134> 2005afc: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2005b00: 02 80 00 04 be 2005b10 <_Event_Surrender+0xcc> 2005b04: 80 8e e0 02 btst 2, %i3 2005b08: 02 80 00 1c be 2005b78 <_Event_Surrender+0x134> <== NEVER TAKEN 2005b0c: 01 00 00 00 nop 2005b10: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2005b14: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005b18: c4 07 60 28 ld [ %i5 + 0x28 ], %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 ); the_thread->Wait.count = 0; 2005b1c: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005b20: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 2005b24: 7f ff f0 eb call 2001ed0 2005b28: 90 10 00 18 mov %i0, %o0 2005b2c: 7f ff f0 e5 call 2001ec0 2005b30: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2005b34: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 2005b38: 80 a0 60 02 cmp %g1, 2 2005b3c: 02 80 00 06 be 2005b54 <_Event_Surrender+0x110> 2005b40: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2005b44: 7f ff f0 e3 call 2001ed0 2005b48: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2005b4c: 10 80 00 08 b 2005b6c <_Event_Surrender+0x128> 2005b50: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2005b54: c2 27 60 50 st %g1, [ %i5 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2005b58: 7f ff f0 de call 2001ed0 2005b5c: 90 10 00 18 mov %i0, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 2005b60: 40 00 0e 90 call 20095a0 <_Watchdog_Remove> 2005b64: 90 07 60 48 add %i5, 0x48, %o0 2005b68: 33 04 00 ff sethi %hi(0x1003fc00), %i1 2005b6c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2005b70: 40 00 09 bc call 2008260 <_Thread_Clear_state> 2005b74: 91 e8 00 1d restore %g0, %i5, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2005b78: 7f ff f0 d6 call 2001ed0 2005b7c: 81 e8 00 00 restore =============================================================================== 02005b80 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2005b80: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2005b84: 90 10 00 18 mov %i0, %o0 2005b88: 40 00 0a 9a call 20085f0 <_Thread_Get> 2005b8c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2005b90: c2 07 bf fc ld [ %fp + -4 ], %g1 2005b94: 80 a0 60 00 cmp %g1, 0 2005b98: 12 80 00 1c bne 2005c08 <_Event_Timeout+0x88> <== NEVER TAKEN 2005b9c: 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 ); 2005ba0: 7f ff f0 c8 call 2001ec0 2005ba4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2005ba8: 03 00 80 57 sethi %hi(0x2015c00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2005bac: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 ! 2015e24 <_Per_CPU_Information+0xc> 2005bb0: 80 a7 40 01 cmp %i5, %g1 2005bb4: 12 80 00 09 bne 2005bd8 <_Event_Timeout+0x58> 2005bb8: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 2005bbc: 03 00 80 58 sethi %hi(0x2016000), %g1 2005bc0: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 2016210 <_Event_Sync_state> 2005bc4: 80 a0 a0 01 cmp %g2, 1 2005bc8: 32 80 00 05 bne,a 2005bdc <_Event_Timeout+0x5c> 2005bcc: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2005bd0: 84 10 20 02 mov 2, %g2 2005bd4: c4 20 62 10 st %g2, [ %g1 + 0x210 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2005bd8: 82 10 20 06 mov 6, %g1 2005bdc: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2005be0: 7f ff f0 bc call 2001ed0 2005be4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2005be8: 90 10 00 1d mov %i5, %o0 2005bec: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2005bf0: 40 00 09 9c call 2008260 <_Thread_Clear_state> 2005bf4: 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; 2005bf8: 03 00 80 56 sethi %hi(0x2015800), %g1 2005bfc: c4 00 60 e0 ld [ %g1 + 0xe0 ], %g2 ! 20158e0 <_Thread_Dispatch_disable_level> 2005c00: 84 00 bf ff add %g2, -1, %g2 2005c04: c4 20 60 e0 st %g2, [ %g1 + 0xe0 ] 2005c08: 81 c7 e0 08 ret 2005c0c: 81 e8 00 00 restore =============================================================================== 0200c3cc <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200c3cc: 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; 200c3d0: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200c3d4: 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; 200c3d8: 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; 200c3dc: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 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; 200c3e0: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200c3e4: 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; 200c3e8: 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 ) { 200c3ec: 80 a7 40 19 cmp %i5, %i1 200c3f0: 0a 80 00 9f bcs 200c66c <_Heap_Extend+0x2a0> 200c3f4: b8 10 20 00 clr %i4 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200c3f8: 90 10 00 19 mov %i1, %o0 200c3fc: 92 10 00 1a mov %i2, %o1 200c400: 94 10 00 11 mov %l1, %o2 200c404: 98 07 bf f8 add %fp, -8, %o4 200c408: 7f ff eb 9b call 2007274 <_Heap_Get_first_and_last_block> 200c40c: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200c410: 80 8a 20 ff btst 0xff, %o0 200c414: 02 80 00 96 be 200c66c <_Heap_Extend+0x2a0> 200c418: b4 10 00 10 mov %l0, %i2 200c41c: aa 10 20 00 clr %l5 200c420: ac 10 20 00 clr %l6 200c424: b8 10 20 00 clr %i4 200c428: a8 10 20 00 clr %l4 200c42c: c2 06 20 18 ld [ %i0 + 0x18 ], %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 ( 200c430: 80 a0 40 1d cmp %g1, %i5 200c434: 1a 80 00 05 bcc 200c448 <_Heap_Extend+0x7c> 200c438: e6 06 80 00 ld [ %i2 ], %l3 200c43c: 80 a6 40 13 cmp %i1, %l3 200c440: 2a 80 00 8b bcs,a 200c66c <_Heap_Extend+0x2a0> 200c444: b8 10 20 00 clr %i4 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200c448: 80 a7 40 01 cmp %i5, %g1 200c44c: 02 80 00 06 be 200c464 <_Heap_Extend+0x98> 200c450: 80 a7 40 13 cmp %i5, %l3 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200c454: 2a 80 00 05 bcs,a 200c468 <_Heap_Extend+0x9c> 200c458: ac 10 00 1a mov %i2, %l6 200c45c: 10 80 00 04 b 200c46c <_Heap_Extend+0xa0> 200c460: 90 10 00 13 mov %l3, %o0 200c464: a8 10 00 1a mov %i2, %l4 200c468: 90 10 00 13 mov %l3, %o0 200c46c: 40 00 17 36 call 2012144 <.urem> 200c470: 92 10 00 11 mov %l1, %o1 200c474: ae 04 ff f8 add %l3, -8, %l7 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c478: 80 a4 c0 19 cmp %l3, %i1 200c47c: 12 80 00 05 bne 200c490 <_Heap_Extend+0xc4> 200c480: 90 25 c0 08 sub %l7, %o0, %o0 start_block->prev_size = extend_area_end; 200c484: fa 26 80 00 st %i5, [ %i2 ] RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 200c488: 10 80 00 04 b 200c498 <_Heap_Extend+0xcc> 200c48c: b8 10 00 08 mov %o0, %i4 merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200c490: 2a 80 00 02 bcs,a 200c498 <_Heap_Extend+0xcc> 200c494: aa 10 00 08 mov %o0, %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; 200c498: f4 02 20 04 ld [ %o0 + 4 ], %i2 200c49c: b4 0e bf fe and %i2, -2, %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c4a0: b4 06 80 08 add %i2, %o0, %i2 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200c4a4: 80 a6 80 10 cmp %i2, %l0 200c4a8: 12 bf ff e2 bne 200c430 <_Heap_Extend+0x64> 200c4ac: 82 10 00 1a mov %i2, %g1 if ( extend_area_begin < heap->area_begin ) { 200c4b0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200c4b4: 80 a6 40 01 cmp %i1, %g1 200c4b8: 3a 80 00 04 bcc,a 200c4c8 <_Heap_Extend+0xfc> 200c4bc: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200c4c0: 10 80 00 05 b 200c4d4 <_Heap_Extend+0x108> 200c4c4: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { 200c4c8: 80 a0 40 1d cmp %g1, %i5 200c4cc: 2a 80 00 02 bcs,a 200c4d4 <_Heap_Extend+0x108> 200c4d0: 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; 200c4d4: c4 07 bf f8 ld [ %fp + -8 ], %g2 200c4d8: c2 07 bf fc ld [ %fp + -4 ], %g1 extend_first_block->prev_size = extend_area_end; 200c4dc: fa 20 80 00 st %i5, [ %g2 ] heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200c4e0: 86 20 40 02 sub %g1, %g2, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200c4e4: 88 10 e0 01 or %g3, 1, %g4 _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200c4e8: c6 20 40 00 st %g3, [ %g1 ] 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 = 200c4ec: c8 20 a0 04 st %g4, [ %g2 + 4 ] 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 ) { 200c4f0: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 200c4f4: 80 a0 c0 02 cmp %g3, %g2 200c4f8: 08 80 00 04 bleu 200c508 <_Heap_Extend+0x13c> 200c4fc: c0 20 60 04 clr [ %g1 + 4 ] heap->first_block = extend_first_block; 200c500: 10 80 00 06 b 200c518 <_Heap_Extend+0x14c> 200c504: c4 26 20 20 st %g2, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200c508: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c50c: 80 a0 80 01 cmp %g2, %g1 200c510: 2a 80 00 02 bcs,a 200c518 <_Heap_Extend+0x14c> 200c514: c2 26 20 24 st %g1, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200c518: 80 a5 20 00 cmp %l4, 0 200c51c: 02 80 00 14 be 200c56c <_Heap_Extend+0x1a0> 200c520: 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; 200c524: f4 06 20 10 ld [ %i0 + 0x10 ], %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200c528: 92 10 00 1a mov %i2, %o1 200c52c: 40 00 17 06 call 2012144 <.urem> 200c530: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200c534: 80 a2 20 00 cmp %o0, 0 200c538: 02 80 00 04 be 200c548 <_Heap_Extend+0x17c> 200c53c: c2 05 00 00 ld [ %l4 ], %g1 return value - remainder + alignment; 200c540: b2 06 40 1a add %i1, %i2, %i1 200c544: 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 = 200c548: 92 06 7f f8 add %i1, -8, %o1 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; 200c54c: c2 26 7f f8 st %g1, [ %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 = 200c550: 82 25 00 09 sub %l4, %o1, %g1 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; 200c554: 82 10 60 01 or %g1, 1, %g1 _Heap_Free_block( heap, new_first_block ); 200c558: 90 10 00 18 mov %i0, %o0 200c55c: 7f ff ff 92 call 200c3a4 <_Heap_Free_block> 200c560: c2 22 60 04 st %g1, [ %o1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c564: 10 80 00 08 b 200c584 <_Heap_Extend+0x1b8> 200c568: 80 a7 20 00 cmp %i4, 0 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 ) { 200c56c: 80 a5 a0 00 cmp %l6, 0 200c570: 02 80 00 04 be 200c580 <_Heap_Extend+0x1b4> 200c574: ac 25 80 01 sub %l6, %g1, %l6 { 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; 200c578: 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 = 200c57c: ec 20 60 04 st %l6, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c580: 80 a7 20 00 cmp %i4, 0 200c584: 02 80 00 15 be 200c5d8 <_Heap_Extend+0x20c> 200c588: 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); 200c58c: 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( 200c590: ba 27 40 1c sub %i5, %i4, %i5 200c594: 40 00 16 ec call 2012144 <.urem> 200c598: 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) 200c59c: c4 07 20 04 ld [ %i4 + 4 ], %g2 200c5a0: ba 27 40 08 sub %i5, %o0, %i5 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200c5a4: 82 07 40 1c add %i5, %i4, %g1 (last_block->size_and_flag - last_block_new_size) 200c5a8: 84 20 80 1d sub %g2, %i5, %g2 | HEAP_PREV_BLOCK_USED; 200c5ac: 84 10 a0 01 or %g2, 1, %g2 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200c5b0: c4 20 60 04 st %g2, [ %g1 + 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; 200c5b4: c2 07 20 04 ld [ %i4 + 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 ); 200c5b8: 90 10 00 18 mov %i0, %o0 200c5bc: 82 08 60 01 and %g1, 1, %g1 200c5c0: 92 10 00 1c mov %i4, %o1 block->size_and_flag = size | flag; 200c5c4: ba 17 40 01 or %i5, %g1, %i5 200c5c8: 7f ff ff 77 call 200c3a4 <_Heap_Free_block> 200c5cc: fa 27 20 04 st %i5, [ %i4 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c5d0: 10 80 00 0f b 200c60c <_Heap_Extend+0x240> 200c5d4: 80 a7 20 00 cmp %i4, 0 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200c5d8: 80 a5 60 00 cmp %l5, 0 200c5dc: 02 80 00 0b be 200c608 <_Heap_Extend+0x23c> 200c5e0: 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; 200c5e4: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200c5e8: c2 07 bf fc ld [ %fp + -4 ], %g1 200c5ec: 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 ); 200c5f0: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200c5f4: 84 10 c0 02 or %g3, %g2, %g2 200c5f8: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200c5fc: c4 00 60 04 ld [ %g1 + 4 ], %g2 200c600: 84 10 a0 01 or %g2, 1, %g2 200c604: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c608: 80 a7 20 00 cmp %i4, 0 200c60c: 32 80 00 09 bne,a 200c630 <_Heap_Extend+0x264> 200c610: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c614: 80 a5 20 00 cmp %l4, 0 200c618: 32 80 00 06 bne,a 200c630 <_Heap_Extend+0x264> 200c61c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200c620: d2 07 bf f8 ld [ %fp + -8 ], %o1 200c624: 7f ff ff 60 call 200c3a4 <_Heap_Free_block> 200c628: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200c62c: 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( 200c630: c4 06 20 20 ld [ %i0 + 0x20 ], %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; 200c634: c6 00 60 04 ld [ %g1 + 4 ], %g3 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200c638: 84 20 80 01 sub %g2, %g1, %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; 200c63c: 86 08 e0 01 and %g3, 1, %g3 block->size_and_flag = size | flag; 200c640: 84 10 c0 02 or %g3, %g2, %g2 200c644: c4 20 60 04 st %g2, [ %g1 + 4 ] } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c648: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200c64c: b8 10 20 01 mov 1, %i4 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c650: a4 20 40 12 sub %g1, %l2, %l2 /* Statistics */ stats->size += extended_size; 200c654: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 if ( extended_size_ptr != NULL ) 200c658: 80 a6 e0 00 cmp %i3, 0 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200c65c: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200c660: 02 80 00 03 be 200c66c <_Heap_Extend+0x2a0> <== NEVER TAKEN 200c664: c2 26 20 2c st %g1, [ %i0 + 0x2c ] 200c668: e4 26 c0 00 st %l2, [ %i3 ] *extended_size_ptr = extended_size; return true; } 200c66c: b0 0f 20 01 and %i4, 1, %i0 200c670: 81 c7 e0 08 ret 200c674: 81 e8 00 00 restore =============================================================================== 0200c0c8 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200c0c8: 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 ) { return true; 200c0cc: 88 10 20 01 mov 1, %g4 /* * 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 ) { 200c0d0: 80 a6 60 00 cmp %i1, 0 200c0d4: 02 80 00 77 be 200c2b0 <_Heap_Free+0x1e8> 200c0d8: 90 10 00 19 mov %i1, %o0 200c0dc: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200c0e0: 40 00 16 da call 2011c48 <.urem> 200c0e4: ba 06 7f f8 add %i1, -8, %i5 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 200c0e8: da 06 20 20 ld [ %i0 + 0x20 ], %o5 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200c0ec: 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; 200c0f0: 80 a7 40 0d cmp %i5, %o5 200c0f4: 0a 80 00 05 bcs 200c108 <_Heap_Free+0x40> 200c0f8: 82 10 20 00 clr %g1 200c0fc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c100: 80 a0 40 1d cmp %g1, %i5 200c104: 82 60 3f ff subx %g0, -1, %g1 } alloc_begin = (uintptr_t) alloc_begin_ptr; block = _Heap_Block_of_alloc_area( alloc_begin, heap->page_size ); if ( !_Heap_Is_block_in_heap( heap, block ) ) { 200c108: 80 a0 60 00 cmp %g1, 0 200c10c: 02 80 00 69 be 200c2b0 <_Heap_Free+0x1e8> 200c110: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c114: d6 07 60 04 ld [ %i5 + 4 ], %o3 - 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; 200c118: 84 0a ff fe and %o3, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c11c: 82 00 80 1d add %g2, %i5, %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; 200c120: 80 a0 40 0d cmp %g1, %o5 200c124: 0a 80 00 05 bcs 200c138 <_Heap_Free+0x70> <== NEVER TAKEN 200c128: 86 10 20 00 clr %g3 200c12c: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200c130: 80 a0 c0 01 cmp %g3, %g1 200c134: 86 60 3f ff subx %g0, -1, %g3 _Heap_Protection_block_check( heap, block ); block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 200c138: 80 a0 e0 00 cmp %g3, 0 200c13c: 02 80 00 5d be 200c2b0 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c140: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c144: de 00 60 04 ld [ %g1 + 4 ], %o7 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200c148: 80 8b e0 01 btst 1, %o7 200c14c: 02 80 00 59 be 200c2b0 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c150: 9e 0b ff fe and %o7, -2, %o7 if ( !_Heap_Protection_determine_block_free( heap, block ) ) { return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 200c154: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200c158: 80 a0 40 04 cmp %g1, %g4 200c15c: 02 80 00 07 be 200c178 <_Heap_Free+0xb0> 200c160: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c164: 86 00 40 0f add %g1, %o7, %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; 200c168: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200c16c: 86 08 e0 01 and %g3, 1, %g3 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 )); 200c170: 80 a0 00 03 cmp %g0, %g3 200c174: 98 60 3f ff subx %g0, -1, %o4 if ( !_Heap_Is_prev_used( block ) ) { 200c178: 80 8a e0 01 btst 1, %o3 200c17c: 12 80 00 25 bne 200c210 <_Heap_Free+0x148> 200c180: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 200c184: 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); 200c188: 86 27 40 0b sub %i5, %o3, %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; 200c18c: 80 a0 c0 0d cmp %g3, %o5 200c190: 0a 80 00 04 bcs 200c1a0 <_Heap_Free+0xd8> <== NEVER TAKEN 200c194: 94 10 20 00 clr %o2 200c198: 80 a1 00 03 cmp %g4, %g3 200c19c: 94 60 3f ff subx %g0, -1, %o2 Heap_Block * const prev_block = _Heap_Block_at( block, -prev_size ); if ( !_Heap_Is_block_in_heap( heap, prev_block ) ) { 200c1a0: 80 a2 a0 00 cmp %o2, 0 200c1a4: 02 80 00 43 be 200c2b0 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c1a8: 88 10 20 00 clr %g4 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; 200c1ac: da 00 e0 04 ld [ %g3 + 4 ], %o5 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) ) { 200c1b0: 80 8b 60 01 btst 1, %o5 200c1b4: 02 80 00 3f be 200c2b0 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c1b8: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200c1bc: 02 80 00 0e be 200c1f4 <_Heap_Free+0x12c> 200c1c0: 88 00 80 0b add %g2, %o3, %g4 uintptr_t const size = block_size + prev_size + next_block_size; 200c1c4: 9e 01 00 0f add %g4, %o7, %o7 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200c1c8: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = block->prev; 200c1cc: c2 00 60 0c ld [ %g1 + 0xc ], %g1 prev->next = next; 200c1d0: c8 20 60 08 st %g4, [ %g1 + 8 ] next->prev = prev; 200c1d4: c2 21 20 0c st %g1, [ %g4 + 0xc ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200c1d8: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 200c1dc: 82 00 7f ff add %g1, -1, %g1 200c1e0: c2 26 20 38 st %g1, [ %i0 + 0x38 ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200c1e4: de 23 c0 03 st %o7, [ %o7 + %g3 ] 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; 200c1e8: 82 13 e0 01 or %o7, 1, %g1 200c1ec: 10 80 00 27 b 200c288 <_Heap_Free+0x1c0> 200c1f0: c2 20 e0 04 st %g1, [ %g3 + 4 ] 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; 200c1f4: 9e 11 20 01 or %g4, 1, %o7 200c1f8: de 20 e0 04 st %o7, [ %g3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200c1fc: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = size; 200c200: c8 20 80 1d st %g4, [ %g2 + %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; 200c204: 86 08 ff fe and %g3, -2, %g3 200c208: 10 80 00 20 b 200c288 <_Heap_Free+0x1c0> 200c20c: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200c210: 22 80 00 0d be,a 200c244 <_Heap_Free+0x17c> 200c214: c6 06 20 08 ld [ %i0 + 8 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200c218: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = old_block->prev; 200c21c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 new_block->next = next; 200c220: c8 27 60 08 st %g4, [ %i5 + 8 ] new_block->prev = prev; 200c224: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200c228: 86 03 c0 02 add %o7, %g2, %g3 next->prev = new_block; prev->next = new_block; 200c22c: fa 20 60 08 st %i5, [ %g1 + 8 ] Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; next->prev = new_block; 200c230: fa 21 20 0c st %i5, [ %g4 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200c234: 82 10 e0 01 or %g3, 1, %g1 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200c238: c6 20 c0 1d st %g3, [ %g3 + %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; 200c23c: 10 80 00 13 b 200c288 <_Heap_Free+0x1c0> 200c240: c2 27 60 04 st %g1, [ %i5 + 4 ] ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200c244: f0 27 60 0c st %i0, [ %i5 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200c248: c6 27 60 08 st %g3, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200c24c: fa 20 e0 0c st %i5, [ %g3 + 0xc ] 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; 200c250: 86 10 a0 01 or %g2, 1, %g3 200c254: c6 27 60 04 st %g3, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200c258: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = block_size; 200c25c: c4 20 80 1d st %g2, [ %g2 + %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; 200c260: 86 08 ff fe and %g3, -2, %g3 200c264: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200c268: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 if ( stats->max_free_blocks < stats->free_blocks ) { 200c26c: c6 06 20 3c ld [ %i0 + 0x3c ], %g3 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; 200c270: 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; 200c274: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200c278: 80 a0 c0 01 cmp %g3, %g1 200c27c: 1a 80 00 03 bcc 200c288 <_Heap_Free+0x1c0> 200c280: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200c284: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200c288: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 ++stats->frees; stats->free_size += block_size; return( true ); 200c28c: 88 10 20 01 mov 1, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200c290: 82 00 7f ff add %g1, -1, %g1 200c294: c2 26 20 40 st %g1, [ %i0 + 0x40 ] ++stats->frees; 200c298: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200c29c: 82 00 60 01 inc %g1 200c2a0: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200c2a4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200c2a8: 84 00 40 02 add %g1, %g2, %g2 200c2ac: c4 26 20 30 st %g2, [ %i0 + 0x30 ] return( true ); } 200c2b0: b0 09 20 01 and %g4, 1, %i0 200c2b4: 81 c7 e0 08 ret 200c2b8: 81 e8 00 00 restore =============================================================================== 020137a8 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 20137a8: 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); 20137ac: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 20137b0: 7f ff f9 26 call 2011c48 <.urem> 20137b4: 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 20137b8: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 20137bc: 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); 20137c0: 90 27 40 08 sub %i5, %o0, %o0 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; 20137c4: 80 a2 00 03 cmp %o0, %g3 20137c8: 0a 80 00 05 bcs 20137dc <_Heap_Size_of_alloc_area+0x34> 20137cc: 84 10 20 00 clr %g2 20137d0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 20137d4: 80 a0 40 08 cmp %g1, %o0 20137d8: 84 60 3f ff subx %g0, -1, %g2 uintptr_t const alloc_begin = (uintptr_t) alloc_begin_ptr; Heap_Block *block = _Heap_Block_of_alloc_area( alloc_begin, page_size ); Heap_Block *next_block = NULL; uintptr_t block_size = 0; if ( !_Heap_Is_block_in_heap( heap, block ) ) { 20137dc: 80 a0 a0 00 cmp %g2, 0 20137e0: 02 80 00 15 be 2013834 <_Heap_Size_of_alloc_area+0x8c> 20137e4: 82 10 20 00 clr %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; 20137e8: fa 02 20 04 ld [ %o0 + 4 ], %i5 20137ec: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20137f0: ba 07 40 08 add %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; 20137f4: 80 a7 40 03 cmp %i5, %g3 20137f8: 0a 80 00 05 bcs 201380c <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 20137fc: 84 10 20 00 clr %g2 2013800: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2013804: 80 a0 40 1d cmp %g1, %i5 2013808: 84 60 3f ff subx %g0, -1, %g2 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 201380c: 80 a0 a0 00 cmp %g2, 0 2013810: 02 80 00 09 be 2013834 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2013814: 82 10 20 00 clr %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; 2013818: c4 07 60 04 ld [ %i5 + 4 ], %g2 !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 201381c: 80 88 a0 01 btst 1, %g2 2013820: 02 80 00 05 be 2013834 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2013824: ba 27 40 19 sub %i5, %i1, %i5 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2013828: 82 10 20 01 mov 1, %g1 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 201382c: ba 07 60 04 add %i5, 4, %i5 2013830: fa 26 80 00 st %i5, [ %i2 ] return true; } 2013834: b0 08 60 01 and %g1, 1, %i0 2013838: 81 c7 e0 08 ret 201383c: 81 e8 00 00 restore =============================================================================== 020080a8 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20080a8: 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; 20080ac: 3b 00 80 20 sethi %hi(0x2008000), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 20080b0: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 uintptr_t const min_block_size = heap->min_block_size; 20080b4: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 20080b8: f6 06 20 20 ld [ %i0 + 0x20 ], %i3 Heap_Block *const last_block = heap->last_block; 20080bc: 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; 20080c0: 80 a6 a0 00 cmp %i2, 0 20080c4: 02 80 00 04 be 20080d4 <_Heap_Walk+0x2c> 20080c8: ba 17 60 54 or %i5, 0x54, %i5 20080cc: 3b 00 80 20 sethi %hi(0x2008000), %i5 20080d0: ba 17 60 5c or %i5, 0x5c, %i5 ! 200805c <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20080d4: 03 00 80 60 sethi %hi(0x2018000), %g1 20080d8: c4 00 61 1c ld [ %g1 + 0x11c ], %g2 ! 201811c <_System_state_Current> 20080dc: 80 a0 a0 03 cmp %g2, 3 20080e0: 12 80 01 24 bne 2008570 <_Heap_Walk+0x4c8> 20080e4: 82 10 20 01 mov 1, %g1 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)( 20080e8: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 20080ec: da 06 20 18 ld [ %i0 + 0x18 ], %o5 20080f0: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20080f4: f6 23 a0 60 st %i3, [ %sp + 0x60 ] 20080f8: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 20080fc: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008100: 90 10 00 19 mov %i1, %o0 2008104: c2 23 a0 68 st %g1, [ %sp + 0x68 ] 2008108: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200810c: 92 10 20 00 clr %o1 2008110: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008114: 15 00 80 55 sethi %hi(0x2015400), %o2 2008118: 96 10 00 1c mov %i4, %o3 200811c: 94 12 a0 88 or %o2, 0x88, %o2 2008120: 9f c7 40 00 call %i5 2008124: 98 10 00 10 mov %l0, %o4 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008128: 80 a7 20 00 cmp %i4, 0 200812c: 12 80 00 07 bne 2008148 <_Heap_Walk+0xa0> 2008130: 80 8f 20 07 btst 7, %i4 (*printer)( source, true, "page size is zero\n" ); 2008134: 15 00 80 55 sethi %hi(0x2015400), %o2 2008138: 90 10 00 19 mov %i1, %o0 200813c: 92 10 20 01 mov 1, %o1 2008140: 10 80 00 32 b 2008208 <_Heap_Walk+0x160> 2008144: 94 12 a1 20 or %o2, 0x120, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2008148: 22 80 00 08 be,a 2008168 <_Heap_Walk+0xc0> 200814c: 90 10 00 10 mov %l0, %o0 (*printer)( 2008150: 15 00 80 55 sethi %hi(0x2015400), %o2 2008154: 90 10 00 19 mov %i1, %o0 2008158: 92 10 20 01 mov 1, %o1 200815c: 94 12 a1 38 or %o2, 0x138, %o2 2008160: 10 80 01 0b b 200858c <_Heap_Walk+0x4e4> 2008164: 96 10 00 1c mov %i4, %o3 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008168: 7f ff e6 5e call 2001ae0 <.urem> 200816c: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2008170: 80 a2 20 00 cmp %o0, 0 2008174: 22 80 00 08 be,a 2008194 <_Heap_Walk+0xec> 2008178: 90 06 e0 08 add %i3, 8, %o0 (*printer)( 200817c: 15 00 80 55 sethi %hi(0x2015400), %o2 2008180: 90 10 00 19 mov %i1, %o0 2008184: 92 10 20 01 mov 1, %o1 2008188: 94 12 a1 58 or %o2, 0x158, %o2 200818c: 10 80 01 00 b 200858c <_Heap_Walk+0x4e4> 2008190: 96 10 00 10 mov %l0, %o3 2008194: 7f ff e6 53 call 2001ae0 <.urem> 2008198: 92 10 00 1c mov %i4, %o1 ); return false; } if ( 200819c: 80 a2 20 00 cmp %o0, 0 20081a0: 22 80 00 08 be,a 20081c0 <_Heap_Walk+0x118> 20081a4: c2 06 e0 04 ld [ %i3 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 20081a8: 15 00 80 55 sethi %hi(0x2015400), %o2 20081ac: 90 10 00 19 mov %i1, %o0 20081b0: 92 10 20 01 mov 1, %o1 20081b4: 94 12 a1 80 or %o2, 0x180, %o2 20081b8: 10 80 00 f5 b 200858c <_Heap_Walk+0x4e4> 20081bc: 96 10 00 1b mov %i3, %o3 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20081c0: 80 88 60 01 btst 1, %g1 20081c4: 32 80 00 07 bne,a 20081e0 <_Heap_Walk+0x138> 20081c8: f4 04 60 04 ld [ %l1 + 4 ], %i2 (*printer)( 20081cc: 15 00 80 55 sethi %hi(0x2015400), %o2 20081d0: 90 10 00 19 mov %i1, %o0 20081d4: 92 10 20 01 mov 1, %o1 20081d8: 10 80 00 0c b 2008208 <_Heap_Walk+0x160> 20081dc: 94 12 a1 b8 or %o2, 0x1b8, %o2 - 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; 20081e0: b4 0e bf fe and %i2, -2, %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20081e4: b4 04 40 1a add %l1, %i2, %i2 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; 20081e8: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( _Heap_Is_free( last_block ) ) { 20081ec: 80 88 60 01 btst 1, %g1 20081f0: 12 80 00 0a bne 2008218 <_Heap_Walk+0x170> 20081f4: 80 a6 80 1b cmp %i2, %i3 (*printer)( 20081f8: 15 00 80 55 sethi %hi(0x2015400), %o2 20081fc: 90 10 00 19 mov %i1, %o0 2008200: 92 10 20 01 mov 1, %o1 2008204: 94 12 a1 e8 or %o2, 0x1e8, %o2 2008208: 9f c7 40 00 call %i5 200820c: 01 00 00 00 nop if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008210: 10 80 00 d8 b 2008570 <_Heap_Walk+0x4c8> 2008214: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( 2008218: 02 80 00 06 be 2008230 <_Heap_Walk+0x188> 200821c: 15 00 80 55 sethi %hi(0x2015400), %o2 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008220: 90 10 00 19 mov %i1, %o0 2008224: 92 10 20 01 mov 1, %o1 2008228: 10 bf ff f8 b 2008208 <_Heap_Walk+0x160> 200822c: 94 12 a2 00 or %o2, 0x200, %o2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 2008230: e6 06 20 10 ld [ %i0 + 0x10 ], %l3 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008234: d6 06 20 08 ld [ %i0 + 8 ], %o3 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); 2008238: 10 80 00 33 b 2008304 <_Heap_Walk+0x25c> 200823c: a4 10 00 18 mov %i0, %l2 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; 2008240: 80 a0 80 0b cmp %g2, %o3 2008244: 18 80 00 05 bgu 2008258 <_Heap_Walk+0x1b0> 2008248: 82 10 20 00 clr %g1 200824c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2008250: 80 a0 40 0b cmp %g1, %o3 2008254: 82 60 3f ff subx %g0, -1, %g1 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 ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { 2008258: 80 a0 60 00 cmp %g1, 0 200825c: 32 80 00 07 bne,a 2008278 <_Heap_Walk+0x1d0> 2008260: 90 02 e0 08 add %o3, 8, %o0 (*printer)( 2008264: 15 00 80 55 sethi %hi(0x2015400), %o2 2008268: 90 10 00 19 mov %i1, %o0 200826c: 92 10 20 01 mov 1, %o1 2008270: 10 80 00 c7 b 200858c <_Heap_Walk+0x4e4> 2008274: 94 12 a2 30 or %o2, 0x230, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008278: d6 27 bf fc st %o3, [ %fp + -4 ] 200827c: 7f ff e6 19 call 2001ae0 <.urem> 2008280: 92 10 00 13 mov %l3, %o1 ); return false; } if ( 2008284: 80 a2 20 00 cmp %o0, 0 2008288: 02 80 00 07 be 20082a4 <_Heap_Walk+0x1fc> 200828c: d6 07 bf fc ld [ %fp + -4 ], %o3 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008290: 15 00 80 55 sethi %hi(0x2015400), %o2 2008294: 90 10 00 19 mov %i1, %o0 2008298: 92 10 20 01 mov 1, %o1 200829c: 10 80 00 bc b 200858c <_Heap_Walk+0x4e4> 20082a0: 94 12 a2 50 or %o2, 0x250, %o2 - 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; 20082a4: c2 02 e0 04 ld [ %o3 + 4 ], %g1 20082a8: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 20082ac: 82 02 c0 01 add %o3, %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; 20082b0: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 20082b4: 80 88 60 01 btst 1, %g1 20082b8: 22 80 00 07 be,a 20082d4 <_Heap_Walk+0x22c> 20082bc: d8 02 e0 0c ld [ %o3 + 0xc ], %o4 (*printer)( 20082c0: 15 00 80 55 sethi %hi(0x2015400), %o2 20082c4: 90 10 00 19 mov %i1, %o0 20082c8: 92 10 20 01 mov 1, %o1 20082cc: 10 80 00 b0 b 200858c <_Heap_Walk+0x4e4> 20082d0: 94 12 a2 80 or %o2, 0x280, %o2 ); return false; } if ( free_block->prev != prev_block ) { 20082d4: 80 a3 00 12 cmp %o4, %l2 20082d8: 22 80 00 0a be,a 2008300 <_Heap_Walk+0x258> 20082dc: a4 10 00 0b mov %o3, %l2 (*printer)( 20082e0: 15 00 80 55 sethi %hi(0x2015400), %o2 20082e4: 90 10 00 19 mov %i1, %o0 20082e8: 92 10 20 01 mov 1, %o1 20082ec: 94 12 a2 a0 or %o2, 0x2a0, %o2 20082f0: 9f c7 40 00 call %i5 20082f4: 01 00 00 00 nop if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20082f8: 10 80 00 9e b 2008570 <_Heap_Walk+0x4c8> 20082fc: 82 10 20 00 clr %g1 ! 0 return false; } prev_block = free_block; free_block = free_block->next; 2008300: d6 02 e0 08 ld [ %o3 + 8 ], %o3 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 ) { 2008304: 80 a2 c0 18 cmp %o3, %i0 2008308: 32 bf ff ce bne,a 2008240 <_Heap_Walk+0x198> 200830c: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 2008310: 2d 00 80 56 sethi %hi(0x2015800), %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)( 2008314: 2f 00 80 56 sethi %hi(0x2015800), %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008318: ac 15 a0 60 or %l6, 0x60, %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)( 200831c: ae 15 e0 48 or %l7, 0x48, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008320: 2b 00 80 56 sethi %hi(0x2015800), %l5 block = next_block; } while ( block != first_block ); return true; } 2008324: c2 06 a0 04 ld [ %i2 + 4 ], %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; 2008328: c6 06 20 20 ld [ %i0 + 0x20 ], %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; 200832c: a4 08 7f fe and %g1, -2, %l2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008330: a6 04 80 1a add %l2, %i2, %l3 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; 2008334: 80 a0 c0 13 cmp %g3, %l3 2008338: 18 80 00 05 bgu 200834c <_Heap_Walk+0x2a4> <== NEVER TAKEN 200833c: 84 10 20 00 clr %g2 2008340: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 2008344: 80 a0 80 13 cmp %g2, %l3 2008348: 84 60 3f ff subx %g0, -1, %g2 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; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 200834c: 80 a0 a0 00 cmp %g2, 0 2008350: 12 80 00 07 bne 200836c <_Heap_Walk+0x2c4> 2008354: 84 1e 80 11 xor %i2, %l1, %g2 (*printer)( 2008358: 15 00 80 55 sethi %hi(0x2015400), %o2 200835c: 90 10 00 19 mov %i1, %o0 2008360: 92 10 20 01 mov 1, %o1 2008364: 10 80 00 2c b 2008414 <_Heap_Walk+0x36c> 2008368: 94 12 a2 d8 or %o2, 0x2d8, %o2 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; 200836c: 80 a0 00 02 cmp %g0, %g2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008370: c2 27 bf fc st %g1, [ %fp + -4 ] 2008374: a8 40 20 00 addx %g0, 0, %l4 2008378: 90 10 00 12 mov %l2, %o0 200837c: 7f ff e5 d9 call 2001ae0 <.urem> 2008380: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2008384: 80 a2 20 00 cmp %o0, 0 2008388: 02 80 00 0c be 20083b8 <_Heap_Walk+0x310> 200838c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008390: 80 8d 20 ff btst 0xff, %l4 2008394: 02 80 00 0a be 20083bc <_Heap_Walk+0x314> 2008398: 80 a4 80 10 cmp %l2, %l0 (*printer)( 200839c: 15 00 80 55 sethi %hi(0x2015400), %o2 20083a0: 90 10 00 19 mov %i1, %o0 20083a4: 92 10 20 01 mov 1, %o1 20083a8: 94 12 a3 08 or %o2, 0x308, %o2 20083ac: 96 10 00 1a mov %i2, %o3 20083b0: 10 bf ff d0 b 20082f0 <_Heap_Walk+0x248> 20083b4: 98 10 00 12 mov %l2, %o4 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 20083b8: 80 a4 80 10 cmp %l2, %l0 20083bc: 1a 80 00 0d bcc 20083f0 <_Heap_Walk+0x348> 20083c0: 80 a4 c0 1a cmp %l3, %i2 20083c4: 80 8d 20 ff btst 0xff, %l4 20083c8: 02 80 00 0a be 20083f0 <_Heap_Walk+0x348> <== NEVER TAKEN 20083cc: 80 a4 c0 1a cmp %l3, %i2 (*printer)( 20083d0: 15 00 80 55 sethi %hi(0x2015400), %o2 20083d4: 90 10 00 19 mov %i1, %o0 20083d8: 92 10 20 01 mov 1, %o1 20083dc: 94 12 a3 38 or %o2, 0x338, %o2 20083e0: 96 10 00 1a mov %i2, %o3 20083e4: 98 10 00 12 mov %l2, %o4 20083e8: 10 80 00 3d b 20084dc <_Heap_Walk+0x434> 20083ec: 9a 10 00 10 mov %l0, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 20083f0: 38 80 00 0c bgu,a 2008420 <_Heap_Walk+0x378> 20083f4: a8 08 60 01 and %g1, 1, %l4 20083f8: 80 8d 20 ff btst 0xff, %l4 20083fc: 02 80 00 09 be 2008420 <_Heap_Walk+0x378> 2008400: a8 08 60 01 and %g1, 1, %l4 (*printer)( 2008404: 15 00 80 55 sethi %hi(0x2015400), %o2 2008408: 90 10 00 19 mov %i1, %o0 200840c: 92 10 20 01 mov 1, %o1 2008410: 94 12 a3 68 or %o2, 0x368, %o2 2008414: 96 10 00 1a mov %i2, %o3 2008418: 10 bf ff b6 b 20082f0 <_Heap_Walk+0x248> 200841c: 98 10 00 13 mov %l3, %o4 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; 2008420: c2 04 e0 04 ld [ %l3 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008424: 80 88 60 01 btst 1, %g1 2008428: 12 80 00 40 bne 2008528 <_Heap_Walk+0x480> 200842c: 90 10 00 19 mov %i1, %o0 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 ? 2008430: da 06 a0 0c ld [ %i2 + 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)( 2008434: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008438: 05 00 80 55 sethi %hi(0x2015400), %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; 200843c: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008440: 80 a3 40 01 cmp %o5, %g1 2008444: 02 80 00 07 be 2008460 <_Heap_Walk+0x3b8> 2008448: 86 10 a0 48 or %g2, 0x48, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200844c: 80 a3 40 18 cmp %o5, %i0 2008450: 12 80 00 04 bne 2008460 <_Heap_Walk+0x3b8> 2008454: 86 15 60 10 or %l5, 0x10, %g3 2008458: 07 00 80 55 sethi %hi(0x2015400), %g3 200845c: 86 10 e0 58 or %g3, 0x58, %g3 ! 2015458 <_Status_Object_name_errors_to_status+0x48> block->next, block->next == last_free_block ? 2008460: c4 06 a0 08 ld [ %i2 + 8 ], %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)( 2008464: 1f 00 80 55 sethi %hi(0x2015400), %o7 2008468: 80 a0 80 04 cmp %g2, %g4 200846c: 02 80 00 07 be 2008488 <_Heap_Walk+0x3e0> 2008470: 82 13 e0 68 or %o7, 0x68, %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008474: 80 a0 80 18 cmp %g2, %i0 2008478: 12 80 00 04 bne 2008488 <_Heap_Walk+0x3e0> 200847c: 82 15 60 10 or %l5, 0x10, %g1 2008480: 03 00 80 55 sethi %hi(0x2015400), %g1 2008484: 82 10 60 78 or %g1, 0x78, %g1 ! 2015478 <_Status_Object_name_errors_to_status+0x68> 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)( 2008488: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 200848c: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 2008490: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2008494: 90 10 00 19 mov %i1, %o0 2008498: 92 10 20 00 clr %o1 200849c: 15 00 80 55 sethi %hi(0x2015400), %o2 20084a0: 96 10 00 1a mov %i2, %o3 20084a4: 94 12 a3 a0 or %o2, 0x3a0, %o2 20084a8: 9f c7 40 00 call %i5 20084ac: 98 10 00 12 mov %l2, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 20084b0: da 04 c0 00 ld [ %l3 ], %o5 20084b4: 80 a4 80 0d cmp %l2, %o5 20084b8: 02 80 00 0d be 20084ec <_Heap_Walk+0x444> 20084bc: 80 a5 20 00 cmp %l4, 0 (*printer)( 20084c0: 15 00 80 55 sethi %hi(0x2015400), %o2 20084c4: e6 23 a0 5c st %l3, [ %sp + 0x5c ] 20084c8: 90 10 00 19 mov %i1, %o0 20084cc: 92 10 20 01 mov 1, %o1 20084d0: 94 12 a3 d8 or %o2, 0x3d8, %o2 20084d4: 96 10 00 1a mov %i2, %o3 20084d8: 98 10 00 12 mov %l2, %o4 20084dc: 9f c7 40 00 call %i5 20084e0: 01 00 00 00 nop 20084e4: 10 80 00 23 b 2008570 <_Heap_Walk+0x4c8> 20084e8: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( !prev_used ) { 20084ec: 32 80 00 0a bne,a 2008514 <_Heap_Walk+0x46c> 20084f0: c2 06 20 08 ld [ %i0 + 8 ], %g1 (*printer)( 20084f4: 15 00 80 56 sethi %hi(0x2015800), %o2 20084f8: 90 10 00 19 mov %i1, %o0 20084fc: 92 10 20 01 mov 1, %o1 2008500: 10 80 00 22 b 2008588 <_Heap_Walk+0x4e0> 2008504: 94 12 a0 18 or %o2, 0x18, %o2 { 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 ) { if ( free_block == block ) { 2008508: 02 80 00 17 be 2008564 <_Heap_Walk+0x4bc> 200850c: 80 a4 c0 1b cmp %l3, %i3 return true; } free_block = free_block->next; 2008510: 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 ) { 2008514: 80 a0 40 18 cmp %g1, %i0 2008518: 12 bf ff fc bne 2008508 <_Heap_Walk+0x460> 200851c: 80 a0 40 1a cmp %g1, %i2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008520: 10 80 00 17 b 200857c <_Heap_Walk+0x4d4> 2008524: 15 00 80 56 sethi %hi(0x2015800), %o2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2008528: 80 a5 20 00 cmp %l4, 0 200852c: 02 80 00 08 be 200854c <_Heap_Walk+0x4a4> 2008530: 92 10 20 00 clr %o1 (*printer)( 2008534: 94 10 00 17 mov %l7, %o2 2008538: 96 10 00 1a mov %i2, %o3 200853c: 9f c7 40 00 call %i5 2008540: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008544: 10 80 00 08 b 2008564 <_Heap_Walk+0x4bc> 2008548: 80 a4 c0 1b cmp %l3, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200854c: da 06 80 00 ld [ %i2 ], %o5 2008550: 94 10 00 16 mov %l6, %o2 2008554: 96 10 00 1a mov %i2, %o3 2008558: 9f c7 40 00 call %i5 200855c: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008560: 80 a4 c0 1b cmp %l3, %i3 2008564: 12 bf ff 70 bne 2008324 <_Heap_Walk+0x27c> 2008568: b4 10 00 13 mov %l3, %i2 return true; 200856c: 82 10 20 01 mov 1, %g1 } 2008570: b0 08 60 01 and %g1, 1, %i0 2008574: 81 c7 e0 08 ret 2008578: 81 e8 00 00 restore return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200857c: 90 10 00 19 mov %i1, %o0 2008580: 92 10 20 01 mov 1, %o1 2008584: 94 12 a0 88 or %o2, 0x88, %o2 2008588: 96 10 00 1a mov %i2, %o3 200858c: 9f c7 40 00 call %i5 2008590: 01 00 00 00 nop 2008594: 10 bf ff f7 b 2008570 <_Heap_Walk+0x4c8> 2008598: 82 10 20 00 clr %g1 ! 0 =============================================================================== 020072c8 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20072c8: 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 ) 20072cc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20072d0: 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 ) 20072d4: 80 a0 60 00 cmp %g1, 0 20072d8: 02 80 00 20 be 2007358 <_Objects_Allocate+0x90> <== NEVER TAKEN 20072dc: 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 ); 20072e0: b8 07 60 20 add %i5, 0x20, %i4 20072e4: 7f ff fd 8b call 2006910 <_Chain_Get> 20072e8: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 20072ec: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 20072f0: 80 a0 60 00 cmp %g1, 0 20072f4: 02 80 00 19 be 2007358 <_Objects_Allocate+0x90> 20072f8: 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 ) { 20072fc: 80 a2 20 00 cmp %o0, 0 2007300: 32 80 00 0a bne,a 2007328 <_Objects_Allocate+0x60> 2007304: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 _Objects_Extend_information( information ); 2007308: 40 00 00 1d call 200737c <_Objects_Extend_information> 200730c: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007310: 7f ff fd 80 call 2006910 <_Chain_Get> 2007314: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007318: b0 92 20 00 orcc %o0, 0, %i0 200731c: 02 80 00 0f be 2007358 <_Objects_Allocate+0x90> 2007320: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007324: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007328: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 200732c: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007330: 40 00 29 9a call 2011998 <.udiv> 2007334: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007338: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200733c: 91 2a 20 02 sll %o0, 2, %o0 2007340: c4 00 40 08 ld [ %g1 + %o0 ], %g2 2007344: 84 00 bf ff add %g2, -1, %g2 2007348: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; 200734c: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1 2007350: 82 00 7f ff add %g1, -1, %g1 2007354: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007358: 81 c7 e0 08 ret 200735c: 81 e8 00 00 restore =============================================================================== 020076d4 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 20076d4: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 20076d8: 80 a6 60 00 cmp %i1, 0 20076dc: 02 80 00 17 be 2007738 <_Objects_Get_information+0x64> 20076e0: 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 ); 20076e4: 40 00 12 f6 call 200c2bc <_Objects_API_maximum_class> 20076e8: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 20076ec: 80 a2 20 00 cmp %o0, 0 20076f0: 02 80 00 12 be 2007738 <_Objects_Get_information+0x64> 20076f4: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 20076f8: 18 80 00 10 bgu 2007738 <_Objects_Get_information+0x64> 20076fc: 03 00 80 56 sethi %hi(0x2015800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007700: b1 2e 20 02 sll %i0, 2, %i0 2007704: 82 10 60 48 or %g1, 0x48, %g1 2007708: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200770c: 80 a0 60 00 cmp %g1, 0 2007710: 02 80 00 0a be 2007738 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007714: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007718: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 200771c: 80 a7 60 00 cmp %i5, 0 2007720: 02 80 00 06 be 2007738 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007724: 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 ) 2007728: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 200772c: 80 a0 00 01 cmp %g0, %g1 2007730: 82 60 20 00 subx %g0, 0, %g1 2007734: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2007738: 81 c7 e0 08 ret 200773c: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02008f98 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2008f98: 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; 2008f9c: 92 96 20 00 orcc %i0, 0, %o1 2008fa0: 12 80 00 06 bne 2008fb8 <_Objects_Id_to_name+0x20> 2008fa4: 83 32 60 18 srl %o1, 0x18, %g1 2008fa8: 03 00 80 79 sethi %hi(0x201e400), %g1 2008fac: c2 00 60 94 ld [ %g1 + 0x94 ], %g1 ! 201e494 <_Per_CPU_Information+0xc> 2008fb0: d2 00 60 08 ld [ %g1 + 8 ], %o1 2008fb4: 83 32 60 18 srl %o1, 0x18, %g1 2008fb8: 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 ) 2008fbc: 84 00 7f ff add %g1, -1, %g2 2008fc0: 80 a0 a0 02 cmp %g2, 2 2008fc4: 18 80 00 16 bgu 200901c <_Objects_Id_to_name+0x84> 2008fc8: 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 ] ) 2008fcc: 10 80 00 16 b 2009024 <_Objects_Id_to_name+0x8c> 2008fd0: 83 28 60 02 sll %g1, 2, %g1 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 2008fd4: 85 28 a0 02 sll %g2, 2, %g2 2008fd8: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2008fdc: 80 a2 20 00 cmp %o0, 0 2008fe0: 02 80 00 0f be 200901c <_Objects_Id_to_name+0x84> <== NEVER TAKEN 2008fe4: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2008fe8: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2008fec: 80 a0 60 00 cmp %g1, 0 2008ff0: 12 80 00 0b bne 200901c <_Objects_Id_to_name+0x84> <== NEVER TAKEN 2008ff4: 01 00 00 00 nop return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2008ff8: 7f ff ff cb call 2008f24 <_Objects_Get> 2008ffc: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2009000: 80 a2 20 00 cmp %o0, 0 2009004: 02 80 00 06 be 200901c <_Objects_Id_to_name+0x84> 2009008: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200900c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009010: 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(); 2009014: 40 00 03 71 call 2009dd8 <_Thread_Enable_dispatch> 2009018: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 200901c: 81 c7 e0 08 ret 2009020: 91 e8 00 1d restore %g0, %i5, %o0 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 2009024: 05 00 80 77 sethi %hi(0x201dc00), %g2 2009028: 84 10 a2 b8 or %g2, 0x2b8, %g2 ! 201deb8 <_Objects_Information_table> 200902c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009030: 80 a0 60 00 cmp %g1, 0 2009034: 12 bf ff e8 bne 2008fd4 <_Objects_Id_to_name+0x3c> 2009038: 85 32 60 1b srl %o1, 0x1b, %g2 200903c: 30 bf ff f8 b,a 200901c <_Objects_Id_to_name+0x84> =============================================================================== 0200af30 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200af30: 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( 200af34: 11 00 80 99 sethi %hi(0x2026400), %o0 200af38: 92 10 00 18 mov %i0, %o1 200af3c: 90 12 23 0c or %o0, 0x30c, %o0 200af40: 40 00 0c 74 call 200e110 <_Objects_Get> 200af44: 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 ) { 200af48: c2 07 bf f8 ld [ %fp + -8 ], %g1 200af4c: 80 a0 60 00 cmp %g1, 0 200af50: 12 80 00 3f bne 200b04c <_POSIX_Message_queue_Receive_support+0x11c> 200af54: 01 00 00 00 nop case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200af58: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200af5c: 84 08 60 03 and %g1, 3, %g2 200af60: 80 a0 a0 01 cmp %g2, 1 200af64: 32 80 00 08 bne,a 200af84 <_POSIX_Message_queue_Receive_support+0x54> 200af68: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 _Thread_Enable_dispatch(); 200af6c: 40 00 0f e0 call 200eeec <_Thread_Enable_dispatch> 200af70: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EBADF ); 200af74: 40 00 29 51 call 20154b8 <__errno> 200af78: 01 00 00 00 nop 200af7c: 10 80 00 0b b 200afa8 <_POSIX_Message_queue_Receive_support+0x78> 200af80: 82 10 20 09 mov 9, %g1 ! 9 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200af84: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200af88: 80 a6 80 02 cmp %i2, %g2 200af8c: 1a 80 00 09 bcc 200afb0 <_POSIX_Message_queue_Receive_support+0x80> 200af90: 84 10 3f ff mov -1, %g2 _Thread_Enable_dispatch(); 200af94: 40 00 0f d6 call 200eeec <_Thread_Enable_dispatch> 200af98: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200af9c: 40 00 29 47 call 20154b8 <__errno> 200afa0: 01 00 00 00 nop 200afa4: 82 10 20 7a mov 0x7a, %g1 ! 7a 200afa8: 10 80 00 27 b 200b044 <_POSIX_Message_queue_Receive_support+0x114> 200afac: c2 22 00 00 st %g1, [ %o0 ] /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200afb0: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200afb4: 80 a7 20 00 cmp %i4, 0 200afb8: 02 80 00 06 be 200afd0 <_POSIX_Message_queue_Receive_support+0xa0><== NEVER TAKEN 200afbc: 98 10 20 00 clr %o4 do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200afc0: 05 00 00 10 sethi %hi(0x4000), %g2 200afc4: 82 08 40 02 and %g1, %g2, %g1 200afc8: 80 a0 00 01 cmp %g0, %g1 200afcc: 98 60 3f ff subx %g0, -1, %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200afd0: 9a 10 00 1d mov %i5, %o5 200afd4: 90 02 20 1c add %o0, 0x1c, %o0 200afd8: 92 10 00 18 mov %i0, %o1 200afdc: 94 10 00 19 mov %i1, %o2 200afe0: 96 07 bf fc add %fp, -4, %o3 200afe4: 40 00 08 23 call 200d070 <_CORE_message_queue_Seize> 200afe8: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200afec: 40 00 0f c0 call 200eeec <_Thread_Enable_dispatch> 200aff0: 3b 00 80 99 sethi %hi(0x2026400), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200aff4: ba 17 63 78 or %i5, 0x378, %i5 ! 2026778 <_Per_CPU_Information> 200aff8: 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); 200affc: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 if ( !_Thread_Executing->Wait.return_code ) 200b000: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200b004: 85 38 e0 1f sra %g3, 0x1f, %g2 200b008: 86 18 80 03 xor %g2, %g3, %g3 200b00c: 84 20 c0 02 sub %g3, %g2, %g2 200b010: 80 a0 60 00 cmp %g1, 0 200b014: 12 80 00 05 bne 200b028 <_POSIX_Message_queue_Receive_support+0xf8> 200b018: c4 26 c0 00 st %g2, [ %i3 ] return length_out; 200b01c: f0 07 bf fc ld [ %fp + -4 ], %i0 200b020: 81 c7 e0 08 ret 200b024: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( 200b028: 40 00 29 24 call 20154b8 <__errno> 200b02c: 01 00 00 00 nop 200b030: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b034: b8 10 00 08 mov %o0, %i4 200b038: 40 00 00 9b call 200b2a4 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b03c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b040: d0 27 00 00 st %o0, [ %i4 ] 200b044: 81 c7 e0 08 ret 200b048: 91 e8 3f ff restore %g0, -1, %o0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b04c: 40 00 29 1b call 20154b8 <__errno> 200b050: b0 10 3f ff mov -1, %i0 200b054: 82 10 20 09 mov 9, %g1 200b058: c2 22 00 00 st %g1, [ %o0 ] } 200b05c: 81 c7 e0 08 ret 200b060: 81 e8 00 00 restore =============================================================================== 0200b468 <_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 ]; 200b468: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200b46c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200b470: 80 a0 a0 00 cmp %g2, 0 200b474: 12 80 00 12 bne 200b4bc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x54><== NEVER TAKEN 200b478: 01 00 00 00 nop 200b47c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200b480: 80 a0 a0 01 cmp %g2, 1 200b484: 12 80 00 0e bne 200b4bc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x54> 200b488: 01 00 00 00 nop thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200b48c: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 200b490: 80 a0 60 00 cmp %g1, 0 200b494: 02 80 00 0a be 200b4bc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x54> 200b498: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 200b49c: 03 00 80 5b sethi %hi(0x2016c00), %g1 200b4a0: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2016d40 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200b4a4: 92 10 3f ff mov -1, %o1 200b4a8: 84 00 bf ff add %g2, -1, %g2 200b4ac: c4 20 61 40 st %g2, [ %g1 + 0x140 ] 200b4b0: 82 13 c0 00 mov %o7, %g1 200b4b4: 40 00 01 b1 call 200bb78 <_POSIX_Thread_Exit> 200b4b8: 9e 10 40 00 mov %g1, %o7 } else _Thread_Enable_dispatch(); 200b4bc: 82 13 c0 00 mov %o7, %g1 200b4c0: 7f ff f5 13 call 200890c <_Thread_Enable_dispatch> 200b4c4: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200c798 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200c798: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200c79c: d0 06 40 00 ld [ %i1 ], %o0 200c7a0: 7f ff ff f3 call 200c76c <_POSIX_Priority_Is_valid> 200c7a4: ba 10 00 18 mov %i0, %i5 200c7a8: 80 8a 20 ff btst 0xff, %o0 200c7ac: 02 80 00 11 be 200c7f0 <_POSIX_Thread_Translate_sched_param+0x58><== NEVER TAKEN 200c7b0: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200c7b4: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200c7b8: 80 a7 60 00 cmp %i5, 0 200c7bc: 12 80 00 06 bne 200c7d4 <_POSIX_Thread_Translate_sched_param+0x3c> 200c7c0: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200c7c4: 82 10 20 01 mov 1, %g1 200c7c8: c2 26 80 00 st %g1, [ %i2 ] return 0; 200c7cc: 81 c7 e0 08 ret 200c7d0: 91 e8 20 00 restore %g0, 0, %o0 } if ( policy == SCHED_FIFO ) { 200c7d4: 80 a7 60 01 cmp %i5, 1 200c7d8: 02 80 00 06 be 200c7f0 <_POSIX_Thread_Translate_sched_param+0x58> 200c7dc: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200c7e0: 80 a7 60 02 cmp %i5, 2 200c7e4: 32 80 00 05 bne,a 200c7f8 <_POSIX_Thread_Translate_sched_param+0x60> 200c7e8: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200c7ec: fa 26 80 00 st %i5, [ %i2 ] return 0; 200c7f0: 81 c7 e0 08 ret 200c7f4: 81 e8 00 00 restore } if ( policy == SCHED_SPORADIC ) { 200c7f8: 12 bf ff fe bne 200c7f0 <_POSIX_Thread_Translate_sched_param+0x58> 200c7fc: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200c800: c2 06 60 08 ld [ %i1 + 8 ], %g1 200c804: 80 a0 60 00 cmp %g1, 0 200c808: 32 80 00 07 bne,a 200c824 <_POSIX_Thread_Translate_sched_param+0x8c> 200c80c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200c810: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200c814: 80 a0 60 00 cmp %g1, 0 200c818: 02 80 00 1d be 200c88c <_POSIX_Thread_Translate_sched_param+0xf4> 200c81c: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200c820: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200c824: 80 a0 60 00 cmp %g1, 0 200c828: 12 80 00 06 bne 200c840 <_POSIX_Thread_Translate_sched_param+0xa8> 200c82c: 01 00 00 00 nop 200c830: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200c834: 80 a0 60 00 cmp %g1, 0 200c838: 02 bf ff ee be 200c7f0 <_POSIX_Thread_Translate_sched_param+0x58> 200c83c: 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 ) < 200c840: 7f ff f6 84 call 200a250 <_Timespec_To_ticks> 200c844: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200c848: 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 ) < 200c84c: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200c850: 7f ff f6 80 call 200a250 <_Timespec_To_ticks> 200c854: 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 ) < 200c858: 80 a7 40 08 cmp %i5, %o0 200c85c: 0a 80 00 0c bcs 200c88c <_POSIX_Thread_Translate_sched_param+0xf4> 200c860: 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 ) ) 200c864: 7f ff ff c2 call 200c76c <_POSIX_Priority_Is_valid> 200c868: d0 06 60 04 ld [ %i1 + 4 ], %o0 200c86c: 80 8a 20 ff btst 0xff, %o0 200c870: 02 bf ff e0 be 200c7f0 <_POSIX_Thread_Translate_sched_param+0x58> 200c874: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200c878: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; 200c87c: b0 10 20 00 clr %i0 if ( !_POSIX_Priority_Is_valid( param->sched_ss_low_priority ) ) return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200c880: 03 00 80 19 sethi %hi(0x2006400), %g1 200c884: 82 10 62 04 or %g1, 0x204, %g1 ! 2006604 <_POSIX_Threads_Sporadic_budget_callout> 200c888: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200c88c: 81 c7 e0 08 ret 200c890: 81 e8 00 00 restore =============================================================================== 02006350 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2006350: 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; 2006354: 03 00 80 71 sethi %hi(0x201c400), %g1 2006358: 82 10 60 84 or %g1, 0x84, %g1 ! 201c484 maximum = Configuration_POSIX_API.number_of_initialization_threads; 200635c: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2006360: 80 a6 e0 00 cmp %i3, 0 2006364: 02 80 00 1b be 20063d0 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 2006368: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 200636c: 80 a7 60 00 cmp %i5, 0 2006370: 02 80 00 18 be 20063d0 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 2006374: 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 ); 2006378: 40 00 19 47 call 200c894 200637c: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 2006380: 92 10 20 02 mov 2, %o1 2006384: 40 00 19 50 call 200c8c4 2006388: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 200638c: d2 07 60 04 ld [ %i5 + 4 ], %o1 2006390: 40 00 19 5c call 200c900 2006394: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 2006398: d4 07 40 00 ld [ %i5 ], %o2 200639c: 90 07 bf fc add %fp, -4, %o0 20063a0: 92 07 bf bc add %fp, -68, %o1 20063a4: 7f ff ff 3a call 200608c 20063a8: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20063ac: 94 92 20 00 orcc %o0, 0, %o2 20063b0: 22 80 00 05 be,a 20063c4 <_POSIX_Threads_Initialize_user_threads_body+0x74> 20063b4: b8 07 20 01 inc %i4 _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20063b8: 90 10 20 02 mov 2, %o0 20063bc: 40 00 07 e0 call 200833c <_Internal_error_Occurred> 20063c0: 92 10 20 01 mov 1, %o1 * * Setting the attributes explicitly is critical, since we don't want * to inherit the idle tasks attributes. */ for ( index=0 ; index < maximum ; index++ ) { 20063c4: 80 a7 00 1b cmp %i4, %i3 20063c8: 0a bf ff ec bcs 2006378 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 20063cc: ba 07 60 08 add %i5, 8, %i5 20063d0: 81 c7 e0 08 ret 20063d4: 81 e8 00 00 restore =============================================================================== 0200b698 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200b698: 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 ]; 200b69c: 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 ); 200b6a0: 40 00 03 c9 call 200c5c4 <_Timespec_To_ticks> 200b6a4: 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); 200b6a8: 03 00 80 52 sethi %hi(0x2014800), %g1 200b6ac: d2 08 63 ec ldub [ %g1 + 0x3ec ], %o1 ! 2014bec 200b6b0: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->cpu_time_budget = ticks; 200b6b4: d0 26 60 78 st %o0, [ %i1 + 0x78 ] 200b6b8: 92 22 40 01 sub %o1, %g1, %o1 */ #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 ) { 200b6bc: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200b6c0: 80 a0 60 00 cmp %g1, 0 200b6c4: 12 80 00 08 bne 200b6e4 <_POSIX_Threads_Sporadic_budget_TSR+0x4c><== NEVER TAKEN 200b6c8: 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 ) { 200b6cc: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200b6d0: 80 a0 40 09 cmp %g1, %o1 200b6d4: 08 80 00 04 bleu 200b6e4 <_POSIX_Threads_Sporadic_budget_TSR+0x4c> 200b6d8: 90 10 00 19 mov %i1, %o0 _Thread_Change_priority( the_thread, new_priority, true ); 200b6dc: 7f ff f2 9c call 200814c <_Thread_Change_priority> 200b6e0: 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 ); 200b6e4: 40 00 03 b8 call 200c5c4 <_Timespec_To_ticks> 200b6e8: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200b6ec: 31 00 80 56 sethi %hi(0x2015800), %i0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200b6f0: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200b6f4: b0 16 21 a4 or %i0, 0x1a4, %i0 200b6f8: 7f ff f7 4f call 2009434 <_Watchdog_Insert> 200b6fc: 93 ef 60 a8 restore %i5, 0xa8, %o1 =============================================================================== 0200b700 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200b700: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * 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 */ 200b704: 86 10 3f ff mov -1, %g3 200b708: c4 00 a0 8c ld [ %g2 + 0x8c ], %g2 200b70c: c6 22 20 78 st %g3, [ %o0 + 0x78 ] 200b710: 07 00 80 52 sethi %hi(0x2014800), %g3 200b714: d2 08 e3 ec ldub [ %g3 + 0x3ec ], %o1 ! 2014bec 200b718: 92 22 40 02 sub %o1, %g2, %o1 */ #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 ) { 200b71c: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200b720: 80 a0 a0 00 cmp %g2, 0 200b724: 12 80 00 09 bne 200b748 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200b728: d2 22 20 18 st %o1, [ %o0 + 0x18 ] /* * 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 ) { 200b72c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b730: 80 a0 40 09 cmp %g1, %o1 200b734: 1a 80 00 05 bcc 200b748 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200b738: 94 10 20 01 mov 1, %o2 _Thread_Change_priority( the_thread, new_priority, true ); 200b73c: 82 13 c0 00 mov %o7, %g1 200b740: 7f ff f2 83 call 200814c <_Thread_Change_priority> 200b744: 9e 10 40 00 mov %g1, %o7 200b748: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 020060e4 <_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) { 20060e4: 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; 20060e8: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 20060ec: 82 00 60 01 inc %g1 20060f0: c2 26 60 68 st %g1, [ %i1 + 0x68 ] /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 20060f4: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 20060f8: 80 a0 60 00 cmp %g1, 0 20060fc: 32 80 00 07 bne,a 2006118 <_POSIX_Timer_TSR+0x34> 2006100: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006104: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2006108: 80 a0 60 00 cmp %g1, 0 200610c: 02 80 00 0f be 2006148 <_POSIX_Timer_TSR+0x64> <== NEVER TAKEN 2006110: 82 10 20 04 mov 4, %g1 ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 2006114: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006118: d4 06 60 08 ld [ %i1 + 8 ], %o2 200611c: 90 06 60 10 add %i1, 0x10, %o0 2006120: 17 00 80 18 sethi %hi(0x2006000), %o3 2006124: 98 10 00 19 mov %i1, %o4 2006128: 40 00 18 ef call 200c4e4 <_POSIX_Timer_Insert_helper> 200612c: 96 12 e0 e4 or %o3, 0xe4, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2006130: 80 8a 20 ff btst 0xff, %o0 2006134: 02 80 00 0a be 200615c <_POSIX_Timer_TSR+0x78> <== NEVER TAKEN 2006138: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 200613c: 40 00 05 aa call 20077e4 <_TOD_Get> 2006140: 90 06 60 6c add %i1, 0x6c, %o0 2006144: 82 10 20 03 mov 3, %g1 /* * 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 ) ) { 2006148: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 200614c: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 2006150: 40 00 17 d2 call 200c098 2006154: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 2006158: c0 26 60 68 clr [ %i1 + 0x68 ] 200615c: 81 c7 e0 08 ret 2006160: 81 e8 00 00 restore =============================================================================== 0200d984 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200d984: 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, 200d988: 98 10 20 01 mov 1, %o4 200d98c: 90 10 00 18 mov %i0, %o0 200d990: 92 10 00 19 mov %i1, %o1 200d994: 94 07 bf f4 add %fp, -12, %o2 200d998: 40 00 00 2e call 200da50 <_POSIX_signals_Clear_signals> 200d99c: 96 10 00 1a mov %i2, %o3 200d9a0: 80 8a 20 ff btst 0xff, %o0 200d9a4: 02 80 00 28 be 200da44 <_POSIX_signals_Check_signal+0xc0> 200d9a8: 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 ) 200d9ac: 85 2e 60 02 sll %i1, 2, %g2 200d9b0: 35 00 80 57 sethi %hi(0x2015c00), %i2 200d9b4: b7 2e 60 04 sll %i1, 4, %i3 200d9b8: b4 16 a2 70 or %i2, 0x270, %i2 200d9bc: b6 26 c0 02 sub %i3, %g2, %i3 200d9c0: 84 06 80 1b add %i2, %i3, %g2 200d9c4: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200d9c8: 80 a7 60 01 cmp %i5, 1 200d9cc: 02 80 00 1e be 200da44 <_POSIX_signals_Check_signal+0xc0> <== NEVER TAKEN 200d9d0: 90 07 bf cc add %fp, -52, %o0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200d9d4: f8 06 20 d0 ld [ %i0 + 0xd0 ], %i4 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200d9d8: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200d9dc: 82 10 40 1c or %g1, %i4, %g1 200d9e0: 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, 200d9e4: 03 00 80 57 sethi %hi(0x2015c00), %g1 200d9e8: d2 00 62 24 ld [ %g1 + 0x224 ], %o1 ! 2015e24 <_Per_CPU_Information+0xc> 200d9ec: 94 10 20 28 mov 0x28, %o2 200d9f0: 40 00 04 31 call 200eab4 200d9f4: 92 02 60 20 add %o1, 0x20, %o1 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200d9f8: c2 06 80 1b ld [ %i2 + %i3 ], %g1 200d9fc: 80 a0 60 02 cmp %g1, 2 200da00: 12 80 00 07 bne 200da1c <_POSIX_signals_Check_signal+0x98> 200da04: 90 10 00 19 mov %i1, %o0 case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200da08: 92 07 bf f4 add %fp, -12, %o1 200da0c: 9f c7 40 00 call %i5 200da10: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200da14: 10 80 00 05 b 200da28 <_POSIX_signals_Check_signal+0xa4> 200da18: 03 00 80 57 sethi %hi(0x2015c00), %g1 default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200da1c: 9f c7 40 00 call %i5 200da20: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200da24: 03 00 80 57 sethi %hi(0x2015c00), %g1 200da28: d0 00 62 24 ld [ %g1 + 0x224 ], %o0 ! 2015e24 <_Per_CPU_Information+0xc> 200da2c: 92 07 bf cc add %fp, -52, %o1 200da30: 90 02 20 20 add %o0, 0x20, %o0 200da34: 40 00 04 20 call 200eab4 200da38: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200da3c: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200da40: f8 26 20 d0 st %i4, [ %i0 + 0xd0 ] return true; } 200da44: b0 08 60 01 and %g1, 1, %i0 200da48: 81 c7 e0 08 ret 200da4c: 81 e8 00 00 restore =============================================================================== 0200e13c <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200e13c: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200e140: 7f ff cf 60 call 2001ec0 200e144: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200e148: 85 2e 20 04 sll %i0, 4, %g2 200e14c: 83 2e 20 02 sll %i0, 2, %g1 200e150: 82 20 80 01 sub %g2, %g1, %g1 200e154: 05 00 80 57 sethi %hi(0x2015c00), %g2 200e158: 84 10 a2 70 or %g2, 0x270, %g2 ! 2015e70 <_POSIX_signals_Vectors> 200e15c: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200e160: 80 a0 a0 02 cmp %g2, 2 200e164: 12 80 00 0a bne 200e18c <_POSIX_signals_Clear_process_signals+0x50> 200e168: 84 10 20 01 mov 1, %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200e16c: 05 00 80 58 sethi %hi(0x2016000), %g2 200e170: 84 10 a0 68 or %g2, 0x68, %g2 ! 2016068 <_POSIX_signals_Siginfo> 200e174: 86 00 40 02 add %g1, %g2, %g3 200e178: c2 00 40 02 ld [ %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 ); 200e17c: 86 00 e0 04 add %g3, 4, %g3 200e180: 80 a0 40 03 cmp %g1, %g3 200e184: 12 80 00 08 bne 200e1a4 <_POSIX_signals_Clear_process_signals+0x68><== NEVER TAKEN 200e188: 84 10 20 01 mov 1, %g2 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200e18c: 03 00 80 58 sethi %hi(0x2016000), %g1 200e190: b0 06 3f ff add %i0, -1, %i0 200e194: b1 28 80 18 sll %g2, %i0, %i0 200e198: c4 00 60 64 ld [ %g1 + 0x64 ], %g2 200e19c: b0 28 80 18 andn %g2, %i0, %i0 200e1a0: f0 20 60 64 st %i0, [ %g1 + 0x64 ] } _ISR_Enable( level ); 200e1a4: 7f ff cf 4b call 2001ed0 200e1a8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006b20 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b20: 82 10 20 1b mov 0x1b, %g1 2006b24: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b28: 86 00 7f ff add %g1, -1, %g3 2006b2c: 87 28 80 03 sll %g2, %g3, %g3 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006b30: 80 88 c0 08 btst %g3, %o0 2006b34: 12 80 00 11 bne 2006b78 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2006b38: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b3c: 82 00 60 01 inc %g1 2006b40: 80 a0 60 20 cmp %g1, 0x20 2006b44: 12 bf ff fa bne 2006b2c <_POSIX_signals_Get_lowest+0xc> 2006b48: 86 00 7f ff add %g1, -1, %g3 2006b4c: 82 10 20 01 mov 1, %g1 2006b50: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b54: 86 00 7f ff add %g1, -1, %g3 2006b58: 87 28 80 03 sll %g2, %g3, %g3 #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006b5c: 80 88 c0 08 btst %g3, %o0 2006b60: 12 80 00 06 bne 2006b78 <_POSIX_signals_Get_lowest+0x58> 2006b64: 01 00 00 00 nop */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2006b68: 82 00 60 01 inc %g1 2006b6c: 80 a0 60 1b cmp %g1, 0x1b 2006b70: 12 bf ff fa bne 2006b58 <_POSIX_signals_Get_lowest+0x38> <== ALWAYS TAKEN 2006b74: 86 00 7f ff add %g1, -1, %g3 * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 2006b78: 81 c3 e0 08 retl 2006b7c: 90 10 00 01 mov %g1, %o0 =============================================================================== 02022320 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 2022320: 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 ) ) { 2022324: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2022328: 3b 04 00 20 sethi %hi(0x10008000), %i5 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 202232c: 84 06 7f ff add %i1, -1, %g2 2022330: 86 10 20 01 mov 1, %g3 2022334: 9e 08 40 1d and %g1, %i5, %o7 bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 2022338: 92 10 00 1a mov %i2, %o1 POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 202233c: c8 06 21 5c ld [ %i0 + 0x15c ], %g4 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 2022340: 80 a3 c0 1d cmp %o7, %i5 2022344: 12 80 00 1c bne 20223b4 <_POSIX_signals_Unblock_thread+0x94> 2022348: 85 28 c0 02 sll %g3, %g2, %g2 if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 202234c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2022350: 80 88 80 01 btst %g2, %g1 2022354: 12 80 00 07 bne 2022370 <_POSIX_signals_Unblock_thread+0x50> 2022358: 82 10 20 04 mov 4, %g1 202235c: c2 01 20 d0 ld [ %g4 + 0xd0 ], %g1 2022360: 80 a8 80 01 andncc %g2, %g1, %g0 2022364: 02 80 00 3f be 2022460 <_POSIX_signals_Unblock_thread+0x140> 2022368: ba 10 20 00 clr %i5 the_thread->Wait.return_code = EINTR; 202236c: 82 10 20 04 mov 4, %g1 2022370: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 2022374: 80 a2 60 00 cmp %o1, 0 2022378: 12 80 00 07 bne 2022394 <_POSIX_signals_Unblock_thread+0x74> 202237c: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2022380: 82 10 20 01 mov 1, %g1 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 2022384: f2 22 00 00 st %i1, [ %o0 ] the_info->si_code = SI_USER; 2022388: c2 22 20 04 st %g1, [ %o0 + 4 ] the_info->si_value.sival_int = 0; 202238c: 10 80 00 04 b 202239c <_POSIX_signals_Unblock_thread+0x7c> 2022390: c0 22 20 08 clr [ %o0 + 8 ] } else { *the_info = *info; 2022394: 7f ff c7 82 call 201419c 2022398: 94 10 20 0c mov 0xc, %o2 } _Thread_queue_Extract_with_proxy( the_thread ); 202239c: 90 10 00 18 mov %i0, %o0 20223a0: 7f ff af e4 call 200e330 <_Thread_queue_Extract_with_proxy> 20223a4: ba 10 20 01 mov 1, %i5 20223a8: b0 0f 60 01 and %i5, 1, %i0 20223ac: 81 c7 e0 08 ret 20223b0: 81 e8 00 00 restore } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 20223b4: c8 01 20 d0 ld [ %g4 + 0xd0 ], %g4 20223b8: 80 a8 80 04 andncc %g2, %g4, %g0 20223bc: 02 80 00 29 be 2022460 <_POSIX_signals_Unblock_thread+0x140> 20223c0: ba 10 20 00 clr %i5 * 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 ) ) { 20223c4: 05 04 00 00 sethi %hi(0x10000000), %g2 20223c8: 80 88 40 02 btst %g1, %g2 20223cc: 02 80 00 19 be 2022430 <_POSIX_signals_Unblock_thread+0x110> 20223d0: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 20223d4: 84 10 20 04 mov 4, %g2 20223d8: c4 26 20 34 st %g2, [ %i0 + 0x34 ] /* * 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) ) 20223dc: 05 00 00 ef sethi %hi(0x3bc00), %g2 20223e0: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 20223e4: 80 88 40 02 btst %g1, %g2 20223e8: 02 80 00 07 be 2022404 <_POSIX_signals_Unblock_thread+0xe4> 20223ec: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); 20223f0: 7f ff af d0 call 200e330 <_Thread_queue_Extract_with_proxy> 20223f4: 90 10 00 18 mov %i0, %o0 20223f8: b0 0f 60 01 and %i5, 1, %i0 20223fc: 81 c7 e0 08 ret 2022400: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { 2022404: 22 80 00 18 be,a 2022464 <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 2022408: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 202240c: 7f ff b1 fb call 200ebf8 <_Watchdog_Remove> 2022410: 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 ); 2022414: 90 10 00 18 mov %i0, %o0 2022418: 13 04 00 ff sethi %hi(0x1003fc00), %o1 202241c: 7f ff ad 27 call 200d8b8 <_Thread_Clear_state> 2022420: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 2022424: b0 0f 60 01 and %i5, 1, %i0 2022428: 81 c7 e0 08 ret 202242c: 81 e8 00 00 restore _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 2022430: 32 80 00 0d bne,a 2022464 <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 2022434: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2022438: 03 00 80 98 sethi %hi(0x2026000), %g1 202243c: 82 10 61 78 or %g1, 0x178, %g1 ! 2026178 <_Per_CPU_Information> 2022440: c4 00 60 08 ld [ %g1 + 8 ], %g2 2022444: 80 a0 a0 00 cmp %g2, 0 2022448: 22 80 00 07 be,a 2022464 <_POSIX_signals_Unblock_thread+0x144> 202244c: b0 0f 60 01 and %i5, 1, %i0 2022450: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2022454: 80 a6 00 02 cmp %i0, %g2 2022458: 22 80 00 02 be,a 2022460 <_POSIX_signals_Unblock_thread+0x140><== ALWAYS TAKEN 202245c: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; } 2022460: b0 0f 60 01 and %i5, 1, %i0 2022464: 81 c7 e0 08 ret 2022468: 81 e8 00 00 restore =============================================================================== 02008740 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008740: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 2008744: 80 a6 60 00 cmp %i1, 0 2008748: 02 80 00 77 be 2008924 <_RBTree_Extract_unprotected+0x1e4> 200874c: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008750: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008754: 80 a6 40 01 cmp %i1, %g1 2008758: 32 80 00 0d bne,a 200878c <_RBTree_Extract_unprotected+0x4c> 200875c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 if (the_node->child[RBT_RIGHT]) 2008760: c2 06 60 08 ld [ %i1 + 8 ], %g1 2008764: 80 a0 60 00 cmp %g1, 0 2008768: 22 80 00 04 be,a 2008778 <_RBTree_Extract_unprotected+0x38> 200876c: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008770: 10 80 00 06 b 2008788 <_RBTree_Extract_unprotected+0x48> 2008774: c2 26 20 08 st %g1, [ %i0 + 8 ] else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2008778: 80 a6 00 01 cmp %i0, %g1 200877c: 12 80 00 03 bne 2008788 <_RBTree_Extract_unprotected+0x48> 2008780: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 2008784: 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]) { 2008788: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200878c: 80 a6 40 01 cmp %i1, %g1 2008790: 12 80 00 0b bne 20087bc <_RBTree_Extract_unprotected+0x7c> 2008794: c2 06 60 04 ld [ %i1 + 4 ], %g1 if (the_node->child[RBT_LEFT]) 2008798: 80 a0 60 00 cmp %g1, 0 200879c: 22 80 00 04 be,a 20087ac <_RBTree_Extract_unprotected+0x6c> 20087a0: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; 20087a4: 10 80 00 06 b 20087bc <_RBTree_Extract_unprotected+0x7c> 20087a8: c2 26 20 0c st %g1, [ %i0 + 0xc ] else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 20087ac: 80 a6 00 02 cmp %i0, %g2 20087b0: 12 80 00 03 bne 20087bc <_RBTree_Extract_unprotected+0x7c> 20087b4: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 20087b8: c0 26 20 0c clr [ %i0 + 0xc ] * 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]) { 20087bc: ba 90 60 00 orcc %g1, 0, %i5 20087c0: 02 80 00 32 be 2008888 <_RBTree_Extract_unprotected+0x148> 20087c4: f8 06 60 08 ld [ %i1 + 8 ], %i4 20087c8: 80 a7 20 00 cmp %i4, 0 20087cc: 32 80 00 05 bne,a 20087e0 <_RBTree_Extract_unprotected+0xa0><== NEVER TAKEN 20087d0: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 20087d4: 10 80 00 31 b 2008898 <_RBTree_Extract_unprotected+0x158> 20087d8: b8 10 00 01 mov %g1, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 20087dc: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 20087e0: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20087e4: 32 bf ff fe bne,a 20087dc <_RBTree_Extract_unprotected+0x9c><== NOT EXECUTED 20087e8: 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]; 20087ec: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED if(leaf) { 20087f0: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 20087f4: 02 80 00 05 be 2008808 <_RBTree_Extract_unprotected+0xc8> <== NOT EXECUTED 20087f8: 01 00 00 00 nop <== NOT EXECUTED leaf->parent = target->parent; 20087fc: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008800: 10 80 00 04 b 2008810 <_RBTree_Extract_unprotected+0xd0> <== NOT EXECUTED 2008804: 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); 2008808: 7f ff ff 50 call 2008548 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 200880c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED } victim_color = target->color; dir = target != target->parent->child[0]; 2008810: c4 07 40 00 ld [ %i5 ], %g2 <== 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; 2008814: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED dir = target != target->parent->child[0]; 2008818: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED 200881c: 86 1f 40 03 xor %i5, %g3, %g3 <== NOT EXECUTED 2008820: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED 2008824: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED target->parent->child[dir] = leaf; 2008828: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED 200882c: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED 2008830: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008834: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED 2008838: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED 200883c: 86 1e 40 03 xor %i1, %g3, %g3 <== NOT EXECUTED 2008840: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED 2008844: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED the_node->parent->child[dir] = target; 2008848: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED 200884c: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED 2008850: fa 20 a0 04 st %i5, [ %g2 + 4 ] <== NOT EXECUTED /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008854: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED 2008858: c4 27 60 08 st %g2, [ %i5 + 8 ] <== NOT EXECUTED the_node->child[RBT_RIGHT]->parent = target; 200885c: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED 2008860: fa 20 80 00 st %i5, [ %g2 ] <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008864: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED 2008868: c4 27 60 04 st %g2, [ %i5 + 4 ] <== NOT EXECUTED the_node->child[RBT_LEFT]->parent = target; 200886c: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED 2008870: fa 20 80 00 st %i5, [ %g2 ] <== 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; 2008874: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED 2008878: c4 27 40 00 st %g2, [ %i5 ] <== NOT EXECUTED target->color = the_node->color; 200887c: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 <== NOT EXECUTED 2008880: 10 80 00 14 b 20088d0 <_RBTree_Extract_unprotected+0x190> <== NOT EXECUTED 2008884: c4 27 60 10 st %g2, [ %i5 + 0x10 ] <== NOT EXECUTED * 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 ) { 2008888: 80 a7 20 00 cmp %i4, 0 200888c: 32 80 00 04 bne,a 200889c <_RBTree_Extract_unprotected+0x15c> 2008890: c2 06 40 00 ld [ %i1 ], %g1 2008894: 30 80 00 04 b,a 20088a4 <_RBTree_Extract_unprotected+0x164> leaf->parent = the_node->parent; 2008898: c2 06 40 00 ld [ %i1 ], %g1 200889c: 10 80 00 04 b 20088ac <_RBTree_Extract_unprotected+0x16c> 20088a0: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); 20088a4: 7f ff ff 29 call 2008548 <_RBTree_Extract_validate_unprotected> 20088a8: 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]; 20088ac: c4 06 40 00 ld [ %i1 ], %g2 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; 20088b0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 20088b4: c6 00 a0 04 ld [ %g2 + 4 ], %g3 20088b8: 86 1e 40 03 xor %i1, %g3, %g3 20088bc: 80 a0 00 03 cmp %g0, %g3 20088c0: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 20088c4: 87 28 e0 02 sll %g3, 2, %g3 20088c8: 84 00 80 03 add %g2, %g3, %g2 20088cc: f8 20 a0 04 st %i4, [ %g2 + 4 ] * 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 */ 20088d0: 80 a0 60 00 cmp %g1, 0 20088d4: 32 80 00 0e bne,a 200890c <_RBTree_Extract_unprotected+0x1cc> 20088d8: c2 06 20 04 ld [ %i0 + 4 ], %g1 20088dc: 80 a7 20 00 cmp %i4, 0 20088e0: 22 80 00 0b be,a 200890c <_RBTree_Extract_unprotected+0x1cc> 20088e4: c2 06 20 04 ld [ %i0 + 4 ], %g1 20088e8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 20088ec: 80 a0 60 01 cmp %g1, 1 20088f0: 12 80 00 04 bne 2008900 <_RBTree_Extract_unprotected+0x1c0><== NEVER TAKEN 20088f4: 01 00 00 00 nop if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ 20088f8: 10 80 00 04 b 2008908 <_RBTree_Extract_unprotected+0x1c8> 20088fc: c0 27 20 10 clr [ %i4 + 0x10 ] else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008900: 7f ff ff 12 call 2008548 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008904: 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; 2008908: 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; 200890c: c0 26 60 08 clr [ %i1 + 8 ] 2008910: c0 26 60 04 clr [ %i1 + 4 ] 2008914: 80 a0 60 00 cmp %g1, 0 2008918: 02 80 00 03 be 2008924 <_RBTree_Extract_unprotected+0x1e4> 200891c: c0 26 40 00 clr [ %i1 ] 2008920: c0 20 60 10 clr [ %g1 + 0x10 ] 2008924: 81 c7 e0 08 ret 2008928: 81 e8 00 00 restore =============================================================================== 02008548 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008548: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200854c: fa 06 00 00 ld [ %i0 ], %i5 if(!parent->parent) return; 2008550: c2 07 40 00 ld [ %i5 ], %g1 2008554: 80 a0 60 00 cmp %g1, 0 2008558: 02 80 00 71 be 200871c <_RBTree_Extract_validate_unprotected+0x1d4> 200855c: 90 10 00 18 mov %i0, %o0 sibling = _RBTree_Sibling(the_node); 2008560: 7f ff ff ca call 2008488 <_RBTree_Sibling> 2008564: b4 10 20 01 mov 1, %i2 /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008568: 10 80 00 60 b 20086e8 <_RBTree_Extract_validate_unprotected+0x1a0> 200856c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008570: 22 80 00 5e be,a 20086e8 <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 2008574: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED 2008578: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 200857c: 80 a0 60 01 cmp %g1, 1 2008580: 32 80 00 14 bne,a 20085d0 <_RBTree_Extract_validate_unprotected+0x88> 2008584: c4 02 20 08 ld [ %o0 + 8 ], %g2 * 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; 2008588: c2 27 60 10 st %g1, [ %i5 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200858c: c2 07 60 04 ld [ %i5 + 4 ], %g1 * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; sibling->color = RBT_BLACK; 2008590: c0 22 20 10 clr [ %o0 + 0x10 ] dir = the_node != parent->child[0]; 2008594: 82 1e 00 01 xor %i0, %g1, %g1 2008598: 80 a0 00 01 cmp %g0, %g1 _RBTree_Rotate(parent, dir); 200859c: 90 10 00 1d mov %i5, %o0 * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 20085a0: b8 40 20 00 addx %g0, 0, %i4 _RBTree_Rotate(parent, dir); 20085a4: 7f ff ff ca call 20084cc <_RBTree_Rotate> 20085a8: 92 10 00 1c mov %i4, %o1 sibling = parent->child[!dir]; 20085ac: 80 a0 00 1c cmp %g0, %i4 20085b0: 82 60 3f ff subx %g0, -1, %g1 20085b4: 83 28 60 02 sll %g1, 2, %g1 20085b8: 82 07 40 01 add %i5, %g1, %g1 20085bc: d0 00 60 04 ld [ %g1 + 4 ], %o0 } /* sibling is black, see if both of its children are also black. */ if (sibling && 20085c0: 80 a2 20 00 cmp %o0, 0 20085c4: 22 80 00 49 be,a 20086e8 <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 20085c8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 20085cc: c4 02 20 08 ld [ %o0 + 8 ], %g2 20085d0: 80 a0 a0 00 cmp %g2, 0 20085d4: 02 80 00 06 be 20085ec <_RBTree_Extract_validate_unprotected+0xa4> 20085d8: 82 10 20 00 clr %g1 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 20085dc: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 20085e0: 82 18 60 01 xor %g1, 1, %g1 20085e4: 80 a0 00 01 cmp %g0, %g1 20085e8: 82 60 3f ff subx %g0, -1, %g1 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (sibling && 20085ec: 80 a0 60 00 cmp %g1, 0 20085f0: 32 80 00 14 bne,a 2008640 <_RBTree_Extract_validate_unprotected+0xf8> 20085f4: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 20085f8: c4 02 20 04 ld [ %o0 + 4 ], %g2 20085fc: 80 a0 a0 00 cmp %g2, 0 2008600: 02 80 00 07 be 200861c <_RBTree_Extract_validate_unprotected+0xd4> 2008604: 80 a0 60 00 cmp %g1, 0 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 2008608: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 200860c: 82 18 60 01 xor %g1, 1, %g1 2008610: 80 a0 00 01 cmp %g0, %g1 2008614: 82 60 3f ff subx %g0, -1, %g1 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]) && 2008618: 80 a0 60 00 cmp %g1, 0 200861c: 32 80 00 09 bne,a 2008640 <_RBTree_Extract_validate_unprotected+0xf8> 2008620: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008624: f4 22 20 10 st %i2, [ %o0 + 0x10 ] 2008628: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200862c: 80 a0 60 01 cmp %g1, 1 2008630: 32 80 00 3d bne,a 2008724 <_RBTree_Extract_validate_unprotected+0x1dc> 2008634: f8 07 40 00 ld [ %i5 ], %i4 if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; 2008638: 10 80 00 33 b 2008704 <_RBTree_Extract_validate_unprotected+0x1bc> 200863c: c0 27 60 10 clr [ %i5 + 0x10 ] * 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]; 2008640: 82 1e 00 01 xor %i0, %g1, %g1 2008644: 80 a0 00 01 cmp %g0, %g1 2008648: b8 40 20 00 addx %g0, 0, %i4 if (!_RBTree_Is_red(sibling->child[!dir])) { 200864c: 80 a0 00 1c cmp %g0, %i4 2008650: b6 60 3f ff subx %g0, -1, %i3 2008654: 83 2e e0 02 sll %i3, 2, %g1 2008658: 82 02 00 01 add %o0, %g1, %g1 200865c: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008660: 80 a0 a0 00 cmp %g2, 0 2008664: 02 80 00 06 be 200867c <_RBTree_Extract_validate_unprotected+0x134> 2008668: 82 10 20 00 clr %g1 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 200866c: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008670: 82 18 60 01 xor %g1, 1, %g1 2008674: 80 a0 00 01 cmp %g0, %g1 2008678: 82 60 3f ff subx %g0, -1, %g1 * 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]; if (!_RBTree_Is_red(sibling->child[!dir])) { 200867c: 80 a0 60 00 cmp %g1, 0 2008680: 32 80 00 0e bne,a 20086b8 <_RBTree_Extract_validate_unprotected+0x170> 2008684: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 sibling->color = RBT_RED; 2008688: 82 10 20 01 mov 1, %g1 200868c: c2 22 20 10 st %g1, [ %o0 + 0x10 ] sibling->child[dir]->color = RBT_BLACK; 2008690: 83 2f 20 02 sll %i4, 2, %g1 2008694: 82 02 00 01 add %o0, %g1, %g1 2008698: c2 00 60 04 ld [ %g1 + 4 ], %g1 _RBTree_Rotate(sibling, !dir); 200869c: 92 1f 20 01 xor %i4, 1, %o1 20086a0: 7f ff ff 8b call 20084cc <_RBTree_Rotate> 20086a4: c0 20 60 10 clr [ %g1 + 0x10 ] sibling = parent->child[!dir]; 20086a8: 83 2e e0 02 sll %i3, 2, %g1 20086ac: 82 07 40 01 add %i5, %g1, %g1 20086b0: d0 00 60 04 ld [ %g1 + 4 ], %o0 } sibling->color = parent->color; 20086b4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 20086b8: b7 2e e0 02 sll %i3, 2, %i3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; } sibling->color = parent->color; 20086bc: c2 22 20 10 st %g1, [ %o0 + 0x10 ] parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 20086c0: 90 02 00 1b add %o0, %i3, %o0 20086c4: c2 02 20 04 ld [ %o0 + 4 ], %g1 sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; } sibling->color = parent->color; parent->color = RBT_BLACK; 20086c8: c0 27 60 10 clr [ %i5 + 0x10 ] sibling->child[!dir]->color = RBT_BLACK; 20086cc: c0 20 60 10 clr [ %g1 + 0x10 ] _RBTree_Rotate(parent, dir); 20086d0: 90 10 00 1d mov %i5, %o0 20086d4: 7f ff ff 7e call 20084cc <_RBTree_Rotate> 20086d8: 92 10 00 1c mov %i4, %o1 break; /* done */ 20086dc: 10 80 00 0b b 2008708 <_RBTree_Extract_validate_unprotected+0x1c0> 20086e0: 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) { 20086e4: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20086e8: 80 a0 60 01 cmp %g1, 1 20086ec: 22 80 00 07 be,a 2008708 <_RBTree_Extract_validate_unprotected+0x1c0> 20086f0: c2 06 00 00 ld [ %i0 ], %g1 20086f4: c2 07 40 00 ld [ %i5 ], %g1 20086f8: 80 a0 60 00 cmp %g1, 0 20086fc: 12 bf ff 9d bne 2008570 <_RBTree_Extract_validate_unprotected+0x28> 2008700: 80 a2 20 00 cmp %o0, 0 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008704: c2 06 00 00 ld [ %i0 ], %g1 2008708: c2 00 40 00 ld [ %g1 ], %g1 200870c: 80 a0 60 00 cmp %g1, 0 2008710: 12 80 00 0a bne 2008738 <_RBTree_Extract_validate_unprotected+0x1f0> 2008714: 01 00 00 00 nop 2008718: c0 26 20 10 clr [ %i0 + 0x10 ] 200871c: 81 c7 e0 08 ret 2008720: 81 e8 00 00 restore parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; sibling = _RBTree_Sibling(the_node); 2008724: 90 10 00 1d mov %i5, %o0 2008728: 7f ff ff 58 call 2008488 <_RBTree_Sibling> 200872c: b0 10 00 1d mov %i5, %i0 2008730: 10 bf ff ed b 20086e4 <_RBTree_Extract_validate_unprotected+0x19c> 2008734: ba 10 00 1c mov %i4, %i5 2008738: 81 c7 e0 08 ret 200873c: 81 e8 00 00 restore =============================================================================== 020089a0 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 20089a0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 20089a4: 7f ff e7 ff call 20029a0 20089a8: 01 00 00 00 nop RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { if (the_value == iter_node->value) return(iter_node); RBTree_Direction dir = the_value > iter_node->value; iter_node = iter_node->child[dir]; 20089ac: 10 80 00 09 b 20089d0 <_RBTree_Find+0x30> 20089b0: f0 06 20 04 ld [ %i0 + 4 ], %i0 unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { if (the_value == iter_node->value) return(iter_node); 20089b4: 80 a6 40 01 cmp %i1, %g1 20089b8: 02 80 00 09 be 20089dc <_RBTree_Find+0x3c> 20089bc: 80 a0 40 19 cmp %g1, %i1 RBTree_Direction dir = the_value > iter_node->value; 20089c0: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 20089c4: 83 28 60 02 sll %g1, 2, %g1 20089c8: b0 06 00 01 add %i0, %g1, %i0 20089cc: 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) { 20089d0: 80 a6 20 00 cmp %i0, 0 20089d4: 32 bf ff f8 bne,a 20089b4 <_RBTree_Find+0x14> <== ALWAYS TAKEN 20089d8: c2 06 20 0c ld [ %i0 + 0xc ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 20089dc: 7f ff e7 f5 call 20029b0 20089e0: 01 00 00 00 nop return return_node; } 20089e4: 81 c7 e0 08 ret 20089e8: 81 e8 00 00 restore =============================================================================== 02008950 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2008950: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 2008954: 7f ff e8 13 call 20029a0 2008958: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected( RBTree_Node *the_node ) { if(!the_node) return NULL; 200895c: 80 a7 60 00 cmp %i5, 0 2008960: 02 80 00 0c be 2008990 <_RBTree_Find_header+0x40> <== NEVER TAKEN 2008964: b0 10 20 00 clr %i0 if(!(the_node->parent)) return NULL; 2008968: c2 07 40 00 ld [ %i5 ], %g1 200896c: 80 a0 60 00 cmp %g1, 0 2008970: 32 80 00 03 bne,a 200897c <_RBTree_Find_header+0x2c> <== ALWAYS TAKEN 2008974: ba 10 00 01 mov %g1, %i5 2008978: 30 80 00 06 b,a 2008990 <_RBTree_Find_header+0x40> <== NOT EXECUTED while(the_node->parent) the_node = the_node->parent; 200897c: c2 07 40 00 ld [ %i5 ], %g1 2008980: 80 a0 60 00 cmp %g1, 0 2008984: 32 bf ff fe bne,a 200897c <_RBTree_Find_header+0x2c> 2008988: ba 10 00 01 mov %g1, %i5 200898c: b0 10 00 1d mov %i5, %i0 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 2008990: 7f ff e8 08 call 20029b0 2008994: 01 00 00 00 nop return return_header; } 2008998: 81 c7 e0 08 ret 200899c: 81 e8 00 00 restore =============================================================================== 02008b88 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008b88: 9d e3 bf a0 save %sp, -96, %sp 2008b8c: 82 10 00 18 mov %i0, %g1 2008b90: 90 10 00 19 mov %i1, %o0 if(!the_node) return (RBTree_Node*)-1; 2008b94: 80 a6 60 00 cmp %i1, 0 2008b98: 02 80 00 0d be 2008bcc <_RBTree_Insert_unprotected+0x44> <== NEVER TAKEN 2008b9c: b0 10 3f ff mov -1, %i0 RBTree_Node *iter_node = the_rbtree->root; 2008ba0: f0 00 60 04 ld [ %g1 + 4 ], %i0 if (!iter_node) { /* special case: first node inserted */ 2008ba4: 80 a6 20 00 cmp %i0, 0 2008ba8: 32 80 00 1f bne,a 2008c24 <_RBTree_Insert_unprotected+0x9c> 2008bac: c4 06 60 0c ld [ %i1 + 0xc ], %g2 the_node->color = RBT_BLACK; 2008bb0: c0 26 60 10 clr [ %i1 + 0x10 ] the_rbtree->root = the_node; 2008bb4: f2 20 60 04 st %i1, [ %g1 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 2008bb8: f2 20 60 0c st %i1, [ %g1 + 0xc ] 2008bbc: f2 20 60 08 st %i1, [ %g1 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 2008bc0: c2 26 40 00 st %g1, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2008bc4: c0 26 60 08 clr [ %i1 + 8 ] 2008bc8: c0 26 60 04 clr [ %i1 + 4 ] 2008bcc: 81 c7 e0 08 ret 2008bd0: 81 e8 00 00 restore } 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; 2008bd4: 86 40 20 00 addx %g0, 0, %g3 if (!iter_node->child[dir]) { 2008bd8: 89 28 e0 02 sll %g3, 2, %g4 2008bdc: 88 06 00 04 add %i0, %g4, %g4 2008be0: de 01 20 04 ld [ %g4 + 4 ], %o7 2008be4: 80 a3 e0 00 cmp %o7, 0 2008be8: 32 80 00 0f bne,a 2008c24 <_RBTree_Insert_unprotected+0x9c> 2008bec: b0 10 00 0f mov %o7, %i0 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2008bf0: 84 10 20 01 mov 1, %g2 /* 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; 2008bf4: c0 22 20 08 clr [ %o0 + 8 ] 2008bf8: c0 22 20 04 clr [ %o0 + 4 ] the_node->color = RBT_RED; 2008bfc: c4 22 20 10 st %g2, [ %o0 + 0x10 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 2008c00: 84 00 e0 02 add %g3, 2, %g2 2008c04: 85 28 a0 02 sll %g2, 2, %g2 iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2008c08: c6 00 40 02 ld [ %g1 + %g2 ], %g3 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; iter_node->child[dir] = the_node; 2008c0c: d0 21 20 04 st %o0, [ %g4 + 4 ] the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2008c10: 80 a6 00 03 cmp %i0, %g3 2008c14: 12 80 00 0a bne 2008c3c <_RBTree_Insert_unprotected+0xb4> 2008c18: f0 22 00 00 st %i0, [ %o0 ] the_rbtree->first[dir] = the_node; 2008c1c: 10 80 00 08 b 2008c3c <_RBTree_Insert_unprotected+0xb4> 2008c20: d0 20 40 02 st %o0, [ %g1 + %g2 ] 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); 2008c24: c6 06 20 0c ld [ %i0 + 0xc ], %g3 2008c28: 80 a0 80 03 cmp %g2, %g3 2008c2c: 12 bf ff ea bne 2008bd4 <_RBTree_Insert_unprotected+0x4c> 2008c30: 80 a0 c0 02 cmp %g3, %g2 2008c34: 81 c7 e0 08 ret 2008c38: 81 e8 00 00 restore } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 2008c3c: 7f ff ff 9a call 2008aa4 <_RBTree_Validate_insert_unprotected> 2008c40: b0 10 20 00 clr %i0 } return (RBTree_Node*)0; } 2008c44: 81 c7 e0 08 ret 2008c48: 81 e8 00 00 restore =============================================================================== 020084cc <_RBTree_Rotate>: RBTree_Node *the_node, RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; 20084cc: 80 a2 20 00 cmp %o0, 0 20084d0: 02 80 00 1c be 2008540 <_RBTree_Rotate+0x74> <== NEVER TAKEN 20084d4: 86 10 20 01 mov 1, %g3 if (the_node->child[(1-dir)] == NULL) return; 20084d8: 86 20 c0 09 sub %g3, %o1, %g3 20084dc: 87 28 e0 02 sll %g3, 2, %g3 20084e0: 86 02 00 03 add %o0, %g3, %g3 20084e4: c2 00 e0 04 ld [ %g3 + 4 ], %g1 20084e8: 80 a0 60 00 cmp %g1, 0 20084ec: 02 80 00 15 be 2008540 <_RBTree_Rotate+0x74> <== NEVER TAKEN 20084f0: 93 2a 60 02 sll %o1, 2, %o1 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 20084f4: 84 00 40 09 add %g1, %o1, %g2 20084f8: c8 00 a0 04 ld [ %g2 + 4 ], %g4 20084fc: c8 20 e0 04 st %g4, [ %g3 + 4 ] if (c->child[dir]) 2008500: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2008504: 80 a0 a0 00 cmp %g2, 0 2008508: 32 80 00 02 bne,a 2008510 <_RBTree_Rotate+0x44> 200850c: d0 20 80 00 st %o0, [ %g2 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008510: c4 02 00 00 ld [ %o0 ], %g2 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008514: 92 00 40 09 add %g1, %o1, %o1 2008518: d0 22 60 04 st %o0, [ %o1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200851c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 c->parent = the_node->parent; 2008520: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008524: 86 1a 00 03 xor %o0, %g3, %g3 c->parent = the_node->parent; the_node->parent = c; 2008528: c2 22 00 00 st %g1, [ %o0 ] 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; 200852c: 80 a0 00 03 cmp %g0, %g3 2008530: 86 40 20 00 addx %g0, 0, %g3 2008534: 87 28 e0 02 sll %g3, 2, %g3 2008538: 86 00 80 03 add %g2, %g3, %g3 200853c: c2 20 e0 04 st %g1, [ %g3 + 4 ] 2008540: 81 c3 e0 08 retl =============================================================================== 02008488 <_RBTree_Sibling>: */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; 2008488: 80 a2 20 00 cmp %o0, 0 200848c: 02 80 00 0e be 20084c4 <_RBTree_Sibling+0x3c> <== NEVER TAKEN 2008490: 82 10 20 00 clr %g1 if(!(the_node->parent)) return NULL; 2008494: c4 02 00 00 ld [ %o0 ], %g2 2008498: 80 a0 a0 00 cmp %g2, 0 200849c: 02 80 00 0a be 20084c4 <_RBTree_Sibling+0x3c> <== NEVER TAKEN 20084a0: 01 00 00 00 nop if(!(the_node->parent->parent)) return NULL; 20084a4: c6 00 80 00 ld [ %g2 ], %g3 20084a8: 80 a0 e0 00 cmp %g3, 0 20084ac: 02 80 00 06 be 20084c4 <_RBTree_Sibling+0x3c> 20084b0: 01 00 00 00 nop if(the_node == the_node->parent->child[RBT_LEFT]) 20084b4: c2 00 a0 04 ld [ %g2 + 4 ], %g1 20084b8: 80 a2 00 01 cmp %o0, %g1 20084bc: 22 80 00 02 be,a 20084c4 <_RBTree_Sibling+0x3c> 20084c0: c2 00 a0 08 ld [ %g2 + 8 ], %g1 return the_node->parent->child[RBT_RIGHT]; else return the_node->parent->child[RBT_LEFT]; } 20084c4: 81 c3 e0 08 retl 20084c8: 90 10 00 01 mov %g1, %o0 =============================================================================== 02008aa4 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2008aa4: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *u,*g; /* note: the insert root case is handled already */ /* if the parent is black, nothing needs to be done * otherwise may need to loop a few times */ while (_RBTree_Is_red(_RBTree_Parent(the_node))) { 2008aa8: 10 80 00 1f b 2008b24 <_RBTree_Validate_insert_unprotected+0x80> 2008aac: b6 10 20 01 mov 1, %i3 ) { 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; 2008ab0: 80 a0 60 00 cmp %g1, 0 2008ab4: 02 80 00 27 be 2008b50 <_RBTree_Validate_insert_unprotected+0xac><== NEVER TAKEN 2008ab8: c2 07 60 04 ld [ %i5 + 4 ], %g1 { 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]) 2008abc: 80 a2 00 01 cmp %o0, %g1 2008ac0: 22 80 00 02 be,a 2008ac8 <_RBTree_Validate_insert_unprotected+0x24> 2008ac4: c2 07 60 08 ld [ %i5 + 8 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008ac8: 80 a0 60 00 cmp %g1, 0 2008acc: 22 80 00 21 be,a 2008b50 <_RBTree_Validate_insert_unprotected+0xac> 2008ad0: c2 07 60 04 ld [ %i5 + 4 ], %g1 2008ad4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 2008ad8: 80 a0 a0 01 cmp %g2, 1 2008adc: 32 80 00 1d bne,a 2008b50 <_RBTree_Validate_insert_unprotected+0xac> 2008ae0: c2 07 60 04 ld [ %i5 + 4 ], %g1 u = _RBTree_Parent_sibling(the_node); 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; 2008ae4: c0 22 20 10 clr [ %o0 + 0x10 ] u->color = RBT_BLACK; 2008ae8: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008aec: c4 27 60 10 st %g2, [ %i5 + 0x10 ] 2008af0: 10 80 00 0d b 2008b24 <_RBTree_Validate_insert_unprotected+0x80> 2008af4: b0 10 00 1d mov %i5, %i0 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) { _RBTree_Rotate(the_node->parent, pdir); 2008af8: 7f ff ff cc call 2008a28 <_RBTree_Rotate> 2008afc: 92 10 00 1c mov %i4, %o1 the_node = the_node->child[pdir]; 2008b00: 83 2f 20 02 sll %i4, 2, %g1 2008b04: b0 06 00 01 add %i0, %g1, %i0 2008b08: f0 06 20 04 ld [ %i0 + 4 ], %i0 } the_node->parent->color = RBT_BLACK; 2008b0c: c2 06 00 00 ld [ %i0 ], %g1 g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 2008b10: 90 10 00 1d mov %i5, %o0 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2008b14: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008b18: f6 27 60 10 st %i3, [ %i5 + 0x10 ] /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 2008b1c: 7f ff ff c3 call 2008a28 <_RBTree_Rotate> 2008b20: 92 26 c0 1c sub %i3, %i4, %o1 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2008b24: d0 06 00 00 ld [ %i0 ], %o0 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 2008b28: fa 02 00 00 ld [ %o0 ], %i5 2008b2c: 80 a7 60 00 cmp %i5, 0 2008b30: 22 80 00 14 be,a 2008b80 <_RBTree_Validate_insert_unprotected+0xdc> 2008b34: 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); 2008b38: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2008b3c: 80 a0 60 01 cmp %g1, 1 2008b40: 12 80 00 10 bne 2008b80 <_RBTree_Validate_insert_unprotected+0xdc> 2008b44: 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->parent->parent->parent)) return NULL; 2008b48: 10 bf ff da b 2008ab0 <_RBTree_Validate_insert_unprotected+0xc> 2008b4c: c2 07 40 00 ld [ %i5 ], %g1 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]; RBTree_Direction pdir = the_node->parent != g->child[0]; 2008b50: 82 1a 00 01 xor %o0, %g1, %g1 2008b54: 80 a0 00 01 cmp %g0, %g1 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]; 2008b58: c2 02 20 04 ld [ %o0 + 4 ], %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; 2008b5c: b8 40 20 00 addx %g0, 0, %i4 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]; 2008b60: 82 1e 00 01 xor %i0, %g1, %g1 2008b64: 80 a0 00 01 cmp %g0, %g1 2008b68: 82 40 20 00 addx %g0, 0, %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 2008b6c: 80 a0 40 1c cmp %g1, %i4 2008b70: 12 bf ff e2 bne 2008af8 <_RBTree_Validate_insert_unprotected+0x54> 2008b74: 01 00 00 00 nop _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2008b78: 10 bf ff e6 b 2008b10 <_RBTree_Validate_insert_unprotected+0x6c> 2008b7c: c2 06 00 00 ld [ %i0 ], %g1 2008b80: 81 c7 e0 08 ret 2008b84: 81 e8 00 00 restore =============================================================================== 020075b8 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 20075b8: 9d e3 bf 98 save %sp, -104, %sp 20075bc: 11 00 80 79 sethi %hi(0x201e400), %o0 20075c0: 92 10 00 18 mov %i0, %o1 20075c4: 90 12 20 14 or %o0, 0x14, %o0 20075c8: 40 00 07 d2 call 2009510 <_Objects_Get> 20075cc: 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 ) { 20075d0: c2 07 bf fc ld [ %fp + -4 ], %g1 20075d4: 80 a0 60 00 cmp %g1, 0 20075d8: 12 80 00 24 bne 2007668 <_Rate_monotonic_Timeout+0xb0> <== NEVER TAKEN 20075dc: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 20075e0: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 20075e4: 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); 20075e8: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 20075ec: 80 88 80 01 btst %g2, %g1 20075f0: 22 80 00 0b be,a 200761c <_Rate_monotonic_Timeout+0x64> 20075f4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20075f8: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 20075fc: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007600: 80 a0 80 01 cmp %g2, %g1 2007604: 32 80 00 06 bne,a 200761c <_Rate_monotonic_Timeout+0x64> 2007608: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 200760c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007610: 40 00 0a 6b call 2009fbc <_Thread_Clear_state> 2007614: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 2007618: 30 80 00 06 b,a 2007630 <_Rate_monotonic_Timeout+0x78> _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 ) { 200761c: 80 a0 60 01 cmp %g1, 1 2007620: 12 80 00 0d bne 2007654 <_Rate_monotonic_Timeout+0x9c> 2007624: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007628: 82 10 20 03 mov 3, %g1 200762c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007630: 7f ff fe 71 call 2006ff4 <_Rate_monotonic_Initiate_statistics> 2007634: 90 10 00 1d mov %i5, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007638: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200763c: 11 00 80 79 sethi %hi(0x201e400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007640: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007644: 90 12 22 44 or %o0, 0x244, %o0 2007648: 40 00 0f 34 call 200b318 <_Watchdog_Insert> 200764c: 92 07 60 10 add %i5, 0x10, %o1 2007650: 30 80 00 02 b,a 2007658 <_Rate_monotonic_Timeout+0xa0> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007654: 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; 2007658: 03 00 80 79 sethi %hi(0x201e400), %g1 200765c: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 201e580 <_Thread_Dispatch_disable_level> 2007660: 84 00 bf ff add %g2, -1, %g2 2007664: c4 20 61 80 st %g2, [ %g1 + 0x180 ] 2007668: 81 c7 e0 08 ret 200766c: 81 e8 00 00 restore =============================================================================== 02007018 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007018: 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(); 200701c: 03 00 80 78 sethi %hi(0x201e000), %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; 2007020: 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) || 2007024: 80 a6 20 00 cmp %i0, 0 2007028: 02 80 00 2b be 20070d4 <_TOD_Validate+0xbc> <== NEVER TAKEN 200702c: d2 00 60 b8 ld [ %g1 + 0xb8 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2007030: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007034: 40 00 49 75 call 2019608 <.udiv> 2007038: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 200703c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2007040: 80 a0 40 08 cmp %g1, %o0 2007044: 3a 80 00 25 bcc,a 20070d8 <_TOD_Validate+0xc0> 2007048: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 200704c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007050: 80 a0 60 3b cmp %g1, 0x3b 2007054: 38 80 00 21 bgu,a 20070d8 <_TOD_Validate+0xc0> 2007058: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 200705c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2007060: 80 a0 60 3b cmp %g1, 0x3b 2007064: 38 80 00 1d bgu,a 20070d8 <_TOD_Validate+0xc0> 2007068: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 200706c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2007070: 80 a0 60 17 cmp %g1, 0x17 2007074: 38 80 00 19 bgu,a 20070d8 <_TOD_Validate+0xc0> 2007078: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 200707c: 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) || 2007080: 80 a0 60 00 cmp %g1, 0 2007084: 02 80 00 14 be 20070d4 <_TOD_Validate+0xbc> <== NEVER TAKEN 2007088: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 200708c: 38 80 00 13 bgu,a 20070d8 <_TOD_Validate+0xc0> 2007090: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007094: c6 06 00 00 ld [ %i0 ], %g3 (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) || 2007098: 80 a0 e7 c3 cmp %g3, 0x7c3 200709c: 28 80 00 0f bleu,a 20070d8 <_TOD_Validate+0xc0> 20070a0: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 20070a4: c4 06 20 08 ld [ %i0 + 8 ], %g2 (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) || 20070a8: 80 a0 a0 00 cmp %g2, 0 20070ac: 02 80 00 0a be 20070d4 <_TOD_Validate+0xbc> <== NEVER TAKEN 20070b0: 80 88 e0 03 btst 3, %g3 20070b4: 07 00 80 73 sethi %hi(0x201cc00), %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20070b8: 12 80 00 03 bne 20070c4 <_TOD_Validate+0xac> 20070bc: 86 10 e0 10 or %g3, 0x10, %g3 ! 201cc10 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20070c0: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 20070c4: 83 28 60 02 sll %g1, 2, %g1 20070c8: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 20070cc: 80 a0 40 02 cmp %g1, %g2 20070d0: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 20070d4: b0 0f 60 01 and %i5, 1, %i0 20070d8: 81 c7 e0 08 ret 20070dc: 81 e8 00 00 restore =============================================================================== 0200814c <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200814c: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008150: 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 ); 2008154: 40 00 03 56 call 2008eac <_Thread_Set_transient> 2008158: 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 ) 200815c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008160: 80 a0 40 19 cmp %g1, %i1 2008164: 02 80 00 05 be 2008178 <_Thread_Change_priority+0x2c> 2008168: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200816c: 90 10 00 18 mov %i0, %o0 2008170: 40 00 03 36 call 2008e48 <_Thread_Set_priority> 2008174: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008178: 7f ff e7 52 call 2001ec0 200817c: 01 00 00 00 nop 2008180: 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; 2008184: f2 07 60 10 ld [ %i5 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 2008188: 80 a6 60 04 cmp %i1, 4 200818c: 02 80 00 10 be 20081cc <_Thread_Change_priority+0x80> 2008190: b8 0f 20 04 and %i4, 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008194: 80 a7 20 00 cmp %i4, 0 2008198: 12 80 00 03 bne 20081a4 <_Thread_Change_priority+0x58> <== NEVER TAKEN 200819c: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 20081a0: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 20081a4: 7f ff e7 4b call 2001ed0 20081a8: 90 10 00 18 mov %i0, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20081ac: 03 00 00 ef sethi %hi(0x3bc00), %g1 20081b0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20081b4: 80 8e 40 01 btst %i1, %g1 20081b8: 02 80 00 28 be 2008258 <_Thread_Change_priority+0x10c> 20081bc: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20081c0: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 20081c4: 40 00 02 f4 call 2008d94 <_Thread_queue_Requeue> 20081c8: 93 e8 00 1d restore %g0, %i5, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 20081cc: 80 a7 20 00 cmp %i4, 0 20081d0: 12 80 00 0b bne 20081fc <_Thread_Change_priority+0xb0> <== NEVER TAKEN 20081d4: 03 00 80 53 sethi %hi(0x2014c00), %g1 * Interrupts are STILL disabled. * We now know the thread will be in the READY state when we remove * 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 ); 20081d8: c0 27 60 10 clr [ %i5 + 0x10 ] if ( prepend_it ) 20081dc: 80 a6 a0 00 cmp %i2, 0 20081e0: 02 80 00 04 be 20081f0 <_Thread_Change_priority+0xa4> 20081e4: 82 10 60 94 or %g1, 0x94, %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 20081e8: 10 80 00 03 b 20081f4 <_Thread_Change_priority+0xa8> 20081ec: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 20081f0: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 20081f4: 9f c0 40 00 call %g1 20081f8: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 20081fc: 7f ff e7 35 call 2001ed0 2008200: 90 10 00 18 mov %i0, %o0 2008204: 7f ff e7 2f call 2001ec0 2008208: 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(); 200820c: 03 00 80 53 sethi %hi(0x2014c00), %g1 2008210: c2 00 60 9c ld [ %g1 + 0x9c ], %g1 ! 2014c9c <_Scheduler+0x8> 2008214: 9f c0 40 00 call %g1 2008218: 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 ); 200821c: 03 00 80 57 sethi %hi(0x2015c00), %g1 2008220: 82 10 62 18 or %g1, 0x218, %g1 ! 2015e18 <_Per_CPU_Information> 2008224: 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() && 2008228: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200822c: 80 a0 80 03 cmp %g2, %g3 2008230: 02 80 00 08 be 2008250 <_Thread_Change_priority+0x104> 2008234: 01 00 00 00 nop 2008238: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200823c: 80 a0 a0 00 cmp %g2, 0 2008240: 02 80 00 04 be 2008250 <_Thread_Change_priority+0x104> 2008244: 01 00 00 00 nop _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008248: 84 10 20 01 mov 1, %g2 ! 1 200824c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008250: 7f ff e7 20 call 2001ed0 2008254: 81 e8 00 00 restore 2008258: 81 c7 e0 08 ret 200825c: 81 e8 00 00 restore =============================================================================== 0200843c <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200843c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008440: 90 10 00 18 mov %i0, %o0 2008444: 40 00 00 6b call 20085f0 <_Thread_Get> 2008448: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200844c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008450: 80 a0 60 00 cmp %g1, 0 2008454: 12 80 00 08 bne 2008474 <_Thread_Delay_ended+0x38> <== NEVER TAKEN 2008458: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200845c: 7f ff ff 81 call 2008260 <_Thread_Clear_state> 2008460: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 2008464: 03 00 80 56 sethi %hi(0x2015800), %g1 2008468: c4 00 60 e0 ld [ %g1 + 0xe0 ], %g2 ! 20158e0 <_Thread_Dispatch_disable_level> 200846c: 84 00 bf ff add %g2, -1, %g2 2008470: c4 20 60 e0 st %g2, [ %g1 + 0xe0 ] 2008474: 81 c7 e0 08 ret 2008478: 81 e8 00 00 restore =============================================================================== 0200847c <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200847c: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 2008480: 33 00 80 57 sethi %hi(0x2015c00), %i1 2008484: 82 16 62 18 or %i1, 0x218, %g1 ! 2015e18 <_Per_CPU_Information> _ISR_Disable( level ); 2008488: 7f ff e6 8e call 2001ec0 200848c: fa 00 60 0c ld [ %g1 + 0xc ], %i5 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008490: 37 00 80 56 sethi %hi(0x2015800), %i3 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 2008494: 23 00 80 56 sethi %hi(0x2015800), %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; 2008498: 21 00 80 56 sethi %hi(0x2015800), %l0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 200849c: b6 16 e1 90 or %i3, 0x190, %i3 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20084a0: 31 00 80 56 sethi %hi(0x2015800), %i0 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 20084a4: 10 80 00 3a b 200858c <_Thread_Dispatch+0x110> 20084a8: 35 00 80 56 sethi %hi(0x2015800), %i2 heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 20084ac: 84 10 20 01 mov 1, %g2 20084b0: c4 24 60 e0 st %g2, [ %l1 + 0xe0 ] _Thread_Dispatch_necessary = false; 20084b4: c0 28 60 18 clrb [ %g1 + 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 ) 20084b8: 80 a7 00 1d cmp %i4, %i5 20084bc: 02 80 00 39 be 20085a0 <_Thread_Dispatch+0x124> 20084c0: f8 20 60 0c st %i4, [ %g1 + 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 ) 20084c4: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 20084c8: 80 a0 60 01 cmp %g1, 1 20084cc: 12 80 00 03 bne 20084d8 <_Thread_Dispatch+0x5c> 20084d0: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 20084d4: c2 27 20 78 st %g1, [ %i4 + 0x78 ] _ISR_Enable( level ); 20084d8: 7f ff e6 7e call 2001ed0 20084dc: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 20084e0: 40 00 0e 6e call 200be98 <_TOD_Get_uptime> 20084e4: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 20084e8: 90 10 00 1b mov %i3, %o0 20084ec: 92 07 bf f0 add %fp, -16, %o1 20084f0: 40 00 03 14 call 2009140 <_Timespec_Subtract> 20084f4: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 20084f8: 90 07 60 84 add %i5, 0x84, %o0 20084fc: 40 00 02 f8 call 20090dc <_Timespec_Add_to> 2008500: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2008504: c2 07 bf f0 ld [ %fp + -16 ], %g1 2008508: c2 26 c0 00 st %g1, [ %i3 ] 200850c: c2 07 bf f4 ld [ %fp + -12 ], %g1 2008510: c2 26 e0 04 st %g1, [ %i3 + 4 ] #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008514: c2 06 21 68 ld [ %i0 + 0x168 ], %g1 2008518: 80 a0 60 00 cmp %g1, 0 200851c: 02 80 00 06 be 2008534 <_Thread_Dispatch+0xb8> <== NEVER TAKEN 2008520: 90 10 00 1d mov %i5, %o0 executing->libc_reent = *_Thread_libc_reent; 2008524: c4 00 40 00 ld [ %g1 ], %g2 2008528: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200852c: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2008530: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008534: 40 00 03 b1 call 20093f8 <_User_extensions_Thread_switch> 2008538: 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 ); 200853c: 90 07 60 c8 add %i5, 0xc8, %o0 2008540: 40 00 04 d8 call 20098a0 <_CPU_Context_switch> 2008544: 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) && 2008548: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200854c: 80 a0 60 00 cmp %g1, 0 2008550: 02 80 00 0c be 2008580 <_Thread_Dispatch+0x104> 2008554: d0 06 a1 64 ld [ %i2 + 0x164 ], %o0 2008558: 80 a7 40 08 cmp %i5, %o0 200855c: 02 80 00 09 be 2008580 <_Thread_Dispatch+0x104> 2008560: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008564: 02 80 00 04 be 2008574 <_Thread_Dispatch+0xf8> 2008568: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200856c: 40 00 04 93 call 20097b8 <_CPU_Context_save_fp> 2008570: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008574: 40 00 04 ae call 200982c <_CPU_Context_restore_fp> 2008578: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 200857c: fa 26 a1 64 st %i5, [ %i2 + 0x164 ] if ( executing->fp_context != NULL ) _Context_Restore_fp( &executing->fp_context ); #endif #endif executing = _Thread_Executing; 2008580: 82 16 62 18 or %i1, 0x218, %g1 _ISR_Disable( level ); 2008584: 7f ff e6 4f call 2001ec0 2008588: fa 00 60 0c ld [ %g1 + 0xc ], %i5 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200858c: 82 16 62 18 or %i1, 0x218, %g1 2008590: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2 2008594: 80 a0 a0 00 cmp %g2, 0 2008598: 32 bf ff c5 bne,a 20084ac <_Thread_Dispatch+0x30> 200859c: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 _ISR_Disable( level ); } post_switch: _Thread_Dispatch_disable_level = 0; 20085a0: 03 00 80 56 sethi %hi(0x2015800), %g1 20085a4: c0 20 60 e0 clr [ %g1 + 0xe0 ] ! 20158e0 <_Thread_Dispatch_disable_level> _ISR_Enable( level ); 20085a8: 7f ff e6 4a call 2001ed0 20085ac: 01 00 00 00 nop _API_extensions_Run_postswitch(); 20085b0: 7f ff f8 7c call 20067a0 <_API_extensions_Run_postswitch> 20085b4: 01 00 00 00 nop } 20085b8: 81 c7 e0 08 ret 20085bc: 81 e8 00 00 restore =============================================================================== 0200df34 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200df34: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200df38: 03 00 80 57 sethi %hi(0x2015c00), %g1 200df3c: fa 00 62 24 ld [ %g1 + 0x224 ], %i5 ! 2015e24 <_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(); 200df40: 3f 00 80 37 sethi %hi(0x200dc00), %i7 200df44: be 17 e3 34 or %i7, 0x334, %i7 ! 200df34 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200df48: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200df4c: 7f ff cf e1 call 2001ed0 200df50: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200df54: 03 00 80 55 sethi %hi(0x2015400), %g1 doneConstructors = 1; 200df58: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200df5c: f8 08 61 ac ldub [ %g1 + 0x1ac ], %i4 doneConstructors = 1; 200df60: c4 28 61 ac stb %g2, [ %g1 + 0x1ac ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200df64: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200df68: 80 a0 60 00 cmp %g1, 0 200df6c: 02 80 00 0c be 200df9c <_Thread_Handler+0x68> 200df70: 03 00 80 56 sethi %hi(0x2015800), %g1 #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 ); 200df74: d0 00 61 64 ld [ %g1 + 0x164 ], %o0 ! 2015964 <_Thread_Allocated_fp> 200df78: 80 a7 40 08 cmp %i5, %o0 200df7c: 02 80 00 08 be 200df9c <_Thread_Handler+0x68> 200df80: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200df84: 22 80 00 06 be,a 200df9c <_Thread_Handler+0x68> 200df88: fa 20 61 64 st %i5, [ %g1 + 0x164 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200df8c: 7f ff ee 0b call 20097b8 <_CPU_Context_save_fp> 200df90: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200df94: 03 00 80 56 sethi %hi(0x2015800), %g1 200df98: fa 20 61 64 st %i5, [ %g1 + 0x164 ] ! 2015964 <_Thread_Allocated_fp> /* * 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 ); 200df9c: 7f ff ec a8 call 200923c <_User_extensions_Thread_begin> 200dfa0: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200dfa4: 7f ff e9 87 call 20085c0 <_Thread_Enable_dispatch> 200dfa8: b9 2f 20 18 sll %i4, 0x18, %i4 /* * _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) */ { 200dfac: 80 a7 20 00 cmp %i4, 0 200dfb0: 32 80 00 05 bne,a 200dfc4 <_Thread_Handler+0x90> 200dfb4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 INIT_NAME (); 200dfb8: 40 00 1a ee call 2014b70 <_init> 200dfbc: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200dfc0: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200dfc4: 80 a0 60 00 cmp %g1, 0 200dfc8: 12 80 00 05 bne 200dfdc <_Thread_Handler+0xa8> 200dfcc: 80 a0 60 01 cmp %g1, 1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200dfd0: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200dfd4: 10 80 00 06 b 200dfec <_Thread_Handler+0xb8> 200dfd8: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 200dfdc: 12 80 00 07 bne 200dff8 <_Thread_Handler+0xc4> <== NEVER TAKEN 200dfe0: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200dfe4: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200dfe8: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 200dfec: 9f c0 40 00 call %g1 200dff0: 01 00 00 00 nop executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 200dff4: d0 27 60 28 st %o0, [ %i5 + 0x28 ] * 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 ); 200dff8: 7f ff ec a2 call 2009280 <_User_extensions_Thread_exitted> 200dffc: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e000: 90 10 20 00 clr %o0 200e004: 92 10 20 01 mov 1, %o1 200e008: 7f ff e4 84 call 2007218 <_Internal_error_Occurred> 200e00c: 94 10 20 05 mov 5, %o2 =============================================================================== 0200869c <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200869c: 9d e3 bf a0 save %sp, -96, %sp 20086a0: 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; 20086a4: c0 26 61 58 clr [ %i1 + 0x158 ] 20086a8: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 20086ac: 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 ) { 20086b0: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 20086b4: e2 00 40 00 ld [ %g1 ], %l1 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 20086b8: 80 a6 a0 00 cmp %i2, 0 20086bc: 12 80 00 0d bne 20086f0 <_Thread_Initialize+0x54> 20086c0: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 20086c4: 90 10 00 19 mov %i1, %o0 20086c8: 40 00 02 08 call 2008ee8 <_Thread_Stack_Allocate> 20086cc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 20086d0: 80 a2 00 1b cmp %o0, %i3 20086d4: 0a 80 00 6a bcs 200887c <_Thread_Initialize+0x1e0> 20086d8: 80 a2 20 00 cmp %o0, 0 20086dc: 02 80 00 68 be 200887c <_Thread_Initialize+0x1e0> <== NEVER TAKEN 20086e0: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 20086e4: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 20086e8: 10 80 00 04 b 20086f8 <_Thread_Initialize+0x5c> 20086ec: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 20086f0: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 20086f4: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20086f8: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 20086fc: 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 ) { 2008700: 80 a7 20 00 cmp %i4, 0 2008704: 02 80 00 07 be 2008720 <_Thread_Initialize+0x84> 2008708: b6 10 20 00 clr %i3 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 200870c: 40 00 04 0f call 2009748 <_Workspace_Allocate> 2008710: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008714: b6 92 20 00 orcc %o0, 0, %i3 2008718: 02 80 00 4a be 2008840 <_Thread_Initialize+0x1a4> 200871c: b8 10 20 00 clr %i4 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008720: 03 00 80 56 sethi %hi(0x2015800), %g1 2008724: d0 00 61 74 ld [ %g1 + 0x174 ], %o0 ! 2015974 <_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; 2008728: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200872c: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008730: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008734: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008738: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 200873c: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008740: 80 a2 20 00 cmp %o0, 0 2008744: 02 80 00 08 be 2008764 <_Thread_Initialize+0xc8> 2008748: b8 10 20 00 clr %i4 extensions_area = _Workspace_Allocate( 200874c: 90 02 20 01 inc %o0 2008750: 40 00 03 fe call 2009748 <_Workspace_Allocate> 2008754: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008758: b8 92 20 00 orcc %o0, 0, %i4 200875c: 02 80 00 3a be 2008844 <_Thread_Initialize+0x1a8> 2008760: b4 10 20 00 clr %i2 * if they are linked to the thread. An extension user may * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { 2008764: 80 a7 20 00 cmp %i4, 0 2008768: 02 80 00 0c be 2008798 <_Thread_Initialize+0xfc> 200876c: f8 26 61 60 st %i4, [ %i1 + 0x160 ] for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008770: 03 00 80 56 sethi %hi(0x2015800), %g1 2008774: c4 00 61 74 ld [ %g1 + 0x174 ], %g2 ! 2015974 <_Thread_Maximum_extensions> 2008778: 10 80 00 05 b 200878c <_Thread_Initialize+0xf0> 200877c: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 2008780: 87 28 60 02 sll %g1, 2, %g3 * 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++ ) 2008784: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 2008788: c0 21 00 03 clr [ %g4 + %g3 ] * 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++ ) 200878c: 80 a0 40 02 cmp %g1, %g2 2008790: 28 bf ff fc bleu,a 2008780 <_Thread_Initialize+0xe4> 2008794: c8 06 61 60 ld [ %i1 + 0x160 ], %g4 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2008798: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200879c: e4 2e 60 a0 stb %l2, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 20087a0: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 20087a4: 80 a4 20 02 cmp %l0, 2 20087a8: 12 80 00 05 bne 20087bc <_Thread_Initialize+0x120> 20087ac: 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; 20087b0: 03 00 80 56 sethi %hi(0x2015800), %g1 20087b4: c2 00 60 44 ld [ %g1 + 0x44 ], %g1 ! 2015844 <_Thread_Ticks_per_timeslice> 20087b8: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 20087bc: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 20087c0: c0 26 60 44 clr [ %i1 + 0x44 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 20087c4: c2 26 60 ac st %g1, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 20087c8: 82 10 20 01 mov 1, %g1 20087cc: c2 26 60 10 st %g1, [ %i1 + 0x10 ] */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 20087d0: 03 00 80 53 sethi %hi(0x2014c00), %g1 20087d4: c2 00 60 ac ld [ %g1 + 0xac ], %g1 ! 2014cac <_Scheduler+0x18> the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 20087d8: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 20087dc: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 20087e0: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 20087e4: 9f c0 40 00 call %g1 20087e8: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 20087ec: b4 92 20 00 orcc %o0, 0, %i2 20087f0: 02 80 00 15 be 2008844 <_Thread_Initialize+0x1a8> 20087f4: 90 10 00 19 mov %i1, %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 20087f8: 40 00 01 94 call 2008e48 <_Thread_Set_priority> 20087fc: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008800: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008804: 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 ); 2008808: c0 26 60 84 clr [ %i1 + 0x84 ] 200880c: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008810: 83 28 60 02 sll %g1, 2, %g1 2008814: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008818: e2 26 60 0c st %l1, [ %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 ); 200881c: 90 10 00 19 mov %i1, %o0 2008820: 40 00 02 b9 call 2009304 <_User_extensions_Thread_create> 2008824: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008828: 80 8a 20 ff btst 0xff, %o0 200882c: 02 80 00 06 be 2008844 <_Thread_Initialize+0x1a8> 2008830: 01 00 00 00 nop 2008834: b0 0e 20 01 and %i0, 1, %i0 2008838: 81 c7 e0 08 ret 200883c: 81 e8 00 00 restore 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; 2008840: b4 10 20 00 clr %i2 extension_status = _User_extensions_Thread_create( the_thread ); if ( extension_status ) return true; failed: _Workspace_Free( the_thread->libc_reent ); 2008844: 40 00 03 c9 call 2009768 <_Workspace_Free> 2008848: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200884c: 40 00 03 c7 call 2009768 <_Workspace_Free> 2008850: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008854: 40 00 03 c5 call 2009768 <_Workspace_Free> 2008858: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200885c: 40 00 03 c3 call 2009768 <_Workspace_Free> 2008860: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2008864: 40 00 03 c1 call 2009768 <_Workspace_Free> 2008868: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200886c: 40 00 03 bf call 2009768 <_Workspace_Free> 2008870: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 2008874: 40 00 01 b4 call 2008f44 <_Thread_Stack_Free> 2008878: 90 10 00 19 mov %i1, %o0 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 */ 200887c: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2008880: b0 0e 20 01 and %i0, 1, %i0 2008884: 81 c7 e0 08 ret 2008888: 81 e8 00 00 restore =============================================================================== 0200902c <_Thread_Tickle_timeslice>: * * Output parameters: NONE */ void _Thread_Tickle_timeslice( void ) { 200902c: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing; executing = _Thread_Executing; 2009030: 03 00 80 57 sethi %hi(0x2015c00), %g1 2009034: fa 00 62 24 ld [ %g1 + 0x224 ], %i5 ! 2015e24 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009038: c2 0f 60 74 ldub [ %i5 + 0x74 ], %g1 200903c: 80 a0 60 00 cmp %g1, 0 2009040: 02 80 00 25 be 20090d4 <_Thread_Tickle_timeslice+0xa8> 2009044: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009048: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200904c: 80 a0 60 00 cmp %g1, 0 2009050: 12 80 00 21 bne 20090d4 <_Thread_Tickle_timeslice+0xa8> 2009054: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009058: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 200905c: 80 a0 60 01 cmp %g1, 1 2009060: 0a 80 00 14 bcs 20090b0 <_Thread_Tickle_timeslice+0x84> 2009064: 80 a0 60 02 cmp %g1, 2 2009068: 28 80 00 07 bleu,a 2009084 <_Thread_Tickle_timeslice+0x58> 200906c: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 2009070: 80 a0 60 03 cmp %g1, 3 2009074: 12 80 00 18 bne 20090d4 <_Thread_Tickle_timeslice+0xa8> <== NEVER TAKEN 2009078: 01 00 00 00 nop } break; #if defined(RTEMS_SCORE_THREAD_ENABLE_SCHEDULER_CALLOUT) case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: if ( --executing->cpu_time_budget == 0 ) 200907c: 10 80 00 0f b 20090b8 <_Thread_Tickle_timeslice+0x8c> 2009080: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 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 ) { 2009084: 82 00 7f ff add %g1, -1, %g1 2009088: 80 a0 60 00 cmp %g1, 0 200908c: 14 80 00 09 bg 20090b0 <_Thread_Tickle_timeslice+0x84> 2009090: c2 27 60 78 st %g1, [ %i5 + 0x78 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 2009094: 03 00 80 53 sethi %hi(0x2014c00), %g1 2009098: c2 00 60 a0 ld [ %g1 + 0xa0 ], %g1 ! 2014ca0 <_Scheduler+0xc> 200909c: 9f c0 40 00 call %g1 20090a0: 01 00 00 00 nop * 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; 20090a4: 03 00 80 56 sethi %hi(0x2015800), %g1 20090a8: c2 00 60 44 ld [ %g1 + 0x44 ], %g1 ! 2015844 <_Thread_Ticks_per_timeslice> 20090ac: c2 27 60 78 st %g1, [ %i5 + 0x78 ] 20090b0: 81 c7 e0 08 ret 20090b4: 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 ) 20090b8: 82 00 7f ff add %g1, -1, %g1 20090bc: 80 a0 60 00 cmp %g1, 0 20090c0: 12 bf ff fc bne 20090b0 <_Thread_Tickle_timeslice+0x84> 20090c4: c2 27 60 78 st %g1, [ %i5 + 0x78 ] (*executing->budget_callout)( executing ); 20090c8: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 20090cc: 9f c0 40 00 call %g1 20090d0: 90 10 00 1d mov %i5, %o0 20090d4: 81 c7 e0 08 ret 20090d8: 81 e8 00 00 restore =============================================================================== 02008d94 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2008d94: 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 ) 2008d98: 80 a6 20 00 cmp %i0, 0 2008d9c: 02 80 00 19 be 2008e00 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2008da0: 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 ) { 2008da4: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2008da8: 80 a7 20 01 cmp %i4, 1 2008dac: 12 80 00 15 bne 2008e00 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2008db0: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2008db4: 7f ff e4 43 call 2001ec0 2008db8: 01 00 00 00 nop 2008dbc: ba 10 00 08 mov %o0, %i5 2008dc0: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2008dc4: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008dc8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2008dcc: 80 88 80 01 btst %g2, %g1 2008dd0: 02 80 00 0a be 2008df8 <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 2008dd4: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2008dd8: 92 10 00 19 mov %i1, %o1 2008ddc: 94 10 20 01 mov 1, %o2 2008de0: 40 00 0d 9e call 200c458 <_Thread_queue_Extract_priority_helper> 2008de4: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2008de8: 90 10 00 18 mov %i0, %o0 2008dec: 92 10 00 19 mov %i1, %o1 2008df0: 7f ff ff 52 call 2008b38 <_Thread_queue_Enqueue_priority> 2008df4: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 2008df8: 7f ff e4 36 call 2001ed0 2008dfc: 90 10 00 1d mov %i5, %o0 2008e00: 81 c7 e0 08 ret 2008e04: 81 e8 00 00 restore =============================================================================== 02008e08 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008e08: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008e0c: 90 10 00 18 mov %i0, %o0 2008e10: 7f ff fd f8 call 20085f0 <_Thread_Get> 2008e14: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008e18: c2 07 bf fc ld [ %fp + -4 ], %g1 2008e1c: 80 a0 60 00 cmp %g1, 0 2008e20: 12 80 00 08 bne 2008e40 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 2008e24: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2008e28: 40 00 0d c3 call 200c534 <_Thread_queue_Process_timeout> 2008e2c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2008e30: 03 00 80 56 sethi %hi(0x2015800), %g1 2008e34: c4 00 60 e0 ld [ %g1 + 0xe0 ], %g2 ! 20158e0 <_Thread_Dispatch_disable_level> 2008e38: 84 00 bf ff add %g2, -1, %g2 2008e3c: c4 20 60 e0 st %g2, [ %g1 + 0xe0 ] 2008e40: 81 c7 e0 08 ret 2008e44: 81 e8 00 00 restore =============================================================================== 02016560 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2016560: 9d e3 bf 88 save %sp, -120, %sp static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016564: 27 00 80 f4 sethi %hi(0x203d000), %l3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016568: a8 07 bf e8 add %fp, -24, %l4 201656c: a4 07 bf ec add %fp, -20, %l2 2016570: b6 07 bf f4 add %fp, -12, %i3 2016574: b4 07 bf f8 add %fp, -8, %i2 2016578: e4 27 bf e8 st %l2, [ %fp + -24 ] head->previous = NULL; 201657c: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2016580: e8 27 bf f0 st %l4, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016584: f4 27 bf f4 st %i2, [ %fp + -12 ] head->previous = NULL; 2016588: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 201658c: f6 27 bf fc st %i3, [ %fp + -4 ] */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016590: b2 06 20 30 add %i0, 0x30, %i1 /* * 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 ); 2016594: b8 06 20 68 add %i0, 0x68, %i4 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016598: a2 06 20 08 add %i0, 8, %l1 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 201659c: a0 06 20 40 add %i0, 0x40, %l0 { /* * 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; 20165a0: e8 26 20 78 st %l4, [ %i0 + 0x78 ] static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20165a4: 2b 00 80 f3 sethi %hi(0x203cc00), %l5 static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20165a8: c2 04 e0 54 ld [ %l3 + 0x54 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20165ac: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165b0: 94 10 00 1b mov %i3, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20165b4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165b8: 90 10 00 19 mov %i1, %o0 20165bc: 40 00 11 d4 call 201ad0c <_Watchdog_Adjust_to_chain> 20165c0: 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; 20165c4: 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(); 20165c8: fa 05 63 cc ld [ %l5 + 0x3cc ], %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 ) { 20165cc: 80 a7 40 0a cmp %i5, %o2 20165d0: 08 80 00 06 bleu 20165e8 <_Timer_server_Body+0x88> 20165d4: 92 27 40 0a sub %i5, %o2, %o1 /* * 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 ); 20165d8: 90 10 00 1c mov %i4, %o0 20165dc: 40 00 11 cc call 201ad0c <_Watchdog_Adjust_to_chain> 20165e0: 94 10 00 1b mov %i3, %o2 20165e4: 30 80 00 06 b,a 20165fc <_Timer_server_Body+0x9c> } else if ( snapshot < last_snapshot ) { 20165e8: 1a 80 00 05 bcc 20165fc <_Timer_server_Body+0x9c> 20165ec: 90 10 00 1c mov %i4, %o0 /* * 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 ); 20165f0: 92 10 20 01 mov 1, %o1 20165f4: 40 00 11 9f call 201ac70 <_Watchdog_Adjust> 20165f8: 94 22 80 1d sub %o2, %i5, %o2 } watchdogs->last_snapshot = snapshot; 20165fc: 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 ); 2016600: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016604: 40 00 02 d9 call 2017168 <_Chain_Get> 2016608: 01 00 00 00 nop if ( timer == NULL ) { 201660c: 92 92 20 00 orcc %o0, 0, %o1 2016610: 02 80 00 0c be 2016640 <_Timer_server_Body+0xe0> 2016614: 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 ) { 2016618: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 201661c: 80 a0 60 01 cmp %g1, 1 2016620: 02 80 00 05 be 2016634 <_Timer_server_Body+0xd4> 2016624: 90 10 00 19 mov %i1, %o0 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2016628: 80 a0 60 03 cmp %g1, 3 201662c: 12 bf ff f5 bne 2016600 <_Timer_server_Body+0xa0> <== NEVER TAKEN 2016630: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016634: 40 00 11 e9 call 201add8 <_Watchdog_Insert> 2016638: 92 02 60 10 add %o1, 0x10, %o1 201663c: 30 bf ff f1 b,a 2016600 <_Timer_server_Body+0xa0> * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2016640: 7f ff e3 97 call 200f49c 2016644: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2016648: c2 07 bf e8 ld [ %fp + -24 ], %g1 201664c: 80 a0 40 12 cmp %g1, %l2 2016650: 12 80 00 0a bne 2016678 <_Timer_server_Body+0x118> <== NEVER TAKEN 2016654: 01 00 00 00 nop ts->insert_chain = NULL; 2016658: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 201665c: 7f ff e3 94 call 200f4ac 2016660: 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 ) ) { 2016664: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016668: 80 a0 40 1a cmp %g1, %i2 201666c: 12 80 00 06 bne 2016684 <_Timer_server_Body+0x124> 2016670: 01 00 00 00 nop 2016674: 30 80 00 18 b,a 20166d4 <_Timer_server_Body+0x174> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2016678: 7f ff e3 8d call 200f4ac <== NOT EXECUTED 201667c: 01 00 00 00 nop <== NOT EXECUTED 2016680: 30 bf ff ca b,a 20165a8 <_Timer_server_Body+0x48> <== NOT EXECUTED /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2016684: 7f ff e3 86 call 200f49c 2016688: 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; 201668c: 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)) 2016690: 80 a7 40 1a cmp %i5, %i2 2016694: 02 80 00 0d be 20166c8 <_Timer_server_Body+0x168> 2016698: 01 00 00 00 nop Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; 201669c: c2 07 40 00 ld [ %i5 ], %g1 head->next = new_first; new_first->previous = head; 20166a0: 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; 20166a4: c2 27 bf f4 st %g1, [ %fp + -12 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 20166a8: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 20166ac: 7f ff e3 80 call 200f4ac 20166b0: 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 ); 20166b4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20166b8: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 20166bc: 9f c0 40 00 call %g1 20166c0: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 } 20166c4: 30 bf ff f0 b,a 2016684 <_Timer_server_Body+0x124> watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 20166c8: 7f ff e3 79 call 200f4ac 20166cc: 01 00 00 00 nop 20166d0: 30 bf ff b4 b,a 20165a0 <_Timer_server_Body+0x40> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20166d4: c0 2e 20 7c clrb [ %i0 + 0x7c ] 20166d8: 03 00 80 f3 sethi %hi(0x203cc00), %g1 20166dc: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 203cf40 <_Thread_Dispatch_disable_level> 20166e0: 84 00 a0 01 inc %g2 20166e4: c4 20 63 40 st %g2, [ %g1 + 0x340 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 20166e8: d0 06 00 00 ld [ %i0 ], %o0 20166ec: 40 00 0f bb call 201a5d8 <_Thread_Set_state> 20166f0: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 20166f4: 7f ff ff 73 call 20164c0 <_Timer_server_Reset_interval_system_watchdog> 20166f8: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 20166fc: 7f ff ff 85 call 2016510 <_Timer_server_Reset_tod_system_watchdog> 2016700: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2016704: 40 00 0d 68 call 2019ca4 <_Thread_Enable_dispatch> 2016708: 01 00 00 00 nop ts->active = true; 201670c: 82 10 20 01 mov 1, %g1 ! 1 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016710: 90 10 00 11 mov %l1, %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; 2016714: c2 2e 20 7c stb %g1, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016718: 40 00 12 0b call 201af44 <_Watchdog_Remove> 201671c: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016720: 40 00 12 09 call 201af44 <_Watchdog_Remove> 2016724: 90 10 00 10 mov %l0, %o0 2016728: 30 bf ff 9e b,a 20165a0 <_Timer_server_Body+0x40> =============================================================================== 0201672c <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 201672c: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2016730: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2016734: 80 a0 60 00 cmp %g1, 0 2016738: 12 80 00 4b bne 2016864 <_Timer_server_Schedule_operation_method+0x138> 201673c: ba 10 00 19 mov %i1, %i5 2016740: 03 00 80 f3 sethi %hi(0x203cc00), %g1 2016744: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 203cf40 <_Thread_Dispatch_disable_level> 2016748: 84 00 a0 01 inc %g2 201674c: c4 20 63 40 st %g2, [ %g1 + 0x340 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2016750: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2016754: 80 a0 60 01 cmp %g1, 1 2016758: 12 80 00 1f bne 20167d4 <_Timer_server_Schedule_operation_method+0xa8> 201675c: 80 a0 60 03 cmp %g1, 3 /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2016760: 7f ff e3 4f call 200f49c 2016764: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016768: 03 00 80 f4 sethi %hi(0x203d000), %g1 201676c: c4 00 60 54 ld [ %g1 + 0x54 ], %g2 ! 203d054 <_Watchdog_Ticks_since_boot> */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016770: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2016774: 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 ); 2016778: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 201677c: 80 a0 40 03 cmp %g1, %g3 2016780: 02 80 00 08 be 20167a0 <_Timer_server_Schedule_operation_method+0x74> 2016784: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2016788: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 201678c: 80 a3 c0 04 cmp %o7, %g4 2016790: 08 80 00 03 bleu 201679c <_Timer_server_Schedule_operation_method+0x70> 2016794: 86 10 20 00 clr %g3 delta_interval -= delta; 2016798: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 201679c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 20167a0: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 20167a4: 7f ff e3 42 call 200f4ac 20167a8: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20167ac: 90 06 20 30 add %i0, 0x30, %o0 20167b0: 40 00 11 8a call 201add8 <_Watchdog_Insert> 20167b4: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167b8: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20167bc: 80 a0 60 00 cmp %g1, 0 20167c0: 12 80 00 27 bne 201685c <_Timer_server_Schedule_operation_method+0x130> 20167c4: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20167c8: 7f ff ff 3e call 20164c0 <_Timer_server_Reset_interval_system_watchdog> 20167cc: 90 10 00 18 mov %i0, %o0 20167d0: 30 80 00 23 b,a 201685c <_Timer_server_Schedule_operation_method+0x130> } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20167d4: 12 80 00 22 bne 201685c <_Timer_server_Schedule_operation_method+0x130> 20167d8: 01 00 00 00 nop /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 20167dc: 7f ff e3 30 call 200f49c 20167e0: 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; 20167e4: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 20167e8: de 06 20 74 ld [ %i0 + 0x74 ], %o7 /* * 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(); 20167ec: 03 00 80 f3 sethi %hi(0x203cc00), %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20167f0: 86 06 20 6c add %i0, 0x6c, %g3 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 20167f4: 80 a0 80 03 cmp %g2, %g3 20167f8: 02 80 00 0d be 201682c <_Timer_server_Schedule_operation_method+0x100> 20167fc: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2016800: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 if ( snapshot > last_snapshot ) { 2016804: 80 a0 40 0f cmp %g1, %o7 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016808: 86 01 00 0f add %g4, %o7, %g3 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 201680c: 08 80 00 07 bleu 2016828 <_Timer_server_Schedule_operation_method+0xfc> 2016810: 86 20 c0 01 sub %g3, %g1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2016814: 9e 20 40 0f sub %g1, %o7, %o7 if (delta_interval > delta) { 2016818: 80 a1 00 0f cmp %g4, %o7 201681c: 08 80 00 03 bleu 2016828 <_Timer_server_Schedule_operation_method+0xfc><== NEVER TAKEN 2016820: 86 10 20 00 clr %g3 delta_interval -= delta; 2016824: 86 21 00 0f sub %g4, %o7, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2016828: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 201682c: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2016830: 7f ff e3 1f call 200f4ac 2016834: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016838: 90 06 20 68 add %i0, 0x68, %o0 201683c: 40 00 11 67 call 201add8 <_Watchdog_Insert> 2016840: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2016844: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016848: 80 a0 60 00 cmp %g1, 0 201684c: 12 80 00 04 bne 201685c <_Timer_server_Schedule_operation_method+0x130> 2016850: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2016854: 7f ff ff 2f call 2016510 <_Timer_server_Reset_tod_system_watchdog> 2016858: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 201685c: 40 00 0d 12 call 2019ca4 <_Thread_Enable_dispatch> 2016860: 81 e8 00 00 restore * 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 ); 2016864: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2016868: 40 00 02 2c call 2017118 <_Chain_Append> 201686c: 81 e8 00 00 restore =============================================================================== 02009184 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009184: 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; 2009188: 03 00 80 52 sethi %hi(0x2014800), %g1 200918c: 82 10 63 ac or %g1, 0x3ac, %g1 ! 2014bac ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009190: 05 00 80 56 sethi %hi(0x2015800), %g2 initial_extensions = Configuration.User_extension_table; 2009194: f4 00 60 3c ld [ %g1 + 0x3c ], %i2 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; 2009198: f6 00 60 38 ld [ %g1 + 0x38 ], %i3 200919c: 82 10 a2 c8 or %g2, 0x2c8, %g1 20091a0: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 20091a4: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 20091a8: c2 20 60 08 st %g1, [ %g1 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20091ac: c6 20 a2 c8 st %g3, [ %g2 + 0x2c8 ] 20091b0: 05 00 80 56 sethi %hi(0x2015800), %g2 20091b4: 82 10 a0 e4 or %g2, 0xe4, %g1 ! 20158e4 <_User_extensions_Switches_list> 20091b8: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 20091bc: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20091c0: c6 20 a0 e4 st %g3, [ %g2 + 0xe4 ] initial_extensions = Configuration.User_extension_table; _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 20091c4: 80 a6 a0 00 cmp %i2, 0 20091c8: 02 80 00 1b be 2009234 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 20091cc: c2 20 60 08 st %g1, [ %g1 + 8 ] extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 20091d0: 83 2e e0 02 sll %i3, 2, %g1 20091d4: bb 2e e0 04 sll %i3, 4, %i5 20091d8: ba 27 40 01 sub %i5, %g1, %i5 20091dc: ba 07 40 1b add %i5, %i3, %i5 20091e0: bb 2f 60 02 sll %i5, 2, %i5 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 20091e4: 40 00 01 67 call 2009780 <_Workspace_Allocate_or_fatal_error> 20091e8: 90 10 00 1d mov %i5, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 20091ec: 94 10 00 1d mov %i5, %o2 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 20091f0: b8 10 00 08 mov %o0, %i4 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 20091f4: 92 10 20 00 clr %o1 20091f8: 40 00 16 6b call 200eba4 20091fc: ba 10 20 00 clr %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009200: 10 80 00 0b b 200922c <_User_extensions_Handler_initialization+0xa8> 2009204: 80 a7 40 1b cmp %i5, %i3 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 2009208: 90 07 20 14 add %i4, 0x14, %o0 200920c: 92 06 80 09 add %i2, %o1, %o1 2009210: 40 00 16 29 call 200eab4 2009214: 94 10 20 20 mov 0x20, %o2 _User_extensions_Add_set( extension ); 2009218: 90 10 00 1c mov %i4, %o0 200921c: 40 00 0d 06 call 200c634 <_User_extensions_Add_set> 2009220: ba 07 60 01 inc %i5 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009224: b8 07 20 34 add %i4, 0x34, %i4 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009228: 80 a7 40 1b cmp %i5, %i3 200922c: 12 bf ff f7 bne 2009208 <_User_extensions_Handler_initialization+0x84> 2009230: 93 2f 60 05 sll %i5, 5, %o1 2009234: 81 c7 e0 08 ret 2009238: 81 e8 00 00 restore =============================================================================== 0200b3d4 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b3d4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b3d8: 7f ff de c8 call 2002ef8 200b3dc: 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; 200b3e0: 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 ); 200b3e4: b8 06 20 04 add %i0, 4, %i4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200b3e8: 80 a0 40 1c cmp %g1, %i4 200b3ec: 02 80 00 1f be 200b468 <_Watchdog_Adjust+0x94> 200b3f0: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b3f4: 02 80 00 1a be 200b45c <_Watchdog_Adjust+0x88> 200b3f8: b6 10 20 01 mov 1, %i3 200b3fc: 80 a6 60 01 cmp %i1, 1 200b400: 12 80 00 1a bne 200b468 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200b404: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b408: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b40c: 10 80 00 07 b 200b428 <_Watchdog_Adjust+0x54> 200b410: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200b414: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b418: 80 a6 80 02 cmp %i2, %g2 200b41c: 3a 80 00 05 bcc,a 200b430 <_Watchdog_Adjust+0x5c> 200b420: f6 20 60 10 st %i3, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200b424: b4 20 80 1a sub %g2, %i2, %i2 break; 200b428: 10 80 00 10 b 200b468 <_Watchdog_Adjust+0x94> 200b42c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; 200b430: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200b434: 7f ff de b5 call 2002f08 200b438: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b43c: 40 00 00 91 call 200b680 <_Watchdog_Tickle> 200b440: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200b444: 7f ff de ad call 2002ef8 200b448: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200b44c: c2 07 40 00 ld [ %i5 ], %g1 200b450: 80 a0 40 1c cmp %g1, %i4 200b454: 02 80 00 05 be 200b468 <_Watchdog_Adjust+0x94> 200b458: 01 00 00 00 nop switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b45c: 80 a6 a0 00 cmp %i2, 0 200b460: 32 bf ff ed bne,a 200b414 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200b464: c2 07 40 00 ld [ %i5 ], %g1 } break; } } _ISR_Enable( level ); 200b468: 7f ff de a8 call 2002f08 200b46c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020095a0 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 20095a0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 20095a4: 7f ff e2 47 call 2001ec0 20095a8: ba 10 00 18 mov %i0, %i5 previous_state = the_watchdog->state; 20095ac: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 20095b0: 80 a6 20 01 cmp %i0, 1 20095b4: 22 80 00 1d be,a 2009628 <_Watchdog_Remove+0x88> 20095b8: c0 27 60 08 clr [ %i5 + 8 ] 20095bc: 0a 80 00 1c bcs 200962c <_Watchdog_Remove+0x8c> 20095c0: 03 00 80 56 sethi %hi(0x2015800), %g1 20095c4: 80 a6 20 03 cmp %i0, 3 20095c8: 18 80 00 19 bgu 200962c <_Watchdog_Remove+0x8c> <== NEVER TAKEN 20095cc: 01 00 00 00 nop 20095d0: c2 07 40 00 ld [ %i5 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 20095d4: c0 27 60 08 clr [ %i5 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 20095d8: c4 00 40 00 ld [ %g1 ], %g2 20095dc: 80 a0 a0 00 cmp %g2, 0 20095e0: 02 80 00 07 be 20095fc <_Watchdog_Remove+0x5c> 20095e4: 05 00 80 56 sethi %hi(0x2015800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 20095e8: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 20095ec: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 20095f0: 84 00 c0 02 add %g3, %g2, %g2 20095f4: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 20095f8: 05 00 80 56 sethi %hi(0x2015800), %g2 20095fc: c4 00 a1 f0 ld [ %g2 + 0x1f0 ], %g2 ! 20159f0 <_Watchdog_Sync_count> 2009600: 80 a0 a0 00 cmp %g2, 0 2009604: 22 80 00 07 be,a 2009620 <_Watchdog_Remove+0x80> 2009608: c4 07 60 04 ld [ %i5 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200960c: 05 00 80 57 sethi %hi(0x2015c00), %g2 2009610: c6 00 a2 20 ld [ %g2 + 0x220 ], %g3 ! 2015e20 <_Per_CPU_Information+0x8> 2009614: 05 00 80 56 sethi %hi(0x2015800), %g2 2009618: c6 20 a1 88 st %g3, [ %g2 + 0x188 ] ! 2015988 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200961c: c4 07 60 04 ld [ %i5 + 4 ], %g2 next->previous = previous; 2009620: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 2009624: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009628: 03 00 80 56 sethi %hi(0x2015800), %g1 200962c: c2 00 61 f4 ld [ %g1 + 0x1f4 ], %g1 ! 20159f4 <_Watchdog_Ticks_since_boot> 2009630: c2 27 60 18 st %g1, [ %i5 + 0x18 ] _ISR_Enable( level ); 2009634: 7f ff e2 27 call 2001ed0 2009638: 01 00 00 00 nop return( previous_state ); } 200963c: 81 c7 e0 08 ret 2009640: 81 e8 00 00 restore =============================================================================== 0200abd4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200abd4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200abd8: 7f ff df 9c call 2002a48 200abdc: ba 10 00 18 mov %i0, %i5 200abe0: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200abe4: 11 00 80 71 sethi %hi(0x201c400), %o0 200abe8: 94 10 00 19 mov %i1, %o2 200abec: 90 12 20 c8 or %o0, 0xc8, %o0 200abf0: 7f ff e6 3f call 20044ec 200abf4: 92 10 00 1d mov %i5, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200abf8: 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 ); 200abfc: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200ac00: 80 a7 00 19 cmp %i4, %i1 200ac04: 12 80 00 04 bne 200ac14 <_Watchdog_Report_chain+0x40> 200ac08: 92 10 00 1c mov %i4, %o1 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200ac0c: 10 80 00 0d b 200ac40 <_Watchdog_Report_chain+0x6c> 200ac10: 11 00 80 71 sethi %hi(0x201c400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200ac14: 40 00 00 0f call 200ac50 <_Watchdog_Report> 200ac18: 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 ) 200ac1c: 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 ) ; 200ac20: 80 a7 00 19 cmp %i4, %i1 200ac24: 12 bf ff fc bne 200ac14 <_Watchdog_Report_chain+0x40> <== NEVER TAKEN 200ac28: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200ac2c: 11 00 80 71 sethi %hi(0x201c400), %o0 200ac30: 92 10 00 1d mov %i5, %o1 200ac34: 7f ff e6 2e call 20044ec 200ac38: 90 12 20 e0 or %o0, 0xe0, %o0 200ac3c: 30 80 00 03 b,a 200ac48 <_Watchdog_Report_chain+0x74> } else { printk( "Chain is empty\n" ); 200ac40: 7f ff e6 2b call 20044ec 200ac44: 90 12 20 f0 or %o0, 0xf0, %o0 } _ISR_Enable( level ); 200ac48: 7f ff df 84 call 2002a58 200ac4c: 81 e8 00 00 restore =============================================================================== 0200679c : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 200679c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 20067a0: 3b 00 80 61 sethi %hi(0x2018400), %i5 20067a4: 40 00 04 5b call 2007910 20067a8: 90 17 63 ac or %i5, 0x3ac, %o0 ! 20187ac if (fcntl (fildes, F_GETFD) < 0) { 20067ac: 90 10 00 18 mov %i0, %o0 20067b0: 40 00 1c 13 call 200d7fc 20067b4: 92 10 20 01 mov 1, %o1 20067b8: 80 a2 20 00 cmp %o0, 0 20067bc: 16 80 00 08 bge 20067dc 20067c0: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); 20067c4: 40 00 04 73 call 2007990 20067c8: 90 17 63 ac or %i5, 0x3ac, %o0 rtems_set_errno_and_return_minus_one (EBADF); 20067cc: 40 00 29 3b call 2010cb8 <__errno> 20067d0: 01 00 00 00 nop 20067d4: 10 80 00 4e b 200690c 20067d8: 82 10 20 09 mov 9, %g1 ! 9 } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 20067dc: 32 80 00 2f bne,a 2006898 20067e0: f8 06 40 00 ld [ %i1 ], %i4 AIO_printf ("Cancel all requests\n"); r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 20067e4: 11 00 80 61 sethi %hi(0x2018400), %o0 20067e8: 92 10 00 18 mov %i0, %o1 20067ec: 90 12 23 f4 or %o0, 0x3f4, %o0 20067f0: 40 00 00 bb call 2006adc 20067f4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20067f8: b8 92 20 00 orcc %o0, 0, %i4 20067fc: 32 80 00 1a bne,a 2006864 2006800: b2 07 20 1c add %i4, 0x1c, %i1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2006804: ba 17 63 ac or %i5, 0x3ac, %i5 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006808: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200680c: 82 07 60 58 add %i5, 0x58, %g1 2006810: 80 a0 80 01 cmp %g2, %g1 2006814: 02 80 00 48 be 2006934 <== NEVER TAKEN 2006818: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200681c: 92 10 00 18 mov %i0, %o1 2006820: 40 00 00 af call 2006adc 2006824: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006828: b8 92 20 00 orcc %o0, 0, %i4 200682c: 22 80 00 43 be,a 2006938 2006830: 90 10 00 1d mov %i5, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006834: 40 00 0a 9b call 20092a0 <_Chain_Extract> 2006838: 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); 200683c: 40 00 01 8d call 2006e70 2006840: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006844: 40 00 03 8f call 2007680 2006848: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 200684c: 40 00 02 b5 call 2007320 2006850: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006854: 7f ff f3 31 call 2003518 2006858: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 200685c: 10 80 00 0b b 2006888 2006860: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006864: 40 00 04 2b call 2007910 2006868: 90 10 00 19 mov %i1, %o0 200686c: 40 00 0a 8d call 20092a0 <_Chain_Extract> 2006870: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006874: 40 00 01 7f call 2006e70 2006878: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 200687c: 40 00 04 45 call 2007990 2006880: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006884: 90 17 63 ac or %i5, 0x3ac, %o0 2006888: 40 00 04 42 call 2007990 200688c: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006890: 81 c7 e0 08 ret 2006894: 81 e8 00 00 restore } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2006898: 80 a7 00 18 cmp %i4, %i0 200689c: 12 80 00 17 bne 20068f8 20068a0: 90 17 63 ac or %i5, 0x3ac, %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); 20068a4: 11 00 80 61 sethi %hi(0x2018400), %o0 20068a8: 92 10 00 1c mov %i4, %o1 20068ac: 90 12 23 f4 or %o0, 0x3f4, %o0 20068b0: 40 00 00 8b call 2006adc 20068b4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20068b8: b0 92 20 00 orcc %o0, 0, %i0 20068bc: 32 80 00 23 bne,a 2006948 20068c0: b8 06 20 1c add %i0, 0x1c, %i4 20068c4: ba 17 63 ac or %i5, 0x3ac, %i5 if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 20068c8: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 20068cc: 82 07 60 58 add %i5, 0x58, %g1 20068d0: 80 a0 80 01 cmp %g2, %g1 20068d4: 02 80 00 18 be 2006934 <== NEVER TAKEN 20068d8: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 20068dc: 92 10 00 1c mov %i4, %o1 20068e0: 40 00 00 7f call 2006adc 20068e4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20068e8: 80 a2 20 00 cmp %o0, 0 20068ec: 12 80 00 0b bne 2006918 20068f0: 92 10 00 19 mov %i1, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); 20068f4: 90 10 00 1d mov %i5, %o0 20068f8: 40 00 04 26 call 2007990 20068fc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one (EINVAL); 2006900: 40 00 28 ee call 2010cb8 <__errno> 2006904: 01 00 00 00 nop 2006908: 82 10 20 16 mov 0x16, %g1 ! 16 200690c: c2 22 00 00 st %g1, [ %o0 ] 2006910: 81 c7 e0 08 ret 2006914: 91 e8 3f ff restore %g0, -1, %o0 } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006918: 40 00 01 6a call 2006ec0 200691c: 90 02 20 08 add %o0, 8, %o0 2006920: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006924: 40 00 04 1b call 2007990 2006928: 90 10 00 1d mov %i5, %o0 return result; 200692c: 81 c7 e0 08 ret 2006930: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006934: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006938: 40 00 04 16 call 2007990 200693c: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006940: 81 c7 e0 08 ret 2006944: 81 e8 00 00 restore } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006948: 40 00 03 f2 call 2007910 200694c: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006950: 92 10 00 19 mov %i1, %o1 2006954: 40 00 01 5b call 2006ec0 2006958: 90 06 20 08 add %i0, 8, %o0 200695c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2006960: 40 00 04 0c call 2007990 2006964: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006968: 40 00 04 0a call 2007990 200696c: 90 17 63 ac or %i5, 0x3ac, %o0 return result; } return AIO_ALLDONE; } 2006970: 81 c7 e0 08 ret 2006974: 81 e8 00 00 restore =============================================================================== 02006980 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2006980: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2006984: 03 00 00 08 sethi %hi(0x2000), %g1 2006988: 80 a6 00 01 cmp %i0, %g1 200698c: 12 80 00 10 bne 20069cc 2006990: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006994: d0 06 40 00 ld [ %i1 ], %o0 2006998: 40 00 1b 99 call 200d7fc 200699c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20069a0: 90 0a 20 03 and %o0, 3, %o0 20069a4: 90 02 3f ff add %o0, -1, %o0 20069a8: 80 a2 20 01 cmp %o0, 1 20069ac: 18 80 00 08 bgu 20069cc 20069b0: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20069b4: 7f ff f4 51 call 2003af8 20069b8: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20069bc: 80 a2 20 00 cmp %o0, 0 20069c0: 32 80 00 0b bne,a 20069ec <== ALWAYS TAKEN 20069c4: f2 22 20 14 st %i1, [ %o0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20069c8: ba 10 20 0b mov 0xb, %i5 20069cc: 82 10 3f ff mov -1, %g1 20069d0: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 20069d4: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 20069d8: 40 00 28 b8 call 2010cb8 <__errno> 20069dc: b0 10 3f ff mov -1, %i0 20069e0: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 20069e4: 81 c7 e0 08 ret 20069e8: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; 20069ec: 82 10 20 03 mov 3, %g1 20069f0: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 20069f4: 40 00 01 50 call 2006f34 20069f8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007164 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 2007164: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007168: d0 06 00 00 ld [ %i0 ], %o0 200716c: 40 00 19 a4 call 200d7fc 2007170: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007174: 90 0a 20 03 and %o0, 3, %o0 2007178: 80 a2 20 02 cmp %o0, 2 200717c: 02 80 00 05 be 2007190 2007180: ba 10 00 18 mov %i0, %i5 2007184: 80 a2 20 00 cmp %o0, 0 2007188: 12 80 00 10 bne 20071c8 <== ALWAYS TAKEN 200718c: b8 10 20 09 mov 9, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2007190: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2007194: 80 a0 60 00 cmp %g1, 0 2007198: 32 80 00 0c bne,a 20071c8 200719c: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20071a0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20071a4: 80 a0 60 00 cmp %g1, 0 20071a8: 26 80 00 08 bl,a 20071c8 20071ac: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20071b0: 7f ff f2 52 call 2003af8 20071b4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20071b8: 80 a2 20 00 cmp %o0, 0 20071bc: 32 80 00 0b bne,a 20071e8 <== ALWAYS TAKEN 20071c0: fa 22 20 14 st %i5, [ %o0 + 0x14 ] 20071c4: b8 10 20 0b mov 0xb, %i4 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20071c8: 82 10 3f ff mov -1, %g1 20071cc: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 20071d0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20071d4: 40 00 26 b9 call 2010cb8 <__errno> 20071d8: b0 10 3f ff mov -1, %i0 20071dc: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 20071e0: 81 c7 e0 08 ret 20071e4: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; 20071e8: 82 10 20 01 mov 1, %g1 20071ec: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 20071f0: 7f ff ff 51 call 2006f34 20071f4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007200 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007200: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007204: d0 06 00 00 ld [ %i0 ], %o0 2007208: 40 00 19 7d call 200d7fc 200720c: 92 10 20 03 mov 3, %o1 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007210: ba 10 00 18 mov %i0, %i5 rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007214: 90 0a 20 03 and %o0, 3, %o0 2007218: 90 02 3f ff add %o0, -1, %o0 200721c: 80 a2 20 01 cmp %o0, 1 2007220: 18 80 00 10 bgu 2007260 2007224: b8 10 20 09 mov 9, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2007228: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200722c: 80 a0 60 00 cmp %g1, 0 2007230: 32 80 00 0c bne,a 2007260 2007234: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007238: c2 06 20 08 ld [ %i0 + 8 ], %g1 200723c: 80 a0 60 00 cmp %g1, 0 2007240: 26 80 00 08 bl,a 2007260 2007244: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007248: 7f ff f2 2c call 2003af8 200724c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007250: 80 a2 20 00 cmp %o0, 0 2007254: 32 80 00 0b bne,a 2007280 <== ALWAYS TAKEN 2007258: f0 22 20 14 st %i0, [ %o0 + 0x14 ] 200725c: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007260: 82 10 3f ff mov -1, %g1 2007264: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 2007268: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 200726c: 40 00 26 93 call 2010cb8 <__errno> 2007270: b0 10 3f ff mov -1, %i0 2007274: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2007278: 81 c7 e0 08 ret 200727c: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; 2007280: 82 10 20 02 mov 2, %g1 2007284: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007288: 7f ff ff 2b call 2006f34 200728c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02005ddc : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2005ddc: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005de0: 90 96 60 00 orcc %i1, 0, %o0 2005de4: 12 80 00 06 bne 2005dfc 2005de8: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005dec: 40 00 25 88 call 200f40c <__errno> 2005df0: 01 00 00 00 nop 2005df4: 10 80 00 15 b 2005e48 2005df8: 82 10 20 16 mov 0x16, %g1 ! 16 if ( clock_id == CLOCK_REALTIME ) { 2005dfc: 12 80 00 05 bne 2005e10 2005e00: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); 2005e04: 40 00 07 b9 call 2007ce8 <_TOD_Get> 2005e08: b0 10 20 00 clr %i0 2005e0c: 30 80 00 16 b,a 2005e64 return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2005e10: 02 80 00 05 be 2005e24 <== NEVER TAKEN 2005e14: 01 00 00 00 nop return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { 2005e18: 80 a6 20 02 cmp %i0, 2 2005e1c: 12 80 00 06 bne 2005e34 2005e20: 80 a6 20 03 cmp %i0, 3 _TOD_Get_uptime_as_timespec( tp ); 2005e24: 40 00 07 cd call 2007d58 <_TOD_Get_uptime_as_timespec> 2005e28: b0 10 20 00 clr %i0 return 0; 2005e2c: 81 c7 e0 08 ret 2005e30: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) 2005e34: 12 80 00 08 bne 2005e54 2005e38: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005e3c: 40 00 25 74 call 200f40c <__errno> 2005e40: 01 00 00 00 nop 2005e44: 82 10 20 58 mov 0x58, %g1 ! 58 2005e48: c2 22 00 00 st %g1, [ %o0 ] 2005e4c: 81 c7 e0 08 ret 2005e50: 91 e8 3f ff restore %g0, -1, %o0 #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005e54: 40 00 25 6e call 200f40c <__errno> 2005e58: b0 10 3f ff mov -1, %i0 2005e5c: 82 10 20 16 mov 0x16, %g1 2005e60: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005e64: 81 c7 e0 08 ret 2005e68: 81 e8 00 00 restore =============================================================================== 02005e6c : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2005e6c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005e70: 90 96 60 00 orcc %i1, 0, %o0 2005e74: 02 80 00 0b be 2005ea0 <== NEVER TAKEN 2005e78: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2005e7c: 80 a6 20 01 cmp %i0, 1 2005e80: 12 80 00 15 bne 2005ed4 2005e84: 80 a6 20 02 cmp %i0, 2 if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2005e88: c4 02 00 00 ld [ %o0 ], %g2 2005e8c: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2005e90: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2005e94: 80 a0 80 01 cmp %g2, %g1 2005e98: 38 80 00 06 bgu,a 2005eb0 2005e9c: 03 00 80 78 sethi %hi(0x201e000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005ea0: 40 00 25 5b call 200f40c <__errno> 2005ea4: 01 00 00 00 nop 2005ea8: 10 80 00 13 b 2005ef4 2005eac: 82 10 20 16 mov 0x16, %g1 ! 16 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2005eb0: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 2005eb4: 84 00 a0 01 inc %g2 2005eb8: c4 20 61 70 st %g2, [ %g1 + 0x170 ] _Thread_Disable_dispatch(); _TOD_Set( tp ); 2005ebc: 40 00 07 bd call 2007db0 <_TOD_Set> 2005ec0: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2005ec4: 40 00 0d b7 call 20095a0 <_Thread_Enable_dispatch> 2005ec8: 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; 2005ecc: 81 c7 e0 08 ret 2005ed0: 81 e8 00 00 restore _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME ) 2005ed4: 02 80 00 05 be 2005ee8 2005ed8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME ) 2005edc: 80 a6 20 03 cmp %i0, 3 2005ee0: 12 80 00 08 bne 2005f00 2005ee4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005ee8: 40 00 25 49 call 200f40c <__errno> 2005eec: 01 00 00 00 nop 2005ef0: 82 10 20 58 mov 0x58, %g1 ! 58 2005ef4: c2 22 00 00 st %g1, [ %o0 ] 2005ef8: 81 c7 e0 08 ret 2005efc: 91 e8 3f ff restore %g0, -1, %o0 #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2005f00: 40 00 25 43 call 200f40c <__errno> 2005f04: b0 10 3f ff mov -1, %i0 2005f08: 82 10 20 16 mov 0x16, %g1 2005f0c: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005f10: 81 c7 e0 08 ret 2005f14: 81 e8 00 00 restore =============================================================================== 02022010 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 2022010: 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() ) 2022014: 7f ff ff 3f call 2021d10 2022018: 01 00 00 00 nop 202201c: 80 a6 00 08 cmp %i0, %o0 2022020: 02 80 00 06 be 2022038 2022024: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2022028: 7f ff c6 22 call 20138b0 <__errno> 202202c: 01 00 00 00 nop 2022030: 10 80 00 a4 b 20222c0 2022034: 82 10 20 03 mov 3, %g1 ! 3 /* * Validate the signal passed. */ if ( !sig ) 2022038: 02 80 00 06 be 2022050 202203c: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2022040: ba 06 7f ff add %i1, -1, %i5 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2022044: 80 a7 60 1f cmp %i5, 0x1f 2022048: 28 80 00 06 bleu,a 2022060 202204c: 83 2e 60 02 sll %i1, 2, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2022050: 7f ff c6 18 call 20138b0 <__errno> 2022054: 01 00 00 00 nop 2022058: 10 80 00 9a b 20222c0 202205c: 82 10 20 16 mov 0x16, %g1 ! 16 /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 2022060: 85 2e 60 04 sll %i1, 4, %g2 2022064: 84 20 80 01 sub %g2, %g1, %g2 2022068: 03 00 80 98 sethi %hi(0x2026000), %g1 202206c: 82 10 61 d0 or %g1, 0x1d0, %g1 ! 20261d0 <_POSIX_signals_Vectors> 2022070: 82 00 40 02 add %g1, %g2, %g1 2022074: c2 00 60 08 ld [ %g1 + 8 ], %g1 2022078: 80 a0 60 01 cmp %g1, 1 202207c: 02 80 00 7a be 2022264 2022080: 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 ) ) 2022084: 80 a6 60 04 cmp %i1, 4 2022088: 02 80 00 06 be 20220a0 202208c: 80 a6 60 08 cmp %i1, 8 2022090: 02 80 00 04 be 20220a0 2022094: 80 a6 60 0b cmp %i1, 0xb 2022098: 12 80 00 08 bne 20220b8 202209c: 82 10 20 01 mov 1, %g1 return pthread_kill( pthread_self(), sig ); 20220a0: 40 00 01 2d call 2022554 20220a4: 01 00 00 00 nop 20220a8: 40 00 00 f1 call 202246c 20220ac: 92 10 00 19 mov %i1, %o1 20220b0: 81 c7 e0 08 ret 20220b4: 91 e8 00 08 restore %g0, %o0, %o0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 20220b8: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 20220bc: c2 27 bf f8 st %g1, [ %fp + -8 ] if ( !value ) { 20220c0: 80 a6 a0 00 cmp %i2, 0 20220c4: 12 80 00 04 bne 20220d4 20220c8: bb 28 40 1d sll %g1, %i5, %i5 siginfo->si_value.sival_int = 0; 20220cc: 10 80 00 04 b 20220dc 20220d0: c0 27 bf fc clr [ %fp + -4 ] } else { siginfo->si_value = *value; 20220d4: c2 06 80 00 ld [ %i2 ], %g1 20220d8: c2 27 bf fc st %g1, [ %fp + -4 ] 20220dc: 03 00 80 97 sethi %hi(0x2025c00), %g1 20220e0: c4 00 60 40 ld [ %g1 + 0x40 ], %g2 ! 2025c40 <_Thread_Dispatch_disable_level> 20220e4: 84 00 a0 01 inc %g2 20220e8: c4 20 60 40 st %g2, [ %g1 + 0x40 ] /* * 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; 20220ec: 03 00 80 98 sethi %hi(0x2026000), %g1 20220f0: d0 00 61 84 ld [ %g1 + 0x184 ], %o0 ! 2026184 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 20220f4: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 20220f8: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 20220fc: 80 af 40 01 andncc %i5, %g1, %g0 2022100: 12 80 00 51 bne 2022244 2022104: 03 00 80 98 sethi %hi(0x2026000), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2022108: d0 00 63 5c ld [ %g1 + 0x35c ], %o0 ! 202635c <_POSIX_signals_Wait_queue> /* 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 ); 202210c: 03 00 80 98 sethi %hi(0x2026000), %g1 2022110: 10 80 00 0a b 2022138 2022114: 82 10 63 60 or %g1, 0x360, %g1 ! 2026360 <_POSIX_signals_Wait_queue+0x4> #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 2022118: 80 8f 40 03 btst %i5, %g3 202211c: 12 80 00 4a bne 2022244 2022120: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 2022124: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 2022128: 80 af 40 02 andncc %i5, %g2, %g0 202212c: 12 80 00 47 bne 2022248 2022130: 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 ) { 2022134: 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 ); 2022138: 80 a2 00 01 cmp %o0, %g1 202213c: 32 bf ff f7 bne,a 2022118 2022140: c6 02 20 30 ld [ %o0 + 0x30 ], %g3 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 2022144: 03 00 80 93 sethi %hi(0x2024c00), %g1 2022148: c4 08 61 dc ldub [ %g1 + 0x1dc ], %g2 ! 2024ddc * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 202214c: 90 10 20 00 clr %o0 interested_priority = PRIORITY_MAXIMUM + 1; 2022150: 84 00 a0 01 inc %g2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 2022154: 88 10 20 02 mov 2, %g4 /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 2022158: 19 00 80 96 sethi %hi(0x2025800), %o4 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 202215c: 31 04 00 00 sethi %hi(0x10000000), %i0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2022160: 83 29 20 02 sll %g4, 2, %g1 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 ] ) 2022164: 86 13 23 a8 or %o4, 0x3a8, %g3 2022168: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 202216c: 80 a0 60 00 cmp %g1, 0 2022170: 22 80 00 2f be,a 202222c <== NEVER TAKEN 2022174: 88 01 20 01 inc %g4 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 2022178: c2 00 60 04 ld [ %g1 + 4 ], %g1 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 202217c: b4 10 20 01 mov 1, %i2 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 2022180: d4 10 60 10 lduh [ %g1 + 0x10 ], %o2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2022184: 10 80 00 26 b 202221c 2022188: d6 00 60 1c ld [ %g1 + 0x1c ], %o3 the_thread = (Thread_Control *) object_table[ index ]; 202218c: c2 02 c0 01 ld [ %o3 + %g1 ], %g1 if ( !the_thread ) 2022190: 80 a0 60 00 cmp %g1, 0 2022194: 22 80 00 22 be,a 202221c 2022198: b4 06 a0 01 inc %i2 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 202219c: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 20221a0: 80 a0 c0 02 cmp %g3, %g2 20221a4: 38 80 00 1e bgu,a 202221c 20221a8: b4 06 a0 01 inc %i2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 20221ac: de 00 61 5c ld [ %g1 + 0x15c ], %o7 20221b0: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 20221b4: 80 af 40 0f andncc %i5, %o7, %g0 20221b8: 22 80 00 19 be,a 202221c 20221bc: b4 06 a0 01 inc %i2 * * 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 ) { 20221c0: 80 a0 c0 02 cmp %g3, %g2 20221c4: 2a 80 00 14 bcs,a 2022214 20221c8: 84 10 00 03 mov %g3, %g2 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 20221cc: 80 a2 20 00 cmp %o0, 0 20221d0: 22 80 00 13 be,a 202221c <== NEVER TAKEN 20221d4: b4 06 a0 01 inc %i2 <== NOT EXECUTED 20221d8: da 02 20 10 ld [ %o0 + 0x10 ], %o5 20221dc: 80 a3 60 00 cmp %o5, 0 20221e0: 22 80 00 0f be,a 202221c <== NEVER TAKEN 20221e4: b4 06 a0 01 inc %i2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 20221e8: de 00 60 10 ld [ %g1 + 0x10 ], %o7 20221ec: 80 a3 e0 00 cmp %o7, 0 20221f0: 22 80 00 09 be,a 2022214 20221f4: 84 10 00 03 mov %g3, %g2 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 20221f8: 80 8b 40 18 btst %o5, %i0 20221fc: 32 80 00 08 bne,a 202221c 2022200: b4 06 a0 01 inc %i2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 2022204: 80 8b c0 18 btst %o7, %i0 2022208: 22 80 00 05 be,a 202221c 202220c: b4 06 a0 01 inc %i2 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 2022210: 84 10 00 03 mov %g3, %g2 2022214: 90 10 00 01 mov %g1, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2022218: b4 06 a0 01 inc %i2 202221c: 80 a6 80 0a cmp %i2, %o2 2022220: 08 bf ff db bleu 202218c 2022224: 83 2e a0 02 sll %i2, 2, %g1 * + 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++) { 2022228: 88 01 20 01 inc %g4 202222c: 80 a1 20 04 cmp %g4, 4 2022230: 12 bf ff cd bne 2022164 2022234: 83 29 20 02 sll %g4, 2, %g1 } } } } if ( interested ) { 2022238: 80 a2 20 00 cmp %o0, 0 202223c: 02 80 00 0c be 202226c 2022240: 01 00 00 00 nop /* * 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 ) ) { 2022244: 92 10 00 19 mov %i1, %o1 2022248: 40 00 00 36 call 2022320 <_POSIX_signals_Unblock_thread> 202224c: 94 07 bf f4 add %fp, -12, %o2 2022250: 80 8a 20 ff btst 0xff, %o0 2022254: 02 80 00 06 be 202226c 2022258: 01 00 00 00 nop _Thread_Enable_dispatch(); 202225c: 7f ff ae 6f call 200dc18 <_Thread_Enable_dispatch> 2022260: b0 10 20 00 clr %i0 ! 0 return 0; 2022264: 81 c7 e0 08 ret 2022268: 81 e8 00 00 restore /* * 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 ); 202226c: 40 00 00 24 call 20222fc <_POSIX_signals_Set_process_signals> 2022270: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 2022274: 83 2e 60 02 sll %i1, 2, %g1 2022278: b3 2e 60 04 sll %i1, 4, %i1 202227c: b2 26 40 01 sub %i1, %g1, %i1 2022280: 03 00 80 98 sethi %hi(0x2026000), %g1 2022284: 82 10 61 d0 or %g1, 0x1d0, %g1 ! 20261d0 <_POSIX_signals_Vectors> 2022288: c2 00 40 19 ld [ %g1 + %i1 ], %g1 202228c: 80 a0 60 02 cmp %g1, 2 2022290: 12 80 00 17 bne 20222ec 2022294: 11 00 80 98 sethi %hi(0x2026000), %o0 psiginfo = (POSIX_signals_Siginfo_node *) 2022298: 7f ff a7 2f call 200bf54 <_Chain_Get> 202229c: 90 12 23 50 or %o0, 0x350, %o0 ! 2026350 <_POSIX_signals_Inactive_siginfo> _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 20222a0: ba 92 20 00 orcc %o0, 0, %i5 20222a4: 12 80 00 0a bne 20222cc 20222a8: 92 07 bf f4 add %fp, -12, %o1 _Thread_Enable_dispatch(); 20222ac: 7f ff ae 5b call 200dc18 <_Thread_Enable_dispatch> 20222b0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 20222b4: 7f ff c5 7f call 20138b0 <__errno> 20222b8: 01 00 00 00 nop 20222bc: 82 10 20 0b mov 0xb, %g1 ! b 20222c0: c2 22 00 00 st %g1, [ %o0 ] 20222c4: 81 c7 e0 08 ret 20222c8: 91 e8 3f ff restore %g0, -1, %o0 } psiginfo->Info = *siginfo; 20222cc: 90 07 60 08 add %i5, 8, %o0 20222d0: 7f ff c7 b3 call 201419c 20222d4: 94 10 20 0c mov 0xc, %o2 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 20222d8: 11 00 80 98 sethi %hi(0x2026000), %o0 20222dc: 92 10 00 1d mov %i5, %o1 20222e0: 90 12 23 c8 or %o0, 0x3c8, %o0 20222e4: 7f ff a7 08 call 200bf04 <_Chain_Append> 20222e8: 90 02 00 19 add %o0, %i1, %o0 } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 20222ec: 7f ff ae 4b call 200dc18 <_Thread_Enable_dispatch> 20222f0: b0 10 20 00 clr %i0 return 0; } 20222f4: 81 c7 e0 08 ret 20222f8: 81 e8 00 00 restore =============================================================================== 0200b448 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b448: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b44c: 80 a0 60 00 cmp %g1, 0 200b450: 02 80 00 0f be 200b48c 200b454: 90 10 20 16 mov 0x16, %o0 200b458: c4 00 40 00 ld [ %g1 ], %g2 200b45c: 80 a0 a0 00 cmp %g2, 0 200b460: 02 80 00 0b be 200b48c 200b464: 80 a2 60 04 cmp %o1, 4 return EINVAL; switch ( policy ) { 200b468: 18 80 00 09 bgu 200b48c 200b46c: 90 10 20 86 mov 0x86, %o0 200b470: 84 10 20 01 mov 1, %g2 200b474: 85 28 80 09 sll %g2, %o1, %g2 200b478: 80 88 a0 17 btst 0x17, %g2 200b47c: 02 80 00 04 be 200b48c <== NEVER TAKEN 200b480: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b484: d2 20 60 14 st %o1, [ %g1 + 0x14 ] 200b488: 90 10 20 00 clr %o0 return 0; default: return ENOTSUP; } } 200b48c: 81 c3 e0 08 retl =============================================================================== 020063b8 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 20063b8: 9d e3 bf 90 save %sp, -112, %sp 20063bc: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 20063c0: 80 a7 60 00 cmp %i5, 0 20063c4: 02 80 00 1f be 2006440 20063c8: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 20063cc: 80 a6 a0 00 cmp %i2, 0 20063d0: 02 80 00 1c be 2006440 20063d4: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20063d8: 32 80 00 06 bne,a 20063f0 20063dc: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 20063e0: 90 07 bf f8 add %fp, -8, %o0 20063e4: 7f ff ff bd call 20062d8 20063e8: 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 ) 20063ec: c2 06 40 00 ld [ %i1 ], %g1 20063f0: 80 a0 60 00 cmp %g1, 0 20063f4: 02 80 00 13 be 2006440 20063f8: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20063fc: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006400: 80 a0 60 00 cmp %g1, 0 2006404: 12 80 00 0f bne 2006440 <== NEVER TAKEN 2006408: 03 00 80 5c sethi %hi(0x2017000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200640c: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 2017210 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006410: c0 27 bf f0 clr [ %fp + -16 ] the_attributes.maximum_count = count; 2006414: f4 27 bf f4 st %i2, [ %fp + -12 ] 2006418: 84 00 a0 01 inc %g2 200641c: c4 20 62 10 st %g2, [ %g1 + 0x210 ] * 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 *) 2006420: 37 00 80 5d sethi %hi(0x2017400), %i3 2006424: 40 00 08 4e call 200855c <_Objects_Allocate> 2006428: 90 16 e1 d0 or %i3, 0x1d0, %o0 ! 20175d0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 200642c: b8 92 20 00 orcc %o0, 0, %i4 2006430: 12 80 00 06 bne 2006448 2006434: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 2006438: 40 00 0c dc call 20097a8 <_Thread_Enable_dispatch> 200643c: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006440: 81 c7 e0 08 ret 2006444: 81 e8 00 00 restore } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2006448: 40 00 05 b9 call 2007b2c <_CORE_barrier_Initialize> 200644c: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006450: 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; } 2006454: b6 16 e1 d0 or %i3, 0x1d0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006458: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200645c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006460: 85 28 a0 02 sll %g2, 2, %g2 2006464: 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; 2006468: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 200646c: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006470: 40 00 0c ce call 20097a8 <_Thread_Enable_dispatch> 2006474: b0 10 20 00 clr %i0 return 0; } 2006478: 81 c7 e0 08 ret 200647c: 81 e8 00 00 restore =============================================================================== 02005bf4 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2005bf4: 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 ) 2005bf8: 80 a6 20 00 cmp %i0, 0 2005bfc: 02 80 00 14 be 2005c4c 2005c00: 01 00 00 00 nop rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2005c04: 03 00 80 5d sethi %hi(0x2017400), %g1 2005c08: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 2017630 <_Thread_Dispatch_disable_level> 2005c0c: 84 00 a0 01 inc %g2 2005c10: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2005c14: 40 00 11 9c call 200a284 <_Workspace_Allocate> 2005c18: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2005c1c: 92 92 20 00 orcc %o0, 0, %o1 2005c20: 02 80 00 09 be 2005c44 <== NEVER TAKEN 2005c24: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2005c28: 03 00 80 5e sethi %hi(0x2017800), %g1 2005c2c: c2 00 63 74 ld [ %g1 + 0x374 ], %g1 ! 2017b74 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; 2005c30: d0 00 61 5c ld [ %g1 + 0x15c ], %o0 handler->routine = routine; 2005c34: f0 22 60 08 st %i0, [ %o1 + 8 ] handler->arg = arg; 2005c38: f2 22 60 0c st %i1, [ %o1 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2005c3c: 40 00 05 ef call 20073f8 <_Chain_Append> 2005c40: 90 02 20 e4 add %o0, 0xe4, %o0 } _Thread_Enable_dispatch(); 2005c44: 40 00 0d 02 call 200904c <_Thread_Enable_dispatch> 2005c48: 81 e8 00 00 restore 2005c4c: 81 c7 e0 08 ret 2005c50: 81 e8 00 00 restore =============================================================================== 02006c08 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2006c08: 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; 2006c0c: 80 a6 60 00 cmp %i1, 0 2006c10: 12 80 00 04 bne 2006c20 2006c14: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; 2006c18: 33 00 80 5a sethi %hi(0x2016800), %i1 2006c1c: b2 16 63 0c or %i1, 0x30c, %i1 ! 2016b0c <_POSIX_Condition_variables_Default_attributes> /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2006c20: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006c24: 80 a0 60 01 cmp %g1, 1 2006c28: 02 80 00 11 be 2006c6c <== NEVER TAKEN 2006c2c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2006c30: c2 06 40 00 ld [ %i1 ], %g1 2006c34: 80 a0 60 00 cmp %g1, 0 2006c38: 02 80 00 0d be 2006c6c 2006c3c: 03 00 80 60 sethi %hi(0x2018000), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2006c40: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 2018340 <_Thread_Dispatch_disable_level> 2006c44: 84 00 a0 01 inc %g2 2006c48: c4 20 63 40 st %g2, [ %g1 + 0x340 ] */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2006c4c: 37 00 80 61 sethi %hi(0x2018400), %i3 2006c50: 40 00 09 ad call 2009304 <_Objects_Allocate> 2006c54: 90 16 e3 98 or %i3, 0x398, %o0 ! 2018798 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2006c58: b8 92 20 00 orcc %o0, 0, %i4 2006c5c: 32 80 00 06 bne,a 2006c74 2006c60: c2 06 60 04 ld [ %i1 + 4 ], %g1 _Thread_Enable_dispatch(); 2006c64: 40 00 0e 3b call 200a550 <_Thread_Enable_dispatch> 2006c68: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2006c6c: 81 c7 e0 08 ret 2006c70: 81 e8 00 00 restore the_cond->process_shared = the_attr->process_shared; the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006c74: 90 07 20 18 add %i4, 0x18, %o0 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2006c78: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006c7c: 92 10 20 00 clr %o1 2006c80: 15 04 00 02 sethi %hi(0x10000800), %o2 2006c84: 96 10 20 74 mov 0x74, %o3 2006c88: 40 00 10 2b call 200ad34 <_Thread_queue_Initialize> 2006c8c: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006c90: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2006c94: b6 16 e3 98 or %i3, 0x398, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006c98: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006c9c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006ca0: 85 28 a0 02 sll %g2, 2, %g2 2006ca4: 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; 2006ca8: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2006cac: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006cb0: 40 00 0e 28 call 200a550 <_Thread_Enable_dispatch> 2006cb4: b0 10 20 00 clr %i0 return 0; } 2006cb8: 81 c7 e0 08 ret 2006cbc: 81 e8 00 00 restore =============================================================================== 02006a74 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006a74: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006a78: 80 a0 60 00 cmp %g1, 0 2006a7c: 02 80 00 08 be 2006a9c 2006a80: 90 10 20 16 mov 0x16, %o0 2006a84: c4 00 40 00 ld [ %g1 ], %g2 2006a88: 80 a0 a0 00 cmp %g2, 0 2006a8c: 02 80 00 04 be 2006a9c <== NEVER TAKEN 2006a90: 01 00 00 00 nop return EINVAL; attr->is_initialized = false; 2006a94: c0 20 40 00 clr [ %g1 ] return 0; 2006a98: 90 10 20 00 clr %o0 } 2006a9c: 81 c3 e0 08 retl =============================================================================== 0200608c : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 200608c: 9d e3 bf 58 save %sp, -168, %sp 2006090: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2006094: 80 a6 a0 00 cmp %i2, 0 2006098: 02 80 00 66 be 2006230 200609c: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20060a0: 80 a6 60 00 cmp %i1, 0 20060a4: 32 80 00 05 bne,a 20060b8 20060a8: c2 06 40 00 ld [ %i1 ], %g1 20060ac: 33 00 80 6d sethi %hi(0x201b400), %i1 20060b0: b2 16 63 44 or %i1, 0x344, %i1 ! 201b744 <_POSIX_Threads_Default_attributes> if ( !the_attr->is_initialized ) 20060b4: c2 06 40 00 ld [ %i1 ], %g1 20060b8: 80 a0 60 00 cmp %g1, 0 20060bc: 02 80 00 5d be 2006230 20060c0: 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) ) 20060c4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20060c8: 80 a0 60 00 cmp %g1, 0 20060cc: 02 80 00 07 be 20060e8 20060d0: 03 00 80 71 sethi %hi(0x201c400), %g1 20060d4: c4 06 60 08 ld [ %i1 + 8 ], %g2 20060d8: c2 00 60 80 ld [ %g1 + 0x80 ], %g1 20060dc: 80 a0 80 01 cmp %g2, %g1 20060e0: 0a 80 00 79 bcs 20062c4 20060e4: 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 ) { 20060e8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20060ec: 80 a0 60 01 cmp %g1, 1 20060f0: 02 80 00 06 be 2006108 20060f4: 80 a0 60 02 cmp %g1, 2 20060f8: 12 80 00 4e bne 2006230 20060fc: b0 10 20 16 mov 0x16, %i0 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006100: 10 80 00 09 b 2006124 2006104: e0 06 60 14 ld [ %i1 + 0x14 ], %l0 * 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 ]; 2006108: 03 00 80 75 sethi %hi(0x201d400), %g1 200610c: c2 00 62 a4 ld [ %g1 + 0x2a4 ], %g1 ! 201d6a4 <_Per_CPU_Information+0xc> schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006110: 90 07 bf dc add %fp, -36, %o0 * 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 ]; 2006114: d2 00 61 5c ld [ %g1 + 0x15c ], %o1 schedpolicy = api->schedpolicy; 2006118: e0 02 60 84 ld [ %o1 + 0x84 ], %l0 schedparam = api->schedparam; 200611c: 10 80 00 04 b 200612c 2006120: 92 02 60 88 add %o1, 0x88, %o1 break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2006124: 90 07 bf dc add %fp, -36, %o0 2006128: 92 06 60 18 add %i1, 0x18, %o1 200612c: 40 00 25 e1 call 200f8b0 2006130: 94 10 20 1c mov 0x1c, %o2 /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 2006134: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2006138: 80 a0 60 00 cmp %g1, 0 200613c: 12 80 00 3d bne 2006230 2006140: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2006144: d0 07 bf dc ld [ %fp + -36 ], %o0 2006148: 40 00 19 89 call 200c76c <_POSIX_Priority_Is_valid> 200614c: b0 10 20 16 mov 0x16, %i0 2006150: 80 8a 20 ff btst 0xff, %o0 2006154: 02 80 00 37 be 2006230 <== NEVER TAKEN 2006158: 03 00 80 71 sethi %hi(0x201c400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 200615c: 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); 2006160: e2 08 60 7c ldub [ %g1 + 0x7c ], %l1 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2006164: 90 10 00 10 mov %l0, %o0 2006168: 92 07 bf dc add %fp, -36, %o1 200616c: 94 07 bf f8 add %fp, -8, %o2 2006170: 40 00 19 8a call 200c798 <_POSIX_Thread_Translate_sched_param> 2006174: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2006178: b0 92 20 00 orcc %o0, 0, %i0 200617c: 12 80 00 2d bne 2006230 2006180: 27 00 80 74 sethi %hi(0x201d000), %l3 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2006184: 40 00 05 f8 call 2007964 <_API_Mutex_Lock> 2006188: d0 04 e2 04 ld [ %l3 + 0x204 ], %o0 ! 201d204 <_RTEMS_Allocator_Mutex> * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 200618c: 11 00 80 74 sethi %hi(0x201d000), %o0 2006190: 40 00 08 97 call 20083ec <_Objects_Allocate> 2006194: 90 12 23 a0 or %o0, 0x3a0, %o0 ! 201d3a0 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2006198: b8 92 20 00 orcc %o0, 0, %i4 200619c: 32 80 00 04 bne,a 20061ac 20061a0: c2 06 60 08 ld [ %i1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 20061a4: 10 80 00 21 b 2006228 20061a8: d0 04 e2 04 ld [ %l3 + 0x204 ], %o0 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 20061ac: 05 00 80 71 sethi %hi(0x201c400), %g2 20061b0: d6 00 a0 80 ld [ %g2 + 0x80 ], %o3 ! 201c480 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20061b4: 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 ) 20061b8: 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( 20061bc: 80 a2 c0 01 cmp %o3, %g1 20061c0: 1a 80 00 03 bcc 20061cc 20061c4: d4 06 60 04 ld [ %i1 + 4 ], %o2 20061c8: 96 10 00 01 mov %g1, %o3 20061cc: 82 10 20 01 mov 1, %g1 20061d0: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20061d4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20061d8: 9a 0c 60 ff and %l1, 0xff, %o5 20061dc: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 20061e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20061e4: c0 23 a0 68 clr [ %sp + 0x68 ] 20061e8: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 20061ec: 82 07 bf d4 add %fp, -44, %g1 20061f0: 23 00 80 74 sethi %hi(0x201d000), %l1 20061f4: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20061f8: 90 14 63 a0 or %l1, 0x3a0, %o0 20061fc: 92 10 00 1c mov %i4, %o1 2006200: 98 10 20 01 mov 1, %o4 2006204: 40 00 0d 44 call 2009714 <_Thread_Initialize> 2006208: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 200620c: 80 8a 20 ff btst 0xff, %o0 2006210: 12 80 00 0a bne 2006238 2006214: 90 14 63 a0 or %l1, 0x3a0, %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 2006218: 40 00 09 4e call 2008750 <_Objects_Free> 200621c: 92 10 00 1c mov %i4, %o1 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006220: 03 00 80 74 sethi %hi(0x201d000), %g1 2006224: d0 00 62 04 ld [ %g1 + 0x204 ], %o0 ! 201d204 <_RTEMS_Allocator_Mutex> 2006228: 40 00 05 e4 call 20079b8 <_API_Mutex_Unlock> 200622c: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006230: 81 c7 e0 08 ret 2006234: 81 e8 00 00 restore } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2006238: e2 07 21 5c ld [ %i4 + 0x15c ], %l1 api->Attributes = *the_attr; 200623c: 92 10 00 19 mov %i1, %o1 2006240: 94 10 20 40 mov 0x40, %o2 2006244: 40 00 25 9b call 200f8b0 2006248: 90 10 00 11 mov %l1, %o0 api->detachstate = the_attr->detachstate; 200624c: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006250: 92 07 bf dc add %fp, -36, %o1 * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; 2006254: c2 24 60 40 st %g1, [ %l1 + 0x40 ] api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006258: 94 10 20 1c mov 0x1c, %o2 */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; api->schedpolicy = schedpolicy; 200625c: e0 24 60 84 st %l0, [ %l1 + 0x84 ] api->schedparam = schedparam; 2006260: 40 00 25 94 call 200f8b0 2006264: 90 04 60 88 add %l1, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 2006268: 90 10 00 1c mov %i4, %o0 200626c: 92 10 20 01 mov 1, %o1 2006270: 94 10 00 1a mov %i2, %o2 2006274: 96 10 00 1b mov %i3, %o3 2006278: 40 00 0f 78 call 200a058 <_Thread_Start> 200627c: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2006280: 80 a4 20 04 cmp %l0, 4 2006284: 32 80 00 0a bne,a 20062ac 2006288: c2 07 20 08 ld [ %i4 + 8 ], %g1 _Watchdog_Insert_ticks( 200628c: 40 00 0f f1 call 200a250 <_Timespec_To_ticks> 2006290: 90 04 60 90 add %l1, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006294: 92 04 60 a8 add %l1, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2006298: d0 24 60 b4 st %o0, [ %l1 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200629c: 11 00 80 74 sethi %hi(0x201d000), %o0 20062a0: 40 00 10 c4 call 200a5b0 <_Watchdog_Insert> 20062a4: 90 12 22 24 or %o0, 0x224, %o0 ! 201d224 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20062a8: c2 07 20 08 ld [ %i4 + 8 ], %g1 20062ac: c2 27 40 00 st %g1, [ %i5 ] _RTEMS_Unlock_allocator(); 20062b0: 03 00 80 74 sethi %hi(0x201d000), %g1 20062b4: 40 00 05 c1 call 20079b8 <_API_Mutex_Unlock> 20062b8: d0 00 62 04 ld [ %g1 + 0x204 ], %o0 ! 201d204 <_RTEMS_Allocator_Mutex> return 0; 20062bc: 81 c7 e0 08 ret 20062c0: 81 e8 00 00 restore } 20062c4: 81 c7 e0 08 ret 20062c8: 81 e8 00 00 restore =============================================================================== 0202246c : int pthread_kill( pthread_t thread, int sig ) { 202246c: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 2022470: 80 a6 60 00 cmp %i1, 0 2022474: 02 80 00 06 be 202248c 2022478: 90 10 00 18 mov %i0, %o0 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 202247c: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2022480: 80 a6 e0 1f cmp %i3, 0x1f 2022484: 08 80 00 08 bleu 20224a4 2022488: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); 202248c: 7f ff c5 09 call 20138b0 <__errno> 2022490: b0 10 3f ff mov -1, %i0 ! ffffffff 2022494: 82 10 20 16 mov 0x16, %g1 2022498: c2 22 00 00 st %g1, [ %o0 ] 202249c: 81 c7 e0 08 ret 20224a0: 81 e8 00 00 restore the_thread = _Thread_Get( thread, &location ); 20224a4: 7f ff ad e9 call 200dc48 <_Thread_Get> 20224a8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20224ac: c2 07 bf fc ld [ %fp + -4 ], %g1 20224b0: 80 a0 60 00 cmp %g1, 0 20224b4: 12 80 00 22 bne 202253c <== NEVER TAKEN 20224b8: b8 10 00 08 mov %o0, %i4 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 20224bc: 85 2e 60 02 sll %i1, 2, %g2 20224c0: 87 2e 60 04 sll %i1, 4, %g3 20224c4: 86 20 c0 02 sub %g3, %g2, %g3 20224c8: 05 00 80 98 sethi %hi(0x2026000), %g2 20224cc: 84 10 a1 d0 or %g2, 0x1d0, %g2 ! 20261d0 <_POSIX_signals_Vectors> 20224d0: 84 00 80 03 add %g2, %g3, %g2 20224d4: c4 00 a0 08 ld [ %g2 + 8 ], %g2 20224d8: 80 a0 a0 01 cmp %g2, 1 20224dc: 02 80 00 14 be 202252c 20224e0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20224e4: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20224e8: ba 10 20 01 mov 1, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20224ec: 92 10 00 19 mov %i1, %o1 20224f0: b7 2f 40 1b sll %i5, %i3, %i3 20224f4: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20224f8: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20224fc: 7f ff ff 89 call 2022320 <_POSIX_signals_Unblock_thread> 2022500: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2022504: 03 00 80 98 sethi %hi(0x2026000), %g1 2022508: 82 10 61 78 or %g1, 0x178, %g1 ! 2026178 <_Per_CPU_Information> 202250c: c4 00 60 08 ld [ %g1 + 8 ], %g2 2022510: 80 a0 a0 00 cmp %g2, 0 2022514: 02 80 00 06 be 202252c 2022518: 01 00 00 00 nop 202251c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2022520: 80 a7 00 02 cmp %i4, %g2 2022524: 22 80 00 02 be,a 202252c 2022528: fa 28 60 18 stb %i5, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 202252c: 7f ff ad bb call 200dc18 <_Thread_Enable_dispatch> 2022530: b0 10 20 00 clr %i0 return 0; 2022534: 81 c7 e0 08 ret 2022538: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 202253c: 7f ff c4 dd call 20138b0 <__errno> <== NOT EXECUTED 2022540: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2022544: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 2022548: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 202254c: 81 c7 e0 08 ret <== NOT EXECUTED 2022550: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008170 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2008170: 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 ); 2008174: 92 07 bf fc add %fp, -4, %o1 2008178: 40 00 00 37 call 2008254 <_POSIX_Absolute_timeout_to_ticks> 200817c: 90 10 00 19 mov %i1, %o0 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008180: d4 07 bf fc ld [ %fp + -4 ], %o2 int _EXFUN(pthread_mutex_trylock, (pthread_mutex_t *__mutex)); int _EXFUN(pthread_mutex_unlock, (pthread_mutex_t *__mutex)); #if defined(_POSIX_TIMEOUTS) int _EXFUN(pthread_mutex_timedlock, 2008184: 82 1a 20 03 xor %o0, 3, %g1 2008188: 80 a0 00 01 cmp %g0, %g1 * * 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 ); 200818c: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008190: b8 60 3f ff subx %g0, -1, %i4 2008194: 90 10 00 18 mov %i0, %o0 2008198: 7f ff ff bd call 200808c <_POSIX_Mutex_Lock_support> 200819c: 92 10 00 1c mov %i4, %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) ) { 20081a0: 80 a7 20 00 cmp %i4, 0 20081a4: 12 80 00 0d bne 20081d8 20081a8: b0 10 00 08 mov %o0, %i0 20081ac: 80 a2 20 10 cmp %o0, 0x10 20081b0: 12 80 00 0a bne 20081d8 <== NEVER TAKEN 20081b4: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20081b8: 02 80 00 07 be 20081d4 <== NEVER TAKEN 20081bc: ba 07 7f ff add %i5, -1, %i5 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20081c0: 80 a7 60 01 cmp %i5, 1 20081c4: 18 80 00 05 bgu 20081d8 <== NEVER TAKEN 20081c8: 01 00 00 00 nop status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 20081cc: 81 c7 e0 08 ret 20081d0: 91 e8 20 74 restore %g0, 0x74, %o0 20081d4: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED } return lock_status; } 20081d8: 81 c7 e0 08 ret 20081dc: 81 e8 00 00 restore =============================================================================== 02005954 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005954: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2005958: 80 a0 60 00 cmp %g1, 0 200595c: 02 80 00 0b be 2005988 2005960: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005964: c4 00 40 00 ld [ %g1 ], %g2 2005968: 80 a0 a0 00 cmp %g2, 0 200596c: 02 80 00 07 be 2005988 2005970: 80 a2 60 00 cmp %o1, 0 return EINVAL; if ( !type ) 2005974: 02 80 00 05 be 2005988 <== NEVER TAKEN 2005978: 01 00 00 00 nop return EINVAL; *type = attr->type; 200597c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2005980: 90 10 20 00 clr %o0 return EINVAL; if ( !type ) return EINVAL; *type = attr->type; 2005984: c2 22 40 00 st %g1, [ %o1 ] return 0; } 2005988: 81 c3 e0 08 retl =============================================================================== 02007d64 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2007d64: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007d68: 80 a0 60 00 cmp %g1, 0 2007d6c: 02 80 00 0a be 2007d94 2007d70: 90 10 20 16 mov 0x16, %o0 2007d74: c4 00 40 00 ld [ %g1 ], %g2 2007d78: 80 a0 a0 00 cmp %g2, 0 2007d7c: 02 80 00 06 be 2007d94 2007d80: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007d84: 18 80 00 04 bgu 2007d94 <== NEVER TAKEN 2007d88: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007d8c: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007d90: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007d94: 81 c3 e0 08 retl =============================================================================== 020059c0 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 20059c0: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20059c4: 80 a0 60 00 cmp %g1, 0 20059c8: 02 80 00 0a be 20059f0 20059cc: 90 10 20 16 mov 0x16, %o0 20059d0: c4 00 40 00 ld [ %g1 ], %g2 20059d4: 80 a0 a0 00 cmp %g2, 0 20059d8: 02 80 00 06 be 20059f0 <== NEVER TAKEN 20059dc: 80 a2 60 03 cmp %o1, 3 return EINVAL; switch ( type ) { 20059e0: 18 80 00 04 bgu 20059f0 20059e4: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 20059e8: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; 20059ec: 90 10 20 00 clr %o0 default: return EINVAL; } } 20059f0: 81 c3 e0 08 retl =============================================================================== 0200669c : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 200669c: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 20066a0: 80 a6 60 00 cmp %i1, 0 20066a4: 02 80 00 1c be 2006714 20066a8: ba 10 00 18 mov %i0, %i5 20066ac: 80 a6 20 00 cmp %i0, 0 20066b0: 22 80 00 17 be,a 200670c 20066b4: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 20066b8: c2 06 20 04 ld [ %i0 + 4 ], %g1 20066bc: 80 a0 60 00 cmp %g1, 0 20066c0: 12 80 00 13 bne 200670c 20066c4: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20066c8: 90 10 21 00 mov 0x100, %o0 20066cc: 92 10 21 00 mov 0x100, %o1 20066d0: 40 00 03 00 call 20072d0 20066d4: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 20066d8: c2 07 60 04 ld [ %i5 + 4 ], %g1 20066dc: 80 a0 60 00 cmp %g1, 0 20066e0: 12 80 00 07 bne 20066fc <== NEVER TAKEN 20066e4: d0 07 bf fc ld [ %fp + -4 ], %o0 once_control->is_initialized = true; 20066e8: 82 10 20 01 mov 1, %g1 20066ec: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 20066f0: 9f c6 40 00 call %i1 20066f4: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20066f8: d0 07 bf fc ld [ %fp + -4 ], %o0 20066fc: 92 10 21 00 mov 0x100, %o1 2006700: 94 07 bf fc add %fp, -4, %o2 2006704: 40 00 02 f3 call 20072d0 2006708: b0 10 20 00 clr %i0 200670c: 81 c7 e0 08 ret 2006710: 81 e8 00 00 restore pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) return EINVAL; 2006714: b0 10 20 16 mov 0x16, %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006718: 81 c7 e0 08 ret 200671c: 81 e8 00 00 restore =============================================================================== 02007074 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 2007074: 9d e3 bf 90 save %sp, -112, %sp 2007078: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 200707c: 80 a7 60 00 cmp %i5, 0 2007080: 02 80 00 1c be 20070f0 2007084: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007088: 80 a6 60 00 cmp %i1, 0 200708c: 32 80 00 06 bne,a 20070a4 2007090: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 2007094: 90 07 bf f4 add %fp, -12, %o0 2007098: 40 00 02 6b call 2007a44 200709c: 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 ) 20070a0: c2 06 40 00 ld [ %i1 ], %g1 20070a4: 80 a0 60 00 cmp %g1, 0 20070a8: 02 80 00 12 be 20070f0 <== NEVER TAKEN 20070ac: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20070b0: c2 06 60 04 ld [ %i1 + 4 ], %g1 20070b4: 80 a0 60 00 cmp %g1, 0 20070b8: 12 80 00 0e bne 20070f0 <== NEVER TAKEN 20070bc: 03 00 80 66 sethi %hi(0x2019800), %g1 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 20070c0: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 ! 20198a0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20070c4: c0 27 bf fc clr [ %fp + -4 ] 20070c8: 84 00 a0 01 inc %g2 20070cc: c4 20 60 a0 st %g2, [ %g1 + 0xa0 ] * 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 *) 20070d0: 37 00 80 66 sethi %hi(0x2019800), %i3 20070d4: 40 00 09 d7 call 2009830 <_Objects_Allocate> 20070d8: 90 16 e2 a0 or %i3, 0x2a0, %o0 ! 2019aa0 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 20070dc: b8 92 20 00 orcc %o0, 0, %i4 20070e0: 12 80 00 06 bne 20070f8 20070e4: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 20070e8: 40 00 0e 65 call 200aa7c <_Thread_Enable_dispatch> 20070ec: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20070f0: 81 c7 e0 08 ret 20070f4: 81 e8 00 00 restore } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 20070f8: 40 00 07 7e call 2008ef0 <_CORE_RWLock_Initialize> 20070fc: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007100: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 2007104: b6 16 e2 a0 or %i3, 0x2a0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007108: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200710c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007110: 85 28 a0 02 sll %g2, 2, %g2 2007114: 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; 2007118: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 200711c: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007120: 40 00 0e 57 call 200aa7c <_Thread_Enable_dispatch> 2007124: b0 10 20 00 clr %i0 return 0; } 2007128: 81 c7 e0 08 ret 200712c: 81 e8 00 00 restore =============================================================================== 020071a0 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20071a0: 9d e3 bf 98 save %sp, -104, %sp Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) return EINVAL; 20071a4: ba 10 20 16 mov 0x16, %i5 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 20071a8: 80 a6 20 00 cmp %i0, 0 20071ac: 02 80 00 2b be 2007258 20071b0: 90 10 00 19 mov %i1, %o0 * * 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 ); 20071b4: 40 00 1a 50 call 200daf4 <_POSIX_Absolute_timeout_to_ticks> 20071b8: 92 07 bf fc add %fp, -4, %o1 20071bc: d2 06 00 00 ld [ %i0 ], %o1 20071c0: b8 10 00 08 mov %o0, %i4 20071c4: 94 07 bf f8 add %fp, -8, %o2 20071c8: 11 00 80 66 sethi %hi(0x2019800), %o0 20071cc: 40 00 0a d4 call 2009d1c <_Objects_Get> 20071d0: 90 12 22 a0 or %o0, 0x2a0, %o0 ! 2019aa0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20071d4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20071d8: 80 a0 60 00 cmp %g1, 0 20071dc: 12 80 00 1f bne 2007258 20071e0: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 20071e4: 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, 20071e8: 82 1f 20 03 xor %i4, 3, %g1 20071ec: 90 02 20 10 add %o0, 0x10, %o0 20071f0: 80 a0 00 01 cmp %g0, %g1 20071f4: 98 10 20 00 clr %o4 20071f8: b6 60 3f ff subx %g0, -1, %i3 20071fc: 40 00 07 47 call 2008f18 <_CORE_RWLock_Obtain_for_reading> 2007200: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2007204: 40 00 0e 1e call 200aa7c <_Thread_Enable_dispatch> 2007208: 01 00 00 00 nop if ( !do_wait ) { 200720c: 80 a6 e0 00 cmp %i3, 0 2007210: 12 80 00 0d bne 2007244 2007214: 03 00 80 67 sethi %hi(0x2019c00), %g1 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007218: c2 00 61 e4 ld [ %g1 + 0x1e4 ], %g1 ! 2019de4 <_Per_CPU_Information+0xc> 200721c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007220: 80 a0 60 02 cmp %g1, 2 2007224: 32 80 00 09 bne,a 2007248 2007228: 03 00 80 67 sethi %hi(0x2019c00), %g1 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 200722c: 80 a7 20 00 cmp %i4, 0 2007230: 02 80 00 0a be 2007258 <== NEVER TAKEN 2007234: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007238: 80 a7 20 01 cmp %i4, 1 200723c: 08 80 00 07 bleu 2007258 <== ALWAYS TAKEN 2007240: ba 10 20 74 mov 0x74, %i5 return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 2007244: 03 00 80 67 sethi %hi(0x2019c00), %g1 2007248: c2 00 61 e4 ld [ %g1 + 0x1e4 ], %g1 ! 2019de4 <_Per_CPU_Information+0xc> status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 200724c: 40 00 00 35 call 2007320 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007250: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007254: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007258: 81 c7 e0 08 ret 200725c: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007260 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007260: 9d e3 bf 98 save %sp, -104, %sp Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) return EINVAL; 2007264: ba 10 20 16 mov 0x16, %i5 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 2007268: 80 a6 20 00 cmp %i0, 0 200726c: 02 80 00 2b be 2007318 2007270: 90 10 00 19 mov %i1, %o0 * * 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 ); 2007274: 40 00 1a 20 call 200daf4 <_POSIX_Absolute_timeout_to_ticks> 2007278: 92 07 bf fc add %fp, -4, %o1 200727c: d2 06 00 00 ld [ %i0 ], %o1 2007280: b8 10 00 08 mov %o0, %i4 2007284: 94 07 bf f8 add %fp, -8, %o2 2007288: 11 00 80 66 sethi %hi(0x2019800), %o0 200728c: 40 00 0a a4 call 2009d1c <_Objects_Get> 2007290: 90 12 22 a0 or %o0, 0x2a0, %o0 ! 2019aa0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2007294: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007298: 80 a0 60 00 cmp %g1, 0 200729c: 12 80 00 1f bne 2007318 20072a0: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20072a4: 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, 20072a8: 82 1f 20 03 xor %i4, 3, %g1 20072ac: 90 02 20 10 add %o0, 0x10, %o0 20072b0: 80 a0 00 01 cmp %g0, %g1 20072b4: 98 10 20 00 clr %o4 20072b8: b6 60 3f ff subx %g0, -1, %i3 20072bc: 40 00 07 4b call 2008fe8 <_CORE_RWLock_Obtain_for_writing> 20072c0: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20072c4: 40 00 0d ee call 200aa7c <_Thread_Enable_dispatch> 20072c8: 01 00 00 00 nop if ( !do_wait && 20072cc: 80 a6 e0 00 cmp %i3, 0 20072d0: 12 80 00 0d bne 2007304 20072d4: 03 00 80 67 sethi %hi(0x2019c00), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 20072d8: c2 00 61 e4 ld [ %g1 + 0x1e4 ], %g1 ! 2019de4 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 20072dc: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 20072e0: 80 a0 60 02 cmp %g1, 2 20072e4: 32 80 00 09 bne,a 2007308 20072e8: 03 00 80 67 sethi %hi(0x2019c00), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20072ec: 80 a7 20 00 cmp %i4, 0 20072f0: 02 80 00 0a be 2007318 <== NEVER TAKEN 20072f4: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20072f8: 80 a7 20 01 cmp %i4, 1 20072fc: 08 80 00 07 bleu 2007318 <== ALWAYS TAKEN 2007300: ba 10 20 74 mov 0x74, %i5 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 2007304: 03 00 80 67 sethi %hi(0x2019c00), %g1 2007308: c2 00 61 e4 ld [ %g1 + 0x1e4 ], %g1 ! 2019de4 <_Per_CPU_Information+0xc> if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 200730c: 40 00 00 05 call 2007320 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007310: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007314: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007318: 81 c7 e0 08 ret 200731c: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007a6c : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007a6c: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007a70: 80 a0 60 00 cmp %g1, 0 2007a74: 02 80 00 0a be 2007a9c 2007a78: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007a7c: c4 00 40 00 ld [ %g1 ], %g2 2007a80: 80 a0 a0 00 cmp %g2, 0 2007a84: 02 80 00 06 be 2007a9c 2007a88: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007a8c: 18 80 00 04 bgu 2007a9c <== NEVER TAKEN 2007a90: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007a94: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007a98: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007a9c: 81 c3 e0 08 retl =============================================================================== 02008988 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008988: 9d e3 bf 90 save %sp, -112, %sp 200898c: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2008990: 80 a6 a0 00 cmp %i2, 0 2008994: 02 80 00 3d be 2008a88 2008998: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 200899c: 90 10 00 19 mov %i1, %o0 20089a0: 92 10 00 1a mov %i2, %o1 20089a4: 94 07 bf f4 add %fp, -12, %o2 20089a8: 40 00 18 09 call 200e9cc <_POSIX_Thread_Translate_sched_param> 20089ac: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 20089b0: b0 92 20 00 orcc %o0, 0, %i0 20089b4: 12 80 00 35 bne 2008a88 20089b8: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 20089bc: 40 00 0b 90 call 200b7fc <_Thread_Get> 20089c0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20089c4: c2 07 bf fc ld [ %fp + -4 ], %g1 20089c8: 80 a0 60 00 cmp %g1, 0 20089cc: 12 80 00 31 bne 2008a90 20089d0: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 20089d4: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 20089d8: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 20089dc: 80 a0 60 04 cmp %g1, 4 20089e0: 32 80 00 05 bne,a 20089f4 20089e4: f2 27 60 84 st %i1, [ %i5 + 0x84 ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 20089e8: 40 00 0f e5 call 200c97c <_Watchdog_Remove> 20089ec: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 20089f0: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 20089f4: 90 07 60 88 add %i5, 0x88, %o0 20089f8: 92 10 00 1a mov %i2, %o1 20089fc: 40 00 24 98 call 2011c5c 2008a00: 94 10 20 1c mov 0x1c, %o2 the_thread->budget_algorithm = budget_algorithm; 2008a04: c2 07 bf f4 ld [ %fp + -12 ], %g1 the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008a08: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; the_thread->budget_algorithm = budget_algorithm; 2008a0c: c2 27 20 7c st %g1, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008a10: c2 07 bf f8 ld [ %fp + -8 ], %g1 switch ( api->schedpolicy ) { 2008a14: 06 80 00 1b bl 2008a80 <== NEVER TAKEN 2008a18: c2 27 20 80 st %g1, [ %i4 + 0x80 ] 2008a1c: 80 a6 60 02 cmp %i1, 2 2008a20: 04 80 00 07 ble 2008a3c 2008a24: 03 00 80 6b sethi %hi(0x201ac00), %g1 2008a28: 80 a6 60 04 cmp %i1, 4 2008a2c: 12 80 00 15 bne 2008a80 <== NEVER TAKEN 2008a30: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008a34: 10 80 00 0d b 2008a68 2008a38: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008a3c: c2 00 62 84 ld [ %g1 + 0x284 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a40: 90 10 00 1c mov %i4, %o0 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008a44: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 2008a48: 03 00 80 68 sethi %hi(0x201a000), %g1 2008a4c: d2 08 61 dc ldub [ %g1 + 0x1dc ], %o1 ! 201a1dc 2008a50: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a54: 94 10 20 01 mov 1, %o2 2008a58: 92 22 40 01 sub %o1, %g1, %o1 2008a5c: 40 00 0a 3f call 200b358 <_Thread_Change_priority> 2008a60: d2 27 20 18 st %o1, [ %i4 + 0x18 ] the_thread, the_thread->real_priority, true ); break; 2008a64: 30 80 00 07 b,a 2008a80 case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; _Watchdog_Remove( &api->Sporadic_timer ); 2008a68: 90 07 60 a8 add %i5, 0xa8, %o0 2008a6c: 40 00 0f c4 call 200c97c <_Watchdog_Remove> 2008a70: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008a74: 90 10 20 00 clr %o0 2008a78: 7f ff ff 80 call 2008878 <_POSIX_Threads_Sporadic_budget_TSR> 2008a7c: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008a80: 40 00 0b 53 call 200b7cc <_Thread_Enable_dispatch> 2008a84: 01 00 00 00 nop return 0; 2008a88: 81 c7 e0 08 ret 2008a8c: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return ESRCH; 2008a90: b0 10 20 03 mov 3, %i0 } 2008a94: 81 c7 e0 08 ret 2008a98: 81 e8 00 00 restore =============================================================================== 0200635c : * * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 200635c: 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() ) 2006360: 03 00 80 5e sethi %hi(0x2017800), %g1 2006364: 82 10 63 68 or %g1, 0x368, %g1 ! 2017b68 <_Per_CPU_Information> 2006368: c4 00 60 08 ld [ %g1 + 8 ], %g2 200636c: 80 a0 a0 00 cmp %g2, 0 2006370: 12 80 00 18 bne 20063d0 <== NEVER TAKEN 2006374: 01 00 00 00 nop return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006378: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200637c: 05 00 80 5d sethi %hi(0x2017400), %g2 2006380: c6 00 a2 30 ld [ %g2 + 0x230 ], %g3 ! 2017630 <_Thread_Dispatch_disable_level> 2006384: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 2006388: 86 00 e0 01 inc %g3 200638c: c6 20 a2 30 st %g3, [ %g2 + 0x230 ] _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2006390: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 2006394: 80 a0 a0 00 cmp %g2, 0 2006398: 12 80 00 05 bne 20063ac <== NEVER TAKEN 200639c: ba 10 20 00 clr %i5 /* Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ int _EXFUN(pthread_setcancelstate, (int __state, int *__oldstate)); int _EXFUN(pthread_setcanceltype, (int __type, int *__oldtype)); void _EXFUN(pthread_testcancel, (void)); 20063a0: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 20063a4: 80 a0 00 01 cmp %g0, %g1 20063a8: ba 40 20 00 addx %g0, 0, %i5 thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 20063ac: 40 00 0b 28 call 200904c <_Thread_Enable_dispatch> 20063b0: 01 00 00 00 nop if ( cancel ) 20063b4: 80 8f 60 ff btst 0xff, %i5 20063b8: 02 80 00 06 be 20063d0 20063bc: 01 00 00 00 nop _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 20063c0: 03 00 80 5e sethi %hi(0x2017800), %g1 20063c4: f0 00 63 74 ld [ %g1 + 0x374 ], %i0 ! 2017b74 <_Per_CPU_Information+0xc> 20063c8: 40 00 17 e9 call 200c36c <_POSIX_Thread_Exit> 20063cc: 93 e8 3f ff restore %g0, -1, %o1 20063d0: 81 c7 e0 08 ret 20063d4: 81 e8 00 00 restore =============================================================================== 02006f34 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2006f34: 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); 2006f38: 3b 00 80 61 sethi %hi(0x2018400), %i5 2006f3c: 40 00 02 75 call 2007910 2006f40: 90 17 63 ac or %i5, 0x3ac, %o0 ! 20187ac if (result != 0) { 2006f44: b8 92 20 00 orcc %o0, 0, %i4 2006f48: 02 80 00 06 be 2006f60 <== ALWAYS TAKEN 2006f4c: 01 00 00 00 nop free (req); 2006f50: 7f ff f1 72 call 2003518 <== NOT EXECUTED 2006f54: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return result; 2006f58: 81 c7 e0 08 ret <== NOT EXECUTED 2006f5c: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } /* _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); 2006f60: 40 00 04 71 call 2008124 2006f64: ba 17 63 ac or %i5, 0x3ac, %i5 2006f68: 92 07 bf fc add %fp, -4, %o1 2006f6c: 40 00 03 7a call 2007d54 2006f70: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2006f74: 40 00 04 6c call 2008124 2006f78: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006f7c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2006f80: c6 07 bf dc ld [ %fp + -36 ], %g3 2006f84: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 /* _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 (); 2006f88: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006f8c: 84 20 c0 02 sub %g3, %g2, %g2 2006f90: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; 2006f94: c4 07 bf fc ld [ %fp + -4 ], %g2 2006f98: c4 26 20 08 st %g2, [ %i0 + 8 ] req->aiocbp->error_code = EINPROGRESS; 2006f9c: 84 10 20 77 mov 0x77, %g2 2006fa0: c4 20 60 34 st %g2, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2006fa4: c4 07 60 68 ld [ %i5 + 0x68 ], %g2 req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; 2006fa8: c0 20 60 38 clr [ %g1 + 0x38 ] if ((aio_request_queue.idle_threads == 0) && 2006fac: 80 a0 a0 00 cmp %g2, 0 2006fb0: 12 80 00 33 bne 200707c <== NEVER TAKEN 2006fb4: d2 00 40 00 ld [ %g1 ], %o1 2006fb8: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006fbc: 80 a0 60 04 cmp %g1, 4 2006fc0: 14 80 00 30 bg 2007080 2006fc4: 11 00 80 61 sethi %hi(0x2018400), %o0 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); 2006fc8: 90 07 60 48 add %i5, 0x48, %o0 2006fcc: 7f ff fe c4 call 2006adc 2006fd0: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2006fd4: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 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); 2006fd8: b6 10 00 08 mov %o0, %i3 if (r_chain->new_fd == 1) { 2006fdc: 80 a0 60 01 cmp %g1, 1 2006fe0: 12 80 00 1d bne 2007054 2006fe4: b4 02 20 08 add %o0, 8, %i2 RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 2006fe8: 90 10 00 1a mov %i2, %o0 2006fec: 40 00 08 c5 call 2009300 <_Chain_Insert> 2006ff0: 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); 2006ff4: 90 06 e0 1c add %i3, 0x1c, %o0 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; 2006ff8: c0 26 e0 18 clr [ %i3 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2006ffc: 40 00 01 f0 call 20077bc 2007000: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007004: 90 06 e0 20 add %i3, 0x20, %o0 2007008: 40 00 00 fa call 20073f0 200700c: 92 10 20 00 clr %o1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007010: 96 10 00 1b mov %i3, %o3 2007014: 90 07 bf f8 add %fp, -8, %o0 2007018: 92 07 60 08 add %i5, 8, %o1 200701c: 15 00 80 1a sethi %hi(0x2006800), %o2 2007020: 40 00 02 bd call 2007b14 2007024: 94 12 a3 c8 or %o2, 0x3c8, %o2 ! 2006bc8 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007028: b6 92 20 00 orcc %o0, 0, %i3 200702c: 22 80 00 07 be,a 2007048 <== ALWAYS TAKEN 2007030: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2007034: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2007038: 40 00 02 56 call 2007990 <== NOT EXECUTED 200703c: b8 10 00 1b mov %i3, %i4 <== NOT EXECUTED return result; 2007040: 81 c7 e0 08 ret <== NOT EXECUTED 2007044: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } ++aio_request_queue.active_threads; 2007048: 82 00 60 01 inc %g1 200704c: 10 80 00 40 b 200714c 2007050: c2 27 60 64 st %g1, [ %i5 + 0x64 ] } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 2007054: ba 02 20 1c add %o0, 0x1c, %i5 2007058: 40 00 02 2e call 2007910 200705c: 90 10 00 1d mov %i5, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 2007060: 90 10 00 1a mov %i2, %o0 2007064: 7f ff ff 6d call 2006e18 2007068: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 200706c: 40 00 01 0f call 20074a8 2007070: 90 06 e0 20 add %i3, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007074: 10 80 00 11 b 20070b8 2007078: 90 10 00 1d mov %i5, %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, 200707c: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2007080: 94 10 20 00 clr %o2 2007084: 7f ff fe 96 call 2006adc 2007088: 90 12 23 f4 or %o0, 0x3f4, %o0 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 200708c: ba 92 20 00 orcc %o0, 0, %i5 2007090: 02 80 00 0e be 20070c8 2007094: b6 07 60 1c add %i5, 0x1c, %i3 { pthread_mutex_lock (&r_chain->mutex); 2007098: 40 00 02 1e call 2007910 200709c: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20070a0: 90 07 60 08 add %i5, 8, %o0 20070a4: 7f ff ff 5d call 2006e18 20070a8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20070ac: 40 00 00 ff call 20074a8 20070b0: 90 07 60 20 add %i5, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20070b4: 90 10 00 1b mov %i3, %o0 20070b8: 40 00 02 36 call 2007990 20070bc: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 20070c0: 10 80 00 24 b 2007150 20070c4: 11 00 80 61 sethi %hi(0x2018400), %o0 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 20070c8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20070cc: 11 00 80 62 sethi %hi(0x2018800), %o0 20070d0: d2 00 40 00 ld [ %g1 ], %o1 20070d4: 90 12 20 00 mov %o0, %o0 20070d8: 7f ff fe 81 call 2006adc 20070dc: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 20070e0: 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); 20070e4: ba 10 00 08 mov %o0, %i5 20070e8: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 20070ec: 80 a0 60 01 cmp %g1, 1 20070f0: 12 80 00 0d bne 2007124 20070f4: 90 02 20 08 add %o0, 8, %o0 20070f8: 40 00 08 82 call 2009300 <_Chain_Insert> 20070fc: 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); 2007100: 90 07 60 1c add %i5, 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; 2007104: c0 27 60 18 clr [ %i5 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007108: 40 00 01 ad call 20077bc 200710c: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007110: 90 07 60 20 add %i5, 0x20, %o0 2007114: 40 00 00 b7 call 20073f0 2007118: 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) 200711c: 10 80 00 05 b 2007130 2007120: 11 00 80 61 sethi %hi(0x2018400), %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); 2007124: 7f ff ff 3d call 2006e18 2007128: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 200712c: 11 00 80 61 sethi %hi(0x2018400), %o0 2007130: 90 12 23 ac or %o0, 0x3ac, %o0 ! 20187ac 2007134: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 2007138: 80 a0 60 00 cmp %g1, 0 200713c: 24 80 00 05 ble,a 2007150 <== ALWAYS TAKEN 2007140: 11 00 80 61 sethi %hi(0x2018400), %o0 pthread_cond_signal (&aio_request_queue.new_req); 2007144: 40 00 00 d9 call 20074a8 <== NOT EXECUTED 2007148: 90 02 20 04 add %o0, 4, %o0 ! 2018404 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); 200714c: 11 00 80 61 sethi %hi(0x2018400), %o0 2007150: 40 00 02 10 call 2007990 2007154: 90 12 23 ac or %o0, 0x3ac, %o0 ! 20187ac return 0; } 2007158: b0 10 00 1c mov %i4, %i0 200715c: 81 c7 e0 08 ret 2007160: 81 e8 00 00 restore =============================================================================== 02006bc8 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2006bc8: 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); 2006bcc: 3b 00 80 61 sethi %hi(0x2018400), %i5 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2006bd0: b6 10 3f ff mov -1, %i3 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); 2006bd4: ba 17 63 ac or %i5, 0x3ac, %i5 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)) { 2006bd8: b2 07 60 58 add %i5, 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, 2006bdc: b4 07 60 04 add %i5, 4, %i2 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2006be0: a0 06 20 1c add %i0, 0x1c, %l0 2006be4: 40 00 03 4b call 2007910 2006be8: 90 10 00 10 mov %l0, %o0 if (result != 0) 2006bec: 80 a2 20 00 cmp %o0, 0 2006bf0: 12 80 00 87 bne 2006e0c <== NEVER TAKEN 2006bf4: 82 06 20 0c add %i0, 0xc, %g1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2006bf8: f8 06 20 08 ld [ %i0 + 8 ], %i4 /* 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)) { 2006bfc: 80 a7 00 01 cmp %i4, %g1 2006c00: 02 80 00 3a be 2006ce8 2006c04: 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); 2006c08: 40 00 05 47 call 2008124 2006c0c: 01 00 00 00 nop 2006c10: 92 07 bf fc add %fp, -4, %o1 2006c14: 40 00 04 50 call 2007d54 2006c18: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2006c1c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2006c20: 40 00 05 41 call 2008124 2006c24: c2 27 bf d8 st %g1, [ %fp + -40 ] 2006c28: d2 07 20 08 ld [ %i4 + 8 ], %o1 2006c2c: 40 00 05 42 call 2008134 2006c30: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006c34: 40 00 09 9b call 20092a0 <_Chain_Extract> 2006c38: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2006c3c: 40 00 03 55 call 2007990 2006c40: 90 10 00 10 mov %l0, %o0 switch (req->aiocbp->aio_lio_opcode) { 2006c44: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 2006c48: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 2006c4c: 80 a0 a0 02 cmp %g2, 2 2006c50: 22 80 00 10 be,a 2006c90 2006c54: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006c58: 80 a0 a0 03 cmp %g2, 3 2006c5c: 02 80 00 15 be 2006cb0 <== NEVER TAKEN 2006c60: 80 a0 a0 01 cmp %g2, 1 2006c64: 32 80 00 19 bne,a 2006cc8 <== NEVER TAKEN 2006c68: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2006c6c: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006c70: d0 00 40 00 ld [ %g1 ], %o0 2006c74: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006c78: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006c7c: 96 10 00 02 mov %g2, %o3 2006c80: 40 00 2b 2a call 2011928 2006c84: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006c88: 10 80 00 0d b 2006cbc 2006c8c: 80 a2 3f ff cmp %o0, -1 case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2006c90: d0 00 40 00 ld [ %g1 ], %o0 2006c94: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006c98: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006c9c: 96 10 00 02 mov %g2, %o3 2006ca0: 40 00 2b 60 call 2011a20 2006ca4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006ca8: 10 80 00 05 b 2006cbc 2006cac: 80 a2 3f ff cmp %o0, -1 case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2006cb0: 40 00 1b 42 call 200d9b8 <== NOT EXECUTED 2006cb4: d0 00 40 00 ld [ %g1 ], %o0 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 2006cb8: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 2006cbc: 32 80 00 08 bne,a 2006cdc <== ALWAYS TAKEN 2006cc0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 req->aiocbp->return_value = -1; 2006cc4: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED req->aiocbp->error_code = errno; 2006cc8: 40 00 27 fc call 2010cb8 <__errno> <== NOT EXECUTED 2006ccc: f6 27 20 38 st %i3, [ %i4 + 0x38 ] <== NOT EXECUTED 2006cd0: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED 2006cd4: 10 bf ff c3 b 2006be0 <== NOT EXECUTED 2006cd8: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED } else { req->aiocbp->return_value = result; 2006cdc: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2006ce0: 10 bf ff c0 b 2006be0 2006ce4: c0 20 60 34 clr [ %g1 + 0x34 ] struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); 2006ce8: 40 00 03 2a call 2007990 2006cec: 90 10 00 10 mov %l0, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2006cf0: 40 00 03 08 call 2007910 2006cf4: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_empty (chain)) 2006cf8: c2 06 20 08 ld [ %i0 + 8 ], %g1 2006cfc: 80 a0 40 1c cmp %g1, %i4 2006d00: 12 80 00 3f bne 2006dfc <== NEVER TAKEN 2006d04: 92 07 bf f4 add %fp, -12, %o1 { clock_gettime (CLOCK_REALTIME, &timeout); 2006d08: 40 00 01 62 call 2007290 2006d0c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2006d10: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d14: 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; 2006d18: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d1c: b8 06 20 20 add %i0, 0x20, %i4 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2006d20: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d24: 90 10 00 1c mov %i4, %o0 2006d28: 92 10 00 1d mov %i5, %o1 2006d2c: 40 00 01 fc call 200751c 2006d30: 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) { 2006d34: 80 a2 20 74 cmp %o0, 0x74 2006d38: 12 80 00 31 bne 2006dfc <== NEVER TAKEN 2006d3c: 01 00 00 00 nop 2006d40: 40 00 09 58 call 20092a0 <_Chain_Extract> 2006d44: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2006d48: 40 00 02 4e call 2007680 2006d4c: 90 10 00 10 mov %l0, %o0 pthread_cond_destroy (&r_chain->cond); 2006d50: 40 00 01 74 call 2007320 2006d54: 90 10 00 1c mov %i4, %o0 free (r_chain); 2006d58: 7f ff f1 f0 call 2003518 2006d5c: 90 10 00 18 mov %i0, %o0 /* 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)) { 2006d60: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006d64: 80 a0 40 19 cmp %g1, %i1 2006d68: 12 80 00 1b bne 2006dd4 2006d6c: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 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); 2006d70: 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; 2006d74: 82 00 60 01 inc %g1 2006d78: c2 27 60 68 st %g1, [ %i5 + 0x68 ] --aio_request_queue.active_threads; 2006d7c: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006d80: 90 10 20 01 mov 1, %o0 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; 2006d84: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006d88: 40 00 01 42 call 2007290 2006d8c: c2 27 60 64 st %g1, [ %i5 + 0x64 ] timeout.tv_sec += 3; 2006d90: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d94: 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; 2006d98: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006d9c: 90 10 00 1a mov %i2, %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; 2006da0: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006da4: 92 10 00 1d mov %i5, %o1 2006da8: 40 00 01 dd call 200751c 2006dac: 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) { 2006db0: 80 a2 20 74 cmp %o0, 0x74 2006db4: 12 80 00 08 bne 2006dd4 <== NEVER TAKEN 2006db8: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 2006dbc: 90 10 00 1d mov %i5, %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; 2006dc0: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006dc4: 40 00 02 f3 call 2007990 2006dc8: c2 27 60 68 st %g1, [ %i5 + 0x68 ] return NULL; 2006dcc: 81 c7 e0 08 ret 2006dd0: 91 e8 20 00 restore %g0, 0, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006dd4: f0 07 60 54 ld [ %i5 + 0x54 ], %i0 } } /* 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; 2006dd8: 82 00 7f ff add %g1, -1, %g1 2006ddc: c2 27 60 68 st %g1, [ %i5 + 0x68 ] ++aio_request_queue.active_threads; 2006de0: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006de4: 90 10 00 18 mov %i0, %o0 2006de8: 82 00 60 01 inc %g1 2006dec: 40 00 09 2d call 20092a0 <_Chain_Extract> 2006df0: c2 27 60 64 st %g1, [ %i5 + 0x64 ] 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); 2006df4: 7f ff ff 65 call 2006b88 2006df8: 90 10 00 18 mov %i0, %o0 } } /* 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); 2006dfc: 40 00 02 e5 call 2007990 2006e00: 90 10 00 1d mov %i5, %o0 /* 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); 2006e04: 10 bf ff 78 b 2006be4 2006e08: a0 06 20 1c add %i0, 0x1c, %l0 } } AIO_printf ("Thread finished\n"); return NULL; } 2006e0c: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006e10: 81 c7 e0 08 ret <== NOT EXECUTED 2006e14: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020069fc : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 20069fc: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006a00: 3b 00 80 61 sethi %hi(0x2018400), %i5 2006a04: 40 00 04 2a call 2007aac 2006a08: 90 17 63 b4 or %i5, 0x3b4, %o0 ! 20187b4 if (result != 0) 2006a0c: b0 92 20 00 orcc %o0, 0, %i0 2006a10: 12 80 00 31 bne 2006ad4 <== NEVER TAKEN 2006a14: 90 17 63 b4 or %i5, 0x3b4, %o0 return result; result = 2006a18: 40 00 04 31 call 2007adc 2006a1c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006a20: 80 a2 20 00 cmp %o0, 0 2006a24: 22 80 00 05 be,a 2006a38 <== ALWAYS TAKEN 2006a28: 11 00 80 61 sethi %hi(0x2018400), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a2c: 40 00 04 14 call 2007a7c <== NOT EXECUTED 2006a30: 90 17 63 b4 or %i5, 0x3b4, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006a34: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2006a38: 92 10 20 00 clr %o1 2006a3c: 40 00 03 60 call 20077bc 2006a40: 90 12 23 ac or %o0, 0x3ac, %o0 if (result != 0) 2006a44: 80 a2 20 00 cmp %o0, 0 2006a48: 22 80 00 06 be,a 2006a60 <== ALWAYS TAKEN 2006a4c: 11 00 80 61 sethi %hi(0x2018400), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a50: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2006a54: 40 00 04 0a call 2007a7c <== NOT EXECUTED 2006a58: 90 12 23 b4 or %o0, 0x3b4, %o0 ! 20187b4 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006a5c: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2006a60: 92 10 20 00 clr %o1 2006a64: 40 00 02 63 call 20073f0 2006a68: 90 12 23 b0 or %o0, 0x3b0, %o0 if (result != 0) { 2006a6c: b0 92 20 00 orcc %o0, 0, %i0 2006a70: 02 80 00 09 be 2006a94 <== ALWAYS TAKEN 2006a74: 03 00 80 61 sethi %hi(0x2018400), %g1 pthread_mutex_destroy (&aio_request_queue.mutex); 2006a78: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2006a7c: 40 00 03 01 call 2007680 <== NOT EXECUTED 2006a80: 90 12 23 ac or %o0, 0x3ac, %o0 ! 20187ac <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006a84: 11 00 80 61 sethi %hi(0x2018400), %o0 <== NOT EXECUTED 2006a88: 40 00 03 fd call 2007a7c <== NOT EXECUTED 2006a8c: 90 12 23 b4 or %o0, 0x3b4, %o0 ! 20187b4 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006a90: 03 00 80 61 sethi %hi(0x2018400), %g1 <== NOT EXECUTED 2006a94: 82 10 63 ac or %g1, 0x3ac, %g1 ! 20187ac 2006a98: 84 00 60 4c add %g1, 0x4c, %g2 2006a9c: c4 20 60 48 st %g2, [ %g1 + 0x48 ] head->previous = NULL; tail->previous = head; 2006aa0: 84 00 60 48 add %g1, 0x48, %g2 2006aa4: c4 20 60 50 st %g2, [ %g1 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006aa8: 84 00 60 58 add %g1, 0x58, %g2 2006aac: c4 20 60 54 st %g2, [ %g1 + 0x54 ] head->previous = NULL; tail->previous = head; 2006ab0: 84 00 60 54 add %g1, 0x54, %g2 { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2006ab4: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 2006ab8: c4 20 60 5c st %g2, [ %g1 + 0x5c ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2006abc: c0 20 60 58 clr [ %g1 + 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; aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006ac0: 05 00 00 2c sethi %hi(0xb000), %g2 } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 2006ac4: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006ac8: 84 10 a0 0b or %g2, 0xb, %g2 rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; aio_request_queue.idle_threads = 0; 2006acc: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006ad0: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 2006ad4: 81 c7 e0 08 ret 2006ad8: 81 e8 00 00 restore =============================================================================== 02006e18 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 2006e18: 9d e3 bf a0 save %sp, -96, %sp 2006e1c: 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 ); 2006e20: 86 06 20 04 add %i0, 4, %g3 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2006e24: 80 a0 40 03 cmp %g1, %g3 2006e28: 02 80 00 10 be 2006e68 <== NEVER TAKEN 2006e2c: 84 10 00 19 mov %i1, %g2 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; 2006e30: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e34: 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; 2006e38: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e3c: 10 80 00 04 b 2006e4c 2006e40: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2006e44: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED 2006e48: c8 01 20 18 ld [ %g4 + 0x18 ], %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 && 2006e4c: 80 a3 c0 04 cmp %o7, %g4 2006e50: 04 80 00 04 ble 2006e60 <== ALWAYS TAKEN 2006e54: 80 a0 40 03 cmp %g1, %g3 2006e58: 32 bf ff fb bne,a 2006e44 2006e5c: 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 ); 2006e60: f0 00 60 04 ld [ %g1 + 4 ], %i0 2006e64: b2 10 00 02 mov %g2, %i1 2006e68: 40 00 09 26 call 2009300 <_Chain_Insert> 2006e6c: 81 e8 00 00 restore =============================================================================== 02006b88 : */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006b88: 05 00 80 61 sethi %hi(0x2018400), %g2 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2006b8c: 92 10 00 08 mov %o0, %o1 2006b90: 84 10 a3 ac or %g2, 0x3ac, %g2 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 && 2006b94: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 { rtems_aio_request_chain *temp; rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; 2006b98: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 2006b9c: 84 00 a0 4c add %g2, 0x4c, %g2 while (temp->fildes < r_chain->fildes && 2006ba0: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 2006ba4: 80 a1 00 03 cmp %g4, %g3 2006ba8: 16 80 00 04 bge 2006bb8 2006bac: 80 a0 40 02 cmp %g1, %g2 2006bb0: 32 bf ff fc bne,a 2006ba0 <== ALWAYS TAKEN 2006bb4: c2 00 40 00 ld [ %g1 ], %g1 2006bb8: d0 00 60 04 ld [ %g1 + 4 ], %o0 2006bbc: 82 13 c0 00 mov %o7, %g1 2006bc0: 40 00 09 d0 call 2009300 <_Chain_Insert> 2006bc4: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02006ec0 : * 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) { 2006ec0: 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; 2006ec4: 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 ); 2006ec8: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2006ecc: 80 a7 40 01 cmp %i5, %g1 2006ed0: 12 80 00 05 bne 2006ee4 2006ed4: b0 10 20 02 mov 2, %i0 2006ed8: 81 c7 e0 08 ret 2006edc: 81 e8 00 00 restore 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) { 2006ee0: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2006ee4: 02 80 00 12 be 2006f2c <== NEVER TAKEN 2006ee8: 01 00 00 00 nop 2006eec: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2006ef0: 80 a0 80 19 cmp %g2, %i1 2006ef4: 32 bf ff fb bne,a 2006ee0 <== NEVER TAKEN 2006ef8: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2006efc: 40 00 08 e9 call 20092a0 <_Chain_Extract> 2006f00: 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; 2006f04: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2006f08: 84 10 20 8c mov 0x8c, %g2 2006f0c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2006f10: 84 10 3f ff mov -1, %g2 free (current); 2006f14: 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; 2006f18: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2006f1c: 7f ff f1 7f call 2003518 2006f20: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2006f24: 81 c7 e0 08 ret 2006f28: 81 e8 00 00 restore } 2006f2c: 81 c7 e0 08 ret <== NOT EXECUTED 2006f30: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 02006ca4 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2006ca4: 9d e3 bf 98 save %sp, -104, %sp 2006ca8: 10 80 00 09 b 2006ccc 2006cac: ba 10 00 18 mov %i0, %i5 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2006cb0: 92 10 20 00 clr %o1 2006cb4: 94 10 00 1a mov %i2, %o2 2006cb8: 7f ff fd 07 call 20060d4 2006cbc: 96 07 bf fc add %fp, -4, %o3 ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2006cc0: 80 a2 20 00 cmp %o0, 0 2006cc4: 32 80 00 09 bne,a 2006ce8 <== ALWAYS TAKEN 2006cc8: f8 26 c0 00 st %i4, [ %i3 ] */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2006ccc: 40 00 01 79 call 20072b0 <_Chain_Get> 2006cd0: 90 10 00 1d mov %i5, %o0 sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2006cd4: b8 92 20 00 orcc %o0, 0, %i4 2006cd8: 02 bf ff f6 be 2006cb0 2006cdc: 90 10 00 19 mov %i1, %o0 2006ce0: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2006ce4: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2006ce8: 81 c7 e0 08 ret 2006cec: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02008ef4 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2008ef4: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 2008ef8: 80 a6 20 00 cmp %i0, 0 2008efc: 02 80 00 1b be 2008f68 <== NEVER TAKEN 2008f00: ba 10 20 01 mov 1, %i5 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 2008f04: 35 00 80 7c sethi %hi(0x201f000), %i2 #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 2008f08: 83 2f 60 02 sll %i5, 2, %g1 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 2008f0c: 84 16 a1 48 or %i2, 0x148, %g2 2008f10: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2008f14: f6 00 60 04 ld [ %g1 + 4 ], %i3 if ( !information ) 2008f18: 80 a6 e0 00 cmp %i3, 0 2008f1c: 12 80 00 0b bne 2008f48 2008f20: b8 10 20 01 mov 1, %i4 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2008f24: 10 80 00 0e b 2008f5c 2008f28: ba 07 60 01 inc %i5 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { the_thread = (Thread_Control *)information->local_table[ i ]; 2008f2c: 83 2f 20 02 sll %i4, 2, %g1 2008f30: d0 00 80 01 ld [ %g2 + %g1 ], %o0 if ( !the_thread ) 2008f34: 80 a2 20 00 cmp %o0, 0 2008f38: 02 80 00 04 be 2008f48 2008f3c: b8 07 20 01 inc %i4 continue; (*routine)(the_thread); 2008f40: 9f c6 00 00 call %i0 2008f44: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2008f48: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1 2008f4c: 80 a7 00 01 cmp %i4, %g1 2008f50: 28 bf ff f7 bleu,a 2008f2c 2008f54: c4 06 e0 1c ld [ %i3 + 0x1c ], %g2 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2008f58: ba 07 60 01 inc %i5 2008f5c: 80 a7 60 04 cmp %i5, 4 2008f60: 12 bf ff eb bne 2008f0c 2008f64: 83 2f 60 02 sll %i5, 2, %g1 2008f68: 81 c7 e0 08 ret 2008f6c: 81 e8 00 00 restore =============================================================================== 02013f80 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2013f80: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013f84: 80 a6 20 00 cmp %i0, 0 2013f88: 02 80 00 38 be 2014068 2013f8c: 82 10 20 03 mov 3, %g1 return RTEMS_INVALID_NAME; if ( !starting_address ) 2013f90: 80 a6 60 00 cmp %i1, 0 2013f94: 02 80 00 35 be 2014068 2013f98: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013f9c: 80 a7 60 00 cmp %i5, 0 2013fa0: 02 80 00 32 be 2014068 <== NEVER TAKEN 2013fa4: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013fa8: 02 80 00 30 be 2014068 2013fac: 82 10 20 08 mov 8, %g1 2013fb0: 80 a6 a0 00 cmp %i2, 0 2013fb4: 02 80 00 2d be 2014068 2013fb8: 80 a6 80 1b cmp %i2, %i3 2013fbc: 0a 80 00 2b bcs 2014068 2013fc0: 80 8e e0 07 btst 7, %i3 2013fc4: 12 80 00 29 bne 2014068 2013fc8: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2013fcc: 12 80 00 27 bne 2014068 2013fd0: 82 10 20 09 mov 9, %g1 2013fd4: 03 00 80 f3 sethi %hi(0x203cc00), %g1 2013fd8: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 203cf40 <_Thread_Dispatch_disable_level> 2013fdc: 84 00 a0 01 inc %g2 2013fe0: c4 20 63 40 st %g2, [ %g1 + 0x340 ] * 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 ); 2013fe4: 23 00 80 f3 sethi %hi(0x203cc00), %l1 2013fe8: 40 00 12 61 call 201896c <_Objects_Allocate> 2013fec: 90 14 61 54 or %l1, 0x154, %o0 ! 203cd54 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2013ff0: a0 92 20 00 orcc %o0, 0, %l0 2013ff4: 32 80 00 06 bne,a 201400c 2013ff8: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 2013ffc: 40 00 17 2a call 2019ca4 <_Thread_Enable_dispatch> 2014000: 01 00 00 00 nop return RTEMS_TOO_MANY; 2014004: 10 80 00 19 b 2014068 2014008: 82 10 20 05 mov 5, %g1 ! 5 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, length / buffer_size, buffer_size ); 201400c: 92 10 00 1b mov %i3, %o1 _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2014010: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2014014: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2014018: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 201401c: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2014020: 40 00 62 14 call 202c870 <.udiv> 2014024: 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, 2014028: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 201402c: 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, 2014030: 96 10 00 1b mov %i3, %o3 2014034: b8 04 20 24 add %l0, 0x24, %i4 2014038: 40 00 0c 5b call 20171a4 <_Chain_Initialize> 201403c: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014040: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2014044: a2 14 61 54 or %l1, 0x154, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014048: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 201404c: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014050: 85 28 a0 02 sll %g2, 2, %g2 2014054: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2014058: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 201405c: 40 00 17 12 call 2019ca4 <_Thread_Enable_dispatch> 2014060: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2014064: 82 10 20 00 clr %g1 } 2014068: 81 c7 e0 08 ret 201406c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200714c : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 200714c: 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 *) 2007150: 11 00 80 79 sethi %hi(0x201e400), %o0 2007154: 92 10 00 18 mov %i0, %o1 2007158: 90 12 20 14 or %o0, 0x14, %o0 200715c: 40 00 08 ed call 2009510 <_Objects_Get> 2007160: 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 ) { 2007164: c2 07 bf fc ld [ %fp + -4 ], %g1 2007168: 80 a0 60 00 cmp %g1, 0 200716c: 12 80 00 65 bne 2007300 2007170: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007174: 37 00 80 7a sethi %hi(0x201e800), %i3 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2007178: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 200717c: b6 16 e2 b8 or %i3, 0x2b8, %i3 2007180: c2 06 e0 0c ld [ %i3 + 0xc ], %g1 2007184: 80 a0 80 01 cmp %g2, %g1 2007188: 02 80 00 06 be 20071a0 200718c: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 2007190: 40 00 0c 63 call 200a31c <_Thread_Enable_dispatch> 2007194: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2007198: 81 c7 e0 08 ret 200719c: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 20071a0: 12 80 00 0d bne 20071d4 20071a4: 01 00 00 00 nop switch ( the_period->state ) { 20071a8: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 20071ac: 80 a0 60 04 cmp %g1, 4 20071b0: 18 80 00 05 bgu 20071c4 <== NEVER TAKEN 20071b4: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20071b8: 05 00 80 70 sethi %hi(0x201c000), %g2 20071bc: 84 10 a2 20 or %g2, 0x220, %g2 ! 201c220 20071c0: f0 08 80 01 ldub [ %g2 + %g1 ], %i0 case RATE_MONOTONIC_ACTIVE: default: /* unreached -- only to remove warnings */ return_value = RTEMS_SUCCESSFUL; break; } _Thread_Enable_dispatch(); 20071c4: 40 00 0c 56 call 200a31c <_Thread_Enable_dispatch> 20071c8: 01 00 00 00 nop return( return_value ); 20071cc: 81 c7 e0 08 ret 20071d0: 81 e8 00 00 restore } _ISR_Disable( level ); 20071d4: 7f ff ef 00 call 2002dd4 20071d8: 01 00 00 00 nop 20071dc: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 20071e0: f8 07 60 38 ld [ %i5 + 0x38 ], %i4 20071e4: 80 a7 20 00 cmp %i4, 0 20071e8: 12 80 00 15 bne 200723c 20071ec: 80 a7 20 02 cmp %i4, 2 _ISR_Enable( level ); 20071f0: 7f ff ee fd call 2002de4 20071f4: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20071f8: 7f ff ff 7f call 2006ff4 <_Rate_monotonic_Initiate_statistics> 20071fc: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007200: 82 10 20 02 mov 2, %g1 2007204: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007208: 03 00 80 1d sethi %hi(0x2007400), %g1 200720c: 82 10 61 b8 or %g1, 0x1b8, %g1 ! 20075b8 <_Rate_monotonic_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2007210: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 2007214: c2 27 60 2c st %g1, [ %i5 + 0x2c ] the_watchdog->id = id; 2007218: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 200721c: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 2007220: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007224: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007228: 11 00 80 79 sethi %hi(0x201e400), %o0 200722c: 92 07 60 10 add %i5, 0x10, %o1 2007230: 40 00 10 3a call 200b318 <_Watchdog_Insert> 2007234: 90 12 22 44 or %o0, 0x244, %o0 2007238: 30 80 00 1b b,a 20072a4 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 200723c: 12 80 00 1e bne 20072b4 2007240: 80 a7 20 04 cmp %i4, 4 /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007244: 7f ff ff 86 call 200705c <_Rate_monotonic_Update_statistics> 2007248: 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; 200724c: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007250: 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; 2007254: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007258: 7f ff ee e3 call 2002de4 200725c: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007260: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 2007264: c2 07 60 08 ld [ %i5 + 8 ], %g1 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007268: 13 00 00 10 sethi %hi(0x4000), %o1 200726c: 40 00 0e 56 call 200abc4 <_Thread_Set_state> 2007270: c2 22 20 20 st %g1, [ %o0 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007274: 7f ff ee d8 call 2002dd4 2007278: 01 00 00 00 nop local_state = the_period->state; 200727c: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 2007280: f8 27 60 38 st %i4, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007284: 7f ff ee d8 call 2002de4 2007288: 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 ) 200728c: 80 a6 a0 03 cmp %i2, 3 2007290: 12 80 00 05 bne 20072a4 2007294: 01 00 00 00 nop _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007298: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 200729c: 40 00 0b 48 call 2009fbc <_Thread_Clear_state> 20072a0: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 20072a4: 40 00 0c 1e call 200a31c <_Thread_Enable_dispatch> 20072a8: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 20072ac: 81 c7 e0 08 ret 20072b0: 81 e8 00 00 restore } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 20072b4: 12 bf ff b9 bne 2007198 <== NEVER TAKEN 20072b8: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 20072bc: 7f ff ff 68 call 200705c <_Rate_monotonic_Update_statistics> 20072c0: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 20072c4: 7f ff ee c8 call 2002de4 20072c8: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20072cc: 82 10 20 02 mov 2, %g1 20072d0: 92 07 60 10 add %i5, 0x10, %o1 20072d4: 11 00 80 79 sethi %hi(0x201e400), %o0 20072d8: 90 12 22 44 or %o0, 0x244, %o0 ! 201e644 <_Watchdog_Ticks_chain> 20072dc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 20072e0: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20072e4: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20072e8: 40 00 10 0c call 200b318 <_Watchdog_Insert> 20072ec: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 20072f0: 40 00 0c 0b call 200a31c <_Thread_Enable_dispatch> 20072f4: 01 00 00 00 nop return RTEMS_TIMEOUT; 20072f8: 81 c7 e0 08 ret 20072fc: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2007300: b0 10 20 04 mov 4, %i0 } 2007304: 81 c7 e0 08 ret 2007308: 81 e8 00 00 restore =============================================================================== 0200730c : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 200730c: 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 ) 2007310: 80 a6 60 00 cmp %i1, 0 2007314: 02 80 00 75 be 20074e8 <== NEVER TAKEN 2007318: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 200731c: 13 00 80 70 sethi %hi(0x201c000), %o1 2007320: 9f c6 40 00 call %i1 2007324: 92 12 62 28 or %o1, 0x228, %o1 ! 201c228 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2007328: 90 10 00 18 mov %i0, %o0 200732c: 13 00 80 70 sethi %hi(0x201c000), %o1 2007330: 9f c6 40 00 call %i1 2007334: 92 12 62 48 or %o1, 0x248, %o1 ! 201c248 (*print)( context, "--- Wall times are in seconds ---\n" ); 2007338: 90 10 00 18 mov %i0, %o0 200733c: 13 00 80 70 sethi %hi(0x201c000), %o1 2007340: 9f c6 40 00 call %i1 2007344: 92 12 62 70 or %o1, 0x270, %o1 ! 201c270 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2007348: 90 10 00 18 mov %i0, %o0 200734c: 13 00 80 70 sethi %hi(0x201c000), %o1 2007350: 9f c6 40 00 call %i1 2007354: 92 12 62 98 or %o1, 0x298, %o1 ! 201c298 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 2007358: 90 10 00 18 mov %i0, %o0 200735c: 13 00 80 70 sethi %hi(0x201c000), %o1 2007360: 9f c6 40 00 call %i1 2007364: 92 12 62 e8 or %o1, 0x2e8, %o1 ! 201c2e8 /* * 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 ; 2007368: 03 00 80 79 sethi %hi(0x201e400), %g1 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200736c: 21 00 80 70 sethi %hi(0x201c000), %l0 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, 2007370: 35 00 80 70 sethi %hi(0x201c000), %i2 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, 2007374: 37 00 80 70 sethi %hi(0x201c000), %i3 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007378: 39 00 80 6d sethi %hi(0x201b400), %i4 /* * 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 ; 200737c: fa 00 60 1c ld [ %g1 + 0x1c ], %i5 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007380: a0 14 23 38 or %l0, 0x338, %l0 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, 2007384: b4 16 a3 50 or %i2, 0x350, %i2 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, 2007388: b6 16 e3 70 or %i3, 0x370, %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 ; 200738c: 10 80 00 52 b 20074d4 2007390: b8 17 21 38 or %i4, 0x138, %i4 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007394: 40 00 19 4e call 200d8cc 2007398: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 200739c: 80 a2 20 00 cmp %o0, 0 20073a0: 32 80 00 4d bne,a 20074d4 20073a4: ba 07 60 01 inc %i5 #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 ); 20073a8: 92 07 bf d8 add %fp, -40, %o1 20073ac: 40 00 19 75 call 200d980 20073b0: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 20073b4: d0 07 bf d8 ld [ %fp + -40 ], %o0 20073b8: 92 10 20 05 mov 5, %o1 20073bc: 40 00 00 ad call 2007670 20073c0: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 20073c4: d8 1f bf a0 ldd [ %fp + -96 ], %o4 20073c8: 92 10 00 10 mov %l0, %o1 20073cc: 90 10 00 18 mov %i0, %o0 20073d0: 94 10 00 1d mov %i5, %o2 20073d4: 9f c6 40 00 call %i1 20073d8: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 20073dc: d2 07 bf a0 ld [ %fp + -96 ], %o1 20073e0: 80 a2 60 00 cmp %o1, 0 20073e4: 12 80 00 07 bne 2007400 20073e8: 94 07 bf f0 add %fp, -16, %o2 (*print)( context, "\n" ); 20073ec: 90 10 00 18 mov %i0, %o0 20073f0: 9f c6 40 00 call %i1 20073f4: 92 10 00 1c mov %i4, %o1 continue; 20073f8: 10 80 00 37 b 20074d4 20073fc: ba 07 60 01 inc %i5 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 ); 2007400: 40 00 0e a7 call 200ae9c <_Timespec_Divide_by_integer> 2007404: 90 07 bf b8 add %fp, -72, %o0 (*print)( context, 2007408: d0 07 bf ac ld [ %fp + -84 ], %o0 200740c: 40 00 46 c8 call 2018f2c <.div> 2007410: 92 10 23 e8 mov 0x3e8, %o1 2007414: a6 10 00 08 mov %o0, %l3 2007418: d0 07 bf b4 ld [ %fp + -76 ], %o0 200741c: 40 00 46 c4 call 2018f2c <.div> 2007420: 92 10 23 e8 mov 0x3e8, %o1 2007424: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007428: a2 10 00 08 mov %o0, %l1 200742c: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007430: e8 07 bf a8 ld [ %fp + -88 ], %l4 2007434: e4 07 bf b0 ld [ %fp + -80 ], %l2 2007438: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200743c: 40 00 46 bc call 2018f2c <.div> 2007440: 92 10 23 e8 mov 0x3e8, %o1 2007444: 96 10 00 13 mov %l3, %o3 2007448: 98 10 00 12 mov %l2, %o4 200744c: 9a 10 00 11 mov %l1, %o5 2007450: 94 10 00 14 mov %l4, %o2 2007454: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007458: 92 10 00 1a mov %i2, %o1 200745c: 9f c6 40 00 call %i1 2007460: 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); 2007464: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007468: 94 07 bf f0 add %fp, -16, %o2 200746c: 40 00 0e 8c call 200ae9c <_Timespec_Divide_by_integer> 2007470: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2007474: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007478: 40 00 46 ad call 2018f2c <.div> 200747c: 92 10 23 e8 mov 0x3e8, %o1 2007480: a6 10 00 08 mov %o0, %l3 2007484: d0 07 bf cc ld [ %fp + -52 ], %o0 2007488: 40 00 46 a9 call 2018f2c <.div> 200748c: 92 10 23 e8 mov 0x3e8, %o1 2007490: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007494: a2 10 00 08 mov %o0, %l1 2007498: d0 07 bf f4 ld [ %fp + -12 ], %o0 200749c: e8 07 bf c0 ld [ %fp + -64 ], %l4 20074a0: e4 07 bf c8 ld [ %fp + -56 ], %l2 20074a4: 92 10 23 e8 mov 0x3e8, %o1 20074a8: 40 00 46 a1 call 2018f2c <.div> 20074ac: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20074b0: 92 10 00 1b mov %i3, %o1 20074b4: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 20074b8: 94 10 00 14 mov %l4, %o2 20074bc: 90 10 00 18 mov %i0, %o0 20074c0: 96 10 00 13 mov %l3, %o3 20074c4: 98 10 00 12 mov %l2, %o4 20074c8: 9f c6 40 00 call %i1 20074cc: 9a 10 00 11 mov %l1, %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 ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20074d0: 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 ; id <= _Rate_monotonic_Information.maximum_id ; 20074d4: 03 00 80 79 sethi %hi(0x201e400), %g1 /* * 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 ; 20074d8: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 ! 201e420 <_Rate_monotonic_Information+0xc> 20074dc: 80 a7 40 01 cmp %i5, %g1 20074e0: 08 bf ff ad bleu 2007394 20074e4: 90 10 00 1d mov %i5, %o0 20074e8: 81 c7 e0 08 ret 20074ec: 81 e8 00 00 restore =============================================================================== 020154d8 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 20154d8: 9d e3 bf 98 save %sp, -104, %sp 20154dc: 90 10 00 18 mov %i0, %o0 register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 20154e0: 80 a6 60 00 cmp %i1, 0 20154e4: 02 80 00 2e be 201559c 20154e8: b0 10 20 0a mov 0xa, %i0 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20154ec: 40 00 11 fa call 2019cd4 <_Thread_Get> 20154f0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20154f4: c2 07 bf fc ld [ %fp + -4 ], %g1 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20154f8: b8 10 00 08 mov %o0, %i4 switch ( location ) { 20154fc: 80 a0 60 00 cmp %g1, 0 2015500: 12 80 00 27 bne 201559c 2015504: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2015508: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 201550c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2015510: 80 a0 60 00 cmp %g1, 0 2015514: 02 80 00 24 be 20155a4 2015518: 01 00 00 00 nop if ( asr->is_enabled ) { 201551c: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2015520: 80 a0 60 00 cmp %g1, 0 2015524: 02 80 00 15 be 2015578 2015528: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201552c: 7f ff e7 dc call 200f49c 2015530: 01 00 00 00 nop *signal_set |= signals; 2015534: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2015538: b2 10 40 19 or %g1, %i1, %i1 201553c: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2015540: 7f ff e7 db call 200f4ac 2015544: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2015548: 03 00 80 f5 sethi %hi(0x203d400), %g1 201554c: 82 10 60 80 or %g1, 0x80, %g1 ! 203d480 <_Per_CPU_Information> 2015550: c4 00 60 08 ld [ %g1 + 8 ], %g2 2015554: 80 a0 a0 00 cmp %g2, 0 2015558: 02 80 00 0f be 2015594 201555c: 01 00 00 00 nop 2015560: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015564: 80 a7 00 02 cmp %i4, %g2 2015568: 12 80 00 0b bne 2015594 <== NEVER TAKEN 201556c: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2015570: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015574: 30 80 00 08 b,a 2015594 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015578: 7f ff e7 c9 call 200f49c 201557c: 01 00 00 00 nop *signal_set |= signals; 2015580: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2015584: b2 10 40 19 or %g1, %i1, %i1 2015588: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 201558c: 7f ff e7 c8 call 200f4ac 2015590: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015594: 40 00 11 c4 call 2019ca4 <_Thread_Enable_dispatch> 2015598: b0 10 20 00 clr %i0 ! 0 return RTEMS_SUCCESSFUL; 201559c: 81 c7 e0 08 ret 20155a0: 81 e8 00 00 restore } _Thread_Enable_dispatch(); 20155a4: 40 00 11 c0 call 2019ca4 <_Thread_Enable_dispatch> 20155a8: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; 20155ac: 81 c7 e0 08 ret 20155b0: 81 e8 00 00 restore =============================================================================== 0200dbe4 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200dbe4: 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 ) 200dbe8: 80 a6 a0 00 cmp %i2, 0 200dbec: 02 80 00 5a be 200dd54 200dbf0: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200dbf4: 03 00 80 57 sethi %hi(0x2015c00), %g1 200dbf8: f8 00 62 24 ld [ %g1 + 0x224 ], %i4 ! 2015e24 <_Per_CPU_Information+0xc> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200dbfc: c2 0f 20 74 ldub [ %i4 + 0x74 ], %g1 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200dc00: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200dc04: 80 a0 00 01 cmp %g0, %g1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200dc08: c2 07 20 7c ld [ %i4 + 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; 200dc0c: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200dc10: 80 a0 60 00 cmp %g1, 0 200dc14: 02 80 00 03 be 200dc20 200dc18: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200dc1c: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200dc20: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 200dc24: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200dc28: 7f ff ef 79 call 2009a0c <_CPU_ISR_Get_level> 200dc2c: a0 60 3f ff subx %g0, -1, %l0 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; 200dc30: a1 2c 20 0a sll %l0, 0xa, %l0 200dc34: a0 14 00 08 or %l0, %o0, %l0 old_mode |= _ISR_Get_level(); 200dc38: b6 14 00 1b or %l0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200dc3c: 80 8e 61 00 btst 0x100, %i1 200dc40: 02 80 00 06 be 200dc58 200dc44: 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; 200dc48: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200dc4c: 80 a0 00 01 cmp %g0, %g1 200dc50: 82 60 3f ff subx %g0, -1, %g1 200dc54: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200dc58: 80 8e 62 00 btst 0x200, %i1 200dc5c: 02 80 00 0b be 200dc88 200dc60: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200dc64: 80 8e 22 00 btst 0x200, %i0 200dc68: 22 80 00 07 be,a 200dc84 200dc6c: c0 27 20 7c clr [ %i4 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200dc70: 82 10 20 01 mov 1, %g1 200dc74: c2 27 20 7c st %g1, [ %i4 + 0x7c ] executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200dc78: 03 00 80 56 sethi %hi(0x2015800), %g1 200dc7c: c2 00 60 44 ld [ %g1 + 0x44 ], %g1 ! 2015844 <_Thread_Ticks_per_timeslice> 200dc80: c2 27 20 78 st %g1, [ %i4 + 0x78 ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200dc84: 80 8e 60 0f btst 0xf, %i1 200dc88: 02 80 00 06 be 200dca0 200dc8c: 80 8e 64 00 btst 0x400, %i1 */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 200dc90: 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 ) ); 200dc94: 7f ff d0 8f call 2001ed0 200dc98: 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 ) { 200dc9c: 80 8e 64 00 btst 0x400, %i1 200dca0: 02 80 00 14 be 200dcf0 200dca4: 88 10 20 00 clr %g4 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200dca8: c4 0f 60 08 ldub [ %i5 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 200dcac: 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( 200dcb0: 80 a0 00 18 cmp %g0, %i0 200dcb4: 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 ) { 200dcb8: 80 a0 40 02 cmp %g1, %g2 200dcbc: 22 80 00 0e be,a 200dcf4 200dcc0: 03 00 80 56 sethi %hi(0x2015800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200dcc4: 7f ff d0 7f call 2001ec0 200dcc8: c2 2f 60 08 stb %g1, [ %i5 + 8 ] _signals = information->signals_pending; 200dccc: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 information->signals_pending = information->signals_posted; 200dcd0: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 information->signals_posted = _signals; 200dcd4: c2 27 60 14 st %g1, [ %i5 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 200dcd8: c4 27 60 18 st %g2, [ %i5 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200dcdc: 7f ff d0 7d call 2001ed0 200dce0: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200dce4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200dce8: 80 a0 00 01 cmp %g0, %g1 200dcec: 88 40 20 00 addx %g0, 0, %g4 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200dcf0: 03 00 80 56 sethi %hi(0x2015800), %g1 200dcf4: c4 00 62 3c ld [ %g1 + 0x23c ], %g2 ! 2015a3c <_System_state_Current> 200dcf8: 80 a0 a0 03 cmp %g2, 3 200dcfc: 12 80 00 16 bne 200dd54 200dd00: 82 10 20 00 clr %g1 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200dd04: 07 00 80 57 sethi %hi(0x2015c00), %g3 if ( are_signals_pending || 200dd08: 80 89 20 ff btst 0xff, %g4 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200dd0c: 86 10 e2 18 or %g3, 0x218, %g3 if ( are_signals_pending || 200dd10: 12 80 00 0a bne 200dd38 200dd14: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 200dd18: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 200dd1c: 80 a0 80 03 cmp %g2, %g3 200dd20: 02 80 00 0d be 200dd54 200dd24: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200dd28: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200dd2c: 80 a0 a0 00 cmp %g2, 0 200dd30: 02 80 00 09 be 200dd54 <== NEVER TAKEN 200dd34: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200dd38: 84 10 20 01 mov 1, %g2 ! 1 200dd3c: 03 00 80 57 sethi %hi(0x2015c00), %g1 200dd40: 82 10 62 18 or %g1, 0x218, %g1 ! 2015e18 <_Per_CPU_Information> 200dd44: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200dd48: 7f ff e9 cd call 200847c <_Thread_Dispatch> 200dd4c: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200dd50: 82 10 20 00 clr %g1 ! 0 } 200dd54: 81 c7 e0 08 ret 200dd58: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200a9a8 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200a9a8: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200a9ac: 80 a6 60 00 cmp %i1, 0 200a9b0: 02 80 00 07 be 200a9cc 200a9b4: 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 ) ); 200a9b8: 03 00 80 64 sethi %hi(0x2019000), %g1 200a9bc: c2 08 63 4c ldub [ %g1 + 0x34c ], %g1 ! 201934c 200a9c0: 80 a6 40 01 cmp %i1, %g1 200a9c4: 18 80 00 1c bgu 200aa34 200a9c8: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200a9cc: 80 a6 a0 00 cmp %i2, 0 200a9d0: 02 80 00 19 be 200aa34 200a9d4: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200a9d8: 40 00 09 42 call 200cee0 <_Thread_Get> 200a9dc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a9e0: c2 07 bf fc ld [ %fp + -4 ], %g1 200a9e4: 80 a0 60 00 cmp %g1, 0 200a9e8: 12 80 00 13 bne 200aa34 200a9ec: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200a9f0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200a9f4: 80 a6 60 00 cmp %i1, 0 200a9f8: 02 80 00 0d be 200aa2c 200a9fc: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200aa00: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200aa04: 80 a0 60 00 cmp %g1, 0 200aa08: 02 80 00 06 be 200aa20 200aa0c: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200aa10: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200aa14: 80 a0 40 19 cmp %g1, %i1 200aa18: 08 80 00 05 bleu 200aa2c <== ALWAYS TAKEN 200aa1c: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200aa20: 92 10 00 19 mov %i1, %o1 200aa24: 40 00 08 06 call 200ca3c <_Thread_Change_priority> 200aa28: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200aa2c: 40 00 09 21 call 200ceb0 <_Thread_Enable_dispatch> 200aa30: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200aa34: 81 c7 e0 08 ret 200aa38: 81 e8 00 00 restore =============================================================================== 02015ed8 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2015ed8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015edc: 11 00 80 f6 sethi %hi(0x203d800), %o0 2015ee0: 92 10 00 18 mov %i0, %o1 2015ee4: 90 12 20 b4 or %o0, 0xb4, %o0 2015ee8: 40 00 0b ec call 2018e98 <_Objects_Get> 2015eec: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015ef0: c2 07 bf fc ld [ %fp + -4 ], %g1 2015ef4: 80 a0 60 00 cmp %g1, 0 2015ef8: 12 80 00 0c bne 2015f28 2015efc: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015f00: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015f04: 80 a0 60 04 cmp %g1, 4 2015f08: 02 80 00 04 be 2015f18 <== NEVER TAKEN 2015f0c: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015f10: 40 00 14 0d call 201af44 <_Watchdog_Remove> 2015f14: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2015f18: 40 00 0f 63 call 2019ca4 <_Thread_Enable_dispatch> 2015f1c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2015f20: 81 c7 e0 08 ret 2015f24: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015f28: 81 c7 e0 08 ret 2015f2c: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 020163d0 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20163d0: 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; 20163d4: 03 00 80 f6 sethi %hi(0x203d800), %g1 20163d8: f8 00 60 f4 ld [ %g1 + 0xf4 ], %i4 ! 203d8f4 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20163dc: ba 10 00 18 mov %i0, %i5 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 20163e0: 80 a7 20 00 cmp %i4, 0 20163e4: 02 80 00 32 be 20164ac 20163e8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 20163ec: 03 00 80 f3 sethi %hi(0x203cc00), %g1 20163f0: c2 08 63 50 ldub [ %g1 + 0x350 ], %g1 ! 203cf50 <_TOD_Is_set> 20163f4: 80 a0 60 00 cmp %g1, 0 20163f8: 02 80 00 2d be 20164ac <== NEVER TAKEN 20163fc: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2016400: 80 a6 a0 00 cmp %i2, 0 2016404: 02 80 00 2a be 20164ac 2016408: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 201640c: 90 10 00 19 mov %i1, %o0 2016410: 7f ff f4 1d call 2013484 <_TOD_Validate> 2016414: b0 10 20 14 mov 0x14, %i0 2016418: 80 8a 20 ff btst 0xff, %o0 201641c: 02 80 00 27 be 20164b8 2016420: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2016424: 7f ff f3 e4 call 20133b4 <_TOD_To_seconds> 2016428: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 201642c: 21 00 80 f3 sethi %hi(0x203cc00), %l0 2016430: c2 04 23 cc ld [ %l0 + 0x3cc ], %g1 ! 203cfcc <_TOD_Now> 2016434: 80 a2 00 01 cmp %o0, %g1 2016438: 08 80 00 1d bleu 20164ac 201643c: b2 10 00 08 mov %o0, %i1 2016440: 11 00 80 f6 sethi %hi(0x203d800), %o0 2016444: 92 10 00 1d mov %i5, %o1 2016448: 90 12 20 b4 or %o0, 0xb4, %o0 201644c: 40 00 0a 93 call 2018e98 <_Objects_Get> 2016450: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016454: c2 07 bf fc ld [ %fp + -4 ], %g1 2016458: 80 a0 60 00 cmp %g1, 0 201645c: 12 80 00 16 bne 20164b4 2016460: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2016464: 40 00 12 b8 call 201af44 <_Watchdog_Remove> 2016468: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 201646c: 82 10 20 03 mov 3, %g1 2016470: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2016474: c2 04 23 cc ld [ %l0 + 0x3cc ], %g1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016478: 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(); 201647c: b2 26 40 01 sub %i1, %g1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016480: c2 07 20 04 ld [ %i4 + 4 ], %g1 2016484: 90 10 00 1c mov %i4, %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2016488: c0 26 20 18 clr [ %i0 + 0x18 ] the_watchdog->routine = routine; 201648c: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 2016490: fa 26 20 30 st %i5, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 2016494: f6 26 20 34 st %i3, [ %i0 + 0x34 ] 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(); 2016498: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 201649c: 9f c0 40 00 call %g1 20164a0: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20164a4: 40 00 0e 00 call 2019ca4 <_Thread_Enable_dispatch> 20164a8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20164ac: 81 c7 e0 08 ret 20164b0: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20164b4: b0 10 20 04 mov 4, %i0 } 20164b8: 81 c7 e0 08 ret 20164bc: 81 e8 00 00 restore =============================================================================== 02006730 : #include int sched_get_priority_max( int policy ) { 2006730: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006734: 80 a6 20 04 cmp %i0, 4 2006738: 18 80 00 06 bgu 2006750 200673c: 82 10 20 01 mov 1, %g1 2006740: b1 28 40 18 sll %g1, %i0, %i0 2006744: 80 8e 20 17 btst 0x17, %i0 2006748: 12 80 00 08 bne 2006768 <== ALWAYS TAKEN 200674c: 03 00 80 71 sethi %hi(0x201c400), %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006750: 40 00 22 1d call 200efc4 <__errno> 2006754: b0 10 3f ff mov -1, %i0 2006758: 82 10 20 16 mov 0x16, %g1 200675c: c2 22 00 00 st %g1, [ %o0 ] 2006760: 81 c7 e0 08 ret 2006764: 81 e8 00 00 restore } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2006768: f0 08 60 7c ldub [ %g1 + 0x7c ], %i0 } 200676c: 81 c7 e0 08 ret 2006770: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006774 : #include int sched_get_priority_min( int policy ) { 2006774: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006778: 80 a6 20 04 cmp %i0, 4 200677c: 18 80 00 06 bgu 2006794 2006780: 82 10 20 01 mov 1, %g1 2006784: 83 28 40 18 sll %g1, %i0, %g1 2006788: 80 88 60 17 btst 0x17, %g1 200678c: 12 80 00 06 bne 20067a4 <== ALWAYS TAKEN 2006790: b0 10 20 01 mov 1, %i0 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006794: 40 00 22 0c call 200efc4 <__errno> 2006798: b0 10 3f ff mov -1, %i0 200679c: 82 10 20 16 mov 0x16, %g1 20067a0: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 20067a4: 81 c7 e0 08 ret 20067a8: 81 e8 00 00 restore =============================================================================== 020067ac : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 20067ac: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 20067b0: 80 a6 20 00 cmp %i0, 0 20067b4: 02 80 00 0b be 20067e0 <== NEVER TAKEN 20067b8: 80 a6 60 00 cmp %i1, 0 20067bc: 7f ff f2 66 call 2003154 20067c0: 01 00 00 00 nop 20067c4: 80 a6 00 08 cmp %i0, %o0 20067c8: 02 80 00 06 be 20067e0 20067cc: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20067d0: 40 00 21 fd call 200efc4 <__errno> 20067d4: 01 00 00 00 nop 20067d8: 10 80 00 07 b 20067f4 20067dc: 82 10 20 03 mov 3, %g1 ! 3 if ( !interval ) 20067e0: 12 80 00 08 bne 2006800 20067e4: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 20067e8: 40 00 21 f7 call 200efc4 <__errno> 20067ec: 01 00 00 00 nop 20067f0: 82 10 20 16 mov 0x16, %g1 ! 16 20067f4: c2 22 00 00 st %g1, [ %o0 ] 20067f8: 81 c7 e0 08 ret 20067fc: 91 e8 3f ff restore %g0, -1, %o0 _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006800: d0 00 60 c4 ld [ %g1 + 0xc4 ], %o0 2006804: 92 10 00 19 mov %i1, %o1 2006808: 40 00 0e 6c call 200a1b8 <_Timespec_From_ticks> 200680c: b0 10 20 00 clr %i0 return 0; } 2006810: 81 c7 e0 08 ret 2006814: 81 e8 00 00 restore =============================================================================== 02009168 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2009168: 9d e3 bf 90 save %sp, -112, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200916c: 03 00 80 88 sethi %hi(0x2022000), %g1 2009170: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 2022130 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2009174: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2009178: 84 00 a0 01 inc %g2 200917c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2009180: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2009184: fa 27 a0 58 st %i5, [ %fp + 0x58 ] 2009188: c4 20 61 30 st %g2, [ %g1 + 0x130 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200918c: b8 8e 62 00 andcc %i1, 0x200, %i4 2009190: 02 80 00 05 be 20091a4 2009194: ba 10 20 00 clr %i5 va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 2009198: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 200919c: 82 07 a0 54 add %fp, 0x54, %g1 20091a0: c2 27 bf f0 st %g1, [ %fp + -16 ] va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 20091a4: 90 10 00 18 mov %i0, %o0 20091a8: 40 00 19 9c call 200f818 <_POSIX_Semaphore_Name_to_id> 20091ac: 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 ) { 20091b0: b6 92 20 00 orcc %o0, 0, %i3 20091b4: 22 80 00 0e be,a 20091ec 20091b8: 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) ) ) { 20091bc: 80 a6 e0 02 cmp %i3, 2 20091c0: 12 80 00 04 bne 20091d0 <== NEVER TAKEN 20091c4: 80 a7 20 00 cmp %i4, 0 20091c8: 12 80 00 21 bne 200924c 20091cc: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 20091d0: 40 00 0b dc call 200c140 <_Thread_Enable_dispatch> 20091d4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 20091d8: 40 00 25 30 call 2012698 <__errno> 20091dc: 01 00 00 00 nop 20091e0: f6 22 00 00 st %i3, [ %o0 ] 20091e4: 81 c7 e0 08 ret 20091e8: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 20091ec: 80 a6 6a 00 cmp %i1, 0xa00 20091f0: 12 80 00 0a bne 2009218 20091f4: d2 07 bf f4 ld [ %fp + -12 ], %o1 _Thread_Enable_dispatch(); 20091f8: 40 00 0b d2 call 200c140 <_Thread_Enable_dispatch> 20091fc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2009200: 40 00 25 26 call 2012698 <__errno> 2009204: 01 00 00 00 nop 2009208: 82 10 20 11 mov 0x11, %g1 ! 11 200920c: c2 22 00 00 st %g1, [ %o0 ] 2009210: 81 c7 e0 08 ret 2009214: 81 e8 00 00 restore 2009218: 94 07 bf fc add %fp, -4, %o2 200921c: 11 00 80 88 sethi %hi(0x2022000), %o0 2009220: 40 00 08 51 call 200b364 <_Objects_Get> 2009224: 90 12 23 f0 or %o0, 0x3f0, %o0 ! 20223f0 <_POSIX_Semaphore_Information> } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2009228: 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 ); 200922c: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 2009230: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2009234: 40 00 0b c3 call 200c140 <_Thread_Enable_dispatch> 2009238: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 200923c: 40 00 0b c1 call 200c140 <_Thread_Enable_dispatch> 2009240: 01 00 00 00 nop goto return_id; 2009244: 10 80 00 0c b 2009274 2009248: f0 07 bf f8 ld [ %fp + -8 ], %i0 /* * 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( 200924c: 90 10 00 18 mov %i0, %o0 2009250: 92 10 20 00 clr %o1 2009254: 40 00 19 1a call 200f6bc <_POSIX_Semaphore_Create_support> 2009258: 96 07 bf f8 add %fp, -8, %o3 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 200925c: 40 00 0b b9 call 200c140 <_Thread_Enable_dispatch> 2009260: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2009264: 80 a7 7f ff cmp %i5, -1 2009268: 02 bf ff ea be 2009210 200926c: 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; 2009270: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009274: b0 06 20 08 add %i0, 8, %i0 } 2009278: 81 c7 e0 08 ret 200927c: 81 e8 00 00 restore =============================================================================== 020066c0 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 20066c0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 20066c4: 90 96 a0 00 orcc %i2, 0, %o0 20066c8: 02 80 00 09 be 20066ec 20066cc: 83 2e 20 02 sll %i0, 2, %g1 *oact = _POSIX_signals_Vectors[ sig ]; 20066d0: 85 2e 20 04 sll %i0, 4, %g2 20066d4: 82 20 80 01 sub %g2, %g1, %g1 20066d8: 13 00 80 79 sethi %hi(0x201e400), %o1 20066dc: 94 10 20 0c mov 0xc, %o2 20066e0: 92 12 63 00 or %o1, 0x300, %o1 20066e4: 40 00 25 89 call 200fd08 20066e8: 92 02 40 01 add %o1, %g1, %o1 if ( !sig ) 20066ec: 80 a6 20 00 cmp %i0, 0 20066f0: 02 80 00 09 be 2006714 20066f4: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 20066f8: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 20066fc: 80 a0 60 1f cmp %g1, 0x1f 2006700: 18 80 00 05 bgu 2006714 2006704: 01 00 00 00 nop * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006708: 80 a6 20 09 cmp %i0, 9 200670c: 12 80 00 08 bne 200672c 2006710: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006714: 40 00 23 3e call 200f40c <__errno> 2006718: 01 00 00 00 nop 200671c: 82 10 20 16 mov 0x16, %g1 ! 16 2006720: c2 22 00 00 st %g1, [ %o0 ] 2006724: 10 80 00 20 b 20067a4 2006728: 82 10 3f ff mov -1, %g1 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 200672c: 02 80 00 1e be 20067a4 <== NEVER TAKEN 2006730: 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 ); 2006734: 7f ff ef 6d call 20024e8 2006738: 01 00 00 00 nop 200673c: ba 10 00 08 mov %o0, %i5 if ( act->sa_handler == SIG_DFL ) { 2006740: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006744: 39 00 80 79 sethi %hi(0x201e400), %i4 2006748: 80 a0 60 00 cmp %g1, 0 200674c: 12 80 00 0a bne 2006774 2006750: b8 17 23 00 or %i4, 0x300, %i4 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 2006754: 83 2e 20 02 sll %i0, 2, %g1 2006758: 13 00 80 72 sethi %hi(0x201c800), %o1 200675c: b1 2e 20 04 sll %i0, 4, %i0 2006760: 92 12 61 c4 or %o1, 0x1c4, %o1 2006764: b0 26 00 01 sub %i0, %g1, %i0 2006768: 90 07 00 18 add %i4, %i0, %o0 200676c: 10 80 00 09 b 2006790 2006770: 92 02 40 18 add %o1, %i0, %o1 } else { _POSIX_signals_Clear_process_signals( sig ); 2006774: 40 00 17 8d call 200c5a8 <_POSIX_signals_Clear_process_signals> 2006778: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 200677c: 83 2e 20 02 sll %i0, 2, %g1 2006780: 92 10 00 19 mov %i1, %o1 2006784: b1 2e 20 04 sll %i0, 4, %i0 2006788: 90 26 00 01 sub %i0, %g1, %o0 200678c: 90 07 00 08 add %i4, %o0, %o0 2006790: 40 00 25 5e call 200fd08 2006794: 94 10 20 0c mov 0xc, %o2 } _ISR_Enable( level ); 2006798: 7f ff ef 58 call 20024f8 200679c: 90 10 00 1d mov %i5, %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; 20067a0: 82 10 20 00 clr %g1 } 20067a4: 81 c7 e0 08 ret 20067a8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006b80 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2006b80: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2006b84: ba 96 20 00 orcc %i0, 0, %i5 2006b88: 02 80 00 0f be 2006bc4 2006b8c: 01 00 00 00 nop /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2006b90: 80 a6 a0 00 cmp %i2, 0 2006b94: 02 80 00 12 be 2006bdc 2006b98: a0 10 20 00 clr %l0 if ( !_Timespec_Is_valid( timeout ) ) 2006b9c: 40 00 0e 9a call 200a604 <_Timespec_Is_valid> 2006ba0: 90 10 00 1a mov %i2, %o0 2006ba4: 80 8a 20 ff btst 0xff, %o0 2006ba8: 02 80 00 07 be 2006bc4 2006bac: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2006bb0: 40 00 0e b7 call 200a68c <_Timespec_To_ticks> 2006bb4: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2006bb8: a0 92 20 00 orcc %o0, 0, %l0 2006bbc: 12 80 00 09 bne 2006be0 <== ALWAYS TAKEN 2006bc0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006bc4: 40 00 23 dd call 200fb38 <__errno> 2006bc8: b0 10 3f ff mov -1, %i0 2006bcc: 82 10 20 16 mov 0x16, %g1 2006bd0: c2 22 00 00 st %g1, [ %o0 ] 2006bd4: 81 c7 e0 08 ret 2006bd8: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2006bdc: 80 a6 60 00 cmp %i1, 0 2006be0: 22 80 00 02 be,a 2006be8 2006be4: b2 07 bf f4 add %fp, -12, %i1 the_thread = _Thread_Executing; 2006be8: 31 00 80 7b sethi %hi(0x201ec00), %i0 2006bec: b0 16 22 b8 or %i0, 0x2b8, %i0 ! 201eeb8 <_Per_CPU_Information> 2006bf0: f4 06 20 0c ld [ %i0 + 0xc ], %i2 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2006bf4: 7f ff ef 18 call 2002854 2006bf8: f6 06 a1 5c ld [ %i2 + 0x15c ], %i3 2006bfc: b8 10 00 08 mov %o0, %i4 if ( *set & api->signals_pending ) { 2006c00: c4 07 40 00 ld [ %i5 ], %g2 2006c04: c2 06 e0 d4 ld [ %i3 + 0xd4 ], %g1 2006c08: 80 88 80 01 btst %g2, %g1 2006c0c: 22 80 00 13 be,a 2006c58 2006c10: 03 00 80 7c sethi %hi(0x201f000), %g1 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2006c14: 7f ff ff c3 call 2006b20 <_POSIX_signals_Get_lowest> 2006c18: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( 2006c1c: 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 ); 2006c20: 92 10 00 08 mov %o0, %o1 2006c24: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 2006c28: 96 10 20 00 clr %o3 2006c2c: 90 10 00 1b mov %i3, %o0 2006c30: 40 00 18 59 call 200cd94 <_POSIX_signals_Clear_signals> 2006c34: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2006c38: 7f ff ef 0b call 2002864 2006c3c: 90 10 00 1c mov %i4, %o0 the_info->si_code = SI_USER; 2006c40: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2006c44: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2006c48: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2006c4c: f0 06 40 00 ld [ %i1 ], %i0 2006c50: 81 c7 e0 08 ret 2006c54: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2006c58: c2 00 61 04 ld [ %g1 + 0x104 ], %g1 2006c5c: 80 88 80 01 btst %g2, %g1 2006c60: 22 80 00 13 be,a 2006cac 2006c64: 82 10 3f ff mov -1, %g1 signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006c68: 7f ff ff ae call 2006b20 <_POSIX_signals_Get_lowest> 2006c6c: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006c70: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006c74: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006c78: 96 10 20 01 mov 1, %o3 2006c7c: 90 10 00 1b mov %i3, %o0 2006c80: 92 10 00 18 mov %i0, %o1 2006c84: 40 00 18 44 call 200cd94 <_POSIX_signals_Clear_signals> 2006c88: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2006c8c: 7f ff ee f6 call 2002864 2006c90: 90 10 00 1c mov %i4, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2006c94: 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; 2006c98: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2006c9c: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2006ca0: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2006ca4: 81 c7 e0 08 ret 2006ca8: 81 e8 00 00 restore } the_info->si_signo = -1; 2006cac: c2 26 40 00 st %g1, [ %i1 ] 2006cb0: 03 00 80 7a sethi %hi(0x201e800), %g1 2006cb4: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 201e980 <_Thread_Dispatch_disable_level> 2006cb8: 84 00 a0 01 inc %g2 2006cbc: c4 20 61 80 st %g2, [ %g1 + 0x180 ] _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2006cc0: 82 10 20 04 mov 4, %g1 2006cc4: c2 26 a0 34 st %g1, [ %i2 + 0x34 ] the_thread->Wait.option = *set; 2006cc8: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2006ccc: f2 26 a0 28 st %i1, [ %i2 + 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; 2006cd0: c2 26 a0 30 st %g1, [ %i2 + 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; 2006cd4: b8 10 20 01 mov 1, %i4 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2006cd8: 23 00 80 7c sethi %hi(0x201f000), %l1 2006cdc: a2 14 60 9c or %l1, 0x9c, %l1 ! 201f09c <_POSIX_signals_Wait_queue> 2006ce0: e2 26 a0 44 st %l1, [ %i2 + 0x44 ] 2006ce4: f8 24 60 30 st %i4, [ %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 ); 2006ce8: 7f ff ee df call 2002864 2006cec: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2006cf0: 90 10 00 11 mov %l1, %o0 2006cf4: 92 10 00 10 mov %l0, %o1 2006cf8: 15 00 80 28 sethi %hi(0x200a000), %o2 2006cfc: 40 00 0c 9b call 2009f68 <_Thread_queue_Enqueue_with_handler> 2006d00: 94 12 a2 cc or %o2, 0x2cc, %o2 ! 200a2cc <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2006d04: 40 00 0b 60 call 2009a84 <_Thread_Enable_dispatch> 2006d08: 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 ); 2006d0c: d2 06 40 00 ld [ %i1 ], %o1 2006d10: 90 10 00 1b mov %i3, %o0 2006d14: 94 10 00 19 mov %i1, %o2 2006d18: 96 10 20 00 clr %o3 2006d1c: 40 00 18 1e call 200cd94 <_POSIX_signals_Clear_signals> 2006d20: 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) 2006d24: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2006d28: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006d2c: 80 a0 60 04 cmp %g1, 4 2006d30: 12 80 00 09 bne 2006d54 2006d34: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2006d38: f0 06 40 00 ld [ %i1 ], %i0 2006d3c: 82 06 3f ff add %i0, -1, %g1 2006d40: b9 2f 00 01 sll %i4, %g1, %i4 2006d44: c2 07 40 00 ld [ %i5 ], %g1 2006d48: 80 8f 00 01 btst %i4, %g1 2006d4c: 12 80 00 08 bne 2006d6c 2006d50: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; 2006d54: 40 00 23 79 call 200fb38 <__errno> 2006d58: b0 10 3f ff mov -1, %i0 ! ffffffff 2006d5c: 03 00 80 7b sethi %hi(0x201ec00), %g1 2006d60: c2 00 62 c4 ld [ %g1 + 0x2c4 ], %g1 ! 201eec4 <_Per_CPU_Information+0xc> 2006d64: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006d68: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2006d6c: 81 c7 e0 08 ret 2006d70: 81 e8 00 00 restore =============================================================================== 02008a90 : int sigwait( const sigset_t *set, int *sig ) { 2008a90: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008a94: 92 10 20 00 clr %o1 2008a98: 90 10 00 18 mov %i0, %o0 2008a9c: 7f ff ff 7c call 200888c 2008aa0: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008aa4: 80 a2 3f ff cmp %o0, -1 2008aa8: 02 80 00 07 be 2008ac4 2008aac: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008ab0: 02 80 00 03 be 2008abc <== NEVER TAKEN 2008ab4: b0 10 20 00 clr %i0 *sig = status; 2008ab8: d0 26 40 00 st %o0, [ %i1 ] 2008abc: 81 c7 e0 08 ret 2008ac0: 81 e8 00 00 restore return 0; } return errno; 2008ac4: 40 00 22 ba call 20115ac <__errno> 2008ac8: 01 00 00 00 nop 2008acc: f0 02 00 00 ld [ %o0 ], %i0 } 2008ad0: 81 c7 e0 08 ret 2008ad4: 81 e8 00 00 restore =============================================================================== 02005a50 : */ long sysconf( int name ) { 2005a50: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005a54: 80 a6 20 02 cmp %i0, 2 2005a58: 12 80 00 09 bne 2005a7c 2005a5c: 03 00 80 58 sethi %hi(0x2016000), %g1 return (TOD_MICROSECONDS_PER_SECOND / 2005a60: 03 00 80 57 sethi %hi(0x2015c00), %g1 2005a64: d2 00 62 f8 ld [ %g1 + 0x2f8 ], %o1 ! 2015ef8 2005a68: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005a6c: 40 00 32 84 call 201247c <.udiv> 2005a70: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005a74: 81 c7 e0 08 ret 2005a78: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005a7c: 80 a6 20 04 cmp %i0, 4 2005a80: 02 80 00 10 be 2005ac0 2005a84: d0 00 60 30 ld [ %g1 + 0x30 ], %o0 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005a88: 80 a6 20 33 cmp %i0, 0x33 2005a8c: 02 80 00 0d be 2005ac0 2005a90: 90 10 24 00 mov 0x400, %o0 return 1024; if ( name == _SC_PAGESIZE ) 2005a94: 80 a6 20 08 cmp %i0, 8 2005a98: 02 80 00 0a be 2005ac0 2005a9c: 11 00 00 04 sethi %hi(0x1000), %o0 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005aa0: 80 a6 22 03 cmp %i0, 0x203 2005aa4: 02 80 00 07 be 2005ac0 <== NEVER TAKEN 2005aa8: 90 10 20 00 clr %o0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005aac: 40 00 23 2f call 200e768 <__errno> 2005ab0: 01 00 00 00 nop 2005ab4: 82 10 20 16 mov 0x16, %g1 ! 16 2005ab8: c2 22 00 00 st %g1, [ %o0 ] 2005abc: 90 10 3f ff mov -1, %o0 } 2005ac0: b0 10 00 08 mov %o0, %i0 2005ac4: 81 c7 e0 08 ret 2005ac8: 81 e8 00 00 restore =============================================================================== 02005de8 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2005de8: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2005dec: 80 a6 20 01 cmp %i0, 1 2005df0: 12 80 00 15 bne 2005e44 2005df4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2005df8: 80 a6 a0 00 cmp %i2, 0 2005dfc: 02 80 00 12 be 2005e44 2005e00: 01 00 00 00 nop /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 2005e04: 80 a6 60 00 cmp %i1, 0 2005e08: 02 80 00 13 be 2005e54 2005e0c: 03 00 80 74 sethi %hi(0x201d000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2005e10: c2 06 40 00 ld [ %i1 ], %g1 2005e14: 82 00 7f ff add %g1, -1, %g1 2005e18: 80 a0 60 01 cmp %g1, 1 2005e1c: 18 80 00 0a bgu 2005e44 <== NEVER TAKEN 2005e20: 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 ) 2005e24: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005e28: 80 a0 60 00 cmp %g1, 0 2005e2c: 02 80 00 06 be 2005e44 <== NEVER TAKEN 2005e30: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2005e34: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2005e38: 80 a0 60 1f cmp %g1, 0x1f 2005e3c: 28 80 00 06 bleu,a 2005e54 <== ALWAYS TAKEN 2005e40: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005e44: 40 00 24 51 call 200ef88 <__errno> 2005e48: 01 00 00 00 nop 2005e4c: 10 80 00 10 b 2005e8c 2005e50: 82 10 20 16 mov 0x16, %g1 ! 16 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2005e54: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 2005e58: 84 00 a0 01 inc %g2 2005e5c: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ] * 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 ); 2005e60: 11 00 80 74 sethi %hi(0x201d000), %o0 2005e64: 40 00 07 d4 call 2007db4 <_Objects_Allocate> 2005e68: 90 12 23 f0 or %o0, 0x3f0, %o0 ! 201d3f0 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2005e6c: 80 a2 20 00 cmp %o0, 0 2005e70: 12 80 00 0a bne 2005e98 2005e74: 82 10 20 02 mov 2, %g1 _Thread_Enable_dispatch(); 2005e78: 40 00 0c 62 call 2009000 <_Thread_Enable_dispatch> 2005e7c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2005e80: 40 00 24 42 call 200ef88 <__errno> 2005e84: 01 00 00 00 nop 2005e88: 82 10 20 0b mov 0xb, %g1 ! b 2005e8c: c2 22 00 00 st %g1, [ %o0 ] 2005e90: 81 c7 e0 08 ret 2005e94: 91 e8 3f ff restore %g0, -1, %o0 } /* The data of the created timer are stored to use them later */ ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; 2005e98: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2005e9c: 03 00 80 75 sethi %hi(0x201d400), %g1 2005ea0: c2 00 62 34 ld [ %g1 + 0x234 ], %g1 ! 201d634 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2005ea4: 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; 2005ea8: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2005eac: 02 80 00 08 be 2005ecc 2005eb0: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2005eb4: c2 06 40 00 ld [ %i1 ], %g1 2005eb8: c2 22 20 40 st %g1, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2005ebc: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005ec0: c2 22 20 44 st %g1, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2005ec4: c2 06 60 08 ld [ %i1 + 8 ], %g1 2005ec8: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005ecc: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005ed0: 07 00 80 75 sethi %hi(0x201d400), %g3 2005ed4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 ! 201d40c <_POSIX_Timer_Information+0x1c> } ptimer->overrun = 0; 2005ed8: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2005edc: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2005ee0: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2005ee4: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2005ee8: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005eec: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2005ef0: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2005ef4: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2005ef8: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005efc: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f00: 85 28 a0 02 sll %g2, 2, %g2 2005f04: 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; 2005f08: 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; 2005f0c: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2005f10: 40 00 0c 3c call 2009000 <_Thread_Enable_dispatch> 2005f14: b0 10 20 00 clr %i0 return 0; } 2005f18: 81 c7 e0 08 ret 2005f1c: 81 e8 00 00 restore =============================================================================== 02005f20 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2005f20: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2005f24: 80 a6 a0 00 cmp %i2, 0 2005f28: 02 80 00 20 be 2005fa8 <== NEVER TAKEN 2005f2c: 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) ) ) { 2005f30: 40 00 0f 24 call 2009bc0 <_Timespec_Is_valid> 2005f34: 90 06 a0 08 add %i2, 8, %o0 2005f38: 80 8a 20 ff btst 0xff, %o0 2005f3c: 02 80 00 1b be 2005fa8 2005f40: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2005f44: 40 00 0f 1f call 2009bc0 <_Timespec_Is_valid> 2005f48: 90 10 00 1a mov %i2, %o0 2005f4c: 80 8a 20 ff btst 0xff, %o0 2005f50: 02 80 00 16 be 2005fa8 <== NEVER TAKEN 2005f54: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2005f58: 80 a6 60 00 cmp %i1, 0 2005f5c: 02 80 00 05 be 2005f70 2005f60: 90 07 bf e4 add %fp, -28, %o0 2005f64: 80 a6 60 04 cmp %i1, 4 2005f68: 12 80 00 10 bne 2005fa8 2005f6c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2005f70: 92 10 00 1a mov %i2, %o1 2005f74: 40 00 26 5a call 200f8dc 2005f78: 94 10 20 10 mov 0x10, %o2 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2005f7c: 80 a6 60 04 cmp %i1, 4 2005f80: 12 80 00 14 bne 2005fd0 2005f84: 92 10 00 18 mov %i0, %o1 struct timespec now; _TOD_Get( &now ); 2005f88: 40 00 06 17 call 20077e4 <_TOD_Get> 2005f8c: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2005f90: 90 07 bf f4 add %fp, -12, %o0 2005f94: 40 00 0e fb call 2009b80 <_Timespec_Greater_than> 2005f98: 92 07 bf ec add %fp, -20, %o1 2005f9c: 80 8a 20 ff btst 0xff, %o0 2005fa0: 02 80 00 08 be 2005fc0 2005fa4: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005fa8: 40 00 23 f8 call 200ef88 <__errno> 2005fac: b0 10 3f ff mov -1, %i0 2005fb0: 82 10 20 16 mov 0x16, %g1 2005fb4: c2 22 00 00 st %g1, [ %o0 ] 2005fb8: 81 c7 e0 08 ret 2005fbc: 81 e8 00 00 restore _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2005fc0: 90 07 bf f4 add %fp, -12, %o0 2005fc4: 40 00 0f 10 call 2009c04 <_Timespec_Subtract> 2005fc8: 94 10 00 09 mov %o1, %o2 RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 2005fcc: 92 10 00 18 mov %i0, %o1 2005fd0: 11 00 80 74 sethi %hi(0x201d000), %o0 2005fd4: 94 07 bf fc add %fp, -4, %o2 2005fd8: 40 00 08 b2 call 20082a0 <_Objects_Get> 2005fdc: 90 12 23 f0 or %o0, 0x3f0, %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 ) { 2005fe0: c2 07 bf fc ld [ %fp + -4 ], %g1 2005fe4: 80 a0 60 00 cmp %g1, 0 2005fe8: 12 80 00 39 bne 20060cc 2005fec: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { 2005ff0: c2 07 bf ec ld [ %fp + -20 ], %g1 2005ff4: 80 a0 60 00 cmp %g1, 0 2005ff8: 12 80 00 14 bne 2006048 2005ffc: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006000: 80 a0 60 00 cmp %g1, 0 2006004: 12 80 00 11 bne 2006048 2006008: 01 00 00 00 nop /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 200600c: 40 00 10 32 call 200a0d4 <_Watchdog_Remove> 2006010: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2006014: 80 a6 e0 00 cmp %i3, 0 2006018: 02 80 00 05 be 200602c 200601c: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2006020: 92 06 20 54 add %i0, 0x54, %o1 2006024: 40 00 26 2e call 200f8dc 2006028: 94 10 20 10 mov 0x10, %o2 /* The new data are set */ ptimer->timer_data = normalize; 200602c: 90 06 20 54 add %i0, 0x54, %o0 2006030: 92 07 bf e4 add %fp, -28, %o1 2006034: 40 00 26 2a call 200f8dc 2006038: 94 10 20 10 mov 0x10, %o2 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 200603c: 82 10 20 04 mov 4, %g1 2006040: 10 80 00 1f b 20060bc 2006044: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); 2006048: 40 00 0f 00 call 2009c48 <_Timespec_To_ticks> 200604c: 90 10 00 1a mov %i2, %o0 2006050: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006054: 40 00 0e fd call 2009c48 <_Timespec_To_ticks> 2006058: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 200605c: d4 06 20 08 ld [ %i0 + 8 ], %o2 return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006060: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2006064: 17 00 80 18 sethi %hi(0x2006000), %o3 2006068: 90 06 20 10 add %i0, 0x10, %o0 200606c: 96 12 e0 e4 or %o3, 0xe4, %o3 2006070: 40 00 19 1d call 200c4e4 <_POSIX_Timer_Insert_helper> 2006074: 98 10 00 18 mov %i0, %o4 initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 2006078: 80 8a 20 ff btst 0xff, %o0 200607c: 02 80 00 10 be 20060bc 2006080: 01 00 00 00 nop /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 2006084: 80 a6 e0 00 cmp %i3, 0 2006088: 02 80 00 05 be 200609c 200608c: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2006090: 92 06 20 54 add %i0, 0x54, %o1 2006094: 40 00 26 12 call 200f8dc 2006098: 94 10 20 10 mov 0x10, %o2 ptimer->timer_data = normalize; 200609c: 90 06 20 54 add %i0, 0x54, %o0 20060a0: 92 07 bf e4 add %fp, -28, %o1 20060a4: 40 00 26 0e call 200f8dc 20060a8: 94 10 20 10 mov 0x10, %o2 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20060ac: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 20060b0: 90 06 20 6c add %i0, 0x6c, %o0 20060b4: 40 00 05 cc call 20077e4 <_TOD_Get> 20060b8: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); 20060bc: 40 00 0b d1 call 2009000 <_Thread_Enable_dispatch> 20060c0: b0 10 20 00 clr %i0 return 0; 20060c4: 81 c7 e0 08 ret 20060c8: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 20060cc: 40 00 23 af call 200ef88 <__errno> 20060d0: b0 10 3f ff mov -1, %i0 20060d4: 82 10 20 16 mov 0x16, %g1 20060d8: c2 22 00 00 st %g1, [ %o0 ] } 20060dc: 81 c7 e0 08 ret 20060e0: 81 e8 00 00 restore =============================================================================== 02005ce0 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2005ce0: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2005ce4: 39 00 80 60 sethi %hi(0x2018000), %i4 2005ce8: b8 17 23 68 or %i4, 0x368, %i4 ! 2018368 <_POSIX_signals_Ualarm_timer> 2005cec: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 2005cf0: 80 a0 60 00 cmp %g1, 0 2005cf4: 12 80 00 0a bne 2005d1c 2005cf8: ba 10 00 18 mov %i0, %i5 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005cfc: 03 00 80 17 sethi %hi(0x2005c00), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005d00: c0 27 20 08 clr [ %i4 + 8 ] the_watchdog->routine = routine; 2005d04: 82 10 60 b4 or %g1, 0xb4, %g1 the_watchdog->id = id; 2005d08: c0 27 20 20 clr [ %i4 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005d0c: c2 27 20 1c st %g1, [ %i4 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2005d10: c0 27 20 24 clr [ %i4 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2005d14: 10 80 00 1b b 2005d80 2005d18: b0 10 20 00 clr %i0 if ( !the_timer->routine ) { _Watchdog_Initialize( the_timer, _POSIX_signals_Ualarm_TSR, 0, NULL ); } else { Watchdog_States state; state = _Watchdog_Remove( the_timer ); 2005d1c: 40 00 0f c0 call 2009c1c <_Watchdog_Remove> 2005d20: 90 10 00 1c mov %i4, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2005d24: 90 02 3f fe add %o0, -2, %o0 2005d28: 80 a2 20 01 cmp %o0, 1 2005d2c: 18 80 00 15 bgu 2005d80 <== NEVER TAKEN 2005d30: 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); 2005d34: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2005d38: d0 07 20 14 ld [ %i4 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005d3c: 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); 2005d40: 90 02 00 01 add %o0, %g1, %o0 2005d44: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005d48: 40 00 0e 45 call 200965c <_Timespec_From_ticks> 2005d4c: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2005d50: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2005d54: 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; 2005d58: b1 28 60 08 sll %g1, 8, %i0 2005d5c: 85 28 60 03 sll %g1, 3, %g2 2005d60: 84 26 00 02 sub %i0, %g2, %g2 remaining += tp.tv_nsec / 1000; 2005d64: 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; 2005d68: b1 28 a0 06 sll %g2, 6, %i0 2005d6c: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2005d70: 40 00 36 a9 call 2013814 <.div> 2005d74: 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; 2005d78: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2005d7c: b0 02 00 18 add %o0, %i0, %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 ) { 2005d80: 80 a7 60 00 cmp %i5, 0 2005d84: 02 80 00 19 be 2005de8 2005d88: 39 00 03 d0 sethi %hi(0xf4000), %i4 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2005d8c: 90 10 00 1d mov %i5, %o0 2005d90: 40 00 36 9f call 201380c <.udiv> 2005d94: 92 17 22 40 or %i4, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005d98: 92 17 22 40 or %i4, 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; 2005d9c: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005da0: 40 00 37 47 call 2013abc <.urem> 2005da4: 90 10 00 1d mov %i5, %o0 2005da8: 85 2a 20 07 sll %o0, 7, %g2 2005dac: 83 2a 20 02 sll %o0, 2, %g1 2005db0: 82 20 80 01 sub %g2, %g1, %g1 2005db4: 90 00 40 08 add %g1, %o0, %o0 2005db8: 91 2a 20 03 sll %o0, 3, %o0 2005dbc: d0 27 bf fc st %o0, [ %fp + -4 ] ticks = _Timespec_To_ticks( &tp ); 2005dc0: 40 00 0e 4d call 20096f4 <_Timespec_To_ticks> 2005dc4: 90 07 bf f8 add %fp, -8, %o0 if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2005dc8: 40 00 0e 4b call 20096f4 <_Timespec_To_ticks> 2005dcc: 90 07 bf f8 add %fp, -8, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2005dd0: 13 00 80 60 sethi %hi(0x2018000), %o1 2005dd4: 92 12 63 68 or %o1, 0x368, %o1 ! 2018368 <_POSIX_signals_Ualarm_timer> 2005dd8: d0 22 60 0c st %o0, [ %o1 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005ddc: 11 00 80 5e sethi %hi(0x2017800), %o0 2005de0: 40 00 0f 34 call 2009ab0 <_Watchdog_Insert> 2005de4: 90 12 23 24 or %o0, 0x324, %o0 ! 2017b24 <_Watchdog_Ticks_chain> } return remaining; } 2005de8: 81 c7 e0 08 ret 2005dec: 81 e8 00 00 restore