=============================================================================== 0200a930 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200a930: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 200a934: 03 00 80 84 sethi %hi(0x2021000), %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 ); 200a938: 7f ff e4 aa call 2003be0 200a93c: fa 00 61 2c ld [ %g1 + 0x12c ], %i5 ! 202112c <_Per_CPU_Information+0xc> 200a940: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 200a944: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200a948: 80 a0 60 00 cmp %g1, 0 200a94c: 12 80 00 08 bne 200a96c <_CORE_RWLock_Release+0x3c> 200a950: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); 200a954: 7f ff e4 a7 call 2003bf0 200a958: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200a95c: 82 10 20 02 mov 2, %g1 200a960: c2 27 60 34 st %g1, [ %i5 + 0x34 ] 200a964: 81 c7 e0 08 ret 200a968: 81 e8 00 00 restore return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 200a96c: 32 80 00 0b bne,a 200a998 <_CORE_RWLock_Release+0x68> 200a970: c0 27 60 34 clr [ %i5 + 0x34 ] the_rwlock->number_of_readers -= 1; 200a974: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200a978: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200a97c: 80 a0 60 00 cmp %g1, 0 200a980: 02 80 00 05 be 200a994 <_CORE_RWLock_Release+0x64> 200a984: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 200a988: 7f ff e4 9a call 2003bf0 200a98c: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 200a990: 30 80 00 24 b,a 200aa20 <_CORE_RWLock_Release+0xf0> } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 200a994: 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; 200a998: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200a99c: 7f ff e4 95 call 2003bf0 200a9a0: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 200a9a4: 40 00 07 9d call 200c818 <_Thread_queue_Dequeue> 200a9a8: 90 10 00 18 mov %i0, %o0 if ( next ) { 200a9ac: 80 a2 20 00 cmp %o0, 0 200a9b0: 22 80 00 1c be,a 200aa20 <_CORE_RWLock_Release+0xf0> 200a9b4: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200a9b8: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200a9bc: 80 a0 60 01 cmp %g1, 1 200a9c0: 32 80 00 05 bne,a 200a9d4 <_CORE_RWLock_Release+0xa4> 200a9c4: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 200a9c8: 82 10 20 02 mov 2, %g1 return CORE_RWLOCK_SUCCESSFUL; 200a9cc: 10 80 00 14 b 200aa1c <_CORE_RWLock_Release+0xec> 200a9d0: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200a9d4: 82 00 60 01 inc %g1 200a9d8: c2 26 20 48 st %g1, [ %i0 + 0x48 ] the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200a9dc: 82 10 20 01 mov 1, %g1 200a9e0: 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 ); 200a9e4: 40 00 08 c9 call 200cd08 <_Thread_queue_First> 200a9e8: 90 10 00 18 mov %i0, %o0 if ( !next || 200a9ec: 92 92 20 00 orcc %o0, 0, %o1 200a9f0: 22 80 00 0c be,a 200aa20 <_CORE_RWLock_Release+0xf0> 200a9f4: b0 10 20 00 clr %i0 200a9f8: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 200a9fc: 80 a0 60 01 cmp %g1, 1 200aa00: 02 80 00 07 be 200aa1c <_CORE_RWLock_Release+0xec> <== NEVER TAKEN 200aa04: 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; 200aa08: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200aa0c: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200aa10: 40 00 08 6f call 200cbcc <_Thread_queue_Extract> 200aa14: c2 26 20 48 st %g1, [ %i0 + 0x48 ] } 200aa18: 30 bf ff f3 b,a 200a9e4 <_CORE_RWLock_Release+0xb4> } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200aa1c: b0 10 20 00 clr %i0 200aa20: 81 c7 e0 08 ret 200aa24: 81 e8 00 00 restore =============================================================================== 0200aa28 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200aa28: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200aa2c: 90 10 00 18 mov %i0, %o0 200aa30: 40 00 06 a2 call 200c4b8 <_Thread_Get> 200aa34: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200aa38: c2 07 bf fc ld [ %fp + -4 ], %g1 200aa3c: 80 a0 60 00 cmp %g1, 0 200aa40: 12 80 00 09 bne 200aa64 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 200aa44: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200aa48: 40 00 08 ed call 200cdfc <_Thread_queue_Process_timeout> 200aa4c: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200aa50: 03 00 80 82 sethi %hi(0x2020800), %g1 200aa54: c4 00 63 f0 ld [ %g1 + 0x3f0 ], %g2 ! 2020bf0 <_Thread_Dispatch_disable_level> 200aa58: 84 00 bf ff add %g2, -1, %g2 200aa5c: c4 20 63 f0 st %g2, [ %g1 + 0x3f0 ] return _Thread_Dispatch_disable_level; 200aa60: c2 00 63 f0 ld [ %g1 + 0x3f0 ], %g1 200aa64: 81 c7 e0 08 ret 200aa68: 81 e8 00 00 restore =============================================================================== 0200877c <_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 ) { 200877c: 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)) ) { 2008780: 90 10 00 18 mov %i0, %o0 2008784: 40 00 07 6e call 200a53c <_Thread_queue_Dequeue> 2008788: ba 10 00 18 mov %i0, %i5 200878c: 80 a2 20 00 cmp %o0, 0 2008790: 12 80 00 0e bne 20087c8 <_CORE_semaphore_Surrender+0x4c> 2008794: 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 ); 2008798: 7f ff e7 cb call 20026c4 200879c: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 20087a0: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 20087a4: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 20087a8: 80 a0 40 02 cmp %g1, %g2 20087ac: 1a 80 00 05 bcc 20087c0 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 20087b0: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 20087b4: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 20087b8: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 20087bc: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 20087c0: 7f ff e7 c5 call 20026d4 20087c4: 01 00 00 00 nop } return status; } 20087c8: 81 c7 e0 08 ret 20087cc: 81 e8 00 00 restore =============================================================================== 02007464 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2007464: 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 ]; 2007468: f8 06 21 58 ld [ %i0 + 0x158 ], %i4 option_set = (rtems_option) the_thread->Wait.option; 200746c: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 _ISR_Disable( level ); 2007470: 7f ff ec 95 call 20026c4 2007474: ba 10 00 18 mov %i0, %i5 2007478: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 200747c: c4 07 00 00 ld [ %i4 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2007480: 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 ) ) { 2007484: 82 88 c0 02 andcc %g3, %g2, %g1 2007488: 02 80 00 42 be 2007590 <_Event_Surrender+0x12c> 200748c: 09 00 80 78 sethi %hi(0x201e000), %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() && 2007490: 88 11 20 10 or %g4, 0x10, %g4 ! 201e010 <_Per_CPU_Information> 2007494: f4 01 20 08 ld [ %g4 + 8 ], %i2 2007498: 80 a6 a0 00 cmp %i2, 0 200749c: 22 80 00 1d be,a 2007510 <_Event_Surrender+0xac> 20074a0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 20074a4: c8 01 20 0c ld [ %g4 + 0xc ], %g4 20074a8: 80 a7 40 04 cmp %i5, %g4 20074ac: 32 80 00 19 bne,a 2007510 <_Event_Surrender+0xac> 20074b0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 20074b4: 09 00 80 79 sethi %hi(0x201e400), %g4 20074b8: f4 01 20 10 ld [ %g4 + 0x10 ], %i2 ! 201e410 <_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 ) && 20074bc: 80 a6 a0 02 cmp %i2, 2 20074c0: 02 80 00 07 be 20074dc <_Event_Surrender+0x78> <== NEVER TAKEN 20074c4: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 20074c8: c8 01 20 10 ld [ %g4 + 0x10 ], %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) || 20074cc: 80 a1 20 01 cmp %g4, 1 20074d0: 32 80 00 10 bne,a 2007510 <_Event_Surrender+0xac> 20074d4: 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) ) { 20074d8: 80 a0 40 03 cmp %g1, %g3 20074dc: 02 80 00 04 be 20074ec <_Event_Surrender+0x88> 20074e0: 80 8e e0 02 btst 2, %i3 20074e4: 02 80 00 2b be 2007590 <_Event_Surrender+0x12c> <== NEVER TAKEN 20074e8: 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) ); 20074ec: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 20074f0: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20074f4: 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; 20074f8: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20074fc: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2007500: 84 10 20 03 mov 3, %g2 2007504: 03 00 80 79 sethi %hi(0x201e400), %g1 2007508: c4 20 60 10 st %g2, [ %g1 + 0x10 ] ! 201e410 <_Event_Sync_state> 200750c: 30 80 00 21 b,a 2007590 <_Event_Surrender+0x12c> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2007510: 80 89 21 00 btst 0x100, %g4 2007514: 02 80 00 1f be 2007590 <_Event_Surrender+0x12c> 2007518: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 200751c: 02 80 00 04 be 200752c <_Event_Surrender+0xc8> 2007520: 80 8e e0 02 btst 2, %i3 2007524: 02 80 00 1b be 2007590 <_Event_Surrender+0x12c> <== NEVER TAKEN 2007528: 01 00 00 00 nop 200752c: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2007530: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007534: 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; 2007538: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200753c: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 2007540: 7f ff ec 65 call 20026d4 2007544: 90 10 00 18 mov %i0, %o0 2007548: 7f ff ec 5f call 20026c4 200754c: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2007550: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 2007554: 80 a0 60 02 cmp %g1, 2 2007558: 02 80 00 06 be 2007570 <_Event_Surrender+0x10c> 200755c: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2007560: 7f ff ec 5d call 20026d4 2007564: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007568: 10 80 00 08 b 2007588 <_Event_Surrender+0x124> 200756c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2007570: c2 27 60 50 st %g1, [ %i5 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2007574: 7f ff ec 58 call 20026d4 2007578: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 200757c: 40 00 0e ae call 200b034 <_Watchdog_Remove> 2007580: 90 07 60 48 add %i5, 0x48, %o0 2007584: b2 16 63 f8 or %i1, 0x3f8, %i1 2007588: 40 00 0a 28 call 2009e28 <_Thread_Clear_state> 200758c: 91 e8 00 1d restore %g0, %i5, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2007590: 7f ff ec 51 call 20026d4 2007594: 81 e8 00 00 restore =============================================================================== 02007598 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2007598: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 200759c: 90 10 00 18 mov %i0, %o0 20075a0: 40 00 0b 0f call 200a1dc <_Thread_Get> 20075a4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20075a8: c2 07 bf fc ld [ %fp + -4 ], %g1 20075ac: 80 a0 60 00 cmp %g1, 0 20075b0: 12 80 00 1d bne 2007624 <_Event_Timeout+0x8c> <== NEVER TAKEN 20075b4: 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 ); 20075b8: 7f ff ec 43 call 20026c4 20075bc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20075c0: 03 00 80 78 sethi %hi(0x201e000), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 20075c4: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 ! 201e01c <_Per_CPU_Information+0xc> 20075c8: 80 a7 40 01 cmp %i5, %g1 20075cc: 12 80 00 09 bne 20075f0 <_Event_Timeout+0x58> 20075d0: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 20075d4: 03 00 80 79 sethi %hi(0x201e400), %g1 20075d8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 ! 201e410 <_Event_Sync_state> 20075dc: 80 a0 a0 01 cmp %g2, 1 20075e0: 32 80 00 05 bne,a 20075f4 <_Event_Timeout+0x5c> 20075e4: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 20075e8: 84 10 20 02 mov 2, %g2 20075ec: c4 20 60 10 st %g2, [ %g1 + 0x10 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 20075f0: 82 10 20 06 mov 6, %g1 20075f4: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20075f8: 7f ff ec 37 call 20026d4 20075fc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007600: 90 10 00 1d mov %i5, %o0 2007604: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007608: 40 00 0a 08 call 2009e28 <_Thread_Clear_state> 200760c: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2007610: 03 00 80 76 sethi %hi(0x201d800), %g1 2007614: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 2007618: 84 00 bf ff add %g2, -1, %g2 200761c: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 2007620: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 2007624: 81 c7 e0 08 ret 2007628: 81 e8 00 00 restore =============================================================================== 0200d750 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200d750: 9d e3 bf 90 save %sp, -112, %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; 200d754: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d758: 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; 200d75c: 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; 200d760: ea 06 20 20 ld [ %i0 + 0x20 ], %l5 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; 200d764: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 uintptr_t const min_block_size = heap->min_block_size; 200d768: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const free_size = stats->free_size; uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200d76c: 80 a7 40 19 cmp %i5, %i1 200d770: 1a 80 00 04 bcc 200d780 <_Heap_Extend+0x30> 200d774: e6 06 20 30 ld [ %i0 + 0x30 ], %l3 return false; 200d778: 10 80 00 a2 b 200da00 <_Heap_Extend+0x2b0> 200d77c: b0 10 20 00 clr %i0 } extend_area_ok = _Heap_Get_first_and_last_block( 200d780: 90 10 00 19 mov %i1, %o0 200d784: 92 10 00 1a mov %i2, %o1 200d788: 94 10 00 16 mov %l6, %o2 200d78c: 98 07 bf f8 add %fp, -8, %o4 200d790: 7f ff ec 97 call 20089ec <_Heap_Get_first_and_last_block> 200d794: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200d798: 80 8a 20 ff btst 0xff, %o0 200d79c: 02 bf ff f7 be 200d778 <_Heap_Extend+0x28> 200d7a0: a4 10 20 00 clr %l2 200d7a4: b4 10 00 15 mov %l5, %i2 200d7a8: a8 10 20 00 clr %l4 200d7ac: b8 10 20 00 clr %i4 200d7b0: a2 10 20 00 clr %l1 200d7b4: ee 06 20 18 ld [ %i0 + 0x18 ], %l7 } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; uintptr_t const sub_area_end = start_block->prev_size; 200d7b8: e0 06 80 00 ld [ %i2 ], %l0 200d7bc: 92 10 00 16 mov %l6, %o1 200d7c0: 82 04 3f f8 add %l0, -8, %g1 200d7c4: 90 10 00 10 mov %l0, %o0 200d7c8: 40 00 2d 82 call 2018dd0 <.urem> 200d7cc: c2 27 bf f4 st %g1, [ %fp + -12 ] uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200d7d0: c2 07 bf f4 ld [ %fp + -12 ], %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200d7d4: 80 a5 c0 1d cmp %l7, %i5 200d7d8: 1a 80 00 05 bcc 200d7ec <_Heap_Extend+0x9c> 200d7dc: 90 20 40 08 sub %g1, %o0, %o0 200d7e0: 80 a6 40 10 cmp %i1, %l0 200d7e4: 2a 80 00 87 bcs,a 200da00 <_Heap_Extend+0x2b0> 200d7e8: b0 10 20 00 clr %i0 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200d7ec: 80 a7 40 17 cmp %i5, %l7 200d7f0: 02 80 00 06 be 200d808 <_Heap_Extend+0xb8> 200d7f4: 80 a7 40 10 cmp %i5, %l0 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200d7f8: 2a 80 00 05 bcs,a 200d80c <_Heap_Extend+0xbc> 200d7fc: a8 10 00 1a mov %i2, %l4 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d800: 10 80 00 04 b 200d810 <_Heap_Extend+0xc0> 200d804: 80 a4 00 19 cmp %l0, %i1 200d808: a2 10 00 1a mov %i2, %l1 200d80c: 80 a4 00 19 cmp %l0, %i1 200d810: 12 80 00 05 bne 200d824 <_Heap_Extend+0xd4> 200d814: 80 a4 00 19 cmp %l0, %i1 start_block->prev_size = extend_area_end; 200d818: 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 ) 200d81c: 10 80 00 04 b 200d82c <_Heap_Extend+0xdc> 200d820: b8 10 00 08 mov %o0, %i4 merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200d824: 2a 80 00 02 bcs,a 200d82c <_Heap_Extend+0xdc> 200d828: a4 10 00 08 mov %o0, %l2 - 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; 200d82c: f4 02 20 04 ld [ %o0 + 4 ], %i2 200d830: 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); 200d834: b4 02 00 1a add %o0, %i2, %i2 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200d838: 80 a6 80 15 cmp %i2, %l5 200d83c: 12 bf ff df bne 200d7b8 <_Heap_Extend+0x68> 200d840: ae 10 00 1a mov %i2, %l7 if ( extend_area_begin < heap->area_begin ) { 200d844: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200d848: 80 a6 40 01 cmp %i1, %g1 200d84c: 3a 80 00 04 bcc,a 200d85c <_Heap_Extend+0x10c> 200d850: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200d854: 10 80 00 05 b 200d868 <_Heap_Extend+0x118> 200d858: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { 200d85c: 80 a0 40 1d cmp %g1, %i5 200d860: 2a 80 00 02 bcs,a 200d868 <_Heap_Extend+0x118> 200d864: 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; 200d868: c4 07 bf f8 ld [ %fp + -8 ], %g2 200d86c: c2 07 bf fc ld [ %fp + -4 ], %g1 extend_first_block->prev_size = extend_area_end; 200d870: 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 = 200d874: 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; 200d878: 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; 200d87c: 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 = 200d880: 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 ) { 200d884: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 200d888: 80 a0 c0 02 cmp %g3, %g2 200d88c: 08 80 00 04 bleu 200d89c <_Heap_Extend+0x14c> 200d890: c0 20 60 04 clr [ %g1 + 4 ] heap->first_block = extend_first_block; 200d894: 10 80 00 06 b 200d8ac <_Heap_Extend+0x15c> 200d898: c4 26 20 20 st %g2, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200d89c: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200d8a0: 80 a0 80 01 cmp %g2, %g1 200d8a4: 2a 80 00 02 bcs,a 200d8ac <_Heap_Extend+0x15c> 200d8a8: c2 26 20 24 st %g1, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d8ac: 80 a4 60 00 cmp %l1, 0 200d8b0: 02 80 00 14 be 200d900 <_Heap_Extend+0x1b0> 200d8b4: 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; 200d8b8: 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; 200d8bc: 92 10 00 1a mov %i2, %o1 200d8c0: 40 00 2d 44 call 2018dd0 <.urem> 200d8c4: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200d8c8: 80 a2 20 00 cmp %o0, 0 200d8cc: 02 80 00 04 be 200d8dc <_Heap_Extend+0x18c> 200d8d0: c2 04 40 00 ld [ %l1 ], %g1 return value - remainder + alignment; 200d8d4: b2 06 40 1a add %i1, %i2, %i1 200d8d8: 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 = 200d8dc: 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; 200d8e0: 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 = 200d8e4: 82 24 40 09 sub %l1, %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; 200d8e8: 82 10 60 01 or %g1, 1, %g1 _Heap_Free_block( heap, new_first_block ); 200d8ec: 90 10 00 18 mov %i0, %o0 200d8f0: 7f ff ff 8e call 200d728 <_Heap_Free_block> 200d8f4: c2 22 60 04 st %g1, [ %o1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d8f8: 10 80 00 08 b 200d918 <_Heap_Extend+0x1c8> 200d8fc: 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 ) { 200d900: 80 a5 20 00 cmp %l4, 0 200d904: 02 80 00 04 be 200d914 <_Heap_Extend+0x1c4> 200d908: a8 25 00 01 sub %l4, %g1, %l4 { 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; 200d90c: a8 15 20 01 or %l4, 1, %l4 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 200d910: e8 20 60 04 st %l4, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d914: 80 a7 20 00 cmp %i4, 0 200d918: 02 80 00 15 be 200d96c <_Heap_Extend+0x21c> 200d91c: 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); 200d920: 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( 200d924: ba 27 40 1c sub %i5, %i4, %i5 200d928: 40 00 2d 2a call 2018dd0 <.urem> 200d92c: 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) 200d930: c4 07 20 04 ld [ %i4 + 4 ], %g2 200d934: 90 27 40 08 sub %i5, %o0, %o0 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200d938: 82 02 00 1c add %o0, %i4, %g1 (last_block->size_and_flag - last_block_new_size) 200d93c: 84 20 80 08 sub %g2, %o0, %g2 | HEAP_PREV_BLOCK_USED; 200d940: 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 = 200d944: 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; 200d948: 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 ); 200d94c: 92 10 00 1c mov %i4, %o1 200d950: 82 08 60 01 and %g1, 1, %g1 block->size_and_flag = size | flag; 200d954: 90 12 00 01 or %o0, %g1, %o0 200d958: d0 27 20 04 st %o0, [ %i4 + 4 ] 200d95c: 7f ff ff 73 call 200d728 <_Heap_Free_block> 200d960: 90 10 00 18 mov %i0, %o0 extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d964: 10 80 00 0f b 200d9a0 <_Heap_Extend+0x250> 200d968: 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 ) { 200d96c: 80 a4 a0 00 cmp %l2, 0 200d970: 02 80 00 0b be 200d99c <_Heap_Extend+0x24c> 200d974: c6 07 bf f8 ld [ %fp + -8 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d978: c4 04 a0 04 ld [ %l2 + 4 ], %g2 _Heap_Link_above( 200d97c: c2 07 bf fc ld [ %fp + -4 ], %g1 ) { 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 ); 200d980: 86 20 c0 12 sub %g3, %l2, %g3 200d984: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200d988: 84 10 c0 02 or %g3, %g2, %g2 200d98c: c4 24 a0 04 st %g2, [ %l2 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200d990: c4 00 60 04 ld [ %g1 + 4 ], %g2 200d994: 84 10 a0 01 or %g2, 1, %g2 200d998: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d99c: 80 a7 20 00 cmp %i4, 0 200d9a0: 32 80 00 09 bne,a 200d9c4 <_Heap_Extend+0x274> 200d9a4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200d9a8: 80 a4 60 00 cmp %l1, 0 200d9ac: 32 80 00 06 bne,a 200d9c4 <_Heap_Extend+0x274> 200d9b0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200d9b4: d2 07 bf f8 ld [ %fp + -8 ], %o1 200d9b8: 7f ff ff 5c call 200d728 <_Heap_Free_block> 200d9bc: 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 200d9c0: 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( 200d9c4: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d9c8: c4 00 60 04 ld [ %g1 + 4 ], %g2 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200d9cc: 86 20 c0 01 sub %g3, %g1, %g3 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d9d0: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200d9d4: 84 10 c0 02 or %g3, %g2, %g2 200d9d8: c4 20 60 04 st %g2, [ %g1 + 4 ] } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d9dc: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 /* Statistics */ stats->size += extended_size; if ( extended_size_ptr != NULL ) 200d9e0: 80 a6 e0 00 cmp %i3, 0 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d9e4: a6 20 40 13 sub %g1, %l3, %l3 /* Statistics */ stats->size += extended_size; 200d9e8: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 200d9ec: 82 00 40 13 add %g1, %l3, %g1 if ( extended_size_ptr != NULL ) 200d9f0: 02 80 00 03 be 200d9fc <_Heap_Extend+0x2ac> <== NEVER TAKEN 200d9f4: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200d9f8: e6 26 c0 00 st %l3, [ %i3 ] return true; 200d9fc: b0 10 20 01 mov 1, %i0 } 200da00: b0 0e 20 01 and %i0, 1, %i0 200da04: 81 c7 e0 08 ret 200da08: 81 e8 00 00 restore =============================================================================== 0200d77c <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200d77c: 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 ) { 200d780: 80 a6 60 00 cmp %i1, 0 200d784: 02 80 00 7a be 200d96c <_Heap_Free+0x1f0> 200d788: 88 10 20 01 mov 1, %g4 200d78c: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200d790: 40 00 2c ec call 2018b40 <.urem> 200d794: 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 200d798: f6 06 20 20 ld [ %i0 + 0x20 ], %i3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d79c: 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); 200d7a0: 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; 200d7a4: 80 a2 00 1b cmp %o0, %i3 200d7a8: 0a 80 00 05 bcs 200d7bc <_Heap_Free+0x40> 200d7ac: 82 10 20 00 clr %g1 200d7b0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200d7b4: 80 a0 40 08 cmp %g1, %o0 200d7b8: 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 ) ) { 200d7bc: 80 a0 60 00 cmp %g1, 0 200d7c0: 02 80 00 6b be 200d96c <_Heap_Free+0x1f0> 200d7c4: 88 10 20 00 clr %g4 - 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; 200d7c8: f8 02 20 04 ld [ %o0 + 4 ], %i4 200d7cc: 84 0f 3f fe and %i4, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d7d0: 82 02 00 02 add %o0, %g2, %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; 200d7d4: 80 a0 40 1b cmp %g1, %i3 200d7d8: 0a 80 00 05 bcs 200d7ec <_Heap_Free+0x70> <== NEVER TAKEN 200d7dc: 86 10 20 00 clr %g3 200d7e0: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200d7e4: 80 a0 c0 01 cmp %g3, %g1 200d7e8: 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 ) ) { 200d7ec: 80 a0 e0 00 cmp %g3, 0 200d7f0: 02 80 00 5f be 200d96c <_Heap_Free+0x1f0> <== NEVER TAKEN 200d7f4: 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; 200d7f8: fa 00 60 04 ld [ %g1 + 4 ], %i5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200d7fc: 80 8f 60 01 btst 1, %i5 200d800: 22 80 00 5c be,a 200d970 <_Heap_Free+0x1f4> <== NEVER TAKEN 200d804: b0 09 20 01 and %g4, 1, %i0 <== NOT EXECUTED 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 200d808: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200d80c: 80 a0 40 04 cmp %g1, %g4 200d810: 02 80 00 07 be 200d82c <_Heap_Free+0xb0> 200d814: ba 0f 7f fe and %i5, -2, %i5 200d818: 86 00 40 1d add %g1, %i5, %g3 200d81c: f4 00 e0 04 ld [ %g3 + 4 ], %i2 200d820: b4 1e a0 01 xor %i2, 1, %i2 200d824: 10 80 00 03 b 200d830 <_Heap_Free+0xb4> 200d828: b4 0e a0 01 and %i2, 1, %i2 200d82c: b4 10 20 00 clr %i2 if ( !_Heap_Is_prev_used( block ) ) { 200d830: 80 8f 20 01 btst 1, %i4 200d834: 12 80 00 26 bne 200d8cc <_Heap_Free+0x150> 200d838: 80 8e a0 ff btst 0xff, %i2 uintptr_t const prev_size = block->prev_size; 200d83c: f8 02 00 00 ld [ %o0 ], %i4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d840: 86 22 00 1c sub %o0, %i4, %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; 200d844: 80 a0 c0 1b cmp %g3, %i3 200d848: 0a 80 00 04 bcs 200d858 <_Heap_Free+0xdc> <== NEVER TAKEN 200d84c: b2 10 20 00 clr %i1 200d850: 80 a1 00 03 cmp %g4, %g3 200d854: b2 60 3f ff subx %g0, -1, %i1 Heap_Block * const prev_block = _Heap_Block_at( block, -prev_size ); if ( !_Heap_Is_block_in_heap( heap, prev_block ) ) { 200d858: 80 a6 60 00 cmp %i1, 0 200d85c: 02 80 00 44 be 200d96c <_Heap_Free+0x1f0> <== NEVER TAKEN 200d860: 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; 200d864: f6 00 e0 04 ld [ %g3 + 4 ], %i3 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) ) { 200d868: 80 8e e0 01 btst 1, %i3 200d86c: 02 80 00 40 be 200d96c <_Heap_Free+0x1f0> <== NEVER TAKEN 200d870: 80 8e a0 ff btst 0xff, %i2 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200d874: 22 80 00 0f be,a 200d8b0 <_Heap_Free+0x134> 200d878: b8 00 80 1c add %g2, %i4, %i4 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200d87c: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = block->prev; 200d880: c2 00 60 0c ld [ %g1 + 0xc ], %g1 uintptr_t const size = block_size + prev_size + next_block_size; 200d884: ba 00 80 1d add %g2, %i5, %i5 prev->next = next; 200d888: c8 20 60 08 st %g4, [ %g1 + 8 ] next->prev = prev; 200d88c: c2 21 20 0c st %g1, [ %g4 + 0xc ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200d890: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200d894: b8 07 40 1c add %i5, %i4, %i4 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200d898: 82 00 7f ff add %g1, -1, %g1 200d89c: 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; 200d8a0: f8 20 c0 1c st %i4, [ %g3 + %i4 ] 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; 200d8a4: 82 17 20 01 or %i4, 1, %g1 200d8a8: 10 80 00 27 b 200d944 <_Heap_Free+0x1c8> 200d8ac: 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; 200d8b0: 88 17 20 01 or %i4, 1, %g4 200d8b4: c8 20 e0 04 st %g4, [ %g3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d8b8: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = size; 200d8bc: f8 22 00 02 st %i4, [ %o0 + %g2 ] _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; 200d8c0: 86 08 ff fe and %g3, -2, %g3 200d8c4: 10 80 00 20 b 200d944 <_Heap_Free+0x1c8> 200d8c8: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200d8cc: 22 80 00 0d be,a 200d900 <_Heap_Free+0x184> 200d8d0: 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; 200d8d4: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = old_block->prev; 200d8d8: c2 00 60 0c ld [ %g1 + 0xc ], %g1 new_block->next = next; 200d8dc: c8 22 20 08 st %g4, [ %o0 + 8 ] new_block->prev = prev; 200d8e0: c2 22 20 0c st %g1, [ %o0 + 0xc ] uintptr_t const size = block_size + next_block_size; 200d8e4: 86 07 40 02 add %i5, %g2, %g3 next->prev = new_block; prev->next = new_block; 200d8e8: d0 20 60 08 st %o0, [ %g1 + 8 ] Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; next->prev = new_block; 200d8ec: d0 21 20 0c st %o0, [ %g4 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d8f0: 82 10 e0 01 or %g3, 1, %g1 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200d8f4: c6 22 00 03 st %g3, [ %o0 + %g3 ] 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; 200d8f8: 10 80 00 13 b 200d944 <_Heap_Free+0x1c8> 200d8fc: c2 22 20 04 st %g1, [ %o0 + 4 ] ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200d900: f0 22 20 0c st %i0, [ %o0 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200d904: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200d908: d0 20 e0 0c st %o0, [ %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; 200d90c: 86 10 a0 01 or %g2, 1, %g3 200d910: c6 22 20 04 st %g3, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d914: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = block_size; 200d918: c4 22 00 02 st %g2, [ %o0 + %g2 ] } 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; 200d91c: 86 08 ff fe and %g3, -2, %g3 200d920: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200d924: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 if ( stats->max_free_blocks < stats->free_blocks ) { 200d928: 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; 200d92c: 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; 200d930: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200d934: 80 a0 c0 01 cmp %g3, %g1 200d938: 1a 80 00 03 bcc 200d944 <_Heap_Free+0x1c8> 200d93c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200d940: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200d944: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 200d948: 82 00 7f ff add %g1, -1, %g1 200d94c: c2 26 20 40 st %g1, [ %i0 + 0x40 ] ++stats->frees; 200d950: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200d954: 82 00 60 01 inc %g1 200d958: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200d95c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200d960: 84 00 40 02 add %g1, %g2, %g2 200d964: c4 26 20 30 st %g2, [ %i0 + 0x30 ] * 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; 200d968: 88 10 20 01 mov 1, %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d96c: b0 09 20 01 and %g4, 1, %i0 200d970: 81 c7 e0 08 ret 200d974: 81 e8 00 00 restore =============================================================================== 0200a8c4 <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, const uintptr_t *block_sizes, size_t block_count ) { 200a8c4: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 200a8c8: b6 10 20 00 clr %i3 Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, const uintptr_t *block_sizes, size_t block_count ) { 200a8cc: ba 10 00 18 mov %i0, %i5 Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 200a8d0: 10 80 00 11 b 200a914 <_Heap_Greedy_allocate+0x50> 200a8d4: b8 10 20 00 clr %i4 * @brief See _Heap_Allocate_aligned_with_boundary() with alignment and * boundary equals zero. */ RTEMS_INLINE_ROUTINE void *_Heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 200a8d8: d2 06 40 01 ld [ %i1 + %g1 ], %o1 200a8dc: 90 10 00 1d mov %i5, %o0 200a8e0: 94 10 20 00 clr %o2 200a8e4: 40 00 1d 88 call 2011f04 <_Heap_Allocate_aligned_with_boundary> 200a8e8: 96 10 20 00 clr %o3 void *next = _Heap_Allocate( heap, block_sizes [i] ); if ( next != NULL ) { 200a8ec: 82 92 20 00 orcc %o0, 0, %g1 200a8f0: 22 80 00 09 be,a 200a914 <_Heap_Greedy_allocate+0x50> <== NEVER TAKEN 200a8f4: b6 06 e0 01 inc %i3 <== NOT EXECUTED RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200a8f8: d2 07 60 10 ld [ %i5 + 0x10 ], %o1 200a8fc: 40 00 4a 97 call 201d358 <.urem> 200a900: b0 00 7f f8 add %g1, -8, %i0 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200a904: 90 26 00 08 sub %i0, %o0, %o0 Heap_Block *next_block = _Heap_Block_of_alloc_area( (uintptr_t) next, heap->page_size ); next_block->next = allocated_blocks; 200a908: f8 22 20 08 st %i4, [ %o0 + 8 ] 200a90c: b8 10 00 08 mov %o0, %i4 Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 200a910: b6 06 e0 01 inc %i3 200a914: 80 a6 c0 1a cmp %i3, %i2 200a918: 12 bf ff f0 bne 200a8d8 <_Heap_Greedy_allocate+0x14> 200a91c: 83 2e e0 02 sll %i3, 2, %g1 200a920: 10 80 00 0a b 200a948 <_Heap_Greedy_allocate+0x84> 200a924: b0 10 20 00 clr %i0 allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { _Heap_Block_allocate( 200a928: 90 10 00 1d mov %i5, %o0 } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a92c: 96 0a ff fe and %o3, -2, %o3 200a930: 92 10 00 1b mov %i3, %o1 200a934: 94 06 e0 08 add %i3, 8, %o2 200a938: 40 00 00 cb call 200ac64 <_Heap_Block_allocate> 200a93c: 96 02 ff f8 add %o3, -8, %o3 current, _Heap_Alloc_area_of_block( current ), _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; 200a940: f0 26 e0 08 st %i0, [ %i3 + 8 ] 200a944: b0 10 00 1b mov %i3, %i0 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200a948: f6 07 60 08 ld [ %i5 + 8 ], %i3 next_block->next = allocated_blocks; allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { 200a94c: 80 a6 c0 1d cmp %i3, %i5 200a950: 32 bf ff f6 bne,a 200a928 <_Heap_Greedy_allocate+0x64> 200a954: d6 06 e0 04 ld [ %i3 + 4 ], %o3 current->next = blocks; blocks = current; } while ( allocated_blocks != NULL ) { 200a958: 10 80 00 07 b 200a974 <_Heap_Greedy_allocate+0xb0> 200a95c: 80 a7 20 00 cmp %i4, 0 current = allocated_blocks; allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200a960: 92 07 20 08 add %i4, 8, %o1 200a964: 90 10 00 1d mov %i5, %o0 200a968: 40 00 1d d8 call 20120c8 <_Heap_Free> 200a96c: b8 10 00 1b mov %i3, %i4 current->next = blocks; blocks = current; } while ( allocated_blocks != NULL ) { 200a970: 80 a7 20 00 cmp %i4, 0 200a974: 32 bf ff fb bne,a 200a960 <_Heap_Greedy_allocate+0x9c> 200a978: f6 07 20 08 ld [ %i4 + 8 ], %i3 allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); } return blocks; } 200a97c: 81 c7 e0 08 ret 200a980: 81 e8 00 00 restore =============================================================================== 0203f744 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 203f744: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; Heap_Block *end = heap->last_block; bool stop = false; 203f748: 90 10 20 00 clr %o0 Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { Heap_Block *current = heap->first_block; 203f74c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *end = heap->last_block; bool stop = false; while ( !stop && current != end ) { 203f750: 10 80 00 0a b 203f778 <_Heap_Iterate+0x34> 203f754: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 uintptr_t size = _Heap_Block_size( current ); Heap_Block *next = _Heap_Block_at( current, size ); bool used = _Heap_Is_prev_used( next ); stop = (*visitor)( current, size, used, visitor_arg ); 203f758: 90 10 00 01 mov %g1, %o0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 203f75c: 92 0a 7f fe and %o1, -2, %o1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 203f760: ba 00 40 09 add %g1, %o1, %i5 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 203f764: d4 07 60 04 ld [ %i5 + 4 ], %o2 203f768: 96 10 00 1a mov %i2, %o3 203f76c: 9f c6 40 00 call %i1 203f770: 94 0a a0 01 and %o2, 1, %o2 203f774: 82 10 00 1d mov %i5, %g1 { Heap_Block *current = heap->first_block; Heap_Block *end = heap->last_block; bool stop = false; while ( !stop && current != end ) { 203f778: 80 a0 40 1c cmp %g1, %i4 203f77c: 02 80 00 05 be 203f790 <_Heap_Iterate+0x4c> 203f780: 90 1a 20 01 xor %o0, 1, %o0 203f784: 80 8a 20 ff btst 0xff, %o0 203f788: 32 bf ff f4 bne,a 203f758 <_Heap_Iterate+0x14> <== ALWAYS TAKEN 203f78c: d2 00 60 04 ld [ %g1 + 4 ], %o1 203f790: 81 c7 e0 08 ret 203f794: 81 e8 00 00 restore =============================================================================== 0200daa0 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200daa0: 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); 200daa4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200daa8: 40 00 2c 26 call 2018b40 <.urem> 200daac: 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 200dab0: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200dab4: 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); 200dab8: 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; 200dabc: 80 a2 00 04 cmp %o0, %g4 200dac0: 0a 80 00 05 bcs 200dad4 <_Heap_Size_of_alloc_area+0x34> 200dac4: 82 10 20 00 clr %g1 200dac8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200dacc: 80 a0 40 08 cmp %g1, %o0 200dad0: 82 60 3f ff subx %g0, -1, %g1 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 ) ) { 200dad4: 80 a0 60 00 cmp %g1, 0 200dad8: 02 80 00 15 be 200db2c <_Heap_Size_of_alloc_area+0x8c> 200dadc: 86 10 20 00 clr %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; 200dae0: c2 02 20 04 ld [ %o0 + 4 ], %g1 200dae4: 82 08 7f fe and %g1, -2, %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200dae8: 82 02 00 01 add %o0, %g1, %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; 200daec: 80 a0 40 04 cmp %g1, %g4 200daf0: 0a 80 00 05 bcs 200db04 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 200daf4: 84 10 20 00 clr %g2 200daf8: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200dafc: 80 a0 80 01 cmp %g2, %g1 200db00: 84 60 3f ff subx %g0, -1, %g2 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 200db04: 80 a0 a0 00 cmp %g2, 0 200db08: 02 80 00 09 be 200db2c <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 200db0c: 86 10 20 00 clr %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; 200db10: c4 00 60 04 ld [ %g1 + 4 ], %g2 !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 200db14: 80 88 a0 01 btst 1, %g2 200db18: 02 80 00 05 be 200db2c <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 200db1c: 82 20 40 19 sub %g1, %i1, %g1 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200db20: 86 10 20 01 mov 1, %g3 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 200db24: 82 00 60 04 add %g1, 4, %g1 200db28: c2 26 80 00 st %g1, [ %i2 ] return true; } 200db2c: b0 08 e0 01 and %g3, 1, %i0 200db30: 81 c7 e0 08 ret 200db34: 81 e8 00 00 restore =============================================================================== 020098b4 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20098b4: 9d e3 bf 80 save %sp, -128, %sp 20098b8: ac 10 00 19 mov %i1, %l6 uintptr_t const page_size = heap->page_size; 20098bc: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 uintptr_t const min_block_size = heap->min_block_size; 20098c0: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 20098c4: f2 06 20 20 ld [ %i0 + 0x20 ], %i1 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; 20098c8: 80 a6 a0 00 cmp %i2, 0 20098cc: 02 80 00 05 be 20098e0 <_Heap_Walk+0x2c> 20098d0: e0 06 20 24 ld [ %i0 + 0x24 ], %l0 20098d4: 3b 00 80 26 sethi %hi(0x2009800), %i5 20098d8: 10 80 00 04 b 20098e8 <_Heap_Walk+0x34> 20098dc: ba 17 60 64 or %i5, 0x64, %i5 ! 2009864 <_Heap_Walk_print> 20098e0: 3b 00 80 26 sethi %hi(0x2009800), %i5 20098e4: ba 17 60 5c or %i5, 0x5c, %i5 ! 200985c <_Heap_Walk_print_nothing> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20098e8: 05 00 80 80 sethi %hi(0x2020000), %g2 20098ec: c4 00 a0 10 ld [ %g2 + 0x10 ], %g2 ! 2020010 <_System_state_Current> 20098f0: 80 a0 a0 03 cmp %g2, 3 20098f4: 22 80 00 04 be,a 2009904 <_Heap_Walk+0x50> 20098f8: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 return true; 20098fc: 10 80 01 2a b 2009da4 <_Heap_Walk+0x4f0> 2009900: b0 10 20 01 mov 1, %i0 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)( 2009904: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2009908: c4 23 a0 5c st %g2, [ %sp + 0x5c ] 200990c: f2 23 a0 60 st %i1, [ %sp + 0x60 ] 2009910: e0 23 a0 64 st %l0, [ %sp + 0x64 ] 2009914: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009918: 90 10 00 16 mov %l6, %o0 200991c: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2009920: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2009924: 92 10 20 00 clr %o1 2009928: c4 23 a0 6c st %g2, [ %sp + 0x6c ] 200992c: 15 00 80 72 sethi %hi(0x201c800), %o2 2009930: 96 10 00 1c mov %i4, %o3 2009934: 94 12 a0 f8 or %o2, 0xf8, %o2 2009938: 9f c7 40 00 call %i5 200993c: 98 10 00 1b mov %i3, %o4 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009940: 80 a7 20 00 cmp %i4, 0 2009944: 12 80 00 07 bne 2009960 <_Heap_Walk+0xac> 2009948: 80 8f 20 07 btst 7, %i4 (*printer)( source, true, "page size is zero\n" ); 200994c: 15 00 80 72 sethi %hi(0x201c800), %o2 2009950: 90 10 00 16 mov %l6, %o0 2009954: 92 10 20 01 mov 1, %o1 2009958: 10 80 00 37 b 2009a34 <_Heap_Walk+0x180> 200995c: 94 12 a1 90 or %o2, 0x190, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009960: 22 80 00 08 be,a 2009980 <_Heap_Walk+0xcc> 2009964: 90 10 00 1b mov %i3, %o0 (*printer)( 2009968: 15 00 80 72 sethi %hi(0x201c800), %o2 200996c: 90 10 00 16 mov %l6, %o0 2009970: 92 10 20 01 mov 1, %o1 2009974: 94 12 a1 a8 or %o2, 0x1a8, %o2 2009978: 10 80 01 12 b 2009dc0 <_Heap_Walk+0x50c> 200997c: 96 10 00 1c mov %i4, %o3 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009980: 7f ff e0 81 call 2001b84 <.urem> 2009984: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009988: 80 a2 20 00 cmp %o0, 0 200998c: 22 80 00 08 be,a 20099ac <_Heap_Walk+0xf8> 2009990: 90 06 60 08 add %i1, 8, %o0 (*printer)( 2009994: 15 00 80 72 sethi %hi(0x201c800), %o2 2009998: 90 10 00 16 mov %l6, %o0 200999c: 92 10 20 01 mov 1, %o1 20099a0: 94 12 a1 c8 or %o2, 0x1c8, %o2 20099a4: 10 80 01 07 b 2009dc0 <_Heap_Walk+0x50c> 20099a8: 96 10 00 1b mov %i3, %o3 20099ac: 7f ff e0 76 call 2001b84 <.urem> 20099b0: 92 10 00 1c mov %i4, %o1 ); return false; } if ( 20099b4: 80 a2 20 00 cmp %o0, 0 20099b8: 22 80 00 07 be,a 20099d4 <_Heap_Walk+0x120> 20099bc: c4 06 60 04 ld [ %i1 + 4 ], %g2 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 20099c0: 15 00 80 72 sethi %hi(0x201c800), %o2 20099c4: 90 10 00 16 mov %l6, %o0 20099c8: 92 10 20 01 mov 1, %o1 20099cc: 10 80 00 fc b 2009dbc <_Heap_Walk+0x508> 20099d0: 94 12 a1 f0 or %o2, 0x1f0, %o2 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20099d4: 80 88 a0 01 btst 1, %g2 20099d8: 32 80 00 07 bne,a 20099f4 <_Heap_Walk+0x140> 20099dc: f4 04 20 04 ld [ %l0 + 4 ], %i2 (*printer)( 20099e0: 15 00 80 72 sethi %hi(0x201c800), %o2 20099e4: 90 10 00 16 mov %l6, %o0 20099e8: 92 10 20 01 mov 1, %o1 20099ec: 10 80 00 12 b 2009a34 <_Heap_Walk+0x180> 20099f0: 94 12 a2 28 or %o2, 0x228, %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; 20099f4: 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); 20099f8: b4 04 00 1a add %l0, %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; 20099fc: c4 06 a0 04 ld [ %i2 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2009a00: 80 88 a0 01 btst 1, %g2 2009a04: 12 80 00 07 bne 2009a20 <_Heap_Walk+0x16c> 2009a08: 80 a6 80 19 cmp %i2, %i1 (*printer)( 2009a0c: 15 00 80 72 sethi %hi(0x201c800), %o2 2009a10: 90 10 00 16 mov %l6, %o0 2009a14: 92 10 20 01 mov 1, %o1 2009a18: 10 80 00 07 b 2009a34 <_Heap_Walk+0x180> 2009a1c: 94 12 a2 58 or %o2, 0x258, %o2 ); return false; } if ( 2009a20: 02 80 00 0a be 2009a48 <_Heap_Walk+0x194> 2009a24: 15 00 80 72 sethi %hi(0x201c800), %o2 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2009a28: 90 10 00 16 mov %l6, %o0 2009a2c: 92 10 20 01 mov 1, %o1 2009a30: 94 12 a2 70 or %o2, 0x270, %o2 2009a34: 9f c7 40 00 call %i5 2009a38: b0 10 20 00 clr %i0 2009a3c: b0 0e 20 ff and %i0, 0xff, %i0 2009a40: 81 c7 e0 08 ret 2009a44: 81 e8 00 00 restore int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 2009a48: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2009a4c: d6 06 20 08 ld [ %i0 + 8 ], %o3 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); 2009a50: 10 80 00 30 b 2009b10 <_Heap_Walk+0x25c> 2009a54: b2 10 00 18 mov %i0, %i1 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; 2009a58: 80 a0 c0 0b cmp %g3, %o3 2009a5c: 18 80 00 05 bgu 2009a70 <_Heap_Walk+0x1bc> 2009a60: 84 10 20 00 clr %g2 2009a64: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 2009a68: 80 a0 80 0b cmp %g2, %o3 2009a6c: 84 60 3f ff subx %g0, -1, %g2 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 ) ) { 2009a70: 80 a0 a0 00 cmp %g2, 0 2009a74: 32 80 00 07 bne,a 2009a90 <_Heap_Walk+0x1dc> 2009a78: 90 02 e0 08 add %o3, 8, %o0 (*printer)( 2009a7c: 15 00 80 72 sethi %hi(0x201c800), %o2 2009a80: 90 10 00 16 mov %l6, %o0 2009a84: 92 10 20 01 mov 1, %o1 2009a88: 10 80 00 ce b 2009dc0 <_Heap_Walk+0x50c> 2009a8c: 94 12 a2 a0 or %o2, 0x2a0, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009a90: d6 27 bf fc st %o3, [ %fp + -4 ] 2009a94: 7f ff e0 3c call 2001b84 <.urem> 2009a98: 92 10 00 11 mov %l1, %o1 ); return false; } if ( 2009a9c: 80 a2 20 00 cmp %o0, 0 2009aa0: 02 80 00 07 be 2009abc <_Heap_Walk+0x208> 2009aa4: d6 07 bf fc ld [ %fp + -4 ], %o3 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2009aa8: 15 00 80 72 sethi %hi(0x201c800), %o2 2009aac: 90 10 00 16 mov %l6, %o0 2009ab0: 92 10 20 01 mov 1, %o1 2009ab4: 10 80 00 c3 b 2009dc0 <_Heap_Walk+0x50c> 2009ab8: 94 12 a2 c0 or %o2, 0x2c0, %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; 2009abc: c4 02 e0 04 ld [ %o3 + 4 ], %g2 2009ac0: 84 08 bf fe and %g2, -2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2009ac4: 84 02 c0 02 add %o3, %g2, %g2 2009ac8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2009acc: 80 88 a0 01 btst 1, %g2 2009ad0: 22 80 00 07 be,a 2009aec <_Heap_Walk+0x238> 2009ad4: d8 02 e0 0c ld [ %o3 + 0xc ], %o4 (*printer)( 2009ad8: 15 00 80 72 sethi %hi(0x201c800), %o2 2009adc: 90 10 00 16 mov %l6, %o0 2009ae0: 92 10 20 01 mov 1, %o1 2009ae4: 10 80 00 b7 b 2009dc0 <_Heap_Walk+0x50c> 2009ae8: 94 12 a2 f0 or %o2, 0x2f0, %o2 ); return false; } if ( free_block->prev != prev_block ) { 2009aec: 80 a3 00 19 cmp %o4, %i1 2009af0: 02 80 00 07 be 2009b0c <_Heap_Walk+0x258> 2009af4: b2 10 00 0b mov %o3, %i1 (*printer)( 2009af8: 15 00 80 72 sethi %hi(0x201c800), %o2 2009afc: 90 10 00 16 mov %l6, %o0 2009b00: 92 10 20 01 mov 1, %o1 2009b04: 10 80 00 4d b 2009c38 <_Heap_Walk+0x384> 2009b08: 94 12 a3 10 or %o2, 0x310, %o2 return false; } prev_block = free_block; free_block = free_block->next; 2009b0c: 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 ) { 2009b10: 80 a2 c0 18 cmp %o3, %i0 2009b14: 32 bf ff d1 bne,a 2009a58 <_Heap_Walk+0x1a4> 2009b18: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 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)( 2009b1c: 2b 00 80 73 sethi %hi(0x201cc00), %l5 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 2009b20: b2 10 00 1a mov %i2, %i1 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)( 2009b24: aa 15 60 10 or %l5, 0x10, %l5 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2009b28: 23 00 80 73 sethi %hi(0x201cc00), %l1 2009b2c: 2f 00 80 72 sethi %hi(0x201c800), %l7 - 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; 2009b30: e4 06 60 04 ld [ %i1 + 4 ], %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; 2009b34: d8 06 20 20 ld [ %i0 + 0x20 ], %o4 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; 2009b38: 9e 1e 40 10 xor %i1, %l0, %o7 2009b3c: 80 a0 00 0f cmp %g0, %o7 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2009b40: a8 0c bf fe and %l2, -2, %l4 2009b44: 9a 40 20 00 addx %g0, 0, %o5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2009b48: a6 06 40 14 add %i1, %l4, %l3 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; 2009b4c: a4 0c a0 01 and %l2, 1, %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; 2009b50: 80 a3 00 13 cmp %o4, %l3 2009b54: 18 80 00 05 bgu 2009b68 <_Heap_Walk+0x2b4> <== NEVER TAKEN 2009b58: 9e 10 20 00 clr %o7 2009b5c: de 06 20 24 ld [ %i0 + 0x24 ], %o7 2009b60: 80 a3 c0 13 cmp %o7, %l3 2009b64: 9e 60 3f ff subx %g0, -1, %o7 if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 2009b68: 80 a3 e0 00 cmp %o7, 0 2009b6c: 32 80 00 07 bne,a 2009b88 <_Heap_Walk+0x2d4> 2009b70: da 27 bf f8 st %o5, [ %fp + -8 ] (*printer)( 2009b74: 15 00 80 72 sethi %hi(0x201c800), %o2 2009b78: 90 10 00 16 mov %l6, %o0 2009b7c: 92 10 20 01 mov 1, %o1 2009b80: 10 80 00 2c b 2009c30 <_Heap_Walk+0x37c> 2009b84: 94 12 a3 48 or %o2, 0x348, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009b88: 90 10 00 14 mov %l4, %o0 2009b8c: 7f ff df fe call 2001b84 <.urem> 2009b90: 92 10 00 1c mov %i4, %o1 2009b94: da 07 bf f8 ld [ %fp + -8 ], %o5 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2009b98: 80 a2 20 00 cmp %o0, 0 2009b9c: 02 80 00 0c be 2009bcc <_Heap_Walk+0x318> 2009ba0: 9e 0b 60 ff and %o5, 0xff, %o7 2009ba4: 80 a3 e0 00 cmp %o7, 0 2009ba8: 02 80 00 19 be 2009c0c <_Heap_Walk+0x358> 2009bac: 80 a6 40 13 cmp %i1, %l3 (*printer)( 2009bb0: 15 00 80 72 sethi %hi(0x201c800), %o2 2009bb4: 90 10 00 16 mov %l6, %o0 2009bb8: 92 10 20 01 mov 1, %o1 2009bbc: 94 12 a3 78 or %o2, 0x378, %o2 2009bc0: 96 10 00 19 mov %i1, %o3 2009bc4: 10 80 00 1d b 2009c38 <_Heap_Walk+0x384> 2009bc8: 98 10 00 14 mov %l4, %o4 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2009bcc: 80 a3 e0 00 cmp %o7, 0 2009bd0: 02 80 00 0f be 2009c0c <_Heap_Walk+0x358> 2009bd4: 80 a6 40 13 cmp %i1, %l3 2009bd8: 80 a5 00 1b cmp %l4, %i3 2009bdc: 1a 80 00 0c bcc 2009c0c <_Heap_Walk+0x358> 2009be0: 80 a6 40 13 cmp %i1, %l3 (*printer)( 2009be4: 90 10 00 16 mov %l6, %o0 2009be8: 92 10 20 01 mov 1, %o1 2009bec: 15 00 80 72 sethi %hi(0x201c800), %o2 2009bf0: 96 10 00 19 mov %i1, %o3 2009bf4: 94 12 a3 a8 or %o2, 0x3a8, %o2 2009bf8: 98 10 00 14 mov %l4, %o4 2009bfc: 9f c7 40 00 call %i5 2009c00: 9a 10 00 1b mov %i3, %o5 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2009c04: 10 80 00 68 b 2009da4 <_Heap_Walk+0x4f0> 2009c08: b0 10 20 00 clr %i0 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2009c0c: 2a 80 00 10 bcs,a 2009c4c <_Heap_Walk+0x398> 2009c10: de 04 e0 04 ld [ %l3 + 4 ], %o7 2009c14: 80 8b 60 ff btst 0xff, %o5 2009c18: 22 80 00 0d be,a 2009c4c <_Heap_Walk+0x398> 2009c1c: de 04 e0 04 ld [ %l3 + 4 ], %o7 (*printer)( 2009c20: 15 00 80 72 sethi %hi(0x201c800), %o2 2009c24: 90 10 00 16 mov %l6, %o0 2009c28: 92 10 20 01 mov 1, %o1 2009c2c: 94 12 a3 d8 or %o2, 0x3d8, %o2 2009c30: 96 10 00 19 mov %i1, %o3 2009c34: 98 10 00 13 mov %l3, %o4 2009c38: 9f c7 40 00 call %i5 2009c3c: b0 10 20 00 clr %i0 2009c40: b0 0e 20 ff and %i0, 0xff, %i0 2009c44: 81 c7 e0 08 ret 2009c48: 81 e8 00 00 restore ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2009c4c: 80 8b e0 01 btst 1, %o7 2009c50: 12 80 00 3f bne 2009d4c <_Heap_Walk+0x498> 2009c54: 90 10 00 16 mov %l6, %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 ? 2009c58: da 06 60 0c ld [ %i1 + 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)( 2009c5c: d8 06 20 08 ld [ %i0 + 8 ], %o4 2009c60: 80 a3 40 0c cmp %o5, %o4 2009c64: 02 80 00 08 be 2009c84 <_Heap_Walk+0x3d0> 2009c68: de 06 20 0c ld [ %i0 + 0xc ], %o7 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2009c6c: 80 a3 40 18 cmp %o5, %i0 2009c70: 12 80 00 07 bne 2009c8c <_Heap_Walk+0x3d8> 2009c74: 96 14 60 80 or %l1, 0x80, %o3 2009c78: 17 00 80 72 sethi %hi(0x201c800), %o3 2009c7c: 10 80 00 04 b 2009c8c <_Heap_Walk+0x3d8> 2009c80: 96 12 e0 c8 or %o3, 0xc8, %o3 ! 201c8c8 <__log2table+0x130> 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)( 2009c84: 03 00 80 72 sethi %hi(0x201c800), %g1 2009c88: 96 10 60 b8 or %g1, 0xb8, %o3 ! 201c8b8 <__log2table+0x120> block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? 2009c8c: d8 06 60 08 ld [ %i1 + 8 ], %o4 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)( 2009c90: 80 a3 00 0f cmp %o4, %o7 2009c94: 02 80 00 06 be 2009cac <_Heap_Walk+0x3f8> 2009c98: 80 a3 00 18 cmp %o4, %i0 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2009c9c: 12 80 00 06 bne 2009cb4 <_Heap_Walk+0x400> 2009ca0: 9e 14 60 80 or %l1, 0x80, %o7 2009ca4: 10 80 00 04 b 2009cb4 <_Heap_Walk+0x400> 2009ca8: 9e 15 e0 e8 or %l7, 0xe8, %o7 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)( 2009cac: 03 00 80 72 sethi %hi(0x201c800), %g1 2009cb0: 9e 10 60 d8 or %g1, 0xd8, %o7 ! 201c8d8 <__log2table+0x140> 2009cb4: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 2009cb8: d8 23 a0 60 st %o4, [ %sp + 0x60 ] 2009cbc: de 23 a0 64 st %o7, [ %sp + 0x64 ] 2009cc0: 90 10 00 16 mov %l6, %o0 2009cc4: 92 10 20 00 clr %o1 2009cc8: 94 10 00 15 mov %l5, %o2 2009ccc: 96 10 00 19 mov %i1, %o3 2009cd0: 9f c7 40 00 call %i5 2009cd4: 98 10 00 14 mov %l4, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2009cd8: da 04 c0 00 ld [ %l3 ], %o5 2009cdc: 80 a5 00 0d cmp %l4, %o5 2009ce0: 02 80 00 0c be 2009d10 <_Heap_Walk+0x45c> 2009ce4: 80 a4 a0 00 cmp %l2, 0 (*printer)( 2009ce8: e6 23 a0 5c st %l3, [ %sp + 0x5c ] 2009cec: 90 10 00 16 mov %l6, %o0 2009cf0: 92 10 20 01 mov 1, %o1 2009cf4: 15 00 80 73 sethi %hi(0x201cc00), %o2 2009cf8: 96 10 00 19 mov %i1, %o3 2009cfc: 94 12 a0 48 or %o2, 0x48, %o2 2009d00: 9f c7 40 00 call %i5 2009d04: 98 10 00 14 mov %l4, %o4 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2009d08: 10 bf ff ce b 2009c40 <_Heap_Walk+0x38c> 2009d0c: b0 10 20 00 clr %i0 ); return false; } if ( !prev_used ) { 2009d10: 32 80 00 0a bne,a 2009d38 <_Heap_Walk+0x484> 2009d14: c6 06 20 08 ld [ %i0 + 8 ], %g3 (*printer)( 2009d18: 15 00 80 73 sethi %hi(0x201cc00), %o2 2009d1c: 90 10 00 16 mov %l6, %o0 2009d20: 92 10 20 01 mov 1, %o1 2009d24: 10 80 00 26 b 2009dbc <_Heap_Walk+0x508> 2009d28: 94 12 a0 88 or %o2, 0x88, %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 ) { 2009d2c: 22 80 00 19 be,a 2009d90 <_Heap_Walk+0x4dc> 2009d30: b2 10 00 13 mov %l3, %i1 return true; } free_block = free_block->next; 2009d34: c6 00 e0 08 ld [ %g3 + 8 ], %g3 ) { 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 ) { 2009d38: 80 a0 c0 18 cmp %g3, %i0 2009d3c: 12 bf ff fc bne 2009d2c <_Heap_Walk+0x478> 2009d40: 80 a0 c0 19 cmp %g3, %i1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2009d44: 10 80 00 1b b 2009db0 <_Heap_Walk+0x4fc> 2009d48: 15 00 80 73 sethi %hi(0x201cc00), %o2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2009d4c: 80 a4 a0 00 cmp %l2, 0 2009d50: 02 80 00 09 be 2009d74 <_Heap_Walk+0x4c0> 2009d54: 92 10 20 00 clr %o1 (*printer)( 2009d58: 15 00 80 73 sethi %hi(0x201cc00), %o2 2009d5c: 96 10 00 19 mov %i1, %o3 2009d60: 94 12 a0 b8 or %o2, 0xb8, %o2 2009d64: 9f c7 40 00 call %i5 2009d68: 98 10 00 14 mov %l4, %o4 2009d6c: 10 80 00 09 b 2009d90 <_Heap_Walk+0x4dc> 2009d70: b2 10 00 13 mov %l3, %i1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2009d74: da 06 40 00 ld [ %i1 ], %o5 2009d78: 15 00 80 73 sethi %hi(0x201cc00), %o2 2009d7c: 96 10 00 19 mov %i1, %o3 2009d80: 94 12 a0 d0 or %o2, 0xd0, %o2 2009d84: 9f c7 40 00 call %i5 2009d88: 98 10 00 14 mov %l4, %o4 2009d8c: b2 10 00 13 mov %l3, %i1 block->prev_size ); } block = next_block; } while ( block != first_block ); 2009d90: 80 a4 c0 1a cmp %l3, %i2 2009d94: 32 bf ff 68 bne,a 2009b34 <_Heap_Walk+0x280> 2009d98: e4 06 60 04 ld [ %i1 + 4 ], %l2 2009d9c: 10 80 00 02 b 2009da4 <_Heap_Walk+0x4f0> 2009da0: b0 10 20 01 mov 1, %i0 2009da4: b0 0e 20 ff and %i0, 0xff, %i0 2009da8: 81 c7 e0 08 ret 2009dac: 81 e8 00 00 restore return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2009db0: 90 10 00 16 mov %l6, %o0 2009db4: 92 10 20 01 mov 1, %o1 2009db8: 94 12 a0 f8 or %o2, 0xf8, %o2 2009dbc: 96 10 00 19 mov %i1, %o3 2009dc0: 9f c7 40 00 call %i5 2009dc4: b0 10 20 00 clr %i0 2009dc8: b0 0e 20 ff and %i0, 0xff, %i0 2009dcc: 81 c7 e0 08 ret 2009dd0: 81 e8 00 00 restore =============================================================================== 02008d58 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2008d58: 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 ) 2008d5c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008d60: 80 a0 60 00 cmp %g1, 0 2008d64: 12 80 00 04 bne 2008d74 <_Objects_Allocate+0x1c> <== ALWAYS TAKEN 2008d68: ba 10 00 18 mov %i0, %i5 return NULL; 2008d6c: 81 c7 e0 08 ret 2008d70: 91 e8 20 00 restore %g0, 0, %o0 /* * 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 ); 2008d74: b8 06 20 20 add %i0, 0x20, %i4 2008d78: 7f ff fd 83 call 2008384 <_Chain_Get> 2008d7c: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2008d80: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2008d84: 80 a0 60 00 cmp %g1, 0 2008d88: 02 80 00 1d be 2008dfc <_Objects_Allocate+0xa4> 2008d8c: 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 ) { 2008d90: 80 a2 20 00 cmp %o0, 0 2008d94: 32 80 00 0a bne,a 2008dbc <_Objects_Allocate+0x64> 2008d98: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Objects_Extend_information( information ); 2008d9c: 40 00 00 21 call 2008e20 <_Objects_Extend_information> 2008da0: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2008da4: 7f ff fd 78 call 2008384 <_Chain_Get> 2008da8: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2008dac: b0 92 20 00 orcc %o0, 0, %i0 2008db0: 02 bf ff ef be 2008d6c <_Objects_Allocate+0x14> 2008db4: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2008db8: c4 07 60 08 ld [ %i5 + 8 ], %g2 2008dbc: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2008dc0: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2008dc4: 03 00 00 3f sethi %hi(0xfc00), %g1 2008dc8: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 2008dcc: 90 0a 00 01 and %o0, %g1, %o0 2008dd0: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2008dd4: 40 00 3e af call 2018890 <.udiv> 2008dd8: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2008ddc: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2008de0: 91 2a 20 02 sll %o0, 2, %o0 2008de4: c4 00 40 08 ld [ %g1 + %o0 ], %g2 2008de8: 84 00 bf ff add %g2, -1, %g2 2008dec: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; 2008df0: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1 2008df4: 82 00 7f ff add %g1, -1, %g1 2008df8: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2008dfc: 81 c7 e0 08 ret 2008e00: 81 e8 00 00 restore =============================================================================== 02009168 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2009168: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 200916c: 80 a6 60 00 cmp %i1, 0 2009170: 12 80 00 04 bne 2009180 <_Objects_Get_information+0x18> 2009174: 01 00 00 00 nop return NULL; 2009178: 81 c7 e0 08 ret 200917c: 91 e8 20 00 restore %g0, 0, %o0 /* * 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 ); 2009180: 40 00 12 6e call 200db38 <_Objects_API_maximum_class> 2009184: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2009188: 80 a2 20 00 cmp %o0, 0 200918c: 02 bf ff fb be 2009178 <_Objects_Get_information+0x10> 2009190: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2009194: 18 bf ff f9 bgu 2009178 <_Objects_Get_information+0x10> 2009198: 03 00 80 76 sethi %hi(0x201d800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 200919c: b1 2e 20 02 sll %i0, 2, %i0 20091a0: 82 10 62 44 or %g1, 0x244, %g1 20091a4: c2 00 40 18 ld [ %g1 + %i0 ], %g1 20091a8: 80 a0 60 00 cmp %g1, 0 20091ac: 02 bf ff f3 be 2009178 <_Objects_Get_information+0x10> <== NEVER TAKEN 20091b0: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 20091b4: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 20091b8: 80 a6 20 00 cmp %i0, 0 20091bc: 02 bf ff ef be 2009178 <_Objects_Get_information+0x10> <== NEVER TAKEN 20091c0: 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 ) 20091c4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 20091c8: 80 a0 60 00 cmp %g1, 0 20091cc: 02 bf ff eb be 2009178 <_Objects_Get_information+0x10> 20091d0: 01 00 00 00 nop return NULL; #endif return info; } 20091d4: 81 c7 e0 08 ret 20091d8: 81 e8 00 00 restore =============================================================================== 0201b4ec <_Objects_Get_no_protection>: /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201b4ec: c2 02 20 08 ld [ %o0 + 8 ], %g1 201b4f0: 92 22 40 01 sub %o1, %g1, %o1 if ( information->maximum >= index ) { 201b4f4: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1 /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201b4f8: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 201b4fc: 80 a0 40 09 cmp %g1, %o1 201b500: 0a 80 00 09 bcs 201b524 <_Objects_Get_no_protection+0x38> 201b504: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 201b508: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 201b50c: d0 00 40 09 ld [ %g1 + %o1 ], %o0 201b510: 80 a2 20 00 cmp %o0, 0 201b514: 02 80 00 05 be 201b528 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 201b518: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 201b51c: 81 c3 e0 08 retl 201b520: c0 22 80 00 clr [ %o2 ] /* * This isn't supported or required yet for Global objects so * if it isn't local, we don't find it. */ *location = OBJECTS_ERROR; 201b524: 82 10 20 01 mov 1, %g1 return NULL; 201b528: 90 10 20 00 clr %o0 } 201b52c: 81 c3 e0 08 retl 201b530: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 0200d26c <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200d26c: 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; 200d270: 80 a6 20 00 cmp %i0, 0 200d274: 12 80 00 06 bne 200d28c <_Objects_Id_to_name+0x20> 200d278: 83 36 20 18 srl %i0, 0x18, %g1 200d27c: 03 00 80 b8 sethi %hi(0x202e000), %g1 200d280: c2 00 62 ec ld [ %g1 + 0x2ec ], %g1 ! 202e2ec <_Per_CPU_Information+0xc> 200d284: f0 00 60 08 ld [ %g1 + 8 ], %i0 200d288: 83 36 20 18 srl %i0, 0x18, %g1 200d28c: 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 ) 200d290: 84 00 7f ff add %g1, -1, %g2 200d294: 80 a0 a0 02 cmp %g2, 2 200d298: 08 80 00 18 bleu 200d2f8 <_Objects_Id_to_name+0x8c> 200d29c: 83 28 60 02 sll %g1, 2, %g1 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; 200d2a0: 81 c7 e0 08 ret 200d2a4: 91 e8 20 03 restore %g0, 3, %o0 if ( !_Objects_Information_table[ the_api ] ) return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 200d2a8: 85 28 a0 02 sll %g2, 2, %g2 200d2ac: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 200d2b0: 80 a2 20 00 cmp %o0, 0 200d2b4: 02 bf ff fb be 200d2a0 <_Objects_Id_to_name+0x34> <== NEVER TAKEN 200d2b8: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 200d2bc: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 200d2c0: 80 a0 60 00 cmp %g1, 0 200d2c4: 12 bf ff f7 bne 200d2a0 <_Objects_Id_to_name+0x34> <== NEVER TAKEN 200d2c8: 92 10 00 18 mov %i0, %o1 return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 200d2cc: 7f ff ff ca call 200d1f4 <_Objects_Get> 200d2d0: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 200d2d4: 80 a2 20 00 cmp %o0, 0 200d2d8: 02 bf ff f2 be 200d2a0 <_Objects_Id_to_name+0x34> 200d2dc: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200d2e0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 200d2e4: b0 10 20 00 clr %i0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 200d2e8: 40 00 03 c3 call 200e1f4 <_Thread_Enable_dispatch> 200d2ec: c2 26 40 00 st %g1, [ %i1 ] 200d2f0: 81 c7 e0 08 ret 200d2f4: 81 e8 00 00 restore the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 200d2f8: 05 00 80 b7 sethi %hi(0x202dc00), %g2 200d2fc: 84 10 a0 d4 or %g2, 0xd4, %g2 ! 202dcd4 <_Objects_Information_table> 200d300: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200d304: 80 a0 60 00 cmp %g1, 0 200d308: 12 bf ff e8 bne 200d2a8 <_Objects_Id_to_name+0x3c> 200d30c: 85 36 20 1b srl %i0, 0x1b, %g2 200d310: 30 bf ff e4 b,a 200d2a0 <_Objects_Id_to_name+0x34> =============================================================================== 0200f0bc <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200f0bc: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200f0c0: c2 06 20 08 ld [ %i0 + 8 ], %g1 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200f0c4: 39 00 00 3f sethi %hi(0xfc00), %i4 200f0c8: b5 30 60 18 srl %g1, 0x18, %i2 200f0cc: b8 17 23 ff or %i4, 0x3ff, %i4 200f0d0: b4 0e a0 07 and %i2, 7, %i2 200f0d4: b8 08 40 1c and %g1, %i4, %i4 200f0d8: b4 06 a0 04 add %i2, 4, %i2 200f0dc: b9 2f 20 02 sll %i4, 2, %i4 * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; 200f0e0: 37 00 80 77 sethi %hi(0x201dc00), %i3 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200f0e4: b5 2e a0 02 sll %i2, 2, %i2 * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; 200f0e8: 82 16 e2 e8 or %i3, 0x2e8, %g1 done = true; for ( index = 1 ; index <= max ; ++index ) { 200f0ec: ba 10 20 01 mov 1, %i5 */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; 200f0f0: 84 10 20 01 mov 1, %g2 for ( index = 1 ; index <= max ; ++index ) { 200f0f4: 10 80 00 18 b 200f154 <_POSIX_Keys_Run_destructors+0x98> 200f0f8: f2 10 60 10 lduh [ %g1 + 0x10 ], %i1 POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; 200f0fc: 86 16 e2 e8 or %i3, 0x2e8, %g3 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200f100: c6 00 e0 1c ld [ %g3 + 0x1c ], %g3 200f104: 83 28 60 02 sll %g1, 2, %g1 200f108: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200f10c: 80 a0 60 00 cmp %g1, 0 200f110: 22 80 00 11 be,a 200f154 <_POSIX_Keys_Run_destructors+0x98> 200f114: ba 07 60 01 inc %i5 200f118: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200f11c: 80 a0 e0 00 cmp %g3, 0 200f120: 02 80 00 0c be 200f150 <_POSIX_Keys_Run_destructors+0x94> 200f124: 86 00 40 1a add %g1, %i2, %g3 void *value = key->Values [ thread_api ][ thread_index ]; 200f128: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200f12c: d0 00 c0 1c ld [ %g3 + %i4 ], %o0 if ( value != NULL ) { 200f130: 80 a2 20 00 cmp %o0, 0 200f134: 22 80 00 08 be,a 200f154 <_POSIX_Keys_Run_destructors+0x98><== ALWAYS TAKEN 200f138: ba 07 60 01 inc %i5 key->Values [ thread_api ][ thread_index ] = NULL; 200f13c: c0 20 c0 1c clr [ %g3 + %i4 ] <== NOT EXECUTED (*key->destructor)( value ); 200f140: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED 200f144: 9f c0 40 00 call %g1 <== NOT EXECUTED 200f148: 01 00 00 00 nop <== NOT EXECUTED done = false; 200f14c: 84 10 20 00 clr %g2 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200f150: ba 07 60 01 inc %i5 200f154: 83 2f 60 10 sll %i5, 0x10, %g1 200f158: 83 30 60 10 srl %g1, 0x10, %g1 200f15c: 80 a0 40 19 cmp %g1, %i1 200f160: 08 bf ff e7 bleu 200f0fc <_POSIX_Keys_Run_destructors+0x40> 200f164: 80 88 a0 ff btst 0xff, %g2 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 200f168: 02 bf ff e1 be 200f0ec <_POSIX_Keys_Run_destructors+0x30> <== NEVER TAKEN 200f16c: 82 16 e2 e8 or %i3, 0x2e8, %g1 done = false; } } } } } 200f170: 81 c7 e0 08 ret 200f174: 81 e8 00 00 restore =============================================================================== 0200ca40 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200ca40: 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( 200ca44: 11 00 80 ab sethi %hi(0x202ac00), %o0 200ca48: 92 10 00 18 mov %i0, %o1 200ca4c: 90 12 21 3c or %o0, 0x13c, %o0 200ca50: 40 00 0c bc call 200fd40 <_Objects_Get> 200ca54: 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 ) { 200ca58: c2 07 bf f8 ld [ %fp + -8 ], %g1 200ca5c: 80 a0 60 00 cmp %g1, 0 200ca60: 12 80 00 40 bne 200cb60 <_POSIX_Message_queue_Receive_support+0x120> 200ca64: 01 00 00 00 nop case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200ca68: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200ca6c: 84 08 60 03 and %g1, 3, %g2 200ca70: 80 a0 a0 01 cmp %g2, 1 200ca74: 32 80 00 05 bne,a 200ca88 <_POSIX_Message_queue_Receive_support+0x48> 200ca78: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 _Thread_Enable_dispatch(); 200ca7c: 40 00 10 83 call 2010c88 <_Thread_Enable_dispatch> 200ca80: 01 00 00 00 nop 200ca84: 30 80 00 37 b,a 200cb60 <_POSIX_Message_queue_Receive_support+0x120> rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200ca88: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200ca8c: 80 a6 80 02 cmp %i2, %g2 200ca90: 1a 80 00 08 bcc 200cab0 <_POSIX_Message_queue_Receive_support+0x70> 200ca94: 84 10 3f ff mov -1, %g2 _Thread_Enable_dispatch(); 200ca98: 40 00 10 7c call 2010c88 <_Thread_Enable_dispatch> 200ca9c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200caa0: 40 00 28 86 call 2016cb8 <__errno> 200caa4: 01 00 00 00 nop 200caa8: 10 80 00 31 b 200cb6c <_POSIX_Message_queue_Receive_support+0x12c> 200caac: 82 10 20 7a mov 0x7a, %g1 ! 7a /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200cab0: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200cab4: 80 a7 20 00 cmp %i4, 0 200cab8: 02 80 00 05 be 200cacc <_POSIX_Message_queue_Receive_support+0x8c> 200cabc: 98 10 20 00 clr %o4 do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200cac0: 99 30 60 0e srl %g1, 0xe, %o4 200cac4: 98 1b 20 01 xor %o4, 1, %o4 200cac8: 98 0b 20 01 and %o4, 1, %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200cacc: 90 02 20 1c add %o0, 0x1c, %o0 200cad0: 92 10 00 18 mov %i0, %o1 200cad4: 94 10 00 19 mov %i1, %o2 200cad8: 96 07 bf fc add %fp, -4, %o3 200cadc: 98 0b 20 01 and %o4, 1, %o4 200cae0: 40 00 08 6d call 200ec94 <_CORE_message_queue_Seize> 200cae4: 9a 10 00 1d mov %i5, %o5 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200cae8: 40 00 10 68 call 2010c88 <_Thread_Enable_dispatch> 200caec: 01 00 00 00 nop if (msg_prio) { 200caf0: 80 a6 e0 00 cmp %i3, 0 200caf4: 02 80 00 08 be 200cb14 <_POSIX_Message_queue_Receive_support+0xd4><== NEVER TAKEN 200caf8: 03 00 80 ab sethi %hi(0x202ac00), %g1 *msg_prio = _POSIX_Message_queue_Priority_from_core( _Thread_Executing->Wait.count 200cafc: c2 00 61 bc ld [ %g1 + 0x1bc ], %g1 ! 202adbc <_Per_CPU_Information+0xc> RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core( CORE_message_queue_Submit_types priority ) { /* absolute value without a library dependency */ return (unsigned int) ((priority >= 0) ? priority : -priority); 200cb00: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 200cb04: 83 38 a0 1f sra %g2, 0x1f, %g1 200cb08: 84 18 40 02 xor %g1, %g2, %g2 200cb0c: 82 20 80 01 sub %g2, %g1, %g1 timeout ); _Thread_Enable_dispatch(); if (msg_prio) { *msg_prio = _POSIX_Message_queue_Priority_from_core( 200cb10: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Executing->Wait.count ); } if ( !_Thread_Executing->Wait.return_code ) 200cb14: 3b 00 80 ab sethi %hi(0x202ac00), %i5 200cb18: ba 17 61 b0 or %i5, 0x1b0, %i5 ! 202adb0 <_Per_CPU_Information> 200cb1c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200cb20: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200cb24: 80 a0 60 00 cmp %g1, 0 200cb28: 12 80 00 05 bne 200cb3c <_POSIX_Message_queue_Receive_support+0xfc> 200cb2c: 01 00 00 00 nop return length_out; 200cb30: f0 07 bf fc ld [ %fp + -4 ], %i0 200cb34: 81 c7 e0 08 ret 200cb38: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( 200cb3c: 40 00 28 5f call 2016cb8 <__errno> 200cb40: b0 10 3f ff mov -1, %i0 200cb44: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200cb48: b8 10 00 08 mov %o0, %i4 200cb4c: 40 00 00 96 call 200cda4 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200cb50: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200cb54: d0 27 00 00 st %o0, [ %i4 ] 200cb58: 81 c7 e0 08 ret 200cb5c: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200cb60: 40 00 28 56 call 2016cb8 <__errno> 200cb64: 01 00 00 00 nop 200cb68: 82 10 20 09 mov 9, %g1 ! 9 200cb6c: c2 22 00 00 st %g1, [ %o0 ] 200cb70: b0 10 3f ff mov -1, %i0 } 200cb74: 81 c7 e0 08 ret 200cb78: 81 e8 00 00 restore =============================================================================== 0200ee18 <_POSIX_Semaphore_Create_support>: size_t name_len, int pshared, unsigned int value, POSIX_Semaphore_Control **the_sem ) { 200ee18: 9d e3 bf a0 save %sp, -96, %sp POSIX_Semaphore_Control *the_semaphore; CORE_semaphore_Attributes *the_sem_attr; char *name; /* Sharing semaphores among processes is not currently supported */ if (pshared != 0) 200ee1c: 80 a6 a0 00 cmp %i2, 0 200ee20: 22 80 00 06 be,a 200ee38 <_POSIX_Semaphore_Create_support+0x20> 200ee24: 03 00 80 89 sethi %hi(0x2022400), %g1 rtems_set_errno_and_return_minus_one( ENOSYS ); 200ee28: 40 00 0a d2 call 2011970 <__errno> 200ee2c: 01 00 00 00 nop 200ee30: 10 80 00 11 b 200ee74 <_POSIX_Semaphore_Create_support+0x5c> 200ee34: 82 10 20 58 mov 0x58, %g1 ! 58 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200ee38: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 200ee3c: 84 00 a0 01 inc %g2 200ee40: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 200ee44: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 * _POSIX_Semaphore_Allocate */ RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Allocate( void ) { return (POSIX_Semaphore_Control *) 200ee48: 21 00 80 8a sethi %hi(0x2022800), %l0 200ee4c: 7f ff ee e7 call 200a9e8 <_Objects_Allocate> 200ee50: 90 14 20 e0 or %l0, 0xe0, %o0 ! 20228e0 <_POSIX_Semaphore_Information> _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { 200ee54: ba 92 20 00 orcc %o0, 0, %i5 200ee58: 12 80 00 0a bne 200ee80 <_POSIX_Semaphore_Create_support+0x68> 200ee5c: 80 a6 20 00 cmp %i0, 0 _Thread_Enable_dispatch(); 200ee60: 7f ff f4 05 call 200be74 <_Thread_Enable_dispatch> 200ee64: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSPC ); 200ee68: 40 00 0a c2 call 2011970 <__errno> 200ee6c: 01 00 00 00 nop 200ee70: 82 10 20 1c mov 0x1c, %g1 ! 1c 200ee74: c2 22 00 00 st %g1, [ %o0 ] 200ee78: 81 c7 e0 08 ret 200ee7c: 91 e8 3f ff restore %g0, -1, %o0 /* * Make a copy of the user's string for name just in case it was * dynamically constructed. */ if ( name_arg != NULL ) { 200ee80: 02 80 00 10 be 200eec0 <_POSIX_Semaphore_Create_support+0xa8> 200ee84: 90 10 00 18 mov %i0, %o0 name = _Workspace_String_duplicate( name_arg, name_len ); 200ee88: 40 00 04 78 call 2010068 <_Workspace_String_duplicate> 200ee8c: 92 10 00 19 mov %i1, %o1 if ( !name ) { 200ee90: b4 92 20 00 orcc %o0, 0, %i2 200ee94: 12 80 00 0d bne 200eec8 <_POSIX_Semaphore_Create_support+0xb0><== ALWAYS TAKEN 200ee98: 80 a6 a0 00 cmp %i2, 0 RTEMS_INLINE_ROUTINE void _POSIX_Semaphore_Free ( POSIX_Semaphore_Control *the_semaphore ) { _Objects_Free( &_POSIX_Semaphore_Information, &the_semaphore->Object ); 200ee9c: 90 14 20 e0 or %l0, 0xe0, %o0 <== NOT EXECUTED 200eea0: 7f ff ef a9 call 200ad44 <_Objects_Free> <== NOT EXECUTED 200eea4: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED _POSIX_Semaphore_Free( the_semaphore ); _Thread_Enable_dispatch(); 200eea8: 7f ff f3 f3 call 200be74 <_Thread_Enable_dispatch> <== NOT EXECUTED 200eeac: 01 00 00 00 nop <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 200eeb0: 40 00 0a b0 call 2011970 <__errno> <== NOT EXECUTED 200eeb4: 01 00 00 00 nop <== NOT EXECUTED 200eeb8: 10 bf ff ef b 200ee74 <_POSIX_Semaphore_Create_support+0x5c><== NOT EXECUTED 200eebc: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED } } else { name = NULL; 200eec0: b4 10 20 00 clr %i2 } the_semaphore->process_shared = pshared; if ( name ) { 200eec4: 80 a6 a0 00 cmp %i2, 0 200eec8: 02 80 00 08 be 200eee8 <_POSIX_Semaphore_Create_support+0xd0> 200eecc: c0 27 60 10 clr [ %i5 + 0x10 ] the_semaphore->named = true; 200eed0: 82 10 20 01 mov 1, %g1 200eed4: c2 2f 60 14 stb %g1, [ %i5 + 0x14 ] the_semaphore->open_count = 1; 200eed8: 82 10 20 01 mov 1, %g1 200eedc: c2 27 60 18 st %g1, [ %i5 + 0x18 ] the_semaphore->linked = true; 200eee0: 10 80 00 05 b 200eef4 <_POSIX_Semaphore_Create_support+0xdc> 200eee4: c2 2f 60 15 stb %g1, [ %i5 + 0x15 ] } else { the_semaphore->named = false; 200eee8: c0 2f 60 14 clrb [ %i5 + 0x14 ] the_semaphore->open_count = 0; 200eeec: c0 27 60 18 clr [ %i5 + 0x18 ] the_semaphore->linked = false; 200eef0: c0 2f 60 15 clrb [ %i5 + 0x15 ] the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200eef4: 82 10 3f ff mov -1, %g1 _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200eef8: 90 07 60 1c add %i5, 0x1c, %o0 the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200eefc: c2 27 60 5c st %g1, [ %i5 + 0x5c ] _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200ef00: 92 07 60 5c add %i5, 0x5c, %o1 200ef04: 94 10 00 1b mov %i3, %o2 200ef08: 7f ff ed 2c call 200a3b8 <_CORE_semaphore_Initialize> 200ef0c: c0 27 60 60 clr [ %i5 + 0x60 ] Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200ef10: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200ef14: 05 00 80 8a sethi %hi(0x2022800), %g2 200ef18: c4 00 a0 fc ld [ %g2 + 0xfc ], %g2 ! 20228fc <_POSIX_Semaphore_Information+0x1c> 200ef1c: 83 28 60 02 sll %g1, 2, %g1 200ef20: fa 20 80 01 st %i5, [ %g2 + %g1 ] the_object ); #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) /* ASSERT: information->is_string */ the_object->name.name_p = name; 200ef24: f4 27 60 0c st %i2, [ %i5 + 0xc ] &_POSIX_Semaphore_Information, &the_semaphore->Object, name ); *the_sem = the_semaphore; 200ef28: fa 27 00 00 st %i5, [ %i4 ] _Thread_Enable_dispatch(); 200ef2c: 7f ff f3 d2 call 200be74 <_Thread_Enable_dispatch> 200ef30: b0 10 20 00 clr %i0 return 0; } 200ef34: 81 c7 e0 08 ret 200ef38: 81 e8 00 00 restore =============================================================================== 0200c8d0 <_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 ]; 200c8d0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200c8d4: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200c8d8: 80 a0 a0 00 cmp %g2, 0 200c8dc: 12 80 00 13 bne 200c928 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58><== NEVER TAKEN 200c8e0: 01 00 00 00 nop 200c8e4: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200c8e8: 80 a0 a0 01 cmp %g2, 1 200c8ec: 12 80 00 0f bne 200c928 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200c8f0: 01 00 00 00 nop thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200c8f4: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 200c8f8: 80 a0 60 00 cmp %g1, 0 200c8fc: 02 80 00 0b be 200c928 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200c900: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200c904: 03 00 80 77 sethi %hi(0x201dc00), %g1 200c908: c4 00 63 50 ld [ %g1 + 0x350 ], %g2 ! 201df50 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200c90c: 92 10 3f ff mov -1, %o1 200c910: 84 00 bf ff add %g2, -1, %g2 200c914: c4 20 63 50 st %g2, [ %g1 + 0x350 ] return _Thread_Dispatch_disable_level; 200c918: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 200c91c: 82 13 c0 00 mov %o7, %g1 200c920: 40 00 01 b5 call 200cff4 <_POSIX_Thread_Exit> 200c924: 9e 10 40 00 mov %g1, %o7 } else _Thread_Enable_dispatch(); 200c928: 82 13 c0 00 mov %o7, %g1 200c92c: 7f ff f6 51 call 200a270 <_Thread_Enable_dispatch> 200c930: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200dc78 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200dc78: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200dc7c: 7f ff ff f4 call 200dc4c <_POSIX_Priority_Is_valid> 200dc80: d0 06 40 00 ld [ %i1 ], %o0 200dc84: 80 8a 20 ff btst 0xff, %o0 200dc88: 32 80 00 04 bne,a 200dc98 <_POSIX_Thread_Translate_sched_param+0x20><== ALWAYS TAKEN 200dc8c: c0 26 80 00 clr [ %i2 ] return EINVAL; 200dc90: 81 c7 e0 08 ret 200dc94: 91 e8 20 16 restore %g0, 0x16, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200dc98: 80 a6 20 00 cmp %i0, 0 200dc9c: 12 80 00 06 bne 200dcb4 <_POSIX_Thread_Translate_sched_param+0x3c> 200dca0: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200dca4: 82 10 20 01 mov 1, %g1 200dca8: c2 26 80 00 st %g1, [ %i2 ] return 0; 200dcac: 81 c7 e0 08 ret 200dcb0: 81 e8 00 00 restore } if ( policy == SCHED_FIFO ) { 200dcb4: 80 a6 20 01 cmp %i0, 1 200dcb8: 02 80 00 29 be 200dd5c <_POSIX_Thread_Translate_sched_param+0xe4> 200dcbc: 80 a6 20 02 cmp %i0, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200dcc0: 12 80 00 04 bne 200dcd0 <_POSIX_Thread_Translate_sched_param+0x58> 200dcc4: 80 a6 20 04 cmp %i0, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200dcc8: 10 80 00 25 b 200dd5c <_POSIX_Thread_Translate_sched_param+0xe4> 200dccc: f0 26 80 00 st %i0, [ %i2 ] return 0; } if ( policy == SCHED_SPORADIC ) { 200dcd0: 12 bf ff f0 bne 200dc90 <_POSIX_Thread_Translate_sched_param+0x18> 200dcd4: 01 00 00 00 nop if ( (param->sched_ss_repl_period.tv_sec == 0) && 200dcd8: c2 06 60 08 ld [ %i1 + 8 ], %g1 200dcdc: 80 a0 60 00 cmp %g1, 0 200dce0: 32 80 00 07 bne,a 200dcfc <_POSIX_Thread_Translate_sched_param+0x84> 200dce4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200dce8: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200dcec: 80 a0 60 00 cmp %g1, 0 200dcf0: 02 bf ff e8 be 200dc90 <_POSIX_Thread_Translate_sched_param+0x18> 200dcf4: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200dcf8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200dcfc: 80 a0 60 00 cmp %g1, 0 200dd00: 12 80 00 06 bne 200dd18 <_POSIX_Thread_Translate_sched_param+0xa0> 200dd04: 01 00 00 00 nop 200dd08: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200dd0c: 80 a0 60 00 cmp %g1, 0 200dd10: 02 bf ff e0 be 200dc90 <_POSIX_Thread_Translate_sched_param+0x18> 200dd14: 01 00 00 00 nop (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200dd18: 7f ff f7 66 call 200bab0 <_Timespec_To_ticks> 200dd1c: 90 06 60 08 add %i1, 8, %o0 200dd20: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200dd24: 7f ff f7 63 call 200bab0 <_Timespec_To_ticks> 200dd28: 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 ) < 200dd2c: 80 a7 40 08 cmp %i5, %o0 200dd30: 0a bf ff d8 bcs 200dc90 <_POSIX_Thread_Translate_sched_param+0x18> 200dd34: 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 ) ) 200dd38: 7f ff ff c5 call 200dc4c <_POSIX_Priority_Is_valid> 200dd3c: d0 06 60 04 ld [ %i1 + 4 ], %o0 200dd40: 80 8a 20 ff btst 0xff, %o0 200dd44: 02 bf ff d3 be 200dc90 <_POSIX_Thread_Translate_sched_param+0x18> 200dd48: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200dd4c: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200dd50: 03 00 80 1f sethi %hi(0x2007c00), %g1 200dd54: 82 10 61 f0 or %g1, 0x1f0, %g1 ! 2007df0 <_POSIX_Threads_Sporadic_budget_callout> 200dd58: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200dd5c: 81 c7 e0 08 ret 200dd60: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200cc28 <_POSIX_Threads_Delete_extension>: */ static void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200cc28: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; void **value_ptr; api = deleted->API_Extensions[ THREAD_API_POSIX ]; 200cc2c: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200cc30: 40 00 09 09 call 200f054 <_POSIX_Threads_cancel_run> 200cc34: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200cc38: 90 10 00 19 mov %i1, %o0 200cc3c: 40 00 09 20 call 200f0bc <_POSIX_Keys_Run_destructors> 200cc40: ba 06 20 44 add %i0, 0x44, %i5 /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200cc44: 10 80 00 03 b 200cc50 <_POSIX_Threads_Delete_extension+0x28> 200cc48: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200cc4c: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200cc50: 7f ff f6 3b call 200a53c <_Thread_queue_Dequeue> 200cc54: 90 10 00 1d mov %i5, %o0 200cc58: 80 a2 20 00 cmp %o0, 0 200cc5c: 32 bf ff fc bne,a 200cc4c <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200cc60: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200cc64: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200cc68: 80 a0 60 04 cmp %g1, 4 200cc6c: 32 80 00 05 bne,a 200cc80 <_POSIX_Threads_Delete_extension+0x58> 200cc70: c0 26 61 5c clr [ %i1 + 0x15c ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 200cc74: 7f ff f8 f0 call 200b034 <_Watchdog_Remove> 200cc78: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200cc7c: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200cc80: 7f ff f9 66 call 200b218 <_Workspace_Free> 200cc84: 81 e8 00 00 restore =============================================================================== 02007b4c <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2007b4c: 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; 2007b50: 03 00 80 86 sethi %hi(0x2021800), %g1 2007b54: 82 10 62 50 or %g1, 0x250, %g1 ! 2021a50 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2007b58: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2007b5c: 80 a6 e0 00 cmp %i3, 0 2007b60: 02 80 00 1d be 2007bd4 <_POSIX_Threads_Initialize_user_threads_body+0x88><== NEVER TAKEN 2007b64: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2007b68: 80 a7 60 00 cmp %i5, 0 2007b6c: 02 80 00 1a be 2007bd4 <_POSIX_Threads_Initialize_user_threads_body+0x88><== NEVER TAKEN 2007b70: 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 ); 2007b74: 40 00 18 7c call 200dd64 2007b78: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 2007b7c: 92 10 20 02 mov 2, %o1 2007b80: 40 00 18 85 call 200dd94 2007b84: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2007b88: d2 07 60 04 ld [ %i5 + 4 ], %o1 2007b8c: 40 00 18 91 call 200ddd0 2007b90: 90 07 bf c0 add %fp, -64, %o0 status = pthread_create( 2007b94: d4 07 40 00 ld [ %i5 ], %o2 2007b98: 90 07 bf bc add %fp, -68, %o0 2007b9c: 92 07 bf c0 add %fp, -64, %o1 2007ba0: 96 10 20 00 clr %o3 2007ba4: 7f ff ff 16 call 20077fc 2007ba8: ba 07 60 08 add %i5, 8, %i5 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 2007bac: 80 a2 20 00 cmp %o0, 0 2007bb0: 02 80 00 05 be 2007bc4 <_POSIX_Threads_Initialize_user_threads_body+0x78> 2007bb4: 94 10 00 08 mov %o0, %o2 _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2007bb8: 90 10 20 02 mov 2, %o0 2007bbc: 40 00 07 f9 call 2009ba0 <_Internal_error_Occurred> 2007bc0: 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++ ) { 2007bc4: b8 07 20 01 inc %i4 2007bc8: 80 a7 00 1b cmp %i4, %i3 2007bcc: 12 bf ff ea bne 2007b74 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 2007bd0: 01 00 00 00 nop 2007bd4: 81 c7 e0 08 ret 2007bd8: 81 e8 00 00 restore =============================================================================== 0200cd7c <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200cd7c: 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 ]; 200cd80: 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 ); 200cd84: 40 00 04 30 call 200de44 <_Timespec_To_ticks> 200cd88: 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); 200cd8c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200cd90: d2 08 61 38 ldub [ %g1 + 0x138 ], %o1 ! 201cd38 200cd94: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->cpu_time_budget = ticks; 200cd98: d0 26 60 74 st %o0, [ %i1 + 0x74 ] 200cd9c: 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 ) { 200cda0: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200cda4: 80 a0 60 00 cmp %g1, 0 200cda8: 12 80 00 09 bne 200cdcc <_POSIX_Threads_Sporadic_budget_TSR+0x50><== NEVER TAKEN 200cdac: 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 ) { 200cdb0: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200cdb4: 80 a0 40 09 cmp %g1, %o1 200cdb8: 08 80 00 06 bleu 200cdd0 <_POSIX_Threads_Sporadic_budget_TSR+0x54> 200cdbc: 90 07 60 90 add %i5, 0x90, %o0 _Thread_Change_priority( the_thread, new_priority, true ); 200cdc0: 90 10 00 19 mov %i1, %o0 200cdc4: 7f ff f3 d4 call 2009d14 <_Thread_Change_priority> 200cdc8: 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 ); 200cdcc: 90 07 60 90 add %i5, 0x90, %o0 200cdd0: 40 00 04 1d call 200de44 <_Timespec_To_ticks> 200cdd4: 31 00 80 76 sethi %hi(0x201d800), %i0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cdd8: b0 16 23 88 or %i0, 0x388, %i0 ! 201db88 <_Watchdog_Ticks_chain> Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200cddc: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cde0: 7f ff f8 3d call 200aed4 <_Watchdog_Insert> 200cde4: 93 ef 60 a8 restore %i5, 0xa8, %o1 =============================================================================== 0200cde8 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200cde8: 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 */ 200cdec: 86 10 3f ff mov -1, %g3 200cdf0: c4 00 a0 8c ld [ %g2 + 0x8c ], %g2 200cdf4: c6 22 20 74 st %g3, [ %o0 + 0x74 ] 200cdf8: 07 00 80 73 sethi %hi(0x201cc00), %g3 200cdfc: d2 08 e1 38 ldub [ %g3 + 0x138 ], %o1 ! 201cd38 200ce00: 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 ) { 200ce04: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200ce08: 80 a0 a0 00 cmp %g2, 0 200ce0c: 12 80 00 09 bne 200ce30 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200ce10: 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 ) { 200ce14: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200ce18: 80 a0 40 09 cmp %g1, %o1 200ce1c: 1a 80 00 05 bcc 200ce30 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200ce20: 94 10 20 01 mov 1, %o2 _Thread_Change_priority( the_thread, new_priority, true ); 200ce24: 82 13 c0 00 mov %o7, %g1 200ce28: 7f ff f3 bb call 2009d14 <_Thread_Change_priority> 200ce2c: 9e 10 40 00 mov %g1, %o7 200ce30: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 020075f0 <_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) { 20075f0: 9d e3 bf 98 save %sp, -104, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 20075f4: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 20075f8: 82 00 60 01 inc %g1 20075fc: c2 26 60 68 st %g1, [ %i1 + 0x68 ] /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007600: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 2007604: 80 a0 60 00 cmp %g1, 0 2007608: 32 80 00 07 bne,a 2007624 <_POSIX_Timer_TSR+0x34> 200760c: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2007610: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2007614: 80 a0 60 00 cmp %g1, 0 2007618: 02 80 00 1e be 2007690 <_POSIX_Timer_TSR+0xa0> <== NEVER TAKEN 200761c: 82 10 20 04 mov 4, %g1 ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 2007620: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2007624: d4 06 60 08 ld [ %i1 + 8 ], %o2 2007628: 90 06 60 10 add %i1, 0x10, %o0 200762c: 17 00 80 1d sethi %hi(0x2007400), %o3 2007630: 98 10 00 19 mov %i1, %o4 2007634: 40 00 18 12 call 200d67c <_POSIX_Timer_Insert_helper> 2007638: 96 12 e1 f0 or %o3, 0x1f0, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 200763c: 80 8a 20 ff btst 0xff, %o0 2007640: 02 80 00 19 be 20076a4 <_POSIX_Timer_TSR+0xb4> <== NEVER TAKEN 2007644: 01 00 00 00 nop struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007648: 40 00 05 da call 2008db0 <_TOD_Get_as_timestamp> 200764c: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007650: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007654: 94 10 20 00 clr %o2 2007658: 90 10 00 1c mov %i4, %o0 200765c: 92 10 00 1d mov %i5, %o1 2007660: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007664: 40 00 48 d0 call 20199a4 <__divdi3> 2007668: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 200766c: 90 10 00 1c mov %i4, %o0 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007670: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007674: 94 10 20 00 clr %o2 2007678: 92 10 00 1d mov %i5, %o1 200767c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007680: 40 00 49 b4 call 2019d50 <__moddi3> 2007684: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2007688: 82 10 20 03 mov 3, %g1 200768c: d2 26 60 70 st %o1, [ %i1 + 0x70 ] /* * 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 ) ) { 2007690: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 2007694: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 2007698: 40 00 16 ec call 200d248 200769c: 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; 20076a0: c0 26 60 68 clr [ %i1 + 0x68 ] 20076a4: 81 c7 e0 08 ret 20076a8: 81 e8 00 00 restore =============================================================================== 0200f178 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200f178: 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, 200f17c: 98 10 20 01 mov 1, %o4 200f180: 90 10 00 18 mov %i0, %o0 200f184: 92 10 00 19 mov %i1, %o1 200f188: 94 07 bf cc add %fp, -52, %o2 200f18c: 40 00 00 2e call 200f244 <_POSIX_signals_Clear_signals> 200f190: 96 10 00 1a mov %i2, %o3 200f194: 80 8a 20 ff btst 0xff, %o0 200f198: 02 80 00 28 be 200f238 <_POSIX_signals_Check_signal+0xc0> 200f19c: 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 ) 200f1a0: 85 2e 60 02 sll %i1, 2, %g2 200f1a4: 35 00 80 78 sethi %hi(0x201e000), %i2 200f1a8: b7 2e 60 04 sll %i1, 4, %i3 200f1ac: b4 16 a0 70 or %i2, 0x70, %i2 200f1b0: b6 26 c0 02 sub %i3, %g2, %i3 200f1b4: 84 06 80 1b add %i2, %i3, %g2 200f1b8: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200f1bc: 80 a7 60 01 cmp %i5, 1 200f1c0: 02 80 00 1e be 200f238 <_POSIX_signals_Check_signal+0xc0> <== NEVER TAKEN 200f1c4: 90 07 bf d8 add %fp, -40, %o0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200f1c8: f8 06 20 d0 ld [ %i0 + 0xd0 ], %i4 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200f1cc: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200f1d0: 82 10 40 1c or %g1, %i4, %g1 200f1d4: 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, 200f1d8: 03 00 80 78 sethi %hi(0x201e000), %g1 200f1dc: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 ! 201e01c <_Per_CPU_Information+0xc> 200f1e0: 94 10 20 28 mov 0x28, %o2 200f1e4: 40 00 04 52 call 201032c 200f1e8: 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 ) { 200f1ec: c2 06 80 1b ld [ %i2 + %i3 ], %g1 200f1f0: 80 a0 60 02 cmp %g1, 2 200f1f4: 12 80 00 07 bne 200f210 <_POSIX_signals_Check_signal+0x98> 200f1f8: 90 10 00 19 mov %i1, %o0 case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200f1fc: 92 07 bf cc add %fp, -52, %o1 200f200: 9f c7 40 00 call %i5 200f204: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200f208: 10 80 00 05 b 200f21c <_POSIX_signals_Check_signal+0xa4> 200f20c: 03 00 80 78 sethi %hi(0x201e000), %g1 default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200f210: 9f c7 40 00 call %i5 200f214: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200f218: 03 00 80 78 sethi %hi(0x201e000), %g1 200f21c: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 ! 201e01c <_Per_CPU_Information+0xc> 200f220: 92 07 bf d8 add %fp, -40, %o1 200f224: 90 02 20 20 add %o0, 0x20, %o0 200f228: 40 00 04 41 call 201032c 200f22c: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200f230: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200f234: f8 26 20 d0 st %i4, [ %i0 + 0xd0 ] return true; } 200f238: b0 08 60 01 and %g1, 1, %i0 200f23c: 81 c7 e0 08 ret 200f240: 81 e8 00 00 restore =============================================================================== 0200f96c <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200f96c: 9d e3 bf a0 save %sp, -96, %sp 200f970: 82 06 3f ff add %i0, -1, %g1 200f974: ba 10 20 01 mov 1, %i5 clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200f978: 7f ff cb 53 call 20026c4 200f97c: bb 2f 40 01 sll %i5, %g1, %i5 if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200f980: 05 00 80 78 sethi %hi(0x201e000), %g2 200f984: 83 2e 20 02 sll %i0, 2, %g1 200f988: 84 10 a0 70 or %g2, 0x70, %g2 200f98c: b1 2e 20 04 sll %i0, 4, %i0 200f990: 82 26 00 01 sub %i0, %g1, %g1 200f994: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200f998: 80 a0 a0 02 cmp %g2, 2 200f99c: 32 80 00 0c bne,a 200f9cc <_POSIX_signals_Clear_process_signals+0x60> 200f9a0: 03 00 80 78 sethi %hi(0x201e000), %g1 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200f9a4: 05 00 80 78 sethi %hi(0x201e000), %g2 200f9a8: 84 10 a2 68 or %g2, 0x268, %g2 ! 201e268 <_POSIX_signals_Siginfo> 200f9ac: 86 00 40 02 add %g1, %g2, %g3 200f9b0: 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 ); 200f9b4: 86 00 e0 04 add %g3, 4, %g3 200f9b8: 80 a0 40 03 cmp %g1, %g3 200f9bc: 02 80 00 04 be 200f9cc <_POSIX_signals_Clear_process_signals+0x60><== ALWAYS TAKEN 200f9c0: 03 00 80 78 sethi %hi(0x201e000), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 200f9c4: 7f ff cb 44 call 20026d4 200f9c8: 91 e8 00 08 restore %g0, %o0, %o0 if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200f9cc: c4 00 62 64 ld [ %g1 + 0x264 ], %g2 200f9d0: ba 28 80 1d andn %g2, %i5, %i5 200f9d4: 10 bf ff fc b 200f9c4 <_POSIX_signals_Clear_process_signals+0x58> 200f9d8: fa 20 62 64 st %i5, [ %g1 + 0x264 ] =============================================================================== 020083e8 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20083e8: 82 10 20 1b mov 0x1b, %g1 20083ec: 84 10 20 01 mov 1, %g2 #include #include #include #include static int _POSIX_signals_Get_lowest( 20083f0: 86 00 7f ff add %g1, -1, %g3 20083f4: 87 28 80 03 sll %g2, %g3, %g3 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20083f8: 80 88 c0 08 btst %g3, %o0 20083fc: 12 80 00 11 bne 2008440 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2008400: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2008404: 82 00 60 01 inc %g1 2008408: 80 a0 60 20 cmp %g1, 0x20 200840c: 12 bf ff fa bne 20083f4 <_POSIX_signals_Get_lowest+0xc> 2008410: 86 00 7f ff add %g1, -1, %g3 2008414: 82 10 20 01 mov 1, %g1 2008418: 84 10 20 01 mov 1, %g2 #include #include #include #include static int _POSIX_signals_Get_lowest( 200841c: 86 00 7f ff add %g1, -1, %g3 2008420: 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 ) ) { 2008424: 80 88 c0 08 btst %g3, %o0 2008428: 12 80 00 06 bne 2008440 <_POSIX_signals_Get_lowest+0x58> 200842c: 01 00 00 00 nop */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2008430: 82 00 60 01 inc %g1 2008434: 80 a0 60 1b cmp %g1, 0x1b 2008438: 12 bf ff fa bne 2008420 <_POSIX_signals_Get_lowest+0x38> <== ALWAYS TAKEN 200843c: 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; } 2008440: 81 c3 e0 08 retl 2008444: 90 10 00 01 mov %g1, %o0 =============================================================================== 0201a64c <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201a64c: 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 ) ) { 201a650: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201a654: 3b 04 00 20 sethi %hi(0x10008000), %i5 201a658: 84 06 7f ff add %i1, -1, %g2 201a65c: 86 10 20 01 mov 1, %g3 201a660: b8 08 40 1d and %g1, %i5, %i4 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201a664: 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 ) ) { 201a668: 80 a7 00 1d cmp %i4, %i5 201a66c: 12 80 00 1e bne 201a6e4 <_POSIX_signals_Unblock_thread+0x98> 201a670: 85 28 c0 02 sll %g3, %g2, %g2 if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201a674: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201a678: 80 88 80 01 btst %g2, %g1 201a67c: 12 80 00 08 bne 201a69c <_POSIX_signals_Unblock_thread+0x50> 201a680: 82 10 20 04 mov 4, %g1 201a684: c2 01 20 d0 ld [ %g4 + 0xd0 ], %g1 201a688: 80 a8 80 01 andncc %g2, %g1, %g0 201a68c: 32 80 00 04 bne,a 201a69c <_POSIX_signals_Unblock_thread+0x50> 201a690: 82 10 20 04 mov 4, %g1 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201a694: 10 80 00 3d b 201a788 <_POSIX_signals_Unblock_thread+0x13c> 201a698: b0 10 20 00 clr %i0 */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { the_thread->Wait.return_code = EINTR; 201a69c: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201a6a0: 80 a6 a0 00 cmp %i2, 0 201a6a4: 12 80 00 07 bne 201a6c0 <_POSIX_signals_Unblock_thread+0x74> 201a6a8: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 201a6ac: 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; 201a6b0: f2 22 00 00 st %i1, [ %o0 ] the_info->si_code = SI_USER; 201a6b4: c2 22 20 04 st %g1, [ %o0 + 4 ] the_info->si_value.sival_int = 0; 201a6b8: 10 80 00 05 b 201a6cc <_POSIX_signals_Unblock_thread+0x80> 201a6bc: c0 22 20 08 clr [ %o0 + 8 ] } else { *the_info = *info; 201a6c0: 92 10 00 1a mov %i2, %o1 201a6c4: 7f ff d7 1a call 201032c 201a6c8: 94 10 20 0c mov 0xc, %o2 } _Thread_queue_Extract_with_proxy( the_thread ); 201a6cc: 90 10 00 18 mov %i0, %o0 201a6d0: 7f ff c0 88 call 200a8f0 <_Thread_queue_Extract_with_proxy> 201a6d4: b0 10 20 01 mov 1, %i0 201a6d8: b0 0e 20 01 and %i0, 1, %i0 201a6dc: 81 c7 e0 08 ret 201a6e0: 81 e8 00 00 restore } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201a6e4: c8 01 20 d0 ld [ %g4 + 0xd0 ], %g4 201a6e8: 80 a8 80 04 andncc %g2, %g4, %g0 201a6ec: 02 80 00 26 be 201a784 <_POSIX_signals_Unblock_thread+0x138> 201a6f0: 05 04 00 00 sethi %hi(0x10000000), %g2 * it is not blocked, THEN * we need to dispatch at the end of this ISR. * + Any other combination, do nothing. */ if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) { 201a6f4: 80 88 40 02 btst %g1, %g2 201a6f8: 02 80 00 17 be 201a754 <_POSIX_signals_Unblock_thread+0x108> 201a6fc: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201a700: 84 10 20 04 mov 4, %g2 201a704: 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) ) 201a708: 05 00 00 ef sethi %hi(0x3bc00), %g2 201a70c: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 201a710: 80 88 40 02 btst %g1, %g2 201a714: 02 80 00 06 be 201a72c <_POSIX_signals_Unblock_thread+0xe0> 201a718: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); 201a71c: 7f ff c0 75 call 200a8f0 <_Thread_queue_Extract_with_proxy> 201a720: 90 10 00 18 mov %i0, %o0 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201a724: 10 80 00 19 b 201a788 <_POSIX_signals_Unblock_thread+0x13c> 201a728: b0 10 20 00 clr %i0 * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201a72c: 22 80 00 17 be,a 201a788 <_POSIX_signals_Unblock_thread+0x13c><== NEVER TAKEN 201a730: b0 10 20 00 clr %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201a734: 7f ff c2 40 call 200b034 <_Watchdog_Remove> 201a738: 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 ); 201a73c: 90 10 00 18 mov %i0, %o0 201a740: 13 04 00 ff sethi %hi(0x1003fc00), %o1 201a744: 7f ff bd b9 call 2009e28 <_Thread_Clear_state> 201a748: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201a74c: 10 80 00 0f b 201a788 <_POSIX_signals_Unblock_thread+0x13c> 201a750: b0 10 20 00 clr %i0 else if ( _States_Is_delaying(the_thread->current_state) ) { (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 201a754: 32 80 00 0d bne,a 201a788 <_POSIX_signals_Unblock_thread+0x13c><== NEVER TAKEN 201a758: b0 10 20 00 clr %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a75c: 03 00 80 78 sethi %hi(0x201e000), %g1 201a760: 82 10 60 10 or %g1, 0x10, %g1 ! 201e010 <_Per_CPU_Information> 201a764: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a768: 80 a0 a0 00 cmp %g2, 0 201a76c: 22 80 00 07 be,a 201a788 <_POSIX_signals_Unblock_thread+0x13c> 201a770: b0 10 20 00 clr %i0 201a774: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a778: 80 a6 00 02 cmp %i0, %g2 201a77c: 22 80 00 02 be,a 201a784 <_POSIX_signals_Unblock_thread+0x138><== ALWAYS TAKEN 201a780: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; 201a784: b0 10 20 00 clr %i0 } 201a788: b0 0e 20 01 and %i0, 1, %i0 201a78c: 81 c7 e0 08 ret 201a790: 81 e8 00 00 restore =============================================================================== 0200a37c <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200a37c: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200a380: 80 a6 60 00 cmp %i1, 0 200a384: 02 80 00 69 be 200a528 <_RBTree_Extract_unprotected+0x1ac> 200a388: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200a38c: c2 06 20 08 ld [ %i0 + 8 ], %g1 200a390: 80 a6 40 01 cmp %i1, %g1 200a394: 32 80 00 07 bne,a 200a3b0 <_RBTree_Extract_unprotected+0x34> 200a398: c2 06 20 0c ld [ %i0 + 0xc ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_RIGHT ); 200a39c: 90 10 00 19 mov %i1, %o0 200a3a0: 40 00 01 31 call 200a864 <_RBTree_Next_unprotected> 200a3a4: 92 10 20 01 mov 1, %o1 RBTree_Node *next; next = _RBTree_Successor_unprotected(the_node); the_rbtree->first[RBT_LEFT] = next; 200a3a8: d0 26 20 08 st %o0, [ %i0 + 8 ] } /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200a3ac: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200a3b0: 80 a6 40 01 cmp %i1, %g1 200a3b4: 32 80 00 07 bne,a 200a3d0 <_RBTree_Extract_unprotected+0x54> 200a3b8: fa 06 60 04 ld [ %i1 + 4 ], %i5 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_LEFT ); 200a3bc: 90 10 00 19 mov %i1, %o0 200a3c0: 40 00 01 29 call 200a864 <_RBTree_Next_unprotected> 200a3c4: 92 10 20 00 clr %o1 RBTree_Node *previous; previous = _RBTree_Predecessor_unprotected(the_node); the_rbtree->first[RBT_RIGHT] = previous; 200a3c8: d0 26 20 0c st %o0, [ %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]) { 200a3cc: fa 06 60 04 ld [ %i1 + 4 ], %i5 200a3d0: 80 a7 60 00 cmp %i5, 0 200a3d4: 02 80 00 36 be 200a4ac <_RBTree_Extract_unprotected+0x130> 200a3d8: f8 06 60 08 ld [ %i1 + 8 ], %i4 200a3dc: 80 a7 20 00 cmp %i4, 0 200a3e0: 32 80 00 05 bne,a 200a3f4 <_RBTree_Extract_unprotected+0x78> 200a3e4: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a3e8: 10 80 00 35 b 200a4bc <_RBTree_Extract_unprotected+0x140> 200a3ec: b8 10 00 1d mov %i5, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 200a3f0: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a3f4: 80 a0 60 00 cmp %g1, 0 200a3f8: 32 bf ff fe bne,a 200a3f0 <_RBTree_Extract_unprotected+0x74> 200a3fc: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 200a400: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200a404: 80 a7 20 00 cmp %i4, 0 200a408: 02 80 00 05 be 200a41c <_RBTree_Extract_unprotected+0xa0> 200a40c: 01 00 00 00 nop leaf->parent = target->parent; 200a410: c2 07 40 00 ld [ %i5 ], %g1 200a414: 10 80 00 04 b 200a424 <_RBTree_Extract_unprotected+0xa8> 200a418: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 200a41c: 7f ff ff 73 call 200a1e8 <_RBTree_Extract_validate_unprotected> 200a420: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200a424: c4 07 40 00 ld [ %i5 ], %g2 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; 200a428: c2 07 60 0c ld [ %i5 + 0xc ], %g1 dir = target != target->parent->child[0]; 200a42c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a430: 86 1f 40 03 xor %i5, %g3, %g3 200a434: 80 a0 00 03 cmp %g0, %g3 200a438: 86 40 20 00 addx %g0, 0, %g3 target->parent->child[dir] = leaf; 200a43c: 87 28 e0 02 sll %g3, 2, %g3 200a440: 84 00 80 03 add %g2, %g3, %g2 200a444: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200a448: c4 06 40 00 ld [ %i1 ], %g2 200a44c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a450: 86 1e 40 03 xor %i1, %g3, %g3 200a454: 80 a0 00 03 cmp %g0, %g3 200a458: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = target; 200a45c: 87 28 e0 02 sll %g3, 2, %g3 200a460: 84 00 80 03 add %g2, %g3, %g2 200a464: fa 20 a0 04 st %i5, [ %g2 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 200a468: c4 06 60 08 ld [ %i1 + 8 ], %g2 200a46c: c4 27 60 08 st %g2, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200a470: c4 06 60 08 ld [ %i1 + 8 ], %g2 200a474: 80 a0 a0 00 cmp %g2, 0 200a478: 32 80 00 02 bne,a 200a480 <_RBTree_Extract_unprotected+0x104><== ALWAYS TAKEN 200a47c: fa 20 80 00 st %i5, [ %g2 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200a480: c4 06 60 04 ld [ %i1 + 4 ], %g2 200a484: c4 27 60 04 st %g2, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200a488: c4 06 60 04 ld [ %i1 + 4 ], %g2 200a48c: 80 a0 a0 00 cmp %g2, 0 200a490: 32 80 00 02 bne,a 200a498 <_RBTree_Extract_unprotected+0x11c> 200a494: fa 20 80 00 st %i5, [ %g2 ] /* 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; 200a498: c4 06 40 00 ld [ %i1 ], %g2 200a49c: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200a4a0: c4 06 60 0c ld [ %i1 + 0xc ], %g2 200a4a4: 10 80 00 14 b 200a4f4 <_RBTree_Extract_unprotected+0x178> 200a4a8: c4 27 60 0c st %g2, [ %i5 + 0xc ] * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { 200a4ac: 80 a7 20 00 cmp %i4, 0 200a4b0: 32 80 00 04 bne,a 200a4c0 <_RBTree_Extract_unprotected+0x144> 200a4b4: c2 06 40 00 ld [ %i1 ], %g1 200a4b8: 30 80 00 04 b,a 200a4c8 <_RBTree_Extract_unprotected+0x14c> leaf->parent = the_node->parent; 200a4bc: c2 06 40 00 ld [ %i1 ], %g1 200a4c0: 10 80 00 04 b 200a4d0 <_RBTree_Extract_unprotected+0x154> 200a4c4: 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); 200a4c8: 7f ff ff 48 call 200a1e8 <_RBTree_Extract_validate_unprotected> 200a4cc: 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]; 200a4d0: 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; 200a4d4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200a4d8: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a4dc: 86 1e 40 03 xor %i1, %g3, %g3 200a4e0: 80 a0 00 03 cmp %g0, %g3 200a4e4: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 200a4e8: 87 28 e0 02 sll %g3, 2, %g3 200a4ec: 84 00 80 03 add %g2, %g3, %g2 200a4f0: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 200a4f4: 80 a0 60 00 cmp %g1, 0 200a4f8: 32 80 00 06 bne,a 200a510 <_RBTree_Extract_unprotected+0x194> 200a4fc: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200a500: 80 a7 20 00 cmp %i4, 0 200a504: 32 80 00 02 bne,a 200a50c <_RBTree_Extract_unprotected+0x190> 200a508: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 200a50c: 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; 200a510: c0 26 60 08 clr [ %i1 + 8 ] 200a514: c0 26 60 04 clr [ %i1 + 4 ] 200a518: 80 a0 60 00 cmp %g1, 0 200a51c: 02 80 00 03 be 200a528 <_RBTree_Extract_unprotected+0x1ac> 200a520: c0 26 40 00 clr [ %i1 ] 200a524: c0 20 60 0c clr [ %g1 + 0xc ] 200a528: 81 c7 e0 08 ret 200a52c: 81 e8 00 00 restore =============================================================================== 0200b570 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200b570: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200b574: 80 a6 20 00 cmp %i0, 0 200b578: 02 80 00 10 be 200b5b8 <_RBTree_Initialize+0x48> <== NEVER TAKEN 200b57c: 01 00 00 00 nop RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200b580: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200b584: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200b588: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200b58c: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200b590: f2 26 20 10 st %i1, [ %i0 + 0x10 ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200b594: 10 80 00 06 b 200b5ac <_RBTree_Initialize+0x3c> 200b598: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 200b59c: 90 10 00 18 mov %i0, %o0 200b5a0: 7f ff ff 2e call 200b258 <_RBTree_Insert_unprotected> 200b5a4: b4 06 80 1c add %i2, %i4, %i2 200b5a8: b6 06 ff ff add %i3, -1, %i3 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200b5ac: 80 a6 e0 00 cmp %i3, 0 200b5b0: 12 bf ff fb bne 200b59c <_RBTree_Initialize+0x2c> 200b5b4: 92 10 00 1a mov %i2, %o1 200b5b8: 81 c7 e0 08 ret 200b5bc: 81 e8 00 00 restore =============================================================================== 0200a5d0 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200a5d0: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200a5d4: 80 a6 60 00 cmp %i1, 0 200a5d8: 02 80 00 7c be 200a7c8 <_RBTree_Insert_unprotected+0x1f8> 200a5dc: ba 10 00 18 mov %i0, %i5 RBTree_Node *iter_node = the_rbtree->root; 200a5e0: f0 06 20 04 ld [ %i0 + 4 ], %i0 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200a5e4: b6 96 20 00 orcc %i0, 0, %i3 200a5e8: 32 80 00 0c bne,a 200a618 <_RBTree_Insert_unprotected+0x48> 200a5ec: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200a5f0: c0 26 60 0c clr [ %i1 + 0xc ] the_rbtree->root = the_node; 200a5f4: f2 27 60 04 st %i1, [ %i5 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200a5f8: f2 27 60 0c st %i1, [ %i5 + 0xc ] 200a5fc: f2 27 60 08 st %i1, [ %i5 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200a600: fa 26 40 00 st %i5, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200a604: c0 26 60 08 clr [ %i1 + 8 ] 200a608: c0 26 60 04 clr [ %i1 + 4 ] 200a60c: 81 c7 e0 08 ret 200a610: 81 e8 00 00 restore } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); 200a614: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a618: 90 10 00 19 mov %i1, %o0 200a61c: 9f c0 40 00 call %g1 200a620: 92 10 00 18 mov %i0, %o1 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200a624: c2 0f 60 14 ldub [ %i5 + 0x14 ], %g1 200a628: 80 a0 60 00 cmp %g1, 0 200a62c: 02 80 00 05 be 200a640 <_RBTree_Insert_unprotected+0x70> 200a630: b8 38 00 08 xnor %g0, %o0, %i4 200a634: 80 a2 20 00 cmp %o0, 0 200a638: 02 80 00 65 be 200a7cc <_RBTree_Insert_unprotected+0x1fc> 200a63c: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200a640: b9 37 20 1f srl %i4, 0x1f, %i4 if (!iter_node->child[dir]) { 200a644: 83 2f 20 02 sll %i4, 2, %g1 200a648: 82 06 00 01 add %i0, %g1, %g1 200a64c: f0 00 60 04 ld [ %g1 + 4 ], %i0 200a650: 80 a6 20 00 cmp %i0, 0 200a654: 32 bf ff f0 bne,a 200a614 <_RBTree_Insert_unprotected+0x44> 200a658: b6 10 00 18 mov %i0, %i3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200a65c: c0 26 60 08 clr [ %i1 + 8 ] 200a660: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; 200a664: 84 10 20 01 mov 1, %g2 iter_node->child[dir] = the_node; 200a668: f2 20 60 04 st %i1, [ %g1 + 4 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200a66c: c4 26 60 0c st %g2, [ %i1 + 0xc ] iter_node->child[dir] = the_node; the_node->parent = iter_node; 200a670: f6 26 40 00 st %i3, [ %i1 ] /* update min/max */ compare_result = the_rbtree->compare_function( 200a674: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200a678: b6 07 20 02 add %i4, 2, %i3 200a67c: 85 2e e0 02 sll %i3, 2, %g2 200a680: d2 07 40 02 ld [ %i5 + %g2 ], %o1 200a684: 9f c0 40 00 call %g1 200a688: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 200a68c: 80 a7 20 00 cmp %i4, 0 200a690: 12 80 00 06 bne 200a6a8 <_RBTree_Insert_unprotected+0xd8> 200a694: 80 a2 20 00 cmp %o0, 0 200a698: 36 80 00 3c bge,a 200a788 <_RBTree_Insert_unprotected+0x1b8> 200a69c: d0 06 40 00 ld [ %i1 ], %o0 (dir && _RBTree_Is_greater(compare_result)) ) { the_rbtree->first[dir] = the_node; 200a6a0: 10 80 00 04 b 200a6b0 <_RBTree_Insert_unprotected+0xe0> 200a6a4: b7 2e e0 02 sll %i3, 2, %i3 compare_result = the_rbtree->compare_function( the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || (dir && _RBTree_Is_greater(compare_result)) ) { 200a6a8: 04 80 00 37 ble 200a784 <_RBTree_Insert_unprotected+0x1b4> 200a6ac: b7 2e e0 02 sll %i3, 2, %i3 the_rbtree->first[dir] = the_node; 200a6b0: 10 80 00 35 b 200a784 <_RBTree_Insert_unprotected+0x1b4> 200a6b4: f2 27 40 1b st %i1, [ %i5 + %i3 ] const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; 200a6b8: 02 80 00 13 be 200a704 <_RBTree_Insert_unprotected+0x134> <== NEVER TAKEN 200a6bc: 82 10 20 00 clr %g1 if(!(the_node->parent->parent->parent)) return NULL; 200a6c0: c2 07 40 00 ld [ %i5 ], %g1 200a6c4: 80 a0 60 00 cmp %g1, 0 200a6c8: 02 80 00 0f be 200a704 <_RBTree_Insert_unprotected+0x134> <== NEVER TAKEN 200a6cc: 82 10 20 00 clr %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]) 200a6d0: c2 07 60 04 ld [ %i5 + 4 ], %g1 200a6d4: 80 a2 00 01 cmp %o0, %g1 200a6d8: 22 80 00 02 be,a 200a6e0 <_RBTree_Insert_unprotected+0x110> 200a6dc: 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); 200a6e0: 80 a0 60 00 cmp %g1, 0 200a6e4: 02 80 00 09 be 200a708 <_RBTree_Insert_unprotected+0x138> 200a6e8: 84 10 20 00 clr %g2 200a6ec: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a6f0: 80 a0 a0 01 cmp %g2, 1 200a6f4: 32 80 00 05 bne,a 200a708 <_RBTree_Insert_unprotected+0x138> 200a6f8: 84 10 20 00 clr %g2 200a6fc: 10 80 00 03 b 200a708 <_RBTree_Insert_unprotected+0x138> 200a700: 84 10 20 01 mov 1, %g2 200a704: 84 10 20 00 clr %g2 <== NOT EXECUTED while (_RBTree_Is_red(_RBTree_Parent(the_node))) { 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)) { 200a708: 80 a0 a0 00 cmp %g2, 0 200a70c: 22 80 00 08 be,a 200a72c <_RBTree_Insert_unprotected+0x15c> 200a710: c2 07 60 04 ld [ %i5 + 4 ], %g1 the_node->parent->color = RBT_BLACK; 200a714: c0 22 20 0c clr [ %o0 + 0xc ] u->color = RBT_BLACK; 200a718: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; 200a71c: b2 10 00 1d mov %i5, %i1 200a720: 82 10 20 01 mov 1, %g1 200a724: 10 80 00 18 b 200a784 <_RBTree_Insert_unprotected+0x1b4> 200a728: c2 27 60 0c st %g1, [ %i5 + 0xc ] 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]; 200a72c: 82 1a 00 01 xor %o0, %g1, %g1 200a730: 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]; 200a734: c2 02 20 04 ld [ %o0 + 4 ], %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; 200a738: 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]; 200a73c: 82 1e 40 01 xor %i1, %g1, %g1 200a740: 80 a0 00 01 cmp %g0, %g1 200a744: 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) { 200a748: 80 a0 40 1c cmp %g1, %i4 200a74c: 22 80 00 08 be,a 200a76c <_RBTree_Insert_unprotected+0x19c> 200a750: c2 06 40 00 ld [ %i1 ], %g1 _RBTree_Rotate(the_node->parent, pdir); 200a754: 7f ff ff 80 call 200a554 <_RBTree_Rotate> 200a758: 92 10 00 1c mov %i4, %o1 the_node = the_node->child[pdir]; 200a75c: 83 2f 20 02 sll %i4, 2, %g1 200a760: b2 06 40 01 add %i1, %g1, %i1 200a764: f2 06 60 04 ld [ %i1 + 4 ], %i1 } the_node->parent->color = RBT_BLACK; 200a768: c2 06 40 00 ld [ %i1 ], %g1 g->color = RBT_RED; 200a76c: 92 10 20 01 mov 1, %o1 /* 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; 200a770: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; 200a774: d2 27 60 0c st %o1, [ %i5 + 0xc ] /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 200a778: 90 10 00 1d mov %i5, %o0 200a77c: 7f ff ff 76 call 200a554 <_RBTree_Rotate> 200a780: 92 22 40 1c sub %o1, %i4, %o1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200a784: d0 06 40 00 ld [ %i1 ], %o0 200a788: fa 02 00 00 ld [ %o0 ], %i5 200a78c: 80 a7 60 00 cmp %i5, 0 200a790: 22 80 00 06 be,a 200a7a8 <_RBTree_Insert_unprotected+0x1d8> 200a794: 82 10 20 00 clr %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200a798: c2 02 20 0c ld [ %o0 + 0xc ], %g1 200a79c: 82 18 60 01 xor %g1, 1, %g1 200a7a0: 80 a0 00 01 cmp %g0, %g1 200a7a4: 82 60 3f ff subx %g0, -1, %g1 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))) { 200a7a8: 80 a0 60 00 cmp %g1, 0 200a7ac: 12 bf ff c3 bne 200a6b8 <_RBTree_Insert_unprotected+0xe8> 200a7b0: 80 a7 60 00 cmp %i5, 0 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200a7b4: 12 80 00 06 bne 200a7cc <_RBTree_Insert_unprotected+0x1fc> 200a7b8: 01 00 00 00 nop 200a7bc: c0 26 60 0c clr [ %i1 + 0xc ] 200a7c0: 81 c7 e0 08 ret 200a7c4: 81 e8 00 00 restore RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { if(!the_node) return (RBTree_Node*)-1; 200a7c8: b0 10 3f ff mov -1, %i0 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200a7cc: 81 c7 e0 08 ret 200a7d0: 81 e8 00 00 restore =============================================================================== 0200a804 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200a804: 9d e3 bf a0 save %sp, -96, %sp RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; 200a808: b8 10 20 00 clr %i4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a80c: 80 a0 00 19 cmp %g0, %i1 200a810: 82 60 3f ff subx %g0, -1, %g1 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200a814: 82 00 60 02 add %g1, 2, %g1 200a818: 83 28 60 02 sll %g1, 2, %g1 while ( !stop && current != NULL ) { 200a81c: 10 80 00 0a b 200a844 <_RBTree_Iterate_unprotected+0x40> 200a820: fa 06 00 01 ld [ %i0 + %g1 ], %i5 stop = (*visitor)( current, dir, visitor_arg ); 200a824: 92 10 00 19 mov %i1, %o1 200a828: 9f c6 80 00 call %i2 200a82c: 94 10 00 1b mov %i3, %o2 current = _RBTree_Next_unprotected( current, dir ); 200a830: 92 10 00 19 mov %i1, %o1 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { stop = (*visitor)( current, dir, visitor_arg ); 200a834: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 200a838: 40 00 00 0b call 200a864 <_RBTree_Next_unprotected> 200a83c: 90 10 00 1d mov %i5, %o0 200a840: ba 10 00 08 mov %o0, %i5 { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 200a844: 80 a7 60 00 cmp %i5, 0 200a848: 02 80 00 05 be 200a85c <_RBTree_Iterate_unprotected+0x58> 200a84c: b8 1f 20 01 xor %i4, 1, %i4 200a850: 80 8f 20 ff btst 0xff, %i4 200a854: 12 bf ff f4 bne 200a824 <_RBTree_Iterate_unprotected+0x20><== ALWAYS TAKEN 200a858: 90 10 00 1d mov %i5, %o0 200a85c: 81 c7 e0 08 ret 200a860: 81 e8 00 00 restore =============================================================================== 0200a16c <_RBTree_Rotate>: RBTree_Node *the_node, RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; 200a16c: 80 a2 20 00 cmp %o0, 0 200a170: 02 80 00 1c be 200a1e0 <_RBTree_Rotate+0x74> <== NEVER TAKEN 200a174: 80 a0 00 09 cmp %g0, %o1 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a178: 86 60 3f ff subx %g0, -1, %g3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a17c: 87 28 e0 02 sll %g3, 2, %g3 200a180: 86 02 00 03 add %o0, %g3, %g3 200a184: c2 00 e0 04 ld [ %g3 + 4 ], %g1 200a188: 80 a0 60 00 cmp %g1, 0 200a18c: 02 80 00 15 be 200a1e0 <_RBTree_Rotate+0x74> <== NEVER TAKEN 200a190: 93 2a 60 02 sll %o1, 2, %o1 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a194: 84 00 40 09 add %g1, %o1, %g2 200a198: c8 00 a0 04 ld [ %g2 + 4 ], %g4 200a19c: c8 20 e0 04 st %g4, [ %g3 + 4 ] if (c->child[dir]) 200a1a0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a1a4: 80 a0 a0 00 cmp %g2, 0 200a1a8: 32 80 00 02 bne,a 200a1b0 <_RBTree_Rotate+0x44> 200a1ac: 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; 200a1b0: c4 02 00 00 ld [ %o0 ], %g2 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200a1b4: 92 00 40 09 add %g1, %o1, %o1 200a1b8: d0 22 60 04 st %o0, [ %o1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a1bc: c6 00 a0 04 ld [ %g2 + 4 ], %g3 c->parent = the_node->parent; 200a1c0: 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; 200a1c4: 86 1a 00 03 xor %o0, %g3, %g3 c->parent = the_node->parent; the_node->parent = c; 200a1c8: 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; 200a1cc: 80 a0 00 03 cmp %g0, %g3 200a1d0: 86 40 20 00 addx %g0, 0, %g3 200a1d4: 87 28 e0 02 sll %g3, 2, %g3 200a1d8: 86 00 80 03 add %g2, %g3, %g3 200a1dc: c2 20 e0 04 st %g1, [ %g3 + 4 ] 200a1e0: 81 c3 e0 08 retl =============================================================================== 0200a11c <_RBTree_Sibling>: */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; 200a11c: 80 a2 20 00 cmp %o0, 0 200a120: 02 80 00 10 be 200a160 <_RBTree_Sibling+0x44> <== NEVER TAKEN 200a124: 82 10 20 00 clr %g1 if(!(the_node->parent)) return NULL; 200a128: c4 02 00 00 ld [ %o0 ], %g2 200a12c: 80 a0 a0 00 cmp %g2, 0 200a130: 22 80 00 0d be,a 200a164 <_RBTree_Sibling+0x48> <== NEVER TAKEN 200a134: 90 10 00 01 mov %g1, %o0 <== NOT EXECUTED if(!(the_node->parent->parent)) return NULL; 200a138: c2 00 80 00 ld [ %g2 ], %g1 200a13c: 80 a0 60 00 cmp %g1, 0 200a140: 02 80 00 08 be 200a160 <_RBTree_Sibling+0x44> 200a144: 82 10 20 00 clr %g1 if(the_node == the_node->parent->child[RBT_LEFT]) 200a148: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200a14c: 80 a2 00 01 cmp %o0, %g1 200a150: 22 80 00 04 be,a 200a160 <_RBTree_Sibling+0x44> 200a154: c2 00 a0 08 ld [ %g2 + 8 ], %g1 return the_node->parent->child[RBT_RIGHT]; 200a158: 81 c3 e0 08 retl 200a15c: 90 10 00 01 mov %g1, %o0 else return the_node->parent->child[RBT_LEFT]; } 200a160: 90 10 00 01 mov %g1, %o0 200a164: 81 c3 e0 08 retl =============================================================================== 0203f044 <_Rate_monotonic_Get_status>: bool _Rate_monotonic_Get_status( Rate_monotonic_Control *the_period, Rate_monotonic_Period_time_t *wall_since_last_period, Thread_CPU_usage_t *cpu_since_last_period ) { 203f044: 9d e3 bf 98 save %sp, -104, %sp #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 203f048: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 203f04c: 7f ff b0 d9 call 202b3b0 <_TOD_Get_uptime> 203f050: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 203f054: c4 1e 20 50 ldd [ %i0 + 0x50 ], %g2 _Timestamp_Subtract( 203f058: d8 1f bf f8 ldd [ %fp + -8 ], %o4 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 203f05c: 82 10 20 01 mov 1, %g1 203f060: 86 a3 40 03 subcc %o5, %g3, %g3 203f064: 84 63 00 02 subx %o4, %g2, %g2 203f068: c4 3e 40 00 std %g2, [ %i1 ] * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 203f06c: 05 00 81 bf sethi %hi(0x206fc00), %g2 203f070: 84 10 a0 b0 or %g2, 0xb0, %g2 ! 206fcb0 <_Per_CPU_Information> 203f074: c6 00 a0 0c ld [ %g2 + 0xc ], %g3 203f078: 80 a6 c0 03 cmp %i3, %g3 203f07c: 12 80 00 15 bne 203f0d0 <_Rate_monotonic_Get_status+0x8c> 203f080: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 203f084: c4 18 a0 20 ldd [ %g2 + 0x20 ], %g2 203f088: 9a a3 40 03 subcc %o5, %g3, %o5 203f08c: 98 63 00 02 subx %o4, %g2, %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 203f090: c4 1e 20 48 ldd [ %i0 + 0x48 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 203f094: ba 87 40 0d addcc %i5, %o5, %i5 203f098: b8 47 00 0c addx %i4, %o4, %i4 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 203f09c: 80 a0 80 1c cmp %g2, %i4 203f0a0: 34 80 00 0c bg,a 203f0d0 <_Rate_monotonic_Get_status+0x8c><== NEVER TAKEN 203f0a4: 82 10 20 00 clr %g1 <== NOT EXECUTED 203f0a8: 32 80 00 06 bne,a 203f0c0 <_Rate_monotonic_Get_status+0x7c> 203f0ac: 86 a7 40 03 subcc %i5, %g3, %g3 203f0b0: 80 a0 c0 1d cmp %g3, %i5 203f0b4: 18 80 00 06 bgu 203f0cc <_Rate_monotonic_Get_status+0x88> 203f0b8: 86 a7 40 03 subcc %i5, %g3, %g3 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 203f0bc: 82 10 20 01 mov 1, %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 203f0c0: 84 67 00 02 subx %i4, %g2, %g2 203f0c4: 10 80 00 03 b 203f0d0 <_Rate_monotonic_Get_status+0x8c> 203f0c8: c4 3e 80 00 std %g2, [ %i2 ] /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) return false; 203f0cc: 82 10 20 00 clr %g1 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 203f0d0: b0 08 60 01 and %g1, 1, %i0 203f0d4: 81 c7 e0 08 ret 203f0d8: 81 e8 00 00 restore =============================================================================== 0203f43c <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 203f43c: 9d e3 bf 98 save %sp, -104, %sp 203f440: 11 00 81 c0 sethi %hi(0x2070000), %o0 203f444: 92 10 00 18 mov %i0, %o1 203f448: 90 12 23 20 or %o0, 0x320, %o0 203f44c: 7f ff 3f 84 call 200f25c <_Objects_Get> 203f450: 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 ) { 203f454: c2 07 bf fc ld [ %fp + -4 ], %g1 203f458: 80 a0 60 00 cmp %g1, 0 203f45c: 12 80 00 25 bne 203f4f0 <_Rate_monotonic_Timeout+0xb4> <== NEVER TAKEN 203f460: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 203f464: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 203f468: 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); 203f46c: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 203f470: 80 88 80 01 btst %g2, %g1 203f474: 22 80 00 0b be,a 203f4a0 <_Rate_monotonic_Timeout+0x64> 203f478: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 203f47c: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 203f480: c2 07 60 08 ld [ %i5 + 8 ], %g1 203f484: 80 a0 80 01 cmp %g2, %g1 203f488: 32 80 00 06 bne,a 203f4a0 <_Rate_monotonic_Timeout+0x64> 203f48c: 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 ); 203f490: 13 04 00 ff sethi %hi(0x1003fc00), %o1 203f494: 7f ff 42 4a call 200fdbc <_Thread_Clear_state> 203f498: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 203f49c: 30 80 00 06 b,a 203f4b4 <_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 ) { 203f4a0: 80 a0 60 01 cmp %g1, 1 203f4a4: 12 80 00 0d bne 203f4d8 <_Rate_monotonic_Timeout+0x9c> 203f4a8: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 203f4ac: 82 10 20 03 mov 3, %g1 203f4b0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 203f4b4: 7f ff ff 53 call 203f200 <_Rate_monotonic_Initiate_statistics> 203f4b8: 90 10 00 1d mov %i5, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203f4bc: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203f4c0: 11 00 81 be sethi %hi(0x206f800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203f4c4: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203f4c8: 90 12 20 28 or %o0, 0x28, %o0 203f4cc: 7f ff 46 67 call 2010e68 <_Watchdog_Insert> 203f4d0: 92 07 60 10 add %i5, 0x10, %o1 203f4d4: 30 80 00 02 b,a 203f4dc <_Rate_monotonic_Timeout+0xa0> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 203f4d8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 203f4dc: 03 00 81 bd sethi %hi(0x206f400), %g1 203f4e0: c4 00 63 80 ld [ %g1 + 0x380 ], %g2 ! 206f780 <_Thread_Dispatch_disable_level> 203f4e4: 84 00 bf ff add %g2, -1, %g2 203f4e8: c4 20 63 80 st %g2, [ %g1 + 0x380 ] return _Thread_Dispatch_disable_level; 203f4ec: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 203f4f0: 81 c7 e0 08 ret 203f4f4: 81 e8 00 00 restore =============================================================================== 0203f0dc <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 203f0dc: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 203f0e0: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 203f0e4: 82 00 60 01 inc %g1 203f0e8: c2 26 20 58 st %g1, [ %i0 + 0x58 ] if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 203f0ec: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 203f0f0: 80 a0 60 04 cmp %g1, 4 203f0f4: 12 80 00 05 bne 203f108 <_Rate_monotonic_Update_statistics+0x2c> 203f0f8: 90 10 00 18 mov %i0, %o0 stats->missed_count++; 203f0fc: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 203f100: 82 00 60 01 inc %g1 203f104: c2 26 20 5c st %g1, [ %i0 + 0x5c ] /* * Grab status for time statistics. */ valid_status = 203f108: 92 07 bf f8 add %fp, -8, %o1 203f10c: 7f ff ff ce call 203f044 <_Rate_monotonic_Get_status> 203f110: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 203f114: 80 8a 20 ff btst 0xff, %o0 203f118: 02 80 00 38 be 203f1f8 <_Rate_monotonic_Update_statistics+0x11c> 203f11c: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 203f120: f8 1e 20 70 ldd [ %i0 + 0x70 ], %i4 * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 203f124: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 203f128: ba 87 40 03 addcc %i5, %g3, %i5 203f12c: b8 47 00 02 addx %i4, %g2, %i4 203f130: 80 a0 40 02 cmp %g1, %g2 203f134: 14 80 00 09 bg 203f158 <_Rate_monotonic_Update_statistics+0x7c> 203f138: f8 3e 20 70 std %i4, [ %i0 + 0x70 ] 203f13c: 80 a0 40 02 cmp %g1, %g2 203f140: 32 80 00 08 bne,a 203f160 <_Rate_monotonic_Update_statistics+0x84><== NEVER TAKEN 203f144: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 203f148: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 203f14c: 80 a0 40 03 cmp %g1, %g3 203f150: 28 80 00 04 bleu,a 203f160 <_Rate_monotonic_Update_statistics+0x84> 203f154: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 203f158: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 203f15c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 203f160: 80 a0 40 02 cmp %g1, %g2 203f164: 26 80 00 0a bl,a 203f18c <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 203f168: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 203f16c: 80 a0 40 02 cmp %g1, %g2 203f170: 32 80 00 08 bne,a 203f190 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 203f174: c4 1f bf f8 ldd [ %fp + -8 ], %g2 <== NOT EXECUTED 203f178: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 203f17c: 80 a0 40 03 cmp %g1, %g3 203f180: 3a 80 00 04 bcc,a 203f190 <_Rate_monotonic_Update_statistics+0xb4> 203f184: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 203f188: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] /* * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); 203f18c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 203f190: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 203f194: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 203f198: ba 87 40 03 addcc %i5, %g3, %i5 203f19c: b8 47 00 02 addx %i4, %g2, %i4 203f1a0: 80 a0 40 02 cmp %g1, %g2 203f1a4: 14 80 00 09 bg 203f1c8 <_Rate_monotonic_Update_statistics+0xec> 203f1a8: f8 3e 20 88 std %i4, [ %i0 + 0x88 ] 203f1ac: 80 a0 40 02 cmp %g1, %g2 203f1b0: 32 80 00 08 bne,a 203f1d0 <_Rate_monotonic_Update_statistics+0xf4><== NEVER TAKEN 203f1b4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 203f1b8: c2 06 20 7c ld [ %i0 + 0x7c ], %g1 203f1bc: 80 a0 40 03 cmp %g1, %g3 203f1c0: 28 80 00 04 bleu,a 203f1d0 <_Rate_monotonic_Update_statistics+0xf4> 203f1c4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 stats->min_wall_time = since_last_period; 203f1c8: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 203f1cc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 203f1d0: 80 a0 40 02 cmp %g1, %g2 203f1d4: 26 80 00 09 bl,a 203f1f8 <_Rate_monotonic_Update_statistics+0x11c><== NEVER TAKEN 203f1d8: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 203f1dc: 80 a0 40 02 cmp %g1, %g2 203f1e0: 12 80 00 06 bne 203f1f8 <_Rate_monotonic_Update_statistics+0x11c><== NEVER TAKEN 203f1e4: 01 00 00 00 nop 203f1e8: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 203f1ec: 80 a0 40 03 cmp %g1, %g3 203f1f0: 2a 80 00 02 bcs,a 203f1f8 <_Rate_monotonic_Update_statistics+0x11c> 203f1f4: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 203f1f8: 81 c7 e0 08 ret 203f1fc: 81 e8 00 00 restore =============================================================================== 0200a19c <_Scheduler_CBS_Allocate>: #include void *_Scheduler_CBS_Allocate( Thread_Control *the_thread ) { 200a19c: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_CBS_Per_thread *schinfo; sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread)); 200a1a0: 40 00 06 ac call 200bc50 <_Workspace_Allocate> 200a1a4: 90 10 20 1c mov 0x1c, %o0 if ( sched ) { 200a1a8: 80 a2 20 00 cmp %o0, 0 200a1ac: 02 80 00 06 be 200a1c4 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN 200a1b0: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a1b4: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info); schinfo->edf_per_thread.thread = the_thread; 200a1b8: f0 22 00 00 st %i0, [ %o0 ] schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a1bc: c2 22 20 14 st %g1, [ %o0 + 0x14 ] schinfo->cbs_server = NULL; 200a1c0: c0 22 20 18 clr [ %o0 + 0x18 ] } return sched; } 200a1c4: 81 c7 e0 08 ret 200a1c8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b518 <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200b518: 9d e3 bf 98 save %sp, -104, %sp Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server_id server_id; /* Put violating task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200b51c: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200b520: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b524: 80 a0 40 09 cmp %g1, %o1 200b528: 32 80 00 02 bne,a 200b530 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200b52c: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200b530: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200b534: 80 a0 40 09 cmp %g1, %o1 200b538: 02 80 00 04 be 200b548 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200b53c: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200b540: 40 00 01 83 call 200bb4c <_Thread_Change_priority> 200b544: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200b548: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200b54c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b550: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200b554: 80 a0 a0 00 cmp %g2, 0 200b558: 02 80 00 09 be 200b57c <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200b55c: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200b560: d0 00 40 00 ld [ %g1 ], %o0 200b564: 7f ff ff d7 call 200b4c0 <_Scheduler_CBS_Get_server_id> 200b568: 92 07 bf fc add %fp, -4, %o1 sched_info->cbs_server->task_id, &server_id ); sched_info->cbs_server->cbs_budget_overrun( server_id ); 200b56c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b570: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200b574: 9f c0 40 00 call %g1 200b578: d0 07 bf fc ld [ %fp + -4 ], %o0 200b57c: 81 c7 e0 08 ret 200b580: 81 e8 00 00 restore =============================================================================== 0200b120 <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b120: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b124: c2 06 20 04 ld [ %i0 + 4 ], %g1 200b128: 80 a0 60 00 cmp %g1, 0 200b12c: 04 80 00 1d ble 200b1a0 <_Scheduler_CBS_Create_server+0x80> 200b130: 01 00 00 00 nop 200b134: c2 06 00 00 ld [ %i0 ], %g1 200b138: 80 a0 60 00 cmp %g1, 0 200b13c: 04 80 00 19 ble 200b1a0 <_Scheduler_CBS_Create_server+0x80> 200b140: 03 00 80 81 sethi %hi(0x2020400), %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b144: c4 00 60 bc ld [ %g1 + 0xbc ], %g2 ! 20204bc <_Scheduler_CBS_Maximum_servers> if ( !_Scheduler_CBS_Server_list[i] ) 200b148: 03 00 80 85 sethi %hi(0x2021400), %g1 200b14c: c6 00 63 88 ld [ %g1 + 0x388 ], %g3 ! 2021788 <_Scheduler_CBS_Server_list> 200b150: 10 80 00 07 b 200b16c <_Scheduler_CBS_Create_server+0x4c> 200b154: 82 10 20 00 clr %g1 200b158: c8 00 c0 1c ld [ %g3 + %i4 ], %g4 200b15c: 80 a1 20 00 cmp %g4, 0 200b160: 02 80 00 14 be 200b1b0 <_Scheduler_CBS_Create_server+0x90> 200b164: 3b 00 80 85 sethi %hi(0x2021400), %i5 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b168: 82 00 60 01 inc %g1 200b16c: 80 a0 40 02 cmp %g1, %g2 200b170: 12 bf ff fa bne 200b158 <_Scheduler_CBS_Create_server+0x38> 200b174: b9 28 60 02 sll %g1, 2, %i4 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 200b178: 81 c7 e0 08 ret 200b17c: 91 e8 3f e6 restore %g0, -26, %o0 _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b180: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b184: c4 06 20 04 ld [ %i0 + 4 ], %g2 the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b188: f2 20 60 0c st %i1, [ %g1 + 0xc ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b18c: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; 200b190: 84 10 3f ff mov -1, %g2 200b194: c4 20 40 00 st %g2, [ %g1 ] the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; 200b198: 81 c7 e0 08 ret 200b19c: 91 e8 20 00 restore %g0, 0, %o0 if ( params->budget <= 0 || params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 200b1a0: 81 c7 e0 08 ret 200b1a4: 91 e8 3f ee restore %g0, -18, %o0 *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 200b1a8: 81 c7 e0 08 ret <== NOT EXECUTED 200b1ac: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 200b1b0: f6 07 63 88 ld [ %i5 + 0x388 ], %i3 } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; 200b1b4: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b1b8: 40 00 07 9e call 200d030 <_Workspace_Allocate> 200b1bc: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b1c0: c2 06 80 00 ld [ %i2 ], %g1 if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 200b1c4: d0 26 c0 1c st %o0, [ %i3 + %i4 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b1c8: c4 07 63 88 ld [ %i5 + 0x388 ], %g2 200b1cc: 83 28 60 02 sll %g1, 2, %g1 200b1d0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b1d4: 80 a0 60 00 cmp %g1, 0 200b1d8: 32 bf ff ea bne,a 200b180 <_Scheduler_CBS_Create_server+0x60><== ALWAYS TAKEN 200b1dc: c4 06 00 00 ld [ %i0 ], %g2 200b1e0: 30 bf ff f2 b,a 200b1a8 <_Scheduler_CBS_Create_server+0x88><== NOT EXECUTED =============================================================================== 0200b258 <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b258: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Thread_Control *the_thread; Scheduler_CBS_Per_thread *sched_info; the_thread = _Thread_Get(task_id, &location); 200b25c: 90 10 00 19 mov %i1, %o0 200b260: 40 00 03 6d call 200c014 <_Thread_Get> 200b264: 92 07 bf fc add %fp, -4, %o1 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b268: ba 92 20 00 orcc %o0, 0, %i5 200b26c: 02 80 00 05 be 200b280 <_Scheduler_CBS_Detach_thread+0x28> 200b270: 03 00 80 81 sethi %hi(0x2020400), %g1 _Thread_Enable_dispatch(); 200b274: 40 00 03 5b call 200bfe0 <_Thread_Enable_dispatch> 200b278: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b27c: 03 00 80 81 sethi %hi(0x2020400), %g1 200b280: c2 00 60 bc ld [ %g1 + 0xbc ], %g1 ! 20204bc <_Scheduler_CBS_Maximum_servers> 200b284: 80 a6 00 01 cmp %i0, %g1 200b288: 1a 80 00 1b bcc 200b2f4 <_Scheduler_CBS_Detach_thread+0x9c> 200b28c: 80 a7 60 00 cmp %i5, 0 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) 200b290: 02 80 00 19 be 200b2f4 <_Scheduler_CBS_Detach_thread+0x9c> 200b294: 03 00 80 85 sethi %hi(0x2021400), %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 200b298: c2 00 63 88 ld [ %g1 + 0x388 ], %g1 ! 2021788 <_Scheduler_CBS_Server_list> 200b29c: b1 2e 20 02 sll %i0, 2, %i0 200b2a0: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200b2a4: 80 a0 60 00 cmp %g1, 0 200b2a8: 02 80 00 11 be 200b2ec <_Scheduler_CBS_Detach_thread+0x94> 200b2ac: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 200b2b0: c4 00 40 00 ld [ %g1 ], %g2 200b2b4: 80 a0 80 19 cmp %g2, %i1 200b2b8: 12 80 00 0f bne 200b2f4 <_Scheduler_CBS_Detach_thread+0x9c><== NEVER TAKEN 200b2bc: 84 10 3f ff mov -1, %g2 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 200b2c0: c4 20 40 00 st %g2, [ %g1 ] sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200b2c4: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 200b2c8: c0 20 60 18 clr [ %g1 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b2cc: c2 07 60 a0 ld [ %i5 + 0xa0 ], %g1 200b2d0: c2 27 60 78 st %g1, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b2d4: c2 07 60 a4 ld [ %i5 + 0xa4 ], %g1 200b2d8: c2 27 60 7c st %g1, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b2dc: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 200b2e0: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 200b2e4: 81 c7 e0 08 ret 200b2e8: 91 e8 20 00 restore %g0, 0, %o0 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) return SCHEDULER_CBS_ERROR_NOSERVER; 200b2ec: 81 c7 e0 08 ret 200b2f0: 91 e8 3f e7 restore %g0, -25, %o0 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; } 200b2f4: 81 c7 e0 08 ret 200b2f8: 91 e8 3f ee restore %g0, -18, %o0 =============================================================================== 0200b584 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200b584: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); 200b588: 3b 00 80 81 sethi %hi(0x2020400), %i5 200b58c: d0 07 60 bc ld [ %i5 + 0xbc ], %o0 ! 20204bc <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200b590: 40 00 06 a8 call 200d030 <_Workspace_Allocate> 200b594: 91 2a 20 02 sll %o0, 2, %o0 200b598: 05 00 80 85 sethi %hi(0x2021400), %g2 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200b59c: 80 a2 20 00 cmp %o0, 0 200b5a0: 02 80 00 0d be 200b5d4 <_Scheduler_CBS_Initialize+0x50> <== NEVER TAKEN 200b5a4: d0 20 a3 88 st %o0, [ %g2 + 0x388 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b5a8: c6 07 60 bc ld [ %i5 + 0xbc ], %g3 200b5ac: 10 80 00 05 b 200b5c0 <_Scheduler_CBS_Initialize+0x3c> 200b5b0: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; 200b5b4: 89 28 60 02 sll %g1, 2, %g4 unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b5b8: 82 00 60 01 inc %g1 _Scheduler_CBS_Server_list[i] = NULL; 200b5bc: c0 27 40 04 clr [ %i5 + %g4 ] unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b5c0: 80 a0 40 03 cmp %g1, %g3 200b5c4: 12 bf ff fc bne 200b5b4 <_Scheduler_CBS_Initialize+0x30> 200b5c8: fa 00 a3 88 ld [ %g2 + 0x388 ], %i5 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200b5cc: 81 c7 e0 08 ret 200b5d0: 91 e8 20 00 restore %g0, 0, %o0 } 200b5d4: 81 c7 e0 08 ret <== NOT EXECUTED 200b5d8: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 0200a1cc <_Scheduler_CBS_Release_job>: { Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; Scheduler_CBS_Server *serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a1cc: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a1d0: 80 a2 60 00 cmp %o1, 0 200a1d4: 02 80 00 10 be 200a214 <_Scheduler_CBS_Release_job+0x48> 200a1d8: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a1dc: 80 a0 60 00 cmp %g1, 0 200a1e0: 02 80 00 08 be 200a200 <_Scheduler_CBS_Release_job+0x34> 200a1e4: 05 00 80 7d sethi %hi(0x201f400), %g2 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a1e8: d2 00 a3 e8 ld [ %g2 + 0x3e8 ], %o1 ! 201f7e8 <_Watchdog_Ticks_since_boot> 200a1ec: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a1f0: 92 02 40 02 add %o1, %g2, %o1 200a1f4: 05 20 00 00 sethi %hi(0x80000000), %g2 200a1f8: 10 80 00 0a b 200a220 <_Scheduler_CBS_Release_job+0x54> 200a1fc: 92 2a 40 02 andn %o1, %g2, %o1 & ~SCHEDULER_EDF_PRIO_MSB; else new_priority = (_Watchdog_Ticks_since_boot + deadline) 200a200: c2 00 a3 e8 ld [ %g2 + 0x3e8 ], %g1 200a204: 92 02 40 01 add %o1, %g1, %o1 200a208: 03 20 00 00 sethi %hi(0x80000000), %g1 200a20c: 10 80 00 07 b 200a228 <_Scheduler_CBS_Release_job+0x5c> 200a210: 92 2a 40 01 andn %o1, %g1, %o1 /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) 200a214: 80 a0 60 00 cmp %g1, 0 200a218: 02 80 00 04 be 200a228 <_Scheduler_CBS_Release_job+0x5c> <== NEVER TAKEN 200a21c: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; 200a220: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a224: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a228: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a22c: 94 10 20 01 mov 1, %o2 200a230: 82 13 c0 00 mov %o7, %g1 200a234: 40 00 01 26 call 200a6cc <_Thread_Change_priority> 200a238: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200a23c <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a23c: 9d e3 bf a0 save %sp, -96, %sp Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server *serv_info; Priority_Control new_priority; _Scheduler_EDF_Enqueue(the_thread); 200a240: 40 00 00 4c call 200a370 <_Scheduler_EDF_Enqueue> 200a244: 90 10 00 18 mov %i0, %o0 /* TODO: flash critical section? */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a248: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a24c: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 * Late unblock rule for deadline-driven tasks. The remaining time to * deadline must be sufficient to serve the remaining computation time * without increased utilization of this task. It might cause a deadline * miss of another task. */ if (serv_info) { 200a250: 80 a7 60 00 cmp %i5, 0 200a254: 02 80 00 18 be 200a2b4 <_Scheduler_CBS_Unblock+0x78> 200a258: 03 00 80 7d sethi %hi(0x201f400), %g1 time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a25c: d2 07 60 04 ld [ %i5 + 4 ], %o1 */ if (serv_info) { time_t deadline = serv_info->parameters.deadline; time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - 200a260: d0 00 63 e8 ld [ %g1 + 0x3e8 ], %o0 200a264: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a268: 40 00 3f bd call 201a15c <.umul> 200a26c: 90 27 00 08 sub %i4, %o0, %o0 200a270: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a274: b6 10 00 08 mov %o0, %i3 200a278: 40 00 3f b9 call 201a15c <.umul> 200a27c: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a280: 80 a6 c0 08 cmp %i3, %o0 200a284: 24 80 00 0d ble,a 200a2b8 <_Scheduler_CBS_Unblock+0x7c> 200a288: 3b 00 80 7f sethi %hi(0x201fc00), %i5 /* Put late unblocked task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200a28c: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a290: 80 a7 00 09 cmp %i4, %o1 200a294: 32 80 00 02 bne,a 200a29c <_Scheduler_CBS_Unblock+0x60> 200a298: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a29c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a2a0: 80 a0 40 09 cmp %g1, %o1 200a2a4: 02 80 00 04 be 200a2b4 <_Scheduler_CBS_Unblock+0x78> 200a2a8: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200a2ac: 40 00 01 08 call 200a6cc <_Thread_Change_priority> 200a2b0: 94 10 20 01 mov 1, %o2 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, 200a2b4: 3b 00 80 7f sethi %hi(0x201fc00), %i5 200a2b8: ba 17 60 20 or %i5, 0x20, %i5 ! 201fc20 <_Per_CPU_Information> 200a2bc: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 200a2c0: 03 00 80 7a sethi %hi(0x201e800), %g1 200a2c4: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a2c8: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1 200a2cc: 9f c0 40 00 call %g1 200a2d0: d2 00 a0 14 ld [ %g2 + 0x14 ], %o1 200a2d4: 80 a2 20 00 cmp %o0, 0 200a2d8: 04 80 00 0f ble 200a314 <_Scheduler_CBS_Unblock+0xd8> 200a2dc: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a2e0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; 200a2e4: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a2e8: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a2ec: 80 a0 60 00 cmp %g1, 0 200a2f0: 12 80 00 06 bne 200a308 <_Scheduler_CBS_Unblock+0xcc> 200a2f4: 84 10 20 01 mov 1, %g2 200a2f8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a2fc: 80 a0 60 00 cmp %g1, 0 200a300: 12 80 00 05 bne 200a314 <_Scheduler_CBS_Unblock+0xd8> <== ALWAYS TAKEN 200a304: 01 00 00 00 nop the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a308: 03 00 80 7f sethi %hi(0x201fc00), %g1 200a30c: 82 10 60 20 or %g1, 0x20, %g1 ! 201fc20 <_Per_CPU_Information> 200a310: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 200a314: 81 c7 e0 08 ret 200a318: 81 e8 00 00 restore =============================================================================== 0200a19c <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a19c: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a1a0: 40 00 06 81 call 200bba4 <_Workspace_Allocate> 200a1a4: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a1a8: 80 a2 20 00 cmp %o0, 0 200a1ac: 02 80 00 05 be 200a1c0 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a1b0: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a1b4: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a1b8: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a1bc: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a1c0: 81 c7 e0 08 ret 200a1c4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a364 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a364: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a368: 7f ff ff ad call 200a21c <_Scheduler_EDF_Enqueue> 200a36c: 90 10 00 18 mov %i0, %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( 200a370: 3b 00 80 7e sethi %hi(0x201f800), %i5 200a374: ba 17 63 70 or %i5, 0x370, %i5 ! 201fb70 <_Per_CPU_Information> 200a378: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 200a37c: 03 00 80 7a sethi %hi(0x201e800), %g1 200a380: d0 00 a0 14 ld [ %g2 + 0x14 ], %o0 200a384: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 200a388: 9f c0 40 00 call %g1 200a38c: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200a390: 80 a2 20 00 cmp %o0, 0 200a394: 16 80 00 0f bge 200a3d0 <_Scheduler_EDF_Unblock+0x6c> 200a398: 01 00 00 00 nop _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a39c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200a3a0: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a3a4: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a3a8: 80 a0 60 00 cmp %g1, 0 200a3ac: 12 80 00 06 bne 200a3c4 <_Scheduler_EDF_Unblock+0x60> 200a3b0: 84 10 20 01 mov 1, %g2 200a3b4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a3b8: 80 a0 60 00 cmp %g1, 0 200a3bc: 12 80 00 05 bne 200a3d0 <_Scheduler_EDF_Unblock+0x6c> <== ALWAYS TAKEN 200a3c0: 01 00 00 00 nop the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a3c4: 03 00 80 7e sethi %hi(0x201f800), %g1 200a3c8: 82 10 63 70 or %g1, 0x370, %g1 ! 201fb70 <_Per_CPU_Information> 200a3cc: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 200a3d0: 81 c7 e0 08 ret 200a3d4: 81 e8 00 00 restore =============================================================================== 02009a58 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 2009a58: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing; executing = _Thread_Executing; 2009a5c: 03 00 80 78 sethi %hi(0x201e000), %g1 2009a60: fa 00 60 1c ld [ %g1 + 0x1c ], %i5 ! 201e01c <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009a64: c2 0f 60 70 ldub [ %i5 + 0x70 ], %g1 2009a68: 80 a0 60 00 cmp %g1, 0 2009a6c: 02 80 00 25 be 2009b00 <_Scheduler_priority_Tick+0xa8> 2009a70: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009a74: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2009a78: 80 a0 60 00 cmp %g1, 0 2009a7c: 12 80 00 21 bne 2009b00 <_Scheduler_priority_Tick+0xa8> 2009a80: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009a84: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 2009a88: 80 a0 60 01 cmp %g1, 1 2009a8c: 0a 80 00 14 bcs 2009adc <_Scheduler_priority_Tick+0x84> 2009a90: 80 a0 60 02 cmp %g1, 2 2009a94: 28 80 00 07 bleu,a 2009ab0 <_Scheduler_priority_Tick+0x58> 2009a98: c2 07 60 74 ld [ %i5 + 0x74 ], %g1 2009a9c: 80 a0 60 03 cmp %g1, 3 2009aa0: 12 80 00 18 bne 2009b00 <_Scheduler_priority_Tick+0xa8> <== NEVER TAKEN 2009aa4: 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 ) 2009aa8: 10 80 00 0f b 2009ae4 <_Scheduler_priority_Tick+0x8c> 2009aac: c2 07 60 74 ld [ %i5 + 0x74 ], %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 ) { 2009ab0: 82 00 7f ff add %g1, -1, %g1 2009ab4: 80 a0 60 00 cmp %g1, 0 2009ab8: 14 80 00 09 bg 2009adc <_Scheduler_priority_Tick+0x84> 2009abc: c2 27 60 74 st %g1, [ %i5 + 0x74 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 2009ac0: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009ac4: c2 00 61 ec ld [ %g1 + 0x1ec ], %g1 ! 201cdec <_Scheduler+0xc> 2009ac8: 9f c0 40 00 call %g1 2009acc: 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; 2009ad0: 03 00 80 76 sethi %hi(0x201d800), %g1 2009ad4: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 ! 201da40 <_Thread_Ticks_per_timeslice> 2009ad8: c2 27 60 74 st %g1, [ %i5 + 0x74 ] 2009adc: 81 c7 e0 08 ret 2009ae0: 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 ) 2009ae4: 82 00 7f ff add %g1, -1, %g1 2009ae8: 80 a0 60 00 cmp %g1, 0 2009aec: 12 bf ff fc bne 2009adc <_Scheduler_priority_Tick+0x84> 2009af0: c2 27 60 74 st %g1, [ %i5 + 0x74 ] (*executing->budget_callout)( executing ); 2009af4: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 2009af8: 9f c0 40 00 call %g1 2009afc: 90 10 00 1d mov %i5, %o0 2009b00: 81 c7 e0 08 ret 2009b04: 81 e8 00 00 restore =============================================================================== 02008688 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2008688: 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 / 200868c: 03 00 80 7d sethi %hi(0x201f400), %g1 2008690: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 ! 201f41c 2008694: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008698: 40 00 48 97 call 201a8f4 <.udiv> 200869c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20086a0: 80 a6 20 00 cmp %i0, 0 20086a4: 02 80 00 28 be 2008744 <_TOD_Validate+0xbc> <== NEVER TAKEN 20086a8: 84 10 20 00 clr %g2 20086ac: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20086b0: 80 a0 40 08 cmp %g1, %o0 20086b4: 3a 80 00 25 bcc,a 2008748 <_TOD_Validate+0xc0> 20086b8: b0 08 a0 01 and %g2, 1, %i0 (the_tod->ticks >= ticks_per_second) || 20086bc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20086c0: 80 a0 60 3b cmp %g1, 0x3b 20086c4: 38 80 00 21 bgu,a 2008748 <_TOD_Validate+0xc0> 20086c8: b0 08 a0 01 and %g2, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20086cc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20086d0: 80 a0 60 3b cmp %g1, 0x3b 20086d4: 38 80 00 1d bgu,a 2008748 <_TOD_Validate+0xc0> 20086d8: b0 08 a0 01 and %g2, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20086dc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20086e0: 80 a0 60 17 cmp %g1, 0x17 20086e4: 38 80 00 19 bgu,a 2008748 <_TOD_Validate+0xc0> 20086e8: b0 08 a0 01 and %g2, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 20086ec: 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) || 20086f0: 80 a0 60 00 cmp %g1, 0 20086f4: 02 80 00 14 be 2008744 <_TOD_Validate+0xbc> <== NEVER TAKEN 20086f8: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 20086fc: 38 80 00 13 bgu,a 2008748 <_TOD_Validate+0xc0> 2008700: b0 08 a0 01 and %g2, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008704: c8 06 00 00 ld [ %i0 ], %g4 (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) || 2008708: 80 a1 27 c3 cmp %g4, 0x7c3 200870c: 28 80 00 0f bleu,a 2008748 <_TOD_Validate+0xc0> 2008710: b0 08 a0 01 and %g2, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008714: c6 06 20 08 ld [ %i0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008718: 80 a0 e0 00 cmp %g3, 0 200871c: 02 80 00 0a be 2008744 <_TOD_Validate+0xbc> <== NEVER TAKEN 2008720: 80 89 20 03 btst 3, %g4 2008724: 05 00 80 77 sethi %hi(0x201dc00), %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2008728: 12 80 00 03 bne 2008734 <_TOD_Validate+0xac> 200872c: 84 10 a2 58 or %g2, 0x258, %g2 ! 201de58 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2008730: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2008734: 83 28 60 02 sll %g1, 2, %g1 2008738: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( the_tod->day > days_in_month ) 200873c: 80 a0 40 03 cmp %g1, %g3 2008740: 84 60 3f ff subx %g0, -1, %g2 return false; return true; } 2008744: b0 08 a0 01 and %g2, 1, %i0 2008748: 81 c7 e0 08 ret 200874c: 81 e8 00 00 restore =============================================================================== 02009d14 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2009d14: 9d e3 bf a0 save %sp, -96, %sp 2009d18: ba 10 00 18 mov %i0, %i5 States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2009d1c: f0 06 20 10 ld [ %i0 + 0x10 ], %i0 /* * 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 ); 2009d20: 40 00 03 6a call 200aac8 <_Thread_Set_transient> 2009d24: 90 10 00 1d mov %i5, %o0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 2009d28: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2009d2c: 80 a0 40 19 cmp %g1, %i1 2009d30: 02 80 00 04 be 2009d40 <_Thread_Change_priority+0x2c> 2009d34: 90 10 00 1d mov %i5, %o0 _Thread_Set_priority( the_thread, new_priority ); 2009d38: 40 00 03 4b call 200aa64 <_Thread_Set_priority> 2009d3c: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2009d40: 7f ff e2 61 call 20026c4 2009d44: 01 00 00 00 nop 2009d48: b6 10 00 08 mov %o0, %i3 /* * 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; 2009d4c: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 2009d50: 80 a7 20 04 cmp %i4, 4 2009d54: 02 80 00 10 be 2009d94 <_Thread_Change_priority+0x80> 2009d58: 82 0e 20 04 and %i0, 4, %g1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2009d5c: 80 a0 60 00 cmp %g1, 0 2009d60: 12 80 00 03 bne 2009d6c <_Thread_Change_priority+0x58> <== NEVER TAKEN 2009d64: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2009d68: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2009d6c: 7f ff e2 5a call 20026d4 2009d70: 90 10 00 1b mov %i3, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2009d74: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009d78: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2009d7c: 80 8f 00 01 btst %i4, %g1 2009d80: 02 80 00 28 be 2009e20 <_Thread_Change_priority+0x10c> 2009d84: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2009d88: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2009d8c: 40 00 03 08 call 200a9ac <_Thread_queue_Requeue> 2009d90: 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 ) ) { 2009d94: 80 a0 60 00 cmp %g1, 0 2009d98: 12 80 00 0b bne 2009dc4 <_Thread_Change_priority+0xb0> <== NEVER TAKEN 2009d9c: 03 00 80 73 sethi %hi(0x201cc00), %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 ); 2009da0: c0 27 60 10 clr [ %i5 + 0x10 ] if ( prepend_it ) 2009da4: 80 a6 a0 00 cmp %i2, 0 2009da8: 02 80 00 04 be 2009db8 <_Thread_Change_priority+0xa4> 2009dac: 82 10 61 e0 or %g1, 0x1e0, %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2009db0: 10 80 00 03 b 2009dbc <_Thread_Change_priority+0xa8> 2009db4: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2009db8: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2009dbc: 9f c0 40 00 call %g1 2009dc0: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2009dc4: 7f ff e2 44 call 20026d4 2009dc8: 90 10 00 1b mov %i3, %o0 2009dcc: 7f ff e2 3e call 20026c4 2009dd0: 01 00 00 00 nop 2009dd4: b0 10 00 08 mov %o0, %i0 * This kernel routine implements the scheduling decision logic for * the scheduler. It does NOT dispatch. */ RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( void ) { _Scheduler.Operations.schedule(); 2009dd8: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009ddc: c2 00 61 e8 ld [ %g1 + 0x1e8 ], %g1 ! 201cde8 <_Scheduler+0x8> 2009de0: 9f c0 40 00 call %g1 2009de4: 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 ); 2009de8: 03 00 80 78 sethi %hi(0x201e000), %g1 2009dec: 82 10 60 10 or %g1, 0x10, %g1 ! 201e010 <_Per_CPU_Information> 2009df0: 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() && 2009df4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009df8: 80 a0 80 03 cmp %g2, %g3 2009dfc: 02 80 00 07 be 2009e18 <_Thread_Change_priority+0x104> 2009e00: 01 00 00 00 nop 2009e04: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 2009e08: 80 a0 a0 00 cmp %g2, 0 2009e0c: 02 80 00 03 be 2009e18 <_Thread_Change_priority+0x104> 2009e10: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2009e14: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2009e18: 7f ff e2 2f call 20026d4 2009e1c: 81 e8 00 00 restore 2009e20: 81 c7 e0 08 ret 2009e24: 81 e8 00 00 restore =============================================================================== 0200a014 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a014: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a018: 90 10 00 18 mov %i0, %o0 200a01c: 40 00 00 70 call 200a1dc <_Thread_Get> 200a020: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a024: c2 07 bf fc ld [ %fp + -4 ], %g1 200a028: 80 a0 60 00 cmp %g1, 0 200a02c: 12 80 00 09 bne 200a050 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 200a030: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a034: 7f ff ff 7d call 2009e28 <_Thread_Clear_state> 200a038: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a03c: 03 00 80 76 sethi %hi(0x201d800), %g1 200a040: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 200a044: 84 00 bf ff add %g2, -1, %g2 200a048: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 200a04c: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 200a050: 81 c7 e0 08 ret 200a054: 81 e8 00 00 restore =============================================================================== 0200a058 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200a058: 9d e3 bf 98 save %sp, -104, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200a05c: 03 00 80 76 sethi %hi(0x201d800), %g1 200a060: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 200a064: 84 00 a0 01 inc %g2 200a068: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 200a06c: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200a070: 21 00 80 78 sethi %hi(0x201e000), %l0 200a074: 82 14 20 10 or %l0, 0x10, %g1 ! 201e010 <_Per_CPU_Information> _ISR_Disable( level ); 200a078: 7f ff e1 93 call 20026c4 200a07c: f2 00 60 0c ld [ %g1 + 0xc ], %i1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a080: 25 00 80 76 sethi %hi(0x201d800), %l2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a084: 27 00 80 76 sethi %hi(0x201d800), %l3 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200a088: 10 80 00 42 b 200a190 <_Thread_Dispatch+0x138> 200a08c: 23 00 80 76 sethi %hi(0x201d800), %l1 heir = _Thread_Heir; _Thread_Dispatch_necessary = false; 200a090: 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 ) 200a094: 80 a6 00 19 cmp %i0, %i1 200a098: 12 80 00 0d bne 200a0cc <_Thread_Dispatch+0x74> 200a09c: f0 20 60 0c st %i0, [ %g1 + 0xc ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 200a0a0: 7f ff e1 8d call 20026d4 200a0a4: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a0a8: 03 00 80 76 sethi %hi(0x201d800), %g1 200a0ac: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 200a0b0: 84 00 bf ff add %g2, -1, %g2 200a0b4: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 200a0b8: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 200a0bc: 7f ff f8 5d call 2008230 <_API_extensions_Run_postswitch> 200a0c0: 01 00 00 00 nop 200a0c4: 81 c7 e0 08 ret 200a0c8: 81 e8 00 00 restore */ #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 ) 200a0cc: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 200a0d0: 80 a0 60 01 cmp %g1, 1 200a0d4: 12 80 00 03 bne 200a0e0 <_Thread_Dispatch+0x88> 200a0d8: c2 04 a2 40 ld [ %l2 + 0x240 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a0dc: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 200a0e0: 7f ff e1 7d call 20026d4 200a0e4: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 200a0e8: 40 00 0d 21 call 200d56c <_TOD_Get_uptime> 200a0ec: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_Subtract( 200a0f0: c4 1f bf f8 ldd [ %fp + -8 ], %g2 200a0f4: 82 14 20 10 or %l0, 0x10, %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a0f8: f8 18 60 20 ldd [ %g1 + 0x20 ], %i4 200a0fc: b6 a0 c0 1d subcc %g3, %i5, %i3 200a100: b4 60 80 1c subx %g2, %i4, %i2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a104: f8 1e 60 80 ldd [ %i1 + 0x80 ], %i4 200a108: ba 87 40 1b addcc %i5, %i3, %i5 200a10c: b8 47 00 1a addx %i4, %i2, %i4 200a110: f8 3e 60 80 std %i4, [ %i1 + 0x80 ] &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 200a114: c4 38 60 20 std %g2, [ %g1 + 0x20 ] #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a118: c2 04 e3 5c ld [ %l3 + 0x35c ], %g1 200a11c: 80 a0 60 00 cmp %g1, 0 200a120: 02 80 00 06 be 200a138 <_Thread_Dispatch+0xe0> <== NEVER TAKEN 200a124: 90 10 00 19 mov %i1, %o0 executing->libc_reent = *_Thread_libc_reent; 200a128: c4 00 40 00 ld [ %g1 ], %g2 200a12c: c4 26 61 54 st %g2, [ %i1 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200a130: c4 06 21 54 ld [ %i0 + 0x154 ], %g2 200a134: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 200a138: 40 00 03 58 call 200ae98 <_User_extensions_Thread_switch> 200a13c: 92 10 00 18 mov %i0, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200a140: 90 06 60 c8 add %i1, 0xc8, %o0 200a144: 40 00 04 83 call 200b350 <_CPU_Context_switch> 200a148: 92 06 20 c8 add %i0, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a14c: c2 06 61 50 ld [ %i1 + 0x150 ], %g1 200a150: 80 a0 60 00 cmp %g1, 0 200a154: 02 80 00 0c be 200a184 <_Thread_Dispatch+0x12c> 200a158: d0 04 63 58 ld [ %l1 + 0x358 ], %o0 200a15c: 80 a6 40 08 cmp %i1, %o0 200a160: 02 80 00 09 be 200a184 <_Thread_Dispatch+0x12c> 200a164: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a168: 02 80 00 04 be 200a178 <_Thread_Dispatch+0x120> 200a16c: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a170: 40 00 04 3e call 200b268 <_CPU_Context_save_fp> 200a174: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 200a178: 40 00 04 59 call 200b2dc <_CPU_Context_restore_fp> 200a17c: 90 06 61 50 add %i1, 0x150, %o0 _Thread_Allocated_fp = executing; 200a180: f2 24 63 58 st %i1, [ %l1 + 0x358 ] if ( executing->fp_context != NULL ) _Context_Restore_fp( &executing->fp_context ); #endif #endif executing = _Thread_Executing; 200a184: 82 14 20 10 or %l0, 0x10, %g1 _ISR_Disable( level ); 200a188: 7f ff e1 4f call 20026c4 200a18c: f2 00 60 0c ld [ %g1 + 0xc ], %i1 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200a190: 82 14 20 10 or %l0, 0x10, %g1 200a194: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2 200a198: 80 a0 a0 00 cmp %g2, 0 200a19c: 32 bf ff bd bne,a 200a090 <_Thread_Dispatch+0x38> 200a1a0: f0 00 60 10 ld [ %g1 + 0x10 ], %i0 200a1a4: 30 bf ff bf b,a 200a0a0 <_Thread_Dispatch+0x48> =============================================================================== 0200f7c4 <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 200f7c4: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 200f7c8: 03 00 80 78 sethi %hi(0x201e000), %g1 200f7cc: fa 00 60 1c ld [ %g1 + 0x1c ], %i5 ! 201e01c <_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(); 200f7d0: 3f 00 80 3d sethi %hi(0x200f400), %i7 200f7d4: be 17 e3 c4 or %i7, 0x3c4, %i7 ! 200f7c4 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f7d8: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 200f7dc: 7f ff cb be call 20026d4 200f7e0: 91 2a 20 08 sll %o0, 8, %o0 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200f7e4: 03 00 80 75 sethi %hi(0x201d400), %g1 doneConstructors = true; 200f7e8: 84 10 20 01 mov 1, %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200f7ec: f8 08 62 e0 ldub [ %g1 + 0x2e0 ], %i4 doneConstructors = true; 200f7f0: c4 28 62 e0 stb %g2, [ %g1 + 0x2e0 ] #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f7f4: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200f7f8: 80 a0 60 00 cmp %g1, 0 200f7fc: 02 80 00 0c be 200f82c <_Thread_Handler+0x68> 200f800: 03 00 80 76 sethi %hi(0x201d800), %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 ); 200f804: d0 00 63 58 ld [ %g1 + 0x358 ], %o0 ! 201db58 <_Thread_Allocated_fp> 200f808: 80 a7 40 08 cmp %i5, %o0 200f80c: 02 80 00 08 be 200f82c <_Thread_Handler+0x68> 200f810: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f814: 22 80 00 06 be,a 200f82c <_Thread_Handler+0x68> 200f818: fa 20 63 58 st %i5, [ %g1 + 0x358 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f81c: 7f ff ee 93 call 200b268 <_CPU_Context_save_fp> 200f820: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200f824: 03 00 80 76 sethi %hi(0x201d800), %g1 200f828: fa 20 63 58 st %i5, [ %g1 + 0x358 ] ! 201db58 <_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 ); 200f82c: 7f ff ed 26 call 200acc4 <_User_extensions_Thread_begin> 200f830: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f834: 7f ff ea 5d call 200a1a8 <_Thread_Enable_dispatch> 200f838: 01 00 00 00 nop /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { 200f83c: 80 8f 20 ff btst 0xff, %i4 200f840: 32 80 00 05 bne,a 200f854 <_Thread_Handler+0x90> 200f844: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 INIT_NAME (); 200f848: 40 00 35 18 call 201cca8 <_init> 200f84c: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f850: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200f854: 80 a0 60 00 cmp %g1, 0 200f858: 12 80 00 05 bne 200f86c <_Thread_Handler+0xa8> 200f85c: 80 a0 60 01 cmp %g1, 1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f860: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 200f864: 10 80 00 06 b 200f87c <_Thread_Handler+0xb8> 200f868: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 200f86c: 12 80 00 07 bne 200f888 <_Thread_Handler+0xc4> <== NEVER TAKEN 200f870: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200f874: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 200f878: d0 07 60 94 ld [ %i5 + 0x94 ], %o0 200f87c: 9f c0 40 00 call %g1 200f880: 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 = 200f884: 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 ); 200f888: 7f ff ed 20 call 200ad08 <_User_extensions_Thread_exitted> 200f88c: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200f890: 90 10 20 00 clr %o0 200f894: 92 10 20 01 mov 1, %o1 200f898: 7f ff e5 04 call 2008ca8 <_Internal_error_Occurred> 200f89c: 94 10 20 05 mov 5, %o2 =============================================================================== 0200a48c <_Thread_Handler_initialization>: * * Output parameters: NONE */ void _Thread_Handler_initialization(void) { 200a48c: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200a490: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a494: 82 10 60 ec or %g1, 0xec, %g1 ! 201ccec #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200a498: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 * Output parameters: NONE */ void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200a49c: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200a4a0: f8 00 60 0c ld [ %g1 + 0xc ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200a4a4: 80 a0 e0 00 cmp %g3, 0 200a4a8: 02 80 00 06 be 200a4c0 <_Thread_Handler_initialization+0x34> 200a4ac: c4 00 60 28 ld [ %g1 + 0x28 ], %g2 200a4b0: c6 00 60 30 ld [ %g1 + 0x30 ], %g3 200a4b4: 80 a0 e0 00 cmp %g3, 0 200a4b8: 12 80 00 06 bne 200a4d0 <_Thread_Handler_initialization+0x44><== ALWAYS TAKEN 200a4bc: 80 a0 a0 00 cmp %g2, 0 rtems_configuration_get_stack_free_hook() == NULL) _Internal_error_Occurred( 200a4c0: 90 10 20 00 clr %o0 200a4c4: 92 10 20 01 mov 1, %o1 200a4c8: 7f ff f9 f8 call 2008ca8 <_Internal_error_Occurred> 200a4cc: 94 10 20 0e mov 0xe, %o2 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200a4d0: 22 80 00 05 be,a 200a4e4 <_Thread_Handler_initialization+0x58> 200a4d4: 03 00 80 78 sethi %hi(0x201e000), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200a4d8: 9f c0 80 00 call %g2 200a4dc: d0 00 60 08 ld [ %g1 + 8 ], %o0 ! 201e008 <_RTEMS_Objects+0x2c> _Thread_Dispatch_necessary = false; 200a4e0: 03 00 80 78 sethi %hi(0x201e000), %g1 200a4e4: 82 10 60 10 or %g1, 0x10, %g1 ! 201e010 <_Per_CPU_Information> 200a4e8: c0 28 60 18 clrb [ %g1 + 0x18 ] _Thread_Executing = NULL; 200a4ec: c0 20 60 0c clr [ %g1 + 0xc ] _Thread_Heir = NULL; 200a4f0: c0 20 60 10 clr [ %g1 + 0x10 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200a4f4: 03 00 80 76 sethi %hi(0x201d800), %g1 200a4f8: c0 20 63 58 clr [ %g1 + 0x358 ] ! 201db58 <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200a4fc: 03 00 80 76 sethi %hi(0x201d800), %g1 200a500: f8 20 63 60 st %i4, [ %g1 + 0x360 ] ! 201db60 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200a504: 03 00 80 76 sethi %hi(0x201d800), %g1 200a508: fa 20 62 40 st %i5, [ %g1 + 0x240 ] ! 201da40 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200a50c: 82 10 20 08 mov 8, %g1 200a510: 11 00 80 76 sethi %hi(0x201d800), %o0 200a514: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200a518: 90 12 23 e0 or %o0, 0x3e0, %o0 200a51c: 92 10 20 01 mov 1, %o1 200a520: 94 10 20 01 mov 1, %o2 200a524: 96 10 20 01 mov 1, %o3 200a528: 98 10 21 68 mov 0x168, %o4 200a52c: 7f ff fb 67 call 20092c8 <_Objects_Initialize_information> 200a530: 9a 10 20 00 clr %o5 200a534: 81 c7 e0 08 ret 200a538: 81 e8 00 00 restore =============================================================================== 0200a290 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a290: 9d e3 bf a0 save %sp, -96, %sp 200a294: 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; 200a298: c0 26 61 58 clr [ %i1 + 0x158 ] 200a29c: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 200a2a0: 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 ) { 200a2a4: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 200a2a8: 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 ) { 200a2ac: 80 a6 a0 00 cmp %i2, 0 200a2b0: 12 80 00 0d bne 200a2e4 <_Thread_Initialize+0x54> 200a2b4: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 200a2b8: 90 10 00 19 mov %i1, %o0 200a2bc: 40 00 02 12 call 200ab04 <_Thread_Stack_Allocate> 200a2c0: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200a2c4: 80 a2 00 1b cmp %o0, %i3 200a2c8: 0a 80 00 6d bcs 200a47c <_Thread_Initialize+0x1ec> 200a2cc: 80 a2 20 00 cmp %o0, 0 200a2d0: 02 80 00 6b be 200a47c <_Thread_Initialize+0x1ec> <== NEVER TAKEN 200a2d4: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200a2d8: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2 the_thread->Start.core_allocated_stack = true; 200a2dc: 10 80 00 04 b 200a2ec <_Thread_Initialize+0x5c> 200a2e0: c2 2e 60 b0 stb %g1, [ %i1 + 0xb0 ] } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 200a2e4: c0 2e 60 b0 clrb [ %i1 + 0xb0 ] 200a2e8: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a2ec: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ] the_stack->size = size; 200a2f0: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 200a2f4: 80 a7 20 00 cmp %i4, 0 200a2f8: 02 80 00 07 be 200a314 <_Thread_Initialize+0x84> 200a2fc: b6 10 20 00 clr %i3 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 200a300: 40 00 03 be call 200b1f8 <_Workspace_Allocate> 200a304: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200a308: b6 92 20 00 orcc %o0, 0, %i3 200a30c: 22 80 00 4d be,a 200a440 <_Thread_Initialize+0x1b0> 200a310: b8 10 20 00 clr %i4 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a314: 03 00 80 76 sethi %hi(0x201d800), %g1 200a318: d0 00 63 60 ld [ %g1 + 0x360 ], %o0 ! 201db60 <_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; 200a31c: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200a320: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200a324: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200a328: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200a32c: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 200a330: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a334: 80 a2 20 00 cmp %o0, 0 200a338: 02 80 00 08 be 200a358 <_Thread_Initialize+0xc8> 200a33c: b8 10 20 00 clr %i4 extensions_area = _Workspace_Allocate( 200a340: 90 02 20 01 inc %o0 200a344: 40 00 03 ad call 200b1f8 <_Workspace_Allocate> 200a348: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200a34c: b8 92 20 00 orcc %o0, 0, %i4 200a350: 02 80 00 3d be 200a444 <_Thread_Initialize+0x1b4> 200a354: 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 ) { 200a358: 80 a7 20 00 cmp %i4, 0 200a35c: 12 80 00 0a bne 200a384 <_Thread_Initialize+0xf4> 200a360: f8 26 61 60 st %i4, [ %i1 + 0x160 ] * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 200a364: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200a368: e4 2e 60 9c stb %l2, [ %i1 + 0x9c ] the_thread->Start.budget_algorithm = budget_algorithm; 200a36c: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 200a370: 80 a4 20 02 cmp %l0, 2 200a374: 12 80 00 12 bne 200a3bc <_Thread_Initialize+0x12c> 200a378: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a37c: 10 80 00 0e b 200a3b4 <_Thread_Initialize+0x124> 200a380: 03 00 80 76 sethi %hi(0x201d800), %g1 * 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++ ) 200a384: 03 00 80 76 sethi %hi(0x201d800), %g1 200a388: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 201db60 <_Thread_Maximum_extensions> 200a38c: 10 80 00 05 b 200a3a0 <_Thread_Initialize+0x110> 200a390: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 200a394: 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++ ) 200a398: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 200a39c: 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++ ) 200a3a0: 80 a0 40 02 cmp %g1, %g2 200a3a4: 28 bf ff fc bleu,a 200a394 <_Thread_Initialize+0x104> 200a3a8: 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; 200a3ac: 10 bf ff ef b 200a368 <_Thread_Initialize+0xd8> 200a3b0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 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; 200a3b4: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 200a3b8: c2 26 60 74 st %g1, [ %i1 + 0x74 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a3bc: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 200a3c0: c0 26 60 44 clr [ %i1 + 0x44 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a3c4: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200a3c8: 82 10 20 01 mov 1, %g1 200a3cc: c2 26 60 10 st %g1, [ %i1 + 0x10 ] */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200a3d0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a3d4: c2 00 61 f8 ld [ %g1 + 0x1f8 ], %g1 ! 201cdf8 <_Scheduler+0x18> the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200a3d8: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200a3dc: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200a3e0: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200a3e4: 9f c0 40 00 call %g1 200a3e8: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200a3ec: b4 92 20 00 orcc %o0, 0, %i2 200a3f0: 02 80 00 15 be 200a444 <_Thread_Initialize+0x1b4> 200a3f4: 90 10 00 19 mov %i1, %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200a3f8: 40 00 01 9b call 200aa64 <_Thread_Set_priority> 200a3fc: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a400: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200a404: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200a408: c0 26 60 80 clr [ %i1 + 0x80 ] 200a40c: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a410: 83 28 60 02 sll %g1, 2, %g1 200a414: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200a418: 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 ); 200a41c: 90 10 00 19 mov %i1, %o0 200a420: 40 00 02 5d call 200ad94 <_User_extensions_Thread_create> 200a424: b0 10 20 01 mov 1, %i0 if ( extension_status ) 200a428: 80 8a 20 ff btst 0xff, %o0 200a42c: 02 80 00 06 be 200a444 <_Thread_Initialize+0x1b4> 200a430: 01 00 00 00 nop 200a434: b0 0e 20 01 and %i0, 1, %i0 200a438: 81 c7 e0 08 ret 200a43c: 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; 200a440: 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 ); 200a444: 40 00 03 75 call 200b218 <_Workspace_Free> 200a448: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200a44c: 40 00 03 73 call 200b218 <_Workspace_Free> 200a450: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 200a454: 40 00 03 71 call 200b218 <_Workspace_Free> 200a458: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200a45c: 40 00 03 6f call 200b218 <_Workspace_Free> 200a460: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200a464: 40 00 03 6d call 200b218 <_Workspace_Free> 200a468: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200a46c: 40 00 03 6b call 200b218 <_Workspace_Free> 200a470: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 200a474: 40 00 01 b4 call 200ab44 <_Thread_Stack_Free> 200a478: 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 */ 200a47c: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 200a480: b0 0e 20 01 and %i0, 1, %i0 200a484: 81 c7 e0 08 ret 200a488: 81 e8 00 00 restore =============================================================================== 0200ab44 <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 200ab44: 9d e3 bf a0 save %sp, -96, %sp #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200ab48: c4 0e 20 b0 ldub [ %i0 + 0xb0 ], %g2 void _Thread_Stack_Free( Thread_Control *the_thread ) { rtems_stack_free_hook stack_free_hook = 200ab4c: 03 00 80 73 sethi %hi(0x201cc00), %g1 #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200ab50: 80 a0 a0 00 cmp %g2, 0 200ab54: 02 80 00 04 be 200ab64 <_Thread_Stack_Free+0x20> <== NEVER TAKEN 200ab58: c2 00 61 1c ld [ %g1 + 0x11c ], %g1 * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ (*stack_free_hook)( the_thread->Start.Initial_stack.area ); 200ab5c: 9f c0 40 00 call %g1 200ab60: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0 200ab64: 81 c7 e0 08 ret 200ab68: 81 e8 00 00 restore =============================================================================== 0200a9ac <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200a9ac: 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 ) 200a9b0: 80 a6 20 00 cmp %i0, 0 200a9b4: 02 80 00 19 be 200aa18 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 200a9b8: 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 ) { 200a9bc: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 200a9c0: 80 a7 60 01 cmp %i5, 1 200a9c4: 12 80 00 15 bne 200aa18 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 200a9c8: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200a9cc: 7f ff df 3e call 20026c4 200a9d0: 01 00 00 00 nop 200a9d4: b8 10 00 08 mov %o0, %i4 200a9d8: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200a9dc: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a9e0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 200a9e4: 80 88 80 01 btst %g2, %g1 200a9e8: 02 80 00 0a be 200aa10 <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 200a9ec: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 200a9f0: 92 10 00 19 mov %i1, %o1 200a9f4: 94 10 20 01 mov 1, %o2 200a9f8: 40 00 0c b8 call 200dcd8 <_Thread_queue_Extract_priority_helper> 200a9fc: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200aa00: 90 10 00 18 mov %i0, %o0 200aa04: 92 10 00 19 mov %i1, %o1 200aa08: 7f ff ff 50 call 200a748 <_Thread_queue_Enqueue_priority> 200aa0c: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 200aa10: 7f ff df 31 call 20026d4 200aa14: 90 10 00 1c mov %i4, %o0 200aa18: 81 c7 e0 08 ret 200aa1c: 81 e8 00 00 restore =============================================================================== 0200aa20 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200aa20: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200aa24: 90 10 00 18 mov %i0, %o0 200aa28: 7f ff fd ed call 200a1dc <_Thread_Get> 200aa2c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200aa30: c2 07 bf fc ld [ %fp + -4 ], %g1 200aa34: 80 a0 60 00 cmp %g1, 0 200aa38: 12 80 00 09 bne 200aa5c <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 200aa3c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200aa40: 40 00 0c dd call 200ddb4 <_Thread_queue_Process_timeout> 200aa44: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200aa48: 03 00 80 76 sethi %hi(0x201d800), %g1 200aa4c: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 200aa50: 84 00 bf ff add %g2, -1, %g2 200aa54: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 200aa58: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 200aa5c: 81 c7 e0 08 ret 200aa60: 81 e8 00 00 restore =============================================================================== 02018c78 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2018c78: 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; 2018c7c: 27 00 80 f3 sethi %hi(0x203cc00), %l3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2018c80: a4 07 bf e8 add %fp, -24, %l2 2018c84: aa 07 bf ec add %fp, -20, %l5 2018c88: b8 07 bf f4 add %fp, -12, %i4 2018c8c: b2 07 bf f8 add %fp, -8, %i1 2018c90: ea 27 bf e8 st %l5, [ %fp + -24 ] head->previous = NULL; 2018c94: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2018c98: e4 27 bf f0 st %l2, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2018c9c: f2 27 bf f4 st %i1, [ %fp + -12 ] head->previous = NULL; 2018ca0: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2018ca4: f8 27 bf fc st %i4, [ %fp + -4 ] */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018ca8: b4 06 20 30 add %i0, 0x30, %i2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2018cac: 29 00 80 f3 sethi %hi(0x203cc00), %l4 /* * 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 ); 2018cb0: b6 06 20 68 add %i0, 0x68, %i3 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2018cb4: 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 ); 2018cb8: 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; 2018cbc: e4 26 20 78 st %l2, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2018cc0: c2 04 e2 68 ld [ %l3 + 0x268 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2018cc4: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018cc8: 90 10 00 1a mov %i2, %o0 2018ccc: 92 20 40 09 sub %g1, %o1, %o1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2018cd0: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018cd4: 40 00 11 97 call 201d330 <_Watchdog_Adjust_to_chain> 2018cd8: 94 10 00 1c mov %i4, %o2 2018cdc: d0 1d 20 b8 ldd [ %l4 + 0xb8 ], %o0 2018ce0: 94 10 20 00 clr %o2 2018ce4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2018ce8: 40 00 4f 49 call 202ca0c <__divdi3> 2018cec: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2018cf0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 2018cf4: 80 a2 40 0a cmp %o1, %o2 2018cf8: 08 80 00 07 bleu 2018d14 <_Timer_server_Body+0x9c> 2018cfc: ba 10 00 09 mov %o1, %i5 /* * 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 ); 2018d00: 92 22 40 0a sub %o1, %o2, %o1 2018d04: 90 10 00 1b mov %i3, %o0 2018d08: 40 00 11 8a call 201d330 <_Watchdog_Adjust_to_chain> 2018d0c: 94 10 00 1c mov %i4, %o2 2018d10: 30 80 00 06 b,a 2018d28 <_Timer_server_Body+0xb0> } else if ( snapshot < last_snapshot ) { 2018d14: 1a 80 00 05 bcc 2018d28 <_Timer_server_Body+0xb0> 2018d18: 90 10 00 1b mov %i3, %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 ); 2018d1c: 92 10 20 01 mov 1, %o1 2018d20: 40 00 11 5c call 201d290 <_Watchdog_Adjust> 2018d24: 94 22 80 1d sub %o2, %i5, %o2 } watchdogs->last_snapshot = snapshot; 2018d28: 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 ); 2018d2c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018d30: 40 00 02 8c call 2019760 <_Chain_Get> 2018d34: 01 00 00 00 nop if ( timer == NULL ) { 2018d38: 92 92 20 00 orcc %o0, 0, %o1 2018d3c: 02 80 00 0c be 2018d6c <_Timer_server_Body+0xf4> 2018d40: 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 ) { 2018d44: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2018d48: 80 a0 60 01 cmp %g1, 1 2018d4c: 02 80 00 05 be 2018d60 <_Timer_server_Body+0xe8> 2018d50: 90 10 00 1a mov %i2, %o0 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2018d54: 80 a0 60 03 cmp %g1, 3 2018d58: 12 bf ff f5 bne 2018d2c <_Timer_server_Body+0xb4> <== NEVER TAKEN 2018d5c: 90 10 00 1b mov %i3, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2018d60: 40 00 11 a6 call 201d3f8 <_Watchdog_Insert> 2018d64: 92 02 60 10 add %o1, 0x10, %o1 2018d68: 30 bf ff f1 b,a 2018d2c <_Timer_server_Body+0xb4> * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2018d6c: 7f ff de a1 call 20107f0 2018d70: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2018d74: c2 07 bf e8 ld [ %fp + -24 ], %g1 2018d78: 80 a0 40 15 cmp %g1, %l5 2018d7c: 12 80 00 0a bne 2018da4 <_Timer_server_Body+0x12c> <== NEVER TAKEN 2018d80: 01 00 00 00 nop ts->insert_chain = NULL; 2018d84: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2018d88: 7f ff de 9e call 2010800 2018d8c: 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 ) ) { 2018d90: c2 07 bf f4 ld [ %fp + -12 ], %g1 2018d94: 80 a0 40 19 cmp %g1, %i1 2018d98: 12 80 00 06 bne 2018db0 <_Timer_server_Body+0x138> 2018d9c: 01 00 00 00 nop 2018da0: 30 80 00 18 b,a 2018e00 <_Timer_server_Body+0x188> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2018da4: 7f ff de 97 call 2010800 <== NOT EXECUTED 2018da8: 01 00 00 00 nop <== NOT EXECUTED 2018dac: 30 bf ff c5 b,a 2018cc0 <_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 ); 2018db0: 7f ff de 90 call 20107f0 2018db4: 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; 2018db8: 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)) 2018dbc: 80 a7 40 19 cmp %i5, %i1 2018dc0: 02 80 00 0d be 2018df4 <_Timer_server_Body+0x17c> 2018dc4: 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; 2018dc8: c2 07 40 00 ld [ %i5 ], %g1 head->next = new_first; new_first->previous = head; 2018dcc: f8 20 60 04 st %i4, [ %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; 2018dd0: c2 27 bf f4 st %g1, [ %fp + -12 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 2018dd4: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 2018dd8: 7f ff de 8a call 2010800 2018ddc: 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 ); 2018de0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2018de4: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 2018de8: 9f c0 40 00 call %g1 2018dec: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 } 2018df0: 30 bf ff f0 b,a 2018db0 <_Timer_server_Body+0x138> watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2018df4: 7f ff de 83 call 2010800 2018df8: 01 00 00 00 nop 2018dfc: 30 bf ff b0 b,a 2018cbc <_Timer_server_Body+0x44> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2018e00: c0 2e 20 7c clrb [ %i0 + 0x7c ] 2018e04: 7f ff ff 19 call 2018a68 <_Thread_Dispatch_increment_disable_level> 2018e08: 01 00 00 00 nop /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2018e0c: d0 06 00 00 ld [ %i0 ], %o0 2018e10: 40 00 0f f9 call 201cdf4 <_Thread_Set_state> 2018e14: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2018e18: 7f ff ff 1b call 2018a84 <_Timer_server_Reset_interval_system_watchdog> 2018e1c: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2018e20: 7f ff ff 2d call 2018ad4 <_Timer_server_Reset_tod_system_watchdog> 2018e24: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2018e28: 40 00 0d 99 call 201c48c <_Thread_Enable_dispatch> 2018e2c: 01 00 00 00 nop ts->active = true; 2018e30: 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 ); 2018e34: 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; 2018e38: 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 ); 2018e3c: 40 00 11 c7 call 201d558 <_Watchdog_Remove> 2018e40: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2018e44: 40 00 11 c5 call 201d558 <_Watchdog_Remove> 2018e48: 90 10 00 10 mov %l0, %o0 2018e4c: 30 bf ff 9c b,a 2018cbc <_Timer_server_Body+0x44> =============================================================================== 02018b24 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2018b24: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2018b28: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2018b2c: 80 a0 60 00 cmp %g1, 0 2018b30: 12 80 00 4f bne 2018c6c <_Timer_server_Schedule_operation_method+0x148> 2018b34: ba 10 00 19 mov %i1, %i5 #if defined ( __THREAD_DO_NOT_INLINE_DISABLE_DISPATCH__ ) void _Thread_Disable_dispatch( void ); #else RTEMS_INLINE_ROUTINE void _Thread_Disable_dispatch( void ) { _Thread_Dispatch_increment_disable_level(); 2018b38: 7f ff ff cc call 2018a68 <_Thread_Dispatch_increment_disable_level> 2018b3c: 01 00 00 00 nop * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2018b40: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2018b44: 80 a0 60 01 cmp %g1, 1 2018b48: 12 80 00 1f bne 2018bc4 <_Timer_server_Schedule_operation_method+0xa0> 2018b4c: 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 ); 2018b50: 7f ff df 28 call 20107f0 2018b54: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2018b58: 03 00 80 f3 sethi %hi(0x203cc00), %g1 2018b5c: c4 00 62 68 ld [ %g1 + 0x268 ], %g2 ! 203ce68 <_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; 2018b60: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2018b64: 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 ); 2018b68: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2018b6c: 80 a0 40 03 cmp %g1, %g3 2018b70: 02 80 00 08 be 2018b90 <_Timer_server_Schedule_operation_method+0x6c> 2018b74: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2018b78: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 2018b7c: 80 a7 00 04 cmp %i4, %g4 2018b80: 08 80 00 03 bleu 2018b8c <_Timer_server_Schedule_operation_method+0x68> 2018b84: 86 10 20 00 clr %g3 delta_interval -= delta; 2018b88: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2018b8c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2018b90: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2018b94: 7f ff df 1b call 2010800 2018b98: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2018b9c: 90 06 20 30 add %i0, 0x30, %o0 2018ba0: 40 00 12 16 call 201d3f8 <_Watchdog_Insert> 2018ba4: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018ba8: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2018bac: 80 a0 60 00 cmp %g1, 0 2018bb0: 12 80 00 2d bne 2018c64 <_Timer_server_Schedule_operation_method+0x140> 2018bb4: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2018bb8: 7f ff ff b3 call 2018a84 <_Timer_server_Reset_interval_system_watchdog> 2018bbc: 90 10 00 18 mov %i0, %o0 2018bc0: 30 80 00 29 b,a 2018c64 <_Timer_server_Schedule_operation_method+0x140> } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2018bc4: 12 80 00 28 bne 2018c64 <_Timer_server_Schedule_operation_method+0x140> 2018bc8: 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 ); 2018bcc: 7f ff df 09 call 20107f0 2018bd0: 01 00 00 00 nop 2018bd4: b8 10 00 08 mov %o0, %i4 2018bd8: 03 00 80 f3 sethi %hi(0x203cc00), %g1 2018bdc: d0 18 60 b8 ldd [ %g1 + 0xb8 ], %o0 ! 203ccb8 <_TOD> 2018be0: 94 10 20 00 clr %o2 2018be4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2018be8: 40 00 4f 89 call 202ca0c <__divdi3> 2018bec: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2018bf0: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2018bf4: c4 06 20 74 ld [ %i0 + 0x74 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2018bf8: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2018bfc: 80 a0 40 03 cmp %g1, %g3 2018c00: 02 80 00 0d be 2018c34 <_Timer_server_Schedule_operation_method+0x110> 2018c04: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2018c08: 08 80 00 08 bleu 2018c28 <_Timer_server_Schedule_operation_method+0x104> 2018c0c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2018c10: 88 22 40 02 sub %o1, %g2, %g4 if (delta_interval > delta) { 2018c14: 80 a0 c0 04 cmp %g3, %g4 2018c18: 08 80 00 06 bleu 2018c30 <_Timer_server_Schedule_operation_method+0x10c><== NEVER TAKEN 2018c1c: 84 10 20 00 clr %g2 delta_interval -= delta; 2018c20: 10 80 00 04 b 2018c30 <_Timer_server_Schedule_operation_method+0x10c> 2018c24: 84 20 c0 04 sub %g3, %g4, %g2 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2018c28: 84 00 c0 02 add %g3, %g2, %g2 delta_interval += delta; 2018c2c: 84 20 80 09 sub %g2, %o1, %g2 } first_watchdog->delta_interval = delta_interval; 2018c30: c4 20 60 10 st %g2, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2018c34: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2018c38: 7f ff de f2 call 2010800 2018c3c: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2018c40: 90 06 20 68 add %i0, 0x68, %o0 2018c44: 40 00 11 ed call 201d3f8 <_Watchdog_Insert> 2018c48: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018c4c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2018c50: 80 a0 60 00 cmp %g1, 0 2018c54: 12 80 00 04 bne 2018c64 <_Timer_server_Schedule_operation_method+0x140> 2018c58: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2018c5c: 7f ff ff 9e call 2018ad4 <_Timer_server_Reset_tod_system_watchdog> 2018c60: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2018c64: 40 00 0e 0a call 201c48c <_Thread_Enable_dispatch> 2018c68: 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 ); 2018c6c: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2018c70: 40 00 02 b0 call 2019730 <_Chain_Append> 2018c74: 81 e8 00 00 restore =============================================================================== 0200c558 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200c558: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200c55c: d4 1e 40 00 ldd [ %i1 ], %o2 200c560: 80 92 80 0b orcc %o2, %o3, %g0 200c564: 32 80 00 06 bne,a 200c57c <_Timestamp64_Divide+0x24> <== ALWAYS TAKEN 200c568: f8 1e 00 00 ldd [ %i0 ], %i4 *_ival_percentage = 0; 200c56c: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED *_fval_percentage = 0; 200c570: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200c574: 81 c7 e0 08 ret <== NOT EXECUTED 200c578: 81 e8 00 00 restore <== NOT EXECUTED * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200c57c: 83 2f 20 02 sll %i4, 2, %g1 200c580: 89 37 60 1e srl %i5, 0x1e, %g4 200c584: 87 2f 60 02 sll %i5, 2, %g3 200c588: 84 11 00 01 or %g4, %g1, %g2 200c58c: 83 30 e0 1b srl %g3, 0x1b, %g1 200c590: b1 28 a0 05 sll %g2, 5, %i0 200c594: b3 28 e0 05 sll %g3, 5, %i1 200c598: b0 10 40 18 or %g1, %i0, %i0 200c59c: 92 a6 40 03 subcc %i1, %g3, %o1 200c5a0: 90 66 00 02 subx %i0, %g2, %o0 200c5a4: 92 82 40 1d addcc %o1, %i5, %o1 200c5a8: 83 32 60 1e srl %o1, 0x1e, %g1 200c5ac: 90 42 00 1c addx %o0, %i4, %o0 200c5b0: bb 2a 60 02 sll %o1, 2, %i5 200c5b4: b9 2a 20 02 sll %o0, 2, %i4 200c5b8: 92 82 40 1d addcc %o1, %i5, %o1 200c5bc: b8 10 40 1c or %g1, %i4, %i4 200c5c0: 83 32 60 1e srl %o1, 0x1e, %g1 200c5c4: 90 42 00 1c addx %o0, %i4, %o0 200c5c8: bb 2a 60 02 sll %o1, 2, %i5 200c5cc: b9 2a 20 02 sll %o0, 2, %i4 200c5d0: 92 82 40 1d addcc %o1, %i5, %o1 200c5d4: b8 10 40 1c or %g1, %i4, %i4 200c5d8: 87 32 60 1b srl %o1, 0x1b, %g3 200c5dc: 90 42 00 1c addx %o0, %i4, %o0 200c5e0: 83 2a 60 05 sll %o1, 5, %g1 200c5e4: 85 2a 20 05 sll %o0, 5, %g2 200c5e8: 92 10 00 01 mov %g1, %o1 200c5ec: 40 00 3a 1a call 201ae54 <__divdi3> 200c5f0: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200c5f4: 94 10 20 00 clr %o2 * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200c5f8: b8 10 00 08 mov %o0, %i4 200c5fc: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 200c600: 40 00 3a 15 call 201ae54 <__divdi3> 200c604: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200c608: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200c60c: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200c610: 94 10 20 00 clr %o2 200c614: 92 10 00 1d mov %i5, %o1 200c618: 40 00 3a fa call 201b200 <__moddi3> 200c61c: 96 10 23 e8 mov 0x3e8, %o3 200c620: d2 26 c0 00 st %o1, [ %i3 ] 200c624: 81 c7 e0 08 ret 200c628: 81 e8 00 00 restore =============================================================================== 0200ac0c <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200ac0c: 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; 200ac10: 03 00 80 73 sethi %hi(0x201cc00), %g1 200ac14: 82 10 60 ec or %g1, 0xec, %g1 ! 201ccec ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200ac18: 05 00 80 77 sethi %hi(0x201dc00), %g2 initial_extensions = Configuration.User_extension_table; 200ac1c: f4 00 60 48 ld [ %g1 + 0x48 ], %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; 200ac20: f8 00 60 44 ld [ %g1 + 0x44 ], %i4 200ac24: 82 10 a0 b8 or %g2, 0xb8, %g1 200ac28: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 200ac2c: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200ac30: 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; 200ac34: c6 20 a0 b8 st %g3, [ %g2 + 0xb8 ] 200ac38: 05 00 80 76 sethi %hi(0x201d800), %g2 200ac3c: 82 10 a2 e4 or %g2, 0x2e4, %g1 ! 201dae4 <_User_extensions_Switches_list> 200ac40: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 200ac44: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200ac48: c6 20 a2 e4 st %g3, [ %g2 + 0x2e4 ] initial_extensions = Configuration.User_extension_table; _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200ac4c: 80 a6 a0 00 cmp %i2, 0 200ac50: 02 80 00 1b be 200acbc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200ac54: c2 20 60 08 st %g1, [ %g1 + 8 ] extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 200ac58: 83 2f 20 02 sll %i4, 2, %g1 200ac5c: b7 2f 20 04 sll %i4, 4, %i3 200ac60: b6 26 c0 01 sub %i3, %g1, %i3 200ac64: b6 06 c0 1c add %i3, %i4, %i3 200ac68: b7 2e e0 02 sll %i3, 2, %i3 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200ac6c: 40 00 01 71 call 200b230 <_Workspace_Allocate_or_fatal_error> 200ac70: 90 10 00 1b mov %i3, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200ac74: 94 10 00 1b mov %i3, %o2 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200ac78: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200ac7c: 92 10 20 00 clr %o1 200ac80: 40 00 15 e8 call 2010420 200ac84: b6 10 20 00 clr %i3 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200ac88: 10 80 00 0b b 200acb4 <_User_extensions_Handler_initialization+0xa8> 200ac8c: 80 a6 c0 1c cmp %i3, %i4 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 200ac90: 90 07 60 14 add %i5, 0x14, %o0 200ac94: 92 06 80 09 add %i2, %o1, %o1 200ac98: 40 00 15 a5 call 201032c 200ac9c: 94 10 20 20 mov 0x20, %o2 _User_extensions_Add_set( extension ); 200aca0: 90 10 00 1d mov %i5, %o0 200aca4: 40 00 0c 84 call 200deb4 <_User_extensions_Add_set> 200aca8: b6 06 e0 01 inc %i3 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200acac: ba 07 60 34 add %i5, 0x34, %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200acb0: 80 a6 c0 1c cmp %i3, %i4 200acb4: 12 bf ff f7 bne 200ac90 <_User_extensions_Handler_initialization+0x84> 200acb8: 93 2e e0 05 sll %i3, 5, %o1 200acbc: 81 c7 e0 08 ret 200acc0: 81 e8 00 00 restore =============================================================================== 0200c934 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200c934: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200c938: 7f ff da f5 call 200350c 200c93c: 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; 200c940: 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 ); 200c944: 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 ) ) { 200c948: 80 a0 40 1c cmp %g1, %i4 200c94c: 02 80 00 20 be 200c9cc <_Watchdog_Adjust+0x98> 200c950: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200c954: 02 80 00 1b be 200c9c0 <_Watchdog_Adjust+0x8c> 200c958: b6 10 20 01 mov 1, %i3 200c95c: 80 a6 60 01 cmp %i1, 1 200c960: 12 80 00 1b bne 200c9cc <_Watchdog_Adjust+0x98> <== NEVER TAKEN 200c964: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200c968: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200c96c: 10 80 00 07 b 200c988 <_Watchdog_Adjust+0x54> 200c970: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200c974: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200c978: 80 a6 80 02 cmp %i2, %g2 200c97c: 3a 80 00 05 bcc,a 200c990 <_Watchdog_Adjust+0x5c> 200c980: f6 20 60 10 st %i3, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200c984: b4 20 80 1a sub %g2, %i2, %i2 break; 200c988: 10 80 00 11 b 200c9cc <_Watchdog_Adjust+0x98> 200c98c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; 200c990: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200c994: 7f ff da e2 call 200351c 200c998: 01 00 00 00 nop _Watchdog_Tickle( header ); 200c99c: 40 00 00 90 call 200cbdc <_Watchdog_Tickle> 200c9a0: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 200c9a4: 7f ff da da call 200350c 200c9a8: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200c9ac: c2 06 00 00 ld [ %i0 ], %g1 200c9b0: 80 a0 40 1c cmp %g1, %i4 200c9b4: 12 80 00 04 bne 200c9c4 <_Watchdog_Adjust+0x90> 200c9b8: 80 a6 a0 00 cmp %i2, 0 200c9bc: 30 80 00 04 b,a 200c9cc <_Watchdog_Adjust+0x98> switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200c9c0: 80 a6 a0 00 cmp %i2, 0 200c9c4: 32 bf ff ec bne,a 200c974 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200c9c8: c2 06 00 00 ld [ %i0 ], %g1 } break; } } _ISR_Enable( level ); 200c9cc: 7f ff da d4 call 200351c 200c9d0: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b034 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b034: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b038: 7f ff dd a3 call 20026c4 200b03c: ba 10 00 18 mov %i0, %i5 previous_state = the_watchdog->state; 200b040: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 200b044: 80 a6 20 01 cmp %i0, 1 200b048: 22 80 00 1e be,a 200b0c0 <_Watchdog_Remove+0x8c> 200b04c: c0 27 60 08 clr [ %i5 + 8 ] 200b050: 0a 80 00 1d bcs 200b0c4 <_Watchdog_Remove+0x90> 200b054: 03 00 80 76 sethi %hi(0x201d800), %g1 200b058: 80 a6 20 03 cmp %i0, 3 200b05c: 18 80 00 1a bgu 200b0c4 <_Watchdog_Remove+0x90> <== NEVER TAKEN 200b060: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200b064: 10 80 00 02 b 200b06c <_Watchdog_Remove+0x38> 200b068: c2 07 40 00 ld [ %i5 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b06c: c0 27 60 08 clr [ %i5 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b070: c4 00 40 00 ld [ %g1 ], %g2 200b074: 80 a0 a0 00 cmp %g2, 0 200b078: 02 80 00 07 be 200b094 <_Watchdog_Remove+0x60> 200b07c: 05 00 80 76 sethi %hi(0x201d800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b080: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b084: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 200b088: 84 00 c0 02 add %g3, %g2, %g2 200b08c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b090: 05 00 80 76 sethi %hi(0x201d800), %g2 200b094: c4 00 a3 d4 ld [ %g2 + 0x3d4 ], %g2 ! 201dbd4 <_Watchdog_Sync_count> 200b098: 80 a0 a0 00 cmp %g2, 0 200b09c: 22 80 00 07 be,a 200b0b8 <_Watchdog_Remove+0x84> 200b0a0: c4 07 60 04 ld [ %i5 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b0a4: 05 00 80 78 sethi %hi(0x201e000), %g2 200b0a8: c6 00 a0 18 ld [ %g2 + 0x18 ], %g3 ! 201e018 <_Per_CPU_Information+0x8> 200b0ac: 05 00 80 76 sethi %hi(0x201d800), %g2 200b0b0: c6 20 a3 74 st %g3, [ %g2 + 0x374 ] ! 201db74 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b0b4: c4 07 60 04 ld [ %i5 + 4 ], %g2 next->previous = previous; 200b0b8: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b0bc: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b0c0: 03 00 80 76 sethi %hi(0x201d800), %g1 200b0c4: c2 00 63 d8 ld [ %g1 + 0x3d8 ], %g1 ! 201dbd8 <_Watchdog_Ticks_since_boot> 200b0c8: c2 27 60 18 st %g1, [ %i5 + 0x18 ] _ISR_Enable( level ); 200b0cc: 7f ff dd 82 call 20026d4 200b0d0: 01 00 00 00 nop return( previous_state ); } 200b0d4: 81 c7 e0 08 ret 200b0d8: 81 e8 00 00 restore =============================================================================== 0200c2a4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200c2a4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200c2a8: 7f ff db 76 call 2003080 200c2ac: b8 10 00 18 mov %i0, %i4 200c2b0: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200c2b4: 11 00 80 76 sethi %hi(0x201d800), %o0 200c2b8: 94 10 00 19 mov %i1, %o2 200c2bc: 90 12 20 50 or %o0, 0x50, %o0 200c2c0: 7f ff e3 5a call 2005028 200c2c4: 92 10 00 1c mov %i4, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c2c8: fa 06 40 00 ld [ %i1 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200c2cc: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200c2d0: 80 a7 40 19 cmp %i5, %i1 200c2d4: 12 80 00 04 bne 200c2e4 <_Watchdog_Report_chain+0x40> 200c2d8: 92 10 00 1d mov %i5, %o1 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200c2dc: 10 80 00 0d b 200c310 <_Watchdog_Report_chain+0x6c> 200c2e0: 11 00 80 76 sethi %hi(0x201d800), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200c2e4: 40 00 00 0f call 200c320 <_Watchdog_Report> 200c2e8: 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 ) 200c2ec: fa 07 40 00 ld [ %i5 ], %i5 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200c2f0: 80 a7 40 19 cmp %i5, %i1 200c2f4: 12 bf ff fc bne 200c2e4 <_Watchdog_Report_chain+0x40> <== NEVER TAKEN 200c2f8: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200c2fc: 11 00 80 76 sethi %hi(0x201d800), %o0 200c300: 92 10 00 1c mov %i4, %o1 200c304: 7f ff e3 49 call 2005028 200c308: 90 12 20 68 or %o0, 0x68, %o0 200c30c: 30 80 00 03 b,a 200c318 <_Watchdog_Report_chain+0x74> } else { printk( "Chain is empty\n" ); 200c310: 7f ff e3 46 call 2005028 200c314: 90 12 20 78 or %o0, 0x78, %o0 } _ISR_Enable( level ); 200c318: 7f ff db 5e call 2003090 200c31c: 81 e8 00 00 restore =============================================================================== 02007944 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2007944: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2007948: 3b 00 80 7f sethi %hi(0x201fc00), %i5 200794c: 40 00 04 68 call 2008aec 2007950: 90 17 62 bc or %i5, 0x2bc, %o0 ! 201febc if (fcntl (fildes, F_GETFD) < 0) { 2007954: 90 10 00 18 mov %i0, %o0 2007958: 40 00 1a ae call 200e410 200795c: 92 10 20 01 mov 1, %o1 2007960: 80 a2 20 00 cmp %o0, 0 2007964: 16 80 00 08 bge 2007984 2007968: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); 200796c: 40 00 04 81 call 2008b70 2007970: 90 17 62 bc or %i5, 0x2bc, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2007974: 40 00 28 ed call 2011d28 <__errno> 2007978: 01 00 00 00 nop 200797c: 10 80 00 54 b 2007acc 2007980: 82 10 20 09 mov 9, %g1 ! 9 } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 2007984: 32 80 00 35 bne,a 2007a58 2007988: 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); 200798c: 11 00 80 7f sethi %hi(0x201fc00), %o0 2007990: 92 10 00 18 mov %i0, %o1 2007994: 90 12 23 04 or %o0, 0x304, %o0 2007998: 40 00 01 71 call 2007f5c 200799c: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20079a0: b8 92 20 00 orcc %o0, 0, %i4 20079a4: 12 80 00 20 bne 2007a24 20079a8: b6 07 20 1c add %i4, 0x1c, %i3 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20079ac: ba 17 62 bc or %i5, 0x2bc, %i5 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 20079b0: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 20079b4: 82 07 60 58 add %i5, 0x58, %g1 20079b8: 80 a0 80 01 cmp %g2, %g1 20079bc: 02 80 00 08 be 20079dc <== NEVER TAKEN 20079c0: 92 10 00 18 mov %i0, %o1 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 20079c4: 90 07 60 54 add %i5, 0x54, %o0 20079c8: 40 00 01 65 call 2007f5c 20079cc: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20079d0: b8 92 20 00 orcc %o0, 0, %i4 20079d4: 12 80 00 08 bne 20079f4 20079d8: 01 00 00 00 nop pthread_mutex_unlock(&aio_request_queue.mutex); 20079dc: 11 00 80 7f sethi %hi(0x201fc00), %o0 return AIO_ALLDONE; 20079e0: b0 10 20 02 mov 2, %i0 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock(&aio_request_queue.mutex); 20079e4: 40 00 04 63 call 2008b70 20079e8: 90 12 22 bc or %o0, 0x2bc, %o0 return AIO_ALLDONE; 20079ec: 81 c7 e0 08 ret 20079f0: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20079f4: 40 00 0a cb call 200a520 <_Chain_Extract> 20079f8: b6 07 20 1c add %i4, 0x1c, %i3 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 20079fc: 40 00 01 80 call 2007ffc 2007a00: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2007a04: 40 00 03 8c call 2008834 2007a08: 90 10 00 1b mov %i3, %o0 pthread_cond_destroy (&r_chain->mutex); 2007a0c: 40 00 02 ac call 20084bc 2007a10: 90 10 00 1b mov %i3, %o0 free (r_chain); 2007a14: 7f ff f0 d3 call 2003d60 2007a18: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007a1c: 10 80 00 0b b 2007a48 2007a20: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007a24: 40 00 04 32 call 2008aec 2007a28: 90 10 00 1b mov %i3, %o0 2007a2c: 40 00 0a bd call 200a520 <_Chain_Extract> 2007a30: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007a34: 40 00 01 72 call 2007ffc 2007a38: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007a3c: 40 00 04 4d call 2008b70 2007a40: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007a44: 90 17 62 bc or %i5, 0x2bc, %o0 2007a48: 40 00 04 4a call 2008b70 2007a4c: b0 10 20 00 clr %i0 return AIO_CANCELED; 2007a50: 81 c7 e0 08 ret 2007a54: 81 e8 00 00 restore } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2007a58: 80 a7 00 18 cmp %i4, %i0 2007a5c: 12 80 00 17 bne 2007ab8 2007a60: 90 17 62 bc or %i5, 0x2bc, %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); 2007a64: 11 00 80 7f sethi %hi(0x201fc00), %o0 2007a68: 92 10 00 1c mov %i4, %o1 2007a6c: 90 12 23 04 or %o0, 0x304, %o0 2007a70: 40 00 01 3b call 2007f5c 2007a74: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007a78: b6 92 20 00 orcc %o0, 0, %i3 2007a7c: 32 80 00 1c bne,a 2007aec 2007a80: b8 06 e0 1c add %i3, 0x1c, %i4 2007a84: ba 17 62 bc or %i5, 0x2bc, %i5 if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007a88: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2007a8c: 82 07 60 58 add %i5, 0x58, %g1 2007a90: 80 a0 80 01 cmp %g2, %g1 2007a94: 02 bf ff d2 be 20079dc <== NEVER TAKEN 2007a98: 92 10 00 1c mov %i4, %o1 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007a9c: 90 07 60 54 add %i5, 0x54, %o0 2007aa0: 40 00 01 2f call 2007f5c 2007aa4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007aa8: 80 a2 20 00 cmp %o0, 0 2007aac: 12 80 00 0b bne 2007ad8 2007ab0: 90 02 20 08 add %o0, 8, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007ab4: 90 10 00 1d mov %i5, %o0 2007ab8: 40 00 04 2e call 2008b70 2007abc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one (EINVAL); 2007ac0: 40 00 28 9a call 2011d28 <__errno> 2007ac4: 01 00 00 00 nop 2007ac8: 82 10 20 16 mov 0x16, %g1 ! 16 2007acc: c2 22 00 00 st %g1, [ %o0 ] 2007ad0: 81 c7 e0 08 ret 2007ad4: 91 e8 3f ff restore %g0, -1, %o0 } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007ad8: 40 00 01 5d call 200804c 2007adc: 92 10 00 19 mov %i1, %o1 2007ae0: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007ae4: 10 80 00 0b b 2007b10 2007ae8: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007aec: 40 00 04 00 call 2008aec 2007af0: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007af4: 92 10 00 19 mov %i1, %o1 2007af8: 40 00 01 55 call 200804c 2007afc: 90 06 e0 08 add %i3, 8, %o0 2007b00: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2007b04: 40 00 04 1b call 2008b70 2007b08: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007b0c: 90 17 62 bc or %i5, 0x2bc, %o0 2007b10: 40 00 04 18 call 2008b70 2007b14: 01 00 00 00 nop return result; } return AIO_ALLDONE; } 2007b18: 81 c7 e0 08 ret 2007b1c: 81 e8 00 00 restore =============================================================================== 02007b28 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2007b28: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2007b2c: 03 00 00 08 sethi %hi(0x2000), %g1 2007b30: 80 a6 00 01 cmp %i0, %g1 2007b34: 12 80 00 10 bne 2007b74 2007b38: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007b3c: d0 06 40 00 ld [ %i1 ], %o0 2007b40: 40 00 1a 34 call 200e410 2007b44: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007b48: 90 0a 20 03 and %o0, 3, %o0 2007b4c: 90 02 3f ff add %o0, -1, %o0 2007b50: 80 a2 20 01 cmp %o0, 1 2007b54: 18 80 00 08 bgu 2007b74 2007b58: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007b5c: 7f ff f1 b6 call 2004234 2007b60: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007b64: b0 92 20 00 orcc %o0, 0, %i0 2007b68: 32 80 00 09 bne,a 2007b8c <== ALWAYS TAKEN 2007b6c: f2 26 20 14 st %i1, [ %i0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007b70: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2007b74: 82 10 3f ff mov -1, %g1 2007b78: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2007b7c: 40 00 28 6b call 2011d28 <__errno> 2007b80: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2007b84: 10 80 00 06 b 2007b9c 2007b88: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; 2007b8c: 82 10 20 03 mov 3, %g1 2007b90: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2007b94: 40 00 01 4e call 20080cc 2007b98: 81 e8 00 00 restore } 2007b9c: 81 c7 e0 08 ret 2007ba0: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 020082e4 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20082e4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20082e8: d0 06 00 00 ld [ %i0 ], %o0 20082ec: 92 10 20 03 mov 3, %o1 20082f0: 40 00 18 48 call 200e410 20082f4: ba 10 00 18 mov %i0, %i5 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20082f8: 80 8a 20 01 btst 1, %o0 20082fc: 12 80 00 11 bne 2008340 2008300: 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) 2008304: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008308: 80 a0 60 00 cmp %g1, 0 200830c: 22 80 00 04 be,a 200831c 2008310: c2 06 20 08 ld [ %i0 + 8 ], %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); 2008314: 10 80 00 0b b 2008340 2008318: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 200831c: 80 a0 60 00 cmp %g1, 0 2008320: 06 80 00 08 bl 2008340 2008324: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2008328: 7f ff ef c3 call 2004234 200832c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008330: b0 92 20 00 orcc %o0, 0, %i0 2008334: 32 80 00 09 bne,a 2008358 <== ALWAYS TAKEN 2008338: fa 26 20 14 st %i5, [ %i0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 200833c: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED 2008340: 82 10 3f ff mov -1, %g1 2008344: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 2008348: 40 00 26 78 call 2011d28 <__errno> 200834c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 2008350: 10 80 00 06 b 2008368 2008354: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; 2008358: 82 10 20 01 mov 1, %g1 200835c: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 2008360: 7f ff ff 5b call 20080cc 2008364: 81 e8 00 00 restore } 2008368: 81 c7 e0 08 ret 200836c: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 02008378 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2008378: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 200837c: d0 06 00 00 ld [ %i0 ], %o0 2008380: 40 00 18 24 call 200e410 2008384: 92 10 20 03 mov 3, %o1 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2008388: 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))) 200838c: 90 0a 20 03 and %o0, 3, %o0 2008390: 90 02 3f ff add %o0, -1, %o0 2008394: 80 a2 20 01 cmp %o0, 1 2008398: 18 80 00 11 bgu 20083dc 200839c: 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) 20083a0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20083a4: 80 a0 60 00 cmp %g1, 0 20083a8: 22 80 00 04 be,a 20083b8 20083ac: c2 06 20 08 ld [ %i0 + 8 ], %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); 20083b0: 10 80 00 0b b 20083dc 20083b4: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20083b8: 80 a0 60 00 cmp %g1, 0 20083bc: 06 80 00 08 bl 20083dc 20083c0: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20083c4: 7f ff ef 9c call 2004234 20083c8: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20083cc: b0 92 20 00 orcc %o0, 0, %i0 20083d0: 32 80 00 09 bne,a 20083f4 <== ALWAYS TAKEN 20083d4: fa 26 20 14 st %i5, [ %i0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20083d8: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED 20083dc: 82 10 3f ff mov -1, %g1 20083e0: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 20083e4: 40 00 26 51 call 2011d28 <__errno> 20083e8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20083ec: 10 80 00 06 b 2008404 20083f0: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; 20083f4: 82 10 20 02 mov 2, %g1 20083f8: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 20083fc: 7f ff ff 34 call 20080cc 2008400: 81 e8 00 00 restore } 2008404: 81 c7 e0 08 ret 2008408: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 02007560 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2007560: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2007564: 80 a6 60 00 cmp %i1, 0 2007568: 02 80 00 24 be 20075f8 200756c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2007570: 12 80 00 14 bne 20075c0 2007574: 80 a6 20 04 cmp %i0, 4 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007578: 40 00 08 19 call 20095dc <_TOD_Get_as_timestamp> 200757c: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007580: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007584: 94 10 20 00 clr %o2 2007588: 90 10 00 1c mov %i4, %o0 200758c: 92 10 00 1d mov %i5, %o1 2007590: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007594: 40 00 53 b5 call 201c468 <__divdi3> 2007598: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 200759c: 90 10 00 1c mov %i4, %o0 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20075a0: d2 26 40 00 st %o1, [ %i1 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20075a4: 94 10 20 00 clr %o2 20075a8: 92 10 00 1d mov %i5, %o1 20075ac: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20075b0: 40 00 54 99 call 201c814 <__moddi3> 20075b4: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 20075b8: 10 80 00 06 b 20075d0 20075bc: d2 26 60 04 st %o1, [ %i1 + 4 ] _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 20075c0: 12 80 00 06 bne 20075d8 <== ALWAYS TAKEN 20075c4: 80 a6 20 02 cmp %i0, 2 _TOD_Get_uptime_as_timespec( tp ); 20075c8: 40 00 08 18 call 2009628 <_TOD_Get_uptime_as_timespec> 20075cc: 90 10 00 19 mov %i1, %o0 return 0; 20075d0: 81 c7 e0 08 ret 20075d4: 91 e8 20 00 restore %g0, 0, %o0 } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 20075d8: 02 bf ff fc be 20075c8 20075dc: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 20075e0: 12 80 00 06 bne 20075f8 20075e4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 20075e8: 40 00 25 41 call 2010aec <__errno> 20075ec: 01 00 00 00 nop 20075f0: 10 80 00 05 b 2007604 20075f4: 82 10 20 58 mov 0x58, %g1 ! 58 #endif rtems_set_errno_and_return_minus_one( EINVAL ); 20075f8: 40 00 25 3d call 2010aec <__errno> 20075fc: 01 00 00 00 nop 2007600: 82 10 20 16 mov 0x16, %g1 ! 16 2007604: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2007608: 81 c7 e0 08 ret 200760c: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 02029a8c : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2029a8c: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2029a90: 80 a6 60 00 cmp %i1, 0 2029a94: 02 80 00 4c be 2029bc4 <== NEVER TAKEN 2029a98: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2029a9c: 12 80 00 42 bne 2029ba4 2029aa0: 80 a6 20 02 cmp %i0, 2 if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2029aa4: c4 06 40 00 ld [ %i1 ], %g2 2029aa8: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2029aac: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2029ab0: 80 a0 80 01 cmp %g2, %g1 2029ab4: 08 80 00 44 bleu 2029bc4 2029ab8: 03 00 81 bd sethi %hi(0x206f400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2029abc: c4 00 63 80 ld [ %g1 + 0x380 ], %g2 ! 206f780 <_Thread_Dispatch_disable_level> 2029ac0: 84 00 a0 01 inc %g2 2029ac4: c4 20 63 80 st %g2, [ %g1 + 0x380 ] return _Thread_Dispatch_disable_level; 2029ac8: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2029acc: c6 06 40 00 ld [ %i1 ], %g3 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2029ad0: 90 07 bf f8 add %fp, -8, %o0 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2029ad4: 85 38 e0 1f sra %g3, 0x1f, %g2 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2029ad8: 83 28 a0 03 sll %g2, 3, %g1 2029adc: bb 28 e0 03 sll %g3, 3, %i5 2029ae0: 89 30 e0 1d srl %g3, 0x1d, %g4 2029ae4: b7 2f 60 05 sll %i5, 5, %i3 2029ae8: b8 11 00 01 or %g4, %g1, %i4 2029aec: 83 37 60 1b srl %i5, 0x1b, %g1 2029af0: b5 2f 20 05 sll %i4, 5, %i2 2029af4: ba a6 c0 1d subcc %i3, %i5, %i5 2029af8: b4 10 40 1a or %g1, %i2, %i2 2029afc: b7 2f 60 06 sll %i5, 6, %i3 2029b00: b8 66 80 1c subx %i2, %i4, %i4 2029b04: 83 37 60 1a srl %i5, 0x1a, %g1 2029b08: b6 a6 c0 1d subcc %i3, %i5, %i3 2029b0c: b5 2f 20 06 sll %i4, 6, %i2 2029b10: b4 10 40 1a or %g1, %i2, %i2 2029b14: b4 66 80 1c subx %i2, %i4, %i2 2029b18: 86 86 c0 03 addcc %i3, %g3, %g3 2029b1c: 83 30 e0 1e srl %g3, 0x1e, %g1 2029b20: b7 28 e0 02 sll %g3, 2, %i3 2029b24: 84 46 80 02 addx %i2, %g2, %g2 2029b28: 86 80 c0 1b addcc %g3, %i3, %g3 2029b2c: b5 28 a0 02 sll %g2, 2, %i2 2029b30: b7 28 e0 02 sll %g3, 2, %i3 2029b34: b4 10 40 1a or %g1, %i2, %i2 2029b38: 83 30 e0 1e srl %g3, 0x1e, %g1 2029b3c: 84 40 80 1a addx %g2, %i2, %g2 2029b40: b6 80 c0 1b addcc %g3, %i3, %i3 2029b44: bb 2e e0 02 sll %i3, 2, %i5 2029b48: b5 28 a0 02 sll %g2, 2, %i2 2029b4c: b4 10 40 1a or %g1, %i2, %i2 2029b50: 83 36 e0 1e srl %i3, 0x1e, %g1 2029b54: b4 40 80 1a addx %g2, %i2, %i2 2029b58: 86 86 c0 1d addcc %i3, %i5, %g3 2029b5c: b9 2e a0 02 sll %i2, 2, %i4 2029b60: bb 30 e0 17 srl %g3, 0x17, %i5 2029b64: b8 10 40 1c or %g1, %i4, %i4 2029b68: 84 46 80 1c addx %i2, %i4, %g2 2029b6c: 89 28 a0 09 sll %g2, 9, %g4 2029b70: 84 17 40 04 or %i5, %g4, %g2 2029b74: fa 06 60 04 ld [ %i1 + 4 ], %i5 2029b78: 83 28 e0 09 sll %g3, 9, %g1 2029b7c: b9 3f 60 1f sra %i5, 0x1f, %i4 2029b80: 86 80 40 1d addcc %g1, %i5, %g3 2029b84: 84 40 80 1c addx %g2, %i4, %g2 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 2029b88: b0 10 20 00 clr %i0 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2029b8c: 40 00 06 30 call 202b44c <_TOD_Set_with_timestamp> 2029b90: c4 3f bf f8 std %g2, [ %fp + -8 ] if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); 2029b94: 7f ff 99 6a call 201013c <_Thread_Enable_dispatch> 2029b98: 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; 2029b9c: 81 c7 e0 08 ret 2029ba0: 81 e8 00 00 restore _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) 2029ba4: 02 80 00 04 be 2029bb4 2029ba8: 80 a6 20 03 cmp %i0, 3 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2029bac: 12 80 00 06 bne 2029bc4 2029bb0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2029bb4: 40 00 61 8e call 20421ec <__errno> 2029bb8: 01 00 00 00 nop 2029bbc: 10 80 00 05 b 2029bd0 2029bc0: 82 10 20 58 mov 0x58, %g1 ! 58 #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2029bc4: 40 00 61 8a call 20421ec <__errno> 2029bc8: 01 00 00 00 nop 2029bcc: 82 10 20 16 mov 0x16, %g1 ! 16 2029bd0: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2029bd4: 81 c7 e0 08 ret 2029bd8: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0201a338 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201a338: 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() ) 201a33c: 7f ff ff 68 call 201a0dc 201a340: 01 00 00 00 nop 201a344: 80 a6 00 08 cmp %i0, %o0 201a348: 02 80 00 06 be 201a360 201a34c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 201a350: 7f ff d5 b0 call 200fa10 <__errno> 201a354: 01 00 00 00 nop 201a358: 10 80 00 a4 b 201a5e8 201a35c: 82 10 20 03 mov 3, %g1 ! 3 /* * Validate the signal passed. */ if ( !sig ) 201a360: 32 80 00 03 bne,a 201a36c 201a364: ba 06 7f ff add %i1, -1, %i5 201a368: 30 80 00 04 b,a 201a378 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a36c: 80 a7 60 1f cmp %i5, 0x1f 201a370: 28 80 00 06 bleu,a 201a388 201a374: 83 2e 60 02 sll %i1, 2, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 201a378: 7f ff d5 a6 call 200fa10 <__errno> 201a37c: 01 00 00 00 nop 201a380: 10 80 00 9a b 201a5e8 201a384: 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 ) 201a388: 85 2e 60 04 sll %i1, 4, %g2 201a38c: 84 20 80 01 sub %g2, %g1, %g2 201a390: 03 00 80 78 sethi %hi(0x201e000), %g1 201a394: 82 10 60 70 or %g1, 0x70, %g1 ! 201e070 <_POSIX_signals_Vectors> 201a398: 82 00 40 02 add %g1, %g2, %g1 201a39c: c2 00 60 08 ld [ %g1 + 8 ], %g1 201a3a0: 80 a0 60 01 cmp %g1, 1 201a3a4: 02 80 00 9d be 201a618 201a3a8: 80 a6 60 04 cmp %i1, 4 /* * 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 ) ) 201a3ac: 02 80 00 06 be 201a3c4 201a3b0: 80 a6 60 08 cmp %i1, 8 201a3b4: 02 80 00 04 be 201a3c4 201a3b8: 80 a6 60 0b cmp %i1, 0xb 201a3bc: 12 80 00 08 bne 201a3dc 201a3c0: 82 10 20 01 mov 1, %g1 return pthread_kill( pthread_self(), sig ); 201a3c4: 40 00 01 2d call 201a878 201a3c8: 01 00 00 00 nop 201a3cc: 40 00 00 f2 call 201a794 201a3d0: 92 10 00 19 mov %i1, %o1 201a3d4: 81 c7 e0 08 ret 201a3d8: 91 e8 00 08 restore %g0, %o0, %o0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201a3dc: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201a3e0: c2 27 bf f8 st %g1, [ %fp + -8 ] if ( !value ) { 201a3e4: 80 a6 a0 00 cmp %i2, 0 201a3e8: 12 80 00 04 bne 201a3f8 201a3ec: bb 28 40 1d sll %g1, %i5, %i5 siginfo->si_value.sival_int = 0; 201a3f0: 10 80 00 04 b 201a400 201a3f4: c0 27 bf fc clr [ %fp + -4 ] } else { siginfo->si_value = *value; 201a3f8: c2 06 80 00 ld [ %i2 ], %g1 201a3fc: c2 27 bf fc st %g1, [ %fp + -4 ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 201a400: 03 00 80 76 sethi %hi(0x201d800), %g1 201a404: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 201dae0 <_Thread_Dispatch_disable_level> 201a408: 84 00 a0 01 inc %g2 201a40c: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] return _Thread_Dispatch_disable_level; 201a410: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 /* * Is the currently executing thread interested? If so then it will * get it an execute it as soon as the dispatcher executes. */ the_thread = _Thread_Executing; 201a414: 03 00 80 78 sethi %hi(0x201e000), %g1 201a418: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 ! 201e01c <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201a41c: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 201a420: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 201a424: 80 af 40 02 andncc %i5, %g2, %g0 201a428: 12 80 00 52 bne 201a570 201a42c: 03 00 80 78 sethi %hi(0x201e000), %g1 /* 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 ); 201a430: 05 00 80 78 sethi %hi(0x201e000), %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201a434: c2 00 61 fc ld [ %g1 + 0x1fc ], %g1 201a438: 10 80 00 0a b 201a460 201a43c: 84 10 a2 00 or %g2, 0x200, %g2 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201a440: 80 8f 40 04 btst %i5, %g4 201a444: 12 80 00 4a bne 201a56c 201a448: c6 00 61 5c ld [ %g1 + 0x15c ], %g3 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201a44c: c6 00 e0 d0 ld [ %g3 + 0xd0 ], %g3 201a450: 80 af 40 03 andncc %i5, %g3, %g0 201a454: 12 80 00 47 bne 201a570 201a458: 90 10 00 01 mov %g1, %o0 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 ) { 201a45c: c2 00 40 00 ld [ %g1 ], %g1 /* 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 ); 201a460: 80 a0 40 02 cmp %g1, %g2 201a464: 32 bf ff f7 bne,a 201a440 201a468: c8 00 60 30 ld [ %g1 + 0x30 ], %g4 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a46c: 03 00 80 73 sethi %hi(0x201cc00), %g1 201a470: c6 08 61 38 ldub [ %g1 + 0x138 ], %g3 ! 201cd38 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201a474: b8 10 20 02 mov 2, %i4 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a478: 86 00 e0 01 inc %g3 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201a47c: 82 10 20 00 clr %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 ] ) 201a480: 1b 00 80 76 sethi %hi(0x201d800), %o5 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 201a484: 35 04 00 00 sethi %hi(0x10000000), %i2 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201a488: 85 2f 20 02 sll %i4, 2, %g2 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 ] ) 201a48c: 88 13 62 44 or %o5, 0x244, %g4 201a490: c4 01 00 02 ld [ %g4 + %g2 ], %g2 201a494: 80 a0 a0 00 cmp %g2, 0 201a498: 22 80 00 2f be,a 201a554 <== NEVER TAKEN 201a49c: b8 07 20 01 inc %i4 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201a4a0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a4a4: b6 10 20 01 mov 1, %i3 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201a4a8: d8 10 a0 10 lduh [ %g2 + 0x10 ], %o4 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a4ac: 10 80 00 26 b 201a544 201a4b0: d6 00 a0 1c ld [ %g2 + 0x1c ], %o3 the_thread = (Thread_Control *) object_table[ index ]; 201a4b4: c4 02 c0 02 ld [ %o3 + %g2 ], %g2 if ( !the_thread ) 201a4b8: 80 a0 a0 00 cmp %g2, 0 201a4bc: 22 80 00 22 be,a 201a544 201a4c0: b6 06 e0 01 inc %i3 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201a4c4: c8 00 a0 14 ld [ %g2 + 0x14 ], %g4 201a4c8: 80 a1 00 03 cmp %g4, %g3 201a4cc: 38 80 00 1e bgu,a 201a544 201a4d0: b6 06 e0 01 inc %i3 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201a4d4: f0 00 a1 5c ld [ %g2 + 0x15c ], %i0 201a4d8: f0 06 20 d0 ld [ %i0 + 0xd0 ], %i0 201a4dc: 80 af 40 18 andncc %i5, %i0, %g0 201a4e0: 22 80 00 19 be,a 201a544 201a4e4: b6 06 e0 01 inc %i3 * * 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 ) { 201a4e8: 80 a1 00 03 cmp %g4, %g3 201a4ec: 2a 80 00 14 bcs,a 201a53c 201a4f0: 86 10 00 04 mov %g4, %g3 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201a4f4: 80 a0 60 00 cmp %g1, 0 201a4f8: 22 80 00 13 be,a 201a544 <== NEVER TAKEN 201a4fc: b6 06 e0 01 inc %i3 <== NOT EXECUTED 201a500: de 00 60 10 ld [ %g1 + 0x10 ], %o7 201a504: 80 a3 e0 00 cmp %o7, 0 201a508: 22 80 00 0f be,a 201a544 <== NEVER TAKEN 201a50c: b6 06 e0 01 inc %i3 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201a510: f0 00 a0 10 ld [ %g2 + 0x10 ], %i0 201a514: 80 a6 20 00 cmp %i0, 0 201a518: 22 80 00 09 be,a 201a53c 201a51c: 86 10 00 04 mov %g4, %g3 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201a520: 80 8b c0 1a btst %o7, %i2 201a524: 32 80 00 08 bne,a 201a544 201a528: b6 06 e0 01 inc %i3 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201a52c: 80 8e 00 1a btst %i0, %i2 201a530: 22 80 00 05 be,a 201a544 201a534: b6 06 e0 01 inc %i3 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201a538: 86 10 00 04 mov %g4, %g3 201a53c: 82 10 00 02 mov %g2, %g1 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a540: b6 06 e0 01 inc %i3 201a544: 80 a6 c0 0c cmp %i3, %o4 201a548: 08 bf ff db bleu 201a4b4 201a54c: 85 2e e0 02 sll %i3, 2, %g2 * + 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++) { 201a550: b8 07 20 01 inc %i4 201a554: 80 a7 20 04 cmp %i4, 4 201a558: 12 bf ff cd bne 201a48c 201a55c: 85 2f 20 02 sll %i4, 2, %g2 } } } } if ( interested ) { 201a560: 80 a0 60 00 cmp %g1, 0 201a564: 02 80 00 0c be 201a594 201a568: 01 00 00 00 nop /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201a56c: 90 10 00 01 mov %g1, %o0 /* * 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 ) ) { 201a570: 92 10 00 19 mov %i1, %o1 201a574: 40 00 00 36 call 201a64c <_POSIX_signals_Unblock_thread> 201a578: 94 07 bf f4 add %fp, -12, %o2 201a57c: 80 8a 20 ff btst 0xff, %o0 201a580: 02 80 00 05 be 201a594 201a584: 01 00 00 00 nop _Thread_Enable_dispatch(); 201a588: 7f ff bf 08 call 200a1a8 <_Thread_Enable_dispatch> 201a58c: b0 10 20 00 clr %i0 ! 0 201a590: 30 80 00 23 b,a 201a61c /* * 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 ); 201a594: 40 00 00 24 call 201a624 <_POSIX_signals_Set_process_signals> 201a598: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201a59c: 83 2e 60 02 sll %i1, 2, %g1 201a5a0: b3 2e 60 04 sll %i1, 4, %i1 201a5a4: b2 26 40 01 sub %i1, %g1, %i1 201a5a8: 03 00 80 78 sethi %hi(0x201e000), %g1 201a5ac: 82 10 60 70 or %g1, 0x70, %g1 ! 201e070 <_POSIX_signals_Vectors> 201a5b0: c2 00 40 19 ld [ %g1 + %i1 ], %g1 201a5b4: 80 a0 60 02 cmp %g1, 2 201a5b8: 12 bf ff f4 bne 201a588 201a5bc: 11 00 80 78 sethi %hi(0x201e000), %o0 psiginfo = (POSIX_signals_Siginfo_node *) 201a5c0: 7f ff b7 71 call 2008384 <_Chain_Get> 201a5c4: 90 12 21 f0 or %o0, 0x1f0, %o0 ! 201e1f0 <_POSIX_signals_Inactive_siginfo> _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201a5c8: ba 92 20 00 orcc %o0, 0, %i5 201a5cc: 12 80 00 0a bne 201a5f4 201a5d0: 92 07 bf f4 add %fp, -12, %o1 _Thread_Enable_dispatch(); 201a5d4: 7f ff be f5 call 200a1a8 <_Thread_Enable_dispatch> 201a5d8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 201a5dc: 7f ff d5 0d call 200fa10 <__errno> 201a5e0: 01 00 00 00 nop 201a5e4: 82 10 20 0b mov 0xb, %g1 ! b 201a5e8: c2 22 00 00 st %g1, [ %o0 ] 201a5ec: 81 c7 e0 08 ret 201a5f0: 91 e8 3f ff restore %g0, -1, %o0 } psiginfo->Info = *siginfo; 201a5f4: 90 07 60 08 add %i5, 8, %o0 201a5f8: 7f ff d7 4d call 201032c 201a5fc: 94 10 20 0c mov 0xc, %o2 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a600: 11 00 80 78 sethi %hi(0x201e000), %o0 201a604: 92 10 00 1d mov %i5, %o1 201a608: 90 12 22 68 or %o0, 0x268, %o0 201a60c: 7f ff b7 52 call 2008354 <_Chain_Append> 201a610: 90 02 00 19 add %o0, %i1, %o0 201a614: 30 bf ff dd b,a 201a588 /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) return 0; 201a618: b0 10 20 00 clr %i0 } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); return 0; } 201a61c: 81 c7 e0 08 ret 201a620: 81 e8 00 00 restore =============================================================================== 0200c3e0 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200c3e0: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200c3e4: 80 a0 60 00 cmp %g1, 0 200c3e8: 02 80 00 0f be 200c424 200c3ec: 90 10 20 16 mov 0x16, %o0 200c3f0: c4 00 40 00 ld [ %g1 ], %g2 200c3f4: 80 a0 a0 00 cmp %g2, 0 200c3f8: 02 80 00 0b be 200c424 200c3fc: 80 a2 60 04 cmp %o1, 4 return EINVAL; switch ( policy ) { 200c400: 38 80 00 09 bgu,a 200c424 200c404: 90 10 20 86 mov 0x86, %o0 200c408: 84 10 20 01 mov 1, %g2 200c40c: 85 28 80 09 sll %g2, %o1, %g2 200c410: 80 88 a0 17 btst 0x17, %g2 200c414: 22 80 00 04 be,a 200c424 <== NEVER TAKEN 200c418: 90 10 20 86 mov 0x86, %o0 <== NOT EXECUTED case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200c41c: d2 20 60 14 st %o1, [ %g1 + 0x14 ] 200c420: 90 10 20 00 clr %o0 return 0; default: return ENOTSUP; } } 200c424: 81 c3 e0 08 retl =============================================================================== 02007b34 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2007b34: 9d e3 bf 90 save %sp, -112, %sp const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2007b38: 80 a6 20 00 cmp %i0, 0 2007b3c: 12 80 00 04 bne 2007b4c 2007b40: 80 a6 a0 00 cmp %i2, 0 switch ( the_attr->process_shared ) { case PTHREAD_PROCESS_PRIVATE: /* only supported values */ break; case PTHREAD_PROCESS_SHARED: default: return EINVAL; 2007b44: 81 c7 e0 08 ret 2007b48: 91 e8 20 16 restore %g0, 0x16, %o0 * Error check parameters */ if ( !barrier ) return EINVAL; if ( count == 0 ) 2007b4c: 22 80 00 1f be,a 2007bc8 2007b50: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007b54: 80 a6 60 00 cmp %i1, 0 2007b58: 32 80 00 06 bne,a 2007b70 2007b5c: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 2007b60: 90 07 bf f8 add %fp, -8, %o0 2007b64: 7f ff ff bc call 2007a54 2007b68: 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 ) 2007b6c: c2 06 40 00 ld [ %i1 ], %g1 2007b70: 80 a0 60 00 cmp %g1, 0 2007b74: 22 80 00 15 be,a 2007bc8 2007b78: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2007b7c: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007b80: 80 a0 60 00 cmp %g1, 0 2007b84: 32 80 00 11 bne,a 2007bc8 <== NEVER TAKEN 2007b88: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007b8c: 03 00 80 7c sethi %hi(0x201f000), %g1 2007b90: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 201f0f0 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2007b94: c0 27 bf f0 clr [ %fp + -16 ] the_attributes.maximum_count = count; 2007b98: f4 27 bf f4 st %i2, [ %fp + -12 ] 2007b9c: 84 00 a0 01 inc %g2 2007ba0: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ] return _Thread_Dispatch_disable_level; 2007ba4: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1 * This function allocates a barrier control block from * the inactive chain of free barrier control blocks. */ RTEMS_INLINE_ROUTINE POSIX_Barrier_Control *_POSIX_Barrier_Allocate( void ) { return (POSIX_Barrier_Control *) 2007ba8: 39 00 80 7d sethi %hi(0x201f400), %i4 2007bac: 40 00 08 67 call 2009d48 <_Objects_Allocate> 2007bb0: 90 17 20 a0 or %i4, 0xa0, %o0 ! 201f4a0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2007bb4: ba 92 20 00 orcc %o0, 0, %i5 2007bb8: 12 80 00 06 bne 2007bd0 2007bbc: 90 07 60 10 add %i5, 0x10, %o0 _Thread_Enable_dispatch(); 2007bc0: 40 00 0d 4c call 200b0f0 <_Thread_Enable_dispatch> 2007bc4: b0 10 20 0b mov 0xb, %i0 2007bc8: 81 c7 e0 08 ret 2007bcc: 81 e8 00 00 restore return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2007bd0: 40 00 05 d9 call 2009334 <_CORE_barrier_Initialize> 2007bd4: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007bd8: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007bdc: b8 17 20 a0 or %i4, 0xa0, %i4 2007be0: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007be4: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007be8: 85 28 a0 02 sll %g2, 2, %g2 2007bec: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2007bf0: c0 27 60 0c clr [ %i5 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 2007bf4: c2 26 00 00 st %g1, [ %i0 ] _Thread_Enable_dispatch(); 2007bf8: 40 00 0d 3e call 200b0f0 <_Thread_Enable_dispatch> 2007bfc: b0 10 20 00 clr %i0 2007c00: 81 c7 e0 08 ret 2007c04: 81 e8 00 00 restore =============================================================================== 02007424 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2007424: 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 ) 2007428: 80 a6 20 00 cmp %i0, 0 200742c: 02 80 00 13 be 2007478 2007430: 03 00 80 7a sethi %hi(0x201e800), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007434: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201e950 <_Thread_Dispatch_disable_level> 2007438: 84 00 a0 01 inc %g2 200743c: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2007440: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2007444: 40 00 11 d5 call 200bb98 <_Workspace_Allocate> 2007448: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 200744c: 92 92 20 00 orcc %o0, 0, %o1 2007450: 02 80 00 08 be 2007470 <== NEVER TAKEN 2007454: 03 00 80 7b sethi %hi(0x201ec00), %g1 thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2007458: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ee8c <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; 200745c: d0 00 61 5c ld [ %g1 + 0x15c ], %o0 handler->routine = routine; 2007460: f0 22 60 08 st %i0, [ %o1 + 8 ] handler->arg = arg; 2007464: f2 22 60 0c st %i1, [ %o1 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2007468: 40 00 06 21 call 2008cec <_Chain_Append> 200746c: 90 02 20 e4 add %o0, 0xe4, %o0 } _Thread_Enable_dispatch(); 2007470: 40 00 0d 8a call 200aa98 <_Thread_Enable_dispatch> 2007474: 81 e8 00 00 restore 2007478: 81 c7 e0 08 ret 200747c: 81 e8 00 00 restore =============================================================================== 020083fc : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 20083fc: 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; 2008400: 80 a6 60 00 cmp %i1, 0 2008404: 32 80 00 05 bne,a 2008418 2008408: c4 06 60 04 ld [ %i1 + 4 ], %g2 else the_attr = &_POSIX_Condition_variables_Default_attributes; 200840c: 33 00 80 78 sethi %hi(0x201e000), %i1 2008410: b2 16 60 84 or %i1, 0x84, %i1 ! 201e084 <_POSIX_Condition_variables_Default_attributes> /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2008414: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008418: 80 a0 a0 01 cmp %g2, 1 200841c: 02 80 00 26 be 20084b4 <== NEVER TAKEN 2008420: 82 10 20 16 mov 0x16, %g1 return EINVAL; if ( !the_attr->is_initialized ) 2008424: c4 06 40 00 ld [ %i1 ], %g2 2008428: 80 a0 a0 00 cmp %g2, 0 200842c: 02 80 00 22 be 20084b4 2008430: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008434: 03 00 80 80 sethi %hi(0x2020000), %g1 2008438: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2020360 <_Thread_Dispatch_disable_level> 200843c: 84 00 a0 01 inc %g2 2008440: c4 20 63 60 st %g2, [ %g1 + 0x360 ] return _Thread_Dispatch_disable_level; 2008444: c2 00 63 60 ld [ %g1 + 0x360 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2008448: 39 00 80 81 sethi %hi(0x2020400), %i4 200844c: 40 00 0a 10 call 200ac8c <_Objects_Allocate> 2008450: 90 17 23 a8 or %i4, 0x3a8, %o0 ! 20207a8 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2008454: ba 92 20 00 orcc %o0, 0, %i5 2008458: 32 80 00 06 bne,a 2008470 200845c: c2 06 60 04 ld [ %i1 + 4 ], %g1 _Thread_Enable_dispatch(); 2008460: 40 00 0e f5 call 200c034 <_Thread_Enable_dispatch> 2008464: 01 00 00 00 nop return ENOMEM; 2008468: 10 80 00 13 b 20084b4 200846c: 82 10 20 0c mov 0xc, %g1 ! c the_cond->process_shared = the_attr->process_shared; the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2008470: 90 07 60 18 add %i5, 0x18, %o0 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2008474: c2 27 60 10 st %g1, [ %i5 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2008478: 92 10 20 00 clr %o1 200847c: 15 04 00 02 sethi %hi(0x10000800), %o2 2008480: 96 10 20 74 mov 0x74, %o3 2008484: 40 00 10 f0 call 200c844 <_Thread_queue_Initialize> 2008488: c0 27 60 14 clr [ %i5 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200848c: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008490: b8 17 23 a8 or %i4, 0x3a8, %i4 2008494: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008498: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200849c: 85 28 a0 02 sll %g2, 2, %g2 20084a0: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 20084a4: c0 27 60 0c clr [ %i5 + 0xc ] 0 ); *cond = the_cond->Object.id; _Thread_Enable_dispatch(); 20084a8: 40 00 0e e3 call 200c034 <_Thread_Enable_dispatch> 20084ac: c2 26 00 00 st %g1, [ %i0 ] return 0; 20084b0: 82 10 20 00 clr %g1 } 20084b4: 81 c7 e0 08 ret 20084b8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200825c : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 200825c: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2008260: 80 a0 60 00 cmp %g1, 0 2008264: 02 80 00 08 be 2008284 2008268: 90 10 20 16 mov 0x16, %o0 200826c: c4 00 40 00 ld [ %g1 ], %g2 2008270: 80 a0 a0 00 cmp %g2, 0 2008274: 02 80 00 04 be 2008284 <== NEVER TAKEN 2008278: 01 00 00 00 nop return EINVAL; attr->is_initialized = false; 200827c: c0 20 40 00 clr [ %g1 ] return 0; 2008280: 90 10 20 00 clr %o0 } 2008284: 81 c3 e0 08 retl =============================================================================== 020077fc : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 20077fc: 9d e3 bf 58 save %sp, -168, %sp int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2007800: 80 a6 a0 00 cmp %i2, 0 2007804: 02 80 00 8c be 2007a34 2007808: ba 10 20 0e mov 0xe, %i5 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 200780c: 80 a6 60 00 cmp %i1, 0 2007810: 32 80 00 05 bne,a 2007824 2007814: c2 06 40 00 ld [ %i1 ], %g1 2007818: 33 00 80 81 sethi %hi(0x2020400), %i1 200781c: b2 16 60 fc or %i1, 0xfc, %i1 ! 20204fc <_POSIX_Threads_Default_attributes> if ( !the_attr->is_initialized ) 2007820: c2 06 40 00 ld [ %i1 ], %g1 2007824: 80 a0 60 00 cmp %g1, 0 2007828: 02 80 00 83 be 2007a34 200782c: ba 10 20 16 mov 0x16, %i5 * 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) ) 2007830: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007834: 80 a0 60 00 cmp %g1, 0 2007838: 02 80 00 07 be 2007854 200783c: 03 00 80 86 sethi %hi(0x2021800), %g1 2007840: c4 06 60 08 ld [ %i1 + 8 ], %g2 2007844: c2 00 62 4c ld [ %g1 + 0x24c ], %g1 2007848: 80 a0 80 01 cmp %g2, %g1 200784c: 2a 80 00 7b bcs,a 2007a38 2007850: b0 10 00 1d mov %i5, %i0 * 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 ) { 2007854: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2007858: 80 a0 60 01 cmp %g1, 1 200785c: 02 80 00 06 be 2007874 2007860: 80 a0 60 02 cmp %g1, 2 2007864: 32 80 00 74 bne,a 2007a34 2007868: ba 10 20 16 mov 0x16, %i5 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 200786c: 10 80 00 09 b 2007890 2007870: e2 06 60 14 ld [ %i1 + 0x14 ], %l1 * 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 ]; 2007874: 03 00 80 8b sethi %hi(0x2022c00), %g1 2007878: c2 00 61 1c ld [ %g1 + 0x11c ], %g1 ! 2022d1c <_Per_CPU_Information+0xc> schedpolicy = api->schedpolicy; schedparam = api->schedparam; 200787c: 90 07 bf e4 add %fp, -28, %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 ]; 2007880: d2 00 61 5c ld [ %g1 + 0x15c ], %o1 schedpolicy = api->schedpolicy; 2007884: e2 02 60 84 ld [ %o1 + 0x84 ], %l1 schedparam = api->schedparam; 2007888: 10 80 00 04 b 2007898 200788c: 92 02 60 88 add %o1, 0x88, %o1 break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2007890: 90 07 bf e4 add %fp, -28, %o0 2007894: 92 06 60 18 add %i1, 0x18, %o1 2007898: 40 00 25 77 call 2010e74 200789c: 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 ) 20078a0: c2 06 60 0c ld [ %i1 + 0xc ], %g1 20078a4: 80 a0 60 00 cmp %g1, 0 20078a8: 12 80 00 63 bne 2007a34 20078ac: ba 10 20 86 mov 0x86, %i5 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 20078b0: 40 00 18 e7 call 200dc4c <_POSIX_Priority_Is_valid> 20078b4: d0 07 bf e4 ld [ %fp + -28 ], %o0 20078b8: 80 8a 20 ff btst 0xff, %o0 20078bc: 02 80 00 5e be 2007a34 <== NEVER TAKEN 20078c0: ba 10 20 16 mov 0x16, %i5 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 20078c4: 03 00 80 86 sethi %hi(0x2021800), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 20078c8: e4 07 bf e4 ld [ %fp + -28 ], %l2 20078cc: e6 08 62 48 ldub [ %g1 + 0x248 ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 20078d0: 90 10 00 11 mov %l1, %o0 20078d4: 92 07 bf e4 add %fp, -28, %o1 20078d8: 94 07 bf dc add %fp, -36, %o2 20078dc: 40 00 18 e7 call 200dc78 <_POSIX_Thread_Translate_sched_param> 20078e0: 96 07 bf e0 add %fp, -32, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 20078e4: ba 92 20 00 orcc %o0, 0, %i5 20078e8: 32 80 00 54 bne,a 2007a38 20078ec: b0 10 00 1d mov %i5, %i0 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 20078f0: 39 00 80 8a sethi %hi(0x2022800), %i4 20078f4: 40 00 06 35 call 20091c8 <_API_Mutex_Lock> 20078f8: d0 07 20 70 ld [ %i4 + 0x70 ], %o0 ! 2022870 <_RTEMS_Allocator_Mutex> * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 20078fc: 11 00 80 8a sethi %hi(0x2022800), %o0 2007900: 40 00 08 d4 call 2009c50 <_Objects_Allocate> 2007904: 90 12 22 10 or %o0, 0x210, %o0 ! 2022a10 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2007908: a0 92 20 00 orcc %o0, 0, %l0 200790c: 32 80 00 04 bne,a 200791c 2007910: c2 06 60 08 ld [ %i1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2007914: 10 80 00 21 b 2007998 2007918: d0 07 20 70 ld [ %i4 + 0x70 ], %o0 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 200791c: 05 00 80 86 sethi %hi(0x2021800), %g2 2007920: d6 00 a2 4c ld [ %g2 + 0x24c ], %o3 ! 2021a4c /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007924: c0 27 bf d4 clr [ %fp + -44 ] 2007928: 97 2a e0 01 sll %o3, 1, %o3 200792c: 80 a2 c0 01 cmp %o3, %g1 2007930: 1a 80 00 03 bcc 200793c 2007934: d4 06 60 04 ld [ %i1 + 4 ], %o2 2007938: 96 10 00 01 mov %g1, %o3 200793c: 82 10 20 01 mov 1, %g1 2007940: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007944: c2 07 bf dc ld [ %fp + -36 ], %g1 2007948: 9a 0c e0 ff and %l3, 0xff, %o5 200794c: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2007950: c2 07 bf e0 ld [ %fp + -32 ], %g1 2007954: c0 23 a0 68 clr [ %sp + 0x68 ] 2007958: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 200795c: 82 07 bf d4 add %fp, -44, %g1 2007960: 39 00 80 8a sethi %hi(0x2022800), %i4 2007964: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2007968: 90 17 22 10 or %i4, 0x210, %o0 200796c: 92 10 00 10 mov %l0, %o1 2007970: 98 10 20 01 mov 1, %o4 2007974: 40 00 0d db call 200b0e0 <_Thread_Initialize> 2007978: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 200797c: 80 8a 20 ff btst 0xff, %o0 2007980: 12 80 00 0a bne 20079a8 2007984: 90 17 22 10 or %i4, 0x210, %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 2007988: 40 00 09 89 call 2009fac <_Objects_Free> 200798c: 92 10 00 10 mov %l0, %o1 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2007990: 03 00 80 8a sethi %hi(0x2022800), %g1 2007994: d0 00 60 70 ld [ %g1 + 0x70 ], %o0 ! 2022870 <_RTEMS_Allocator_Mutex> 2007998: 40 00 06 21 call 200921c <_API_Mutex_Unlock> 200799c: ba 10 20 0b mov 0xb, %i5 */ *thread = the_thread->Object.id; _RTEMS_Unlock_allocator(); return 0; } 20079a0: 81 c7 e0 08 ret 20079a4: 91 e8 00 1d restore %g0, %i5, %o0 } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 20079a8: f8 04 21 5c ld [ %l0 + 0x15c ], %i4 api->Attributes = *the_attr; 20079ac: 92 10 00 19 mov %i1, %o1 20079b0: 94 10 20 40 mov 0x40, %o2 20079b4: 40 00 25 30 call 2010e74 20079b8: 90 10 00 1c mov %i4, %o0 api->detachstate = the_attr->detachstate; 20079bc: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 20079c0: 92 07 bf e4 add %fp, -28, %o1 * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; 20079c4: c2 27 20 40 st %g1, [ %i4 + 0x40 ] api->schedpolicy = schedpolicy; api->schedparam = schedparam; 20079c8: 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; 20079cc: e2 27 20 84 st %l1, [ %i4 + 0x84 ] api->schedparam = schedparam; 20079d0: 40 00 25 29 call 2010e74 20079d4: 90 07 20 88 add %i4, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 20079d8: 90 10 00 10 mov %l0, %o0 20079dc: 92 10 20 01 mov 1, %o1 20079e0: 94 10 00 1a mov %i2, %o2 20079e4: 96 10 00 1b mov %i3, %o3 20079e8: 40 00 10 0a call 200ba10 <_Thread_Start> 20079ec: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 20079f0: 80 a4 60 04 cmp %l1, 4 20079f4: 32 80 00 0a bne,a 2007a1c 20079f8: c2 04 20 08 ld [ %l0 + 8 ], %g1 _Watchdog_Insert_ticks( 20079fc: 40 00 10 2d call 200bab0 <_Timespec_To_ticks> 2007a00: 90 07 20 90 add %i4, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007a04: 92 07 20 a8 add %i4, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007a08: d0 27 20 b4 st %o0, [ %i4 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007a0c: 11 00 80 8a sethi %hi(0x2022800), %o0 2007a10: 40 00 11 06 call 200be28 <_Watchdog_Insert> 2007a14: 90 12 20 88 or %o0, 0x88, %o0 ! 2022888 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2007a18: c2 04 20 08 ld [ %l0 + 8 ], %g1 2007a1c: c2 26 00 00 st %g1, [ %i0 ] _RTEMS_Unlock_allocator(); 2007a20: 03 00 80 8a sethi %hi(0x2022800), %g1 2007a24: 40 00 05 fe call 200921c <_API_Mutex_Unlock> 2007a28: d0 00 60 70 ld [ %g1 + 0x70 ], %o0 ! 2022870 <_RTEMS_Allocator_Mutex> return 0; } 2007a2c: 81 c7 e0 08 ret 2007a30: 91 e8 00 1d restore %g0, %i5, %o0 2007a34: b0 10 00 1d mov %i5, %i0 2007a38: 81 c7 e0 08 ret 2007a3c: 81 e8 00 00 restore =============================================================================== 0201a794 : int pthread_kill( pthread_t thread, int sig ) { 201a794: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201a798: 80 a6 60 00 cmp %i1, 0 201a79c: 32 80 00 03 bne,a 201a7a8 201a7a0: b6 06 7f ff add %i1, -1, %i3 201a7a4: 30 80 00 04 b,a 201a7b4 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a7a8: 80 a6 e0 1f cmp %i3, 0x1f 201a7ac: 28 80 00 06 bleu,a 201a7c4 201a7b0: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); 201a7b4: 7f ff d4 97 call 200fa10 <__errno> 201a7b8: 01 00 00 00 nop 201a7bc: 10 80 00 2c b 201a86c 201a7c0: 82 10 20 16 mov 0x16, %g1 ! 16 the_thread = _Thread_Get( thread, &location ); 201a7c4: 7f ff be 86 call 200a1dc <_Thread_Get> 201a7c8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201a7cc: c2 07 bf fc ld [ %fp + -4 ], %g1 201a7d0: 80 a0 60 00 cmp %g1, 0 201a7d4: 12 80 00 23 bne 201a860 <== NEVER TAKEN 201a7d8: 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 ) { 201a7dc: 85 2e 60 02 sll %i1, 2, %g2 201a7e0: 87 2e 60 04 sll %i1, 4, %g3 201a7e4: 86 20 c0 02 sub %g3, %g2, %g3 201a7e8: 05 00 80 78 sethi %hi(0x201e000), %g2 201a7ec: 84 10 a0 70 or %g2, 0x70, %g2 ! 201e070 <_POSIX_signals_Vectors> 201a7f0: 84 00 80 03 add %g2, %g3, %g2 201a7f4: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201a7f8: 80 a0 a0 01 cmp %g2, 1 201a7fc: 12 80 00 06 bne 201a814 201a800: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 _Thread_Enable_dispatch(); 201a804: 7f ff be 69 call 200a1a8 <_Thread_Enable_dispatch> 201a808: b0 10 20 00 clr %i0 201a80c: 81 c7 e0 08 ret 201a810: 81 e8 00 00 restore return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a814: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201a818: ba 10 20 01 mov 1, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a81c: 92 10 00 19 mov %i1, %o1 201a820: b7 2f 40 1b sll %i5, %i3, %i3 201a824: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a828: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a82c: 7f ff ff 88 call 201a64c <_POSIX_signals_Unblock_thread> 201a830: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a834: 03 00 80 78 sethi %hi(0x201e000), %g1 201a838: 82 10 60 10 or %g1, 0x10, %g1 ! 201e010 <_Per_CPU_Information> 201a83c: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a840: 80 a0 a0 00 cmp %g2, 0 201a844: 02 bf ff f0 be 201a804 201a848: 01 00 00 00 nop 201a84c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a850: 80 a7 00 02 cmp %i4, %g2 201a854: 22 bf ff ec be,a 201a804 201a858: fa 28 60 18 stb %i5, [ %g1 + 0x18 ] 201a85c: 30 bf ff ea b,a 201a804 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201a860: 7f ff d4 6c call 200fa10 <__errno> <== NOT EXECUTED 201a864: 01 00 00 00 nop <== NOT EXECUTED 201a868: 82 10 20 03 mov 3, %g1 ! 3 <== NOT EXECUTED 201a86c: c2 22 00 00 st %g1, [ %o0 ] } 201a870: 81 c7 e0 08 ret 201a874: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 020099e0 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 20099e0: 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 ); 20099e4: 92 07 bf fc add %fp, -4, %o1 20099e8: 40 00 00 37 call 2009ac4 <_POSIX_Absolute_timeout_to_ticks> 20099ec: 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 ); 20099f0: d4 07 bf fc ld [ %fp + -4 ], %o2 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 20099f4: 82 1a 20 03 xor %o0, 3, %g1 20099f8: 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 ); 20099fc: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009a00: b8 60 3f ff subx %g0, -1, %i4 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009a04: 90 10 00 18 mov %i0, %o0 2009a08: 7f ff ff b7 call 20098e4 <_POSIX_Mutex_Lock_support> 2009a0c: 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) ) { 2009a10: 80 a7 20 00 cmp %i4, 0 2009a14: 12 80 00 0c bne 2009a44 2009a18: b0 10 00 08 mov %o0, %i0 2009a1c: 80 a2 20 10 cmp %o0, 0x10 2009a20: 12 80 00 09 bne 2009a44 2009a24: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2009a28: 02 80 00 07 be 2009a44 <== NEVER TAKEN 2009a2c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2009a30: ba 07 7f ff add %i5, -1, %i5 2009a34: 80 a7 60 01 cmp %i5, 1 2009a38: 18 80 00 03 bgu 2009a44 <== NEVER TAKEN 2009a3c: b0 10 20 10 mov 0x10, %i0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 2009a40: b0 10 20 74 mov 0x74, %i0 } return lock_status; } 2009a44: 81 c7 e0 08 ret 2009a48: 81 e8 00 00 restore =============================================================================== 020070e0 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 20070e0: 82 10 00 08 mov %o0, %g1 if ( !attr ) 20070e4: 80 a0 60 00 cmp %g1, 0 20070e8: 02 80 00 0b be 2007114 20070ec: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 20070f0: c4 00 40 00 ld [ %g1 ], %g2 20070f4: 80 a0 a0 00 cmp %g2, 0 20070f8: 02 80 00 07 be 2007114 20070fc: 80 a2 60 00 cmp %o1, 0 return EINVAL; if ( !type ) 2007100: 02 80 00 05 be 2007114 <== NEVER TAKEN 2007104: 01 00 00 00 nop return EINVAL; *type = attr->type; 2007108: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 200710c: 90 10 20 00 clr %o0 return EINVAL; if ( !type ) return EINVAL; *type = attr->type; 2007110: c2 22 40 00 st %g1, [ %o1 ] return 0; } 2007114: 81 c3 e0 08 retl =============================================================================== 02009594 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2009594: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2009598: 80 a0 60 00 cmp %g1, 0 200959c: 02 80 00 0a be 20095c4 20095a0: 90 10 20 16 mov 0x16, %o0 20095a4: c4 00 40 00 ld [ %g1 ], %g2 20095a8: 80 a0 a0 00 cmp %g2, 0 20095ac: 02 80 00 06 be 20095c4 20095b0: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 20095b4: 18 80 00 04 bgu 20095c4 <== NEVER TAKEN 20095b8: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 20095bc: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 20095c0: 90 10 20 00 clr %o0 default: return EINVAL; } } 20095c4: 81 c3 e0 08 retl =============================================================================== 0200714c : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 200714c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007150: 80 a0 60 00 cmp %g1, 0 2007154: 02 80 00 0a be 200717c 2007158: 90 10 20 16 mov 0x16, %o0 200715c: c4 00 40 00 ld [ %g1 ], %g2 2007160: 80 a0 a0 00 cmp %g2, 0 2007164: 02 80 00 06 be 200717c <== NEVER TAKEN 2007168: 80 a2 60 03 cmp %o1, 3 return EINVAL; switch ( type ) { 200716c: 18 80 00 04 bgu 200717c 2007170: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2007174: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; 2007178: 90 10 20 00 clr %o0 default: return EINVAL; } } 200717c: 81 c3 e0 08 retl =============================================================================== 02007e8c : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2007e8c: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2007e90: 80 a6 60 00 cmp %i1, 0 2007e94: 02 80 00 1c be 2007f04 2007e98: ba 10 00 18 mov %i0, %i5 2007e9c: 80 a6 20 00 cmp %i0, 0 2007ea0: 22 80 00 17 be,a 2007efc 2007ea4: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 2007ea8: c2 06 20 04 ld [ %i0 + 4 ], %g1 2007eac: 80 a0 60 00 cmp %g1, 0 2007eb0: 12 80 00 13 bne 2007efc 2007eb4: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2007eb8: 90 10 21 00 mov 0x100, %o0 2007ebc: 92 10 21 00 mov 0x100, %o1 2007ec0: 40 00 03 05 call 2008ad4 2007ec4: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2007ec8: c2 07 60 04 ld [ %i5 + 4 ], %g1 2007ecc: 80 a0 60 00 cmp %g1, 0 2007ed0: 12 80 00 07 bne 2007eec <== NEVER TAKEN 2007ed4: d0 07 bf fc ld [ %fp + -4 ], %o0 once_control->is_initialized = true; 2007ed8: 82 10 20 01 mov 1, %g1 2007edc: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2007ee0: 9f c6 40 00 call %i1 2007ee4: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2007ee8: d0 07 bf fc ld [ %fp + -4 ], %o0 2007eec: 92 10 21 00 mov 0x100, %o1 2007ef0: 94 07 bf fc add %fp, -4, %o2 2007ef4: 40 00 02 f8 call 2008ad4 2007ef8: b0 10 20 00 clr %i0 2007efc: 81 c7 e0 08 ret 2007f00: 81 e8 00 00 restore pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) return EINVAL; 2007f04: b0 10 20 16 mov 0x16, %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2007f08: 81 c7 e0 08 ret 2007f0c: 81 e8 00 00 restore =============================================================================== 02007fb8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 2007fb8: 9d e3 bf 90 save %sp, -112, %sp const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 2007fbc: 80 a6 20 00 cmp %i0, 0 2007fc0: 12 80 00 04 bne 2007fd0 2007fc4: 80 a6 60 00 cmp %i1, 0 switch ( the_attr->process_shared ) { case PTHREAD_PROCESS_PRIVATE: /* only supported values */ break; case PTHREAD_PROCESS_SHARED: default: return EINVAL; 2007fc8: 81 c7 e0 08 ret 2007fcc: 91 e8 20 16 restore %g0, 0x16, %o0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007fd0: 32 80 00 06 bne,a 2007fe8 2007fd4: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 2007fd8: 90 07 bf f8 add %fp, -8, %o0 2007fdc: 40 00 01 b2 call 20086a4 2007fe0: 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 ) 2007fe4: c2 06 40 00 ld [ %i1 ], %g1 2007fe8: 80 a0 60 00 cmp %g1, 0 2007fec: 22 80 00 14 be,a 200803c <== NEVER TAKEN 2007ff0: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED return EINVAL; switch ( the_attr->process_shared ) { 2007ff4: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007ff8: 80 a0 60 00 cmp %g1, 0 2007ffc: 32 80 00 10 bne,a 200803c <== NEVER TAKEN 2008000: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008004: 03 00 80 89 sethi %hi(0x2022400), %g1 2008008: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 20225f0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 200800c: c0 27 bf f4 clr [ %fp + -12 ] 2008010: 84 00 a0 01 inc %g2 2008014: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 2008018: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 * This function allocates a RWLock control block from * the inactive chain of free RWLock control blocks. */ RTEMS_INLINE_ROUTINE POSIX_RWLock_Control *_POSIX_RWLock_Allocate( void ) { return (POSIX_RWLock_Control *) 200801c: 39 00 80 8a sethi %hi(0x2022800), %i4 2008020: 40 00 0a 72 call 200a9e8 <_Objects_Allocate> 2008024: 90 17 20 20 or %i4, 0x20, %o0 ! 2022820 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2008028: ba 92 20 00 orcc %o0, 0, %i5 200802c: 12 80 00 06 bne 2008044 2008030: 90 07 60 10 add %i5, 0x10, %o0 _Thread_Enable_dispatch(); 2008034: 40 00 0f 90 call 200be74 <_Thread_Enable_dispatch> 2008038: b0 10 20 0b mov 0xb, %i0 200803c: 81 c7 e0 08 ret 2008040: 81 e8 00 00 restore return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2008044: 40 00 08 d0 call 200a384 <_CORE_RWLock_Initialize> 2008048: 92 07 bf f4 add %fp, -12, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200804c: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008050: b8 17 20 20 or %i4, 0x20, %i4 2008054: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008058: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200805c: 85 28 a0 02 sll %g2, 2, %g2 2008060: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2008064: c0 27 60 0c clr [ %i5 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2008068: c2 26 00 00 st %g1, [ %i0 ] _Thread_Enable_dispatch(); 200806c: 40 00 0f 82 call 200be74 <_Thread_Enable_dispatch> 2008070: b0 10 20 00 clr %i0 2008074: 81 c7 e0 08 ret 2008078: 81 e8 00 00 restore =============================================================================== 02008954 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008954: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 2008958: 80 a6 20 00 cmp %i0, 0 200895c: 12 80 00 04 bne 200896c 2008960: 92 07 bf fc add %fp, -4, %o1 #endif case OBJECTS_ERROR: break; } return EINVAL; 2008964: 81 c7 e0 08 ret 2008968: 91 e8 20 16 restore %g0, 0x16, %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 ); 200896c: 40 00 19 a6 call 200f004 <_POSIX_Absolute_timeout_to_ticks> 2008970: 90 10 00 19 mov %i1, %o0 2008974: d2 06 00 00 ld [ %i0 ], %o1 2008978: ba 10 00 08 mov %o0, %i5 200897c: 94 07 bf f8 add %fp, -8, %o2 2008980: 11 00 80 83 sethi %hi(0x2020c00), %o0 2008984: 40 00 0b 14 call 200b5d4 <_Objects_Get> 2008988: 90 12 21 e0 or %o0, 0x1e0, %o0 ! 2020de0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 200898c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008990: 80 a0 60 00 cmp %g1, 0 2008994: 32 80 00 21 bne,a 2008a18 2008998: b0 10 20 16 mov 0x16, %i0 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 200899c: d2 06 00 00 ld [ %i0 ], %o1 20089a0: d6 07 bf fc ld [ %fp + -4 ], %o3 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 20089a4: 82 1f 60 03 xor %i5, 3, %g1 the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 20089a8: 90 02 20 10 add %o0, 0x10, %o0 20089ac: 80 a0 00 01 cmp %g0, %g1 20089b0: 98 10 20 00 clr %o4 20089b4: b8 60 3f ff subx %g0, -1, %i4 20089b8: 40 00 07 8a call 200a7e0 <_CORE_RWLock_Obtain_for_reading> 20089bc: 94 10 00 1c mov %i4, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20089c0: 40 00 0e b1 call 200c484 <_Thread_Enable_dispatch> 20089c4: 01 00 00 00 nop if ( !do_wait ) { 20089c8: 80 a7 20 00 cmp %i4, 0 20089cc: 12 80 00 0e bne 2008a04 20089d0: 03 00 80 84 sethi %hi(0x2021000), %g1 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 20089d4: c2 00 61 2c ld [ %g1 + 0x12c ], %g1 ! 202112c <_Per_CPU_Information+0xc> 20089d8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 20089dc: 80 a0 60 02 cmp %g1, 2 20089e0: 32 80 00 0a bne,a 2008a08 20089e4: 03 00 80 84 sethi %hi(0x2021000), %g1 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20089e8: 80 a7 60 00 cmp %i5, 0 20089ec: 22 80 00 0b be,a 2008a18 <== NEVER TAKEN 20089f0: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20089f4: ba 07 7f ff add %i5, -1, %i5 20089f8: 80 a7 60 01 cmp %i5, 1 20089fc: 08 80 00 07 bleu 2008a18 <== ALWAYS TAKEN 2008a00: b0 10 20 74 mov 0x74, %i0 return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 2008a04: 03 00 80 84 sethi %hi(0x2021000), %g1 2008a08: c2 00 61 2c ld [ %g1 + 0x12c ], %g1 ! 202112c <_Per_CPU_Information+0xc> status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008a0c: 40 00 00 38 call 2008aec <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008a10: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2008a14: b0 10 00 08 mov %o0, %i0 case OBJECTS_ERROR: break; } return EINVAL; } 2008a18: 81 c7 e0 08 ret 2008a1c: 81 e8 00 00 restore =============================================================================== 02008a20 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008a20: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 2008a24: 80 a6 20 00 cmp %i0, 0 2008a28: 12 80 00 04 bne 2008a38 2008a2c: 92 07 bf fc add %fp, -4, %o1 #endif case OBJECTS_ERROR: break; } return EINVAL; 2008a30: 81 c7 e0 08 ret 2008a34: 91 e8 20 16 restore %g0, 0x16, %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 ); 2008a38: 40 00 19 73 call 200f004 <_POSIX_Absolute_timeout_to_ticks> 2008a3c: 90 10 00 19 mov %i1, %o0 2008a40: d2 06 00 00 ld [ %i0 ], %o1 2008a44: ba 10 00 08 mov %o0, %i5 2008a48: 94 07 bf f8 add %fp, -8, %o2 2008a4c: 11 00 80 83 sethi %hi(0x2020c00), %o0 2008a50: 40 00 0a e1 call 200b5d4 <_Objects_Get> 2008a54: 90 12 21 e0 or %o0, 0x1e0, %o0 ! 2020de0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2008a58: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008a5c: 80 a0 60 00 cmp %g1, 0 2008a60: 32 80 00 21 bne,a 2008ae4 2008a64: b0 10 20 16 mov 0x16, %i0 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2008a68: d2 06 00 00 ld [ %i0 ], %o1 2008a6c: d6 07 bf fc ld [ %fp + -4 ], %o3 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008a70: 82 1f 60 03 xor %i5, 3, %g1 the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2008a74: 90 02 20 10 add %o0, 0x10, %o0 2008a78: 80 a0 00 01 cmp %g0, %g1 2008a7c: 98 10 20 00 clr %o4 2008a80: b8 60 3f ff subx %g0, -1, %i4 2008a84: 40 00 07 8a call 200a8ac <_CORE_RWLock_Obtain_for_writing> 2008a88: 94 10 00 1c mov %i4, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008a8c: 40 00 0e 7e call 200c484 <_Thread_Enable_dispatch> 2008a90: 01 00 00 00 nop if ( !do_wait && 2008a94: 80 a7 20 00 cmp %i4, 0 2008a98: 12 80 00 0e bne 2008ad0 2008a9c: 03 00 80 84 sethi %hi(0x2021000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2008aa0: c2 00 61 2c ld [ %g1 + 0x12c ], %g1 ! 202112c <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2008aa4: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008aa8: 80 a0 60 02 cmp %g1, 2 2008aac: 32 80 00 0a bne,a 2008ad4 2008ab0: 03 00 80 84 sethi %hi(0x2021000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008ab4: 80 a7 60 00 cmp %i5, 0 2008ab8: 22 80 00 0b be,a 2008ae4 <== NEVER TAKEN 2008abc: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008ac0: ba 07 7f ff add %i5, -1, %i5 2008ac4: 80 a7 60 01 cmp %i5, 1 2008ac8: 08 80 00 07 bleu 2008ae4 <== ALWAYS TAKEN 2008acc: b0 10 20 74 mov 0x74, %i0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 2008ad0: 03 00 80 84 sethi %hi(0x2021000), %g1 2008ad4: c2 00 61 2c ld [ %g1 + 0x12c ], %g1 ! 202112c <_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( 2008ad8: 40 00 00 05 call 2008aec <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008adc: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2008ae0: b0 10 00 08 mov %o0, %i0 case OBJECTS_ERROR: break; } return EINVAL; } 2008ae4: 81 c7 e0 08 ret 2008ae8: 81 e8 00 00 restore =============================================================================== 02009278 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2009278: 82 10 00 08 mov %o0, %g1 if ( !attr ) 200927c: 80 a0 60 00 cmp %g1, 0 2009280: 02 80 00 0a be 20092a8 2009284: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2009288: c4 00 40 00 ld [ %g1 ], %g2 200928c: 80 a0 a0 00 cmp %g2, 0 2009290: 02 80 00 06 be 20092a8 2009294: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2009298: 18 80 00 04 bgu 20092a8 <== NEVER TAKEN 200929c: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 20092a0: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 20092a4: 90 10 20 00 clr %o0 default: return EINVAL; } } 20092a8: 81 c3 e0 08 retl =============================================================================== 0200a2b0 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 200a2b0: 9d e3 bf 90 save %sp, -112, %sp int rc; /* * Check all the parameters */ if ( !param ) 200a2b4: 80 a6 a0 00 cmp %i2, 0 200a2b8: 02 80 00 40 be 200a3b8 200a2bc: b6 10 20 16 mov 0x16, %i3 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 200a2c0: 90 10 00 19 mov %i1, %o0 200a2c4: 92 10 00 1a mov %i2, %o1 200a2c8: 94 07 bf f4 add %fp, -12, %o2 200a2cc: 40 00 17 6a call 2010074 <_POSIX_Thread_Translate_sched_param> 200a2d0: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 200a2d4: b6 92 20 00 orcc %o0, 0, %i3 200a2d8: 32 80 00 39 bne,a 200a3bc 200a2dc: b0 10 00 1b mov %i3, %i0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 200a2e0: 90 10 00 18 mov %i0, %o0 200a2e4: 40 00 0c 16 call 200d33c <_Thread_Get> 200a2e8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a2ec: c2 07 bf fc ld [ %fp + -4 ], %g1 200a2f0: 80 a0 60 00 cmp %g1, 0 200a2f4: 12 80 00 30 bne 200a3b4 200a2f8: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200a2fc: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 200a300: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 200a304: 80 a0 60 04 cmp %g1, 4 200a308: 32 80 00 05 bne,a 200a31c 200a30c: f2 27 60 84 st %i1, [ %i5 + 0x84 ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 200a310: 40 00 10 28 call 200e3b0 <_Watchdog_Remove> 200a314: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 200a318: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 200a31c: 90 07 60 88 add %i5, 0x88, %o0 200a320: 92 10 00 1a mov %i2, %o1 200a324: 40 00 24 31 call 20133e8 200a328: 94 10 20 1c mov 0x1c, %o2 the_thread->budget_algorithm = budget_algorithm; 200a32c: c2 07 bf f4 ld [ %fp + -12 ], %g1 the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 200a330: 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; 200a334: c2 27 20 78 st %g1, [ %i4 + 0x78 ] the_thread->budget_callout = budget_callout; 200a338: c2 07 bf f8 ld [ %fp + -8 ], %g1 switch ( api->schedpolicy ) { 200a33c: 06 80 00 1b bl 200a3a8 <== NEVER TAKEN 200a340: c2 27 20 7c st %g1, [ %i4 + 0x7c ] 200a344: 80 a6 60 02 cmp %i1, 2 200a348: 04 80 00 07 ble 200a364 200a34c: 03 00 80 8c sethi %hi(0x2023000), %g1 200a350: 80 a6 60 04 cmp %i1, 4 200a354: 12 80 00 15 bne 200a3a8 <== NEVER TAKEN 200a358: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 200a35c: 10 80 00 0d b 200a390 200a360: 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; 200a364: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a368: 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; 200a36c: c2 27 20 74 st %g1, [ %i4 + 0x74 ] 200a370: 03 00 80 88 sethi %hi(0x2022000), %g1 200a374: d2 08 62 c8 ldub [ %g1 + 0x2c8 ], %o1 ! 20222c8 200a378: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a37c: 94 10 20 01 mov 1, %o2 200a380: 92 22 40 01 sub %o1, %g1, %o1 200a384: 40 00 0a bc call 200ce74 <_Thread_Change_priority> 200a388: d2 27 20 18 st %o1, [ %i4 + 0x18 ] the_thread, the_thread->real_priority, true ); break; 200a38c: 30 80 00 07 b,a 200a3a8 case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; _Watchdog_Remove( &api->Sporadic_timer ); 200a390: 90 07 60 a8 add %i5, 0xa8, %o0 200a394: 40 00 10 07 call 200e3b0 <_Watchdog_Remove> 200a398: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 200a39c: 90 10 20 00 clr %o0 200a3a0: 7f ff ff 7e call 200a198 <_POSIX_Threads_Sporadic_budget_TSR> 200a3a4: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 200a3a8: 40 00 0b d8 call 200d308 <_Thread_Enable_dispatch> 200a3ac: b0 10 00 1b mov %i3, %i0 200a3b0: 30 80 00 03 b,a 200a3bc #endif case OBJECTS_ERROR: break; } return ESRCH; 200a3b4: b6 10 20 03 mov 3, %i3 } 200a3b8: b0 10 00 1b mov %i3, %i0 200a3bc: 81 c7 e0 08 ret 200a3c0: 81 e8 00 00 restore =============================================================================== 02007bdc : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 2007bdc: 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() ) 2007be0: 03 00 80 7b sethi %hi(0x201ec00), %g1 2007be4: 82 10 62 80 or %g1, 0x280, %g1 ! 201ee80 <_Per_CPU_Information> 2007be8: c4 00 60 08 ld [ %g1 + 8 ], %g2 2007bec: 80 a0 a0 00 cmp %g2, 0 2007bf0: 12 80 00 18 bne 2007c50 <== NEVER TAKEN 2007bf4: 01 00 00 00 nop return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2007bf8: c2 00 60 0c ld [ %g1 + 0xc ], %g1 2007bfc: c4 00 61 5c ld [ %g1 + 0x15c ], %g2 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007c00: 03 00 80 7a sethi %hi(0x201e800), %g1 2007c04: c6 00 61 50 ld [ %g1 + 0x150 ], %g3 ! 201e950 <_Thread_Dispatch_disable_level> 2007c08: 86 00 e0 01 inc %g3 2007c0c: c6 20 61 50 st %g3, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2007c10: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2007c14: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 2007c18: 80 a0 60 00 cmp %g1, 0 2007c1c: 12 80 00 05 bne 2007c30 <== NEVER TAKEN 2007c20: ba 10 20 00 clr %i5 2007c24: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 2007c28: 80 a0 00 01 cmp %g0, %g1 2007c2c: ba 40 20 00 addx %g0, 0, %i5 thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2007c30: 40 00 0b 9a call 200aa98 <_Thread_Enable_dispatch> 2007c34: 01 00 00 00 nop if ( cancel ) 2007c38: 80 8f 60 ff btst 0xff, %i5 2007c3c: 02 80 00 05 be 2007c50 2007c40: 03 00 80 7b sethi %hi(0x201ec00), %g1 _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2007c44: f0 00 62 8c ld [ %g1 + 0x28c ], %i0 ! 201ee8c <_Per_CPU_Information+0xc> 2007c48: 40 00 17 1f call 200d8c4 <_POSIX_Thread_Exit> 2007c4c: 93 e8 3f ff restore %g0, -1, %o1 2007c50: 81 c7 e0 08 ret 2007c54: 81 e8 00 00 restore =============================================================================== 020080cc : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 20080cc: 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); 20080d0: 37 00 80 7f sethi %hi(0x201fc00), %i3 * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 20080d4: ba 10 00 18 mov %i0, %i5 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); 20080d8: 40 00 02 85 call 2008aec 20080dc: 90 16 e2 bc or %i3, 0x2bc, %o0 if (result != 0) { 20080e0: b0 92 20 00 orcc %o0, 0, %i0 20080e4: 02 80 00 06 be 20080fc <== ALWAYS TAKEN 20080e8: 01 00 00 00 nop free (req); 20080ec: 7f ff ef 1d call 2003d60 <== NOT EXECUTED 20080f0: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20080f4: 81 c7 e0 08 ret <== NOT EXECUTED 20080f8: 81 e8 00 00 restore <== NOT EXECUTED return result; } /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); 20080fc: 40 00 04 8f call 2009338 2008100: b6 16 e2 bc or %i3, 0x2bc, %i3 2008104: 92 07 bf e0 add %fp, -32, %o1 2008108: 40 00 03 9c call 2008f78 200810c: 94 07 bf e4 add %fp, -28, %o2 req->caller_thread = pthread_self (); 2008110: 40 00 04 8a call 2009338 2008114: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008118: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200811c: c6 07 bf e4 ld [ %fp + -28 ], %g3 2008120: 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 (); 2008124: d0 27 60 10 st %o0, [ %i5 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008128: 84 20 c0 02 sub %g3, %g2, %g2 200812c: c4 27 60 0c st %g2, [ %i5 + 0xc ] req->policy = policy; 2008130: c4 07 bf e0 ld [ %fp + -32 ], %g2 2008134: c4 27 60 08 st %g2, [ %i5 + 8 ] req->aiocbp->error_code = EINPROGRESS; 2008138: 84 10 20 77 mov 0x77, %g2 200813c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2008140: c4 06 e0 68 ld [ %i3 + 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; 2008144: c0 20 60 38 clr [ %g1 + 0x38 ] if ((aio_request_queue.idle_threads == 0) && 2008148: 80 a0 a0 00 cmp %g2, 0 200814c: 12 80 00 2e bne 2008204 <== NEVER TAKEN 2008150: d2 00 40 00 ld [ %g1 ], %o1 2008154: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2008158: 80 a0 60 04 cmp %g1, 4 200815c: 14 80 00 2b bg 2008208 2008160: 11 00 80 7f sethi %hi(0x201fc00), %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); 2008164: 90 06 e0 48 add %i3, 0x48, %o0 2008168: 7f ff ff 7d call 2007f5c 200816c: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2008170: 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); 2008174: b8 10 00 08 mov %o0, %i4 if (r_chain->new_fd == 1) { 2008178: 80 a0 60 01 cmp %g1, 1 200817c: 12 80 00 1d bne 20081f0 2008180: 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); 2008184: 92 10 00 1d mov %i5, %o1 2008188: 40 00 08 ff call 200a584 <_Chain_Insert> 200818c: 90 10 00 1a mov %i2, %o0 rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 2008190: 92 10 20 00 clr %o1 chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); if (r_chain->new_fd == 1) { rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 2008194: c0 27 20 18 clr [ %i4 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2008198: 40 00 01 fc call 2008988 200819c: 90 07 20 1c add %i4, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 20081a0: 92 10 20 00 clr %o1 20081a4: 40 00 00 fd call 2008598 20081a8: 90 07 20 20 add %i4, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 20081ac: 90 07 bf dc add %fp, -36, %o0 20081b0: 92 06 e0 08 add %i3, 8, %o1 20081b4: 15 00 80 1e sethi %hi(0x2007800), %o2 20081b8: 96 10 00 1c mov %i4, %o3 20081bc: 40 00 02 de call 2008d34 20081c0: 94 12 a3 a4 or %o2, 0x3a4, %o2 rtems_aio_handle, (void *) r_chain); if (result != 0) { 20081c4: ba 92 20 00 orcc %o0, 0, %i5 20081c8: 22 80 00 07 be,a 20081e4 <== ALWAYS TAKEN 20081cc: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20081d0: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 20081d4: 40 00 02 67 call 2008b70 <== NOT EXECUTED 20081d8: b0 10 00 1d mov %i5, %i0 <== NOT EXECUTED 20081dc: 81 c7 e0 08 ret <== NOT EXECUTED 20081e0: 81 e8 00 00 restore <== NOT EXECUTED return result; } ++aio_request_queue.active_threads; 20081e4: 82 00 60 01 inc %g1 20081e8: 10 80 00 3a b 20082d0 20081ec: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 20081f0: b6 02 20 1c add %o0, 0x1c, %i3 20081f4: 40 00 02 3e call 2008aec 20081f8: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20081fc: 10 80 00 0c b 200822c 2008200: 90 10 00 1a mov %i2, %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, 2008204: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2008208: 94 10 20 00 clr %o2 200820c: 7f ff ff 54 call 2007f5c 2008210: 90 12 23 04 or %o0, 0x304, %o0 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 2008214: b8 92 20 00 orcc %o0, 0, %i4 2008218: 02 80 00 0d be 200824c 200821c: b6 07 20 1c add %i4, 0x1c, %i3 { pthread_mutex_lock (&r_chain->mutex); 2008220: 40 00 02 33 call 2008aec 2008224: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 2008228: 90 07 20 08 add %i4, 8, %o0 200822c: 7f ff fe fc call 2007e1c 2008230: 92 10 00 1d mov %i5, %o1 pthread_cond_signal (&r_chain->cond); 2008234: 40 00 01 09 call 2008658 2008238: 90 07 20 20 add %i4, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 200823c: 40 00 02 4d call 2008b70 2008240: 90 10 00 1b mov %i3, %o0 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 2008244: 10 80 00 24 b 20082d4 2008248: 11 00 80 7f sethi %hi(0x201fc00), %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); 200824c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2008250: 11 00 80 7f sethi %hi(0x201fc00), %o0 2008254: d2 00 40 00 ld [ %g1 ], %o1 2008258: 90 12 23 10 or %o0, 0x310, %o0 200825c: 7f ff ff 40 call 2007f5c 2008260: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2008264: 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); 2008268: b8 10 00 08 mov %o0, %i4 200826c: 92 10 00 1d mov %i5, %o1 if (r_chain->new_fd == 1) { 2008270: 80 a0 60 01 cmp %g1, 1 2008274: 12 80 00 0d bne 20082a8 2008278: 90 02 20 08 add %o0, 8, %o0 200827c: 40 00 08 c2 call 200a584 <_Chain_Insert> 2008280: 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); 2008284: 90 07 20 1c add %i4, 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; 2008288: c0 27 20 18 clr [ %i4 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 200828c: 40 00 01 bf call 2008988 2008290: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2008294: 90 07 20 20 add %i4, 0x20, %o0 2008298: 40 00 00 c0 call 2008598 200829c: 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) 20082a0: 10 80 00 05 b 20082b4 20082a4: 11 00 80 7f sethi %hi(0x201fc00), %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); 20082a8: 7f ff fe dd call 2007e1c 20082ac: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 20082b0: 11 00 80 7f sethi %hi(0x201fc00), %o0 20082b4: 90 12 22 bc or %o0, 0x2bc, %o0 ! 201febc 20082b8: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 20082bc: 80 a0 60 00 cmp %g1, 0 20082c0: 24 80 00 05 ble,a 20082d4 <== ALWAYS TAKEN 20082c4: 11 00 80 7f sethi %hi(0x201fc00), %o0 pthread_cond_signal (&aio_request_queue.new_req); 20082c8: 40 00 00 e4 call 2008658 <== NOT EXECUTED 20082cc: 90 02 20 04 add %o0, 4, %o0 ! 201fc04 <_PathLocale> <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); 20082d0: 11 00 80 7f sethi %hi(0x201fc00), %o0 20082d4: 40 00 02 27 call 2008b70 20082d8: 90 12 22 bc or %o0, 0x2bc, %o0 ! 201febc return 0; } 20082dc: 81 c7 e0 08 ret 20082e0: 81 e8 00 00 restore =============================================================================== 02007ba4 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2007ba4: 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); 2007ba8: 3b 00 80 7f sethi %hi(0x201fc00), %i5 2007bac: ba 17 62 bc or %i5, 0x2bc, %i5 ! 201febc 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)) { 2007bb0: b4 07 60 58 add %i5, 0x58, %i2 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 && 2007bb4: b2 07 60 4c add %i5, 0x4c, %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, 2007bb8: a0 07 60 04 add %i5, 4, %l0 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2007bbc: b6 06 20 1c add %i0, 0x1c, %i3 2007bc0: 40 00 03 cb call 2008aec 2007bc4: 90 10 00 1b mov %i3, %o0 if (result != 0) 2007bc8: 80 a2 20 00 cmp %o0, 0 2007bcc: 12 80 00 91 bne 2007e10 <== NEVER TAKEN 2007bd0: 82 06 20 0c add %i0, 0xc, %g1 2007bd4: 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)) { 2007bd8: 80 a7 00 01 cmp %i4, %g1 2007bdc: 02 80 00 3b be 2007cc8 2007be0: 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); 2007be4: 40 00 05 d5 call 2009338 2007be8: 01 00 00 00 nop 2007bec: 92 07 bf d8 add %fp, -40, %o1 2007bf0: 40 00 04 e2 call 2008f78 2007bf4: 94 07 bf e4 add %fp, -28, %o2 param.sched_priority = req->priority; 2007bf8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2007bfc: 40 00 05 cf call 2009338 2007c00: c2 27 bf e4 st %g1, [ %fp + -28 ] 2007c04: d2 07 20 08 ld [ %i4 + 8 ], %o1 2007c08: 40 00 05 d0 call 2009348 2007c0c: 94 07 bf e4 add %fp, -28, %o2 2007c10: 40 00 0a 44 call 200a520 <_Chain_Extract> 2007c14: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2007c18: 40 00 03 d6 call 2008b70 2007c1c: 90 10 00 1b mov %i3, %o0 switch (req->aiocbp->aio_lio_opcode) { 2007c20: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 2007c24: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 2007c28: 80 a0 a0 02 cmp %g2, 2 2007c2c: 22 80 00 10 be,a 2007c6c 2007c30: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2007c34: 80 a0 a0 03 cmp %g2, 3 2007c38: 02 80 00 15 be 2007c8c <== NEVER TAKEN 2007c3c: 80 a0 a0 01 cmp %g2, 1 2007c40: 32 80 00 19 bne,a 2007ca4 <== NEVER TAKEN 2007c44: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2007c48: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2007c4c: d0 00 40 00 ld [ %g1 ], %o0 2007c50: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2007c54: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2007c58: 96 10 00 02 mov %g2, %o3 2007c5c: 40 00 2b 2f call 2012918 2007c60: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2007c64: 10 80 00 0d b 2007c98 2007c68: 80 a2 3f ff cmp %o0, -1 case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2007c6c: d0 00 40 00 ld [ %g1 ], %o0 2007c70: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2007c74: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2007c78: 96 10 00 02 mov %g2, %o3 2007c7c: 40 00 2b 65 call 2012a10 2007c80: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2007c84: 10 80 00 05 b 2007c98 2007c88: 80 a2 3f ff cmp %o0, -1 case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2007c8c: 40 00 1a 80 call 200e68c <== NOT EXECUTED 2007c90: d0 00 40 00 ld [ %g1 ], %o0 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 2007c94: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 2007c98: 32 80 00 09 bne,a 2007cbc <== ALWAYS TAKEN 2007c9c: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 req->aiocbp->return_value = -1; 2007ca0: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED 2007ca4: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 2007ca8: 40 00 28 20 call 2011d28 <__errno> <== NOT EXECUTED 2007cac: c2 27 20 38 st %g1, [ %i4 + 0x38 ] <== NOT EXECUTED 2007cb0: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED 2007cb4: 10 bf ff c2 b 2007bbc <== NOT EXECUTED 2007cb8: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED } else { req->aiocbp->return_value = result; 2007cbc: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2007cc0: 10 bf ff bf b 2007bbc 2007cc4: 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); 2007cc8: 40 00 03 aa call 2008b70 2007ccc: 90 10 00 1b mov %i3, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2007cd0: 40 00 03 87 call 2008aec 2007cd4: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_empty (chain)) 2007cd8: c2 06 20 08 ld [ %i0 + 8 ], %g1 2007cdc: 80 a0 40 1c cmp %g1, %i4 2007ce0: 12 80 00 48 bne 2007e00 <== NEVER TAKEN 2007ce4: 92 07 bf dc add %fp, -36, %o1 { clock_gettime (CLOCK_REALTIME, &timeout); 2007ce8: 40 00 01 c9 call 200840c 2007cec: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2007cf0: c2 07 bf dc ld [ %fp + -36 ], %g1 timeout.tv_nsec = 0; 2007cf4: c0 27 bf e0 clr [ %fp + -32 ] pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2007cf8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007cfc: 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; 2007d00: c2 27 bf dc st %g1, [ %fp + -36 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007d04: 90 10 00 1c mov %i4, %o0 2007d08: 92 10 00 1d mov %i5, %o1 2007d0c: 40 00 02 70 call 20086cc 2007d10: 94 07 bf dc add %fp, -36, %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) { 2007d14: 80 a2 20 74 cmp %o0, 0x74 2007d18: 12 80 00 3a bne 2007e00 <== NEVER TAKEN 2007d1c: 01 00 00 00 nop 2007d20: 40 00 0a 00 call 200a520 <_Chain_Extract> 2007d24: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2007d28: 40 00 02 c3 call 2008834 2007d2c: 90 10 00 1b mov %i3, %o0 pthread_cond_destroy (&r_chain->cond); 2007d30: 40 00 01 e3 call 20084bc 2007d34: 90 10 00 1c mov %i4, %o0 free (r_chain); 2007d38: 7f ff f0 0a call 2003d60 2007d3c: 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)) { 2007d40: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2007d44: 80 a0 40 1a cmp %g1, %i2 2007d48: 12 80 00 1b bne 2007db4 2007d4c: 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); 2007d50: 92 07 bf dc add %fp, -36, %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; 2007d54: 82 00 60 01 inc %g1 2007d58: c2 27 60 68 st %g1, [ %i5 + 0x68 ] --aio_request_queue.active_threads; 2007d5c: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2007d60: 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; 2007d64: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2007d68: 40 00 01 a9 call 200840c 2007d6c: c2 27 60 64 st %g1, [ %i5 + 0x64 ] timeout.tv_sec += 3; 2007d70: c2 07 bf dc ld [ %fp + -36 ], %g1 timeout.tv_nsec = 0; 2007d74: c0 27 bf e0 clr [ %fp + -32 ] 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; 2007d78: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2007d7c: 90 10 00 10 mov %l0, %o0 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2007d80: c2 27 bf dc st %g1, [ %fp + -36 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2007d84: 92 10 00 1d mov %i5, %o1 2007d88: 40 00 02 51 call 20086cc 2007d8c: 94 07 bf dc add %fp, -36, %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) { 2007d90: 80 a2 20 74 cmp %o0, 0x74 2007d94: 12 80 00 08 bne 2007db4 <== NEVER TAKEN 2007d98: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 2007d9c: 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; 2007da0: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2007da4: 40 00 03 73 call 2008b70 2007da8: c2 27 60 68 st %g1, [ %i5 + 0x68 ] } } AIO_printf ("Thread finished\n"); return NULL; } 2007dac: 81 c7 e0 08 ret 2007db0: 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; 2007db4: 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; 2007db8: 82 00 7f ff add %g1, -1, %g1 2007dbc: c2 27 60 68 st %g1, [ %i5 + 0x68 ] ++aio_request_queue.active_threads; 2007dc0: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2007dc4: 90 10 00 18 mov %i0, %o0 2007dc8: 82 00 60 01 inc %g1 2007dcc: 40 00 09 d5 call 200a520 <_Chain_Extract> 2007dd0: c2 27 60 64 st %g1, [ %i5 + 0x64 ] 2007dd4: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007dd8: c4 06 20 14 ld [ %i0 + 0x14 ], %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 && 2007ddc: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 2007de0: 80 a0 c0 02 cmp %g3, %g2 2007de4: 16 80 00 04 bge 2007df4 2007de8: 80 a0 40 19 cmp %g1, %i1 2007dec: 32 bf ff fc bne,a 2007ddc <== ALWAYS TAKEN 2007df0: c2 00 40 00 ld [ %g1 ], %g1 RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2007df4: d0 00 60 04 ld [ %g1 + 4 ], %o0 2007df8: 40 00 09 e3 call 200a584 <_Chain_Insert> 2007dfc: 92 10 00 18 mov %i0, %o1 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 2007e00: 40 00 03 5c call 2008b70 2007e04: 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); 2007e08: 10 bf ff 6e b 2007bc0 2007e0c: b6 06 20 1c add %i0, 0x1c, %i3 } } AIO_printf ("Thread finished\n"); return NULL; } 2007e10: b0 10 20 00 clr %i0 <== NOT EXECUTED 2007e14: 81 c7 e0 08 ret <== NOT EXECUTED 2007e18: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007e7c : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2007e7c: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2007e80: 3b 00 80 7f sethi %hi(0x201fc00), %i5 2007e84: 40 00 03 92 call 2008ccc 2007e88: 90 17 62 c4 or %i5, 0x2c4, %o0 ! 201fec4 if (result != 0) 2007e8c: b0 92 20 00 orcc %o0, 0, %i0 2007e90: 12 80 00 31 bne 2007f54 <== NEVER TAKEN 2007e94: 90 17 62 c4 or %i5, 0x2c4, %o0 return result; result = 2007e98: 40 00 03 99 call 2008cfc 2007e9c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2007ea0: 80 a2 20 00 cmp %o0, 0 2007ea4: 22 80 00 05 be,a 2007eb8 <== ALWAYS TAKEN 2007ea8: 11 00 80 7f sethi %hi(0x201fc00), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2007eac: 40 00 03 7c call 2008c9c <== NOT EXECUTED 2007eb0: 90 17 62 c4 or %i5, 0x2c4, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2007eb4: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2007eb8: 92 10 20 00 clr %o1 2007ebc: 40 00 02 b3 call 2008988 2007ec0: 90 12 22 bc or %o0, 0x2bc, %o0 if (result != 0) 2007ec4: 80 a2 20 00 cmp %o0, 0 2007ec8: 22 80 00 06 be,a 2007ee0 <== ALWAYS TAKEN 2007ecc: 11 00 80 7f sethi %hi(0x201fc00), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2007ed0: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2007ed4: 40 00 03 72 call 2008c9c <== NOT EXECUTED 2007ed8: 90 12 22 c4 or %o0, 0x2c4, %o0 ! 201fec4 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2007edc: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2007ee0: 92 10 20 00 clr %o1 2007ee4: 40 00 01 ad call 2008598 2007ee8: 90 12 22 c0 or %o0, 0x2c0, %o0 if (result != 0) { 2007eec: b0 92 20 00 orcc %o0, 0, %i0 2007ef0: 02 80 00 09 be 2007f14 <== ALWAYS TAKEN 2007ef4: 03 00 80 7f sethi %hi(0x201fc00), %g1 pthread_mutex_destroy (&aio_request_queue.mutex); 2007ef8: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2007efc: 40 00 02 4e call 2008834 <== NOT EXECUTED 2007f00: 90 12 22 bc or %o0, 0x2bc, %o0 ! 201febc <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007f04: 11 00 80 7f sethi %hi(0x201fc00), %o0 <== NOT EXECUTED 2007f08: 40 00 03 65 call 2008c9c <== NOT EXECUTED 2007f0c: 90 12 22 c4 or %o0, 0x2c4, %o0 ! 201fec4 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007f10: 03 00 80 7f sethi %hi(0x201fc00), %g1 <== NOT EXECUTED 2007f14: 82 10 62 bc or %g1, 0x2bc, %g1 ! 201febc 2007f18: 84 00 60 4c add %g1, 0x4c, %g2 2007f1c: c4 20 60 48 st %g2, [ %g1 + 0x48 ] head->previous = NULL; tail->previous = head; 2007f20: 84 00 60 48 add %g1, 0x48, %g2 2007f24: 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; 2007f28: 84 00 60 58 add %g1, 0x58, %g2 2007f2c: c4 20 60 54 st %g2, [ %g1 + 0x54 ] head->previous = NULL; tail->previous = head; 2007f30: 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; 2007f34: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 2007f38: 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; 2007f3c: 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; 2007f40: 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; 2007f44: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2007f48: 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; 2007f4c: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2007f50: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 2007f54: 81 c7 e0 08 ret 2007f58: 81 e8 00 00 restore =============================================================================== 02007e1c : 2007e1c: c2 02 00 00 ld [ %o0 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2007e20: 86 02 20 04 add %o0, 4, %g3 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2007e24: 80 a0 40 03 cmp %g1, %g3 2007e28: 02 80 00 0e be 2007e60 <== NEVER TAKEN 2007e2c: 84 10 00 09 mov %o1, %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; 2007e30: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2007e34: da 02 60 14 ld [ %o1 + 0x14 ], %o5 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; 2007e38: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2007e3c: 10 80 00 04 b 2007e4c 2007e40: da 03 60 18 ld [ %o5 + 0x18 ], %o5 !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007e44: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED 2007e48: 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 && 2007e4c: 80 a3 40 04 cmp %o5, %g4 2007e50: 14 80 00 07 bg 2007e6c <== NEVER TAKEN 2007e54: 80 a0 40 03 cmp %g1, %g3 2007e58: d0 00 60 04 ld [ %g1 + 4 ], %o0 2007e5c: 92 10 00 02 mov %g2, %o1 2007e60: 82 13 c0 00 mov %o7, %g1 2007e64: 40 00 09 c8 call 200a584 <_Chain_Insert> 2007e68: 9e 10 40 00 mov %g1, %o7 2007e6c: 32 bf ff f6 bne,a 2007e44 <== NOT EXECUTED 2007e70: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2007e74: 10 bf ff fa b 2007e5c <== NOT EXECUTED 2007e78: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED =============================================================================== 0200804c : * 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) { 200804c: 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; 2008050: 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 ); 2008054: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2008058: 80 a7 40 01 cmp %i5, %g1 200805c: 12 80 00 09 bne 2008080 2008060: b0 10 20 02 mov 2, %i0 2008064: 81 c7 e0 08 ret 2008068: 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) { 200806c: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2008070: 32 80 00 05 bne,a 2008084 <== NOT EXECUTED 2008074: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 <== NOT EXECUTED node = rtems_chain_next (node); current = (rtems_aio_request *) node; } if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; 2008078: 81 c7 e0 08 ret <== NOT EXECUTED 200807c: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED 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) { 2008080: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2008084: 80 a0 80 19 cmp %g2, %i1 2008088: 32 bf ff f9 bne,a 200806c <== NEVER TAKEN 200808c: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED node = rtems_chain_next (node); current = (rtems_aio_request *) node; } if (rtems_chain_is_tail (chain, node)) 2008090: 80 a7 40 01 cmp %i5, %g1 2008094: 02 bf ff f4 be 2008064 <== NEVER TAKEN 2008098: b0 10 20 01 mov 1, %i0 200809c: 40 00 09 21 call 200a520 <_Chain_Extract> 20080a0: 90 10 00 1d mov %i5, %o0 return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; 20080a4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20080a8: 84 10 20 8c mov 0x8c, %g2 20080ac: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 20080b0: 84 10 3f ff mov -1, %g2 free (current); 20080b4: 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; 20080b8: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 20080bc: 7f ff ef 29 call 2003d60 20080c0: b0 10 20 00 clr %i0 } return AIO_CANCELED; } 20080c4: 81 c7 e0 08 ret 20080c8: 81 e8 00 00 restore =============================================================================== 0200850c : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 200850c: 9d e3 bf 98 save %sp, -104, %sp 2008510: 30 80 00 08 b,a 2008530 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2008514: 92 10 20 00 clr %o1 2008518: 94 10 00 1a mov %i2, %o2 200851c: 7f ff fd 03 call 2007928 2008520: 96 07 bf fc add %fp, -4, %o3 ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2008524: 80 a2 20 00 cmp %o0, 0 2008528: 32 80 00 09 bne,a 200854c <== ALWAYS TAKEN 200852c: fa 26 c0 00 st %i5, [ %i3 ] */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2008530: 40 00 01 88 call 2008b50 <_Chain_Get> 2008534: 90 10 00 18 mov %i0, %o0 sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2008538: ba 92 20 00 orcc %o0, 0, %i5 200853c: 02 bf ff f6 be 2008514 2008540: 90 10 00 19 mov %i1, %o0 2008544: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2008548: fa 26 c0 00 st %i5, [ %i3 ] return sc; } 200854c: 81 c7 e0 08 ret 2008550: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a5b8 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 200a5b8: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200a5bc: ba 10 20 01 mov 1, %i5 200a5c0: 80 a6 20 00 cmp %i0, 0 200a5c4: 02 80 00 0d be 200a5f8 <== NEVER TAKEN 200a5c8: 35 00 80 81 sethi %hi(0x2020400), %i2 #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200a5cc: 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 ]; 200a5d0: 84 16 a1 34 or %i2, 0x134, %g2 200a5d4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200a5d8: f6 00 60 04 ld [ %g1 + 4 ], %i3 if ( !information ) 200a5dc: 80 a6 e0 00 cmp %i3, 0 200a5e0: 12 80 00 0f bne 200a61c 200a5e4: b8 10 20 01 mov 1, %i4 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 200a5e8: ba 07 60 01 inc %i5 200a5ec: 80 a7 60 04 cmp %i5, 4 200a5f0: 12 bf ff f8 bne 200a5d0 200a5f4: 83 2f 60 02 sll %i5, 2, %g1 200a5f8: 81 c7 e0 08 ret 200a5fc: 81 e8 00 00 restore 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 ]; 200a600: 83 2f 20 02 sll %i4, 2, %g1 200a604: d0 00 80 01 ld [ %g2 + %g1 ], %o0 if ( !the_thread ) 200a608: 80 a2 20 00 cmp %o0, 0 200a60c: 02 80 00 04 be 200a61c 200a610: b8 07 20 01 inc %i4 continue; (*routine)(the_thread); 200a614: 9f c6 00 00 call %i0 200a618: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200a61c: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1 200a620: 80 a7 00 01 cmp %i4, %g1 200a624: 28 bf ff f7 bleu,a 200a600 200a628: 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++ ) { 200a62c: 10 bf ff f0 b 200a5ec 200a630: ba 07 60 01 inc %i5 =============================================================================== 02008dc4 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2008dc4: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2008dc8: 80 a6 20 00 cmp %i0, 0 2008dcc: 02 80 00 39 be 2008eb0 2008dd0: 82 10 20 03 mov 3, %g1 return RTEMS_INVALID_NAME; if ( !starting_address ) 2008dd4: 80 a6 60 00 cmp %i1, 0 2008dd8: 02 80 00 36 be 2008eb0 2008ddc: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2008de0: 80 a7 60 00 cmp %i5, 0 2008de4: 02 80 00 33 be 2008eb0 <== NEVER TAKEN 2008de8: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2008dec: 02 80 00 31 be 2008eb0 2008df0: 82 10 20 08 mov 8, %g1 2008df4: 80 a6 a0 00 cmp %i2, 0 2008df8: 02 80 00 2e be 2008eb0 2008dfc: 80 a6 80 1b cmp %i2, %i3 2008e00: 0a 80 00 2c bcs 2008eb0 2008e04: 80 8e e0 07 btst 7, %i3 2008e08: 12 80 00 2a bne 2008eb0 2008e0c: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2008e10: 12 80 00 28 bne 2008eb0 2008e14: 82 10 20 09 mov 9, %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008e18: 03 00 80 89 sethi %hi(0x2022400), %g1 2008e1c: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 20225f0 <_Thread_Dispatch_disable_level> 2008e20: 84 00 a0 01 inc %g2 2008e24: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 2008e28: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 * This function allocates a partition control block from * the inactive chain of free partition control blocks. */ RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void ) { return (Partition_Control *) _Objects_Allocate( &_Partition_Information ); 2008e2c: 23 00 80 88 sethi %hi(0x2022000), %l1 2008e30: 40 00 06 ee call 200a9e8 <_Objects_Allocate> 2008e34: 90 14 63 e4 or %l1, 0x3e4, %o0 ! 20223e4 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2008e38: a0 92 20 00 orcc %o0, 0, %l0 2008e3c: 32 80 00 06 bne,a 2008e54 2008e40: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 2008e44: 40 00 0c 0c call 200be74 <_Thread_Enable_dispatch> 2008e48: 01 00 00 00 nop return RTEMS_TOO_MANY; 2008e4c: 10 80 00 19 b 2008eb0 2008e50: 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 ); 2008e54: 92 10 00 1b mov %i3, %o1 _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2008e58: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2008e5c: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2008e60: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2008e64: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2008e68: 40 00 46 76 call 201a840 <.udiv> 2008e6c: 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, 2008e70: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2008e74: 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, 2008e78: 96 10 00 1b mov %i3, %o3 2008e7c: b8 04 20 24 add %l0, 0x24, %i4 2008e80: 40 00 04 58 call 2009fe0 <_Chain_Initialize> 2008e84: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008e88: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008e8c: a2 14 63 e4 or %l1, 0x3e4, %l1 2008e90: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008e94: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008e98: 85 28 a0 02 sll %g2, 2, %g2 2008e9c: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008ea0: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2008ea4: 40 00 0b f4 call 200be74 <_Thread_Enable_dispatch> 2008ea8: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2008eac: 82 10 20 00 clr %g1 } 2008eb0: 81 c7 e0 08 ret 2008eb4: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 020164d0 : rtems_status_code rtems_partition_return_buffer( rtems_id id, void *buffer ) { 20164d0: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get ( Objects_Id id, Objects_Locations *location ) { return (Partition_Control *) 20164d4: 11 00 80 f2 sethi %hi(0x203c800), %o0 20164d8: 92 10 00 18 mov %i0, %o1 20164dc: 90 12 23 64 or %o0, 0x364, %o0 20164e0: 40 00 14 15 call 201b534 <_Objects_Get> 20164e4: 94 07 bf fc add %fp, -4, %o2 register Partition_Control *the_partition; Objects_Locations location; the_partition = _Partition_Get( id, &location ); switch ( location ) { 20164e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20164ec: 80 a0 60 00 cmp %g1, 0 20164f0: 12 80 00 21 bne 2016574 20164f4: ba 10 00 08 mov %o0, %i5 ) { void *starting; void *ending; starting = the_partition->starting_address; 20164f8: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 20164fc: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2016500: 82 02 00 01 add %o0, %g1, %g1 ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 2016504: 80 a6 40 01 cmp %i1, %g1 2016508: 18 80 00 0b bgu 2016534 <== NEVER TAKEN 201650c: 82 10 20 00 clr %g1 2016510: 80 a6 40 08 cmp %i1, %o0 2016514: 0a 80 00 09 bcs 2016538 2016518: 80 a0 60 00 cmp %g1, 0 offset = (uint32_t) _Addresses_Subtract( the_buffer, the_partition->starting_address ); return ((offset % the_partition->buffer_size) == 0); 201651c: d2 07 60 18 ld [ %i5 + 0x18 ], %o1 2016520: 40 00 58 5d call 202c694 <.urem> 2016524: 90 26 40 08 sub %i1, %o0, %o0 starting = the_partition->starting_address; ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 2016528: 80 a0 00 08 cmp %g0, %o0 201652c: 10 80 00 02 b 2016534 2016530: 82 60 3f ff subx %g0, -1, %g1 case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { 2016534: 80 a0 60 00 cmp %g1, 0 2016538: 02 80 00 0b be 2016564 201653c: 90 07 60 24 add %i5, 0x24, %o0 RTEMS_INLINE_ROUTINE void _Partition_Free_buffer ( Partition_Control *the_partition, Chain_Node *the_buffer ) { _Chain_Append( &the_partition->Memory, the_buffer ); 2016540: 40 00 0c 7c call 2019730 <_Chain_Append> 2016544: 92 10 00 19 mov %i1, %o1 _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 2016548: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 201654c: b0 10 20 00 clr %i0 switch ( location ) { case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 2016550: 82 00 7f ff add %g1, -1, %g1 _Thread_Enable_dispatch(); 2016554: 40 00 17 ce call 201c48c <_Thread_Enable_dispatch> 2016558: c2 27 60 20 st %g1, [ %i5 + 0x20 ] 201655c: 81 c7 e0 08 ret 2016560: 81 e8 00 00 restore return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 2016564: 40 00 17 ca call 201c48c <_Thread_Enable_dispatch> 2016568: b0 10 20 09 mov 9, %i0 201656c: 81 c7 e0 08 ret 2016570: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016574: 81 c7 e0 08 ret 2016578: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 0203f268 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 203f268: 9d e3 bf 98 save %sp, -104, %sp 203f26c: 11 00 81 c0 sethi %hi(0x2070000), %o0 203f270: 92 10 00 18 mov %i0, %o1 203f274: 90 12 23 20 or %o0, 0x320, %o0 203f278: 7f ff 3f f9 call 200f25c <_Objects_Get> 203f27c: 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 ) { 203f280: c2 07 bf fc ld [ %fp + -4 ], %g1 203f284: 80 a0 60 00 cmp %g1, 0 203f288: 12 80 00 6a bne 203f430 203f28c: ba 10 00 08 mov %o0, %i5 203f290: 37 00 81 bf sethi %hi(0x206fc00), %i3 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 203f294: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 203f298: b6 16 e0 b0 or %i3, 0xb0, %i3 203f29c: c2 06 e0 0c ld [ %i3 + 0xc ], %g1 203f2a0: 80 a0 80 01 cmp %g2, %g1 203f2a4: 02 80 00 06 be 203f2bc 203f2a8: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 203f2ac: 7f ff 43 a4 call 201013c <_Thread_Enable_dispatch> 203f2b0: b0 10 20 17 mov 0x17, %i0 203f2b4: 81 c7 e0 08 ret 203f2b8: 81 e8 00 00 restore return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { 203f2bc: 12 80 00 0d bne 203f2f0 203f2c0: 01 00 00 00 nop switch ( the_period->state ) { 203f2c4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 203f2c8: 80 a0 60 04 cmp %g1, 4 203f2cc: 18 80 00 05 bgu 203f2e0 <== NEVER TAKEN 203f2d0: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 203f2d4: 05 00 81 a5 sethi %hi(0x2069400), %g2 203f2d8: 84 10 a2 a8 or %g2, 0x2a8, %g2 ! 20696a8 203f2dc: 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(); 203f2e0: 7f ff 43 97 call 201013c <_Thread_Enable_dispatch> 203f2e4: 01 00 00 00 nop 203f2e8: 81 c7 e0 08 ret 203f2ec: 81 e8 00 00 restore return( return_value ); } _ISR_Disable( level ); 203f2f0: 7f ff 13 50 call 2004030 203f2f4: 01 00 00 00 nop 203f2f8: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 203f2fc: f8 07 60 38 ld [ %i5 + 0x38 ], %i4 203f300: 80 a7 20 00 cmp %i4, 0 203f304: 12 80 00 15 bne 203f358 203f308: 80 a7 20 02 cmp %i4, 2 _ISR_Enable( level ); 203f30c: 7f ff 13 4d call 2004040 203f310: 01 00 00 00 nop the_period->next_length = length; /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 203f314: 90 10 00 1d mov %i5, %o0 203f318: 7f ff ff ba call 203f200 <_Rate_monotonic_Initiate_statistics> 203f31c: f2 27 60 3c st %i1, [ %i5 + 0x3c ] the_period->state = RATE_MONOTONIC_ACTIVE; 203f320: 82 10 20 02 mov 2, %g1 203f324: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 203f328: 03 00 80 fd sethi %hi(0x203f400), %g1 203f32c: 82 10 60 3c or %g1, 0x3c, %g1 ! 203f43c <_Rate_monotonic_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 203f330: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 203f334: c2 27 60 2c st %g1, [ %i5 + 0x2c ] the_watchdog->id = id; 203f338: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 203f33c: c0 27 60 34 clr [ %i5 + 0x34 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203f340: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203f344: 11 00 81 be sethi %hi(0x206f800), %o0 203f348: 92 07 60 10 add %i5, 0x10, %o1 203f34c: 7f ff 46 c7 call 2010e68 <_Watchdog_Insert> 203f350: 90 12 20 28 or %o0, 0x28, %o0 203f354: 30 80 00 1b b,a 203f3c0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 203f358: 12 80 00 1e bne 203f3d0 203f35c: 80 a7 20 04 cmp %i4, 4 /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 203f360: 7f ff ff 5f call 203f0dc <_Rate_monotonic_Update_statistics> 203f364: 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; 203f368: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 203f36c: 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; 203f370: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 203f374: 7f ff 13 33 call 2004040 203f378: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 203f37c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 203f380: c2 07 60 08 ld [ %i5 + 8 ], %g1 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 203f384: 13 00 00 10 sethi %hi(0x4000), %o1 203f388: 7f ff 45 a4 call 2010a18 <_Thread_Set_state> 203f38c: c2 22 20 20 st %g1, [ %o0 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 203f390: 7f ff 13 28 call 2004030 203f394: 01 00 00 00 nop local_state = the_period->state; 203f398: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 203f39c: f8 27 60 38 st %i4, [ %i5 + 0x38 ] _ISR_Enable( level ); 203f3a0: 7f ff 13 28 call 2004040 203f3a4: 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 ) 203f3a8: 80 a6 a0 03 cmp %i2, 3 203f3ac: 12 80 00 05 bne 203f3c0 203f3b0: 01 00 00 00 nop _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 203f3b4: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 203f3b8: 7f ff 42 81 call 200fdbc <_Thread_Clear_state> 203f3bc: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 203f3c0: 7f ff 43 5f call 201013c <_Thread_Enable_dispatch> 203f3c4: b0 10 20 00 clr %i0 203f3c8: 81 c7 e0 08 ret 203f3cc: 81 e8 00 00 restore return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 203f3d0: 12 bf ff b9 bne 203f2b4 <== NEVER TAKEN 203f3d4: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 203f3d8: 7f ff ff 41 call 203f0dc <_Rate_monotonic_Update_statistics> 203f3dc: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 203f3e0: 7f ff 13 18 call 2004040 203f3e4: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 203f3e8: 82 10 20 02 mov 2, %g1 203f3ec: 92 07 60 10 add %i5, 0x10, %o1 203f3f0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 203f3f4: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203f3f8: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203f3fc: 11 00 81 be sethi %hi(0x206f800), %o0 203f400: 7f ff 46 9a call 2010e68 <_Watchdog_Insert> 203f404: 90 12 20 28 or %o0, 0x28, %o0 ! 206f828 <_Watchdog_Ticks_chain> 203f408: d0 07 60 40 ld [ %i5 + 0x40 ], %o0 203f40c: d2 07 60 3c ld [ %i5 + 0x3c ], %o1 203f410: 03 00 81 ad sethi %hi(0x206b400), %g1 203f414: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 ! 206b43c <_Scheduler+0x34> 203f418: 9f c0 40 00 call %g1 203f41c: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Scheduler_Release_job(the_period->owner, the_period->next_length); _Thread_Enable_dispatch(); 203f420: 7f ff 43 47 call 201013c <_Thread_Enable_dispatch> 203f424: 01 00 00 00 nop 203f428: 81 c7 e0 08 ret 203f42c: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 203f430: b0 10 20 04 mov 4, %i0 } 203f434: 81 c7 e0 08 ret 203f438: 81 e8 00 00 restore =============================================================================== 0202a9c0 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 202a9c0: 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 ) 202a9c4: 80 a6 60 00 cmp %i1, 0 202a9c8: 02 80 00 75 be 202ab9c <== NEVER TAKEN 202a9cc: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 202a9d0: 13 00 81 91 sethi %hi(0x2064400), %o1 202a9d4: 9f c6 40 00 call %i1 202a9d8: 92 12 62 60 or %o1, 0x260, %o1 ! 2064660 <_TOD_Days_per_month+0x68> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 202a9dc: 90 10 00 18 mov %i0, %o0 202a9e0: 13 00 81 91 sethi %hi(0x2064400), %o1 202a9e4: 9f c6 40 00 call %i1 202a9e8: 92 12 62 80 or %o1, 0x280, %o1 ! 2064680 <_TOD_Days_per_month+0x88> (*print)( context, "--- Wall times are in seconds ---\n" ); 202a9ec: 90 10 00 18 mov %i0, %o0 202a9f0: 13 00 81 91 sethi %hi(0x2064400), %o1 202a9f4: 9f c6 40 00 call %i1 202a9f8: 92 12 62 a8 or %o1, 0x2a8, %o1 ! 20646a8 <_TOD_Days_per_month+0xb0> Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 202a9fc: 90 10 00 18 mov %i0, %o0 202aa00: 13 00 81 91 sethi %hi(0x2064400), %o1 202aa04: 9f c6 40 00 call %i1 202aa08: 92 12 62 d0 or %o1, 0x2d0, %o1 ! 20646d0 <_TOD_Days_per_month+0xd8> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 202aa0c: 90 10 00 18 mov %i0, %o0 202aa10: 13 00 81 91 sethi %hi(0x2064400), %o1 202aa14: 9f c6 40 00 call %i1 202aa18: 92 12 63 20 or %o1, 0x320, %o1 ! 2064720 <_TOD_Days_per_month+0x128> /* * 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 ; 202aa1c: 03 00 81 c0 sethi %hi(0x2070000), %g1 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202aa20: 39 00 81 91 sethi %hi(0x2064400), %i4 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, 202aa24: 37 00 81 91 sethi %hi(0x2064400), %i3 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, 202aa28: 35 00 81 91 sethi %hi(0x2064400), %i2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 202aa2c: 21 00 81 97 sethi %hi(0x2065c00), %l0 /* * 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 ; 202aa30: fa 00 63 28 ld [ %g1 + 0x328 ], %i5 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202aa34: b8 17 23 70 or %i4, 0x370, %i4 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, 202aa38: b6 16 e3 88 or %i3, 0x388, %i3 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, 202aa3c: b4 16 a3 a8 or %i2, 0x3a8, %i2 /* * 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 ; 202aa40: 10 80 00 52 b 202ab88 202aa44: a0 14 20 40 or %l0, 0x40, %l0 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 202aa48: 40 00 50 c9 call 203ed6c 202aa4c: 92 07 bf c8 add %fp, -56, %o1 if ( status != RTEMS_SUCCESSFUL ) 202aa50: 80 a2 20 00 cmp %o0, 0 202aa54: 32 80 00 4d bne,a 202ab88 202aa58: 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 ); 202aa5c: 92 07 bf b0 add %fp, -80, %o1 202aa60: 40 00 51 34 call 203ef30 202aa64: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 202aa68: d0 07 bf b0 ld [ %fp + -80 ], %o0 202aa6c: 92 10 20 05 mov 5, %o1 202aa70: 7f ff 89 d6 call 200d1c8 202aa74: 94 07 bf a0 add %fp, -96, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202aa78: d8 1f bf c8 ldd [ %fp + -56 ], %o4 202aa7c: 92 10 00 1c mov %i4, %o1 202aa80: 90 10 00 18 mov %i0, %o0 202aa84: 94 10 00 1d mov %i5, %o2 202aa88: 9f c6 40 00 call %i1 202aa8c: 96 07 bf a0 add %fp, -96, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 202aa90: d2 07 bf c8 ld [ %fp + -56 ], %o1 202aa94: 80 a2 60 00 cmp %o1, 0 202aa98: 12 80 00 07 bne 202aab4 202aa9c: 94 07 bf a8 add %fp, -88, %o2 (*print)( context, "\n" ); 202aaa0: 90 10 00 18 mov %i0, %o0 202aaa4: 9f c6 40 00 call %i1 202aaa8: 92 10 00 10 mov %l0, %o1 continue; 202aaac: 10 80 00 37 b 202ab88 202aab0: 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 ); 202aab4: 40 00 05 0c call 202bee4 <_Timespec_Divide_by_integer> 202aab8: 90 07 bf e0 add %fp, -32, %o0 (*print)( context, 202aabc: d0 07 bf d4 ld [ %fp + -44 ], %o0 202aac0: 40 00 c2 b2 call 205b588 <.div> 202aac4: 92 10 23 e8 mov 0x3e8, %o1 202aac8: a6 10 00 08 mov %o0, %l3 202aacc: d0 07 bf dc ld [ %fp + -36 ], %o0 202aad0: 40 00 c2 ae call 205b588 <.div> 202aad4: 92 10 23 e8 mov 0x3e8, %o1 202aad8: c2 07 bf a8 ld [ %fp + -88 ], %g1 202aadc: a2 10 00 08 mov %o0, %l1 202aae0: d0 07 bf ac ld [ %fp + -84 ], %o0 202aae4: e8 07 bf d0 ld [ %fp + -48 ], %l4 202aae8: e4 07 bf d8 ld [ %fp + -40 ], %l2 202aaec: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202aaf0: 40 00 c2 a6 call 205b588 <.div> 202aaf4: 92 10 23 e8 mov 0x3e8, %o1 202aaf8: 96 10 00 13 mov %l3, %o3 202aafc: 98 10 00 12 mov %l2, %o4 202ab00: 9a 10 00 11 mov %l1, %o5 202ab04: 94 10 00 14 mov %l4, %o2 202ab08: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202ab0c: 92 10 00 1b mov %i3, %o1 202ab10: 9f c6 40 00 call %i1 202ab14: 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); 202ab18: d2 07 bf c8 ld [ %fp + -56 ], %o1 202ab1c: 94 07 bf a8 add %fp, -88, %o2 202ab20: 40 00 04 f1 call 202bee4 <_Timespec_Divide_by_integer> 202ab24: 90 07 bf f8 add %fp, -8, %o0 (*print)( context, 202ab28: d0 07 bf ec ld [ %fp + -20 ], %o0 202ab2c: 40 00 c2 97 call 205b588 <.div> 202ab30: 92 10 23 e8 mov 0x3e8, %o1 202ab34: a6 10 00 08 mov %o0, %l3 202ab38: d0 07 bf f4 ld [ %fp + -12 ], %o0 202ab3c: 40 00 c2 93 call 205b588 <.div> 202ab40: 92 10 23 e8 mov 0x3e8, %o1 202ab44: c2 07 bf a8 ld [ %fp + -88 ], %g1 202ab48: a2 10 00 08 mov %o0, %l1 202ab4c: d0 07 bf ac ld [ %fp + -84 ], %o0 202ab50: e8 07 bf e8 ld [ %fp + -24 ], %l4 202ab54: e4 07 bf f0 ld [ %fp + -16 ], %l2 202ab58: 92 10 23 e8 mov 0x3e8, %o1 202ab5c: 40 00 c2 8b call 205b588 <.div> 202ab60: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202ab64: 92 10 00 1a mov %i2, %o1 202ab68: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202ab6c: 94 10 00 14 mov %l4, %o2 202ab70: 90 10 00 18 mov %i0, %o0 202ab74: 96 10 00 13 mov %l3, %o3 202ab78: 98 10 00 12 mov %l2, %o4 202ab7c: 9f c6 40 00 call %i1 202ab80: 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++ ) { 202ab84: 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 ; 202ab88: 03 00 81 c0 sethi %hi(0x2070000), %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 ; 202ab8c: c2 00 63 2c ld [ %g1 + 0x32c ], %g1 ! 207032c <_Rate_monotonic_Information+0xc> 202ab90: 80 a7 40 01 cmp %i5, %g1 202ab94: 08 bf ff ad bleu 202aa48 202ab98: 90 10 00 1d mov %i5, %o0 202ab9c: 81 c7 e0 08 ret 202aba0: 81 e8 00 00 restore =============================================================================== 02008a64 : return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { 2008a64: 9d e3 bf a0 save %sp, -96, %sp void *ptr = NULL; rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; 2008a68: fa 06 20 30 ld [ %i0 + 0x30 ], %i5 #include static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 2008a6c: 90 10 00 19 mov %i1, %o0 2008a70: 92 10 00 1d mov %i5, %o1 2008a74: 40 00 44 f8 call 2019e54 <.urem> 2008a78: b6 10 00 19 mov %i1, %i3 if (excess > 0) { 2008a7c: 80 a2 20 00 cmp %o0, 0 2008a80: 02 80 00 05 be 2008a94 <== ALWAYS TAKEN 2008a84: 80 a6 c0 19 cmp %i3, %i1 value += alignment - excess; 2008a88: b6 06 40 1d add %i1, %i5, %i3 <== NOT EXECUTED 2008a8c: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { 2008a90: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED 2008a94: 0a 80 00 04 bcs 2008aa4 <== NEVER TAKEN 2008a98: 80 a6 60 00 cmp %i1, 0 2008a9c: 32 80 00 04 bne,a 2008aac 2008aa0: c2 06 00 00 ld [ %i0 ], %g1 return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { void *ptr = NULL; 2008aa4: 81 c7 e0 08 ret 2008aa8: 91 e8 20 00 restore %g0, 0, %o0 rtems_chain_control *free_chain, size_t size ) { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); 2008aac: 84 06 20 04 add %i0, 4, %g2 rtems_rbheap_chunk *big_enough = NULL; 2008ab0: 10 80 00 06 b 2008ac8 2008ab4: ba 10 20 00 clr %i5 while (current != tail && big_enough == NULL) { rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current; if (free_chunk->size >= size) { 2008ab8: 80 a0 c0 1b cmp %g3, %i3 2008abc: ba 40 3f ff addx %g0, -1, %i5 2008ac0: ba 08 40 1d and %g1, %i5, %i5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2008ac4: c2 00 40 00 ld [ %g1 ], %g1 { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_chunk *big_enough = NULL; while (current != tail && big_enough == NULL) { 2008ac8: 80 a7 60 00 cmp %i5, 0 2008acc: 12 80 00 04 bne 2008adc 2008ad0: 80 a0 40 02 cmp %g1, %g2 2008ad4: 32 bf ff f9 bne,a 2008ab8 2008ad8: c6 00 60 1c ld [ %g1 + 0x1c ], %g3 uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { rtems_rbheap_chunk *free_chunk = search_free_chunk(free_chain, aligned_size); if (free_chunk != NULL) { 2008adc: 80 a7 60 00 cmp %i5, 0 2008ae0: 02 bf ff f1 be 2008aa4 2008ae4: 01 00 00 00 nop uintptr_t free_size = free_chunk->size; 2008ae8: f4 07 60 1c ld [ %i5 + 0x1c ], %i2 if (free_size > aligned_size) { 2008aec: 80 a6 80 1b cmp %i2, %i3 2008af0: 28 80 00 14 bleu,a 2008b40 2008af4: c4 07 40 00 ld [ %i5 ], %g2 rtems_rbheap_chunk *new_chunk = get_chunk(control); 2008af8: 7f ff ff 80 call 20088f8 2008afc: 90 10 00 18 mov %i0, %o0 if (new_chunk != NULL) { 2008b00: b8 92 20 00 orcc %o0, 0, %i4 2008b04: 02 bf ff e8 be 2008aa4 <== NEVER TAKEN 2008b08: b4 26 80 1b sub %i2, %i3, %i2 uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 2008b0c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 rtems_rbheap_chunk *new_chunk = get_chunk(control); if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; 2008b10: f4 27 60 1c st %i2, [ %i5 + 0x1c ] new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; 2008b14: f6 27 20 1c st %i3, [ %i4 + 0x1c ] if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 2008b18: b4 06 80 01 add %i2, %g1, %i2 */ RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain( Chain_Node *node ) { node->next = node->previous = NULL; 2008b1c: c0 27 20 04 clr [ %i4 + 4 ] 2008b20: f4 27 20 18 st %i2, [ %i4 + 0x18 ] 2008b24: c0 27 00 00 clr [ %i4 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_chunk *chunk ) { _RBTree_Insert_unprotected(tree, &chunk->tree_node); 2008b28: 90 06 20 18 add %i0, 0x18, %o0 2008b2c: 40 00 06 a9 call 200a5d0 <_RBTree_Insert_unprotected> 2008b30: 92 07 20 08 add %i4, 8, %o1 free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; rtems_chain_set_off_chain(&new_chunk->chain_node); insert_into_tree(chunk_tree, new_chunk); ptr = (void *) new_chunk->begin; 2008b34: f0 07 20 18 ld [ %i4 + 0x18 ], %i0 2008b38: 81 c7 e0 08 ret 2008b3c: 81 e8 00 00 restore { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008b40: c2 07 60 04 ld [ %i5 + 4 ], %g1 } } else { rtems_chain_extract_unprotected(&free_chunk->chain_node); rtems_chain_set_off_chain(&free_chunk->chain_node); ptr = (void *) free_chunk->begin; 2008b44: f0 07 60 18 ld [ %i5 + 0x18 ], %i0 next->previous = previous; 2008b48: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 2008b4c: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain( Chain_Node *node ) { node->next = node->previous = NULL; 2008b50: c0 27 60 04 clr [ %i5 + 4 ] 2008b54: c0 27 40 00 clr [ %i5 ] } } } return ptr; } 2008b58: 81 c7 e0 08 ret 2008b5c: 81 e8 00 00 restore =============================================================================== 02008c90 : /* Do nothing */ } void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control) { 2008c90: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk)); 2008c94: 7f ff ed 8d call 20042c8 <== NOT EXECUTED 2008c98: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED if (chunk != NULL) { 2008c9c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2008ca0: 02 80 00 07 be 2008cbc <== NOT EXECUTED 2008ca4: 82 06 20 0c add %i0, 0xc, %g1 <== NOT EXECUTED Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008ca8: c2 22 20 04 st %g1, [ %o0 + 4 ] <== NOT EXECUTED before_node = after_node->next; 2008cac: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED after_node->next = the_node; 2008cb0: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED the_node->next = before_node; 2008cb4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED before_node->previous = the_node; 2008cb8: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED 2008cbc: 81 c7 e0 08 ret <== NOT EXECUTED 2008cc0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008b60 : _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); } } rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { 2008b60: 9d e3 bf 80 save %sp, -128, %sp 2008b64: b6 10 00 18 mov %i0, %i3 rtems_status_code sc = RTEMS_SUCCESSFUL; if (ptr != NULL) { 2008b68: 80 a6 60 00 cmp %i1, 0 2008b6c: 02 80 00 45 be 2008c80 2008b70: b0 10 20 00 clr %i0 #define NULL_PAGE rtems_rbheap_chunk_of_node(NULL) static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key) { rtems_rbheap_chunk chunk = { .begin = key }; 2008b74: 90 07 bf e0 add %fp, -32, %o0 2008b78: 92 10 20 00 clr %o1 2008b7c: 94 10 20 20 mov 0x20, %o2 2008b80: 40 00 22 ed call 2011734 2008b84: b4 06 e0 18 add %i3, 0x18, %i2 RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; 2008b88: ba 10 20 00 clr %i5 2008b8c: f2 27 bf f8 st %i1, [ %fp + -8 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 2008b90: 10 80 00 12 b 2008bd8 2008b94: f8 06 e0 1c ld [ %i3 + 0x1c ], %i4 RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); 2008b98: 90 07 bf e8 add %fp, -24, %o0 2008b9c: 9f c0 40 00 call %g1 2008ba0: 92 10 00 1c mov %i4, %o1 if ( _RBTree_Is_equal( compare_result ) ) { 2008ba4: 80 a2 20 00 cmp %o0, 0 2008ba8: 12 80 00 07 bne 2008bc4 2008bac: 83 3a 20 1f sra %o0, 0x1f, %g1 found = iter_node; if ( the_rbtree->is_unique ) 2008bb0: c2 0e a0 14 ldub [ %i2 + 0x14 ], %g1 2008bb4: 80 a0 60 00 cmp %g1, 0 2008bb8: 12 80 00 0c bne 2008be8 <== ALWAYS TAKEN 2008bbc: ba 10 00 1c mov %i4, %i5 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 2008bc0: 83 3a 20 1f sra %o0, 0x1f, %g1 <== NOT EXECUTED 2008bc4: 90 20 40 08 sub %g1, %o0, %o0 2008bc8: 91 32 20 1f srl %o0, 0x1f, %o0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 2008bcc: 91 2a 20 02 sll %o0, 2, %o0 2008bd0: b8 07 00 08 add %i4, %o0, %i4 2008bd4: f8 07 20 04 ld [ %i4 + 4 ], %i4 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 2008bd8: 80 a7 20 00 cmp %i4, 0 2008bdc: 32 bf ff ef bne,a 2008b98 2008be0: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1 2008be4: b8 10 00 1d mov %i5, %i4 return rtems_rbheap_chunk_of_node( 2008be8: ba 07 3f f8 add %i4, -8, %i5 if (ptr != NULL) { rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; rtems_rbheap_chunk *chunk = find(chunk_tree, (uintptr_t) ptr); if (chunk != NULL_PAGE) { 2008bec: 80 a7 7f f8 cmp %i5, -8 2008bf0: 02 80 00 24 be 2008c80 2008bf4: b0 10 20 04 mov 4, %i0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2008bf8: c4 07 3f f8 ld [ %i4 + -8 ], %g2 2008bfc: 80 a0 a0 00 cmp %g2, 0 2008c00: 12 80 00 05 bne 2008c14 2008c04: 82 10 20 00 clr %g1 2008c08: c2 07 60 04 ld [ %i5 + 4 ], %g1 2008c0c: 80 a0 00 01 cmp %g0, %g1 2008c10: 82 60 3f ff subx %g0, -1, %g1 if (!rtems_rbheap_is_chunk_free(chunk)) { 2008c14: 80 a0 60 00 cmp %g1, 0 2008c18: 02 80 00 1a be 2008c80 2008c1c: b0 10 20 0e mov 0xe, %i0 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 2008c20: b8 07 60 08 add %i5, 8, %i4 2008c24: 92 10 20 00 clr %o1 2008c28: 40 00 07 0f call 200a864 <_RBTree_Next_unprotected> 2008c2c: 90 10 00 1c mov %i4, %o0 2008c30: 92 10 20 01 mov 1, %o1 2008c34: b2 10 00 08 mov %o0, %i1 2008c38: 40 00 07 0b call 200a864 <_RBTree_Next_unprotected> 2008c3c: 90 10 00 1c mov %i4, %o0 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 2008c40: 92 10 00 1a mov %i2, %o1 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 2008c44: 96 02 3f f8 add %o0, -8, %o3 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 2008c48: 94 10 00 1d mov %i5, %o2 2008c4c: 7f ff ff 02 call 2008854 2008c50: 90 10 00 1b mov %i3, %o0 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008c54: c2 06 c0 00 ld [ %i3 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008c58: f6 27 60 04 st %i3, [ %i5 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008c5c: fa 26 c0 00 st %i5, [ %i3 ] the_node->next = before_node; 2008c60: c2 27 40 00 st %g1, [ %i5 ] before_node->previous = the_node; 2008c64: fa 20 60 04 st %i5, [ %g1 + 4 ] add_to_chain(free_chain, chunk); check_and_merge(free_chain, chunk_tree, chunk, pred); 2008c68: 90 10 00 1b mov %i3, %o0 2008c6c: 92 10 00 1a mov %i2, %o1 2008c70: 94 10 00 1d mov %i5, %o2 2008c74: 96 06 7f f8 add %i1, -8, %o3 2008c78: 7f ff fe f7 call 2008854 2008c7c: b0 10 20 00 clr %i0 sc = RTEMS_INVALID_ID; } } return sc; } 2008c80: 81 c7 e0 08 ret 2008c84: 81 e8 00 00 restore =============================================================================== 02017a10 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2017a10: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 2017a14: 80 a6 60 00 cmp %i1, 0 2017a18: 02 80 00 35 be 2017aec 2017a1c: 82 10 20 0a mov 0xa, %g1 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2017a20: 90 10 00 18 mov %i0, %o0 2017a24: 40 00 12 a7 call 201c4c0 <_Thread_Get> 2017a28: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2017a2c: c2 07 bf fc ld [ %fp + -4 ], %g1 2017a30: 80 a0 60 00 cmp %g1, 0 2017a34: 12 80 00 2d bne 2017ae8 2017a38: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2017a3c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2017a40: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2017a44: 80 a0 60 00 cmp %g1, 0 2017a48: 02 80 00 24 be 2017ad8 2017a4c: 01 00 00 00 nop if ( asr->is_enabled ) { 2017a50: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2017a54: 80 a0 60 00 cmp %g1, 0 2017a58: 02 80 00 15 be 2017aac 2017a5c: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2017a60: 7f ff e3 64 call 20107f0 2017a64: 01 00 00 00 nop *signal_set |= signals; 2017a68: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2017a6c: b2 10 40 19 or %g1, %i1, %i1 2017a70: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2017a74: 7f ff e3 63 call 2010800 2017a78: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2017a7c: 03 00 80 f4 sethi %hi(0x203d000), %g1 2017a80: 82 10 62 a0 or %g1, 0x2a0, %g1 ! 203d2a0 <_Per_CPU_Information> 2017a84: c4 00 60 08 ld [ %g1 + 8 ], %g2 2017a88: 80 a0 a0 00 cmp %g2, 0 2017a8c: 02 80 00 0f be 2017ac8 2017a90: 01 00 00 00 nop 2017a94: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2017a98: 80 a7 00 02 cmp %i4, %g2 2017a9c: 12 80 00 0b bne 2017ac8 <== NEVER TAKEN 2017aa0: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2017aa4: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2017aa8: 30 80 00 08 b,a 2017ac8 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2017aac: 7f ff e3 51 call 20107f0 2017ab0: 01 00 00 00 nop *signal_set |= signals; 2017ab4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2017ab8: b2 10 40 19 or %g1, %i1, %i1 2017abc: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2017ac0: 7f ff e3 50 call 2010800 2017ac4: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2017ac8: 40 00 12 71 call 201c48c <_Thread_Enable_dispatch> 2017acc: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2017ad0: 10 80 00 07 b 2017aec 2017ad4: 82 10 20 00 clr %g1 ! 0 } _Thread_Enable_dispatch(); 2017ad8: 40 00 12 6d call 201c48c <_Thread_Enable_dispatch> 2017adc: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2017ae0: 10 80 00 03 b 2017aec 2017ae4: 82 10 20 0b mov 0xb, %g1 ! b case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2017ae8: 82 10 20 04 mov 4, %g1 } 2017aec: 81 c7 e0 08 ret 2017af0: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200f460 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200f460: 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 ) 200f464: 80 a6 a0 00 cmp %i2, 0 200f468: 02 80 00 5a be 200f5d0 200f46c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200f470: 03 00 80 78 sethi %hi(0x201e000), %g1 200f474: f8 00 60 1c ld [ %g1 + 0x1c ], %i4 ! 201e01c <_Per_CPU_Information+0xc> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f478: c2 0f 20 70 ldub [ %i4 + 0x70 ], %g1 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200f47c: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f480: 80 a0 00 01 cmp %g0, %g1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f484: c2 07 20 78 ld [ %i4 + 0x78 ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f488: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f48c: 80 a0 60 00 cmp %g1, 0 200f490: 02 80 00 03 be 200f49c 200f494: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200f498: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f49c: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 200f4a0: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200f4a4: 7f ff f0 06 call 200b4bc <_CPU_ISR_Get_level> 200f4a8: 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; 200f4ac: a1 2c 20 0a sll %l0, 0xa, %l0 200f4b0: 90 14 00 08 or %l0, %o0, %o0 old_mode |= _ISR_Get_level(); 200f4b4: b6 12 00 1b or %o0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200f4b8: 80 8e 61 00 btst 0x100, %i1 200f4bc: 02 80 00 06 be 200f4d4 200f4c0: 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; 200f4c4: 83 36 20 08 srl %i0, 8, %g1 200f4c8: 82 18 60 01 xor %g1, 1, %g1 200f4cc: 82 08 60 01 and %g1, 1, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200f4d0: c2 2f 20 70 stb %g1, [ %i4 + 0x70 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200f4d4: 80 8e 62 00 btst 0x200, %i1 200f4d8: 02 80 00 0b be 200f504 200f4dc: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200f4e0: 80 8e 22 00 btst 0x200, %i0 200f4e4: 22 80 00 07 be,a 200f500 200f4e8: c0 27 20 78 clr [ %i4 + 0x78 ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200f4ec: 82 10 20 01 mov 1, %g1 200f4f0: c2 27 20 78 st %g1, [ %i4 + 0x78 ] executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200f4f4: 03 00 80 76 sethi %hi(0x201d800), %g1 200f4f8: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 ! 201da40 <_Thread_Ticks_per_timeslice> 200f4fc: c2 27 20 74 st %g1, [ %i4 + 0x74 ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f500: 80 8e 60 0f btst 0xf, %i1 200f504: 02 80 00 06 be 200f51c 200f508: 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 ); 200f50c: 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 ) ); 200f510: 7f ff cc 71 call 20026d4 200f514: 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 ) { 200f518: 80 8e 64 00 btst 0x400, %i1 200f51c: 02 80 00 14 be 200f56c 200f520: 88 10 20 00 clr %g4 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200f524: c2 0f 60 08 ldub [ %i5 + 8 ], %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; 200f528: b1 36 20 0a srl %i0, 0xa, %i0 200f52c: b0 1e 20 01 xor %i0, 1, %i0 200f530: b0 0e 20 01 and %i0, 1, %i0 if ( is_asr_enabled != asr->is_enabled ) { 200f534: 80 a6 00 01 cmp %i0, %g1 200f538: 22 80 00 0e be,a 200f570 200f53c: 03 00 80 77 sethi %hi(0x201dc00), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200f540: 7f ff cc 61 call 20026c4 200f544: f0 2f 60 08 stb %i0, [ %i5 + 8 ] _signals = information->signals_pending; 200f548: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 information->signals_pending = information->signals_posted; 200f54c: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 information->signals_posted = _signals; 200f550: 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; 200f554: c4 27 60 18 st %g2, [ %i5 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200f558: 7f ff cc 5f call 20026d4 200f55c: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200f560: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200f564: 80 a0 00 01 cmp %g0, %g1 200f568: 88 40 20 00 addx %g0, 0, %g4 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200f56c: 03 00 80 77 sethi %hi(0x201dc00), %g1 200f570: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201dc20 <_System_state_Current> 200f574: 80 a0 a0 03 cmp %g2, 3 200f578: 12 80 00 16 bne 200f5d0 200f57c: 82 10 20 00 clr %g1 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200f580: 07 00 80 78 sethi %hi(0x201e000), %g3 if ( are_signals_pending || 200f584: 80 89 20 ff btst 0xff, %g4 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200f588: 86 10 e0 10 or %g3, 0x10, %g3 if ( are_signals_pending || 200f58c: 12 80 00 0a bne 200f5b4 200f590: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 200f594: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 200f598: 80 a0 80 03 cmp %g2, %g3 200f59c: 02 80 00 0d be 200f5d0 200f5a0: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200f5a4: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200f5a8: 80 a0 a0 00 cmp %g2, 0 200f5ac: 02 80 00 09 be 200f5d0 <== NEVER TAKEN 200f5b0: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200f5b4: 84 10 20 01 mov 1, %g2 ! 1 200f5b8: 03 00 80 78 sethi %hi(0x201e000), %g1 200f5bc: 82 10 60 10 or %g1, 0x10, %g1 ! 201e010 <_Per_CPU_Information> 200f5c0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200f5c4: 7f ff ea a5 call 200a058 <_Thread_Dispatch> 200f5c8: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200f5cc: 82 10 20 00 clr %g1 ! 0 } 200f5d0: 81 c7 e0 08 ret 200f5d4: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200bf30 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200bf30: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200bf34: 80 a6 60 00 cmp %i1, 0 200bf38: 02 80 00 08 be 200bf58 200bf3c: 80 a6 a0 00 cmp %i2, 0 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 ) ); 200bf40: 03 00 80 84 sethi %hi(0x2021000), %g1 200bf44: c4 08 61 98 ldub [ %g1 + 0x198 ], %g2 ! 2021198 200bf48: 80 a6 40 02 cmp %i1, %g2 200bf4c: 18 80 00 1e bgu 200bfc4 200bf50: 82 10 20 13 mov 0x13, %g1 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200bf54: 80 a6 a0 00 cmp %i2, 0 200bf58: 02 80 00 1b be 200bfc4 200bf5c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200bf60: 90 10 00 18 mov %i0, %o0 200bf64: 40 00 09 8a call 200e58c <_Thread_Get> 200bf68: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200bf6c: c2 07 bf fc ld [ %fp + -4 ], %g1 200bf70: 80 a0 60 00 cmp %g1, 0 200bf74: 12 80 00 14 bne 200bfc4 200bf78: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200bf7c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200bf80: 80 a6 60 00 cmp %i1, 0 200bf84: 02 80 00 0d be 200bfb8 200bf88: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200bf8c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200bf90: 80 a0 60 00 cmp %g1, 0 200bf94: 02 80 00 06 be 200bfac 200bf98: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200bf9c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200bfa0: 80 a0 40 19 cmp %g1, %i1 200bfa4: 08 80 00 05 bleu 200bfb8 <== ALWAYS TAKEN 200bfa8: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200bfac: 92 10 00 19 mov %i1, %o1 200bfb0: 40 00 08 45 call 200e0c4 <_Thread_Change_priority> 200bfb4: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200bfb8: 40 00 09 68 call 200e558 <_Thread_Enable_dispatch> 200bfbc: 01 00 00 00 nop 200bfc0: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200bfc4: 81 c7 e0 08 ret 200bfc8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0201844c : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 201844c: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2018450: 11 00 80 f5 sethi %hi(0x203d400), %o0 2018454: 92 10 00 18 mov %i0, %o1 2018458: 90 12 22 e4 or %o0, 0x2e4, %o0 201845c: 40 00 0c 36 call 201b534 <_Objects_Get> 2018460: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2018464: c2 07 bf fc ld [ %fp + -4 ], %g1 2018468: 80 a0 60 00 cmp %g1, 0 201846c: 12 80 00 0c bne 201849c 2018470: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2018474: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2018478: 80 a0 60 04 cmp %g1, 4 201847c: 02 80 00 04 be 201848c <== NEVER TAKEN 2018480: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2018484: 40 00 14 35 call 201d558 <_Watchdog_Remove> 2018488: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 201848c: 40 00 10 00 call 201c48c <_Thread_Enable_dispatch> 2018490: b0 10 20 00 clr %i0 2018494: 81 c7 e0 08 ret 2018498: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 201849c: 81 c7 e0 08 ret 20184a0: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02018960 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2018960: 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; 2018964: 03 00 80 f5 sethi %hi(0x203d400), %g1 2018968: f8 00 63 24 ld [ %g1 + 0x324 ], %i4 ! 203d724 <_Timer_server> if ( !timer_server ) 201896c: 80 a7 20 00 cmp %i4, 0 2018970: 02 80 00 3c be 2018a60 2018974: 82 10 20 0e mov 0xe, %g1 return RTEMS_INCORRECT_STATE; if ( !_TOD.is_set ) 2018978: 21 00 80 f3 sethi %hi(0x203cc00), %l0 201897c: 82 14 20 b8 or %l0, 0xb8, %g1 ! 203ccb8 <_TOD> 2018980: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2 2018984: 80 a0 a0 00 cmp %g2, 0 2018988: 02 80 00 36 be 2018a60 <== NEVER TAKEN 201898c: 82 10 20 0b mov 0xb, %g1 return RTEMS_NOT_DEFINED; if ( !routine ) 2018990: 80 a6 a0 00 cmp %i2, 0 2018994: 02 80 00 33 be 2018a60 2018998: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 201899c: 7f ff f3 82 call 20157a4 <_TOD_Validate> 20189a0: 90 10 00 19 mov %i1, %o0 20189a4: 80 8a 20 ff btst 0xff, %o0 20189a8: 02 80 00 2e be 2018a60 20189ac: 82 10 20 14 mov 0x14, %g1 return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 20189b0: 7f ff f3 43 call 20156bc <_TOD_To_seconds> 20189b4: 90 10 00 19 mov %i1, %o0 20189b8: b2 10 00 08 mov %o0, %i1 20189bc: d0 1c 20 b8 ldd [ %l0 + 0xb8 ], %o0 20189c0: 94 10 20 00 clr %o2 20189c4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20189c8: 40 00 50 11 call 202ca0c <__divdi3> 20189cc: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 if ( seconds <= _TOD_Seconds_since_epoch() ) 20189d0: 80 a6 40 09 cmp %i1, %o1 20189d4: 08 80 00 23 bleu 2018a60 20189d8: 82 10 20 14 mov 0x14, %g1 20189dc: 11 00 80 f5 sethi %hi(0x203d400), %o0 20189e0: 92 10 00 18 mov %i0, %o1 20189e4: 90 12 22 e4 or %o0, 0x2e4, %o0 20189e8: 40 00 0a d3 call 201b534 <_Objects_Get> 20189ec: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 20189f0: c2 07 bf fc ld [ %fp + -4 ], %g1 20189f4: 80 a0 60 00 cmp %g1, 0 20189f8: 12 80 00 19 bne 2018a5c 20189fc: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2018a00: 40 00 12 d6 call 201d558 <_Watchdog_Remove> 2018a04: 90 02 20 10 add %o0, 0x10, %o0 2018a08: d0 1c 20 b8 ldd [ %l0 + 0xb8 ], %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2018a0c: 82 10 20 03 mov 3, %g1 2018a10: 94 10 20 00 clr %o2 2018a14: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2018a18: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 2018a1c: f4 27 60 2c st %i2, [ %i5 + 0x2c ] the_watchdog->id = id; 2018a20: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 2018a24: f6 27 60 34 st %i3, [ %i5 + 0x34 ] 2018a28: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2018a2c: 40 00 4f f8 call 202ca0c <__divdi3> 2018a30: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 2018a34: c2 07 20 04 ld [ %i4 + 4 ], %g1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2018a38: 92 26 40 09 sub %i1, %o1, %o1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2018a3c: 90 10 00 1c mov %i4, %o0 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(); 2018a40: d2 27 60 1c st %o1, [ %i5 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2018a44: 9f c0 40 00 call %g1 2018a48: 92 10 00 1d mov %i5, %o1 _Thread_Enable_dispatch(); 2018a4c: 40 00 0e 90 call 201c48c <_Thread_Enable_dispatch> 2018a50: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2018a54: 10 80 00 03 b 2018a60 2018a58: 82 10 20 00 clr %g1 ! 0 #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2018a5c: 82 10 20 04 mov 4, %g1 } 2018a60: 81 c7 e0 08 ret 2018a64: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02007f20 : #include int sched_get_priority_max( int policy ) { 2007f20: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2007f24: 80 a6 20 04 cmp %i0, 4 2007f28: 18 80 00 06 bgu 2007f40 2007f2c: 82 10 20 01 mov 1, %g1 2007f30: b1 28 40 18 sll %g1, %i0, %i0 2007f34: 80 8e 20 17 btst 0x17, %i0 2007f38: 12 80 00 08 bne 2007f58 <== ALWAYS TAKEN 2007f3c: 03 00 80 86 sethi %hi(0x2021800), %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2007f40: 40 00 21 86 call 2010558 <__errno> 2007f44: b0 10 3f ff mov -1, %i0 2007f48: 82 10 20 16 mov 0x16, %g1 2007f4c: c2 22 00 00 st %g1, [ %o0 ] 2007f50: 81 c7 e0 08 ret 2007f54: 81 e8 00 00 restore } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2007f58: f0 08 62 48 ldub [ %g1 + 0x248 ], %i0 } 2007f5c: 81 c7 e0 08 ret 2007f60: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02007f64 : #include int sched_get_priority_min( int policy ) { 2007f64: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2007f68: 80 a6 20 04 cmp %i0, 4 2007f6c: 18 80 00 06 bgu 2007f84 2007f70: 82 10 20 01 mov 1, %g1 2007f74: 83 28 40 18 sll %g1, %i0, %g1 2007f78: 80 88 60 17 btst 0x17, %g1 2007f7c: 12 80 00 06 bne 2007f94 <== ALWAYS TAKEN 2007f80: b0 10 20 01 mov 1, %i0 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2007f84: 40 00 21 75 call 2010558 <__errno> 2007f88: b0 10 3f ff mov -1, %i0 2007f8c: 82 10 20 16 mov 0x16, %g1 2007f90: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2007f94: 81 c7 e0 08 ret 2007f98: 81 e8 00 00 restore =============================================================================== 02007f9c : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2007f9c: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2007fa0: 80 a6 20 00 cmp %i0, 0 2007fa4: 02 80 00 0b be 2007fd0 <== NEVER TAKEN 2007fa8: 80 a6 60 00 cmp %i1, 0 2007fac: 7f ff ef 93 call 2003df8 2007fb0: 01 00 00 00 nop 2007fb4: 80 a6 00 08 cmp %i0, %o0 2007fb8: 02 80 00 06 be 2007fd0 2007fbc: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2007fc0: 40 00 21 66 call 2010558 <__errno> 2007fc4: 01 00 00 00 nop 2007fc8: 10 80 00 07 b 2007fe4 2007fcc: 82 10 20 03 mov 3, %g1 ! 3 if ( !interval ) 2007fd0: 12 80 00 08 bne 2007ff0 2007fd4: 03 00 80 89 sethi %hi(0x2022400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2007fd8: 40 00 21 60 call 2010558 <__errno> 2007fdc: 01 00 00 00 nop 2007fe0: 82 10 20 16 mov 0x16, %g1 ! 16 2007fe4: c2 22 00 00 st %g1, [ %o0 ] 2007fe8: 81 c7 e0 08 ret 2007fec: 91 e8 3f ff restore %g0, -1, %o0 _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2007ff0: d0 00 63 40 ld [ %g1 + 0x340 ], %o0 2007ff4: 92 10 00 19 mov %i1, %o1 2007ff8: 40 00 0e 99 call 200ba5c <_Timespec_From_ticks> 2007ffc: b0 10 20 00 clr %i0 return 0; } 2008000: 81 c7 e0 08 ret 2008004: 81 e8 00 00 restore =============================================================================== 020086cc : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 20086cc: 9d e3 bf 88 save %sp, -120, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20086d0: 03 00 80 89 sethi %hi(0x2022400), %g1 20086d4: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 20225f0 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 20086d8: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 20086dc: 84 00 a0 01 inc %g2 20086e0: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 20086e4: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 20086e8: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 20086ec: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 20086f0: fa 27 a0 58 st %i5, [ %fp + 0x58 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 20086f4: b4 8e 62 00 andcc %i1, 0x200, %i2 20086f8: 02 80 00 05 be 200870c 20086fc: b8 10 20 00 clr %i4 va_start(arg, oflag); mode = va_arg( arg, mode_t ); value = va_arg( arg, unsigned int ); 2008700: f8 07 a0 50 ld [ %fp + 0x50 ], %i4 size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2008704: 82 07 a0 4c add %fp, 0x4c, %g1 2008708: c2 27 bf ec st %g1, [ %fp + -20 ] const char *name, Objects_Id *id, size_t *len ) { return _POSIX_Name_to_id( &_POSIX_Semaphore_Information, name, id, len ); 200870c: 37 00 80 8a sethi %hi(0x2022800), %i3 2008710: 92 10 00 18 mov %i0, %o1 2008714: 90 16 e0 e0 or %i3, 0xe0, %o0 2008718: 94 07 bf f0 add %fp, -16, %o2 200871c: 7f ff fe 7d call 2008110 <_POSIX_Name_to_id> 2008720: 96 07 bf fc add %fp, -4, %o3 * 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 ) { 2008724: ba 92 20 00 orcc %o0, 0, %i5 2008728: 22 80 00 0e be,a 2008760 200872c: 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) ) ) { 2008730: 80 a7 60 02 cmp %i5, 2 2008734: 12 80 00 04 bne 2008744 2008738: 80 a6 a0 00 cmp %i2, 0 200873c: 12 80 00 20 bne 20087bc 2008740: d2 07 bf fc ld [ %fp + -4 ], %o1 _Thread_Enable_dispatch(); 2008744: 40 00 0d cc call 200be74 <_Thread_Enable_dispatch> 2008748: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 200874c: 40 00 24 89 call 2011970 <__errno> 2008750: 01 00 00 00 nop 2008754: fa 22 00 00 st %i5, [ %o0 ] 2008758: 81 c7 e0 08 ret 200875c: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2008760: 80 a6 6a 00 cmp %i1, 0xa00 2008764: 12 80 00 0a bne 200878c 2008768: d2 07 bf f0 ld [ %fp + -16 ], %o1 _Thread_Enable_dispatch(); 200876c: 40 00 0d c2 call 200be74 <_Thread_Enable_dispatch> 2008770: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2008774: 40 00 24 7f call 2011970 <__errno> 2008778: 01 00 00 00 nop 200877c: 82 10 20 11 mov 0x11, %g1 ! 11 2008780: c2 22 00 00 st %g1, [ %o0 ] 2008784: 81 c7 e0 08 ret 2008788: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Get ( sem_t *id, Objects_Locations *location ) { return (POSIX_Semaphore_Control *) 200878c: 94 07 bf f8 add %fp, -8, %o2 2008790: 40 00 09 d4 call 200aee0 <_Objects_Get> 2008794: 90 16 e0 e0 or %i3, 0xe0, %o0 } the_semaphore = _POSIX_Semaphore_Get( (sem_t *) &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2008798: 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( (sem_t *) &the_semaphore_id, &location ); 200879c: d0 27 bf f4 st %o0, [ %fp + -12 ] the_semaphore->open_count += 1; 20087a0: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 20087a4: 40 00 0d b4 call 200be74 <_Thread_Enable_dispatch> 20087a8: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 20087ac: 40 00 0d b2 call 200be74 <_Thread_Enable_dispatch> 20087b0: 01 00 00 00 nop goto return_id; 20087b4: 10 80 00 0d b 20087e8 20087b8: f0 07 bf f4 ld [ %fp + -12 ], %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( 20087bc: 94 10 20 00 clr %o2 20087c0: 96 10 00 1c mov %i4, %o3 20087c4: 98 07 bf f4 add %fp, -12, %o4 20087c8: 40 00 19 94 call 200ee18 <_POSIX_Semaphore_Create_support> 20087cc: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 20087d0: 40 00 0d a9 call 200be74 <_Thread_Enable_dispatch> 20087d4: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 20087d8: 80 a7 7f ff cmp %i5, -1 20087dc: 22 80 00 04 be,a 20087ec <== NEVER TAKEN 20087e0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED return_id: #if defined(RTEMS_USE_16_BIT_OBJECT) the_semaphore->Semaphore_id = the_semaphore->Object.id; return &the_semaphore->Semaphore_id; #else return (sem_t *)&the_semaphore->Object.id; 20087e4: f0 07 bf f4 ld [ %fp + -12 ], %i0 20087e8: b0 06 20 08 add %i0, 8, %i0 #endif } 20087ec: 81 c7 e0 08 ret 20087f0: 81 e8 00 00 restore =============================================================================== 02007f00 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 2007f00: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2007f04: 80 a6 a0 00 cmp %i2, 0 2007f08: 02 80 00 0a be 2007f30 2007f0c: 83 2e 20 02 sll %i0, 2, %g1 *oact = _POSIX_signals_Vectors[ sig ]; 2007f10: 85 2e 20 04 sll %i0, 4, %g2 2007f14: 82 20 80 01 sub %g2, %g1, %g1 2007f18: 13 00 80 85 sethi %hi(0x2021400), %o1 2007f1c: 90 10 00 1a mov %i2, %o0 2007f20: 92 12 62 90 or %o1, 0x290, %o1 2007f24: 94 10 20 0c mov 0xc, %o2 2007f28: 40 00 25 3c call 2011418 2007f2c: 92 02 40 01 add %o1, %g1, %o1 if ( !sig ) 2007f30: 80 a6 20 00 cmp %i0, 0 2007f34: 32 80 00 03 bne,a 2007f40 2007f38: 82 06 3f ff add %i0, -1, %g1 2007f3c: 30 80 00 06 b,a 2007f54 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2007f40: 80 a0 60 1f cmp %g1, 0x1f 2007f44: 18 80 00 04 bgu 2007f54 2007f48: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2007f4c: 12 80 00 08 bne 2007f6c 2007f50: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2007f54: 40 00 22 e6 call 2010aec <__errno> 2007f58: 01 00 00 00 nop 2007f5c: 82 10 20 16 mov 0x16, %g1 ! 16 2007f60: c2 22 00 00 st %g1, [ %o0 ] 2007f64: 10 80 00 20 b 2007fe4 2007f68: 82 10 3f ff mov -1, %g1 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2007f6c: 02 80 00 1e be 2007fe4 <== NEVER TAKEN 2007f70: 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 ); 2007f74: 7f ff ea b8 call 2002a54 2007f78: 01 00 00 00 nop 2007f7c: b8 10 00 08 mov %o0, %i4 if ( act->sa_handler == SIG_DFL ) { 2007f80: c2 06 60 08 ld [ %i1 + 8 ], %g1 2007f84: 3b 00 80 85 sethi %hi(0x2021400), %i5 2007f88: 80 a0 60 00 cmp %g1, 0 2007f8c: 12 80 00 0a bne 2007fb4 2007f90: ba 17 62 90 or %i5, 0x290, %i5 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 2007f94: 83 2e 20 02 sll %i0, 2, %g1 2007f98: 13 00 80 7c sethi %hi(0x201f000), %o1 2007f9c: b1 2e 20 04 sll %i0, 4, %i0 2007fa0: 92 12 60 c4 or %o1, 0xc4, %o1 2007fa4: b0 26 00 01 sub %i0, %g1, %i0 2007fa8: 90 07 40 18 add %i5, %i0, %o0 2007fac: 10 80 00 09 b 2007fd0 2007fb0: 92 02 40 18 add %o1, %i0, %o1 } else { _POSIX_signals_Clear_process_signals( sig ); 2007fb4: 40 00 16 e1 call 200db38 <_POSIX_signals_Clear_process_signals> 2007fb8: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2007fbc: 83 2e 20 02 sll %i0, 2, %g1 2007fc0: 92 10 00 19 mov %i1, %o1 2007fc4: b1 2e 20 04 sll %i0, 4, %i0 2007fc8: 90 26 00 01 sub %i0, %g1, %o0 2007fcc: 90 07 40 08 add %i5, %o0, %o0 2007fd0: 40 00 25 12 call 2011418 2007fd4: 94 10 20 0c mov 0xc, %o2 } _ISR_Enable( level ); 2007fd8: 7f ff ea a3 call 2002a64 2007fdc: 90 10 00 1c mov %i4, %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; 2007fe0: 82 10 20 00 clr %g1 } 2007fe4: 81 c7 e0 08 ret 2007fe8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02008448 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2008448: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 200844c: 80 a6 20 00 cmp %i0, 0 2008450: 02 80 00 0e be 2008488 2008454: 80 a6 a0 00 cmp %i2, 0 /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2008458: 02 80 00 10 be 2008498 200845c: b6 10 20 00 clr %i3 if ( !_Timespec_Is_valid( timeout ) ) 2008460: 40 00 0e e1 call 200bfe4 <_Timespec_Is_valid> 2008464: 90 10 00 1a mov %i2, %o0 2008468: 80 8a 20 ff btst 0xff, %o0 200846c: 02 80 00 07 be 2008488 2008470: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2008474: 40 00 0e ee call 200c02c <_Timespec_To_ticks> 2008478: 90 10 00 1a mov %i2, %o0 if ( !interval ) 200847c: b6 92 20 00 orcc %o0, 0, %i3 2008480: 12 80 00 07 bne 200849c <== ALWAYS TAKEN 2008484: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2008488: 40 00 23 63 call 2011214 <__errno> 200848c: 01 00 00 00 nop 2008490: 10 80 00 64 b 2008620 2008494: 82 10 20 16 mov 0x16, %g1 ! 16 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008498: 80 a6 60 00 cmp %i1, 0 200849c: 22 80 00 02 be,a 20084a4 20084a0: b2 07 bf f4 add %fp, -12, %i1 the_thread = _Thread_Executing; 20084a4: 21 00 80 86 sethi %hi(0x2021800), %l0 20084a8: a0 14 23 10 or %l0, 0x310, %l0 ! 2021b10 <_Per_CPU_Information> 20084ac: fa 04 20 0c ld [ %l0 + 0xc ], %i5 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 20084b0: 7f ff ea 46 call 2002dc8 20084b4: f8 07 61 5c ld [ %i5 + 0x15c ], %i4 20084b8: b4 10 00 08 mov %o0, %i2 if ( *set & api->signals_pending ) { 20084bc: c4 06 00 00 ld [ %i0 ], %g2 20084c0: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 20084c4: 80 88 80 01 btst %g2, %g1 20084c8: 22 80 00 12 be,a 2008510 20084cc: 03 00 80 87 sethi %hi(0x2021c00), %g1 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 20084d0: 7f ff ff c6 call 20083e8 <_POSIX_signals_Get_lowest> 20084d4: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( 20084d8: 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 ); 20084dc: 92 10 00 08 mov %o0, %o1 20084e0: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 20084e4: 96 10 20 00 clr %o3 20084e8: 90 10 00 1c mov %i4, %o0 20084ec: 40 00 17 ae call 200e3a4 <_POSIX_signals_Clear_signals> 20084f0: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 20084f4: 7f ff ea 39 call 2002dd8 20084f8: 90 10 00 1a mov %i2, %o0 the_info->si_code = SI_USER; 20084fc: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2008500: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2008504: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2008508: 10 80 00 48 b 2008628 200850c: fa 06 40 00 ld [ %i1 ], %i5 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2008510: c2 00 61 64 ld [ %g1 + 0x164 ], %g1 2008514: 80 88 80 01 btst %g2, %g1 2008518: 22 80 00 12 be,a 2008560 200851c: 82 10 3f ff mov -1, %g1 signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2008520: 7f ff ff b2 call 20083e8 <_POSIX_signals_Get_lowest> 2008524: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2008528: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 200852c: ba 10 00 08 mov %o0, %i5 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2008530: 96 10 20 01 mov 1, %o3 2008534: 90 10 00 1c mov %i4, %o0 2008538: 92 10 00 1d mov %i5, %o1 200853c: 40 00 17 9a call 200e3a4 <_POSIX_signals_Clear_signals> 2008540: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2008544: 7f ff ea 25 call 2002dd8 2008548: 90 10 00 1a mov %i2, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 200854c: 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; 2008550: fa 26 40 00 st %i5, [ %i1 ] the_info->si_code = SI_USER; 2008554: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2008558: 10 80 00 34 b 2008628 200855c: c0 26 60 08 clr [ %i1 + 8 ] return signo; } the_info->si_signo = -1; 2008560: c2 26 40 00 st %g1, [ %i1 ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008564: 03 00 80 85 sethi %hi(0x2021400), %g1 2008568: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20215e0 <_Thread_Dispatch_disable_level> 200856c: 84 00 a0 01 inc %g2 2008570: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return _Thread_Dispatch_disable_level; 2008574: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2008578: 82 10 20 04 mov 4, %g1 200857c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] the_thread->Wait.option = *set; 2008580: c2 06 00 00 ld [ %i0 ], %g1 the_thread->Wait.return_argument = the_info; 2008584: f2 27 60 28 st %i1, [ %i5 + 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; 2008588: c2 27 60 30 st %g1, [ %i5 + 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; 200858c: a2 10 20 01 mov 1, %l1 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2008590: 35 00 80 87 sethi %hi(0x2021c00), %i2 2008594: b4 16 a0 fc or %i2, 0xfc, %i2 ! 2021cfc <_POSIX_signals_Wait_queue> 2008598: f4 27 60 44 st %i2, [ %i5 + 0x44 ] 200859c: e2 26 a0 30 st %l1, [ %i2 + 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 ); 20085a0: 7f ff ea 0e call 2002dd8 20085a4: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 20085a8: 90 10 00 1a mov %i2, %o0 20085ac: 92 10 00 1b mov %i3, %o1 20085b0: 15 00 80 2f sethi %hi(0x200bc00), %o2 20085b4: 40 00 0d 36 call 200ba8c <_Thread_queue_Enqueue_with_handler> 20085b8: 94 12 a1 f8 or %o2, 0x1f8, %o2 ! 200bdf8 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 20085bc: 40 00 0b f1 call 200b580 <_Thread_Enable_dispatch> 20085c0: 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 ); 20085c4: d2 06 40 00 ld [ %i1 ], %o1 20085c8: 90 10 00 1c mov %i4, %o0 20085cc: 94 10 00 19 mov %i1, %o2 20085d0: 96 10 20 00 clr %o3 20085d4: 40 00 17 74 call 200e3a4 <_POSIX_signals_Clear_signals> 20085d8: 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) 20085dc: c2 04 20 0c ld [ %l0 + 0xc ], %g1 20085e0: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 20085e4: 80 a0 60 04 cmp %g1, 4 20085e8: 12 80 00 09 bne 200860c 20085ec: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 20085f0: fa 06 40 00 ld [ %i1 ], %i5 20085f4: 82 07 7f ff add %i5, -1, %g1 20085f8: a3 2c 40 01 sll %l1, %g1, %l1 20085fc: c2 06 00 00 ld [ %i0 ], %g1 2008600: 80 8c 40 01 btst %l1, %g1 2008604: 12 80 00 09 bne 2008628 2008608: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; 200860c: 40 00 23 02 call 2011214 <__errno> 2008610: 01 00 00 00 nop 2008614: 03 00 80 86 sethi %hi(0x2021800), %g1 2008618: c2 00 63 1c ld [ %g1 + 0x31c ], %g1 ! 2021b1c <_Per_CPU_Information+0xc> 200861c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008620: c2 22 00 00 st %g1, [ %o0 ] return -1; 2008624: ba 10 3f ff mov -1, %i5 } return the_info->si_signo; } 2008628: 81 c7 e0 08 ret 200862c: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 0200a36c : int sigwait( const sigset_t *set, int *sig ) { 200a36c: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 200a370: 92 10 20 00 clr %o1 200a374: 90 10 00 18 mov %i0, %o0 200a378: 7f ff ff 7f call 200a174 200a37c: 94 10 20 00 clr %o2 if ( status != -1 ) { 200a380: 80 a2 3f ff cmp %o0, -1 200a384: 02 80 00 06 be 200a39c 200a388: 80 a6 60 00 cmp %i1, 0 if ( sig ) 200a38c: 32 80 00 09 bne,a 200a3b0 <== ALWAYS TAKEN 200a390: d0 26 40 00 st %o0, [ %i1 ] *sig = status; return 0; 200a394: 81 c7 e0 08 ret <== NOT EXECUTED 200a398: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED } return errno; 200a39c: 40 00 22 34 call 2012c6c <__errno> 200a3a0: 01 00 00 00 nop 200a3a4: f0 02 00 00 ld [ %o0 ], %i0 200a3a8: 81 c7 e0 08 ret 200a3ac: 81 e8 00 00 restore status = sigtimedwait( set, NULL, NULL ); if ( status != -1 ) { if ( sig ) *sig = status; return 0; 200a3b0: b0 10 20 00 clr %i0 } return errno; } 200a3b4: 81 c7 e0 08 ret 200a3b8: 81 e8 00 00 restore =============================================================================== 020071e8 : */ long sysconf( int name ) { 20071e8: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 20071ec: 80 a6 20 02 cmp %i0, 2 20071f0: 12 80 00 09 bne 2007214 20071f4: 03 00 80 74 sethi %hi(0x201d000), %g1 return (TOD_MICROSECONDS_PER_SECOND / 20071f8: 03 00 80 74 sethi %hi(0x201d000), %g1 20071fc: d2 00 60 6c ld [ %g1 + 0x6c ], %o1 ! 201d06c 2007200: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007204: 40 00 46 68 call 2018ba4 <.udiv> 2007208: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 200720c: 81 c7 e0 08 ret 2007210: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2007214: 80 a6 20 04 cmp %i0, 4 2007218: 02 80 00 13 be 2007264 200721c: d0 00 61 b4 ld [ %g1 + 0x1b4 ], %o0 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2007220: 80 a6 20 33 cmp %i0, 0x33 2007224: 02 80 00 10 be 2007264 2007228: 90 10 24 00 mov 0x400, %o0 return 1024; if ( name == _SC_PAGESIZE ) 200722c: 80 a6 20 08 cmp %i0, 8 2007230: 02 80 00 0d be 2007264 2007234: 11 00 00 04 sethi %hi(0x1000), %o0 return PAGE_SIZE; if ( name == _SC_SYMLOOP_MAX ) 2007238: 80 a6 20 4f cmp %i0, 0x4f 200723c: 02 80 00 0a be 2007264 <== NEVER TAKEN 2007240: 90 10 20 20 mov 0x20, %o0 return RTEMS_FILESYSTEM_SYMLOOP_MAX; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2007244: 80 a6 22 03 cmp %i0, 0x203 2007248: 02 80 00 07 be 2007264 <== NEVER TAKEN 200724c: 90 10 20 00 clr %o0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2007250: 40 00 22 b5 call 200fd24 <__errno> 2007254: 01 00 00 00 nop 2007258: 82 10 20 16 mov 0x16, %g1 ! 16 200725c: c2 22 00 00 st %g1, [ %o0 ] 2007260: 90 10 3f ff mov -1, %o0 } 2007264: b0 10 00 08 mov %o0, %i0 2007268: 81 c7 e0 08 ret 200726c: 81 e8 00 00 restore =============================================================================== 020087f4 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 20087f4: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 20087f8: 80 a6 20 01 cmp %i0, 1 20087fc: 12 80 00 13 bne 2008848 2008800: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2008804: 02 80 00 11 be 2008848 2008808: 80 a6 60 00 cmp %i1, 0 /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 200880c: 02 80 00 13 be 2008858 2008810: 03 00 80 89 sethi %hi(0x2022400), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2008814: c2 06 40 00 ld [ %i1 ], %g1 2008818: 82 00 7f ff add %g1, -1, %g1 200881c: 80 a0 60 01 cmp %g1, 1 2008820: 28 80 00 03 bleu,a 200882c <== ALWAYS TAKEN 2008824: c2 06 60 04 ld [ %i1 + 4 ], %g1 2008828: 30 80 00 08 b,a 2008848 <== NOT EXECUTED ( 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 ) 200882c: 80 a0 60 00 cmp %g1, 0 2008830: 32 80 00 03 bne,a 200883c <== ALWAYS TAKEN 2008834: 82 00 7f ff add %g1, -1, %g1 2008838: 30 80 00 04 b,a 2008848 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 200883c: 80 a0 60 1f cmp %g1, 0x1f 2008840: 28 80 00 06 bleu,a 2008858 <== ALWAYS TAKEN 2008844: 03 00 80 89 sethi %hi(0x2022400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2008848: 40 00 24 4a call 2011970 <__errno> 200884c: 01 00 00 00 nop 2008850: 10 80 00 11 b 2008894 2008854: 82 10 20 16 mov 0x16, %g1 ! 16 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008858: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 200885c: 84 00 a0 01 inc %g2 2008860: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 2008864: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 * the inactive chain of free timer control blocks. */ RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Allocate( void ) { return (POSIX_Timer_Control *) _Objects_Allocate( &_POSIX_Timer_Information ); 2008868: 11 00 80 8a sethi %hi(0x2022800), %o0 200886c: 40 00 08 5f call 200a9e8 <_Objects_Allocate> 2008870: 90 12 21 20 or %o0, 0x120, %o0 ! 2022920 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2008874: 80 a2 20 00 cmp %o0, 0 2008878: 12 80 00 0a bne 20088a0 200887c: 82 10 20 02 mov 2, %g1 _Thread_Enable_dispatch(); 2008880: 40 00 0d 7d call 200be74 <_Thread_Enable_dispatch> 2008884: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2008888: 40 00 24 3a call 2011970 <__errno> 200888c: 01 00 00 00 nop 2008890: 82 10 20 0b mov 0xb, %g1 ! b 2008894: c2 22 00 00 st %g1, [ %o0 ] 2008898: 81 c7 e0 08 ret 200889c: 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; 20088a0: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 20088a4: 03 00 80 8a sethi %hi(0x2022800), %g1 20088a8: c2 00 63 6c ld [ %g1 + 0x36c ], %g1 ! 2022b6c <_Per_CPU_Information+0xc> if ( evp != NULL ) { 20088ac: 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; 20088b0: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 20088b4: 02 80 00 08 be 20088d4 20088b8: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 20088bc: c2 06 40 00 ld [ %i1 ], %g1 20088c0: c2 22 20 40 st %g1, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 20088c4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20088c8: c2 22 20 44 st %g1, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 20088cc: c2 06 60 08 ld [ %i1 + 8 ], %g1 20088d0: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20088d4: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20088d8: 07 00 80 8a sethi %hi(0x2022800), %g3 20088dc: c6 00 e1 3c ld [ %g3 + 0x13c ], %g3 ! 202293c <_POSIX_Timer_Information+0x1c> } ptimer->overrun = 0; 20088e0: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 20088e4: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 20088e8: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 20088ec: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 20088f0: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20088f4: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 20088f8: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 20088fc: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2008900: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008904: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008908: 85 28 a0 02 sll %g2, 2, %g2 200890c: 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; 2008910: 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; 2008914: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2008918: 40 00 0d 57 call 200be74 <_Thread_Enable_dispatch> 200891c: b0 10 20 00 clr %i0 return 0; } 2008920: 81 c7 e0 08 ret 2008924: 81 e8 00 00 restore =============================================================================== 020073e0 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 20073e0: 9d e3 bf 78 save %sp, -136, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 20073e4: 80 a6 a0 00 cmp %i2, 0 20073e8: 02 80 00 7c be 20075d8 <== NEVER TAKEN 20073ec: 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) ) ) { 20073f0: 40 00 0f 55 call 200b144 <_Timespec_Is_valid> 20073f4: 90 06 a0 08 add %i2, 8, %o0 20073f8: 80 8a 20 ff btst 0xff, %o0 20073fc: 02 80 00 77 be 20075d8 2007400: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2007404: 40 00 0f 50 call 200b144 <_Timespec_Is_valid> 2007408: 90 10 00 1a mov %i2, %o0 200740c: 80 8a 20 ff btst 0xff, %o0 2007410: 02 80 00 72 be 20075d8 <== NEVER TAKEN 2007414: 80 8e 7f fb btst -5, %i1 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2007418: 12 80 00 70 bne 20075d8 200741c: 90 07 bf f0 add %fp, -16, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2007420: 92 10 00 1a mov %i2, %o1 2007424: 40 00 25 eb call 2010bd0 2007428: 94 10 20 10 mov 0x10, %o2 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 200742c: 80 a6 60 04 cmp %i1, 4 2007430: 12 80 00 1d bne 20074a4 2007434: 11 00 80 7a sethi %hi(0x201e800), %o0 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007438: 40 00 06 5e call 2008db0 <_TOD_Get_as_timestamp> 200743c: 90 07 bf e0 add %fp, -32, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007440: f8 1f bf e0 ldd [ %fp + -32 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007444: 94 10 20 00 clr %o2 2007448: 90 10 00 1c mov %i4, %o0 200744c: 92 10 00 1d mov %i5, %o1 2007450: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007454: 40 00 49 54 call 20199a4 <__divdi3> 2007458: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 200745c: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007460: d2 27 bf e8 st %o1, [ %fp + -24 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007464: 90 10 00 1c mov %i4, %o0 2007468: 92 10 00 1d mov %i5, %o1 200746c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007470: 40 00 4a 38 call 2019d50 <__moddi3> 2007474: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2007478: 90 07 bf f8 add %fp, -8, %o0 200747c: d2 27 bf ec st %o1, [ %fp + -20 ] 2007480: 40 00 0f 43 call 200b18c <_Timespec_Less_than> 2007484: 92 07 bf e8 add %fp, -24, %o1 2007488: 80 8a 20 ff btst 0xff, %o0 200748c: 12 80 00 53 bne 20075d8 2007490: 92 07 bf f8 add %fp, -8, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2007494: 90 07 bf e8 add %fp, -24, %o0 2007498: 40 00 0f 4d call 200b1cc <_Timespec_Subtract> 200749c: 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 *) 20074a0: 11 00 80 7a sethi %hi(0x201e800), %o0 20074a4: 92 10 00 18 mov %i0, %o1 20074a8: 90 12 20 30 or %o0, 0x30, %o0 20074ac: 40 00 08 e1 call 2009830 <_Objects_Get> 20074b0: 94 07 bf dc add %fp, -36, %o2 * something with the structure of times of the timer: to stop, start * or start it again */ ptimer = _POSIX_Timer_Get( timerid, &location ); switch ( location ) { 20074b4: c2 07 bf dc ld [ %fp + -36 ], %g1 20074b8: 80 a0 60 00 cmp %g1, 0 20074bc: 12 80 00 47 bne 20075d8 20074c0: b2 10 00 08 mov %o0, %i1 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 ) { 20074c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20074c8: 80 a0 60 00 cmp %g1, 0 20074cc: 12 80 00 14 bne 200751c 20074d0: c2 07 bf fc ld [ %fp + -4 ], %g1 20074d4: 80 a0 60 00 cmp %g1, 0 20074d8: 12 80 00 11 bne 200751c 20074dc: 01 00 00 00 nop /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 20074e0: 40 00 10 72 call 200b6a8 <_Watchdog_Remove> 20074e4: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 20074e8: 80 a6 e0 00 cmp %i3, 0 20074ec: 02 80 00 05 be 2007500 20074f0: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 20074f4: 92 06 60 54 add %i1, 0x54, %o1 20074f8: 40 00 25 b6 call 2010bd0 20074fc: 94 10 20 10 mov 0x10, %o2 /* The new data are set */ ptimer->timer_data = normalize; 2007500: 90 06 60 54 add %i1, 0x54, %o0 2007504: 92 07 bf f0 add %fp, -16, %o1 2007508: 40 00 25 b2 call 2010bd0 200750c: 94 10 20 10 mov 0x10, %o2 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2007510: 82 10 20 04 mov 4, %g1 2007514: 10 80 00 2d b 20075c8 2007518: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] _Thread_Enable_dispatch(); return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); 200751c: 40 00 0f 3d call 200b210 <_Timespec_To_ticks> 2007520: 90 10 00 1a mov %i2, %o0 2007524: d0 26 60 64 st %o0, [ %i1 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2007528: 40 00 0f 3a call 200b210 <_Timespec_To_ticks> 200752c: 90 07 bf f8 add %fp, -8, %o0 activated = _POSIX_Timer_Insert_helper( 2007530: d4 06 60 08 ld [ %i1 + 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 ); 2007534: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2007538: 17 00 80 1d sethi %hi(0x2007400), %o3 200753c: 90 06 60 10 add %i1, 0x10, %o0 2007540: 96 12 e1 f0 or %o3, 0x1f0, %o3 2007544: 40 00 18 4e call 200d67c <_POSIX_Timer_Insert_helper> 2007548: 98 10 00 19 mov %i1, %o4 initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 200754c: 80 8a 20 ff btst 0xff, %o0 2007550: 02 80 00 1e be 20075c8 2007554: 80 a6 e0 00 cmp %i3, 0 /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 2007558: 02 80 00 05 be 200756c 200755c: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2007560: 92 06 60 54 add %i1, 0x54, %o1 2007564: 40 00 25 9b call 2010bd0 2007568: 94 10 20 10 mov 0x10, %o2 ptimer->timer_data = normalize; 200756c: 92 07 bf f0 add %fp, -16, %o1 2007570: 94 10 20 10 mov 0x10, %o2 2007574: 40 00 25 97 call 2010bd0 2007578: 90 06 60 54 add %i1, 0x54, %o0 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 200757c: 82 10 20 03 mov 3, %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007580: 90 07 bf e0 add %fp, -32, %o0 2007584: 40 00 06 0b call 2008db0 <_TOD_Get_as_timestamp> 2007588: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 200758c: f8 1f bf e0 ldd [ %fp + -32 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007590: 94 10 20 00 clr %o2 2007594: 90 10 00 1c mov %i4, %o0 2007598: 92 10 00 1d mov %i5, %o1 200759c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20075a0: 40 00 49 01 call 20199a4 <__divdi3> 20075a4: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20075a8: 90 10 00 1c mov %i4, %o0 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20075ac: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20075b0: 94 10 20 00 clr %o2 20075b4: 92 10 00 1d mov %i5, %o1 20075b8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20075bc: 40 00 49 e5 call 2019d50 <__moddi3> 20075c0: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 20075c4: d2 26 60 70 st %o1, [ %i1 + 0x70 ] _TOD_Get( &ptimer->time ); _Thread_Enable_dispatch(); 20075c8: 40 00 0c 46 call 200a6e0 <_Thread_Enable_dispatch> 20075cc: b0 10 20 00 clr %i0 20075d0: 81 c7 e0 08 ret 20075d4: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 20075d8: 40 00 23 37 call 20102b4 <__errno> 20075dc: b0 10 3f ff mov -1, %i0 20075e0: 82 10 20 16 mov 0x16, %g1 20075e4: c2 22 00 00 st %g1, [ %o0 ] } 20075e8: 81 c7 e0 08 ret 20075ec: 81 e8 00 00 restore =============================================================================== 020075b0 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 20075b0: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 20075b4: 3b 00 80 7f sethi %hi(0x201fc00), %i5 20075b8: ba 17 63 b8 or %i5, 0x3b8, %i5 ! 201ffb8 <_POSIX_signals_Ualarm_timer> 20075bc: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20075c0: 80 a0 60 00 cmp %g1, 0 20075c4: 12 80 00 0a bne 20075ec 20075c8: b8 10 00 18 mov %i0, %i4 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20075cc: 03 00 80 1d sethi %hi(0x2007400), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20075d0: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 20075d4: 82 10 61 84 or %g1, 0x184, %g1 the_watchdog->id = id; 20075d8: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20075dc: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 20075e0: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 20075e4: 10 80 00 1b b 2007650 20075e8: 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 ); 20075ec: 40 00 0f f1 call 200b5b0 <_Watchdog_Remove> 20075f0: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 20075f4: 90 02 3f fe add %o0, -2, %o0 20075f8: 80 a2 20 01 cmp %o0, 1 20075fc: 18 80 00 15 bgu 2007650 <== NEVER TAKEN 2007600: 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); 2007604: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007608: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 200760c: 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); 2007610: 90 02 00 01 add %o0, %g1, %o0 2007614: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2007618: 40 00 0e 83 call 200b024 <_Timespec_From_ticks> 200761c: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007620: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2007624: 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; 2007628: 85 28 60 03 sll %g1, 3, %g2 200762c: 87 28 60 08 sll %g1, 8, %g3 2007630: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 2007634: 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; 2007638: b1 28 a0 06 sll %g2, 6, %i0 200763c: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2007640: 40 00 4c 62 call 201a7c8 <.div> 2007644: 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; 2007648: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 200764c: 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 ) { 2007650: 80 a7 20 00 cmp %i4, 0 2007654: 02 80 00 19 be 20076b8 2007658: 3b 00 03 d0 sethi %hi(0xf4000), %i5 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 200765c: 90 10 00 1c mov %i4, %o0 2007660: 40 00 4c 58 call 201a7c0 <.udiv> 2007664: 92 17 62 40 or %i5, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007668: 92 17 62 40 or %i5, 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; 200766c: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007670: 40 00 4d 00 call 201aa70 <.urem> 2007674: 90 10 00 1c mov %i4, %o0 2007678: 85 2a 20 07 sll %o0, 7, %g2 200767c: 83 2a 20 02 sll %o0, 2, %g1 2007680: 82 20 80 01 sub %g2, %g1, %g1 2007684: 90 00 40 08 add %g1, %o0, %o0 2007688: 91 2a 20 03 sll %o0, 3, %o0 200768c: d0 27 bf fc st %o0, [ %fp + -4 ] ticks = _Timespec_To_ticks( &tp ); 2007690: 40 00 0e 7a call 200b078 <_Timespec_To_ticks> 2007694: 90 07 bf f8 add %fp, -8, %o0 if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2007698: 40 00 0e 78 call 200b078 <_Timespec_To_ticks> 200769c: 90 07 bf f8 add %fp, -8, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076a0: 13 00 80 7f sethi %hi(0x201fc00), %o1 20076a4: 92 12 63 b8 or %o1, 0x3b8, %o1 ! 201ffb8 <_POSIX_signals_Ualarm_timer> 20076a8: d0 22 60 0c st %o0, [ %o1 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076ac: 11 00 80 7d sethi %hi(0x201f400), %o0 20076b0: 40 00 0f 68 call 200b450 <_Watchdog_Insert> 20076b4: 90 12 23 58 or %o0, 0x358, %o0 ! 201f758 <_Watchdog_Ticks_chain> } return remaining; } 20076b8: 81 c7 e0 08 ret 20076bc: 81 e8 00 00 restore