=============================================================================== 02007228 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2007228: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200722c: 39 00 80 76 sethi %hi(0x201d800), %i4 2007230: fa 07 23 44 ld [ %i4 + 0x344 ], %i5 ! 201db44 <_API_extensions_List> 2007234: b8 17 23 44 or %i4, 0x344, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007238: b8 07 20 04 add %i4, 4, %i4 200723c: 80 a7 40 1c cmp %i5, %i4 2007240: 02 80 00 09 be 2007264 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2007244: 01 00 00 00 nop * Currently all APIs configure this hook so it is always non-NULL. */ #if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API) if ( the_extension->postdriver_hook ) #endif (*the_extension->postdriver_hook)(); 2007248: c2 07 60 08 ld [ %i5 + 8 ], %g1 200724c: 9f c0 40 00 call %g1 2007250: 01 00 00 00 nop Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 2007254: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007258: 80 a7 40 1c cmp %i5, %i4 200725c: 32 bf ff fc bne,a 200724c <_API_extensions_Run_postdriver+0x24> 2007260: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007264: 81 c7 e0 08 ret 2007268: 81 e8 00 00 restore =============================================================================== 0200726c <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 200726c: 9d e3 bf a0 save %sp, -96, %sp 2007270: 39 00 80 76 sethi %hi(0x201d800), %i4 2007274: fa 07 23 44 ld [ %i4 + 0x344 ], %i5 ! 201db44 <_API_extensions_List> 2007278: b8 17 23 44 or %i4, 0x344, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 200727c: b8 07 20 04 add %i4, 4, %i4 2007280: 80 a7 40 1c cmp %i5, %i4 2007284: 02 80 00 0a be 20072ac <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 2007288: 37 00 80 77 sethi %hi(0x201dc00), %i3 200728c: b6 16 e2 88 or %i3, 0x288, %i3 ! 201de88 <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 2007290: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007294: 9f c0 40 00 call %g1 2007298: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 200729c: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20072a0: 80 a7 40 1c cmp %i5, %i4 20072a4: 32 bf ff fc bne,a 2007294 <_API_extensions_Run_postswitch+0x28> 20072a8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20072ac: 81 c7 e0 08 ret 20072b0: 81 e8 00 00 restore =============================================================================== 020094f4 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 20094f4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 20094f8: 03 00 80 6b sethi %hi(0x201ac00), %g1 * Otherwise, we have to block. * If locked for reading and no waiters, then OK to read. * If any thread is waiting, then we wait. */ _ISR_Disable( level ); 20094fc: 7f ff e8 0e call 2003534 2009500: fa 00 62 74 ld [ %g1 + 0x274 ], %i5 ! 201ae74 <_Per_CPU_Information+0xc> 2009504: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 2009508: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200950c: 80 a0 60 00 cmp %g1, 0 2009510: 02 80 00 2b be 20095bc <_CORE_RWLock_Release+0xc8> 2009514: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 2009518: 22 80 00 22 be,a 20095a0 <_CORE_RWLock_Release+0xac> 200951c: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 return CORE_RWLOCK_SUCCESSFUL; } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 2009520: 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; 2009524: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 2009528: 7f ff e8 07 call 2003544 200952c: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 2009530: 40 00 07 c4 call 200b440 <_Thread_queue_Dequeue> 2009534: 90 10 00 18 mov %i0, %o0 if ( next ) { 2009538: 80 a2 20 00 cmp %o0, 0 200953c: 22 80 00 24 be,a 20095cc <_CORE_RWLock_Release+0xd8> 2009540: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 2009544: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 2009548: 80 a0 60 01 cmp %g1, 1 200954c: 02 80 00 22 be 20095d4 <_CORE_RWLock_Release+0xe0> 2009550: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009554: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009558: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200955c: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009560: 10 80 00 09 b 2009584 <_CORE_RWLock_Release+0x90> 2009564: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); if ( !next || 2009568: 80 a0 60 01 cmp %g1, 1 200956c: 02 80 00 0b be 2009598 <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 2009570: 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; 2009574: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009578: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200957c: 40 00 08 c1 call 200b880 <_Thread_queue_Extract> 2009580: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); 2009584: 40 00 09 10 call 200b9c4 <_Thread_queue_First> 2009588: 90 10 00 18 mov %i0, %o0 if ( !next || 200958c: 92 92 20 00 orcc %o0, 0, %o1 2009590: 32 bf ff f6 bne,a 2009568 <_CORE_RWLock_Release+0x74> 2009594: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 2009598: 81 c7 e0 08 ret 200959c: 91 e8 20 00 restore %g0, 0, %o0 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { the_rwlock->number_of_readers -= 1; 20095a0: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 20095a4: 80 a0 60 00 cmp %g1, 0 20095a8: 02 bf ff de be 2009520 <_CORE_RWLock_Release+0x2c> 20095ac: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 20095b0: 7f ff e7 e5 call 2003544 20095b4: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 20095b8: 30 80 00 05 b,a 20095cc <_CORE_RWLock_Release+0xd8> * If any thread is waiting, then we wait. */ _ISR_Disable( level ); if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ _ISR_Enable( level ); 20095bc: 7f ff e7 e2 call 2003544 20095c0: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 20095c4: 82 10 20 02 mov 2, %g1 20095c8: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 20095cc: 81 c7 e0 08 ret 20095d0: 81 e8 00 00 restore next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); if ( next ) { if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 20095d4: 82 10 20 02 mov 2, %g1 20095d8: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 20095dc: 81 c7 e0 08 ret 20095e0: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020095e4 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 20095e4: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20095e8: 90 10 00 18 mov %i0, %o0 20095ec: 40 00 06 be call 200b0e4 <_Thread_Get> 20095f0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20095f4: c2 07 bf fc ld [ %fp + -4 ], %g1 20095f8: 80 a0 60 00 cmp %g1, 0 20095fc: 12 80 00 09 bne 2009620 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 2009600: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009604: 40 00 09 32 call 200bacc <_Thread_queue_Process_timeout> 2009608: 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--; 200960c: 03 00 80 6a sethi %hi(0x201a800), %g1 2009610: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 201a930 <_Thread_Dispatch_disable_level> 2009614: 84 00 bf ff add %g2, -1, %g2 2009618: c4 20 61 30 st %g2, [ %g1 + 0x130 ] return _Thread_Dispatch_disable_level; 200961c: c2 00 61 30 ld [ %g1 + 0x130 ], %g1 2009620: 81 c7 e0 08 ret 2009624: 81 e8 00 00 restore =============================================================================== 02010ad4 <_CORE_message_queue_Initialize>: CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 2010ad4: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010ad8: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010adc: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; the_message_queue->maximum_message_size = maximum_message_size; 2010ae0: f6 26 20 4c st %i3, [ %i0 + 0x4c ] CORE_message_queue_Control *the_message_queue, CORE_message_queue_Notify_Handler the_handler, void *the_argument ) { the_message_queue->notify_handler = the_handler; 2010ae4: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 2010ae8: c0 26 20 64 clr [ %i0 + 0x64 ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2010aec: 80 8e e0 03 btst 3, %i3 2010af0: 02 80 00 0a be 2010b18 <_CORE_message_queue_Initialize+0x44> 2010af4: a0 10 00 1b mov %i3, %l0 allocated_message_size += sizeof(uint32_t); 2010af8: a0 06 e0 04 add %i3, 4, %l0 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010afc: a0 0c 3f fc and %l0, -4, %l0 } if (allocated_message_size < maximum_message_size) 2010b00: 80 a6 c0 10 cmp %i3, %l0 2010b04: 08 80 00 05 bleu 2010b18 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2010b08: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b0c: b0 0f 60 01 and %i5, 1, %i0 2010b10: 81 c7 e0 08 ret 2010b14: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 2010b18: b8 04 20 14 add %l0, 0x14, %i4 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 2010b1c: 92 10 00 1a mov %i2, %o1 2010b20: 90 10 00 1c mov %i4, %o0 2010b24: 40 00 43 c5 call 2021a38 <.umul> 2010b28: ba 10 20 00 clr %i5 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 2010b2c: 80 a2 00 10 cmp %o0, %l0 2010b30: 2a bf ff f8 bcs,a 2010b10 <_CORE_message_queue_Initialize+0x3c><== NEVER TAKEN 2010b34: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010b38: 40 00 0d 27 call 2013fd4 <_Workspace_Allocate> 2010b3c: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010b40: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010b44: 80 a2 20 00 cmp %o0, 0 2010b48: 02 bf ff f1 be 2010b0c <_CORE_message_queue_Initialize+0x38> 2010b4c: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010b50: 90 06 20 68 add %i0, 0x68, %o0 2010b54: 94 10 00 1a mov %i2, %o2 2010b58: 40 00 17 e4 call 2016ae8 <_Chain_Initialize> 2010b5c: 96 10 00 1c mov %i4, %o3 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2010b60: c4 06 40 00 ld [ %i1 ], %g2 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2010b64: 82 06 20 50 add %i0, 0x50, %g1 2010b68: 84 18 a0 01 xor %g2, 1, %g2 2010b6c: 80 a0 00 02 cmp %g0, %g2 2010b70: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010b74: c2 26 20 58 st %g1, [ %i0 + 0x58 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2010b78: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2010b7c: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2010b80: c0 26 20 54 clr [ %i0 + 0x54 ] 2010b84: 92 60 3f ff subx %g0, -1, %o1 2010b88: 94 10 20 80 mov 0x80, %o2 2010b8c: 96 10 20 06 mov 6, %o3 2010b90: 40 00 0a 51 call 20134d4 <_Thread_queue_Initialize> 2010b94: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b98: b0 0f 60 01 and %i5, 1, %i0 2010b9c: 81 c7 e0 08 ret 2010ba0: 81 e8 00 00 restore =============================================================================== 0200757c <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 200757c: 9d e3 bf a0 save %sp, -96, %sp * This routine returns true if thread dispatch indicates * that we are in a critical section. */ RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void) { if ( _Thread_Dispatch_disable_level == 0 ) 2007580: 3b 00 80 76 sethi %hi(0x201d800), %i5 2007584: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 ! 201d950 <_Thread_Dispatch_disable_level> 2007588: 80 a0 60 00 cmp %g1, 0 200758c: 02 80 00 05 be 20075a0 <_CORE_mutex_Seize+0x24> 2007590: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2007594: 80 a6 a0 00 cmp %i2, 0 2007598: 12 80 00 1b bne 2007604 <_CORE_mutex_Seize+0x88> <== ALWAYS TAKEN 200759c: 03 00 80 76 sethi %hi(0x201d800), %g1 20075a0: 90 10 00 18 mov %i0, %o0 20075a4: 40 00 17 11 call 200d1e8 <_CORE_mutex_Seize_interrupt_trylock> 20075a8: 92 07 a0 54 add %fp, 0x54, %o1 20075ac: 80 a2 20 00 cmp %o0, 0 20075b0: 02 80 00 13 be 20075fc <_CORE_mutex_Seize+0x80> 20075b4: 80 a6 a0 00 cmp %i2, 0 20075b8: 02 80 00 1b be 2007624 <_CORE_mutex_Seize+0xa8> 20075bc: 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++; 20075c0: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 20075c4: 03 00 80 77 sethi %hi(0x201dc00), %g1 20075c8: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 201de94 <_Per_CPU_Information+0xc> RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20075cc: 86 10 20 01 mov 1, %g3 20075d0: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 20075d4: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 20075d8: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 20075dc: 82 00 a0 01 add %g2, 1, %g1 20075e0: c2 27 61 50 st %g1, [ %i5 + 0x150 ] return _Thread_Dispatch_disable_level; 20075e4: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 20075e8: 7f ff ea ec call 2002198 20075ec: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20075f0: 90 10 00 18 mov %i0, %o0 20075f4: 7f ff ff c0 call 20074f4 <_CORE_mutex_Seize_interrupt_blocking> 20075f8: 92 10 00 1b mov %i3, %o1 20075fc: 81 c7 e0 08 ret 2007600: 81 e8 00 00 restore 2007604: c2 00 62 ac ld [ %g1 + 0x2ac ], %g1 2007608: 80 a0 60 01 cmp %g1, 1 200760c: 28 bf ff e6 bleu,a 20075a4 <_CORE_mutex_Seize+0x28> 2007610: 90 10 00 18 mov %i0, %o0 2007614: 90 10 20 00 clr %o0 2007618: 92 10 20 00 clr %o1 200761c: 40 00 01 dc call 2007d8c <_Internal_error_Occurred> 2007620: 94 10 20 12 mov 0x12, %o2 2007624: 7f ff ea dd call 2002198 2007628: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 200762c: 03 00 80 77 sethi %hi(0x201dc00), %g1 2007630: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 201de94 <_Per_CPU_Information+0xc> 2007634: 84 10 20 01 mov 1, %g2 2007638: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 200763c: 81 c7 e0 08 ret 2007640: 81 e8 00 00 restore =============================================================================== 020077b8 <_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 ) { 20077b8: 9d e3 bf a0 save %sp, -96, %sp 20077bc: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 20077c0: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 20077c4: 40 00 07 95 call 2009618 <_Thread_queue_Dequeue> 20077c8: 90 10 00 1d mov %i5, %o0 20077cc: 80 a2 20 00 cmp %o0, 0 20077d0: 02 80 00 04 be 20077e0 <_CORE_semaphore_Surrender+0x28> 20077d4: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 20077d8: 81 c7 e0 08 ret 20077dc: 81 e8 00 00 restore if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 20077e0: 7f ff ea 6a call 2002188 20077e4: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 20077e8: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 20077ec: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 20077f0: 80 a0 40 02 cmp %g1, %g2 20077f4: 1a 80 00 05 bcc 2007808 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 20077f8: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 20077fc: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007800: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007804: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007808: 7f ff ea 64 call 2002198 200780c: 01 00 00 00 nop } return status; } 2007810: 81 c7 e0 08 ret 2007814: 81 e8 00 00 restore =============================================================================== 0200d180 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200d180: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; 200d184: c0 26 20 04 clr [ %i0 + 4 ] size_t node_size ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 200d188: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d18c: 80 a6 a0 00 cmp %i2, 0 200d190: 02 80 00 12 be 200d1d8 <_Chain_Initialize+0x58> <== NEVER TAKEN 200d194: 90 10 00 18 mov %i0, %o0 200d198: b4 06 bf ff add %i2, -1, %i2 { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; 200d19c: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200d1a0: 92 10 00 1a mov %i2, %o1 ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 200d1a4: 10 80 00 05 b 200d1b8 <_Chain_Initialize+0x38> 200d1a8: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d1ac: 84 10 00 01 mov %g1, %g2 200d1b0: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200d1b4: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200d1b8: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200d1bc: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d1c0: 80 a6 a0 00 cmp %i2, 0 200d1c4: 12 bf ff fa bne 200d1ac <_Chain_Initialize+0x2c> 200d1c8: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200d1cc: 40 00 2d 3a call 20186b4 <.umul> 200d1d0: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d1d4: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200d1d8: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200d1dc: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200d1e0: 81 c7 e0 08 ret 200d1e4: 81 e8 00 00 restore =============================================================================== 02006458 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2006458: 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 ]; 200645c: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 2006460: 7f ff ef 4a call 2002188 2006464: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 2006468: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 200646c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2006470: 86 88 40 02 andcc %g1, %g2, %g3 2006474: 02 80 00 39 be 2006558 <_Event_Surrender+0x100> 2006478: 09 00 80 77 sethi %hi(0x201dc00), %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() && 200647c: 88 11 22 88 or %g4, 0x288, %g4 ! 201de88 <_Per_CPU_Information> 2006480: f2 01 20 08 ld [ %g4 + 8 ], %i1 2006484: 80 a6 60 00 cmp %i1, 0 2006488: 32 80 00 1c bne,a 20064f8 <_Event_Surrender+0xa0> 200648c: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 2006490: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2006494: 80 89 21 00 btst 0x100, %g4 2006498: 02 80 00 30 be 2006558 <_Event_Surrender+0x100> 200649c: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20064a0: 02 80 00 04 be 20064b0 <_Event_Surrender+0x58> 20064a4: 80 8f 20 02 btst 2, %i4 20064a8: 02 80 00 2c be 2006558 <_Event_Surrender+0x100> <== NEVER TAKEN 20064ac: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20064b0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear( rtems_event_set the_event_set, rtems_event_set the_mask ) { return ( the_event_set & ~(the_mask) ); 20064b4: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 20064b8: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 20064bc: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20064c0: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 20064c4: 7f ff ef 35 call 2002198 20064c8: 01 00 00 00 nop 20064cc: 7f ff ef 2f call 2002188 20064d0: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 20064d4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 20064d8: 80 a0 60 02 cmp %g1, 2 20064dc: 02 80 00 21 be 2006560 <_Event_Surrender+0x108> 20064e0: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 20064e4: 7f ff ef 2d call 2002198 20064e8: 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 ); 20064ec: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 20064f0: 40 00 0a 74 call 2008ec0 <_Thread_Clear_state> 20064f4: 81 e8 00 00 restore /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 20064f8: 80 a6 00 04 cmp %i0, %g4 20064fc: 32 bf ff e6 bne,a 2006494 <_Event_Surrender+0x3c> 2006500: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006504: 09 00 80 78 sethi %hi(0x201e000), %g4 2006508: f2 01 22 80 ld [ %g4 + 0x280 ], %i1 ! 201e280 <_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 ) && 200650c: 80 a6 60 02 cmp %i1, 2 2006510: 02 80 00 07 be 200652c <_Event_Surrender+0xd4> <== NEVER TAKEN 2006514: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006518: f2 01 22 80 ld [ %g4 + 0x280 ], %i1 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200651c: 80 a6 60 01 cmp %i1, 1 2006520: 32 bf ff dd bne,a 2006494 <_Event_Surrender+0x3c> 2006524: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2006528: 80 a0 40 03 cmp %g1, %g3 200652c: 02 80 00 04 be 200653c <_Event_Surrender+0xe4> 2006530: 80 8f 20 02 btst 2, %i4 2006534: 02 80 00 09 be 2006558 <_Event_Surrender+0x100> <== NEVER TAKEN 2006538: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200653c: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006540: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2006544: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006548: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200654c: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006550: 82 10 20 03 mov 3, %g1 2006554: c2 21 22 80 st %g1, [ %g4 + 0x280 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2006558: 7f ff ef 10 call 2002198 200655c: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2006560: c2 26 20 50 st %g1, [ %i0 + 0x50 ] if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2006564: 7f ff ef 0d call 2002198 2006568: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 200656c: 40 00 0f 95 call 200a3c0 <_Watchdog_Remove> 2006570: 90 06 20 48 add %i0, 0x48, %o0 2006574: b2 16 63 f8 or %i1, 0x3f8, %i1 2006578: 40 00 0a 52 call 2008ec0 <_Thread_Clear_state> 200657c: 81 e8 00 00 restore =============================================================================== 02006580 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006580: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006584: 90 10 00 18 mov %i0, %o0 2006588: 40 00 0b 4d call 20092bc <_Thread_Get> 200658c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006590: c2 07 bf fc ld [ %fp + -4 ], %g1 2006594: 80 a0 60 00 cmp %g1, 0 2006598: 12 80 00 16 bne 20065f0 <_Event_Timeout+0x70> <== NEVER TAKEN 200659c: 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 ); 20065a0: 7f ff ee fa call 2002188 20065a4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20065a8: 03 00 80 77 sethi %hi(0x201dc00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 20065ac: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 201de94 <_Per_CPU_Information+0xc> 20065b0: 80 a7 40 01 cmp %i5, %g1 20065b4: 02 80 00 11 be 20065f8 <_Event_Timeout+0x78> 20065b8: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 20065bc: 82 10 20 06 mov 6, %g1 20065c0: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20065c4: 7f ff ee f5 call 2002198 20065c8: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20065cc: 90 10 00 1d mov %i5, %o0 20065d0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20065d4: 40 00 0a 3b call 2008ec0 <_Thread_Clear_state> 20065d8: 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--; 20065dc: 03 00 80 76 sethi %hi(0x201d800), %g1 20065e0: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201d950 <_Thread_Dispatch_disable_level> 20065e4: 84 00 bf ff add %g2, -1, %g2 20065e8: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 20065ec: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 20065f0: 81 c7 e0 08 ret 20065f4: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 20065f8: 03 00 80 78 sethi %hi(0x201e000), %g1 20065fc: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 201e280 <_Event_Sync_state> 2006600: 80 a0 a0 01 cmp %g2, 1 2006604: 32 bf ff ef bne,a 20065c0 <_Event_Timeout+0x40> 2006608: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 200660c: 84 10 20 02 mov 2, %g2 2006610: c4 20 62 80 st %g2, [ %g1 + 0x280 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006614: 10 bf ff eb b 20065c0 <_Event_Timeout+0x40> 2006618: 82 10 20 06 mov 6, %g1 =============================================================================== 0200d3b8 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d3b8: 9d e3 bf 98 save %sp, -104, %sp 200d3bc: ba 10 00 18 mov %i0, %i5 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200d3c0: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200d3c4: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200d3c8: 80 a6 40 10 cmp %i1, %l0 200d3cc: 18 80 00 23 bgu 200d458 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d3d0: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200d3d4: 80 a6 e0 00 cmp %i3, 0 200d3d8: 12 80 00 7d bne 200d5cc <_Heap_Allocate_aligned_with_boundary+0x214> 200d3dc: 80 a6 40 1b cmp %i1, %i3 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200d3e0: e2 07 60 08 ld [ %i5 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d3e4: 80 a7 40 11 cmp %i5, %l1 200d3e8: 02 80 00 18 be 200d448 <_Heap_Allocate_aligned_with_boundary+0x90> 200d3ec: b8 10 20 00 clr %i4 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200d3f0: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d3f4: ae 10 20 04 mov 4, %l7 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200d3f8: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d3fc: 10 80 00 0b b 200d428 <_Heap_Allocate_aligned_with_boundary+0x70> 200d400: ae 25 c0 19 sub %l7, %i1, %l7 * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { if ( alignment == 0 ) { 200d404: 12 80 00 17 bne 200d460 <_Heap_Allocate_aligned_with_boundary+0xa8> 200d408: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d40c: 80 a6 20 00 cmp %i0, 0 200d410: 12 80 00 5b bne 200d57c <_Heap_Allocate_aligned_with_boundary+0x1c4> 200d414: b8 07 20 01 inc %i4 break; } block = block->next; 200d418: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d41c: 80 a7 40 11 cmp %i5, %l1 200d420: 22 80 00 0b be,a 200d44c <_Heap_Allocate_aligned_with_boundary+0x94> 200d424: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 200d428: e4 04 60 04 ld [ %l1 + 4 ], %l2 200d42c: 80 a4 00 12 cmp %l0, %l2 200d430: 0a bf ff f5 bcs 200d404 <_Heap_Allocate_aligned_with_boundary+0x4c> 200d434: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200d438: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d43c: 80 a7 40 11 cmp %i5, %l1 200d440: 12 bf ff fa bne 200d428 <_Heap_Allocate_aligned_with_boundary+0x70> 200d444: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d448: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200d44c: 80 a0 40 1c cmp %g1, %i4 200d450: 0a 80 00 5a bcs 200d5b8 <_Heap_Allocate_aligned_with_boundary+0x200> 200d454: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200d458: 81 c7 e0 08 ret 200d45c: 81 e8 00 00 restore uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200d460: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200d464: ea 07 60 14 ld [ %i5 + 0x14 ], %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200d468: a4 0c bf fe and %l2, -2, %l2 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200d46c: 82 20 80 15 sub %g2, %l5, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200d470: a4 04 40 12 add %l1, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d474: 92 10 00 1a mov %i2, %o1 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; 200d478: b0 05 c0 12 add %l7, %l2, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200d47c: a4 00 40 12 add %g1, %l2, %l2 200d480: 40 00 2d 73 call 2018a4c <.urem> 200d484: 90 10 00 18 mov %i0, %o0 200d488: b0 26 00 08 sub %i0, %o0, %i0 uintptr_t alloc_begin = alloc_end - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { 200d48c: 80 a4 80 18 cmp %l2, %i0 200d490: 1a 80 00 06 bcc 200d4a8 <_Heap_Allocate_aligned_with_boundary+0xf0> 200d494: a8 04 60 08 add %l1, 8, %l4 200d498: 90 10 00 12 mov %l2, %o0 200d49c: 40 00 2d 6c call 2018a4c <.urem> 200d4a0: 92 10 00 1a mov %i2, %o1 200d4a4: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200d4a8: 80 a6 e0 00 cmp %i3, 0 200d4ac: 02 80 00 24 be 200d53c <_Heap_Allocate_aligned_with_boundary+0x184> 200d4b0: 80 a5 00 18 cmp %l4, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200d4b4: a4 06 00 19 add %i0, %i1, %l2 200d4b8: 92 10 00 1b mov %i3, %o1 200d4bc: 40 00 2d 64 call 2018a4c <.urem> 200d4c0: 90 10 00 12 mov %l2, %o0 200d4c4: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200d4c8: 80 a6 00 08 cmp %i0, %o0 200d4cc: 1a 80 00 1b bcc 200d538 <_Heap_Allocate_aligned_with_boundary+0x180> 200d4d0: 80 a2 00 12 cmp %o0, %l2 200d4d4: 1a 80 00 1a bcc 200d53c <_Heap_Allocate_aligned_with_boundary+0x184> 200d4d8: 80 a5 00 18 cmp %l4, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200d4dc: a6 05 00 19 add %l4, %i1, %l3 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200d4e0: 80 a4 c0 08 cmp %l3, %o0 200d4e4: 08 80 00 08 bleu 200d504 <_Heap_Allocate_aligned_with_boundary+0x14c> 200d4e8: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d4ec: 10 bf ff c9 b 200d410 <_Heap_Allocate_aligned_with_boundary+0x58> 200d4f0: 80 a6 20 00 cmp %i0, 0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200d4f4: 1a 80 00 11 bcc 200d538 <_Heap_Allocate_aligned_with_boundary+0x180> 200d4f8: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200d4fc: 18 bf ff c4 bgu 200d40c <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200d500: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200d504: b0 22 00 19 sub %o0, %i1, %i0 200d508: 92 10 00 1a mov %i2, %o1 200d50c: 40 00 2d 50 call 2018a4c <.urem> 200d510: 90 10 00 18 mov %i0, %o0 200d514: 92 10 00 1b mov %i3, %o1 200d518: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200d51c: a4 06 00 19 add %i0, %i1, %l2 200d520: 40 00 2d 4b call 2018a4c <.urem> 200d524: 90 10 00 12 mov %l2, %o0 200d528: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200d52c: 80 a2 00 12 cmp %o0, %l2 200d530: 0a bf ff f1 bcs 200d4f4 <_Heap_Allocate_aligned_with_boundary+0x13c> 200d534: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200d538: 80 a5 00 18 cmp %l4, %i0 200d53c: 18 80 00 22 bgu 200d5c4 <_Heap_Allocate_aligned_with_boundary+0x20c> 200d540: 82 10 3f f8 mov -8, %g1 200d544: 90 10 00 18 mov %i0, %o0 200d548: a4 20 40 11 sub %g1, %l1, %l2 200d54c: 92 10 00 16 mov %l6, %o1 200d550: 40 00 2d 3f call 2018a4c <.urem> 200d554: a4 04 80 18 add %l2, %i0, %l2 uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; if ( free_size >= min_block_size || free_size == 0 ) { 200d558: 90 a4 80 08 subcc %l2, %o0, %o0 200d55c: 02 bf ff ad be 200d410 <_Heap_Allocate_aligned_with_boundary+0x58> 200d560: 80 a6 20 00 cmp %i0, 0 200d564: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200d568: 82 40 3f ff addx %g0, -1, %g1 200d56c: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d570: 80 a6 20 00 cmp %i0, 0 200d574: 02 bf ff a9 be 200d418 <_Heap_Allocate_aligned_with_boundary+0x60> 200d578: b8 07 20 01 inc %i4 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200d57c: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200d580: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200d584: 84 00 a0 01 inc %g2 stats->searches += search_count; 200d588: 82 00 40 1c add %g1, %i4, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200d58c: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200d590: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200d594: 90 10 00 1d mov %i5, %o0 200d598: 92 10 00 11 mov %l1, %o1 200d59c: 94 10 00 18 mov %i0, %o2 200d5a0: 7f ff e9 ab call 2007c4c <_Heap_Block_allocate> 200d5a4: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d5a8: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200d5ac: 80 a0 40 1c cmp %g1, %i4 200d5b0: 1a 80 00 03 bcc 200d5bc <_Heap_Allocate_aligned_with_boundary+0x204> 200d5b4: 01 00 00 00 nop stats->max_search = search_count; 200d5b8: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200d5bc: 81 c7 e0 08 ret 200d5c0: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200d5c4: 10 bf ff 92 b 200d40c <_Heap_Allocate_aligned_with_boundary+0x54> 200d5c8: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200d5cc: 18 bf ff a3 bgu 200d458 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d5d0: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200d5d4: 22 bf ff 83 be,a 200d3e0 <_Heap_Allocate_aligned_with_boundary+0x28> 200d5d8: b4 10 00 16 mov %l6, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200d5dc: 10 bf ff 82 b 200d3e4 <_Heap_Allocate_aligned_with_boundary+0x2c> 200d5e0: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200d3dc <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200d3dc: 9d e3 bf 98 save %sp, -104, %sp Heap_Block *start_block = first_block; Heap_Block *merge_below_block = NULL; Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; 200d3e0: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d3e4: 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; 200d3e8: 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; 200d3ec: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200d3f0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200d3f4: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 200d3f8: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200d3fc: 80 a6 40 1d cmp %i1, %i5 200d400: 08 80 00 05 bleu 200d414 <_Heap_Extend+0x38> 200d404: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d408: b0 0c 60 01 and %l1, 1, %i0 200d40c: 81 c7 e0 08 ret 200d410: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200d414: 90 10 00 19 mov %i1, %o0 200d418: 92 10 00 1a mov %i2, %o1 200d41c: 94 10 00 10 mov %l0, %o2 200d420: 98 07 bf f8 add %fp, -8, %o4 200d424: 7f ff e9 58 call 2007984 <_Heap_Get_first_and_last_block> 200d428: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200d42c: 80 8a 20 ff btst 0xff, %o0 200d430: 02 bf ff f6 be 200d408 <_Heap_Extend+0x2c> 200d434: aa 10 20 00 clr %l5 200d438: a2 10 00 1c mov %i4, %l1 200d43c: ac 10 20 00 clr %l6 200d440: a6 10 20 00 clr %l3 200d444: 10 80 00 14 b 200d494 <_Heap_Extend+0xb8> 200d448: a8 10 20 00 clr %l4 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200d44c: 2a 80 00 02 bcs,a 200d454 <_Heap_Extend+0x78> 200d450: ac 10 00 11 mov %l1, %l6 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d454: 90 10 00 1a mov %i2, %o0 200d458: 40 00 18 07 call 2013474 <.urem> 200d45c: 92 10 00 10 mov %l0, %o1 200d460: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d464: 80 a6 80 19 cmp %i2, %i1 200d468: 02 80 00 1c be 200d4d8 <_Heap_Extend+0xfc> 200d46c: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200d470: 80 a6 40 1a cmp %i1, %i2 200d474: 38 80 00 02 bgu,a 200d47c <_Heap_Extend+0xa0> 200d478: aa 10 00 01 mov %g1, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200d47c: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d480: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d484: a2 04 40 01 add %l1, %g1, %l1 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200d488: 80 a7 00 11 cmp %i4, %l1 200d48c: 22 80 00 1b be,a 200d4f8 <_Heap_Extend+0x11c> 200d490: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200d494: 80 a4 40 1c cmp %l1, %i4 200d498: 02 80 00 66 be 200d630 <_Heap_Extend+0x254> 200d49c: 82 10 00 11 mov %l1, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200d4a0: 80 a0 40 1d cmp %g1, %i5 200d4a4: 0a 80 00 70 bcs 200d664 <_Heap_Extend+0x288> 200d4a8: f4 04 40 00 ld [ %l1 ], %i2 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200d4ac: 80 a0 40 1d cmp %g1, %i5 200d4b0: 12 bf ff e7 bne 200d44c <_Heap_Extend+0x70> 200d4b4: 80 a7 40 1a cmp %i5, %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d4b8: 90 10 00 1a mov %i2, %o0 200d4bc: 40 00 17 ee call 2013474 <.urem> 200d4c0: 92 10 00 10 mov %l0, %o1 200d4c4: 82 06 bf f8 add %i2, -8, %g1 200d4c8: a8 10 00 11 mov %l1, %l4 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d4cc: 80 a6 80 19 cmp %i2, %i1 200d4d0: 12 bf ff e8 bne 200d470 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200d4d4: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200d4d8: fa 24 40 00 st %i5, [ %l1 ] - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200d4dc: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d4e0: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d4e4: a2 04 40 01 add %l1, %g1, %l1 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200d4e8: 80 a7 00 11 cmp %i4, %l1 200d4ec: 12 bf ff ea bne 200d494 <_Heap_Extend+0xb8> <== NEVER TAKEN 200d4f0: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200d4f4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200d4f8: 80 a6 40 01 cmp %i1, %g1 200d4fc: 3a 80 00 55 bcc,a 200d650 <_Heap_Extend+0x274> 200d500: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200d504: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200d508: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d50c: c4 07 bf fc ld [ %fp + -4 ], %g2 extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200d510: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200d514: 86 20 80 01 sub %g2, %g1, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; 200d518: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200d51c: b8 10 e0 01 or %g3, 1, %i4 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 200d520: f8 20 60 04 st %i4, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200d524: c6 20 80 00 st %g3, [ %g2 ] extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200d528: 80 a1 00 01 cmp %g4, %g1 200d52c: 08 80 00 43 bleu 200d638 <_Heap_Extend+0x25c> 200d530: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200d534: c2 26 20 20 st %g1, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d538: 80 a5 20 00 cmp %l4, 0 200d53c: 02 80 00 63 be 200d6c8 <_Heap_Extend+0x2ec> 200d540: 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; 200d544: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200d548: 92 10 00 1c mov %i4, %o1 200d54c: 40 00 17 ca call 2013474 <.urem> 200d550: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200d554: 80 a2 20 00 cmp %o0, 0 200d558: 02 80 00 04 be 200d568 <_Heap_Extend+0x18c> 200d55c: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200d560: b2 06 40 1c add %i1, %i4, %i1 200d564: 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 = 200d568: 82 06 7f f8 add %i1, -8, %g1 uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; 200d56c: c4 26 7f f8 st %g2, [ %i1 + -8 ] uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = new_first_block_alloc_begin - HEAP_BLOCK_HEADER_SIZE; uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = 200d570: 84 25 00 01 sub %l4, %g1, %g2 first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; new_first_block->size_and_flag = new_first_block_size | HEAP_PREV_BLOCK_USED; 200d574: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200d578: 90 10 00 18 mov %i0, %o0 200d57c: 92 10 00 01 mov %g1, %o1 200d580: 7f ff ff 8d call 200d3b4 <_Heap_Free_block> 200d584: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d588: 80 a4 e0 00 cmp %l3, 0 200d58c: 02 80 00 3b be 200d678 <_Heap_Extend+0x29c> 200d590: 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); 200d594: 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( 200d598: ba 27 40 13 sub %i5, %l3, %i5 200d59c: 40 00 17 b6 call 2013474 <.urem> 200d5a0: 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) 200d5a4: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200d5a8: ba 27 40 08 sub %i5, %o0, %i5 200d5ac: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200d5b0: 82 10 60 01 or %g1, 1, %g1 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200d5b4: 84 07 40 13 add %i5, %l3, %g2 200d5b8: c2 20 a0 04 st %g1, [ %g2 + 4 ] RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d5bc: c2 04 e0 04 ld [ %l3 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 200d5c0: 90 10 00 18 mov %i0, %o0 200d5c4: 82 08 60 01 and %g1, 1, %g1 200d5c8: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200d5cc: ba 17 40 01 or %i5, %g1, %i5 200d5d0: 7f ff ff 79 call 200d3b4 <_Heap_Free_block> 200d5d4: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d5d8: 80 a4 e0 00 cmp %l3, 0 200d5dc: 02 80 00 34 be 200d6ac <_Heap_Extend+0x2d0> 200d5e0: 80 a5 20 00 cmp %l4, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d5e4: 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( 200d5e8: 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; 200d5ec: 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( 200d5f0: 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; 200d5f4: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200d5f8: 84 10 80 03 or %g2, %g3, %g2 200d5fc: c4 20 60 04 st %g2, [ %g1 + 4 ] _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200d600: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d604: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200d608: a2 10 20 01 mov 1, %l1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d60c: a4 20 80 12 sub %g2, %l2, %l2 /* Statistics */ stats->size += extended_size; 200d610: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200d614: 80 a6 e0 00 cmp %i3, 0 200d618: 02 bf ff 7c be 200d408 <_Heap_Extend+0x2c> <== NEVER TAKEN 200d61c: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200d620: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200d624: b0 0c 60 01 and %l1, 1, %i0 200d628: 81 c7 e0 08 ret 200d62c: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200d630: 10 bf ff 9c b 200d4a0 <_Heap_Extend+0xc4> 200d634: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200d638: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200d63c: 80 a0 40 02 cmp %g1, %g2 200d640: 2a bf ff be bcs,a 200d538 <_Heap_Extend+0x15c> 200d644: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d648: 10 bf ff bd b 200d53c <_Heap_Extend+0x160> 200d64c: 80 a5 20 00 cmp %l4, 0 start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); if ( extend_area_begin < heap->area_begin ) { heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { 200d650: 80 a7 40 01 cmp %i5, %g1 200d654: 38 bf ff ad bgu,a 200d508 <_Heap_Extend+0x12c> 200d658: 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; 200d65c: 10 bf ff ac b 200d50c <_Heap_Extend+0x130> 200d660: c2 07 bf f8 ld [ %fp + -8 ], %g1 (uintptr_t) start_block : heap->area_begin; uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200d664: 80 a6 40 1a cmp %i1, %i2 200d668: 1a bf ff 92 bcc 200d4b0 <_Heap_Extend+0xd4> 200d66c: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200d670: 10 bf ff 66 b 200d408 <_Heap_Extend+0x2c> 200d674: a2 10 20 00 clr %l1 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200d678: 80 a5 60 00 cmp %l5, 0 200d67c: 02 bf ff d7 be 200d5d8 <_Heap_Extend+0x1fc> 200d680: c4 07 bf f8 ld [ %fp + -8 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d684: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200d688: c2 07 bf fc ld [ %fp + -4 ], %g1 200d68c: 86 08 e0 01 and %g3, 1, %g3 ) { uintptr_t const link_begin = (uintptr_t) link; uintptr_t const first_block_begin = (uintptr_t) first_block; _Heap_Block_set_size( link, first_block_begin - link_begin ); 200d690: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200d694: 84 10 c0 02 or %g3, %g2, %g2 200d698: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200d69c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200d6a0: 84 10 a0 01 or %g2, 1, %g2 200d6a4: 10 bf ff cd b 200d5d8 <_Heap_Extend+0x1fc> 200d6a8: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d6ac: 32 bf ff cf bne,a 200d5e8 <_Heap_Extend+0x20c> 200d6b0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200d6b4: d2 07 bf f8 ld [ %fp + -8 ], %o1 200d6b8: 7f ff ff 3f call 200d3b4 <_Heap_Free_block> 200d6bc: 90 10 00 18 mov %i0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d6c0: 10 bf ff ca b 200d5e8 <_Heap_Extend+0x20c> 200d6c4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200d6c8: 80 a5 a0 00 cmp %l6, 0 200d6cc: 02 bf ff b0 be 200d58c <_Heap_Extend+0x1b0> 200d6d0: 80 a4 e0 00 cmp %l3, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 200d6d4: ac 25 80 02 sub %l6, %g2, %l6 200d6d8: ac 15 a0 01 or %l6, 1, %l6 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 200d6dc: 10 bf ff ac b 200d58c <_Heap_Extend+0x1b0> 200d6e0: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200d5e4 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200d5e4: 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 ) { 200d5e8: 80 a6 60 00 cmp %i1, 0 200d5ec: 02 80 00 56 be 200d744 <_Heap_Free+0x160> 200d5f0: 84 10 20 01 mov 1, %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d5f4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200d5f8: 40 00 2d 15 call 2018a4c <.urem> 200d5fc: 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 200d600: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d604: 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); 200d608: ba 27 40 08 sub %i5, %o0, %i5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200d60c: 80 a7 40 01 cmp %i5, %g1 200d610: 0a 80 00 4d bcs 200d744 <_Heap_Free+0x160> 200d614: 84 10 20 00 clr %g2 200d618: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200d61c: 80 a7 40 04 cmp %i5, %g4 200d620: 38 80 00 4a bgu,a 200d748 <_Heap_Free+0x164> 200d624: b0 08 a0 01 and %g2, 1, %i0 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d628: de 07 60 04 ld [ %i5 + 4 ], %o7 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200d62c: b2 0b ff fe and %o7, -2, %i1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d630: 86 06 40 1d add %i1, %i5, %g3 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200d634: 80 a0 40 03 cmp %g1, %g3 200d638: 38 80 00 44 bgu,a 200d748 <_Heap_Free+0x164> <== NEVER TAKEN 200d63c: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200d640: 80 a1 00 03 cmp %g4, %g3 200d644: 2a 80 00 41 bcs,a 200d748 <_Heap_Free+0x164> <== NEVER TAKEN 200d648: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200d64c: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200d650: 80 8b 60 01 btst 1, %o5 200d654: 02 80 00 3c be 200d744 <_Heap_Free+0x160> <== NEVER TAKEN 200d658: 98 0b 7f fe and %o5, -2, %o4 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200d65c: 80 a1 00 03 cmp %g4, %g3 200d660: 02 80 00 06 be 200d678 <_Heap_Free+0x94> 200d664: 9a 10 20 00 clr %o5 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d668: 84 00 c0 0c add %g3, %o4, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d66c: da 00 a0 04 ld [ %g2 + 4 ], %o5 200d670: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200d674: 9a 1b 60 01 xor %o5, 1, %o5 next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200d678: 80 8b e0 01 btst 1, %o7 200d67c: 12 80 00 1c bne 200d6ec <_Heap_Free+0x108> 200d680: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200d684: d6 07 40 00 ld [ %i5 ], %o3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d688: 9e 27 40 0b sub %i5, %o3, %o7 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200d68c: 80 a0 40 0f cmp %g1, %o7 200d690: 18 80 00 2d bgu 200d744 <_Heap_Free+0x160> <== NEVER TAKEN 200d694: 84 10 20 00 clr %g2 200d698: 80 a1 00 0f cmp %g4, %o7 200d69c: 2a 80 00 2b bcs,a 200d748 <_Heap_Free+0x164> <== NEVER TAKEN 200d6a0: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200d6a4: c2 03 e0 04 ld [ %o7 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200d6a8: 80 88 60 01 btst 1, %g1 200d6ac: 02 80 00 26 be 200d744 <_Heap_Free+0x160> <== NEVER TAKEN 200d6b0: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200d6b4: 02 80 00 39 be 200d798 <_Heap_Free+0x1b4> 200d6b8: 96 06 40 0b add %i1, %o3, %o3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d6bc: c2 00 e0 08 ld [ %g3 + 8 ], %g1 200d6c0: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200d6c4: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 200d6c8: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200d6cc: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200d6d0: 82 00 ff ff add %g3, -1, %g1 200d6d4: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200d6d8: 98 02 c0 0c add %o3, %o4, %o4 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d6dc: 82 13 20 01 or %o4, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200d6e0: d8 23 00 0f st %o4, [ %o4 + %o7 ] if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d6e4: 10 80 00 0e b 200d71c <_Heap_Free+0x138> 200d6e8: c2 23 e0 04 st %g1, [ %o7 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200d6ec: 22 80 00 19 be,a 200d750 <_Heap_Free+0x16c> 200d6f0: c4 06 20 08 ld [ %i0 + 8 ], %g2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d6f4: c4 00 e0 08 ld [ %g3 + 8 ], %g2 200d6f8: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200d6fc: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200d700: c2 27 60 0c st %g1, [ %i5 + 0xc ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; 200d704: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200d708: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200d70c: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d710: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200d714: d8 23 00 1d st %o4, [ %o4 + %i5 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d718: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d71c: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200d720: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200d724: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d728: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200d72c: 82 00 60 01 inc %g1 stats->free_size += block_size; 200d730: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d734: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200d738: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200d73c: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200d740: 84 10 20 01 mov 1, %g2 } 200d744: b0 08 a0 01 and %g2, 1, %i0 200d748: 81 c7 e0 08 ret 200d74c: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200d750: 82 16 60 01 or %i1, 1, %g1 200d754: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d758: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200d75c: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200d760: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200d764: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200d768: fa 20 a0 0c st %i5, [ %g2 + 0xc ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d76c: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200d770: f2 26 40 1d st %i1, [ %i1 + %i5 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d774: c4 20 e0 04 st %g2, [ %g3 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { 200d778: c4 06 20 3c ld [ %i0 + 0x3c ], %g2 block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200d77c: 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; 200d780: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200d784: 80 a0 40 02 cmp %g1, %g2 200d788: 08 bf ff e5 bleu 200d71c <_Heap_Free+0x138> 200d78c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200d790: 10 bf ff e3 b 200d71c <_Heap_Free+0x138> 200d794: c2 26 20 3c st %g1, [ %i0 + 0x3c ] next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d798: 82 12 e0 01 or %o3, 1, %g1 200d79c: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d7a0: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200d7a4: d6 26 40 1d st %o3, [ %i1 + %i5 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d7a8: 82 08 7f fe and %g1, -2, %g1 200d7ac: 10 bf ff dc b 200d71c <_Heap_Free+0x138> 200d7b0: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0200dcf0 <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200dcf0: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200dcf4: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200dcf8: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200dcfc: 92 10 20 00 clr %o1 200dd00: 90 10 00 19 mov %i1, %o0 200dd04: 40 00 0a 5c call 2010674 200dd08: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200dd0c: 80 a7 40 1c cmp %i5, %i4 200dd10: 02 80 00 17 be 200dd6c <_Heap_Get_information+0x7c> <== NEVER TAKEN 200dd14: 01 00 00 00 nop 200dd18: c6 07 60 04 ld [ %i5 + 4 ], %g3 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200dd1c: 84 08 ff fe and %g3, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200dd20: ba 07 40 02 add %i5, %g2, %i5 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200dd24: c6 07 60 04 ld [ %i5 + 4 ], %g3 while ( the_block != end ) { uintptr_t const the_size = _Heap_Block_size(the_block); Heap_Block *const next_block = _Heap_Block_at(the_block, the_size); Heap_Information *info; if ( _Heap_Is_prev_used(next_block) ) 200dd28: 80 88 e0 01 btst 1, %g3 200dd2c: 02 80 00 03 be 200dd38 <_Heap_Get_information+0x48> 200dd30: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200dd34: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200dd38: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200dd3c: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200dd40: c8 00 60 04 ld [ %g1 + 4 ], %g4 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200dd44: 9e 03 e0 01 inc %o7 info->total += the_size; 200dd48: b0 06 00 02 add %i0, %g2, %i0 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200dd4c: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200dd50: 80 a1 00 02 cmp %g4, %g2 200dd54: 1a 80 00 03 bcc 200dd60 <_Heap_Get_information+0x70> 200dd58: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200dd5c: c4 20 60 04 st %g2, [ %g1 + 4 ] Heap_Block *the_block = the_heap->first_block; Heap_Block *const end = the_heap->last_block; memset(the_info, 0, sizeof(*the_info)); while ( the_block != end ) { 200dd60: 80 a7 00 1d cmp %i4, %i5 200dd64: 12 bf ff ef bne 200dd20 <_Heap_Get_information+0x30> 200dd68: 84 08 ff fe and %g3, -2, %g2 200dd6c: 81 c7 e0 08 ret 200dd70: 81 e8 00 00 restore =============================================================================== 0201aafc <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 201aafc: 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); 201ab00: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 201ab04: 7f ff f7 d2 call 2018a4c <.urem> 201ab08: 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 201ab0c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 201ab10: 84 06 7f f8 add %i1, -8, %g2 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 201ab14: 84 20 80 08 sub %g2, %o0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 201ab18: 80 a0 80 01 cmp %g2, %g1 201ab1c: 0a 80 00 16 bcs 201ab74 <_Heap_Size_of_alloc_area+0x78> 201ab20: 86 10 20 00 clr %g3 201ab24: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 201ab28: 80 a0 80 04 cmp %g2, %g4 201ab2c: 18 80 00 13 bgu 201ab78 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ab30: b0 08 e0 01 and %g3, 1, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 201ab34: f0 00 a0 04 ld [ %g2 + 4 ], %i0 201ab38: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 201ab3c: 84 06 00 02 add %i0, %g2, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 201ab40: 80 a0 40 02 cmp %g1, %g2 201ab44: 18 80 00 0d bgu 201ab78 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ab48: b0 08 e0 01 and %g3, 1, %i0 201ab4c: 80 a1 00 02 cmp %g4, %g2 201ab50: 0a 80 00 0a bcs 201ab78 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ab54: 01 00 00 00 nop block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 201ab58: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 201ab5c: 80 88 60 01 btst 1, %g1 201ab60: 02 80 00 06 be 201ab78 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ab64: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 201ab68: 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; 201ab6c: 84 00 a0 04 add %g2, 4, %g2 201ab70: c4 26 80 00 st %g2, [ %i2 ] return true; } 201ab74: b0 08 e0 01 and %g3, 1, %i0 201ab78: 81 c7 e0 08 ret 201ab7c: 81 e8 00 00 restore =============================================================================== 02008704 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008704: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008708: 3b 00 80 21 sethi %hi(0x2008400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 200870c: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 2008710: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 2008714: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 2008718: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 200871c: 80 a6 a0 00 cmp %i2, 0 2008720: 02 80 00 04 be 2008730 <_Heap_Walk+0x2c> 2008724: ba 17 62 98 or %i5, 0x298, %i5 2008728: 3b 00 80 21 sethi %hi(0x2008400), %i5 200872c: ba 17 62 a0 or %i5, 0x2a0, %i5 ! 20086a0 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008730: 03 00 80 64 sethi %hi(0x2019000), %g1 2008734: c4 00 63 ec ld [ %g1 + 0x3ec ], %g2 ! 20193ec <_System_state_Current> 2008738: 80 a0 a0 03 cmp %g2, 3 200873c: 02 80 00 05 be 2008750 <_Heap_Walk+0x4c> 2008740: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 2008744: b0 08 60 01 and %g1, 1, %i0 2008748: 81 c7 e0 08 ret 200874c: 81 e8 00 00 restore Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 2008750: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008754: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 2008758: c4 06 20 08 ld [ %i0 + 8 ], %g2 200875c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008760: 90 10 00 19 mov %i1, %o0 2008764: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008768: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 200876c: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2008770: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2008774: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008778: 92 10 20 00 clr %o1 200877c: 96 10 00 10 mov %l0, %o3 2008780: 15 00 80 59 sethi %hi(0x2016400), %o2 2008784: 98 10 00 1b mov %i3, %o4 2008788: 9f c7 40 00 call %i5 200878c: 94 12 a3 58 or %o2, 0x358, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008790: 80 a4 20 00 cmp %l0, 0 2008794: 02 80 00 28 be 2008834 <_Heap_Walk+0x130> 2008798: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 200879c: 12 80 00 2d bne 2008850 <_Heap_Walk+0x14c> 20087a0: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20087a4: 7f ff e4 ca call 2001acc <.urem> 20087a8: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20087ac: 80 a2 20 00 cmp %o0, 0 20087b0: 12 80 00 30 bne 2008870 <_Heap_Walk+0x16c> 20087b4: 90 07 20 08 add %i4, 8, %o0 20087b8: 7f ff e4 c5 call 2001acc <.urem> 20087bc: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 20087c0: 80 a2 20 00 cmp %o0, 0 20087c4: 32 80 00 33 bne,a 2008890 <_Heap_Walk+0x18c> 20087c8: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 20087cc: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20087d0: 80 8d 20 01 btst 1, %l4 20087d4: 22 80 00 36 be,a 20088ac <_Heap_Walk+0x1a8> 20087d8: 90 10 00 19 mov %i1, %o0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 20087dc: c2 04 60 04 ld [ %l1 + 4 ], %g1 20087e0: 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); 20087e4: 82 04 40 01 add %l1, %g1, %g1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 20087e8: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 20087ec: 80 88 a0 01 btst 1, %g2 20087f0: 02 80 00 0a be 2008818 <_Heap_Walk+0x114> 20087f4: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 20087f8: 02 80 00 33 be 20088c4 <_Heap_Walk+0x1c0> 20087fc: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008800: 92 10 20 01 mov 1, %o1 2008804: 15 00 80 5a sethi %hi(0x2016800), %o2 2008808: 9f c7 40 00 call %i5 200880c: 94 12 a0 d0 or %o2, 0xd0, %o2 ! 20168d0 <_Status_Object_name_errors_to_status+0x1f0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008810: 10 bf ff cd b 2008744 <_Heap_Walk+0x40> 2008814: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2008818: 90 10 00 19 mov %i1, %o0 200881c: 92 10 20 01 mov 1, %o1 2008820: 15 00 80 5a sethi %hi(0x2016800), %o2 2008824: 9f c7 40 00 call %i5 2008828: 94 12 a0 b8 or %o2, 0xb8, %o2 ! 20168b8 <_Status_Object_name_errors_to_status+0x1d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200882c: 10 bf ff c6 b 2008744 <_Heap_Walk+0x40> 2008830: 82 10 20 00 clr %g1 first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 2008834: 90 10 00 19 mov %i1, %o0 2008838: 92 10 20 01 mov 1, %o1 200883c: 15 00 80 59 sethi %hi(0x2016400), %o2 2008840: 9f c7 40 00 call %i5 2008844: 94 12 a3 f0 or %o2, 0x3f0, %o2 ! 20167f0 <_Status_Object_name_errors_to_status+0x110> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008848: 10 bf ff bf b 2008744 <_Heap_Walk+0x40> 200884c: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2008850: 90 10 00 19 mov %i1, %o0 2008854: 92 10 20 01 mov 1, %o1 2008858: 96 10 00 10 mov %l0, %o3 200885c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008860: 9f c7 40 00 call %i5 2008864: 94 12 a0 08 or %o2, 8, %o2 ! 2016808 <_Status_Object_name_errors_to_status+0x128> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008868: 10 bf ff b7 b 2008744 <_Heap_Walk+0x40> 200886c: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008870: 90 10 00 19 mov %i1, %o0 2008874: 92 10 20 01 mov 1, %o1 2008878: 96 10 00 1b mov %i3, %o3 200887c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008880: 9f c7 40 00 call %i5 2008884: 94 12 a0 28 or %o2, 0x28, %o2 ! 2016828 <_Status_Object_name_errors_to_status+0x148> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008888: 10 bf ff af b 2008744 <_Heap_Walk+0x40> 200888c: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008890: 92 10 20 01 mov 1, %o1 2008894: 96 10 00 1c mov %i4, %o3 2008898: 15 00 80 5a sethi %hi(0x2016800), %o2 200889c: 9f c7 40 00 call %i5 20088a0: 94 12 a0 50 or %o2, 0x50, %o2 ! 2016850 <_Status_Object_name_errors_to_status+0x170> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088a4: 10 bf ff a8 b 2008744 <_Heap_Walk+0x40> 20088a8: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 20088ac: 92 10 20 01 mov 1, %o1 20088b0: 15 00 80 5a sethi %hi(0x2016800), %o2 20088b4: 9f c7 40 00 call %i5 20088b8: 94 12 a0 88 or %o2, 0x88, %o2 ! 2016888 <_Status_Object_name_errors_to_status+0x1a8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088bc: 10 bf ff a2 b 2008744 <_Heap_Walk+0x40> 20088c0: 82 10 20 00 clr %g1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20088c4: f4 06 20 08 ld [ %i0 + 8 ], %i2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 20088c8: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 20088cc: 80 a6 00 1a cmp %i0, %i2 20088d0: 02 80 00 0d be 2008904 <_Heap_Walk+0x200> 20088d4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 20088d8: 80 a0 40 1a cmp %g1, %i2 20088dc: 28 80 00 bc bleu,a 2008bcc <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 20088e0: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 20088e4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20088e8: 92 10 20 01 mov 1, %o1 20088ec: 96 10 00 1a mov %i2, %o3 20088f0: 15 00 80 5a sethi %hi(0x2016800), %o2 20088f4: 9f c7 40 00 call %i5 20088f8: 94 12 a1 00 or %o2, 0x100, %o2 ! 2016900 <_Status_Object_name_errors_to_status+0x220> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088fc: 10 bf ff 92 b 2008744 <_Heap_Walk+0x40> 2008900: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008904: 2d 00 80 5a sethi %hi(0x2016800), %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2008908: 2f 00 80 5a sethi %hi(0x2016800), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200890c: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008910: ac 15 a3 30 or %l6, 0x330, %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2008914: ae 15 e3 18 or %l7, 0x318, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008918: 2b 00 80 5a sethi %hi(0x2016800), %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200891c: a6 0d 3f fe and %l4, -2, %l3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008920: b4 04 c0 12 add %l3, %l2, %i2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008924: 80 a0 40 1a cmp %g1, %i2 2008928: 28 80 00 0b bleu,a 2008954 <_Heap_Walk+0x250> <== ALWAYS TAKEN 200892c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 2008930: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008934: 92 10 20 01 mov 1, %o1 2008938: 96 10 00 12 mov %l2, %o3 200893c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008940: 98 10 00 1a mov %i2, %o4 2008944: 9f c7 40 00 call %i5 2008948: 94 12 a1 a8 or %o2, 0x1a8, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 200894c: 10 bf ff 7e b 2008744 <_Heap_Walk+0x40> 2008950: 82 10 20 00 clr %g1 2008954: 80 a0 40 1a cmp %g1, %i2 2008958: 0a bf ff f7 bcs 2008934 <_Heap_Walk+0x230> 200895c: 90 10 00 19 mov %i1, %o0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; 2008960: 82 1c 80 11 xor %l2, %l1, %g1 2008964: 80 a0 00 01 cmp %g0, %g1 2008968: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200896c: 90 10 00 13 mov %l3, %o0 2008970: c2 27 bf fc st %g1, [ %fp + -4 ] 2008974: 7f ff e4 56 call 2001acc <.urem> 2008978: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200897c: 80 a2 20 00 cmp %o0, 0 2008980: 02 80 00 05 be 2008994 <_Heap_Walk+0x290> 2008984: c2 07 bf fc ld [ %fp + -4 ], %g1 2008988: 80 88 60 ff btst 0xff, %g1 200898c: 12 80 00 76 bne 2008b64 <_Heap_Walk+0x460> 2008990: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008994: 80 a6 c0 13 cmp %i3, %l3 2008998: 08 80 00 05 bleu 20089ac <_Heap_Walk+0x2a8> 200899c: 80 a4 80 1a cmp %l2, %i2 20089a0: 80 88 60 ff btst 0xff, %g1 20089a4: 12 80 00 78 bne 2008b84 <_Heap_Walk+0x480> <== ALWAYS TAKEN 20089a8: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 20089ac: 2a 80 00 06 bcs,a 20089c4 <_Heap_Walk+0x2c0> 20089b0: c2 06 a0 04 ld [ %i2 + 4 ], %g1 20089b4: 80 88 60 ff btst 0xff, %g1 20089b8: 12 80 00 7d bne 2008bac <_Heap_Walk+0x4a8> 20089bc: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 20089c0: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 20089c4: 80 88 60 01 btst 1, %g1 20089c8: 02 80 00 19 be 2008a2c <_Heap_Walk+0x328> 20089cc: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 20089d0: 80 a5 20 00 cmp %l4, 0 20089d4: 22 80 00 0e be,a 2008a0c <_Heap_Walk+0x308> 20089d8: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 20089dc: 90 10 00 19 mov %i1, %o0 20089e0: 92 10 20 00 clr %o1 20089e4: 94 10 00 17 mov %l7, %o2 20089e8: 96 10 00 12 mov %l2, %o3 20089ec: 9f c7 40 00 call %i5 20089f0: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20089f4: 80 a7 00 1a cmp %i4, %i2 20089f8: 02 80 00 42 be 2008b00 <_Heap_Walk+0x3fc> 20089fc: a4 10 00 1a mov %i2, %l2 2008a00: e8 06 a0 04 ld [ %i2 + 4 ], %l4 2008a04: 10 bf ff c6 b 200891c <_Heap_Walk+0x218> 2008a08: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008a0c: 96 10 00 12 mov %l2, %o3 2008a10: 90 10 00 19 mov %i1, %o0 2008a14: 92 10 20 00 clr %o1 2008a18: 94 10 00 16 mov %l6, %o2 2008a1c: 9f c7 40 00 call %i5 2008a20: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008a24: 10 bf ff f5 b 20089f8 <_Heap_Walk+0x2f4> 2008a28: 80 a7 00 1a cmp %i4, %i2 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 2008a2c: da 04 a0 0c ld [ %l2 + 0xc ], %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008a30: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008a34: 05 00 80 59 sethi %hi(0x2016400), %g2 return _Heap_Free_list_head(heap)->next; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 2008a38: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008a3c: 80 a0 40 0d cmp %g1, %o5 2008a40: 02 80 00 05 be 2008a54 <_Heap_Walk+0x350> 2008a44: 86 10 a3 18 or %g2, 0x318, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008a48: 80 a6 00 0d cmp %i0, %o5 2008a4c: 02 80 00 3c be 2008b3c <_Heap_Walk+0x438> 2008a50: 86 15 62 e0 or %l5, 0x2e0, %g3 block->next, block->next == last_free_block ? 2008a54: c2 04 a0 08 ld [ %l2 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008a58: 1f 00 80 59 sethi %hi(0x2016400), %o7 2008a5c: 80 a1 00 01 cmp %g4, %g1 2008a60: 02 80 00 05 be 2008a74 <_Heap_Walk+0x370> 2008a64: 84 13 e3 38 or %o7, 0x338, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008a68: 80 a6 00 01 cmp %i0, %g1 2008a6c: 02 80 00 31 be 2008b30 <_Heap_Walk+0x42c> 2008a70: 84 15 62 e0 or %l5, 0x2e0, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008a74: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008a78: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008a7c: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008a80: 90 10 00 19 mov %i1, %o0 2008a84: 92 10 20 00 clr %o1 2008a88: 15 00 80 5a sethi %hi(0x2016800), %o2 2008a8c: 96 10 00 12 mov %l2, %o3 2008a90: 94 12 a2 70 or %o2, 0x270, %o2 2008a94: 9f c7 40 00 call %i5 2008a98: 98 10 00 13 mov %l3, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2008a9c: da 06 80 00 ld [ %i2 ], %o5 2008aa0: 80 a4 c0 0d cmp %l3, %o5 2008aa4: 12 80 00 19 bne 2008b08 <_Heap_Walk+0x404> 2008aa8: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2008aac: 02 80 00 27 be 2008b48 <_Heap_Walk+0x444> 2008ab0: 90 10 00 19 mov %i1, %o0 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008ab4: c2 06 20 08 ld [ %i0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008ab8: 80 a6 00 01 cmp %i0, %g1 2008abc: 02 80 00 0b be 2008ae8 <_Heap_Walk+0x3e4> <== NEVER TAKEN 2008ac0: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008ac4: 80 a4 80 01 cmp %l2, %g1 2008ac8: 02 bf ff cc be 20089f8 <_Heap_Walk+0x2f4> 2008acc: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2008ad0: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008ad4: 80 a6 00 01 cmp %i0, %g1 2008ad8: 12 bf ff fc bne 2008ac8 <_Heap_Walk+0x3c4> 2008adc: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008ae0: 90 10 00 19 mov %i1, %o0 2008ae4: 92 10 20 01 mov 1, %o1 2008ae8: 96 10 00 12 mov %l2, %o3 2008aec: 15 00 80 5a sethi %hi(0x2016800), %o2 2008af0: 9f c7 40 00 call %i5 2008af4: 94 12 a3 58 or %o2, 0x358, %o2 ! 2016b58 <_Status_Object_name_errors_to_status+0x478> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008af8: 10 bf ff 13 b 2008744 <_Heap_Walk+0x40> 2008afc: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 2008b00: 10 bf ff 11 b 2008744 <_Heap_Walk+0x40> 2008b04: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008b08: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 2008b0c: 90 10 00 19 mov %i1, %o0 2008b10: 92 10 20 01 mov 1, %o1 2008b14: 96 10 00 12 mov %l2, %o3 2008b18: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b1c: 98 10 00 13 mov %l3, %o4 2008b20: 9f c7 40 00 call %i5 2008b24: 94 12 a2 a8 or %o2, 0x2a8, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b28: 10 bf ff 07 b 2008744 <_Heap_Walk+0x40> 2008b2c: 82 10 20 00 clr %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008b30: 05 00 80 59 sethi %hi(0x2016400), %g2 2008b34: 10 bf ff d0 b 2008a74 <_Heap_Walk+0x370> 2008b38: 84 10 a3 48 or %g2, 0x348, %g2 ! 2016748 <_Status_Object_name_errors_to_status+0x68> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008b3c: 07 00 80 59 sethi %hi(0x2016400), %g3 2008b40: 10 bf ff c5 b 2008a54 <_Heap_Walk+0x350> 2008b44: 86 10 e3 28 or %g3, 0x328, %g3 ! 2016728 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008b48: 92 10 20 01 mov 1, %o1 2008b4c: 96 10 00 12 mov %l2, %o3 2008b50: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b54: 9f c7 40 00 call %i5 2008b58: 94 12 a2 e8 or %o2, 0x2e8, %o2 ! 2016ae8 <_Status_Object_name_errors_to_status+0x408> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b5c: 10 bf fe fa b 2008744 <_Heap_Walk+0x40> 2008b60: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008b64: 92 10 20 01 mov 1, %o1 2008b68: 96 10 00 12 mov %l2, %o3 2008b6c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b70: 98 10 00 13 mov %l3, %o4 2008b74: 9f c7 40 00 call %i5 2008b78: 94 12 a1 d8 or %o2, 0x1d8, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008b7c: 10 bf fe f2 b 2008744 <_Heap_Walk+0x40> 2008b80: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008b84: 90 10 00 19 mov %i1, %o0 2008b88: 92 10 20 01 mov 1, %o1 2008b8c: 96 10 00 12 mov %l2, %o3 2008b90: 15 00 80 5a sethi %hi(0x2016800), %o2 2008b94: 98 10 00 13 mov %l3, %o4 2008b98: 94 12 a2 08 or %o2, 0x208, %o2 2008b9c: 9f c7 40 00 call %i5 2008ba0: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 2008ba4: 10 bf fe e8 b 2008744 <_Heap_Walk+0x40> 2008ba8: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008bac: 92 10 20 01 mov 1, %o1 2008bb0: 96 10 00 12 mov %l2, %o3 2008bb4: 15 00 80 5a sethi %hi(0x2016800), %o2 2008bb8: 98 10 00 1a mov %i2, %o4 2008bbc: 9f c7 40 00 call %i5 2008bc0: 94 12 a2 38 or %o2, 0x238, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008bc4: 10 bf fe e0 b 2008744 <_Heap_Walk+0x40> 2008bc8: 82 10 20 00 clr %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008bcc: 80 a6 80 13 cmp %i2, %l3 2008bd0: 18 bf ff 46 bgu 20088e8 <_Heap_Walk+0x1e4> <== NEVER TAKEN 2008bd4: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008bd8: c2 27 bf fc st %g1, [ %fp + -4 ] 2008bdc: 90 06 a0 08 add %i2, 8, %o0 2008be0: 7f ff e3 bb call 2001acc <.urem> 2008be4: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008be8: 80 a2 20 00 cmp %o0, 0 2008bec: 12 80 00 36 bne 2008cc4 <_Heap_Walk+0x5c0> <== NEVER TAKEN 2008bf0: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2008bf4: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008bf8: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008bfc: 84 06 80 02 add %i2, %g2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2008c00: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c04: 80 88 a0 01 btst 1, %g2 2008c08: 12 80 00 27 bne 2008ca4 <_Heap_Walk+0x5a0> <== NEVER TAKEN 2008c0c: 84 10 00 18 mov %i0, %g2 2008c10: 10 80 00 19 b 2008c74 <_Heap_Walk+0x570> 2008c14: a4 10 00 1a mov %i2, %l2 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 2008c18: 80 a6 00 1a cmp %i0, %i2 2008c1c: 02 bf ff 3a be 2008904 <_Heap_Walk+0x200> 2008c20: 80 a6 80 01 cmp %i2, %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008c24: 0a bf ff 31 bcs 20088e8 <_Heap_Walk+0x1e4> 2008c28: 90 10 00 19 mov %i1, %o0 2008c2c: 80 a6 80 13 cmp %i2, %l3 2008c30: 18 bf ff 2f bgu 20088ec <_Heap_Walk+0x1e8> <== NEVER TAKEN 2008c34: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008c38: c2 27 bf fc st %g1, [ %fp + -4 ] 2008c3c: 90 06 a0 08 add %i2, 8, %o0 2008c40: 7f ff e3 a3 call 2001acc <.urem> 2008c44: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008c48: 80 a2 20 00 cmp %o0, 0 2008c4c: 12 80 00 1e bne 2008cc4 <_Heap_Walk+0x5c0> 2008c50: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2008c54: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c58: 84 10 00 12 mov %l2, %g2 2008c5c: 86 08 ff fe and %g3, -2, %g3 block = next_block; } while ( block != first_block ); return true; } 2008c60: 86 06 80 03 add %i2, %g3, %g3 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2008c64: c6 00 e0 04 ld [ %g3 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c68: 80 88 e0 01 btst 1, %g3 2008c6c: 12 80 00 0e bne 2008ca4 <_Heap_Walk+0x5a0> 2008c70: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2008c74: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2008c78: 80 a3 00 02 cmp %o4, %g2 2008c7c: 22 bf ff e7 be,a 2008c18 <_Heap_Walk+0x514> 2008c80: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2008c84: 90 10 00 19 mov %i1, %o0 2008c88: 92 10 20 01 mov 1, %o1 2008c8c: 96 10 00 1a mov %i2, %o3 2008c90: 15 00 80 5a sethi %hi(0x2016800), %o2 2008c94: 9f c7 40 00 call %i5 2008c98: 94 12 a1 70 or %o2, 0x170, %o2 ! 2016970 <_Status_Object_name_errors_to_status+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c9c: 10 bf fe aa b 2008744 <_Heap_Walk+0x40> 2008ca0: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008ca4: 90 10 00 19 mov %i1, %o0 2008ca8: 92 10 20 01 mov 1, %o1 2008cac: 96 10 00 1a mov %i2, %o3 2008cb0: 15 00 80 5a sethi %hi(0x2016800), %o2 2008cb4: 9f c7 40 00 call %i5 2008cb8: 94 12 a1 50 or %o2, 0x150, %o2 ! 2016950 <_Status_Object_name_errors_to_status+0x270> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cbc: 10 bf fe a2 b 2008744 <_Heap_Walk+0x40> 2008cc0: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008cc4: 90 10 00 19 mov %i1, %o0 2008cc8: 92 10 20 01 mov 1, %o1 2008ccc: 96 10 00 1a mov %i2, %o3 2008cd0: 15 00 80 5a sethi %hi(0x2016800), %o2 2008cd4: 9f c7 40 00 call %i5 2008cd8: 94 12 a1 20 or %o2, 0x120, %o2 ! 2016920 <_Status_Object_name_errors_to_status+0x240> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cdc: 10 bf fe 9a b 2008744 <_Heap_Walk+0x40> 2008ce0: 82 10 20 00 clr %g1 =============================================================================== 020070dc <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 20070dc: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 20070e0: 39 00 80 78 sethi %hi(0x201e000), %i4 20070e4: c2 07 22 c4 ld [ %i4 + 0x2c4 ], %g1 ! 201e2c4 <_IO_Number_of_drivers> 20070e8: 80 a0 60 00 cmp %g1, 0 20070ec: 02 80 00 0c be 200711c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 20070f0: ba 10 20 00 clr %i5 20070f4: b8 17 22 c4 or %i4, 0x2c4, %i4 (void) rtems_io_initialize( major, 0, NULL ); 20070f8: 90 10 00 1d mov %i5, %o0 20070fc: 92 10 20 00 clr %o1 2007100: 40 00 18 08 call 200d120 2007104: 94 10 20 00 clr %o2 void _IO_Initialize_all_drivers( void ) { rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2007108: c2 07 00 00 ld [ %i4 ], %g1 200710c: ba 07 60 01 inc %i5 2007110: 80 a0 40 1d cmp %g1, %i5 2007114: 18 bf ff fa bgu 20070fc <_IO_Initialize_all_drivers+0x20> 2007118: 90 10 00 1d mov %i5, %o0 200711c: 81 c7 e0 08 ret 2007120: 81 e8 00 00 restore =============================================================================== 02007010 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2007010: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 2007014: 03 00 80 72 sethi %hi(0x201c800), %g1 2007018: 82 10 63 ec or %g1, 0x3ec, %g1 ! 201cbec drivers_in_table = Configuration.number_of_device_drivers; 200701c: f8 00 60 30 ld [ %g1 + 0x30 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2007020: f2 00 60 2c ld [ %g1 + 0x2c ], %i1 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 2007024: 80 a7 00 19 cmp %i4, %i1 2007028: 0a 80 00 08 bcs 2007048 <_IO_Manager_initialization+0x38> 200702c: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 2007030: 03 00 80 78 sethi %hi(0x201e000), %g1 2007034: fa 20 62 c8 st %i5, [ %g1 + 0x2c8 ] ! 201e2c8 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2007038: 03 00 80 78 sethi %hi(0x201e000), %g1 200703c: f8 20 62 c4 st %i4, [ %g1 + 0x2c4 ] ! 201e2c4 <_IO_Number_of_drivers> return; 2007040: 81 c7 e0 08 ret 2007044: 81 e8 00 00 restore * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) 2007048: 83 2e 60 03 sll %i1, 3, %g1 200704c: b5 2e 60 05 sll %i1, 5, %i2 2007050: b4 26 80 01 sub %i2, %g1, %i2 * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( 2007054: 40 00 0d 65 call 200a5e8 <_Workspace_Allocate_or_fatal_error> 2007058: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 200705c: 03 00 80 78 sethi %hi(0x201e000), %g1 /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 2007060: 37 00 80 78 sethi %hi(0x201e000), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2007064: f2 20 62 c4 st %i1, [ %g1 + 0x2c4 ] /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 2007068: d0 26 e2 c8 st %o0, [ %i3 + 0x2c8 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 200706c: 92 10 20 00 clr %o1 2007070: 40 00 24 c0 call 2010370 2007074: 94 10 00 1a mov %i2, %o2 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007078: 80 a7 20 00 cmp %i4, 0 200707c: 02 bf ff f1 be 2007040 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2007080: f6 06 e2 c8 ld [ %i3 + 0x2c8 ], %i3 2007084: 82 10 20 00 clr %g1 2007088: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 200708c: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2007090: 86 07 40 01 add %i5, %g1, %g3 2007094: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 2007098: f4 00 e0 04 ld [ %g3 + 4 ], %i2 200709c: 84 06 c0 01 add %i3, %g1, %g2 20070a0: f4 20 a0 04 st %i2, [ %g2 + 4 ] 20070a4: f4 00 e0 08 ld [ %g3 + 8 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20070a8: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 20070ac: f4 20 a0 08 st %i2, [ %g2 + 8 ] 20070b0: f4 00 e0 0c ld [ %g3 + 0xc ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20070b4: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 20070b8: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 20070bc: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20070c0: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 20070c4: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 20070c8: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20070cc: 12 bf ff f0 bne 200708c <_IO_Manager_initialization+0x7c> 20070d0: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 20070d4: 81 c7 e0 08 ret 20070d8: 81 e8 00 00 restore =============================================================================== 02007e40 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007e40: 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 ) 2007e44: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007e48: ba 10 00 18 mov %i0, %i5 * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 2007e4c: 80 a0 60 00 cmp %g1, 0 2007e50: 02 80 00 19 be 2007eb4 <_Objects_Allocate+0x74> <== NEVER TAKEN 2007e54: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007e58: b8 07 60 20 add %i5, 0x20, %i4 2007e5c: 7f ff fd 63 call 20073e8 <_Chain_Get> 2007e60: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007e64: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2007e68: 80 a0 60 00 cmp %g1, 0 2007e6c: 02 80 00 12 be 2007eb4 <_Objects_Allocate+0x74> 2007e70: 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 ) { 2007e74: 80 a2 20 00 cmp %o0, 0 2007e78: 02 80 00 11 be 2007ebc <_Objects_Allocate+0x7c> 2007e7c: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007e80: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007e84: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007e88: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007e8c: 40 00 42 44 call 201879c <.udiv> 2007e90: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007e94: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007e98: 91 2a 20 02 sll %o0, 2, %o0 2007e9c: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007ea0: c4 17 60 2c lduh [ %i5 + 0x2c ], %g2 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 2007ea4: 86 00 ff ff add %g3, -1, %g3 2007ea8: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007eac: 82 00 bf ff add %g2, -1, %g1 2007eb0: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007eb4: 81 c7 e0 08 ret 2007eb8: 81 e8 00 00 restore * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { _Objects_Extend_information( information ); 2007ebc: 40 00 00 10 call 2007efc <_Objects_Extend_information> 2007ec0: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007ec4: 7f ff fd 49 call 20073e8 <_Chain_Get> 2007ec8: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007ecc: b0 92 20 00 orcc %o0, 0, %i0 2007ed0: 32 bf ff ed bne,a 2007e84 <_Objects_Allocate+0x44> 2007ed4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2007ed8: 81 c7 e0 08 ret 2007edc: 81 e8 00 00 restore =============================================================================== 02007efc <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007efc: 9d e3 bf 90 save %sp, -112, %sp minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007f00: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2007f04: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007f08: 80 a4 20 00 cmp %l0, 0 2007f0c: 02 80 00 a6 be 20081a4 <_Objects_Extend_information+0x2a8> 2007f10: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007f14: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 2007f18: b3 2e 60 10 sll %i1, 0x10, %i1 2007f1c: 92 10 00 1a mov %i2, %o1 2007f20: 40 00 42 1f call 201879c <.udiv> 2007f24: 91 36 60 10 srl %i1, 0x10, %o0 2007f28: a7 2a 20 10 sll %o0, 0x10, %l3 2007f2c: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 2007f30: 80 a4 e0 00 cmp %l3, 0 2007f34: 02 80 00 a3 be 20081c0 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 2007f38: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 2007f3c: c2 04 00 00 ld [ %l0 ], %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2007f40: ba 10 00 1c mov %i4, %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2007f44: 80 a0 60 00 cmp %g1, 0 2007f48: 12 80 00 08 bne 2007f68 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 2007f4c: b6 10 20 00 clr %i3 do_extend = false; 2007f50: 10 80 00 a0 b 20081d0 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 2007f54: b4 10 20 00 clr %i2 <== NOT EXECUTED block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2007f58: c2 04 00 01 ld [ %l0 + %g1 ], %g1 2007f5c: 80 a0 60 00 cmp %g1, 0 2007f60: 22 80 00 08 be,a 2007f80 <_Objects_Extend_information+0x84> 2007f64: b4 10 20 00 clr %i2 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007f68: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007f6c: ba 07 40 1a add %i5, %i2, %i5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007f70: 80 a4 c0 1b cmp %l3, %i3 2007f74: 18 bf ff f9 bgu 2007f58 <_Objects_Extend_information+0x5c> 2007f78: 83 2e e0 02 sll %i3, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2007f7c: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007f80: b3 36 60 10 srl %i1, 0x10, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2007f84: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007f88: b2 06 40 08 add %i1, %o0, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2007f8c: 82 10 63 ff or %g1, 0x3ff, %g1 2007f90: 80 a6 40 01 cmp %i1, %g1 2007f94: 18 80 00 93 bgu 20081e0 <_Objects_Extend_information+0x2e4> 2007f98: 01 00 00 00 nop /* * Allocate the name table, and the objects and if it fails either return or * generate a fatal error depending on auto-extending being active. */ block_size = information->allocation_size * information->size; 2007f9c: 40 00 41 c6 call 20186b4 <.umul> 2007fa0: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007fa4: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007fa8: 80 a0 60 00 cmp %g1, 0 2007fac: 02 80 00 6a be 2008154 <_Objects_Extend_information+0x258> 2007fb0: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007fb4: 40 00 09 7f call 200a5b0 <_Workspace_Allocate> 2007fb8: 01 00 00 00 nop if ( !new_object_block ) 2007fbc: a0 92 20 00 orcc %o0, 0, %l0 2007fc0: 02 80 00 88 be 20081e0 <_Objects_Extend_information+0x2e4> 2007fc4: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2007fc8: 80 8e a0 ff btst 0xff, %i2 2007fcc: 22 80 00 3f be,a 20080c8 <_Objects_Extend_information+0x1cc> 2007fd0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007fd4: b4 04 e0 01 add %l3, 1, %i2 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007fd8: 91 2e a0 01 sll %i2, 1, %o0 2007fdc: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2007fe0: 90 06 40 08 add %i1, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007fe4: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007fe8: 40 00 09 72 call 200a5b0 <_Workspace_Allocate> 2007fec: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2007ff0: a2 92 20 00 orcc %o0, 0, %l1 2007ff4: 02 80 00 79 be 20081d8 <_Objects_Extend_information+0x2dc> 2007ff8: b5 2e a0 02 sll %i2, 2, %i2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2007ffc: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2008000: 80 a7 00 01 cmp %i4, %g1 2008004: a4 04 40 1a add %l1, %i2, %l2 2008008: 0a 80 00 57 bcs 2008164 <_Objects_Extend_information+0x268> 200800c: b4 04 80 1a add %l2, %i2, %i2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2008010: 80 a7 20 00 cmp %i4, 0 2008014: 02 80 00 07 be 2008030 <_Objects_Extend_information+0x134><== NEVER TAKEN 2008018: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 200801c: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2008020: 82 00 60 01 inc %g1 2008024: 80 a7 00 01 cmp %i4, %g1 2008028: 18 bf ff fd bgu 200801c <_Objects_Extend_information+0x120><== NEVER TAKEN 200802c: c0 20 80 1a clr [ %g2 + %i2 ] 2008030: a7 2c e0 02 sll %l3, 2, %l3 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2008034: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2008038: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 200803c: 86 07 40 03 add %i5, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008040: 80 a7 40 03 cmp %i5, %g3 2008044: 1a 80 00 0a bcc 200806c <_Objects_Extend_information+0x170><== NEVER TAKEN 2008048: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 200804c: 83 2f 60 02 sll %i5, 2, %g1 2008050: 84 10 00 1d mov %i5, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008054: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2008058: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 200805c: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008060: 80 a0 c0 02 cmp %g3, %g2 2008064: 18 bf ff fd bgu 2008058 <_Objects_Extend_information+0x15c> 2008068: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 200806c: 7f ff e8 47 call 2002188 2008070: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008074: c6 06 00 00 ld [ %i0 ], %g3 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2008078: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 200807c: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2008080: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2008084: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008088: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 200808c: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2008090: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2008094: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2008098: b3 2e 60 10 sll %i1, 0x10, %i1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 200809c: 03 00 00 40 sethi %hi(0x10000), %g1 20080a0: b3 36 60 10 srl %i1, 0x10, %i1 20080a4: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20080a8: 82 10 40 02 or %g1, %g2, %g1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20080ac: 82 10 40 19 or %g1, %i1, %g1 20080b0: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 20080b4: 7f ff e8 39 call 2002198 20080b8: 01 00 00 00 nop _Workspace_Free( old_tables ); 20080bc: 40 00 09 45 call 200a5d0 <_Workspace_Free> 20080c0: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20080c4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20080c8: b7 2e e0 02 sll %i3, 2, %i3 20080cc: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20080d0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20080d4: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 20080d8: d2 00 40 1b ld [ %g1 + %i3 ], %o1 20080dc: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 20080e0: 90 07 bf f4 add %fp, -12, %o0 20080e4: 40 00 14 27 call 200d180 <_Chain_Initialize> 20080e8: 39 00 00 40 sethi %hi(0x10000), %i4 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20080ec: 10 80 00 0d b 2008120 <_Objects_Extend_information+0x224> 20080f0: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 20080f4: c6 16 20 04 lduh [ %i0 + 4 ], %g3 20080f8: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20080fc: 87 28 e0 1b sll %g3, 0x1b, %g3 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008100: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008104: 84 10 80 03 or %g2, %g3, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008108: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 200810c: 90 10 00 1a mov %i2, %o0 2008110: 92 10 00 01 mov %g1, %o1 index++; 2008114: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008118: 7f ff fc a0 call 2007398 <_Chain_Append> 200811c: c4 20 60 08 st %g2, [ %g1 + 8 ] /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2008120: 7f ff fc b2 call 20073e8 <_Chain_Get> 2008124: 90 07 bf f4 add %fp, -12, %o0 2008128: 82 92 20 00 orcc %o0, 0, %g1 200812c: 32 bf ff f2 bne,a 20080f4 <_Objects_Extend_information+0x1f8> 2008130: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2008134: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2008138: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 200813c: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2008140: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2008144: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2008148: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 200814c: 81 c7 e0 08 ret 2008150: 81 e8 00 00 restore if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 2008154: 40 00 09 25 call 200a5e8 <_Workspace_Allocate_or_fatal_error> 2008158: 01 00 00 00 nop 200815c: 10 bf ff 9b b 2007fc8 <_Objects_Extend_information+0xcc> 2008160: a0 10 00 08 mov %o0, %l0 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2008164: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2008168: a7 2c e0 02 sll %l3, 2, %l3 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 200816c: 40 00 20 45 call 2010280 2008170: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2008174: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2008178: 94 10 00 13 mov %l3, %o2 200817c: 40 00 20 41 call 2010280 2008180: 90 10 00 12 mov %l2, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2008184: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2008188: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 200818c: b8 07 00 01 add %i4, %g1, %i4 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2008190: 90 10 00 1a mov %i2, %o0 2008194: 40 00 20 3b call 2010280 2008198: 95 2f 20 02 sll %i4, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 200819c: 10 bf ff a7 b 2008038 <_Objects_Extend_information+0x13c> 20081a0: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 20081a4: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20081a8: ba 10 00 1c mov %i4, %i5 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20081ac: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20081b0: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 20081b4: a6 10 20 00 clr %l3 20081b8: 10 bf ff 72 b 2007f80 <_Objects_Extend_information+0x84> 20081bc: b3 2e 60 10 sll %i1, 0x10, %i1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20081c0: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20081c4: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20081c8: 10 bf ff 6e b 2007f80 <_Objects_Extend_information+0x84> <== NOT EXECUTED 20081cc: b6 10 20 00 clr %i3 <== NOT EXECUTED 20081d0: 10 bf ff 6c b 2007f80 <_Objects_Extend_information+0x84> <== NOT EXECUTED 20081d4: b6 10 20 00 clr %i3 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 20081d8: 40 00 08 fe call 200a5d0 <_Workspace_Free> 20081dc: 90 10 00 10 mov %l0, %o0 return; 20081e0: 81 c7 e0 08 ret 20081e4: 81 e8 00 00 restore =============================================================================== 0200828c <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 200828c: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2008290: 80 a6 60 00 cmp %i1, 0 2008294: 02 80 00 17 be 20082f0 <_Objects_Get_information+0x64> 2008298: ba 10 20 00 clr %i5 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 200829c: 40 00 15 46 call 200d7b4 <_Objects_API_maximum_class> 20082a0: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 20082a4: 80 a2 20 00 cmp %o0, 0 20082a8: 02 80 00 12 be 20082f0 <_Objects_Get_information+0x64> 20082ac: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 20082b0: 0a 80 00 10 bcs 20082f0 <_Objects_Get_information+0x64> 20082b4: 03 00 80 76 sethi %hi(0x201d800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 20082b8: b1 2e 20 02 sll %i0, 2, %i0 20082bc: 82 10 60 b8 or %g1, 0xb8, %g1 20082c0: c2 00 40 18 ld [ %g1 + %i0 ], %g1 20082c4: 80 a0 60 00 cmp %g1, 0 20082c8: 02 80 00 0a be 20082f0 <_Objects_Get_information+0x64> <== NEVER TAKEN 20082cc: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 20082d0: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 20082d4: 80 a7 60 00 cmp %i5, 0 20082d8: 02 80 00 06 be 20082f0 <_Objects_Get_information+0x64> <== NEVER TAKEN 20082dc: 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 ) 20082e0: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 20082e4: 80 a0 00 01 cmp %g0, %g1 20082e8: 82 60 20 00 subx %g0, 0, %g1 20082ec: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 20082f0: 81 c7 e0 08 ret 20082f4: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02009ac8 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009ac8: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009acc: 80 a6 60 00 cmp %i1, 0 2009ad0: 02 80 00 41 be 2009bd4 <_Objects_Get_name_as_string+0x10c> 2009ad4: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2009ad8: 02 80 00 3a be 2009bc0 <_Objects_Get_name_as_string+0xf8> 2009adc: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009ae0: 02 80 00 3a be 2009bc8 <_Objects_Get_name_as_string+0x100> 2009ae4: 03 00 80 82 sethi %hi(0x2020800), %g1 information = _Objects_Get_information_id( tmpId ); 2009ae8: 7f ff ff ba call 20099d0 <_Objects_Get_information_id> 2009aec: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009af0: ba 92 20 00 orcc %o0, 0, %i5 2009af4: 02 80 00 38 be 2009bd4 <_Objects_Get_name_as_string+0x10c> 2009af8: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009afc: 40 00 00 3f call 2009bf8 <_Objects_Get> 2009b00: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009b04: c2 07 bf fc ld [ %fp + -4 ], %g1 2009b08: 80 a0 60 00 cmp %g1, 0 2009b0c: 32 80 00 33 bne,a 2009bd8 <_Objects_Get_name_as_string+0x110> 2009b10: b4 10 20 00 clr %i2 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 2009b14: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1 2009b18: 80 a0 60 00 cmp %g1, 0 2009b1c: 32 80 00 31 bne,a 2009be0 <_Objects_Get_name_as_string+0x118> 2009b20: c4 02 20 0c ld [ %o0 + 0xc ], %g2 s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 2009b24: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 2009b28: c0 2f bf f4 clrb [ %fp + -12 ] { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 2009b2c: 85 30 60 08 srl %g1, 8, %g2 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009b30: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b34: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009b38: c4 2f bf f2 stb %g2, [ %fp + -14 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009b3c: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b40: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 2009b44: c2 2f bf f3 stb %g1, [ %fp + -13 ] lname[ 4 ] = '\0'; s = lname; 2009b48: 84 07 bf f0 add %fp, -16, %g2 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b4c: b2 86 7f ff addcc %i1, -1, %i1 2009b50: 02 80 00 1a be 2009bb8 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 2009b54: 82 10 00 1a mov %i2, %g1 2009b58: c8 48 80 00 ldsb [ %g2 ], %g4 2009b5c: 80 a1 20 00 cmp %g4, 0 2009b60: 02 80 00 16 be 2009bb8 <_Objects_Get_name_as_string+0xf0> 2009b64: c6 08 80 00 ldub [ %g2 ], %g3 2009b68: 31 00 80 7d sethi %hi(0x201f400), %i0 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 2009b6c: b2 06 80 19 add %i2, %i1, %i1 2009b70: 10 80 00 05 b 2009b84 <_Objects_Get_name_as_string+0xbc> 2009b74: b0 16 22 c4 or %i0, 0x2c4, %i0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b78: 80 a1 20 00 cmp %g4, 0 2009b7c: 02 80 00 0f be 2009bb8 <_Objects_Get_name_as_string+0xf0> 2009b80: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009b84: fa 06 00 00 ld [ %i0 ], %i5 2009b88: 88 08 e0 ff and %g3, 0xff, %g4 2009b8c: 88 07 40 04 add %i5, %g4, %g4 2009b90: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2009b94: 80 89 20 97 btst 0x97, %g4 2009b98: 12 80 00 03 bne 2009ba4 <_Objects_Get_name_as_string+0xdc> 2009b9c: 84 00 a0 01 inc %g2 2009ba0: 86 10 20 2a mov 0x2a, %g3 2009ba4: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009ba8: 82 00 60 01 inc %g1 2009bac: 80 a0 40 19 cmp %g1, %i1 2009bb0: 32 bf ff f2 bne,a 2009b78 <_Objects_Get_name_as_string+0xb0> 2009bb4: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009bb8: 40 00 03 ac call 200aa68 <_Thread_Enable_dispatch> 2009bbc: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 2009bc0: 81 c7 e0 08 ret 2009bc4: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009bc8: c2 00 61 b4 ld [ %g1 + 0x1b4 ], %g1 2009bcc: 10 bf ff c7 b 2009ae8 <_Objects_Get_name_as_string+0x20> 2009bd0: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009bd4: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009bd8: 81 c7 e0 08 ret 2009bdc: 91 e8 00 1a restore %g0, %i2, %o0 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 2009be0: 80 a0 a0 00 cmp %g2, 0 2009be4: 12 bf ff da bne 2009b4c <_Objects_Get_name_as_string+0x84> 2009be8: 82 10 00 1a mov %i2, %g1 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009bec: 40 00 03 9f call 200aa68 <_Thread_Enable_dispatch> 2009bf0: c0 28 40 00 clrb [ %g1 ] 2009bf4: 30 bf ff f3 b,a 2009bc0 <_Objects_Get_name_as_string+0xf8> =============================================================================== 02007fa4 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2007fa4: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2007fa8: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2007fac: 80 a6 20 00 cmp %i0, 0 2007fb0: 02 80 00 19 be 2008014 <_Objects_Get_next+0x70> 2007fb4: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2007fb8: 80 a6 a0 00 cmp %i2, 0 2007fbc: 02 80 00 16 be 2008014 <_Objects_Get_next+0x70> 2007fc0: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2007fc4: 02 80 00 14 be 2008014 <_Objects_Get_next+0x70> 2007fc8: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2007fcc: 80 a0 60 00 cmp %g1, 0 2007fd0: 22 80 00 13 be,a 200801c <_Objects_Get_next+0x78> 2007fd4: f2 06 20 08 ld [ %i0 + 8 ], %i1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fd8: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2007fdc: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007fe0: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fe4: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007fe8: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fec: 80 a0 80 01 cmp %g2, %g1 2007ff0: 0a 80 00 13 bcs 200803c <_Objects_Get_next+0x98> 2007ff4: 94 10 00 1a mov %i2, %o2 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007ff8: 40 00 00 18 call 2008058 <_Objects_Get> 2007ffc: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2008000: c2 06 80 00 ld [ %i2 ], %g1 2008004: 80 a0 60 00 cmp %g1, 0 2008008: 32 bf ff f5 bne,a 2007fdc <_Objects_Get_next+0x38> 200800c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2008010: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2008014: 81 c7 e0 08 ret 2008018: 91 e8 00 08 restore %g0, %o0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 200801c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008020: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008024: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008028: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 200802c: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008030: 80 a0 80 01 cmp %g2, %g1 2008034: 1a bf ff f1 bcc 2007ff8 <_Objects_Get_next+0x54> <== ALWAYS TAKEN 2008038: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 200803c: 82 10 20 01 mov 1, %g1 2008040: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2008044: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2008048: 82 10 3f ff mov -1, %g1 200804c: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2008050: 81 c7 e0 08 ret 2008054: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020095c4 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 20095c4: 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; 20095c8: 80 a6 20 00 cmp %i0, 0 20095cc: 12 80 00 06 bne 20095e4 <_Objects_Id_to_name+0x20> 20095d0: 83 36 20 18 srl %i0, 0x18, %g1 20095d4: 03 00 80 7d sethi %hi(0x201f400), %g1 20095d8: c2 00 62 84 ld [ %g1 + 0x284 ], %g1 ! 201f684 <_Per_CPU_Information+0xc> 20095dc: f0 00 60 08 ld [ %g1 + 8 ], %i0 20095e0: 83 36 20 18 srl %i0, 0x18, %g1 20095e4: 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 ) 20095e8: 84 00 7f ff add %g1, -1, %g2 20095ec: 80 a0 a0 02 cmp %g2, 2 20095f0: 18 80 00 12 bgu 2009638 <_Objects_Id_to_name+0x74> 20095f4: ba 10 20 03 mov 3, %i5 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 20095f8: 83 28 60 02 sll %g1, 2, %g1 20095fc: 05 00 80 7c sethi %hi(0x201f000), %g2 2009600: 84 10 a0 a8 or %g2, 0xa8, %g2 ! 201f0a8 <_Objects_Information_table> 2009604: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009608: 80 a0 60 00 cmp %g1, 0 200960c: 02 80 00 0b be 2009638 <_Objects_Id_to_name+0x74> 2009610: 85 36 20 1b srl %i0, 0x1b, %g2 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 2009614: 85 28 a0 02 sll %g2, 2, %g2 2009618: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 200961c: 80 a2 20 00 cmp %o0, 0 2009620: 02 80 00 06 be 2009638 <_Objects_Id_to_name+0x74> <== NEVER TAKEN 2009624: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2009628: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 200962c: 80 a0 60 00 cmp %g1, 0 2009630: 02 80 00 04 be 2009640 <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN 2009634: 92 10 00 18 mov %i0, %o1 return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2009638: 81 c7 e0 08 ret 200963c: 91 e8 00 1d restore %g0, %i5, %o0 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2009640: 7f ff ff c3 call 200954c <_Objects_Get> 2009644: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2009648: 80 a2 20 00 cmp %o0, 0 200964c: 02 bf ff fb be 2009638 <_Objects_Id_to_name+0x74> 2009650: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2009654: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009658: ba 10 20 00 clr %i5 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 200965c: 40 00 03 ad call 200a510 <_Thread_Enable_dispatch> 2009660: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009664: 30 bf ff f5 b,a 2009638 <_Objects_Id_to_name+0x74> =============================================================================== 020085c8 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 20085c8: 9d e3 bf a0 save %sp, -96, %sp /* * Search the list to find block or chunk with all objects inactive. */ index_base = _Objects_Get_index( information->minimum_id ); 20085cc: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 20085d0: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 20085d4: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 20085d8: 92 10 00 1c mov %i4, %o1 20085dc: 40 00 40 70 call 201879c <.udiv> 20085e0: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 20085e4: 80 a2 20 00 cmp %o0, 0 20085e8: 02 80 00 34 be 20086b8 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 20085ec: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 20085f0: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 20085f4: c2 01 00 00 ld [ %g4 ], %g1 20085f8: 80 a7 00 01 cmp %i4, %g1 20085fc: 02 80 00 0f be 2008638 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2008600: 82 10 20 00 clr %g1 2008604: 10 80 00 07 b 2008620 <_Objects_Shrink_information+0x58> 2008608: b6 10 20 04 mov 4, %i3 200860c: 86 06 e0 04 add %i3, 4, %g3 2008610: 80 a7 00 02 cmp %i4, %g2 2008614: 02 80 00 0a be 200863c <_Objects_Shrink_information+0x74> 2008618: ba 07 40 1c add %i5, %i4, %i5 200861c: b6 10 00 03 mov %g3, %i3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2008620: 82 00 60 01 inc %g1 2008624: 80 a0 40 08 cmp %g1, %o0 2008628: 32 bf ff f9 bne,a 200860c <_Objects_Shrink_information+0x44> 200862c: c4 01 00 1b ld [ %g4 + %i3 ], %g2 2008630: 81 c7 e0 08 ret 2008634: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2008638: b6 10 20 00 clr %i3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200863c: 10 80 00 06 b 2008654 <_Objects_Shrink_information+0x8c> 2008640: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2008644: 80 a7 20 00 cmp %i4, 0 2008648: 22 80 00 12 be,a 2008690 <_Objects_Shrink_information+0xc8> 200864c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 2008650: 90 10 00 1c mov %i4, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2008654: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2008658: 80 a0 40 1d cmp %g1, %i5 200865c: 0a bf ff fa bcs 2008644 <_Objects_Shrink_information+0x7c> 2008660: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 2008664: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2008668: 84 07 40 02 add %i5, %g2, %g2 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 200866c: 80 a0 40 02 cmp %g1, %g2 2008670: 1a bf ff f6 bcc 2008648 <_Objects_Shrink_information+0x80> 2008674: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 2008678: 7f ff fb 53 call 20073c4 <_Chain_Extract> 200867c: 01 00 00 00 nop } } while ( the_object ); 2008680: 80 a7 20 00 cmp %i4, 0 2008684: 12 bf ff f4 bne 2008654 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 2008688: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 200868c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2008690: 40 00 07 d0 call 200a5d0 <_Workspace_Free> 2008694: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 2008698: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 200869c: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 20086a0: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 20086a4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 20086a8: c2 16 20 14 lduh [ %i0 + 0x14 ], %g1 * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; 20086ac: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 20086b0: 82 20 80 01 sub %g2, %g1, %g1 20086b4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 20086b8: 81 c7 e0 08 ret 20086bc: 81 e8 00 00 restore =============================================================================== 0200b29c <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b29c: 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( 200b2a0: 11 00 80 9e sethi %hi(0x2027800), %o0 200b2a4: 92 10 00 18 mov %i0, %o1 200b2a8: 90 12 20 ec or %o0, 0xec, %o0 200b2ac: 40 00 0d 13 call 200e6f8 <_Objects_Get> 200b2b0: 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 ) { 200b2b4: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b2b8: 80 a0 60 00 cmp %g1, 0 200b2bc: 22 80 00 08 be,a 200b2dc <_POSIX_Message_queue_Receive_support+0x40> 200b2c0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b2c4: 40 00 2c ec call 2016674 <__errno> 200b2c8: b0 10 3f ff mov -1, %i0 200b2cc: 82 10 20 09 mov 9, %g1 200b2d0: c2 22 00 00 st %g1, [ %o0 ] } 200b2d4: 81 c7 e0 08 ret 200b2d8: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200b2dc: 84 08 60 03 and %g1, 3, %g2 200b2e0: 80 a0 a0 01 cmp %g2, 1 200b2e4: 02 80 00 37 be 200b3c0 <_POSIX_Message_queue_Receive_support+0x124> 200b2e8: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200b2ec: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b2f0: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b2f4: 80 a0 80 1a cmp %g2, %i2 200b2f8: 18 80 00 21 bgu 200b37c <_POSIX_Message_queue_Receive_support+0xe0> 200b2fc: 84 10 3f ff mov -1, %g2 /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200b300: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b304: 80 a7 20 00 cmp %i4, 0 200b308: 12 80 00 18 bne 200b368 <_POSIX_Message_queue_Receive_support+0xcc><== ALWAYS TAKEN 200b30c: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b310: 9a 10 00 1d mov %i5, %o5 200b314: 90 02 20 1c add %o0, 0x1c, %o0 200b318: 92 10 00 18 mov %i0, %o1 200b31c: 94 10 00 19 mov %i1, %o2 200b320: 96 07 bf fc add %fp, -4, %o3 200b324: 40 00 08 90 call 200d564 <_CORE_message_queue_Seize> 200b328: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b32c: 40 00 10 ae call 200f5e4 <_Thread_Enable_dispatch> 200b330: 3b 00 80 9e sethi %hi(0x2027800), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b334: ba 17 61 58 or %i5, 0x158, %i5 ! 2027958 <_Per_CPU_Information> 200b338: c2 07 60 0c ld [ %i5 + 0xc ], %g1 RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core( CORE_message_queue_Submit_types priority ) { /* absolute value without a library dependency */ return ((priority >= 0) ? priority : -priority); 200b33c: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 if ( !_Thread_Executing->Wait.return_code ) 200b340: c6 00 60 34 ld [ %g1 + 0x34 ], %g3 200b344: 83 38 a0 1f sra %g2, 0x1f, %g1 200b348: 84 18 40 02 xor %g1, %g2, %g2 200b34c: 82 20 80 01 sub %g2, %g1, %g1 200b350: 80 a0 e0 00 cmp %g3, 0 200b354: 12 80 00 12 bne 200b39c <_POSIX_Message_queue_Receive_support+0x100> 200b358: c2 26 c0 00 st %g1, [ %i3 ] return length_out; 200b35c: f0 07 bf fc ld [ %fp + -4 ], %i0 200b360: 81 c7 e0 08 ret 200b364: 81 e8 00 00 restore /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200b368: 05 00 00 10 sethi %hi(0x4000), %g2 200b36c: 82 08 40 02 and %g1, %g2, %g1 200b370: 80 a0 00 01 cmp %g0, %g1 200b374: 10 bf ff e7 b 200b310 <_POSIX_Message_queue_Receive_support+0x74> 200b378: 98 60 3f ff subx %g0, -1, %o4 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { _Thread_Enable_dispatch(); 200b37c: 40 00 10 9a call 200f5e4 <_Thread_Enable_dispatch> 200b380: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b384: 40 00 2c bc call 2016674 <__errno> 200b388: 01 00 00 00 nop 200b38c: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b390: c2 22 00 00 st %g1, [ %o0 ] 200b394: 81 c7 e0 08 ret 200b398: 81 e8 00 00 restore _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200b39c: 40 00 2c b6 call 2016674 <__errno> 200b3a0: b0 10 3f ff mov -1, %i0 200b3a4: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b3a8: b6 10 00 08 mov %o0, %i3 200b3ac: 40 00 00 a3 call 200b638 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b3b0: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b3b4: d0 26 c0 00 st %o0, [ %i3 ] 200b3b8: 81 c7 e0 08 ret 200b3bc: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { _Thread_Enable_dispatch(); 200b3c0: 40 00 10 89 call 200f5e4 <_Thread_Enable_dispatch> 200b3c4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200b3c8: 40 00 2c ab call 2016674 <__errno> 200b3cc: 01 00 00 00 nop 200b3d0: 82 10 20 09 mov 9, %g1 ! 9 200b3d4: c2 22 00 00 st %g1, [ %o0 ] 200b3d8: 81 c7 e0 08 ret 200b3dc: 81 e8 00 00 restore =============================================================================== 0200c1e8 <_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 ]; 200c1e8: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200c1ec: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200c1f0: 80 a0 a0 00 cmp %g2, 0 200c1f4: 12 80 00 06 bne 200c20c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200c1f8: 01 00 00 00 nop 200c1fc: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200c200: 80 a0 a0 01 cmp %g2, 1 200c204: 22 80 00 05 be,a 200c218 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200c208: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); } else _Thread_Enable_dispatch(); 200c20c: 82 13 c0 00 mov %o7, %g1 200c210: 7f ff f3 a6 call 20090a8 <_Thread_Enable_dispatch> 200c214: 9e 10 40 00 mov %g1, %o7 POSIX_API_Control *thread_support; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200c218: 80 a0 60 00 cmp %g1, 0 200c21c: 02 bf ff fc be 200c20c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200c220: 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--; 200c224: 03 00 80 5f sethi %hi(0x2017c00), %g1 200c228: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 2017fa0 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200c22c: 92 10 3f ff mov -1, %o1 200c230: 84 00 bf ff add %g2, -1, %g2 200c234: c4 20 63 a0 st %g2, [ %g1 + 0x3a0 ] return _Thread_Dispatch_disable_level; 200c238: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1 200c23c: 82 13 c0 00 mov %o7, %g1 200c240: 40 00 01 d7 call 200c99c <_POSIX_Thread_Exit> 200c244: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200d648 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200d648: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200d64c: d0 06 40 00 ld [ %i1 ], %o0 200d650: 7f ff ff f1 call 200d614 <_POSIX_Priority_Is_valid> 200d654: ba 10 00 18 mov %i0, %i5 200d658: 80 8a 20 ff btst 0xff, %o0 200d65c: 02 80 00 34 be 200d72c <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN 200d660: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200d664: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; 200d668: c0 26 c0 00 clr [ %i3 ] if ( policy == SCHED_OTHER ) { 200d66c: 80 a7 60 00 cmp %i5, 0 200d670: 02 80 00 2d be 200d724 <_POSIX_Thread_Translate_sched_param+0xdc> 200d674: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200d678: 80 a7 60 01 cmp %i5, 1 200d67c: 02 80 00 2c be 200d72c <_POSIX_Thread_Translate_sched_param+0xe4> 200d680: 80 a7 60 02 cmp %i5, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200d684: 02 80 00 2c be 200d734 <_POSIX_Thread_Translate_sched_param+0xec> 200d688: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200d68c: 12 80 00 28 bne 200d72c <_POSIX_Thread_Translate_sched_param+0xe4> 200d690: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200d694: c2 06 60 08 ld [ %i1 + 8 ], %g1 200d698: 80 a0 60 00 cmp %g1, 0 200d69c: 32 80 00 07 bne,a 200d6b8 <_POSIX_Thread_Translate_sched_param+0x70> 200d6a0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d6a4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200d6a8: 80 a0 60 00 cmp %g1, 0 200d6ac: 02 80 00 23 be 200d738 <_POSIX_Thread_Translate_sched_param+0xf0> 200d6b0: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200d6b4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d6b8: 80 a0 60 00 cmp %g1, 0 200d6bc: 12 80 00 06 bne 200d6d4 <_POSIX_Thread_Translate_sched_param+0x8c> 200d6c0: 01 00 00 00 nop 200d6c4: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d6c8: 80 a0 60 00 cmp %g1, 0 200d6cc: 02 80 00 18 be 200d72c <_POSIX_Thread_Translate_sched_param+0xe4> 200d6d0: b0 10 20 16 mov 0x16, %i0 (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200d6d4: 7f ff f5 2d call 200ab88 <_Timespec_To_ticks> 200d6d8: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200d6dc: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_init_budget.tv_sec == 0) && (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200d6e0: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200d6e4: 7f ff f5 29 call 200ab88 <_Timespec_To_ticks> 200d6e8: 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 ) < 200d6ec: 80 a7 40 08 cmp %i5, %o0 200d6f0: 0a 80 00 12 bcs 200d738 <_POSIX_Thread_Translate_sched_param+0xf0> 200d6f4: 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 ) ) 200d6f8: 7f ff ff c7 call 200d614 <_POSIX_Priority_Is_valid> 200d6fc: d0 06 60 04 ld [ %i1 + 4 ], %o0 200d700: 80 8a 20 ff btst 0xff, %o0 200d704: 02 80 00 0a be 200d72c <_POSIX_Thread_Translate_sched_param+0xe4> 200d708: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200d70c: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200d710: 03 00 80 1a sethi %hi(0x2006800), %g1 200d714: 82 10 63 98 or %g1, 0x398, %g1 ! 2006b98 <_POSIX_Threads_Sporadic_budget_callout> 200d718: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200d71c: 81 c7 e0 08 ret 200d720: 91 e8 20 00 restore %g0, 0, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200d724: 82 10 20 01 mov 1, %g1 200d728: c2 26 80 00 st %g1, [ %i2 ] return 0; 200d72c: 81 c7 e0 08 ret 200d730: 81 e8 00 00 restore *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200d734: fa 26 80 00 st %i5, [ %i2 ] return 0; 200d738: 81 c7 e0 08 ret 200d73c: 81 e8 00 00 restore =============================================================================== 02006898 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2006898: 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; 200689c: 03 00 80 75 sethi %hi(0x201d400), %g1 20068a0: 82 10 62 d4 or %g1, 0x2d4, %g1 ! 201d6d4 maximum = Configuration_POSIX_API.number_of_initialization_threads; 20068a4: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 20068a8: 80 a6 e0 00 cmp %i3, 0 20068ac: 02 80 00 18 be 200690c <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20068b0: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 20068b4: 80 a7 60 00 cmp %i5, 0 20068b8: 02 80 00 15 be 200690c <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20068bc: 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 ); 20068c0: 40 00 1b a0 call 200d740 20068c4: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 20068c8: 92 10 20 02 mov 2, %o1 20068cc: 40 00 1b a9 call 200d770 20068d0: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 20068d4: d2 07 60 04 ld [ %i5 + 4 ], %o1 20068d8: 40 00 1b b6 call 200d7b0 20068dc: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 20068e0: d4 07 40 00 ld [ %i5 ], %o2 20068e4: 90 07 bf fc add %fp, -4, %o0 20068e8: 92 07 bf bc add %fp, -68, %o1 20068ec: 7f ff ff 28 call 200658c 20068f0: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20068f4: 94 92 20 00 orcc %o0, 0, %o2 20068f8: 12 80 00 07 bne 2006914 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 20068fc: b8 07 20 01 inc %i4 * * Setting the attributes explicitly is critical, since we don't want * to inherit the idle tasks attributes. */ for ( index=0 ; index < maximum ; index++ ) { 2006900: 80 a6 c0 1c cmp %i3, %i4 2006904: 18 bf ff ef bgu 20068c0 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 2006908: ba 07 60 08 add %i5, 8, %i5 200690c: 81 c7 e0 08 ret 2006910: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2006914: 90 10 20 02 mov 2, %o0 2006918: 40 00 08 4a call 2008a40 <_Internal_error_Occurred> 200691c: 92 10 20 01 mov 1, %o1 =============================================================================== 0200ca9c <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200ca9c: 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 ]; 200caa0: 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 ); 200caa4: 40 00 04 09 call 200dac8 <_Timespec_To_ticks> 200caa8: 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); 200caac: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200cab0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200cab4: d2 08 60 2c ldub [ %g1 + 0x2c ], %o1 ! 201cc2c */ #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 ) { 200cab8: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200cabc: 92 22 40 02 sub %o1, %g2, %o1 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget ); the_thread->cpu_time_budget = ticks; 200cac0: d0 26 60 78 st %o0, [ %i1 + 0x78 ] */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200cac4: 80 a0 60 00 cmp %g1, 0 200cac8: 12 80 00 06 bne 200cae0 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200cacc: 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 ) { 200cad0: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200cad4: 80 a0 40 09 cmp %g1, %o1 200cad8: 38 80 00 09 bgu,a 200cafc <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200cadc: 90 10 00 19 mov %i1, %o0 #endif } } /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period ); 200cae0: 40 00 03 fa call 200dac8 <_Timespec_To_ticks> 200cae4: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cae8: 31 00 80 76 sethi %hi(0x201d800), %i0 200caec: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200caf0: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200caf4: 7f ff f5 d1 call 200a238 <_Watchdog_Insert> 200caf8: 91 ee 22 14 restore %i0, 0x214, %o0 if ( the_thread->resource_count == 0 ) { /* * If this would make them less important, then do not change it. */ if ( the_thread->current_priority > new_priority ) { _Thread_Change_priority( the_thread, new_priority, true ); 200cafc: 7f ff f0 a6 call 2008d94 <_Thread_Change_priority> 200cb00: 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 ); 200cb04: 40 00 03 f1 call 200dac8 <_Timespec_To_ticks> 200cb08: 90 07 60 90 add %i5, 0x90, %o0 200cb0c: 31 00 80 76 sethi %hi(0x201d800), %i0 200cb10: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200cb14: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cb18: 7f ff f5 c8 call 200a238 <_Watchdog_Insert> 200cb1c: 91 ee 22 14 restore %i0, 0x214, %o0 =============================================================================== 0200cb20 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200cb20: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200cb24: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200cb28: 05 00 80 73 sethi %hi(0x201cc00), %g2 200cb2c: d2 08 a0 2c ldub [ %g2 + 0x2c ], %o1 ! 201cc2c */ #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 ) { 200cb30: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200cb34: 92 22 40 03 sub %o1, %g3, %o1 /* * This will prevent the thread from consuming its entire "budget" * while at low priority. */ the_thread->cpu_time_budget = 0xFFFFFFFF; /* XXX should be based on MAX_U32 */ 200cb38: 86 10 3f ff mov -1, %g3 new_priority = _POSIX_Priority_To_core(api->schedparam.sched_ss_low_priority); the_thread->real_priority = new_priority; 200cb3c: d2 22 20 18 st %o1, [ %o0 + 0x18 ] */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200cb40: 80 a0 a0 00 cmp %g2, 0 200cb44: 12 80 00 06 bne 200cb5c <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200cb48: c6 22 20 78 st %g3, [ %o0 + 0x78 ] /* * Make sure we are actually lowering it. If they have lowered it * to logically lower than sched_ss_low_priority, then we do not want to * change it. */ if ( the_thread->current_priority < new_priority ) { 200cb4c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200cb50: 80 a0 40 09 cmp %g1, %o1 200cb54: 0a 80 00 04 bcs 200cb64 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200cb58: 94 10 20 01 mov 1, %o2 200cb5c: 81 c3 e0 08 retl <== NOT EXECUTED 200cb60: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200cb64: 82 13 c0 00 mov %o7, %g1 200cb68: 7f ff f0 8b call 2008d94 <_Thread_Change_priority> 200cb6c: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200ef50 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200ef50: 9d e3 bf a0 save %sp, -96, %sp POSIX_Cancel_Handler_control *handler; Chain_Control *handler_stack; POSIX_API_Control *thread_support; ISR_Level level; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200ef54: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200ef58: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200ef5c: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200ef60: b6 07 20 e8 add %i4, 0xe8, %i3 200ef64: 80 a0 40 1b cmp %g1, %i3 200ef68: 02 80 00 14 be 200efb8 <_POSIX_Threads_cancel_run+0x68> 200ef6c: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200ef70: 7f ff cc 86 call 2002188 200ef74: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200ef78: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200ef7c: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200ef80: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200ef84: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200ef88: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200ef8c: 7f ff cc 83 call 2002198 200ef90: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200ef94: c2 07 60 08 ld [ %i5 + 8 ], %g1 200ef98: 9f c0 40 00 call %g1 200ef9c: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200efa0: 7f ff ed 8c call 200a5d0 <_Workspace_Free> 200efa4: 90 10 00 1d mov %i5, %o0 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; while ( !_Chain_Is_empty( handler_stack ) ) { 200efa8: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200efac: 80 a0 40 1b cmp %g1, %i3 200efb0: 12 bf ff f0 bne 200ef70 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200efb4: 01 00 00 00 nop 200efb8: 81 c7 e0 08 ret 200efbc: 81 e8 00 00 restore =============================================================================== 0200665c <_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) { 200665c: 9d e3 bf a0 save %sp, -96, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2006660: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006664: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2006668: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 200666c: 80 a0 60 00 cmp %g1, 0 2006670: 12 80 00 0e bne 20066a8 <_POSIX_Timer_TSR+0x4c> 2006674: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 2006678: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 200667c: 80 a0 60 00 cmp %g1, 0 2006680: 32 80 00 0b bne,a 20066ac <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 2006684: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; } else { /* Indicates that the timer is stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006688: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 200668c: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] <== NOT EXECUTED /* * The sending of the signal to the process running the handling function * specified for that signal is simulated */ if ( pthread_kill ( ptimer->thread_id, ptimer->inf.sigev_signo ) ) { 2006690: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 2006694: 40 00 1a 27 call 200cf30 2006698: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 200669c: c0 26 60 68 clr [ %i1 + 0x68 ] 20066a0: 81 c7 e0 08 ret 20066a4: 81 e8 00 00 restore ptimer->overrun = ptimer->overrun + 1; /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 20066a8: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 20066ac: d4 06 60 08 ld [ %i1 + 8 ], %o2 20066b0: 90 06 60 10 add %i1, 0x10, %o0 20066b4: 98 10 00 19 mov %i1, %o4 20066b8: 17 00 80 19 sethi %hi(0x2006400), %o3 20066bc: 40 00 1b 44 call 200d3cc <_POSIX_Timer_Insert_helper> 20066c0: 96 12 e2 5c or %o3, 0x25c, %o3 ! 200665c <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 20066c4: 80 8a 20 ff btst 0xff, %o0 20066c8: 02 bf ff f6 be 20066a0 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 20066cc: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 20066d0: 40 00 05 de call 2007e48 <_TOD_Get> 20066d4: 90 06 60 6c add %i1, 0x6c, %o0 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20066d8: 82 10 20 03 mov 3, %g1 20066dc: 10 bf ff ed b 2006690 <_POSIX_Timer_TSR+0x34> 20066e0: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200f078 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200f078: 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, 200f07c: 98 10 20 01 mov 1, %o4 200f080: 90 10 00 18 mov %i0, %o0 200f084: 92 10 00 19 mov %i1, %o1 200f088: 94 07 bf f4 add %fp, -12, %o2 200f08c: 40 00 00 2e call 200f144 <_POSIX_signals_Clear_signals> 200f090: 96 10 00 1a mov %i2, %o3 200f094: 80 8a 20 ff btst 0xff, %o0 200f098: 02 80 00 23 be 200f124 <_POSIX_signals_Check_signal+0xac> 200f09c: 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 ) 200f0a0: 85 2e 60 02 sll %i1, 2, %g2 200f0a4: 37 00 80 77 sethi %hi(0x201dc00), %i3 200f0a8: b9 2e 60 04 sll %i1, 4, %i4 200f0ac: b6 16 e2 e0 or %i3, 0x2e0, %i3 200f0b0: b8 27 00 02 sub %i4, %g2, %i4 200f0b4: 84 06 c0 1c add %i3, %i4, %g2 200f0b8: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200f0bc: 80 a7 60 01 cmp %i5, 1 200f0c0: 02 80 00 19 be 200f124 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200f0c4: 21 00 80 77 sethi %hi(0x201dc00), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200f0c8: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200f0cc: c2 00 a0 04 ld [ %g2 + 4 ], %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 200f0d0: a0 14 22 88 or %l0, 0x288, %l0 200f0d4: d2 04 20 0c ld [ %l0 + 0xc ], %o1 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200f0d8: 82 10 40 1a or %g1, %i2, %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 200f0dc: 90 07 bf cc add %fp, -52, %o0 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200f0e0: 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, 200f0e4: 92 02 60 20 add %o1, 0x20, %o1 200f0e8: 40 00 04 66 call 2010280 200f0ec: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200f0f0: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200f0f4: 80 a0 60 02 cmp %g1, 2 200f0f8: 02 80 00 0e be 200f130 <_POSIX_signals_Check_signal+0xb8> 200f0fc: 90 10 00 19 mov %i1, %o0 &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200f100: 9f c7 40 00 call %i5 200f104: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200f108: d0 04 20 0c ld [ %l0 + 0xc ], %o0 200f10c: 92 07 bf cc add %fp, -52, %o1 200f110: 90 02 20 20 add %o0, 0x20, %o0 200f114: 40 00 04 5b call 2010280 200f118: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200f11c: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200f120: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200f124: b0 08 60 01 and %g1, 1, %i0 200f128: 81 c7 e0 08 ret 200f12c: 81 e8 00 00 restore /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200f130: 92 07 bf f4 add %fp, -12, %o1 200f134: 9f c7 40 00 call %i5 200f138: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200f13c: 10 bf ff f4 b 200f10c <_POSIX_signals_Check_signal+0x94> 200f140: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 0200f880 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200f880: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200f884: 7f ff ca 41 call 2002188 200f888: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200f88c: 85 2e 20 04 sll %i0, 4, %g2 200f890: 83 2e 20 02 sll %i0, 2, %g1 200f894: 82 20 80 01 sub %g2, %g1, %g1 200f898: 05 00 80 77 sethi %hi(0x201dc00), %g2 200f89c: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 201dee0 <_POSIX_signals_Vectors> 200f8a0: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200f8a4: 80 a0 a0 02 cmp %g2, 2 200f8a8: 02 80 00 0b be 200f8d4 <_POSIX_signals_Clear_process_signals+0x54> 200f8ac: 05 00 80 78 sethi %hi(0x201e000), %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200f8b0: 03 00 80 78 sethi %hi(0x201e000), %g1 200f8b4: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 ! 201e0d4 <_POSIX_signals_Pending> 200f8b8: 86 10 20 01 mov 1, %g3 200f8bc: b0 06 3f ff add %i0, -1, %i0 200f8c0: b1 28 c0 18 sll %g3, %i0, %i0 200f8c4: b0 28 80 18 andn %g2, %i0, %i0 200f8c8: f0 20 60 d4 st %i0, [ %g1 + 0xd4 ] } _ISR_Enable( level ); 200f8cc: 7f ff ca 33 call 2002198 200f8d0: 91 e8 00 08 restore %g0, %o0, %o0 ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200f8d4: 84 10 a0 d8 or %g2, 0xd8, %g2 200f8d8: c6 00 40 02 ld [ %g1 + %g2 ], %g3 200f8dc: 82 00 40 02 add %g1, %g2, %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200f8e0: 82 00 60 04 add %g1, 4, %g1 200f8e4: 80 a0 c0 01 cmp %g3, %g1 200f8e8: 02 bf ff f3 be 200f8b4 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN 200f8ec: 03 00 80 78 sethi %hi(0x201e000), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 200f8f0: 7f ff ca 2a call 2002198 <== NOT EXECUTED 200f8f4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 020070c4 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20070c4: 82 10 20 1b mov 0x1b, %g1 20070c8: 86 10 20 01 mov 1, %g3 #include #include #include #include int _POSIX_signals_Get_lowest( 20070cc: 84 00 7f ff add %g1, -1, %g2 20070d0: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20070d4: 80 88 80 08 btst %g2, %o0 20070d8: 12 80 00 11 bne 200711c <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20070dc: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20070e0: 82 00 60 01 inc %g1 20070e4: 80 a0 60 20 cmp %g1, 0x20 20070e8: 12 bf ff fa bne 20070d0 <_POSIX_signals_Get_lowest+0xc> 20070ec: 84 00 7f ff add %g1, -1, %g2 20070f0: 82 10 20 01 mov 1, %g1 20070f4: 10 80 00 05 b 2007108 <_POSIX_signals_Get_lowest+0x44> 20070f8: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 20070fc: 80 a0 60 1b cmp %g1, 0x1b 2007100: 02 80 00 07 be 200711c <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2007104: 01 00 00 00 nop #include #include #include #include int _POSIX_signals_Get_lowest( 2007108: 84 00 7f ff add %g1, -1, %g2 200710c: 85 28 c0 02 sll %g3, %g2, %g2 #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2007110: 80 88 80 08 btst %g2, %o0 2007114: 22 bf ff fa be,a 20070fc <_POSIX_signals_Get_lowest+0x38> 2007118: 82 00 60 01 inc %g1 * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 200711c: 81 c3 e0 08 retl 2007120: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200c658 <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200c658: 9d e3 bf a0 save %sp, -96, %sp POSIX_API_Control *api; int signo; ISR_Level level; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200c65c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200c660: 80 a7 20 00 cmp %i4, 0 200c664: 02 80 00 34 be 200c734 <_POSIX_signals_Post_switch_extension+0xdc> 200c668: 01 00 00 00 nop * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200c66c: 7f ff d6 c7 call 2002188 200c670: 37 00 80 78 sethi %hi(0x201e000), %i3 200c674: b0 10 00 08 mov %o0, %i0 200c678: b6 16 e0 d4 or %i3, 0xd4, %i3 if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200c67c: c6 06 c0 00 ld [ %i3 ], %g3 200c680: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200c684: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200c688: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200c68c: 80 a8 40 02 andncc %g1, %g2, %g0 200c690: 02 80 00 27 be 200c72c <_POSIX_signals_Post_switch_extension+0xd4> 200c694: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200c698: 7f ff d6 c0 call 2002198 200c69c: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200c6a0: 92 10 00 1d mov %i5, %o1 200c6a4: 94 10 20 00 clr %o2 200c6a8: 40 00 0a 74 call 200f078 <_POSIX_signals_Check_signal> 200c6ac: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200c6b0: 92 10 00 1d mov %i5, %o1 200c6b4: 90 10 00 1c mov %i4, %o0 200c6b8: 40 00 0a 70 call 200f078 <_POSIX_signals_Check_signal> 200c6bc: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200c6c0: ba 07 60 01 inc %i5 200c6c4: 80 a7 60 20 cmp %i5, 0x20 200c6c8: 12 bf ff f7 bne 200c6a4 <_POSIX_signals_Post_switch_extension+0x4c> 200c6cc: 92 10 00 1d mov %i5, %o1 200c6d0: ba 10 20 01 mov 1, %i5 _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200c6d4: 92 10 00 1d mov %i5, %o1 200c6d8: 94 10 20 00 clr %o2 200c6dc: 40 00 0a 67 call 200f078 <_POSIX_signals_Check_signal> 200c6e0: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200c6e4: 92 10 00 1d mov %i5, %o1 200c6e8: 90 10 00 1c mov %i4, %o0 200c6ec: 40 00 0a 63 call 200f078 <_POSIX_signals_Check_signal> 200c6f0: 94 10 20 01 mov 1, %o2 _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 200c6f4: ba 07 60 01 inc %i5 200c6f8: 80 a7 60 1b cmp %i5, 0x1b 200c6fc: 12 bf ff f7 bne 200c6d8 <_POSIX_signals_Post_switch_extension+0x80> 200c700: 92 10 00 1d mov %i5, %o1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200c704: 7f ff d6 a1 call 2002188 200c708: 01 00 00 00 nop 200c70c: b0 10 00 08 mov %o0, %i0 if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200c710: c6 06 c0 00 ld [ %i3 ], %g3 200c714: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200c718: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200c71c: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200c720: 80 a8 40 02 andncc %g1, %g2, %g0 200c724: 12 bf ff dd bne 200c698 <_POSIX_signals_Post_switch_extension+0x40><== NEVER TAKEN 200c728: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200c72c: 7f ff d6 9b call 2002198 200c730: 81 e8 00 00 restore 200c734: 81 c7 e0 08 ret 200c738: 81 e8 00 00 restore =============================================================================== 0201a70c <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201a70c: 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 ) ) { 201a710: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201a714: 05 04 00 20 sethi %hi(0x10008000), %g2 201a718: 86 10 20 01 mov 1, %g3 201a71c: ba 06 7f ff add %i1, -1, %i5 201a720: 88 08 40 02 and %g1, %g2, %g4 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201a724: da 06 21 5c ld [ %i0 + 0x15c ], %o5 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201a728: 80 a1 00 02 cmp %g4, %g2 201a72c: 02 80 00 1c be 201a79c <_POSIX_signals_Unblock_thread+0x90> 201a730: 9f 28 c0 1d sll %g3, %i5, %o7 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201a734: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2 201a738: 80 ab c0 02 andncc %o7, %g2, %g0 201a73c: 02 80 00 15 be 201a790 <_POSIX_signals_Unblock_thread+0x84> 201a740: ba 10 20 00 clr %i5 201a744: 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 ) ) { 201a748: 80 88 40 02 btst %g1, %g2 201a74c: 02 80 00 29 be 201a7f0 <_POSIX_signals_Unblock_thread+0xe4> 201a750: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201a754: 84 10 20 04 mov 4, %g2 201a758: c4 26 20 34 st %g2, [ %i0 + 0x34 ] */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 201a75c: 05 00 00 ef sethi %hi(0x3bc00), %g2 201a760: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) 201a764: 80 88 40 02 btst %g1, %g2 201a768: 12 80 00 36 bne 201a840 <_POSIX_signals_Unblock_thread+0x134> 201a76c: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201a770: 22 80 00 09 be,a 201a794 <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN 201a774: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201a778: 7f ff bf 12 call 200a3c0 <_Watchdog_Remove> 201a77c: 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 ); 201a780: 13 04 00 ff sethi %hi(0x1003fc00), %o1 201a784: 90 10 00 18 mov %i0, %o0 201a788: 7f ff b9 ce call 2008ec0 <_Thread_Clear_state> 201a78c: 92 12 63 f8 or %o1, 0x3f8, %o1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201a790: b0 0f 60 01 and %i5, 1, %i0 201a794: 81 c7 e0 08 ret 201a798: 81 e8 00 00 restore * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201a79c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201a7a0: 80 8b c0 01 btst %o7, %g1 201a7a4: 22 80 00 21 be,a 201a828 <_POSIX_signals_Unblock_thread+0x11c> 201a7a8: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201a7ac: 82 10 20 04 mov 4, %g1 201a7b0: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201a7b4: 80 a6 a0 00 cmp %i2, 0 201a7b8: 02 80 00 27 be 201a854 <_POSIX_signals_Unblock_thread+0x148> 201a7bc: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 the_info->si_signo = signo; the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; } else { *the_info = *info; 201a7c0: c4 06 80 00 ld [ %i2 ], %g2 201a7c4: c4 20 40 00 st %g2, [ %g1 ] 201a7c8: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201a7cc: c4 20 60 04 st %g2, [ %g1 + 4 ] 201a7d0: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201a7d4: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201a7d8: 90 10 00 18 mov %i0, %o0 201a7dc: 7f ff bc 9f call 2009a58 <_Thread_queue_Extract_with_proxy> 201a7e0: ba 10 20 01 mov 1, %i5 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201a7e4: b0 0f 60 01 and %i5, 1, %i0 201a7e8: 81 c7 e0 08 ret 201a7ec: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 201a7f0: 12 bf ff e8 bne 201a790 <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN 201a7f4: 03 00 80 77 sethi %hi(0x201dc00), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a7f8: 82 10 62 88 or %g1, 0x288, %g1 ! 201de88 <_Per_CPU_Information> 201a7fc: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a800: 80 a0 a0 00 cmp %g2, 0 201a804: 22 bf ff e4 be,a 201a794 <_POSIX_signals_Unblock_thread+0x88> 201a808: b0 0f 60 01 and %i5, 1, %i0 201a80c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a810: 80 a6 00 02 cmp %i0, %g2 201a814: 22 bf ff df be,a 201a790 <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN 201a818: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] 201a81c: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 201a820: 81 c7 e0 08 ret <== NOT EXECUTED 201a824: 81 e8 00 00 restore <== NOT EXECUTED * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201a828: 80 ab c0 01 andncc %o7, %g1, %g0 201a82c: 12 bf ff e0 bne 201a7ac <_POSIX_signals_Unblock_thread+0xa0> 201a830: ba 10 20 00 clr %i5 201a834: b0 0f 60 01 and %i5, 1, %i0 201a838: 81 c7 e0 08 ret 201a83c: 81 e8 00 00 restore /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 201a840: 7f ff bc 86 call 2009a58 <_Thread_queue_Extract_with_proxy> 201a844: 90 10 00 18 mov %i0, %o0 201a848: b0 0f 60 01 and %i5, 1, %i0 201a84c: 81 c7 e0 08 ret 201a850: 81 e8 00 00 restore the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 201a854: 84 10 20 01 mov 1, %g2 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 201a858: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201a85c: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201a860: 10 bf ff de b 201a7d8 <_POSIX_signals_Unblock_thread+0xcc> 201a864: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 02008e54 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008e54: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 2008e58: 80 a6 60 00 cmp %i1, 0 2008e5c: 02 80 00 4c be 2008f8c <_RBTree_Extract_unprotected+0x138> 2008e60: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008e64: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008e68: 80 a0 40 19 cmp %g1, %i1 2008e6c: 02 80 00 61 be 2008ff0 <_RBTree_Extract_unprotected+0x19c> 2008e70: c2 06 60 08 ld [ %i1 + 8 ], %g1 the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 2008e74: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008e78: 80 a0 80 19 cmp %g2, %i1 2008e7c: 02 80 00 51 be 2008fc0 <_RBTree_Extract_unprotected+0x16c> 2008e80: f8 06 60 04 ld [ %i1 + 4 ], %i4 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2008e84: ba 97 20 00 orcc %i4, 0, %i5 2008e88: 22 80 00 54 be,a 2008fd8 <_RBTree_Extract_unprotected+0x184><== ALWAYS TAKEN 2008e8c: b8 90 60 00 orcc %g1, 0, %i4 2008e90: 80 a0 60 00 cmp %g1, 0 2008e94: 32 80 00 05 bne,a 2008ea8 <_RBTree_Extract_unprotected+0x54><== NEVER TAKEN 2008e98: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 2008e9c: 10 80 00 3e b 2008f94 <_RBTree_Extract_unprotected+0x140> 2008ea0: c2 06 40 00 ld [ %i1 ], %g1 * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 2008ea4: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2008ea8: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2008eac: 32 bf ff fe bne,a 2008ea4 <_RBTree_Extract_unprotected+0x50><== NOT EXECUTED 2008eb0: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 2008eb4: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED if(leaf) { 2008eb8: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 2008ebc: 02 80 00 52 be 2009004 <_RBTree_Extract_unprotected+0x1b0><== NOT EXECUTED 2008ec0: 01 00 00 00 nop <== NOT EXECUTED leaf->parent = target->parent; 2008ec4: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008ec8: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008ecc: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008ed0: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008ed4: c8 00 a0 04 ld [ %g2 + 4 ], %g4 <== NOT EXECUTED * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; target->color = the_node->color; 2008ed8: c6 06 60 10 ld [ %i1 + 0x10 ], %g3 <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008edc: 88 19 00 1d xor %g4, %i5, %g4 <== NOT EXECUTED 2008ee0: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008ee4: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED target->parent->child[dir] = leaf; 2008ee8: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008eec: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED 2008ef0: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008ef4: c8 00 60 04 ld [ %g1 + 4 ], %g4 <== NOT EXECUTED leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 2008ef8: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 <== NOT EXECUTED dir = target != target->parent->child[0]; target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008efc: 88 19 00 19 xor %g4, %i1, %g4 <== NOT EXECUTED 2008f00: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008f04: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED the_node->parent->child[dir] = target; 2008f08: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008f0c: 82 00 40 04 add %g1, %g4, %g1 <== NOT EXECUTED 2008f10: fa 20 60 04 st %i5, [ %g1 + 4 ] <== NOT EXECUTED /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008f14: c2 06 60 08 ld [ %i1 + 8 ], %g1 <== NOT EXECUTED * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; target->color = the_node->color; 2008f18: c6 27 60 10 st %g3, [ %i5 + 0x10 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008f1c: c2 27 60 08 st %g1, [ %i5 + 8 ] <== NOT EXECUTED the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008f20: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008f24: c6 06 60 08 ld [ %i1 + 8 ], %g3 <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008f28: c2 27 60 04 st %g1, [ %i5 + 4 ] <== NOT EXECUTED the_node->child[RBT_LEFT]->parent = target; 2008f2c: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008f30: fa 20 c0 00 st %i5, [ %g3 ] <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; the_node->child[RBT_LEFT]->parent = target; 2008f34: fa 20 40 00 st %i5, [ %g1 ] <== NOT EXECUTED /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 2008f38: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED 2008f3c: c2 27 40 00 st %g1, [ %i5 ] <== NOT EXECUTED * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node and the child is red. Paint child black. * 3. Deleted a black node and its child is black. This requires some * care and rotations. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 2008f40: 80 a0 a0 00 cmp %g2, 0 2008f44: 32 80 00 0c bne,a 2008f74 <_RBTree_Extract_unprotected+0x120> 2008f48: c2 06 20 04 ld [ %i0 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008f4c: 80 a7 20 00 cmp %i4, 0 2008f50: 22 80 00 09 be,a 2008f74 <_RBTree_Extract_unprotected+0x120> 2008f54: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008f58: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2008f5c: 80 a0 60 01 cmp %g1, 1 2008f60: 22 80 00 04 be,a 2008f70 <_RBTree_Extract_unprotected+0x11c><== ALWAYS TAKEN 2008f64: c0 27 20 10 clr [ %i4 + 0x10 ] if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008f68: 7f ff fe e8 call 2008b08 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008f6c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 2008f70: 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; 2008f74: c0 26 60 08 clr [ %i1 + 8 ] 2008f78: c0 26 60 04 clr [ %i1 + 4 ] 2008f7c: 80 a0 60 00 cmp %g1, 0 2008f80: 02 80 00 03 be 2008f8c <_RBTree_Extract_unprotected+0x138> 2008f84: c0 26 40 00 clr [ %i1 ] 2008f88: c0 20 60 10 clr [ %g1 + 0x10 ] 2008f8c: 81 c7 e0 08 ret 2008f90: 81 e8 00 00 restore * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 2008f94: c2 27 00 00 st %g1, [ %i4 ] _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008f98: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; 2008f9c: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008fa0: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008fa4: 86 18 c0 19 xor %g3, %i1, %g3 2008fa8: 80 a0 00 03 cmp %g0, %g3 2008fac: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 2008fb0: 87 28 e0 02 sll %g3, 2, %g3 2008fb4: 82 00 40 03 add %g1, %g3, %g1 2008fb8: 10 bf ff e2 b 2008f40 <_RBTree_Extract_unprotected+0xec> 2008fbc: f8 20 60 04 st %i4, [ %g1 + 4 ] the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 2008fc0: 80 a7 20 00 cmp %i4, 0 2008fc4: 02 80 00 19 be 2009028 <_RBTree_Extract_unprotected+0x1d4> 2008fc8: ba 97 20 00 orcc %i4, 0, %i5 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2008fcc: 12 bf ff b1 bne 2008e90 <_RBTree_Extract_unprotected+0x3c><== ALWAYS TAKEN 2008fd0: f8 26 20 0c st %i4, [ %i0 + 0xc ] * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { 2008fd4: b8 90 60 00 orcc %g1, 0, %i4 <== NOT EXECUTED 2008fd8: 32 bf ff ef bne,a 2008f94 <_RBTree_Extract_unprotected+0x140> 2008fdc: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); 2008fe0: 7f ff fe ca call 2008b08 <_RBTree_Extract_validate_unprotected> 2008fe4: 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]; 2008fe8: 10 bf ff ed b 2008f9c <_RBTree_Extract_unprotected+0x148> 2008fec: c2 06 40 00 ld [ %i1 ], %g1 if(!the_node) return; /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) 2008ff0: 80 a0 60 00 cmp %g1, 0 2008ff4: 22 80 00 08 be,a 2009014 <_RBTree_Extract_unprotected+0x1c0> 2008ff8: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008ffc: 10 bf ff 9e b 2008e74 <_RBTree_Extract_unprotected+0x20> 2009000: c2 26 20 08 st %g1, [ %i0 + 8 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 2009004: 7f ff fe c1 call 2008b08 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2009008: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED } victim_color = target->color; dir = target != target->parent->child[0]; 200900c: 10 bf ff b1 b 2008ed0 <_RBTree_Extract_unprotected+0x7c> <== NOT EXECUTED 2009010: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2009014: 80 a6 00 02 cmp %i0, %g2 2009018: 12 bf ff 97 bne 2008e74 <_RBTree_Extract_unprotected+0x20> 200901c: c4 26 20 08 st %g2, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 2009020: 10 bf ff 95 b 2008e74 <_RBTree_Extract_unprotected+0x20> 2009024: c0 26 20 08 clr [ %i0 + 8 ] /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; 2009028: c4 06 40 00 ld [ %i1 ], %g2 if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200902c: 80 a6 00 02 cmp %i0, %g2 2009030: 12 bf ff 95 bne 2008e84 <_RBTree_Extract_unprotected+0x30> 2009034: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 2009038: 10 bf ff 93 b 2008e84 <_RBTree_Extract_unprotected+0x30> 200903c: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 02008b08 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008b08: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 2008b0c: c4 06 00 00 ld [ %i0 ], %g2 if(!parent->parent) return; 2008b10: c2 00 80 00 ld [ %g2 ], %g1 2008b14: 80 a0 60 00 cmp %g1, 0 2008b18: 02 80 00 cd be 2008e4c <_RBTree_Extract_validate_unprotected+0x344> 2008b1c: 01 00 00 00 nop { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 2008b20: c2 00 a0 04 ld [ %g2 + 4 ], %g1 2008b24: 80 a6 00 01 cmp %i0, %g1 2008b28: 22 80 00 02 be,a 2008b30 <_RBTree_Extract_validate_unprotected+0x28> 2008b2c: c2 00 a0 08 ld [ %g2 + 8 ], %g1 /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008b30: 96 10 20 01 mov 1, %o3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008b34: 80 a6 20 00 cmp %i0, 0 2008b38: 22 80 00 07 be,a 2008b54 <_RBTree_Extract_validate_unprotected+0x4c><== NEVER TAKEN 2008b3c: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED 2008b40: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 2008b44: 80 a0 e0 01 cmp %g3, 1 2008b48: 22 80 00 5b be,a 2008cb4 <_RBTree_Extract_validate_unprotected+0x1ac> 2008b4c: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008b50: c6 00 80 00 ld [ %g2 ], %g3 2008b54: 80 a0 e0 00 cmp %g3, 0 2008b58: 02 80 00 56 be 2008cb0 <_RBTree_Extract_validate_unprotected+0x1a8> 2008b5c: 80 a0 60 00 cmp %g1, 0 2008b60: 02 bf ff f6 be 2008b38 <_RBTree_Extract_validate_unprotected+0x30><== NEVER TAKEN 2008b64: 80 a6 20 00 cmp %i0, 0 2008b68: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 2008b6c: 80 a1 20 01 cmp %g4, 1 2008b70: 22 80 00 27 be,a 2008c0c <_RBTree_Extract_validate_unprotected+0x104> 2008b74: de 00 a0 04 ld [ %g2 + 4 ], %o7 sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008b78: c6 00 60 08 ld [ %g1 + 8 ], %g3 2008b7c: 80 a0 e0 00 cmp %g3, 0 2008b80: 22 80 00 07 be,a 2008b9c <_RBTree_Extract_validate_unprotected+0x94> 2008b84: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008b88: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008b8c: 80 a0 e0 01 cmp %g3, 1 2008b90: 22 80 00 57 be,a 2008cec <_RBTree_Extract_validate_unprotected+0x1e4> 2008b94: c6 00 a0 04 ld [ %g2 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2008b98: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008b9c: 80 a0 e0 00 cmp %g3, 0 2008ba0: 22 80 00 07 be,a 2008bbc <_RBTree_Extract_validate_unprotected+0xb4> 2008ba4: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008ba8: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008bac: 80 a0 e0 01 cmp %g3, 1 2008bb0: 22 80 00 4f be,a 2008cec <_RBTree_Extract_validate_unprotected+0x1e4> 2008bb4: c6 00 a0 04 ld [ %g2 + 4 ], %g3 sibling->color = RBT_RED; 2008bb8: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008bbc: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008bc0: 80 a0 60 01 cmp %g1, 1 2008bc4: 22 80 00 3b be,a 2008cb0 <_RBTree_Extract_validate_unprotected+0x1a8> 2008bc8: c0 20 a0 10 clr [ %g2 + 0x10 ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 2008bcc: c6 00 80 00 ld [ %g2 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008bd0: 80 a0 e0 00 cmp %g3, 0 2008bd4: 02 80 00 3e be 2008ccc <_RBTree_Extract_validate_unprotected+0x1c4><== NEVER TAKEN 2008bd8: b0 10 00 02 mov %g2, %i0 if(!(the_node->parent->parent)) return NULL; 2008bdc: c2 00 c0 00 ld [ %g3 ], %g1 2008be0: 80 a0 60 00 cmp %g1, 0 2008be4: 02 80 00 3d be 2008cd8 <_RBTree_Extract_validate_unprotected+0x1d0> 2008be8: 82 10 20 00 clr %g1 if(the_node == the_node->parent->child[RBT_LEFT]) 2008bec: c2 00 e0 04 ld [ %g3 + 4 ], %g1 2008bf0: 80 a0 80 01 cmp %g2, %g1 2008bf4: 02 80 00 3b be 2008ce0 <_RBTree_Extract_validate_unprotected+0x1d8> 2008bf8: 80 a6 20 00 cmp %i0, 0 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008bfc: 12 bf ff d1 bne 2008b40 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 2008c00: 84 10 00 03 mov %g3, %g2 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008c04: 10 bf ff d4 b 2008b54 <_RBTree_Extract_validate_unprotected+0x4c><== NOT EXECUTED 2008c08: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 2008c0c: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008c10: 9e 1b c0 18 xor %o7, %i0, %o7 2008c14: 80 a0 00 0f cmp %g0, %o7 2008c18: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008c1c: 88 21 00 0d sub %g4, %o5, %g4 2008c20: 89 29 20 02 sll %g4, 2, %g4 2008c24: 88 00 80 04 add %g2, %g4, %g4 2008c28: de 01 20 04 ld [ %g4 + 4 ], %o7 2008c2c: 80 a3 e0 00 cmp %o7, 0 2008c30: 02 80 00 16 be 2008c88 <_RBTree_Extract_validate_unprotected+0x180><== NEVER TAKEN 2008c34: c0 20 60 10 clr [ %g1 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008c38: 83 2b 60 02 sll %o5, 2, %g1 2008c3c: 98 03 c0 01 add %o7, %g1, %o4 2008c40: d4 03 20 04 ld [ %o4 + 4 ], %o2 2008c44: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 2008c48: c8 03 20 04 ld [ %o4 + 4 ], %g4 2008c4c: 80 a1 20 00 cmp %g4, 0 2008c50: 02 80 00 04 be 2008c60 <_RBTree_Extract_validate_unprotected+0x158><== NEVER TAKEN 2008c54: 82 03 c0 01 add %o7, %g1, %g1 c->child[dir]->parent = the_node; 2008c58: c4 21 00 00 st %g2, [ %g4 ] 2008c5c: c6 00 80 00 ld [ %g2 ], %g3 c->child[dir] = the_node; 2008c60: c4 20 60 04 st %g2, [ %g1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008c64: c2 00 e0 04 ld [ %g3 + 4 ], %g1 c->parent = the_node->parent; 2008c68: c6 23 c0 00 st %g3, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008c6c: 82 18 80 01 xor %g2, %g1, %g1 c->parent = the_node->parent; the_node->parent = c; 2008c70: de 20 80 00 st %o7, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008c74: 80 a0 00 01 cmp %g0, %g1 2008c78: 82 40 20 00 addx %g0, 0, %g1 2008c7c: 83 28 60 02 sll %g1, 2, %g1 2008c80: 86 00 c0 01 add %g3, %g1, %g3 2008c84: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 2008c88: 80 a0 00 0d cmp %g0, %o5 2008c8c: 82 60 3f ff subx %g0, -1, %g1 2008c90: 83 28 60 02 sll %g1, 2, %g1 2008c94: 82 00 80 01 add %g2, %g1, %g1 2008c98: c2 00 60 04 ld [ %g1 + 4 ], %g1 } /* sibling is black, see if both of its children are also black. */ if (sibling && 2008c9c: 80 a0 60 00 cmp %g1, 0 2008ca0: 32 bf ff b7 bne,a 2008b7c <_RBTree_Extract_validate_unprotected+0x74><== ALWAYS TAKEN 2008ca4: c6 00 60 08 ld [ %g1 + 8 ], %g3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008ca8: 10 bf ff a4 b 2008b38 <_RBTree_Extract_validate_unprotected+0x30><== NOT EXECUTED 2008cac: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008cb0: c2 06 00 00 ld [ %i0 ], %g1 2008cb4: c2 00 40 00 ld [ %g1 ], %g1 2008cb8: 80 a0 60 00 cmp %g1, 0 2008cbc: 22 80 00 02 be,a 2008cc4 <_RBTree_Extract_validate_unprotected+0x1bc> 2008cc0: c0 26 20 10 clr [ %i0 + 0x10 ] 2008cc4: 81 c7 e0 08 ret 2008cc8: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008ccc: 82 10 20 00 clr %g1 <== NOT EXECUTED 2008cd0: 10 bf ff 99 b 2008b34 <_RBTree_Extract_validate_unprotected+0x2c><== NOT EXECUTED 2008cd4: 84 10 20 00 clr %g2 <== NOT EXECUTED if(!(the_node->parent->parent)) return NULL; 2008cd8: 10 bf ff 97 b 2008b34 <_RBTree_Extract_validate_unprotected+0x2c> 2008cdc: 84 10 00 03 mov %g3, %g2 if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 2008ce0: c2 00 e0 08 ld [ %g3 + 8 ], %g1 2008ce4: 10 bf ff 94 b 2008b34 <_RBTree_Extract_validate_unprotected+0x2c> 2008ce8: 84 10 00 03 mov %g3, %g2 * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 2008cec: 86 18 c0 18 xor %g3, %i0, %g3 2008cf0: 80 a0 00 03 cmp %g0, %g3 2008cf4: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 2008cf8: 80 a0 00 03 cmp %g0, %g3 2008cfc: 9e 60 3f ff subx %g0, -1, %o7 2008d00: 9f 2b e0 02 sll %o7, 2, %o7 2008d04: 88 00 40 0f add %g1, %o7, %g4 2008d08: c8 01 20 04 ld [ %g4 + 4 ], %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008d0c: 80 a1 20 00 cmp %g4, 0 2008d10: 22 80 00 07 be,a 2008d2c <_RBTree_Extract_validate_unprotected+0x224> 2008d14: 89 28 e0 02 sll %g3, 2, %g4 2008d18: da 01 20 10 ld [ %g4 + 0x10 ], %o5 2008d1c: 80 a3 60 01 cmp %o5, 1 2008d20: 22 80 00 28 be,a 2008dc0 <_RBTree_Extract_validate_unprotected+0x2b8> 2008d24: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 2008d28: 89 28 e0 02 sll %g3, 2, %g4 2008d2c: 88 00 40 04 add %g1, %g4, %g4 _RBTree_Rotate(sibling, !dir); 2008d30: 98 18 e0 01 xor %g3, 1, %o4 * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 2008d34: d6 01 20 04 ld [ %g4 + 4 ], %o3 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 2008d38: 88 10 20 01 mov 1, %g4 2008d3c: c8 20 60 10 st %g4, [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008d40: 88 21 00 0c sub %g4, %o4, %g4 2008d44: 9b 29 20 02 sll %g4, 2, %o5 2008d48: 9a 00 40 0d add %g1, %o5, %o5 2008d4c: c8 03 60 04 ld [ %o5 + 4 ], %g4 2008d50: 80 a1 20 00 cmp %g4, 0 2008d54: 02 80 00 16 be 2008dac <_RBTree_Extract_validate_unprotected+0x2a4><== NEVER TAKEN 2008d58: c0 22 e0 10 clr [ %o3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008d5c: 99 2b 20 02 sll %o4, 2, %o4 2008d60: 96 01 00 0c add %g4, %o4, %o3 2008d64: d4 02 e0 04 ld [ %o3 + 4 ], %o2 2008d68: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 2008d6c: da 02 e0 04 ld [ %o3 + 4 ], %o5 2008d70: 80 a3 60 00 cmp %o5, 0 2008d74: 32 80 00 02 bne,a 2008d7c <_RBTree_Extract_validate_unprotected+0x274> 2008d78: c2 23 40 00 st %g1, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d7c: da 00 40 00 ld [ %g1 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008d80: 98 01 00 0c add %g4, %o4, %o4 2008d84: c2 23 20 04 st %g1, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d88: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 2008d8c: da 21 00 00 st %o5, [ %g4 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d90: 98 18 40 0c xor %g1, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 2008d94: c8 20 40 00 st %g4, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d98: 80 a0 00 0c cmp %g0, %o4 2008d9c: 82 40 20 00 addx %g0, 0, %g1 2008da0: 83 28 60 02 sll %g1, 2, %g1 2008da4: 9a 03 40 01 add %o5, %g1, %o5 2008da8: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 2008dac: 82 00 80 0f add %g2, %o7, %g1 2008db0: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008db4: 9e 00 40 0f add %g1, %o7, %o7 2008db8: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 2008dbc: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 2008dc0: de 20 60 10 st %o7, [ %g1 + 0x10 ] parent->color = RBT_BLACK; 2008dc4: c0 20 a0 10 clr [ %g2 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008dc8: 9e 10 20 01 mov 1, %o7 2008dcc: 9e 23 c0 03 sub %o7, %g3, %o7 2008dd0: 9f 2b e0 02 sll %o7, 2, %o7 2008dd4: 9e 00 80 0f add %g2, %o7, %o7 2008dd8: c2 03 e0 04 ld [ %o7 + 4 ], %g1 2008ddc: 80 a0 60 00 cmp %g1, 0 2008de0: 02 bf ff b4 be 2008cb0 <_RBTree_Extract_validate_unprotected+0x1a8><== NEVER TAKEN 2008de4: c0 21 20 10 clr [ %g4 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008de8: 87 28 e0 02 sll %g3, 2, %g3 2008dec: 88 00 40 03 add %g1, %g3, %g4 2008df0: da 01 20 04 ld [ %g4 + 4 ], %o5 2008df4: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 2008df8: c8 01 20 04 ld [ %g4 + 4 ], %g4 2008dfc: 80 a1 20 00 cmp %g4, 0 2008e00: 32 80 00 02 bne,a 2008e08 <_RBTree_Extract_validate_unprotected+0x300> 2008e04: c4 21 00 00 st %g2, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008e08: c8 00 80 00 ld [ %g2 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008e0c: 86 00 40 03 add %g1, %g3, %g3 2008e10: c4 20 e0 04 st %g2, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008e14: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 2008e18: c8 20 40 00 st %g4, [ %g1 ] the_node->parent = c; 2008e1c: c2 20 80 00 st %g1, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008e20: 86 18 c0 02 xor %g3, %g2, %g3 2008e24: 80 a0 00 03 cmp %g0, %g3 2008e28: 84 40 20 00 addx %g0, 0, %g2 2008e2c: 85 28 a0 02 sll %g2, 2, %g2 2008e30: 88 01 00 02 add %g4, %g2, %g4 2008e34: c2 21 20 04 st %g1, [ %g4 + 4 ] sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008e38: c2 06 00 00 ld [ %i0 ], %g1 2008e3c: c2 00 40 00 ld [ %g1 ], %g1 2008e40: 80 a0 60 00 cmp %g1, 0 2008e44: 22 bf ff a0 be,a 2008cc4 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 2008e48: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 2008e4c: 81 c7 e0 08 ret 2008e50: 81 e8 00 00 restore =============================================================================== 020090b4 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 20090b4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 20090b8: 7f ff e6 54 call 2002a08 20090bc: 01 00 00 00 nop return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); return return_node; } 20090c0: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 20090c4: 80 a6 20 00 cmp %i0, 0 20090c8: 32 80 00 0b bne,a 20090f4 <_RBTree_Find+0x40> <== ALWAYS TAKEN 20090cc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20090d0: 30 80 00 0c b,a 2009100 <_RBTree_Find+0x4c> <== NOT EXECUTED if (the_value == iter_node->value) return(iter_node); RBTree_Direction dir = the_value > iter_node->value; 20090d4: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 20090d8: 83 28 60 02 sll %g1, 2, %g1 20090dc: b0 06 00 01 add %i0, %g1, %i0 20090e0: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 20090e4: 80 a6 20 00 cmp %i0, 0 20090e8: 02 80 00 06 be 2009100 <_RBTree_Find+0x4c> <== NEVER TAKEN 20090ec: 01 00 00 00 nop if (the_value == iter_node->value) return(iter_node); 20090f0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20090f4: 80 a6 40 01 cmp %i1, %g1 20090f8: 12 bf ff f7 bne 20090d4 <_RBTree_Find+0x20> 20090fc: 80 a0 40 19 cmp %g1, %i1 RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 2009100: 7f ff e6 46 call 2002a18 2009104: 01 00 00 00 nop return return_node; } 2009108: 81 c7 e0 08 ret 200910c: 81 e8 00 00 restore =============================================================================== 02009068 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2009068: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 200906c: 7f ff e6 67 call 2002a08 2009070: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected( RBTree_Node *the_node ) { if(!the_node) return NULL; 2009074: 80 a6 20 00 cmp %i0, 0 2009078: 02 80 00 0b be 20090a4 <_RBTree_Find_header+0x3c> <== NEVER TAKEN 200907c: ba 10 20 00 clr %i5 if(!(the_node->parent)) return NULL; 2009080: fa 06 00 00 ld [ %i0 ], %i5 2009084: 80 a7 60 00 cmp %i5, 0 2009088: 32 80 00 04 bne,a 2009098 <_RBTree_Find_header+0x30> <== ALWAYS TAKEN 200908c: c2 07 40 00 ld [ %i5 ], %g1 2009090: 30 80 00 05 b,a 20090a4 <_RBTree_Find_header+0x3c> <== NOT EXECUTED 2009094: c2 07 40 00 ld [ %i5 ], %g1 while(the_node->parent) the_node = the_node->parent; 2009098: 80 a0 60 00 cmp %g1, 0 200909c: 32 bf ff fe bne,a 2009094 <_RBTree_Find_header+0x2c> 20090a0: ba 10 00 01 mov %g1, %i5 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 20090a4: 7f ff e6 5d call 2002a18 20090a8: b0 10 00 1d mov %i5, %i0 return return_header; } 20090ac: 81 c7 e0 08 ret 20090b0: 81 e8 00 00 restore =============================================================================== 020092fc <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 20092fc: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 2009300: 80 a6 60 00 cmp %i1, 0 2009304: 02 80 00 14 be 2009354 <_RBTree_Insert_unprotected+0x58> <== NEVER TAKEN 2009308: 82 10 3f ff mov -1, %g1 RBTree_Node *iter_node = the_rbtree->root; 200930c: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (!iter_node) { /* special case: first node inserted */ 2009310: 80 a0 60 00 cmp %g1, 0 2009314: 22 80 00 23 be,a 20093a0 <_RBTree_Insert_unprotected+0xa4> 2009318: c0 26 60 10 clr [ %i1 + 0x10 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 200931c: 10 80 00 0a b 2009344 <_RBTree_Insert_unprotected+0x48> 2009320: c6 06 60 0c ld [ %i1 + 0xc ], %g3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; 2009324: 9e 40 20 00 addx %g0, 0, %o7 if (!iter_node->child[dir]) { 2009328: 89 2b e0 02 sll %o7, 2, %g4 200932c: 88 00 40 04 add %g1, %g4, %g4 2009330: c4 01 20 04 ld [ %g4 + 4 ], %g2 2009334: 80 a0 a0 00 cmp %g2, 0 2009338: 22 80 00 09 be,a 200935c <_RBTree_Insert_unprotected+0x60> 200933c: c0 26 60 08 clr [ %i1 + 8 ] 2009340: 82 10 00 02 mov %g2, %g1 the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); 2009344: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2009348: 80 a0 c0 02 cmp %g3, %g2 200934c: 12 bf ff f6 bne 2009324 <_RBTree_Insert_unprotected+0x28> 2009350: 80 a0 80 03 cmp %g2, %g3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 2009354: 81 c7 e0 08 ret 2009358: 91 e8 00 01 restore %g0, %g1, %o0 /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200935c: c0 26 60 04 clr [ %i1 + 4 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 2009360: 9e 03 e0 02 add %o7, 2, %o7 2009364: 9f 2b e0 02 sll %o7, 2, %o7 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2009368: c4 06 00 0f ld [ %i0 + %o7 ], %g2 while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200936c: 86 10 20 01 mov 1, %g3 iter_node->child[dir] = the_node; 2009370: f2 21 20 04 st %i1, [ %g4 + 4 ] while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2009374: c6 26 60 10 st %g3, [ %i1 + 0x10 ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2009378: 80 a0 40 02 cmp %g1, %g2 200937c: 02 80 00 07 be 2009398 <_RBTree_Insert_unprotected+0x9c> 2009380: c2 26 40 00 st %g1, [ %i1 ] } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 2009384: 7f ff ff 72 call 200914c <_RBTree_Validate_insert_unprotected> 2009388: 90 10 00 19 mov %i1, %o0 } return (RBTree_Node*)0; 200938c: 82 10 20 00 clr %g1 } 2009390: 81 c7 e0 08 ret 2009394: 91 e8 00 01 restore %g0, %g1, %o0 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 2009398: 10 bf ff fb b 2009384 <_RBTree_Insert_unprotected+0x88> 200939c: f2 26 00 0f st %i1, [ %i0 + %o7 ] RBTree_Node *iter_node = the_rbtree->root; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 20093a0: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 20093a4: f2 26 20 0c st %i1, [ %i0 + 0xc ] 20093a8: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 20093ac: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 20093b0: c0 26 60 08 clr [ %i1 + 8 ] 20093b4: 10 bf ff e8 b 2009354 <_RBTree_Insert_unprotected+0x58> 20093b8: c0 26 60 04 clr [ %i1 + 4 ] =============================================================================== 0200914c <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 200914c: 9d e3 bf a0 save %sp, -96, %sp } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 2009150: 96 10 20 01 mov 1, %o3 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009154: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 2009158: c4 00 40 00 ld [ %g1 ], %g2 200915c: 86 90 a0 00 orcc %g2, 0, %g3 2009160: 22 80 00 06 be,a 2009178 <_RBTree_Validate_insert_unprotected+0x2c> 2009164: c0 26 20 10 clr [ %i0 + 0x10 ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009168: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 200916c: 80 a1 20 01 cmp %g4, 1 2009170: 22 80 00 04 be,a 2009180 <_RBTree_Validate_insert_unprotected+0x34> 2009174: c8 00 80 00 ld [ %g2 ], %g4 2009178: 81 c7 e0 08 ret 200917c: 81 e8 00 00 restore ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(!(the_node->parent->parent->parent)) return NULL; 2009180: 80 a1 20 00 cmp %g4, 0 2009184: 02 80 00 0c be 20091b4 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 2009188: de 00 a0 04 ld [ %g2 + 4 ], %o7 { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200918c: 80 a0 40 0f cmp %g1, %o7 2009190: 02 80 00 59 be 20092f4 <_RBTree_Validate_insert_unprotected+0x1a8> 2009194: 88 10 00 0f mov %o7, %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009198: 80 a1 20 00 cmp %g4, 0 200919c: 22 80 00 07 be,a 20091b8 <_RBTree_Validate_insert_unprotected+0x6c> 20091a0: c8 00 60 04 ld [ %g1 + 4 ], %g4 20091a4: da 01 20 10 ld [ %g4 + 0x10 ], %o5 20091a8: 80 a3 60 01 cmp %o5, 1 20091ac: 22 80 00 4c be,a 20092dc <_RBTree_Validate_insert_unprotected+0x190> 20091b0: c0 20 60 10 clr [ %g1 + 0x10 ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 20091b4: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 20091b8: 9e 18 40 0f xor %g1, %o7, %o7 the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 20091bc: 88 19 00 18 xor %g4, %i0, %g4 20091c0: 80 a0 00 04 cmp %g0, %g4 20091c4: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 20091c8: 80 a0 00 0f cmp %g0, %o7 20091cc: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 20091d0: 80 a3 40 04 cmp %o5, %g4 20091d4: 02 80 00 46 be 20092ec <_RBTree_Validate_insert_unprotected+0x1a0> 20091d8: 98 22 c0 0d sub %o3, %o5, %o4 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 20091dc: 98 22 c0 04 sub %o3, %g4, %o4 20091e0: 9b 2b 20 02 sll %o4, 2, %o5 20091e4: 9a 00 40 0d add %g1, %o5, %o5 20091e8: de 03 60 04 ld [ %o5 + 4 ], %o7 20091ec: 80 a3 e0 00 cmp %o7, 0 20091f0: 02 80 00 16 be 2009248 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 20091f4: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 20091f8: 94 03 c0 04 add %o7, %g4, %o2 20091fc: d2 02 a0 04 ld [ %o2 + 4 ], %o1 2009200: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 2009204: da 02 a0 04 ld [ %o2 + 4 ], %o5 2009208: 80 a3 60 00 cmp %o5, 0 200920c: 22 80 00 05 be,a 2009220 <_RBTree_Validate_insert_unprotected+0xd4> 2009210: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 2009214: c2 23 40 00 st %g1, [ %o5 ] 2009218: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200921c: 9a 03 c0 04 add %o7, %g4, %o5 2009220: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009224: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 2009228: c4 23 c0 00 st %g2, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200922c: 9a 18 40 0d xor %g1, %o5, %o5 c->parent = the_node->parent; the_node->parent = c; 2009230: de 20 40 00 st %o7, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009234: 80 a0 00 0d cmp %g0, %o5 2009238: 82 40 20 00 addx %g0, 0, %g1 200923c: 83 28 60 02 sll %g1, 2, %g1 2009240: 84 00 80 01 add %g2, %g1, %g2 2009244: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 2009248: b0 06 00 04 add %i0, %g4, %i0 200924c: f0 06 20 04 ld [ %i0 + 4 ], %i0 2009250: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 2009254: c0 20 60 10 clr [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2009258: 88 00 c0 04 add %g3, %g4, %g4 200925c: c2 01 20 04 ld [ %g4 + 4 ], %g1 2009260: 80 a0 60 00 cmp %g1, 0 2009264: 02 bf ff bc be 2009154 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN 2009268: d6 20 e0 10 st %o3, [ %g3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200926c: 99 2b 20 02 sll %o4, 2, %o4 2009270: 84 00 40 0c add %g1, %o4, %g2 2009274: de 00 a0 04 ld [ %g2 + 4 ], %o7 2009278: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 200927c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2009280: 80 a0 a0 00 cmp %g2, 0 2009284: 32 80 00 02 bne,a 200928c <_RBTree_Validate_insert_unprotected+0x140> 2009288: c6 20 80 00 st %g3, [ %g2 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200928c: c4 00 c0 00 ld [ %g3 ], %g2 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2009290: 98 00 40 0c add %g1, %o4, %o4 2009294: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009298: c8 00 a0 04 ld [ %g2 + 4 ], %g4 c->parent = the_node->parent; 200929c: c4 20 40 00 st %g2, [ %g1 ] the_node->parent = c; 20092a0: c2 20 c0 00 st %g1, [ %g3 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20092a4: 88 19 00 03 xor %g4, %g3, %g4 20092a8: 80 a0 00 04 cmp %g0, %g4 20092ac: 86 40 20 00 addx %g0, 0, %g3 20092b0: 87 28 e0 02 sll %g3, 2, %g3 20092b4: 84 00 80 03 add %g2, %g3, %g2 20092b8: c2 20 a0 04 st %g1, [ %g2 + 4 ] ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 20092bc: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 20092c0: c4 00 40 00 ld [ %g1 ], %g2 20092c4: 86 90 a0 00 orcc %g2, 0, %g3 20092c8: 32 bf ff a9 bne,a 200916c <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 20092cc: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 20092d0: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 20092d4: 81 c7 e0 08 ret <== NOT EXECUTED 20092d8: 81 e8 00 00 restore <== NOT EXECUTED g = the_node->parent->parent; /* if uncle is red, repaint uncle/parent black and grandparent red */ if(_RBTree_Is_red(u)) { the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; 20092dc: c0 21 20 10 clr [ %g4 + 0x10 ] g->color = RBT_RED; 20092e0: da 20 a0 10 st %o5, [ %g2 + 0x10 ] 20092e4: 10 bf ff 9c b 2009154 <_RBTree_Validate_insert_unprotected+0x8> 20092e8: b0 10 00 02 mov %g2, %i0 20092ec: 10 bf ff da b 2009254 <_RBTree_Validate_insert_unprotected+0x108> 20092f0: 89 2b 60 02 sll %o5, 2, %g4 if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 20092f4: 10 bf ff a9 b 2009198 <_RBTree_Validate_insert_unprotected+0x4c> 20092f8: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 02006cd0 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2006cd0: 9d e3 bf 98 save %sp, -104, %sp rtems_initialization_tasks_table *user_tasks; /* * Move information into local variables */ user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table; 2006cd4: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006cd8: 82 10 60 34 or %g1, 0x34, %g1 ! 201cc34 2006cdc: fa 00 60 2c ld [ %g1 + 0x2c ], %i5 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 2006ce0: 80 a7 60 00 cmp %i5, 0 2006ce4: 02 80 00 18 be 2006d44 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 2006ce8: f6 00 60 28 ld [ %g1 + 0x28 ], %i3 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006cec: 80 a6 e0 00 cmp %i3, 0 2006cf0: 02 80 00 15 be 2006d44 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2006cf4: b8 10 20 00 clr %i4 return_value = rtems_task_create( 2006cf8: d4 07 60 04 ld [ %i5 + 4 ], %o2 2006cfc: d0 07 40 00 ld [ %i5 ], %o0 2006d00: d2 07 60 08 ld [ %i5 + 8 ], %o1 2006d04: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 2006d08: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2006d0c: 7f ff ff 70 call 2006acc 2006d10: 9a 07 bf fc add %fp, -4, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 2006d14: 94 92 20 00 orcc %o0, 0, %o2 2006d18: 12 80 00 0d bne 2006d4c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d1c: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2006d20: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2006d24: 40 00 00 0e call 2006d5c 2006d28: d2 07 60 10 ld [ %i5 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 2006d2c: 94 92 20 00 orcc %o0, 0, %o2 2006d30: 12 80 00 07 bne 2006d4c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d34: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006d38: 80 a7 00 1b cmp %i4, %i3 2006d3c: 12 bf ff ef bne 2006cf8 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2006d40: ba 07 60 1c add %i5, 0x1c, %i5 2006d44: 81 c7 e0 08 ret 2006d48: 81 e8 00 00 restore id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); 2006d4c: 90 10 20 01 mov 1, %o0 2006d50: 40 00 04 0f call 2007d8c <_Internal_error_Occurred> 2006d54: 92 10 20 01 mov 1, %o1 =============================================================================== 0200ce48 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200ce48: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200ce4c: 80 a0 60 00 cmp %g1, 0 200ce50: 22 80 00 0c be,a 200ce80 <_RTEMS_tasks_Switch_extension+0x38> 200ce54: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200ce58: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200ce5c: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200ce60: c8 00 80 00 ld [ %g2 ], %g4 200ce64: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200ce68: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200ce6c: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200ce70: 80 a0 60 00 cmp %g1, 0 200ce74: 32 bf ff fa bne,a 200ce5c <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200ce78: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED tvp->tval = *tvp->ptr; *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; 200ce7c: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200ce80: 80 a0 60 00 cmp %g1, 0 200ce84: 02 80 00 0b be 200ceb0 <_RTEMS_tasks_Switch_extension+0x68> 200ce88: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200ce8c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200ce90: c6 00 60 0c ld [ %g1 + 0xc ], %g3 tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { tvp->gval = *tvp->ptr; 200ce94: c8 00 80 00 ld [ %g2 ], %g4 200ce98: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200ce9c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200cea0: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200cea4: 80 a0 60 00 cmp %g1, 0 200cea8: 32 bf ff fa bne,a 200ce90 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200ceac: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200ceb0: 81 c3 e0 08 retl =============================================================================== 02007a70 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007a70: 9d e3 bf 98 save %sp, -104, %sp 2007a74: 11 00 80 7d sethi %hi(0x201f400), %o0 2007a78: 92 10 00 18 mov %i0, %o1 2007a7c: 90 12 22 74 or %o0, 0x274, %o0 2007a80: 40 00 08 47 call 2009b9c <_Objects_Get> 2007a84: 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 ) { 2007a88: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a8c: 80 a0 60 00 cmp %g1, 0 2007a90: 12 80 00 17 bne 2007aec <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2007a94: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007a98: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007a9c: 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); 2007aa0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007aa4: 80 88 80 01 btst %g2, %g1 2007aa8: 22 80 00 08 be,a 2007ac8 <_Rate_monotonic_Timeout+0x58> 2007aac: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ab0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007ab4: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007ab8: 80 a0 80 01 cmp %g2, %g1 2007abc: 02 80 00 1a be 2007b24 <_Rate_monotonic_Timeout+0xb4> 2007ac0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 2007ac4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ac8: 80 a0 60 01 cmp %g1, 1 2007acc: 02 80 00 0a be 2007af4 <_Rate_monotonic_Timeout+0x84> 2007ad0: 82 10 20 04 mov 4, %g1 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007ad4: 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--; 2007ad8: 03 00 80 7d sethi %hi(0x201f400), %g1 2007adc: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ! 201f7e0 <_Thread_Dispatch_disable_level> 2007ae0: 84 00 bf ff add %g2, -1, %g2 2007ae4: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] return _Thread_Dispatch_disable_level; 2007ae8: c2 00 63 e0 ld [ %g1 + 0x3e0 ], %g1 2007aec: 81 c7 e0 08 ret 2007af0: 81 e8 00 00 restore _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007af4: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007af8: 90 10 00 1d mov %i5, %o0 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007afc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007b00: 7f ff fe 5a call 2007468 <_Rate_monotonic_Initiate_statistics> 2007b04: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b08: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b0c: 11 00 80 7e sethi %hi(0x201f800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b10: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b14: 90 12 20 a4 or %o0, 0xa4, %o0 2007b18: 40 00 10 3a call 200bc00 <_Watchdog_Insert> 2007b1c: 92 07 60 10 add %i5, 0x10, %o1 2007b20: 30 bf ff ee b,a 2007ad8 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007b24: 40 00 0a f3 call 200a6f0 <_Thread_Clear_state> 2007b28: 92 12 63 f8 or %o1, 0x3f8, %o1 the_thread = the_period->owner; if ( _States_Is_waiting_for_period( the_thread->current_state ) && the_thread->Wait.id == the_period->Object.id ) { _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 2007b2c: 10 bf ff f5 b 2007b00 <_Rate_monotonic_Timeout+0x90> 2007b30: 90 10 00 1d mov %i5, %o0 =============================================================================== 02009234 <_Scheduler_simple_Ready_queue_Enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2009234: 03 00 80 76 sethi %hi(0x201d800), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009238: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 201dbb4 <_Scheduler> */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 200923c: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 2009240: c2 00 40 00 ld [ %g1 ], %g1 2009244: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009248: 80 a0 80 03 cmp %g2, %g3 200924c: 3a 80 00 08 bcc,a 200926c <_Scheduler_simple_Ready_queue_Enqueue_first+0x38> 2009250: c2 00 60 04 ld [ %g1 + 4 ], %g1 * Do NOT need to check for end of chain because there is always * at least one task on the ready chain -- the IDLE task. It can * never block, should never attempt to obtain a semaphore or mutex, * and thus will always be there. */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { 2009254: c2 00 40 00 ld [ %g1 ], %g1 current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 2009258: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200925c: 80 a0 80 03 cmp %g2, %g3 2009260: 2a bf ff fe bcs,a 2009258 <_Scheduler_simple_Ready_queue_Enqueue_first+0x24><== NEVER TAKEN 2009264: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 2009268: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200926c: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2009270: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2009274: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 2009278: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 200927c: 81 c3 e0 08 retl 2009280: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 0200748c <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 200748c: 9d e3 bf a0 save %sp, -96, %sp uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 2007490: 03 00 80 7c sethi %hi(0x201f000), %g1 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) return false; 2007494: ba 10 20 00 clr %i5 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007498: 80 a6 20 00 cmp %i0, 0 200749c: 02 80 00 2c be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 20074a0: d2 00 63 08 ld [ %g1 + 0x308 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 20074a4: 11 00 03 d0 sethi %hi(0xf4000), %o0 20074a8: 40 00 4c cf call 201a7e4 <.udiv> 20074ac: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20074b0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20074b4: 80 a2 00 01 cmp %o0, %g1 20074b8: 28 80 00 26 bleu,a 2007550 <_TOD_Validate+0xc4> 20074bc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 20074c0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20074c4: 80 a0 60 3b cmp %g1, 0x3b 20074c8: 38 80 00 22 bgu,a 2007550 <_TOD_Validate+0xc4> 20074cc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20074d0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20074d4: 80 a0 60 3b cmp %g1, 0x3b 20074d8: 38 80 00 1e bgu,a 2007550 <_TOD_Validate+0xc4> 20074dc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20074e0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20074e4: 80 a0 60 17 cmp %g1, 0x17 20074e8: 38 80 00 1a bgu,a 2007550 <_TOD_Validate+0xc4> 20074ec: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 20074f0: c2 06 20 04 ld [ %i0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 20074f4: 80 a0 60 00 cmp %g1, 0 20074f8: 02 80 00 15 be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 20074fc: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007500: 38 80 00 14 bgu,a 2007550 <_TOD_Validate+0xc4> 2007504: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007508: c4 06 00 00 ld [ %i0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 200750c: 80 a0 a7 c3 cmp %g2, 0x7c3 2007510: 28 80 00 10 bleu,a 2007550 <_TOD_Validate+0xc4> 2007514: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007518: c6 06 20 08 ld [ %i0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 200751c: 80 a0 e0 00 cmp %g3, 0 2007520: 02 80 00 0b be 200754c <_TOD_Validate+0xc0> <== NEVER TAKEN 2007524: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007528: 32 80 00 0c bne,a 2007558 <_TOD_Validate+0xcc> 200752c: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2007530: 82 00 60 0d add %g1, 0xd, %g1 2007534: 05 00 80 77 sethi %hi(0x201dc00), %g2 2007538: 83 28 60 02 sll %g1, 2, %g1 200753c: 84 10 a2 60 or %g2, 0x260, %g2 2007540: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2007544: 80 a0 40 03 cmp %g1, %g3 2007548: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 200754c: b0 0f 60 01 and %i5, 1, %i0 2007550: 81 c7 e0 08 ret 2007554: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2007558: 05 00 80 77 sethi %hi(0x201dc00), %g2 200755c: 84 10 a2 60 or %g2, 0x260, %g2 ! 201de60 <_TOD_Days_per_month> 2007560: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2007564: 80 a0 40 03 cmp %g1, %g3 2007568: 10 bf ff f9 b 200754c <_TOD_Validate+0xc0> 200756c: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02008d94 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008d94: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008d98: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 2008d9c: 40 00 03 a9 call 2009c40 <_Thread_Set_transient> 2008da0: 90 10 00 18 mov %i0, %o0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 2008da4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008da8: 80 a0 40 19 cmp %g1, %i1 2008dac: 02 80 00 05 be 2008dc0 <_Thread_Change_priority+0x2c> 2008db0: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008db4: 90 10 00 18 mov %i0, %o0 2008db8: 40 00 03 88 call 2009bd8 <_Thread_Set_priority> 2008dbc: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008dc0: 7f ff e4 f2 call 2002188 2008dc4: 01 00 00 00 nop 2008dc8: b2 10 00 08 mov %o0, %i1 /* * If the thread has more than STATES_TRANSIENT set, then it is blocked, * If it is blocked on a thread queue, then we need to requeue it. */ state = the_thread->current_state; 2008dcc: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 2008dd0: 80 a6 e0 04 cmp %i3, 4 2008dd4: 02 80 00 18 be 2008e34 <_Thread_Change_priority+0xa0> 2008dd8: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008ddc: 02 80 00 0b be 2008e08 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 2008de0: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2008de4: 7f ff e4 ed call 2002198 <== NOT EXECUTED 2008de8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 2008dec: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 2008df0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008df4: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2008df8: 32 80 00 0d bne,a 2008e2c <_Thread_Change_priority+0x98> <== NOT EXECUTED 2008dfc: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 2008e00: 81 c7 e0 08 ret 2008e04: 81 e8 00 00 restore */ state = the_thread->current_state; if ( state != STATES_TRANSIENT ) { /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2008e08: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008e0c: 7f ff e4 e3 call 2002198 2008e10: 90 10 00 19 mov %i1, %o0 2008e14: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008e18: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008e1c: 80 8e c0 01 btst %i3, %g1 2008e20: 02 bf ff f8 be 2008e00 <_Thread_Change_priority+0x6c> 2008e24: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008e28: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2008e2c: 40 00 03 3a call 2009b14 <_Thread_queue_Requeue> 2008e30: 93 e8 00 1d restore %g0, %i5, %o1 2008e34: 39 00 80 73 sethi %hi(0x201cc00), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 2008e38: 12 80 00 08 bne 2008e58 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 2008e3c: b8 17 20 d4 or %i4, 0xd4, %i4 ! 201ccd4 <_Scheduler> * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); if ( prepend_it ) 2008e40: 80 a6 a0 00 cmp %i2, 0 2008e44: 02 80 00 1b be 2008eb0 <_Thread_Change_priority+0x11c> 2008e48: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2008e4c: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 2008e50: 9f c0 40 00 call %g1 2008e54: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2008e58: 7f ff e4 d0 call 2002198 2008e5c: 90 10 00 19 mov %i1, %o0 2008e60: 7f ff e4 ca call 2002188 2008e64: 01 00 00 00 nop 2008e68: 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(); 2008e6c: c2 07 20 08 ld [ %i4 + 8 ], %g1 2008e70: 9f c0 40 00 call %g1 2008e74: 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 ); 2008e78: 03 00 80 77 sethi %hi(0x201dc00), %g1 2008e7c: 82 10 62 88 or %g1, 0x288, %g1 ! 201de88 <_Per_CPU_Information> 2008e80: 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() && 2008e84: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008e88: 80 a0 80 03 cmp %g2, %g3 2008e8c: 02 80 00 07 be 2008ea8 <_Thread_Change_priority+0x114> 2008e90: 01 00 00 00 nop 2008e94: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008e98: 80 a0 a0 00 cmp %g2, 0 2008e9c: 02 80 00 03 be 2008ea8 <_Thread_Change_priority+0x114> 2008ea0: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008ea4: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008ea8: 7f ff e4 bc call 2002198 2008eac: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008eb0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 2008eb4: 9f c0 40 00 call %g1 2008eb8: 90 10 00 1d mov %i5, %o0 2008ebc: 30 bf ff e7 b,a 2008e58 <_Thread_Change_priority+0xc4> =============================================================================== 020090d8 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 20090d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20090dc: 90 10 00 18 mov %i0, %o0 20090e0: 40 00 00 77 call 20092bc <_Thread_Get> 20090e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20090e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20090ec: 80 a0 60 00 cmp %g1, 0 20090f0: 12 80 00 09 bne 2009114 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 20090f4: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 20090f8: 7f ff ff 72 call 2008ec0 <_Thread_Clear_state> 20090fc: 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--; 2009100: 03 00 80 76 sethi %hi(0x201d800), %g1 2009104: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201d950 <_Thread_Dispatch_disable_level> 2009108: 84 00 bf ff add %g2, -1, %g2 200910c: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2009110: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 2009114: 81 c7 e0 08 ret 2009118: 81 e8 00 00 restore =============================================================================== 0200911c <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200911c: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 2009120: 37 00 80 77 sethi %hi(0x201dc00), %i3 2009124: b6 16 e2 88 or %i3, 0x288, %i3 ! 201de88 <_Per_CPU_Information> _ISR_Disable( level ); 2009128: 7f ff e4 18 call 2002188 200912c: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 2009130: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2009134: 80 a0 60 00 cmp %g1, 0 2009138: 02 80 00 4e be 2009270 <_Thread_Dispatch+0x154> 200913c: 31 00 80 76 sethi %hi(0x201d800), %i0 heir = _Thread_Heir; 2009140: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 2009144: 82 10 20 01 mov 1, %g1 2009148: c2 26 21 50 st %g1, [ %i0 + 0x150 ] _Thread_Dispatch_set_disable_level( 1 ); _Thread_Dispatch_necessary = false; 200914c: c0 2e e0 18 clrb [ %i3 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2009150: 80 a7 40 1c cmp %i5, %i4 2009154: 02 80 00 47 be 2009270 <_Thread_Dispatch+0x154> 2009158: f8 26 e0 0c st %i4, [ %i3 + 0xc ] 200915c: 35 00 80 76 sethi %hi(0x201d800), %i2 2009160: 23 00 80 76 sethi %hi(0x201d800), %l1 2009164: b4 16 a2 00 or %i2, 0x200, %i2 2009168: a2 14 61 d8 or %l1, 0x1d8, %l1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200916c: 27 00 80 76 sethi %hi(0x201d800), %l3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2009170: a0 10 00 1a mov %i2, %l0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 2009174: 33 00 80 76 sethi %hi(0x201d800), %i1 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 2009178: 10 80 00 38 b 2009258 <_Thread_Dispatch+0x13c> 200917c: a4 10 20 01 mov 1, %l2 rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 2009180: 7f ff e4 06 call 2002198 2009184: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2009188: 40 00 10 71 call 200d34c <_TOD_Get_uptime> 200918c: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 2009190: 90 10 00 10 mov %l0, %o0 2009194: 92 07 bf f0 add %fp, -16, %o1 2009198: 40 00 03 52 call 2009ee0 <_Timespec_Subtract> 200919c: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 20091a0: 90 07 60 84 add %i5, 0x84, %o0 20091a4: 40 00 03 36 call 2009e7c <_Timespec_Add_to> 20091a8: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 20091ac: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20091b0: c2 04 40 00 ld [ %l1 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 20091b4: c4 26 80 00 st %g2, [ %i2 ] 20091b8: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20091bc: 80 a0 60 00 cmp %g1, 0 20091c0: 02 80 00 06 be 20091d8 <_Thread_Dispatch+0xbc> <== NEVER TAKEN 20091c4: c4 26 a0 04 st %g2, [ %i2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 20091c8: c4 00 40 00 ld [ %g1 ], %g2 20091cc: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 20091d0: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 20091d4: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 20091d8: 90 10 00 1d mov %i5, %o0 20091dc: 40 00 04 05 call 200a1f0 <_User_extensions_Thread_switch> 20091e0: 92 10 00 1c mov %i4, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 20091e4: 90 07 60 c8 add %i5, 0xc8, %o0 20091e8: 40 00 05 49 call 200a70c <_CPU_Context_switch> 20091ec: 92 07 20 c8 add %i4, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 20091f0: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 20091f4: 80 a0 60 00 cmp %g1, 0 20091f8: 02 80 00 0c be 2009228 <_Thread_Dispatch+0x10c> 20091fc: d0 06 61 d4 ld [ %i1 + 0x1d4 ], %o0 2009200: 80 a7 40 08 cmp %i5, %o0 2009204: 02 80 00 09 be 2009228 <_Thread_Dispatch+0x10c> 2009208: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200920c: 02 80 00 04 be 200921c <_Thread_Dispatch+0x100> 2009210: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2009214: 40 00 05 04 call 200a624 <_CPU_Context_save_fp> 2009218: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 200921c: 40 00 05 1f call 200a698 <_CPU_Context_restore_fp> 2009220: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2009224: fa 26 61 d4 st %i5, [ %i1 + 0x1d4 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2009228: 7f ff e3 d8 call 2002188 200922c: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2009230: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2009234: 80 a0 60 00 cmp %g1, 0 2009238: 02 80 00 0e be 2009270 <_Thread_Dispatch+0x154> 200923c: 01 00 00 00 nop heir = _Thread_Heir; 2009240: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 2009244: e4 26 21 50 st %l2, [ %i0 + 0x150 ] _Thread_Dispatch_set_disable_level( 1 ); _Thread_Dispatch_necessary = false; 2009248: c0 2e e0 18 clrb [ %i3 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200924c: 80 a7 00 1d cmp %i4, %i5 2009250: 02 80 00 08 be 2009270 <_Thread_Dispatch+0x154> <== NEVER TAKEN 2009254: f8 26 e0 0c st %i4, [ %i3 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 2009258: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 200925c: 80 a0 60 01 cmp %g1, 1 2009260: 12 bf ff c8 bne 2009180 <_Thread_Dispatch+0x64> 2009264: c2 04 e0 b4 ld [ %l3 + 0xb4 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009268: 10 bf ff c6 b 2009180 <_Thread_Dispatch+0x64> 200926c: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 2009270: c0 26 21 50 clr [ %i0 + 0x150 ] } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 2009274: 7f ff e3 c9 call 2002198 2009278: 01 00 00 00 nop _API_extensions_Run_postswitch(); 200927c: 7f ff f7 fc call 200726c <_API_extensions_Run_postswitch> 2009280: 01 00 00 00 nop } 2009284: 81 c7 e0 08 ret 2009288: 81 e8 00 00 restore =============================================================================== 0200f6c4 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200f6c4: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200f6c8: 03 00 80 77 sethi %hi(0x201dc00), %g1 200f6cc: fa 00 62 94 ld [ %g1 + 0x294 ], %i5 ! 201de94 <_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(); 200f6d0: 3f 00 80 3d sethi %hi(0x200f400), %i7 200f6d4: be 17 e2 c4 or %i7, 0x2c4, %i7 ! 200f6c4 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f6d8: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200f6dc: 7f ff ca af call 2002198 200f6e0: 91 2a 20 08 sll %o0, 8, %o0 doneConstructors = 1; #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f6e4: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f6e8: 03 00 80 75 sethi %hi(0x201d400), %g1 doneConstructors = 1; 200f6ec: 86 10 20 01 mov 1, %g3 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f6f0: f6 08 62 0c ldub [ %g1 + 0x20c ], %i3 doneConstructors = 1; #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f6f4: 80 a0 a0 00 cmp %g2, 0 200f6f8: 02 80 00 0c be 200f728 <_Thread_Handler+0x64> 200f6fc: c6 28 62 0c stb %g3, [ %g1 + 0x20c ] #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 ); 200f700: 39 00 80 76 sethi %hi(0x201d800), %i4 200f704: d0 07 21 d4 ld [ %i4 + 0x1d4 ], %o0 ! 201d9d4 <_Thread_Allocated_fp> 200f708: 80 a7 40 08 cmp %i5, %o0 200f70c: 02 80 00 07 be 200f728 <_Thread_Handler+0x64> 200f710: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f714: 22 80 00 05 be,a 200f728 <_Thread_Handler+0x64> 200f718: fa 27 21 d4 st %i5, [ %i4 + 0x1d4 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f71c: 7f ff eb c2 call 200a624 <_CPU_Context_save_fp> 200f720: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200f724: fa 27 21 d4 st %i5, [ %i4 + 0x1d4 ] /* * 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 ); 200f728: 7f ff ea 30 call 2009fe8 <_User_extensions_Thread_begin> 200f72c: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f730: 7f ff e6 d7 call 200928c <_Thread_Enable_dispatch> 200f734: b7 2e e0 18 sll %i3, 0x18, %i3 /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { 200f738: 80 a6 e0 00 cmp %i3, 0 200f73c: 02 80 00 0e be 200f774 <_Thread_Handler+0xb0> 200f740: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f744: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200f748: 80 a0 60 00 cmp %g1, 0 200f74c: 02 80 00 0e be 200f784 <_Thread_Handler+0xc0> 200f750: 80 a0 60 01 cmp %g1, 1 (*(Thread_Entry_numeric) executing->Start.entry_point)( executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 200f754: 22 80 00 11 be,a 200f798 <_Thread_Handler+0xd4> <== ALWAYS TAKEN 200f758: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 200f75c: 7f ff ea 37 call 200a038 <_User_extensions_Thread_exitted> 200f760: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200f764: 90 10 20 00 clr %o0 200f768: 92 10 20 01 mov 1, %o1 200f76c: 7f ff e1 88 call 2007d8c <_Internal_error_Occurred> 200f770: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { INIT_NAME (); 200f774: 40 00 35 0f call 201cbb0 <_init> 200f778: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f77c: 10 bf ff f3 b 200f748 <_Thread_Handler+0x84> 200f780: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f784: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200f788: 9f c0 40 00 call %g1 200f78c: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200f790: 10 bf ff f3 b 200f75c <_Thread_Handler+0x98> 200f794: d0 27 60 28 st %o0, [ %i5 + 0x28 ] ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200f798: 9f c0 40 00 call %g1 200f79c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 200f7a0: 10 bf ff ef b 200f75c <_Thread_Handler+0x98> 200f7a4: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200936c <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200936c: 9d e3 bf a0 save %sp, -96, %sp 2009370: 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; 2009374: c0 26 61 58 clr [ %i1 + 0x158 ] 2009378: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 200937c: 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 ) { 2009380: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2009384: e4 00 40 00 ld [ %g1 ], %l2 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 2009388: 80 a6 a0 00 cmp %i2, 0 200938c: 02 80 00 6b be 2009538 <_Thread_Initialize+0x1cc> 2009390: e2 0f a0 5f ldub [ %fp + 0x5f ], %l1 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 2009394: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 2009398: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200939c: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 20093a0: d0 26 60 b8 st %o0, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 20093a4: 80 a7 20 00 cmp %i4, 0 20093a8: 12 80 00 48 bne 20094c8 <_Thread_Initialize+0x15c> 20093ac: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20093b0: 39 00 80 76 sethi %hi(0x201d800), %i4 20093b4: c2 07 21 e4 ld [ %i4 + 0x1e4 ], %g1 ! 201d9e4 <_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; 20093b8: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 20093bc: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20093c0: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 20093c4: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 20093c8: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20093cc: 80 a0 60 00 cmp %g1, 0 20093d0: 12 80 00 46 bne 20094e8 <_Thread_Initialize+0x17c> 20093d4: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 20093d8: c0 26 61 60 clr [ %i1 + 0x160 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 20093dc: b4 10 20 00 clr %i2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 20093e0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 20093e4: e2 2e 60 a0 stb %l1, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 20093e8: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 20093ec: 80 a4 20 02 cmp %l0, 2 20093f0: 12 80 00 05 bne 2009404 <_Thread_Initialize+0x98> 20093f4: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 20093f8: 03 00 80 76 sethi %hi(0x201d800), %g1 20093fc: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201d8b4 <_Thread_Ticks_per_timeslice> 2009400: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009404: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2009408: 03 00 80 73 sethi %hi(0x201cc00), %g1 200940c: c2 00 60 ec ld [ %g1 + 0xec ], %g1 ! 201ccec <_Scheduler+0x18> 2009410: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2009414: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 2009418: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200941c: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2009420: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2009424: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2009428: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 200942c: 9f c0 40 00 call %g1 2009430: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2009434: b8 92 20 00 orcc %o0, 0, %i4 2009438: 22 80 00 13 be,a 2009484 <_Thread_Initialize+0x118> 200943c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2009440: 90 10 00 19 mov %i1, %o0 2009444: 40 00 01 e5 call 2009bd8 <_Thread_Set_priority> 2009448: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200944c: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009450: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 2009454: c0 26 60 84 clr [ %i1 + 0x84 ] 2009458: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200945c: 83 28 60 02 sll %g1, 2, %g1 2009460: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2009464: e4 26 60 0c st %l2, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 2009468: 90 10 00 19 mov %i1, %o0 200946c: 40 00 03 1a call 200a0d4 <_User_extensions_Thread_create> 2009470: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2009474: 80 8a 20 ff btst 0xff, %o0 2009478: 32 80 00 12 bne,a 20094c0 <_Thread_Initialize+0x154> 200947c: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 2009480: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 2009484: 40 00 04 53 call 200a5d0 <_Workspace_Free> 2009488: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200948c: 40 00 04 51 call 200a5d0 <_Workspace_Free> 2009490: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2009494: 40 00 04 4f call 200a5d0 <_Workspace_Free> 2009498: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200949c: 40 00 04 4d call 200a5d0 <_Workspace_Free> 20094a0: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 20094a4: 40 00 04 4b call 200a5d0 <_Workspace_Free> 20094a8: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 20094ac: 40 00 04 49 call 200a5d0 <_Workspace_Free> 20094b0: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 20094b4: 40 00 02 0d call 2009ce8 <_Thread_Stack_Free> 20094b8: 90 10 00 19 mov %i1, %o0 return false; } 20094bc: b0 0e 20 01 and %i0, 1, %i0 20094c0: 81 c7 e0 08 ret 20094c4: 81 e8 00 00 restore /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 20094c8: 40 00 04 3a call 200a5b0 <_Workspace_Allocate> 20094cc: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 20094d0: b6 92 20 00 orcc %o0, 0, %i3 20094d4: 32 bf ff b8 bne,a 20093b4 <_Thread_Initialize+0x48> 20094d8: 39 00 80 76 sethi %hi(0x201d800), %i4 * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 20094dc: b4 10 20 00 clr %i2 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 20094e0: 10 bf ff e8 b 2009480 <_Thread_Initialize+0x114> 20094e4: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 20094e8: 82 00 60 01 inc %g1 20094ec: 40 00 04 31 call 200a5b0 <_Workspace_Allocate> 20094f0: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 20094f4: b4 92 20 00 orcc %o0, 0, %i2 20094f8: 02 80 00 1d be 200956c <_Thread_Initialize+0x200> 20094fc: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2009500: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 2009504: c8 07 21 e4 ld [ %i4 + 0x1e4 ], %g4 * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2009508: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200950c: 10 80 00 03 b 2009518 <_Thread_Initialize+0x1ac> 2009510: 82 10 20 00 clr %g1 2009514: c6 06 61 60 ld [ %i1 + 0x160 ], %g3 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 2009518: 85 28 a0 02 sll %g2, 2, %g2 200951c: c0 20 c0 02 clr [ %g3 + %g2 ] * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2009520: 82 00 60 01 inc %g1 2009524: 80 a0 40 04 cmp %g1, %g4 2009528: 08 bf ff fb bleu 2009514 <_Thread_Initialize+0x1a8> 200952c: 84 10 00 01 mov %g1, %g2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2009530: 10 bf ff ad b 20093e4 <_Thread_Initialize+0x78> 2009534: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 2009538: 90 10 00 19 mov %i1, %o0 200953c: 40 00 01 d0 call 2009c7c <_Thread_Stack_Allocate> 2009540: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2009544: 80 a2 00 1b cmp %o0, %i3 2009548: 0a 80 00 07 bcs 2009564 <_Thread_Initialize+0x1f8> 200954c: 80 a2 20 00 cmp %o0, 0 2009550: 02 80 00 05 be 2009564 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 2009554: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 2009558: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 200955c: 10 bf ff 90 b 200939c <_Thread_Initialize+0x30> 2009560: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 2009564: 10 bf ff d6 b 20094bc <_Thread_Initialize+0x150> 2009568: b0 10 20 00 clr %i0 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 200956c: 10 bf ff c5 b 2009480 <_Thread_Initialize+0x114> 2009570: b8 10 20 00 clr %i4 =============================================================================== 02009dc8 <_Thread_Tickle_timeslice>: * * Output parameters: NONE */ void _Thread_Tickle_timeslice( void ) { 2009dc8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 2009dcc: 03 00 80 77 sethi %hi(0x201dc00), %g1 2009dd0: d0 00 62 94 ld [ %g1 + 0x294 ], %o0 ! 201de94 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009dd4: c2 0a 20 74 ldub [ %o0 + 0x74 ], %g1 2009dd8: 80 a0 60 00 cmp %g1, 0 2009ddc: 02 80 00 26 be 2009e74 <_Thread_Tickle_timeslice+0xac> 2009de0: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009de4: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2009de8: 80 a0 60 00 cmp %g1, 0 2009dec: 12 80 00 22 bne 2009e74 <_Thread_Tickle_timeslice+0xac> 2009df0: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009df4: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 2009df8: 80 a0 60 01 cmp %g1, 1 2009dfc: 0a 80 00 07 bcs 2009e18 <_Thread_Tickle_timeslice+0x50> 2009e00: 80 a0 60 02 cmp %g1, 2 2009e04: 28 80 00 10 bleu,a 2009e44 <_Thread_Tickle_timeslice+0x7c> 2009e08: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009e0c: 80 a0 60 03 cmp %g1, 3 2009e10: 22 80 00 04 be,a 2009e20 <_Thread_Tickle_timeslice+0x58> <== ALWAYS TAKEN 2009e14: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009e18: 81 c7 e0 08 ret 2009e1c: 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 ) 2009e20: 82 00 7f ff add %g1, -1, %g1 2009e24: 80 a0 60 00 cmp %g1, 0 2009e28: 12 bf ff fc bne 2009e18 <_Thread_Tickle_timeslice+0x50> 2009e2c: c2 22 20 78 st %g1, [ %o0 + 0x78 ] (*executing->budget_callout)( executing ); 2009e30: c2 02 20 80 ld [ %o0 + 0x80 ], %g1 2009e34: 9f c0 40 00 call %g1 2009e38: 01 00 00 00 nop 2009e3c: 81 c7 e0 08 ret 2009e40: 81 e8 00 00 restore case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: #endif if ( (int)(--executing->cpu_time_budget) <= 0 ) { 2009e44: 82 00 7f ff add %g1, -1, %g1 2009e48: 80 a0 60 00 cmp %g1, 0 2009e4c: 14 bf ff f3 bg 2009e18 <_Thread_Tickle_timeslice+0x50> 2009e50: c2 22 20 78 st %g1, [ %o0 + 0x78 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 2009e54: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009e58: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 201cce0 <_Scheduler+0xc> 2009e5c: 9f c0 40 00 call %g1 2009e60: d0 27 bf fc st %o0, [ %fp + -4 ] * executing thread's timeslice is reset. Otherwise, the * currently executing thread is placed at the rear of the * FIFO for this priority and a new heir is selected. */ _Scheduler_Yield( ); executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009e64: 03 00 80 76 sethi %hi(0x201d800), %g1 2009e68: d0 07 bf fc ld [ %fp + -4 ], %o0 2009e6c: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 2009e70: c2 22 20 78 st %g1, [ %o0 + 0x78 ] 2009e74: 81 c7 e0 08 ret 2009e78: 81 e8 00 00 restore =============================================================================== 0200985c <_Thread_queue_Enqueue_priority>: Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 200985c: 9d e3 bf a0 save %sp, -96, %sp Priority_Control priority; States_Control block_state; _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; 2009860: fa 06 60 14 ld [ %i1 + 0x14 ], %i5 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2009864: 82 06 60 38 add %i1, 0x38, %g1 2009868: 84 06 60 3c add %i1, 0x3c, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 200986c: c2 26 60 40 st %g1, [ %i1 + 0x40 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009870: c4 26 60 38 st %g2, [ %i1 + 0x38 ] head->previous = NULL; 2009874: c0 26 60 3c clr [ %i1 + 0x3c ] Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 2009878: b8 10 00 18 mov %i0, %i4 RTEMS_INLINE_ROUTINE uint32_t _Thread_queue_Header_number ( Priority_Control the_priority ) { return (the_priority / TASK_QUEUE_DATA_PRIORITIES_PER_HEADER); 200987c: 83 37 60 06 srl %i5, 6, %g1 2009880: 25 00 80 73 sethi %hi(0x201cc00), %l2 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2009884: 85 28 60 02 sll %g1, 2, %g2 block_state = the_thread_queue->state; 2009888: f0 06 20 38 ld [ %i0 + 0x38 ], %i0 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 200988c: 83 28 60 04 sll %g1, 4, %g1 2009890: a4 14 a0 2c or %l2, 0x2c, %l2 2009894: 82 20 40 02 sub %g1, %g2, %g1 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2009898: 80 8f 60 20 btst 0x20, %i5 200989c: 12 80 00 26 bne 2009934 <_Thread_queue_Enqueue_priority+0xd8> 20098a0: a2 07 00 01 add %i4, %g1, %l1 20098a4: a4 04 60 04 add %l1, 4, %l2 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 20098a8: 7f ff e2 38 call 2002188 20098ac: 01 00 00 00 nop 20098b0: 82 10 00 08 mov %o0, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 20098b4: f6 04 40 00 ld [ %l1 ], %i3 search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 20098b8: 80 a6 c0 12 cmp %i3, %l2 20098bc: 32 80 00 12 bne,a 2009904 <_Thread_queue_Enqueue_priority+0xa8> 20098c0: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( _Thread_queue_Is_reverse_search( priority ) ) goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; 20098c4: 10 80 00 63 b 2009a50 <_Thread_queue_Enqueue_priority+0x1f4> 20098c8: a0 10 3f ff mov -1, %l0 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 20098cc: 7f ff e2 33 call 2002198 20098d0: 90 10 00 01 mov %g1, %o0 20098d4: 7f ff e2 2d call 2002188 20098d8: 01 00 00 00 nop 20098dc: 82 10 00 08 mov %o0, %g1 RTEMS_INLINE_ROUTINE bool _States_Are_set ( States_Control the_states, States_Control mask ) { return ( (the_states & mask) != STATES_READY); 20098e0: c4 06 e0 10 ld [ %i3 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 20098e4: 80 8e 00 02 btst %i0, %g2 20098e8: 02 80 00 3f be 20099e4 <_Thread_queue_Enqueue_priority+0x188> 20098ec: 01 00 00 00 nop _ISR_Enable( level ); goto restart_forward_search; } search_thread = 20098f0: f6 06 c0 00 ld [ %i3 ], %i3 restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 20098f4: 80 a6 c0 12 cmp %i3, %l2 20098f8: 22 80 00 07 be,a 2009914 <_Thread_queue_Enqueue_priority+0xb8> 20098fc: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 search_priority = search_thread->current_priority; 2009900: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( priority <= search_priority ) 2009904: 80 a7 40 10 cmp %i5, %l0 2009908: 18 bf ff f1 bgu 20098cc <_Thread_queue_Enqueue_priority+0x70> 200990c: 01 00 00 00 nop } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2009910: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 2009914: 80 a6 20 01 cmp %i0, 1 2009918: 02 80 00 36 be 20099f0 <_Thread_queue_Enqueue_priority+0x194><== ALWAYS TAKEN 200991c: 80 a7 40 10 cmp %i5, %l0 * For example, the blocking thread could have been given * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; 2009920: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED return the_thread_queue->sync_state; } 2009924: 81 c7 e0 08 ret <== NOT EXECUTED 2009928: 81 e8 00 00 restore <== NOT EXECUTED if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 200992c: 7f ff e2 1b call 2002198 2009930: 01 00 00 00 nop return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 2009934: 7f ff e2 15 call 2002188 2009938: e0 0c 80 00 ldub [ %l2 ], %l0 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 200993c: a0 04 20 01 inc %l0 _ISR_Disable( level ); 2009940: 82 10 00 08 mov %o0, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 2009944: f6 04 60 08 ld [ %l1 + 8 ], %i3 search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2009948: 80 a6 c0 11 cmp %i3, %l1 200994c: 32 80 00 12 bne,a 2009994 <_Thread_queue_Enqueue_priority+0x138> 2009950: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2009954: 10 80 00 14 b 20099a4 <_Thread_queue_Enqueue_priority+0x148> 2009958: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 200995c: 7f ff e2 0f call 2002198 2009960: 90 10 00 01 mov %g1, %o0 2009964: 7f ff e2 09 call 2002188 2009968: 01 00 00 00 nop 200996c: 82 10 00 08 mov %o0, %g1 2009970: c4 06 e0 10 ld [ %i3 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2009974: 80 8e 00 02 btst %i0, %g2 2009978: 02 bf ff ed be 200992c <_Thread_queue_Enqueue_priority+0xd0> 200997c: 01 00 00 00 nop _ISR_Enable( level ); goto restart_reverse_search; } search_thread = (Thread_Control *) 2009980: f6 06 e0 04 ld [ %i3 + 4 ], %i3 restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2009984: 80 a6 c0 11 cmp %i3, %l1 2009988: 22 80 00 07 be,a 20099a4 <_Thread_queue_Enqueue_priority+0x148> 200998c: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 search_priority = search_thread->current_priority; 2009990: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( priority >= search_priority ) 2009994: 80 a7 40 10 cmp %i5, %l0 2009998: 0a bf ff f1 bcs 200995c <_Thread_queue_Enqueue_priority+0x100> 200999c: 01 00 00 00 nop } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 20099a0: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 20099a4: 80 a6 20 01 cmp %i0, 1 20099a8: 32 bf ff df bne,a 2009924 <_Thread_queue_Enqueue_priority+0xc8><== NEVER TAKEN 20099ac: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 20099b0: 80 a7 40 10 cmp %i5, %l0 20099b4: 02 80 00 1b be 2009a20 <_Thread_queue_Enqueue_priority+0x1c4> 20099b8: c0 27 20 30 clr [ %i4 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 20099bc: c4 06 c0 00 ld [ %i3 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 20099c0: f6 26 60 04 st %i3, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 20099c4: c4 26 40 00 st %g2, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; 20099c8: f2 26 c0 00 st %i1, [ %i3 ] next_node->previous = the_node; 20099cc: f2 20 a0 04 st %i1, [ %g2 + 4 ] the_thread->Wait.queue = the_thread_queue; 20099d0: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); 20099d4: 7f ff e1 f1 call 2002198 20099d8: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20099dc: 81 c7 e0 08 ret 20099e0: 81 e8 00 00 restore if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 20099e4: 7f ff e1 ed call 2002198 20099e8: 01 00 00 00 nop goto restart_forward_search; 20099ec: 30 bf ff af b,a 20098a8 <_Thread_queue_Enqueue_priority+0x4c> THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 20099f0: 02 80 00 0c be 2009a20 <_Thread_queue_Enqueue_priority+0x1c4> 20099f4: c0 27 20 30 clr [ %i4 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; previous_node = search_node->previous; 20099f8: c4 06 e0 04 ld [ %i3 + 4 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 20099fc: f6 26 40 00 st %i3, [ %i1 ] the_node->previous = previous_node; 2009a00: c4 26 60 04 st %g2, [ %i1 + 4 ] previous_node->next = the_node; 2009a04: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 2009a08: f2 26 e0 04 st %i1, [ %i3 + 4 ] the_thread->Wait.queue = the_thread_queue; 2009a0c: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); 2009a10: 7f ff e1 e2 call 2002198 2009a14: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2009a18: 81 c7 e0 08 ret 2009a1c: 81 e8 00 00 restore _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; 2009a20: c4 06 e0 40 ld [ %i3 + 0x40 ], %g2 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); 2009a24: 86 06 e0 3c add %i3, 0x3c, %g3 previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; 2009a28: c4 26 60 04 st %g2, [ %i1 + 4 ] equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2009a2c: c6 26 40 00 st %g3, [ %i1 ] the_node->previous = previous_node; previous_node->next = the_node; 2009a30: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 2009a34: f2 26 e0 40 st %i1, [ %i3 + 0x40 ] the_thread->Wait.queue = the_thread_queue; 2009a38: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2009a3c: b0 10 20 01 mov 1, %i0 the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2009a40: 7f ff e1 d6 call 2002198 2009a44: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2009a48: 81 c7 e0 08 ret 2009a4c: 81 e8 00 00 restore } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2009a50: 10 bf ff b1 b 2009914 <_Thread_queue_Enqueue_priority+0xb8> 2009a54: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 =============================================================================== 02009b14 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009b14: 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 ) 2009b18: 80 a6 20 00 cmp %i0, 0 2009b1c: 02 80 00 13 be 2009b68 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 2009b20: 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 ) { 2009b24: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2009b28: 80 a7 20 01 cmp %i4, 1 2009b2c: 02 80 00 04 be 2009b3c <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 2009b30: 01 00 00 00 nop 2009b34: 81 c7 e0 08 ret <== NOT EXECUTED 2009b38: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009b3c: 7f ff e1 93 call 2002188 2009b40: 01 00 00 00 nop 2009b44: ba 10 00 08 mov %o0, %i5 2009b48: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2009b4c: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009b50: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009b54: 80 88 80 01 btst %g2, %g1 2009b58: 12 80 00 06 bne 2009b70 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 2009b5c: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); } _ISR_Enable( level ); 2009b60: 7f ff e1 8e call 2002198 2009b64: 90 10 00 1d mov %i5, %o0 2009b68: 81 c7 e0 08 ret 2009b6c: 81 e8 00 00 restore ISR_Level level_ignored; _ISR_Disable( level ); if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2009b70: 92 10 00 19 mov %i1, %o1 2009b74: 94 10 20 01 mov 1, %o2 2009b78: 40 00 0f 78 call 200d958 <_Thread_queue_Extract_priority_helper> 2009b7c: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009b80: 90 10 00 18 mov %i0, %o0 2009b84: 92 10 00 19 mov %i1, %o1 2009b88: 7f ff ff 35 call 200985c <_Thread_queue_Enqueue_priority> 2009b8c: 94 07 bf fc add %fp, -4, %o2 2009b90: 30 bf ff f4 b,a 2009b60 <_Thread_queue_Requeue+0x4c> =============================================================================== 02009b94 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009b94: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009b98: 90 10 00 18 mov %i0, %o0 2009b9c: 7f ff fd c8 call 20092bc <_Thread_Get> 2009ba0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009ba4: c2 07 bf fc ld [ %fp + -4 ], %g1 2009ba8: 80 a0 60 00 cmp %g1, 0 2009bac: 12 80 00 09 bne 2009bd0 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009bb0: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009bb4: 40 00 0f a2 call 200da3c <_Thread_queue_Process_timeout> 2009bb8: 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--; 2009bbc: 03 00 80 76 sethi %hi(0x201d800), %g1 2009bc0: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201d950 <_Thread_Dispatch_disable_level> 2009bc4: 84 00 bf ff add %g2, -1, %g2 2009bc8: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2009bcc: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 2009bd0: 81 c7 e0 08 ret 2009bd4: 81 e8 00 00 restore =============================================================================== 02016488 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2016488: 9d e3 bf 88 save %sp, -120, %sp 201648c: 23 00 80 f7 sethi %hi(0x203dc00), %l1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016490: a6 07 bf e8 add %fp, -24, %l3 2016494: b2 07 bf ec add %fp, -20, %i1 2016498: b6 07 bf f4 add %fp, -12, %i3 201649c: a4 07 bf f8 add %fp, -8, %l2 20164a0: 21 00 80 f7 sethi %hi(0x203dc00), %l0 20164a4: 29 00 80 f7 sethi %hi(0x203dc00), %l4 20164a8: f2 27 bf e8 st %i1, [ %fp + -24 ] head->previous = NULL; 20164ac: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20164b0: e6 27 bf f0 st %l3, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20164b4: e4 27 bf f4 st %l2, [ %fp + -12 ] head->previous = NULL; 20164b8: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20164bc: f6 27 bf fc st %i3, [ %fp + -4 ] 20164c0: a2 14 61 d4 or %l1, 0x1d4, %l1 20164c4: b8 06 20 30 add %i0, 0x30, %i4 20164c8: a0 14 21 4c or %l0, 0x14c, %l0 20164cc: b4 06 20 68 add %i0, 0x68, %i2 20164d0: a8 15 20 c0 or %l4, 0xc0, %l4 20164d4: ae 06 20 08 add %i0, 8, %l7 20164d8: ac 06 20 40 add %i0, 0x40, %l6 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 20164dc: aa 10 20 01 mov 1, %l5 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 20164e0: e6 26 20 78 st %l3, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20164e4: c2 04 40 00 ld [ %l1 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20164e8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20164ec: 94 10 00 1b mov %i3, %o2 20164f0: 90 10 00 1c mov %i4, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20164f4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20164f8: 40 00 13 35 call 201b1cc <_Watchdog_Adjust_to_chain> 20164fc: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016500: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016504: fa 04 00 00 ld [ %l0 ], %i5 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 2016508: 80 a7 40 0a cmp %i5, %o2 201650c: 18 80 00 2e bgu 20165c4 <_Timer_server_Body+0x13c> 2016510: 92 27 40 0a sub %i5, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2016514: 80 a7 40 0a cmp %i5, %o2 2016518: 0a 80 00 2f bcs 20165d4 <_Timer_server_Body+0x14c> 201651c: 90 10 00 1a mov %i2, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2016520: 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 ); 2016524: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016528: 40 00 03 1b call 2017194 <_Chain_Get> 201652c: 01 00 00 00 nop if ( timer == NULL ) { 2016530: 92 92 20 00 orcc %o0, 0, %o1 2016534: 02 80 00 10 be 2016574 <_Timer_server_Body+0xec> 2016538: 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 ) { 201653c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2016540: 80 a0 60 01 cmp %g1, 1 2016544: 02 80 00 28 be 20165e4 <_Timer_server_Body+0x15c> 2016548: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 201654c: 12 bf ff f6 bne 2016524 <_Timer_server_Body+0x9c> <== NEVER TAKEN 2016550: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016554: 40 00 13 4f call 201b290 <_Watchdog_Insert> 2016558: 90 10 00 1a mov %i2, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 201655c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016560: 40 00 03 0d call 2017194 <_Chain_Get> 2016564: 01 00 00 00 nop if ( timer == NULL ) { 2016568: 92 92 20 00 orcc %o0, 0, %o1 201656c: 32 bf ff f5 bne,a 2016540 <_Timer_server_Body+0xb8> <== NEVER TAKEN 2016570: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2016574: 7f ff e2 29 call 200ee18 2016578: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 201657c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016580: 80 a0 40 19 cmp %g1, %i1 2016584: 02 80 00 1c be 20165f4 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 2016588: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 201658c: 7f ff e2 27 call 200ee28 <== NOT EXECUTED 2016590: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016594: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016598: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201659c: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED 20165a0: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20165a4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165a8: 40 00 13 09 call 201b1cc <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 20165ac: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 20165b0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20165b4: fa 04 00 00 ld [ %l0 ], %i5 <== NOT EXECUTED /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 20165b8: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED 20165bc: 08 bf ff d7 bleu 2016518 <_Timer_server_Body+0x90> <== NOT EXECUTED 20165c0: 92 27 40 0a sub %i5, %o2, %o1 <== NOT EXECUTED /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165c4: 90 10 00 1a mov %i2, %o0 20165c8: 40 00 13 01 call 201b1cc <_Watchdog_Adjust_to_chain> 20165cc: 94 10 00 1b mov %i3, %o2 20165d0: 30 bf ff d4 b,a 2016520 <_Timer_server_Body+0x98> /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 20165d4: 92 10 20 01 mov 1, %o1 20165d8: 40 00 12 ce call 201b110 <_Watchdog_Adjust> 20165dc: 94 22 80 1d sub %o2, %i5, %o2 20165e0: 30 bf ff d0 b,a 2016520 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20165e4: 90 10 00 1c mov %i4, %o0 20165e8: 40 00 13 2a call 201b290 <_Watchdog_Insert> 20165ec: 92 02 60 10 add %o1, 0x10, %o1 20165f0: 30 bf ff cd b,a 2016524 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 20165f4: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 20165f8: 7f ff e2 0c call 200ee28 20165fc: 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 ) ) { 2016600: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016604: 80 a0 40 12 cmp %g1, %l2 2016608: 12 80 00 0c bne 2016638 <_Timer_server_Body+0x1b0> 201660c: 01 00 00 00 nop 2016610: 30 80 00 13 b,a 201665c <_Timer_server_Body+0x1d4> Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; new_first->previous = head; 2016614: f6 20 60 04 st %i3, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 2016618: c2 27 bf f4 st %g1, [ %fp + -12 ] * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 201661c: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 2016620: 7f ff e2 02 call 200ee28 2016624: 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 ); 2016628: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 201662c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2016630: 9f c0 40 00 call %g1 2016634: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2016638: 7f ff e1 f8 call 200ee18 201663c: 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; 2016640: 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)) 2016644: 80 a7 40 12 cmp %i5, %l2 2016648: 32 bf ff f3 bne,a 2016614 <_Timer_server_Body+0x18c> 201664c: c2 07 40 00 ld [ %i5 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2016650: 7f ff e1 f6 call 200ee28 2016654: 01 00 00 00 nop 2016658: 30 bf ff a2 b,a 20164e0 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 201665c: c0 2e 20 7c clrb [ %i0 + 0x7c ] /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2016660: c2 05 00 00 ld [ %l4 ], %g1 2016664: 82 00 60 01 inc %g1 2016668: c2 25 00 00 st %g1, [ %l4 ] return _Thread_Dispatch_disable_level; 201666c: c2 05 00 00 ld [ %l4 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016670: d0 06 00 00 ld [ %i0 ], %o0 2016674: 40 00 10 de call 201a9ec <_Thread_Set_state> 2016678: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 201667c: 7f ff ff 5b call 20163e8 <_Timer_server_Reset_interval_system_watchdog> 2016680: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016684: 7f ff ff 6d call 2016438 <_Timer_server_Reset_tod_system_watchdog> 2016688: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 201668c: 40 00 0e 59 call 2019ff0 <_Thread_Enable_dispatch> 2016690: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016694: 90 10 00 17 mov %l7, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 2016698: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201669c: 40 00 13 5f call 201b418 <_Watchdog_Remove> 20166a0: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20166a4: 40 00 13 5d call 201b418 <_Watchdog_Remove> 20166a8: 90 10 00 16 mov %l6, %o0 20166ac: 30 bf ff 8d b,a 20164e0 <_Timer_server_Body+0x58> =============================================================================== 020166b0 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20166b0: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20166b4: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20166b8: 80 a0 60 00 cmp %g1, 0 20166bc: 02 80 00 05 be 20166d0 <_Timer_server_Schedule_operation_method+0x20> 20166c0: ba 10 00 19 mov %i1, %i5 * server is not preemptible, so we must be in interrupt context here. No * thread dispatch will happen until the timer server finishes its * critical section. We have to use the protected chain methods because * we may be interrupted by a higher priority interrupt. */ _Chain_Append( ts->insert_chain, &timer->Object.Node ); 20166c4: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 20166c8: 40 00 02 9f call 2017144 <_Chain_Append> 20166cc: 81 e8 00 00 restore /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20166d0: 03 00 80 f7 sethi %hi(0x203dc00), %g1 20166d4: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 203dcc0 <_Thread_Dispatch_disable_level> 20166d8: 84 00 a0 01 inc %g2 20166dc: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 20166e0: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 20166e4: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 20166e8: 80 a0 60 01 cmp %g1, 1 20166ec: 02 80 00 28 be 201678c <_Timer_server_Schedule_operation_method+0xdc> 20166f0: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); if ( !ts->active ) { _Timer_server_Reset_interval_system_watchdog( ts ); } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20166f4: 02 80 00 04 be 2016704 <_Timer_server_Schedule_operation_method+0x54> 20166f8: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20166fc: 40 00 0e 3d call 2019ff0 <_Thread_Enable_dispatch> 2016700: 81 e8 00 00 restore } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2016704: 7f ff e1 c5 call 200ee18 2016708: 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; 201670c: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016710: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016714: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016718: 03 00 80 f7 sethi %hi(0x203dc00), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 201671c: 80 a0 80 04 cmp %g2, %g4 2016720: 02 80 00 0d be 2016754 <_Timer_server_Schedule_operation_method+0xa4> 2016724: c2 00 61 4c ld [ %g1 + 0x14c ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2016728: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 if ( snapshot > last_snapshot ) { 201672c: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016730: 88 03 c0 03 add %o7, %g3, %g4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2016734: 08 80 00 07 bleu 2016750 <_Timer_server_Schedule_operation_method+0xa0> 2016738: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 201673c: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 2016740: 80 a3 c0 03 cmp %o7, %g3 2016744: 08 80 00 03 bleu 2016750 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN 2016748: 88 10 20 00 clr %g4 delta_interval -= delta; 201674c: 88 23 c0 03 sub %o7, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2016750: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2016754: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2016758: 7f ff e1 b4 call 200ee28 201675c: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016760: 90 06 20 68 add %i0, 0x68, %o0 2016764: 40 00 12 cb call 201b290 <_Watchdog_Insert> 2016768: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 201676c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016770: 80 a0 60 00 cmp %g1, 0 2016774: 12 bf ff e2 bne 20166fc <_Timer_server_Schedule_operation_method+0x4c> 2016778: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 201677c: 7f ff ff 2f call 2016438 <_Timer_server_Reset_tod_system_watchdog> 2016780: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016784: 40 00 0e 1b call 2019ff0 <_Thread_Enable_dispatch> 2016788: 81 e8 00 00 restore if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 201678c: 7f ff e1 a3 call 200ee18 2016790: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016794: 05 00 80 f7 sethi %hi(0x203dc00), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016798: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201679c: c4 00 a1 d4 ld [ %g2 + 0x1d4 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 20167a0: 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 ); 20167a4: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20167a8: 80 a0 40 03 cmp %g1, %g3 20167ac: 02 80 00 08 be 20167cc <_Timer_server_Schedule_operation_method+0x11c> 20167b0: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20167b4: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 20167b8: 80 a1 00 0f cmp %g4, %o7 20167bc: 1a 80 00 03 bcc 20167c8 <_Timer_server_Schedule_operation_method+0x118> 20167c0: 86 10 20 00 clr %g3 delta_interval -= delta; 20167c4: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 20167c8: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 20167cc: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 20167d0: 7f ff e1 96 call 200ee28 20167d4: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20167d8: 90 06 20 30 add %i0, 0x30, %o0 20167dc: 40 00 12 ad call 201b290 <_Watchdog_Insert> 20167e0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167e4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20167e8: 80 a0 60 00 cmp %g1, 0 20167ec: 12 bf ff c4 bne 20166fc <_Timer_server_Schedule_operation_method+0x4c> 20167f0: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20167f4: 7f ff fe fd call 20163e8 <_Timer_server_Reset_interval_system_watchdog> 20167f8: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20167fc: 40 00 0d fd call 2019ff0 <_Thread_Enable_dispatch> 2016800: 81 e8 00 00 restore =============================================================================== 0200a084 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200a084: 9d e3 bf a0 save %sp, -96, %sp 200a088: 39 00 80 76 sethi %hi(0x201d800), %i4 200a08c: b8 17 23 38 or %i4, 0x338, %i4 ! 201db38 <_User_extensions_List> 200a090: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a094: 80 a7 40 1c cmp %i5, %i4 200a098: 02 80 00 0d be 200a0cc <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200a09c: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 200a0a0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a0a4: 80 a0 60 00 cmp %g1, 0 200a0a8: 02 80 00 05 be 200a0bc <_User_extensions_Fatal+0x38> 200a0ac: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200a0b0: 92 10 00 19 mov %i1, %o1 200a0b4: 9f c0 40 00 call %g1 200a0b8: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200a0bc: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a0c0: 80 a7 40 1c cmp %i5, %i4 200a0c4: 32 bf ff f8 bne,a 200a0a4 <_User_extensions_Fatal+0x20> 200a0c8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a0cc: 81 c7 e0 08 ret 200a0d0: 81 e8 00 00 restore =============================================================================== 02009f30 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009f30: 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; 2009f34: 07 00 80 72 sethi %hi(0x201c800), %g3 2009f38: 86 10 e3 ec or %g3, 0x3ec, %g3 ! 201cbec initial_extensions = Configuration.User_extension_table; 2009f3c: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3 2009f40: 3b 00 80 76 sethi %hi(0x201d800), %i5 2009f44: 09 00 80 76 sethi %hi(0x201d800), %g4 2009f48: 84 17 63 38 or %i5, 0x338, %g2 2009f4c: 82 11 21 54 or %g4, 0x154, %g1 2009f50: b4 00 a0 04 add %g2, 4, %i2 2009f54: b8 00 60 04 add %g1, 4, %i4 2009f58: f4 27 63 38 st %i2, [ %i5 + 0x338 ] head->previous = NULL; 2009f5c: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 2009f60: c4 20 a0 08 st %g2, [ %g2 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009f64: f8 21 21 54 st %i4, [ %g4 + 0x154 ] head->previous = NULL; 2009f68: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009f6c: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009f70: 80 a6 e0 00 cmp %i3, 0 2009f74: 02 80 00 1b be 2009fe0 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009f78: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009f7c: 83 2e a0 02 sll %i2, 2, %g1 2009f80: b9 2e a0 04 sll %i2, 4, %i4 2009f84: b8 27 00 01 sub %i4, %g1, %i4 2009f88: b8 07 00 1a add %i4, %i2, %i4 2009f8c: b9 2f 20 02 sll %i4, 2, %i4 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009f90: 40 00 01 96 call 200a5e8 <_Workspace_Allocate_or_fatal_error> 2009f94: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009f98: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009f9c: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009fa0: 40 00 18 f4 call 2010370 2009fa4: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009fa8: 80 a6 a0 00 cmp %i2, 0 2009fac: 02 80 00 0d be 2009fe0 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009fb0: b8 10 20 00 clr %i4 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 2009fb4: 92 10 00 1b mov %i3, %o1 2009fb8: 94 10 20 20 mov 0x20, %o2 2009fbc: 40 00 18 b1 call 2010280 2009fc0: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 2009fc4: 40 00 0e df call 200db40 <_User_extensions_Add_set> 2009fc8: 90 10 00 1d mov %i5, %o0 2009fcc: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009fd0: 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++ ) { 2009fd4: 80 a7 00 1a cmp %i4, %i2 2009fd8: 12 bf ff f7 bne 2009fb4 <_User_extensions_Handler_initialization+0x84> 2009fdc: b6 06 e0 20 add %i3, 0x20, %i3 2009fe0: 81 c7 e0 08 ret 2009fe4: 81 e8 00 00 restore =============================================================================== 02009fe8 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 2009fe8: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009fec: 39 00 80 76 sethi %hi(0x201d800), %i4 2009ff0: fa 07 23 38 ld [ %i4 + 0x338 ], %i5 ! 201db38 <_User_extensions_List> 2009ff4: b8 17 23 38 or %i4, 0x338, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009ff8: b8 07 20 04 add %i4, 4, %i4 2009ffc: 80 a7 40 1c cmp %i5, %i4 200a000: 02 80 00 0c be 200a030 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200a004: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 200a008: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200a00c: 80 a0 60 00 cmp %g1, 0 200a010: 02 80 00 04 be 200a020 <_User_extensions_Thread_begin+0x38> 200a014: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200a018: 9f c0 40 00 call %g1 200a01c: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a020: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a024: 80 a7 40 1c cmp %i5, %i4 200a028: 32 bf ff f9 bne,a 200a00c <_User_extensions_Thread_begin+0x24> 200a02c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200a030: 81 c7 e0 08 ret 200a034: 81 e8 00 00 restore =============================================================================== 0200a0d4 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200a0d4: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a0d8: 39 00 80 76 sethi %hi(0x201d800), %i4 200a0dc: fa 07 23 38 ld [ %i4 + 0x338 ], %i5 ! 201db38 <_User_extensions_List> 200a0e0: b8 17 23 38 or %i4, 0x338, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200a0e4: b8 07 20 04 add %i4, 4, %i4 200a0e8: 80 a7 40 1c cmp %i5, %i4 200a0ec: 02 80 00 12 be 200a134 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 200a0f0: 82 10 20 01 mov 1, %g1 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 200a0f4: 37 00 80 77 sethi %hi(0x201dc00), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 200a0f8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a0fc: 80 a0 60 00 cmp %g1, 0 200a100: 02 80 00 08 be 200a120 <_User_extensions_Thread_create+0x4c> 200a104: 84 16 e2 88 or %i3, 0x288, %g2 status = (*the_extension->Callouts.thread_create)( 200a108: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a10c: 9f c0 40 00 call %g1 200a110: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200a114: 80 8a 20 ff btst 0xff, %o0 200a118: 02 80 00 0a be 200a140 <_User_extensions_Thread_create+0x6c> 200a11c: 82 10 20 00 clr %g1 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a120: fa 07 40 00 ld [ %i5 ], %i5 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200a124: 80 a7 40 1c cmp %i5, %i4 200a128: 32 bf ff f5 bne,a 200a0fc <_User_extensions_Thread_create+0x28> 200a12c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200a130: 82 10 20 01 mov 1, %g1 } 200a134: b0 08 60 01 and %g1, 1, %i0 200a138: 81 c7 e0 08 ret 200a13c: 81 e8 00 00 restore 200a140: b0 08 60 01 and %g1, 1, %i0 200a144: 81 c7 e0 08 ret 200a148: 81 e8 00 00 restore =============================================================================== 0200a14c <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200a14c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200a150: 39 00 80 76 sethi %hi(0x201d800), %i4 200a154: b8 17 23 38 or %i4, 0x338, %i4 ! 201db38 <_User_extensions_List> 200a158: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a15c: 80 a7 40 1c cmp %i5, %i4 200a160: 02 80 00 0d be 200a194 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200a164: 37 00 80 77 sethi %hi(0x201dc00), %i3 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 200a168: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a16c: 80 a0 60 00 cmp %g1, 0 200a170: 02 80 00 05 be 200a184 <_User_extensions_Thread_delete+0x38> 200a174: 84 16 e2 88 or %i3, 0x288, %g2 (*the_extension->Callouts.thread_delete)( 200a178: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a17c: 9f c0 40 00 call %g1 200a180: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200a184: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a188: 80 a7 40 1c cmp %i5, %i4 200a18c: 32 bf ff f8 bne,a 200a16c <_User_extensions_Thread_delete+0x20> 200a190: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a194: 81 c7 e0 08 ret 200a198: 81 e8 00 00 restore =============================================================================== 0200a038 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200a038: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200a03c: 39 00 80 76 sethi %hi(0x201d800), %i4 200a040: b8 17 23 38 or %i4, 0x338, %i4 ! 201db38 <_User_extensions_List> 200a044: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a048: 80 a7 40 1c cmp %i5, %i4 200a04c: 02 80 00 0c be 200a07c <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200a050: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 200a054: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200a058: 80 a0 60 00 cmp %g1, 0 200a05c: 02 80 00 04 be 200a06c <_User_extensions_Thread_exitted+0x34> 200a060: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200a064: 9f c0 40 00 call %g1 200a068: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200a06c: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a070: 80 a7 40 1c cmp %i5, %i4 200a074: 32 bf ff f9 bne,a 200a058 <_User_extensions_Thread_exitted+0x20> 200a078: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200a07c: 81 c7 e0 08 ret 200a080: 81 e8 00 00 restore =============================================================================== 0200a978 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200a978: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a97c: 39 00 80 79 sethi %hi(0x201e400), %i4 200a980: fa 07 21 f8 ld [ %i4 + 0x1f8 ], %i5 ! 201e5f8 <_User_extensions_List> 200a984: b8 17 21 f8 or %i4, 0x1f8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a988: b8 07 20 04 add %i4, 4, %i4 200a98c: 80 a7 40 1c cmp %i5, %i4 200a990: 02 80 00 0d be 200a9c4 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200a994: 37 00 80 7a sethi %hi(0x201e800), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 200a998: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a99c: 80 a0 60 00 cmp %g1, 0 200a9a0: 02 80 00 05 be 200a9b4 <_User_extensions_Thread_restart+0x3c> 200a9a4: 84 16 e1 48 or %i3, 0x148, %g2 (*the_extension->Callouts.thread_restart)( 200a9a8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a9ac: 9f c0 40 00 call %g1 200a9b0: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a9b4: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a9b8: 80 a7 40 1c cmp %i5, %i4 200a9bc: 32 bf ff f8 bne,a 200a99c <_User_extensions_Thread_restart+0x24> 200a9c0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a9c4: 81 c7 e0 08 ret 200a9c8: 81 e8 00 00 restore =============================================================================== 0200a19c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200a19c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a1a0: 39 00 80 76 sethi %hi(0x201d800), %i4 200a1a4: fa 07 23 38 ld [ %i4 + 0x338 ], %i5 ! 201db38 <_User_extensions_List> 200a1a8: b8 17 23 38 or %i4, 0x338, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a1ac: b8 07 20 04 add %i4, 4, %i4 200a1b0: 80 a7 40 1c cmp %i5, %i4 200a1b4: 02 80 00 0d be 200a1e8 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200a1b8: 37 00 80 77 sethi %hi(0x201dc00), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 200a1bc: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a1c0: 80 a0 60 00 cmp %g1, 0 200a1c4: 02 80 00 05 be 200a1d8 <_User_extensions_Thread_start+0x3c> 200a1c8: 84 16 e2 88 or %i3, 0x288, %g2 (*the_extension->Callouts.thread_start)( 200a1cc: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a1d0: 9f c0 40 00 call %g1 200a1d4: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a1d8: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a1dc: 80 a7 40 1c cmp %i5, %i4 200a1e0: 32 bf ff f8 bne,a 200a1c0 <_User_extensions_Thread_start+0x24> 200a1e4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a1e8: 81 c7 e0 08 ret 200a1ec: 81 e8 00 00 restore =============================================================================== 0200a1f0 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200a1f0: 9d e3 bf a0 save %sp, -96, %sp 200a1f4: 39 00 80 76 sethi %hi(0x201d800), %i4 200a1f8: fa 07 21 54 ld [ %i4 + 0x154 ], %i5 ! 201d954 <_User_extensions_Switches_list> 200a1fc: b8 17 21 54 or %i4, 0x154, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a200: b8 07 20 04 add %i4, 4, %i4 200a204: 80 a7 40 1c cmp %i5, %i4 200a208: 02 80 00 0a be 200a230 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200a20c: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 200a210: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a214: 90 10 00 18 mov %i0, %o0 200a218: 9f c0 40 00 call %g1 200a21c: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 200a220: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a224: 80 a7 40 1c cmp %i5, %i4 200a228: 32 bf ff fb bne,a 200a214 <_User_extensions_Thread_switch+0x24> 200a22c: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a230: 81 c7 e0 08 ret 200a234: 81 e8 00 00 restore =============================================================================== 0200bcb8 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200bcb8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200bcbc: 7f ff dc 83 call 2002ec8 200bcc0: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200bcc4: 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 ); 200bcc8: b6 06 20 04 add %i0, 4, %i3 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200bccc: 80 a0 40 1b cmp %g1, %i3 200bcd0: 02 80 00 1e be 200bd48 <_Watchdog_Adjust+0x90> 200bcd4: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200bcd8: 12 80 00 1e bne 200bd50 <_Watchdog_Adjust+0x98> 200bcdc: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bce0: 80 a6 a0 00 cmp %i2, 0 200bce4: 02 80 00 19 be 200bd48 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bce8: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bcec: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bcf0: 80 a6 80 1c cmp %i2, %i4 200bcf4: 1a 80 00 0a bcc 200bd1c <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200bcf8: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200bcfc: 10 80 00 1c b 200bd6c <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200bd00: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bd04: 02 80 00 11 be 200bd48 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bd08: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bd0c: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bd10: 80 a7 00 1a cmp %i4, %i2 200bd14: 38 80 00 16 bgu,a 200bd6c <_Watchdog_Adjust+0xb4> 200bd18: b8 27 00 1a sub %i4, %i2, %i4 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200bd1c: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200bd20: 7f ff dc 6e call 2002ed8 200bd24: 01 00 00 00 nop _Watchdog_Tickle( header ); 200bd28: 40 00 00 ab call 200bfd4 <_Watchdog_Tickle> 200bd2c: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200bd30: 7f ff dc 66 call 2002ec8 200bd34: 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; 200bd38: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200bd3c: 80 a6 c0 01 cmp %i3, %g1 200bd40: 32 bf ff f1 bne,a 200bd04 <_Watchdog_Adjust+0x4c> 200bd44: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200bd48: 7f ff dc 64 call 2002ed8 200bd4c: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bd50: 12 bf ff fe bne 200bd48 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bd54: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bd58: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bd5c: b4 00 80 1a add %g2, %i2, %i2 200bd60: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bd64: 7f ff dc 5d call 2002ed8 200bd68: 91 e8 00 08 restore %g0, %o0, %o0 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; 200bd6c: 10 bf ff f7 b 200bd48 <_Watchdog_Adjust+0x90> 200bd70: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200a3c0 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200a3c0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200a3c4: 7f ff df 71 call 2002188 200a3c8: 01 00 00 00 nop previous_state = the_watchdog->state; 200a3cc: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200a3d0: 80 a7 60 01 cmp %i5, 1 200a3d4: 02 80 00 2a be 200a47c <_Watchdog_Remove+0xbc> 200a3d8: 03 00 80 76 sethi %hi(0x201d800), %g1 200a3dc: 1a 80 00 09 bcc 200a400 <_Watchdog_Remove+0x40> 200a3e0: 80 a7 60 03 cmp %i5, 3 _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a3e4: 03 00 80 76 sethi %hi(0x201d800), %g1 200a3e8: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 ! 201da64 <_Watchdog_Ticks_since_boot> 200a3ec: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a3f0: 7f ff df 6a call 2002198 200a3f4: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a3f8: 81 c7 e0 08 ret 200a3fc: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200a400: 18 bf ff fa bgu 200a3e8 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200a404: 03 00 80 76 sethi %hi(0x201d800), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 200a408: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200a40c: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200a410: c4 00 40 00 ld [ %g1 ], %g2 200a414: 80 a0 a0 00 cmp %g2, 0 200a418: 02 80 00 07 be 200a434 <_Watchdog_Remove+0x74> 200a41c: 05 00 80 76 sethi %hi(0x201d800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200a420: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a424: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200a428: 84 00 c0 02 add %g3, %g2, %g2 200a42c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200a430: 05 00 80 76 sethi %hi(0x201d800), %g2 200a434: c4 00 a2 60 ld [ %g2 + 0x260 ], %g2 ! 201da60 <_Watchdog_Sync_count> 200a438: 80 a0 a0 00 cmp %g2, 0 200a43c: 22 80 00 07 be,a 200a458 <_Watchdog_Remove+0x98> 200a440: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200a444: 05 00 80 77 sethi %hi(0x201dc00), %g2 200a448: c6 00 a2 90 ld [ %g2 + 0x290 ], %g3 ! 201de90 <_Per_CPU_Information+0x8> 200a44c: 05 00 80 76 sethi %hi(0x201d800), %g2 200a450: c6 20 a1 f8 st %g3, [ %g2 + 0x1f8 ] ! 201d9f8 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200a454: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200a458: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200a45c: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a460: 03 00 80 76 sethi %hi(0x201d800), %g1 200a464: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 ! 201da64 <_Watchdog_Ticks_since_boot> 200a468: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a46c: 7f ff df 4b call 2002198 200a470: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a474: 81 c7 e0 08 ret 200a478: 81 e8 00 00 restore _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a47c: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 /* * It is not actually on the chain so just change the state and * the Insert operation we interrupted will be aborted. */ the_watchdog->state = WATCHDOG_INACTIVE; 200a480: c0 26 20 08 clr [ %i0 + 8 ] _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a484: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a488: 7f ff df 44 call 2002198 200a48c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a490: 81 c7 e0 08 ret 200a494: 81 e8 00 00 restore =============================================================================== 0200b49c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b49c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b4a0: 7f ff dd 5e call 2002a18 200b4a4: 01 00 00 00 nop 200b4a8: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200b4ac: 11 00 80 75 sethi %hi(0x201d400), %o0 200b4b0: 94 10 00 19 mov %i1, %o2 200b4b4: 92 10 00 18 mov %i0, %o1 200b4b8: 7f ff e4 73 call 2004684 200b4bc: 90 12 22 f8 or %o0, 0x2f8, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b4c0: f8 06 40 00 ld [ %i1 ], %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b4c4: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200b4c8: 80 a7 00 19 cmp %i4, %i1 200b4cc: 02 80 00 0f be 200b508 <_Watchdog_Report_chain+0x6c> 200b4d0: 11 00 80 75 sethi %hi(0x201d400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b4d4: 92 10 00 1c mov %i4, %o1 200b4d8: 40 00 00 0f call 200b514 <_Watchdog_Report> 200b4dc: 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 ) 200b4e0: f8 07 00 00 ld [ %i4 ], %i4 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200b4e4: 80 a7 00 19 cmp %i4, %i1 200b4e8: 12 bf ff fc bne 200b4d8 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b4ec: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b4f0: 11 00 80 75 sethi %hi(0x201d400), %o0 200b4f4: 92 10 00 18 mov %i0, %o1 200b4f8: 7f ff e4 63 call 2004684 200b4fc: 90 12 23 10 or %o0, 0x310, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b500: 7f ff dd 4a call 2002a28 200b504: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b508: 7f ff e4 5f call 2004684 200b50c: 90 12 23 20 or %o0, 0x320, %o0 200b510: 30 bf ff fc b,a 200b500 <_Watchdog_Report_chain+0x64> =============================================================================== 02006434 : int adjtime( struct timeval *delta, struct timeval *olddelta ) { 2006434: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2006438: ba 96 20 00 orcc %i0, 0, %i5 200643c: 02 80 00 54 be 200658c 2006440: 03 00 03 d0 sethi %hi(0xf4000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 2006444: c4 07 60 04 ld [ %i5 + 4 ], %g2 2006448: 82 10 62 3f or %g1, 0x23f, %g1 200644c: 80 a0 80 01 cmp %g2, %g1 2006450: 18 80 00 4f bgu 200658c 2006454: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 2006458: 22 80 00 06 be,a 2006470 200645c: c2 07 40 00 ld [ %i5 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 2006460: c0 26 60 04 clr [ %i1 + 4 ] 2006464: c4 07 60 04 ld [ %i5 + 4 ], %g2 if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { olddelta->tv_sec = 0; 2006468: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 200646c: c2 07 40 00 ld [ %i5 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2006470: 07 00 80 76 sethi %hi(0x201d800), %g3 2006474: c8 00 e2 38 ld [ %g3 + 0x238 ], %g4 ! 201da38 olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2006478: 9f 28 60 08 sll %g1, 8, %o7 200647c: 87 28 60 03 sll %g1, 3, %g3 2006480: 86 23 c0 03 sub %o7, %g3, %g3 2006484: 9f 28 e0 06 sll %g3, 6, %o7 2006488: 86 23 c0 03 sub %o7, %g3, %g3 200648c: 82 00 c0 01 add %g3, %g1, %g1 2006490: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 2006494: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2006498: 80 a0 80 04 cmp %g2, %g4 200649c: 0a 80 00 3a bcs 2006584 20064a0: b0 10 20 00 clr %i0 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20064a4: 03 00 80 7a sethi %hi(0x201e800), %g1 20064a8: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 201e890 <_Thread_Dispatch_disable_level> 20064ac: 84 00 a0 01 inc %g2 20064b0: c4 20 60 90 st %g2, [ %g1 + 0x90 ] return _Thread_Dispatch_disable_level; 20064b4: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 * This prevents context switches while we are adjusting the TOD */ _Thread_Disable_dispatch(); _TOD_Get( &ts ); 20064b8: 40 00 06 6a call 2007e60 <_TOD_Get> 20064bc: 90 07 bf f8 add %fp, -8, %o0 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064c0: c2 07 60 04 ld [ %i5 + 4 ], %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064c4: c8 07 bf f8 ld [ %fp + -8 ], %g4 20064c8: c4 07 40 00 ld [ %i5 ], %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064cc: 87 28 60 02 sll %g1, 2, %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064d0: 84 01 00 02 add %g4, %g2, %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064d4: 89 28 60 07 sll %g1, 7, %g4 20064d8: 86 21 00 03 sub %g4, %g3, %g3 20064dc: 82 00 c0 01 add %g3, %g1, %g1 20064e0: c6 07 bf fc ld [ %fp + -4 ], %g3 20064e4: 83 28 60 03 sll %g1, 3, %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064e8: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064ec: 82 00 40 03 add %g1, %g3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 20064f0: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 20064f4: 86 10 e1 ff or %g3, 0x1ff, %g3 ! 3b9ac9ff 20064f8: 80 a0 40 03 cmp %g1, %g3 20064fc: 08 80 00 0a bleu 2006524 2006500: c2 27 bf fc st %g1, [ %fp + -4 ] ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2006504: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006508: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 200650c: 82 00 40 04 add %g1, %g4, %g1 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2006510: 80 a0 40 03 cmp %g1, %g3 2006514: 18 bf ff fe bgu 200650c <== NEVER TAKEN 2006518: 84 00 a0 01 inc %g2 200651c: c2 27 bf fc st %g1, [ %fp + -4 ] 2006520: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2006524: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006528: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 200652c: 80 a0 40 04 cmp %g1, %g4 2006530: 18 80 00 0a bgu 2006558 <== NEVER TAKEN 2006534: c4 07 bf f8 ld [ %fp + -8 ], %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2006538: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 200653c: 86 10 e2 00 or %g3, 0x200, %g3 ! 3b9aca00 2006540: 82 00 40 03 add %g1, %g3, %g1 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2006544: 80 a0 40 04 cmp %g1, %g4 2006548: 08 bf ff fe bleu 2006540 200654c: 84 00 bf ff add %g2, -1, %g2 2006550: c2 27 bf fc st %g1, [ %fp + -4 ] 2006554: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; ts.tv_sec--; } _TOD_Set( &ts ); 2006558: 40 00 06 6c call 2007f08 <_TOD_Set> 200655c: 90 07 bf f8 add %fp, -8, %o0 _Thread_Enable_dispatch(); 2006560: 40 00 0c da call 20098c8 <_Thread_Enable_dispatch> 2006564: b0 10 20 00 clr %i0 /* set the user's output */ if ( olddelta ) 2006568: 80 a6 60 00 cmp %i1, 0 200656c: 02 80 00 0c be 200659c 2006570: 01 00 00 00 nop *olddelta = *delta; 2006574: c2 07 40 00 ld [ %i5 ], %g1 2006578: c2 26 40 00 st %g1, [ %i1 ] 200657c: c2 07 60 04 ld [ %i5 + 4 ], %g1 2006580: c2 26 60 04 st %g1, [ %i1 + 4 ] return 0; } 2006584: 81 c7 e0 08 ret 2006588: 81 e8 00 00 restore */ if ( !delta ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); 200658c: 40 00 26 b9 call 2010070 <__errno> 2006590: b0 10 3f ff mov -1, %i0 2006594: 82 10 20 16 mov 0x16, %g1 2006598: c2 22 00 00 st %g1, [ %o0 ] 200659c: 81 c7 e0 08 ret 20065a0: 81 e8 00 00 restore =============================================================================== 02006ca4 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2006ca4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2006ca8: 3b 00 80 66 sethi %hi(0x2019800), %i5 2006cac: 40 00 04 91 call 2007ef0 2006cb0: 90 17 63 7c or %i5, 0x37c, %o0 ! 2019b7c if (fcntl (fildes, F_GETFD) < 0) { 2006cb4: 90 10 00 18 mov %i0, %o0 2006cb8: 40 00 1e 90 call 200e6f8 2006cbc: 92 10 20 01 mov 1, %o1 2006cc0: 80 a2 20 00 cmp %o0, 0 2006cc4: 06 80 00 6c bl 2006e74 2006cc8: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EBADF); } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 2006ccc: 02 80 00 3b be 2006db8 2006cd0: 92 10 00 18 mov %i0, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2006cd4: f8 06 40 00 ld [ %i1 ], %i4 2006cd8: 80 a7 00 18 cmp %i4, %i0 2006cdc: 12 80 00 2f bne 2006d98 2006ce0: 90 17 63 7c or %i5, 0x37c, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 2006ce4: 92 10 00 1c mov %i4, %o1 2006ce8: 11 00 80 66 sethi %hi(0x2019800), %o0 2006cec: 94 10 20 00 clr %o2 2006cf0: 40 00 00 cc call 2007020 2006cf4: 90 12 23 c4 or %o0, 0x3c4, %o0 if (r_chain == NULL) { 2006cf8: b0 92 20 00 orcc %o0, 0, %i0 2006cfc: 22 80 00 0f be,a 2006d38 2006d00: ba 17 63 7c or %i5, 0x37c, %i5 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006d04: b8 06 20 1c add %i0, 0x1c, %i4 2006d08: 40 00 04 7a call 2007ef0 2006d0c: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006d10: 92 10 00 19 mov %i1, %o1 2006d14: 40 00 01 e4 call 20074a4 2006d18: 90 06 20 08 add %i0, 8, %o0 2006d1c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2006d20: 40 00 04 94 call 2007f70 2006d24: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006d28: 40 00 04 92 call 2007f70 2006d2c: 90 17 63 7c or %i5, 0x37c, %o0 return result; } return AIO_ALLDONE; } 2006d30: 81 c7 e0 08 ret 2006d34: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006d38: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006d3c: 82 07 60 58 add %i5, 0x58, %g1 2006d40: 80 a0 80 01 cmp %g2, %g1 2006d44: 02 80 00 0f be 2006d80 <== NEVER TAKEN 2006d48: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006d4c: 92 10 00 1c mov %i4, %o1 2006d50: 40 00 00 b4 call 2007020 2006d54: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006d58: 80 a2 20 00 cmp %o0, 0 2006d5c: 02 80 00 0e be 2006d94 2006d60: 92 10 00 19 mov %i1, %o1 rtems_set_errno_and_return_minus_one (EINVAL); } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006d64: 40 00 01 d0 call 20074a4 2006d68: 90 02 20 08 add %o0, 8, %o0 2006d6c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006d70: 40 00 04 80 call 2007f70 2006d74: 90 10 00 1d mov %i5, %o0 return result; 2006d78: 81 c7 e0 08 ret 2006d7c: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006d80: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006d84: 40 00 04 7b call 2007f70 2006d88: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006d8c: 81 c7 e0 08 ret 2006d90: 81 e8 00 00 restore r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock (&aio_request_queue.mutex); 2006d94: 90 10 00 1d mov %i5, %o0 2006d98: 40 00 04 76 call 2007f70 2006d9c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2006da0: 40 00 2c aa call 2012048 <__errno> 2006da4: 01 00 00 00 nop 2006da8: 82 10 20 16 mov 0x16, %g1 ! 16 2006dac: c2 22 00 00 st %g1, [ %o0 ] 2006db0: 81 c7 e0 08 ret 2006db4: 81 e8 00 00 restore /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { AIO_printf ("Cancel all requests\n"); r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 2006db8: 11 00 80 66 sethi %hi(0x2019800), %o0 2006dbc: 94 10 20 00 clr %o2 2006dc0: 40 00 00 98 call 2007020 2006dc4: 90 12 23 c4 or %o0, 0x3c4, %o0 if (r_chain == NULL) { 2006dc8: b8 92 20 00 orcc %o0, 0, %i4 2006dcc: 02 80 00 0f be 2006e08 2006dd0: b2 07 20 1c add %i4, 0x1c, %i1 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006dd4: 40 00 04 47 call 2007ef0 2006dd8: 90 10 00 19 mov %i1, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006ddc: 40 00 0b 02 call 20099e4 <_Chain_Extract> 2006de0: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006de4: 40 00 01 9c call 2007454 2006de8: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2006dec: 40 00 04 61 call 2007f70 2006df0: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006df4: 90 17 63 7c or %i5, 0x37c, %o0 2006df8: 40 00 04 5e call 2007f70 2006dfc: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006e00: 81 c7 e0 08 ret 2006e04: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2006e08: ba 17 63 7c or %i5, 0x37c, %i5 r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006e0c: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006e10: 82 07 60 58 add %i5, 0x58, %g1 2006e14: 80 a0 80 01 cmp %g2, %g1 2006e18: 02 bf ff da be 2006d80 <== NEVER TAKEN 2006e1c: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006e20: 92 10 00 18 mov %i0, %o1 2006e24: 40 00 00 7f call 2007020 2006e28: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006e2c: b8 92 20 00 orcc %o0, 0, %i4 2006e30: 22 bf ff d5 be,a 2006d84 2006e34: 90 10 00 1d mov %i5, %o0 2006e38: 40 00 0a eb call 20099e4 <_Chain_Extract> 2006e3c: b2 07 20 1c add %i4, 0x1c, %i1 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006e40: 40 00 01 85 call 2007454 2006e44: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006e48: 40 00 03 7f call 2007c44 2006e4c: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 2006e50: 40 00 02 9e call 20078c8 2006e54: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006e58: 7f ff f2 03 call 2003664 2006e5c: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2006e60: b0 10 20 00 clr %i0 rtems_aio_remove_fd (r_chain); pthread_mutex_destroy (&r_chain->mutex); pthread_cond_destroy (&r_chain->mutex); free (r_chain); pthread_mutex_unlock (&aio_request_queue.mutex); 2006e64: 40 00 04 43 call 2007f70 2006e68: 90 10 00 1d mov %i5, %o0 return AIO_CANCELED; 2006e6c: 81 c7 e0 08 ret 2006e70: 81 e8 00 00 restore int result; pthread_mutex_lock (&aio_request_queue.mutex); if (fcntl (fildes, F_GETFD) < 0) { pthread_mutex_unlock(&aio_request_queue.mutex); 2006e74: 40 00 04 3f call 2007f70 2006e78: 90 17 63 7c or %i5, 0x37c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2006e7c: 40 00 2c 73 call 2012048 <__errno> 2006e80: b0 10 3f ff mov -1, %i0 2006e84: 82 10 20 09 mov 9, %g1 2006e88: c2 22 00 00 st %g1, [ %o0 ] 2006e8c: 81 c7 e0 08 ret 2006e90: 81 e8 00 00 restore =============================================================================== 02006e9c : int aio_fsync( int op, struct aiocb *aiocbp ) { 2006e9c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2006ea0: 03 00 00 08 sethi %hi(0x2000), %g1 2006ea4: 80 a6 00 01 cmp %i0, %g1 2006ea8: 12 80 00 14 bne 2006ef8 2006eac: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006eb0: d0 06 40 00 ld [ %i1 ], %o0 2006eb4: 40 00 1e 11 call 200e6f8 2006eb8: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2006ebc: 90 0a 20 03 and %o0, 3, %o0 2006ec0: 90 02 3f ff add %o0, -1, %o0 2006ec4: 80 a2 20 01 cmp %o0, 1 2006ec8: 18 80 00 0c bgu 2006ef8 2006ecc: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2006ed0: 7f ff f3 70 call 2003c90 2006ed4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2006ed8: 80 a2 20 00 cmp %o0, 0 2006edc: 02 80 00 06 be 2006ef4 <== NEVER TAKEN 2006ee0: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2006ee4: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2006ee8: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2006eec: 40 00 01 8a call 2007514 2006ef0: 91 e8 00 08 restore %g0, %o0, %o0 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2006ef4: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2006ef8: 82 10 3f ff mov -1, %g1 2006efc: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2006f00: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2006f04: 40 00 2c 51 call 2012048 <__errno> 2006f08: b0 10 3f ff mov -1, %i0 2006f0c: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2006f10: 81 c7 e0 08 ret 2006f14: 81 e8 00 00 restore =============================================================================== 020076f8 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20076f8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20076fc: d0 06 00 00 ld [ %i0 ], %o0 2007700: 40 00 1b fe call 200e6f8 2007704: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007708: 90 0a 20 03 and %o0, 3, %o0 200770c: 80 a2 20 02 cmp %o0, 2 2007710: 12 80 00 1b bne 200777c 2007714: 80 a2 20 00 cmp %o0, 0 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2007718: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200771c: 80 a0 60 00 cmp %g1, 0 2007720: 12 80 00 0f bne 200775c 2007724: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007728: c2 06 20 08 ld [ %i0 + 8 ], %g1 200772c: 80 a0 60 00 cmp %g1, 0 2007730: 06 80 00 0c bl 2007760 2007734: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007738: 7f ff f1 56 call 2003c90 200773c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007740: 80 a2 20 00 cmp %o0, 0 2007744: 02 80 00 12 be 200778c <== NEVER TAKEN 2007748: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 200774c: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2007750: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007754: 7f ff ff 70 call 2007514 2007758: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 200775c: 82 10 3f ff mov -1, %g1 2007760: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007764: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2007768: 40 00 2a 38 call 2012048 <__errno> 200776c: b0 10 3f ff mov -1, %i0 2007770: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2007774: 81 c7 e0 08 ret 2007778: 81 e8 00 00 restore { rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 200777c: 02 bf ff e7 be 2007718 <== NEVER TAKEN 2007780: ba 10 20 09 mov 9, %i5 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007784: 10 bf ff f7 b 2007760 2007788: 82 10 3f ff mov -1, %g1 200778c: 10 bf ff f4 b 200775c <== NOT EXECUTED 2007790: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 0200779c : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 200779c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20077a0: d0 06 00 00 ld [ %i0 ], %o0 20077a4: 40 00 1b d5 call 200e6f8 20077a8: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20077ac: 90 0a 20 03 and %o0, 3, %o0 20077b0: 90 02 3f ff add %o0, -1, %o0 20077b4: 80 a2 20 01 cmp %o0, 1 20077b8: 18 80 00 14 bgu 2007808 20077bc: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 20077c0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20077c4: 80 a0 60 00 cmp %g1, 0 20077c8: 12 80 00 10 bne 2007808 20077cc: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20077d0: c2 06 20 08 ld [ %i0 + 8 ], %g1 20077d4: 80 a0 60 00 cmp %g1, 0 20077d8: 06 80 00 0d bl 200780c 20077dc: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20077e0: 7f ff f1 2c call 2003c90 20077e4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20077e8: 80 a2 20 00 cmp %o0, 0 20077ec: 02 80 00 06 be 2007804 <== NEVER TAKEN 20077f0: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20077f4: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 20077f8: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20077fc: 7f ff ff 46 call 2007514 2007800: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007804: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2007808: 82 10 3f ff mov -1, %g1 200780c: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007810: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2007814: 40 00 2a 0d call 2012048 <__errno> 2007818: b0 10 3f ff mov -1, %i0 200781c: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2007820: 81 c7 e0 08 ret 2007824: 81 e8 00 00 restore =============================================================================== 0200629c : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 200629c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 20062a0: 80 a6 60 00 cmp %i1, 0 20062a4: 02 80 00 20 be 2006324 20062a8: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 20062ac: 02 80 00 19 be 2006310 20062b0: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 20062b4: 02 80 00 12 be 20062fc <== NEVER TAKEN 20062b8: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { 20062bc: 02 80 00 10 be 20062fc 20062c0: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) 20062c4: 02 80 00 08 be 20062e4 20062c8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 20062cc: 40 00 28 f2 call 2010694 <__errno> 20062d0: b0 10 3f ff mov -1, %i0 ! ffffffff 20062d4: 82 10 20 16 mov 0x16, %g1 20062d8: c2 22 00 00 st %g1, [ %o0 ] return 0; } 20062dc: 81 c7 e0 08 ret 20062e0: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); 20062e4: 40 00 28 ec call 2010694 <__errno> 20062e8: b0 10 3f ff mov -1, %i0 20062ec: 82 10 20 58 mov 0x58, %g1 20062f0: c2 22 00 00 st %g1, [ %o0 ] 20062f4: 81 c7 e0 08 ret 20062f8: 81 e8 00 00 restore } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { _TOD_Get_uptime_as_timespec( tp ); 20062fc: 90 10 00 19 mov %i1, %o0 2006300: 40 00 08 35 call 20083d4 <_TOD_Get_uptime_as_timespec> 2006304: b0 10 20 00 clr %i0 return 0; 2006308: 81 c7 e0 08 ret 200630c: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); 2006310: 90 10 00 19 mov %i1, %o0 2006314: 40 00 08 15 call 2008368 <_TOD_Get> 2006318: b0 10 20 00 clr %i0 return 0; 200631c: 81 c7 e0 08 ret 2006320: 81 e8 00 00 restore clockid_t clock_id, struct timespec *tp ) { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006324: 40 00 28 dc call 2010694 <__errno> 2006328: b0 10 3f ff mov -1, %i0 200632c: 82 10 20 16 mov 0x16, %g1 2006330: c2 22 00 00 st %g1, [ %o0 ] 2006334: 81 c7 e0 08 ret 2006338: 81 e8 00 00 restore =============================================================================== 0200633c : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 200633c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2006340: 80 a6 60 00 cmp %i1, 0 2006344: 02 80 00 25 be 20063d8 <== NEVER TAKEN 2006348: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 200634c: 02 80 00 0c be 200637c 2006350: 80 a6 20 02 cmp %i0, 2 _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME ) 2006354: 02 80 00 1b be 20063c0 2006358: 80 a6 20 03 cmp %i0, 3 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME ) 200635c: 02 80 00 19 be 20063c0 2006360: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2006364: 40 00 28 cc call 2010694 <__errno> 2006368: b0 10 3f ff mov -1, %i0 ! ffffffff 200636c: 82 10 20 16 mov 0x16, %g1 2006370: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2006374: 81 c7 e0 08 ret 2006378: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 200637c: c4 06 40 00 ld [ %i1 ], %g2 2006380: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2006384: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2006388: 80 a0 80 01 cmp %g2, %g1 200638c: 08 80 00 13 bleu 20063d8 2006390: 03 00 80 7d sethi %hi(0x201f400), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006394: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201f420 <_Thread_Dispatch_disable_level> 2006398: 84 00 a0 01 inc %g2 200639c: c4 20 60 20 st %g2, [ %g1 + 0x20 ] return _Thread_Dispatch_disable_level; 20063a0: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); 20063a4: 90 10 00 19 mov %i1, %o0 20063a8: 40 00 08 23 call 2008434 <_TOD_Set> 20063ac: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20063b0: 40 00 0e 91 call 2009df4 <_Thread_Enable_dispatch> 20063b4: 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; 20063b8: 81 c7 e0 08 ret 20063bc: 81 e8 00 00 restore else if ( clock_id == CLOCK_PROCESS_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME ) rtems_set_errno_and_return_minus_one( ENOSYS ); 20063c0: 40 00 28 b5 call 2010694 <__errno> 20063c4: b0 10 3f ff mov -1, %i0 20063c8: 82 10 20 58 mov 0x58, %g1 20063cc: c2 22 00 00 st %g1, [ %o0 ] 20063d0: 81 c7 e0 08 ret 20063d4: 81 e8 00 00 restore if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); 20063d8: 40 00 28 af call 2010694 <__errno> 20063dc: b0 10 3f ff mov -1, %i0 20063e0: 82 10 20 16 mov 0x16, %g1 20063e4: c2 22 00 00 st %g1, [ %o0 ] 20063e8: 81 c7 e0 08 ret 20063ec: 81 e8 00 00 restore =============================================================================== 0201a3cc : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201a3cc: 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() ) 201a3d0: 7f ff fe e2 call 2019f58 201a3d4: 01 00 00 00 nop 201a3d8: 80 a2 00 18 cmp %o0, %i0 201a3dc: 12 80 00 af bne 201a698 201a3e0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201a3e4: 02 80 00 b3 be 201a6b0 201a3e8: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a3ec: 80 a0 60 1f cmp %g1, 0x1f 201a3f0: 18 80 00 b0 bgu 201a6b0 201a3f4: b7 2e 60 02 sll %i1, 2, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 201a3f8: 39 00 80 77 sethi %hi(0x201dc00), %i4 201a3fc: a1 2e 60 04 sll %i1, 4, %l0 201a400: b8 17 22 e0 or %i4, 0x2e0, %i4 201a404: 84 24 00 1b sub %l0, %i3, %g2 201a408: 84 07 00 02 add %i4, %g2, %g2 201a40c: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201a410: 80 a0 a0 01 cmp %g2, 1 201a414: 02 80 00 3f be 201a510 201a418: b0 10 20 00 clr %i0 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 201a41c: 80 a6 60 04 cmp %i1, 4 201a420: 02 80 00 3e be 201a518 201a424: 80 a6 60 08 cmp %i1, 8 201a428: 02 80 00 3c be 201a518 201a42c: 80 a6 60 0b cmp %i1, 0xb 201a430: 02 80 00 3a be 201a518 201a434: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201a438: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201a43c: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201a440: 80 a6 a0 00 cmp %i2, 0 201a444: 02 80 00 3b be 201a530 201a448: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201a44c: c2 06 80 00 ld [ %i2 ], %g1 201a450: 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++; 201a454: 03 00 80 76 sethi %hi(0x201d800), %g1 201a458: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201d950 <_Thread_Dispatch_disable_level> 201a45c: 84 00 a0 01 inc %g2 201a460: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 201a464: c2 00 61 50 ld [ %g1 + 0x150 ], %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; 201a468: 03 00 80 77 sethi %hi(0x201dc00), %g1 201a46c: d0 00 62 94 ld [ %g1 + 0x294 ], %o0 ! 201de94 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201a470: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201a474: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201a478: 80 af 40 01 andncc %i5, %g1, %g0 201a47c: 12 80 00 16 bne 201a4d4 201a480: 07 00 80 78 sethi %hi(0x201e000), %g3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201a484: d0 00 e0 6c ld [ %g3 + 0x6c ], %o0 ! 201e06c <_POSIX_signals_Wait_queue> 201a488: 86 10 e0 6c or %g3, 0x6c, %g3 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201a48c: 86 00 e0 04 add %g3, 4, %g3 201a490: 80 a2 00 03 cmp %o0, %g3 201a494: 32 80 00 0d bne,a 201a4c8 201a498: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a49c: 10 80 00 27 b 201a538 201a4a0: 03 00 80 73 sethi %hi(0x201cc00), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201a4a4: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1 201a4a8: 80 af 40 01 andncc %i5, %g1, %g0 201a4ac: 12 80 00 0b bne 201a4d8 201a4b0: 92 10 00 19 mov %i1, %o1 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201a4b4: d0 02 00 00 ld [ %o0 ], %o0 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201a4b8: 80 a2 00 03 cmp %o0, %g3 201a4bc: 02 80 00 1f be 201a538 <== ALWAYS TAKEN 201a4c0: 03 00 80 73 sethi %hi(0x201cc00), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201a4c4: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 201a4c8: 80 8f 40 01 btst %i5, %g1 201a4cc: 02 bf ff f6 be 201a4a4 201a4d0: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201a4d4: 92 10 00 19 mov %i1, %o1 201a4d8: 40 00 00 8d call 201a70c <_POSIX_signals_Unblock_thread> 201a4dc: 94 07 bf f4 add %fp, -12, %o2 201a4e0: 80 8a 20 ff btst 0xff, %o0 201a4e4: 12 80 00 5a bne 201a64c 201a4e8: 01 00 00 00 nop /* * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); 201a4ec: 40 00 00 7f call 201a6e8 <_POSIX_signals_Set_process_signals> 201a4f0: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201a4f4: b6 24 00 1b sub %l0, %i3, %i3 201a4f8: c2 07 00 1b ld [ %i4 + %i3 ], %g1 201a4fc: 80 a0 60 02 cmp %g1, 2 201a500: 02 80 00 57 be 201a65c 201a504: 11 00 80 78 sethi %hi(0x201e000), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 201a508: 7f ff bb 61 call 200928c <_Thread_Enable_dispatch> 201a50c: b0 10 20 00 clr %i0 return 0; } 201a510: 81 c7 e0 08 ret 201a514: 81 e8 00 00 restore * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) return pthread_kill( pthread_self(), sig ); 201a518: 40 00 01 0f call 201a954 201a51c: 01 00 00 00 nop 201a520: 40 00 00 d2 call 201a868 201a524: 92 10 00 19 mov %i1, %o1 201a528: 81 c7 e0 08 ret 201a52c: 91 e8 00 08 restore %g0, %o0, %o0 */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; if ( !value ) { siginfo->si_value.sival_int = 0; 201a530: 10 bf ff c9 b 201a454 201a534: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a538: c8 08 60 2c ldub [ %g1 + 0x2c ], %g4 201a53c: 1b 00 80 76 sethi %hi(0x201d800), %o5 201a540: 88 01 20 01 inc %g4 201a544: 9a 13 60 c0 or %o5, 0xc0, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201a548: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201a54c: 98 03 60 08 add %o5, 8, %o4 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 201a550: 15 04 00 00 sethi %hi(0x10000000), %o2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 201a554: c2 03 40 00 ld [ %o5 ], %g1 201a558: 80 a0 60 00 cmp %g1, 0 201a55c: 22 80 00 31 be,a 201a620 <== NEVER TAKEN 201a560: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201a564: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201a568: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a56c: 80 a6 a0 00 cmp %i2, 0 201a570: 02 80 00 2b be 201a61c 201a574: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 201a578: 82 10 20 01 mov 1, %g1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201a57c: 85 28 60 02 sll %g1, 2, %g2 maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { the_thread = (Thread_Control *) object_table[ index ]; 201a580: c4 06 00 02 ld [ %i0 + %g2 ], %g2 if ( !the_thread ) 201a584: 80 a0 a0 00 cmp %g2, 0 201a588: 22 80 00 22 be,a 201a610 201a58c: 82 00 60 01 inc %g1 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201a590: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 201a594: 80 a0 c0 04 cmp %g3, %g4 201a598: 38 80 00 1e bgu,a 201a610 201a59c: 82 00 60 01 inc %g1 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201a5a0: de 00 a1 5c ld [ %g2 + 0x15c ], %o7 201a5a4: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201a5a8: 80 af 40 0f andncc %i5, %o7, %g0 201a5ac: 22 80 00 19 be,a 201a610 201a5b0: 82 00 60 01 inc %g1 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 201a5b4: 80 a0 c0 04 cmp %g3, %g4 201a5b8: 2a 80 00 14 bcs,a 201a608 201a5bc: 88 10 00 03 mov %g3, %g4 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201a5c0: 80 a2 20 00 cmp %o0, 0 201a5c4: 22 80 00 13 be,a 201a610 <== NEVER TAKEN 201a5c8: 82 00 60 01 inc %g1 <== NOT EXECUTED 201a5cc: de 02 20 10 ld [ %o0 + 0x10 ], %o7 201a5d0: 80 a3 e0 00 cmp %o7, 0 201a5d4: 22 80 00 0f be,a 201a610 <== NEVER TAKEN 201a5d8: 82 00 60 01 inc %g1 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201a5dc: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3 201a5e0: 80 a2 e0 00 cmp %o3, 0 201a5e4: 22 80 00 09 be,a 201a608 201a5e8: 88 10 00 03 mov %g3, %g4 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201a5ec: 80 8b c0 0a btst %o7, %o2 201a5f0: 32 80 00 08 bne,a 201a610 201a5f4: 82 00 60 01 inc %g1 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201a5f8: 80 8a c0 0a btst %o3, %o2 201a5fc: 22 80 00 05 be,a 201a610 201a600: 82 00 60 01 inc %g1 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201a604: 88 10 00 03 mov %g3, %g4 201a608: 90 10 00 02 mov %g2, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a60c: 82 00 60 01 inc %g1 201a610: 80 a6 80 01 cmp %i2, %g1 201a614: 1a bf ff db bcc 201a580 201a618: 85 28 60 02 sll %g1, 2, %g2 201a61c: 9a 03 60 04 add %o5, 4, %o5 * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201a620: 80 a3 40 0c cmp %o5, %o4 201a624: 32 bf ff cd bne,a 201a558 201a628: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201a62c: 80 a2 20 00 cmp %o0, 0 201a630: 02 bf ff af be 201a4ec 201a634: 92 10 00 19 mov %i1, %o1 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201a638: 40 00 00 35 call 201a70c <_POSIX_signals_Unblock_thread> 201a63c: 94 07 bf f4 add %fp, -12, %o2 201a640: 80 8a 20 ff btst 0xff, %o0 201a644: 02 bf ff aa be 201a4ec <== ALWAYS TAKEN 201a648: 01 00 00 00 nop _Thread_Enable_dispatch(); 201a64c: 7f ff bb 10 call 200928c <_Thread_Enable_dispatch> 201a650: b0 10 20 00 clr %i0 ! 0 return 0; 201a654: 81 c7 e0 08 ret 201a658: 81 e8 00 00 restore */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 201a65c: 7f ff b3 63 call 20073e8 <_Chain_Get> 201a660: 90 12 20 60 or %o0, 0x60, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201a664: 92 92 20 00 orcc %o0, 0, %o1 201a668: 02 80 00 18 be 201a6c8 201a66c: c2 07 bf f4 ld [ %fp + -12 ], %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a670: 11 00 80 78 sethi %hi(0x201e000), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201a674: c2 22 60 08 st %g1, [ %o1 + 8 ] 201a678: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a67c: 90 12 20 d8 or %o0, 0xd8, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201a680: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201a684: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a688: 90 02 00 1b add %o0, %i3, %o0 201a68c: 7f ff b3 43 call 2007398 <_Chain_Append> 201a690: c2 22 60 10 st %g1, [ %o1 + 0x10 ] 201a694: 30 bf ff 9d b,a 201a508 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201a698: 7f ff d4 a5 call 200f92c <__errno> 201a69c: b0 10 3f ff mov -1, %i0 201a6a0: 82 10 20 03 mov 3, %g1 201a6a4: c2 22 00 00 st %g1, [ %o0 ] 201a6a8: 81 c7 e0 08 ret 201a6ac: 81 e8 00 00 restore */ if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201a6b0: 7f ff d4 9f call 200f92c <__errno> 201a6b4: b0 10 3f ff mov -1, %i0 201a6b8: 82 10 20 16 mov 0x16, %g1 201a6bc: c2 22 00 00 st %g1, [ %o0 ] 201a6c0: 81 c7 e0 08 ret 201a6c4: 81 e8 00 00 restore if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { _Thread_Enable_dispatch(); 201a6c8: 7f ff ba f1 call 200928c <_Thread_Enable_dispatch> 201a6cc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201a6d0: 7f ff d4 97 call 200f92c <__errno> 201a6d4: 01 00 00 00 nop 201a6d8: 82 10 20 0b mov 0xb, %g1 ! b 201a6dc: c2 22 00 00 st %g1, [ %o0 ] 201a6e0: 81 c7 e0 08 ret 201a6e4: 81 e8 00 00 restore =============================================================================== 0200b0a8 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 200b0a8: 9d e3 bf 90 save %sp, -112, %sp /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200b0ac: 03 00 80 9d sethi %hi(0x2027400), %g1 200b0b0: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 2027420 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200b0b4: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200b0b8: 84 00 a0 01 inc %g2 200b0bc: c4 20 60 20 st %g2, [ %g1 + 0x20 ] return _Thread_Dispatch_disable_level; 200b0c0: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 200b0c4: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200b0c8: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200b0cc: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Message_queue_Control_fd *the_mq_fd; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200b0d0: a0 8e 62 00 andcc %i1, 0x200, %l0 200b0d4: 12 80 00 34 bne 200b1a4 200b0d8: b4 10 20 00 clr %i2 */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 200b0dc: 39 00 80 9e sethi %hi(0x2027800), %i4 200b0e0: 40 00 0c 3b call 200e1cc <_Objects_Allocate> 200b0e4: 90 17 20 ec or %i4, 0xec, %o0 ! 20278ec <_POSIX_Message_queue_Information_fds> attr = (struct mq_attr *) va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200b0e8: ba 92 20 00 orcc %o0, 0, %i5 200b0ec: 02 80 00 37 be 200b1c8 <== NEVER TAKEN 200b0f0: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 200b0f4: f2 27 60 14 st %i1, [ %i5 + 0x14 ] status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id ); 200b0f8: 90 10 00 18 mov %i0, %o0 200b0fc: 40 00 1e ae call 2012bb4 <_POSIX_Message_queue_Name_to_id> 200b100: 92 07 bf f4 add %fp, -12, %o1 * If the name to id translation worked, then the message queue exists * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "message queue does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 200b104: b6 92 20 00 orcc %o0, 0, %i3 200b108: 22 80 00 0f be,a 200b144 200b10c: 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) ) ) { 200b110: 80 a6 e0 02 cmp %i3, 2 200b114: 02 80 00 40 be 200b214 200b118: 80 a4 20 00 cmp %l0, 0 RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 200b11c: 90 17 20 ec or %i4, 0xec, %o0 200b120: 40 00 0d 15 call 200e574 <_Objects_Free> 200b124: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200b128: 40 00 11 2f call 200f5e4 <_Thread_Enable_dispatch> 200b12c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 200b130: 40 00 2d 51 call 2016674 <__errno> 200b134: 01 00 00 00 nop 200b138: f6 22 00 00 st %i3, [ %o0 ] 200b13c: 81 c7 e0 08 ret 200b140: 81 e8 00 00 restore } else { /* name -> ID translation succeeded */ /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 200b144: 80 a6 6a 00 cmp %i1, 0xa00 200b148: 02 80 00 28 be 200b1e8 200b14c: d2 07 bf f4 ld [ %fp + -12 ], %o1 RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get ( Objects_Id id, Objects_Locations *location ) { return (POSIX_Message_queue_Control *) 200b150: 94 07 bf fc add %fp, -4, %o2 200b154: 11 00 80 9d sethi %hi(0x2027400), %o0 200b158: 40 00 0d 68 call 200e6f8 <_Objects_Get> 200b15c: 90 12 23 60 or %o0, 0x360, %o0 ! 2027760 <_POSIX_Message_queue_Information> /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); the_mq->open_count += 1; 200b160: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b164: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 200b168: 84 00 a0 01 inc %g2 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b16c: b8 17 20 ec or %i4, 0xec, %i4 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); the_mq->open_count += 1; 200b170: c4 22 20 18 st %g2, [ %o0 + 0x18 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b174: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); 200b178: d0 27 bf f8 st %o0, [ %fp + -8 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 200b17c: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 200b180: 83 28 60 02 sll %g1, 2, %g1 200b184: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b188: 40 00 11 17 call 200f5e4 <_Thread_Enable_dispatch> 200b18c: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 200b190: 40 00 11 15 call 200f5e4 <_Thread_Enable_dispatch> 200b194: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 200b198: f0 07 60 08 ld [ %i5 + 8 ], %i0 200b19c: 81 c7 e0 08 ret 200b1a0: 81 e8 00 00 restore _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); attr = (struct mq_attr *) va_arg( arg, struct mq_attr * ); 200b1a4: 82 07 a0 54 add %fp, 0x54, %g1 200b1a8: f4 07 a0 50 ld [ %fp + 0x50 ], %i2 200b1ac: c2 27 bf f0 st %g1, [ %fp + -16 ] */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 200b1b0: 39 00 80 9e sethi %hi(0x2027800), %i4 200b1b4: 40 00 0c 06 call 200e1cc <_Objects_Allocate> 200b1b8: 90 17 20 ec or %i4, 0xec, %o0 ! 20278ec <_POSIX_Message_queue_Information_fds> va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200b1bc: ba 92 20 00 orcc %o0, 0, %i5 200b1c0: 32 bf ff ce bne,a 200b0f8 200b1c4: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 200b1c8: 40 00 11 07 call 200f5e4 <_Thread_Enable_dispatch> 200b1cc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 200b1d0: 40 00 2d 29 call 2016674 <__errno> 200b1d4: 01 00 00 00 nop 200b1d8: 82 10 20 17 mov 0x17, %g1 ! 17 200b1dc: c2 22 00 00 st %g1, [ %o0 ] 200b1e0: 81 c7 e0 08 ret 200b1e4: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 200b1e8: 90 17 20 ec or %i4, 0xec, %o0 200b1ec: 40 00 0c e2 call 200e574 <_Objects_Free> 200b1f0: 92 10 00 1d mov %i5, %o1 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200b1f4: 40 00 10 fc call 200f5e4 <_Thread_Enable_dispatch> 200b1f8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 200b1fc: 40 00 2d 1e call 2016674 <__errno> 200b200: 01 00 00 00 nop 200b204: 82 10 20 11 mov 0x11, %g1 ! 11 200b208: c2 22 00 00 st %g1, [ %o0 ] 200b20c: 81 c7 e0 08 ret 200b210: 81 e8 00 00 restore if ( status ) { /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 200b214: 02 bf ff c3 be 200b120 200b218: 90 17 20 ec or %i4, 0xec, %o0 /* * At this point, the message queue does not exist and everything has been * checked. We should go ahead and create a message queue. */ status = _POSIX_Message_queue_Create_support( 200b21c: 90 10 00 18 mov %i0, %o0 200b220: 92 10 20 01 mov 1, %o1 200b224: 94 10 00 1a mov %i2, %o2 200b228: 40 00 1d fe call 2012a20 <_POSIX_Message_queue_Create_support> 200b22c: 96 07 bf f8 add %fp, -8, %o3 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 200b230: 80 a2 3f ff cmp %o0, -1 200b234: 02 80 00 0d be 200b268 200b238: c6 07 bf f8 ld [ %fp + -8 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b23c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b240: b8 17 20 ec or %i4, 0xec, %i4 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b244: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); return (mqd_t) -1; } the_mq_fd->Queue = the_mq; 200b248: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200b24c: 83 28 60 02 sll %g1, 2, %g1 200b250: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b254: 40 00 10 e4 call 200f5e4 <_Thread_Enable_dispatch> 200b258: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 200b25c: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 200b260: 81 c7 e0 08 ret 200b264: 81 e8 00 00 restore 200b268: 90 17 20 ec or %i4, 0xec, %o0 200b26c: 92 10 00 1d mov %i5, %o1 200b270: 40 00 0c c1 call 200e574 <_Objects_Free> 200b274: b0 10 3f ff mov -1, %i0 /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200b278: 40 00 10 db call 200f5e4 <_Thread_Enable_dispatch> 200b27c: 01 00 00 00 nop return (mqd_t) -1; 200b280: 81 c7 e0 08 ret 200b284: 81 e8 00 00 restore =============================================================================== 0200b90c : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b90c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b910: 80 a0 60 00 cmp %g1, 0 200b914: 02 80 00 06 be 200b92c 200b918: 90 10 20 16 mov 0x16, %o0 200b91c: c4 00 40 00 ld [ %g1 ], %g2 200b920: 80 a0 a0 00 cmp %g2, 0 200b924: 12 80 00 04 bne 200b934 200b928: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200b92c: 81 c3 e0 08 retl 200b930: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200b934: 18 80 00 09 bgu 200b958 200b938: 84 10 20 01 mov 1, %g2 ! 1 200b93c: 85 28 80 09 sll %g2, %o1, %g2 200b940: 80 88 a0 17 btst 0x17, %g2 200b944: 02 80 00 05 be 200b958 <== NEVER TAKEN 200b948: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b94c: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200b950: 81 c3 e0 08 retl 200b954: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200b958: 81 c3 e0 08 retl 200b95c: 90 10 20 86 mov 0x86, %o0 =============================================================================== 02006848 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2006848: 9d e3 bf 90 save %sp, -112, %sp 200684c: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2006850: 80 a7 60 00 cmp %i5, 0 2006854: 02 80 00 27 be 20068f0 2006858: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 200685c: 80 a6 a0 00 cmp %i2, 0 2006860: 02 80 00 24 be 20068f0 2006864: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2006868: 02 80 00 24 be 20068f8 200686c: 90 07 bf f8 add %fp, -8, %o0 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 2006870: c2 06 40 00 ld [ %i1 ], %g1 2006874: 80 a0 60 00 cmp %g1, 0 2006878: 02 80 00 1e be 20068f0 200687c: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2006880: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006884: 80 a0 60 00 cmp %g1, 0 2006888: 12 80 00 1a bne 20068f0 <== NEVER TAKEN 200688c: 03 00 80 60 sethi %hi(0x2018000), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006890: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ! 20183e0 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006894: c0 27 bf f0 clr [ %fp + -16 ] 2006898: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 200689c: f4 27 bf f4 st %i2, [ %fp + -12 ] 20068a0: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] return _Thread_Dispatch_disable_level; 20068a4: c2 00 63 e0 ld [ %g1 + 0x3e0 ], %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 *) 20068a8: 37 00 80 61 sethi %hi(0x2018400), %i3 20068ac: 40 00 08 bd call 2008ba0 <_Objects_Allocate> 20068b0: 90 16 e3 a0 or %i3, 0x3a0, %o0 ! 20187a0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 20068b4: b8 92 20 00 orcc %o0, 0, %i4 20068b8: 02 80 00 14 be 2006908 20068bc: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 20068c0: 40 00 06 04 call 20080d0 <_CORE_barrier_Initialize> 20068c4: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20068c8: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; _Thread_Enable_dispatch(); return 0; } 20068cc: b6 16 e3 a0 or %i3, 0x3a0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20068d0: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20068d4: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20068d8: 85 28 a0 02 sll %g2, 2, %g2 20068dc: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 20068e0: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 20068e4: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20068e8: 40 00 0d 95 call 2009f3c <_Thread_Enable_dispatch> 20068ec: b0 10 20 00 clr %i0 return 0; } 20068f0: 81 c7 e0 08 ret 20068f4: 81 e8 00 00 restore * If the user passed in NULL, use the default attributes */ if ( attr ) { the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 20068f8: 7f ff ff 9c call 2006768 20068fc: 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 ) 2006900: 10 bf ff dd b 2006874 2006904: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 2006908: 40 00 0d 8d call 2009f3c <_Thread_Enable_dispatch> 200690c: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006910: 81 c7 e0 08 ret 2006914: 81 e8 00 00 restore =============================================================================== 020060c8 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 20060c8: 9d e3 bf a0 save %sp, -96, %sp /* * The POSIX standard does not address what to do when the routine * is NULL. It also does not address what happens when we cannot * allocate memory or anything else bad happens. */ if ( !routine ) 20060cc: 80 a6 20 00 cmp %i0, 0 20060d0: 02 80 00 16 be 2006128 20060d4: 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++; 20060d8: 03 00 80 62 sethi %hi(0x2018800), %g1 20060dc: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 ! 2018850 <_Thread_Dispatch_disable_level> 20060e0: 84 00 a0 01 inc %g2 20060e4: c4 20 60 50 st %g2, [ %g1 + 0x50 ] return _Thread_Dispatch_disable_level; 20060e8: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 20060ec: 40 00 12 c9 call 200ac10 <_Workspace_Allocate> 20060f0: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 20060f4: 80 a2 20 00 cmp %o0, 0 20060f8: 02 80 00 0a be 2006120 <== NEVER TAKEN 20060fc: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006100: 03 00 80 63 sethi %hi(0x2018c00), %g1 2006104: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 ! 2018d94 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 2006108: 92 10 00 08 mov %o0, %o1 handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); if ( handler ) { thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; handler_stack = &thread_support->Cancellation_Handlers; 200610c: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 2006110: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 2006114: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2006118: 40 00 06 36 call 20079f0 <_Chain_Append> 200611c: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 2006120: 40 00 0d c5 call 2009834 <_Thread_Enable_dispatch> 2006124: 81 e8 00 00 restore 2006128: 81 c7 e0 08 ret 200612c: 81 e8 00 00 restore =============================================================================== 02007050 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2007050: 9d e3 bf a0 save %sp, -96, %sp POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; 2007054: 80 a6 60 00 cmp %i1, 0 2007058: 02 80 00 27 be 20070f4 200705c: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2007060: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007064: 80 a0 60 01 cmp %g1, 1 2007068: 02 80 00 21 be 20070ec <== NEVER TAKEN 200706c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2007070: c2 06 40 00 ld [ %i1 ], %g1 2007074: 80 a0 60 00 cmp %g1, 0 2007078: 02 80 00 1d be 20070ec 200707c: 03 00 80 65 sethi %hi(0x2019400), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007080: c4 00 61 10 ld [ %g1 + 0x110 ], %g2 ! 2019510 <_Thread_Dispatch_disable_level> 2007084: 84 00 a0 01 inc %g2 2007088: c4 20 61 10 st %g2, [ %g1 + 0x110 ] return _Thread_Dispatch_disable_level; 200708c: c2 00 61 10 ld [ %g1 + 0x110 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2007090: 37 00 80 66 sethi %hi(0x2019800), %i3 2007094: 40 00 0a 2b call 2009940 <_Objects_Allocate> 2007098: 90 16 e1 68 or %i3, 0x168, %o0 ! 2019968 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 200709c: b8 92 20 00 orcc %o0, 0, %i4 20070a0: 02 80 00 18 be 2007100 20070a4: 90 07 20 18 add %i4, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070a8: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070ac: 92 10 20 00 clr %o1 20070b0: 15 04 00 02 sethi %hi(0x10000800), %o2 20070b4: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070b8: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070bc: 40 00 11 32 call 200b584 <_Thread_queue_Initialize> 20070c0: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20070c4: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 20070c8: b6 16 e1 68 or %i3, 0x168, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20070cc: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20070d0: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20070d4: 85 28 a0 02 sll %g2, 2, %g2 20070d8: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 20070dc: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 20070e0: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20070e4: 40 00 0e fe call 200acdc <_Thread_Enable_dispatch> 20070e8: b0 10 20 00 clr %i0 return 0; } 20070ec: 81 c7 e0 08 ret 20070f0: 81 e8 00 00 restore { POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; else the_attr = &_POSIX_Condition_variables_Default_attributes; 20070f4: 33 00 80 5f sethi %hi(0x2017c00), %i1 20070f8: 10 bf ff da b 2007060 20070fc: b2 16 60 dc or %i1, 0xdc, %i1 ! 2017cdc <_POSIX_Condition_variables_Default_attributes> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 2007100: 40 00 0e f7 call 200acdc <_Thread_Enable_dispatch> 2007104: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2007108: 81 c7 e0 08 ret 200710c: 81 e8 00 00 restore =============================================================================== 02006eb4 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006eb4: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006eb8: 80 a0 60 00 cmp %g1, 0 2006ebc: 02 80 00 06 be 2006ed4 2006ec0: 90 10 20 16 mov 0x16, %o0 2006ec4: c4 00 40 00 ld [ %g1 ], %g2 2006ec8: 80 a0 a0 00 cmp %g2, 0 2006ecc: 32 80 00 04 bne,a 2006edc <== ALWAYS TAKEN 2006ed0: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 2006ed4: 81 c3 e0 08 retl 2006ed8: 01 00 00 00 nop 2006edc: 81 c3 e0 08 retl 2006ee0: 90 10 20 00 clr %o0 ! 0 =============================================================================== 0200658c : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 200658c: 9d e3 bf 58 save %sp, -168, %sp 2006590: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2006594: 80 a6 a0 00 cmp %i2, 0 2006598: 02 80 00 63 be 2006724 200659c: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20065a0: 80 a6 60 00 cmp %i1, 0 20065a4: 22 80 00 62 be,a 200672c 20065a8: 33 00 80 72 sethi %hi(0x201c800), %i1 if ( !the_attr->is_initialized ) 20065ac: c2 06 40 00 ld [ %i1 ], %g1 20065b0: 80 a0 60 00 cmp %g1, 0 20065b4: 02 80 00 5c be 2006724 20065b8: b0 10 20 16 mov 0x16, %i0 * stack space if it is allowed to allocate it itself. * * NOTE: If the user provides the stack we will let it drop below * twice the minimum. */ if ( the_attr->stackaddr && !_Stack_Is_enough(the_attr->stacksize) ) 20065bc: c2 06 60 04 ld [ %i1 + 4 ], %g1 20065c0: 80 a0 60 00 cmp %g1, 0 20065c4: 02 80 00 07 be 20065e0 20065c8: 03 00 80 75 sethi %hi(0x201d400), %g1 20065cc: c4 06 60 08 ld [ %i1 + 8 ], %g2 20065d0: c2 00 62 d0 ld [ %g1 + 0x2d0 ], %g1 20065d4: 80 a0 80 01 cmp %g2, %g1 20065d8: 0a 80 00 83 bcs 20067e4 20065dc: 01 00 00 00 nop * If inheritsched is set to PTHREAD_INHERIT_SCHED, then this thread * inherits scheduling attributes from the creating thread. If it is * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { 20065e0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20065e4: 80 a0 60 01 cmp %g1, 1 20065e8: 02 80 00 53 be 2006734 20065ec: 80 a0 60 02 cmp %g1, 2 20065f0: 12 80 00 4d bne 2006724 20065f4: b0 10 20 16 mov 0x16, %i0 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 20065f8: da 06 60 18 ld [ %i1 + 0x18 ], %o5 20065fc: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2006600: f0 06 60 20 ld [ %i1 + 0x20 ], %i0 2006604: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 2006608: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 200660c: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 2006610: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006614: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 2006618: da 27 bf dc st %o5, [ %fp + -36 ] 200661c: de 27 bf e0 st %o7, [ %fp + -32 ] 2006620: f0 27 bf e4 st %i0, [ %fp + -28 ] 2006624: c8 27 bf e8 st %g4, [ %fp + -24 ] 2006628: c6 27 bf ec st %g3, [ %fp + -20 ] 200662c: c4 27 bf f0 st %g2, [ %fp + -16 ] 2006630: c2 27 bf f4 st %g1, [ %fp + -12 ] /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 2006634: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2006638: 80 a0 60 00 cmp %g1, 0 200663c: 12 80 00 3a bne 2006724 2006640: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2006644: d0 07 bf dc ld [ %fp + -36 ], %o0 2006648: 40 00 1b f3 call 200d614 <_POSIX_Priority_Is_valid> 200664c: b0 10 20 16 mov 0x16, %i0 2006650: 80 8a 20 ff btst 0xff, %o0 2006654: 02 80 00 34 be 2006724 <== NEVER TAKEN 2006658: 03 00 80 75 sethi %hi(0x201d400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 200665c: e4 07 bf dc ld [ %fp + -36 ], %l2 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 2006660: e6 08 62 cc ldub [ %g1 + 0x2cc ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2006664: 90 10 00 1c mov %i4, %o0 2006668: 92 07 bf dc add %fp, -36, %o1 200666c: 94 07 bf f8 add %fp, -8, %o2 2006670: 40 00 1b f6 call 200d648 <_POSIX_Thread_Translate_sched_param> 2006674: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2006678: b0 92 20 00 orcc %o0, 0, %i0 200667c: 12 80 00 2a bne 2006724 2006680: 23 00 80 79 sethi %hi(0x201e400), %l1 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2006684: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 ! 201e454 <_RTEMS_Allocator_Mutex> 2006688: 40 00 06 50 call 2007fc8 <_API_Mutex_Lock> 200668c: 29 00 80 79 sethi %hi(0x201e400), %l4 * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 2006690: 40 00 09 19 call 2008af4 <_Objects_Allocate> 2006694: 90 15 21 f0 or %l4, 0x1f0, %o0 ! 201e5f0 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2006698: a0 92 20 00 orcc %o0, 0, %l0 200669c: 02 80 00 1f be 2006718 20066a0: 05 00 80 75 sethi %hi(0x201d400), %g2 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066a4: c2 06 60 08 ld [ %i1 + 8 ], %g1 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 20066a8: d6 00 a2 d0 ld [ %g2 + 0x2d0 ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066ac: c0 27 bf d4 clr [ %fp + -44 ] static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 20066b0: 97 2a e0 01 sll %o3, 1, %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066b4: 80 a2 c0 01 cmp %o3, %g1 20066b8: 1a 80 00 03 bcc 20066c4 20066bc: d4 06 60 04 ld [ %i1 + 4 ], %o2 20066c0: 96 10 00 01 mov %g1, %o3 20066c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20066c8: 9a 0c e0 ff and %l3, 0xff, %o5 20066cc: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 20066d0: 82 10 20 01 mov 1, %g1 20066d4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20066d8: c2 07 bf fc ld [ %fp + -4 ], %g1 20066dc: c0 23 a0 68 clr [ %sp + 0x68 ] 20066e0: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 20066e4: 82 07 bf d4 add %fp, -44, %g1 20066e8: 90 15 21 f0 or %l4, 0x1f0, %o0 20066ec: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20066f0: 92 10 00 10 mov %l0, %o1 20066f4: 98 10 20 01 mov 1, %o4 20066f8: 40 00 0e 1e call 2009f70 <_Thread_Initialize> 20066fc: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2006700: 80 8a 20 ff btst 0xff, %o0 2006704: 12 80 00 1f bne 2006780 2006708: 11 00 80 79 sethi %hi(0x201e400), %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 200670c: 92 10 00 10 mov %l0, %o1 2006710: 40 00 09 e3 call 2008e9c <_Objects_Free> 2006714: 90 12 21 f0 or %o0, 0x1f0, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006718: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 200671c: 40 00 06 40 call 200801c <_API_Mutex_Unlock> 2006720: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006724: 81 c7 e0 08 ret 2006728: 81 e8 00 00 restore int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 200672c: 10 bf ff a0 b 20065ac 2006730: b2 16 61 94 or %i1, 0x194, %i1 * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { case PTHREAD_INHERIT_SCHED: api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006734: 03 00 80 7a sethi %hi(0x201e800), %g1 2006738: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201e8f4 <_Per_CPU_Information+0xc> 200673c: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006740: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 2006744: da 00 60 8c ld [ %g1 + 0x8c ], %o5 2006748: de 00 60 90 ld [ %g1 + 0x90 ], %o7 200674c: f0 00 60 94 ld [ %g1 + 0x94 ], %i0 2006750: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 2006754: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 2006758: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 * attributes structure. */ switch ( the_attr->inheritsched ) { case PTHREAD_INHERIT_SCHED: api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; schedpolicy = api->schedpolicy; 200675c: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 2006760: d8 27 bf dc st %o4, [ %fp + -36 ] 2006764: da 27 bf e0 st %o5, [ %fp + -32 ] 2006768: de 27 bf e4 st %o7, [ %fp + -28 ] 200676c: f0 27 bf e8 st %i0, [ %fp + -24 ] 2006770: c8 27 bf ec st %g4, [ %fp + -20 ] 2006774: c6 27 bf f0 st %g3, [ %fp + -16 ] break; 2006778: 10 bf ff af b 2006634 200677c: c4 27 bf f4 st %g2, [ %fp + -12 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2006780: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 api->Attributes = *the_attr; 2006784: 92 10 00 19 mov %i1, %o1 2006788: 94 10 20 40 mov 0x40, %o2 200678c: 40 00 28 d2 call 2010ad4 2006790: 90 10 00 12 mov %l2, %o0 api->detachstate = the_attr->detachstate; 2006794: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006798: 92 07 bf dc add %fp, -36, %o1 200679c: 94 10 20 1c mov 0x1c, %o2 * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; 20067a0: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] api->schedpolicy = schedpolicy; 20067a4: f8 24 a0 84 st %i4, [ %l2 + 0x84 ] api->schedparam = schedparam; 20067a8: 40 00 28 cb call 2010ad4 20067ac: 90 04 a0 88 add %l2, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 20067b0: 90 10 00 10 mov %l0, %o0 20067b4: 92 10 20 01 mov 1, %o1 20067b8: 94 10 00 1a mov %i2, %o2 20067bc: 96 10 00 1b mov %i3, %o3 20067c0: 40 00 10 70 call 200a980 <_Thread_Start> 20067c4: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 20067c8: 80 a7 20 04 cmp %i4, 4 20067cc: 02 80 00 08 be 20067ec 20067d0: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20067d4: c2 04 20 08 ld [ %l0 + 8 ], %g1 _RTEMS_Unlock_allocator(); 20067d8: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 20067dc: 40 00 06 10 call 200801c <_API_Mutex_Unlock> 20067e0: c2 27 40 00 st %g1, [ %i5 ] return 0; 20067e4: 81 c7 e0 08 ret 20067e8: 81 e8 00 00 restore return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 20067ec: 40 00 10 e7 call 200ab88 <_Timespec_To_ticks> 20067f0: 90 04 a0 90 add %l2, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20067f4: 92 04 a0 a8 add %l2, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20067f8: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20067fc: 11 00 80 79 sethi %hi(0x201e400), %o0 2006800: 40 00 11 d2 call 200af48 <_Watchdog_Insert> 2006804: 90 12 20 74 or %o0, 0x74, %o0 ! 201e474 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2006808: 10 bf ff f4 b 20067d8 200680c: c2 04 20 08 ld [ %l0 + 8 ], %g1 =============================================================================== 0201a868 : int pthread_kill( pthread_t thread, int sig ) { 201a868: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201a86c: 80 a6 60 00 cmp %i1, 0 201a870: 02 80 00 2d be 201a924 201a874: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a878: 80 a6 e0 1f cmp %i3, 0x1f 201a87c: 18 80 00 2a bgu 201a924 201a880: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 201a884: 7f ff ba 8e call 20092bc <_Thread_Get> 201a888: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201a88c: c2 07 bf fc ld [ %fp + -4 ], %g1 201a890: 80 a0 60 00 cmp %g1, 0 201a894: 12 80 00 2a bne 201a93c <== NEVER TAKEN 201a898: ba 10 00 08 mov %o0, %i5 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 201a89c: 83 2e 60 02 sll %i1, 2, %g1 201a8a0: 85 2e 60 04 sll %i1, 4, %g2 201a8a4: 84 20 80 01 sub %g2, %g1, %g2 201a8a8: 03 00 80 77 sethi %hi(0x201dc00), %g1 201a8ac: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 201dee0 <_POSIX_signals_Vectors> 201a8b0: 82 00 40 02 add %g1, %g2, %g1 201a8b4: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a8b8: 80 a0 a0 01 cmp %g2, 1 201a8bc: 02 80 00 14 be 201a90c 201a8c0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a8c4: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201a8c8: b8 10 20 01 mov 1, %i4 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a8cc: 92 10 00 19 mov %i1, %o1 201a8d0: b7 2f 00 1b sll %i4, %i3, %i3 201a8d4: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a8d8: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a8dc: 7f ff ff 8c call 201a70c <_POSIX_signals_Unblock_thread> 201a8e0: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a8e4: 03 00 80 77 sethi %hi(0x201dc00), %g1 201a8e8: 82 10 62 88 or %g1, 0x288, %g1 ! 201de88 <_Per_CPU_Information> 201a8ec: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a8f0: 80 a0 a0 00 cmp %g2, 0 201a8f4: 02 80 00 06 be 201a90c 201a8f8: 01 00 00 00 nop 201a8fc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a900: 80 a7 40 02 cmp %i5, %g2 201a904: 02 80 00 06 be 201a91c 201a908: 01 00 00 00 nop _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 201a90c: 7f ff ba 60 call 200928c <_Thread_Enable_dispatch> 201a910: b0 10 20 00 clr %i0 ! 0 return 0; 201a914: 81 c7 e0 08 ret 201a918: 81 e8 00 00 restore api->signals_pending |= signo_to_mask( sig ); (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; 201a91c: f8 28 60 18 stb %i4, [ %g1 + 0x18 ] 201a920: 30 bf ff fb b,a 201a90c if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201a924: 7f ff d4 02 call 200f92c <__errno> 201a928: b0 10 3f ff mov -1, %i0 201a92c: 82 10 20 16 mov 0x16, %g1 201a930: c2 22 00 00 st %g1, [ %o0 ] 201a934: 81 c7 e0 08 ret 201a938: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201a93c: 7f ff d3 fc call 200f92c <__errno> <== NOT EXECUTED 201a940: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201a944: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 201a948: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 201a94c: 81 c7 e0 08 ret <== NOT EXECUTED 201a950: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008518 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2008518: 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 ); 200851c: 90 10 00 19 mov %i1, %o0 2008520: 40 00 00 37 call 20085fc <_POSIX_Absolute_timeout_to_ticks> 2008524: 92 07 bf fc add %fp, -4, %o1 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008528: 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 ); 200852c: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008530: 80 a7 60 03 cmp %i5, 3 2008534: 02 80 00 09 be 2008558 2008538: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 200853c: 7f ff ff be call 2008434 <_POSIX_Mutex_Lock_support> 2008540: 92 10 20 00 clr %o1 * This service only gives us the option to block. We used a polling * attempt to lock if the abstime was not in the future. If we did * not obtain the mutex, then not look at the status immediately, * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { 2008544: 80 a2 20 10 cmp %o0, 0x10 2008548: 02 80 00 08 be 2008568 <== ALWAYS TAKEN 200854c: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008550: 81 c7 e0 08 ret 2008554: 91 e8 00 08 restore %g0, %o0, %o0 */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008558: 7f ff ff b7 call 2008434 <_POSIX_Mutex_Lock_support> 200855c: 92 10 20 01 mov 1, %o1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008560: 81 c7 e0 08 ret 2008564: 91 e8 00 08 restore %g0, %o0, %o0 * attempt to lock if the abstime was not in the future. If we did * not obtain the mutex, then not look at the status immediately, * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008568: 32 80 00 04 bne,a 2008578 <== ALWAYS TAKEN 200856c: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 2008570: 10 bf ff f8 b 2008550 <== NOT EXECUTED 2008574: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008578: 80 a7 60 01 cmp %i5, 1 200857c: 28 bf ff f5 bleu,a 2008550 <== ALWAYS TAKEN 2008580: 90 10 20 74 mov 0x74, %o0 2008584: 30 bf ff f3 b,a 2008550 <== NOT EXECUTED =============================================================================== 02005e0c : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005e0c: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2005e10: 80 a0 60 00 cmp %g1, 0 2005e14: 02 80 00 06 be 2005e2c 2005e18: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005e1c: c4 00 40 00 ld [ %g1 ], %g2 2005e20: 80 a0 a0 00 cmp %g2, 0 2005e24: 12 80 00 04 bne 2005e34 2005e28: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 2005e2c: 81 c3 e0 08 retl 2005e30: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 2005e34: 02 bf ff fe be 2005e2c <== NEVER TAKEN 2005e38: 01 00 00 00 nop return EINVAL; *type = attr->type; 2005e3c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2005e40: 90 10 20 00 clr %o0 } 2005e44: 81 c3 e0 08 retl 2005e48: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 020080ec : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 20080ec: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20080f0: 80 a0 60 00 cmp %g1, 0 20080f4: 02 80 00 06 be 200810c 20080f8: 90 10 20 16 mov 0x16, %o0 20080fc: c4 00 40 00 ld [ %g1 ], %g2 2008100: 80 a0 a0 00 cmp %g2, 0 2008104: 12 80 00 04 bne 2008114 2008108: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 200810c: 81 c3 e0 08 retl 2008110: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2008114: 18 bf ff fe bgu 200810c <== NEVER TAKEN 2008118: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 200811c: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2008120: 81 c3 e0 08 retl 2008124: 90 10 20 00 clr %o0 =============================================================================== 02005ea0 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 2005ea0: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2005ea4: 80 a0 60 00 cmp %g1, 0 2005ea8: 02 80 00 06 be 2005ec0 2005eac: 90 10 20 16 mov 0x16, %o0 2005eb0: c4 00 40 00 ld [ %g1 ], %g2 2005eb4: 80 a0 a0 00 cmp %g2, 0 2005eb8: 12 80 00 04 bne 2005ec8 <== ALWAYS TAKEN 2005ebc: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 2005ec0: 81 c3 e0 08 retl 2005ec4: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 2005ec8: 18 bf ff fe bgu 2005ec0 2005ecc: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2005ed0: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 2005ed4: 81 c3 e0 08 retl 2005ed8: 90 10 20 00 clr %o0 =============================================================================== 02006c30 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2006c30: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2006c34: 80 a6 60 00 cmp %i1, 0 2006c38: 12 80 00 04 bne 2006c48 2006c3c: ba 10 00 18 mov %i0, %i5 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006c40: 81 c7 e0 08 ret 2006c44: 91 e8 20 16 restore %g0, 0x16, %o0 int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) 2006c48: 80 a6 20 00 cmp %i0, 0 2006c4c: 22 80 00 13 be,a 2006c98 2006c50: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 2006c54: c2 06 20 04 ld [ %i0 + 4 ], %g1 2006c58: 80 a0 60 00 cmp %g1, 0 2006c5c: 12 80 00 0f bne 2006c98 2006c60: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2006c64: 90 10 21 00 mov 0x100, %o0 2006c68: 92 10 21 00 mov 0x100, %o1 2006c6c: 40 00 03 0c call 200789c 2006c70: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2006c74: c2 07 60 04 ld [ %i5 + 4 ], %g1 2006c78: 80 a0 60 00 cmp %g1, 0 2006c7c: 02 80 00 09 be 2006ca0 <== ALWAYS TAKEN 2006c80: 82 10 20 01 mov 1, %g1 once_control->is_initialized = true; once_control->init_executed = true; (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2006c84: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 2006c88: 92 10 21 00 mov 0x100, %o1 2006c8c: 94 07 bf fc add %fp, -4, %o2 2006c90: 40 00 03 03 call 200789c 2006c94: b0 10 20 00 clr %i0 2006c98: 81 c7 e0 08 ret 2006c9c: 81 e8 00 00 restore if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); if ( !once_control->init_executed ) { once_control->is_initialized = true; 2006ca0: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2006ca4: 9f c6 40 00 call %i1 2006ca8: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2006cac: 10 bf ff f7 b 2006c88 2006cb0: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 020073a8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20073a8: 9d e3 bf 90 save %sp, -112, %sp 20073ac: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20073b0: 80 a7 60 00 cmp %i5, 0 20073b4: 02 80 00 24 be 2007444 20073b8: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20073bc: 80 a6 60 00 cmp %i1, 0 20073c0: 02 80 00 23 be 200744c 20073c4: 90 07 bf f4 add %fp, -12, %o0 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 20073c8: c2 06 40 00 ld [ %i1 ], %g1 20073cc: 80 a0 60 00 cmp %g1, 0 20073d0: 02 80 00 1d be 2007444 <== NEVER TAKEN 20073d4: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20073d8: c2 06 60 04 ld [ %i1 + 4 ], %g1 20073dc: 80 a0 60 00 cmp %g1, 0 20073e0: 12 80 00 19 bne 2007444 <== NEVER TAKEN 20073e4: 03 00 80 6a sethi %hi(0x201a800), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20073e8: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 201a930 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20073ec: c0 27 bf fc clr [ %fp + -4 ] 20073f0: 84 00 a0 01 inc %g2 20073f4: c4 20 61 30 st %g2, [ %g1 + 0x130 ] return _Thread_Dispatch_disable_level; 20073f8: c2 00 61 30 ld [ %g1 + 0x130 ], %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 *) 20073fc: 37 00 80 6a sethi %hi(0x201a800), %i3 2007400: 40 00 0a 46 call 2009d18 <_Objects_Allocate> 2007404: 90 16 e3 30 or %i3, 0x330, %o0 ! 201ab30 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2007408: b8 92 20 00 orcc %o0, 0, %i4 200740c: 02 80 00 14 be 200745c 2007410: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2007414: 40 00 07 d6 call 200936c <_CORE_RWLock_Initialize> 2007418: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200741c: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 2007420: b6 16 e3 30 or %i3, 0x330, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007424: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007428: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200742c: 85 28 a0 02 sll %g2, 2, %g2 2007430: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2007434: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007438: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 200743c: 40 00 0f 1e call 200b0b4 <_Thread_Enable_dispatch> 2007440: b0 10 20 00 clr %i0 return 0; } 2007444: 81 c7 e0 08 ret 2007448: 81 e8 00 00 restore * If the user passed in NULL, use the default attributes */ if ( attr ) { the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 200744c: 40 00 02 6c call 2007dfc 2007450: b2 07 bf f4 add %fp, -12, %i1 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 2007454: 10 bf ff de b 20073cc 2007458: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 200745c: 40 00 0f 16 call 200b0b4 <_Thread_Enable_dispatch> 2007460: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2007464: 81 c7 e0 08 ret 2007468: 81 e8 00 00 restore =============================================================================== 020074dc : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20074dc: 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 ) 20074e0: 80 a6 20 00 cmp %i0, 0 20074e4: 02 80 00 24 be 2007574 20074e8: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 20074ec: 92 07 bf fc add %fp, -4, %o1 20074f0: 40 00 1c 92 call 200e738 <_POSIX_Absolute_timeout_to_ticks> 20074f4: 90 10 00 19 mov %i1, %o0 20074f8: d2 06 00 00 ld [ %i0 ], %o1 20074fc: b8 10 00 08 mov %o0, %i4 2007500: 94 07 bf f8 add %fp, -8, %o2 2007504: 11 00 80 6a sethi %hi(0x201a800), %o0 2007508: 40 00 0b 4f call 200a244 <_Objects_Get> 200750c: 90 12 23 30 or %o0, 0x330, %o0 ! 201ab30 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2007510: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007514: 80 a0 60 00 cmp %g1, 0 2007518: 12 80 00 17 bne 2007574 200751c: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2007520: d2 06 00 00 ld [ %i0 ], %o1 int _EXFUN(pthread_rwlock_init, (pthread_rwlock_t *__rwlock, _CONST pthread_rwlockattr_t *__attr)); int _EXFUN(pthread_rwlock_destroy, (pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_rdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_tryrdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedrdlock, 2007524: 82 1f 20 03 xor %i4, 3, %g1 2007528: 90 02 20 10 add %o0, 0x10, %o0 200752c: 80 a0 00 01 cmp %g0, %g1 2007530: 98 10 20 00 clr %o4 2007534: b6 60 3f ff subx %g0, -1, %i3 2007538: 40 00 07 97 call 2009394 <_CORE_RWLock_Obtain_for_reading> 200753c: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2007540: 40 00 0e dd call 200b0b4 <_Thread_Enable_dispatch> 2007544: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007548: 03 00 80 6b sethi %hi(0x201ac00), %g1 200754c: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 201ae74 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 2007550: 80 a6 e0 00 cmp %i3, 0 2007554: 12 80 00 05 bne 2007568 2007558: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 200755c: 80 a2 20 02 cmp %o0, 2 2007560: 02 80 00 07 be 200757c 2007564: 80 a7 20 00 cmp %i4, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007568: 40 00 00 39 call 200764c <_POSIX_RWLock_Translate_core_RWLock_return_code> 200756c: 01 00 00 00 nop 2007570: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007574: 81 c7 e0 08 ret 2007578: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 200757c: 02 bf ff fe be 2007574 <== NEVER TAKEN 2007580: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007584: 80 a7 20 01 cmp %i4, 1 2007588: 18 bf ff f8 bgu 2007568 <== NEVER TAKEN 200758c: ba 10 20 74 mov 0x74, %i5 2007590: 30 bf ff f9 b,a 2007574 =============================================================================== 02007594 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007594: 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 ) 2007598: 80 a6 20 00 cmp %i0, 0 200759c: 02 80 00 24 be 200762c 20075a0: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 20075a4: 92 07 bf fc add %fp, -4, %o1 20075a8: 40 00 1c 64 call 200e738 <_POSIX_Absolute_timeout_to_ticks> 20075ac: 90 10 00 19 mov %i1, %o0 20075b0: d2 06 00 00 ld [ %i0 ], %o1 20075b4: b8 10 00 08 mov %o0, %i4 20075b8: 94 07 bf f8 add %fp, -8, %o2 20075bc: 11 00 80 6a sethi %hi(0x201a800), %o0 20075c0: 40 00 0b 21 call 200a244 <_Objects_Get> 20075c4: 90 12 23 30 or %o0, 0x330, %o0 ! 201ab30 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20075c8: c2 07 bf f8 ld [ %fp + -8 ], %g1 20075cc: 80 a0 60 00 cmp %g1, 0 20075d0: 12 80 00 17 bne 200762c 20075d4: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20075d8: d2 06 00 00 ld [ %i0 ], %o1 (pthread_rwlock_t *__rwlock, _CONST struct timespec *__abstime)); int _EXFUN(pthread_rwlock_unlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_wrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_trywrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedwrlock, 20075dc: 82 1f 20 03 xor %i4, 3, %g1 20075e0: 90 02 20 10 add %o0, 0x10, %o0 20075e4: 80 a0 00 01 cmp %g0, %g1 20075e8: 98 10 20 00 clr %o4 20075ec: b6 60 3f ff subx %g0, -1, %i3 20075f0: 40 00 07 9f call 200946c <_CORE_RWLock_Obtain_for_writing> 20075f4: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20075f8: 40 00 0e af call 200b0b4 <_Thread_Enable_dispatch> 20075fc: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2007600: 03 00 80 6b sethi %hi(0x201ac00), %g1 2007604: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 201ae74 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2007608: 80 a6 e0 00 cmp %i3, 0 200760c: 12 80 00 05 bne 2007620 2007610: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007614: 80 a2 20 02 cmp %o0, 2 2007618: 02 80 00 07 be 2007634 200761c: 80 a7 20 00 cmp %i4, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007620: 40 00 00 0b call 200764c <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007624: 01 00 00 00 nop 2007628: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 200762c: 81 c7 e0 08 ret 2007630: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2007634: 02 bf ff fe be 200762c <== NEVER TAKEN 2007638: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 200763c: 80 a7 20 01 cmp %i4, 1 2007640: 18 bf ff f8 bgu 2007620 <== NEVER TAKEN 2007644: ba 10 20 74 mov 0x74, %i5 2007648: 30 bf ff f9 b,a 200762c =============================================================================== 02007e24 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007e24: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007e28: 80 a0 60 00 cmp %g1, 0 2007e2c: 02 80 00 06 be 2007e44 2007e30: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007e34: c4 00 40 00 ld [ %g1 ], %g2 2007e38: 80 a0 a0 00 cmp %g2, 0 2007e3c: 12 80 00 04 bne 2007e4c 2007e40: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2007e44: 81 c3 e0 08 retl 2007e48: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2007e4c: 18 bf ff fe bgu 2007e44 <== NEVER TAKEN 2007e50: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007e54: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2007e58: 81 c3 e0 08 retl 2007e5c: 90 10 20 00 clr %o0 =============================================================================== 02008df0 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008df0: 9d e3 bf 90 save %sp, -112, %sp 2008df4: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2008df8: 80 a6 a0 00 cmp %i2, 0 2008dfc: 02 80 00 38 be 2008edc 2008e00: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 2008e04: 90 10 00 19 mov %i1, %o0 2008e08: 92 10 00 1a mov %i2, %o1 2008e0c: 94 07 bf f4 add %fp, -12, %o2 2008e10: 40 00 1a 57 call 200f76c <_POSIX_Thread_Translate_sched_param> 2008e14: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 2008e18: b0 92 20 00 orcc %o0, 0, %i0 2008e1c: 12 80 00 30 bne 2008edc 2008e20: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 2008e24: 40 00 0c 40 call 200bf24 <_Thread_Get> 2008e28: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008e2c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008e30: 80 a0 60 00 cmp %g1, 0 2008e34: 12 80 00 2c bne 2008ee4 2008e38: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2008e3c: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2008e40: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2008e44: 80 a0 60 04 cmp %g1, 4 2008e48: 02 80 00 33 be 2008f14 2008e4c: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 2008e50: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008e54: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008e58: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 2008e5c: c2 27 60 88 st %g1, [ %i5 + 0x88 ] 2008e60: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008e64: c4 27 60 8c st %g2, [ %i5 + 0x8c ] 2008e68: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2008e6c: c4 27 60 90 st %g2, [ %i5 + 0x90 ] 2008e70: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 2008e74: c4 27 60 94 st %g2, [ %i5 + 0x94 ] 2008e78: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 2008e7c: c4 27 60 98 st %g2, [ %i5 + 0x98 ] 2008e80: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 2008e84: c4 27 60 9c st %g2, [ %i5 + 0x9c ] 2008e88: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 2008e8c: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 2008e90: c4 07 bf f4 ld [ %fp + -12 ], %g2 2008e94: c4 27 20 7c st %g2, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008e98: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 2008e9c: 06 80 00 0e bl 2008ed4 <== NEVER TAKEN 2008ea0: c4 27 20 80 st %g2, [ %i4 + 0x80 ] 2008ea4: 80 a6 60 02 cmp %i1, 2 2008ea8: 04 80 00 11 ble 2008eec 2008eac: 07 00 80 6c sethi %hi(0x201b000), %g3 2008eb0: 80 a6 60 04 cmp %i1, 4 2008eb4: 12 80 00 08 bne 2008ed4 <== NEVER TAKEN 2008eb8: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008ebc: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 2008ec0: 40 00 10 da call 200d228 <_Watchdog_Remove> 2008ec4: 90 07 60 a8 add %i5, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008ec8: 90 10 20 00 clr %o0 2008ecc: 7f ff ff 7e call 2008cc4 <_POSIX_Threads_Sporadic_budget_TSR> 2008ed0: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008ed4: 40 00 0c 08 call 200bef4 <_Thread_Enable_dispatch> 2008ed8: 01 00 00 00 nop return 0; 2008edc: 81 c7 e0 08 ret 2008ee0: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return ESRCH; } 2008ee4: 81 c7 e0 08 ret 2008ee8: 91 e8 20 03 restore %g0, 3, %o0 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008eec: 05 00 80 70 sethi %hi(0x201c000), %g2 2008ef0: d2 08 e3 6c ldub [ %g3 + 0x36c ], %o1 2008ef4: c4 00 a0 14 ld [ %g2 + 0x14 ], %g2 2008ef8: 92 22 40 01 sub %o1, %g1, %o1 2008efc: c4 27 20 78 st %g2, [ %i4 + 0x78 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008f00: 90 10 00 1c mov %i4, %o0 case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; the_thread->real_priority = 2008f04: d2 27 20 18 st %o1, [ %i4 + 0x18 ] _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008f08: 40 00 0a bd call 200b9fc <_Thread_Change_priority> 2008f0c: 94 10 20 01 mov 1, %o2 the_thread, the_thread->real_priority, true ); break; 2008f10: 30 bf ff f1 b,a 2008ed4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 2008f14: 40 00 10 c5 call 200d228 <_Watchdog_Remove> 2008f18: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2008f1c: 10 bf ff ce b 2008e54 2008f20: f2 27 60 84 st %i1, [ %i5 + 0x84 ] =============================================================================== 020068d0 : * * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20068d0: 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() ) 20068d4: 3b 00 80 63 sethi %hi(0x2018c00), %i5 20068d8: ba 17 61 88 or %i5, 0x188, %i5 ! 2018d88 <_Per_CPU_Information> 20068dc: c2 07 60 08 ld [ %i5 + 8 ], %g1 20068e0: 80 a0 60 00 cmp %g1, 0 20068e4: 12 80 00 16 bne 200693c <== NEVER TAKEN 20068e8: 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++; 20068ec: 03 00 80 62 sethi %hi(0x2018800), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20068f0: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20068f4: c6 00 60 50 ld [ %g1 + 0x50 ], %g3 20068f8: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 20068fc: 86 00 e0 01 inc %g3 2006900: c6 20 60 50 st %g3, [ %g1 + 0x50 ] return _Thread_Dispatch_disable_level; 2006904: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2006908: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 200690c: 80 a0 60 00 cmp %g1, 0 2006910: 12 80 00 0d bne 2006944 <== NEVER TAKEN 2006914: 01 00 00 00 nop 2006918: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 200691c: 80 a0 60 00 cmp %g1, 0 2006920: 02 80 00 09 be 2006944 2006924: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2006928: 40 00 0b c3 call 2009834 <_Thread_Enable_dispatch> 200692c: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2006930: f0 07 60 0c ld [ %i5 + 0xc ], %i0 2006934: 40 00 1a 1f call 200d1b0 <_POSIX_Thread_Exit> 2006938: 81 e8 00 00 restore 200693c: 81 c7 e0 08 ret <== NOT EXECUTED 2006940: 81 e8 00 00 restore <== NOT EXECUTED _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2006944: 40 00 0b bc call 2009834 <_Thread_Enable_dispatch> 2006948: 81 e8 00 00 restore =============================================================================== 02007514 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2007514: 9d e3 bf 78 save %sp, -136, %sp struct sched_param param; /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); 2007518: 3b 00 80 66 sethi %hi(0x2019800), %i5 200751c: 40 00 02 75 call 2007ef0 2007520: 90 17 63 7c or %i5, 0x37c, %o0 ! 2019b7c if (result != 0) { 2007524: b8 92 20 00 orcc %o0, 0, %i4 2007528: 12 80 00 31 bne 20075ec <== NEVER TAKEN 200752c: 90 10 00 18 mov %i0, %o0 return result; } /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); 2007530: 40 00 04 a5 call 20087c4 2007534: b6 17 63 7c or %i5, 0x37c, %i3 2007538: 92 07 bf fc add %fp, -4, %o1 200753c: 40 00 03 93 call 2008388 2007540: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2007544: 40 00 04 a0 call 20087c4 2007548: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 200754c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2007550: c6 07 bf fc ld [ %fp + -4 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007554: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 2007558: c6 26 20 08 st %g3, [ %i0 + 8 ] /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 200755c: c6 07 bf dc ld [ %fp + -36 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); 2007560: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007564: 84 20 c0 02 sub %g3, %g2, %g2 2007568: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 200756c: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2007570: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 2007574: c0 20 60 38 clr [ %g1 + 0x38 ] pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2007578: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 200757c: 80 a0 a0 00 cmp %g2, 0 2007580: 12 80 00 06 bne 2007598 <== NEVER TAKEN 2007584: d2 00 40 00 ld [ %g1 ], %o1 2007588: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2 200758c: 80 a0 a0 04 cmp %g2, 4 2007590: 24 80 00 1b ble,a 20075fc 2007594: 90 06 e0 48 add %i3, 0x48, %o0 else { /* the maximum number of threads has been already created even though some of them might be idle. The request belongs to one of the active fd chain */ r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, 2007598: 94 10 20 00 clr %o2 200759c: 11 00 80 66 sethi %hi(0x2019800), %o0 20075a0: 7f ff fe a0 call 2007020 20075a4: 90 12 23 c4 or %o0, 0x3c4, %o0 ! 2019bc4 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20075a8: b4 92 20 00 orcc %o0, 0, %i2 20075ac: 22 80 00 31 be,a 2007670 20075b0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 20075b4: b6 06 a0 1c add %i2, 0x1c, %i3 20075b8: 40 00 02 4e call 2007ef0 20075bc: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20075c0: 90 06 a0 08 add %i2, 8, %o0 20075c4: 7f ff ff 89 call 20073e8 20075c8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20075cc: 40 00 01 25 call 2007a60 20075d0: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20075d4: 40 00 02 67 call 2007f70 20075d8: 90 10 00 1b mov %i3, %o0 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 20075dc: 40 00 02 65 call 2007f70 20075e0: 90 17 63 7c or %i5, 0x37c, %o0 return 0; } 20075e4: 81 c7 e0 08 ret 20075e8: 91 e8 00 1c restore %g0, %i4, %o0 /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); if (result != 0) { free (req); 20075ec: 7f ff f0 1e call 2003664 <== NOT EXECUTED 20075f0: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 20075f4: 81 c7 e0 08 ret <== NOT EXECUTED 20075f8: 81 e8 00 00 restore <== NOT EXECUTED if ((aio_request_queue.idle_threads == 0) && aio_request_queue.active_threads < AIO_MAX_THREADS) /* we still have empty places on the active_threads chain */ { chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 20075fc: 7f ff fe 89 call 2007020 2007600: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007604: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 2007608: 80 a0 60 01 cmp %g1, 1 200760c: 12 bf ff ea bne 20075b4 2007610: b4 10 00 08 mov %o0, %i2 RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 2007614: 90 02 20 08 add %o0, 8, %o0 2007618: 40 00 09 0b call 2009a44 <_Chain_Insert> 200761c: 92 10 00 18 mov %i0, %o1 rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 2007620: 92 10 20 00 clr %o1 chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); if (r_chain->new_fd == 1) { rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 2007624: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007628: 40 00 01 da call 2007d90 200762c: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2007630: 92 10 20 00 clr %o1 2007634: 40 00 00 db call 20079a0 2007638: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 200763c: 90 07 bf f8 add %fp, -8, %o0 2007640: 92 06 e0 08 add %i3, 8, %o1 2007644: 96 10 00 1a mov %i2, %o3 2007648: 15 00 80 1c sethi %hi(0x2007000), %o2 200764c: 40 00 02 ae call 2008104 2007650: 94 12 a1 7c or %o2, 0x17c, %o2 ! 200717c rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007654: 82 92 20 00 orcc %o0, 0, %g1 2007658: 12 80 00 25 bne 20076ec <== NEVER TAKEN 200765c: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2007660: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2007664: 82 00 60 01 inc %g1 2007668: 10 bf ff dd b 20075dc 200766c: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007670: 11 00 80 66 sethi %hi(0x2019800), %o0 2007674: d2 00 40 00 ld [ %g1 ], %o1 2007678: 90 12 23 d0 or %o0, 0x3d0, %o0 200767c: 7f ff fe 69 call 2007020 2007680: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007684: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007688: b4 10 00 08 mov %o0, %i2 200768c: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 2007690: 80 a0 60 01 cmp %g1, 1 2007694: 02 80 00 0b be 20076c0 2007698: 90 02 20 08 add %o0, 8, %o0 r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); pthread_cond_init (&r_chain->cond, NULL); } else /* just insert the request in the existing fd chain */ rtems_aio_insert_prio (&r_chain->perfd, req); 200769c: 7f ff ff 53 call 20073e8 20076a0: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 20076a4: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20076a8: 80 a0 60 00 cmp %g1, 0 20076ac: 04 bf ff cc ble 20075dc <== ALWAYS TAKEN 20076b0: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 20076b4: 40 00 00 eb call 2007a60 <== NOT EXECUTED 20076b8: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED 20076bc: 30 bf ff c8 b,a 20075dc <== NOT EXECUTED 20076c0: 40 00 08 e1 call 2009a44 <_Chain_Insert> 20076c4: 01 00 00 00 nop /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 20076c8: 90 06 a0 1c add %i2, 0x1c, %o0 if (r_chain->new_fd == 1) { /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 20076cc: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 20076d0: 40 00 01 b0 call 2007d90 20076d4: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 20076d8: 90 06 a0 20 add %i2, 0x20, %o0 20076dc: 40 00 00 b1 call 20079a0 20076e0: 92 10 20 00 clr %o1 } else /* just insert the request in the existing fd chain */ rtems_aio_insert_prio (&r_chain->perfd, req); if (aio_request_queue.idle_threads > 0) 20076e4: 10 bf ff f1 b 20076a8 20076e8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, rtems_aio_handle, (void *) r_chain); if (result != 0) { pthread_mutex_unlock (&aio_request_queue.mutex); 20076ec: 40 00 02 21 call 2007f70 <== NOT EXECUTED 20076f0: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED return result; 20076f4: 30 bf ff bc b,a 20075e4 <== NOT EXECUTED =============================================================================== 0200717c : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 200717c: 9d e3 bf 78 save %sp, -136, %sp struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); 2007180: 37 00 80 66 sethi %hi(0x2019800), %i3 2007184: b8 06 20 1c add %i0, 0x1c, %i4 2007188: b6 16 e3 7c or %i3, 0x37c, %i3 if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 200718c: b4 10 00 1b mov %i3, %i2 pthread_cond_destroy (&r_chain->cond); free (r_chain); /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007190: b2 06 e0 58 add %i3, 0x58, %i1 --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2007194: a0 06 e0 04 add %i3, 4, %l0 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2007198: 40 00 03 56 call 2007ef0 200719c: 90 10 00 1c mov %i4, %o0 if (result != 0) 20071a0: 80 a2 20 00 cmp %o0, 0 20071a4: 12 80 00 2b bne 2007250 <== NEVER TAKEN 20071a8: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20071ac: fa 06 20 08 ld [ %i0 + 8 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20071b0: 82 06 20 0c add %i0, 0xc, %g1 /* If the locked chain is not empty, take the first request extract it, unlock the chain and process the request, in this way the user can supply more requests to this fd chain */ if (!rtems_chain_is_empty (chain)) { 20071b4: 80 a7 40 01 cmp %i5, %g1 20071b8: 02 80 00 41 be 20072bc 20071bc: 01 00 00 00 nop node = rtems_chain_first (chain); req = (rtems_aio_request *) node; /* See _POSIX_PRIORITIZE_IO and _POSIX_PRIORITY_SCHEDULING discussion in rtems_aio_enqueue () */ pthread_getschedparam (pthread_self(), &policy, ¶m); 20071c0: 40 00 05 81 call 20087c4 20071c4: 01 00 00 00 nop 20071c8: 92 07 bf fc add %fp, -4, %o1 20071cc: 40 00 04 6f call 2008388 20071d0: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 20071d4: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 20071d8: 40 00 05 7b call 20087c4 20071dc: c2 27 bf d8 st %g1, [ %fp + -40 ] 20071e0: d2 07 60 08 ld [ %i5 + 8 ], %o1 20071e4: 40 00 05 7c call 20087d4 20071e8: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20071ec: 40 00 09 fe call 20099e4 <_Chain_Extract> 20071f0: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 20071f4: 40 00 03 5f call 2007f70 20071f8: 90 10 00 1c mov %i4, %o0 switch (req->aiocbp->aio_lio_opcode) { 20071fc: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 2007200: c2 04 60 30 ld [ %l1 + 0x30 ], %g1 2007204: 80 a0 60 02 cmp %g1, 2 2007208: 22 80 00 25 be,a 200729c 200720c: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 2007210: 80 a0 60 03 cmp %g1, 3 2007214: 02 80 00 1e be 200728c <== NEVER TAKEN 2007218: 01 00 00 00 nop 200721c: 80 a0 60 01 cmp %g1, 1 2007220: 22 80 00 0e be,a 2007258 <== ALWAYS TAKEN 2007224: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2007228: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 200722c: 40 00 2b 87 call 2012048 <__errno> <== NOT EXECUTED 2007230: c2 24 60 38 st %g1, [ %l1 + 0x38 ] <== NOT EXECUTED 2007234: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2007238: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 200723c: 40 00 03 2d call 2007ef0 <== NOT EXECUTED 2007240: c2 24 60 34 st %g1, [ %l1 + 0x34 ] <== NOT EXECUTED if (result != 0) 2007244: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2007248: 22 bf ff da be,a 20071b0 <== NOT EXECUTED 200724c: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 2007250: 81 c7 e0 08 ret 2007254: 91 e8 20 00 restore %g0, 0, %o0 pthread_mutex_unlock (&r_chain->mutex); switch (req->aiocbp->aio_lio_opcode) { case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2007258: d0 04 40 00 ld [ %l1 ], %o0 200725c: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 2007260: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 2007264: 96 10 00 02 mov %g2, %o3 2007268: 40 00 2e 94 call 2012cb8 200726c: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 2007270: 80 a2 3f ff cmp %o0, -1 2007274: 22 bf ff ed be,a 2007228 <== NEVER TAKEN 2007278: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 <== NOT EXECUTED req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 200727c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2007280: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2007284: 10 bf ff c5 b 2007198 2007288: c0 20 60 34 clr [ %g1 + 0x34 ] req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 200728c: 40 00 1d 9e call 200e904 <== NOT EXECUTED 2007290: d0 04 40 00 ld [ %l1 ], %o0 <== NOT EXECUTED break; 2007294: 10 bf ff f8 b 2007274 <== NOT EXECUTED 2007298: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 200729c: d0 04 40 00 ld [ %l1 ], %o0 20072a0: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 20072a4: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 20072a8: 96 10 00 02 mov %g2, %o3 20072ac: 40 00 2e c1 call 2012db0 20072b0: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 20072b4: 10 bf ff f0 b 2007274 20072b8: 80 a2 3f ff cmp %o0, -1 struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); 20072bc: 40 00 03 2d call 2007f70 20072c0: 90 10 00 1c mov %i4, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 20072c4: 40 00 03 0b call 2007ef0 20072c8: 90 10 00 1b mov %i3, %o0 if (rtems_chain_is_empty (chain)) 20072cc: c2 06 20 08 ld [ %i0 + 8 ], %g1 20072d0: 80 a7 40 01 cmp %i5, %g1 20072d4: 02 80 00 05 be 20072e8 <== ALWAYS TAKEN 20072d8: 92 07 bf f4 add %fp, -12, %o1 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 20072dc: 40 00 03 25 call 2007f70 20072e0: 90 10 00 1b mov %i3, %o0 20072e4: 30 bf ff ad b,a 2007198 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 20072e8: 40 00 01 50 call 2007828 20072ec: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20072f0: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20072f4: c0 27 bf f8 clr [ %fp + -8 ] pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20072f8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20072fc: ba 06 20 20 add %i0, 0x20, %i5 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2007300: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007304: 90 10 00 1d mov %i5, %o0 2007308: 92 10 00 1a mov %i2, %o1 200730c: 40 00 01 f4 call 2007adc 2007310: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no requests were added to the chain we delete the fd chain from the queue and start working with idle fd chains */ if (result == ETIMEDOUT) { 2007314: 80 a2 20 74 cmp %o0, 0x74 2007318: 12 bf ff f1 bne 20072dc <== NEVER TAKEN 200731c: 01 00 00 00 nop 2007320: 40 00 09 b1 call 20099e4 <_Chain_Extract> 2007324: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2007328: 40 00 02 47 call 2007c44 200732c: 90 10 00 1c mov %i4, %o0 pthread_cond_destroy (&r_chain->cond); 2007330: 40 00 01 66 call 20078c8 2007334: 90 10 00 1d mov %i5, %o0 free (r_chain); 2007338: 7f ff f0 cb call 2003664 200733c: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2007340: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007344: 80 a6 00 19 cmp %i0, %i1 2007348: 22 80 00 0e be,a 2007380 200734c: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2007350: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2 ++aio_request_queue.active_threads; 2007354: c2 06 a0 64 ld [ %i2 + 0x64 ], %g1 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2007358: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 200735c: 82 00 60 01 inc %g1 2007360: 90 10 00 18 mov %i0, %o0 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2007364: c4 26 a0 68 st %g2, [ %i2 + 0x68 ] 2007368: 40 00 09 9f call 20099e4 <_Chain_Extract> 200736c: c2 26 a0 64 st %g1, [ %i2 + 0x64 ] 2007370: b8 06 20 1c add %i0, 0x1c, %i4 node = rtems_chain_first (&aio_request_queue.idle_req); rtems_chain_extract (node); r_chain = (rtems_aio_request_chain *) node; rtems_aio_move_to_work (r_chain); 2007374: 7f ff ff 64 call 2007104 2007378: 90 10 00 18 mov %i0, %o0 200737c: 30 bf ff d8 b,a 20072dc signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; 2007380: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 2007384: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 2007388: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 200738c: 92 07 bf f4 add %fp, -12, %o1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 2007390: c4 26 e0 68 st %g2, [ %i3 + 0x68 ] --aio_request_queue.active_threads; 2007394: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 2007398: 40 00 01 24 call 2007828 200739c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20073a0: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20073a4: c0 27 bf f8 clr [ %fp + -8 ] AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20073a8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073ac: 90 10 00 10 mov %l0, %o0 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20073b0: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073b4: 92 10 00 1b mov %i3, %o1 20073b8: 40 00 01 c9 call 2007adc 20073bc: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { 20073c0: 80 a2 20 74 cmp %o0, 0x74 20073c4: 22 80 00 04 be,a 20073d4 <== ALWAYS TAKEN 20073c8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20073cc: 10 bf ff e1 b 2007350 <== NOT EXECUTED 20073d0: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 <== NOT EXECUTED AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 20073d4: 90 10 00 1b mov %i3, %o0 /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 20073d8: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20073dc: 40 00 02 e5 call 2007f70 20073e0: c2 26 e0 68 st %g1, [ %i3 + 0x68 ] return NULL; 20073e4: 30 bf ff 9b b,a 2007250 =============================================================================== 02006f18 : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2006f18: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006f1c: 3b 00 80 66 sethi %hi(0x2019800), %i5 2006f20: 40 00 04 5e call 2008098 2006f24: 90 17 63 84 or %i5, 0x384, %o0 ! 2019b84 if (result != 0) 2006f28: b0 92 20 00 orcc %o0, 0, %i0 2006f2c: 12 80 00 23 bne 2006fb8 <== NEVER TAKEN 2006f30: 90 17 63 84 or %i5, 0x384, %o0 return result; result = 2006f34: 40 00 04 65 call 20080c8 2006f38: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006f3c: 80 a2 20 00 cmp %o0, 0 2006f40: 12 80 00 20 bne 2006fc0 <== NEVER TAKEN 2006f44: 39 00 80 66 sethi %hi(0x2019800), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006f48: 92 10 20 00 clr %o1 2006f4c: 40 00 03 91 call 2007d90 2006f50: 90 17 23 7c or %i4, 0x37c, %o0 if (result != 0) 2006f54: 80 a2 20 00 cmp %o0, 0 2006f58: 12 80 00 23 bne 2006fe4 <== NEVER TAKEN 2006f5c: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006f60: 11 00 80 66 sethi %hi(0x2019800), %o0 2006f64: 40 00 02 8f call 20079a0 2006f68: 90 12 23 80 or %o0, 0x380, %o0 ! 2019b80 if (result != 0) { 2006f6c: b0 92 20 00 orcc %o0, 0, %i0 2006f70: 12 80 00 26 bne 2007008 <== NEVER TAKEN 2006f74: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f78: b8 17 23 7c or %i4, 0x37c, %i4 head->previous = NULL; tail->previous = head; 2006f7c: 82 07 20 54 add %i4, 0x54, %g1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f80: 88 07 20 4c add %i4, 0x4c, %g4 head->previous = NULL; tail->previous = head; 2006f84: 86 07 20 48 add %i4, 0x48, %g3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f88: 84 07 20 58 add %i4, 0x58, %g2 head->previous = NULL; tail->previous = head; 2006f8c: c2 27 20 5c st %g1, [ %i4 + 0x5c ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f90: c8 27 20 48 st %g4, [ %i4 + 0x48 ] head->previous = NULL; 2006f94: c0 27 20 4c clr [ %i4 + 0x4c ] tail->previous = head; 2006f98: c6 27 20 50 st %g3, [ %i4 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006f9c: c4 27 20 54 st %g2, [ %i4 + 0x54 ] head->previous = NULL; 2006fa0: c0 27 20 58 clr [ %i4 + 0x58 ] } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 2006fa4: c0 27 20 64 clr [ %i4 + 0x64 ] aio_request_queue.idle_threads = 0; 2006fa8: c0 27 20 68 clr [ %i4 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006fac: 03 00 00 2c sethi %hi(0xb000), %g1 2006fb0: 82 10 60 0b or %g1, 0xb, %g1 ! b00b 2006fb4: c2 27 20 60 st %g1, [ %i4 + 0x60 ] return result; } 2006fb8: 81 c7 e0 08 ret 2006fbc: 81 e8 00 00 restore result = pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) pthread_attr_destroy (&aio_request_queue.attr); 2006fc0: 40 00 04 2a call 2008068 <== NOT EXECUTED 2006fc4: 90 17 63 84 or %i5, 0x384, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006fc8: 39 00 80 66 sethi %hi(0x2019800), %i4 <== NOT EXECUTED 2006fcc: 92 10 20 00 clr %o1 <== NOT EXECUTED 2006fd0: 40 00 03 70 call 2007d90 <== NOT EXECUTED 2006fd4: 90 17 23 7c or %i4, 0x37c, %o0 <== NOT EXECUTED if (result != 0) 2006fd8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2006fdc: 02 bf ff e1 be 2006f60 <== NOT EXECUTED 2006fe0: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006fe4: 40 00 04 21 call 2008068 <== NOT EXECUTED 2006fe8: 90 17 63 84 or %i5, 0x384, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006fec: 92 10 20 00 clr %o1 <== NOT EXECUTED 2006ff0: 11 00 80 66 sethi %hi(0x2019800), %o0 <== NOT EXECUTED 2006ff4: 40 00 02 6b call 20079a0 <== NOT EXECUTED 2006ff8: 90 12 23 80 or %o0, 0x380, %o0 ! 2019b80 <== NOT EXECUTED if (result != 0) { 2006ffc: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2007000: 22 bf ff df be,a 2006f7c <== NOT EXECUTED 2007004: b8 17 23 7c or %i4, 0x37c, %i4 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 2007008: 40 00 03 0f call 2007c44 <== NOT EXECUTED 200700c: 90 17 23 7c or %i4, 0x37c, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007010: 40 00 04 16 call 2008068 <== NOT EXECUTED 2007014: 90 17 63 84 or %i5, 0x384, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2007018: 10 bf ff d9 b 2006f7c <== NOT EXECUTED 200701c: b8 17 23 7c or %i4, 0x37c, %i4 <== NOT EXECUTED =============================================================================== 020073e8 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 20073e8: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 20073ec: c2 06 00 00 ld [ %i0 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20073f0: 84 06 20 04 add %i0, 4, %g2 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 20073f4: 80 a0 40 02 cmp %g1, %g2 20073f8: 02 80 00 15 be 200744c <== NEVER TAKEN 20073fc: 86 10 00 19 mov %i1, %g3 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007400: de 06 60 14 ld [ %i1 + 0x14 ], %o7 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007404: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2007408: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 200740c: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 2007410: 80 a1 00 0f cmp %g4, %o7 2007414: 26 80 00 07 bl,a 2007430 <== NEVER TAKEN 2007418: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 200741c: 10 80 00 0b b 2007448 2007420: f0 00 60 04 ld [ %g1 + 4 ], %i0 2007424: 22 80 00 09 be,a 2007448 <== NOT EXECUTED 2007428: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 200742c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2007430: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2007434: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 2007438: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 200743c: 06 bf ff fa bl 2007424 <== NOT EXECUTED 2007440: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007444: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 2007448: b2 10 00 03 mov %g3, %i1 200744c: 40 00 09 7e call 2009a44 <_Chain_Insert> 2007450: 81 e8 00 00 restore =============================================================================== 02007104 : * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007104: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007108: 05 00 80 66 sethi %hi(0x2019800), %g2 200710c: 84 10 a3 7c or %g2, 0x37c, %g2 ! 2019b7c 2007110: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007114: de 06 20 14 ld [ %i0 + 0x14 ], %o7 2007118: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 200711c: b2 10 00 18 mov %i0, %i1 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007120: 80 a1 00 0f cmp %g4, %o7 2007124: 16 80 00 10 bge 2007164 <== NEVER TAKEN 2007128: 86 10 00 01 mov %g1, %g3 200712c: 84 00 a0 4c add %g2, 0x4c, %g2 2007130: 80 a0 40 02 cmp %g1, %g2 2007134: 32 80 00 08 bne,a 2007154 <== ALWAYS TAKEN 2007138: c6 00 40 00 ld [ %g1 ], %g3 200713c: 10 80 00 0b b 2007168 <== NOT EXECUTED 2007140: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007144: 80 a0 c0 02 cmp %g3, %g2 2007148: 02 80 00 0a be 2007170 <== NEVER TAKEN 200714c: 86 10 00 02 mov %g2, %g3 } } AIO_printf ("Thread finished\n"); return NULL; } 2007150: c6 00 40 00 ld [ %g1 ], %g3 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2007154: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 2007158: 80 a1 00 0f cmp %g4, %o7 200715c: 06 bf ff fa bl 2007144 2007160: 82 10 00 03 mov %g3, %g1 2007164: f0 00 e0 04 ld [ %g3 + 4 ], %i0 2007168: 40 00 0a 37 call 2009a44 <_Chain_Insert> 200716c: 81 e8 00 00 restore 2007170: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007174: 40 00 0a 34 call 2009a44 <_Chain_Insert> <== NOT EXECUTED 2007178: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007454 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2007454: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007458: fa 06 20 08 ld [ %i0 + 8 ], %i5 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 200745c: b4 10 20 8c mov 0x8c, %i2 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 2007460: b0 06 20 0c add %i0, 0xc, %i0 rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2007464: 80 a7 40 18 cmp %i5, %i0 2007468: 02 80 00 0d be 200749c <== NEVER TAKEN 200746c: b6 10 3f ff mov -1, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007470: 40 00 09 5d call 20099e4 <_Chain_Extract> 2007474: 90 10 00 1d mov %i5, %o0 { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 2007478: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } } AIO_printf ("Thread finished\n"); return NULL; } 200747c: f8 07 40 00 ld [ %i5 ], %i4 rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; req->aiocbp->return_value = -1; free (req); 2007480: 90 10 00 1d mov %i5, %o0 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 2007484: f4 20 60 34 st %i2, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 2007488: 7f ff f0 77 call 2003664 200748c: f6 20 60 38 st %i3, [ %g1 + 0x38 ] rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2007490: 80 a7 00 18 cmp %i4, %i0 2007494: 12 bf ff f7 bne 2007470 2007498: ba 10 00 1c mov %i4, %i5 200749c: 81 c7 e0 08 ret 20074a0: 81 e8 00 00 restore =============================================================================== 020074a4 : * AIO_NOTCANCELED - if request was not canceled * AIO_CANCELED - if request was canceled */ int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp) { 20074a4: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20074a8: fa 06 00 00 ld [ %i0 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20074ac: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 20074b0: 80 a7 40 01 cmp %i5, %g1 20074b4: 12 80 00 06 bne 20074cc 20074b8: b0 10 20 02 mov 2, %i0 20074bc: 30 80 00 14 b,a 200750c rtems_chain_node *node = rtems_chain_first (chain); rtems_aio_request *current; current = (rtems_aio_request *) node; while (!rtems_chain_is_tail (chain, node) && current->aiocbp != aiocbp) { 20074c0: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 20074c4: 02 80 00 10 be 2007504 <== NOT EXECUTED 20074c8: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED 20074cc: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 20074d0: 80 a0 80 19 cmp %g2, %i1 20074d4: 32 bf ff fb bne,a 20074c0 <== NEVER TAKEN 20074d8: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 20074dc: 40 00 09 42 call 20099e4 <_Chain_Extract> 20074e0: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; 20074e4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20074e8: 84 10 20 8c mov 0x8c, %g2 20074ec: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 20074f0: 84 10 3f ff mov -1, %g2 free (current); 20074f4: 90 10 00 1d mov %i5, %o0 return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; current->aiocbp->return_value = -1; 20074f8: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 20074fc: 7f ff f0 5a call 2003664 2007500: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2007504: 81 c7 e0 08 ret 2007508: 81 e8 00 00 restore } 200750c: 81 c7 e0 08 ret 2007510: 81 e8 00 00 restore =============================================================================== 02007144 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007144: 9d e3 bf 98 save %sp, -104, %sp 2007148: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 200714c: 40 00 01 9c call 20077bc <_Chain_Get> 2007150: 90 10 00 1d mov %i5, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2007154: 92 10 20 00 clr %o1 2007158: b8 10 00 08 mov %o0, %i4 200715c: 94 10 00 1a mov %i2, %o2 2007160: 90 10 00 19 mov %i1, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007164: 80 a7 20 00 cmp %i4, 0 2007168: 12 80 00 0a bne 2007190 200716c: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2007170: 7f ff fc f4 call 2006540 2007174: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2007178: 80 a2 20 00 cmp %o0, 0 200717c: 02 bf ff f4 be 200714c <== NEVER TAKEN 2007180: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 2007184: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007188: 81 c7 e0 08 ret 200718c: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007190: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2007194: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007198: 81 c7 e0 08 ret 200719c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007dc8 : rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007dc8: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007dcc: 03 00 80 6c sethi %hi(0x201b000), %g1 2007dd0: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 201b140 <_Per_CPU_Information+0x8> rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007dd4: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2007dd8: 03 00 80 6d sethi %hi(0x201b400), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2007ddc: 88 10 20 12 mov 0x12, %g4 rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007de0: 80 a0 a0 00 cmp %g2, 0 2007de4: 02 80 00 04 be 2007df4 2007de8: de 00 61 74 ld [ %g1 + 0x174 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007dec: 81 c7 e0 08 ret 2007df0: 91 e8 00 04 restore %g0, %g4, %o0 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 2007df4: 80 a6 a0 00 cmp %i2, 0 2007df8: 02 80 00 40 be 2007ef8 2007dfc: 80 a6 60 00 cmp %i1, 0 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 2007e00: 02 80 00 3e be 2007ef8 2007e04: de 26 80 00 st %o7, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e08: c4 06 40 00 ld [ %i1 ], %g2 2007e0c: 80 a0 a0 00 cmp %g2, 0 2007e10: 22 80 00 37 be,a 2007eec 2007e14: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 2007e18: 80 a3 c0 18 cmp %o7, %i0 2007e1c: 08 bf ff f4 bleu 2007dec 2007e20: 88 10 20 0a mov 0xa, %g4 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007e24: 05 00 80 6b sethi %hi(0x201ac00), %g2 2007e28: c8 00 a0 00 ld [ %g2 ], %g4 2007e2c: 88 01 20 01 inc %g4 2007e30: c8 20 a0 00 st %g4, [ %g2 ] return _Thread_Dispatch_disable_level; 2007e34: c4 00 a0 00 ld [ %g2 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2007e38: 80 a6 20 00 cmp %i0, 0 2007e3c: 12 80 00 32 bne 2007f04 2007e40: 1f 00 80 6d sethi %hi(0x201b400), %o7 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2007e44: c8 00 61 74 ld [ %g1 + 0x174 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2007e48: 80 a1 20 00 cmp %g4, 0 2007e4c: 02 80 00 45 be 2007f60 <== NEVER TAKEN 2007e50: c2 03 e1 78 ld [ %o7 + 0x178 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e54: 10 80 00 06 b 2007e6c 2007e58: c4 00 40 00 ld [ %g1 ], %g2 rtems_device_major_number n = _IO_Number_of_drivers; rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2007e5c: 80 a6 00 04 cmp %i0, %g4 2007e60: 02 80 00 35 be 2007f34 2007e64: 82 00 60 18 add %g1, 0x18, %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e68: c4 00 40 00 ld [ %g1 ], %g2 2007e6c: 80 a0 a0 00 cmp %g2, 0 2007e70: 32 bf ff fb bne,a 2007e5c 2007e74: b0 06 20 01 inc %i0 2007e78: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007e7c: 80 a0 a0 00 cmp %g2, 0 2007e80: 32 bf ff f7 bne,a 2007e5c 2007e84: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007e88: f0 26 80 00 st %i0, [ %i2 ] 2007e8c: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2007e90: 80 a1 00 18 cmp %g4, %i0 2007e94: 02 80 00 29 be 2007f38 <== NEVER TAKEN 2007e98: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007e9c: c8 00 c0 00 ld [ %g3 ], %g4 2007ea0: c4 03 e1 78 ld [ %o7 + 0x178 ], %g2 2007ea4: 82 23 40 01 sub %o5, %g1, %g1 2007ea8: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2007eac: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2007eb0: 82 00 80 01 add %g2, %g1, %g1 2007eb4: c8 20 60 04 st %g4, [ %g1 + 4 ] 2007eb8: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007ebc: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007ec0: c4 20 60 08 st %g2, [ %g1 + 8 ] 2007ec4: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007ec8: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007ecc: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2007ed0: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2007ed4: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2007ed8: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2007edc: 40 00 08 12 call 2009f24 <_Thread_Enable_dispatch> 2007ee0: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2007ee4: 40 00 23 61 call 2010c68 2007ee8: 81 e8 00 00 restore static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007eec: 80 a0 a0 00 cmp %g2, 0 2007ef0: 12 bf ff cb bne 2007e1c 2007ef4: 80 a3 c0 18 cmp %o7, %i0 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 2007ef8: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007efc: 81 c7 e0 08 ret 2007f00: 91 e8 00 04 restore %g0, %g4, %o0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 2007f04: c8 03 e1 78 ld [ %o7 + 0x178 ], %g4 2007f08: 83 2e 20 03 sll %i0, 3, %g1 2007f0c: 9b 2e 20 05 sll %i0, 5, %o5 2007f10: 84 23 40 01 sub %o5, %g1, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007f14: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2007f18: 80 a3 20 00 cmp %o4, 0 2007f1c: 02 80 00 0b be 2007f48 2007f20: 84 01 00 02 add %g4, %g2, %g2 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 2007f24: 40 00 08 00 call 2009f24 <_Thread_Enable_dispatch> 2007f28: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2007f2c: 10 bf ff b0 b 2007dec 2007f30: 88 10 20 0c mov 0xc, %g4 ! c if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007f34: f0 26 80 00 st %i0, [ %i2 ] if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2007f38: 40 00 07 fb call 2009f24 <_Thread_Enable_dispatch> 2007f3c: 01 00 00 00 nop return sc; 2007f40: 10 bf ff ab b 2007dec 2007f44: 88 10 20 05 mov 5, %g4 ! 5 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007f48: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2007f4c: 80 a0 a0 00 cmp %g2, 0 2007f50: 12 bf ff f5 bne 2007f24 2007f54: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2007f58: 10 bf ff d1 b 2007e9c 2007f5c: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007f60: 10 bf ff f6 b 2007f38 <== NOT EXECUTED 2007f64: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 0200950c : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 200950c: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 2009510: 80 a6 20 00 cmp %i0, 0 2009514: 02 80 00 20 be 2009594 <== NEVER TAKEN 2009518: 37 00 80 80 sethi %hi(0x2020000), %i3 200951c: b6 16 e3 9c or %i3, 0x39c, %i3 ! 202039c <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 2009520: b4 06 e0 0c add %i3, 0xc, %i2 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 2009524: c2 06 c0 00 ld [ %i3 ], %g1 2009528: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 200952c: 80 a7 20 00 cmp %i4, 0 2009530: 22 80 00 16 be,a 2009588 2009534: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009538: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 200953c: 84 90 60 00 orcc %g1, 0, %g2 2009540: 22 80 00 12 be,a 2009588 2009544: b6 06 e0 04 add %i3, 4, %i3 2009548: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 200954c: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 2009550: 83 2f 60 02 sll %i5, 2, %g1 2009554: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 2009558: 90 90 60 00 orcc %g1, 0, %o0 200955c: 02 80 00 05 be 2009570 2009560: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 2009564: 9f c6 00 00 call %i0 2009568: 01 00 00 00 nop 200956c: c4 17 20 10 lduh [ %i4 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009570: 83 28 a0 10 sll %g2, 0x10, %g1 2009574: 83 30 60 10 srl %g1, 0x10, %g1 2009578: 80 a0 40 1d cmp %g1, %i5 200957c: 3a bf ff f5 bcc,a 2009550 2009580: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 2009584: b6 06 e0 04 add %i3, 4, %i3 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2009588: 80 a6 c0 1a cmp %i3, %i2 200958c: 32 bf ff e7 bne,a 2009528 2009590: c2 06 c0 00 ld [ %i3 ], %g1 2009594: 81 c7 e0 08 ret 2009598: 81 e8 00 00 restore =============================================================================== 0200815c : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 200815c: 9d e3 bf a0 save %sp, -96, %sp 2008160: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 2008164: 80 a6 a0 00 cmp %i2, 0 2008168: 02 80 00 21 be 20081ec 200816c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008170: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 2008174: b0 10 20 0a mov 0xa, %i0 * Validate parameters and look up information structure. */ if ( !info ) return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008178: 40 00 07 76 call 2009f50 <_Objects_Get_information> 200817c: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 2008180: 80 a2 20 00 cmp %o0, 0 2008184: 02 80 00 1a be 20081ec 2008188: 01 00 00 00 nop /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 200818c: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 2008190: c8 12 20 10 lduh [ %o0 + 0x10 ], %g4 return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 2008194: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008198: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 200819c: c4 26 a0 04 st %g2, [ %i2 + 4 ] return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 20081a0: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 20081a4: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 20081a8: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 20081ac: 80 a1 20 00 cmp %g4, 0 20081b0: 02 80 00 0d be 20081e4 <== NEVER TAKEN 20081b4: 84 10 20 00 clr %g2 20081b8: de 02 20 1c ld [ %o0 + 0x1c ], %o7 20081bc: 86 10 20 01 mov 1, %g3 20081c0: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 20081c4: 87 28 e0 02 sll %g3, 2, %g3 20081c8: c6 03 c0 03 ld [ %o7 + %g3 ], %g3 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 20081cc: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 20081d0: 80 a0 00 03 cmp %g0, %g3 20081d4: 84 60 bf ff subx %g2, -1, %g2 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 20081d8: 80 a1 00 01 cmp %g4, %g1 20081dc: 1a bf ff fa bcc 20081c4 20081e0: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 20081e4: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 20081e8: b0 10 20 00 clr %i0 } 20081ec: 81 c7 e0 08 ret 20081f0: 81 e8 00 00 restore =============================================================================== 02013db8 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2013db8: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013dbc: 80 a6 20 00 cmp %i0, 0 2013dc0: 12 80 00 04 bne 2013dd0 2013dc4: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013dc8: 81 c7 e0 08 ret 2013dcc: 91 e8 00 01 restore %g0, %g1, %o0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) return RTEMS_INVALID_NAME; if ( !starting_address ) 2013dd0: 80 a6 60 00 cmp %i1, 0 2013dd4: 02 bf ff fd be 2013dc8 2013dd8: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013ddc: 80 a7 60 00 cmp %i5, 0 2013de0: 02 bf ff fa be 2013dc8 <== NEVER TAKEN 2013de4: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013de8: 02 bf ff f8 be 2013dc8 2013dec: 82 10 20 08 mov 8, %g1 2013df0: 80 a6 a0 00 cmp %i2, 0 2013df4: 02 bf ff f5 be 2013dc8 2013df8: 80 a6 80 1b cmp %i2, %i3 2013dfc: 0a bf ff f3 bcs 2013dc8 2013e00: 80 8e e0 07 btst 7, %i3 2013e04: 12 bf ff f1 bne 2013dc8 2013e08: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2013e0c: 12 bf ff ef bne 2013dc8 2013e10: 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++; 2013e14: 03 00 80 f7 sethi %hi(0x203dc00), %g1 2013e18: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 203dcc0 <_Thread_Dispatch_disable_level> 2013e1c: 84 00 a0 01 inc %g2 2013e20: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2013e24: c2 00 60 c0 ld [ %g1 + 0xc0 ], %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 ); 2013e28: 23 00 80 f6 sethi %hi(0x203d800), %l1 2013e2c: 40 00 13 4e call 2018b64 <_Objects_Allocate> 2013e30: 90 14 62 d4 or %l1, 0x2d4, %o0 ! 203dad4 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2013e34: a0 92 20 00 orcc %o0, 0, %l0 2013e38: 02 80 00 1a be 2013ea0 2013e3c: 92 10 00 1b mov %i3, %o1 #endif the_partition->starting_address = starting_address; the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; 2013e40: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2013e44: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2013e48: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2013e4c: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2013e50: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2013e54: 40 00 65 d3 call 202d5a0 <.udiv> 2013e58: 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, 2013e5c: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2013e60: 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, 2013e64: 96 10 00 1b mov %i3, %o3 2013e68: b8 04 20 24 add %l0, 0x24, %i4 2013e6c: 40 00 0c d9 call 20171d0 <_Chain_Initialize> 2013e70: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e74: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013e78: a2 14 62 d4 or %l1, 0x2d4, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e7c: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e80: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e84: 85 28 a0 02 sll %g2, 2, %g2 2013e88: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2013e8c: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2013e90: 40 00 18 58 call 2019ff0 <_Thread_Enable_dispatch> 2013e94: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2013e98: 10 bf ff cc b 2013dc8 2013e9c: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2013ea0: 40 00 18 54 call 2019ff0 <_Thread_Enable_dispatch> 2013ea4: 01 00 00 00 nop return RTEMS_TOO_MANY; 2013ea8: 10 bf ff c8 b 2013dc8 2013eac: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 020075c8 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 20075c8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get ( Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) 20075cc: 11 00 80 7d sethi %hi(0x201f400), %o0 20075d0: 92 10 00 18 mov %i0, %o1 20075d4: 90 12 22 74 or %o0, 0x274, %o0 20075d8: 40 00 09 71 call 2009b9c <_Objects_Get> 20075dc: 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 ) { 20075e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20075e4: 80 a0 60 00 cmp %g1, 0 20075e8: 12 80 00 0d bne 200761c 20075ec: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 20075f0: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20075f4: 39 00 80 7f sethi %hi(0x201fc00), %i4 20075f8: b8 17 21 18 or %i4, 0x118, %i4 ! 201fd18 <_Per_CPU_Information> 20075fc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007600: 80 a0 80 01 cmp %g2, %g1 2007604: 02 80 00 08 be 2007624 2007608: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 200760c: 40 00 0d 2c call 200aabc <_Thread_Enable_dispatch> 2007610: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2007614: 81 c7 e0 08 ret 2007618: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200761c: 81 c7 e0 08 ret 2007620: 91 e8 20 04 restore %g0, 4, %o0 if ( !_Thread_Is_executing( the_period->owner ) ) { _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { 2007624: 12 80 00 0e bne 200765c 2007628: 01 00 00 00 nop switch ( the_period->state ) { 200762c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007630: 80 a0 60 04 cmp %g1, 4 2007634: 18 80 00 06 bgu 200764c <== NEVER TAKEN 2007638: b0 10 20 00 clr %i0 200763c: 83 28 60 02 sll %g1, 2, %g1 2007640: 05 00 80 75 sethi %hi(0x201d400), %g2 2007644: 84 10 a0 6c or %g2, 0x6c, %g2 ! 201d46c 2007648: f0 00 80 01 ld [ %g2 + %g1 ], %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 200764c: 40 00 0d 1c call 200aabc <_Thread_Enable_dispatch> 2007650: 01 00 00 00 nop return RTEMS_TIMEOUT; 2007654: 81 c7 e0 08 ret 2007658: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 200765c: 7f ff ed e3 call 2002de8 2007660: 01 00 00 00 nop 2007664: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2007668: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 200766c: 80 a6 e0 00 cmp %i3, 0 2007670: 02 80 00 14 be 20076c0 2007674: 80 a6 e0 02 cmp %i3, 2 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 2007678: 02 80 00 29 be 200771c 200767c: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2007680: 12 bf ff e5 bne 2007614 <== NEVER TAKEN 2007684: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2007688: 7f ff ff 92 call 20074d0 <_Rate_monotonic_Update_statistics> 200768c: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 2007690: 7f ff ed da call 2002df8 2007694: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007698: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200769c: 92 07 60 10 add %i5, 0x10, %o1 20076a0: 11 00 80 7e sethi %hi(0x201f800), %o0 the_period->next_length = length; 20076a4: f2 27 60 3c st %i1, [ %i5 + 0x3c ] 20076a8: 90 12 20 a4 or %o0, 0xa4, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 20076ac: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076b0: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076b4: 40 00 11 53 call 200bc00 <_Watchdog_Insert> 20076b8: b0 10 20 06 mov 6, %i0 20076bc: 30 bf ff e4 b,a 200764c return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 20076c0: 7f ff ed ce call 2002df8 20076c4: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20076c8: 7f ff ff 68 call 2007468 <_Rate_monotonic_Initiate_statistics> 20076cc: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20076d0: 82 10 20 02 mov 2, %g1 20076d4: 92 07 60 10 add %i5, 0x10, %o1 20076d8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20076dc: 11 00 80 7e sethi %hi(0x201f800), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076e0: 03 00 80 1e sethi %hi(0x2007800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076e4: 90 12 20 a4 or %o0, 0xa4, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076e8: 82 10 62 70 or %g1, 0x270, %g1 the_watchdog->id = id; 20076ec: f0 27 60 30 st %i0, [ %i5 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076f0: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20076f4: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 20076f8: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 20076fc: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007700: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007704: 40 00 11 3f call 200bc00 <_Watchdog_Insert> 2007708: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 200770c: 40 00 0c ec call 200aabc <_Thread_Enable_dispatch> 2007710: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2007714: 81 c7 e0 08 ret 2007718: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 200771c: 7f ff ff 6d call 20074d0 <_Rate_monotonic_Update_statistics> 2007720: 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; 2007724: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007728: 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; 200772c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007730: 7f ff ed b2 call 2002df8 2007734: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007738: c2 07 20 0c ld [ %i4 + 0xc ], %g1 200773c: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007740: 90 10 00 01 mov %g1, %o0 2007744: 13 00 00 10 sethi %hi(0x4000), %o1 2007748: 40 00 0f 38 call 200b428 <_Thread_Set_state> 200774c: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007750: 7f ff ed a6 call 2002de8 2007754: 01 00 00 00 nop local_state = the_period->state; 2007758: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 200775c: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007760: 7f ff ed a6 call 2002df8 2007764: 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 ) 2007768: 80 a6 a0 03 cmp %i2, 3 200776c: 22 80 00 06 be,a 2007784 2007770: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 2007774: 40 00 0c d2 call 200aabc <_Thread_Enable_dispatch> 2007778: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200777c: 81 c7 e0 08 ret 2007780: 81 e8 00 00 restore /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007784: 40 00 0b db call 200a6f0 <_Thread_Clear_state> 2007788: 13 00 00 10 sethi %hi(0x4000), %o1 200778c: 30 bf ff fa b,a 2007774 =============================================================================== 02007790 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007790: 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 ) 2007794: 80 a6 60 00 cmp %i1, 0 2007798: 02 80 00 48 be 20078b8 <== NEVER TAKEN 200779c: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 20077a0: 13 00 80 75 sethi %hi(0x201d400), %o1 20077a4: 9f c6 40 00 call %i1 20077a8: 92 12 60 80 or %o1, 0x80, %o1 ! 201d480 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 20077ac: 90 10 00 18 mov %i0, %o0 20077b0: 13 00 80 75 sethi %hi(0x201d400), %o1 20077b4: 9f c6 40 00 call %i1 20077b8: 92 12 60 a0 or %o1, 0xa0, %o1 ! 201d4a0 (*print)( context, "--- Wall times are in seconds ---\n" ); 20077bc: 90 10 00 18 mov %i0, %o0 20077c0: 13 00 80 75 sethi %hi(0x201d400), %o1 20077c4: 9f c6 40 00 call %i1 20077c8: 92 12 60 c8 or %o1, 0xc8, %o1 ! 201d4c8 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 20077cc: 90 10 00 18 mov %i0, %o0 20077d0: 13 00 80 75 sethi %hi(0x201d400), %o1 20077d4: 9f c6 40 00 call %i1 20077d8: 92 12 60 f0 or %o1, 0xf0, %o1 ! 201d4f0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 20077dc: 90 10 00 18 mov %i0, %o0 20077e0: 13 00 80 75 sethi %hi(0x201d400), %o1 20077e4: 9f c6 40 00 call %i1 20077e8: 92 12 61 40 or %o1, 0x140, %o1 ! 201d540 /* * 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 ; 20077ec: 39 00 80 7d sethi %hi(0x201f400), %i4 20077f0: b8 17 22 74 or %i4, 0x274, %i4 ! 201f674 <_Rate_monotonic_Information> 20077f4: fa 07 20 08 ld [ %i4 + 8 ], %i5 20077f8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20077fc: 80 a7 40 01 cmp %i5, %g1 2007800: 18 80 00 2e bgu 20078b8 <== NEVER TAKEN 2007804: 35 00 80 75 sethi %hi(0x201d400), %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 2007808: 23 00 80 75 sethi %hi(0x201d400), %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 200780c: 21 00 80 75 sethi %hi(0x201d400), %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007810: 37 00 80 71 sethi %hi(0x201c400), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007814: b4 16 a1 90 or %i2, 0x190, %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 2007818: a2 14 61 a8 or %l1, 0x1a8, %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 200781c: a0 14 21 c8 or %l0, 0x1c8, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007820: 10 80 00 06 b 2007838 2007824: b6 16 e2 f0 or %i3, 0x2f0, %i3 * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2007828: 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 ; 200782c: 80 a0 40 1d cmp %g1, %i5 2007830: 0a 80 00 22 bcs 20078b8 2007834: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007838: 90 10 00 1d mov %i5, %o0 200783c: 40 00 1b c2 call 200e744 2007840: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 2007844: 80 a2 20 00 cmp %o0, 0 2007848: 32 bf ff f8 bne,a 2007828 200784c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 #if defined(RTEMS_DEBUG) status = rtems_rate_monotonic_get_status( id, &the_status ); if ( status != RTEMS_SUCCESSFUL ) continue; #else (void) rtems_rate_monotonic_get_status( id, &the_status ); 2007850: 92 07 bf d8 add %fp, -40, %o1 2007854: 40 00 1b eb call 200e800 2007858: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 200785c: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007860: 92 10 20 05 mov 5, %o1 2007864: 40 00 00 b4 call 2007b34 2007868: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200786c: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2007870: 92 10 00 1a mov %i2, %o1 2007874: 94 10 00 1d mov %i5, %o2 2007878: 90 10 00 18 mov %i0, %o0 200787c: 9f c6 40 00 call %i1 2007880: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007884: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2007888: 94 07 bf f0 add %fp, -16, %o2 200788c: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007890: 80 a0 60 00 cmp %g1, 0 2007894: 12 80 00 0b bne 20078c0 2007898: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 200789c: 9f c6 40 00 call %i1 20078a0: 90 10 00 18 mov %i0, %o0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20078a4: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20078a8: 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 ; 20078ac: 80 a0 40 1d cmp %g1, %i5 20078b0: 1a bf ff e3 bcc 200783c <== ALWAYS TAKEN 20078b4: 90 10 00 1d mov %i5, %o0 20078b8: 81 c7 e0 08 ret 20078bc: 81 e8 00 00 restore struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 20078c0: 40 00 0f 94 call 200b710 <_Timespec_Divide_by_integer> 20078c4: 92 10 00 01 mov %g1, %o1 (*print)( context, 20078c8: d0 07 bf ac ld [ %fp + -84 ], %o0 20078cc: 40 00 4a 0e call 201a104 <.div> 20078d0: 92 10 23 e8 mov 0x3e8, %o1 20078d4: aa 10 00 08 mov %o0, %l5 20078d8: d0 07 bf b4 ld [ %fp + -76 ], %o0 20078dc: 40 00 4a 0a call 201a104 <.div> 20078e0: 92 10 23 e8 mov 0x3e8, %o1 20078e4: c2 07 bf f0 ld [ %fp + -16 ], %g1 20078e8: a6 10 00 08 mov %o0, %l3 20078ec: d0 07 bf f4 ld [ %fp + -12 ], %o0 20078f0: e4 07 bf a8 ld [ %fp + -88 ], %l2 20078f4: e8 07 bf b0 ld [ %fp + -80 ], %l4 20078f8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20078fc: 40 00 4a 02 call 201a104 <.div> 2007900: 92 10 23 e8 mov 0x3e8, %o1 2007904: 96 10 00 15 mov %l5, %o3 2007908: 98 10 00 14 mov %l4, %o4 200790c: 9a 10 00 13 mov %l3, %o5 2007910: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007914: 92 10 00 11 mov %l1, %o1 2007918: 94 10 00 12 mov %l2, %o2 200791c: 9f c6 40 00 call %i1 2007920: 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); 2007924: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007928: 94 07 bf f0 add %fp, -16, %o2 200792c: 40 00 0f 79 call 200b710 <_Timespec_Divide_by_integer> 2007930: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2007934: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007938: 40 00 49 f3 call 201a104 <.div> 200793c: 92 10 23 e8 mov 0x3e8, %o1 2007940: a8 10 00 08 mov %o0, %l4 2007944: d0 07 bf cc ld [ %fp + -52 ], %o0 2007948: 40 00 49 ef call 201a104 <.div> 200794c: 92 10 23 e8 mov 0x3e8, %o1 2007950: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007954: a4 10 00 08 mov %o0, %l2 2007958: d0 07 bf f4 ld [ %fp + -12 ], %o0 200795c: ea 07 bf c0 ld [ %fp + -64 ], %l5 2007960: e6 07 bf c8 ld [ %fp + -56 ], %l3 2007964: 92 10 23 e8 mov 0x3e8, %o1 2007968: 40 00 49 e7 call 201a104 <.div> 200796c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007970: 92 10 00 10 mov %l0, %o1 2007974: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007978: 94 10 00 15 mov %l5, %o2 200797c: 90 10 00 18 mov %i0, %o0 2007980: 96 10 00 14 mov %l4, %o3 2007984: 98 10 00 13 mov %l3, %o4 2007988: 9f c6 40 00 call %i1 200798c: 9a 10 00 12 mov %l2, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2007990: 10 bf ff a6 b 2007828 2007994: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 020079b0 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 20079b0: 9d e3 bf a0 save %sp, -96, %sp /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20079b4: 03 00 80 7d sethi %hi(0x201f400), %g1 20079b8: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ! 201f7e0 <_Thread_Dispatch_disable_level> 20079bc: 84 00 a0 01 inc %g2 20079c0: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] return _Thread_Dispatch_disable_level; 20079c4: c2 00 63 e0 ld [ %g1 + 0x3e0 ], %g1 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079c8: 39 00 80 7d sethi %hi(0x201f400), %i4 20079cc: b8 17 22 74 or %i4, 0x274, %i4 ! 201f674 <_Rate_monotonic_Information> 20079d0: fa 07 20 08 ld [ %i4 + 8 ], %i5 20079d4: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20079d8: 80 a7 40 01 cmp %i5, %g1 20079dc: 18 80 00 09 bgu 2007a00 <== NEVER TAKEN 20079e0: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 20079e4: 40 00 00 09 call 2007a08 20079e8: 90 10 00 1d mov %i5, %o0 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079ec: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20079f0: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079f4: 80 a0 40 1d cmp %g1, %i5 20079f8: 1a bf ff fb bcc 20079e4 20079fc: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2007a00: 40 00 0c 2f call 200aabc <_Thread_Enable_dispatch> 2007a04: 81 e8 00 00 restore =============================================================================== 02015374 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2015374: 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 ) 2015378: 80 a6 60 00 cmp %i1, 0 201537c: 12 80 00 04 bne 201538c 2015380: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015384: 81 c7 e0 08 ret 2015388: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 201538c: 90 10 00 18 mov %i0, %o0 2015390: 40 00 13 24 call 201a020 <_Thread_Get> 2015394: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2015398: c2 07 bf fc ld [ %fp + -4 ], %g1 201539c: 80 a0 60 00 cmp %g1, 0 20153a0: 12 80 00 20 bne 2015420 20153a4: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20153a8: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 20153ac: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20153b0: 80 a0 60 00 cmp %g1, 0 20153b4: 02 80 00 1e be 201542c 20153b8: 01 00 00 00 nop if ( asr->is_enabled ) { 20153bc: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 20153c0: 80 a0 60 00 cmp %g1, 0 20153c4: 02 80 00 1e be 201543c 20153c8: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 20153cc: 7f ff e6 93 call 200ee18 20153d0: 01 00 00 00 nop *signal_set |= signals; 20153d4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20153d8: b2 10 40 19 or %g1, %i1, %i1 20153dc: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 20153e0: 7f ff e6 92 call 200ee28 20153e4: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20153e8: 03 00 80 f8 sethi %hi(0x203e000), %g1 20153ec: 82 10 62 00 or %g1, 0x200, %g1 ! 203e200 <_Per_CPU_Information> 20153f0: c4 00 60 08 ld [ %g1 + 8 ], %g2 20153f4: 80 a0 a0 00 cmp %g2, 0 20153f8: 02 80 00 06 be 2015410 20153fc: 01 00 00 00 nop 2015400: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015404: 80 a7 00 02 cmp %i4, %g2 2015408: 02 80 00 15 be 201545c <== ALWAYS TAKEN 201540c: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015410: 40 00 12 f8 call 2019ff0 <_Thread_Enable_dispatch> 2015414: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2015418: 10 bf ff db b 2015384 201541c: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2015420: 82 10 20 04 mov 4, %g1 } 2015424: 81 c7 e0 08 ret 2015428: 91 e8 00 01 restore %g0, %g1, %o0 _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 201542c: 40 00 12 f1 call 2019ff0 <_Thread_Enable_dispatch> 2015430: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2015434: 10 bf ff d4 b 2015384 2015438: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201543c: 7f ff e6 77 call 200ee18 2015440: 01 00 00 00 nop *signal_set |= signals; 2015444: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2015448: b2 10 40 19 or %g1, %i1, %i1 201544c: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2015450: 7f ff e6 76 call 200ee28 2015454: 01 00 00 00 nop 2015458: 30 bf ff ee b,a 2015410 if ( ! _ASR_Is_null_handler( asr->handler ) ) { if ( asr->is_enabled ) { _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; 201545c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015460: 30 bf ff ec b,a 2015410 =============================================================================== 0200f300 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200f300: 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 ) 200f304: 80 a6 a0 00 cmp %i2, 0 200f308: 02 80 00 3b be 200f3f4 200f30c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200f310: 21 00 80 77 sethi %hi(0x201dc00), %l0 200f314: a0 14 22 88 or %l0, 0x288, %l0 ! 201de88 <_Per_CPU_Information> 200f318: fa 04 20 0c ld [ %l0 + 0xc ], %i5 api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f31c: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f320: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f324: 80 a0 00 02 cmp %g0, %g2 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200f328: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f32c: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f330: 80 a0 60 00 cmp %g1, 0 200f334: 12 80 00 40 bne 200f434 200f338: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f33c: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 200f340: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200f344: 7f ff ed 4d call 200a878 <_CPU_ISR_Get_level> 200f348: a2 60 3f ff subx %g0, -1, %l1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f34c: a3 2c 60 0a sll %l1, 0xa, %l1 200f350: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200f354: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200f358: 80 8e 61 00 btst 0x100, %i1 200f35c: 02 80 00 06 be 200f374 200f360: 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; 200f364: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200f368: 80 a0 00 01 cmp %g0, %g1 200f36c: 82 60 3f ff subx %g0, -1, %g1 200f370: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200f374: 80 8e 62 00 btst 0x200, %i1 200f378: 12 80 00 21 bne 200f3fc 200f37c: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f380: 80 8e 60 0f btst 0xf, %i1 200f384: 12 80 00 27 bne 200f420 200f388: 01 00 00 00 nop * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 200f38c: 80 8e 64 00 btst 0x400, %i1 200f390: 02 80 00 14 be 200f3e0 200f394: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200f398: c4 0f 20 08 ldub [ %i4 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 200f39c: b0 0e 24 00 and %i0, 0x400, %i0 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 200f3a0: 80 a0 00 18 cmp %g0, %i0 200f3a4: 82 60 3f ff subx %g0, -1, %g1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200f3a8: 80 a0 80 01 cmp %g2, %g1 200f3ac: 22 80 00 0e be,a 200f3e4 200f3b0: 03 00 80 76 sethi %hi(0x201d800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200f3b4: 7f ff cb 75 call 2002188 200f3b8: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 200f3bc: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200f3c0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 200f3c4: c4 27 20 14 st %g2, [ %i4 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 200f3c8: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200f3cc: 7f ff cb 73 call 2002198 200f3d0: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200f3d4: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200f3d8: 80 a0 00 01 cmp %g0, %g1 200f3dc: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200f3e0: 03 00 80 76 sethi %hi(0x201d800), %g1 200f3e4: c4 00 62 ac ld [ %g1 + 0x2ac ], %g2 ! 201daac <_System_state_Current> 200f3e8: 80 a0 a0 03 cmp %g2, 3 200f3ec: 02 80 00 1f be 200f468 200f3f0: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 200f3f4: 81 c7 e0 08 ret 200f3f8: 91 e8 00 01 restore %g0, %g1, %o0 */ if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { 200f3fc: 22 bf ff e1 be,a 200f380 200f400: c0 27 60 7c clr [ %i5 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200f404: 03 00 80 76 sethi %hi(0x201d800), %g1 200f408: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201d8b4 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f40c: 80 8e 60 0f btst 0xf, %i1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200f410: c2 27 60 78 st %g1, [ %i5 + 0x78 ] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200f414: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f418: 02 bf ff dd be 200f38c 200f41c: c2 27 60 7c st %g1, [ %i5 + 0x7c ] */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 200f420: 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 ) ); 200f424: 7f ff cb 5d call 2002198 200f428: 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 ) { 200f42c: 10 bf ff d9 b 200f390 200f430: 80 8e 64 00 btst 0x400, %i1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f434: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200f438: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f43c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200f440: 7f ff ed 0e call 200a878 <_CPU_ISR_Get_level> 200f444: a2 60 3f ff subx %g0, -1, %l1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f448: a3 2c 60 0a sll %l1, 0xa, %l1 200f44c: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200f450: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200f454: 80 8e 61 00 btst 0x100, %i1 200f458: 02 bf ff c7 be 200f374 200f45c: 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; 200f460: 10 bf ff c2 b 200f368 200f464: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 200f468: 80 88 e0 ff btst 0xff, %g3 200f46c: 12 80 00 0a bne 200f494 200f470: c4 04 20 0c ld [ %l0 + 0xc ], %g2 200f474: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 200f478: 80 a0 80 03 cmp %g2, %g3 200f47c: 02 bf ff de be 200f3f4 200f480: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200f484: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200f488: 80 a0 a0 00 cmp %g2, 0 200f48c: 02 bf ff da be 200f3f4 <== NEVER TAKEN 200f490: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200f494: 82 10 20 01 mov 1, %g1 ! 1 200f498: c2 2c 20 18 stb %g1, [ %l0 + 0x18 ] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200f49c: 7f ff e7 20 call 200911c <_Thread_Dispatch> 200f4a0: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200f4a4: 82 10 20 00 clr %g1 ! 0 } 200f4a8: 81 c7 e0 08 ret 200f4ac: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200b1ac : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200b1ac: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200b1b0: 80 a6 60 00 cmp %i1, 0 200b1b4: 02 80 00 07 be 200b1d0 200b1b8: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200b1bc: 03 00 80 69 sethi %hi(0x201a400), %g1 200b1c0: c2 08 63 cc ldub [ %g1 + 0x3cc ], %g1 ! 201a7cc */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200b1c4: 80 a6 40 01 cmp %i1, %g1 200b1c8: 18 80 00 1c bgu 200b238 200b1cc: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200b1d0: 80 a6 a0 00 cmp %i2, 0 200b1d4: 02 80 00 19 be 200b238 200b1d8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200b1dc: 40 00 09 df call 200d958 <_Thread_Get> 200b1e0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b1e4: c2 07 bf fc ld [ %fp + -4 ], %g1 200b1e8: 80 a0 60 00 cmp %g1, 0 200b1ec: 12 80 00 13 bne 200b238 200b1f0: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b1f4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b1f8: 80 a6 60 00 cmp %i1, 0 200b1fc: 02 80 00 0d be 200b230 200b200: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b204: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b208: 80 a0 60 00 cmp %g1, 0 200b20c: 02 80 00 06 be 200b224 200b210: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200b214: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b218: 80 a6 40 01 cmp %i1, %g1 200b21c: 1a 80 00 05 bcc 200b230 <== ALWAYS TAKEN 200b220: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200b224: 92 10 00 19 mov %i1, %o1 200b228: 40 00 08 82 call 200d430 <_Thread_Change_priority> 200b22c: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b230: 40 00 09 be call 200d928 <_Thread_Enable_dispatch> 200b234: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200b238: 81 c7 e0 08 ret 200b23c: 81 e8 00 00 restore =============================================================================== 02007604 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 2007604: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 2007608: 80 a6 60 00 cmp %i1, 0 200760c: 02 80 00 1e be 2007684 2007610: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 2007614: 90 10 00 18 mov %i0, %o0 2007618: 40 00 09 62 call 2009ba0 <_Thread_Get> 200761c: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007620: c2 07 bf fc ld [ %fp + -4 ], %g1 2007624: 80 a0 60 00 cmp %g1, 0 2007628: 12 80 00 19 bne 200768c 200762c: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2007630: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2007634: 80 a0 60 00 cmp %g1, 0 2007638: 02 80 00 10 be 2007678 200763c: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007640: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007644: 80 a0 80 19 cmp %g2, %i1 2007648: 32 80 00 09 bne,a 200766c 200764c: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2007650: 10 80 00 18 b 20076b0 2007654: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2007658: 80 a0 80 19 cmp %g2, %i1 200765c: 22 80 00 0e be,a 2007694 2007660: c4 02 40 00 ld [ %o1 ], %g2 2007664: 82 10 00 09 mov %o1, %g1 _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; 2007668: d2 00 40 00 ld [ %g1 ], %o1 the_thread = _Thread_Get (tid, &location); switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { 200766c: 80 a2 60 00 cmp %o1, 0 2007670: 32 bf ff fa bne,a 2007658 <== ALWAYS TAKEN 2007674: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2007678: 40 00 09 3e call 2009b70 <_Thread_Enable_dispatch> 200767c: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2007680: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007684: 81 c7 e0 08 ret 2007688: 91 e8 00 01 restore %g0, %g1, %o0 200768c: 81 c7 e0 08 ret 2007690: 91 e8 00 01 restore %g0, %g1, %o0 case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; 2007694: c4 20 40 00 st %g2, [ %g1 ] else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); 2007698: 40 00 00 2d call 200774c <_RTEMS_Tasks_Invoke_task_variable_dtor> 200769c: 01 00 00 00 nop _Thread_Enable_dispatch(); 20076a0: 40 00 09 34 call 2009b70 <_Thread_Enable_dispatch> 20076a4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20076a8: 10 bf ff f7 b 2007684 20076ac: 82 10 20 00 clr %g1 ! 0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 20076b0: 92 10 00 01 mov %g1, %o1 20076b4: 10 bf ff f9 b 2007698 20076b8: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020076bc : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20076bc: 9d e3 bf 98 save %sp, -104, %sp 20076c0: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 20076c4: 80 a6 60 00 cmp %i1, 0 20076c8: 02 80 00 1b be 2007734 20076cc: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 20076d0: 80 a6 a0 00 cmp %i2, 0 20076d4: 02 80 00 1c be 2007744 20076d8: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20076dc: 40 00 09 31 call 2009ba0 <_Thread_Get> 20076e0: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20076e4: c2 07 bf fc ld [ %fp + -4 ], %g1 20076e8: 80 a0 60 00 cmp %g1, 0 20076ec: 12 80 00 12 bne 2007734 20076f0: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 20076f4: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 20076f8: 80 a0 60 00 cmp %g1, 0 20076fc: 32 80 00 07 bne,a 2007718 2007700: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007704: 30 80 00 0e b,a 200773c 2007708: 80 a0 60 00 cmp %g1, 0 200770c: 02 80 00 0c be 200773c <== NEVER TAKEN 2007710: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007714: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007718: 80 a0 80 19 cmp %g2, %i1 200771c: 32 bf ff fb bne,a 2007708 2007720: c2 00 40 00 ld [ %g1 ], %g1 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; 2007724: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 2007728: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 200772c: 40 00 09 11 call 2009b70 <_Thread_Enable_dispatch> 2007730: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2007734: 81 c7 e0 08 ret 2007738: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 200773c: 40 00 09 0d call 2009b70 <_Thread_Enable_dispatch> 2007740: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 2007744: 81 c7 e0 08 ret 2007748: 81 e8 00 00 restore =============================================================================== 02015dd4 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2015dd4: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015dd8: 11 00 80 f9 sethi %hi(0x203e400), %o0 2015ddc: 92 10 00 18 mov %i0, %o1 2015de0: 90 12 22 34 or %o0, 0x234, %o0 2015de4: 40 00 0c bb call 20190d0 <_Objects_Get> 2015de8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015dec: c2 07 bf fc ld [ %fp + -4 ], %g1 2015df0: 80 a0 60 00 cmp %g1, 0 2015df4: 12 80 00 0c bne 2015e24 2015df8: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015dfc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015e00: 80 a0 60 04 cmp %g1, 4 2015e04: 02 80 00 04 be 2015e14 <== NEVER TAKEN 2015e08: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015e0c: 40 00 15 83 call 201b418 <_Watchdog_Remove> 2015e10: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2015e14: 40 00 10 77 call 2019ff0 <_Thread_Enable_dispatch> 2015e18: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2015e1c: 81 c7 e0 08 ret 2015e20: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015e24: 81 c7 e0 08 ret 2015e28: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 020162fc : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20162fc: 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; 2016300: 03 00 80 f9 sethi %hi(0x203e400), %g1 2016304: fa 00 62 74 ld [ %g1 + 0x274 ], %i5 ! 203e674 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016308: b8 10 00 18 mov %i0, %i4 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 201630c: 80 a7 60 00 cmp %i5, 0 2016310: 02 80 00 32 be 20163d8 2016314: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2016318: 03 00 80 f7 sethi %hi(0x203dc00), %g1 201631c: c2 08 60 d0 ldub [ %g1 + 0xd0 ], %g1 ! 203dcd0 <_TOD_Is_set> 2016320: 80 a0 60 00 cmp %g1, 0 2016324: 02 80 00 2d be 20163d8 <== NEVER TAKEN 2016328: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 201632c: 80 a6 a0 00 cmp %i2, 0 2016330: 02 80 00 2a be 20163d8 2016334: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2016338: 90 10 00 19 mov %i1, %o0 201633c: 7f ff f3 d5 call 2013290 <_TOD_Validate> 2016340: b0 10 20 14 mov 0x14, %i0 2016344: 80 8a 20 ff btst 0xff, %o0 2016348: 02 80 00 24 be 20163d8 201634c: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2016350: 7f ff f3 9c call 20131c0 <_TOD_To_seconds> 2016354: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2016358: 21 00 80 f7 sethi %hi(0x203dc00), %l0 201635c: c2 04 21 4c ld [ %l0 + 0x14c ], %g1 ! 203dd4c <_TOD_Now> 2016360: 80 a2 00 01 cmp %o0, %g1 2016364: 08 80 00 1d bleu 20163d8 2016368: b2 10 00 08 mov %o0, %i1 201636c: 92 10 00 1c mov %i4, %o1 2016370: 11 00 80 f9 sethi %hi(0x203e400), %o0 2016374: 94 07 bf fc add %fp, -4, %o2 2016378: 40 00 0b 56 call 20190d0 <_Objects_Get> 201637c: 90 12 22 34 or %o0, 0x234, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016380: c2 07 bf fc ld [ %fp + -4 ], %g1 2016384: 80 a0 60 00 cmp %g1, 0 2016388: 12 80 00 16 bne 20163e0 201638c: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2016390: 40 00 14 22 call 201b418 <_Watchdog_Remove> 2016394: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2016398: c4 04 21 4c ld [ %l0 + 0x14c ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 201639c: c2 07 60 04 ld [ %i5 + 4 ], %g1 20163a0: 92 10 00 18 mov %i0, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20163a4: b2 26 40 02 sub %i1, %g2, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 20163a8: 90 10 00 1d mov %i5, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 20163ac: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20163b0: f4 26 20 2c st %i2, [ %i0 + 0x2c ] 20163b4: c4 26 20 38 st %g2, [ %i0 + 0x38 ] the_watchdog->id = id; 20163b8: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 20163bc: f6 26 20 34 st %i3, [ %i0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20163c0: f2 26 20 1c st %i1, [ %i0 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20163c4: c0 26 20 18 clr [ %i0 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 20163c8: 9f c0 40 00 call %g1 20163cc: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20163d0: 40 00 0f 08 call 2019ff0 <_Thread_Enable_dispatch> 20163d4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20163d8: 81 c7 e0 08 ret 20163dc: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20163e0: 81 c7 e0 08 ret 20163e4: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02006cc4 : #include int sched_get_priority_max( int policy ) { 2006cc4: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006cc8: 80 a6 20 04 cmp %i0, 4 2006ccc: 08 80 00 08 bleu 2006cec 2006cd0: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006cd4: 40 00 25 45 call 20101e8 <__errno> 2006cd8: b0 10 3f ff mov -1, %i0 2006cdc: 82 10 20 16 mov 0x16, %g1 2006ce0: c2 22 00 00 st %g1, [ %o0 ] 2006ce4: 81 c7 e0 08 ret 2006ce8: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2006cec: b1 28 40 18 sll %g1, %i0, %i0 2006cf0: 80 8e 20 17 btst 0x17, %i0 2006cf4: 02 bf ff f8 be 2006cd4 <== NEVER TAKEN 2006cf8: 03 00 80 75 sethi %hi(0x201d400), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2006cfc: f0 08 62 cc ldub [ %g1 + 0x2cc ], %i0 ! 201d6cc } 2006d00: 81 c7 e0 08 ret 2006d04: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006d08 : #include int sched_get_priority_min( int policy ) { 2006d08: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006d0c: 80 a6 20 04 cmp %i0, 4 2006d10: 08 80 00 09 bleu 2006d34 2006d14: 84 10 20 01 mov 1, %g2 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006d18: 40 00 25 34 call 20101e8 <__errno> 2006d1c: 01 00 00 00 nop 2006d20: 82 10 3f ff mov -1, %g1 ! ffffffff 2006d24: 84 10 20 16 mov 0x16, %g2 2006d28: c4 22 00 00 st %g2, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006d2c: 81 c7 e0 08 ret 2006d30: 91 e8 00 01 restore %g0, %g1, %o0 int sched_get_priority_min( int policy ) { switch ( policy ) { 2006d34: b1 28 80 18 sll %g2, %i0, %i0 2006d38: 80 8e 20 17 btst 0x17, %i0 2006d3c: 02 bf ff f7 be 2006d18 <== NEVER TAKEN 2006d40: 82 10 20 01 mov 1, %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006d44: 81 c7 e0 08 ret 2006d48: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006d4c : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2006d4c: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006d50: 80 a6 20 00 cmp %i0, 0 2006d54: 12 80 00 0a bne 2006d7c <== ALWAYS TAKEN 2006d58: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 2006d5c: 02 80 00 13 be 2006da8 2006d60: 03 00 80 78 sethi %hi(0x201e000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006d64: d0 00 63 14 ld [ %g1 + 0x314 ], %o0 ! 201e314 <_Thread_Ticks_per_timeslice> 2006d68: 92 10 00 19 mov %i1, %o1 2006d6c: 40 00 0f 5e call 200aae4 <_Timespec_From_ticks> 2006d70: b0 10 20 00 clr %i0 return 0; } 2006d74: 81 c7 e0 08 ret 2006d78: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006d7c: 7f ff f1 5c call 20032ec 2006d80: 01 00 00 00 nop 2006d84: 80 a2 00 18 cmp %o0, %i0 2006d88: 02 bf ff f5 be 2006d5c 2006d8c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2006d90: 40 00 25 16 call 20101e8 <__errno> 2006d94: b0 10 3f ff mov -1, %i0 2006d98: 82 10 20 03 mov 3, %g1 2006d9c: c2 22 00 00 st %g1, [ %o0 ] 2006da0: 81 c7 e0 08 ret 2006da4: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006da8: 40 00 25 10 call 20101e8 <__errno> 2006dac: b0 10 3f ff mov -1, %i0 2006db0: 82 10 20 16 mov 0x16, %g1 2006db4: c2 22 00 00 st %g1, [ %o0 ] 2006db8: 81 c7 e0 08 ret 2006dbc: 81 e8 00 00 restore =============================================================================== 02009608 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2009608: 9d e3 bf 90 save %sp, -112, %sp /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200960c: 03 00 80 8c sethi %hi(0x2023000), %g1 2009610: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2023360 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2009614: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2009618: 84 00 a0 01 inc %g2 200961c: c4 20 63 60 st %g2, [ %g1 + 0x360 ] return _Thread_Dispatch_disable_level; 2009620: c2 00 63 60 ld [ %g1 + 0x360 ], %g1 2009624: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2009628: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200962c: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2009630: b8 8e 62 00 andcc %i1, 0x200, %i4 2009634: 12 80 00 25 bne 20096c8 2009638: ba 10 20 00 clr %i5 mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 200963c: 90 10 00 18 mov %i0, %o0 2009640: 40 00 1b fd call 2010634 <_POSIX_Semaphore_Name_to_id> 2009644: 92 07 bf f4 add %fp, -12, %o1 * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "semaphore does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 2009648: b6 92 20 00 orcc %o0, 0, %i3 200964c: 22 80 00 0e be,a 2009684 2009650: b2 0e 6a 00 and %i1, 0xa00, %i1 /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 2009654: 80 a6 e0 02 cmp %i3, 2 2009658: 12 80 00 04 bne 2009668 <== NEVER TAKEN 200965c: 80 a7 20 00 cmp %i4, 0 2009660: 12 80 00 1e bne 20096d8 2009664: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 2009668: 40 00 0c 83 call 200c874 <_Thread_Enable_dispatch> 200966c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 2009670: 40 00 28 89 call 2013894 <__errno> 2009674: 01 00 00 00 nop 2009678: f6 22 00 00 st %i3, [ %o0 ] 200967c: 81 c7 e0 08 ret 2009680: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2009684: 80 a6 6a 00 cmp %i1, 0xa00 2009688: 02 80 00 20 be 2009708 200968c: d2 07 bf f4 ld [ %fp + -12 ], %o1 2009690: 94 07 bf fc add %fp, -4, %o2 2009694: 11 00 80 8d sethi %hi(0x2023400), %o0 2009698: 40 00 08 bc call 200b988 <_Objects_Get> 200969c: 90 12 22 20 or %o0, 0x220, %o0 ! 2023620 <_POSIX_Semaphore_Information> _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 20096a0: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); 20096a4: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 20096a8: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 20096ac: 40 00 0c 72 call 200c874 <_Thread_Enable_dispatch> 20096b0: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 20096b4: 40 00 0c 70 call 200c874 <_Thread_Enable_dispatch> 20096b8: 01 00 00 00 nop the_semaphore->Semaphore_id = the_semaphore->Object.id; id = &the_semaphore->Semaphore_id; #else id = (sem_t *)&the_semaphore->Object.id; #endif return id; 20096bc: f0 07 bf f8 ld [ %fp + -8 ], %i0 } 20096c0: 81 c7 e0 08 ret 20096c4: 91 ee 20 08 restore %i0, 8, %o0 _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 20096c8: 82 07 a0 54 add %fp, 0x54, %g1 20096cc: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 20096d0: 10 bf ff db b 200963c 20096d4: c2 27 bf f0 st %g1, [ %fp + -16 ] /* * At this point, the semaphore does not exist and everything has been * checked. We should go ahead and create a semaphore. */ status =_POSIX_Semaphore_Create_support( 20096d8: 92 10 20 00 clr %o1 20096dc: 96 07 bf f8 add %fp, -8, %o3 20096e0: 40 00 1b 79 call 20104c4 <_POSIX_Semaphore_Create_support> 20096e4: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 20096e8: 40 00 0c 63 call 200c874 <_Thread_Enable_dispatch> 20096ec: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 20096f0: 80 a7 7f ff cmp %i5, -1 20096f4: 02 bf ff e2 be 200967c 20096f8: b0 10 3f ff mov -1, %i0 the_semaphore->Semaphore_id = the_semaphore->Object.id; id = &the_semaphore->Semaphore_id; #else id = (sem_t *)&the_semaphore->Object.id; #endif return id; 20096fc: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009700: 81 c7 e0 08 ret 2009704: 91 ee 20 08 restore %i0, 8, %o0 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); 2009708: 40 00 0c 5b call 200c874 <_Thread_Enable_dispatch> 200970c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2009710: 40 00 28 61 call 2013894 <__errno> 2009714: 01 00 00 00 nop 2009718: 82 10 20 11 mov 0x11, %g1 ! 11 200971c: c2 22 00 00 st %g1, [ %o0 ] 2009720: 81 c7 e0 08 ret 2009724: 81 e8 00 00 restore =============================================================================== 02009784 : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 2009784: 9d e3 bf 98 save %sp, -104, %sp * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2009788: 90 10 00 19 mov %i1, %o0 200978c: 40 00 18 e7 call 200fb28 <_POSIX_Absolute_timeout_to_ticks> 2009790: 92 07 bf fc add %fp, -4, %o1 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 2009794: d4 07 bf fc ld [ %fp + -4 ], %o2 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009798: 80 a2 20 03 cmp %o0, 3 200979c: 02 80 00 06 be 20097b4 <== ALWAYS TAKEN 20097a0: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 20097a4: 40 00 1b c6 call 20106bc <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 20097a8: 92 10 20 00 clr %o1 <== NOT EXECUTED 20097ac: 81 c7 e0 08 ret <== NOT EXECUTED 20097b0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 20097b4: 40 00 1b c2 call 20106bc <_POSIX_Semaphore_Wait_support> 20097b8: 92 10 20 01 mov 1, %o1 lock_status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) rtems_set_errno_and_return_minus_one( ETIMEDOUT ); } return lock_status; } 20097bc: 81 c7 e0 08 ret 20097c0: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006c3c : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 2006c3c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2006c40: 80 a6 a0 00 cmp %i2, 0 2006c44: 02 80 00 0d be 2006c78 2006c48: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 2006c4c: 05 00 80 7e sethi %hi(0x201f800), %g2 2006c50: 83 2e 20 04 sll %i0, 4, %g1 2006c54: 84 10 a1 b0 or %g2, 0x1b0, %g2 2006c58: 82 20 40 03 sub %g1, %g3, %g1 2006c5c: c6 00 80 01 ld [ %g2 + %g1 ], %g3 2006c60: 82 00 80 01 add %g2, %g1, %g1 2006c64: c6 26 80 00 st %g3, [ %i2 ] 2006c68: c4 00 60 04 ld [ %g1 + 4 ], %g2 2006c6c: c4 26 a0 04 st %g2, [ %i2 + 4 ] 2006c70: c2 00 60 08 ld [ %g1 + 8 ], %g1 2006c74: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 2006c78: 80 a6 20 00 cmp %i0, 0 2006c7c: 02 80 00 33 be 2006d48 2006c80: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006c84: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006c88: 80 a0 60 1f cmp %g1, 0x1f 2006c8c: 18 80 00 2f bgu 2006d48 2006c90: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006c94: 02 80 00 2d be 2006d48 2006c98: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006c9c: 02 80 00 1a be 2006d04 <== NEVER TAKEN 2006ca0: 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 ); 2006ca4: 7f ff ee 29 call 2002548 2006ca8: 01 00 00 00 nop 2006cac: b4 10 00 08 mov %o0, %i2 if ( act->sa_handler == SIG_DFL ) { 2006cb0: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006cb4: 80 a0 60 00 cmp %g1, 0 2006cb8: 02 80 00 15 be 2006d0c 2006cbc: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 2006cc0: 40 00 19 d5 call 200d414 <_POSIX_signals_Clear_process_signals> 2006cc4: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2006cc8: c4 06 40 00 ld [ %i1 ], %g2 2006ccc: 87 2e 20 02 sll %i0, 2, %g3 2006cd0: 03 00 80 7e sethi %hi(0x201f800), %g1 2006cd4: b1 2e 20 04 sll %i0, 4, %i0 2006cd8: 82 10 61 b0 or %g1, 0x1b0, %g1 2006cdc: b0 26 00 03 sub %i0, %g3, %i0 2006ce0: c4 20 40 18 st %g2, [ %g1 + %i0 ] 2006ce4: c4 06 60 04 ld [ %i1 + 4 ], %g2 2006ce8: b0 00 40 18 add %g1, %i0, %i0 2006cec: c4 26 20 04 st %g2, [ %i0 + 4 ] 2006cf0: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006cf4: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 2006cf8: 7f ff ee 18 call 2002558 2006cfc: 90 10 00 1a mov %i2, %o0 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 2006d00: 82 10 20 00 clr %g1 } 2006d04: 81 c7 e0 08 ret 2006d08: 91 e8 00 01 restore %g0, %g1, %o0 * we can just copy the provided sigaction structure into the vectors. */ _ISR_Disable( level ); if ( act->sa_handler == SIG_DFL ) { _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 2006d0c: b1 2e 20 04 sll %i0, 4, %i0 2006d10: b0 26 00 01 sub %i0, %g1, %i0 2006d14: 03 00 80 77 sethi %hi(0x201dc00), %g1 2006d18: 82 10 60 74 or %g1, 0x74, %g1 ! 201dc74 <_POSIX_signals_Default_vectors> 2006d1c: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2006d20: 82 00 40 18 add %g1, %i0, %g1 2006d24: c6 00 60 04 ld [ %g1 + 4 ], %g3 2006d28: c4 00 60 08 ld [ %g1 + 8 ], %g2 2006d2c: 03 00 80 7e sethi %hi(0x201f800), %g1 2006d30: 82 10 61 b0 or %g1, 0x1b0, %g1 ! 201f9b0 <_POSIX_signals_Vectors> 2006d34: c8 20 40 18 st %g4, [ %g1 + %i0 ] 2006d38: b0 00 40 18 add %g1, %i0, %i0 2006d3c: c6 26 20 04 st %g3, [ %i0 + 4 ] 2006d40: 10 bf ff ee b 2006cf8 2006d44: c4 26 20 08 st %g2, [ %i0 + 8 ] * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006d48: 40 00 26 53 call 2010694 <__errno> 2006d4c: 01 00 00 00 nop 2006d50: 84 10 20 16 mov 0x16, %g2 ! 16 2006d54: 82 10 3f ff mov -1, %g1 2006d58: 10 bf ff eb b 2006d04 2006d5c: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02007124 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2007124: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2007128: ba 96 20 00 orcc %i0, 0, %i5 200712c: 02 80 00 84 be 200733c 2007130: 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 ) { 2007134: 02 80 00 5c be 20072a4 2007138: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 200713c: 40 00 0f 87 call 200af58 <_Timespec_Is_valid> 2007140: 90 10 00 1a mov %i2, %o0 2007144: 80 8a 20 ff btst 0xff, %o0 2007148: 02 80 00 7d be 200733c 200714c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2007150: 40 00 0f a7 call 200afec <_Timespec_To_ticks> 2007154: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2007158: a0 92 20 00 orcc %o0, 0, %l0 200715c: 02 80 00 78 be 200733c <== NEVER TAKEN 2007160: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2007164: 02 80 00 53 be 20072b0 <== NEVER TAKEN 2007168: 39 00 80 80 sethi %hi(0x2020000), %i4 the_thread = _Thread_Executing; 200716c: 39 00 80 80 sethi %hi(0x2020000), %i4 2007170: b8 17 21 c8 or %i4, 0x1c8, %i4 ! 20201c8 <_Per_CPU_Information> 2007174: f0 07 20 0c ld [ %i4 + 0xc ], %i0 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2007178: 7f ff ed cf call 20028b4 200717c: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 2007180: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 2007184: c2 07 40 00 ld [ %i5 ], %g1 2007188: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 200718c: 80 88 40 02 btst %g1, %g2 2007190: 12 80 00 53 bne 20072dc 2007194: 01 00 00 00 nop return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2007198: 05 00 80 81 sethi %hi(0x2020400), %g2 200719c: c4 00 a0 14 ld [ %g2 + 0x14 ], %g2 ! 2020414 <_POSIX_signals_Pending> 20071a0: 80 88 40 02 btst %g1, %g2 20071a4: 12 80 00 2f bne 2007260 20071a8: 03 00 80 7f sethi %hi(0x201fc00), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20071ac: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 201fc90 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 20071b0: 86 10 3f ff mov -1, %g3 20071b4: c6 26 40 00 st %g3, [ %i1 ] 20071b8: 84 00 a0 01 inc %g2 20071bc: c4 20 60 90 st %g2, [ %g1 + 0x90 ] return _Thread_Dispatch_disable_level; 20071c0: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 20071c4: 82 10 20 04 mov 4, %g1 20071c8: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_thread->Wait.option = *set; 20071cc: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 20071d0: f2 26 20 28 st %i1, [ %i0 + 0x28 ] the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; 20071d4: c2 26 20 30 st %g1, [ %i0 + 0x30 ] RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20071d8: b6 10 20 01 mov 1, %i3 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 20071dc: 23 00 80 80 sethi %hi(0x2020000), %l1 20071e0: a2 14 63 ac or %l1, 0x3ac, %l1 ! 20203ac <_POSIX_signals_Wait_queue> 20071e4: e2 26 20 44 st %l1, [ %i0 + 0x44 ] 20071e8: f6 24 60 30 st %i3, [ %l1 + 0x30 ] the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; the_thread->Wait.return_argument = the_info; _Thread_queue_Enter_critical_section( &_POSIX_signals_Wait_queue ); _ISR_Enable( level ); 20071ec: 7f ff ed b6 call 20028c4 20071f0: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 20071f4: 90 10 00 11 mov %l1, %o0 20071f8: 92 10 00 10 mov %l0, %o1 20071fc: 15 00 80 2b sethi %hi(0x200ac00), %o2 2007200: 40 00 0d 8b call 200a82c <_Thread_queue_Enqueue_with_handler> 2007204: 94 12 a0 0c or %o2, 0xc, %o2 ! 200ac0c <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2007208: 40 00 0c 3f call 200a304 <_Thread_Enable_dispatch> 200720c: 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 ); 2007210: d2 06 40 00 ld [ %i1 ], %o1 2007214: 90 10 00 1a mov %i2, %o0 2007218: 94 10 00 19 mov %i1, %o2 200721c: 96 10 20 00 clr %o3 2007220: 40 00 1a 91 call 200dc64 <_POSIX_signals_Clear_signals> 2007224: 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) 2007228: c2 07 20 0c ld [ %i4 + 0xc ], %g1 200722c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007230: 80 a0 60 04 cmp %g1, 4 2007234: 12 80 00 3b bne 2007320 2007238: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 200723c: f0 06 40 00 ld [ %i1 ], %i0 2007240: c2 07 40 00 ld [ %i5 ], %g1 2007244: 84 06 3f ff add %i0, -1, %g2 2007248: b7 2e c0 02 sll %i3, %g2, %i3 200724c: 80 8e c0 01 btst %i3, %g1 2007250: 02 80 00 34 be 2007320 2007254: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 2007258: 81 c7 e0 08 ret 200725c: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2007260: 7f ff ff 99 call 20070c4 <_POSIX_signals_Get_lowest> 2007264: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2007268: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 200726c: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2007270: 96 10 20 01 mov 1, %o3 2007274: 90 10 00 1a mov %i2, %o0 2007278: 92 10 00 18 mov %i0, %o1 200727c: 40 00 1a 7a call 200dc64 <_POSIX_signals_Clear_signals> 2007280: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2007284: 7f ff ed 90 call 20028c4 2007288: 90 10 00 1b mov %i3, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 200728c: 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; 2007290: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2007294: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2007298: c0 26 60 08 clr [ %i1 + 8 ] return signo; 200729c: 81 c7 e0 08 ret 20072a0: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 20072a4: 12 bf ff b2 bne 200716c 20072a8: a0 10 20 00 clr %l0 the_thread = _Thread_Executing; 20072ac: 39 00 80 80 sethi %hi(0x2020000), %i4 20072b0: b8 17 21 c8 or %i4, 0x1c8, %i4 ! 20201c8 <_Per_CPU_Information> 20072b4: f0 07 20 0c ld [ %i4 + 0xc ], %i0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 20072b8: b2 07 bf f4 add %fp, -12, %i1 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 20072bc: 7f ff ed 7e call 20028b4 20072c0: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 20072c4: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 20072c8: c2 07 40 00 ld [ %i5 ], %g1 20072cc: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 20072d0: 80 88 40 02 btst %g1, %g2 20072d4: 22 bf ff b2 be,a 200719c 20072d8: 05 00 80 81 sethi %hi(0x2020400), %g2 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 20072dc: 7f ff ff 7a call 20070c4 <_POSIX_signals_Get_lowest> 20072e0: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( 20072e4: 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 ); 20072e8: 92 10 00 08 mov %o0, %o1 20072ec: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 20072f0: 96 10 20 00 clr %o3 20072f4: 90 10 00 1a mov %i2, %o0 20072f8: 40 00 1a 5b call 200dc64 <_POSIX_signals_Clear_signals> 20072fc: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2007300: 7f ff ed 71 call 20028c4 2007304: 90 10 00 1b mov %i3, %o0 the_info->si_code = SI_USER; 2007308: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 200730c: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2007310: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2007314: f0 06 40 00 ld [ %i1 ], %i0 2007318: 81 c7 e0 08 ret 200731c: 81 e8 00 00 restore * was not in our set. */ if ( (_Thread_Executing->Wait.return_code != EINTR) || !(*set & signo_to_mask( the_info->si_signo )) ) { errno = _Thread_Executing->Wait.return_code; 2007320: 40 00 26 be call 2010e18 <__errno> 2007324: b0 10 3f ff mov -1, %i0 2007328: c2 07 20 0c ld [ %i4 + 0xc ], %g1 200732c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007330: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2007334: 81 c7 e0 08 ret 2007338: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 200733c: 40 00 26 b7 call 2010e18 <__errno> 2007340: b0 10 3f ff mov -1, %i0 2007344: 82 10 20 16 mov 0x16, %g1 2007348: c2 22 00 00 st %g1, [ %o0 ] 200734c: 81 c7 e0 08 ret 2007350: 81 e8 00 00 restore =============================================================================== 02008f88 : int sigwait( const sigset_t *set, int *sig ) { 2008f88: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008f8c: 92 10 20 00 clr %o1 2008f90: 90 10 00 18 mov %i0, %o0 2008f94: 7f ff ff 6d call 2008d48 2008f98: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008f9c: 80 a2 3f ff cmp %o0, -1 2008fa0: 02 80 00 07 be 2008fbc 2008fa4: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008fa8: 02 80 00 03 be 2008fb4 <== NEVER TAKEN 2008fac: b0 10 20 00 clr %i0 *sig = status; 2008fb0: d0 26 40 00 st %o0, [ %i1 ] 2008fb4: 81 c7 e0 08 ret 2008fb8: 81 e8 00 00 restore return 0; } return errno; 2008fbc: 40 00 25 e4 call 201274c <__errno> 2008fc0: 01 00 00 00 nop 2008fc4: f0 02 00 00 ld [ %o0 ], %i0 } 2008fc8: 81 c7 e0 08 ret 2008fcc: 81 e8 00 00 restore =============================================================================== 02005f38 : */ long sysconf( int name ) { 2005f38: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005f3c: 80 a6 20 02 cmp %i0, 2 2005f40: 02 80 00 10 be 2005f80 2005f44: 03 00 80 5c sethi %hi(0x2017000), %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005f48: 80 a6 20 04 cmp %i0, 4 2005f4c: 02 80 00 0b be 2005f78 2005f50: c2 00 62 50 ld [ %g1 + 0x250 ], %g1 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005f54: 80 a6 20 33 cmp %i0, 0x33 2005f58: 02 80 00 08 be 2005f78 2005f5c: 82 10 24 00 mov 0x400, %g1 return 1024; if ( name == _SC_PAGESIZE ) 2005f60: 80 a6 20 08 cmp %i0, 8 2005f64: 02 80 00 05 be 2005f78 2005f68: 03 00 00 04 sethi %hi(0x1000), %g1 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005f6c: 80 a6 22 03 cmp %i0, 0x203 2005f70: 12 80 00 0c bne 2005fa0 <== ALWAYS TAKEN 2005f74: 82 10 20 00 clr %g1 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2005f78: 81 c7 e0 08 ret 2005f7c: 91 e8 00 01 restore %g0, %g1, %o0 int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); 2005f80: 03 00 80 5c sethi %hi(0x2017000), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 2005f84: d2 00 61 18 ld [ %g1 + 0x118 ], %o1 ! 2017118 2005f88: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005f8c: 40 00 35 b9 call 2013670 <.udiv> 2005f90: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005f94: 82 10 00 08 mov %o0, %g1 if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2005f98: 81 c7 e0 08 ret 2005f9c: 91 e8 00 01 restore %g0, %g1, %o0 #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005fa0: 40 00 26 6f call 200f95c <__errno> 2005fa4: 01 00 00 00 nop 2005fa8: 84 10 20 16 mov 0x16, %g2 ! 16 2005fac: 82 10 3f ff mov -1, %g1 2005fb0: 10 bf ff f2 b 2005f78 2005fb4: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 020062e4 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 20062e4: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 20062e8: 80 a6 20 01 cmp %i0, 1 20062ec: 12 80 00 3e bne 20063e4 20062f0: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 20062f4: 02 80 00 3c be 20063e4 20062f8: 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) { 20062fc: 02 80 00 0e be 2006334 2006300: 03 00 80 78 sethi %hi(0x201e000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2006304: c2 06 40 00 ld [ %i1 ], %g1 2006308: 82 00 7f ff add %g1, -1, %g1 200630c: 80 a0 60 01 cmp %g1, 1 2006310: 18 80 00 35 bgu 20063e4 <== NEVER TAKEN 2006314: 01 00 00 00 nop ( evp->sigev_notify != SIGEV_SIGNAL ) ) { /* The value of the field sigev_notify is not valid */ rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !evp->sigev_signo ) 2006318: c2 06 60 04 ld [ %i1 + 4 ], %g1 200631c: 80 a0 60 00 cmp %g1, 0 2006320: 02 80 00 31 be 20063e4 <== NEVER TAKEN 2006324: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2006328: 80 a0 60 1f cmp %g1, 0x1f 200632c: 18 80 00 2e bgu 20063e4 <== NEVER TAKEN 2006330: 03 00 80 78 sethi %hi(0x201e000), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006334: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 201e3c0 <_Thread_Dispatch_disable_level> 2006338: 84 00 a0 01 inc %g2 200633c: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 2006340: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %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 ); 2006344: 3b 00 80 79 sethi %hi(0x201e400), %i5 2006348: 40 00 08 4a call 2008470 <_Objects_Allocate> 200634c: 90 17 62 c0 or %i5, 0x2c0, %o0 ! 201e6c0 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2006350: 80 a2 20 00 cmp %o0, 0 2006354: 02 80 00 2a be 20063fc 2006358: 82 10 20 02 mov 2, %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } /* The data of the created timer are stored to use them later */ ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; 200635c: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2006360: 03 00 80 7a sethi %hi(0x201e800), %g1 2006364: c2 00 61 04 ld [ %g1 + 0x104 ], %g1 ! 201e904 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2006368: 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; 200636c: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2006370: 02 80 00 08 be 2006390 2006374: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2006378: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 200637c: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 2006380: c2 06 60 08 ld [ %i1 + 8 ], %g1 ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; ptimer->thread_id = _Thread_Executing->Object.id; if ( evp != NULL ) { ptimer->inf.sigev_notify = evp->sigev_notify; 2006384: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2006388: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 200638c: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006390: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 _Objects_Open_u32(&_POSIX_Timer_Information, &ptimer->Object, 0); *timerid = ptimer->Object.id; _Thread_Enable_dispatch(); return 0; } 2006394: ba 17 62 c0 or %i5, 0x2c0, %i5 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006398: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 ptimer->inf.sigev_notify = evp->sigev_notify; ptimer->inf.sigev_signo = evp->sigev_signo; ptimer->inf.sigev_value = evp->sigev_value; } ptimer->overrun = 0; 200639c: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 20063a0: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 20063a4: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 20063a8: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 20063ac: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20063b0: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 20063b4: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 20063b8: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 20063bc: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20063c0: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20063c4: 85 28 a0 02 sll %g2, 2, %g2 20063c8: 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; 20063cc: 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; 20063d0: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 20063d4: 40 00 0d 0e call 200980c <_Thread_Enable_dispatch> 20063d8: b0 10 20 00 clr %i0 return 0; } 20063dc: 81 c7 e0 08 ret 20063e0: 81 e8 00 00 restore if ( !evp->sigev_signo ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) rtems_set_errno_and_return_minus_one( EINVAL ); 20063e4: 40 00 27 84 call 20101f4 <__errno> 20063e8: b0 10 3f ff mov -1, %i0 20063ec: 82 10 20 16 mov 0x16, %g1 20063f0: c2 22 00 00 st %g1, [ %o0 ] 20063f4: 81 c7 e0 08 ret 20063f8: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 20063fc: 40 00 0d 04 call 200980c <_Thread_Enable_dispatch> 2006400: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 2006404: 40 00 27 7c call 20101f4 <__errno> 2006408: 01 00 00 00 nop 200640c: 82 10 20 0b mov 0xb, %g1 ! b 2006410: c2 22 00 00 st %g1, [ %o0 ] 2006414: 81 c7 e0 08 ret 2006418: 81 e8 00 00 restore =============================================================================== 0200641c : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 200641c: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2006420: 80 a6 a0 00 cmp %i2, 0 2006424: 02 80 00 88 be 2006644 <== NEVER TAKEN 2006428: 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) ) ) { 200642c: 40 00 10 1f call 200a4a8 <_Timespec_Is_valid> 2006430: 90 06 a0 08 add %i2, 8, %o0 2006434: 80 8a 20 ff btst 0xff, %o0 2006438: 02 80 00 83 be 2006644 200643c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2006440: 40 00 10 1a call 200a4a8 <_Timespec_Is_valid> 2006444: 90 10 00 1a mov %i2, %o0 2006448: 80 8a 20 ff btst 0xff, %o0 200644c: 02 80 00 7e be 2006644 <== NEVER TAKEN 2006450: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2006454: 12 80 00 7a bne 200663c 2006458: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 200645c: c8 06 80 00 ld [ %i2 ], %g4 2006460: c6 06 a0 04 ld [ %i2 + 4 ], %g3 2006464: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2006468: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 200646c: c8 27 bf e4 st %g4, [ %fp + -28 ] 2006470: c6 27 bf e8 st %g3, [ %fp + -24 ] 2006474: c4 27 bf ec st %g2, [ %fp + -20 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2006478: 80 a6 60 04 cmp %i1, 4 200647c: 02 80 00 3b be 2006568 2006480: c2 27 bf f0 st %g1, [ %fp + -16 ] RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 2006484: 92 10 00 18 mov %i0, %o1 2006488: 11 00 80 79 sethi %hi(0x201e400), %o0 200648c: 94 07 bf fc add %fp, -4, %o2 2006490: 40 00 09 43 call 200899c <_Objects_Get> 2006494: 90 12 22 c0 or %o0, 0x2c0, %o0 * something with the structure of times of the timer: to stop, start * or start it again */ ptimer = _POSIX_Timer_Get( timerid, &location ); switch ( location ) { 2006498: c2 07 bf fc ld [ %fp + -4 ], %g1 200649c: 80 a0 60 00 cmp %g1, 0 20064a0: 12 80 00 46 bne 20065b8 <== NEVER TAKEN 20064a4: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { 20064a8: c2 07 bf ec ld [ %fp + -20 ], %g1 20064ac: 80 a0 60 00 cmp %g1, 0 20064b0: 12 80 00 05 bne 20064c4 20064b4: c2 07 bf f0 ld [ %fp + -16 ], %g1 20064b8: 80 a0 60 00 cmp %g1, 0 20064bc: 02 80 00 45 be 20065d0 20064c0: 01 00 00 00 nop _Thread_Enable_dispatch(); return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); 20064c4: 40 00 10 1e call 200a53c <_Timespec_To_ticks> 20064c8: 90 10 00 1a mov %i2, %o0 20064cc: d0 27 60 64 st %o0, [ %i5 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 20064d0: 40 00 10 1b call 200a53c <_Timespec_To_ticks> 20064d4: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 20064d8: d4 07 60 08 ld [ %i5 + 8 ], %o2 return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); initial_period = _Timespec_To_ticks( &normalize.it_value ); 20064dc: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 20064e0: 98 10 00 1d mov %i5, %o4 20064e4: 90 07 60 10 add %i5, 0x10, %o0 20064e8: 17 00 80 19 sethi %hi(0x2006400), %o3 20064ec: 40 00 1b b8 call 200d3cc <_POSIX_Timer_Insert_helper> 20064f0: 96 12 e2 5c or %o3, 0x25c, %o3 ! 200665c <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 20064f4: 80 8a 20 ff btst 0xff, %o0 20064f8: 02 80 00 18 be 2006558 20064fc: 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 ) 2006500: 02 80 00 0b be 200652c 2006504: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 2006508: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 200650c: c2 26 c0 00 st %g1, [ %i3 ] 2006510: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 2006514: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2006518: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 200651c: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2006520: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 2006524: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 2006528: c2 07 bf e4 ld [ %fp + -28 ], %g1 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; _TOD_Get( &ptimer->time ); 200652c: 90 07 60 6c add %i5, 0x6c, %o0 * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) *ovalue = ptimer->timer_data; ptimer->timer_data = normalize; 2006530: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 2006534: c2 07 bf e8 ld [ %fp + -24 ], %g1 2006538: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 200653c: c2 07 bf ec ld [ %fp + -20 ], %g1 2006540: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 2006544: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006548: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 200654c: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 2006550: 40 00 06 3e call 2007e48 <_TOD_Get> 2006554: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] _Thread_Enable_dispatch(); 2006558: 40 00 0c ad call 200980c <_Thread_Enable_dispatch> 200655c: b0 10 20 00 clr %i0 return 0; 2006560: 81 c7 e0 08 ret 2006564: 81 e8 00 00 restore normalize = *value; /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); 2006568: 40 00 06 38 call 2007e48 <_TOD_Get> 200656c: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2006570: 90 07 bf f4 add %fp, -12, %o0 2006574: 40 00 0f bb call 200a460 <_Timespec_Greater_than> 2006578: 92 07 bf ec add %fp, -20, %o1 200657c: 80 8a 20 ff btst 0xff, %o0 2006580: 12 80 00 31 bne 2006644 2006584: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2006588: 90 07 bf f4 add %fp, -12, %o0 200658c: 40 00 0f d8 call 200a4ec <_Timespec_Subtract> 2006590: 94 10 00 09 mov %o1, %o2 2006594: 92 10 00 18 mov %i0, %o1 2006598: 11 00 80 79 sethi %hi(0x201e400), %o0 200659c: 94 07 bf fc add %fp, -4, %o2 20065a0: 40 00 08 ff call 200899c <_Objects_Get> 20065a4: 90 12 22 c0 or %o0, 0x2c0, %o0 * something with the structure of times of the timer: to stop, start * or start it again */ ptimer = _POSIX_Timer_Get( timerid, &location ); switch ( location ) { 20065a8: c2 07 bf fc ld [ %fp + -4 ], %g1 20065ac: 80 a0 60 00 cmp %g1, 0 20065b0: 02 bf ff be be 20064a8 20065b4: ba 10 00 08 mov %o0, %i5 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 20065b8: 40 00 27 0f call 20101f4 <__errno> 20065bc: b0 10 3f ff mov -1, %i0 20065c0: 82 10 20 16 mov 0x16, %g1 20065c4: c2 22 00 00 st %g1, [ %o0 ] } 20065c8: 81 c7 e0 08 ret 20065cc: 81 e8 00 00 restore case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 20065d0: 40 00 11 1d call 200aa44 <_Watchdog_Remove> 20065d4: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 20065d8: 80 a6 e0 00 cmp %i3, 0 20065dc: 02 80 00 0b be 2006608 20065e0: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 20065e4: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 20065e8: c2 26 c0 00 st %g1, [ %i3 ] 20065ec: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 20065f0: c2 26 e0 04 st %g1, [ %i3 + 4 ] 20065f4: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 20065f8: c2 26 e0 08 st %g1, [ %i3 + 8 ] 20065fc: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 2006600: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 2006604: c2 07 bf e4 ld [ %fp + -28 ], %g1 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; /* Returns with success */ _Thread_Enable_dispatch(); return 0; 2006608: b0 10 20 00 clr %i0 (void) _Watchdog_Remove( &ptimer->Timer ); /* The old data of the timer are returned */ if ( ovalue ) *ovalue = ptimer->timer_data; /* The new data are set */ ptimer->timer_data = normalize; 200660c: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 2006610: c2 07 bf e8 ld [ %fp + -24 ], %g1 2006614: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 2006618: c2 07 bf ec ld [ %fp + -20 ], %g1 200661c: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 2006620: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006624: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006628: 82 10 20 04 mov 4, %g1 /* Returns with success */ _Thread_Enable_dispatch(); 200662c: 40 00 0c 78 call 200980c <_Thread_Enable_dispatch> 2006630: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] return 0; 2006634: 81 c7 e0 08 ret 2006638: 81 e8 00 00 restore } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 200663c: 22 bf ff 89 be,a 2006460 2006640: c8 06 80 00 ld [ %i2 ], %g4 if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006644: 40 00 26 ec call 20101f4 <__errno> 2006648: b0 10 3f ff mov -1, %i0 200664c: 82 10 20 16 mov 0x16, %g1 2006650: c2 22 00 00 st %g1, [ %o0 ] 2006654: 81 c7 e0 08 ret 2006658: 81 e8 00 00 restore =============================================================================== 020062c8 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 20062c8: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 20062cc: 3b 00 80 65 sethi %hi(0x2019400), %i5 20062d0: ba 17 63 48 or %i5, 0x348, %i5 ! 2019748 <_POSIX_signals_Ualarm_timer> 20062d4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20062d8: 80 a0 60 00 cmp %g1, 0 20062dc: 02 80 00 24 be 200636c 20062e0: b8 10 00 18 mov %i0, %i4 _Watchdog_Initialize( the_timer, _POSIX_signals_Ualarm_TSR, 0, NULL ); } else { Watchdog_States state; state = _Watchdog_Remove( the_timer ); 20062e4: 40 00 10 d0 call 200a624 <_Watchdog_Remove> 20062e8: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 20062ec: 90 02 3f fe add %o0, -2, %o0 20062f0: 80 a2 20 01 cmp %o0, 1 20062f4: 08 80 00 26 bleu 200638c <== ALWAYS TAKEN 20062f8: b0 10 20 00 clr %i0 /* * If useconds is non-zero, then the caller wants to schedule * the alarm repeatedly at that interval. If the interval is * less than a single clock tick, then fudge it to a clock tick. */ if ( useconds ) { 20062fc: 80 a7 20 00 cmp %i4, 0 2006300: 02 80 00 19 be 2006364 2006304: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2006308: 90 10 00 1c mov %i4, %o0 200630c: 40 00 3a 20 call 2014b8c <.udiv> 2006310: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2006314: 92 16 e2 40 or %i3, 0x240, %o1 * less than a single clock tick, then fudge it to a clock tick. */ if ( useconds ) { Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2006318: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 200631c: 40 00 3a c8 call 2014e3c <.urem> 2006320: 90 10 00 1c mov %i4, %o0 2006324: 87 2a 20 07 sll %o0, 7, %g3 2006328: 82 10 00 08 mov %o0, %g1 200632c: 85 2a 20 02 sll %o0, 2, %g2 2006330: 84 20 c0 02 sub %g3, %g2, %g2 2006334: 82 00 80 01 add %g2, %g1, %g1 2006338: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 200633c: 90 07 bf f8 add %fp, -8, %o0 2006340: 40 00 0f 48 call 200a060 <_Timespec_To_ticks> 2006344: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2006348: 40 00 0f 46 call 200a060 <_Timespec_To_ticks> 200634c: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006350: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2006354: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006358: 11 00 80 63 sethi %hi(0x2018c00), %o0 200635c: 40 00 10 50 call 200a49c <_Watchdog_Insert> 2006360: 90 12 23 04 or %o0, 0x304, %o0 ! 2018f04 <_Watchdog_Ticks_chain> } return remaining; } 2006364: 81 c7 e0 08 ret 2006368: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 200636c: 03 00 80 18 sethi %hi(0x2006000), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2006370: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 2006374: 82 10 62 9c or %g1, 0x29c, %g1 the_watchdog->id = id; 2006378: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 200637c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2006380: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2006384: 10 bf ff de b 20062fc 2006388: 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); 200638c: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2006390: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2006394: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2006398: 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); 200639c: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20063a0: 40 00 0f 07 call 2009fbc <_Timespec_From_ticks> 20063a4: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 20063a8: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 20063ac: 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; 20063b0: 85 28 60 03 sll %g1, 3, %g2 20063b4: 87 28 60 08 sll %g1, 8, %g3 20063b8: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 20063bc: 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; 20063c0: b1 28 a0 06 sll %g2, 6, %i0 20063c4: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 20063c8: 40 00 39 f3 call 2014b94 <.div> 20063cc: 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; 20063d0: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 20063d4: 10 bf ff ca b 20062fc 20063d8: b0 02 00 18 add %o0, %i0, %i0