=============================================================================== 0200729c <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 200729c: 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; 20072a0: 39 00 80 77 sethi %hi(0x201dc00), %i4 20072a4: fa 07 20 b4 ld [ %i4 + 0xb4 ], %i5 ! 201dcb4 <_API_extensions_List> 20072a8: b8 17 20 b4 or %i4, 0xb4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20072ac: b8 07 20 04 add %i4, 4, %i4 20072b0: 80 a7 40 1c cmp %i5, %i4 20072b4: 02 80 00 09 be 20072d8 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 20072b8: 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)(); 20072bc: c2 07 60 08 ld [ %i5 + 8 ], %g1 20072c0: 9f c0 40 00 call %g1 20072c4: 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 ) { 20072c8: 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 ); 20072cc: 80 a7 40 1c cmp %i5, %i4 20072d0: 32 bf ff fc bne,a 20072c0 <_API_extensions_Run_postdriver+0x24> 20072d4: c2 07 60 08 ld [ %i5 + 8 ], %g1 20072d8: 81 c7 e0 08 ret 20072dc: 81 e8 00 00 restore =============================================================================== 020072e0 <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 20072e0: 9d e3 bf a0 save %sp, -96, %sp 20072e4: 39 00 80 77 sethi %hi(0x201dc00), %i4 20072e8: fa 07 20 b4 ld [ %i4 + 0xb4 ], %i5 ! 201dcb4 <_API_extensions_List> 20072ec: b8 17 20 b4 or %i4, 0xb4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20072f0: b8 07 20 04 add %i4, 4, %i4 20072f4: 80 a7 40 1c cmp %i5, %i4 20072f8: 02 80 00 0a be 2007320 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 20072fc: 37 00 80 77 sethi %hi(0x201dc00), %i3 2007300: b6 16 e3 f8 or %i3, 0x3f8, %i3 ! 201dff8 <_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 ); 2007304: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007308: 9f c0 40 00 call %g1 200730c: 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 ) { 2007310: 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 ); 2007314: 80 a7 40 1c cmp %i5, %i4 2007318: 32 bf ff fc bne,a 2007308 <_API_extensions_Run_postswitch+0x28> 200731c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007320: 81 c7 e0 08 ret 2007324: 81 e8 00 00 restore =============================================================================== 020095a4 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 20095a4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 20095a8: 03 00 80 6c sethi %hi(0x201b000), %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 ); 20095ac: 7f ff e7 f7 call 2003588 20095b0: fa 00 60 b4 ld [ %g1 + 0xb4 ], %i5 ! 201b0b4 <_Per_CPU_Information+0xc> 20095b4: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 20095b8: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 20095bc: 80 a0 60 00 cmp %g1, 0 20095c0: 02 80 00 2b be 200966c <_CORE_RWLock_Release+0xc8> 20095c4: 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 ) { 20095c8: 22 80 00 22 be,a 2009650 <_CORE_RWLock_Release+0xac> 20095cc: 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; 20095d0: 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; 20095d4: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 20095d8: 7f ff e7 f0 call 2003598 20095dc: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 20095e0: 40 00 07 f4 call 200b5b0 <_Thread_queue_Dequeue> 20095e4: 90 10 00 18 mov %i0, %o0 if ( next ) { 20095e8: 80 a2 20 00 cmp %o0, 0 20095ec: 22 80 00 24 be,a 200967c <_CORE_RWLock_Release+0xd8> 20095f0: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 20095f4: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 20095f8: 80 a0 60 01 cmp %g1, 1 20095fc: 02 80 00 22 be 2009684 <_CORE_RWLock_Release+0xe0> 2009600: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009604: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009608: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200960c: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009610: 10 80 00 09 b 2009634 <_CORE_RWLock_Release+0x90> 2009614: 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 || 2009618: 80 a0 60 01 cmp %g1, 1 200961c: 02 80 00 0b be 2009648 <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 2009620: 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; 2009624: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009628: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200962c: 40 00 08 f1 call 200b9f0 <_Thread_queue_Extract> 2009630: 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 ); 2009634: 40 00 09 40 call 200bb34 <_Thread_queue_First> 2009638: 90 10 00 18 mov %i0, %o0 if ( !next || 200963c: 92 92 20 00 orcc %o0, 0, %o1 2009640: 32 bf ff f6 bne,a 2009618 <_CORE_RWLock_Release+0x74> 2009644: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 2009648: 81 c7 e0 08 ret 200964c: 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; 2009650: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 2009654: 80 a0 60 00 cmp %g1, 0 2009658: 02 bf ff de be 20095d0 <_CORE_RWLock_Release+0x2c> 200965c: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 2009660: 7f ff e7 ce call 2003598 2009664: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 2009668: 30 80 00 05 b,a 200967c <_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 ); 200966c: 7f ff e7 cb call 2003598 2009670: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 2009674: 82 10 20 02 mov 2, %g1 2009678: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200967c: 81 c7 e0 08 ret 2009680: 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; 2009684: 82 10 20 02 mov 2, %g1 2009688: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200968c: 81 c7 e0 08 ret 2009690: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02009694 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 2009694: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009698: 90 10 00 18 mov %i0, %o0 200969c: 40 00 06 ee call 200b254 <_Thread_Get> 20096a0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20096a4: c2 07 bf fc ld [ %fp + -4 ], %g1 20096a8: 80 a0 60 00 cmp %g1, 0 20096ac: 12 80 00 09 bne 20096d0 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 20096b0: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 20096b4: 40 00 09 62 call 200bc3c <_Thread_queue_Process_timeout> 20096b8: 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--; 20096bc: 03 00 80 6a sethi %hi(0x201a800), %g1 20096c0: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201ab70 <_Thread_Dispatch_disable_level> 20096c4: 84 00 bf ff add %g2, -1, %g2 20096c8: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 20096cc: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 20096d0: 81 c7 e0 08 ret 20096d4: 81 e8 00 00 restore =============================================================================== 02010b2c <_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 ) { 2010b2c: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010b30: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010b34: 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; 2010b38: 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; 2010b3c: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 2010b40: 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)) { 2010b44: 80 8e e0 03 btst 3, %i3 2010b48: 02 80 00 0a be 2010b70 <_CORE_message_queue_Initialize+0x44> 2010b4c: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 2010b50: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010b54: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 2010b58: 80 a6 c0 1c cmp %i3, %i4 2010b5c: 08 80 00 05 bleu 2010b70 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2010b60: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b64: b0 0f 60 01 and %i5, 1, %i0 2010b68: 81 c7 e0 08 ret 2010b6c: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2010b70: b8 07 20 14 add %i4, 0x14, %i4 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2010b74: 90 10 20 00 clr %o0 2010b78: 92 10 00 1a mov %i2, %o1 2010b7c: 94 10 20 00 clr %o2 2010b80: 96 10 00 1c mov %i4, %o3 2010b84: 40 00 45 61 call 2022108 <__muldi3> 2010b88: ba 10 20 00 clr %i5 if ( x > SIZE_MAX ) 2010b8c: 80 a2 20 00 cmp %o0, 0 2010b90: 34 bf ff f6 bg,a 2010b68 <_CORE_message_queue_Initialize+0x3c> 2010b94: b0 0f 60 01 and %i5, 1, %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010b98: 40 00 0d 2a call 2014040 <_Workspace_Allocate> 2010b9c: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010ba0: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010ba4: 80 a2 20 00 cmp %o0, 0 2010ba8: 02 bf ff ef be 2010b64 <_CORE_message_queue_Initialize+0x38> 2010bac: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010bb0: 90 06 20 68 add %i0, 0x68, %o0 2010bb4: 94 10 00 1a mov %i2, %o2 2010bb8: 40 00 17 eb call 2016b64 <_Chain_Initialize> 2010bbc: 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( 2010bc0: 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 ); 2010bc4: 82 06 20 50 add %i0, 0x50, %g1 2010bc8: 84 18 a0 01 xor %g2, 1, %g2 2010bcc: 80 a0 00 02 cmp %g0, %g2 2010bd0: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010bd4: 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; 2010bd8: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2010bdc: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2010be0: c0 26 20 54 clr [ %i0 + 0x54 ] 2010be4: 92 60 3f ff subx %g0, -1, %o1 2010be8: 94 10 20 80 mov 0x80, %o2 2010bec: 96 10 20 06 mov 6, %o3 2010bf0: 40 00 0a 81 call 20135f4 <_Thread_queue_Initialize> 2010bf4: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010bf8: b0 0f 60 01 and %i5, 1, %i0 2010bfc: 81 c7 e0 08 ret 2010c00: 81 e8 00 00 restore =============================================================================== 0200782c <_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 ) { 200782c: 9d e3 bf a0 save %sp, -96, %sp 2007830: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007834: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2007838: 40 00 07 c5 call 200974c <_Thread_queue_Dequeue> 200783c: 90 10 00 1d mov %i5, %o0 2007840: 80 a2 20 00 cmp %o0, 0 2007844: 02 80 00 04 be 2007854 <_CORE_semaphore_Surrender+0x28> 2007848: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 200784c: 81 c7 e0 08 ret 2007850: 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 ); 2007854: 7f ff ea 64 call 20021e4 2007858: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 200785c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007860: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2007864: 80 a0 40 02 cmp %g1, %g2 2007868: 1a 80 00 05 bcc 200787c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 200786c: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007870: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007874: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007878: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 200787c: 7f ff ea 5e call 20021f4 2007880: 01 00 00 00 nop } return status; } 2007884: 81 c7 e0 08 ret 2007888: 81 e8 00 00 restore =============================================================================== 0200d210 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200d210: 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; 200d214: 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 ); 200d218: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d21c: 80 a6 a0 00 cmp %i2, 0 200d220: 02 80 00 12 be 200d268 <_Chain_Initialize+0x58> <== NEVER TAKEN 200d224: 90 10 00 18 mov %i0, %o0 200d228: 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; 200d22c: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200d230: 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; 200d234: 10 80 00 05 b 200d248 <_Chain_Initialize+0x38> 200d238: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d23c: 84 10 00 01 mov %g1, %g2 200d240: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200d244: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200d248: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200d24c: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d250: 80 a6 a0 00 cmp %i2, 0 200d254: 12 bf ff fa bne 200d23c <_Chain_Initialize+0x2c> 200d258: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200d25c: 40 00 2d 4d call 2018790 <.umul> 200d260: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200d264: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200d268: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200d26c: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200d270: 81 c7 e0 08 ret 200d274: 81 e8 00 00 restore =============================================================================== 020064b0 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 20064b0: 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 ]; 20064b4: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 20064b8: 7f ff ef 4b call 20021e4 20064bc: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 20064c0: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 20064c4: 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 ) ) { 20064c8: 86 88 40 02 andcc %g1, %g2, %g3 20064cc: 02 80 00 39 be 20065b0 <_Event_Surrender+0x100> 20064d0: 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() && 20064d4: 88 11 23 f8 or %g4, 0x3f8, %g4 ! 201dff8 <_Per_CPU_Information> 20064d8: f2 01 20 08 ld [ %g4 + 8 ], %i1 20064dc: 80 a6 60 00 cmp %i1, 0 20064e0: 32 80 00 1c bne,a 2006550 <_Event_Surrender+0xa0> 20064e4: 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); 20064e8: 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 ) ) { 20064ec: 80 89 21 00 btst 0x100, %g4 20064f0: 02 80 00 30 be 20065b0 <_Event_Surrender+0x100> 20064f4: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20064f8: 02 80 00 04 be 2006508 <_Event_Surrender+0x58> 20064fc: 80 8f 20 02 btst 2, %i4 2006500: 02 80 00 2c be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN 2006504: 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; 2006508: 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) ); 200650c: 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 ); 2006510: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006514: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006518: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 200651c: 7f ff ef 36 call 20021f4 2006520: 01 00 00 00 nop 2006524: 7f ff ef 30 call 20021e4 2006528: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 200652c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2006530: 80 a0 60 02 cmp %g1, 2 2006534: 02 80 00 21 be 20065b8 <_Event_Surrender+0x108> 2006538: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 200653c: 7f ff ef 2e call 20021f4 2006540: 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 ); 2006544: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006548: 40 00 0a ab call 2008ff4 <_Thread_Clear_state> 200654c: 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() && 2006550: 80 a6 00 04 cmp %i0, %g4 2006554: 32 bf ff e6 bne,a 20064ec <_Event_Surrender+0x3c> 2006558: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200655c: 09 00 80 78 sethi %hi(0x201e000), %g4 2006560: f2 01 23 f0 ld [ %g4 + 0x3f0 ], %i1 ! 201e3f0 <_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 ) && 2006564: 80 a6 60 02 cmp %i1, 2 2006568: 02 80 00 07 be 2006584 <_Event_Surrender+0xd4> <== NEVER TAKEN 200656c: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006570: f2 01 23 f0 ld [ %g4 + 0x3f0 ], %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) || 2006574: 80 a6 60 01 cmp %i1, 1 2006578: 32 bf ff dd bne,a 20064ec <_Event_Surrender+0x3c> 200657c: 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) ) { 2006580: 80 a0 40 03 cmp %g1, %g3 2006584: 02 80 00 04 be 2006594 <_Event_Surrender+0xe4> 2006588: 80 8f 20 02 btst 2, %i4 200658c: 02 80 00 09 be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN 2006590: 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; 2006594: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006598: 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 ); 200659c: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 20065a0: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20065a4: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 20065a8: 82 10 20 03 mov 3, %g1 20065ac: c2 21 23 f0 st %g1, [ %g4 + 0x3f0 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 20065b0: 7f ff ef 11 call 20021f4 20065b4: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 20065b8: 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 ); 20065bc: 7f ff ef 0e call 20021f4 20065c0: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 20065c4: 40 00 0f 9f call 200a440 <_Watchdog_Remove> 20065c8: 90 06 20 48 add %i0, 0x48, %o0 20065cc: b2 16 63 f8 or %i1, 0x3f8, %i1 20065d0: 40 00 0a 89 call 2008ff4 <_Thread_Clear_state> 20065d4: 81 e8 00 00 restore =============================================================================== 020065d8 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 20065d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 20065dc: 90 10 00 18 mov %i0, %o0 20065e0: 40 00 0b 84 call 20093f0 <_Thread_Get> 20065e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20065e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20065ec: 80 a0 60 00 cmp %g1, 0 20065f0: 12 80 00 16 bne 2006648 <_Event_Timeout+0x70> <== NEVER TAKEN 20065f4: 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 ); 20065f8: 7f ff ee fb call 20021e4 20065fc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006600: 03 00 80 78 sethi %hi(0x201e000), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006604: c2 00 60 04 ld [ %g1 + 4 ], %g1 ! 201e004 <_Per_CPU_Information+0xc> 2006608: 80 a7 40 01 cmp %i5, %g1 200660c: 02 80 00 11 be 2006650 <_Event_Timeout+0x78> 2006610: 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; 2006614: 82 10 20 06 mov 6, %g1 2006618: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 200661c: 7f ff ee f6 call 20021f4 2006620: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006624: 90 10 00 1d mov %i5, %o0 2006628: 13 04 00 ff sethi %hi(0x1003fc00), %o1 200662c: 40 00 0a 72 call 2008ff4 <_Thread_Clear_state> 2006630: 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--; 2006634: 03 00 80 76 sethi %hi(0x201d800), %g1 2006638: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201dac0 <_Thread_Dispatch_disable_level> 200663c: 84 00 bf ff add %g2, -1, %g2 2006640: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2006644: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 2006648: 81 c7 e0 08 ret 200664c: 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 ) 2006650: 03 00 80 78 sethi %hi(0x201e000), %g1 2006654: c4 00 63 f0 ld [ %g1 + 0x3f0 ], %g2 ! 201e3f0 <_Event_Sync_state> 2006658: 80 a0 a0 01 cmp %g2, 1 200665c: 32 bf ff ef bne,a 2006618 <_Event_Timeout+0x40> 2006660: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006664: 84 10 20 02 mov 2, %g2 2006668: c4 20 63 f0 st %g2, [ %g1 + 0x3f0 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 200666c: 10 bf ff eb b 2006618 <_Event_Timeout+0x40> 2006670: 82 10 20 06 mov 6, %g1 =============================================================================== 0200d448 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d448: 9d e3 bf 98 save %sp, -104, %sp 200d44c: 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 200d450: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200d454: 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 ) { 200d458: 80 a6 40 10 cmp %i1, %l0 200d45c: 18 80 00 23 bgu 200d4e8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d460: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200d464: 80 a6 e0 00 cmp %i3, 0 200d468: 12 80 00 7d bne 200d65c <_Heap_Allocate_aligned_with_boundary+0x214> 200d46c: 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; 200d470: 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 ) { 200d474: 80 a7 40 11 cmp %i5, %l1 200d478: 02 80 00 18 be 200d4d8 <_Heap_Allocate_aligned_with_boundary+0x90> 200d47c: 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 200d480: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d484: 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 200d488: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d48c: 10 80 00 0b b 200d4b8 <_Heap_Allocate_aligned_with_boundary+0x70> 200d490: 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 ) { 200d494: 12 80 00 17 bne 200d4f0 <_Heap_Allocate_aligned_with_boundary+0xa8> 200d498: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d49c: 80 a6 20 00 cmp %i0, 0 200d4a0: 12 80 00 5b bne 200d60c <_Heap_Allocate_aligned_with_boundary+0x1c4> 200d4a4: b8 07 20 01 inc %i4 break; } block = block->next; 200d4a8: 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 ) { 200d4ac: 80 a7 40 11 cmp %i5, %l1 200d4b0: 22 80 00 0b be,a 200d4dc <_Heap_Allocate_aligned_with_boundary+0x94> 200d4b4: 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 ) { 200d4b8: e4 04 60 04 ld [ %l1 + 4 ], %l2 200d4bc: 80 a4 00 12 cmp %l0, %l2 200d4c0: 0a bf ff f5 bcs 200d494 <_Heap_Allocate_aligned_with_boundary+0x4c> 200d4c4: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200d4c8: 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 ) { 200d4cc: 80 a7 40 11 cmp %i5, %l1 200d4d0: 12 bf ff fa bne 200d4b8 <_Heap_Allocate_aligned_with_boundary+0x70> 200d4d4: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d4d8: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200d4dc: 80 a0 40 1c cmp %g1, %i4 200d4e0: 0a 80 00 5a bcs 200d648 <_Heap_Allocate_aligned_with_boundary+0x200> 200d4e4: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200d4e8: 81 c7 e0 08 ret 200d4ec: 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; 200d4f0: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200d4f4: 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; 200d4f8: 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; 200d4fc: 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; 200d500: 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); 200d504: 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; 200d508: 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 200d50c: a4 00 40 12 add %g1, %l2, %l2 200d510: 40 00 2d 86 call 2018b28 <.urem> 200d514: 90 10 00 18 mov %i0, %o0 200d518: 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 ) { 200d51c: 80 a4 80 18 cmp %l2, %i0 200d520: 1a 80 00 06 bcc 200d538 <_Heap_Allocate_aligned_with_boundary+0xf0> 200d524: a8 04 60 08 add %l1, 8, %l4 200d528: 90 10 00 12 mov %l2, %o0 200d52c: 40 00 2d 7f call 2018b28 <.urem> 200d530: 92 10 00 1a mov %i2, %o1 200d534: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200d538: 80 a6 e0 00 cmp %i3, 0 200d53c: 02 80 00 24 be 200d5cc <_Heap_Allocate_aligned_with_boundary+0x184> 200d540: 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; 200d544: a4 06 00 19 add %i0, %i1, %l2 200d548: 92 10 00 1b mov %i3, %o1 200d54c: 40 00 2d 77 call 2018b28 <.urem> 200d550: 90 10 00 12 mov %l2, %o0 200d554: 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 ) { 200d558: 80 a6 00 08 cmp %i0, %o0 200d55c: 1a 80 00 1b bcc 200d5c8 <_Heap_Allocate_aligned_with_boundary+0x180> 200d560: 80 a2 00 12 cmp %o0, %l2 200d564: 1a 80 00 1a bcc 200d5cc <_Heap_Allocate_aligned_with_boundary+0x184> 200d568: 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; 200d56c: 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 ) { 200d570: 80 a4 c0 08 cmp %l3, %o0 200d574: 08 80 00 08 bleu 200d594 <_Heap_Allocate_aligned_with_boundary+0x14c> 200d578: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d57c: 10 bf ff c9 b 200d4a0 <_Heap_Allocate_aligned_with_boundary+0x58> 200d580: 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 ) { 200d584: 1a 80 00 11 bcc 200d5c8 <_Heap_Allocate_aligned_with_boundary+0x180> 200d588: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200d58c: 18 bf ff c4 bgu 200d49c <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200d590: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200d594: b0 22 00 19 sub %o0, %i1, %i0 200d598: 92 10 00 1a mov %i2, %o1 200d59c: 40 00 2d 63 call 2018b28 <.urem> 200d5a0: 90 10 00 18 mov %i0, %o0 200d5a4: 92 10 00 1b mov %i3, %o1 200d5a8: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200d5ac: a4 06 00 19 add %i0, %i1, %l2 200d5b0: 40 00 2d 5e call 2018b28 <.urem> 200d5b4: 90 10 00 12 mov %l2, %o0 200d5b8: 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 ) { 200d5bc: 80 a2 00 12 cmp %o0, %l2 200d5c0: 0a bf ff f1 bcs 200d584 <_Heap_Allocate_aligned_with_boundary+0x13c> 200d5c4: 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 ) { 200d5c8: 80 a5 00 18 cmp %l4, %i0 200d5cc: 18 80 00 22 bgu 200d654 <_Heap_Allocate_aligned_with_boundary+0x20c> 200d5d0: 82 10 3f f8 mov -8, %g1 200d5d4: 90 10 00 18 mov %i0, %o0 200d5d8: a4 20 40 11 sub %g1, %l1, %l2 200d5dc: 92 10 00 16 mov %l6, %o1 200d5e0: 40 00 2d 52 call 2018b28 <.urem> 200d5e4: 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 ) { 200d5e8: 90 a4 80 08 subcc %l2, %o0, %o0 200d5ec: 02 bf ff ad be 200d4a0 <_Heap_Allocate_aligned_with_boundary+0x58> 200d5f0: 80 a6 20 00 cmp %i0, 0 200d5f4: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200d5f8: 82 40 3f ff addx %g0, -1, %g1 200d5fc: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d600: 80 a6 20 00 cmp %i0, 0 200d604: 02 bf ff a9 be 200d4a8 <_Heap_Allocate_aligned_with_boundary+0x60> 200d608: 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; 200d60c: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200d610: 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; 200d614: 84 00 a0 01 inc %g2 stats->searches += search_count; 200d618: 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; 200d61c: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200d620: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200d624: 90 10 00 1d mov %i5, %o0 200d628: 92 10 00 11 mov %l1, %o1 200d62c: 94 10 00 18 mov %i0, %o2 200d630: 7f ff e9 a4 call 2007cc0 <_Heap_Block_allocate> 200d634: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d638: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200d63c: 80 a0 40 1c cmp %g1, %i4 200d640: 1a 80 00 03 bcc 200d64c <_Heap_Allocate_aligned_with_boundary+0x204> 200d644: 01 00 00 00 nop stats->max_search = search_count; 200d648: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200d64c: 81 c7 e0 08 ret 200d650: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200d654: 10 bf ff 92 b 200d49c <_Heap_Allocate_aligned_with_boundary+0x54> 200d658: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200d65c: 18 bf ff a3 bgu 200d4e8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d660: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200d664: 22 bf ff 83 be,a 200d470 <_Heap_Allocate_aligned_with_boundary+0x28> 200d668: 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; 200d66c: 10 bf ff 82 b 200d474 <_Heap_Allocate_aligned_with_boundary+0x2c> 200d670: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200d250 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200d250: 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; 200d254: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d258: 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; 200d25c: 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; 200d260: 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; 200d264: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200d268: 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; 200d26c: 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 ) { 200d270: 80 a6 40 1d cmp %i1, %i5 200d274: 08 80 00 05 bleu 200d288 <_Heap_Extend+0x38> 200d278: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d27c: b0 0c 60 01 and %l1, 1, %i0 200d280: 81 c7 e0 08 ret 200d284: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200d288: 90 10 00 19 mov %i1, %o0 200d28c: 92 10 00 1a mov %i2, %o1 200d290: 94 10 00 10 mov %l0, %o2 200d294: 98 07 bf f8 add %fp, -8, %o4 200d298: 7f ff e9 51 call 20077dc <_Heap_Get_first_and_last_block> 200d29c: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200d2a0: 80 8a 20 ff btst 0xff, %o0 200d2a4: 02 bf ff f6 be 200d27c <_Heap_Extend+0x2c> 200d2a8: aa 10 20 00 clr %l5 200d2ac: a2 10 00 1c mov %i4, %l1 200d2b0: ac 10 20 00 clr %l6 200d2b4: a6 10 20 00 clr %l3 200d2b8: 10 80 00 14 b 200d308 <_Heap_Extend+0xb8> 200d2bc: 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 ) { 200d2c0: 2a 80 00 02 bcs,a 200d2c8 <_Heap_Extend+0x78> 200d2c4: 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); 200d2c8: 90 10 00 1a mov %i2, %o0 200d2cc: 40 00 18 2e call 2013384 <.urem> 200d2d0: 92 10 00 10 mov %l0, %o1 200d2d4: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d2d8: 80 a6 80 19 cmp %i2, %i1 200d2dc: 02 80 00 1c be 200d34c <_Heap_Extend+0xfc> 200d2e0: 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 ) { 200d2e4: 80 a6 40 1a cmp %i1, %i2 200d2e8: 38 80 00 02 bgu,a 200d2f0 <_Heap_Extend+0xa0> 200d2ec: 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; 200d2f0: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d2f4: 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); 200d2f8: 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 ); 200d2fc: 80 a7 00 11 cmp %i4, %l1 200d300: 22 80 00 1b be,a 200d36c <_Heap_Extend+0x11c> 200d304: 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; 200d308: 80 a4 40 1c cmp %l1, %i4 200d30c: 02 80 00 66 be 200d4a4 <_Heap_Extend+0x254> 200d310: 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 ( 200d314: 80 a0 40 1d cmp %g1, %i5 200d318: 0a 80 00 70 bcs 200d4d8 <_Heap_Extend+0x288> 200d31c: 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 ) { 200d320: 80 a0 40 1d cmp %g1, %i5 200d324: 12 bf ff e7 bne 200d2c0 <_Heap_Extend+0x70> 200d328: 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); 200d32c: 90 10 00 1a mov %i2, %o0 200d330: 40 00 18 15 call 2013384 <.urem> 200d334: 92 10 00 10 mov %l0, %o1 200d338: 82 06 bf f8 add %i2, -8, %g1 200d33c: 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 ) { 200d340: 80 a6 80 19 cmp %i2, %i1 200d344: 12 bf ff e8 bne 200d2e4 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200d348: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200d34c: 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; 200d350: e2 00 60 04 ld [ %g1 + 4 ], %l1 200d354: 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); 200d358: 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 ); 200d35c: 80 a7 00 11 cmp %i4, %l1 200d360: 12 bf ff ea bne 200d308 <_Heap_Extend+0xb8> <== NEVER TAKEN 200d364: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200d368: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200d36c: 80 a6 40 01 cmp %i1, %g1 200d370: 3a 80 00 55 bcc,a 200d4c4 <_Heap_Extend+0x274> 200d374: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200d378: 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; 200d37c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d380: 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 ) { 200d384: 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 = 200d388: 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; 200d38c: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200d390: 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 = 200d394: 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; 200d398: 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 ) { 200d39c: 80 a1 00 01 cmp %g4, %g1 200d3a0: 08 80 00 43 bleu 200d4ac <_Heap_Extend+0x25c> 200d3a4: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200d3a8: 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 ) { 200d3ac: 80 a5 20 00 cmp %l4, 0 200d3b0: 02 80 00 63 be 200d53c <_Heap_Extend+0x2ec> 200d3b4: 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; 200d3b8: 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; 200d3bc: 92 10 00 1c mov %i4, %o1 200d3c0: 40 00 17 f1 call 2013384 <.urem> 200d3c4: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200d3c8: 80 a2 20 00 cmp %o0, 0 200d3cc: 02 80 00 04 be 200d3dc <_Heap_Extend+0x18c> 200d3d0: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200d3d4: b2 06 40 1c add %i1, %i4, %i1 200d3d8: 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 = 200d3dc: 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; 200d3e0: 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 = 200d3e4: 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; 200d3e8: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200d3ec: 90 10 00 18 mov %i0, %o0 200d3f0: 92 10 00 01 mov %g1, %o1 200d3f4: 7f ff ff 8d call 200d228 <_Heap_Free_block> 200d3f8: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d3fc: 80 a4 e0 00 cmp %l3, 0 200d400: 02 80 00 3b be 200d4ec <_Heap_Extend+0x29c> 200d404: 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); 200d408: 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( 200d40c: ba 27 40 13 sub %i5, %l3, %i5 200d410: 40 00 17 dd call 2013384 <.urem> 200d414: 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) 200d418: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200d41c: ba 27 40 08 sub %i5, %o0, %i5 200d420: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200d424: 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 = 200d428: 84 07 40 13 add %i5, %l3, %g2 200d42c: 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; 200d430: 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 ); 200d434: 90 10 00 18 mov %i0, %o0 200d438: 82 08 60 01 and %g1, 1, %g1 200d43c: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200d440: ba 17 40 01 or %i5, %g1, %i5 200d444: 7f ff ff 79 call 200d228 <_Heap_Free_block> 200d448: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d44c: 80 a4 e0 00 cmp %l3, 0 200d450: 02 80 00 34 be 200d520 <_Heap_Extend+0x2d0> 200d454: 80 a5 20 00 cmp %l4, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d458: 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( 200d45c: 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; 200d460: 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( 200d464: 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; 200d468: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200d46c: 84 10 80 03 or %g2, %g3, %g2 200d470: 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; 200d474: 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; 200d478: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200d47c: 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; 200d480: a4 20 80 12 sub %g2, %l2, %l2 /* Statistics */ stats->size += extended_size; 200d484: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200d488: 80 a6 e0 00 cmp %i3, 0 200d48c: 02 bf ff 7c be 200d27c <_Heap_Extend+0x2c> <== NEVER TAKEN 200d490: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200d494: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200d498: b0 0c 60 01 and %l1, 1, %i0 200d49c: 81 c7 e0 08 ret 200d4a0: 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; 200d4a4: 10 bf ff 9c b 200d314 <_Heap_Extend+0xc4> 200d4a8: 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 ) { 200d4ac: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200d4b0: 80 a0 40 02 cmp %g1, %g2 200d4b4: 2a bf ff be bcs,a 200d3ac <_Heap_Extend+0x15c> 200d4b8: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d4bc: 10 bf ff bd b 200d3b0 <_Heap_Extend+0x160> 200d4c0: 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 ) { 200d4c4: 80 a7 40 01 cmp %i5, %g1 200d4c8: 38 bf ff ad bgu,a 200d37c <_Heap_Extend+0x12c> 200d4cc: 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; 200d4d0: 10 bf ff ac b 200d380 <_Heap_Extend+0x130> 200d4d4: 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 ( 200d4d8: 80 a6 40 1a cmp %i1, %i2 200d4dc: 1a bf ff 92 bcc 200d324 <_Heap_Extend+0xd4> 200d4e0: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200d4e4: 10 bf ff 66 b 200d27c <_Heap_Extend+0x2c> 200d4e8: 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 ) { 200d4ec: 80 a5 60 00 cmp %l5, 0 200d4f0: 02 bf ff d7 be 200d44c <_Heap_Extend+0x1fc> 200d4f4: 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; 200d4f8: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200d4fc: c2 07 bf fc ld [ %fp + -4 ], %g1 200d500: 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 ); 200d504: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200d508: 84 10 c0 02 or %g3, %g2, %g2 200d50c: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200d510: c4 00 60 04 ld [ %g1 + 4 ], %g2 200d514: 84 10 a0 01 or %g2, 1, %g2 200d518: 10 bf ff cd b 200d44c <_Heap_Extend+0x1fc> 200d51c: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d520: 32 bf ff cf bne,a 200d45c <_Heap_Extend+0x20c> 200d524: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200d528: d2 07 bf f8 ld [ %fp + -8 ], %o1 200d52c: 7f ff ff 3f call 200d228 <_Heap_Free_block> 200d530: 90 10 00 18 mov %i0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200d534: 10 bf ff ca b 200d45c <_Heap_Extend+0x20c> 200d538: 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 ) { 200d53c: 80 a5 a0 00 cmp %l6, 0 200d540: 02 bf ff b0 be 200d400 <_Heap_Extend+0x1b0> 200d544: 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; 200d548: ac 25 80 02 sub %l6, %g2, %l6 200d54c: 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 = 200d550: 10 bf ff ac b 200d400 <_Heap_Extend+0x1b0> 200d554: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200d674 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200d674: 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 ) { 200d678: 80 a6 60 00 cmp %i1, 0 200d67c: 02 80 00 56 be 200d7d4 <_Heap_Free+0x160> 200d680: 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); 200d684: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200d688: 40 00 2d 28 call 2018b28 <.urem> 200d68c: 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 200d690: 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); 200d694: 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); 200d698: 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; 200d69c: 80 a7 40 01 cmp %i5, %g1 200d6a0: 0a 80 00 4d bcs 200d7d4 <_Heap_Free+0x160> 200d6a4: 84 10 20 00 clr %g2 200d6a8: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200d6ac: 80 a7 40 04 cmp %i5, %g4 200d6b0: 38 80 00 4a bgu,a 200d7d8 <_Heap_Free+0x164> 200d6b4: b0 08 a0 01 and %g2, 1, %i0 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d6b8: 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; 200d6bc: 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); 200d6c0: 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; 200d6c4: 80 a0 40 03 cmp %g1, %g3 200d6c8: 38 80 00 44 bgu,a 200d7d8 <_Heap_Free+0x164> <== NEVER TAKEN 200d6cc: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200d6d0: 80 a1 00 03 cmp %g4, %g3 200d6d4: 2a 80 00 41 bcs,a 200d7d8 <_Heap_Free+0x164> <== NEVER TAKEN 200d6d8: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200d6dc: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200d6e0: 80 8b 60 01 btst 1, %o5 200d6e4: 02 80 00 3c be 200d7d4 <_Heap_Free+0x160> 200d6e8: 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 )); 200d6ec: 80 a1 00 03 cmp %g4, %g3 200d6f0: 02 80 00 06 be 200d708 <_Heap_Free+0x94> 200d6f4: 9a 10 20 00 clr %o5 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d6f8: 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; 200d6fc: da 00 a0 04 ld [ %g2 + 4 ], %o5 200d700: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200d704: 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 ) ) { 200d708: 80 8b e0 01 btst 1, %o7 200d70c: 12 80 00 1c bne 200d77c <_Heap_Free+0x108> 200d710: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200d714: 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); 200d718: 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; 200d71c: 80 a0 40 0f cmp %g1, %o7 200d720: 18 80 00 2d bgu 200d7d4 <_Heap_Free+0x160> <== NEVER TAKEN 200d724: 84 10 20 00 clr %g2 200d728: 80 a1 00 0f cmp %g4, %o7 200d72c: 2a 80 00 2b bcs,a 200d7d8 <_Heap_Free+0x164> <== NEVER TAKEN 200d730: 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; 200d734: 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) ) { 200d738: 80 88 60 01 btst 1, %g1 200d73c: 02 80 00 26 be 200d7d4 <_Heap_Free+0x160> <== NEVER TAKEN 200d740: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200d744: 02 80 00 39 be 200d828 <_Heap_Free+0x1b4> 200d748: 96 06 40 0b add %i1, %o3, %o3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d74c: c2 00 e0 08 ld [ %g3 + 8 ], %g1 200d750: 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; 200d754: 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; 200d758: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200d75c: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200d760: 82 00 ff ff add %g3, -1, %g1 200d764: 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; 200d768: 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; 200d76c: 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; 200d770: 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; 200d774: 10 80 00 0e b 200d7ac <_Heap_Free+0x138> 200d778: 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 */ 200d77c: 22 80 00 19 be,a 200d7e0 <_Heap_Free+0x16c> 200d780: c4 06 20 08 ld [ %i0 + 8 ], %g2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200d784: c4 00 e0 08 ld [ %g3 + 8 ], %g2 200d788: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200d78c: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200d790: 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; 200d794: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200d798: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200d79c: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d7a0: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200d7a4: 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; 200d7a8: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d7ac: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200d7b0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200d7b4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d7b8: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200d7bc: 82 00 60 01 inc %g1 stats->free_size += block_size; 200d7c0: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d7c4: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200d7c8: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200d7cc: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200d7d0: 84 10 20 01 mov 1, %g2 } 200d7d4: b0 08 a0 01 and %g2, 1, %i0 200d7d8: 81 c7 e0 08 ret 200d7dc: 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; 200d7e0: 82 16 60 01 or %i1, 1, %g1 200d7e4: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d7e8: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200d7ec: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200d7f0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200d7f4: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200d7f8: 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; 200d7fc: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200d800: 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; 200d804: 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 ) { 200d808: 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; 200d80c: 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; 200d810: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200d814: 80 a0 40 02 cmp %g1, %g2 200d818: 08 bf ff e5 bleu 200d7ac <_Heap_Free+0x138> 200d81c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200d820: 10 bf ff e3 b 200d7ac <_Heap_Free+0x138> 200d824: 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; 200d828: 82 12 e0 01 or %o3, 1, %g1 200d82c: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d830: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200d834: 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; 200d838: 82 08 7f fe and %g1, -2, %g1 200d83c: 10 bf ff dc b 200d7ac <_Heap_Free+0x138> 200d840: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0200dd5c <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200dd5c: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200dd60: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200dd64: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200dd68: 92 10 20 00 clr %o1 200dd6c: 90 10 00 19 mov %i1, %o0 200dd70: 40 00 0a 98 call 20107d0 200dd74: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200dd78: 80 a7 40 1c cmp %i5, %i4 200dd7c: 02 80 00 17 be 200ddd8 <_Heap_Get_information+0x7c> <== NEVER TAKEN 200dd80: 01 00 00 00 nop 200dd84: 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; 200dd88: 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); 200dd8c: ba 07 40 02 add %i5, %g2, %i5 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200dd90: 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) ) 200dd94: 80 88 e0 01 btst 1, %g3 200dd98: 02 80 00 03 be 200dda4 <_Heap_Get_information+0x48> 200dd9c: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200dda0: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200dda4: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200dda8: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200ddac: 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++; 200ddb0: 9e 03 e0 01 inc %o7 info->total += the_size; 200ddb4: 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++; 200ddb8: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200ddbc: 80 a1 00 02 cmp %g4, %g2 200ddc0: 1a 80 00 03 bcc 200ddcc <_Heap_Get_information+0x70> 200ddc4: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200ddc8: 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 ) { 200ddcc: 80 a7 00 1d cmp %i4, %i5 200ddd0: 12 bf ff ef bne 200dd8c <_Heap_Get_information+0x30> 200ddd4: 84 08 ff fe and %g3, -2, %g2 200ddd8: 81 c7 e0 08 ret 200dddc: 81 e8 00 00 restore =============================================================================== 0201abd8 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 201abd8: 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); 201abdc: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 201abe0: 7f ff f7 d2 call 2018b28 <.urem> 201abe4: 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 201abe8: 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); 201abec: 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); 201abf0: 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; 201abf4: 80 a0 80 01 cmp %g2, %g1 201abf8: 0a 80 00 16 bcs 201ac50 <_Heap_Size_of_alloc_area+0x78> 201abfc: 86 10 20 00 clr %g3 201ac00: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 201ac04: 80 a0 80 04 cmp %g2, %g4 201ac08: 18 80 00 13 bgu 201ac54 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ac0c: 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; 201ac10: f0 00 a0 04 ld [ %g2 + 4 ], %i0 201ac14: 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); 201ac18: 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; 201ac1c: 80 a0 40 02 cmp %g1, %g2 201ac20: 18 80 00 0d bgu 201ac54 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ac24: b0 08 e0 01 and %g3, 1, %i0 201ac28: 80 a1 00 02 cmp %g4, %g2 201ac2c: 0a 80 00 0a bcs 201ac54 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ac30: 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; 201ac34: 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 ) 201ac38: 80 88 60 01 btst 1, %g1 201ac3c: 02 80 00 06 be 201ac54 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201ac40: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 201ac44: 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; 201ac48: 84 00 a0 04 add %g2, 4, %g2 201ac4c: c4 26 80 00 st %g2, [ %i2 ] return true; } 201ac50: b0 08 e0 01 and %g3, 1, %i0 201ac54: 81 c7 e0 08 ret 201ac58: 81 e8 00 00 restore =============================================================================== 02008754 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008754: 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; 2008758: 3b 00 80 21 sethi %hi(0x2008400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 200875c: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 2008760: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 2008764: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 2008768: 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; 200876c: 80 a6 a0 00 cmp %i2, 0 2008770: 02 80 00 04 be 2008780 <_Heap_Walk+0x2c> 2008774: ba 17 62 e8 or %i5, 0x2e8, %i5 2008778: 3b 00 80 21 sethi %hi(0x2008400), %i5 200877c: ba 17 62 f0 or %i5, 0x2f0, %i5 ! 20086f0 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008780: 03 00 80 65 sethi %hi(0x2019400), %g1 2008784: c4 00 61 84 ld [ %g1 + 0x184 ], %g2 ! 2019584 <_System_state_Current> 2008788: 80 a0 a0 03 cmp %g2, 3 200878c: 02 80 00 05 be 20087a0 <_Heap_Walk+0x4c> 2008790: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 2008794: b0 08 60 01 and %g1, 1, %i0 2008798: 81 c7 e0 08 ret 200879c: 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)( 20087a0: da 06 20 18 ld [ %i0 + 0x18 ], %o5 20087a4: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 20087a8: c4 06 20 08 ld [ %i0 + 8 ], %g2 20087ac: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20087b0: 90 10 00 19 mov %i1, %o0 20087b4: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20087b8: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 20087bc: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 20087c0: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 20087c4: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20087c8: 92 10 20 00 clr %o1 20087cc: 96 10 00 10 mov %l0, %o3 20087d0: 15 00 80 5a sethi %hi(0x2016800), %o2 20087d4: 98 10 00 1b mov %i3, %o4 20087d8: 9f c7 40 00 call %i5 20087dc: 94 12 a0 f0 or %o2, 0xf0, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 20087e0: 80 a4 20 00 cmp %l0, 0 20087e4: 02 80 00 28 be 2008884 <_Heap_Walk+0x130> 20087e8: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 20087ec: 12 80 00 2d bne 20088a0 <_Heap_Walk+0x14c> 20087f0: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20087f4: 7f ff e4 b6 call 2001acc <.urem> 20087f8: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20087fc: 80 a2 20 00 cmp %o0, 0 2008800: 12 80 00 30 bne 20088c0 <_Heap_Walk+0x16c> 2008804: 90 07 20 08 add %i4, 8, %o0 2008808: 7f ff e4 b1 call 2001acc <.urem> 200880c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 2008810: 80 a2 20 00 cmp %o0, 0 2008814: 32 80 00 33 bne,a 20088e0 <_Heap_Walk+0x18c> 2008818: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 200881c: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008820: 80 8d 20 01 btst 1, %l4 2008824: 22 80 00 36 be,a 20088fc <_Heap_Walk+0x1a8> 2008828: 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; 200882c: c2 04 60 04 ld [ %l1 + 4 ], %g1 2008830: 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); 2008834: 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; 2008838: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200883c: 80 88 a0 01 btst 1, %g2 2008840: 02 80 00 0a be 2008868 <_Heap_Walk+0x114> 2008844: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 2008848: 02 80 00 33 be 2008914 <_Heap_Walk+0x1c0> 200884c: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008850: 92 10 20 01 mov 1, %o1 2008854: 15 00 80 5a sethi %hi(0x2016800), %o2 2008858: 9f c7 40 00 call %i5 200885c: 94 12 a2 68 or %o2, 0x268, %o2 ! 2016a68 <_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; 2008860: 10 bf ff cd b 2008794 <_Heap_Walk+0x40> 2008864: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2008868: 90 10 00 19 mov %i1, %o0 200886c: 92 10 20 01 mov 1, %o1 2008870: 15 00 80 5a sethi %hi(0x2016800), %o2 2008874: 9f c7 40 00 call %i5 2008878: 94 12 a2 50 or %o2, 0x250, %o2 ! 2016a50 <_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; 200887c: 10 bf ff c6 b 2008794 <_Heap_Walk+0x40> 2008880: 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" ); 2008884: 90 10 00 19 mov %i1, %o0 2008888: 92 10 20 01 mov 1, %o1 200888c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008890: 9f c7 40 00 call %i5 2008894: 94 12 a1 88 or %o2, 0x188, %o2 ! 2016988 <_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; 2008898: 10 bf ff bf b 2008794 <_Heap_Walk+0x40> 200889c: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 20088a0: 90 10 00 19 mov %i1, %o0 20088a4: 92 10 20 01 mov 1, %o1 20088a8: 96 10 00 10 mov %l0, %o3 20088ac: 15 00 80 5a sethi %hi(0x2016800), %o2 20088b0: 9f c7 40 00 call %i5 20088b4: 94 12 a1 a0 or %o2, 0x1a0, %o2 ! 20169a0 <_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; 20088b8: 10 bf ff b7 b 2008794 <_Heap_Walk+0x40> 20088bc: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 20088c0: 90 10 00 19 mov %i1, %o0 20088c4: 92 10 20 01 mov 1, %o1 20088c8: 96 10 00 1b mov %i3, %o3 20088cc: 15 00 80 5a sethi %hi(0x2016800), %o2 20088d0: 9f c7 40 00 call %i5 20088d4: 94 12 a1 c0 or %o2, 0x1c0, %o2 ! 20169c0 <_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; 20088d8: 10 bf ff af b 2008794 <_Heap_Walk+0x40> 20088dc: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 20088e0: 92 10 20 01 mov 1, %o1 20088e4: 96 10 00 1c mov %i4, %o3 20088e8: 15 00 80 5a sethi %hi(0x2016800), %o2 20088ec: 9f c7 40 00 call %i5 20088f0: 94 12 a1 e8 or %o2, 0x1e8, %o2 ! 20169e8 <_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; 20088f4: 10 bf ff a8 b 2008794 <_Heap_Walk+0x40> 20088f8: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 20088fc: 92 10 20 01 mov 1, %o1 2008900: 15 00 80 5a sethi %hi(0x2016800), %o2 2008904: 9f c7 40 00 call %i5 2008908: 94 12 a2 20 or %o2, 0x220, %o2 ! 2016a20 <_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; 200890c: 10 bf ff a2 b 2008794 <_Heap_Walk+0x40> 2008910: 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; 2008914: 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; 2008918: 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 ) { 200891c: 80 a6 00 1a cmp %i0, %i2 2008920: 02 80 00 0d be 2008954 <_Heap_Walk+0x200> 2008924: 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; 2008928: 80 a0 40 1a cmp %g1, %i2 200892c: 28 80 00 bc bleu,a 2008c1c <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 2008930: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2008934: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008938: 92 10 20 01 mov 1, %o1 200893c: 96 10 00 1a mov %i2, %o3 2008940: 15 00 80 5a sethi %hi(0x2016800), %o2 2008944: 9f c7 40 00 call %i5 2008948: 94 12 a2 98 or %o2, 0x298, %o2 ! 2016a98 <_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; 200894c: 10 bf ff 92 b 2008794 <_Heap_Walk+0x40> 2008950: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008954: 2d 00 80 5b sethi %hi(0x2016c00), %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)( 2008958: 2f 00 80 5b sethi %hi(0x2016c00), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200895c: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008960: ac 15 a0 c8 or %l6, 0xc8, %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)( 2008964: ae 15 e0 b0 or %l7, 0xb0, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008968: 2b 00 80 5b sethi %hi(0x2016c00), %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; 200896c: 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); 2008970: 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; 2008974: 80 a0 40 1a cmp %g1, %i2 2008978: 28 80 00 0b bleu,a 20089a4 <_Heap_Walk+0x250> <== ALWAYS TAKEN 200897c: 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)( 2008980: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008984: 92 10 20 01 mov 1, %o1 2008988: 96 10 00 12 mov %l2, %o3 200898c: 15 00 80 5a sethi %hi(0x2016800), %o2 2008990: 98 10 00 1a mov %i2, %o4 2008994: 9f c7 40 00 call %i5 2008998: 94 12 a3 40 or %o2, 0x340, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 200899c: 10 bf ff 7e b 2008794 <_Heap_Walk+0x40> 20089a0: 82 10 20 00 clr %g1 20089a4: 80 a0 40 1a cmp %g1, %i2 20089a8: 0a bf ff f7 bcs 2008984 <_Heap_Walk+0x230> 20089ac: 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; 20089b0: 82 1c 80 11 xor %l2, %l1, %g1 20089b4: 80 a0 00 01 cmp %g0, %g1 20089b8: 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; 20089bc: 90 10 00 13 mov %l3, %o0 20089c0: c2 27 bf fc st %g1, [ %fp + -4 ] 20089c4: 7f ff e4 42 call 2001acc <.urem> 20089c8: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 20089cc: 80 a2 20 00 cmp %o0, 0 20089d0: 02 80 00 05 be 20089e4 <_Heap_Walk+0x290> 20089d4: c2 07 bf fc ld [ %fp + -4 ], %g1 20089d8: 80 88 60 ff btst 0xff, %g1 20089dc: 12 80 00 76 bne 2008bb4 <_Heap_Walk+0x460> 20089e0: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 20089e4: 80 a6 c0 13 cmp %i3, %l3 20089e8: 08 80 00 05 bleu 20089fc <_Heap_Walk+0x2a8> 20089ec: 80 a4 80 1a cmp %l2, %i2 20089f0: 80 88 60 ff btst 0xff, %g1 20089f4: 12 80 00 78 bne 2008bd4 <_Heap_Walk+0x480> <== ALWAYS TAKEN 20089f8: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 20089fc: 2a 80 00 06 bcs,a 2008a14 <_Heap_Walk+0x2c0> 2008a00: c2 06 a0 04 ld [ %i2 + 4 ], %g1 2008a04: 80 88 60 ff btst 0xff, %g1 2008a08: 12 80 00 7d bne 2008bfc <_Heap_Walk+0x4a8> 2008a0c: 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; 2008a10: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008a14: 80 88 60 01 btst 1, %g1 2008a18: 02 80 00 19 be 2008a7c <_Heap_Walk+0x328> 2008a1c: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2008a20: 80 a5 20 00 cmp %l4, 0 2008a24: 22 80 00 0e be,a 2008a5c <_Heap_Walk+0x308> 2008a28: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 2008a2c: 90 10 00 19 mov %i1, %o0 2008a30: 92 10 20 00 clr %o1 2008a34: 94 10 00 17 mov %l7, %o2 2008a38: 96 10 00 12 mov %l2, %o3 2008a3c: 9f c7 40 00 call %i5 2008a40: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008a44: 80 a7 00 1a cmp %i4, %i2 2008a48: 02 80 00 42 be 2008b50 <_Heap_Walk+0x3fc> 2008a4c: a4 10 00 1a mov %i2, %l2 2008a50: e8 06 a0 04 ld [ %i2 + 4 ], %l4 2008a54: 10 bf ff c6 b 200896c <_Heap_Walk+0x218> 2008a58: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008a5c: 96 10 00 12 mov %l2, %o3 2008a60: 90 10 00 19 mov %i1, %o0 2008a64: 92 10 20 00 clr %o1 2008a68: 94 10 00 16 mov %l6, %o2 2008a6c: 9f c7 40 00 call %i5 2008a70: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008a74: 10 bf ff f5 b 2008a48 <_Heap_Walk+0x2f4> 2008a78: 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 ? 2008a7c: 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)( 2008a80: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008a84: 05 00 80 5a sethi %hi(0x2016800), %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; 2008a88: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008a8c: 80 a0 40 0d cmp %g1, %o5 2008a90: 02 80 00 05 be 2008aa4 <_Heap_Walk+0x350> 2008a94: 86 10 a0 b0 or %g2, 0xb0, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008a98: 80 a6 00 0d cmp %i0, %o5 2008a9c: 02 80 00 3c be 2008b8c <_Heap_Walk+0x438> 2008aa0: 86 15 60 78 or %l5, 0x78, %g3 block->next, block->next == last_free_block ? 2008aa4: 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)( 2008aa8: 1f 00 80 5a sethi %hi(0x2016800), %o7 2008aac: 80 a1 00 01 cmp %g4, %g1 2008ab0: 02 80 00 05 be 2008ac4 <_Heap_Walk+0x370> 2008ab4: 84 13 e0 d0 or %o7, 0xd0, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008ab8: 80 a6 00 01 cmp %i0, %g1 2008abc: 02 80 00 31 be 2008b80 <_Heap_Walk+0x42c> 2008ac0: 84 15 60 78 or %l5, 0x78, %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)( 2008ac4: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008ac8: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008acc: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008ad0: 90 10 00 19 mov %i1, %o0 2008ad4: 92 10 20 00 clr %o1 2008ad8: 15 00 80 5b sethi %hi(0x2016c00), %o2 2008adc: 96 10 00 12 mov %l2, %o3 2008ae0: 94 12 a0 08 or %o2, 8, %o2 2008ae4: 9f c7 40 00 call %i5 2008ae8: 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 ) { 2008aec: da 06 80 00 ld [ %i2 ], %o5 2008af0: 80 a4 c0 0d cmp %l3, %o5 2008af4: 12 80 00 19 bne 2008b58 <_Heap_Walk+0x404> 2008af8: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2008afc: 02 80 00 27 be 2008b98 <_Heap_Walk+0x444> 2008b00: 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; 2008b04: 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 ) { 2008b08: 80 a6 00 01 cmp %i0, %g1 2008b0c: 02 80 00 0b be 2008b38 <_Heap_Walk+0x3e4> <== NEVER TAKEN 2008b10: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008b14: 80 a4 80 01 cmp %l2, %g1 2008b18: 02 bf ff cc be 2008a48 <_Heap_Walk+0x2f4> 2008b1c: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2008b20: 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 ) { 2008b24: 80 a6 00 01 cmp %i0, %g1 2008b28: 12 bf ff fc bne 2008b18 <_Heap_Walk+0x3c4> 2008b2c: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008b30: 90 10 00 19 mov %i1, %o0 2008b34: 92 10 20 01 mov 1, %o1 2008b38: 96 10 00 12 mov %l2, %o3 2008b3c: 15 00 80 5b sethi %hi(0x2016c00), %o2 2008b40: 9f c7 40 00 call %i5 2008b44: 94 12 a0 f0 or %o2, 0xf0, %o2 ! 2016cf0 <_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; 2008b48: 10 bf ff 13 b 2008794 <_Heap_Walk+0x40> 2008b4c: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 2008b50: 10 bf ff 11 b 2008794 <_Heap_Walk+0x40> 2008b54: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008b58: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 2008b5c: 90 10 00 19 mov %i1, %o0 2008b60: 92 10 20 01 mov 1, %o1 2008b64: 96 10 00 12 mov %l2, %o3 2008b68: 15 00 80 5b sethi %hi(0x2016c00), %o2 2008b6c: 98 10 00 13 mov %l3, %o4 2008b70: 9f c7 40 00 call %i5 2008b74: 94 12 a0 40 or %o2, 0x40, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b78: 10 bf ff 07 b 2008794 <_Heap_Walk+0x40> 2008b7c: 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)" : "") 2008b80: 05 00 80 5a sethi %hi(0x2016800), %g2 2008b84: 10 bf ff d0 b 2008ac4 <_Heap_Walk+0x370> 2008b88: 84 10 a0 e0 or %g2, 0xe0, %g2 ! 20168e0 <_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)" : ""), 2008b8c: 07 00 80 5a sethi %hi(0x2016800), %g3 2008b90: 10 bf ff c5 b 2008aa4 <_Heap_Walk+0x350> 2008b94: 86 10 e0 c0 or %g3, 0xc0, %g3 ! 20168c0 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008b98: 92 10 20 01 mov 1, %o1 2008b9c: 96 10 00 12 mov %l2, %o3 2008ba0: 15 00 80 5b sethi %hi(0x2016c00), %o2 2008ba4: 9f c7 40 00 call %i5 2008ba8: 94 12 a0 80 or %o2, 0x80, %o2 ! 2016c80 <_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; 2008bac: 10 bf fe fa b 2008794 <_Heap_Walk+0x40> 2008bb0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008bb4: 92 10 20 01 mov 1, %o1 2008bb8: 96 10 00 12 mov %l2, %o3 2008bbc: 15 00 80 5a sethi %hi(0x2016800), %o2 2008bc0: 98 10 00 13 mov %l3, %o4 2008bc4: 9f c7 40 00 call %i5 2008bc8: 94 12 a3 70 or %o2, 0x370, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008bcc: 10 bf fe f2 b 2008794 <_Heap_Walk+0x40> 2008bd0: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008bd4: 90 10 00 19 mov %i1, %o0 2008bd8: 92 10 20 01 mov 1, %o1 2008bdc: 96 10 00 12 mov %l2, %o3 2008be0: 15 00 80 5a sethi %hi(0x2016800), %o2 2008be4: 98 10 00 13 mov %l3, %o4 2008be8: 94 12 a3 a0 or %o2, 0x3a0, %o2 2008bec: 9f c7 40 00 call %i5 2008bf0: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 2008bf4: 10 bf fe e8 b 2008794 <_Heap_Walk+0x40> 2008bf8: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008bfc: 92 10 20 01 mov 1, %o1 2008c00: 96 10 00 12 mov %l2, %o3 2008c04: 15 00 80 5a sethi %hi(0x2016800), %o2 2008c08: 98 10 00 1a mov %i2, %o4 2008c0c: 9f c7 40 00 call %i5 2008c10: 94 12 a3 d0 or %o2, 0x3d0, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008c14: 10 bf fe e0 b 2008794 <_Heap_Walk+0x40> 2008c18: 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; 2008c1c: 80 a6 80 13 cmp %i2, %l3 2008c20: 18 bf ff 46 bgu 2008938 <_Heap_Walk+0x1e4> <== NEVER TAKEN 2008c24: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008c28: c2 27 bf fc st %g1, [ %fp + -4 ] 2008c2c: 90 06 a0 08 add %i2, 8, %o0 2008c30: 7f ff e3 a7 call 2001acc <.urem> 2008c34: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008c38: 80 a2 20 00 cmp %o0, 0 2008c3c: 12 80 00 36 bne 2008d14 <_Heap_Walk+0x5c0> <== NEVER TAKEN 2008c40: 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; 2008c44: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008c48: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008c4c: 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; 2008c50: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c54: 80 88 a0 01 btst 1, %g2 2008c58: 12 80 00 27 bne 2008cf4 <_Heap_Walk+0x5a0> <== NEVER TAKEN 2008c5c: 84 10 00 18 mov %i0, %g2 2008c60: 10 80 00 19 b 2008cc4 <_Heap_Walk+0x570> 2008c64: 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 ) { 2008c68: 80 a6 00 1a cmp %i0, %i2 2008c6c: 02 bf ff 3a be 2008954 <_Heap_Walk+0x200> 2008c70: 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; 2008c74: 0a bf ff 31 bcs 2008938 <_Heap_Walk+0x1e4> 2008c78: 90 10 00 19 mov %i1, %o0 2008c7c: 80 a6 80 13 cmp %i2, %l3 2008c80: 18 bf ff 2f bgu 200893c <_Heap_Walk+0x1e8> <== NEVER TAKEN 2008c84: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008c88: c2 27 bf fc st %g1, [ %fp + -4 ] 2008c8c: 90 06 a0 08 add %i2, 8, %o0 2008c90: 7f ff e3 8f call 2001acc <.urem> 2008c94: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008c98: 80 a2 20 00 cmp %o0, 0 2008c9c: 12 80 00 1e bne 2008d14 <_Heap_Walk+0x5c0> 2008ca0: 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; 2008ca4: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008ca8: 84 10 00 12 mov %l2, %g2 2008cac: 86 08 ff fe and %g3, -2, %g3 block = next_block; } while ( block != first_block ); return true; } 2008cb0: 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; 2008cb4: c6 00 e0 04 ld [ %g3 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008cb8: 80 88 e0 01 btst 1, %g3 2008cbc: 12 80 00 0e bne 2008cf4 <_Heap_Walk+0x5a0> 2008cc0: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2008cc4: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2008cc8: 80 a3 00 02 cmp %o4, %g2 2008ccc: 22 bf ff e7 be,a 2008c68 <_Heap_Walk+0x514> 2008cd0: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2008cd4: 90 10 00 19 mov %i1, %o0 2008cd8: 92 10 20 01 mov 1, %o1 2008cdc: 96 10 00 1a mov %i2, %o3 2008ce0: 15 00 80 5a sethi %hi(0x2016800), %o2 2008ce4: 9f c7 40 00 call %i5 2008ce8: 94 12 a3 08 or %o2, 0x308, %o2 ! 2016b08 <_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; 2008cec: 10 bf fe aa b 2008794 <_Heap_Walk+0x40> 2008cf0: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008cf4: 90 10 00 19 mov %i1, %o0 2008cf8: 92 10 20 01 mov 1, %o1 2008cfc: 96 10 00 1a mov %i2, %o3 2008d00: 15 00 80 5a sethi %hi(0x2016800), %o2 2008d04: 9f c7 40 00 call %i5 2008d08: 94 12 a2 e8 or %o2, 0x2e8, %o2 ! 2016ae8 <_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; 2008d0c: 10 bf fe a2 b 2008794 <_Heap_Walk+0x40> 2008d10: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008d14: 90 10 00 19 mov %i1, %o0 2008d18: 92 10 20 01 mov 1, %o1 2008d1c: 96 10 00 1a mov %i2, %o3 2008d20: 15 00 80 5a sethi %hi(0x2016800), %o2 2008d24: 9f c7 40 00 call %i5 2008d28: 94 12 a2 b8 or %o2, 0x2b8, %o2 ! 2016ab8 <_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; 2008d2c: 10 bf fe 9a b 2008794 <_Heap_Walk+0x40> 2008d30: 82 10 20 00 clr %g1 =============================================================================== 02007150 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2007150: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2007154: 39 00 80 79 sethi %hi(0x201e400), %i4 2007158: c2 07 20 34 ld [ %i4 + 0x34 ], %g1 ! 201e434 <_IO_Number_of_drivers> 200715c: 80 a0 60 00 cmp %g1, 0 2007160: 02 80 00 0c be 2007190 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2007164: ba 10 20 00 clr %i5 2007168: b8 17 20 34 or %i4, 0x34, %i4 (void) rtems_io_initialize( major, 0, NULL ); 200716c: 90 10 00 1d mov %i5, %o0 2007170: 92 10 20 00 clr %o1 2007174: 40 00 18 0f call 200d1b0 2007178: 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 ++ ) 200717c: c2 07 00 00 ld [ %i4 ], %g1 2007180: ba 07 60 01 inc %i5 2007184: 80 a0 40 1d cmp %g1, %i5 2007188: 18 bf ff fa bgu 2007170 <_IO_Initialize_all_drivers+0x20> 200718c: 90 10 00 1d mov %i5, %o0 2007190: 81 c7 e0 08 ret 2007194: 81 e8 00 00 restore =============================================================================== 02007084 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2007084: 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; 2007088: 03 00 80 73 sethi %hi(0x201cc00), %g1 200708c: 82 10 61 5c or %g1, 0x15c, %g1 ! 201cd5c drivers_in_table = Configuration.number_of_device_drivers; 2007090: f8 00 60 30 ld [ %g1 + 0x30 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2007094: 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 ) 2007098: 80 a7 00 19 cmp %i4, %i1 200709c: 0a 80 00 08 bcs 20070bc <_IO_Manager_initialization+0x38> 20070a0: 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; 20070a4: 03 00 80 79 sethi %hi(0x201e400), %g1 20070a8: fa 20 60 38 st %i5, [ %g1 + 0x38 ] ! 201e438 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 20070ac: 03 00 80 79 sethi %hi(0x201e400), %g1 20070b0: f8 20 60 34 st %i4, [ %g1 + 0x34 ] ! 201e434 <_IO_Number_of_drivers> return; 20070b4: 81 c7 e0 08 ret 20070b8: 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 ) 20070bc: 83 2e 60 03 sll %i1, 3, %g1 20070c0: b5 2e 60 05 sll %i1, 5, %i2 20070c4: 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( 20070c8: 40 00 0d 68 call 200a668 <_Workspace_Allocate_or_fatal_error> 20070cc: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20070d0: 03 00 80 79 sethi %hi(0x201e400), %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 *) 20070d4: 37 00 80 79 sethi %hi(0x201e400), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20070d8: f2 20 60 34 st %i1, [ %g1 + 0x34 ] /* * 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 *) 20070dc: d0 26 e0 38 st %o0, [ %i3 + 0x38 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 20070e0: 92 10 20 00 clr %o1 20070e4: 40 00 25 03 call 20104f0 20070e8: 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++ ) 20070ec: 80 a7 20 00 cmp %i4, 0 20070f0: 02 bf ff f1 be 20070b4 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 20070f4: f6 06 e0 38 ld [ %i3 + 0x38 ], %i3 20070f8: 82 10 20 00 clr %g1 20070fc: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007100: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2007104: 86 07 40 01 add %i5, %g1, %g3 2007108: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 200710c: f4 00 e0 04 ld [ %g3 + 4 ], %i2 2007110: 84 06 c0 01 add %i3, %g1, %g2 2007114: f4 20 a0 04 st %i2, [ %g2 + 4 ] 2007118: 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++ ) 200711c: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007120: f4 20 a0 08 st %i2, [ %g2 + 8 ] 2007124: 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++ ) 2007128: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 200712c: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 2007130: 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++ ) 2007134: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 2007138: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 200713c: 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++ ) 2007140: 12 bf ff f0 bne 2007100 <_IO_Manager_initialization+0x7c> 2007144: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2007148: 81 c7 e0 08 ret 200714c: 81 e8 00 00 restore =============================================================================== 02007eb4 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007eb4: 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 ) 2007eb8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007ebc: 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 ) 2007ec0: 80 a0 60 00 cmp %g1, 0 2007ec4: 02 80 00 19 be 2007f28 <_Objects_Allocate+0x74> <== NEVER TAKEN 2007ec8: 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 ); 2007ecc: b8 07 60 20 add %i5, 0x20, %i4 2007ed0: 7f ff fd 63 call 200745c <_Chain_Get> 2007ed4: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007ed8: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2007edc: 80 a0 60 00 cmp %g1, 0 2007ee0: 02 80 00 12 be 2007f28 <_Objects_Allocate+0x74> 2007ee4: 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 ) { 2007ee8: 80 a2 20 00 cmp %o0, 0 2007eec: 02 80 00 11 be 2007f30 <_Objects_Allocate+0x7c> 2007ef0: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007ef4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007ef8: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007efc: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007f00: 40 00 42 5e call 2018878 <.udiv> 2007f04: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007f08: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007f0c: 91 2a 20 02 sll %o0, 2, %o0 2007f10: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007f14: 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 ]--; 2007f18: 86 00 ff ff add %g3, -1, %g3 2007f1c: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007f20: 82 00 bf ff add %g2, -1, %g1 2007f24: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007f28: 81 c7 e0 08 ret 2007f2c: 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 ); 2007f30: 40 00 00 10 call 2007f70 <_Objects_Extend_information> 2007f34: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007f38: 7f ff fd 49 call 200745c <_Chain_Get> 2007f3c: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007f40: b0 92 20 00 orcc %o0, 0, %i0 2007f44: 32 bf ff ed bne,a 2007ef8 <_Objects_Allocate+0x44> 2007f48: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2007f4c: 81 c7 e0 08 ret 2007f50: 81 e8 00 00 restore =============================================================================== 02007f70 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007f70: 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 ) 2007f74: 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 ); 2007f78: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007f7c: 80 a4 20 00 cmp %l0, 0 2007f80: 02 80 00 a6 be 2008218 <_Objects_Extend_information+0x2a8> 2007f84: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007f88: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 2007f8c: b3 2e 60 10 sll %i1, 0x10, %i1 2007f90: 92 10 00 1a mov %i2, %o1 2007f94: 40 00 42 39 call 2018878 <.udiv> 2007f98: 91 36 60 10 srl %i1, 0x10, %o0 2007f9c: a7 2a 20 10 sll %o0, 0x10, %l3 2007fa0: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 2007fa4: 80 a4 e0 00 cmp %l3, 0 2007fa8: 02 80 00 a3 be 2008234 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 2007fac: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 2007fb0: 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 ); 2007fb4: 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 ) { 2007fb8: 80 a0 60 00 cmp %g1, 0 2007fbc: 12 80 00 08 bne 2007fdc <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 2007fc0: b6 10 20 00 clr %i3 do_extend = false; 2007fc4: 10 80 00 a0 b 2008244 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 2007fc8: 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 ) { 2007fcc: c2 04 00 01 ld [ %l0 + %g1 ], %g1 2007fd0: 80 a0 60 00 cmp %g1, 0 2007fd4: 22 80 00 08 be,a 2007ff4 <_Objects_Extend_information+0x84> 2007fd8: 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++ ) { 2007fdc: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007fe0: 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++ ) { 2007fe4: 80 a4 c0 1b cmp %l3, %i3 2007fe8: 18 bf ff f9 bgu 2007fcc <_Objects_Extend_information+0x5c> 2007fec: 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; 2007ff0: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007ff4: 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 ) { 2007ff8: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007ffc: 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 ) { 2008000: 82 10 63 ff or %g1, 0x3ff, %g1 2008004: 80 a6 40 01 cmp %i1, %g1 2008008: 18 80 00 93 bgu 2008254 <_Objects_Extend_information+0x2e4> 200800c: 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; 2008010: 40 00 41 e0 call 2018790 <.umul> 2008014: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2008018: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 200801c: 80 a0 60 00 cmp %g1, 0 2008020: 02 80 00 6a be 20081c8 <_Objects_Extend_information+0x258> 2008024: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2008028: 40 00 09 82 call 200a630 <_Workspace_Allocate> 200802c: 01 00 00 00 nop if ( !new_object_block ) 2008030: a0 92 20 00 orcc %o0, 0, %l0 2008034: 02 80 00 88 be 2008254 <_Objects_Extend_information+0x2e4> 2008038: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 200803c: 80 8e a0 ff btst 0xff, %i2 2008040: 22 80 00 3f be,a 200813c <_Objects_Extend_information+0x1cc> 2008044: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2008048: 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 *)) + 200804c: 91 2e a0 01 sll %i2, 1, %o0 2008050: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2008054: 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 *)) + 2008058: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 200805c: 40 00 09 75 call 200a630 <_Workspace_Allocate> 2008060: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2008064: a2 92 20 00 orcc %o0, 0, %l1 2008068: 02 80 00 79 be 200824c <_Objects_Extend_information+0x2dc> 200806c: 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 ) { 2008070: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2008074: 80 a7 00 01 cmp %i4, %g1 2008078: a4 04 40 1a add %l1, %i2, %l2 200807c: 0a 80 00 57 bcs 20081d8 <_Objects_Extend_information+0x268> 2008080: 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++ ) { 2008084: 80 a7 20 00 cmp %i4, 0 2008088: 02 80 00 07 be 20080a4 <_Objects_Extend_information+0x134><== NEVER TAKEN 200808c: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2008090: 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++ ) { 2008094: 82 00 60 01 inc %g1 2008098: 80 a7 00 01 cmp %i4, %g1 200809c: 18 bf ff fd bgu 2008090 <_Objects_Extend_information+0x120><== NEVER TAKEN 20080a0: c0 20 80 1a clr [ %g2 + %i2 ] 20080a4: 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 ); 20080a8: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20080ac: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20080b0: 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 ; 20080b4: 80 a7 40 03 cmp %i5, %g3 20080b8: 1a 80 00 0a bcc 20080e0 <_Objects_Extend_information+0x170><== NEVER TAKEN 20080bc: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 20080c0: 83 2f 60 02 sll %i5, 2, %g1 20080c4: 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 ; 20080c8: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 20080cc: 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++ ) { 20080d0: 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 ; 20080d4: 80 a0 c0 02 cmp %g3, %g2 20080d8: 18 bf ff fd bgu 20080cc <_Objects_Extend_information+0x15c> 20080dc: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 20080e0: 7f ff e8 41 call 20021e4 20080e4: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20080e8: 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( 20080ec: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 20080f0: 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; 20080f4: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 20080f8: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20080fc: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2008100: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2008104: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2008108: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 200810c: 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) | 2008110: 03 00 00 40 sethi %hi(0x10000), %g1 2008114: b3 36 60 10 srl %i1, 0x10, %i1 2008118: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200811c: 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) | 2008120: 82 10 40 19 or %g1, %i1, %g1 2008124: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2008128: 7f ff e8 33 call 20021f4 200812c: 01 00 00 00 nop _Workspace_Free( old_tables ); 2008130: 40 00 09 48 call 200a650 <_Workspace_Free> 2008134: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2008138: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 200813c: b7 2e e0 02 sll %i3, 2, %i3 2008140: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2008144: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2008148: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 200814c: d2 00 40 1b ld [ %g1 + %i3 ], %o1 2008150: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2008154: 90 07 bf f4 add %fp, -12, %o0 2008158: 40 00 14 2e call 200d210 <_Chain_Initialize> 200815c: 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 ) { 2008160: 10 80 00 0d b 2008194 <_Objects_Extend_information+0x224> 2008164: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 2008168: c6 16 20 04 lduh [ %i0 + 4 ], %g3 200816c: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008170: 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) | 2008174: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008178: 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) | 200817c: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008180: 90 10 00 1a mov %i2, %o0 2008184: 92 10 00 01 mov %g1, %o1 index++; 2008188: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 200818c: 7f ff fc a0 call 200740c <_Chain_Append> 2008190: 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 ) { 2008194: 7f ff fc b2 call 200745c <_Chain_Get> 2008198: 90 07 bf f4 add %fp, -12, %o0 200819c: 82 92 20 00 orcc %o0, 0, %g1 20081a0: 32 bf ff f2 bne,a 2008168 <_Objects_Extend_information+0x1f8> 20081a4: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20081a8: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20081ac: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20081b0: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20081b4: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20081b8: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20081bc: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 20081c0: 81 c7 e0 08 ret 20081c4: 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 ); 20081c8: 40 00 09 28 call 200a668 <_Workspace_Allocate_or_fatal_error> 20081cc: 01 00 00 00 nop 20081d0: 10 bf ff 9b b 200803c <_Objects_Extend_information+0xcc> 20081d4: 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, 20081d8: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 20081dc: 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, 20081e0: 40 00 20 88 call 2010400 20081e4: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 20081e8: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 20081ec: 94 10 00 13 mov %l3, %o2 20081f0: 40 00 20 84 call 2010400 20081f4: 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 *) ); 20081f8: 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, 20081fc: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2008200: 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, 2008204: 90 10 00 1a mov %i2, %o0 2008208: 40 00 20 7e call 2010400 200820c: 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 ); 2008210: 10 bf ff a7 b 20080ac <_Objects_Extend_information+0x13c> 2008214: 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 ) 2008218: 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 ); 200821c: 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; 2008220: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2008224: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2008228: a6 10 20 00 clr %l3 200822c: 10 bf ff 72 b 2007ff4 <_Objects_Extend_information+0x84> 2008230: 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 ); 2008234: 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; 2008238: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 200823c: 10 bf ff 6e b 2007ff4 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2008240: b6 10 20 00 clr %i3 <== NOT EXECUTED 2008244: 10 bf ff 6c b 2007ff4 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2008248: 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 ); 200824c: 40 00 09 01 call 200a650 <_Workspace_Free> 2008250: 90 10 00 10 mov %l0, %o0 return; 2008254: 81 c7 e0 08 ret 2008258: 81 e8 00 00 restore =============================================================================== 02008300 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2008300: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2008304: 80 a6 60 00 cmp %i1, 0 2008308: 02 80 00 17 be 2008364 <_Objects_Get_information+0x64> 200830c: 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 ); 2008310: 40 00 15 4d call 200d844 <_Objects_API_maximum_class> 2008314: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2008318: 80 a2 20 00 cmp %o0, 0 200831c: 02 80 00 12 be 2008364 <_Objects_Get_information+0x64> 2008320: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2008324: 0a 80 00 10 bcs 2008364 <_Objects_Get_information+0x64> 2008328: 03 00 80 76 sethi %hi(0x201d800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 200832c: b1 2e 20 02 sll %i0, 2, %i0 2008330: 82 10 62 28 or %g1, 0x228, %g1 2008334: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2008338: 80 a0 60 00 cmp %g1, 0 200833c: 02 80 00 0a be 2008364 <_Objects_Get_information+0x64> <== NEVER TAKEN 2008340: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2008344: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2008348: 80 a7 60 00 cmp %i5, 0 200834c: 02 80 00 06 be 2008364 <_Objects_Get_information+0x64> <== NEVER TAKEN 2008350: 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 ) 2008354: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2008358: 80 a0 00 01 cmp %g0, %g1 200835c: 82 60 20 00 subx %g0, 0, %g1 2008360: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2008364: 81 c7 e0 08 ret 2008368: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02009b44 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009b44: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009b48: 80 a6 60 00 cmp %i1, 0 2009b4c: 02 80 00 41 be 2009c50 <_Objects_Get_name_as_string+0x10c> 2009b50: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2009b54: 02 80 00 3a be 2009c3c <_Objects_Get_name_as_string+0xf8> 2009b58: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009b5c: 02 80 00 3a be 2009c44 <_Objects_Get_name_as_string+0x100> 2009b60: 03 00 80 82 sethi %hi(0x2020800), %g1 information = _Objects_Get_information_id( tmpId ); 2009b64: 7f ff ff ba call 2009a4c <_Objects_Get_information_id> 2009b68: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009b6c: ba 92 20 00 orcc %o0, 0, %i5 2009b70: 02 80 00 38 be 2009c50 <_Objects_Get_name_as_string+0x10c> 2009b74: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009b78: 40 00 00 3f call 2009c74 <_Objects_Get> 2009b7c: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009b80: c2 07 bf fc ld [ %fp + -4 ], %g1 2009b84: 80 a0 60 00 cmp %g1, 0 2009b88: 32 80 00 33 bne,a 2009c54 <_Objects_Get_name_as_string+0x110> 2009b8c: b4 10 20 00 clr %i2 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 2009b90: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1 2009b94: 80 a0 60 00 cmp %g1, 0 2009b98: 32 80 00 31 bne,a 2009c5c <_Objects_Get_name_as_string+0x118> 2009b9c: 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; 2009ba0: 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'; 2009ba4: 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; 2009ba8: 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; 2009bac: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 2009bb0: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009bb4: 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; 2009bb8: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009bbc: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 2009bc0: c2 2f bf f3 stb %g1, [ %fp + -13 ] lname[ 4 ] = '\0'; s = lname; 2009bc4: 84 07 bf f0 add %fp, -16, %g2 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009bc8: b2 86 7f ff addcc %i1, -1, %i1 2009bcc: 02 80 00 1a be 2009c34 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 2009bd0: 82 10 00 1a mov %i2, %g1 2009bd4: c8 48 80 00 ldsb [ %g2 ], %g4 2009bd8: 80 a1 20 00 cmp %g4, 0 2009bdc: 02 80 00 16 be 2009c34 <_Objects_Get_name_as_string+0xf0> 2009be0: c6 08 80 00 ldub [ %g2 ], %g3 2009be4: 31 00 80 7e sethi %hi(0x201f800), %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( 2009be8: b2 06 80 19 add %i2, %i1, %i1 2009bec: 10 80 00 05 b 2009c00 <_Objects_Get_name_as_string+0xbc> 2009bf0: b0 16 20 44 or %i0, 0x44, %i0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009bf4: 80 a1 20 00 cmp %g4, 0 2009bf8: 02 80 00 0f be 2009c34 <_Objects_Get_name_as_string+0xf0> 2009bfc: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009c00: fa 06 00 00 ld [ %i0 ], %i5 2009c04: 88 08 e0 ff and %g3, 0xff, %g4 2009c08: 88 07 40 04 add %i5, %g4, %g4 2009c0c: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2009c10: 80 89 20 97 btst 0x97, %g4 2009c14: 12 80 00 03 bne 2009c20 <_Objects_Get_name_as_string+0xdc> 2009c18: 84 00 a0 01 inc %g2 2009c1c: 86 10 20 2a mov 0x2a, %g3 2009c20: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009c24: 82 00 60 01 inc %g1 2009c28: 80 a0 40 19 cmp %g1, %i1 2009c2c: 32 bf ff f2 bne,a 2009bf4 <_Objects_Get_name_as_string+0xb0> 2009c30: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009c34: 40 00 03 db call 200aba0 <_Thread_Enable_dispatch> 2009c38: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 2009c3c: 81 c7 e0 08 ret 2009c40: 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; 2009c44: c2 00 63 34 ld [ %g1 + 0x334 ], %g1 2009c48: 10 bf ff c7 b 2009b64 <_Objects_Get_name_as_string+0x20> 2009c4c: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009c50: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009c54: 81 c7 e0 08 ret 2009c58: 91 e8 00 1a restore %g0, %i2, %o0 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 2009c5c: 80 a0 a0 00 cmp %g2, 0 2009c60: 12 bf ff da bne 2009bc8 <_Objects_Get_name_as_string+0x84> 2009c64: 82 10 00 1a mov %i2, %g1 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009c68: 40 00 03 ce call 200aba0 <_Thread_Enable_dispatch> 2009c6c: c0 28 40 00 clrb [ %g1 ] 2009c70: 30 bf ff f3 b,a 2009c3c <_Objects_Get_name_as_string+0xf8> =============================================================================== 02007ff4 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2007ff4: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2007ff8: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2007ffc: 80 a6 20 00 cmp %i0, 0 2008000: 02 80 00 19 be 2008064 <_Objects_Get_next+0x70> 2008004: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2008008: 80 a6 a0 00 cmp %i2, 0 200800c: 02 80 00 16 be 2008064 <_Objects_Get_next+0x70> 2008010: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2008014: 02 80 00 14 be 2008064 <_Objects_Get_next+0x70> 2008018: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 200801c: 80 a0 60 00 cmp %g1, 0 2008020: 22 80 00 13 be,a 200806c <_Objects_Get_next+0x78> 2008024: 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) 2008028: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 200802c: 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); 2008030: 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) 2008034: 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); 2008038: 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) 200803c: 80 a0 80 01 cmp %g2, %g1 2008040: 0a 80 00 13 bcs 200808c <_Objects_Get_next+0x98> 2008044: 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); 2008048: 40 00 00 18 call 20080a8 <_Objects_Get> 200804c: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2008050: c2 06 80 00 ld [ %i2 ], %g1 2008054: 80 a0 60 00 cmp %g1, 0 2008058: 32 bf ff f5 bne,a 200802c <_Objects_Get_next+0x38> 200805c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2008060: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2008064: 81 c7 e0 08 ret 2008068: 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) 200806c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008070: 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); 2008074: 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) 2008078: 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); 200807c: 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) 2008080: 80 a0 80 01 cmp %g2, %g1 2008084: 1a bf ff f1 bcc 2008048 <_Objects_Get_next+0x54> <== ALWAYS TAKEN 2008088: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 200808c: 82 10 20 01 mov 1, %g1 2008090: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2008094: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2008098: 82 10 3f ff mov -1, %g1 200809c: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 20080a0: 81 c7 e0 08 ret 20080a4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02008da8 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2008da8: 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; 2008dac: 80 a6 20 00 cmp %i0, 0 2008db0: 12 80 00 06 bne 2008dc8 <_Objects_Id_to_name+0x20> 2008db4: 83 36 20 18 srl %i0, 0x18, %g1 2008db8: 03 00 80 7c sethi %hi(0x201f000), %g1 2008dbc: c2 00 63 74 ld [ %g1 + 0x374 ], %g1 ! 201f374 <_Per_CPU_Information+0xc> 2008dc0: f0 00 60 08 ld [ %g1 + 8 ], %i0 2008dc4: 83 36 20 18 srl %i0, 0x18, %g1 2008dc8: 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 ) 2008dcc: 84 00 7f ff add %g1, -1, %g2 2008dd0: 80 a0 a0 02 cmp %g2, 2 2008dd4: 18 80 00 12 bgu 2008e1c <_Objects_Id_to_name+0x74> 2008dd8: 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 ] ) 2008ddc: 83 28 60 02 sll %g1, 2, %g1 2008de0: 05 00 80 7b sethi %hi(0x201ec00), %g2 2008de4: 84 10 a1 98 or %g2, 0x198, %g2 ! 201ed98 <_Objects_Information_table> 2008de8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2008dec: 80 a0 60 00 cmp %g1, 0 2008df0: 02 80 00 0b be 2008e1c <_Objects_Id_to_name+0x74> 2008df4: 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 ]; 2008df8: 85 28 a0 02 sll %g2, 2, %g2 2008dfc: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2008e00: 80 a2 20 00 cmp %o0, 0 2008e04: 02 80 00 06 be 2008e1c <_Objects_Id_to_name+0x74> <== NEVER TAKEN 2008e08: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2008e0c: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2008e10: 80 a0 60 00 cmp %g1, 0 2008e14: 02 80 00 04 be 2008e24 <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN 2008e18: 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; } 2008e1c: 81 c7 e0 08 ret 2008e20: 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 ); 2008e24: 7f ff ff c3 call 2008d30 <_Objects_Get> 2008e28: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2008e2c: 80 a2 20 00 cmp %o0, 0 2008e30: 02 bf ff fb be 2008e1c <_Objects_Id_to_name+0x74> 2008e34: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2008e38: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2008e3c: 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(); 2008e40: 40 00 03 b0 call 2009d00 <_Thread_Enable_dispatch> 2008e44: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2008e48: 30 bf ff f5 b,a 2008e1c <_Objects_Id_to_name+0x74> =============================================================================== 0200863c <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 200863c: 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 ); 2008640: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 2008644: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2008648: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 200864c: 92 10 00 1c mov %i4, %o1 2008650: 40 00 40 8a call 2018878 <.udiv> 2008654: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2008658: 80 a2 20 00 cmp %o0, 0 200865c: 02 80 00 34 be 200872c <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 2008660: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2008664: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2008668: c2 01 00 00 ld [ %g4 ], %g1 200866c: 80 a7 00 01 cmp %i4, %g1 2008670: 02 80 00 0f be 20086ac <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2008674: 82 10 20 00 clr %g1 2008678: 10 80 00 07 b 2008694 <_Objects_Shrink_information+0x58> 200867c: b6 10 20 04 mov 4, %i3 * the_block - the block to remove * * Output parameters: NONE */ void _Objects_Shrink_information( 2008680: 86 06 e0 04 add %i3, 4, %g3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 2008684: 80 a7 00 02 cmp %i4, %g2 2008688: 02 80 00 0a be 20086b0 <_Objects_Shrink_information+0x74> 200868c: ba 07 40 1c add %i5, %i4, %i5 2008690: 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++ ) { 2008694: 82 00 60 01 inc %g1 2008698: 80 a0 40 08 cmp %g1, %o0 200869c: 32 bf ff f9 bne,a 2008680 <_Objects_Shrink_information+0x44> 20086a0: c4 01 00 1b ld [ %g4 + %i3 ], %g2 20086a4: 81 c7 e0 08 ret 20086a8: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 20086ac: 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; 20086b0: 10 80 00 06 b 20086c8 <_Objects_Shrink_information+0x8c> 20086b4: 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 ); 20086b8: 80 a7 20 00 cmp %i4, 0 20086bc: 22 80 00 12 be,a 2008704 <_Objects_Shrink_information+0xc8> 20086c0: 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; 20086c4: 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 ); 20086c8: 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) && 20086cc: 80 a0 40 1d cmp %g1, %i5 20086d0: 0a bf ff fa bcs 20086b8 <_Objects_Shrink_information+0x7c> 20086d4: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 20086d8: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20086dc: 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) && 20086e0: 80 a0 40 02 cmp %g1, %g2 20086e4: 1a bf ff f6 bcc 20086bc <_Objects_Shrink_information+0x80> 20086e8: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 20086ec: 7f ff fb 53 call 2007438 <_Chain_Extract> 20086f0: 01 00 00 00 nop } } while ( the_object ); 20086f4: 80 a7 20 00 cmp %i4, 0 20086f8: 12 bf ff f4 bne 20086c8 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 20086fc: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2008700: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2008704: 40 00 07 d3 call 200a650 <_Workspace_Free> 2008708: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 200870c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2008710: 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; 2008714: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 2008718: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 200871c: 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; 2008720: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 2008724: 82 20 80 01 sub %g2, %g1, %g1 2008728: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 200872c: 81 c7 e0 08 ret 2008730: 81 e8 00 00 restore =============================================================================== 0200f078 <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200f078: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200f07c: f4 06 20 08 ld [ %i0 + 8 ], %i2 200f080: 3b 00 80 77 sethi %hi(0x201dc00), %i5 200f084: b3 36 a0 18 srl %i2, 0x18, %i1 200f088: ba 17 62 d8 or %i5, 0x2d8, %i5 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200f08c: b5 2e a0 10 sll %i2, 0x10, %i2 200f090: b2 0e 60 07 and %i1, 7, %i1 200f094: b5 36 a0 0e srl %i2, 0xe, %i2 200f098: b2 06 60 04 add %i1, 4, %i1 200f09c: b3 2e 60 02 sll %i1, 2, %i1 Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200f0a0: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 200f0a4: 80 a6 e0 00 cmp %i3, 0 200f0a8: 02 80 00 20 be 200f128 <_POSIX_Keys_Run_destructors+0xb0> 200f0ac: b8 10 20 01 mov 1, %i4 200f0b0: 84 10 20 01 mov 1, %g2 POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200f0b4: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 _POSIX_Keys_Information.local_table [ index ]; 200f0b8: 83 2f 20 10 sll %i4, 0x10, %g1 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200f0bc: 83 30 60 0e srl %g1, 0xe, %g1 200f0c0: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200f0c4: 80 a0 60 00 cmp %g1, 0 200f0c8: 02 80 00 10 be 200f108 <_POSIX_Keys_Run_destructors+0x90> 200f0cc: 86 00 40 19 add %g1, %i1, %g3 200f0d0: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 200f0d4: 80 a1 20 00 cmp %g4, 0 200f0d8: 22 80 00 0d be,a 200f10c <_POSIX_Keys_Run_destructors+0x94> 200f0dc: b8 07 20 01 inc %i4 void *value = key->Values [ thread_api ][ thread_index ]; 200f0e0: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200f0e4: d0 00 c0 1a ld [ %g3 + %i2 ], %o0 if ( value != NULL ) { 200f0e8: 80 a2 20 00 cmp %o0, 0 200f0ec: 22 80 00 08 be,a 200f10c <_POSIX_Keys_Run_destructors+0x94><== ALWAYS TAKEN 200f0f0: b8 07 20 01 inc %i4 key->Values [ thread_api ][ thread_index ] = NULL; 200f0f4: c0 20 c0 1a clr [ %g3 + %i2 ] <== NOT EXECUTED (*key->destructor)( value ); 200f0f8: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED 200f0fc: 9f c0 40 00 call %g1 <== NOT EXECUTED 200f100: 01 00 00 00 nop <== NOT EXECUTED done = false; 200f104: 84 10 20 00 clr %g2 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200f108: b8 07 20 01 inc %i4 200f10c: 83 2f 20 10 sll %i4, 0x10, %g1 200f110: 83 30 60 10 srl %g1, 0x10, %g1 200f114: 80 a6 c0 01 cmp %i3, %g1 200f118: 1a bf ff e7 bcc 200f0b4 <_POSIX_Keys_Run_destructors+0x3c> 200f11c: 80 88 a0 ff btst 0xff, %g2 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 200f120: 22 bf ff e1 be,a 200f0a4 <_POSIX_Keys_Run_destructors+0x2c><== NEVER TAKEN 200f124: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 <== NOT EXECUTED 200f128: 81 c7 e0 08 ret 200f12c: 81 e8 00 00 restore =============================================================================== 0200b628 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b628: 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( 200b62c: 11 00 80 9f sethi %hi(0x2027c00), %o0 200b630: 92 10 00 18 mov %i0, %o1 200b634: 90 12 23 0c or %o0, 0x30c, %o0 200b638: 40 00 0d 44 call 200eb48 <_Objects_Get> 200b63c: 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 ) { 200b640: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b644: 80 a0 60 00 cmp %g1, 0 200b648: 22 80 00 08 be,a 200b668 <_POSIX_Message_queue_Receive_support+0x40> 200b64c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b650: 40 00 2d 30 call 2016b10 <__errno> 200b654: b0 10 3f ff mov -1, %i0 200b658: 82 10 20 09 mov 9, %g1 200b65c: c2 22 00 00 st %g1, [ %o0 ] } 200b660: 81 c7 e0 08 ret 200b664: 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 ) { 200b668: 84 08 60 03 and %g1, 3, %g2 200b66c: 80 a0 a0 01 cmp %g2, 1 200b670: 02 80 00 37 be 200b74c <_POSIX_Message_queue_Receive_support+0x124> 200b674: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200b678: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b67c: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b680: 80 a0 80 1a cmp %g2, %i2 200b684: 18 80 00 21 bgu 200b708 <_POSIX_Message_queue_Receive_support+0xe0> 200b688: 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; 200b68c: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b690: 80 a7 20 00 cmp %i4, 0 200b694: 12 80 00 18 bne 200b6f4 <_POSIX_Message_queue_Receive_support+0xcc><== ALWAYS TAKEN 200b698: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b69c: 9a 10 00 1d mov %i5, %o5 200b6a0: 90 02 20 1c add %o0, 0x1c, %o0 200b6a4: 92 10 00 18 mov %i0, %o1 200b6a8: 94 10 00 19 mov %i1, %o2 200b6ac: 96 07 bf fc add %fp, -4, %o3 200b6b0: 40 00 08 c1 call 200d9b4 <_CORE_message_queue_Seize> 200b6b4: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b6b8: 40 00 11 0e call 200faf0 <_Thread_Enable_dispatch> 200b6bc: 3b 00 80 9f sethi %hi(0x2027c00), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b6c0: ba 17 63 78 or %i5, 0x378, %i5 ! 2027f78 <_Per_CPU_Information> 200b6c4: 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); 200b6c8: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 if ( !_Thread_Executing->Wait.return_code ) 200b6cc: c6 00 60 34 ld [ %g1 + 0x34 ], %g3 200b6d0: 83 38 a0 1f sra %g2, 0x1f, %g1 200b6d4: 84 18 40 02 xor %g1, %g2, %g2 200b6d8: 82 20 80 01 sub %g2, %g1, %g1 200b6dc: 80 a0 e0 00 cmp %g3, 0 200b6e0: 12 80 00 12 bne 200b728 <_POSIX_Message_queue_Receive_support+0x100> 200b6e4: c2 26 c0 00 st %g1, [ %i3 ] return length_out; 200b6e8: f0 07 bf fc ld [ %fp + -4 ], %i0 200b6ec: 81 c7 e0 08 ret 200b6f0: 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; 200b6f4: 05 00 00 10 sethi %hi(0x4000), %g2 200b6f8: 82 08 40 02 and %g1, %g2, %g1 200b6fc: 80 a0 00 01 cmp %g0, %g1 200b700: 10 bf ff e7 b 200b69c <_POSIX_Message_queue_Receive_support+0x74> 200b704: 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(); 200b708: 40 00 10 fa call 200faf0 <_Thread_Enable_dispatch> 200b70c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b710: 40 00 2d 00 call 2016b10 <__errno> 200b714: 01 00 00 00 nop 200b718: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b71c: c2 22 00 00 st %g1, [ %o0 ] 200b720: 81 c7 e0 08 ret 200b724: 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( 200b728: 40 00 2c fa call 2016b10 <__errno> 200b72c: b0 10 3f ff mov -1, %i0 200b730: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b734: b6 10 00 08 mov %o0, %i3 200b738: 40 00 00 a3 call 200b9c4 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b73c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b740: d0 26 c0 00 st %o0, [ %i3 ] 200b744: 81 c7 e0 08 ret 200b748: 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(); 200b74c: 40 00 10 e9 call 200faf0 <_Thread_Enable_dispatch> 200b750: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200b754: 40 00 2c ef call 2016b10 <__errno> 200b758: 01 00 00 00 nop 200b75c: 82 10 20 09 mov 9, %g1 ! 9 200b760: c2 22 00 00 st %g1, [ %o0 ] 200b764: 81 c7 e0 08 ret 200b768: 81 e8 00 00 restore =============================================================================== 0200c248 <_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 ]; 200c248: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200c24c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200c250: 80 a0 a0 00 cmp %g2, 0 200c254: 12 80 00 06 bne 200c26c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200c258: 01 00 00 00 nop 200c25c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200c260: 80 a0 a0 01 cmp %g2, 1 200c264: 22 80 00 05 be,a 200c278 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200c268: 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(); 200c26c: 82 13 c0 00 mov %o7, %g1 200c270: 7f ff f3 d1 call 20091b4 <_Thread_Enable_dispatch> 200c274: 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 && 200c278: 80 a0 60 00 cmp %g1, 0 200c27c: 02 bf ff fc be 200c26c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200c280: 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--; 200c284: 03 00 80 60 sethi %hi(0x2018000), %g1 200c288: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 2018180 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200c28c: 92 10 3f ff mov -1, %o1 200c290: 84 00 bf ff add %g2, -1, %g2 200c294: c4 20 61 80 st %g2, [ %g1 + 0x180 ] return _Thread_Dispatch_disable_level; 200c298: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 200c29c: 82 13 c0 00 mov %o7, %g1 200c2a0: 40 00 01 da call 200ca08 <_POSIX_Thread_Exit> 200c2a4: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200d760 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200d760: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200d764: d0 06 40 00 ld [ %i1 ], %o0 200d768: 7f ff ff f1 call 200d72c <_POSIX_Priority_Is_valid> 200d76c: ba 10 00 18 mov %i0, %i5 200d770: 80 8a 20 ff btst 0xff, %o0 200d774: 02 80 00 34 be 200d844 <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN 200d778: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200d77c: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; 200d780: c0 26 c0 00 clr [ %i3 ] if ( policy == SCHED_OTHER ) { 200d784: 80 a7 60 00 cmp %i5, 0 200d788: 02 80 00 2d be 200d83c <_POSIX_Thread_Translate_sched_param+0xdc> 200d78c: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200d790: 80 a7 60 01 cmp %i5, 1 200d794: 02 80 00 2c be 200d844 <_POSIX_Thread_Translate_sched_param+0xe4> 200d798: 80 a7 60 02 cmp %i5, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200d79c: 02 80 00 2c be 200d84c <_POSIX_Thread_Translate_sched_param+0xec> 200d7a0: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200d7a4: 12 80 00 28 bne 200d844 <_POSIX_Thread_Translate_sched_param+0xe4> 200d7a8: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200d7ac: c2 06 60 08 ld [ %i1 + 8 ], %g1 200d7b0: 80 a0 60 00 cmp %g1, 0 200d7b4: 32 80 00 07 bne,a 200d7d0 <_POSIX_Thread_Translate_sched_param+0x70> 200d7b8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d7bc: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200d7c0: 80 a0 60 00 cmp %g1, 0 200d7c4: 02 80 00 23 be 200d850 <_POSIX_Thread_Translate_sched_param+0xf0> 200d7c8: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200d7cc: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200d7d0: 80 a0 60 00 cmp %g1, 0 200d7d4: 12 80 00 06 bne 200d7ec <_POSIX_Thread_Translate_sched_param+0x8c> 200d7d8: 01 00 00 00 nop 200d7dc: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d7e0: 80 a0 60 00 cmp %g1, 0 200d7e4: 02 80 00 18 be 200d844 <_POSIX_Thread_Translate_sched_param+0xe4> 200d7e8: 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 ) < 200d7ec: 7f ff f5 29 call 200ac90 <_Timespec_To_ticks> 200d7f0: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200d7f4: 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 ) < 200d7f8: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200d7fc: 7f ff f5 25 call 200ac90 <_Timespec_To_ticks> 200d800: 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 ) < 200d804: 80 a7 40 08 cmp %i5, %o0 200d808: 0a 80 00 12 bcs 200d850 <_POSIX_Thread_Translate_sched_param+0xf0> 200d80c: 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 ) ) 200d810: 7f ff ff c7 call 200d72c <_POSIX_Priority_Is_valid> 200d814: d0 06 60 04 ld [ %i1 + 4 ], %o0 200d818: 80 8a 20 ff btst 0xff, %o0 200d81c: 02 80 00 0a be 200d844 <_POSIX_Thread_Translate_sched_param+0xe4> 200d820: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200d824: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200d828: 03 00 80 1b sethi %hi(0x2006c00), %g1 200d82c: 82 10 60 7c or %g1, 0x7c, %g1 ! 2006c7c <_POSIX_Threads_Sporadic_budget_callout> 200d830: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200d834: 81 c7 e0 08 ret 200d838: 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; 200d83c: 82 10 20 01 mov 1, %g1 200d840: c2 26 80 00 st %g1, [ %i2 ] return 0; 200d844: 81 c7 e0 08 ret 200d848: 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; 200d84c: fa 26 80 00 st %i5, [ %i2 ] return 0; 200d850: 81 c7 e0 08 ret 200d854: 81 e8 00 00 restore =============================================================================== 0200c98c <_POSIX_Threads_Delete_extension>: */ void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200c98c: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; void **value_ptr; api = deleted->API_Extensions[ THREAD_API_POSIX ]; 200c990: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200c994: 40 00 09 9d call 200f008 <_POSIX_Threads_cancel_run> 200c998: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200c99c: 90 10 00 19 mov %i1, %o0 200c9a0: 40 00 09 b6 call 200f078 <_POSIX_Keys_Run_destructors> 200c9a4: ba 06 20 44 add %i0, 0x44, %i5 /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200c9a8: 10 80 00 03 b 200c9b4 <_POSIX_Threads_Delete_extension+0x28> 200c9ac: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200c9b0: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200c9b4: 7f ff f3 66 call 200974c <_Thread_queue_Dequeue> 200c9b8: 90 10 00 1d mov %i5, %o0 200c9bc: 80 a2 20 00 cmp %o0, 0 200c9c0: 32 bf ff fc bne,a 200c9b0 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200c9c4: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200c9c8: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200c9cc: 80 a0 60 04 cmp %g1, 4 200c9d0: 02 80 00 05 be 200c9e4 <_POSIX_Threads_Delete_extension+0x58> 200c9d4: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200c9d8: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200c9dc: 7f ff f7 1d call 200a650 <_Workspace_Free> 200c9e0: 81 e8 00 00 restore while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200c9e4: 7f ff f6 97 call 200a440 <_Watchdog_Remove> 200c9e8: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200c9ec: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200c9f0: 7f ff f7 18 call 200a650 <_Workspace_Free> 200c9f4: 81 e8 00 00 restore =============================================================================== 0200697c <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 200697c: 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; 2006980: 03 00 80 75 sethi %hi(0x201d400), %g1 2006984: 82 10 63 d4 or %g1, 0x3d4, %g1 ! 201d7d4 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2006988: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 200698c: 80 a6 e0 00 cmp %i3, 0 2006990: 02 80 00 18 be 20069f0 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2006994: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2006998: 80 a7 60 00 cmp %i5, 0 200699c: 02 80 00 15 be 20069f0 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 20069a0: 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 ); 20069a4: 40 00 1b ad call 200d858 20069a8: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 20069ac: 92 10 20 02 mov 2, %o1 20069b0: 40 00 1b b6 call 200d888 20069b4: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 20069b8: d2 07 60 04 ld [ %i5 + 4 ], %o1 20069bc: 40 00 1b c3 call 200d8c8 20069c0: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 20069c4: d4 07 40 00 ld [ %i5 ], %o2 20069c8: 90 07 bf fc add %fp, -4, %o0 20069cc: 92 07 bf bc add %fp, -68, %o1 20069d0: 7f ff fe fd call 20065c4 20069d4: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20069d8: 94 92 20 00 orcc %o0, 0, %o2 20069dc: 12 80 00 07 bne 20069f8 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 20069e0: 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++ ) { 20069e4: 80 a6 c0 1c cmp %i3, %i4 20069e8: 18 bf ff ef bgu 20069a4 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 20069ec: ba 07 60 08 add %i5, 8, %i5 20069f0: 81 c7 e0 08 ret 20069f4: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20069f8: 90 10 20 02 mov 2, %o0 20069fc: 40 00 08 50 call 2008b3c <_Internal_error_Occurred> 2006a00: 92 10 20 01 mov 1, %o1 =============================================================================== 0200cb2c <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200cb2c: 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 ]; 200cb30: 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 ); 200cb34: 40 00 04 09 call 200db58 <_Timespec_To_ticks> 200cb38: 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); 200cb3c: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200cb40: 03 00 80 73 sethi %hi(0x201cc00), %g1 200cb44: d2 08 61 9c ldub [ %g1 + 0x19c ], %o1 ! 201cd9c */ #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 ) { 200cb48: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200cb4c: 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; 200cb50: 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 ) { 200cb54: 80 a0 60 00 cmp %g1, 0 200cb58: 12 80 00 06 bne 200cb70 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200cb5c: 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 ) { 200cb60: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200cb64: 80 a0 40 09 cmp %g1, %o1 200cb68: 38 80 00 09 bgu,a 200cb8c <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200cb6c: 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 ); 200cb70: 40 00 03 fa call 200db58 <_Timespec_To_ticks> 200cb74: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cb78: 31 00 80 76 sethi %hi(0x201d800), %i0 200cb7c: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200cb80: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cb84: 7f ff f5 cd call 200a2b8 <_Watchdog_Insert> 200cb88: 91 ee 23 7c restore %i0, 0x37c, %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 ); 200cb8c: 7f ff f0 cf call 2008ec8 <_Thread_Change_priority> 200cb90: 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 ); 200cb94: 40 00 03 f1 call 200db58 <_Timespec_To_ticks> 200cb98: 90 07 60 90 add %i5, 0x90, %o0 200cb9c: 31 00 80 76 sethi %hi(0x201d800), %i0 200cba0: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200cba4: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200cba8: 7f ff f5 c4 call 200a2b8 <_Watchdog_Insert> 200cbac: 91 ee 23 7c restore %i0, 0x37c, %o0 =============================================================================== 0200cbb0 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200cbb0: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200cbb4: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200cbb8: 05 00 80 73 sethi %hi(0x201cc00), %g2 200cbbc: d2 08 a1 9c ldub [ %g2 + 0x19c ], %o1 ! 201cd9c */ #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 ) { 200cbc0: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200cbc4: 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 */ 200cbc8: 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; 200cbcc: 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 ) { 200cbd0: 80 a0 a0 00 cmp %g2, 0 200cbd4: 12 80 00 06 bne 200cbec <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200cbd8: 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 ) { 200cbdc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200cbe0: 80 a0 40 09 cmp %g1, %o1 200cbe4: 0a 80 00 04 bcs 200cbf4 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200cbe8: 94 10 20 01 mov 1, %o2 200cbec: 81 c3 e0 08 retl <== NOT EXECUTED 200cbf0: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200cbf4: 82 13 c0 00 mov %o7, %g1 200cbf8: 7f ff f0 b4 call 2008ec8 <_Thread_Change_priority> 200cbfc: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200f008 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200f008: 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 ]; 200f00c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200f010: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200f014: 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 ); 200f018: b6 07 20 e8 add %i4, 0xe8, %i3 200f01c: 80 a0 40 1b cmp %g1, %i3 200f020: 02 80 00 14 be 200f070 <_POSIX_Threads_cancel_run+0x68> 200f024: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200f028: 7f ff cc 6f call 20021e4 200f02c: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200f030: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200f034: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200f038: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200f03c: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200f040: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200f044: 7f ff cc 6c call 20021f4 200f048: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200f04c: c2 07 60 08 ld [ %i5 + 8 ], %g1 200f050: 9f c0 40 00 call %g1 200f054: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200f058: 7f ff ed 7e call 200a650 <_Workspace_Free> 200f05c: 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 ) ) { 200f060: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200f064: 80 a0 40 1b cmp %g1, %i3 200f068: 12 bf ff f0 bne 200f028 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200f06c: 01 00 00 00 nop 200f070: 81 c7 e0 08 ret 200f074: 81 e8 00 00 restore =============================================================================== 020066a4 <_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) { 20066a4: 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; 20066a8: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 20066ac: 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; 20066b0: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 20066b4: 80 a0 60 00 cmp %g1, 0 20066b8: 12 80 00 0e bne 20066f0 <_POSIX_Timer_TSR+0x4c> 20066bc: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 20066c0: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 20066c4: 80 a0 60 00 cmp %g1, 0 20066c8: 32 80 00 0b bne,a 20066f4 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 20066cc: 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; 20066d0: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 20066d4: 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 ) ) { 20066d8: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 20066dc: 40 00 1a 37 call 200cfb8 20066e0: 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; 20066e4: c0 26 60 68 clr [ %i1 + 0x68 ] 20066e8: 81 c7 e0 08 ret 20066ec: 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( 20066f0: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 20066f4: d4 06 60 08 ld [ %i1 + 8 ], %o2 20066f8: 90 06 60 10 add %i1, 0x10, %o0 20066fc: 98 10 00 19 mov %i1, %o4 2006700: 17 00 80 19 sethi %hi(0x2006400), %o3 2006704: 40 00 1b 54 call 200d454 <_POSIX_Timer_Insert_helper> 2006708: 96 12 e2 a4 or %o3, 0x2a4, %o3 ! 20066a4 <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 200670c: 80 8a 20 ff btst 0xff, %o0 2006710: 02 bf ff f6 be 20066e8 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 2006714: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 2006718: 40 00 05 e7 call 2007eb4 <_TOD_Get> 200671c: 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; 2006720: 82 10 20 03 mov 3, %g1 2006724: 10 bf ff ed b 20066d8 <_POSIX_Timer_TSR+0x34> 2006728: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200f130 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200f130: 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, 200f134: 98 10 20 01 mov 1, %o4 200f138: 90 10 00 18 mov %i0, %o0 200f13c: 92 10 00 19 mov %i1, %o1 200f140: 94 07 bf f4 add %fp, -12, %o2 200f144: 40 00 00 2e call 200f1fc <_POSIX_signals_Clear_signals> 200f148: 96 10 00 1a mov %i2, %o3 200f14c: 80 8a 20 ff btst 0xff, %o0 200f150: 02 80 00 23 be 200f1dc <_POSIX_signals_Check_signal+0xac> 200f154: 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 ) 200f158: 85 2e 60 02 sll %i1, 2, %g2 200f15c: 37 00 80 78 sethi %hi(0x201e000), %i3 200f160: b9 2e 60 04 sll %i1, 4, %i4 200f164: b6 16 e0 50 or %i3, 0x50, %i3 200f168: b8 27 00 02 sub %i4, %g2, %i4 200f16c: 84 06 c0 1c add %i3, %i4, %g2 200f170: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200f174: 80 a7 60 01 cmp %i5, 1 200f178: 02 80 00 19 be 200f1dc <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200f17c: 21 00 80 77 sethi %hi(0x201dc00), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200f180: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200f184: 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, 200f188: a0 14 23 f8 or %l0, 0x3f8, %l0 200f18c: 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; 200f190: 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, 200f194: 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; 200f198: 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, 200f19c: 92 02 60 20 add %o1, 0x20, %o1 200f1a0: 40 00 04 98 call 2010400 200f1a4: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200f1a8: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200f1ac: 80 a0 60 02 cmp %g1, 2 200f1b0: 02 80 00 0e be 200f1e8 <_POSIX_signals_Check_signal+0xb8> 200f1b4: 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 ); 200f1b8: 9f c7 40 00 call %i5 200f1bc: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200f1c0: d0 04 20 0c ld [ %l0 + 0xc ], %o0 200f1c4: 92 07 bf cc add %fp, -52, %o1 200f1c8: 90 02 20 20 add %o0, 0x20, %o0 200f1cc: 40 00 04 8d call 2010400 200f1d0: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200f1d4: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200f1d8: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200f1dc: b0 08 60 01 and %g1, 1, %i0 200f1e0: 81 c7 e0 08 ret 200f1e4: 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)( 200f1e8: 92 07 bf f4 add %fp, -12, %o1 200f1ec: 9f c7 40 00 call %i5 200f1f0: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200f1f4: 10 bf ff f4 b 200f1c4 <_POSIX_signals_Check_signal+0x94> 200f1f8: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 0200f9e4 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200f9e4: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200f9e8: 7f ff c9 ff call 20021e4 200f9ec: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200f9f0: 85 2e 20 04 sll %i0, 4, %g2 200f9f4: 83 2e 20 02 sll %i0, 2, %g1 200f9f8: 82 20 80 01 sub %g2, %g1, %g1 200f9fc: 05 00 80 78 sethi %hi(0x201e000), %g2 200fa00: 84 10 a0 50 or %g2, 0x50, %g2 ! 201e050 <_POSIX_signals_Vectors> 200fa04: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200fa08: 80 a0 a0 02 cmp %g2, 2 200fa0c: 02 80 00 0b be 200fa38 <_POSIX_signals_Clear_process_signals+0x54> 200fa10: 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; 200fa14: 03 00 80 78 sethi %hi(0x201e000), %g1 200fa18: c4 00 62 44 ld [ %g1 + 0x244 ], %g2 ! 201e244 <_POSIX_signals_Pending> 200fa1c: 86 10 20 01 mov 1, %g3 200fa20: b0 06 3f ff add %i0, -1, %i0 200fa24: b1 28 c0 18 sll %g3, %i0, %i0 200fa28: b0 28 80 18 andn %g2, %i0, %i0 200fa2c: f0 20 62 44 st %i0, [ %g1 + 0x244 ] } _ISR_Enable( level ); 200fa30: 7f ff c9 f1 call 20021f4 200fa34: 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 ] ) ) 200fa38: 84 10 a2 48 or %g2, 0x248, %g2 200fa3c: c6 00 40 02 ld [ %g1 + %g2 ], %g3 200fa40: 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 ); 200fa44: 82 00 60 04 add %g1, 4, %g1 200fa48: 80 a0 c0 01 cmp %g3, %g1 200fa4c: 02 bf ff f3 be 200fa18 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN 200fa50: 03 00 80 78 sethi %hi(0x201e000), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 200fa54: 7f ff c9 e8 call 20021f4 <== NOT EXECUTED 200fa58: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 020071a8 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20071a8: 82 10 20 1b mov 0x1b, %g1 20071ac: 86 10 20 01 mov 1, %g3 #include #include #include #include int _POSIX_signals_Get_lowest( 20071b0: 84 00 7f ff add %g1, -1, %g2 20071b4: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20071b8: 80 88 80 08 btst %g2, %o0 20071bc: 12 80 00 11 bne 2007200 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20071c0: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20071c4: 82 00 60 01 inc %g1 20071c8: 80 a0 60 20 cmp %g1, 0x20 20071cc: 12 bf ff fa bne 20071b4 <_POSIX_signals_Get_lowest+0xc> 20071d0: 84 00 7f ff add %g1, -1, %g2 20071d4: 82 10 20 01 mov 1, %g1 20071d8: 10 80 00 05 b 20071ec <_POSIX_signals_Get_lowest+0x44> 20071dc: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 20071e0: 80 a0 60 1b cmp %g1, 0x1b 20071e4: 02 80 00 07 be 2007200 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20071e8: 01 00 00 00 nop #include #include #include #include int _POSIX_signals_Get_lowest( 20071ec: 84 00 7f ff add %g1, -1, %g2 20071f0: 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 ) ) { 20071f4: 80 88 80 08 btst %g2, %o0 20071f8: 22 bf ff fa be,a 20071e0 <_POSIX_signals_Get_lowest+0x38> 20071fc: 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; } 2007200: 81 c3 e0 08 retl 2007204: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200c6dc <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200c6dc: 9d e3 bf a0 save %sp, -96, %sp /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200c6e0: 35 00 80 77 sethi %hi(0x201dc00), %i2 POSIX_API_Control *api; int signo; ISR_Level level; int hold_errno; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200c6e4: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200c6e8: b4 16 a3 f8 or %i2, 0x3f8, %i2 200c6ec: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200c6f0: 80 a7 20 00 cmp %i4, 0 200c6f4: 02 80 00 34 be 200c7c4 <_POSIX_signals_Post_switch_extension+0xe8> 200c6f8: f2 00 60 34 ld [ %g1 + 0x34 ], %i1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200c6fc: 7f ff d6 ba call 20021e4 200c700: 37 00 80 78 sethi %hi(0x201e000), %i3 200c704: b6 16 e2 44 or %i3, 0x244, %i3 ! 201e244 <_POSIX_signals_Pending> if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200c708: c6 06 c0 00 ld [ %i3 ], %g3 200c70c: 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 & 200c710: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200c714: 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 & 200c718: 80 a8 40 02 andncc %g1, %g2, %g0 200c71c: 02 80 00 26 be 200c7b4 <_POSIX_signals_Post_switch_extension+0xd8> 200c720: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200c724: 7f ff d6 b4 call 20021f4 200c728: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200c72c: 92 10 00 1d mov %i5, %o1 200c730: 94 10 20 00 clr %o2 200c734: 40 00 0a 7f call 200f130 <_POSIX_signals_Check_signal> 200c738: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200c73c: 92 10 00 1d mov %i5, %o1 200c740: 90 10 00 1c mov %i4, %o0 200c744: 40 00 0a 7b call 200f130 <_POSIX_signals_Check_signal> 200c748: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200c74c: ba 07 60 01 inc %i5 200c750: 80 a7 60 20 cmp %i5, 0x20 200c754: 12 bf ff f7 bne 200c730 <_POSIX_signals_Post_switch_extension+0x54> 200c758: 92 10 00 1d mov %i5, %o1 200c75c: 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 ); 200c760: 92 10 00 1d mov %i5, %o1 200c764: 94 10 20 00 clr %o2 200c768: 40 00 0a 72 call 200f130 <_POSIX_signals_Check_signal> 200c76c: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200c770: 92 10 00 1d mov %i5, %o1 200c774: 90 10 00 1c mov %i4, %o0 200c778: 40 00 0a 6e call 200f130 <_POSIX_signals_Check_signal> 200c77c: 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++ ) { 200c780: ba 07 60 01 inc %i5 200c784: 80 a7 60 1b cmp %i5, 0x1b 200c788: 12 bf ff f7 bne 200c764 <_POSIX_signals_Post_switch_extension+0x88> 200c78c: 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 ); 200c790: 7f ff d6 95 call 20021e4 200c794: 01 00 00 00 nop if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200c798: c6 06 c0 00 ld [ %i3 ], %g3 200c79c: 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 & 200c7a0: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200c7a4: 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 & 200c7a8: 80 a8 40 02 andncc %g1, %g2, %g0 200c7ac: 12 bf ff de bne 200c724 <_POSIX_signals_Post_switch_extension+0x48><== NEVER TAKEN 200c7b0: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200c7b4: 7f ff d6 90 call 20021f4 200c7b8: 01 00 00 00 nop _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } } _Thread_Executing->Wait.return_code = hold_errno; 200c7bc: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 200c7c0: f2 20 60 34 st %i1, [ %g1 + 0x34 ] 200c7c4: 81 c7 e0 08 ret 200c7c8: 81 e8 00 00 restore =============================================================================== 0201a7e8 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201a7e8: 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 ) ) { 201a7ec: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201a7f0: 05 04 00 20 sethi %hi(0x10008000), %g2 201a7f4: 86 10 20 01 mov 1, %g3 201a7f8: ba 06 7f ff add %i1, -1, %i5 201a7fc: 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 ]; 201a800: 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 ) ) { 201a804: 80 a1 00 02 cmp %g4, %g2 201a808: 02 80 00 1c be 201a878 <_POSIX_signals_Unblock_thread+0x90> 201a80c: 9f 28 c0 1d sll %g3, %i5, %o7 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201a810: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2 201a814: 80 ab c0 02 andncc %o7, %g2, %g0 201a818: 02 80 00 15 be 201a86c <_POSIX_signals_Unblock_thread+0x84> 201a81c: ba 10 20 00 clr %i5 201a820: 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 ) ) { 201a824: 80 88 40 02 btst %g1, %g2 201a828: 02 80 00 29 be 201a8cc <_POSIX_signals_Unblock_thread+0xe4> 201a82c: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201a830: 84 10 20 04 mov 4, %g2 201a834: 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); 201a838: 05 00 00 ef sethi %hi(0x3bc00), %g2 201a83c: 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) ) 201a840: 80 88 40 02 btst %g1, %g2 201a844: 12 80 00 36 bne 201a91c <_POSIX_signals_Unblock_thread+0x134> 201a848: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201a84c: 22 80 00 09 be,a 201a870 <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN 201a850: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201a854: 7f ff be fb call 200a440 <_Watchdog_Remove> 201a858: 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 ); 201a85c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 201a860: 90 10 00 18 mov %i0, %o0 201a864: 7f ff b9 e4 call 2008ff4 <_Thread_Clear_state> 201a868: 92 12 63 f8 or %o1, 0x3f8, %o1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201a86c: b0 0f 60 01 and %i5, 1, %i0 201a870: 81 c7 e0 08 ret 201a874: 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) ) { 201a878: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201a87c: 80 8b c0 01 btst %o7, %g1 201a880: 22 80 00 21 be,a 201a904 <_POSIX_signals_Unblock_thread+0x11c> 201a884: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201a888: 82 10 20 04 mov 4, %g1 201a88c: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201a890: 80 a6 a0 00 cmp %i2, 0 201a894: 02 80 00 27 be 201a930 <_POSIX_signals_Unblock_thread+0x148> 201a898: 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; 201a89c: c4 06 80 00 ld [ %i2 ], %g2 201a8a0: c4 20 40 00 st %g2, [ %g1 ] 201a8a4: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201a8a8: c4 20 60 04 st %g2, [ %g1 + 4 ] 201a8ac: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201a8b0: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201a8b4: 90 10 00 18 mov %i0, %o0 201a8b8: 7f ff bc b5 call 2009b8c <_Thread_queue_Extract_with_proxy> 201a8bc: ba 10 20 01 mov 1, %i5 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201a8c0: b0 0f 60 01 and %i5, 1, %i0 201a8c4: 81 c7 e0 08 ret 201a8c8: 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 ) { 201a8cc: 12 bf ff e8 bne 201a86c <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN 201a8d0: 03 00 80 77 sethi %hi(0x201dc00), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a8d4: 82 10 63 f8 or %g1, 0x3f8, %g1 ! 201dff8 <_Per_CPU_Information> 201a8d8: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a8dc: 80 a0 a0 00 cmp %g2, 0 201a8e0: 22 bf ff e4 be,a 201a870 <_POSIX_signals_Unblock_thread+0x88> 201a8e4: b0 0f 60 01 and %i5, 1, %i0 201a8e8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a8ec: 80 a6 00 02 cmp %i0, %g2 201a8f0: 22 bf ff df be,a 201a86c <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN 201a8f4: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] 201a8f8: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 201a8fc: 81 c7 e0 08 ret <== NOT EXECUTED 201a900: 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) ) { 201a904: 80 ab c0 01 andncc %o7, %g1, %g0 201a908: 12 bf ff e0 bne 201a888 <_POSIX_signals_Unblock_thread+0xa0> 201a90c: ba 10 20 00 clr %i5 201a910: b0 0f 60 01 and %i5, 1, %i0 201a914: 81 c7 e0 08 ret 201a918: 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 ); 201a91c: 7f ff bc 9c call 2009b8c <_Thread_queue_Extract_with_proxy> 201a920: 90 10 00 18 mov %i0, %o0 201a924: b0 0f 60 01 and %i5, 1, %i0 201a928: 81 c7 e0 08 ret 201a92c: 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; 201a930: 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; 201a934: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201a938: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201a93c: 10 bf ff de b 201a8b4 <_POSIX_signals_Unblock_thread+0xcc> 201a940: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 02009400 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2009400: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 2009404: 80 a6 60 00 cmp %i1, 0 2009408: 02 80 00 4c be 2009538 <_RBTree_Extract_unprotected+0x138> 200940c: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2009410: c2 06 20 08 ld [ %i0 + 8 ], %g1 2009414: 80 a0 40 19 cmp %g1, %i1 2009418: 22 80 00 59 be,a 200957c <_RBTree_Extract_unprotected+0x17c> 200941c: 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]) { 2009420: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009424: 80 a0 40 19 cmp %g1, %i1 2009428: 22 80 00 46 be,a 2009540 <_RBTree_Extract_unprotected+0x140> 200942c: c2 06 60 04 ld [ %i1 + 4 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2009430: fa 06 60 04 ld [ %i1 + 4 ], %i5 2009434: 80 a7 60 00 cmp %i5, 0 2009438: 22 80 00 4a be,a 2009560 <_RBTree_Extract_unprotected+0x160> 200943c: f8 06 60 08 ld [ %i1 + 8 ], %i4 2009440: c2 06 60 08 ld [ %i1 + 8 ], %g1 2009444: 80 a0 60 00 cmp %g1, 0 2009448: 32 80 00 05 bne,a 200945c <_RBTree_Extract_unprotected+0x5c> 200944c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2009450: 10 80 00 50 b 2009590 <_RBTree_Extract_unprotected+0x190> 2009454: b8 10 00 1d mov %i5, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 2009458: c2 07 60 08 ld [ %i5 + 8 ], %g1 200945c: 80 a0 60 00 cmp %g1, 0 2009460: 32 bf ff fe bne,a 2009458 <_RBTree_Extract_unprotected+0x58> 2009464: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 2009468: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200946c: 80 a7 20 00 cmp %i4, 0 2009470: 02 80 00 54 be 20095c0 <_RBTree_Extract_unprotected+0x1c0> 2009474: 01 00 00 00 nop leaf->parent = target->parent; 2009478: c2 07 40 00 ld [ %i5 ], %g1 200947c: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2009480: c4 07 40 00 ld [ %i5 ], %g2 target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2009484: c2 06 40 00 ld [ %i1 ], %g1 } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2009488: c8 00 a0 04 ld [ %g2 + 4 ], %g4 leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 200948c: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 2009490: 88 19 00 1d xor %g4, %i5, %g4 2009494: 80 a0 00 04 cmp %g0, %g4 2009498: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200949c: 89 29 20 02 sll %g4, 2, %g4 20094a0: 84 00 80 04 add %g2, %g4, %g2 20094a4: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 20094a8: c4 00 60 04 ld [ %g1 + 4 ], %g2 20094ac: 84 18 80 19 xor %g2, %i1, %g2 20094b0: 80 a0 00 02 cmp %g0, %g2 20094b4: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 20094b8: 85 28 a0 02 sll %g2, 2, %g2 20094bc: 82 00 40 02 add %g1, %g2, %g1 20094c0: fa 20 60 04 st %i5, [ %g1 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 20094c4: c2 06 60 08 ld [ %i1 + 8 ], %g1 20094c8: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 20094cc: c2 06 60 08 ld [ %i1 + 8 ], %g1 20094d0: 80 a0 60 00 cmp %g1, 0 20094d4: 32 80 00 02 bne,a 20094dc <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 20094d8: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 20094dc: c2 06 60 04 ld [ %i1 + 4 ], %g1 20094e0: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 20094e4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20094e8: 80 a0 60 00 cmp %g1, 0 20094ec: 32 80 00 02 bne,a 20094f4 <_RBTree_Extract_unprotected+0xf4> 20094f0: fa 20 40 00 st %i5, [ %g1 ] /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 20094f4: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 20094f8: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 20094fc: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 2009500: c2 27 60 0c st %g1, [ %i5 + 0xc ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 2009504: 80 a0 e0 00 cmp %g3, 0 2009508: 32 80 00 06 bne,a 2009520 <_RBTree_Extract_unprotected+0x120> 200950c: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 2009510: 80 a7 20 00 cmp %i4, 0 2009514: 32 80 00 02 bne,a 200951c <_RBTree_Extract_unprotected+0x11c> 2009518: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 200951c: 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; 2009520: c0 26 60 08 clr [ %i1 + 8 ] 2009524: c0 26 60 04 clr [ %i1 + 4 ] 2009528: 80 a0 60 00 cmp %g1, 0 200952c: 02 80 00 03 be 2009538 <_RBTree_Extract_unprotected+0x138> 2009530: c0 26 40 00 clr [ %i1 ] 2009534: c0 20 60 0c clr [ %g1 + 0xc ] 2009538: 81 c7 e0 08 ret 200953c: 81 e8 00 00 restore the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 2009540: 80 a0 60 00 cmp %g1, 0 2009544: 22 80 00 28 be,a 20095e4 <_RBTree_Extract_unprotected+0x1e4> 2009548: c2 06 40 00 ld [ %i1 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200954c: fa 06 60 04 ld [ %i1 + 4 ], %i5 2009550: 80 a7 60 00 cmp %i5, 0 2009554: 12 bf ff bb bne 2009440 <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN 2009558: c2 26 20 0c st %g1, [ %i0 + 0xc ] * the_node's location in the tree. This may cause the coloring to be * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; 200955c: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED if( leaf ) { 2009560: 80 a7 20 00 cmp %i4, 0 2009564: 32 80 00 0c bne,a 2009594 <_RBTree_Extract_unprotected+0x194> 2009568: 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); 200956c: 7f ff fe e0 call 20090ec <_RBTree_Extract_validate_unprotected> 2009570: 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]; 2009574: 10 80 00 0a b 200959c <_RBTree_Extract_unprotected+0x19c> 2009578: 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]) 200957c: 80 a0 60 00 cmp %g1, 0 2009580: 22 80 00 14 be,a 20095d0 <_RBTree_Extract_unprotected+0x1d0> 2009584: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2009588: 10 bf ff a6 b 2009420 <_RBTree_Extract_unprotected+0x20> 200958c: c2 26 20 08 st %g1, [ %i0 + 8 ] * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 2009590: c2 06 40 00 ld [ %i1 ], %g1 2009594: 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]; 2009598: 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; 200959c: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 20095a0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20095a4: 84 18 80 19 xor %g2, %i1, %g2 20095a8: 80 a0 00 02 cmp %g0, %g2 20095ac: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 20095b0: 85 28 a0 02 sll %g2, 2, %g2 20095b4: 82 00 40 02 add %g1, %g2, %g1 20095b8: 10 bf ff d3 b 2009504 <_RBTree_Extract_unprotected+0x104> 20095bc: f8 20 60 04 st %i4, [ %g1 + 4 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 20095c0: 7f ff fe cb call 20090ec <_RBTree_Extract_validate_unprotected> 20095c4: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 20095c8: 10 bf ff af b 2009484 <_RBTree_Extract_unprotected+0x84> 20095cc: c4 07 40 00 ld [ %i5 ], %g2 if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 20095d0: 80 a6 00 01 cmp %i0, %g1 20095d4: 12 bf ff 93 bne 2009420 <_RBTree_Extract_unprotected+0x20> 20095d8: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 20095dc: 10 bf ff 91 b 2009420 <_RBTree_Extract_unprotected+0x20> 20095e0: c0 26 20 08 clr [ %i0 + 8 ] if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 20095e4: 80 a6 00 01 cmp %i0, %g1 20095e8: 12 bf ff 92 bne 2009430 <_RBTree_Extract_unprotected+0x30> 20095ec: c2 26 20 0c st %g1, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 20095f0: 10 bf ff 90 b 2009430 <_RBTree_Extract_unprotected+0x30> 20095f4: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 020090ec <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 20090ec: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 20090f0: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; 20090f4: c4 00 40 00 ld [ %g1 ], %g2 20090f8: 80 a0 a0 00 cmp %g2, 0 20090fc: 02 80 00 bf be 20093f8 <_RBTree_Extract_validate_unprotected+0x30c> 2009100: 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]) 2009104: c4 00 60 04 ld [ %g1 + 4 ], %g2 2009108: 80 a6 00 02 cmp %i0, %g2 200910c: 22 80 00 02 be,a 2009114 <_RBTree_Extract_validate_unprotected+0x28> 2009110: c4 00 60 08 ld [ %g1 + 8 ], %g2 } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2009114: 98 10 20 01 mov 1, %o4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009118: c6 06 20 0c ld [ %i0 + 0xc ], %g3 200911c: 80 a0 e0 01 cmp %g3, 1 2009120: 22 80 00 58 be,a 2009280 <_RBTree_Extract_validate_unprotected+0x194> 2009124: 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) { 2009128: c6 00 40 00 ld [ %g1 ], %g3 200912c: 80 a0 e0 00 cmp %g3, 0 2009130: 02 80 00 53 be 200927c <_RBTree_Extract_validate_unprotected+0x190> 2009134: 80 a0 a0 00 cmp %g2, 0 2009138: 22 80 00 07 be,a 2009154 <_RBTree_Extract_validate_unprotected+0x68><== NEVER TAKEN 200913c: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 2009140: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 2009144: 80 a1 20 01 cmp %g4, 1 2009148: 22 80 00 28 be,a 20091e8 <_RBTree_Extract_validate_unprotected+0xfc> 200914c: de 00 60 04 ld [ %g1 + 4 ], %o7 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2009150: c6 00 a0 08 ld [ %g2 + 8 ], %g3 2009154: 80 a0 e0 00 cmp %g3, 0 2009158: 22 80 00 07 be,a 2009174 <_RBTree_Extract_validate_unprotected+0x88> 200915c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2009160: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 2009164: 80 a0 e0 01 cmp %g3, 1 2009168: 22 80 00 4c be,a 2009298 <_RBTree_Extract_validate_unprotected+0x1ac> 200916c: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2009170: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2009174: 80 a0 e0 00 cmp %g3, 0 2009178: 22 80 00 07 be,a 2009194 <_RBTree_Extract_validate_unprotected+0xa8> 200917c: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 2009180: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 2009184: 80 a0 e0 01 cmp %g3, 1 2009188: 22 80 00 44 be,a 2009298 <_RBTree_Extract_validate_unprotected+0x1ac> 200918c: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 2009190: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 2009194: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2009198: 80 a0 a0 01 cmp %g2, 1 200919c: 22 80 00 38 be,a 200927c <_RBTree_Extract_validate_unprotected+0x190> 20091a0: c0 20 60 0c clr [ %g1 + 0xc ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 20091a4: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 20091a8: 80 a0 e0 00 cmp %g3, 0 20091ac: 02 80 00 0a be 20091d4 <_RBTree_Extract_validate_unprotected+0xe8><== NEVER TAKEN 20091b0: 84 10 20 00 clr %g2 if(!(the_node->parent->parent)) return NULL; 20091b4: c8 00 c0 00 ld [ %g3 ], %g4 20091b8: 80 a1 20 00 cmp %g4, 0 20091bc: 02 80 00 07 be 20091d8 <_RBTree_Extract_validate_unprotected+0xec> 20091c0: b0 10 00 01 mov %g1, %i0 if(the_node == the_node->parent->child[RBT_LEFT]) 20091c4: c4 00 e0 04 ld [ %g3 + 4 ], %g2 20091c8: 80 a0 40 02 cmp %g1, %g2 20091cc: 22 80 00 05 be,a 20091e0 <_RBTree_Extract_validate_unprotected+0xf4> 20091d0: c4 00 e0 08 ld [ %g3 + 8 ], %g2 c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; the_node->parent = c; 20091d4: b0 10 00 01 mov %g1, %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 20091d8: 10 bf ff d0 b 2009118 <_RBTree_Extract_validate_unprotected+0x2c> 20091dc: 82 10 00 03 mov %g3, %g1 20091e0: 10 bf ff ce b 2009118 <_RBTree_Extract_validate_unprotected+0x2c> 20091e4: 82 10 00 03 mov %g3, %g1 * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 20091e8: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 20091ec: 9e 1b c0 18 xor %o7, %i0, %o7 20091f0: 80 a0 00 0f cmp %g0, %o7 20091f4: 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; 20091f8: 88 21 00 0d sub %g4, %o5, %g4 20091fc: 89 29 20 02 sll %g4, 2, %g4 2009200: 88 00 40 04 add %g1, %g4, %g4 2009204: de 01 20 04 ld [ %g4 + 4 ], %o7 2009208: 80 a3 e0 00 cmp %o7, 0 200920c: 02 80 00 16 be 2009264 <_RBTree_Extract_validate_unprotected+0x178><== NEVER TAKEN 2009210: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009214: 85 2b 60 02 sll %o5, 2, %g2 2009218: 96 03 c0 02 add %o7, %g2, %o3 200921c: d4 02 e0 04 ld [ %o3 + 4 ], %o2 2009220: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 2009224: c8 02 e0 04 ld [ %o3 + 4 ], %g4 2009228: 80 a1 20 00 cmp %g4, 0 200922c: 02 80 00 04 be 200923c <_RBTree_Extract_validate_unprotected+0x150><== NEVER TAKEN 2009230: 84 03 c0 02 add %o7, %g2, %g2 c->child[dir]->parent = the_node; 2009234: c2 21 00 00 st %g1, [ %g4 ] 2009238: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200923c: c2 20 a0 04 st %g1, [ %g2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009240: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 2009244: 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; 2009248: 84 18 40 02 xor %g1, %g2, %g2 c->parent = the_node->parent; the_node->parent = c; 200924c: 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; 2009250: 80 a0 00 02 cmp %g0, %g2 2009254: 84 40 20 00 addx %g0, 0, %g2 2009258: 85 28 a0 02 sll %g2, 2, %g2 200925c: 86 00 c0 02 add %g3, %g2, %g3 2009260: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 2009264: 80 a0 00 0d cmp %g0, %o5 2009268: 84 60 3f ff subx %g0, -1, %g2 200926c: 85 28 a0 02 sll %g2, 2, %g2 2009270: 84 00 40 02 add %g1, %g2, %g2 2009274: 10 bf ff b7 b 2009150 <_RBTree_Extract_validate_unprotected+0x64> 2009278: c4 00 a0 04 ld [ %g2 + 4 ], %g2 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200927c: c2 06 00 00 ld [ %i0 ], %g1 2009280: c2 00 40 00 ld [ %g1 ], %g1 2009284: 80 a0 60 00 cmp %g1, 0 2009288: 22 80 00 02 be,a 2009290 <_RBTree_Extract_validate_unprotected+0x1a4> 200928c: c0 26 20 0c clr [ %i0 + 0xc ] 2009290: 81 c7 e0 08 ret 2009294: 81 e8 00 00 restore * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 2009298: 86 18 c0 18 xor %g3, %i0, %g3 200929c: 80 a0 00 03 cmp %g0, %g3 20092a0: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 20092a4: 80 a0 00 03 cmp %g0, %g3 20092a8: 9e 60 3f ff subx %g0, -1, %o7 20092ac: 9f 2b e0 02 sll %o7, 2, %o7 20092b0: 88 00 80 0f add %g2, %o7, %g4 20092b4: 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); 20092b8: 80 a1 20 00 cmp %g4, 0 20092bc: 22 80 00 07 be,a 20092d8 <_RBTree_Extract_validate_unprotected+0x1ec> 20092c0: 89 28 e0 02 sll %g3, 2, %g4 20092c4: da 01 20 0c ld [ %g4 + 0xc ], %o5 20092c8: 80 a3 60 01 cmp %o5, 1 20092cc: 22 80 00 28 be,a 200936c <_RBTree_Extract_validate_unprotected+0x280> 20092d0: de 00 60 0c ld [ %g1 + 0xc ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 20092d4: 89 28 e0 02 sll %g3, 2, %g4 20092d8: 88 00 80 04 add %g2, %g4, %g4 20092dc: 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; 20092e0: 88 10 20 01 mov 1, %g4 sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); 20092e4: 98 18 e0 01 xor %g3, 1, %o4 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 20092e8: c8 20 a0 0c st %g4, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 20092ec: 9a 21 00 0c sub %g4, %o4, %o5 20092f0: 9b 2b 60 02 sll %o5, 2, %o5 20092f4: 9a 00 80 0d add %g2, %o5, %o5 20092f8: c8 03 60 04 ld [ %o5 + 4 ], %g4 20092fc: 80 a1 20 00 cmp %g4, 0 2009300: 02 80 00 16 be 2009358 <_RBTree_Extract_validate_unprotected+0x26c><== NEVER TAKEN 2009304: c0 22 e0 0c clr [ %o3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009308: 99 2b 20 02 sll %o4, 2, %o4 200930c: 96 01 00 0c add %g4, %o4, %o3 2009310: d4 02 e0 04 ld [ %o3 + 4 ], %o2 2009314: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 2009318: da 02 e0 04 ld [ %o3 + 4 ], %o5 200931c: 80 a3 60 00 cmp %o5, 0 2009320: 32 80 00 02 bne,a 2009328 <_RBTree_Extract_validate_unprotected+0x23c> 2009324: c4 23 40 00 st %g2, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009328: da 00 80 00 ld [ %g2 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200932c: 98 01 00 0c add %g4, %o4, %o4 2009330: c4 23 20 04 st %g2, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009334: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 2009338: 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; 200933c: 98 18 80 0c xor %g2, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 2009340: c8 20 80 00 st %g4, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009344: 80 a0 00 0c cmp %g0, %o4 2009348: 84 40 20 00 addx %g0, 0, %g2 200934c: 85 28 a0 02 sll %g2, 2, %g2 2009350: 9a 03 40 02 add %o5, %g2, %o5 2009354: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 2009358: 84 00 40 0f add %g1, %o7, %g2 200935c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2009360: 9e 00 80 0f add %g2, %o7, %o7 2009364: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 2009368: de 00 60 0c ld [ %g1 + 0xc ], %o7 200936c: de 20 a0 0c st %o7, [ %g2 + 0xc ] parent->color = RBT_BLACK; 2009370: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2009374: 9e 10 20 01 mov 1, %o7 2009378: 9e 23 c0 03 sub %o7, %g3, %o7 200937c: 9f 2b e0 02 sll %o7, 2, %o7 2009380: 9e 00 40 0f add %g1, %o7, %o7 2009384: c4 03 e0 04 ld [ %o7 + 4 ], %g2 2009388: 80 a0 a0 00 cmp %g2, 0 200938c: 02 bf ff bc be 200927c <_RBTree_Extract_validate_unprotected+0x190><== NEVER TAKEN 2009390: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009394: 87 28 e0 02 sll %g3, 2, %g3 2009398: 88 00 80 03 add %g2, %g3, %g4 200939c: da 01 20 04 ld [ %g4 + 4 ], %o5 20093a0: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 20093a4: c8 01 20 04 ld [ %g4 + 4 ], %g4 20093a8: 80 a1 20 00 cmp %g4, 0 20093ac: 32 80 00 02 bne,a 20093b4 <_RBTree_Extract_validate_unprotected+0x2c8> 20093b0: c2 21 00 00 st %g1, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20093b4: c8 00 40 00 ld [ %g1 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 20093b8: 86 00 80 03 add %g2, %g3, %g3 20093bc: c2 20 e0 04 st %g1, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20093c0: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 20093c4: c8 20 80 00 st %g4, [ %g2 ] the_node->parent = c; 20093c8: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20093cc: 86 18 40 03 xor %g1, %g3, %g3 20093d0: 80 a0 00 03 cmp %g0, %g3 20093d4: 82 40 20 00 addx %g0, 0, %g1 20093d8: 83 28 60 02 sll %g1, 2, %g1 20093dc: 88 01 00 01 add %g4, %g1, %g4 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 20093e0: c2 06 00 00 ld [ %i0 ], %g1 20093e4: c4 21 20 04 st %g2, [ %g4 + 4 ] 20093e8: c2 00 40 00 ld [ %g1 ], %g1 20093ec: 80 a0 60 00 cmp %g1, 0 20093f0: 22 bf ff a8 be,a 2009290 <_RBTree_Extract_validate_unprotected+0x1a4><== NEVER TAKEN 20093f4: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 20093f8: 81 c7 e0 08 ret 20093fc: 81 e8 00 00 restore =============================================================================== 0200966c <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200966c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 2009670: 7f ff e6 5e call 2002fe8 2009674: b8 10 00 18 mov %i0, %i4 2009678: ba 10 00 08 mov %o0, %i5 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); return return_node; } 200967c: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; int compare_result; while (iter_node) { 2009680: 80 a6 20 00 cmp %i0, 0 2009684: 32 80 00 0c bne,a 20096b4 <_RBTree_Find+0x48> <== ALWAYS TAKEN 2009688: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200968c: 30 80 00 10 b,a 20096cc <_RBTree_Find+0x60> <== NOT EXECUTED compare_result = the_rbtree->compare_function(the_node, iter_node); if (compare_result == 0) { return(iter_node); } RBTree_Direction dir = (compare_result != -1); 2009690: 80 a0 00 01 cmp %g0, %g1 2009694: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 2009698: 83 28 60 02 sll %g1, 2, %g1 200969c: b0 06 00 01 add %i0, %g1, %i0 20096a0: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; int compare_result; while (iter_node) { 20096a4: 80 a6 20 00 cmp %i0, 0 20096a8: 02 80 00 09 be 20096cc <_RBTree_Find+0x60> <== NEVER TAKEN 20096ac: 01 00 00 00 nop compare_result = the_rbtree->compare_function(the_node, iter_node); 20096b0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 20096b4: 92 10 00 18 mov %i0, %o1 20096b8: 9f c0 40 00 call %g1 20096bc: 90 10 00 19 mov %i1, %o0 if (compare_result == 0) { 20096c0: 80 a2 20 00 cmp %o0, 0 20096c4: 12 bf ff f3 bne 2009690 <_RBTree_Find+0x24> 20096c8: 82 38 00 08 xnor %g0, %o0, %g1 RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 20096cc: 7f ff e6 4b call 2002ff8 20096d0: 90 10 00 1d mov %i5, %o0 return return_node; } 20096d4: 81 c7 e0 08 ret 20096d8: 81 e8 00 00 restore =============================================================================== 020099c0 <_RBTree_Initialize>: void *compare_function, void *starting_address, size_t number_nodes, size_t node_size ) { 20099c0: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 20099c4: 80 a6 20 00 cmp %i0, 0 20099c8: 02 80 00 0e be 2009a00 <_RBTree_Initialize+0x40> <== NEVER TAKEN 20099cc: 80 a6 e0 00 cmp %i3, 0 RTEMS_INLINE_ROUTINE void _RBTree_Initialize_empty( RBTree_Control *the_rbtree, void *compare_function ) { the_rbtree->permanent_null = NULL; 20099d0: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 20099d4: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 20099d8: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 20099dc: c0 26 20 0c clr [ %i0 + 0xc ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function); count = number_nodes; next = starting_address; while ( count-- ) { 20099e0: 02 80 00 08 be 2009a00 <_RBTree_Initialize+0x40> <== NEVER TAKEN 20099e4: f2 26 20 10 st %i1, [ %i0 + 0x10 ] _RBTree_Insert(the_rbtree, next); 20099e8: 92 10 00 1a mov %i2, %o1 20099ec: 7f ff ff eb call 2009998 <_RBTree_Insert> 20099f0: 90 10 00 18 mov %i0, %o0 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function); count = number_nodes; next = starting_address; while ( count-- ) { 20099f4: b6 86 ff ff addcc %i3, -1, %i3 20099f8: 12 bf ff fc bne 20099e8 <_RBTree_Initialize+0x28> 20099fc: b4 06 80 1c add %i2, %i4, %i2 2009a00: 81 c7 e0 08 ret 2009a04: 81 e8 00 00 restore =============================================================================== 02009718 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2009718: 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) { 200971c: 96 10 20 01 mov 1, %o3 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009720: 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; 2009724: c4 00 40 00 ld [ %g1 ], %g2 2009728: 86 90 a0 00 orcc %g2, 0, %g3 200972c: 22 80 00 06 be,a 2009744 <_RBTree_Validate_insert_unprotected+0x2c> 2009730: c0 26 20 0c clr [ %i0 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009734: c8 00 60 0c ld [ %g1 + 0xc ], %g4 2009738: 80 a1 20 01 cmp %g4, 1 200973c: 22 80 00 04 be,a 200974c <_RBTree_Validate_insert_unprotected+0x34> 2009740: c8 00 80 00 ld [ %g2 ], %g4 2009744: 81 c7 e0 08 ret 2009748: 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; 200974c: 80 a1 20 00 cmp %g4, 0 2009750: 02 80 00 0c be 2009780 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 2009754: 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]) 2009758: 80 a0 40 0f cmp %g1, %o7 200975c: 02 80 00 59 be 20098c0 <_RBTree_Validate_insert_unprotected+0x1a8> 2009760: 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); 2009764: 80 a1 20 00 cmp %g4, 0 2009768: 22 80 00 07 be,a 2009784 <_RBTree_Validate_insert_unprotected+0x6c> 200976c: c8 00 60 04 ld [ %g1 + 4 ], %g4 2009770: da 01 20 0c ld [ %g4 + 0xc ], %o5 2009774: 80 a3 60 01 cmp %o5, 1 2009778: 22 80 00 4c be,a 20098a8 <_RBTree_Validate_insert_unprotected+0x190> 200977c: c0 20 60 0c clr [ %g1 + 0xc ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 2009780: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 2009784: 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]; 2009788: 88 19 00 18 xor %g4, %i0, %g4 200978c: 80 a0 00 04 cmp %g0, %g4 2009790: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 2009794: 80 a0 00 0f cmp %g0, %o7 2009798: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200979c: 80 a3 40 04 cmp %o5, %g4 20097a0: 02 80 00 46 be 20098b8 <_RBTree_Validate_insert_unprotected+0x1a0> 20097a4: 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; 20097a8: 98 22 c0 04 sub %o3, %g4, %o4 20097ac: 9b 2b 20 02 sll %o4, 2, %o5 20097b0: 9a 00 40 0d add %g1, %o5, %o5 20097b4: de 03 60 04 ld [ %o5 + 4 ], %o7 20097b8: 80 a3 e0 00 cmp %o7, 0 20097bc: 02 80 00 16 be 2009814 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 20097c0: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 20097c4: 94 03 c0 04 add %o7, %g4, %o2 20097c8: d2 02 a0 04 ld [ %o2 + 4 ], %o1 20097cc: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 20097d0: da 02 a0 04 ld [ %o2 + 4 ], %o5 20097d4: 80 a3 60 00 cmp %o5, 0 20097d8: 22 80 00 05 be,a 20097ec <_RBTree_Validate_insert_unprotected+0xd4> 20097dc: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 20097e0: c2 23 40 00 st %g1, [ %o5 ] 20097e4: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 20097e8: 9a 03 c0 04 add %o7, %g4, %o5 20097ec: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20097f0: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 20097f4: 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; 20097f8: 9a 18 40 0d xor %g1, %o5, %o5 c->parent = the_node->parent; the_node->parent = c; 20097fc: 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; 2009800: 80 a0 00 0d cmp %g0, %o5 2009804: 82 40 20 00 addx %g0, 0, %g1 2009808: 83 28 60 02 sll %g1, 2, %g1 200980c: 84 00 80 01 add %g2, %g1, %g2 2009810: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 2009814: b0 06 00 04 add %i0, %g4, %i0 2009818: f0 06 20 04 ld [ %i0 + 4 ], %i0 200981c: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 2009820: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2009824: 88 00 c0 04 add %g3, %g4, %g4 2009828: c2 01 20 04 ld [ %g4 + 4 ], %g1 200982c: 80 a0 60 00 cmp %g1, 0 2009830: 02 bf ff bc be 2009720 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN 2009834: d6 20 e0 0c st %o3, [ %g3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009838: 99 2b 20 02 sll %o4, 2, %o4 200983c: 84 00 40 0c add %g1, %o4, %g2 2009840: de 00 a0 04 ld [ %g2 + 4 ], %o7 2009844: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 2009848: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200984c: 80 a0 a0 00 cmp %g2, 0 2009850: 32 80 00 02 bne,a 2009858 <_RBTree_Validate_insert_unprotected+0x140> 2009854: 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; 2009858: 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; 200985c: 98 00 40 0c add %g1, %o4, %o4 2009860: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009864: c8 00 a0 04 ld [ %g2 + 4 ], %g4 c->parent = the_node->parent; 2009868: c4 20 40 00 st %g2, [ %g1 ] the_node->parent = c; 200986c: 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; 2009870: 88 19 00 03 xor %g4, %g3, %g4 2009874: 80 a0 00 04 cmp %g0, %g4 2009878: 86 40 20 00 addx %g0, 0, %g3 200987c: 87 28 e0 02 sll %g3, 2, %g3 2009880: 84 00 80 03 add %g2, %g3, %g2 2009884: c2 20 a0 04 st %g1, [ %g2 + 4 ] ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009888: 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; 200988c: c4 00 40 00 ld [ %g1 ], %g2 2009890: 86 90 a0 00 orcc %g2, 0, %g3 2009894: 32 bf ff a9 bne,a 2009738 <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 2009898: c8 00 60 0c ld [ %g1 + 0xc ], %g4 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200989c: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 20098a0: 81 c7 e0 08 ret <== NOT EXECUTED 20098a4: 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; 20098a8: c0 21 20 0c clr [ %g4 + 0xc ] g->color = RBT_RED; 20098ac: da 20 a0 0c st %o5, [ %g2 + 0xc ] 20098b0: 10 bf ff 9c b 2009720 <_RBTree_Validate_insert_unprotected+0x8> 20098b4: b0 10 00 02 mov %g2, %i0 20098b8: 10 bf ff da b 2009820 <_RBTree_Validate_insert_unprotected+0x108> 20098bc: 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]; 20098c0: 10 bf ff a9 b 2009764 <_RBTree_Validate_insert_unprotected+0x4c> 20098c4: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 02006d28 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2006d28: 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; 2006d2c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006d30: 82 10 61 a4 or %g1, 0x1a4, %g1 ! 201cda4 2006d34: 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 ) 2006d38: 80 a7 60 00 cmp %i5, 0 2006d3c: 02 80 00 18 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 2006d40: 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++ ) { 2006d44: 80 a6 e0 00 cmp %i3, 0 2006d48: 02 80 00 15 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2006d4c: b8 10 20 00 clr %i4 return_value = rtems_task_create( 2006d50: d4 07 60 04 ld [ %i5 + 4 ], %o2 2006d54: d0 07 40 00 ld [ %i5 ], %o0 2006d58: d2 07 60 08 ld [ %i5 + 8 ], %o1 2006d5c: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 2006d60: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2006d64: 7f ff ff 70 call 2006b24 2006d68: 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 ) ) 2006d6c: 94 92 20 00 orcc %o0, 0, %o2 2006d70: 12 80 00 0d bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d74: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2006d78: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2006d7c: 40 00 00 0e call 2006db4 2006d80: 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 ) ) 2006d84: 94 92 20 00 orcc %o0, 0, %o2 2006d88: 12 80 00 07 bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d8c: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006d90: 80 a7 00 1b cmp %i4, %i3 2006d94: 12 bf ff ef bne 2006d50 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2006d98: ba 07 60 1c add %i5, 0x1c, %i5 2006d9c: 81 c7 e0 08 ret 2006da0: 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 ); 2006da4: 90 10 20 01 mov 1, %o0 2006da8: 40 00 04 16 call 2007e00 <_Internal_error_Occurred> 2006dac: 92 10 20 01 mov 1, %o1 =============================================================================== 0200ced8 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200ced8: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200cedc: 80 a0 60 00 cmp %g1, 0 200cee0: 22 80 00 0c be,a 200cf10 <_RTEMS_tasks_Switch_extension+0x38> 200cee4: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200cee8: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200ceec: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200cef0: c8 00 80 00 ld [ %g2 ], %g4 200cef4: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200cef8: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200cefc: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200cf00: 80 a0 60 00 cmp %g1, 0 200cf04: 32 bf ff fa bne,a 200ceec <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200cf08: 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; 200cf0c: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200cf10: 80 a0 60 00 cmp %g1, 0 200cf14: 02 80 00 0b be 200cf40 <_RTEMS_tasks_Switch_extension+0x68> 200cf18: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200cf1c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200cf20: 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; 200cf24: c8 00 80 00 ld [ %g2 ], %g4 200cf28: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200cf2c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200cf30: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200cf34: 80 a0 60 00 cmp %g1, 0 200cf38: 32 bf ff fa bne,a 200cf20 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200cf3c: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200cf40: 81 c3 e0 08 retl =============================================================================== 02007aa8 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007aa8: 9d e3 bf 98 save %sp, -104, %sp 2007aac: 11 00 80 7d sethi %hi(0x201f400), %o0 2007ab0: 92 10 00 18 mov %i0, %o1 2007ab4: 90 12 23 c4 or %o0, 0x3c4, %o0 2007ab8: 40 00 08 4e call 2009bf0 <_Objects_Get> 2007abc: 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 ) { 2007ac0: c2 07 bf fc ld [ %fp + -4 ], %g1 2007ac4: 80 a0 60 00 cmp %g1, 0 2007ac8: 12 80 00 17 bne 2007b24 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2007acc: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007ad0: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007ad4: 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); 2007ad8: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007adc: 80 88 80 01 btst %g2, %g1 2007ae0: 22 80 00 08 be,a 2007b00 <_Rate_monotonic_Timeout+0x58> 2007ae4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ae8: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007aec: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007af0: 80 a0 80 01 cmp %g2, %g1 2007af4: 02 80 00 1a be 2007b5c <_Rate_monotonic_Timeout+0xb4> 2007af8: 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 ) { 2007afc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007b00: 80 a0 60 01 cmp %g1, 1 2007b04: 02 80 00 0a be 2007b2c <_Rate_monotonic_Timeout+0x84> 2007b08: 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; 2007b0c: 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--; 2007b10: 03 00 80 7e sethi %hi(0x201f800), %g1 2007b14: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 201f930 <_Thread_Dispatch_disable_level> 2007b18: 84 00 bf ff add %g2, -1, %g2 2007b1c: c4 20 61 30 st %g2, [ %g1 + 0x130 ] return _Thread_Dispatch_disable_level; 2007b20: c2 00 61 30 ld [ %g1 + 0x130 ], %g1 2007b24: 81 c7 e0 08 ret 2007b28: 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; 2007b2c: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007b30: 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; 2007b34: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007b38: 7f ff fe 5a call 20074a0 <_Rate_monotonic_Initiate_statistics> 2007b3c: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b40: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b44: 11 00 80 7e sethi %hi(0x201f800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b48: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b4c: 90 12 21 ec or %o0, 0x1ec, %o0 2007b50: 40 00 10 44 call 200bc60 <_Watchdog_Insert> 2007b54: 92 07 60 10 add %i5, 0x10, %o1 2007b58: 30 bf ff ee b,a 2007b10 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007b5c: 40 00 0b 2a call 200a804 <_Thread_Clear_state> 2007b60: 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 ); 2007b64: 10 bf ff f5 b 2007b38 <_Rate_monotonic_Timeout+0x90> 2007b68: 90 10 00 1d mov %i5, %o0 =============================================================================== 02008bf0 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 2008bf0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 2008bf4: 03 00 80 78 sethi %hi(0x201e000), %g1 2008bf8: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 201e004 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2008bfc: c2 0a 20 74 ldub [ %o0 + 0x74 ], %g1 2008c00: 80 a0 60 00 cmp %g1, 0 2008c04: 02 80 00 26 be 2008c9c <_Scheduler_priority_Tick+0xac> 2008c08: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2008c0c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2008c10: 80 a0 60 00 cmp %g1, 0 2008c14: 12 80 00 22 bne 2008c9c <_Scheduler_priority_Tick+0xac> 2008c18: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2008c1c: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 2008c20: 80 a0 60 01 cmp %g1, 1 2008c24: 0a 80 00 07 bcs 2008c40 <_Scheduler_priority_Tick+0x50> 2008c28: 80 a0 60 02 cmp %g1, 2 2008c2c: 28 80 00 10 bleu,a 2008c6c <_Scheduler_priority_Tick+0x7c> 2008c30: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2008c34: 80 a0 60 03 cmp %g1, 3 2008c38: 22 80 00 04 be,a 2008c48 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN 2008c3c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2008c40: 81 c7 e0 08 ret 2008c44: 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 ) 2008c48: 82 00 7f ff add %g1, -1, %g1 2008c4c: 80 a0 60 00 cmp %g1, 0 2008c50: 12 bf ff fc bne 2008c40 <_Scheduler_priority_Tick+0x50> 2008c54: c2 22 20 78 st %g1, [ %o0 + 0x78 ] (*executing->budget_callout)( executing ); 2008c58: c2 02 20 80 ld [ %o0 + 0x80 ], %g1 2008c5c: 9f c0 40 00 call %g1 2008c60: 01 00 00 00 nop 2008c64: 81 c7 e0 08 ret 2008c68: 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 ) { 2008c6c: 82 00 7f ff add %g1, -1, %g1 2008c70: 80 a0 60 00 cmp %g1, 0 2008c74: 14 bf ff f3 bg 2008c40 <_Scheduler_priority_Tick+0x50> 2008c78: 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(); 2008c7c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008c80: c2 00 62 50 ld [ %g1 + 0x250 ], %g1 ! 201ce50 <_Scheduler+0xc> 2008c84: 9f c0 40 00 call %g1 2008c88: 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; 2008c8c: 03 00 80 76 sethi %hi(0x201d800), %g1 2008c90: d0 07 bf fc ld [ %fp + -4 ], %o0 2008c94: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 2008c98: c2 22 20 78 st %g1, [ %o0 + 0x78 ] 2008c9c: 81 c7 e0 08 ret 2008ca0: 81 e8 00 00 restore =============================================================================== 02009360 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2009360: 03 00 80 77 sethi %hi(0x201dc00), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009364: c2 00 61 14 ld [ %g1 + 0x114 ], %g1 ! 201dd14 <_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 ) { 2009368: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200936c: c2 00 40 00 ld [ %g1 ], %g1 2009370: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009374: 80 a0 80 03 cmp %g2, %g3 2009378: 3a 80 00 08 bcc,a 2009398 <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200937c: 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 ) { 2009380: 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 ) { 2009384: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009388: 80 a0 80 03 cmp %g2, %g3 200938c: 2a bf ff fe bcs,a 2009384 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 2009390: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 2009394: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2009398: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200939c: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 20093a0: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 20093a4: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 20093a8: 81 c3 e0 08 retl 20093ac: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 020074ec <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 20074ec: 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(); 20074f0: 03 00 80 7d sethi %hi(0x201f400), %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; 20074f4: 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) || 20074f8: 80 a6 20 00 cmp %i0, 0 20074fc: 02 80 00 2c be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN 2007500: d2 00 60 88 ld [ %g1 + 0x88 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2007504: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007508: 40 00 4c f0 call 201a8c8 <.udiv> 200750c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007510: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2007514: 80 a2 00 01 cmp %o0, %g1 2007518: 28 80 00 26 bleu,a 20075b0 <_TOD_Validate+0xc4> 200751c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2007520: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007524: 80 a0 60 3b cmp %g1, 0x3b 2007528: 38 80 00 22 bgu,a 20075b0 <_TOD_Validate+0xc4> 200752c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2007530: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2007534: 80 a0 60 3b cmp %g1, 0x3b 2007538: 38 80 00 1e bgu,a 20075b0 <_TOD_Validate+0xc4> 200753c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2007540: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2007544: 80 a0 60 17 cmp %g1, 0x17 2007548: 38 80 00 1a bgu,a 20075b0 <_TOD_Validate+0xc4> 200754c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2007550: 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) || 2007554: 80 a0 60 00 cmp %g1, 0 2007558: 02 80 00 15 be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN 200755c: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007560: 38 80 00 14 bgu,a 20075b0 <_TOD_Validate+0xc4> 2007564: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007568: 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) || 200756c: 80 a0 a7 c3 cmp %g2, 0x7c3 2007570: 28 80 00 10 bleu,a 20075b0 <_TOD_Validate+0xc4> 2007574: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007578: 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) || 200757c: 80 a0 e0 00 cmp %g3, 0 2007580: 02 80 00 0b be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN 2007584: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007588: 32 80 00 0c bne,a 20075b8 <_TOD_Validate+0xcc> 200758c: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2007590: 82 00 60 0d add %g1, 0xd, %g1 2007594: 05 00 80 77 sethi %hi(0x201dc00), %g2 2007598: 83 28 60 02 sll %g1, 2, %g1 200759c: 84 10 a3 d8 or %g2, 0x3d8, %g2 20075a0: 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( 20075a4: 80 a0 40 03 cmp %g1, %g3 20075a8: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 20075ac: b0 0f 60 01 and %i5, 1, %i0 20075b0: 81 c7 e0 08 ret 20075b4: 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 ]; 20075b8: 05 00 80 77 sethi %hi(0x201dc00), %g2 20075bc: 84 10 a3 d8 or %g2, 0x3d8, %g2 ! 201dfd8 <_TOD_Days_per_month> 20075c0: 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( 20075c4: 80 a0 40 03 cmp %g1, %g3 20075c8: 10 bf ff f9 b 20075ac <_TOD_Validate+0xc0> 20075cc: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02008ec8 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008ec8: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008ecc: 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 ); 2008ed0: 40 00 03 a9 call 2009d74 <_Thread_Set_transient> 2008ed4: 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 ) 2008ed8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008edc: 80 a0 40 19 cmp %g1, %i1 2008ee0: 02 80 00 05 be 2008ef4 <_Thread_Change_priority+0x2c> 2008ee4: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008ee8: 90 10 00 18 mov %i0, %o0 2008eec: 40 00 03 88 call 2009d0c <_Thread_Set_priority> 2008ef0: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008ef4: 7f ff e4 bc call 20021e4 2008ef8: 01 00 00 00 nop 2008efc: 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; 2008f00: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 2008f04: 80 a6 e0 04 cmp %i3, 4 2008f08: 02 80 00 18 be 2008f68 <_Thread_Change_priority+0xa0> 2008f0c: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008f10: 02 80 00 0b be 2008f3c <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 2008f14: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2008f18: 7f ff e4 b7 call 20021f4 <== NOT EXECUTED 2008f1c: 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); 2008f20: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 2008f24: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008f28: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2008f2c: 32 80 00 0d bne,a 2008f60 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2008f30: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 2008f34: 81 c7 e0 08 ret 2008f38: 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 ); 2008f3c: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008f40: 7f ff e4 ad call 20021f4 2008f44: 90 10 00 19 mov %i1, %o0 2008f48: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008f4c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008f50: 80 8e c0 01 btst %i3, %g1 2008f54: 02 bf ff f8 be 2008f34 <_Thread_Change_priority+0x6c> 2008f58: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008f5c: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2008f60: 40 00 03 3a call 2009c48 <_Thread_queue_Requeue> 2008f64: 93 e8 00 1d restore %g0, %i5, %o1 2008f68: 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 ) ) { 2008f6c: 12 80 00 08 bne 2008f8c <_Thread_Change_priority+0xc4> <== NEVER TAKEN 2008f70: b8 17 22 44 or %i4, 0x244, %i4 ! 201ce44 <_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 ) 2008f74: 80 a6 a0 00 cmp %i2, 0 2008f78: 02 80 00 1b be 2008fe4 <_Thread_Change_priority+0x11c> 2008f7c: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2008f80: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 2008f84: 9f c0 40 00 call %g1 2008f88: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2008f8c: 7f ff e4 9a call 20021f4 2008f90: 90 10 00 19 mov %i1, %o0 2008f94: 7f ff e4 94 call 20021e4 2008f98: 01 00 00 00 nop 2008f9c: 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(); 2008fa0: c2 07 20 08 ld [ %i4 + 8 ], %g1 2008fa4: 9f c0 40 00 call %g1 2008fa8: 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 ); 2008fac: 03 00 80 77 sethi %hi(0x201dc00), %g1 2008fb0: 82 10 63 f8 or %g1, 0x3f8, %g1 ! 201dff8 <_Per_CPU_Information> 2008fb4: 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() && 2008fb8: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008fbc: 80 a0 80 03 cmp %g2, %g3 2008fc0: 02 80 00 07 be 2008fdc <_Thread_Change_priority+0x114> 2008fc4: 01 00 00 00 nop 2008fc8: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008fcc: 80 a0 a0 00 cmp %g2, 0 2008fd0: 02 80 00 03 be 2008fdc <_Thread_Change_priority+0x114> 2008fd4: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008fd8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008fdc: 7f ff e4 86 call 20021f4 2008fe0: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008fe4: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 2008fe8: 9f c0 40 00 call %g1 2008fec: 90 10 00 1d mov %i5, %o0 2008ff0: 30 bf ff e7 b,a 2008f8c <_Thread_Change_priority+0xc4> =============================================================================== 0200920c <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200920c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009210: 90 10 00 18 mov %i0, %o0 2009214: 40 00 00 77 call 20093f0 <_Thread_Get> 2009218: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200921c: c2 07 bf fc ld [ %fp + -4 ], %g1 2009220: 80 a0 60 00 cmp %g1, 0 2009224: 12 80 00 09 bne 2009248 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2009228: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200922c: 7f ff ff 72 call 2008ff4 <_Thread_Clear_state> 2009230: 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--; 2009234: 03 00 80 76 sethi %hi(0x201d800), %g1 2009238: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201dac0 <_Thread_Dispatch_disable_level> 200923c: 84 00 bf ff add %g2, -1, %g2 2009240: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2009244: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 2009248: 81 c7 e0 08 ret 200924c: 81 e8 00 00 restore =============================================================================== 02009250 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2009250: 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++; 2009254: 21 00 80 76 sethi %hi(0x201d800), %l0 2009258: c2 04 22 c0 ld [ %l0 + 0x2c0 ], %g1 ! 201dac0 <_Thread_Dispatch_disable_level> 200925c: 82 00 60 01 inc %g1 2009260: c2 24 22 c0 st %g1, [ %l0 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2009264: c2 04 22 c0 ld [ %l0 + 0x2c0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 2009268: 39 00 80 77 sethi %hi(0x201dc00), %i4 200926c: b8 17 23 f8 or %i4, 0x3f8, %i4 ! 201dff8 <_Per_CPU_Information> _ISR_Disable( level ); 2009270: 7f ff e3 dd call 20021e4 2009274: fa 07 20 0c ld [ %i4 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 2009278: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 200927c: 80 a0 60 00 cmp %g1, 0 2009280: 02 80 00 48 be 20093a0 <_Thread_Dispatch+0x150> 2009284: 01 00 00 00 nop heir = _Thread_Heir; 2009288: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 200928c: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2009290: 80 a7 40 1b cmp %i5, %i3 2009294: 02 80 00 43 be 20093a0 <_Thread_Dispatch+0x150> 2009298: f6 27 20 0c st %i3, [ %i4 + 0xc ] 200929c: 31 00 80 76 sethi %hi(0x201d800), %i0 #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; 20092a0: 23 00 80 76 sethi %hi(0x201d800), %l1 20092a4: b0 16 23 48 or %i0, 0x348, %i0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 20092a8: b2 07 20 1c add %i4, 0x1c, %i1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 20092ac: 10 80 00 37 b 2009388 <_Thread_Dispatch+0x138> 20092b0: 35 00 80 76 sethi %hi(0x201d800), %i2 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 ); 20092b4: 7f ff e3 d0 call 20021f4 20092b8: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 20092bc: 40 00 10 48 call 200d3dc <_TOD_Get_uptime> 20092c0: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 20092c4: 90 10 00 19 mov %i1, %o0 20092c8: 92 07 bf f0 add %fp, -16, %o1 20092cc: 40 00 03 25 call 2009f60 <_Timespec_Subtract> 20092d0: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 20092d4: 90 07 60 84 add %i5, 0x84, %o0 20092d8: 40 00 03 09 call 2009efc <_Timespec_Add_to> 20092dc: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 20092e0: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20092e4: c2 06 00 00 ld [ %i0 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 20092e8: c4 27 20 1c st %g2, [ %i4 + 0x1c ] 20092ec: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20092f0: 80 a0 60 00 cmp %g1, 0 20092f4: 02 80 00 06 be 200930c <_Thread_Dispatch+0xbc> <== NEVER TAKEN 20092f8: c4 27 20 20 st %g2, [ %i4 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 20092fc: c4 00 40 00 ld [ %g1 ], %g2 2009300: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2009304: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2 2009308: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 200930c: 90 10 00 1d mov %i5, %o0 2009310: 40 00 03 d8 call 200a270 <_User_extensions_Thread_switch> 2009314: 92 10 00 1b mov %i3, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2009318: 90 07 60 c8 add %i5, 0xc8, %o0 200931c: 40 00 05 1c call 200a78c <_CPU_Context_switch> 2009320: 92 06 e0 c8 add %i3, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2009324: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2009328: 80 a0 60 00 cmp %g1, 0 200932c: 02 80 00 0c be 200935c <_Thread_Dispatch+0x10c> 2009330: d0 06 a3 44 ld [ %i2 + 0x344 ], %o0 2009334: 80 a7 40 08 cmp %i5, %o0 2009338: 02 80 00 09 be 200935c <_Thread_Dispatch+0x10c> 200933c: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2009340: 02 80 00 04 be 2009350 <_Thread_Dispatch+0x100> 2009344: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2009348: 40 00 04 d7 call 200a6a4 <_CPU_Context_save_fp> 200934c: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2009350: 40 00 04 f2 call 200a718 <_CPU_Context_restore_fp> 2009354: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2009358: fa 26 a3 44 st %i5, [ %i2 + 0x344 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200935c: 7f ff e3 a2 call 20021e4 2009360: fa 07 20 0c ld [ %i4 + 0xc ], %i5 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2009364: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 2009368: 80 a0 60 00 cmp %g1, 0 200936c: 02 80 00 0d be 20093a0 <_Thread_Dispatch+0x150> 2009370: 01 00 00 00 nop heir = _Thread_Heir; 2009374: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 2009378: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200937c: 80 a6 c0 1d cmp %i3, %i5 2009380: 02 80 00 08 be 20093a0 <_Thread_Dispatch+0x150> <== NEVER TAKEN 2009384: f6 27 20 0c st %i3, [ %i4 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 2009388: c2 06 e0 7c ld [ %i3 + 0x7c ], %g1 200938c: 80 a0 60 01 cmp %g1, 1 2009390: 12 bf ff c9 bne 20092b4 <_Thread_Dispatch+0x64> 2009394: c2 04 62 24 ld [ %l1 + 0x224 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009398: 10 bf ff c7 b 20092b4 <_Thread_Dispatch+0x64> 200939c: c2 26 e0 78 st %g1, [ %i3 + 0x78 ] * 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; 20093a0: c0 24 22 c0 clr [ %l0 + 0x2c0 ] } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 20093a4: 7f ff e3 94 call 20021f4 20093a8: 01 00 00 00 nop _API_extensions_Run_postswitch(); 20093ac: 7f ff f7 cd call 20072e0 <_API_extensions_Run_postswitch> 20093b0: 01 00 00 00 nop } 20093b4: 81 c7 e0 08 ret 20093b8: 81 e8 00 00 restore =============================================================================== 0200f828 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200f828: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200f82c: 03 00 80 78 sethi %hi(0x201e000), %g1 200f830: fa 00 60 04 ld [ %g1 + 4 ], %i5 ! 201e004 <_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(); 200f834: 3f 00 80 3e sethi %hi(0x200f800), %i7 200f838: be 17 e0 28 or %i7, 0x28, %i7 ! 200f828 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f83c: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200f840: 7f ff ca 6d call 20021f4 200f844: 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) && 200f848: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f84c: 03 00 80 75 sethi %hi(0x201d400), %g1 doneConstructors = 1; 200f850: 86 10 20 01 mov 1, %g3 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f854: f6 08 63 7c ldub [ %g1 + 0x37c ], %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) && 200f858: 80 a0 a0 00 cmp %g2, 0 200f85c: 02 80 00 0c be 200f88c <_Thread_Handler+0x64> 200f860: c6 28 63 7c stb %g3, [ %g1 + 0x37c ] #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 ); 200f864: 39 00 80 76 sethi %hi(0x201d800), %i4 200f868: d0 07 23 44 ld [ %i4 + 0x344 ], %o0 ! 201db44 <_Thread_Allocated_fp> 200f86c: 80 a7 40 08 cmp %i5, %o0 200f870: 02 80 00 07 be 200f88c <_Thread_Handler+0x64> 200f874: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f878: 22 80 00 05 be,a 200f88c <_Thread_Handler+0x64> 200f87c: fa 27 23 44 st %i5, [ %i4 + 0x344 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f880: 7f ff eb 89 call 200a6a4 <_CPU_Context_save_fp> 200f884: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200f888: fa 27 23 44 st %i5, [ %i4 + 0x344 ] /* * 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 ); 200f88c: 7f ff e9 f7 call 200a068 <_User_extensions_Thread_begin> 200f890: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f894: 7f ff e6 ca call 20093bc <_Thread_Enable_dispatch> 200f898: 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) */ { 200f89c: 80 a6 e0 00 cmp %i3, 0 200f8a0: 02 80 00 0e be 200f8d8 <_Thread_Handler+0xb0> 200f8a4: 01 00 00 00 nop #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f8a8: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200f8ac: 80 a0 60 00 cmp %g1, 0 200f8b0: 02 80 00 0e be 200f8e8 <_Thread_Handler+0xc0> 200f8b4: 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 ) { 200f8b8: 22 80 00 11 be,a 200f8fc <_Thread_Handler+0xd4> <== ALWAYS TAKEN 200f8bc: 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 ); 200f8c0: 7f ff e9 fe call 200a0b8 <_User_extensions_Thread_exitted> 200f8c4: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200f8c8: 90 10 20 00 clr %o0 200f8cc: 92 10 20 01 mov 1, %o1 200f8d0: 7f ff e1 4c call 2007e00 <_Internal_error_Occurred> 200f8d4: 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 (); 200f8d8: 40 00 35 12 call 201cd20 <_init> 200f8dc: 01 00 00 00 nop #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f8e0: 10 bf ff f3 b 200f8ac <_Thread_Handler+0x84> 200f8e4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f8e8: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200f8ec: 9f c0 40 00 call %g1 200f8f0: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200f8f4: 10 bf ff f3 b 200f8c0 <_Thread_Handler+0x98> 200f8f8: 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)( 200f8fc: 9f c0 40 00 call %g1 200f900: 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 = 200f904: 10 bf ff ef b 200f8c0 <_Thread_Handler+0x98> 200f908: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 020094a0 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 20094a0: 9d e3 bf a0 save %sp, -96, %sp 20094a4: 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; 20094a8: c0 26 61 58 clr [ %i1 + 0x158 ] 20094ac: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 20094b0: 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 ) { 20094b4: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 20094b8: 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 ) { 20094bc: 80 a6 a0 00 cmp %i2, 0 20094c0: 02 80 00 6b be 200966c <_Thread_Initialize+0x1cc> 20094c4: 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; 20094c8: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 20094cc: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20094d0: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 20094d4: 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 ) { 20094d8: 80 a7 20 00 cmp %i4, 0 20094dc: 12 80 00 48 bne 20095fc <_Thread_Initialize+0x15c> 20094e0: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20094e4: 39 00 80 76 sethi %hi(0x201d800), %i4 20094e8: c2 07 23 54 ld [ %i4 + 0x354 ], %g1 ! 201db54 <_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; 20094ec: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 20094f0: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20094f4: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 20094f8: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 20094fc: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009500: 80 a0 60 00 cmp %g1, 0 2009504: 12 80 00 46 bne 200961c <_Thread_Initialize+0x17c> 2009508: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200950c: 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; 2009510: 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; 2009514: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2009518: e2 2e 60 a0 stb %l1, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 200951c: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2009520: 80 a4 20 02 cmp %l0, 2 2009524: 12 80 00 05 bne 2009538 <_Thread_Initialize+0x98> 2009528: 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; 200952c: 03 00 80 76 sethi %hi(0x201d800), %g1 2009530: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 ! 201da24 <_Thread_Ticks_per_timeslice> 2009534: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009538: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200953c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009540: c2 00 62 5c ld [ %g1 + 0x25c ], %g1 ! 201ce5c <_Scheduler+0x18> 2009544: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2009548: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 200954c: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2009550: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2009554: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2009558: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200955c: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2009560: 9f c0 40 00 call %g1 2009564: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2009568: b8 92 20 00 orcc %o0, 0, %i4 200956c: 22 80 00 13 be,a 20095b8 <_Thread_Initialize+0x118> 2009570: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2009574: 90 10 00 19 mov %i1, %o0 2009578: 40 00 01 e5 call 2009d0c <_Thread_Set_priority> 200957c: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009580: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009584: 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 ); 2009588: c0 26 60 84 clr [ %i1 + 0x84 ] 200958c: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009590: 83 28 60 02 sll %g1, 2, %g1 2009594: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2009598: 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 ); 200959c: 90 10 00 19 mov %i1, %o0 20095a0: 40 00 02 ed call 200a154 <_User_extensions_Thread_create> 20095a4: b0 10 20 01 mov 1, %i0 if ( extension_status ) 20095a8: 80 8a 20 ff btst 0xff, %o0 20095ac: 32 80 00 12 bne,a 20095f4 <_Thread_Initialize+0x154> 20095b0: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 20095b4: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 20095b8: 40 00 04 26 call 200a650 <_Workspace_Free> 20095bc: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 20095c0: 40 00 04 24 call 200a650 <_Workspace_Free> 20095c4: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 20095c8: 40 00 04 22 call 200a650 <_Workspace_Free> 20095cc: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 20095d0: 40 00 04 20 call 200a650 <_Workspace_Free> 20095d4: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 20095d8: 40 00 04 1e call 200a650 <_Workspace_Free> 20095dc: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 20095e0: 40 00 04 1c call 200a650 <_Workspace_Free> 20095e4: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 20095e8: 40 00 02 0d call 2009e1c <_Thread_Stack_Free> 20095ec: 90 10 00 19 mov %i1, %o0 return false; } 20095f0: b0 0e 20 01 and %i0, 1, %i0 20095f4: 81 c7 e0 08 ret 20095f8: 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 ); 20095fc: 40 00 04 0d call 200a630 <_Workspace_Allocate> 2009600: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2009604: b6 92 20 00 orcc %o0, 0, %i3 2009608: 32 bf ff b8 bne,a 20094e8 <_Thread_Initialize+0x48> 200960c: 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; 2009610: 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; 2009614: 10 bf ff e8 b 20095b4 <_Thread_Initialize+0x114> 2009618: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200961c: 82 00 60 01 inc %g1 2009620: 40 00 04 04 call 200a630 <_Workspace_Allocate> 2009624: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2009628: b4 92 20 00 orcc %o0, 0, %i2 200962c: 02 80 00 1d be 20096a0 <_Thread_Initialize+0x200> 2009630: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2009634: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 2009638: c8 07 23 54 ld [ %i4 + 0x354 ], %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++ ) 200963c: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009640: 10 80 00 03 b 200964c <_Thread_Initialize+0x1ac> 2009644: 82 10 20 00 clr %g1 2009648: 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; 200964c: 85 28 a0 02 sll %g2, 2, %g2 2009650: 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++ ) 2009654: 82 00 60 01 inc %g1 2009658: 80 a0 40 04 cmp %g1, %g4 200965c: 08 bf ff fb bleu 2009648 <_Thread_Initialize+0x1a8> 2009660: 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; 2009664: 10 bf ff ad b 2009518 <_Thread_Initialize+0x78> 2009668: 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 ); 200966c: 90 10 00 19 mov %i1, %o0 2009670: 40 00 01 d0 call 2009db0 <_Thread_Stack_Allocate> 2009674: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2009678: 80 a2 00 1b cmp %o0, %i3 200967c: 0a 80 00 07 bcs 2009698 <_Thread_Initialize+0x1f8> 2009680: 80 a2 20 00 cmp %o0, 0 2009684: 02 80 00 05 be 2009698 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 2009688: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200968c: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 2009690: 10 bf ff 90 b 20094d0 <_Thread_Initialize+0x30> 2009694: 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 */ 2009698: 10 bf ff d6 b 20095f0 <_Thread_Initialize+0x150> 200969c: 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; 20096a0: 10 bf ff c5 b 20095b4 <_Thread_Initialize+0x114> 20096a4: b8 10 20 00 clr %i4 =============================================================================== 02009e1c <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 2009e1c: 9d e3 bf a0 save %sp, -96, %sp #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 2009e20: c2 0e 20 b4 ldub [ %i0 + 0xb4 ], %g1 2009e24: 80 a0 60 00 cmp %g1, 0 2009e28: 02 80 00 0b be 2009e54 <_Thread_Stack_Free+0x38> <== NEVER TAKEN 2009e2c: 01 00 00 00 nop * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ if ( Configuration.stack_free_hook ) 2009e30: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009e34: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 ! 201cd80 2009e38: 80 a0 60 00 cmp %g1, 0 2009e3c: 22 80 00 08 be,a 2009e5c <_Thread_Stack_Free+0x40> 2009e40: f0 06 20 bc ld [ %i0 + 0xbc ], %i0 (*Configuration.stack_free_hook)( the_thread->Start.Initial_stack.area ); 2009e44: 9f c0 40 00 call %g1 2009e48: d0 06 20 bc ld [ %i0 + 0xbc ], %o0 2009e4c: 81 c7 e0 08 ret 2009e50: 81 e8 00 00 restore 2009e54: 81 c7 e0 08 ret <== NOT EXECUTED 2009e58: 81 e8 00 00 restore <== NOT EXECUTED else _Workspace_Free( the_thread->Start.Initial_stack.area ); 2009e5c: 40 00 01 fd call 200a650 <_Workspace_Free> 2009e60: 81 e8 00 00 restore =============================================================================== 02009c48 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009c48: 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 ) 2009c4c: 80 a6 20 00 cmp %i0, 0 2009c50: 02 80 00 13 be 2009c9c <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 2009c54: 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 ) { 2009c58: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2009c5c: 80 a7 20 01 cmp %i4, 1 2009c60: 02 80 00 04 be 2009c70 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 2009c64: 01 00 00 00 nop 2009c68: 81 c7 e0 08 ret <== NOT EXECUTED 2009c6c: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009c70: 7f ff e1 5d call 20021e4 2009c74: 01 00 00 00 nop 2009c78: ba 10 00 08 mov %o0, %i5 2009c7c: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2009c80: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009c84: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009c88: 80 88 80 01 btst %g2, %g1 2009c8c: 12 80 00 06 bne 2009ca4 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 2009c90: 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 ); 2009c94: 7f ff e1 58 call 20021f4 2009c98: 90 10 00 1d mov %i5, %o0 2009c9c: 81 c7 e0 08 ret 2009ca0: 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 ); 2009ca4: 92 10 00 19 mov %i1, %o1 2009ca8: 94 10 20 01 mov 1, %o2 2009cac: 40 00 0f 4f call 200d9e8 <_Thread_queue_Extract_priority_helper> 2009cb0: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009cb4: 90 10 00 18 mov %i0, %o0 2009cb8: 92 10 00 19 mov %i1, %o1 2009cbc: 7f ff ff 35 call 2009990 <_Thread_queue_Enqueue_priority> 2009cc0: 94 07 bf fc add %fp, -4, %o2 2009cc4: 30 bf ff f4 b,a 2009c94 <_Thread_queue_Requeue+0x4c> =============================================================================== 02009cc8 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009cc8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009ccc: 90 10 00 18 mov %i0, %o0 2009cd0: 7f ff fd c8 call 20093f0 <_Thread_Get> 2009cd4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009cd8: c2 07 bf fc ld [ %fp + -4 ], %g1 2009cdc: 80 a0 60 00 cmp %g1, 0 2009ce0: 12 80 00 09 bne 2009d04 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009ce4: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009ce8: 40 00 0f 79 call 200dacc <_Thread_queue_Process_timeout> 2009cec: 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--; 2009cf0: 03 00 80 76 sethi %hi(0x201d800), %g1 2009cf4: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201dac0 <_Thread_Dispatch_disable_level> 2009cf8: 84 00 bf ff add %g2, -1, %g2 2009cfc: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2009d00: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 2009d04: 81 c7 e0 08 ret 2009d08: 81 e8 00 00 restore =============================================================================== 0201649c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 201649c: 9d e3 bf 88 save %sp, -120, %sp 20164a0: 23 00 80 ee sethi %hi(0x203b800), %l1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20164a4: a6 07 bf e8 add %fp, -24, %l3 20164a8: b2 07 bf ec add %fp, -20, %i1 20164ac: b6 07 bf f4 add %fp, -12, %i3 20164b0: a4 07 bf f8 add %fp, -8, %l2 20164b4: 21 00 80 ed sethi %hi(0x203b400), %l0 20164b8: 29 00 80 ed sethi %hi(0x203b400), %l4 20164bc: f2 27 bf e8 st %i1, [ %fp + -24 ] head->previous = NULL; 20164c0: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20164c4: 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; 20164c8: e4 27 bf f4 st %l2, [ %fp + -12 ] head->previous = NULL; 20164cc: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20164d0: f6 27 bf fc st %i3, [ %fp + -4 ] 20164d4: a2 14 60 5c or %l1, 0x5c, %l1 20164d8: b8 06 20 30 add %i0, 0x30, %i4 20164dc: a0 14 23 dc or %l0, 0x3dc, %l0 20164e0: b4 06 20 68 add %i0, 0x68, %i2 20164e4: a8 15 23 50 or %l4, 0x350, %l4 20164e8: ae 06 20 08 add %i0, 8, %l7 20164ec: 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; 20164f0: 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; 20164f4: 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; 20164f8: c2 04 40 00 ld [ %l1 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20164fc: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016500: 94 10 00 1b mov %i3, %o2 2016504: 90 10 00 1c mov %i4, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016508: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201650c: 40 00 13 41 call 201b210 <_Watchdog_Adjust_to_chain> 2016510: 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; 2016514: 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(); 2016518: 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 ) { 201651c: 80 a7 40 0a cmp %i5, %o2 2016520: 18 80 00 2e bgu 20165d8 <_Timer_server_Body+0x13c> 2016524: 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 ) { 2016528: 80 a7 40 0a cmp %i5, %o2 201652c: 0a 80 00 2f bcs 20165e8 <_Timer_server_Body+0x14c> 2016530: 90 10 00 1a mov %i2, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2016534: 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 ); 2016538: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 201653c: 40 00 03 22 call 20171c4 <_Chain_Get> 2016540: 01 00 00 00 nop if ( timer == NULL ) { 2016544: 92 92 20 00 orcc %o0, 0, %o1 2016548: 02 80 00 10 be 2016588 <_Timer_server_Body+0xec> 201654c: 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 ) { 2016550: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2016554: 80 a0 60 01 cmp %g1, 1 2016558: 02 80 00 28 be 20165f8 <_Timer_server_Body+0x15c> 201655c: 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 ) { 2016560: 12 bf ff f6 bne 2016538 <_Timer_server_Body+0x9c> <== NEVER TAKEN 2016564: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016568: 40 00 13 5b call 201b2d4 <_Watchdog_Insert> 201656c: 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 ); 2016570: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016574: 40 00 03 14 call 20171c4 <_Chain_Get> 2016578: 01 00 00 00 nop if ( timer == NULL ) { 201657c: 92 92 20 00 orcc %o0, 0, %o1 2016580: 32 bf ff f5 bne,a 2016554 <_Timer_server_Body+0xb8> <== NEVER TAKEN 2016584: 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 ); 2016588: 7f ff e2 51 call 200eecc 201658c: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2016590: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016594: 80 a0 40 19 cmp %g1, %i1 2016598: 02 80 00 1c be 2016608 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 201659c: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 20165a0: 7f ff e2 4f call 200eedc <== NOT EXECUTED 20165a4: 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; 20165a8: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20165ac: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165b0: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED 20165b4: 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; 20165b8: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165bc: 40 00 13 15 call 201b210 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 20165c0: 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; 20165c4: 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(); 20165c8: 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 ) { 20165cc: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED 20165d0: 08 bf ff d7 bleu 201652c <_Timer_server_Body+0x90> <== NOT EXECUTED 20165d4: 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 ); 20165d8: 90 10 00 1a mov %i2, %o0 20165dc: 40 00 13 0d call 201b210 <_Watchdog_Adjust_to_chain> 20165e0: 94 10 00 1b mov %i3, %o2 20165e4: 30 bf ff d4 b,a 2016534 <_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 ); 20165e8: 92 10 20 01 mov 1, %o1 20165ec: 40 00 12 da call 201b154 <_Watchdog_Adjust> 20165f0: 94 22 80 1d sub %o2, %i5, %o2 20165f4: 30 bf ff d0 b,a 2016534 <_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 ); 20165f8: 90 10 00 1c mov %i4, %o0 20165fc: 40 00 13 36 call 201b2d4 <_Watchdog_Insert> 2016600: 92 02 60 10 add %o1, 0x10, %o1 2016604: 30 bf ff cd b,a 2016538 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 2016608: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 201660c: 7f ff e2 34 call 200eedc 2016610: 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 ) ) { 2016614: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016618: 80 a0 40 12 cmp %g1, %l2 201661c: 12 80 00 0c bne 201664c <_Timer_server_Body+0x1b0> 2016620: 01 00 00 00 nop 2016624: 30 80 00 13 b,a 2016670 <_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; 2016628: 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; 201662c: 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; 2016630: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 2016634: 7f ff e2 2a call 200eedc 2016638: 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 ); 201663c: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 2016640: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2016644: 9f c0 40 00 call %g1 2016648: 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 ); 201664c: 7f ff e2 20 call 200eecc 2016650: 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; 2016654: 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)) 2016658: 80 a7 40 12 cmp %i5, %l2 201665c: 32 bf ff f3 bne,a 2016628 <_Timer_server_Body+0x18c> 2016660: 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 ); 2016664: 7f ff e2 1e call 200eedc 2016668: 01 00 00 00 nop 201666c: 30 bf ff a2 b,a 20164f4 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2016670: 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++; 2016674: c2 05 00 00 ld [ %l4 ], %g1 2016678: 82 00 60 01 inc %g1 201667c: c2 25 00 00 st %g1, [ %l4 ] return _Thread_Dispatch_disable_level; 2016680: c2 05 00 00 ld [ %l4 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016684: d0 06 00 00 ld [ %i0 ], %o0 2016688: 40 00 11 17 call 201aae4 <_Thread_Set_state> 201668c: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2016690: 7f ff ff 5b call 20163fc <_Timer_server_Reset_interval_system_watchdog> 2016694: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016698: 7f ff ff 6d call 201644c <_Timer_server_Reset_tod_system_watchdog> 201669c: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 20166a0: 40 00 0e 91 call 201a0e4 <_Thread_Enable_dispatch> 20166a4: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20166a8: 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; 20166ac: 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 ); 20166b0: 40 00 13 6b call 201b45c <_Watchdog_Remove> 20166b4: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20166b8: 40 00 13 69 call 201b45c <_Watchdog_Remove> 20166bc: 90 10 00 16 mov %l6, %o0 20166c0: 30 bf ff 8d b,a 20164f4 <_Timer_server_Body+0x58> =============================================================================== 020166c4 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20166c4: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20166c8: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20166cc: 80 a0 60 00 cmp %g1, 0 20166d0: 02 80 00 05 be 20166e4 <_Timer_server_Schedule_operation_method+0x20> 20166d4: 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 ); 20166d8: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 20166dc: 40 00 02 a6 call 2017174 <_Chain_Append> 20166e0: 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++; 20166e4: 03 00 80 ed sethi %hi(0x203b400), %g1 20166e8: c4 00 63 50 ld [ %g1 + 0x350 ], %g2 ! 203b750 <_Thread_Dispatch_disable_level> 20166ec: 84 00 a0 01 inc %g2 20166f0: c4 20 63 50 st %g2, [ %g1 + 0x350 ] return _Thread_Dispatch_disable_level; 20166f4: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 20166f8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 20166fc: 80 a0 60 01 cmp %g1, 1 2016700: 02 80 00 28 be 20167a0 <_Timer_server_Schedule_operation_method+0xdc> 2016704: 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 ) { 2016708: 02 80 00 04 be 2016718 <_Timer_server_Schedule_operation_method+0x54><== ALWAYS TAKEN 201670c: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016710: 40 00 0e 75 call 201a0e4 <_Thread_Enable_dispatch> 2016714: 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 ); 2016718: 7f ff e1 ed call 200eecc 201671c: 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; 2016720: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016724: 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 ); 2016728: 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(); 201672c: 03 00 80 ed sethi %hi(0x203b400), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2016730: 80 a0 80 04 cmp %g2, %g4 2016734: 02 80 00 0d be 2016768 <_Timer_server_Schedule_operation_method+0xa4> 2016738: c2 00 63 dc ld [ %g1 + 0x3dc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 201673c: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 if ( snapshot > last_snapshot ) { 2016740: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016744: 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 ) { 2016748: 08 80 00 07 bleu 2016764 <_Timer_server_Schedule_operation_method+0xa0> 201674c: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2016750: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 2016754: 80 a3 c0 03 cmp %o7, %g3 2016758: 08 80 00 03 bleu 2016764 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN 201675c: 88 10 20 00 clr %g4 delta_interval -= delta; 2016760: 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; 2016764: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2016768: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201676c: 7f ff e1 dc call 200eedc 2016770: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016774: 90 06 20 68 add %i0, 0x68, %o0 2016778: 40 00 12 d7 call 201b2d4 <_Watchdog_Insert> 201677c: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2016780: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016784: 80 a0 60 00 cmp %g1, 0 2016788: 12 bf ff e2 bne 2016710 <_Timer_server_Schedule_operation_method+0x4c> 201678c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2016790: 7f ff ff 2f call 201644c <_Timer_server_Reset_tod_system_watchdog> 2016794: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016798: 40 00 0e 53 call 201a0e4 <_Thread_Enable_dispatch> 201679c: 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 ); 20167a0: 7f ff e1 cb call 200eecc 20167a4: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 20167a8: 05 00 80 ee sethi %hi(0x203b800), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20167ac: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 20167b0: c4 00 a0 5c ld [ %g2 + 0x5c ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 20167b4: 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 ); 20167b8: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20167bc: 80 a0 40 03 cmp %g1, %g3 20167c0: 02 80 00 08 be 20167e0 <_Timer_server_Schedule_operation_method+0x11c> 20167c4: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20167c8: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 20167cc: 80 a1 00 0f cmp %g4, %o7 20167d0: 1a 80 00 03 bcc 20167dc <_Timer_server_Schedule_operation_method+0x118> 20167d4: 86 10 20 00 clr %g3 delta_interval -= delta; 20167d8: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 20167dc: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 20167e0: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 20167e4: 7f ff e1 be call 200eedc 20167e8: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20167ec: 90 06 20 30 add %i0, 0x30, %o0 20167f0: 40 00 12 b9 call 201b2d4 <_Watchdog_Insert> 20167f4: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167f8: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20167fc: 80 a0 60 00 cmp %g1, 0 2016800: 12 bf ff c4 bne 2016710 <_Timer_server_Schedule_operation_method+0x4c> 2016804: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2016808: 7f ff fe fd call 20163fc <_Timer_server_Reset_interval_system_watchdog> 201680c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016810: 40 00 0e 35 call 201a0e4 <_Thread_Enable_dispatch> 2016814: 81 e8 00 00 restore =============================================================================== 0200a104 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200a104: 9d e3 bf a0 save %sp, -96, %sp 200a108: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a10c: b8 17 20 a8 or %i4, 0xa8, %i4 ! 201dca8 <_User_extensions_List> 200a110: 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 ); 200a114: 80 a7 40 1c cmp %i5, %i4 200a118: 02 80 00 0d be 200a14c <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200a11c: 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 ) 200a120: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a124: 80 a0 60 00 cmp %g1, 0 200a128: 02 80 00 05 be 200a13c <_User_extensions_Fatal+0x38> 200a12c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200a130: 92 10 00 19 mov %i1, %o1 200a134: 9f c0 40 00 call %g1 200a138: 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 ) { 200a13c: 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 ); 200a140: 80 a7 40 1c cmp %i5, %i4 200a144: 32 bf ff f8 bne,a 200a124 <_User_extensions_Fatal+0x20> 200a148: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a14c: 81 c7 e0 08 ret 200a150: 81 e8 00 00 restore =============================================================================== 02009fb0 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009fb0: 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; 2009fb4: 07 00 80 73 sethi %hi(0x201cc00), %g3 2009fb8: 86 10 e1 5c or %g3, 0x15c, %g3 ! 201cd5c initial_extensions = Configuration.User_extension_table; 2009fbc: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3 2009fc0: 3b 00 80 77 sethi %hi(0x201dc00), %i5 2009fc4: 09 00 80 76 sethi %hi(0x201d800), %g4 2009fc8: 84 17 60 a8 or %i5, 0xa8, %g2 2009fcc: 82 11 22 c4 or %g4, 0x2c4, %g1 2009fd0: b4 00 a0 04 add %g2, 4, %i2 2009fd4: b8 00 60 04 add %g1, 4, %i4 2009fd8: f4 27 60 a8 st %i2, [ %i5 + 0xa8 ] head->previous = NULL; 2009fdc: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 2009fe0: 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; 2009fe4: f8 21 22 c4 st %i4, [ %g4 + 0x2c4 ] head->previous = NULL; 2009fe8: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009fec: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009ff0: 80 a6 e0 00 cmp %i3, 0 2009ff4: 02 80 00 1b be 200a060 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009ff8: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009ffc: 83 2e a0 02 sll %i2, 2, %g1 200a000: b9 2e a0 04 sll %i2, 4, %i4 200a004: b8 27 00 01 sub %i4, %g1, %i4 200a008: b8 07 00 1a add %i4, %i2, %i4 200a00c: 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 *) 200a010: 40 00 01 96 call 200a668 <_Workspace_Allocate_or_fatal_error> 200a014: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200a018: 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 *) 200a01c: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200a020: 40 00 19 34 call 20104f0 200a024: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200a028: 80 a6 a0 00 cmp %i2, 0 200a02c: 02 80 00 0d be 200a060 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200a030: 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; 200a034: 92 10 00 1b mov %i3, %o1 200a038: 94 10 20 20 mov 0x20, %o2 200a03c: 40 00 18 f1 call 2010400 200a040: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 200a044: 40 00 0e e3 call 200dbd0 <_User_extensions_Add_set> 200a048: 90 10 00 1d mov %i5, %o0 200a04c: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200a050: 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++ ) { 200a054: 80 a7 00 1a cmp %i4, %i2 200a058: 12 bf ff f7 bne 200a034 <_User_extensions_Handler_initialization+0x84> 200a05c: b6 06 e0 20 add %i3, 0x20, %i3 200a060: 81 c7 e0 08 ret 200a064: 81 e8 00 00 restore =============================================================================== 0200a068 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 200a068: 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; 200a06c: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a070: fa 07 20 a8 ld [ %i4 + 0xa8 ], %i5 ! 201dca8 <_User_extensions_List> 200a074: b8 17 20 a8 or %i4, 0xa8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a078: b8 07 20 04 add %i4, 4, %i4 200a07c: 80 a7 40 1c cmp %i5, %i4 200a080: 02 80 00 0c be 200a0b0 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200a084: 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 ) 200a088: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200a08c: 80 a0 60 00 cmp %g1, 0 200a090: 02 80 00 04 be 200a0a0 <_User_extensions_Thread_begin+0x38> 200a094: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200a098: 9f c0 40 00 call %g1 200a09c: 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 ) { 200a0a0: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a0a4: 80 a7 40 1c cmp %i5, %i4 200a0a8: 32 bf ff f9 bne,a 200a08c <_User_extensions_Thread_begin+0x24> 200a0ac: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200a0b0: 81 c7 e0 08 ret 200a0b4: 81 e8 00 00 restore =============================================================================== 0200a154 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200a154: 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; 200a158: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a15c: fa 07 20 a8 ld [ %i4 + 0xa8 ], %i5 ! 201dca8 <_User_extensions_List> 200a160: b8 17 20 a8 or %i4, 0xa8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200a164: b8 07 20 04 add %i4, 4, %i4 200a168: 80 a7 40 1c cmp %i5, %i4 200a16c: 02 80 00 12 be 200a1b4 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 200a170: 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)( 200a174: 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 ) { 200a178: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a17c: 80 a0 60 00 cmp %g1, 0 200a180: 02 80 00 08 be 200a1a0 <_User_extensions_Thread_create+0x4c> 200a184: 84 16 e3 f8 or %i3, 0x3f8, %g2 status = (*the_extension->Callouts.thread_create)( 200a188: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a18c: 9f c0 40 00 call %g1 200a190: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200a194: 80 8a 20 ff btst 0xff, %o0 200a198: 02 80 00 0a be 200a1c0 <_User_extensions_Thread_create+0x6c> 200a19c: 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 ) { 200a1a0: 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 ); 200a1a4: 80 a7 40 1c cmp %i5, %i4 200a1a8: 32 bf ff f5 bne,a 200a17c <_User_extensions_Thread_create+0x28> 200a1ac: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200a1b0: 82 10 20 01 mov 1, %g1 } 200a1b4: b0 08 60 01 and %g1, 1, %i0 200a1b8: 81 c7 e0 08 ret 200a1bc: 81 e8 00 00 restore 200a1c0: b0 08 60 01 and %g1, 1, %i0 200a1c4: 81 c7 e0 08 ret 200a1c8: 81 e8 00 00 restore =============================================================================== 0200a1cc <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200a1cc: 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; 200a1d0: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a1d4: b8 17 20 a8 or %i4, 0xa8, %i4 ! 201dca8 <_User_extensions_List> 200a1d8: 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 ); 200a1dc: 80 a7 40 1c cmp %i5, %i4 200a1e0: 02 80 00 0d be 200a214 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200a1e4: 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 ) 200a1e8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a1ec: 80 a0 60 00 cmp %g1, 0 200a1f0: 02 80 00 05 be 200a204 <_User_extensions_Thread_delete+0x38> 200a1f4: 84 16 e3 f8 or %i3, 0x3f8, %g2 (*the_extension->Callouts.thread_delete)( 200a1f8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a1fc: 9f c0 40 00 call %g1 200a200: 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 ) { 200a204: 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 ); 200a208: 80 a7 40 1c cmp %i5, %i4 200a20c: 32 bf ff f8 bne,a 200a1ec <_User_extensions_Thread_delete+0x20> 200a210: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a214: 81 c7 e0 08 ret 200a218: 81 e8 00 00 restore =============================================================================== 0200a0b8 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200a0b8: 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; 200a0bc: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a0c0: b8 17 20 a8 or %i4, 0xa8, %i4 ! 201dca8 <_User_extensions_List> 200a0c4: 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 ); 200a0c8: 80 a7 40 1c cmp %i5, %i4 200a0cc: 02 80 00 0c be 200a0fc <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200a0d0: 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 ) 200a0d4: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200a0d8: 80 a0 60 00 cmp %g1, 0 200a0dc: 02 80 00 04 be 200a0ec <_User_extensions_Thread_exitted+0x34> 200a0e0: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200a0e4: 9f c0 40 00 call %g1 200a0e8: 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 ) { 200a0ec: 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 ); 200a0f0: 80 a7 40 1c cmp %i5, %i4 200a0f4: 32 bf ff f9 bne,a 200a0d8 <_User_extensions_Thread_exitted+0x20> 200a0f8: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200a0fc: 81 c7 e0 08 ret 200a100: 81 e8 00 00 restore =============================================================================== 0200aa5c <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200aa5c: 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; 200aa60: 39 00 80 79 sethi %hi(0x201e400), %i4 200aa64: fa 07 23 c8 ld [ %i4 + 0x3c8 ], %i5 ! 201e7c8 <_User_extensions_List> 200aa68: b8 17 23 c8 or %i4, 0x3c8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aa6c: b8 07 20 04 add %i4, 4, %i4 200aa70: 80 a7 40 1c cmp %i5, %i4 200aa74: 02 80 00 0d be 200aaa8 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200aa78: 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 ) 200aa7c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200aa80: 80 a0 60 00 cmp %g1, 0 200aa84: 02 80 00 05 be 200aa98 <_User_extensions_Thread_restart+0x3c> 200aa88: 84 16 e3 18 or %i3, 0x318, %g2 (*the_extension->Callouts.thread_restart)( 200aa8c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200aa90: 9f c0 40 00 call %g1 200aa94: 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 ) { 200aa98: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aa9c: 80 a7 40 1c cmp %i5, %i4 200aaa0: 32 bf ff f8 bne,a 200aa80 <_User_extensions_Thread_restart+0x24> 200aaa4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200aaa8: 81 c7 e0 08 ret 200aaac: 81 e8 00 00 restore =============================================================================== 0200a21c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200a21c: 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; 200a220: 39 00 80 77 sethi %hi(0x201dc00), %i4 200a224: fa 07 20 a8 ld [ %i4 + 0xa8 ], %i5 ! 201dca8 <_User_extensions_List> 200a228: b8 17 20 a8 or %i4, 0xa8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a22c: b8 07 20 04 add %i4, 4, %i4 200a230: 80 a7 40 1c cmp %i5, %i4 200a234: 02 80 00 0d be 200a268 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200a238: 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 ) 200a23c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a240: 80 a0 60 00 cmp %g1, 0 200a244: 02 80 00 05 be 200a258 <_User_extensions_Thread_start+0x3c> 200a248: 84 16 e3 f8 or %i3, 0x3f8, %g2 (*the_extension->Callouts.thread_start)( 200a24c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a250: 9f c0 40 00 call %g1 200a254: 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 ) { 200a258: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a25c: 80 a7 40 1c cmp %i5, %i4 200a260: 32 bf ff f8 bne,a 200a240 <_User_extensions_Thread_start+0x24> 200a264: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a268: 81 c7 e0 08 ret 200a26c: 81 e8 00 00 restore =============================================================================== 0200a270 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200a270: 9d e3 bf a0 save %sp, -96, %sp 200a274: 39 00 80 76 sethi %hi(0x201d800), %i4 200a278: fa 07 22 c4 ld [ %i4 + 0x2c4 ], %i5 ! 201dac4 <_User_extensions_Switches_list> 200a27c: b8 17 22 c4 or %i4, 0x2c4, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a280: b8 07 20 04 add %i4, 4, %i4 200a284: 80 a7 40 1c cmp %i5, %i4 200a288: 02 80 00 0a be 200a2b0 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200a28c: 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 ); 200a290: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a294: 90 10 00 18 mov %i0, %o0 200a298: 9f c0 40 00 call %g1 200a29c: 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 ) { 200a2a0: 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 ); 200a2a4: 80 a7 40 1c cmp %i5, %i4 200a2a8: 32 bf ff fb bne,a 200a294 <_User_extensions_Thread_switch+0x24> 200a2ac: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a2b0: 81 c7 e0 08 ret 200a2b4: 81 e8 00 00 restore =============================================================================== 0200bd40 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200bd40: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200bd44: 7f ff dc 7b call 2002f30 200bd48: 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; 200bd4c: 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 ); 200bd50: 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 ) ) { 200bd54: 80 a0 40 1b cmp %g1, %i3 200bd58: 02 80 00 1e be 200bdd0 <_Watchdog_Adjust+0x90> 200bd5c: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200bd60: 12 80 00 1e bne 200bdd8 <_Watchdog_Adjust+0x98> 200bd64: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bd68: 80 a6 a0 00 cmp %i2, 0 200bd6c: 02 80 00 19 be 200bdd0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bd70: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bd74: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bd78: 80 a6 80 1c cmp %i2, %i4 200bd7c: 1a 80 00 0a bcc 200bda4 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200bd80: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200bd84: 10 80 00 1c b 200bdf4 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200bd88: 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 ) { 200bd8c: 02 80 00 11 be 200bdd0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bd90: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bd94: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bd98: 80 a7 00 1a cmp %i4, %i2 200bd9c: 38 80 00 16 bgu,a 200bdf4 <_Watchdog_Adjust+0xb4> 200bda0: 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; 200bda4: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200bda8: 7f ff dc 66 call 2002f40 200bdac: 01 00 00 00 nop _Watchdog_Tickle( header ); 200bdb0: 40 00 00 ab call 200c05c <_Watchdog_Tickle> 200bdb4: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200bdb8: 7f ff dc 5e call 2002f30 200bdbc: 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; 200bdc0: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200bdc4: 80 a6 c0 01 cmp %i3, %g1 200bdc8: 32 bf ff f1 bne,a 200bd8c <_Watchdog_Adjust+0x4c> 200bdcc: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200bdd0: 7f ff dc 5c call 2002f40 200bdd4: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bdd8: 12 bf ff fe bne 200bdd0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bddc: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bde0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bde4: b4 00 80 1a add %g2, %i2, %i2 200bde8: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bdec: 7f ff dc 55 call 2002f40 200bdf0: 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; 200bdf4: 10 bf ff f7 b 200bdd0 <_Watchdog_Adjust+0x90> 200bdf8: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200a440 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200a440: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200a444: 7f ff df 68 call 20021e4 200a448: 01 00 00 00 nop previous_state = the_watchdog->state; 200a44c: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200a450: 80 a7 60 01 cmp %i5, 1 200a454: 02 80 00 2a be 200a4fc <_Watchdog_Remove+0xbc> 200a458: 03 00 80 76 sethi %hi(0x201d800), %g1 200a45c: 1a 80 00 09 bcc 200a480 <_Watchdog_Remove+0x40> 200a460: 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; 200a464: 03 00 80 76 sethi %hi(0x201d800), %g1 200a468: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 201dbcc <_Watchdog_Ticks_since_boot> 200a46c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a470: 7f ff df 61 call 20021f4 200a474: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a478: 81 c7 e0 08 ret 200a47c: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200a480: 18 bf ff fa bgu 200a468 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200a484: 03 00 80 76 sethi %hi(0x201d800), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 200a488: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200a48c: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200a490: c4 00 40 00 ld [ %g1 ], %g2 200a494: 80 a0 a0 00 cmp %g2, 0 200a498: 02 80 00 07 be 200a4b4 <_Watchdog_Remove+0x74> 200a49c: 05 00 80 76 sethi %hi(0x201d800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200a4a0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a4a4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200a4a8: 84 00 c0 02 add %g3, %g2, %g2 200a4ac: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200a4b0: 05 00 80 76 sethi %hi(0x201d800), %g2 200a4b4: c4 00 a3 c8 ld [ %g2 + 0x3c8 ], %g2 ! 201dbc8 <_Watchdog_Sync_count> 200a4b8: 80 a0 a0 00 cmp %g2, 0 200a4bc: 22 80 00 07 be,a 200a4d8 <_Watchdog_Remove+0x98> 200a4c0: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200a4c4: 05 00 80 78 sethi %hi(0x201e000), %g2 200a4c8: c6 00 a0 00 ld [ %g2 ], %g3 200a4cc: 05 00 80 76 sethi %hi(0x201d800), %g2 200a4d0: c6 20 a3 68 st %g3, [ %g2 + 0x368 ] ! 201db68 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200a4d4: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200a4d8: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200a4dc: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a4e0: 03 00 80 76 sethi %hi(0x201d800), %g1 200a4e4: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 201dbcc <_Watchdog_Ticks_since_boot> 200a4e8: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a4ec: 7f ff df 42 call 20021f4 200a4f0: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a4f4: 81 c7 e0 08 ret 200a4f8: 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; 200a4fc: c2 00 63 cc ld [ %g1 + 0x3cc ], %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; 200a500: 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; 200a504: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a508: 7f ff df 3b call 20021f4 200a50c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a510: 81 c7 e0 08 ret 200a514: 81 e8 00 00 restore =============================================================================== 0200b55c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b55c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b560: 7f ff dd 55 call 2002ab4 200b564: 01 00 00 00 nop 200b568: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200b56c: 11 00 80 76 sethi %hi(0x201d800), %o0 200b570: 94 10 00 19 mov %i1, %o2 200b574: 92 10 00 18 mov %i0, %o1 200b578: 7f ff e4 6d call 200472c 200b57c: 90 12 20 a0 or %o0, 0xa0, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b580: 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 ); 200b584: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200b588: 80 a7 00 19 cmp %i4, %i1 200b58c: 02 80 00 0f be 200b5c8 <_Watchdog_Report_chain+0x6c> 200b590: 11 00 80 76 sethi %hi(0x201d800), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b594: 92 10 00 1c mov %i4, %o1 200b598: 40 00 00 0f call 200b5d4 <_Watchdog_Report> 200b59c: 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 ) 200b5a0: 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 ) ; 200b5a4: 80 a7 00 19 cmp %i4, %i1 200b5a8: 12 bf ff fc bne 200b598 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b5ac: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b5b0: 11 00 80 76 sethi %hi(0x201d800), %o0 200b5b4: 92 10 00 18 mov %i0, %o1 200b5b8: 7f ff e4 5d call 200472c 200b5bc: 90 12 20 b8 or %o0, 0xb8, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b5c0: 7f ff dd 41 call 2002ac4 200b5c4: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b5c8: 7f ff e4 59 call 200472c 200b5cc: 90 12 20 c8 or %o0, 0xc8, %o0 200b5d0: 30 bf ff fc b,a 200b5c0 <_Watchdog_Report_chain+0x64> =============================================================================== 0200646c : int adjtime( struct timeval *delta, struct timeval *olddelta ) { 200646c: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2006470: ba 96 20 00 orcc %i0, 0, %i5 2006474: 02 80 00 54 be 20065c4 2006478: 03 00 03 d0 sethi %hi(0xf4000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 200647c: c4 07 60 04 ld [ %i5 + 4 ], %g2 2006480: 82 10 62 3f or %g1, 0x23f, %g1 2006484: 80 a0 80 01 cmp %g2, %g1 2006488: 18 80 00 4f bgu 20065c4 200648c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 2006490: 22 80 00 06 be,a 20064a8 2006494: c2 07 40 00 ld [ %i5 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 2006498: c0 26 60 04 clr [ %i1 + 4 ] 200649c: 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; 20064a0: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 20064a4: c2 07 40 00 ld [ %i5 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 20064a8: 07 00 80 63 sethi %hi(0x2018c00), %g3 20064ac: c8 00 e0 18 ld [ %g3 + 0x18 ], %g4 ! 2018c18 olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 20064b0: 9f 28 60 08 sll %g1, 8, %o7 20064b4: 87 28 60 03 sll %g1, 3, %g3 20064b8: 86 23 c0 03 sub %o7, %g3, %g3 20064bc: 9f 28 e0 06 sll %g3, 6, %o7 20064c0: 86 23 c0 03 sub %o7, %g3, %g3 20064c4: 82 00 c0 01 add %g3, %g1, %g1 20064c8: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 20064cc: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 20064d0: 80 a0 80 04 cmp %g2, %g4 20064d4: 0a 80 00 3a bcs 20065bc 20064d8: 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++; 20064dc: 03 00 80 66 sethi %hi(0x2019800), %g1 20064e0: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 2019a70 <_Thread_Dispatch_disable_level> 20064e4: 84 00 a0 01 inc %g2 20064e8: c4 20 62 70 st %g2, [ %g1 + 0x270 ] return _Thread_Dispatch_disable_level; 20064ec: c2 00 62 70 ld [ %g1 + 0x270 ], %g1 * This prevents context switches while we are adjusting the TOD */ _Thread_Disable_dispatch(); _TOD_Get( &ts ); 20064f0: 40 00 06 70 call 2007eb0 <_TOD_Get> 20064f4: 90 07 bf f8 add %fp, -8, %o0 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 20064f8: c2 07 60 04 ld [ %i5 + 4 ], %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 20064fc: c8 07 bf f8 ld [ %fp + -8 ], %g4 2006500: c4 07 40 00 ld [ %i5 ], %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2006504: 87 28 60 02 sll %g1, 2, %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2006508: 84 01 00 02 add %g4, %g2, %g2 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 200650c: 89 28 60 07 sll %g1, 7, %g4 2006510: 86 21 00 03 sub %g4, %g3, %g3 2006514: 82 00 c0 01 add %g3, %g1, %g1 2006518: c6 07 bf fc ld [ %fp + -4 ], %g3 200651c: 83 28 60 03 sll %g1, 3, %g1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2006520: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2006524: 82 00 40 03 add %g1, %g3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2006528: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 200652c: 86 10 e1 ff or %g3, 0x1ff, %g3 ! 3b9ac9ff 2006530: 80 a0 40 03 cmp %g1, %g3 2006534: 08 80 00 0a bleu 200655c 2006538: c2 27 bf fc st %g1, [ %fp + -4 ] ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200653c: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006540: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 2006544: 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 ) { 2006548: 80 a0 40 03 cmp %g1, %g3 200654c: 18 bf ff fe bgu 2006544 <== NEVER TAKEN 2006550: 84 00 a0 01 inc %g2 2006554: c2 27 bf fc st %g1, [ %fp + -4 ] 2006558: 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) ) { 200655c: 09 31 19 4d sethi %hi(0xc4653400), %g4 2006560: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 2006564: 80 a0 40 04 cmp %g1, %g4 2006568: 18 80 00 0a bgu 2006590 <== NEVER TAKEN 200656c: c4 07 bf f8 ld [ %fp + -8 ], %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2006570: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 2006574: 86 10 e2 00 or %g3, 0x200, %g3 ! 3b9aca00 2006578: 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) ) { 200657c: 80 a0 40 04 cmp %g1, %g4 2006580: 08 bf ff fe bleu 2006578 2006584: 84 00 bf ff add %g2, -1, %g2 2006588: c2 27 bf fc st %g1, [ %fp + -4 ] 200658c: c4 27 bf f8 st %g2, [ %fp + -8 ] ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; ts.tv_sec--; } _TOD_Set( &ts ); 2006590: 40 00 06 72 call 2007f58 <_TOD_Set> 2006594: 90 07 bf f8 add %fp, -8, %o0 _Thread_Enable_dispatch(); 2006598: 40 00 0d 0f call 20099d4 <_Thread_Enable_dispatch> 200659c: b0 10 20 00 clr %i0 /* set the user's output */ if ( olddelta ) 20065a0: 80 a6 60 00 cmp %i1, 0 20065a4: 02 80 00 0c be 20065d4 20065a8: 01 00 00 00 nop *olddelta = *delta; 20065ac: c2 07 40 00 ld [ %i5 ], %g1 20065b0: c2 26 40 00 st %g1, [ %i1 ] 20065b4: c2 07 60 04 ld [ %i5 + 4 ], %g1 20065b8: c2 26 60 04 st %g1, [ %i1 + 4 ] return 0; } 20065bc: 81 c7 e0 08 ret 20065c0: 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 ); 20065c4: 40 00 26 fb call 20101b0 <__errno> 20065c8: b0 10 3f ff mov -1, %i0 20065cc: 82 10 20 16 mov 0x16, %g1 20065d0: c2 22 00 00 st %g1, [ %o0 ] 20065d4: 81 c7 e0 08 ret 20065d8: 81 e8 00 00 restore =============================================================================== 02006cd8 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2006cd8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2006cdc: 3b 00 80 67 sethi %hi(0x2019c00), %i5 2006ce0: 40 00 04 91 call 2007f24 2006ce4: 90 17 60 fc or %i5, 0xfc, %o0 ! 2019cfc if (fcntl (fildes, F_GETFD) < 0) { 2006ce8: 90 10 00 18 mov %i0, %o0 2006cec: 40 00 1e 9c call 200e75c 2006cf0: 92 10 20 01 mov 1, %o1 2006cf4: 80 a2 20 00 cmp %o0, 0 2006cf8: 06 80 00 6c bl 2006ea8 2006cfc: 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) { 2006d00: 02 80 00 3b be 2006dec 2006d04: 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) { 2006d08: f8 06 40 00 ld [ %i1 ], %i4 2006d0c: 80 a7 00 18 cmp %i4, %i0 2006d10: 12 80 00 2f bne 2006dcc 2006d14: 90 17 60 fc or %i5, 0xfc, %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); 2006d18: 92 10 00 1c mov %i4, %o1 2006d1c: 11 00 80 67 sethi %hi(0x2019c00), %o0 2006d20: 94 10 20 00 clr %o2 2006d24: 40 00 00 cc call 2007054 2006d28: 90 12 21 44 or %o0, 0x144, %o0 if (r_chain == NULL) { 2006d2c: b0 92 20 00 orcc %o0, 0, %i0 2006d30: 22 80 00 0f be,a 2006d6c 2006d34: ba 17 60 fc or %i5, 0xfc, %i5 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006d38: b8 06 20 1c add %i0, 0x1c, %i4 2006d3c: 40 00 04 7a call 2007f24 2006d40: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006d44: 92 10 00 19 mov %i1, %o1 2006d48: 40 00 01 e4 call 20074d8 2006d4c: 90 06 20 08 add %i0, 8, %o0 2006d50: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2006d54: 40 00 04 94 call 2007fa4 2006d58: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006d5c: 40 00 04 92 call 2007fa4 2006d60: 90 17 60 fc or %i5, 0xfc, %o0 return result; } return AIO_ALLDONE; } 2006d64: 81 c7 e0 08 ret 2006d68: 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)) { 2006d6c: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006d70: 82 07 60 58 add %i5, 0x58, %g1 2006d74: 80 a0 80 01 cmp %g2, %g1 2006d78: 02 80 00 0f be 2006db4 <== NEVER TAKEN 2006d7c: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006d80: 92 10 00 1c mov %i4, %o1 2006d84: 40 00 00 b4 call 2007054 2006d88: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006d8c: 80 a2 20 00 cmp %o0, 0 2006d90: 02 80 00 0e be 2006dc8 2006d94: 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); 2006d98: 40 00 01 d0 call 20074d8 2006d9c: 90 02 20 08 add %o0, 8, %o0 2006da0: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006da4: 40 00 04 80 call 2007fa4 2006da8: 90 10 00 1d mov %i5, %o0 return result; 2006dac: 81 c7 e0 08 ret 2006db0: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006db4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006db8: 40 00 04 7b call 2007fa4 2006dbc: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006dc0: 81 c7 e0 08 ret 2006dc4: 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); 2006dc8: 90 10 00 1d mov %i5, %o0 2006dcc: 40 00 04 76 call 2007fa4 2006dd0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2006dd4: 40 00 2c e4 call 2012164 <__errno> 2006dd8: 01 00 00 00 nop 2006ddc: 82 10 20 16 mov 0x16, %g1 ! 16 2006de0: c2 22 00 00 st %g1, [ %o0 ] 2006de4: 81 c7 e0 08 ret 2006de8: 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); 2006dec: 11 00 80 67 sethi %hi(0x2019c00), %o0 2006df0: 94 10 20 00 clr %o2 2006df4: 40 00 00 98 call 2007054 2006df8: 90 12 21 44 or %o0, 0x144, %o0 if (r_chain == NULL) { 2006dfc: b8 92 20 00 orcc %o0, 0, %i4 2006e00: 02 80 00 0f be 2006e3c 2006e04: b2 07 20 1c add %i4, 0x1c, %i1 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006e08: 40 00 04 47 call 2007f24 2006e0c: 90 10 00 19 mov %i1, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006e10: 40 00 0b 08 call 2009a30 <_Chain_Extract> 2006e14: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006e18: 40 00 01 9c call 2007488 2006e1c: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2006e20: 40 00 04 61 call 2007fa4 2006e24: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006e28: 90 17 60 fc or %i5, 0xfc, %o0 2006e2c: 40 00 04 5e call 2007fa4 2006e30: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006e34: 81 c7 e0 08 ret 2006e38: 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; 2006e3c: ba 17 60 fc or %i5, 0xfc, %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)) { 2006e40: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2006e44: 82 07 60 58 add %i5, 0x58, %g1 2006e48: 80 a0 80 01 cmp %g2, %g1 2006e4c: 02 bf ff da be 2006db4 <== NEVER TAKEN 2006e50: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2006e54: 92 10 00 18 mov %i0, %o1 2006e58: 40 00 00 7f call 2007054 2006e5c: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006e60: b8 92 20 00 orcc %o0, 0, %i4 2006e64: 22 bf ff d5 be,a 2006db8 2006e68: 90 10 00 1d mov %i5, %o0 2006e6c: 40 00 0a f1 call 2009a30 <_Chain_Extract> 2006e70: 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); 2006e74: 40 00 01 85 call 2007488 2006e78: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006e7c: 40 00 03 7f call 2007c78 2006e80: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 2006e84: 40 00 02 9e call 20078fc 2006e88: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006e8c: 7f ff f2 0a call 20036b4 2006e90: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2006e94: 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); 2006e98: 40 00 04 43 call 2007fa4 2006e9c: 90 10 00 1d mov %i5, %o0 return AIO_CANCELED; 2006ea0: 81 c7 e0 08 ret 2006ea4: 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); 2006ea8: 40 00 04 3f call 2007fa4 2006eac: 90 17 60 fc or %i5, 0xfc, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2006eb0: 40 00 2c ad call 2012164 <__errno> 2006eb4: b0 10 3f ff mov -1, %i0 2006eb8: 82 10 20 09 mov 9, %g1 2006ebc: c2 22 00 00 st %g1, [ %o0 ] 2006ec0: 81 c7 e0 08 ret 2006ec4: 81 e8 00 00 restore =============================================================================== 02006ed0 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2006ed0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2006ed4: 03 00 00 08 sethi %hi(0x2000), %g1 2006ed8: 80 a6 00 01 cmp %i0, %g1 2006edc: 12 80 00 14 bne 2006f2c 2006ee0: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006ee4: d0 06 40 00 ld [ %i1 ], %o0 2006ee8: 40 00 1e 1d call 200e75c 2006eec: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2006ef0: 90 0a 20 03 and %o0, 3, %o0 2006ef4: 90 02 3f ff add %o0, -1, %o0 2006ef8: 80 a2 20 01 cmp %o0, 1 2006efc: 18 80 00 0c bgu 2006f2c 2006f00: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2006f04: 7f ff f3 76 call 2003cdc 2006f08: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2006f0c: 80 a2 20 00 cmp %o0, 0 2006f10: 02 80 00 06 be 2006f28 <== NEVER TAKEN 2006f14: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2006f18: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2006f1c: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2006f20: 40 00 01 8a call 2007548 2006f24: 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); 2006f28: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2006f2c: 82 10 3f ff mov -1, %g1 2006f30: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2006f34: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2006f38: 40 00 2c 8b call 2012164 <__errno> 2006f3c: b0 10 3f ff mov -1, %i0 2006f40: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2006f44: 81 c7 e0 08 ret 2006f48: 81 e8 00 00 restore =============================================================================== 0200772c : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 200772c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007730: d0 06 00 00 ld [ %i0 ], %o0 2007734: 40 00 1c 0a call 200e75c 2007738: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 200773c: 90 0a 20 03 and %o0, 3, %o0 2007740: 80 a2 20 02 cmp %o0, 2 2007744: 12 80 00 1b bne 20077b0 2007748: 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) 200774c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2007750: 80 a0 60 00 cmp %g1, 0 2007754: 12 80 00 0f bne 2007790 2007758: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 200775c: c2 06 20 08 ld [ %i0 + 8 ], %g1 2007760: 80 a0 60 00 cmp %g1, 0 2007764: 06 80 00 0c bl 2007794 2007768: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 200776c: 7f ff f1 5c call 2003cdc 2007770: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007774: 80 a2 20 00 cmp %o0, 0 2007778: 02 80 00 12 be 20077c0 <== NEVER TAKEN 200777c: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2007780: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2007784: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007788: 7f ff ff 70 call 2007548 200778c: 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); 2007790: 82 10 3f ff mov -1, %g1 2007794: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007798: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 200779c: 40 00 2a 72 call 2012164 <__errno> 20077a0: b0 10 3f ff mov -1, %i0 20077a4: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 20077a8: 81 c7 e0 08 ret 20077ac: 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))) 20077b0: 02 bf ff e7 be 200774c <== NEVER TAKEN 20077b4: 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); 20077b8: 10 bf ff f7 b 2007794 20077bc: 82 10 3f ff mov -1, %g1 20077c0: 10 bf ff f4 b 2007790 <== NOT EXECUTED 20077c4: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 020077d0 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 20077d0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20077d4: d0 06 00 00 ld [ %i0 ], %o0 20077d8: 40 00 1b e1 call 200e75c 20077dc: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20077e0: 90 0a 20 03 and %o0, 3, %o0 20077e4: 90 02 3f ff add %o0, -1, %o0 20077e8: 80 a2 20 01 cmp %o0, 1 20077ec: 18 80 00 14 bgu 200783c 20077f0: 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) 20077f4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20077f8: 80 a0 60 00 cmp %g1, 0 20077fc: 12 80 00 10 bne 200783c 2007800: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007804: c2 06 20 08 ld [ %i0 + 8 ], %g1 2007808: 80 a0 60 00 cmp %g1, 0 200780c: 06 80 00 0d bl 2007840 2007810: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007814: 7f ff f1 32 call 2003cdc 2007818: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 200781c: 80 a2 20 00 cmp %o0, 0 2007820: 02 80 00 06 be 2007838 <== NEVER TAKEN 2007824: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2007828: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 200782c: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007830: 7f ff ff 46 call 2007548 2007834: 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); 2007838: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 200783c: 82 10 3f ff mov -1, %g1 2007840: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2007844: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2007848: 40 00 2a 47 call 2012164 <__errno> 200784c: b0 10 3f ff mov -1, %i0 2007850: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2007854: 81 c7 e0 08 ret 2007858: 81 e8 00 00 restore =============================================================================== 020062d4 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 20062d4: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 20062d8: 80 a6 60 00 cmp %i1, 0 20062dc: 02 80 00 20 be 200635c 20062e0: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 20062e4: 02 80 00 19 be 2006348 20062e8: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 20062ec: 02 80 00 12 be 2006334 <== NEVER TAKEN 20062f0: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 20062f4: 02 80 00 10 be 2006334 20062f8: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 20062fc: 02 80 00 08 be 200631c 2006300: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2006304: 40 00 29 34 call 20107d4 <__errno> 2006308: b0 10 3f ff mov -1, %i0 ! ffffffff 200630c: 82 10 20 16 mov 0x16, %g1 2006310: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2006314: 81 c7 e0 08 ret 2006318: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 200631c: 40 00 29 2e call 20107d4 <__errno> 2006320: b0 10 3f ff mov -1, %i0 2006324: 82 10 20 58 mov 0x58, %g1 2006328: c2 22 00 00 st %g1, [ %o0 ] 200632c: 81 c7 e0 08 ret 2006330: 81 e8 00 00 restore } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { _TOD_Get_uptime_as_timespec( tp ); 2006334: 90 10 00 19 mov %i1, %o0 2006338: 40 00 08 3b call 2008424 <_TOD_Get_uptime_as_timespec> 200633c: b0 10 20 00 clr %i0 return 0; 2006340: 81 c7 e0 08 ret 2006344: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); 2006348: 90 10 00 19 mov %i1, %o0 200634c: 40 00 08 1b call 20083b8 <_TOD_Get> 2006350: b0 10 20 00 clr %i0 return 0; 2006354: 81 c7 e0 08 ret 2006358: 81 e8 00 00 restore clockid_t clock_id, struct timespec *tp ) { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); 200635c: 40 00 29 1e call 20107d4 <__errno> 2006360: b0 10 3f ff mov -1, %i0 2006364: 82 10 20 16 mov 0x16, %g1 2006368: c2 22 00 00 st %g1, [ %o0 ] 200636c: 81 c7 e0 08 ret 2006370: 81 e8 00 00 restore =============================================================================== 02006374 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2006374: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2006378: 80 a6 60 00 cmp %i1, 0 200637c: 02 80 00 25 be 2006410 <== NEVER TAKEN 2006380: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2006384: 02 80 00 0c be 20063b4 2006388: 80 a6 20 02 cmp %i0, 2 _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) 200638c: 02 80 00 1b be 20063f8 2006390: 80 a6 20 03 cmp %i0, 3 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2006394: 02 80 00 19 be 20063f8 2006398: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 200639c: 40 00 29 0e call 20107d4 <__errno> 20063a0: b0 10 3f ff mov -1, %i0 ! ffffffff 20063a4: 82 10 20 16 mov 0x16, %g1 20063a8: c2 22 00 00 st %g1, [ %o0 ] return 0; } 20063ac: 81 c7 e0 08 ret 20063b0: 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 ) 20063b4: c4 06 40 00 ld [ %i1 ], %g2 20063b8: 03 08 76 b9 sethi %hi(0x21dae400), %g1 20063bc: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 20063c0: 80 a0 80 01 cmp %g2, %g1 20063c4: 08 80 00 13 bleu 2006410 20063c8: 03 00 80 69 sethi %hi(0x201a400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20063cc: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 201a620 <_Thread_Dispatch_disable_level> 20063d0: 84 00 a0 01 inc %g2 20063d4: c4 20 62 20 st %g2, [ %g1 + 0x220 ] return _Thread_Dispatch_disable_level; 20063d8: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); 20063dc: 90 10 00 19 mov %i1, %o0 20063e0: 40 00 08 29 call 2008484 <_TOD_Set> 20063e4: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20063e8: 40 00 0e c6 call 2009f00 <_Thread_Enable_dispatch> 20063ec: 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; 20063f0: 81 c7 e0 08 ret 20063f4: 81 e8 00 00 restore else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 20063f8: 40 00 28 f7 call 20107d4 <__errno> 20063fc: b0 10 3f ff mov -1, %i0 2006400: 82 10 20 58 mov 0x58, %g1 2006404: c2 22 00 00 st %g1, [ %o0 ] 2006408: 81 c7 e0 08 ret 200640c: 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 ); 2006410: 40 00 28 f1 call 20107d4 <__errno> 2006414: b0 10 3f ff mov -1, %i0 2006418: 82 10 20 16 mov 0x16, %g1 200641c: c2 22 00 00 st %g1, [ %o0 ] 2006420: 81 c7 e0 08 ret 2006424: 81 e8 00 00 restore =============================================================================== 0201a4a8 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201a4a8: 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() ) 201a4ac: 7f ff fe e2 call 201a034 201a4b0: 01 00 00 00 nop 201a4b4: 80 a2 00 18 cmp %o0, %i0 201a4b8: 12 80 00 af bne 201a774 201a4bc: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201a4c0: 02 80 00 b3 be 201a78c 201a4c4: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a4c8: 80 a0 60 1f cmp %g1, 0x1f 201a4cc: 18 80 00 b0 bgu 201a78c 201a4d0: 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 ) 201a4d4: 39 00 80 78 sethi %hi(0x201e000), %i4 201a4d8: a1 2e 60 04 sll %i1, 4, %l0 201a4dc: b8 17 20 50 or %i4, 0x50, %i4 201a4e0: 84 24 00 1b sub %l0, %i3, %g2 201a4e4: 84 07 00 02 add %i4, %g2, %g2 201a4e8: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201a4ec: 80 a0 a0 01 cmp %g2, 1 201a4f0: 02 80 00 3f be 201a5ec 201a4f4: 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 ) ) 201a4f8: 80 a6 60 04 cmp %i1, 4 201a4fc: 02 80 00 3e be 201a5f4 201a500: 80 a6 60 08 cmp %i1, 8 201a504: 02 80 00 3c be 201a5f4 201a508: 80 a6 60 0b cmp %i1, 0xb 201a50c: 02 80 00 3a be 201a5f4 201a510: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201a514: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201a518: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201a51c: 80 a6 a0 00 cmp %i2, 0 201a520: 02 80 00 3b be 201a60c 201a524: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201a528: c2 06 80 00 ld [ %i2 ], %g1 201a52c: 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++; 201a530: 03 00 80 76 sethi %hi(0x201d800), %g1 201a534: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201dac0 <_Thread_Dispatch_disable_level> 201a538: 84 00 a0 01 inc %g2 201a53c: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 201a540: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %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; 201a544: 03 00 80 78 sethi %hi(0x201e000), %g1 201a548: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 201e004 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201a54c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201a550: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201a554: 80 af 40 01 andncc %i5, %g1, %g0 201a558: 12 80 00 16 bne 201a5b0 201a55c: 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; 201a560: d0 00 e1 dc ld [ %g3 + 0x1dc ], %o0 ! 201e1dc <_POSIX_signals_Wait_queue> 201a564: 86 10 e1 dc or %g3, 0x1dc, %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 ); 201a568: 86 00 e0 04 add %g3, 4, %g3 201a56c: 80 a2 00 03 cmp %o0, %g3 201a570: 32 80 00 0d bne,a 201a5a4 201a574: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a578: 10 80 00 27 b 201a614 201a57c: 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) 201a580: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1 201a584: 80 af 40 01 andncc %i5, %g1, %g0 201a588: 12 80 00 0b bne 201a5b4 201a58c: 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 ) { 201a590: 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 ); 201a594: 80 a2 00 03 cmp %o0, %g3 201a598: 02 80 00 1f be 201a614 <== ALWAYS TAKEN 201a59c: 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) 201a5a0: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 201a5a4: 80 8f 40 01 btst %i5, %g1 201a5a8: 02 bf ff f6 be 201a580 201a5ac: 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 ) ) { 201a5b0: 92 10 00 19 mov %i1, %o1 201a5b4: 40 00 00 8d call 201a7e8 <_POSIX_signals_Unblock_thread> 201a5b8: 94 07 bf f4 add %fp, -12, %o2 201a5bc: 80 8a 20 ff btst 0xff, %o0 201a5c0: 12 80 00 5a bne 201a728 201a5c4: 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 ); 201a5c8: 40 00 00 7f call 201a7c4 <_POSIX_signals_Set_process_signals> 201a5cc: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201a5d0: b6 24 00 1b sub %l0, %i3, %i3 201a5d4: c2 07 00 1b ld [ %i4 + %i3 ], %g1 201a5d8: 80 a0 60 02 cmp %g1, 2 201a5dc: 02 80 00 57 be 201a738 201a5e0: 11 00 80 78 sethi %hi(0x201e000), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 201a5e4: 7f ff bb 76 call 20093bc <_Thread_Enable_dispatch> 201a5e8: b0 10 20 00 clr %i0 return 0; } 201a5ec: 81 c7 e0 08 ret 201a5f0: 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 ); 201a5f4: 40 00 01 0f call 201aa30 201a5f8: 01 00 00 00 nop 201a5fc: 40 00 00 d2 call 201a944 201a600: 92 10 00 19 mov %i1, %o1 201a604: 81 c7 e0 08 ret 201a608: 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; 201a60c: 10 bf ff c9 b 201a530 201a610: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201a614: c8 08 61 9c ldub [ %g1 + 0x19c ], %g4 201a618: 1b 00 80 76 sethi %hi(0x201d800), %o5 201a61c: 88 01 20 01 inc %g4 201a620: 9a 13 62 30 or %o5, 0x230, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201a624: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201a628: 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); 201a62c: 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 ] ) 201a630: c2 03 40 00 ld [ %o5 ], %g1 201a634: 80 a0 60 00 cmp %g1, 0 201a638: 22 80 00 31 be,a 201a6fc <== NEVER TAKEN 201a63c: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201a640: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201a644: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a648: 80 a6 a0 00 cmp %i2, 0 201a64c: 02 80 00 2b be 201a6f8 201a650: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 201a654: 82 10 20 01 mov 1, %g1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201a658: 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 ]; 201a65c: c4 06 00 02 ld [ %i0 + %g2 ], %g2 if ( !the_thread ) 201a660: 80 a0 a0 00 cmp %g2, 0 201a664: 22 80 00 22 be,a 201a6ec 201a668: 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 ) 201a66c: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 201a670: 80 a0 c0 04 cmp %g3, %g4 201a674: 38 80 00 1e bgu,a 201a6ec 201a678: 82 00 60 01 inc %g1 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201a67c: de 00 a1 5c ld [ %g2 + 0x15c ], %o7 201a680: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201a684: 80 af 40 0f andncc %i5, %o7, %g0 201a688: 22 80 00 19 be,a 201a6ec 201a68c: 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 ) { 201a690: 80 a0 c0 04 cmp %g3, %g4 201a694: 2a 80 00 14 bcs,a 201a6e4 201a698: 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 ) ) { 201a69c: 80 a2 20 00 cmp %o0, 0 201a6a0: 22 80 00 13 be,a 201a6ec <== NEVER TAKEN 201a6a4: 82 00 60 01 inc %g1 <== NOT EXECUTED 201a6a8: de 02 20 10 ld [ %o0 + 0x10 ], %o7 201a6ac: 80 a3 e0 00 cmp %o7, 0 201a6b0: 22 80 00 0f be,a 201a6ec <== NEVER TAKEN 201a6b4: 82 00 60 01 inc %g1 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201a6b8: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3 201a6bc: 80 a2 e0 00 cmp %o3, 0 201a6c0: 22 80 00 09 be,a 201a6e4 201a6c4: 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) ) { 201a6c8: 80 8b c0 0a btst %o7, %o2 201a6cc: 32 80 00 08 bne,a 201a6ec 201a6d0: 82 00 60 01 inc %g1 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201a6d4: 80 8a c0 0a btst %o3, %o2 201a6d8: 22 80 00 05 be,a 201a6ec 201a6dc: 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 ) ) { 201a6e0: 88 10 00 03 mov %g3, %g4 201a6e4: 90 10 00 02 mov %g2, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201a6e8: 82 00 60 01 inc %g1 201a6ec: 80 a6 80 01 cmp %i2, %g1 201a6f0: 1a bf ff db bcc 201a65c 201a6f4: 85 28 60 02 sll %g1, 2, %g2 201a6f8: 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++) { 201a6fc: 80 a3 40 0c cmp %o5, %o4 201a700: 32 bf ff cd bne,a 201a634 201a704: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201a708: 80 a2 20 00 cmp %o0, 0 201a70c: 02 bf ff af be 201a5c8 201a710: 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 ) ) { 201a714: 40 00 00 35 call 201a7e8 <_POSIX_signals_Unblock_thread> 201a718: 94 07 bf f4 add %fp, -12, %o2 201a71c: 80 8a 20 ff btst 0xff, %o0 201a720: 02 bf ff aa be 201a5c8 <== ALWAYS TAKEN 201a724: 01 00 00 00 nop _Thread_Enable_dispatch(); 201a728: 7f ff bb 25 call 20093bc <_Thread_Enable_dispatch> 201a72c: b0 10 20 00 clr %i0 ! 0 return 0; 201a730: 81 c7 e0 08 ret 201a734: 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 *) 201a738: 7f ff b3 49 call 200745c <_Chain_Get> 201a73c: 90 12 21 d0 or %o0, 0x1d0, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201a740: 92 92 20 00 orcc %o0, 0, %o1 201a744: 02 80 00 18 be 201a7a4 201a748: 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 ); 201a74c: 11 00 80 78 sethi %hi(0x201e000), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201a750: c2 22 60 08 st %g1, [ %o1 + 8 ] 201a754: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a758: 90 12 22 48 or %o0, 0x248, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201a75c: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201a760: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201a764: 90 02 00 1b add %o0, %i3, %o0 201a768: 7f ff b3 29 call 200740c <_Chain_Append> 201a76c: c2 22 60 10 st %g1, [ %o1 + 0x10 ] 201a770: 30 bf ff 9d b,a 201a5e4 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201a774: 7f ff d4 c7 call 200fa90 <__errno> 201a778: b0 10 3f ff mov -1, %i0 201a77c: 82 10 20 03 mov 3, %g1 201a780: c2 22 00 00 st %g1, [ %o0 ] 201a784: 81 c7 e0 08 ret 201a788: 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 ); 201a78c: 7f ff d4 c1 call 200fa90 <__errno> 201a790: b0 10 3f ff mov -1, %i0 201a794: 82 10 20 16 mov 0x16, %g1 201a798: c2 22 00 00 st %g1, [ %o0 ] 201a79c: 81 c7 e0 08 ret 201a7a0: 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(); 201a7a4: 7f ff bb 06 call 20093bc <_Thread_Enable_dispatch> 201a7a8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201a7ac: 7f ff d4 b9 call 200fa90 <__errno> 201a7b0: 01 00 00 00 nop 201a7b4: 82 10 20 0b mov 0xb, %g1 ! b 201a7b8: c2 22 00 00 st %g1, [ %o0 ] 201a7bc: 81 c7 e0 08 ret 201a7c0: 81 e8 00 00 restore =============================================================================== 0200b434 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 200b434: 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++; 200b438: 03 00 80 9e sethi %hi(0x2027800), %g1 200b43c: c4 00 62 40 ld [ %g1 + 0x240 ], %g2 ! 2027a40 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200b440: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 200b444: 84 00 a0 01 inc %g2 200b448: c4 20 62 40 st %g2, [ %g1 + 0x240 ] return _Thread_Dispatch_disable_level; 200b44c: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 200b450: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200b454: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 200b458: 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 ) { 200b45c: a0 8e 62 00 andcc %i1, 0x200, %l0 200b460: 12 80 00 34 bne 200b530 200b464: 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 *) 200b468: 39 00 80 9f sethi %hi(0x2027c00), %i4 200b46c: 40 00 0c 6c call 200e61c <_Objects_Allocate> 200b470: 90 17 23 0c or %i4, 0x30c, %o0 ! 2027f0c <_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 ) { 200b474: ba 92 20 00 orcc %o0, 0, %i5 200b478: 02 80 00 37 be 200b554 <== NEVER TAKEN 200b47c: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 200b480: f2 27 60 14 st %i1, [ %i5 + 0x14 ] status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id ); 200b484: 90 10 00 18 mov %i0, %o0 200b488: 40 00 1e e3 call 2013014 <_POSIX_Message_queue_Name_to_id> 200b48c: 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 ) { 200b490: b6 92 20 00 orcc %o0, 0, %i3 200b494: 22 80 00 0f be,a 200b4d0 200b498: 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) ) ) { 200b49c: 80 a6 e0 02 cmp %i3, 2 200b4a0: 02 80 00 40 be 200b5a0 200b4a4: 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 ); 200b4a8: 90 17 23 0c or %i4, 0x30c, %o0 200b4ac: 40 00 0d 46 call 200e9c4 <_Objects_Free> 200b4b0: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 200b4b4: 40 00 11 8f call 200faf0 <_Thread_Enable_dispatch> 200b4b8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 200b4bc: 40 00 2d 95 call 2016b10 <__errno> 200b4c0: 01 00 00 00 nop 200b4c4: f6 22 00 00 st %i3, [ %o0 ] 200b4c8: 81 c7 e0 08 ret 200b4cc: 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) ) { 200b4d0: 80 a6 6a 00 cmp %i1, 0xa00 200b4d4: 02 80 00 28 be 200b574 200b4d8: 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 *) 200b4dc: 94 07 bf fc add %fp, -4, %o2 200b4e0: 11 00 80 9f sethi %hi(0x2027c00), %o0 200b4e4: 40 00 0d 99 call 200eb48 <_Objects_Get> 200b4e8: 90 12 21 80 or %o0, 0x180, %o0 ! 2027d80 <_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; 200b4ec: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b4f0: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 200b4f4: 84 00 a0 01 inc %g2 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b4f8: b8 17 23 0c or %i4, 0x30c, %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; 200b4fc: c4 22 20 18 st %g2, [ %o0 + 0x18 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b500: 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 ); 200b504: d0 27 bf f8 st %o0, [ %fp + -8 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 200b508: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 200b50c: 83 28 60 02 sll %g1, 2, %g1 200b510: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b514: 40 00 11 77 call 200faf0 <_Thread_Enable_dispatch> 200b518: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 200b51c: 40 00 11 75 call 200faf0 <_Thread_Enable_dispatch> 200b520: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 200b524: f0 07 60 08 ld [ %i5 + 8 ], %i0 200b528: 81 c7 e0 08 ret 200b52c: 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 * ); 200b530: 82 07 a0 54 add %fp, 0x54, %g1 200b534: f4 07 a0 50 ld [ %fp + 0x50 ], %i2 200b538: 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 *) 200b53c: 39 00 80 9f sethi %hi(0x2027c00), %i4 200b540: 40 00 0c 37 call 200e61c <_Objects_Allocate> 200b544: 90 17 23 0c or %i4, 0x30c, %o0 ! 2027f0c <_POSIX_Message_queue_Information_fds> va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200b548: ba 92 20 00 orcc %o0, 0, %i5 200b54c: 32 bf ff ce bne,a 200b484 200b550: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 200b554: 40 00 11 67 call 200faf0 <_Thread_Enable_dispatch> 200b558: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 200b55c: 40 00 2d 6d call 2016b10 <__errno> 200b560: 01 00 00 00 nop 200b564: 82 10 20 17 mov 0x17, %g1 ! 17 200b568: c2 22 00 00 st %g1, [ %o0 ] 200b56c: 81 c7 e0 08 ret 200b570: 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 ); 200b574: 90 17 23 0c or %i4, 0x30c, %o0 200b578: 40 00 0d 13 call 200e9c4 <_Objects_Free> 200b57c: 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(); 200b580: 40 00 11 5c call 200faf0 <_Thread_Enable_dispatch> 200b584: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 200b588: 40 00 2d 62 call 2016b10 <__errno> 200b58c: 01 00 00 00 nop 200b590: 82 10 20 11 mov 0x11, %g1 ! 11 200b594: c2 22 00 00 st %g1, [ %o0 ] 200b598: 81 c7 e0 08 ret 200b59c: 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) ) ) { 200b5a0: 02 bf ff c3 be 200b4ac 200b5a4: 90 17 23 0c or %i4, 0x30c, %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( 200b5a8: 90 10 00 18 mov %i0, %o0 200b5ac: 92 10 20 01 mov 1, %o1 200b5b0: 94 10 00 1a mov %i2, %o2 200b5b4: 40 00 1e 33 call 2012e80 <_POSIX_Message_queue_Create_support> 200b5b8: 96 07 bf f8 add %fp, -8, %o3 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 200b5bc: 80 a2 3f ff cmp %o0, -1 200b5c0: 02 80 00 0d be 200b5f4 200b5c4: c6 07 bf f8 ld [ %fp + -8 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200b5c8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); _Thread_Enable_dispatch(); return (mqd_t) the_mq_fd->Object.id; } 200b5cc: b8 17 23 0c or %i4, 0x30c, %i4 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200b5d0: 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; 200b5d4: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200b5d8: 83 28 60 02 sll %g1, 2, %g1 200b5dc: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200b5e0: 40 00 11 44 call 200faf0 <_Thread_Enable_dispatch> 200b5e4: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 200b5e8: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 200b5ec: 81 c7 e0 08 ret 200b5f0: 81 e8 00 00 restore 200b5f4: 90 17 23 0c or %i4, 0x30c, %o0 200b5f8: 92 10 00 1d mov %i5, %o1 200b5fc: 40 00 0c f2 call 200e9c4 <_Objects_Free> 200b600: 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(); 200b604: 40 00 11 3b call 200faf0 <_Thread_Enable_dispatch> 200b608: 01 00 00 00 nop return (mqd_t) -1; 200b60c: 81 c7 e0 08 ret 200b610: 81 e8 00 00 restore =============================================================================== 0200ba9c : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200ba9c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200baa0: 80 a0 60 00 cmp %g1, 0 200baa4: 02 80 00 06 be 200babc 200baa8: 90 10 20 16 mov 0x16, %o0 200baac: c4 00 40 00 ld [ %g1 ], %g2 200bab0: 80 a0 a0 00 cmp %g2, 0 200bab4: 12 80 00 04 bne 200bac4 200bab8: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200babc: 81 c3 e0 08 retl 200bac0: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200bac4: 18 80 00 09 bgu 200bae8 200bac8: 84 10 20 01 mov 1, %g2 ! 1 200bacc: 85 28 80 09 sll %g2, %o1, %g2 200bad0: 80 88 a0 17 btst 0x17, %g2 200bad4: 02 80 00 05 be 200bae8 <== NEVER TAKEN 200bad8: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200badc: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200bae0: 81 c3 e0 08 retl 200bae4: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200bae8: 81 c3 e0 08 retl 200baec: 90 10 20 86 mov 0x86, %o0 =============================================================================== 02006880 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2006880: 9d e3 bf 90 save %sp, -112, %sp 2006884: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2006888: 80 a7 60 00 cmp %i5, 0 200688c: 02 80 00 27 be 2006928 2006890: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 2006894: 80 a6 a0 00 cmp %i2, 0 2006898: 02 80 00 24 be 2006928 200689c: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20068a0: 02 80 00 24 be 2006930 20068a4: 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 ) 20068a8: c2 06 40 00 ld [ %i1 ], %g1 20068ac: 80 a0 60 00 cmp %g1, 0 20068b0: 02 80 00 1e be 2006928 20068b4: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20068b8: c2 06 60 04 ld [ %i1 + 4 ], %g1 20068bc: 80 a0 60 00 cmp %g1, 0 20068c0: 12 80 00 1a bne 2006928 <== NEVER TAKEN 20068c4: 03 00 80 61 sethi %hi(0x2018400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20068c8: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 2018580 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 20068cc: c0 27 bf f0 clr [ %fp + -16 ] 20068d0: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 20068d4: f4 27 bf f4 st %i2, [ %fp + -12 ] 20068d8: c4 20 61 80 st %g2, [ %g1 + 0x180 ] return _Thread_Dispatch_disable_level; 20068dc: c2 00 61 80 ld [ %g1 + 0x180 ], %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 *) 20068e0: 37 00 80 62 sethi %hi(0x2018800), %i3 20068e4: 40 00 08 c3 call 2008bf0 <_Objects_Allocate> 20068e8: 90 16 e1 40 or %i3, 0x140, %o0 ! 2018940 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 20068ec: b8 92 20 00 orcc %o0, 0, %i4 20068f0: 02 80 00 14 be 2006940 20068f4: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 20068f8: 40 00 06 0a call 2008120 <_CORE_barrier_Initialize> 20068fc: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006900: 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; } 2006904: b6 16 e1 40 or %i3, 0x140, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006908: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 200690c: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006910: 85 28 a0 02 sll %g2, 2, %g2 2006914: 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; 2006918: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 200691c: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006920: 40 00 0d ca call 200a048 <_Thread_Enable_dispatch> 2006924: b0 10 20 00 clr %i0 return 0; } 2006928: 81 c7 e0 08 ret 200692c: 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 ); 2006930: 7f ff ff 9c call 20067a0 2006934: 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 ) 2006938: 10 bf ff dd b 20068ac 200693c: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 2006940: 40 00 0d c2 call 200a048 <_Thread_Enable_dispatch> 2006944: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006948: 81 c7 e0 08 ret 200694c: 81 e8 00 00 restore =============================================================================== 0200611c : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 200611c: 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 ) 2006120: 80 a6 20 00 cmp %i0, 0 2006124: 02 80 00 16 be 200617c 2006128: 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++; 200612c: 03 00 80 62 sethi %hi(0x2018800), %g1 2006130: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 2018ac0 <_Thread_Dispatch_disable_level> 2006134: 84 00 a0 01 inc %g2 2006138: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 200613c: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2006140: 40 00 12 e6 call 200acd8 <_Workspace_Allocate> 2006144: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2006148: 80 a2 20 00 cmp %o0, 0 200614c: 02 80 00 0a be 2006174 <== NEVER TAKEN 2006150: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006154: 03 00 80 64 sethi %hi(0x2019000), %g1 2006158: c2 00 60 04 ld [ %g1 + 4 ], %g1 ! 2019004 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 200615c: 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; 2006160: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 2006164: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 2006168: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 200616c: 40 00 06 50 call 2007aac <_Chain_Append> 2006170: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 2006174: 40 00 0e 0e call 20099ac <_Thread_Enable_dispatch> 2006178: 81 e8 00 00 restore 200617c: 81 c7 e0 08 ret 2006180: 81 e8 00 00 restore =============================================================================== 02007088 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2007088: 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; 200708c: 80 a6 60 00 cmp %i1, 0 2007090: 02 80 00 27 be 200712c 2007094: 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 ) 2007098: c2 06 60 04 ld [ %i1 + 4 ], %g1 200709c: 80 a0 60 01 cmp %g1, 1 20070a0: 02 80 00 21 be 2007124 <== NEVER TAKEN 20070a4: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 20070a8: c2 06 40 00 ld [ %i1 ], %g1 20070ac: 80 a0 60 00 cmp %g1, 0 20070b0: 02 80 00 1d be 2007124 20070b4: 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++; 20070b8: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 20196c0 <_Thread_Dispatch_disable_level> 20070bc: 84 00 a0 01 inc %g2 20070c0: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 20070c4: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 20070c8: 37 00 80 66 sethi %hi(0x2019800), %i3 20070cc: 40 00 0a 5c call 2009a3c <_Objects_Allocate> 20070d0: 90 16 e3 18 or %i3, 0x318, %o0 ! 2019b18 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 20070d4: b8 92 20 00 orcc %o0, 0, %i4 20070d8: 02 80 00 18 be 2007138 20070dc: 90 07 20 18 add %i4, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070e0: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070e4: 92 10 20 00 clr %o1 20070e8: 15 04 00 02 sethi %hi(0x10000800), %o2 20070ec: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20070f0: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20070f4: 40 00 11 93 call 200b740 <_Thread_queue_Initialize> 20070f8: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20070fc: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2007100: b6 16 e3 18 or %i3, 0x318, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007104: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007108: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200710c: 85 28 a0 02 sll %g2, 2, %g2 2007110: 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; 2007114: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2007118: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 200711c: 40 00 0f 5e call 200ae94 <_Thread_Enable_dispatch> 2007120: b0 10 20 00 clr %i0 return 0; } 2007124: 81 c7 e0 08 ret 2007128: 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; 200712c: 33 00 80 5f sethi %hi(0x2017c00), %i1 2007130: 10 bf ff da b 2007098 2007134: b2 16 62 84 or %i1, 0x284, %i1 ! 2017e84 <_POSIX_Condition_variables_Default_attributes> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 2007138: 40 00 0f 57 call 200ae94 <_Thread_Enable_dispatch> 200713c: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2007140: 81 c7 e0 08 ret 2007144: 81 e8 00 00 restore =============================================================================== 02006eec : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006eec: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006ef0: 80 a0 60 00 cmp %g1, 0 2006ef4: 02 80 00 06 be 2006f0c 2006ef8: 90 10 20 16 mov 0x16, %o0 2006efc: c4 00 40 00 ld [ %g1 ], %g2 2006f00: 80 a0 a0 00 cmp %g2, 0 2006f04: 32 80 00 04 bne,a 2006f14 <== ALWAYS TAKEN 2006f08: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 2006f0c: 81 c3 e0 08 retl 2006f10: 01 00 00 00 nop 2006f14: 81 c3 e0 08 retl 2006f18: 90 10 20 00 clr %o0 ! 0 =============================================================================== 020065c4 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 20065c4: 9d e3 bf 58 save %sp, -168, %sp 20065c8: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 20065cc: 80 a6 a0 00 cmp %i2, 0 20065d0: 02 80 00 63 be 200675c 20065d4: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20065d8: 80 a6 60 00 cmp %i1, 0 20065dc: 22 80 00 62 be,a 2006764 20065e0: 33 00 80 72 sethi %hi(0x201c800), %i1 if ( !the_attr->is_initialized ) 20065e4: c2 06 40 00 ld [ %i1 ], %g1 20065e8: 80 a0 60 00 cmp %g1, 0 20065ec: 02 80 00 5c be 200675c 20065f0: 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) ) 20065f4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20065f8: 80 a0 60 00 cmp %g1, 0 20065fc: 02 80 00 07 be 2006618 2006600: 03 00 80 75 sethi %hi(0x201d400), %g1 2006604: c4 06 60 08 ld [ %i1 + 8 ], %g2 2006608: c2 00 63 d0 ld [ %g1 + 0x3d0 ], %g1 200660c: 80 a0 80 01 cmp %g2, %g1 2006610: 0a 80 00 83 bcs 200681c 2006614: 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 ) { 2006618: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200661c: 80 a0 60 01 cmp %g1, 1 2006620: 02 80 00 53 be 200676c 2006624: 80 a0 60 02 cmp %g1, 2 2006628: 12 80 00 4d bne 200675c 200662c: b0 10 20 16 mov 0x16, %i0 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2006630: da 06 60 18 ld [ %i1 + 0x18 ], %o5 2006634: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2006638: f0 06 60 20 ld [ %i1 + 0x20 ], %i0 200663c: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 2006640: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 2006644: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 2006648: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 200664c: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 2006650: da 27 bf dc st %o5, [ %fp + -36 ] 2006654: de 27 bf e0 st %o7, [ %fp + -32 ] 2006658: f0 27 bf e4 st %i0, [ %fp + -28 ] 200665c: c8 27 bf e8 st %g4, [ %fp + -24 ] 2006660: c6 27 bf ec st %g3, [ %fp + -20 ] 2006664: c4 27 bf f0 st %g2, [ %fp + -16 ] 2006668: 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 ) 200666c: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2006670: 80 a0 60 00 cmp %g1, 0 2006674: 12 80 00 3a bne 200675c 2006678: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 200667c: d0 07 bf dc ld [ %fp + -36 ], %o0 2006680: 40 00 1c 2b call 200d72c <_POSIX_Priority_Is_valid> 2006684: b0 10 20 16 mov 0x16, %i0 2006688: 80 8a 20 ff btst 0xff, %o0 200668c: 02 80 00 34 be 200675c <== NEVER TAKEN 2006690: 03 00 80 75 sethi %hi(0x201d400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 2006694: 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); 2006698: e6 08 63 cc ldub [ %g1 + 0x3cc ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 200669c: 90 10 00 1c mov %i4, %o0 20066a0: 92 07 bf dc add %fp, -36, %o1 20066a4: 94 07 bf f8 add %fp, -8, %o2 20066a8: 40 00 1c 2e call 200d760 <_POSIX_Thread_Translate_sched_param> 20066ac: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 20066b0: b0 92 20 00 orcc %o0, 0, %i0 20066b4: 12 80 00 2a bne 200675c 20066b8: 23 00 80 79 sethi %hi(0x201e400), %l1 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 20066bc: d0 04 61 54 ld [ %l1 + 0x154 ], %o0 ! 201e554 <_RTEMS_Allocator_Mutex> 20066c0: 40 00 06 81 call 20080c4 <_API_Mutex_Lock> 20066c4: 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 ); 20066c8: 40 00 09 4a call 2008bf0 <_Objects_Allocate> 20066cc: 90 15 22 f0 or %l4, 0x2f0, %o0 ! 201e6f0 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 20066d0: a0 92 20 00 orcc %o0, 0, %l0 20066d4: 02 80 00 1f be 2006750 20066d8: 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( 20066dc: 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 ) 20066e0: d6 00 a3 d0 ld [ %g2 + 0x3d0 ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20066e4: 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 ) 20066e8: 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( 20066ec: 80 a2 c0 01 cmp %o3, %g1 20066f0: 1a 80 00 03 bcc 20066fc 20066f4: d4 06 60 04 ld [ %i1 + 4 ], %o2 20066f8: 96 10 00 01 mov %g1, %o3 20066fc: c2 07 bf f8 ld [ %fp + -8 ], %g1 2006700: 9a 0c e0 ff and %l3, 0xff, %o5 2006704: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2006708: 82 10 20 01 mov 1, %g1 200670c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2006710: c2 07 bf fc ld [ %fp + -4 ], %g1 2006714: c0 23 a0 68 clr [ %sp + 0x68 ] 2006718: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 200671c: 82 07 bf d4 add %fp, -44, %g1 2006720: 90 15 22 f0 or %l4, 0x2f0, %o0 2006724: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2006728: 92 10 00 10 mov %l0, %o1 200672c: 98 10 20 01 mov 1, %o4 2006730: 40 00 0e 7f call 200a12c <_Thread_Initialize> 2006734: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2006738: 80 8a 20 ff btst 0xff, %o0 200673c: 12 80 00 1f bne 20067b8 2006740: 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 ); 2006744: 92 10 00 10 mov %l0, %o1 2006748: 40 00 0a 14 call 2008f98 <_Objects_Free> 200674c: 90 12 22 f0 or %o0, 0x2f0, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006750: d0 04 61 54 ld [ %l1 + 0x154 ], %o0 2006754: 40 00 06 71 call 2008118 <_API_Mutex_Unlock> 2006758: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 200675c: 81 c7 e0 08 ret 2006760: 81 e8 00 00 restore int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2006764: 10 bf ff a0 b 20065e4 2006768: b2 16 62 9c or %i1, 0x29c, %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 ]; 200676c: 03 00 80 7a sethi %hi(0x201e800), %g1 2006770: c2 00 61 f4 ld [ %g1 + 0x1f4 ], %g1 ! 201e9f4 <_Per_CPU_Information+0xc> 2006774: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006778: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 200677c: da 00 60 8c ld [ %g1 + 0x8c ], %o5 2006780: de 00 60 90 ld [ %g1 + 0x90 ], %o7 2006784: f0 00 60 94 ld [ %g1 + 0x94 ], %i0 2006788: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 200678c: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 2006790: 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; 2006794: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 2006798: d8 27 bf dc st %o4, [ %fp + -36 ] 200679c: da 27 bf e0 st %o5, [ %fp + -32 ] 20067a0: de 27 bf e4 st %o7, [ %fp + -28 ] 20067a4: f0 27 bf e8 st %i0, [ %fp + -24 ] 20067a8: c8 27 bf ec st %g4, [ %fp + -20 ] 20067ac: c6 27 bf f0 st %g3, [ %fp + -16 ] break; 20067b0: 10 bf ff af b 200666c 20067b4: c4 27 bf f4 st %g2, [ %fp + -12 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 20067b8: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 api->Attributes = *the_attr; 20067bc: 92 10 00 19 mov %i1, %o1 20067c0: 94 10 20 40 mov 0x40, %o2 20067c4: 40 00 29 1b call 2010c30 20067c8: 90 10 00 12 mov %l2, %o0 api->detachstate = the_attr->detachstate; 20067cc: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 20067d0: 92 07 bf dc add %fp, -36, %o1 20067d4: 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; 20067d8: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] api->schedpolicy = schedpolicy; 20067dc: f8 24 a0 84 st %i4, [ %l2 + 0x84 ] api->schedparam = schedparam; 20067e0: 40 00 29 14 call 2010c30 20067e4: 90 04 a0 88 add %l2, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 20067e8: 90 10 00 10 mov %l0, %o0 20067ec: 92 10 20 01 mov 1, %o1 20067f0: 94 10 00 1a mov %i2, %o2 20067f4: 96 10 00 1b mov %i3, %o3 20067f8: 40 00 10 d1 call 200ab3c <_Thread_Start> 20067fc: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2006800: 80 a7 20 04 cmp %i4, 4 2006804: 02 80 00 08 be 2006824 2006808: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 200680c: c2 04 20 08 ld [ %l0 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2006810: d0 04 61 54 ld [ %l1 + 0x154 ], %o0 2006814: 40 00 06 41 call 2008118 <_API_Mutex_Unlock> 2006818: c2 27 40 00 st %g1, [ %i5 ] return 0; 200681c: 81 c7 e0 08 ret 2006820: 81 e8 00 00 restore return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 2006824: 40 00 11 1b call 200ac90 <_Timespec_To_ticks> 2006828: 90 04 a0 90 add %l2, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200682c: 92 04 a0 a8 add %l2, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2006830: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006834: 11 00 80 79 sethi %hi(0x201e400), %o0 2006838: 40 00 12 06 call 200b050 <_Watchdog_Insert> 200683c: 90 12 21 6c or %o0, 0x16c, %o0 ! 201e56c <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2006840: 10 bf ff f4 b 2006810 2006844: c2 04 20 08 ld [ %l0 + 8 ], %g1 =============================================================================== 0201a944 : int pthread_kill( pthread_t thread, int sig ) { 201a944: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201a948: 80 a6 60 00 cmp %i1, 0 201a94c: 02 80 00 2d be 201aa00 201a950: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201a954: 80 a6 e0 1f cmp %i3, 0x1f 201a958: 18 80 00 2a bgu 201aa00 201a95c: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 201a960: 7f ff ba a4 call 20093f0 <_Thread_Get> 201a964: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201a968: c2 07 bf fc ld [ %fp + -4 ], %g1 201a96c: 80 a0 60 00 cmp %g1, 0 201a970: 12 80 00 2a bne 201aa18 <== NEVER TAKEN 201a974: 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 ) { 201a978: 83 2e 60 02 sll %i1, 2, %g1 201a97c: 85 2e 60 04 sll %i1, 4, %g2 201a980: 84 20 80 01 sub %g2, %g1, %g2 201a984: 03 00 80 78 sethi %hi(0x201e000), %g1 201a988: 82 10 60 50 or %g1, 0x50, %g1 ! 201e050 <_POSIX_signals_Vectors> 201a98c: 82 00 40 02 add %g1, %g2, %g1 201a990: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a994: 80 a0 a0 01 cmp %g2, 1 201a998: 02 80 00 14 be 201a9e8 201a99c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a9a0: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201a9a4: b8 10 20 01 mov 1, %i4 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a9a8: 92 10 00 19 mov %i1, %o1 201a9ac: b7 2f 00 1b sll %i4, %i3, %i3 201a9b0: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201a9b4: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201a9b8: 7f ff ff 8c call 201a7e8 <_POSIX_signals_Unblock_thread> 201a9bc: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201a9c0: 03 00 80 77 sethi %hi(0x201dc00), %g1 201a9c4: 82 10 63 f8 or %g1, 0x3f8, %g1 ! 201dff8 <_Per_CPU_Information> 201a9c8: c4 00 60 08 ld [ %g1 + 8 ], %g2 201a9cc: 80 a0 a0 00 cmp %g2, 0 201a9d0: 02 80 00 06 be 201a9e8 201a9d4: 01 00 00 00 nop 201a9d8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201a9dc: 80 a7 40 02 cmp %i5, %g2 201a9e0: 02 80 00 06 be 201a9f8 201a9e4: 01 00 00 00 nop _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 201a9e8: 7f ff ba 75 call 20093bc <_Thread_Enable_dispatch> 201a9ec: b0 10 20 00 clr %i0 ! 0 return 0; 201a9f0: 81 c7 e0 08 ret 201a9f4: 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; 201a9f8: f8 28 60 18 stb %i4, [ %g1 + 0x18 ] 201a9fc: 30 bf ff fb b,a 201a9e8 if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201aa00: 7f ff d4 24 call 200fa90 <__errno> 201aa04: b0 10 3f ff mov -1, %i0 201aa08: 82 10 20 16 mov 0x16, %g1 201aa0c: c2 22 00 00 st %g1, [ %o0 ] 201aa10: 81 c7 e0 08 ret 201aa14: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201aa18: 7f ff d4 1e call 200fa90 <__errno> <== NOT EXECUTED 201aa1c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201aa20: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 201aa24: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 201aa28: 81 c7 e0 08 ret <== NOT EXECUTED 201aa2c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008550 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2008550: 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 ); 2008554: 90 10 00 19 mov %i1, %o0 2008558: 40 00 00 37 call 2008634 <_POSIX_Absolute_timeout_to_ticks> 200855c: 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 ); 2008560: 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 ); 2008564: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008568: 80 a7 60 03 cmp %i5, 3 200856c: 02 80 00 09 be 2008590 2008570: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2008574: 7f ff ff be call 200846c <_POSIX_Mutex_Lock_support> 2008578: 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) ) { 200857c: 80 a2 20 10 cmp %o0, 0x10 2008580: 02 80 00 08 be 20085a0 2008584: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008588: 81 c7 e0 08 ret 200858c: 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 ); 2008590: 7f ff ff b7 call 200846c <_POSIX_Mutex_Lock_support> 2008594: 92 10 20 01 mov 1, %o1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2008598: 81 c7 e0 08 ret 200859c: 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 ) 20085a0: 32 80 00 04 bne,a 20085b0 <== ALWAYS TAKEN 20085a4: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 20085a8: 10 bf ff f8 b 2008588 <== NOT EXECUTED 20085ac: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20085b0: 80 a7 60 01 cmp %i5, 1 20085b4: 28 bf ff f5 bleu,a 2008588 <== ALWAYS TAKEN 20085b8: 90 10 20 74 mov 0x74, %o0 20085bc: 30 bf ff f3 b,a 2008588 <== NOT EXECUTED =============================================================================== 02005e44 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005e44: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2005e48: 80 a0 60 00 cmp %g1, 0 2005e4c: 02 80 00 06 be 2005e64 2005e50: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005e54: c4 00 40 00 ld [ %g1 ], %g2 2005e58: 80 a0 a0 00 cmp %g2, 0 2005e5c: 12 80 00 04 bne 2005e6c 2005e60: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 2005e64: 81 c3 e0 08 retl 2005e68: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 2005e6c: 02 bf ff fe be 2005e64 <== NEVER TAKEN 2005e70: 01 00 00 00 nop return EINVAL; *type = attr->type; 2005e74: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2005e78: 90 10 20 00 clr %o0 } 2005e7c: 81 c3 e0 08 retl 2005e80: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 02008124 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2008124: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2008128: 80 a0 60 00 cmp %g1, 0 200812c: 02 80 00 06 be 2008144 2008130: 90 10 20 16 mov 0x16, %o0 2008134: c4 00 40 00 ld [ %g1 ], %g2 2008138: 80 a0 a0 00 cmp %g2, 0 200813c: 12 80 00 04 bne 200814c 2008140: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2008144: 81 c3 e0 08 retl 2008148: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 200814c: 18 bf ff fe bgu 2008144 <== NEVER TAKEN 2008150: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2008154: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2008158: 81 c3 e0 08 retl 200815c: 90 10 20 00 clr %o0 =============================================================================== 02005ed8 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 2005ed8: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2005edc: 80 a0 60 00 cmp %g1, 0 2005ee0: 02 80 00 06 be 2005ef8 2005ee4: 90 10 20 16 mov 0x16, %o0 2005ee8: c4 00 40 00 ld [ %g1 ], %g2 2005eec: 80 a0 a0 00 cmp %g2, 0 2005ef0: 12 80 00 04 bne 2005f00 <== ALWAYS TAKEN 2005ef4: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 2005ef8: 81 c3 e0 08 retl 2005efc: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 2005f00: 18 bf ff fe bgu 2005ef8 2005f04: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2005f08: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 2005f0c: 81 c3 e0 08 retl 2005f10: 90 10 20 00 clr %o0 =============================================================================== 02006d14 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2006d14: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2006d18: 80 a6 60 00 cmp %i1, 0 2006d1c: 12 80 00 04 bne 2006d2c 2006d20: ba 10 00 18 mov %i0, %i5 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006d24: 81 c7 e0 08 ret 2006d28: 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 ) 2006d2c: 80 a6 20 00 cmp %i0, 0 2006d30: 22 80 00 13 be,a 2006d7c 2006d34: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 2006d38: c2 06 20 04 ld [ %i0 + 4 ], %g1 2006d3c: 80 a0 60 00 cmp %g1, 0 2006d40: 12 80 00 0f bne 2006d7c 2006d44: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2006d48: 90 10 21 00 mov 0x100, %o0 2006d4c: 92 10 21 00 mov 0x100, %o1 2006d50: 40 00 03 0e call 2007988 2006d54: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2006d58: c2 07 60 04 ld [ %i5 + 4 ], %g1 2006d5c: 80 a0 60 00 cmp %g1, 0 2006d60: 02 80 00 09 be 2006d84 <== ALWAYS TAKEN 2006d64: 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); 2006d68: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 2006d6c: 92 10 21 00 mov 0x100, %o1 2006d70: 94 07 bf fc add %fp, -4, %o2 2006d74: 40 00 03 05 call 2007988 2006d78: b0 10 20 00 clr %i0 2006d7c: 81 c7 e0 08 ret 2006d80: 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; 2006d84: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2006d88: 9f c6 40 00 call %i1 2006d8c: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2006d90: 10 bf ff f7 b 2006d6c 2006d94: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 020073f0 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20073f0: 9d e3 bf 90 save %sp, -112, %sp 20073f4: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20073f8: 80 a7 60 00 cmp %i5, 0 20073fc: 02 80 00 24 be 200748c 2007400: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007404: 80 a6 60 00 cmp %i1, 0 2007408: 02 80 00 23 be 2007494 200740c: 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 ) 2007410: c2 06 40 00 ld [ %i1 ], %g1 2007414: 80 a0 60 00 cmp %g1, 0 2007418: 02 80 00 1d be 200748c <== NEVER TAKEN 200741c: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2007420: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007424: 80 a0 60 00 cmp %g1, 0 2007428: 12 80 00 19 bne 200748c <== NEVER TAKEN 200742c: 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++; 2007430: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201ab70 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 2007434: c0 27 bf fc clr [ %fp + -4 ] 2007438: 84 00 a0 01 inc %g2 200743c: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2007440: c2 00 63 70 ld [ %g1 + 0x370 ], %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 *) 2007444: 37 00 80 6b sethi %hi(0x201ac00), %i3 2007448: 40 00 0a 60 call 2009dc8 <_Objects_Allocate> 200744c: 90 16 e1 70 or %i3, 0x170, %o0 ! 201ad70 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2007450: b8 92 20 00 orcc %o0, 0, %i4 2007454: 02 80 00 14 be 20074a4 2007458: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 200745c: 40 00 07 f0 call 200941c <_CORE_RWLock_Initialize> 2007460: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007464: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 2007468: b6 16 e1 70 or %i3, 0x170, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200746c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007470: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007474: 85 28 a0 02 sll %g2, 2, %g2 2007478: 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; 200747c: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007480: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007484: 40 00 0f 67 call 200b220 <_Thread_Enable_dispatch> 2007488: b0 10 20 00 clr %i0 return 0; } 200748c: 81 c7 e0 08 ret 2007490: 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 ); 2007494: 40 00 02 80 call 2007e94 2007498: 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 ) 200749c: 10 bf ff de b 2007414 20074a0: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 20074a4: 40 00 0f 5f call 200b220 <_Thread_Enable_dispatch> 20074a8: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20074ac: 81 c7 e0 08 ret 20074b0: 81 e8 00 00 restore =============================================================================== 02007524 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007524: 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 ) 2007528: 80 a6 20 00 cmp %i0, 0 200752c: 02 80 00 24 be 20075bc 2007530: 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 ); 2007534: 92 07 bf fc add %fp, -4, %o1 2007538: 40 00 1c b0 call 200e7f8 <_POSIX_Absolute_timeout_to_ticks> 200753c: 90 10 00 19 mov %i1, %o0 2007540: d2 06 00 00 ld [ %i0 ], %o1 2007544: b8 10 00 08 mov %o0, %i4 2007548: 94 07 bf f8 add %fp, -8, %o2 200754c: 11 00 80 6b sethi %hi(0x201ac00), %o0 2007550: 40 00 0b 69 call 200a2f4 <_Objects_Get> 2007554: 90 12 21 70 or %o0, 0x170, %o0 ! 201ad70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2007558: c2 07 bf f8 ld [ %fp + -8 ], %g1 200755c: 80 a0 60 00 cmp %g1, 0 2007560: 12 80 00 17 bne 20075bc 2007564: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2007568: 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, 200756c: 82 1f 20 03 xor %i4, 3, %g1 2007570: 90 02 20 10 add %o0, 0x10, %o0 2007574: 80 a0 00 01 cmp %g0, %g1 2007578: 98 10 20 00 clr %o4 200757c: b6 60 3f ff subx %g0, -1, %i3 2007580: 40 00 07 b1 call 2009444 <_CORE_RWLock_Obtain_for_reading> 2007584: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2007588: 40 00 0f 26 call 200b220 <_Thread_Enable_dispatch> 200758c: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007590: 03 00 80 6c sethi %hi(0x201b000), %g1 2007594: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201b0b4 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 2007598: 80 a6 e0 00 cmp %i3, 0 200759c: 12 80 00 05 bne 20075b0 20075a0: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 20075a4: 80 a2 20 02 cmp %o0, 2 20075a8: 02 80 00 07 be 20075c4 20075ac: 80 a7 20 00 cmp %i4, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 20075b0: 40 00 00 39 call 2007694 <_POSIX_RWLock_Translate_core_RWLock_return_code> 20075b4: 01 00 00 00 nop 20075b8: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 20075bc: 81 c7 e0 08 ret 20075c0: 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 ) 20075c4: 02 bf ff fe be 20075bc <== NEVER TAKEN 20075c8: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20075cc: 80 a7 20 01 cmp %i4, 1 20075d0: 18 bf ff f8 bgu 20075b0 <== NEVER TAKEN 20075d4: ba 10 20 74 mov 0x74, %i5 20075d8: 30 bf ff f9 b,a 20075bc =============================================================================== 020075dc : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20075dc: 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 ) 20075e0: 80 a6 20 00 cmp %i0, 0 20075e4: 02 80 00 24 be 2007674 20075e8: 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 ); 20075ec: 92 07 bf fc add %fp, -4, %o1 20075f0: 40 00 1c 82 call 200e7f8 <_POSIX_Absolute_timeout_to_ticks> 20075f4: 90 10 00 19 mov %i1, %o0 20075f8: d2 06 00 00 ld [ %i0 ], %o1 20075fc: b8 10 00 08 mov %o0, %i4 2007600: 94 07 bf f8 add %fp, -8, %o2 2007604: 11 00 80 6b sethi %hi(0x201ac00), %o0 2007608: 40 00 0b 3b call 200a2f4 <_Objects_Get> 200760c: 90 12 21 70 or %o0, 0x170, %o0 ! 201ad70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2007610: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007614: 80 a0 60 00 cmp %g1, 0 2007618: 12 80 00 17 bne 2007674 200761c: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2007620: 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, 2007624: 82 1f 20 03 xor %i4, 3, %g1 2007628: 90 02 20 10 add %o0, 0x10, %o0 200762c: 80 a0 00 01 cmp %g0, %g1 2007630: 98 10 20 00 clr %o4 2007634: b6 60 3f ff subx %g0, -1, %i3 2007638: 40 00 07 b9 call 200951c <_CORE_RWLock_Obtain_for_writing> 200763c: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2007640: 40 00 0e f8 call 200b220 <_Thread_Enable_dispatch> 2007644: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2007648: 03 00 80 6c sethi %hi(0x201b000), %g1 200764c: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201b0b4 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2007650: 80 a6 e0 00 cmp %i3, 0 2007654: 12 80 00 05 bne 2007668 2007658: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200765c: 80 a2 20 02 cmp %o0, 2 2007660: 02 80 00 07 be 200767c 2007664: 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( 2007668: 40 00 00 0b call 2007694 <_POSIX_RWLock_Translate_core_RWLock_return_code> 200766c: 01 00 00 00 nop 2007670: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007674: 81 c7 e0 08 ret 2007678: 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 ) 200767c: 02 bf ff fe be 2007674 <== NEVER TAKEN 2007680: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007684: 80 a7 20 01 cmp %i4, 1 2007688: 18 bf ff f8 bgu 2007668 <== NEVER TAKEN 200768c: ba 10 20 74 mov 0x74, %i5 2007690: 30 bf ff f9 b,a 2007674 =============================================================================== 02007ebc : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007ebc: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007ec0: 80 a0 60 00 cmp %g1, 0 2007ec4: 02 80 00 06 be 2007edc 2007ec8: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007ecc: c4 00 40 00 ld [ %g1 ], %g2 2007ed0: 80 a0 a0 00 cmp %g2, 0 2007ed4: 12 80 00 04 bne 2007ee4 2007ed8: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2007edc: 81 c3 e0 08 retl 2007ee0: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2007ee4: 18 bf ff fe bgu 2007edc <== NEVER TAKEN 2007ee8: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007eec: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2007ef0: 81 c3 e0 08 retl 2007ef4: 90 10 20 00 clr %o0 =============================================================================== 02008ed4 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008ed4: 9d e3 bf 90 save %sp, -112, %sp 2008ed8: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2008edc: 80 a6 a0 00 cmp %i2, 0 2008ee0: 02 80 00 38 be 2008fc0 2008ee4: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 2008ee8: 90 10 00 19 mov %i1, %o0 2008eec: 92 10 00 1a mov %i2, %o1 2008ef0: 94 07 bf f4 add %fp, -12, %o2 2008ef4: 40 00 1a 64 call 200f884 <_POSIX_Thread_Translate_sched_param> 2008ef8: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 2008efc: b0 92 20 00 orcc %o0, 0, %i0 2008f00: 12 80 00 30 bne 2008fc0 2008f04: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 2008f08: 40 00 0c 76 call 200c0e0 <_Thread_Get> 2008f0c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008f10: c2 07 bf fc ld [ %fp + -4 ], %g1 2008f14: 80 a0 60 00 cmp %g1, 0 2008f18: 12 80 00 2c bne 2008fc8 2008f1c: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2008f20: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2008f24: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2008f28: 80 a0 60 04 cmp %g1, 4 2008f2c: 02 80 00 33 be 2008ff8 2008f30: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 2008f34: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008f38: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008f3c: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 2008f40: c2 27 60 88 st %g1, [ %i5 + 0x88 ] 2008f44: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008f48: c4 27 60 8c st %g2, [ %i5 + 0x8c ] 2008f4c: c4 06 a0 08 ld [ %i2 + 8 ], %g2 2008f50: c4 27 60 90 st %g2, [ %i5 + 0x90 ] 2008f54: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 2008f58: c4 27 60 94 st %g2, [ %i5 + 0x94 ] 2008f5c: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 2008f60: c4 27 60 98 st %g2, [ %i5 + 0x98 ] 2008f64: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 2008f68: c4 27 60 9c st %g2, [ %i5 + 0x9c ] 2008f6c: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 2008f70: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 2008f74: c4 07 bf f4 ld [ %fp + -12 ], %g2 2008f78: c4 27 20 7c st %g2, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008f7c: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 2008f80: 06 80 00 0e bl 2008fb8 <== NEVER TAKEN 2008f84: c4 27 20 80 st %g2, [ %i4 + 0x80 ] 2008f88: 80 a6 60 02 cmp %i1, 2 2008f8c: 04 80 00 11 ble 2008fd0 2008f90: 07 00 80 6d sethi %hi(0x201b400), %g3 2008f94: 80 a6 60 04 cmp %i1, 4 2008f98: 12 80 00 08 bne 2008fb8 <== NEVER TAKEN 2008f9c: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008fa0: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 2008fa4: 40 00 10 e3 call 200d330 <_Watchdog_Remove> 2008fa8: 90 07 60 a8 add %i5, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008fac: 90 10 20 00 clr %o0 2008fb0: 7f ff ff 7e call 2008da8 <_POSIX_Threads_Sporadic_budget_TSR> 2008fb4: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008fb8: 40 00 0c 3d call 200c0ac <_Thread_Enable_dispatch> 2008fbc: 01 00 00 00 nop return 0; 2008fc0: 81 c7 e0 08 ret 2008fc4: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return ESRCH; } 2008fc8: 81 c7 e0 08 ret 2008fcc: 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; 2008fd0: 05 00 80 70 sethi %hi(0x201c000), %g2 2008fd4: d2 08 e1 1c ldub [ %g3 + 0x11c ], %o1 2008fd8: c4 00 a1 d4 ld [ %g2 + 0x1d4 ], %g2 2008fdc: 92 22 40 01 sub %o1, %g1, %o1 2008fe0: c4 27 20 78 st %g2, [ %i4 + 0x78 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008fe4: 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 = 2008fe8: d2 27 20 18 st %o1, [ %i4 + 0x18 ] _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008fec: 40 00 0a f3 call 200bbb8 <_Thread_Change_priority> 2008ff0: 94 10 20 01 mov 1, %o2 the_thread, the_thread->real_priority, true ); break; 2008ff4: 30 bf ff f1 b,a 2008fb8 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 2008ff8: 40 00 10 ce call 200d330 <_Watchdog_Remove> 2008ffc: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2009000: 10 bf ff ce b 2008f38 2009004: f2 27 60 84 st %i1, [ %i5 + 0x84 ] =============================================================================== 02006974 : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 2006974: 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() ) 2006978: 3b 00 80 63 sethi %hi(0x2018c00), %i5 200697c: ba 17 63 f8 or %i5, 0x3f8, %i5 ! 2018ff8 <_Per_CPU_Information> 2006980: c2 07 60 08 ld [ %i5 + 8 ], %g1 2006984: 80 a0 60 00 cmp %g1, 0 2006988: 12 80 00 16 bne 20069e0 <== NEVER TAKEN 200698c: 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++; 2006990: 03 00 80 62 sethi %hi(0x2018800), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006994: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2006998: c6 00 62 c0 ld [ %g1 + 0x2c0 ], %g3 200699c: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 20069a0: 86 00 e0 01 inc %g3 20069a4: c6 20 62 c0 st %g3, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 20069a8: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 20069ac: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 20069b0: 80 a0 60 00 cmp %g1, 0 20069b4: 12 80 00 0d bne 20069e8 <== NEVER TAKEN 20069b8: 01 00 00 00 nop 20069bc: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 20069c0: 80 a0 60 00 cmp %g1, 0 20069c4: 02 80 00 09 be 20069e8 20069c8: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 20069cc: 40 00 0b f8 call 20099ac <_Thread_Enable_dispatch> 20069d0: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 20069d4: f0 07 60 0c ld [ %i5 + 0xc ], %i0 20069d8: 40 00 1a 2c call 200d288 <_POSIX_Thread_Exit> 20069dc: 81 e8 00 00 restore 20069e0: 81 c7 e0 08 ret <== NOT EXECUTED 20069e4: 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(); 20069e8: 40 00 0b f1 call 20099ac <_Thread_Enable_dispatch> 20069ec: 81 e8 00 00 restore =============================================================================== 02007548 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2007548: 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); 200754c: 3b 00 80 67 sethi %hi(0x2019c00), %i5 2007550: 40 00 02 75 call 2007f24 2007554: 90 17 60 fc or %i5, 0xfc, %o0 ! 2019cfc if (result != 0) { 2007558: b8 92 20 00 orcc %o0, 0, %i4 200755c: 12 80 00 31 bne 2007620 <== NEVER TAKEN 2007560: 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); 2007564: 40 00 04 a5 call 20087f8 2007568: b6 17 60 fc or %i5, 0xfc, %i3 200756c: 92 07 bf fc add %fp, -4, %o1 2007570: 40 00 03 93 call 20083bc 2007574: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2007578: 40 00 04 a0 call 20087f8 200757c: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007580: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2007584: 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; 2007588: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 200758c: 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; 2007590: 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 (); 2007594: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2007598: 84 20 c0 02 sub %g3, %g2, %g2 200759c: 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) && 20075a0: 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; 20075a4: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 20075a8: 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; 20075ac: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 20075b0: 80 a0 a0 00 cmp %g2, 0 20075b4: 12 80 00 06 bne 20075cc <== NEVER TAKEN 20075b8: d2 00 40 00 ld [ %g1 ], %o1 20075bc: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2 20075c0: 80 a0 a0 04 cmp %g2, 4 20075c4: 24 80 00 1b ble,a 2007630 20075c8: 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, 20075cc: 94 10 20 00 clr %o2 20075d0: 11 00 80 67 sethi %hi(0x2019c00), %o0 20075d4: 7f ff fe a0 call 2007054 20075d8: 90 12 21 44 or %o0, 0x144, %o0 ! 2019d44 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20075dc: b4 92 20 00 orcc %o0, 0, %i2 20075e0: 22 80 00 31 be,a 20076a4 20075e4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 20075e8: b6 06 a0 1c add %i2, 0x1c, %i3 20075ec: 40 00 02 4e call 2007f24 20075f0: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20075f4: 90 06 a0 08 add %i2, 8, %o0 20075f8: 7f ff ff 89 call 200741c 20075fc: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 2007600: 40 00 01 25 call 2007a94 2007604: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007608: 40 00 02 67 call 2007fa4 200760c: 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); 2007610: 40 00 02 65 call 2007fa4 2007614: 90 17 60 fc or %i5, 0xfc, %o0 return 0; } 2007618: 81 c7 e0 08 ret 200761c: 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); 2007620: 7f ff f0 25 call 20036b4 <== NOT EXECUTED 2007624: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 2007628: 81 c7 e0 08 ret <== NOT EXECUTED 200762c: 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); 2007630: 7f ff fe 89 call 2007054 2007634: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007638: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 200763c: 80 a0 60 01 cmp %g1, 1 2007640: 12 bf ff ea bne 20075e8 2007644: 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); 2007648: 90 02 20 08 add %o0, 8, %o0 200764c: 40 00 09 11 call 2009a90 <_Chain_Insert> 2007650: 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); 2007654: 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; 2007658: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 200765c: 40 00 01 da call 2007dc4 2007660: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2007664: 92 10 20 00 clr %o1 2007668: 40 00 00 db call 20079d4 200766c: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007670: 90 07 bf f8 add %fp, -8, %o0 2007674: 92 06 e0 08 add %i3, 8, %o1 2007678: 96 10 00 1a mov %i2, %o3 200767c: 15 00 80 1c sethi %hi(0x2007000), %o2 2007680: 40 00 02 ae call 2008138 2007684: 94 12 a1 b0 or %o2, 0x1b0, %o2 ! 20071b0 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007688: 82 92 20 00 orcc %o0, 0, %g1 200768c: 12 80 00 25 bne 2007720 <== NEVER TAKEN 2007690: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2007694: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2007698: 82 00 60 01 inc %g1 200769c: 10 bf ff dd b 2007610 20076a0: 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); 20076a4: 11 00 80 67 sethi %hi(0x2019c00), %o0 20076a8: d2 00 40 00 ld [ %g1 ], %o1 20076ac: 90 12 21 50 or %o0, 0x150, %o0 20076b0: 7f ff fe 69 call 2007054 20076b4: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 20076b8: 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); 20076bc: b4 10 00 08 mov %o0, %i2 20076c0: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 20076c4: 80 a0 60 01 cmp %g1, 1 20076c8: 02 80 00 0b be 20076f4 20076cc: 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); 20076d0: 7f ff ff 53 call 200741c 20076d4: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 20076d8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20076dc: 80 a0 60 00 cmp %g1, 0 20076e0: 04 bf ff cc ble 2007610 <== ALWAYS TAKEN 20076e4: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 20076e8: 40 00 00 eb call 2007a94 <== NOT EXECUTED 20076ec: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED 20076f0: 30 bf ff c8 b,a 2007610 <== NOT EXECUTED 20076f4: 40 00 08 e7 call 2009a90 <_Chain_Insert> 20076f8: 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); 20076fc: 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; 2007700: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007704: 40 00 01 b0 call 2007dc4 2007708: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 200770c: 90 06 a0 20 add %i2, 0x20, %o0 2007710: 40 00 00 b1 call 20079d4 2007714: 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) 2007718: 10 bf ff f1 b 20076dc 200771c: 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); 2007720: 40 00 02 21 call 2007fa4 <== NOT EXECUTED 2007724: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED return result; 2007728: 30 bf ff bc b,a 2007618 <== NOT EXECUTED =============================================================================== 020071b0 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 20071b0: 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); 20071b4: 37 00 80 67 sethi %hi(0x2019c00), %i3 20071b8: b8 06 20 1c add %i0, 0x1c, %i4 20071bc: b6 16 e0 fc or %i3, 0xfc, %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, 20071c0: 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)) { 20071c4: 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, 20071c8: 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); 20071cc: 40 00 03 56 call 2007f24 20071d0: 90 10 00 1c mov %i4, %o0 if (result != 0) 20071d4: 80 a2 20 00 cmp %o0, 0 20071d8: 12 80 00 2b bne 2007284 <== NEVER TAKEN 20071dc: 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; 20071e0: 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 ); 20071e4: 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)) { 20071e8: 80 a7 40 01 cmp %i5, %g1 20071ec: 02 80 00 41 be 20072f0 20071f0: 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); 20071f4: 40 00 05 81 call 20087f8 20071f8: 01 00 00 00 nop 20071fc: 92 07 bf fc add %fp, -4, %o1 2007200: 40 00 04 6f call 20083bc 2007204: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2007208: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 200720c: 40 00 05 7b call 20087f8 2007210: c2 27 bf d8 st %g1, [ %fp + -40 ] 2007214: d2 07 60 08 ld [ %i5 + 8 ], %o1 2007218: 40 00 05 7c call 2008808 200721c: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007220: 40 00 0a 04 call 2009a30 <_Chain_Extract> 2007224: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2007228: 40 00 03 5f call 2007fa4 200722c: 90 10 00 1c mov %i4, %o0 switch (req->aiocbp->aio_lio_opcode) { 2007230: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 2007234: c2 04 60 30 ld [ %l1 + 0x30 ], %g1 2007238: 80 a0 60 02 cmp %g1, 2 200723c: 22 80 00 25 be,a 20072d0 2007240: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 2007244: 80 a0 60 03 cmp %g1, 3 2007248: 02 80 00 1e be 20072c0 <== NEVER TAKEN 200724c: 01 00 00 00 nop 2007250: 80 a0 60 01 cmp %g1, 1 2007254: 22 80 00 0e be,a 200728c <== ALWAYS TAKEN 2007258: c4 1c 60 08 ldd [ %l1 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 200725c: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 2007260: 40 00 2b c1 call 2012164 <__errno> <== NOT EXECUTED 2007264: c2 24 60 38 st %g1, [ %l1 + 0x38 ] <== NOT EXECUTED 2007268: 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); 200726c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 2007270: 40 00 03 2d call 2007f24 <== NOT EXECUTED 2007274: c2 24 60 34 st %g1, [ %l1 + 0x34 ] <== NOT EXECUTED if (result != 0) 2007278: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 200727c: 22 bf ff da be,a 20071e4 <== NOT EXECUTED 2007280: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 2007284: 81 c7 e0 08 ret 2007288: 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, 200728c: d0 04 40 00 ld [ %l1 ], %o0 2007290: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 2007294: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 2007298: 96 10 00 02 mov %g2, %o3 200729c: 40 00 2e d5 call 2012df0 20072a0: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 20072a4: 80 a2 3f ff cmp %o0, -1 20072a8: 22 bf ff ed be,a 200725c <== NEVER TAKEN 20072ac: 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; 20072b0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20072b4: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 20072b8: 10 bf ff c5 b 20071cc 20072bc: 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); 20072c0: 40 00 1d aa call 200e968 <== NOT EXECUTED 20072c4: d0 04 40 00 ld [ %l1 ], %o0 <== NOT EXECUTED break; 20072c8: 10 bf ff f8 b 20072a8 <== NOT EXECUTED 20072cc: 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, 20072d0: d0 04 40 00 ld [ %l1 ], %o0 20072d4: d2 04 60 10 ld [ %l1 + 0x10 ], %o1 20072d8: d4 04 60 14 ld [ %l1 + 0x14 ], %o2 20072dc: 96 10 00 02 mov %g2, %o3 20072e0: 40 00 2f 02 call 2012ee8 20072e4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 20072e8: 10 bf ff f0 b 20072a8 20072ec: 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); 20072f0: 40 00 03 2d call 2007fa4 20072f4: 90 10 00 1c mov %i4, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 20072f8: 40 00 03 0b call 2007f24 20072fc: 90 10 00 1b mov %i3, %o0 if (rtems_chain_is_empty (chain)) 2007300: c2 06 20 08 ld [ %i0 + 8 ], %g1 2007304: 80 a7 40 01 cmp %i5, %g1 2007308: 02 80 00 05 be 200731c <== ALWAYS TAKEN 200730c: 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); 2007310: 40 00 03 25 call 2007fa4 2007314: 90 10 00 1b mov %i3, %o0 2007318: 30 bf ff ad b,a 20071cc pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 200731c: 40 00 01 50 call 200785c 2007320: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2007324: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2007328: 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; 200732c: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007330: 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; 2007334: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2007338: 90 10 00 1d mov %i5, %o0 200733c: 92 10 00 1a mov %i2, %o1 2007340: 40 00 01 f4 call 2007b10 2007344: 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) { 2007348: 80 a2 20 74 cmp %o0, 0x74 200734c: 12 bf ff f1 bne 2007310 <== NEVER TAKEN 2007350: 01 00 00 00 nop 2007354: 40 00 09 b7 call 2009a30 <_Chain_Extract> 2007358: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 200735c: 40 00 02 47 call 2007c78 2007360: 90 10 00 1c mov %i4, %o0 pthread_cond_destroy (&r_chain->cond); 2007364: 40 00 01 66 call 20078fc 2007368: 90 10 00 1d mov %i5, %o0 free (r_chain); 200736c: 7f ff f0 d2 call 20036b4 2007370: 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; 2007374: 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)) { 2007378: 80 a6 00 19 cmp %i0, %i1 200737c: 22 80 00 0e be,a 20073b4 2007380: 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; 2007384: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2 ++aio_request_queue.active_threads; 2007388: 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; 200738c: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 2007390: 82 00 60 01 inc %g1 2007394: 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; 2007398: c4 26 a0 68 st %g2, [ %i2 + 0x68 ] 200739c: 40 00 09 a5 call 2009a30 <_Chain_Extract> 20073a0: c2 26 a0 64 st %g1, [ %i2 + 0x64 ] 20073a4: 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); 20073a8: 7f ff ff 64 call 2007138 20073ac: 90 10 00 18 mov %i0, %o0 20073b0: 30 bf ff d8 b,a 2007310 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; 20073b4: 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; 20073b8: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 20073bc: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 20073c0: 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; 20073c4: c4 26 e0 68 st %g2, [ %i3 + 0x68 ] --aio_request_queue.active_threads; 20073c8: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 20073cc: 40 00 01 24 call 200785c 20073d0: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20073d4: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20073d8: 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; 20073dc: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073e0: 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; 20073e4: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20073e8: 92 10 00 1b mov %i3, %o1 20073ec: 40 00 01 c9 call 2007b10 20073f0: 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) { 20073f4: 80 a2 20 74 cmp %o0, 0x74 20073f8: 22 80 00 04 be,a 2007408 <== ALWAYS TAKEN 20073fc: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 2007400: 10 bf ff e1 b 2007384 <== NOT EXECUTED 2007404: 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); 2007408: 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; 200740c: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2007410: 40 00 02 e5 call 2007fa4 2007414: c2 26 e0 68 st %g1, [ %i3 + 0x68 ] return NULL; 2007418: 30 bf ff 9b b,a 2007284 =============================================================================== 02006f4c : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2006f4c: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006f50: 3b 00 80 67 sethi %hi(0x2019c00), %i5 2006f54: 40 00 04 5e call 20080cc 2006f58: 90 17 61 04 or %i5, 0x104, %o0 ! 2019d04 if (result != 0) 2006f5c: b0 92 20 00 orcc %o0, 0, %i0 2006f60: 12 80 00 23 bne 2006fec <== NEVER TAKEN 2006f64: 90 17 61 04 or %i5, 0x104, %o0 return result; result = 2006f68: 40 00 04 65 call 20080fc 2006f6c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006f70: 80 a2 20 00 cmp %o0, 0 2006f74: 12 80 00 20 bne 2006ff4 <== NEVER TAKEN 2006f78: 39 00 80 67 sethi %hi(0x2019c00), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006f7c: 92 10 20 00 clr %o1 2006f80: 40 00 03 91 call 2007dc4 2006f84: 90 17 20 fc or %i4, 0xfc, %o0 if (result != 0) 2006f88: 80 a2 20 00 cmp %o0, 0 2006f8c: 12 80 00 23 bne 2007018 <== NEVER TAKEN 2006f90: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006f94: 11 00 80 67 sethi %hi(0x2019c00), %o0 2006f98: 40 00 02 8f call 20079d4 2006f9c: 90 12 21 00 or %o0, 0x100, %o0 ! 2019d00 if (result != 0) { 2006fa0: b0 92 20 00 orcc %o0, 0, %i0 2006fa4: 12 80 00 26 bne 200703c <== NEVER TAKEN 2006fa8: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006fac: b8 17 20 fc or %i4, 0xfc, %i4 head->previous = NULL; tail->previous = head; 2006fb0: 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; 2006fb4: 88 07 20 4c add %i4, 0x4c, %g4 head->previous = NULL; tail->previous = head; 2006fb8: 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; 2006fbc: 84 07 20 58 add %i4, 0x58, %g2 head->previous = NULL; tail->previous = head; 2006fc0: 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; 2006fc4: c8 27 20 48 st %g4, [ %i4 + 0x48 ] head->previous = NULL; 2006fc8: c0 27 20 4c clr [ %i4 + 0x4c ] tail->previous = head; 2006fcc: 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; 2006fd0: c4 27 20 54 st %g2, [ %i4 + 0x54 ] head->previous = NULL; 2006fd4: 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; 2006fd8: c0 27 20 64 clr [ %i4 + 0x64 ] aio_request_queue.idle_threads = 0; 2006fdc: c0 27 20 68 clr [ %i4 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006fe0: 03 00 00 2c sethi %hi(0xb000), %g1 2006fe4: 82 10 60 0b or %g1, 0xb, %g1 ! b00b 2006fe8: c2 27 20 60 st %g1, [ %i4 + 0x60 ] return result; } 2006fec: 81 c7 e0 08 ret 2006ff0: 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); 2006ff4: 40 00 04 2a call 200809c <== NOT EXECUTED 2006ff8: 90 17 61 04 or %i5, 0x104, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006ffc: 39 00 80 67 sethi %hi(0x2019c00), %i4 <== NOT EXECUTED 2007000: 92 10 20 00 clr %o1 <== NOT EXECUTED 2007004: 40 00 03 70 call 2007dc4 <== NOT EXECUTED 2007008: 90 17 20 fc or %i4, 0xfc, %o0 <== NOT EXECUTED if (result != 0) 200700c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2007010: 02 bf ff e1 be 2006f94 <== NOT EXECUTED 2007014: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007018: 40 00 04 21 call 200809c <== NOT EXECUTED 200701c: 90 17 61 04 or %i5, 0x104, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2007020: 92 10 20 00 clr %o1 <== NOT EXECUTED 2007024: 11 00 80 67 sethi %hi(0x2019c00), %o0 <== NOT EXECUTED 2007028: 40 00 02 6b call 20079d4 <== NOT EXECUTED 200702c: 90 12 21 00 or %o0, 0x100, %o0 ! 2019d00 <== NOT EXECUTED if (result != 0) { 2007030: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2007034: 22 bf ff df be,a 2006fb0 <== NOT EXECUTED 2007038: b8 17 20 fc or %i4, 0xfc, %i4 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 200703c: 40 00 03 0f call 2007c78 <== NOT EXECUTED 2007040: 90 17 20 fc or %i4, 0xfc, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2007044: 40 00 04 16 call 200809c <== NOT EXECUTED 2007048: 90 17 61 04 or %i5, 0x104, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200704c: 10 bf ff d9 b 2006fb0 <== NOT EXECUTED 2007050: b8 17 20 fc or %i4, 0xfc, %i4 <== NOT EXECUTED =============================================================================== 0200741c : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 200741c: 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; 2007420: 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 ); 2007424: 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)) { 2007428: 80 a0 40 02 cmp %g1, %g2 200742c: 02 80 00 15 be 2007480 <== NEVER TAKEN 2007430: 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 && 2007434: 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; 2007438: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 200743c: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 2007440: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 2007444: 80 a1 00 0f cmp %g4, %o7 2007448: 26 80 00 07 bl,a 2007464 <== NEVER TAKEN 200744c: 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 ); 2007450: 10 80 00 0b b 200747c 2007454: f0 00 60 04 ld [ %g1 + 4 ], %i0 2007458: 22 80 00 09 be,a 200747c <== NOT EXECUTED 200745c: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 2007460: 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; 2007464: 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 && 2007468: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 200746c: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2007470: 06 bf ff fa bl 2007458 <== NOT EXECUTED 2007474: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2007478: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 200747c: b2 10 00 03 mov %g3, %i1 2007480: 40 00 09 84 call 2009a90 <_Chain_Insert> 2007484: 81 e8 00 00 restore =============================================================================== 02007138 : * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007138: 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; 200713c: 05 00 80 67 sethi %hi(0x2019c00), %g2 2007140: 84 10 a0 fc or %g2, 0xfc, %g2 ! 2019cfc 2007144: 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 && 2007148: de 06 20 14 ld [ %i0 + 0x14 ], %o7 200714c: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2007150: 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 && 2007154: 80 a1 00 0f cmp %g4, %o7 2007158: 16 80 00 10 bge 2007198 <== NEVER TAKEN 200715c: 86 10 00 01 mov %g1, %g3 2007160: 84 00 a0 4c add %g2, 0x4c, %g2 2007164: 80 a0 40 02 cmp %g1, %g2 2007168: 32 80 00 08 bne,a 2007188 <== ALWAYS TAKEN 200716c: c6 00 40 00 ld [ %g1 ], %g3 2007170: 10 80 00 0b b 200719c <== NOT EXECUTED 2007174: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 2007178: 80 a0 c0 02 cmp %g3, %g2 200717c: 02 80 00 0a be 20071a4 <== NEVER TAKEN 2007180: 86 10 00 02 mov %g2, %g3 } } AIO_printf ("Thread finished\n"); return NULL; } 2007184: 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 && 2007188: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 200718c: 80 a1 00 0f cmp %g4, %o7 2007190: 06 bf ff fa bl 2007178 2007194: 82 10 00 03 mov %g3, %g1 2007198: f0 00 e0 04 ld [ %g3 + 4 ], %i0 200719c: 40 00 0a 3d call 2009a90 <_Chain_Insert> 20071a0: 81 e8 00 00 restore 20071a4: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED 20071a8: 40 00 0a 3a call 2009a90 <_Chain_Insert> <== NOT EXECUTED 20071ac: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02007488 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2007488: 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; 200748c: 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; 2007490: 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)); 2007494: 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)) 2007498: 80 a7 40 18 cmp %i5, %i0 200749c: 02 80 00 0d be 20074d0 <== NEVER TAKEN 20074a0: b6 10 3f ff mov -1, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20074a4: 40 00 09 63 call 2009a30 <_Chain_Extract> 20074a8: 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; 20074ac: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } } AIO_printf ("Thread finished\n"); return NULL; } 20074b0: 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); 20074b4: 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; 20074b8: f4 20 60 34 st %i2, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 20074bc: 7f ff f0 7e call 20036b4 20074c0: 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)) 20074c4: 80 a7 00 18 cmp %i4, %i0 20074c8: 12 bf ff f7 bne 20074a4 20074cc: ba 10 00 1c mov %i4, %i5 20074d0: 81 c7 e0 08 ret 20074d4: 81 e8 00 00 restore =============================================================================== 020074d8 : * 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) { 20074d8: 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; 20074dc: 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 ); 20074e0: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 20074e4: 80 a7 40 01 cmp %i5, %g1 20074e8: 12 80 00 06 bne 2007500 20074ec: b0 10 20 02 mov 2, %i0 20074f0: 30 80 00 14 b,a 2007540 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) { 20074f4: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 20074f8: 02 80 00 10 be 2007538 <== NOT EXECUTED 20074fc: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED 2007500: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2007504: 80 a0 80 19 cmp %g2, %i1 2007508: 32 bf ff fb bne,a 20074f4 <== NEVER TAKEN 200750c: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2007510: 40 00 09 48 call 2009a30 <_Chain_Extract> 2007514: 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; 2007518: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200751c: 84 10 20 8c mov 0x8c, %g2 2007520: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2007524: 84 10 3f ff mov -1, %g2 free (current); 2007528: 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; 200752c: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2007530: 7f ff f0 61 call 20036b4 2007534: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2007538: 81 c7 e0 08 ret 200753c: 81 e8 00 00 restore } 2007540: 81 c7 e0 08 ret 2007544: 81 e8 00 00 restore =============================================================================== 02007184 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007184: 9d e3 bf 98 save %sp, -104, %sp 2007188: 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 ); 200718c: 40 00 01 a0 call 200780c <_Chain_Get> 2007190: 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( 2007194: 92 10 20 00 clr %o1 2007198: b8 10 00 08 mov %o0, %i4 200719c: 94 10 00 1a mov %i2, %o2 20071a0: 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 20071a4: 80 a7 20 00 cmp %i4, 0 20071a8: 12 80 00 0a bne 20071d0 20071ac: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 20071b0: 7f ff fc f4 call 2006580 20071b4: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 20071b8: 80 a2 20 00 cmp %o0, 0 20071bc: 02 bf ff f4 be 200718c <== NEVER TAKEN 20071c0: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 20071c4: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 20071c8: 81 c7 e0 08 ret 20071cc: 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 20071d0: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 20071d4: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 20071d8: 81 c7 e0 08 ret 20071dc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007e10 : 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 ) { 2007e10: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007e14: 03 00 80 6c sethi %hi(0x201b000), %g1 2007e18: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 201b3a0 <_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 ) { 2007e1c: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2007e20: 03 00 80 6d sethi %hi(0x201b400), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2007e24: 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() ) 2007e28: 80 a0 a0 00 cmp %g2, 0 2007e2c: 02 80 00 04 be 2007e3c 2007e30: de 00 63 d4 ld [ %g1 + 0x3d4 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007e34: 81 c7 e0 08 ret 2007e38: 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 ) 2007e3c: 80 a6 a0 00 cmp %i2, 0 2007e40: 02 80 00 40 be 2007f40 2007e44: 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 ) 2007e48: 02 80 00 3e be 2007f40 2007e4c: 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; 2007e50: c4 06 40 00 ld [ %i1 ], %g2 2007e54: 80 a0 a0 00 cmp %g2, 0 2007e58: 22 80 00 37 be,a 2007f34 2007e5c: 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 ) 2007e60: 80 a3 c0 18 cmp %o7, %i0 2007e64: 08 bf ff f4 bleu 2007e34 2007e68: 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++; 2007e6c: 05 00 80 6b sethi %hi(0x201ac00), %g2 2007e70: c8 00 a2 60 ld [ %g2 + 0x260 ], %g4 ! 201ae60 <_Thread_Dispatch_disable_level> 2007e74: 88 01 20 01 inc %g4 2007e78: c8 20 a2 60 st %g4, [ %g2 + 0x260 ] return _Thread_Dispatch_disable_level; 2007e7c: c4 00 a2 60 ld [ %g2 + 0x260 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2007e80: 80 a6 20 00 cmp %i0, 0 2007e84: 12 80 00 32 bne 2007f4c 2007e88: 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; 2007e8c: c8 00 63 d4 ld [ %g1 + 0x3d4 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2007e90: 80 a1 20 00 cmp %g4, 0 2007e94: 02 80 00 45 be 2007fa8 <== NEVER TAKEN 2007e98: c2 03 e3 d8 ld [ %o7 + 0x3d8 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e9c: 10 80 00 06 b 2007eb4 2007ea0: 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 ) { 2007ea4: 80 a6 00 04 cmp %i0, %g4 2007ea8: 02 80 00 35 be 2007f7c 2007eac: 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; 2007eb0: c4 00 40 00 ld [ %g1 ], %g2 2007eb4: 80 a0 a0 00 cmp %g2, 0 2007eb8: 32 bf ff fb bne,a 2007ea4 2007ebc: b0 06 20 01 inc %i0 2007ec0: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007ec4: 80 a0 a0 00 cmp %g2, 0 2007ec8: 32 bf ff f7 bne,a 2007ea4 2007ecc: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007ed0: f0 26 80 00 st %i0, [ %i2 ] 2007ed4: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2007ed8: 80 a1 00 18 cmp %g4, %i0 2007edc: 02 80 00 29 be 2007f80 <== NEVER TAKEN 2007ee0: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007ee4: c8 00 c0 00 ld [ %g3 ], %g4 2007ee8: c4 03 e3 d8 ld [ %o7 + 0x3d8 ], %g2 2007eec: 82 23 40 01 sub %o5, %g1, %g1 2007ef0: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2007ef4: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2007ef8: 82 00 80 01 add %g2, %g1, %g1 2007efc: c8 20 60 04 st %g4, [ %g1 + 4 ] 2007f00: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007f04: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007f08: c4 20 60 08 st %g2, [ %g1 + 8 ] 2007f0c: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007f10: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007f14: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2007f18: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2007f1c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2007f20: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2007f24: 40 00 08 42 call 200a02c <_Thread_Enable_dispatch> 2007f28: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2007f2c: 40 00 23 98 call 2010d8c 2007f30: 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; 2007f34: 80 a0 a0 00 cmp %g2, 0 2007f38: 12 bf ff cb bne 2007e64 2007f3c: 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; 2007f40: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007f44: 81 c7 e0 08 ret 2007f48: 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; 2007f4c: c8 03 e3 d8 ld [ %o7 + 0x3d8 ], %g4 2007f50: 83 2e 20 03 sll %i0, 3, %g1 2007f54: 9b 2e 20 05 sll %i0, 5, %o5 2007f58: 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; 2007f5c: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2007f60: 80 a3 20 00 cmp %o4, 0 2007f64: 02 80 00 0b be 2007f90 2007f68: 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(); 2007f6c: 40 00 08 30 call 200a02c <_Thread_Enable_dispatch> 2007f70: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2007f74: 10 bf ff b0 b 2007e34 2007f78: 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; 2007f7c: 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(); 2007f80: 40 00 08 2b call 200a02c <_Thread_Enable_dispatch> 2007f84: 01 00 00 00 nop return sc; 2007f88: 10 bf ff ab b 2007e34 2007f8c: 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; 2007f90: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2007f94: 80 a0 a0 00 cmp %g2, 0 2007f98: 12 bf ff f5 bne 2007f6c 2007f9c: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2007fa0: 10 bf ff d1 b 2007ee4 2007fa4: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007fa8: 10 bf ff f6 b 2007f80 <== NOT EXECUTED 2007fac: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 02009588 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2009588: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200958c: 80 a6 20 00 cmp %i0, 0 2009590: 02 80 00 20 be 2009610 <== NEVER TAKEN 2009594: 37 00 80 81 sethi %hi(0x2020400), %i3 2009598: b6 16 e1 1c or %i3, 0x11c, %i3 ! 202051c <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200959c: 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 ]; 20095a0: c2 06 c0 00 ld [ %i3 ], %g1 20095a4: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 20095a8: 80 a7 20 00 cmp %i4, 0 20095ac: 22 80 00 16 be,a 2009604 20095b0: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 20095b4: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 20095b8: 84 90 60 00 orcc %g1, 0, %g2 20095bc: 22 80 00 12 be,a 2009604 20095c0: b6 06 e0 04 add %i3, 4, %i3 20095c4: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 20095c8: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 20095cc: 83 2f 60 02 sll %i5, 2, %g1 20095d0: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 20095d4: 90 90 60 00 orcc %g1, 0, %o0 20095d8: 02 80 00 05 be 20095ec 20095dc: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 20095e0: 9f c6 00 00 call %i0 20095e4: 01 00 00 00 nop 20095e8: 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++ ) { 20095ec: 83 28 a0 10 sll %g2, 0x10, %g1 20095f0: 83 30 60 10 srl %g1, 0x10, %g1 20095f4: 80 a0 40 1d cmp %g1, %i5 20095f8: 3a bf ff f5 bcc,a 20095cc 20095fc: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 2009600: 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++ ) { 2009604: 80 a6 c0 1a cmp %i3, %i2 2009608: 32 bf ff e7 bne,a 20095a4 200960c: c2 06 c0 00 ld [ %i3 ], %g1 2009610: 81 c7 e0 08 ret 2009614: 81 e8 00 00 restore =============================================================================== 020081c8 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 20081c8: 9d e3 bf a0 save %sp, -96, %sp 20081cc: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 20081d0: 80 a6 a0 00 cmp %i2, 0 20081d4: 02 80 00 21 be 2008258 20081d8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 20081dc: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 20081e0: 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 ); 20081e4: 40 00 07 7d call 2009fd8 <_Objects_Get_information> 20081e8: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 20081ec: 80 a2 20 00 cmp %o0, 0 20081f0: 02 80 00 1a be 2008258 20081f4: 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; 20081f8: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 20081fc: 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; 2008200: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008204: 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; 2008208: 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; 200820c: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008210: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 2008214: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2008218: 80 a1 20 00 cmp %g4, 0 200821c: 02 80 00 0d be 2008250 <== NEVER TAKEN 2008220: 84 10 20 00 clr %g2 2008224: de 02 20 1c ld [ %o0 + 0x1c ], %o7 2008228: 86 10 20 01 mov 1, %g3 200822c: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 2008230: 87 28 e0 02 sll %g3, 2, %g3 2008234: 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++ ) 2008238: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 200823c: 80 a0 00 03 cmp %g0, %g3 2008240: 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++ ) 2008244: 80 a1 00 01 cmp %g4, %g1 2008248: 1a bf ff fa bcc 2008230 200824c: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 2008250: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 2008254: b0 10 20 00 clr %i0 } 2008258: 81 c7 e0 08 ret 200825c: 81 e8 00 00 restore =============================================================================== 02013dcc : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2013dcc: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013dd0: 80 a6 20 00 cmp %i0, 0 2013dd4: 12 80 00 04 bne 2013de4 2013dd8: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013ddc: 81 c7 e0 08 ret 2013de0: 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 ) 2013de4: 80 a6 60 00 cmp %i1, 0 2013de8: 02 bf ff fd be 2013ddc 2013dec: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013df0: 80 a7 60 00 cmp %i5, 0 2013df4: 02 bf ff fa be 2013ddc <== NEVER TAKEN 2013df8: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013dfc: 02 bf ff f8 be 2013ddc 2013e00: 82 10 20 08 mov 8, %g1 2013e04: 80 a6 a0 00 cmp %i2, 0 2013e08: 02 bf ff f5 be 2013ddc 2013e0c: 80 a6 80 1b cmp %i2, %i3 2013e10: 0a bf ff f3 bcs 2013ddc 2013e14: 80 8e e0 07 btst 7, %i3 2013e18: 12 bf ff f1 bne 2013ddc 2013e1c: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2013e20: 12 bf ff ef bne 2013ddc 2013e24: 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++; 2013e28: 03 00 80 ed sethi %hi(0x203b400), %g1 2013e2c: c4 00 63 50 ld [ %g1 + 0x350 ], %g2 ! 203b750 <_Thread_Dispatch_disable_level> 2013e30: 84 00 a0 01 inc %g2 2013e34: c4 20 63 50 st %g2, [ %g1 + 0x350 ] return _Thread_Dispatch_disable_level; 2013e38: c2 00 63 50 ld [ %g1 + 0x350 ], %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 ); 2013e3c: 23 00 80 ed sethi %hi(0x203b400), %l1 2013e40: 40 00 13 57 call 2018b9c <_Objects_Allocate> 2013e44: 90 14 61 64 or %l1, 0x164, %o0 ! 203b564 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2013e48: a0 92 20 00 orcc %o0, 0, %l0 2013e4c: 02 80 00 1a be 2013eb4 2013e50: 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; 2013e54: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2013e58: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2013e5c: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2013e60: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2013e64: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2013e68: 40 00 5c 3f call 202af64 <.udiv> 2013e6c: 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, 2013e70: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2013e74: 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, 2013e78: 96 10 00 1b mov %i3, %o3 2013e7c: b8 04 20 24 add %l0, 0x24, %i4 2013e80: 40 00 0c e0 call 2017200 <_Chain_Initialize> 2013e84: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e88: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013e8c: a2 14 61 64 or %l1, 0x164, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e90: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e94: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e98: 85 28 a0 02 sll %g2, 2, %g2 2013e9c: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2013ea0: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2013ea4: 40 00 18 90 call 201a0e4 <_Thread_Enable_dispatch> 2013ea8: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2013eac: 10 bf ff cc b 2013ddc 2013eb0: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2013eb4: 40 00 18 8c call 201a0e4 <_Thread_Enable_dispatch> 2013eb8: 01 00 00 00 nop return RTEMS_TOO_MANY; 2013ebc: 10 bf ff c8 b 2013ddc 2013ec0: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 02007600 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2007600: 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 *) 2007604: 11 00 80 7d sethi %hi(0x201f400), %o0 2007608: 92 10 00 18 mov %i0, %o1 200760c: 90 12 23 c4 or %o0, 0x3c4, %o0 2007610: 40 00 09 78 call 2009bf0 <_Objects_Get> 2007614: 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 ) { 2007618: c2 07 bf fc ld [ %fp + -4 ], %g1 200761c: 80 a0 60 00 cmp %g1, 0 2007620: 12 80 00 0d bne 2007654 2007624: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2007628: 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 ); 200762c: 39 00 80 7f sethi %hi(0x201fc00), %i4 2007630: b8 17 22 68 or %i4, 0x268, %i4 ! 201fe68 <_Per_CPU_Information> 2007634: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007638: 80 a0 80 01 cmp %g2, %g1 200763c: 02 80 00 08 be 200765c 2007640: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 2007644: 40 00 0d 62 call 200abcc <_Thread_Enable_dispatch> 2007648: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 200764c: 81 c7 e0 08 ret 2007650: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007654: 81 c7 e0 08 ret 2007658: 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 ) { 200765c: 12 80 00 0e bne 2007694 2007660: 01 00 00 00 nop switch ( the_period->state ) { 2007664: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007668: 80 a0 60 04 cmp %g1, 4 200766c: 18 80 00 06 bgu 2007684 <== NEVER TAKEN 2007670: b0 10 20 00 clr %i0 2007674: 83 28 60 02 sll %g1, 2, %g1 2007678: 05 00 80 75 sethi %hi(0x201d400), %g2 200767c: 84 10 a1 b4 or %g2, 0x1b4, %g2 ! 201d5b4 2007680: 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(); 2007684: 40 00 0d 52 call 200abcc <_Thread_Enable_dispatch> 2007688: 01 00 00 00 nop return RTEMS_TIMEOUT; 200768c: 81 c7 e0 08 ret 2007690: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 2007694: 7f ff ed e4 call 2002e24 2007698: 01 00 00 00 nop 200769c: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 20076a0: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 20076a4: 80 a6 e0 00 cmp %i3, 0 20076a8: 02 80 00 14 be 20076f8 20076ac: 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 ) { 20076b0: 02 80 00 29 be 2007754 20076b4: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 20076b8: 12 bf ff e5 bne 200764c <== NEVER TAKEN 20076bc: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 20076c0: 7f ff ff 92 call 2007508 <_Rate_monotonic_Update_statistics> 20076c4: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 20076c8: 7f ff ed db call 2002e34 20076cc: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20076d0: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076d4: 92 07 60 10 add %i5, 0x10, %o1 20076d8: 11 00 80 7e sethi %hi(0x201f800), %o0 the_period->next_length = length; 20076dc: f2 27 60 3c st %i1, [ %i5 + 0x3c ] 20076e0: 90 12 21 ec or %o0, 0x1ec, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 20076e4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076e8: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076ec: 40 00 11 5d call 200bc60 <_Watchdog_Insert> 20076f0: b0 10 20 06 mov 6, %i0 20076f4: 30 bf ff e4 b,a 2007684 return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 20076f8: 7f ff ed cf call 2002e34 20076fc: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 2007700: 7f ff ff 68 call 20074a0 <_Rate_monotonic_Initiate_statistics> 2007704: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007708: 82 10 20 02 mov 2, %g1 200770c: 92 07 60 10 add %i5, 0x10, %o1 2007710: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 2007714: 11 00 80 7e sethi %hi(0x201f800), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007718: 03 00 80 1e sethi %hi(0x2007800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200771c: 90 12 21 ec or %o0, 0x1ec, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007720: 82 10 62 a8 or %g1, 0x2a8, %g1 the_watchdog->id = id; 2007724: f0 27 60 30 st %i0, [ %i5 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007728: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200772c: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 2007730: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 2007734: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007738: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200773c: 40 00 11 49 call 200bc60 <_Watchdog_Insert> 2007740: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 2007744: 40 00 0d 22 call 200abcc <_Thread_Enable_dispatch> 2007748: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 200774c: 81 c7 e0 08 ret 2007750: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007754: 7f ff ff 6d call 2007508 <_Rate_monotonic_Update_statistics> 2007758: 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; 200775c: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007760: 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; 2007764: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007768: 7f ff ed b3 call 2002e34 200776c: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007770: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007774: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007778: 90 10 00 01 mov %g1, %o0 200777c: 13 00 00 10 sethi %hi(0x4000), %o1 2007780: 40 00 0f 6f call 200b53c <_Thread_Set_state> 2007784: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007788: 7f ff ed a7 call 2002e24 200778c: 01 00 00 00 nop local_state = the_period->state; 2007790: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 2007794: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007798: 7f ff ed a7 call 2002e34 200779c: 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 ) 20077a0: 80 a6 a0 03 cmp %i2, 3 20077a4: 22 80 00 06 be,a 20077bc 20077a8: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 20077ac: 40 00 0d 08 call 200abcc <_Thread_Enable_dispatch> 20077b0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 20077b4: 81 c7 e0 08 ret 20077b8: 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 ); 20077bc: 40 00 0c 12 call 200a804 <_Thread_Clear_state> 20077c0: 13 00 00 10 sethi %hi(0x4000), %o1 20077c4: 30 bf ff fa b,a 20077ac =============================================================================== 020077c8 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 20077c8: 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 ) 20077cc: 80 a6 60 00 cmp %i1, 0 20077d0: 02 80 00 48 be 20078f0 <== NEVER TAKEN 20077d4: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 20077d8: 13 00 80 75 sethi %hi(0x201d400), %o1 20077dc: 9f c6 40 00 call %i1 20077e0: 92 12 61 c8 or %o1, 0x1c8, %o1 ! 201d5c8 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 20077e4: 90 10 00 18 mov %i0, %o0 20077e8: 13 00 80 75 sethi %hi(0x201d400), %o1 20077ec: 9f c6 40 00 call %i1 20077f0: 92 12 61 e8 or %o1, 0x1e8, %o1 ! 201d5e8 (*print)( context, "--- Wall times are in seconds ---\n" ); 20077f4: 90 10 00 18 mov %i0, %o0 20077f8: 13 00 80 75 sethi %hi(0x201d400), %o1 20077fc: 9f c6 40 00 call %i1 2007800: 92 12 62 10 or %o1, 0x210, %o1 ! 201d610 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2007804: 90 10 00 18 mov %i0, %o0 2007808: 13 00 80 75 sethi %hi(0x201d400), %o1 200780c: 9f c6 40 00 call %i1 2007810: 92 12 62 38 or %o1, 0x238, %o1 ! 201d638 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 2007814: 90 10 00 18 mov %i0, %o0 2007818: 13 00 80 75 sethi %hi(0x201d400), %o1 200781c: 9f c6 40 00 call %i1 2007820: 92 12 62 88 or %o1, 0x288, %o1 ! 201d688 /* * 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 ; 2007824: 39 00 80 7d sethi %hi(0x201f400), %i4 2007828: b8 17 23 c4 or %i4, 0x3c4, %i4 ! 201f7c4 <_Rate_monotonic_Information> 200782c: fa 07 20 08 ld [ %i4 + 8 ], %i5 2007830: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007834: 80 a7 40 01 cmp %i5, %g1 2007838: 18 80 00 2e bgu 20078f0 <== NEVER TAKEN 200783c: 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, 2007840: 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, 2007844: 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" ); 2007848: 37 00 80 72 sethi %hi(0x201c800), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200784c: b4 16 a2 d8 or %i2, 0x2d8, %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, 2007850: a2 14 62 f0 or %l1, 0x2f0, %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, 2007854: a0 14 23 10 or %l0, 0x310, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007858: 10 80 00 06 b 2007870 200785c: b6 16 e0 48 or %i3, 0x48, %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++ ) { 2007860: 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 ; 2007864: 80 a0 40 1d cmp %g1, %i5 2007868: 0a 80 00 22 bcs 20078f0 200786c: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007870: 90 10 00 1d mov %i5, %o0 2007874: 40 00 1b d0 call 200e7b4 2007878: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 200787c: 80 a2 20 00 cmp %o0, 0 2007880: 32 bf ff f8 bne,a 2007860 2007884: 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 ); 2007888: 92 07 bf d8 add %fp, -40, %o1 200788c: 40 00 1b f9 call 200e870 2007890: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2007894: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007898: 92 10 20 05 mov 5, %o1 200789c: 40 00 00 b4 call 2007b6c 20078a0: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 20078a4: d8 1f bf a0 ldd [ %fp + -96 ], %o4 20078a8: 92 10 00 1a mov %i2, %o1 20078ac: 94 10 00 1d mov %i5, %o2 20078b0: 90 10 00 18 mov %i0, %o0 20078b4: 9f c6 40 00 call %i1 20078b8: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 20078bc: 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 ); 20078c0: 94 07 bf f0 add %fp, -16, %o2 20078c4: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 20078c8: 80 a0 60 00 cmp %g1, 0 20078cc: 12 80 00 0b bne 20078f8 20078d0: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 20078d4: 9f c6 40 00 call %i1 20078d8: 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 ; 20078dc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20078e0: 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 ; 20078e4: 80 a0 40 1d cmp %g1, %i5 20078e8: 1a bf ff e3 bcc 2007874 <== ALWAYS TAKEN 20078ec: 90 10 00 1d mov %i5, %o0 20078f0: 81 c7 e0 08 ret 20078f4: 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 ); 20078f8: 40 00 0f 9e call 200b770 <_Timespec_Divide_by_integer> 20078fc: 92 10 00 01 mov %g1, %o1 (*print)( context, 2007900: d0 07 bf ac ld [ %fp + -84 ], %o0 2007904: 40 00 4a 2f call 201a1c0 <.div> 2007908: 92 10 23 e8 mov 0x3e8, %o1 200790c: aa 10 00 08 mov %o0, %l5 2007910: d0 07 bf b4 ld [ %fp + -76 ], %o0 2007914: 40 00 4a 2b call 201a1c0 <.div> 2007918: 92 10 23 e8 mov 0x3e8, %o1 200791c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007920: a6 10 00 08 mov %o0, %l3 2007924: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007928: e4 07 bf a8 ld [ %fp + -88 ], %l2 200792c: e8 07 bf b0 ld [ %fp + -80 ], %l4 2007930: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007934: 40 00 4a 23 call 201a1c0 <.div> 2007938: 92 10 23 e8 mov 0x3e8, %o1 200793c: 96 10 00 15 mov %l5, %o3 2007940: 98 10 00 14 mov %l4, %o4 2007944: 9a 10 00 13 mov %l3, %o5 2007948: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 200794c: 92 10 00 11 mov %l1, %o1 2007950: 94 10 00 12 mov %l2, %o2 2007954: 9f c6 40 00 call %i1 2007958: 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); 200795c: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007960: 94 07 bf f0 add %fp, -16, %o2 2007964: 40 00 0f 83 call 200b770 <_Timespec_Divide_by_integer> 2007968: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 200796c: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007970: 40 00 4a 14 call 201a1c0 <.div> 2007974: 92 10 23 e8 mov 0x3e8, %o1 2007978: a8 10 00 08 mov %o0, %l4 200797c: d0 07 bf cc ld [ %fp + -52 ], %o0 2007980: 40 00 4a 10 call 201a1c0 <.div> 2007984: 92 10 23 e8 mov 0x3e8, %o1 2007988: c2 07 bf f0 ld [ %fp + -16 ], %g1 200798c: a4 10 00 08 mov %o0, %l2 2007990: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007994: ea 07 bf c0 ld [ %fp + -64 ], %l5 2007998: e6 07 bf c8 ld [ %fp + -56 ], %l3 200799c: 92 10 23 e8 mov 0x3e8, %o1 20079a0: 40 00 4a 08 call 201a1c0 <.div> 20079a4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20079a8: 92 10 00 10 mov %l0, %o1 20079ac: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 20079b0: 94 10 00 15 mov %l5, %o2 20079b4: 90 10 00 18 mov %i0, %o0 20079b8: 96 10 00 14 mov %l4, %o3 20079bc: 98 10 00 13 mov %l3, %o4 20079c0: 9f c6 40 00 call %i1 20079c4: 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 ; 20079c8: 10 bf ff a6 b 2007860 20079cc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 020079e8 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 20079e8: 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++; 20079ec: 03 00 80 7e sethi %hi(0x201f800), %g1 20079f0: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 201f930 <_Thread_Dispatch_disable_level> 20079f4: 84 00 a0 01 inc %g2 20079f8: c4 20 61 30 st %g2, [ %g1 + 0x130 ] return _Thread_Dispatch_disable_level; 20079fc: c2 00 61 30 ld [ %g1 + 0x130 ], %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 ; 2007a00: 39 00 80 7d sethi %hi(0x201f400), %i4 2007a04: b8 17 23 c4 or %i4, 0x3c4, %i4 ! 201f7c4 <_Rate_monotonic_Information> 2007a08: fa 07 20 08 ld [ %i4 + 8 ], %i5 2007a0c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007a10: 80 a7 40 01 cmp %i5, %g1 2007a14: 18 80 00 09 bgu 2007a38 <== NEVER TAKEN 2007a18: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 2007a1c: 40 00 00 09 call 2007a40 2007a20: 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 ; 2007a24: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2007a28: 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 ; 2007a2c: 80 a0 40 1d cmp %g1, %i5 2007a30: 1a bf ff fb bcc 2007a1c 2007a34: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2007a38: 40 00 0c 65 call 200abcc <_Thread_Enable_dispatch> 2007a3c: 81 e8 00 00 restore =============================================================================== 02015388 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2015388: 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 ) 201538c: 80 a6 60 00 cmp %i1, 0 2015390: 12 80 00 04 bne 20153a0 2015394: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015398: 81 c7 e0 08 ret 201539c: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20153a0: 90 10 00 18 mov %i0, %o0 20153a4: 40 00 13 5d call 201a118 <_Thread_Get> 20153a8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20153ac: c2 07 bf fc ld [ %fp + -4 ], %g1 20153b0: 80 a0 60 00 cmp %g1, 0 20153b4: 12 80 00 20 bne 2015434 20153b8: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20153bc: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 20153c0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20153c4: 80 a0 60 00 cmp %g1, 0 20153c8: 02 80 00 1e be 2015440 20153cc: 01 00 00 00 nop if ( asr->is_enabled ) { 20153d0: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 20153d4: 80 a0 60 00 cmp %g1, 0 20153d8: 02 80 00 1e be 2015450 20153dc: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 20153e0: 7f ff e6 bb call 200eecc 20153e4: 01 00 00 00 nop *signal_set |= signals; 20153e8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20153ec: b2 10 40 19 or %g1, %i1, %i1 20153f0: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 20153f4: 7f ff e6 ba call 200eedc 20153f8: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20153fc: 03 00 80 ef sethi %hi(0x203bc00), %g1 2015400: 82 10 60 90 or %g1, 0x90, %g1 ! 203bc90 <_Per_CPU_Information> 2015404: c4 00 60 08 ld [ %g1 + 8 ], %g2 2015408: 80 a0 a0 00 cmp %g2, 0 201540c: 02 80 00 06 be 2015424 2015410: 01 00 00 00 nop 2015414: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015418: 80 a7 00 02 cmp %i4, %g2 201541c: 02 80 00 15 be 2015470 <== ALWAYS TAKEN 2015420: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015424: 40 00 13 30 call 201a0e4 <_Thread_Enable_dispatch> 2015428: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 201542c: 10 bf ff db b 2015398 2015430: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2015434: 82 10 20 04 mov 4, %g1 } 2015438: 81 c7 e0 08 ret 201543c: 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(); 2015440: 40 00 13 29 call 201a0e4 <_Thread_Enable_dispatch> 2015444: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2015448: 10 bf ff d4 b 2015398 201544c: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015450: 7f ff e6 9f call 200eecc 2015454: 01 00 00 00 nop *signal_set |= signals; 2015458: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 201545c: b2 10 40 19 or %g1, %i1, %i1 2015460: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2015464: 7f ff e6 9e call 200eedc 2015468: 01 00 00 00 nop 201546c: 30 bf ff ee b,a 2015424 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; 2015470: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015474: 30 bf ff ec b,a 2015424 =============================================================================== 0200f464 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200f464: 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 ) 200f468: 80 a6 a0 00 cmp %i2, 0 200f46c: 02 80 00 3b be 200f558 200f470: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200f474: 21 00 80 77 sethi %hi(0x201dc00), %l0 200f478: a0 14 23 f8 or %l0, 0x3f8, %l0 ! 201dff8 <_Per_CPU_Information> 200f47c: 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; 200f480: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f484: 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; 200f488: 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 ]; 200f48c: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200f490: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200f494: 80 a0 60 00 cmp %g1, 0 200f498: 12 80 00 40 bne 200f598 200f49c: 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; 200f4a0: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 200f4a4: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200f4a8: 7f ff ed 14 call 200a8f8 <_CPU_ISR_Get_level> 200f4ac: 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; 200f4b0: a3 2c 60 0a sll %l1, 0xa, %l1 200f4b4: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200f4b8: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200f4bc: 80 8e 61 00 btst 0x100, %i1 200f4c0: 02 80 00 06 be 200f4d8 200f4c4: 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; 200f4c8: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200f4cc: 80 a0 00 01 cmp %g0, %g1 200f4d0: 82 60 3f ff subx %g0, -1, %g1 200f4d4: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200f4d8: 80 8e 62 00 btst 0x200, %i1 200f4dc: 12 80 00 21 bne 200f560 200f4e0: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f4e4: 80 8e 60 0f btst 0xf, %i1 200f4e8: 12 80 00 27 bne 200f584 200f4ec: 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 ) { 200f4f0: 80 8e 64 00 btst 0x400, %i1 200f4f4: 02 80 00 14 be 200f544 200f4f8: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200f4fc: 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; 200f500: 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( 200f504: 80 a0 00 18 cmp %g0, %i0 200f508: 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 ) { 200f50c: 80 a0 80 01 cmp %g2, %g1 200f510: 22 80 00 0e be,a 200f548 200f514: 03 00 80 77 sethi %hi(0x201dc00), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200f518: 7f ff cb 33 call 20021e4 200f51c: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 200f520: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200f524: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 200f528: 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; 200f52c: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200f530: 7f ff cb 31 call 20021f4 200f534: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200f538: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200f53c: 80 a0 00 01 cmp %g0, %g1 200f540: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200f544: 03 00 80 77 sethi %hi(0x201dc00), %g1 200f548: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 ! 201dc14 <_System_state_Current> 200f54c: 80 a0 a0 03 cmp %g2, 3 200f550: 02 80 00 1f be 200f5cc 200f554: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 200f558: 81 c7 e0 08 ret 200f55c: 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) ) { 200f560: 22 bf ff e1 be,a 200f4e4 200f564: c0 27 60 7c clr [ %i5 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200f568: 03 00 80 76 sethi %hi(0x201d800), %g1 200f56c: c2 00 62 24 ld [ %g1 + 0x224 ], %g1 ! 201da24 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f570: 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; 200f574: 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; 200f578: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f57c: 02 bf ff dd be 200f4f0 200f580: 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 ); 200f584: 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 ) ); 200f588: 7f ff cb 1b call 20021f4 200f58c: 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 ) { 200f590: 10 bf ff d9 b 200f4f4 200f594: 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; 200f598: 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; 200f59c: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200f5a0: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200f5a4: 7f ff ec d5 call 200a8f8 <_CPU_ISR_Get_level> 200f5a8: 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; 200f5ac: a3 2c 60 0a sll %l1, 0xa, %l1 200f5b0: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200f5b4: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200f5b8: 80 8e 61 00 btst 0x100, %i1 200f5bc: 02 bf ff c7 be 200f4d8 200f5c0: 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; 200f5c4: 10 bf ff c2 b 200f4cc 200f5c8: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 200f5cc: 80 88 e0 ff btst 0xff, %g3 200f5d0: 12 80 00 0a bne 200f5f8 200f5d4: c4 04 20 0c ld [ %l0 + 0xc ], %g2 200f5d8: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 200f5dc: 80 a0 80 03 cmp %g2, %g3 200f5e0: 02 bf ff de be 200f558 200f5e4: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200f5e8: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200f5ec: 80 a0 a0 00 cmp %g2, 0 200f5f0: 02 bf ff da be 200f558 <== NEVER TAKEN 200f5f4: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200f5f8: 82 10 20 01 mov 1, %g1 ! 1 200f5fc: 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(); 200f600: 7f ff e7 14 call 2009250 <_Thread_Dispatch> 200f604: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200f608: 82 10 20 00 clr %g1 ! 0 } 200f60c: 81 c7 e0 08 ret 200f610: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200b1f4 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200b1f4: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200b1f8: 80 a6 60 00 cmp %i1, 0 200b1fc: 02 80 00 07 be 200b218 200b200: 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 ) ); 200b204: 03 00 80 6a sethi %hi(0x201a800), %g1 200b208: c2 08 61 7c ldub [ %g1 + 0x17c ], %g1 ! 201a97c */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200b20c: 80 a6 40 01 cmp %i1, %g1 200b210: 18 80 00 1c bgu 200b280 200b214: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200b218: 80 a6 a0 00 cmp %i2, 0 200b21c: 02 80 00 19 be 200b280 200b220: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200b224: 40 00 0a 13 call 200da70 <_Thread_Get> 200b228: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b22c: c2 07 bf fc ld [ %fp + -4 ], %g1 200b230: 80 a0 60 00 cmp %g1, 0 200b234: 12 80 00 13 bne 200b280 200b238: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b23c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b240: 80 a6 60 00 cmp %i1, 0 200b244: 02 80 00 0d be 200b278 200b248: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b24c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b250: 80 a0 60 00 cmp %g1, 0 200b254: 02 80 00 06 be 200b26c 200b258: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200b25c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b260: 80 a6 40 01 cmp %i1, %g1 200b264: 1a 80 00 05 bcc 200b278 <== ALWAYS TAKEN 200b268: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200b26c: 92 10 00 19 mov %i1, %o1 200b270: 40 00 08 b6 call 200d548 <_Thread_Change_priority> 200b274: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b278: 40 00 09 f1 call 200da3c <_Thread_Enable_dispatch> 200b27c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200b280: 81 c7 e0 08 ret 200b284: 81 e8 00 00 restore =============================================================================== 02007644 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 2007644: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 2007648: 80 a6 60 00 cmp %i1, 0 200764c: 02 80 00 1e be 20076c4 2007650: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 2007654: 90 10 00 18 mov %i0, %o0 2007658: 40 00 09 96 call 2009cb0 <_Thread_Get> 200765c: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007660: c2 07 bf fc ld [ %fp + -4 ], %g1 2007664: 80 a0 60 00 cmp %g1, 0 2007668: 12 80 00 19 bne 20076cc 200766c: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2007670: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2007674: 80 a0 60 00 cmp %g1, 0 2007678: 02 80 00 10 be 20076b8 200767c: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007680: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007684: 80 a0 80 19 cmp %g2, %i1 2007688: 32 80 00 09 bne,a 20076ac 200768c: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2007690: 10 80 00 18 b 20076f0 2007694: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2007698: 80 a0 80 19 cmp %g2, %i1 200769c: 22 80 00 0e be,a 20076d4 20076a0: c4 02 40 00 ld [ %o1 ], %g2 20076a4: 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; 20076a8: 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) { 20076ac: 80 a2 60 00 cmp %o1, 0 20076b0: 32 bf ff fa bne,a 2007698 <== ALWAYS TAKEN 20076b4: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 20076b8: 40 00 09 71 call 2009c7c <_Thread_Enable_dispatch> 20076bc: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 20076c0: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20076c4: 81 c7 e0 08 ret 20076c8: 91 e8 00 01 restore %g0, %g1, %o0 20076cc: 81 c7 e0 08 ret 20076d0: 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; 20076d4: 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 ); 20076d8: 40 00 00 2d call 200778c <_RTEMS_Tasks_Invoke_task_variable_dtor> 20076dc: 01 00 00 00 nop _Thread_Enable_dispatch(); 20076e0: 40 00 09 67 call 2009c7c <_Thread_Enable_dispatch> 20076e4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20076e8: 10 bf ff f7 b 20076c4 20076ec: 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; 20076f0: 92 10 00 01 mov %g1, %o1 20076f4: 10 bf ff f9 b 20076d8 20076f8: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020076fc : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20076fc: 9d e3 bf 98 save %sp, -104, %sp 2007700: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 2007704: 80 a6 60 00 cmp %i1, 0 2007708: 02 80 00 1b be 2007774 200770c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 2007710: 80 a6 a0 00 cmp %i2, 0 2007714: 02 80 00 1c be 2007784 2007718: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 200771c: 40 00 09 65 call 2009cb0 <_Thread_Get> 2007720: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007724: c2 07 bf fc ld [ %fp + -4 ], %g1 2007728: 80 a0 60 00 cmp %g1, 0 200772c: 12 80 00 12 bne 2007774 2007730: 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; 2007734: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2007738: 80 a0 60 00 cmp %g1, 0 200773c: 32 80 00 07 bne,a 2007758 2007740: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007744: 30 80 00 0e b,a 200777c 2007748: 80 a0 60 00 cmp %g1, 0 200774c: 02 80 00 0c be 200777c <== NEVER TAKEN 2007750: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007754: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007758: 80 a0 80 19 cmp %g2, %i1 200775c: 32 bf ff fb bne,a 2007748 2007760: 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; 2007764: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 2007768: 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(); 200776c: 40 00 09 44 call 2009c7c <_Thread_Enable_dispatch> 2007770: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2007774: 81 c7 e0 08 ret 2007778: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 200777c: 40 00 09 40 call 2009c7c <_Thread_Enable_dispatch> 2007780: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 2007784: 81 c7 e0 08 ret 2007788: 81 e8 00 00 restore =============================================================================== 02015de8 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2015de8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015dec: 11 00 80 f0 sethi %hi(0x203c000), %o0 2015df0: 92 10 00 18 mov %i0, %o1 2015df4: 90 12 20 d4 or %o0, 0xd4, %o0 2015df8: 40 00 0c c4 call 2019108 <_Objects_Get> 2015dfc: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015e00: c2 07 bf fc ld [ %fp + -4 ], %g1 2015e04: 80 a0 60 00 cmp %g1, 0 2015e08: 12 80 00 0c bne 2015e38 2015e0c: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015e10: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015e14: 80 a0 60 04 cmp %g1, 4 2015e18: 02 80 00 04 be 2015e28 <== NEVER TAKEN 2015e1c: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015e20: 40 00 15 8f call 201b45c <_Watchdog_Remove> 2015e24: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2015e28: 40 00 10 af call 201a0e4 <_Thread_Enable_dispatch> 2015e2c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2015e30: 81 c7 e0 08 ret 2015e34: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015e38: 81 c7 e0 08 ret 2015e3c: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02016310 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016310: 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; 2016314: 03 00 80 f0 sethi %hi(0x203c000), %g1 2016318: fa 00 61 14 ld [ %g1 + 0x114 ], %i5 ! 203c114 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 201631c: 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 ) 2016320: 80 a7 60 00 cmp %i5, 0 2016324: 02 80 00 32 be 20163ec 2016328: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 201632c: 03 00 80 ed sethi %hi(0x203b400), %g1 2016330: c2 08 63 60 ldub [ %g1 + 0x360 ], %g1 ! 203b760 <_TOD_Is_set> 2016334: 80 a0 60 00 cmp %g1, 0 2016338: 02 80 00 2d be 20163ec <== NEVER TAKEN 201633c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2016340: 80 a6 a0 00 cmp %i2, 0 2016344: 02 80 00 2a be 20163ec 2016348: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 201634c: 90 10 00 19 mov %i1, %o0 2016350: 7f ff f3 d5 call 20132a4 <_TOD_Validate> 2016354: b0 10 20 14 mov 0x14, %i0 2016358: 80 8a 20 ff btst 0xff, %o0 201635c: 02 80 00 24 be 20163ec 2016360: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2016364: 7f ff f3 9c call 20131d4 <_TOD_To_seconds> 2016368: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 201636c: 21 00 80 ed sethi %hi(0x203b400), %l0 2016370: c2 04 23 dc ld [ %l0 + 0x3dc ], %g1 ! 203b7dc <_TOD_Now> 2016374: 80 a2 00 01 cmp %o0, %g1 2016378: 08 80 00 1d bleu 20163ec 201637c: b2 10 00 08 mov %o0, %i1 2016380: 92 10 00 1c mov %i4, %o1 2016384: 11 00 80 f0 sethi %hi(0x203c000), %o0 2016388: 94 07 bf fc add %fp, -4, %o2 201638c: 40 00 0b 5f call 2019108 <_Objects_Get> 2016390: 90 12 20 d4 or %o0, 0xd4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016394: c2 07 bf fc ld [ %fp + -4 ], %g1 2016398: 80 a0 60 00 cmp %g1, 0 201639c: 12 80 00 16 bne 20163f4 20163a0: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 20163a4: 40 00 14 2e call 201b45c <_Watchdog_Remove> 20163a8: 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(); 20163ac: c4 04 23 dc ld [ %l0 + 0x3dc ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 20163b0: c2 07 60 04 ld [ %i5 + 4 ], %g1 20163b4: 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(); 20163b8: b2 26 40 02 sub %i1, %g2, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 20163bc: 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; 20163c0: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20163c4: f4 26 20 2c st %i2, [ %i0 + 0x2c ] 20163c8: c4 26 20 38 st %g2, [ %i0 + 0x38 ] the_watchdog->id = id; 20163cc: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 20163d0: 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(); 20163d4: f2 26 20 1c st %i1, [ %i0 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20163d8: c0 26 20 18 clr [ %i0 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 20163dc: 9f c0 40 00 call %g1 20163e0: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20163e4: 40 00 0f 40 call 201a0e4 <_Thread_Enable_dispatch> 20163e8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20163ec: 81 c7 e0 08 ret 20163f0: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20163f4: 81 c7 e0 08 ret 20163f8: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02006da8 : #include int sched_get_priority_max( int policy ) { 2006da8: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006dac: 80 a6 20 04 cmp %i0, 4 2006db0: 08 80 00 08 bleu 2006dd0 2006db4: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006db8: 40 00 25 5c call 2010328 <__errno> 2006dbc: b0 10 3f ff mov -1, %i0 2006dc0: 82 10 20 16 mov 0x16, %g1 2006dc4: c2 22 00 00 st %g1, [ %o0 ] 2006dc8: 81 c7 e0 08 ret 2006dcc: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2006dd0: b1 28 40 18 sll %g1, %i0, %i0 2006dd4: 80 8e 20 17 btst 0x17, %i0 2006dd8: 02 bf ff f8 be 2006db8 <== NEVER TAKEN 2006ddc: 03 00 80 75 sethi %hi(0x201d400), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2006de0: f0 08 63 cc ldub [ %g1 + 0x3cc ], %i0 ! 201d7cc } 2006de4: 81 c7 e0 08 ret 2006de8: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006dec : #include int sched_get_priority_min( int policy ) { 2006dec: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006df0: 80 a6 20 04 cmp %i0, 4 2006df4: 08 80 00 09 bleu 2006e18 2006df8: 84 10 20 01 mov 1, %g2 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006dfc: 40 00 25 4b call 2010328 <__errno> 2006e00: 01 00 00 00 nop 2006e04: 82 10 3f ff mov -1, %g1 ! ffffffff 2006e08: 84 10 20 16 mov 0x16, %g2 2006e0c: c4 22 00 00 st %g2, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006e10: 81 c7 e0 08 ret 2006e14: 91 e8 00 01 restore %g0, %g1, %o0 int sched_get_priority_min( int policy ) { switch ( policy ) { 2006e18: b1 28 80 18 sll %g2, %i0, %i0 2006e1c: 80 8e 20 17 btst 0x17, %i0 2006e20: 02 bf ff f7 be 2006dfc <== NEVER TAKEN 2006e24: 82 10 20 01 mov 1, %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006e28: 81 c7 e0 08 ret 2006e2c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006e30 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2006e30: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006e34: 80 a6 20 00 cmp %i0, 0 2006e38: 12 80 00 0a bne 2006e60 <== ALWAYS TAKEN 2006e3c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 2006e40: 02 80 00 13 be 2006e8c 2006e44: 03 00 80 79 sethi %hi(0x201e400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006e48: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 ! 201e414 <_Thread_Ticks_per_timeslice> 2006e4c: 92 10 00 19 mov %i1, %o1 2006e50: 40 00 0f 67 call 200abec <_Timespec_From_ticks> 2006e54: b0 10 20 00 clr %i0 return 0; } 2006e58: 81 c7 e0 08 ret 2006e5c: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2006e60: 7f ff f1 38 call 2003340 2006e64: 01 00 00 00 nop 2006e68: 80 a2 00 18 cmp %o0, %i0 2006e6c: 02 bf ff f5 be 2006e40 2006e70: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2006e74: 40 00 25 2d call 2010328 <__errno> 2006e78: b0 10 3f ff mov -1, %i0 2006e7c: 82 10 20 03 mov 3, %g1 2006e80: c2 22 00 00 st %g1, [ %o0 ] 2006e84: 81 c7 e0 08 ret 2006e88: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 2006e8c: 40 00 25 27 call 2010328 <__errno> 2006e90: b0 10 3f ff mov -1, %i0 2006e94: 82 10 20 16 mov 0x16, %g1 2006e98: c2 22 00 00 st %g1, [ %o0 ] 2006e9c: 81 c7 e0 08 ret 2006ea0: 81 e8 00 00 restore =============================================================================== 020097ec : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 20097ec: 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++; 20097f0: 03 00 80 8d sethi %hi(0x2023400), %g1 20097f4: c4 00 62 50 ld [ %g1 + 0x250 ], %g2 ! 2023650 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 20097f8: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 20097fc: 84 00 a0 01 inc %g2 2009800: c4 20 62 50 st %g2, [ %g1 + 0x250 ] return _Thread_Dispatch_disable_level; 2009804: c2 00 62 50 ld [ %g1 + 0x250 ], %g1 2009808: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 200980c: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2009810: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2009814: b8 8e 62 00 andcc %i1, 0x200, %i4 2009818: 12 80 00 25 bne 20098ac 200981c: 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 ); 2009820: 90 10 00 18 mov %i0, %o0 2009824: 40 00 1c 0a call 201084c <_POSIX_Semaphore_Name_to_id> 2009828: 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 ) { 200982c: b6 92 20 00 orcc %o0, 0, %i3 2009830: 22 80 00 0e be,a 2009868 2009834: 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) ) ) { 2009838: 80 a6 e0 02 cmp %i3, 2 200983c: 12 80 00 04 bne 200984c <== NEVER TAKEN 2009840: 80 a7 20 00 cmp %i4, 0 2009844: 12 80 00 1e bne 20098bc 2009848: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 200984c: 40 00 0c b8 call 200cb2c <_Thread_Enable_dispatch> 2009850: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 2009854: 40 00 28 cb call 2013b80 <__errno> 2009858: 01 00 00 00 nop 200985c: f6 22 00 00 st %i3, [ %o0 ] 2009860: 81 c7 e0 08 ret 2009864: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2009868: 80 a6 6a 00 cmp %i1, 0xa00 200986c: 02 80 00 20 be 20098ec 2009870: d2 07 bf f4 ld [ %fp + -12 ], %o1 2009874: 94 07 bf fc add %fp, -4, %o2 2009878: 11 00 80 8e sethi %hi(0x2023800), %o0 200987c: 40 00 08 c2 call 200bb84 <_Objects_Get> 2009880: 90 12 21 10 or %o0, 0x110, %o0 ! 2023910 <_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; 2009884: 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 ); 2009888: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 200988c: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2009890: 40 00 0c a7 call 200cb2c <_Thread_Enable_dispatch> 2009894: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 2009898: 40 00 0c a5 call 200cb2c <_Thread_Enable_dispatch> 200989c: 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; 20098a0: f0 07 bf f8 ld [ %fp + -8 ], %i0 } 20098a4: 81 c7 e0 08 ret 20098a8: 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 ); 20098ac: 82 07 a0 54 add %fp, 0x54, %g1 20098b0: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 20098b4: 10 bf ff db b 2009820 20098b8: 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( 20098bc: 92 10 20 00 clr %o1 20098c0: 96 07 bf f8 add %fp, -8, %o3 20098c4: 40 00 1b 86 call 20106dc <_POSIX_Semaphore_Create_support> 20098c8: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 20098cc: 40 00 0c 98 call 200cb2c <_Thread_Enable_dispatch> 20098d0: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 20098d4: 80 a7 7f ff cmp %i5, -1 20098d8: 02 bf ff e2 be 2009860 20098dc: 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; 20098e0: f0 07 bf f8 ld [ %fp + -8 ], %i0 20098e4: 81 c7 e0 08 ret 20098e8: 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(); 20098ec: 40 00 0c 90 call 200cb2c <_Thread_Enable_dispatch> 20098f0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 20098f4: 40 00 28 a3 call 2013b80 <__errno> 20098f8: 01 00 00 00 nop 20098fc: 82 10 20 11 mov 0x11, %g1 ! 11 2009900: c2 22 00 00 st %g1, [ %o0 ] 2009904: 81 c7 e0 08 ret 2009908: 81 e8 00 00 restore =============================================================================== 02009968 : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 2009968: 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 ); 200996c: 90 10 00 19 mov %i1, %o0 2009970: 40 00 18 f1 call 200fd34 <_POSIX_Absolute_timeout_to_ticks> 2009974: 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 ); 2009978: 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 ) 200997c: 80 a2 20 03 cmp %o0, 3 2009980: 02 80 00 06 be 2009998 <== ALWAYS TAKEN 2009984: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 2009988: 40 00 1b d3 call 20108d4 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 200998c: 92 10 20 00 clr %o1 <== NOT EXECUTED 2009990: 81 c7 e0 08 ret <== NOT EXECUTED 2009994: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 2009998: 40 00 1b cf call 20108d4 <_POSIX_Semaphore_Wait_support> 200999c: 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; } 20099a0: 81 c7 e0 08 ret 20099a4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006c74 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 2006c74: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2006c78: 80 a6 a0 00 cmp %i2, 0 2006c7c: 02 80 00 0d be 2006cb0 2006c80: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 2006c84: 05 00 80 6a sethi %hi(0x201a800), %g2 2006c88: 83 2e 20 04 sll %i0, 4, %g1 2006c8c: 84 10 a3 b0 or %g2, 0x3b0, %g2 2006c90: 82 20 40 03 sub %g1, %g3, %g1 2006c94: c6 00 80 01 ld [ %g2 + %g1 ], %g3 2006c98: 82 00 80 01 add %g2, %g1, %g1 2006c9c: c6 26 80 00 st %g3, [ %i2 ] 2006ca0: c4 00 60 04 ld [ %g1 + 4 ], %g2 2006ca4: c4 26 a0 04 st %g2, [ %i2 + 4 ] 2006ca8: c2 00 60 08 ld [ %g1 + 8 ], %g1 2006cac: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 2006cb0: 80 a6 20 00 cmp %i0, 0 2006cb4: 02 80 00 33 be 2006d80 2006cb8: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006cbc: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006cc0: 80 a0 60 1f cmp %g1, 0x1f 2006cc4: 18 80 00 2f bgu 2006d80 2006cc8: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006ccc: 02 80 00 2d be 2006d80 2006cd0: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006cd4: 02 80 00 1a be 2006d3c <== NEVER TAKEN 2006cd8: 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 ); 2006cdc: 7f ff ee 2c call 200258c 2006ce0: 01 00 00 00 nop 2006ce4: b4 10 00 08 mov %o0, %i2 if ( act->sa_handler == SIG_DFL ) { 2006ce8: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006cec: 80 a0 60 00 cmp %g1, 0 2006cf0: 02 80 00 15 be 2006d44 2006cf4: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 2006cf8: 40 00 19 df call 200d474 <_POSIX_signals_Clear_process_signals> 2006cfc: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2006d00: c4 06 40 00 ld [ %i1 ], %g2 2006d04: 87 2e 20 02 sll %i0, 2, %g3 2006d08: 03 00 80 6a sethi %hi(0x201a800), %g1 2006d0c: b1 2e 20 04 sll %i0, 4, %i0 2006d10: 82 10 63 b0 or %g1, 0x3b0, %g1 2006d14: b0 26 00 03 sub %i0, %g3, %i0 2006d18: c4 20 40 18 st %g2, [ %g1 + %i0 ] 2006d1c: c4 06 60 04 ld [ %i1 + 4 ], %g2 2006d20: b0 00 40 18 add %g1, %i0, %i0 2006d24: c4 26 20 04 st %g2, [ %i0 + 4 ] 2006d28: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006d2c: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 2006d30: 7f ff ee 1b call 200259c 2006d34: 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; 2006d38: 82 10 20 00 clr %g1 } 2006d3c: 81 c7 e0 08 ret 2006d40: 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 ]; 2006d44: b1 2e 20 04 sll %i0, 4, %i0 2006d48: b0 26 00 01 sub %i0, %g1, %i0 2006d4c: 03 00 80 64 sethi %hi(0x2019000), %g1 2006d50: 82 10 60 5c or %g1, 0x5c, %g1 ! 201905c <_POSIX_signals_Default_vectors> 2006d54: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2006d58: 82 00 40 18 add %g1, %i0, %g1 2006d5c: c6 00 60 04 ld [ %g1 + 4 ], %g3 2006d60: c4 00 60 08 ld [ %g1 + 8 ], %g2 2006d64: 03 00 80 6a sethi %hi(0x201a800), %g1 2006d68: 82 10 63 b0 or %g1, 0x3b0, %g1 ! 201abb0 <_POSIX_signals_Vectors> 2006d6c: c8 20 40 18 st %g4, [ %g1 + %i0 ] 2006d70: b0 00 40 18 add %g1, %i0, %i0 2006d74: c6 26 20 04 st %g3, [ %i0 + 4 ] 2006d78: 10 bf ff ee b 2006d30 2006d7c: 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 ); 2006d80: 40 00 26 95 call 20107d4 <__errno> 2006d84: 01 00 00 00 nop 2006d88: 84 10 20 16 mov 0x16, %g2 ! 16 2006d8c: 82 10 3f ff mov -1, %g1 2006d90: 10 bf ff eb b 2006d3c 2006d94: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02007208 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2007208: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 200720c: ba 96 20 00 orcc %i0, 0, %i5 2007210: 02 80 00 84 be 2007420 2007214: 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 ) { 2007218: 02 80 00 5c be 2007388 200721c: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 2007220: 40 00 0f 90 call 200b060 <_Timespec_Is_valid> 2007224: 90 10 00 1a mov %i2, %o0 2007228: 80 8a 20 ff btst 0xff, %o0 200722c: 02 80 00 7d be 2007420 2007230: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2007234: 40 00 0f b0 call 200b0f4 <_Timespec_To_ticks> 2007238: 90 10 00 1a mov %i2, %o0 if ( !interval ) 200723c: a0 92 20 00 orcc %o0, 0, %l0 2007240: 02 80 00 78 be 2007420 <== NEVER TAKEN 2007244: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2007248: 02 80 00 53 be 2007394 <== NEVER TAKEN 200724c: 39 00 80 6c sethi %hi(0x201b000), %i4 the_thread = _Thread_Executing; 2007250: 39 00 80 6c sethi %hi(0x201b000), %i4 2007254: b8 17 23 b8 or %i4, 0x3b8, %i4 ! 201b3b8 <_Per_CPU_Information> 2007258: f0 07 20 0c ld [ %i4 + 0xc ], %i0 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 200725c: 7f ff ed a7 call 20028f8 2007260: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 2007264: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 2007268: c2 07 40 00 ld [ %i5 ], %g1 200726c: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 2007270: 80 88 40 02 btst %g1, %g2 2007274: 12 80 00 53 bne 20073c0 2007278: 01 00 00 00 nop return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 200727c: 05 00 80 6d sethi %hi(0x201b400), %g2 2007280: c4 00 a2 04 ld [ %g2 + 0x204 ], %g2 ! 201b604 <_POSIX_signals_Pending> 2007284: 80 88 40 02 btst %g1, %g2 2007288: 12 80 00 2f bne 2007344 200728c: 03 00 80 6b sethi %hi(0x201ac00), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007290: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 201ae80 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 2007294: 86 10 3f ff mov -1, %g3 2007298: c6 26 40 00 st %g3, [ %i1 ] 200729c: 84 00 a0 01 inc %g2 20072a0: c4 20 62 80 st %g2, [ %g1 + 0x280 ] return _Thread_Dispatch_disable_level; 20072a4: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 20072a8: 82 10 20 04 mov 4, %g1 20072ac: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_thread->Wait.option = *set; 20072b0: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 20072b4: 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; 20072b8: 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; 20072bc: b6 10 20 01 mov 1, %i3 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 20072c0: 23 00 80 6d sethi %hi(0x201b400), %l1 20072c4: a2 14 61 9c or %l1, 0x19c, %l1 ! 201b59c <_POSIX_signals_Wait_queue> 20072c8: e2 26 20 44 st %l1, [ %i0 + 0x44 ] 20072cc: 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 ); 20072d0: 7f ff ed 8e call 2002908 20072d4: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 20072d8: 90 10 00 11 mov %l1, %o0 20072dc: 92 10 00 10 mov %l0, %o1 20072e0: 15 00 80 2b sethi %hi(0x200ac00), %o2 20072e4: 40 00 0d c1 call 200a9e8 <_Thread_queue_Enqueue_with_handler> 20072e8: 94 12 a1 c8 or %o2, 0x1c8, %o2 ! 200adc8 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 20072ec: 40 00 0c 74 call 200a4bc <_Thread_Enable_dispatch> 20072f0: 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 ); 20072f4: d2 06 40 00 ld [ %i1 ], %o1 20072f8: 90 10 00 1a mov %i2, %o0 20072fc: 94 10 00 19 mov %i1, %o2 2007300: 96 10 20 00 clr %o3 2007304: 40 00 1a 9b call 200dd70 <_POSIX_signals_Clear_signals> 2007308: 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) 200730c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007310: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007314: 80 a0 60 04 cmp %g1, 4 2007318: 12 80 00 3b bne 2007404 200731c: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2007320: f0 06 40 00 ld [ %i1 ], %i0 2007324: c2 07 40 00 ld [ %i5 ], %g1 2007328: 84 06 3f ff add %i0, -1, %g2 200732c: b7 2e c0 02 sll %i3, %g2, %i3 2007330: 80 8e c0 01 btst %i3, %g1 2007334: 02 80 00 34 be 2007404 2007338: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 200733c: 81 c7 e0 08 ret 2007340: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2007344: 7f ff ff 99 call 20071a8 <_POSIX_signals_Get_lowest> 2007348: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 200734c: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2007350: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2007354: 96 10 20 01 mov 1, %o3 2007358: 90 10 00 1a mov %i2, %o0 200735c: 92 10 00 18 mov %i0, %o1 2007360: 40 00 1a 84 call 200dd70 <_POSIX_signals_Clear_signals> 2007364: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2007368: 7f ff ed 68 call 2002908 200736c: 90 10 00 1b mov %i3, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2007370: 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; 2007374: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2007378: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 200737c: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2007380: 81 c7 e0 08 ret 2007384: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2007388: 12 bf ff b2 bne 2007250 200738c: a0 10 20 00 clr %l0 the_thread = _Thread_Executing; 2007390: 39 00 80 6c sethi %hi(0x201b000), %i4 2007394: b8 17 23 b8 or %i4, 0x3b8, %i4 ! 201b3b8 <_Per_CPU_Information> 2007398: f0 07 20 0c ld [ %i4 + 0xc ], %i0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 200739c: b2 07 bf f4 add %fp, -12, %i1 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 20073a0: 7f ff ed 56 call 20028f8 20073a4: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 20073a8: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 20073ac: c2 07 40 00 ld [ %i5 ], %g1 20073b0: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2 20073b4: 80 88 40 02 btst %g1, %g2 20073b8: 22 bf ff b2 be,a 2007280 20073bc: 05 00 80 6d sethi %hi(0x201b400), %g2 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 20073c0: 7f ff ff 7a call 20071a8 <_POSIX_signals_Get_lowest> 20073c4: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( 20073c8: 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 ); 20073cc: 92 10 00 08 mov %o0, %o1 20073d0: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 20073d4: 96 10 20 00 clr %o3 20073d8: 90 10 00 1a mov %i2, %o0 20073dc: 40 00 1a 65 call 200dd70 <_POSIX_signals_Clear_signals> 20073e0: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 20073e4: 7f ff ed 49 call 2002908 20073e8: 90 10 00 1b mov %i3, %o0 the_info->si_code = SI_USER; 20073ec: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 20073f0: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 20073f4: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 20073f8: f0 06 40 00 ld [ %i1 ], %i0 20073fc: 81 c7 e0 08 ret 2007400: 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; 2007404: 40 00 26 d5 call 2010f58 <__errno> 2007408: b0 10 3f ff mov -1, %i0 200740c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007410: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007414: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2007418: 81 c7 e0 08 ret 200741c: 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 ); 2007420: 40 00 26 ce call 2010f58 <__errno> 2007424: b0 10 3f ff mov -1, %i0 2007428: 82 10 20 16 mov 0x16, %g1 200742c: c2 22 00 00 st %g1, [ %o0 ] 2007430: 81 c7 e0 08 ret 2007434: 81 e8 00 00 restore =============================================================================== 02009078 : int sigwait( const sigset_t *set, int *sig ) { 2009078: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 200907c: 92 10 20 00 clr %o1 2009080: 90 10 00 18 mov %i0, %o0 2009084: 7f ff ff 6d call 2008e38 2009088: 94 10 20 00 clr %o2 if ( status != -1 ) { 200908c: 80 a2 3f ff cmp %o0, -1 2009090: 02 80 00 07 be 20090ac 2009094: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2009098: 02 80 00 03 be 20090a4 <== NEVER TAKEN 200909c: b0 10 20 00 clr %i0 *sig = status; 20090a0: d0 26 40 00 st %o0, [ %i1 ] 20090a4: 81 c7 e0 08 ret 20090a8: 81 e8 00 00 restore return 0; } return errno; 20090ac: 40 00 25 f8 call 201288c <__errno> 20090b0: 01 00 00 00 nop 20090b4: f0 02 00 00 ld [ %o0 ], %i0 } 20090b8: 81 c7 e0 08 ret 20090bc: 81 e8 00 00 restore =============================================================================== 02005f78 : */ long sysconf( int name ) { 2005f78: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005f7c: 80 a6 20 02 cmp %i0, 2 2005f80: 02 80 00 10 be 2005fc0 2005f84: 03 00 80 5d sethi %hi(0x2017400), %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005f88: 80 a6 20 04 cmp %i0, 4 2005f8c: 02 80 00 0b be 2005fb8 2005f90: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005f94: 80 a6 20 33 cmp %i0, 0x33 2005f98: 02 80 00 08 be 2005fb8 2005f9c: 82 10 24 00 mov 0x400, %g1 return 1024; if ( name == _SC_PAGESIZE ) 2005fa0: 80 a6 20 08 cmp %i0, 8 2005fa4: 02 80 00 05 be 2005fb8 2005fa8: 03 00 00 04 sethi %hi(0x1000), %g1 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005fac: 80 a6 22 03 cmp %i0, 0x203 2005fb0: 12 80 00 0c bne 2005fe0 <== ALWAYS TAKEN 2005fb4: 82 10 20 00 clr %g1 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2005fb8: 81 c7 e0 08 ret 2005fbc: 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()); 2005fc0: 03 00 80 5c sethi %hi(0x2017000), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 2005fc4: d2 00 62 f8 ld [ %g1 + 0x2f8 ], %o1 ! 20172f8 2005fc8: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005fcc: 40 00 35 fd call 20137c0 <.udiv> 2005fd0: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005fd4: 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 ); } 2005fd8: 81 c7 e0 08 ret 2005fdc: 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 ); 2005fe0: 40 00 26 b1 call 200faa4 <__errno> 2005fe4: 01 00 00 00 nop 2005fe8: 84 10 20 16 mov 0x16, %g2 ! 16 2005fec: 82 10 3f ff mov -1, %g1 2005ff0: 10 bf ff f2 b 2005fb8 2005ff4: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 0200632c : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 200632c: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2006330: 80 a6 20 01 cmp %i0, 1 2006334: 12 80 00 3e bne 200642c 2006338: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 200633c: 02 80 00 3c be 200642c 2006340: 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) { 2006344: 02 80 00 0e be 200637c 2006348: 03 00 80 79 sethi %hi(0x201e400), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 200634c: c2 06 40 00 ld [ %i1 ], %g1 2006350: 82 00 7f ff add %g1, -1, %g1 2006354: 80 a0 60 01 cmp %g1, 1 2006358: 18 80 00 35 bgu 200642c <== NEVER TAKEN 200635c: 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 ) 2006360: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006364: 80 a0 60 00 cmp %g1, 0 2006368: 02 80 00 31 be 200642c <== NEVER TAKEN 200636c: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2006370: 80 a0 60 1f cmp %g1, 0x1f 2006374: 18 80 00 2e bgu 200642c <== NEVER TAKEN 2006378: 03 00 80 79 sethi %hi(0x201e400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200637c: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 201e530 <_Thread_Dispatch_disable_level> 2006380: 84 00 a0 01 inc %g2 2006384: c4 20 61 30 st %g2, [ %g1 + 0x130 ] return _Thread_Dispatch_disable_level; 2006388: c2 00 61 30 ld [ %g1 + 0x130 ], %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 ); 200638c: 3b 00 80 7a sethi %hi(0x201e800), %i5 2006390: 40 00 08 53 call 20084dc <_Objects_Allocate> 2006394: 90 17 60 30 or %i5, 0x30, %o0 ! 201e830 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2006398: 80 a2 20 00 cmp %o0, 0 200639c: 02 80 00 2a be 2006444 20063a0: 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; 20063a4: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 20063a8: 03 00 80 7a sethi %hi(0x201e800), %g1 20063ac: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 201ea74 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 20063b0: 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; 20063b4: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 20063b8: 02 80 00 08 be 20063d8 20063bc: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 20063c0: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 20063c4: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 20063c8: 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; 20063cc: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 20063d0: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 20063d4: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20063d8: 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; } 20063dc: ba 17 60 30 or %i5, 0x30, %i5 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20063e0: 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; 20063e4: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 20063e8: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 20063ec: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 20063f0: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 20063f4: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20063f8: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 20063fc: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2006400: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2006404: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006408: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200640c: 85 28 a0 02 sll %g2, 2, %g2 2006410: 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; 2006414: 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; 2006418: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 200641c: 40 00 0d 46 call 2009934 <_Thread_Enable_dispatch> 2006420: b0 10 20 00 clr %i0 return 0; } 2006424: 81 c7 e0 08 ret 2006428: 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 ); 200642c: 40 00 27 c9 call 2010350 <__errno> 2006430: b0 10 3f ff mov -1, %i0 2006434: 82 10 20 16 mov 0x16, %g1 2006438: c2 22 00 00 st %g1, [ %o0 ] 200643c: 81 c7 e0 08 ret 2006440: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 2006444: 40 00 0d 3c call 2009934 <_Thread_Enable_dispatch> 2006448: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 200644c: 40 00 27 c1 call 2010350 <__errno> 2006450: 01 00 00 00 nop 2006454: 82 10 20 0b mov 0xb, %g1 ! b 2006458: c2 22 00 00 st %g1, [ %o0 ] 200645c: 81 c7 e0 08 ret 2006460: 81 e8 00 00 restore =============================================================================== 02006464 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2006464: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2006468: 80 a6 a0 00 cmp %i2, 0 200646c: 02 80 00 88 be 200668c <== NEVER TAKEN 2006470: 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) ) ) { 2006474: 40 00 10 2b call 200a520 <_Timespec_Is_valid> 2006478: 90 06 a0 08 add %i2, 8, %o0 200647c: 80 8a 20 ff btst 0xff, %o0 2006480: 02 80 00 83 be 200668c 2006484: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2006488: 40 00 10 26 call 200a520 <_Timespec_Is_valid> 200648c: 90 10 00 1a mov %i2, %o0 2006490: 80 8a 20 ff btst 0xff, %o0 2006494: 02 80 00 7e be 200668c <== NEVER TAKEN 2006498: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 200649c: 12 80 00 7a bne 2006684 20064a0: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 20064a4: c8 06 80 00 ld [ %i2 ], %g4 20064a8: c6 06 a0 04 ld [ %i2 + 4 ], %g3 20064ac: c4 06 a0 08 ld [ %i2 + 8 ], %g2 20064b0: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 20064b4: c8 27 bf e4 st %g4, [ %fp + -28 ] 20064b8: c6 27 bf e8 st %g3, [ %fp + -24 ] 20064bc: c4 27 bf ec st %g2, [ %fp + -20 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 20064c0: 80 a6 60 04 cmp %i1, 4 20064c4: 02 80 00 3b be 20065b0 20064c8: 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 *) 20064cc: 92 10 00 18 mov %i0, %o1 20064d0: 11 00 80 7a sethi %hi(0x201e800), %o0 20064d4: 94 07 bf fc add %fp, -4, %o2 20064d8: 40 00 09 4c call 2008a08 <_Objects_Get> 20064dc: 90 12 20 30 or %o0, 0x30, %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 ) { 20064e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20064e4: 80 a0 60 00 cmp %g1, 0 20064e8: 12 80 00 46 bne 2006600 <== NEVER TAKEN 20064ec: 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 ) { 20064f0: c2 07 bf ec ld [ %fp + -20 ], %g1 20064f4: 80 a0 60 00 cmp %g1, 0 20064f8: 12 80 00 05 bne 200650c 20064fc: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006500: 80 a0 60 00 cmp %g1, 0 2006504: 02 80 00 45 be 2006618 2006508: 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 ); 200650c: 40 00 10 2a call 200a5b4 <_Timespec_To_ticks> 2006510: 90 10 00 1a mov %i2, %o0 2006514: d0 27 60 64 st %o0, [ %i5 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006518: 40 00 10 27 call 200a5b4 <_Timespec_To_ticks> 200651c: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 2006520: 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 ); 2006524: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2006528: 98 10 00 1d mov %i5, %o4 200652c: 90 07 60 10 add %i5, 0x10, %o0 2006530: 17 00 80 19 sethi %hi(0x2006400), %o3 2006534: 40 00 1b c8 call 200d454 <_POSIX_Timer_Insert_helper> 2006538: 96 12 e2 a4 or %o3, 0x2a4, %o3 ! 20066a4 <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 200653c: 80 8a 20 ff btst 0xff, %o0 2006540: 02 80 00 18 be 20065a0 2006544: 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 ) 2006548: 02 80 00 0b be 2006574 200654c: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 2006550: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006554: c2 26 c0 00 st %g1, [ %i3 ] 2006558: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 200655c: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2006560: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 2006564: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2006568: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 200656c: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 2006570: 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 ); 2006574: 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; 2006578: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 200657c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2006580: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 2006584: c2 07 bf ec ld [ %fp + -20 ], %g1 2006588: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 200658c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006590: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2006594: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 2006598: 40 00 06 47 call 2007eb4 <_TOD_Get> 200659c: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] _Thread_Enable_dispatch(); 20065a0: 40 00 0c e5 call 2009934 <_Thread_Enable_dispatch> 20065a4: b0 10 20 00 clr %i0 return 0; 20065a8: 81 c7 e0 08 ret 20065ac: 81 e8 00 00 restore normalize = *value; /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); 20065b0: 40 00 06 41 call 2007eb4 <_TOD_Get> 20065b4: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 20065b8: 90 07 bf f4 add %fp, -12, %o0 20065bc: 40 00 0f c7 call 200a4d8 <_Timespec_Greater_than> 20065c0: 92 07 bf ec add %fp, -20, %o1 20065c4: 80 8a 20 ff btst 0xff, %o0 20065c8: 12 80 00 31 bne 200668c 20065cc: 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 ); 20065d0: 90 07 bf f4 add %fp, -12, %o0 20065d4: 40 00 0f e4 call 200a564 <_Timespec_Subtract> 20065d8: 94 10 00 09 mov %o1, %o2 20065dc: 92 10 00 18 mov %i0, %o1 20065e0: 11 00 80 7a sethi %hi(0x201e800), %o0 20065e4: 94 07 bf fc add %fp, -4, %o2 20065e8: 40 00 09 08 call 2008a08 <_Objects_Get> 20065ec: 90 12 20 30 or %o0, 0x30, %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 ) { 20065f0: c2 07 bf fc ld [ %fp + -4 ], %g1 20065f4: 80 a0 60 00 cmp %g1, 0 20065f8: 02 bf ff be be 20064f0 20065fc: ba 10 00 08 mov %o0, %i5 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2006600: 40 00 27 54 call 2010350 <__errno> 2006604: b0 10 3f ff mov -1, %i0 2006608: 82 10 20 16 mov 0x16, %g1 200660c: c2 22 00 00 st %g1, [ %o0 ] } 2006610: 81 c7 e0 08 ret 2006614: 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 ); 2006618: 40 00 11 29 call 200aabc <_Watchdog_Remove> 200661c: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2006620: 80 a6 e0 00 cmp %i3, 0 2006624: 02 80 00 0b be 2006650 2006628: c2 07 bf e4 ld [ %fp + -28 ], %g1 *ovalue = ptimer->timer_data; 200662c: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006630: c2 26 c0 00 st %g1, [ %i3 ] 2006634: c2 07 60 58 ld [ %i5 + 0x58 ], %g1 2006638: c2 26 e0 04 st %g1, [ %i3 + 4 ] 200663c: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 2006640: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2006644: c2 07 60 60 ld [ %i5 + 0x60 ], %g1 2006648: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 200664c: 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; 2006650: 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; 2006654: c2 27 60 54 st %g1, [ %i5 + 0x54 ] 2006658: c2 07 bf e8 ld [ %fp + -24 ], %g1 200665c: c2 27 60 58 st %g1, [ %i5 + 0x58 ] 2006660: c2 07 bf ec ld [ %fp + -20 ], %g1 2006664: c2 27 60 5c st %g1, [ %i5 + 0x5c ] 2006668: c2 07 bf f0 ld [ %fp + -16 ], %g1 200666c: c2 27 60 60 st %g1, [ %i5 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006670: 82 10 20 04 mov 4, %g1 /* Returns with success */ _Thread_Enable_dispatch(); 2006674: 40 00 0c b0 call 2009934 <_Thread_Enable_dispatch> 2006678: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ] return 0; 200667c: 81 c7 e0 08 ret 2006680: 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 ) { 2006684: 22 bf ff 89 be,a 20064a8 2006688: 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 ); 200668c: 40 00 27 31 call 2010350 <__errno> 2006690: b0 10 3f ff mov -1, %i0 2006694: 82 10 20 16 mov 0x16, %g1 2006698: c2 22 00 00 st %g1, [ %o0 ] 200669c: 81 c7 e0 08 ret 20066a0: 81 e8 00 00 restore =============================================================================== 02006300 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2006300: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2006304: 3b 00 80 66 sethi %hi(0x2019800), %i5 2006308: ba 17 60 f8 or %i5, 0xf8, %i5 ! 20198f8 <_POSIX_signals_Ualarm_timer> 200630c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2006310: 80 a0 60 00 cmp %g1, 0 2006314: 02 80 00 24 be 20063a4 2006318: 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 ); 200631c: 40 00 10 d9 call 200a680 <_Watchdog_Remove> 2006320: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2006324: 90 02 3f fe add %o0, -2, %o0 2006328: 80 a2 20 01 cmp %o0, 1 200632c: 08 80 00 26 bleu 20063c4 <== ALWAYS TAKEN 2006330: 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 ) { 2006334: 80 a7 20 00 cmp %i4, 0 2006338: 02 80 00 19 be 200639c 200633c: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2006340: 90 10 00 1c mov %i4, %o0 2006344: 40 00 3a 58 call 2014ca4 <.udiv> 2006348: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 200634c: 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; 2006350: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2006354: 40 00 3b 00 call 2014f54 <.urem> 2006358: 90 10 00 1c mov %i4, %o0 200635c: 87 2a 20 07 sll %o0, 7, %g3 2006360: 82 10 00 08 mov %o0, %g1 2006364: 85 2a 20 02 sll %o0, 2, %g2 2006368: 84 20 c0 02 sub %g3, %g2, %g2 200636c: 82 00 80 01 add %g2, %g1, %g1 2006370: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 2006374: 90 07 bf f8 add %fp, -8, %o0 2006378: 40 00 0f 51 call 200a0bc <_Timespec_To_ticks> 200637c: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2006380: 40 00 0f 4f call 200a0bc <_Timespec_To_ticks> 2006384: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006388: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200638c: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006390: 11 00 80 64 sethi %hi(0x2019000), %o0 2006394: 40 00 10 59 call 200a4f8 <_Watchdog_Insert> 2006398: 90 12 20 ac or %o0, 0xac, %o0 ! 20190ac <_Watchdog_Ticks_chain> } return remaining; } 200639c: 81 c7 e0 08 ret 20063a0: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20063a4: 03 00 80 18 sethi %hi(0x2006000), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20063a8: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 20063ac: 82 10 62 d4 or %g1, 0x2d4, %g1 the_watchdog->id = id; 20063b0: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20063b4: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 20063b8: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 20063bc: 10 bf ff de b 2006334 20063c0: 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); 20063c4: c4 07 60 0c ld [ %i5 + 0xc ], %g2 20063c8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20063cc: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20063d0: 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); 20063d4: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 20063d8: 40 00 0f 10 call 200a018 <_Timespec_From_ticks> 20063dc: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 20063e0: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 20063e4: 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; 20063e8: 85 28 60 03 sll %g1, 3, %g2 20063ec: 87 28 60 08 sll %g1, 8, %g3 20063f0: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 20063f4: 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; 20063f8: b1 28 a0 06 sll %g2, 6, %i0 20063fc: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2006400: 40 00 3a 2b call 2014cac <.div> 2006404: 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; 2006408: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 200640c: 10 bf ff ca b 2006334 2006410: b0 02 00 18 add %o0, %i0, %i0