=============================================================================== 020071b8 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 20071b8: 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; 20071bc: 39 00 80 71 sethi %hi(0x201c400), %i4 20071c0: fa 07 20 74 ld [ %i4 + 0x74 ], %i5 ! 201c474 <_API_extensions_List> 20071c4: b8 17 20 74 or %i4, 0x74, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20071c8: b8 07 20 04 add %i4, 4, %i4 20071cc: 80 a7 40 1c cmp %i5, %i4 20071d0: 02 80 00 09 be 20071f4 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 20071d4: 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)(); 20071d8: c2 07 60 08 ld [ %i5 + 8 ], %g1 20071dc: 9f c0 40 00 call %g1 20071e0: 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 ) { 20071e4: 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 ); 20071e8: 80 a7 40 1c cmp %i5, %i4 20071ec: 32 bf ff fc bne,a 20071dc <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 20071f0: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 20071f4: 81 c7 e0 08 ret 20071f8: 81 e8 00 00 restore =============================================================================== 020071fc <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 20071fc: 9d e3 bf a0 save %sp, -96, %sp 2007200: 39 00 80 71 sethi %hi(0x201c400), %i4 2007204: fa 07 20 74 ld [ %i4 + 0x74 ], %i5 ! 201c474 <_API_extensions_List> 2007208: b8 17 20 74 or %i4, 0x74, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 200720c: b8 07 20 04 add %i4, 4, %i4 2007210: 80 a7 40 1c cmp %i5, %i4 2007214: 02 80 00 0a be 200723c <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 2007218: 37 00 80 71 sethi %hi(0x201c400), %i3 200721c: b6 16 e0 ac or %i3, 0xac, %i3 ! 201c4ac <_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 ); 2007220: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007224: 9f c0 40 00 call %g1 2007228: 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 ) { 200722c: 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 ); 2007230: 80 a7 40 1c cmp %i5, %i4 2007234: 32 bf ff fc bne,a 2007224 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 2007238: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED 200723c: 81 c7 e0 08 ret 2007240: 81 e8 00 00 restore =============================================================================== 02010a64 <_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 ) { 2010a64: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010a68: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010a6c: 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; 2010a70: f6 26 20 4c st %i3, [ %i0 + 0x4c ] /* * 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)) { 2010a74: 80 8e e0 03 btst 3, %i3 2010a78: 02 80 00 0a be 2010aa0 <_CORE_message_queue_Initialize+0x3c> 2010a7c: a0 10 00 1b mov %i3, %l0 allocated_message_size += sizeof(uint32_t); 2010a80: a0 06 e0 04 add %i3, 4, %l0 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010a84: a0 0c 3f fc and %l0, -4, %l0 } if (allocated_message_size < maximum_message_size) 2010a88: 80 a6 c0 10 cmp %i3, %l0 2010a8c: 08 80 00 05 bleu 2010aa0 <_CORE_message_queue_Initialize+0x3c><== ALWAYS TAKEN 2010a90: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010a94: b0 0f 60 01 and %i5, 1, %i0 2010a98: 81 c7 e0 08 ret 2010a9c: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 2010aa0: b8 04 20 10 add %l0, 0x10, %i4 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 2010aa4: 92 10 00 1a mov %i2, %o1 2010aa8: 90 10 00 1c mov %i4, %o0 2010aac: 40 00 3f bb call 2020998 <.umul> 2010ab0: ba 10 20 00 clr %i5 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 2010ab4: 80 a2 00 10 cmp %o0, %l0 2010ab8: 2a bf ff f8 bcs,a 2010a98 <_CORE_message_queue_Initialize+0x34><== NEVER TAKEN 2010abc: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010ac0: 40 00 0c c7 call 2013ddc <_Workspace_Allocate> 2010ac4: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010ac8: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010acc: 80 a2 20 00 cmp %o0, 0 2010ad0: 02 bf ff f1 be 2010a94 <_CORE_message_queue_Initialize+0x30> 2010ad4: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010ad8: 90 06 20 60 add %i0, 0x60, %o0 2010adc: 94 10 00 1a mov %i2, %o2 2010ae0: 40 00 15 61 call 2016064 <_Chain_Initialize> 2010ae4: 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( 2010ae8: 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 ); 2010aec: 82 06 20 50 add %i0, 0x50, %g1 2010af0: 84 18 a0 01 xor %g2, 1, %g2 2010af4: 80 a0 00 02 cmp %g0, %g2 2010af8: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010afc: 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; 2010b00: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2010b04: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2010b08: c0 26 20 54 clr [ %i0 + 0x54 ] 2010b0c: 92 60 3f ff subx %g0, -1, %o1 2010b10: 94 10 20 80 mov 0x80, %o2 2010b14: 96 10 20 06 mov 6, %o3 2010b18: 40 00 0a 06 call 2013330 <_Thread_queue_Initialize> 2010b1c: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b20: b0 0f 60 01 and %i5, 1, %i0 2010b24: 81 c7 e0 08 ret 2010b28: 81 e8 00 00 restore =============================================================================== 0200750c <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 200750c: 9d e3 bf a0 save %sp, -96, %sp * This routine returns true if thread dispatch indicates * that we are in a critical section. */ RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void) { if ( _Thread_Dispatch_disable_level == 0 ) 2007510: 3b 00 80 70 sethi %hi(0x201c000), %i5 2007514: c2 07 62 80 ld [ %i5 + 0x280 ], %g1 ! 201c280 <_Thread_Dispatch_disable_level> 2007518: 80 a0 60 00 cmp %g1, 0 200751c: 02 80 00 05 be 2007530 <_CORE_mutex_Seize+0x24> 2007520: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2007524: 80 a6 a0 00 cmp %i2, 0 2007528: 12 80 00 1b bne 2007594 <_CORE_mutex_Seize+0x88> <== ALWAYS TAKEN 200752c: 03 00 80 70 sethi %hi(0x201c000), %g1 2007530: 90 10 00 18 mov %i0, %o0 2007534: 40 00 14 ba call 200c81c <_CORE_mutex_Seize_interrupt_trylock> 2007538: 92 07 a0 54 add %fp, 0x54, %o1 200753c: 80 a2 20 00 cmp %o0, 0 2007540: 02 80 00 13 be 200758c <_CORE_mutex_Seize+0x80> 2007544: 80 a6 a0 00 cmp %i2, 0 2007548: 02 80 00 1b be 20075b4 <_CORE_mutex_Seize+0xa8> 200754c: 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++; 2007550: c4 07 62 80 ld [ %i5 + 0x280 ], %g2 2007554: 03 00 80 71 sethi %hi(0x201c400), %g1 2007558: c2 00 60 b8 ld [ %g1 + 0xb8 ], %g1 ! 201c4b8 <_Per_CPU_Information+0xc> RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 200755c: 86 10 20 01 mov 1, %g3 2007560: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 2007564: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2007568: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 200756c: 82 00 a0 01 add %g2, 1, %g1 2007570: c2 27 62 80 st %g1, [ %i5 + 0x280 ] return _Thread_Dispatch_disable_level; 2007574: c2 07 62 80 ld [ %i5 + 0x280 ], %g1 2007578: 7f ff eb 08 call 2002198 200757c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2007580: 90 10 00 18 mov %i0, %o0 2007584: 7f ff ff c0 call 2007484 <_CORE_mutex_Seize_interrupt_blocking> 2007588: 92 10 00 1b mov %i3, %o1 200758c: 81 c7 e0 08 ret 2007590: 81 e8 00 00 restore 2007594: c2 00 63 dc ld [ %g1 + 0x3dc ], %g1 2007598: 80 a0 60 01 cmp %g1, 1 200759c: 28 bf ff e6 bleu,a 2007534 <_CORE_mutex_Seize+0x28> 20075a0: 90 10 00 18 mov %i0, %o0 20075a4: 90 10 20 00 clr %o0 20075a8: 92 10 20 00 clr %o1 20075ac: 40 00 01 dc call 2007d1c <_Internal_error_Occurred> 20075b0: 94 10 20 12 mov 0x12, %o2 20075b4: 7f ff ea f9 call 2002198 20075b8: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20075bc: 03 00 80 71 sethi %hi(0x201c400), %g1 20075c0: c2 00 60 b8 ld [ %g1 + 0xb8 ], %g1 ! 201c4b8 <_Per_CPU_Information+0xc> 20075c4: 84 10 20 01 mov 1, %g2 20075c8: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 20075cc: 81 c7 e0 08 ret 20075d0: 81 e8 00 00 restore =============================================================================== 02007748 <_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 ) { 2007748: 9d e3 bf a0 save %sp, -96, %sp 200774c: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007750: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2007754: 40 00 07 76 call 200952c <_Thread_queue_Dequeue> 2007758: 90 10 00 1d mov %i5, %o0 200775c: 80 a2 20 00 cmp %o0, 0 2007760: 02 80 00 04 be 2007770 <_CORE_semaphore_Surrender+0x28> 2007764: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2007768: 81 c7 e0 08 ret 200776c: 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 ); 2007770: 7f ff ea 86 call 2002188 2007774: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2007778: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 200777c: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2007780: 80 a0 40 02 cmp %g1, %g2 2007784: 1a 80 00 05 bcc 2007798 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2007788: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 200778c: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007790: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007794: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007798: 7f ff ea 80 call 2002198 200779c: 01 00 00 00 nop } return status; } 20077a0: 81 c7 e0 08 ret 20077a4: 81 e8 00 00 restore =============================================================================== 0200c7b4 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200c7b4: 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; 200c7b8: 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 ); 200c7bc: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c7c0: 80 a6 a0 00 cmp %i2, 0 200c7c4: 02 80 00 12 be 200c80c <_Chain_Initialize+0x58> <== NEVER TAKEN 200c7c8: 90 10 00 18 mov %i0, %o0 200c7cc: 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; 200c7d0: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200c7d4: 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; 200c7d8: 10 80 00 05 b 200c7ec <_Chain_Initialize+0x38> 200c7dc: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c7e0: 84 10 00 01 mov %g1, %g2 200c7e4: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200c7e8: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200c7ec: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200c7f0: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c7f4: 80 a6 a0 00 cmp %i2, 0 200c7f8: 12 bf ff fa bne 200c7e0 <_Chain_Initialize+0x2c> 200c7fc: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200c800: 40 00 2b f0 call 20177c0 <.umul> 200c804: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c808: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200c80c: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200c810: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200c814: 81 c7 e0 08 ret 200c818: 81 e8 00 00 restore =============================================================================== 02006458 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2006458: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 200645c: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 2006460: 7f ff ef 4a call 2002188 2006464: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 2006468: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 200646c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2006470: 86 88 40 02 andcc %g1, %g2, %g3 2006474: 02 80 00 39 be 2006558 <_Event_Surrender+0x100> 2006478: 09 00 80 71 sethi %hi(0x201c400), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 200647c: 88 11 20 ac or %g4, 0xac, %g4 ! 201c4ac <_Per_CPU_Information> 2006480: f2 01 20 08 ld [ %g4 + 8 ], %i1 2006484: 80 a6 60 00 cmp %i1, 0 2006488: 32 80 00 1c bne,a 20064f8 <_Event_Surrender+0xa0> 200648c: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 2006490: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2006494: 80 89 21 00 btst 0x100, %g4 2006498: 02 80 00 30 be 2006558 <_Event_Surrender+0x100> 200649c: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20064a0: 02 80 00 04 be 20064b0 <_Event_Surrender+0x58> 20064a4: 80 8f 20 02 btst 2, %i4 20064a8: 02 80 00 2c be 2006558 <_Event_Surrender+0x100> <== NEVER TAKEN 20064ac: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20064b0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear( rtems_event_set the_event_set, rtems_event_set the_mask ) { return ( the_event_set & ~(the_mask) ); 20064b4: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 20064b8: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 20064bc: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20064c0: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 20064c4: 7f ff ef 35 call 2002198 20064c8: 01 00 00 00 nop 20064cc: 7f ff ef 2f call 2002188 20064d0: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 20064d4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 20064d8: 80 a0 60 02 cmp %g1, 2 20064dc: 02 80 00 21 be 2006560 <_Event_Surrender+0x108> 20064e0: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 20064e4: 7f ff ef 2d call 2002198 20064e8: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20064ec: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 20064f0: 40 00 0a 43 call 2008dfc <_Thread_Clear_state> 20064f4: 81 e8 00 00 restore /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 20064f8: 80 a6 00 04 cmp %i0, %g4 20064fc: 32 bf ff e6 bne,a 2006494 <_Event_Surrender+0x3c> 2006500: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006504: 09 00 80 71 sethi %hi(0x201c400), %g4 2006508: f2 01 21 00 ld [ %g4 + 0x100 ], %i1 ! 201c500 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 200650c: 80 a6 60 02 cmp %i1, 2 2006510: 02 80 00 07 be 200652c <_Event_Surrender+0xd4> <== NEVER TAKEN 2006514: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006518: f2 01 21 00 ld [ %g4 + 0x100 ], %i1 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200651c: 80 a6 60 01 cmp %i1, 1 2006520: 32 bf ff dd bne,a 2006494 <_Event_Surrender+0x3c> 2006524: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2006528: 80 a0 40 03 cmp %g1, %g3 200652c: 02 80 00 04 be 200653c <_Event_Surrender+0xe4> 2006530: 80 8f 20 02 btst 2, %i4 2006534: 02 80 00 09 be 2006558 <_Event_Surrender+0x100> <== NEVER TAKEN 2006538: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200653c: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006540: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2006544: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006548: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200654c: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006550: 82 10 20 03 mov 3, %g1 2006554: c2 21 21 00 st %g1, [ %g4 + 0x100 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2006558: 7f ff ef 10 call 2002198 200655c: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2006560: c2 26 20 50 st %g1, [ %i0 + 0x50 ] if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2006564: 7f ff ef 0d call 2002198 2006568: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 200656c: 40 00 0f 45 call 200a280 <_Watchdog_Remove> 2006570: 90 06 20 48 add %i0, 0x48, %o0 2006574: b2 16 63 f8 or %i1, 0x3f8, %i1 2006578: 40 00 0a 21 call 2008dfc <_Thread_Clear_state> 200657c: 81 e8 00 00 restore =============================================================================== 02006580 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006580: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006584: 90 10 00 18 mov %i0, %o0 2006588: 40 00 0b 1c call 20091f8 <_Thread_Get> 200658c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006590: c2 07 bf fc ld [ %fp + -4 ], %g1 2006594: 80 a0 60 00 cmp %g1, 0 2006598: 12 80 00 16 bne 20065f0 <_Event_Timeout+0x70> <== NEVER TAKEN 200659c: ba 10 00 08 mov %o0, %i5 * * If it is not satisfied, then it is "nothing happened" and * this is the "timeout" transition. After a request is satisfied, * a timeout is not allowed to occur. */ _ISR_Disable( level ); 20065a0: 7f ff ee fa call 2002188 20065a4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20065a8: 03 00 80 71 sethi %hi(0x201c400), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 20065ac: c2 00 60 b8 ld [ %g1 + 0xb8 ], %g1 ! 201c4b8 <_Per_CPU_Information+0xc> 20065b0: 80 a7 40 01 cmp %i5, %g1 20065b4: 02 80 00 11 be 20065f8 <_Event_Timeout+0x78> 20065b8: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 20065bc: 82 10 20 06 mov 6, %g1 20065c0: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20065c4: 7f ff ee f5 call 2002198 20065c8: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20065cc: 90 10 00 1d mov %i5, %o0 20065d0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20065d4: 40 00 0a 0a call 2008dfc <_Thread_Clear_state> 20065d8: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 /** * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 20065dc: 03 00 80 70 sethi %hi(0x201c000), %g1 20065e0: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 201c280 <_Thread_Dispatch_disable_level> 20065e4: 84 00 bf ff add %g2, -1, %g2 20065e8: c4 20 62 80 st %g2, [ %g1 + 0x280 ] return _Thread_Dispatch_disable_level; 20065ec: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 20065f0: 81 c7 e0 08 ret 20065f4: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 20065f8: 03 00 80 71 sethi %hi(0x201c400), %g1 20065fc: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c500 <_Event_Sync_state> 2006600: 80 a0 a0 01 cmp %g2, 1 2006604: 32 bf ff ef bne,a 20065c0 <_Event_Timeout+0x40> 2006608: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 200660c: 84 10 20 02 mov 2, %g2 2006610: c4 20 61 00 st %g2, [ %g1 + 0x100 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006614: 10 bf ff eb b 20065c0 <_Event_Timeout+0x40> 2006618: 82 10 20 06 mov 6, %g1 =============================================================================== 0200c9dc <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200c9dc: 9d e3 bf 98 save %sp, -104, %sp 200c9e0: 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 200c9e4: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200c9e8: 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 ) { 200c9ec: 80 a6 40 10 cmp %i1, %l0 200c9f0: 18 80 00 23 bgu 200ca7c <_Heap_Allocate_aligned_with_boundary+0xa0> 200c9f4: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200c9f8: 80 a6 e0 00 cmp %i3, 0 200c9fc: 12 80 00 7d bne 200cbf0 <_Heap_Allocate_aligned_with_boundary+0x214> 200ca00: 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; 200ca04: 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 ) { 200ca08: 80 a7 40 11 cmp %i5, %l1 200ca0c: 02 80 00 18 be 200ca6c <_Heap_Allocate_aligned_with_boundary+0x90> 200ca10: 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 200ca14: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200ca18: 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 200ca1c: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200ca20: 10 80 00 0b b 200ca4c <_Heap_Allocate_aligned_with_boundary+0x70> 200ca24: 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 ) { 200ca28: 12 80 00 17 bne 200ca84 <_Heap_Allocate_aligned_with_boundary+0xa8> 200ca2c: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200ca30: 80 a6 20 00 cmp %i0, 0 200ca34: 12 80 00 5b bne 200cba0 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200ca38: b8 07 20 01 inc %i4 break; } block = block->next; 200ca3c: 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 ) { 200ca40: 80 a7 40 11 cmp %i5, %l1 200ca44: 22 80 00 0b be,a 200ca70 <_Heap_Allocate_aligned_with_boundary+0x94> 200ca48: 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 ) { 200ca4c: e4 04 60 04 ld [ %l1 + 4 ], %l2 200ca50: 80 a4 00 12 cmp %l0, %l2 200ca54: 0a bf ff f5 bcs 200ca28 <_Heap_Allocate_aligned_with_boundary+0x4c> 200ca58: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200ca5c: 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 ) { 200ca60: 80 a7 40 11 cmp %i5, %l1 200ca64: 12 bf ff fa bne 200ca4c <_Heap_Allocate_aligned_with_boundary+0x70> 200ca68: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200ca6c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200ca70: 80 a0 40 1c cmp %g1, %i4 200ca74: 0a 80 00 5a bcs 200cbdc <_Heap_Allocate_aligned_with_boundary+0x200> 200ca78: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200ca7c: 81 c7 e0 08 ret 200ca80: 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; 200ca84: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200ca88: 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; 200ca8c: 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; 200ca90: 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; 200ca94: 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); 200ca98: 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; 200ca9c: 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 200caa0: a4 00 40 12 add %g1, %l2, %l2 200caa4: 40 00 2c 2d call 2017b58 <.urem> 200caa8: 90 10 00 18 mov %i0, %o0 200caac: 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 ) { 200cab0: 80 a4 80 18 cmp %l2, %i0 200cab4: 1a 80 00 06 bcc 200cacc <_Heap_Allocate_aligned_with_boundary+0xf0> 200cab8: a8 04 60 08 add %l1, 8, %l4 200cabc: 90 10 00 12 mov %l2, %o0 200cac0: 40 00 2c 26 call 2017b58 <.urem> 200cac4: 92 10 00 1a mov %i2, %o1 200cac8: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200cacc: 80 a6 e0 00 cmp %i3, 0 200cad0: 02 80 00 24 be 200cb60 <_Heap_Allocate_aligned_with_boundary+0x184> 200cad4: 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; 200cad8: a4 06 00 19 add %i0, %i1, %l2 200cadc: 92 10 00 1b mov %i3, %o1 200cae0: 40 00 2c 1e call 2017b58 <.urem> 200cae4: 90 10 00 12 mov %l2, %o0 200cae8: 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 ) { 200caec: 80 a6 00 08 cmp %i0, %o0 200caf0: 1a 80 00 1b bcc 200cb5c <_Heap_Allocate_aligned_with_boundary+0x180> 200caf4: 80 a2 00 12 cmp %o0, %l2 200caf8: 1a 80 00 1a bcc 200cb60 <_Heap_Allocate_aligned_with_boundary+0x184> 200cafc: 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; 200cb00: 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 ) { 200cb04: 80 a4 c0 08 cmp %l3, %o0 200cb08: 08 80 00 08 bleu 200cb28 <_Heap_Allocate_aligned_with_boundary+0x14c> 200cb0c: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cb10: 10 bf ff c9 b 200ca34 <_Heap_Allocate_aligned_with_boundary+0x58> 200cb14: 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 ) { 200cb18: 1a 80 00 11 bcc 200cb5c <_Heap_Allocate_aligned_with_boundary+0x180> 200cb1c: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200cb20: 18 bf ff c4 bgu 200ca30 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200cb24: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200cb28: b0 22 00 19 sub %o0, %i1, %i0 200cb2c: 92 10 00 1a mov %i2, %o1 200cb30: 40 00 2c 0a call 2017b58 <.urem> 200cb34: 90 10 00 18 mov %i0, %o0 200cb38: 92 10 00 1b mov %i3, %o1 200cb3c: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200cb40: a4 06 00 19 add %i0, %i1, %l2 200cb44: 40 00 2c 05 call 2017b58 <.urem> 200cb48: 90 10 00 12 mov %l2, %o0 200cb4c: 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 ) { 200cb50: 80 a2 00 12 cmp %o0, %l2 200cb54: 0a bf ff f1 bcs 200cb18 <_Heap_Allocate_aligned_with_boundary+0x13c> 200cb58: 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 ) { 200cb5c: 80 a5 00 18 cmp %l4, %i0 200cb60: 18 80 00 22 bgu 200cbe8 <_Heap_Allocate_aligned_with_boundary+0x20c> 200cb64: 82 10 3f f8 mov -8, %g1 200cb68: 90 10 00 18 mov %i0, %o0 200cb6c: a4 20 40 11 sub %g1, %l1, %l2 200cb70: 92 10 00 16 mov %l6, %o1 200cb74: 40 00 2b f9 call 2017b58 <.urem> 200cb78: 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 ) { 200cb7c: 90 a4 80 08 subcc %l2, %o0, %o0 200cb80: 02 bf ff ad be 200ca34 <_Heap_Allocate_aligned_with_boundary+0x58> 200cb84: 80 a6 20 00 cmp %i0, 0 200cb88: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200cb8c: 82 40 3f ff addx %g0, -1, %g1 200cb90: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cb94: 80 a6 20 00 cmp %i0, 0 200cb98: 02 bf ff a9 be 200ca3c <_Heap_Allocate_aligned_with_boundary+0x60> 200cb9c: 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; 200cba0: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200cba4: 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; 200cba8: 84 00 a0 01 inc %g2 stats->searches += search_count; 200cbac: 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; 200cbb0: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200cbb4: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200cbb8: 90 10 00 1d mov %i5, %o0 200cbbc: 92 10 00 11 mov %l1, %o1 200cbc0: 94 10 00 18 mov %i0, %o2 200cbc4: 7f ff ec 06 call 2007bdc <_Heap_Block_allocate> 200cbc8: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200cbcc: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200cbd0: 80 a0 40 1c cmp %g1, %i4 200cbd4: 1a 80 00 03 bcc 200cbe0 <_Heap_Allocate_aligned_with_boundary+0x204> 200cbd8: 01 00 00 00 nop stats->max_search = search_count; 200cbdc: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200cbe0: 81 c7 e0 08 ret 200cbe4: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200cbe8: 10 bf ff 92 b 200ca30 <_Heap_Allocate_aligned_with_boundary+0x54> 200cbec: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200cbf0: 18 bf ff a3 bgu 200ca7c <_Heap_Allocate_aligned_with_boundary+0xa0> 200cbf4: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200cbf8: 22 bf ff 83 be,a 200ca04 <_Heap_Allocate_aligned_with_boundary+0x28> 200cbfc: 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; 200cc00: 10 bf ff 82 b 200ca08 <_Heap_Allocate_aligned_with_boundary+0x2c> 200cc04: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200ca00 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200ca00: 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; 200ca04: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200ca08: 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; 200ca0c: 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; 200ca10: 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; 200ca14: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200ca18: 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; 200ca1c: 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 ) { 200ca20: 80 a6 40 1d cmp %i1, %i5 200ca24: 08 80 00 05 bleu 200ca38 <_Heap_Extend+0x38> 200ca28: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200ca2c: b0 0c 60 01 and %l1, 1, %i0 200ca30: 81 c7 e0 08 ret 200ca34: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200ca38: 90 10 00 19 mov %i1, %o0 200ca3c: 92 10 00 1a mov %i2, %o1 200ca40: 94 10 00 10 mov %l0, %o2 200ca44: 98 07 bf f8 add %fp, -8, %o4 200ca48: 7f ff eb b3 call 2007914 <_Heap_Get_first_and_last_block> 200ca4c: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200ca50: 80 8a 20 ff btst 0xff, %o0 200ca54: 02 bf ff f6 be 200ca2c <_Heap_Extend+0x2c> 200ca58: aa 10 20 00 clr %l5 200ca5c: a2 10 00 1c mov %i4, %l1 200ca60: ac 10 20 00 clr %l6 200ca64: a6 10 20 00 clr %l3 200ca68: 10 80 00 14 b 200cab8 <_Heap_Extend+0xb8> 200ca6c: 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 ) { 200ca70: 2a 80 00 02 bcs,a 200ca78 <_Heap_Extend+0x78> 200ca74: 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); 200ca78: 90 10 00 1a mov %i2, %o0 200ca7c: 40 00 16 c1 call 2012580 <.urem> 200ca80: 92 10 00 10 mov %l0, %o1 200ca84: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200ca88: 80 a6 80 19 cmp %i2, %i1 200ca8c: 02 80 00 1c be 200cafc <_Heap_Extend+0xfc> 200ca90: 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 ) { 200ca94: 80 a6 40 1a cmp %i1, %i2 200ca98: 38 80 00 02 bgu,a 200caa0 <_Heap_Extend+0xa0> 200ca9c: 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; 200caa0: e2 00 60 04 ld [ %g1 + 4 ], %l1 200caa4: 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); 200caa8: 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 ); 200caac: 80 a7 00 11 cmp %i4, %l1 200cab0: 22 80 00 1b be,a 200cb1c <_Heap_Extend+0x11c> 200cab4: 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; 200cab8: 80 a4 40 1c cmp %l1, %i4 200cabc: 02 80 00 66 be 200cc54 <_Heap_Extend+0x254> 200cac0: 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 ( 200cac4: 80 a0 40 1d cmp %g1, %i5 200cac8: 0a 80 00 70 bcs 200cc88 <_Heap_Extend+0x288> 200cacc: 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 ) { 200cad0: 80 a0 40 1d cmp %g1, %i5 200cad4: 12 bf ff e7 bne 200ca70 <_Heap_Extend+0x70> 200cad8: 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); 200cadc: 90 10 00 1a mov %i2, %o0 200cae0: 40 00 16 a8 call 2012580 <.urem> 200cae4: 92 10 00 10 mov %l0, %o1 200cae8: 82 06 bf f8 add %i2, -8, %g1 200caec: 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 ) { 200caf0: 80 a6 80 19 cmp %i2, %i1 200caf4: 12 bf ff e8 bne 200ca94 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200caf8: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200cafc: 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; 200cb00: e2 00 60 04 ld [ %g1 + 4 ], %l1 200cb04: 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); 200cb08: 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 ); 200cb0c: 80 a7 00 11 cmp %i4, %l1 200cb10: 12 bf ff ea bne 200cab8 <_Heap_Extend+0xb8> <== NEVER TAKEN 200cb14: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200cb18: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200cb1c: 80 a6 40 01 cmp %i1, %g1 200cb20: 3a 80 00 55 bcc,a 200cc74 <_Heap_Extend+0x274> 200cb24: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200cb28: 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; 200cb2c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200cb30: 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 ) { 200cb34: 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 = 200cb38: 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; 200cb3c: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200cb40: 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 = 200cb44: 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; 200cb48: 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 ) { 200cb4c: 80 a1 00 01 cmp %g4, %g1 200cb50: 08 80 00 43 bleu 200cc5c <_Heap_Extend+0x25c> 200cb54: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200cb58: 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 ) { 200cb5c: 80 a5 20 00 cmp %l4, 0 200cb60: 02 80 00 63 be 200ccec <_Heap_Extend+0x2ec> 200cb64: 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; 200cb68: 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; 200cb6c: 92 10 00 1c mov %i4, %o1 200cb70: 40 00 16 84 call 2012580 <.urem> 200cb74: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200cb78: 80 a2 20 00 cmp %o0, 0 200cb7c: 02 80 00 04 be 200cb8c <_Heap_Extend+0x18c> 200cb80: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200cb84: b2 06 40 1c add %i1, %i4, %i1 200cb88: 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 = 200cb8c: 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; 200cb90: 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 = 200cb94: 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; 200cb98: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200cb9c: 90 10 00 18 mov %i0, %o0 200cba0: 92 10 00 01 mov %g1, %o1 200cba4: 7f ff ff 8d call 200c9d8 <_Heap_Free_block> 200cba8: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200cbac: 80 a4 e0 00 cmp %l3, 0 200cbb0: 02 80 00 3b be 200cc9c <_Heap_Extend+0x29c> 200cbb4: 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); 200cbb8: 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( 200cbbc: ba 27 40 13 sub %i5, %l3, %i5 200cbc0: 40 00 16 70 call 2012580 <.urem> 200cbc4: 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) 200cbc8: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200cbcc: ba 27 40 08 sub %i5, %o0, %i5 200cbd0: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200cbd4: 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 = 200cbd8: 84 07 40 13 add %i5, %l3, %g2 200cbdc: 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; 200cbe0: 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 ); 200cbe4: 90 10 00 18 mov %i0, %o0 200cbe8: 82 08 60 01 and %g1, 1, %g1 200cbec: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200cbf0: ba 17 40 01 or %i5, %g1, %i5 200cbf4: 7f ff ff 79 call 200c9d8 <_Heap_Free_block> 200cbf8: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200cbfc: 80 a4 e0 00 cmp %l3, 0 200cc00: 02 80 00 34 be 200ccd0 <_Heap_Extend+0x2d0> 200cc04: 80 a5 20 00 cmp %l4, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200cc08: 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( 200cc0c: 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; 200cc10: 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( 200cc14: 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; 200cc18: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200cc1c: 84 10 80 03 or %g2, %g3, %g2 200cc20: 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; 200cc24: 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; 200cc28: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200cc2c: 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; 200cc30: a4 20 80 12 sub %g2, %l2, %l2 /* Statistics */ stats->size += extended_size; 200cc34: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200cc38: 80 a6 e0 00 cmp %i3, 0 200cc3c: 02 bf ff 7c be 200ca2c <_Heap_Extend+0x2c> <== NEVER TAKEN 200cc40: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200cc44: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200cc48: b0 0c 60 01 and %l1, 1, %i0 200cc4c: 81 c7 e0 08 ret 200cc50: 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; 200cc54: 10 bf ff 9c b 200cac4 <_Heap_Extend+0xc4> 200cc58: 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 ) { 200cc5c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200cc60: 80 a0 40 02 cmp %g1, %g2 200cc64: 2a bf ff be bcs,a 200cb5c <_Heap_Extend+0x15c> 200cc68: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200cc6c: 10 bf ff bd b 200cb60 <_Heap_Extend+0x160> 200cc70: 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 ) { 200cc74: 80 a7 40 01 cmp %i5, %g1 200cc78: 38 bf ff ad bgu,a 200cb2c <_Heap_Extend+0x12c> 200cc7c: 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; 200cc80: 10 bf ff ac b 200cb30 <_Heap_Extend+0x130> 200cc84: 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 ( 200cc88: 80 a6 40 1a cmp %i1, %i2 200cc8c: 1a bf ff 92 bcc 200cad4 <_Heap_Extend+0xd4> 200cc90: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200cc94: 10 bf ff 66 b 200ca2c <_Heap_Extend+0x2c> 200cc98: 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 ) { 200cc9c: 80 a5 60 00 cmp %l5, 0 200cca0: 02 bf ff d7 be 200cbfc <_Heap_Extend+0x1fc> 200cca4: 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; 200cca8: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200ccac: c2 07 bf fc ld [ %fp + -4 ], %g1 200ccb0: 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 ); 200ccb4: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200ccb8: 84 10 c0 02 or %g3, %g2, %g2 200ccbc: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200ccc0: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ccc4: 84 10 a0 01 or %g2, 1, %g2 200ccc8: 10 bf ff cd b 200cbfc <_Heap_Extend+0x1fc> 200cccc: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200ccd0: 32 bf ff cf bne,a 200cc0c <_Heap_Extend+0x20c> 200ccd4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200ccd8: d2 07 bf f8 ld [ %fp + -8 ], %o1 200ccdc: 7f ff ff 3f call 200c9d8 <_Heap_Free_block> 200cce0: 90 10 00 18 mov %i0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200cce4: 10 bf ff ca b 200cc0c <_Heap_Extend+0x20c> 200cce8: 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 ) { 200ccec: 80 a5 a0 00 cmp %l6, 0 200ccf0: 02 bf ff b0 be 200cbb0 <_Heap_Extend+0x1b0> 200ccf4: 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; 200ccf8: ac 25 80 02 sub %l6, %g2, %l6 200ccfc: 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 = 200cd00: 10 bf ff ac b 200cbb0 <_Heap_Extend+0x1b0> 200cd04: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200cc08 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200cc08: 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 ) { 200cc0c: 80 a6 60 00 cmp %i1, 0 200cc10: 02 80 00 56 be 200cd68 <_Heap_Free+0x160> 200cc14: 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); 200cc18: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200cc1c: 40 00 2b cf call 2017b58 <.urem> 200cc20: 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 200cc24: 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); 200cc28: 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); 200cc2c: 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; 200cc30: 80 a7 40 01 cmp %i5, %g1 200cc34: 0a 80 00 4d bcs 200cd68 <_Heap_Free+0x160> 200cc38: 84 10 20 00 clr %g2 200cc3c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200cc40: 80 a7 40 04 cmp %i5, %g4 200cc44: 38 80 00 4a bgu,a 200cd6c <_Heap_Free+0x164> 200cc48: b0 08 a0 01 and %g2, 1, %i0 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cc4c: 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; 200cc50: 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); 200cc54: 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; 200cc58: 80 a0 40 03 cmp %g1, %g3 200cc5c: 38 80 00 44 bgu,a 200cd6c <_Heap_Free+0x164> <== NEVER TAKEN 200cc60: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cc64: 80 a1 00 03 cmp %g4, %g3 200cc68: 2a 80 00 41 bcs,a 200cd6c <_Heap_Free+0x164> <== NEVER TAKEN 200cc6c: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cc70: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200cc74: 80 8b 60 01 btst 1, %o5 200cc78: 02 80 00 3c be 200cd68 <_Heap_Free+0x160> <== NEVER TAKEN 200cc7c: 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 )); 200cc80: 80 a1 00 03 cmp %g4, %g3 200cc84: 02 80 00 06 be 200cc9c <_Heap_Free+0x94> 200cc88: 9a 10 20 00 clr %o5 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cc8c: 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; 200cc90: da 00 a0 04 ld [ %g2 + 4 ], %o5 200cc94: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200cc98: 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 ) ) { 200cc9c: 80 8b e0 01 btst 1, %o7 200cca0: 12 80 00 1c bne 200cd10 <_Heap_Free+0x108> 200cca4: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200cca8: 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); 200ccac: 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; 200ccb0: 80 a0 40 0f cmp %g1, %o7 200ccb4: 18 80 00 2d bgu 200cd68 <_Heap_Free+0x160> <== NEVER TAKEN 200ccb8: 84 10 20 00 clr %g2 200ccbc: 80 a1 00 0f cmp %g4, %o7 200ccc0: 2a 80 00 2b bcs,a 200cd6c <_Heap_Free+0x164> <== NEVER TAKEN 200ccc4: 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; 200ccc8: 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) ) { 200cccc: 80 88 60 01 btst 1, %g1 200ccd0: 02 80 00 26 be 200cd68 <_Heap_Free+0x160> <== NEVER TAKEN 200ccd4: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200ccd8: 02 80 00 39 be 200cdbc <_Heap_Free+0x1b4> 200ccdc: 96 06 40 0b add %i1, %o3, %o3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cce0: c2 00 e0 08 ld [ %g3 + 8 ], %g1 200cce4: 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; 200cce8: 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; 200ccec: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200ccf0: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200ccf4: 82 00 ff ff add %g3, -1, %g1 200ccf8: 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; 200ccfc: 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; 200cd00: 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; 200cd04: 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; 200cd08: 10 80 00 0e b 200cd40 <_Heap_Free+0x138> 200cd0c: 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 */ 200cd10: 22 80 00 19 be,a 200cd74 <_Heap_Free+0x16c> 200cd14: c4 06 20 08 ld [ %i0 + 8 ], %g2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cd18: c4 00 e0 08 ld [ %g3 + 8 ], %g2 200cd1c: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200cd20: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200cd24: 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; 200cd28: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200cd2c: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200cd30: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cd34: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200cd38: 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; 200cd3c: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cd40: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200cd44: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200cd48: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cd4c: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200cd50: 82 00 60 01 inc %g1 stats->free_size += block_size; 200cd54: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cd58: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200cd5c: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200cd60: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200cd64: 84 10 20 01 mov 1, %g2 } 200cd68: b0 08 a0 01 and %g2, 1, %i0 200cd6c: 81 c7 e0 08 ret 200cd70: 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; 200cd74: 82 16 60 01 or %i1, 1, %g1 200cd78: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cd7c: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200cd80: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cd84: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200cd88: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200cd8c: 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; 200cd90: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200cd94: 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; 200cd98: 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 ) { 200cd9c: 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; 200cda0: 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; 200cda4: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200cda8: 80 a0 40 02 cmp %g1, %g2 200cdac: 08 bf ff e5 bleu 200cd40 <_Heap_Free+0x138> 200cdb0: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200cdb4: 10 bf ff e3 b 200cd40 <_Heap_Free+0x138> 200cdb8: 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; 200cdbc: 82 12 e0 01 or %o3, 1, %g1 200cdc0: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cdc4: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200cdc8: 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; 200cdcc: 82 08 7f fe and %g1, -2, %g1 200cdd0: 10 bf ff dc b 200cd40 <_Heap_Free+0x138> 200cdd4: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0200d314 <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200d314: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200d318: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200d31c: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200d320: 92 10 20 00 clr %o1 200d324: 90 10 00 19 mov %i1, %o0 200d328: 40 00 09 16 call 200f780 200d32c: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200d330: 80 a7 40 1c cmp %i5, %i4 200d334: 02 80 00 17 be 200d390 <_Heap_Get_information+0x7c> <== NEVER TAKEN 200d338: 01 00 00 00 nop 200d33c: 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; 200d340: 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); 200d344: ba 07 40 02 add %i5, %g2, %i5 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200d348: 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) ) 200d34c: 80 88 e0 01 btst 1, %g3 200d350: 02 80 00 03 be 200d35c <_Heap_Get_information+0x48> 200d354: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200d358: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200d35c: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200d360: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200d364: 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++; 200d368: 9e 03 e0 01 inc %o7 info->total += the_size; 200d36c: 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++; 200d370: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200d374: 80 a1 00 02 cmp %g4, %g2 200d378: 1a 80 00 03 bcc 200d384 <_Heap_Get_information+0x70> 200d37c: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200d380: 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 ) { 200d384: 80 a7 00 1d cmp %i4, %i5 200d388: 12 bf ff ef bne 200d344 <_Heap_Get_information+0x30> 200d38c: 84 08 ff fe and %g3, -2, %g2 200d390: 81 c7 e0 08 ret 200d394: 81 e8 00 00 restore =============================================================================== 02019670 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2019670: 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); 2019674: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 2019678: 7f ff f9 38 call 2017b58 <.urem> 201967c: 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 2019680: 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); 2019684: 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); 2019688: 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; 201968c: 80 a0 80 01 cmp %g2, %g1 2019690: 0a 80 00 16 bcs 20196e8 <_Heap_Size_of_alloc_area+0x78> 2019694: 86 10 20 00 clr %g3 2019698: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 201969c: 80 a0 80 04 cmp %g2, %g4 20196a0: 18 80 00 13 bgu 20196ec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 20196a4: 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; 20196a8: f0 00 a0 04 ld [ %g2 + 4 ], %i0 20196ac: 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); 20196b0: 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; 20196b4: 80 a0 40 02 cmp %g1, %g2 20196b8: 18 80 00 0d bgu 20196ec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 20196bc: b0 08 e0 01 and %g3, 1, %i0 20196c0: 80 a1 00 02 cmp %g4, %g2 20196c4: 0a 80 00 0a bcs 20196ec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 20196c8: 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; 20196cc: 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 ) 20196d0: 80 88 60 01 btst 1, %g1 20196d4: 02 80 00 06 be 20196ec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 20196d8: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 20196dc: 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; 20196e0: 84 00 a0 04 add %g2, 4, %g2 20196e4: c4 26 80 00 st %g2, [ %i2 ] return true; } 20196e8: b0 08 e0 01 and %g3, 1, %i0 20196ec: 81 c7 e0 08 ret 20196f0: 81 e8 00 00 restore =============================================================================== 02008694 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008694: 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; 2008698: 3b 00 80 21 sethi %hi(0x2008400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 200869c: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 20086a0: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 20086a4: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 20086a8: 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; 20086ac: 80 a6 a0 00 cmp %i2, 0 20086b0: 02 80 00 04 be 20086c0 <_Heap_Walk+0x2c> 20086b4: ba 17 62 28 or %i5, 0x228, %i5 20086b8: 3b 00 80 21 sethi %hi(0x2008400), %i5 20086bc: ba 17 62 30 or %i5, 0x230, %i5 ! 2008630 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20086c0: 03 00 80 60 sethi %hi(0x2018000), %g1 20086c4: c4 00 62 9c ld [ %g1 + 0x29c ], %g2 ! 201829c <_System_state_Current> 20086c8: 80 a0 a0 03 cmp %g2, 3 20086cc: 02 80 00 05 be 20086e0 <_Heap_Walk+0x4c> 20086d0: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 20086d4: b0 08 60 01 and %g1, 1, %i0 20086d8: 81 c7 e0 08 ret 20086dc: 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)( 20086e0: da 06 20 18 ld [ %i0 + 0x18 ], %o5 20086e4: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 20086e8: c4 06 20 08 ld [ %i0 + 8 ], %g2 20086ec: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20086f0: 90 10 00 19 mov %i1, %o0 20086f4: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20086f8: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 20086fc: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2008700: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2008704: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008708: 92 10 20 00 clr %o1 200870c: 96 10 00 10 mov %l0, %o3 2008710: 15 00 80 56 sethi %hi(0x2015800), %o2 2008714: 98 10 00 1b mov %i3, %o4 2008718: 9f c7 40 00 call %i5 200871c: 94 12 a0 50 or %o2, 0x50, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008720: 80 a4 20 00 cmp %l0, 0 2008724: 02 80 00 28 be 20087c4 <_Heap_Walk+0x130> 2008728: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 200872c: 12 80 00 2d bne 20087e0 <_Heap_Walk+0x14c> 2008730: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008734: 7f ff e4 e6 call 2001acc <.urem> 2008738: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 200873c: 80 a2 20 00 cmp %o0, 0 2008740: 12 80 00 30 bne 2008800 <_Heap_Walk+0x16c> 2008744: 90 07 20 08 add %i4, 8, %o0 2008748: 7f ff e4 e1 call 2001acc <.urem> 200874c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 2008750: 80 a2 20 00 cmp %o0, 0 2008754: 32 80 00 33 bne,a 2008820 <_Heap_Walk+0x18c> 2008758: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 200875c: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008760: 80 8d 20 01 btst 1, %l4 2008764: 22 80 00 36 be,a 200883c <_Heap_Walk+0x1a8> 2008768: 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; 200876c: c2 04 60 04 ld [ %l1 + 4 ], %g1 2008770: 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); 2008774: 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; 2008778: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200877c: 80 88 a0 01 btst 1, %g2 2008780: 02 80 00 0a be 20087a8 <_Heap_Walk+0x114> 2008784: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 2008788: 02 80 00 33 be 2008854 <_Heap_Walk+0x1c0> 200878c: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008790: 92 10 20 01 mov 1, %o1 2008794: 15 00 80 56 sethi %hi(0x2015800), %o2 2008798: 9f c7 40 00 call %i5 200879c: 94 12 a1 c8 or %o2, 0x1c8, %o2 ! 20159c8 <_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; 20087a0: 10 bf ff cd b 20086d4 <_Heap_Walk+0x40> 20087a4: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 20087a8: 90 10 00 19 mov %i1, %o0 20087ac: 92 10 20 01 mov 1, %o1 20087b0: 15 00 80 56 sethi %hi(0x2015800), %o2 20087b4: 9f c7 40 00 call %i5 20087b8: 94 12 a1 b0 or %o2, 0x1b0, %o2 ! 20159b0 <_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; 20087bc: 10 bf ff c6 b 20086d4 <_Heap_Walk+0x40> 20087c0: 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" ); 20087c4: 90 10 00 19 mov %i1, %o0 20087c8: 92 10 20 01 mov 1, %o1 20087cc: 15 00 80 56 sethi %hi(0x2015800), %o2 20087d0: 9f c7 40 00 call %i5 20087d4: 94 12 a0 e8 or %o2, 0xe8, %o2 ! 20158e8 <_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; 20087d8: 10 bf ff bf b 20086d4 <_Heap_Walk+0x40> 20087dc: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 20087e0: 90 10 00 19 mov %i1, %o0 20087e4: 92 10 20 01 mov 1, %o1 20087e8: 96 10 00 10 mov %l0, %o3 20087ec: 15 00 80 56 sethi %hi(0x2015800), %o2 20087f0: 9f c7 40 00 call %i5 20087f4: 94 12 a1 00 or %o2, 0x100, %o2 ! 2015900 <_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; 20087f8: 10 bf ff b7 b 20086d4 <_Heap_Walk+0x40> 20087fc: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008800: 90 10 00 19 mov %i1, %o0 2008804: 92 10 20 01 mov 1, %o1 2008808: 96 10 00 1b mov %i3, %o3 200880c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008810: 9f c7 40 00 call %i5 2008814: 94 12 a1 20 or %o2, 0x120, %o2 ! 2015920 <_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; 2008818: 10 bf ff af b 20086d4 <_Heap_Walk+0x40> 200881c: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008820: 92 10 20 01 mov 1, %o1 2008824: 96 10 00 1c mov %i4, %o3 2008828: 15 00 80 56 sethi %hi(0x2015800), %o2 200882c: 9f c7 40 00 call %i5 2008830: 94 12 a1 48 or %o2, 0x148, %o2 ! 2015948 <_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; 2008834: 10 bf ff a8 b 20086d4 <_Heap_Walk+0x40> 2008838: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 200883c: 92 10 20 01 mov 1, %o1 2008840: 15 00 80 56 sethi %hi(0x2015800), %o2 2008844: 9f c7 40 00 call %i5 2008848: 94 12 a1 80 or %o2, 0x180, %o2 ! 2015980 <_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; 200884c: 10 bf ff a2 b 20086d4 <_Heap_Walk+0x40> 2008850: 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; 2008854: 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; 2008858: 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 ) { 200885c: 80 a6 00 1a cmp %i0, %i2 2008860: 02 80 00 0d be 2008894 <_Heap_Walk+0x200> 2008864: 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; 2008868: 80 a0 40 1a cmp %g1, %i2 200886c: 28 80 00 bc bleu,a 2008b5c <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 2008870: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2008874: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008878: 92 10 20 01 mov 1, %o1 200887c: 96 10 00 1a mov %i2, %o3 2008880: 15 00 80 56 sethi %hi(0x2015800), %o2 2008884: 9f c7 40 00 call %i5 2008888: 94 12 a1 f8 or %o2, 0x1f8, %o2 ! 20159f8 <_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; 200888c: 10 bf ff 92 b 20086d4 <_Heap_Walk+0x40> 2008890: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008894: 2d 00 80 57 sethi %hi(0x2015c00), %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)( 2008898: 2f 00 80 57 sethi %hi(0x2015c00), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200889c: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20088a0: ac 15 a0 28 or %l6, 0x28, %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)( 20088a4: ae 15 e0 10 or %l7, 0x10, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20088a8: 2b 00 80 56 sethi %hi(0x2015800), %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; 20088ac: 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); 20088b0: 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; 20088b4: 80 a0 40 1a cmp %g1, %i2 20088b8: 28 80 00 0b bleu,a 20088e4 <_Heap_Walk+0x250> <== ALWAYS TAKEN 20088bc: 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)( 20088c0: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20088c4: 92 10 20 01 mov 1, %o1 20088c8: 96 10 00 12 mov %l2, %o3 20088cc: 15 00 80 56 sethi %hi(0x2015800), %o2 20088d0: 98 10 00 1a mov %i2, %o4 20088d4: 9f c7 40 00 call %i5 20088d8: 94 12 a2 a0 or %o2, 0x2a0, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 20088dc: 10 bf ff 7e b 20086d4 <_Heap_Walk+0x40> 20088e0: 82 10 20 00 clr %g1 20088e4: 80 a0 40 1a cmp %g1, %i2 20088e8: 0a bf ff f7 bcs 20088c4 <_Heap_Walk+0x230> 20088ec: 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; 20088f0: 82 1c 80 11 xor %l2, %l1, %g1 20088f4: 80 a0 00 01 cmp %g0, %g1 20088f8: 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; 20088fc: 90 10 00 13 mov %l3, %o0 2008900: c2 27 bf fc st %g1, [ %fp + -4 ] 2008904: 7f ff e4 72 call 2001acc <.urem> 2008908: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200890c: 80 a2 20 00 cmp %o0, 0 2008910: 02 80 00 05 be 2008924 <_Heap_Walk+0x290> 2008914: c2 07 bf fc ld [ %fp + -4 ], %g1 2008918: 80 88 60 ff btst 0xff, %g1 200891c: 12 80 00 76 bne 2008af4 <_Heap_Walk+0x460> 2008920: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008924: 80 a6 c0 13 cmp %i3, %l3 2008928: 08 80 00 05 bleu 200893c <_Heap_Walk+0x2a8> 200892c: 80 a4 80 1a cmp %l2, %i2 2008930: 80 88 60 ff btst 0xff, %g1 2008934: 12 80 00 78 bne 2008b14 <_Heap_Walk+0x480> <== ALWAYS TAKEN 2008938: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200893c: 2a 80 00 06 bcs,a 2008954 <_Heap_Walk+0x2c0> 2008940: c2 06 a0 04 ld [ %i2 + 4 ], %g1 2008944: 80 88 60 ff btst 0xff, %g1 2008948: 12 80 00 7d bne 2008b3c <_Heap_Walk+0x4a8> 200894c: 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; 2008950: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008954: 80 88 60 01 btst 1, %g1 2008958: 02 80 00 19 be 20089bc <_Heap_Walk+0x328> 200895c: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2008960: 80 a5 20 00 cmp %l4, 0 2008964: 22 80 00 0e be,a 200899c <_Heap_Walk+0x308> 2008968: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 200896c: 90 10 00 19 mov %i1, %o0 2008970: 92 10 20 00 clr %o1 2008974: 94 10 00 17 mov %l7, %o2 2008978: 96 10 00 12 mov %l2, %o3 200897c: 9f c7 40 00 call %i5 2008980: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008984: 80 a7 00 1a cmp %i4, %i2 2008988: 02 80 00 42 be 2008a90 <_Heap_Walk+0x3fc> 200898c: a4 10 00 1a mov %i2, %l2 2008990: e8 06 a0 04 ld [ %i2 + 4 ], %l4 2008994: 10 bf ff c6 b 20088ac <_Heap_Walk+0x218> 2008998: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200899c: 96 10 00 12 mov %l2, %o3 20089a0: 90 10 00 19 mov %i1, %o0 20089a4: 92 10 20 00 clr %o1 20089a8: 94 10 00 16 mov %l6, %o2 20089ac: 9f c7 40 00 call %i5 20089b0: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20089b4: 10 bf ff f5 b 2008988 <_Heap_Walk+0x2f4> 20089b8: 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 ? 20089bc: 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)( 20089c0: c2 06 20 08 ld [ %i0 + 8 ], %g1 20089c4: 05 00 80 56 sethi %hi(0x2015800), %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; 20089c8: c8 06 20 0c ld [ %i0 + 0xc ], %g4 20089cc: 80 a0 40 0d cmp %g1, %o5 20089d0: 02 80 00 05 be 20089e4 <_Heap_Walk+0x350> 20089d4: 86 10 a0 10 or %g2, 0x10, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 20089d8: 80 a6 00 0d cmp %i0, %o5 20089dc: 02 80 00 3c be 2008acc <_Heap_Walk+0x438> 20089e0: 86 15 63 d8 or %l5, 0x3d8, %g3 block->next, block->next == last_free_block ? 20089e4: 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)( 20089e8: 1f 00 80 56 sethi %hi(0x2015800), %o7 20089ec: 80 a1 00 01 cmp %g4, %g1 20089f0: 02 80 00 05 be 2008a04 <_Heap_Walk+0x370> 20089f4: 84 13 e0 30 or %o7, 0x30, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20089f8: 80 a6 00 01 cmp %i0, %g1 20089fc: 02 80 00 31 be 2008ac0 <_Heap_Walk+0x42c> 2008a00: 84 15 63 d8 or %l5, 0x3d8, %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)( 2008a04: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008a08: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008a0c: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008a10: 90 10 00 19 mov %i1, %o0 2008a14: 92 10 20 00 clr %o1 2008a18: 15 00 80 56 sethi %hi(0x2015800), %o2 2008a1c: 96 10 00 12 mov %l2, %o3 2008a20: 94 12 a3 68 or %o2, 0x368, %o2 2008a24: 9f c7 40 00 call %i5 2008a28: 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 ) { 2008a2c: da 06 80 00 ld [ %i2 ], %o5 2008a30: 80 a4 c0 0d cmp %l3, %o5 2008a34: 12 80 00 19 bne 2008a98 <_Heap_Walk+0x404> 2008a38: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2008a3c: 02 80 00 27 be 2008ad8 <_Heap_Walk+0x444> 2008a40: 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; 2008a44: 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 ) { 2008a48: 80 a6 00 01 cmp %i0, %g1 2008a4c: 02 80 00 0b be 2008a78 <_Heap_Walk+0x3e4> <== NEVER TAKEN 2008a50: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008a54: 80 a4 80 01 cmp %l2, %g1 2008a58: 02 bf ff cc be 2008988 <_Heap_Walk+0x2f4> 2008a5c: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2008a60: 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 ) { 2008a64: 80 a6 00 01 cmp %i0, %g1 2008a68: 12 bf ff fc bne 2008a58 <_Heap_Walk+0x3c4> 2008a6c: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008a70: 90 10 00 19 mov %i1, %o0 2008a74: 92 10 20 01 mov 1, %o1 2008a78: 96 10 00 12 mov %l2, %o3 2008a7c: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008a80: 9f c7 40 00 call %i5 2008a84: 94 12 a0 50 or %o2, 0x50, %o2 ! 2015c50 <_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; 2008a88: 10 bf ff 13 b 20086d4 <_Heap_Walk+0x40> 2008a8c: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 2008a90: 10 bf ff 11 b 20086d4 <_Heap_Walk+0x40> 2008a94: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008a98: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 2008a9c: 90 10 00 19 mov %i1, %o0 2008aa0: 92 10 20 01 mov 1, %o1 2008aa4: 96 10 00 12 mov %l2, %o3 2008aa8: 15 00 80 56 sethi %hi(0x2015800), %o2 2008aac: 98 10 00 13 mov %l3, %o4 2008ab0: 9f c7 40 00 call %i5 2008ab4: 94 12 a3 a0 or %o2, 0x3a0, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008ab8: 10 bf ff 07 b 20086d4 <_Heap_Walk+0x40> 2008abc: 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)" : "") 2008ac0: 05 00 80 56 sethi %hi(0x2015800), %g2 2008ac4: 10 bf ff d0 b 2008a04 <_Heap_Walk+0x370> 2008ac8: 84 10 a0 40 or %g2, 0x40, %g2 ! 2015840 <_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)" : ""), 2008acc: 07 00 80 56 sethi %hi(0x2015800), %g3 2008ad0: 10 bf ff c5 b 20089e4 <_Heap_Walk+0x350> 2008ad4: 86 10 e0 20 or %g3, 0x20, %g3 ! 2015820 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008ad8: 92 10 20 01 mov 1, %o1 2008adc: 96 10 00 12 mov %l2, %o3 2008ae0: 15 00 80 56 sethi %hi(0x2015800), %o2 2008ae4: 9f c7 40 00 call %i5 2008ae8: 94 12 a3 e0 or %o2, 0x3e0, %o2 ! 2015be0 <_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; 2008aec: 10 bf fe fa b 20086d4 <_Heap_Walk+0x40> 2008af0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008af4: 92 10 20 01 mov 1, %o1 2008af8: 96 10 00 12 mov %l2, %o3 2008afc: 15 00 80 56 sethi %hi(0x2015800), %o2 2008b00: 98 10 00 13 mov %l3, %o4 2008b04: 9f c7 40 00 call %i5 2008b08: 94 12 a2 d0 or %o2, 0x2d0, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008b0c: 10 bf fe f2 b 20086d4 <_Heap_Walk+0x40> 2008b10: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008b14: 90 10 00 19 mov %i1, %o0 2008b18: 92 10 20 01 mov 1, %o1 2008b1c: 96 10 00 12 mov %l2, %o3 2008b20: 15 00 80 56 sethi %hi(0x2015800), %o2 2008b24: 98 10 00 13 mov %l3, %o4 2008b28: 94 12 a3 00 or %o2, 0x300, %o2 2008b2c: 9f c7 40 00 call %i5 2008b30: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 2008b34: 10 bf fe e8 b 20086d4 <_Heap_Walk+0x40> 2008b38: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008b3c: 92 10 20 01 mov 1, %o1 2008b40: 96 10 00 12 mov %l2, %o3 2008b44: 15 00 80 56 sethi %hi(0x2015800), %o2 2008b48: 98 10 00 1a mov %i2, %o4 2008b4c: 9f c7 40 00 call %i5 2008b50: 94 12 a3 30 or %o2, 0x330, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008b54: 10 bf fe e0 b 20086d4 <_Heap_Walk+0x40> 2008b58: 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; 2008b5c: 80 a6 80 13 cmp %i2, %l3 2008b60: 18 bf ff 46 bgu 2008878 <_Heap_Walk+0x1e4> <== NEVER TAKEN 2008b64: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008b68: c2 27 bf fc st %g1, [ %fp + -4 ] 2008b6c: 90 06 a0 08 add %i2, 8, %o0 2008b70: 7f ff e3 d7 call 2001acc <.urem> 2008b74: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008b78: 80 a2 20 00 cmp %o0, 0 2008b7c: 12 80 00 36 bne 2008c54 <_Heap_Walk+0x5c0> <== NEVER TAKEN 2008b80: 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; 2008b84: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008b88: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008b8c: 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; 2008b90: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008b94: 80 88 a0 01 btst 1, %g2 2008b98: 12 80 00 27 bne 2008c34 <_Heap_Walk+0x5a0> <== NEVER TAKEN 2008b9c: 84 10 00 18 mov %i0, %g2 2008ba0: 10 80 00 19 b 2008c04 <_Heap_Walk+0x570> 2008ba4: 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 ) { 2008ba8: 80 a6 00 1a cmp %i0, %i2 2008bac: 02 bf ff 3a be 2008894 <_Heap_Walk+0x200> 2008bb0: 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; 2008bb4: 0a bf ff 31 bcs 2008878 <_Heap_Walk+0x1e4> 2008bb8: 90 10 00 19 mov %i1, %o0 2008bbc: 80 a6 80 13 cmp %i2, %l3 2008bc0: 18 bf ff 2f bgu 200887c <_Heap_Walk+0x1e8> <== NEVER TAKEN 2008bc4: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008bc8: c2 27 bf fc st %g1, [ %fp + -4 ] 2008bcc: 90 06 a0 08 add %i2, 8, %o0 2008bd0: 7f ff e3 bf call 2001acc <.urem> 2008bd4: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008bd8: 80 a2 20 00 cmp %o0, 0 2008bdc: 12 80 00 1e bne 2008c54 <_Heap_Walk+0x5c0> 2008be0: 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; 2008be4: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008be8: 84 10 00 12 mov %l2, %g2 2008bec: 86 08 ff fe and %g3, -2, %g3 block = next_block; } while ( block != first_block ); return true; } 2008bf0: 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; 2008bf4: c6 00 e0 04 ld [ %g3 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008bf8: 80 88 e0 01 btst 1, %g3 2008bfc: 12 80 00 0e bne 2008c34 <_Heap_Walk+0x5a0> 2008c00: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2008c04: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2008c08: 80 a3 00 02 cmp %o4, %g2 2008c0c: 22 bf ff e7 be,a 2008ba8 <_Heap_Walk+0x514> 2008c10: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2008c14: 90 10 00 19 mov %i1, %o0 2008c18: 92 10 20 01 mov 1, %o1 2008c1c: 96 10 00 1a mov %i2, %o3 2008c20: 15 00 80 56 sethi %hi(0x2015800), %o2 2008c24: 9f c7 40 00 call %i5 2008c28: 94 12 a2 68 or %o2, 0x268, %o2 ! 2015a68 <_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; 2008c2c: 10 bf fe aa b 20086d4 <_Heap_Walk+0x40> 2008c30: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008c34: 90 10 00 19 mov %i1, %o0 2008c38: 92 10 20 01 mov 1, %o1 2008c3c: 96 10 00 1a mov %i2, %o3 2008c40: 15 00 80 56 sethi %hi(0x2015800), %o2 2008c44: 9f c7 40 00 call %i5 2008c48: 94 12 a2 48 or %o2, 0x248, %o2 ! 2015a48 <_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; 2008c4c: 10 bf fe a2 b 20086d4 <_Heap_Walk+0x40> 2008c50: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008c54: 90 10 00 19 mov %i1, %o0 2008c58: 92 10 20 01 mov 1, %o1 2008c5c: 96 10 00 1a mov %i2, %o3 2008c60: 15 00 80 56 sethi %hi(0x2015800), %o2 2008c64: 9f c7 40 00 call %i5 2008c68: 94 12 a2 18 or %o2, 0x218, %o2 ! 2015a18 <_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; 2008c6c: 10 bf fe 9a b 20086d4 <_Heap_Walk+0x40> 2008c70: 82 10 20 00 clr %g1 =============================================================================== 020070d4 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 20070d4: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 20070d8: 39 00 80 71 sethi %hi(0x201c400), %i4 20070dc: c2 07 21 44 ld [ %i4 + 0x144 ], %g1 ! 201c544 <_IO_Number_of_drivers> 20070e0: 80 a0 60 00 cmp %g1, 0 20070e4: 02 80 00 0c be 2007114 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 20070e8: ba 10 20 00 clr %i5 20070ec: b8 17 21 44 or %i4, 0x144, %i4 (void) rtems_io_initialize( major, 0, NULL ); 20070f0: 90 10 00 1d mov %i5, %o0 20070f4: 92 10 20 00 clr %o1 20070f8: 40 00 15 97 call 200c754 20070fc: 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 ++ ) 2007100: c2 07 00 00 ld [ %i4 ], %g1 2007104: ba 07 60 01 inc %i5 2007108: 80 a0 40 1d cmp %g1, %i5 200710c: 18 bf ff fa bgu 20070f4 <_IO_Initialize_all_drivers+0x20> 2007110: 90 10 00 1d mov %i5, %o0 2007114: 81 c7 e0 08 ret 2007118: 81 e8 00 00 restore =============================================================================== 02007008 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2007008: 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; 200700c: 03 00 80 6d sethi %hi(0x201b400), %g1 2007010: 82 10 61 9c or %g1, 0x19c, %g1 ! 201b59c drivers_in_table = Configuration.number_of_device_drivers; 2007014: f8 00 60 30 ld [ %g1 + 0x30 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2007018: 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 ) 200701c: 80 a7 00 19 cmp %i4, %i1 2007020: 0a 80 00 08 bcs 2007040 <_IO_Manager_initialization+0x38> 2007024: 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; 2007028: 03 00 80 71 sethi %hi(0x201c400), %g1 200702c: fa 20 61 48 st %i5, [ %g1 + 0x148 ] ! 201c548 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2007030: 03 00 80 71 sethi %hi(0x201c400), %g1 2007034: f8 20 61 44 st %i4, [ %g1 + 0x144 ] ! 201c544 <_IO_Number_of_drivers> return; 2007038: 81 c7 e0 08 ret 200703c: 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 ) 2007040: 83 2e 60 03 sll %i1, 3, %g1 2007044: b5 2e 60 05 sll %i1, 5, %i2 2007048: 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( 200704c: 40 00 0d 17 call 200a4a8 <_Workspace_Allocate_or_fatal_error> 2007050: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2007054: 03 00 80 71 sethi %hi(0x201c400), %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 *) 2007058: 37 00 80 71 sethi %hi(0x201c400), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 200705c: f2 20 61 44 st %i1, [ %g1 + 0x144 ] /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 2007060: d0 26 e1 48 st %o0, [ %i3 + 0x148 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2007064: 92 10 20 00 clr %o1 2007068: 40 00 21 05 call 200f47c 200706c: 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++ ) 2007070: 80 a7 20 00 cmp %i4, 0 2007074: 02 bf ff f1 be 2007038 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2007078: f6 06 e1 48 ld [ %i3 + 0x148 ], %i3 200707c: 82 10 20 00 clr %g1 2007080: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007084: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2007088: 86 07 40 01 add %i5, %g1, %g3 200708c: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 2007090: f4 00 e0 04 ld [ %g3 + 4 ], %i2 2007094: 84 06 c0 01 add %i3, %g1, %g2 2007098: f4 20 a0 04 st %i2, [ %g2 + 4 ] 200709c: 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++ ) 20070a0: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 20070a4: f4 20 a0 08 st %i2, [ %g2 + 8 ] 20070a8: 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++ ) 20070ac: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 20070b0: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 20070b4: 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++ ) 20070b8: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 20070bc: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 20070c0: 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++ ) 20070c4: 12 bf ff f0 bne 2007084 <_IO_Manager_initialization+0x7c> 20070c8: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 20070cc: 81 c7 e0 08 ret 20070d0: 81 e8 00 00 restore =============================================================================== 02007dd0 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007dd0: 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 ) 2007dd4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007dd8: 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 ) 2007ddc: 80 a0 60 00 cmp %g1, 0 2007de0: 02 80 00 19 be 2007e44 <_Objects_Allocate+0x74> <== NEVER TAKEN 2007de4: 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 ); 2007de8: b8 07 60 20 add %i5, 0x20, %i4 2007dec: 7f ff fd 63 call 2007378 <_Chain_Get> 2007df0: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007df4: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2007df8: 80 a0 60 00 cmp %g1, 0 2007dfc: 02 80 00 12 be 2007e44 <_Objects_Allocate+0x74> 2007e00: 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 ) { 2007e04: 80 a2 20 00 cmp %o0, 0 2007e08: 02 80 00 11 be 2007e4c <_Objects_Allocate+0x7c> 2007e0c: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007e10: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007e14: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007e18: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007e1c: 40 00 3e a3 call 20178a8 <.udiv> 2007e20: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007e24: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007e28: 91 2a 20 02 sll %o0, 2, %o0 2007e2c: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007e30: 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 ]--; 2007e34: 86 00 ff ff add %g3, -1, %g3 2007e38: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007e3c: 82 00 bf ff add %g2, -1, %g1 2007e40: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007e44: 81 c7 e0 08 ret 2007e48: 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 ); 2007e4c: 40 00 00 10 call 2007e8c <_Objects_Extend_information> 2007e50: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007e54: 7f ff fd 49 call 2007378 <_Chain_Get> 2007e58: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007e5c: b0 92 20 00 orcc %o0, 0, %i0 2007e60: 32 bf ff ed bne,a 2007e14 <_Objects_Allocate+0x44> 2007e64: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2007e68: 81 c7 e0 08 ret 2007e6c: 81 e8 00 00 restore =============================================================================== 02007e8c <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007e8c: 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 ) 2007e90: 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 ); 2007e94: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007e98: 80 a4 20 00 cmp %l0, 0 2007e9c: 02 80 00 a6 be 2008134 <_Objects_Extend_information+0x2a8> 2007ea0: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007ea4: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 2007ea8: b3 2e 60 10 sll %i1, 0x10, %i1 2007eac: 92 10 00 1a mov %i2, %o1 2007eb0: 40 00 3e 7e call 20178a8 <.udiv> 2007eb4: 91 36 60 10 srl %i1, 0x10, %o0 2007eb8: a7 2a 20 10 sll %o0, 0x10, %l3 2007ebc: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 2007ec0: 80 a4 e0 00 cmp %l3, 0 2007ec4: 02 80 00 a3 be 2008150 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 2007ec8: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 2007ecc: 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 ); 2007ed0: 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 ) { 2007ed4: 80 a0 60 00 cmp %g1, 0 2007ed8: 12 80 00 08 bne 2007ef8 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 2007edc: b6 10 20 00 clr %i3 do_extend = false; 2007ee0: 10 80 00 a0 b 2008160 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 2007ee4: 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 ) { 2007ee8: c2 04 00 01 ld [ %l0 + %g1 ], %g1 2007eec: 80 a0 60 00 cmp %g1, 0 2007ef0: 22 80 00 08 be,a 2007f10 <_Objects_Extend_information+0x84> 2007ef4: 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++ ) { 2007ef8: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007efc: 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++ ) { 2007f00: 80 a4 c0 1b cmp %l3, %i3 2007f04: 18 bf ff f9 bgu 2007ee8 <_Objects_Extend_information+0x5c> 2007f08: 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; 2007f0c: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007f10: 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 ) { 2007f14: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007f18: 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 ) { 2007f1c: 82 10 63 ff or %g1, 0x3ff, %g1 2007f20: 80 a6 40 01 cmp %i1, %g1 2007f24: 18 80 00 93 bgu 2008170 <_Objects_Extend_information+0x2e4> 2007f28: 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; 2007f2c: 40 00 3e 25 call 20177c0 <.umul> 2007f30: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007f34: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007f38: 80 a0 60 00 cmp %g1, 0 2007f3c: 02 80 00 6a be 20080e4 <_Objects_Extend_information+0x258> 2007f40: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007f44: 40 00 09 4b call 200a470 <_Workspace_Allocate> 2007f48: 01 00 00 00 nop if ( !new_object_block ) 2007f4c: a0 92 20 00 orcc %o0, 0, %l0 2007f50: 02 80 00 88 be 2008170 <_Objects_Extend_information+0x2e4> 2007f54: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2007f58: 80 8e a0 ff btst 0xff, %i2 2007f5c: 22 80 00 3f be,a 2008058 <_Objects_Extend_information+0x1cc> 2007f60: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007f64: 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 *)) + 2007f68: 91 2e a0 01 sll %i2, 1, %o0 2007f6c: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2007f70: 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 *)) + 2007f74: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007f78: 40 00 09 3e call 200a470 <_Workspace_Allocate> 2007f7c: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2007f80: a2 92 20 00 orcc %o0, 0, %l1 2007f84: 02 80 00 79 be 2008168 <_Objects_Extend_information+0x2dc> 2007f88: 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 ) { 2007f8c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007f90: 80 a7 00 01 cmp %i4, %g1 2007f94: a4 04 40 1a add %l1, %i2, %l2 2007f98: 0a 80 00 57 bcs 20080f4 <_Objects_Extend_information+0x268> 2007f9c: 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++ ) { 2007fa0: 80 a7 20 00 cmp %i4, 0 2007fa4: 02 80 00 07 be 2007fc0 <_Objects_Extend_information+0x134><== NEVER TAKEN 2007fa8: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007fac: 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++ ) { 2007fb0: 82 00 60 01 inc %g1 2007fb4: 80 a7 00 01 cmp %i4, %g1 2007fb8: 18 bf ff fd bgu 2007fac <_Objects_Extend_information+0x120><== NEVER TAKEN 2007fbc: c0 20 80 1a clr [ %g2 + %i2 ] 2007fc0: 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 ); 2007fc4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2007fc8: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007fcc: 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 ; 2007fd0: 80 a7 40 03 cmp %i5, %g3 2007fd4: 1a 80 00 0a bcc 2007ffc <_Objects_Extend_information+0x170><== NEVER TAKEN 2007fd8: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007fdc: 83 2f 60 02 sll %i5, 2, %g1 2007fe0: 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 ; 2007fe4: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2007fe8: 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++ ) { 2007fec: 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 ; 2007ff0: 80 a0 c0 02 cmp %g3, %g2 2007ff4: 18 bf ff fd bgu 2007fe8 <_Objects_Extend_information+0x15c> 2007ff8: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2007ffc: 7f ff e8 63 call 2002188 2008000: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008004: 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( 2008008: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 200800c: 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; 2008010: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2008014: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008018: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 200801c: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2008020: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2008024: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2008028: 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) | 200802c: 03 00 00 40 sethi %hi(0x10000), %g1 2008030: b3 36 60 10 srl %i1, 0x10, %i1 2008034: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008038: 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) | 200803c: 82 10 40 19 or %g1, %i1, %g1 2008040: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2008044: 7f ff e8 55 call 2002198 2008048: 01 00 00 00 nop _Workspace_Free( old_tables ); 200804c: 40 00 09 11 call 200a490 <_Workspace_Free> 2008050: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2008054: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2008058: b7 2e e0 02 sll %i3, 2, %i3 200805c: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2008060: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2008064: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2008068: d2 00 40 1b ld [ %g1 + %i3 ], %o1 200806c: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2008070: 90 07 bf f4 add %fp, -12, %o0 2008074: 40 00 11 d0 call 200c7b4 <_Chain_Initialize> 2008078: 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 ) { 200807c: 10 80 00 0d b 20080b0 <_Objects_Extend_information+0x224> 2008080: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 2008084: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2008088: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200808c: 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) | 2008090: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008094: 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) | 2008098: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 200809c: 90 10 00 1a mov %i2, %o0 20080a0: 92 10 00 01 mov %g1, %o1 index++; 20080a4: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20080a8: 7f ff fc a0 call 2007328 <_Chain_Append> 20080ac: 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 ) { 20080b0: 7f ff fc b2 call 2007378 <_Chain_Get> 20080b4: 90 07 bf f4 add %fp, -12, %o0 20080b8: 82 92 20 00 orcc %o0, 0, %g1 20080bc: 32 bf ff f2 bne,a 2008084 <_Objects_Extend_information+0x1f8> 20080c0: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20080c4: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20080c8: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20080cc: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20080d0: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20080d4: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20080d8: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 20080dc: 81 c7 e0 08 ret 20080e0: 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 ); 20080e4: 40 00 08 f1 call 200a4a8 <_Workspace_Allocate_or_fatal_error> 20080e8: 01 00 00 00 nop 20080ec: 10 bf ff 9b b 2007f58 <_Objects_Extend_information+0xcc> 20080f0: 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, 20080f4: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 20080f8: 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, 20080fc: 40 00 1c a4 call 200f38c 2008100: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2008104: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2008108: 94 10 00 13 mov %l3, %o2 200810c: 40 00 1c a0 call 200f38c 2008110: 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 *) ); 2008114: 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, 2008118: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 200811c: 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, 2008120: 90 10 00 1a mov %i2, %o0 2008124: 40 00 1c 9a call 200f38c 2008128: 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 ); 200812c: 10 bf ff a7 b 2007fc8 <_Objects_Extend_information+0x13c> 2008130: 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 ) 2008134: 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 ); 2008138: 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; 200813c: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2008140: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2008144: a6 10 20 00 clr %l3 2008148: 10 bf ff 72 b 2007f10 <_Objects_Extend_information+0x84> 200814c: 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 ); 2008150: 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; 2008154: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2008158: 10 bf ff 6e b 2007f10 <_Objects_Extend_information+0x84> <== NOT EXECUTED 200815c: b6 10 20 00 clr %i3 <== NOT EXECUTED 2008160: 10 bf ff 6c b 2007f10 <_Objects_Extend_information+0x84> <== NOT EXECUTED 2008164: 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 ); 2008168: 40 00 08 ca call 200a490 <_Workspace_Free> 200816c: 90 10 00 10 mov %l0, %o0 return; 2008170: 81 c7 e0 08 ret 2008174: 81 e8 00 00 restore =============================================================================== 0200821c <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 200821c: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2008220: 80 a6 60 00 cmp %i1, 0 2008224: 02 80 00 17 be 2008280 <_Objects_Get_information+0x64> 2008228: 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 ); 200822c: 40 00 12 eb call 200cdd8 <_Objects_API_maximum_class> 2008230: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2008234: 80 a2 20 00 cmp %o0, 0 2008238: 02 80 00 12 be 2008280 <_Objects_Get_information+0x64> 200823c: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2008240: 0a 80 00 10 bcs 2008280 <_Objects_Get_information+0x64> 2008244: 03 00 80 70 sethi %hi(0x201c000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2008248: b1 2e 20 02 sll %i0, 2, %i0 200824c: 82 10 61 e8 or %g1, 0x1e8, %g1 2008250: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2008254: 80 a0 60 00 cmp %g1, 0 2008258: 02 80 00 0a be 2008280 <_Objects_Get_information+0x64> <== NEVER TAKEN 200825c: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2008260: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2008264: 80 a7 60 00 cmp %i5, 0 2008268: 02 80 00 06 be 2008280 <_Objects_Get_information+0x64> <== NEVER TAKEN 200826c: 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 ) 2008270: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2008274: 80 a0 00 01 cmp %g0, %g1 2008278: 82 60 20 00 subx %g0, 0, %g1 200827c: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2008280: 81 c7 e0 08 ret 2008284: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02009a70 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009a70: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009a74: 80 a6 60 00 cmp %i1, 0 2009a78: 02 80 00 3c be 2009b68 <_Objects_Get_name_as_string+0xf8> 2009a7c: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2009a80: 02 80 00 35 be 2009b54 <_Objects_Get_name_as_string+0xe4> 2009a84: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009a88: 02 80 00 35 be 2009b5c <_Objects_Get_name_as_string+0xec> 2009a8c: 03 00 80 7b sethi %hi(0x201ec00), %g1 information = _Objects_Get_information_id( tmpId ); 2009a90: 7f ff ff ba call 2009978 <_Objects_Get_information_id> 2009a94: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009a98: 80 a2 20 00 cmp %o0, 0 2009a9c: 02 80 00 33 be 2009b68 <_Objects_Get_name_as_string+0xf8> 2009aa0: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009aa4: 40 00 00 34 call 2009b74 <_Objects_Get> 2009aa8: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009aac: c2 07 bf fc ld [ %fp + -4 ], %g1 2009ab0: 80 a0 60 00 cmp %g1, 0 2009ab4: 32 80 00 2e bne,a 2009b6c <_Objects_Get_name_as_string+0xfc> 2009ab8: b4 10 20 00 clr %i2 if ( information->is_string ) { s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 2009abc: 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'; 2009ac0: c0 2f bf f4 clrb [ %fp + -12 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009ac4: 85 30 60 18 srl %g1, 0x18, %g2 lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 2009ac8: 87 30 60 08 srl %g1, 8, %g3 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 2009acc: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009ad0: c6 2f bf f2 stb %g3, [ %fp + -14 ] lname[ 3 ] = (u32_name >> 0) & 0xff; 2009ad4: c2 2f bf f3 stb %g1, [ %fp + -13 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009ad8: c4 2f bf f0 stb %g2, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009adc: c8 2f bf f1 stb %g4, [ %fp + -15 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009ae0: 86 10 00 02 mov %g2, %g3 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009ae4: b2 86 7f ff addcc %i1, -1, %i1 2009ae8: 02 80 00 19 be 2009b4c <_Objects_Get_name_as_string+0xdc> <== NEVER TAKEN 2009aec: 82 10 00 1a mov %i2, %g1 2009af0: 80 a0 a0 00 cmp %g2, 0 2009af4: 02 80 00 16 be 2009b4c <_Objects_Get_name_as_string+0xdc> 2009af8: 1f 00 80 78 sethi %hi(0x201e000), %o7 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'; s = lname; 2009afc: 84 07 bf f0 add %fp, -16, %g2 * 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( 2009b00: b2 06 80 19 add %i2, %i1, %i1 2009b04: 10 80 00 05 b 2009b18 <_Objects_Get_name_as_string+0xa8> 2009b08: 9e 13 e0 1c or %o7, 0x1c, %o7 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b0c: 80 a1 20 00 cmp %g4, 0 2009b10: 02 80 00 0f be 2009b4c <_Objects_Get_name_as_string+0xdc> 2009b14: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009b18: f0 03 c0 00 ld [ %o7 ], %i0 2009b1c: 88 08 e0 ff and %g3, 0xff, %g4 2009b20: 88 06 00 04 add %i0, %g4, %g4 2009b24: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2009b28: 80 89 20 97 btst 0x97, %g4 2009b2c: 12 80 00 03 bne 2009b38 <_Objects_Get_name_as_string+0xc8> 2009b30: 84 00 a0 01 inc %g2 2009b34: 86 10 20 2a mov 0x2a, %g3 2009b38: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b3c: 82 00 60 01 inc %g1 2009b40: 80 a0 40 19 cmp %g1, %i1 2009b44: 32 bf ff f2 bne,a 2009b0c <_Objects_Get_name_as_string+0x9c> 2009b48: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009b4c: 40 00 03 91 call 200a990 <_Thread_Enable_dispatch> 2009b50: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 2009b54: 81 c7 e0 08 ret 2009b58: 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; 2009b5c: c2 00 63 b8 ld [ %g1 + 0x3b8 ], %g1 2009b60: 10 bf ff cc b 2009a90 <_Objects_Get_name_as_string+0x20> 2009b64: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009b68: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009b6c: 81 c7 e0 08 ret 2009b70: 91 e8 00 1a restore %g0, %i2, %o0 =============================================================================== 02007f34 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2007f34: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2007f38: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2007f3c: 80 a6 20 00 cmp %i0, 0 2007f40: 02 80 00 19 be 2007fa4 <_Objects_Get_next+0x70> 2007f44: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2007f48: 80 a6 a0 00 cmp %i2, 0 2007f4c: 02 80 00 16 be 2007fa4 <_Objects_Get_next+0x70> 2007f50: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2007f54: 02 80 00 14 be 2007fa4 <_Objects_Get_next+0x70> 2007f58: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2007f5c: 80 a0 60 00 cmp %g1, 0 2007f60: 22 80 00 13 be,a 2007fac <_Objects_Get_next+0x78> 2007f64: 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) 2007f68: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2007f6c: 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); 2007f70: 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) 2007f74: 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); 2007f78: 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) 2007f7c: 80 a0 80 01 cmp %g2, %g1 2007f80: 0a 80 00 13 bcs 2007fcc <_Objects_Get_next+0x98> 2007f84: 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); 2007f88: 40 00 00 18 call 2007fe8 <_Objects_Get> 2007f8c: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2007f90: c2 06 80 00 ld [ %i2 ], %g1 2007f94: 80 a0 60 00 cmp %g1, 0 2007f98: 32 bf ff f5 bne,a 2007f6c <_Objects_Get_next+0x38> 2007f9c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2007fa0: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2007fa4: 81 c7 e0 08 ret 2007fa8: 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) 2007fac: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2007fb0: 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); 2007fb4: 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) 2007fb8: 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); 2007fbc: 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) 2007fc0: 80 a0 80 01 cmp %g2, %g1 2007fc4: 1a bf ff f1 bcc 2007f88 <_Objects_Get_next+0x54> <== ALWAYS TAKEN 2007fc8: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2007fcc: 82 10 20 01 mov 1, %g1 2007fd0: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2007fd4: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2007fd8: 82 10 3f ff mov -1, %g1 2007fdc: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2007fe0: 81 c7 e0 08 ret 2007fe4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009554 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2009554: 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; 2009558: 80 a6 20 00 cmp %i0, 0 200955c: 12 80 00 06 bne 2009574 <_Objects_Id_to_name+0x20> 2009560: 83 36 20 18 srl %i0, 0x18, %g1 2009564: 03 00 80 77 sethi %hi(0x201dc00), %g1 2009568: c2 00 60 98 ld [ %g1 + 0x98 ], %g1 ! 201dc98 <_Per_CPU_Information+0xc> 200956c: f0 00 60 08 ld [ %g1 + 8 ], %i0 2009570: 83 36 20 18 srl %i0, 0x18, %g1 2009574: 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 ) 2009578: 84 00 7f ff add %g1, -1, %g2 200957c: 80 a0 a0 02 cmp %g2, 2 2009580: 18 80 00 17 bgu 20095dc <_Objects_Id_to_name+0x88> 2009584: 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 ] ) 2009588: 83 28 60 02 sll %g1, 2, %g1 200958c: 05 00 80 76 sethi %hi(0x201d800), %g2 2009590: 84 10 a1 c8 or %g2, 0x1c8, %g2 ! 201d9c8 <_Objects_Information_table> 2009594: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009598: 80 a0 60 00 cmp %g1, 0 200959c: 02 80 00 10 be 20095dc <_Objects_Id_to_name+0x88> 20095a0: 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 ]; 20095a4: 85 28 a0 02 sll %g2, 2, %g2 20095a8: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 20095ac: 80 a2 20 00 cmp %o0, 0 20095b0: 02 80 00 0b be 20095dc <_Objects_Id_to_name+0x88> <== NEVER TAKEN 20095b4: 92 10 00 18 mov %i0, %o1 #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 ); 20095b8: 7f ff ff c9 call 20094dc <_Objects_Get> 20095bc: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 20095c0: 80 a2 20 00 cmp %o0, 0 20095c4: 02 80 00 06 be 20095dc <_Objects_Id_to_name+0x88> 20095c8: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 20095cc: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 20095d0: 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(); 20095d4: 40 00 03 99 call 200a438 <_Thread_Enable_dispatch> 20095d8: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 20095dc: 81 c7 e0 08 ret 20095e0: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02008504 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2008504: 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 ); 2008508: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 200850c: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2008510: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2008514: 92 10 00 1c mov %i4, %o1 2008518: 40 00 3c e4 call 20178a8 <.udiv> 200851c: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2008520: 80 a2 20 00 cmp %o0, 0 2008524: 02 80 00 34 be 20085f4 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 2008528: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 200852c: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2008530: c2 01 00 00 ld [ %g4 ], %g1 2008534: 80 a7 00 01 cmp %i4, %g1 2008538: 02 80 00 0f be 2008574 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 200853c: 82 10 20 00 clr %g1 2008540: 10 80 00 07 b 200855c <_Objects_Shrink_information+0x58> 2008544: b6 10 20 04 mov 4, %i3 2008548: 86 06 e0 04 add %i3, 4, %g3 200854c: 80 a7 00 02 cmp %i4, %g2 2008550: 02 80 00 0a be 2008578 <_Objects_Shrink_information+0x74> 2008554: ba 07 40 1c add %i5, %i4, %i5 2008558: 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++ ) { 200855c: 82 00 60 01 inc %g1 2008560: 80 a0 40 08 cmp %g1, %o0 2008564: 32 bf ff f9 bne,a 2008548 <_Objects_Shrink_information+0x44> 2008568: c4 01 00 1b ld [ %g4 + %i3 ], %g2 200856c: 81 c7 e0 08 ret 2008570: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2008574: 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; 2008578: 10 80 00 06 b 2008590 <_Objects_Shrink_information+0x8c> 200857c: 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 ); 2008580: 80 a7 20 00 cmp %i4, 0 2008584: 22 80 00 12 be,a 20085cc <_Objects_Shrink_information+0xc8> 2008588: 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; 200858c: 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 ); 2008590: 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) && 2008594: 80 a0 40 1d cmp %g1, %i5 2008598: 0a bf ff fa bcs 2008580 <_Objects_Shrink_information+0x7c> 200859c: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 20085a0: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20085a4: 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) && 20085a8: 80 a0 40 02 cmp %g1, %g2 20085ac: 1a bf ff f6 bcc 2008584 <_Objects_Shrink_information+0x80> 20085b0: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 20085b4: 7f ff fb 68 call 2007354 <_Chain_Extract> 20085b8: 01 00 00 00 nop } } while ( the_object ); 20085bc: 80 a7 20 00 cmp %i4, 0 20085c0: 12 bf ff f4 bne 2008590 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 20085c4: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 20085c8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 20085cc: 40 00 07 b1 call 200a490 <_Workspace_Free> 20085d0: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 20085d4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 20085d8: 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; 20085dc: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 20085e0: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 20085e4: 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; 20085e8: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 20085ec: 82 20 80 01 sub %g2, %g1, %g1 20085f0: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 20085f4: 81 c7 e0 08 ret 20085f8: 81 e8 00 00 restore =============================================================================== 02008d90 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008d90: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 2008d94: 80 a6 60 00 cmp %i1, 0 2008d98: 02 80 00 4c be 2008ec8 <_RBTree_Extract_unprotected+0x138> 2008d9c: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008da0: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008da4: 80 a0 40 19 cmp %g1, %i1 2008da8: 02 80 00 61 be 2008f2c <_RBTree_Extract_unprotected+0x19c> 2008dac: 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]) { 2008db0: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008db4: 80 a0 80 19 cmp %g2, %i1 2008db8: 02 80 00 51 be 2008efc <_RBTree_Extract_unprotected+0x16c> 2008dbc: f8 06 60 04 ld [ %i1 + 4 ], %i4 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2008dc0: ba 97 20 00 orcc %i4, 0, %i5 2008dc4: 22 80 00 54 be,a 2008f14 <_RBTree_Extract_unprotected+0x184><== ALWAYS TAKEN 2008dc8: b8 90 60 00 orcc %g1, 0, %i4 2008dcc: 80 a0 60 00 cmp %g1, 0 2008dd0: 32 80 00 05 bne,a 2008de4 <_RBTree_Extract_unprotected+0x54><== NEVER TAKEN 2008dd4: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 2008dd8: 10 80 00 3e b 2008ed0 <_RBTree_Extract_unprotected+0x140> 2008ddc: c2 06 40 00 ld [ %i1 ], %g1 * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 2008de0: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2008de4: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2008de8: 32 bf ff fe bne,a 2008de0 <_RBTree_Extract_unprotected+0x50><== NOT EXECUTED 2008dec: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 2008df0: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED if(leaf) { 2008df4: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 2008df8: 02 80 00 52 be 2008f40 <_RBTree_Extract_unprotected+0x1b0><== NOT EXECUTED 2008dfc: 01 00 00 00 nop <== NOT EXECUTED leaf->parent = target->parent; 2008e00: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008e04: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008e08: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008e0c: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008e10: c8 00 a0 04 ld [ %g2 + 4 ], %g4 <== NOT EXECUTED * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; target->color = the_node->color; 2008e14: c6 06 60 10 ld [ %i1 + 0x10 ], %g3 <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 2008e18: 88 19 00 1d xor %g4, %i5, %g4 <== NOT EXECUTED 2008e1c: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008e20: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED target->parent->child[dir] = leaf; 2008e24: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008e28: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED 2008e2c: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008e30: c8 00 60 04 ld [ %g1 + 4 ], %g4 <== NOT EXECUTED leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 2008e34: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 <== NOT EXECUTED dir = target != target->parent->child[0]; target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008e38: 88 19 00 19 xor %g4, %i1, %g4 <== NOT EXECUTED 2008e3c: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED 2008e40: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED the_node->parent->child[dir] = target; 2008e44: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED 2008e48: 82 00 40 04 add %g1, %g4, %g1 <== NOT EXECUTED 2008e4c: fa 20 60 04 st %i5, [ %g1 + 4 ] <== NOT EXECUTED /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008e50: c2 06 60 08 ld [ %i1 + 8 ], %g1 <== NOT EXECUTED * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; target->color = the_node->color; 2008e54: c6 27 60 10 st %g3, [ %i5 + 0x10 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008e58: c2 27 60 08 st %g1, [ %i5 + 8 ] <== NOT EXECUTED the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008e5c: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008e60: c6 06 60 08 ld [ %i1 + 8 ], %g3 <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008e64: c2 27 60 04 st %g1, [ %i5 + 4 ] <== NOT EXECUTED the_node->child[RBT_LEFT]->parent = target; 2008e68: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED dir = the_node != the_node->parent->child[0]; the_node->parent->child[dir] = target; /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; the_node->child[RBT_RIGHT]->parent = target; 2008e6c: fa 20 c0 00 st %i5, [ %g3 ] <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; the_node->child[RBT_LEFT]->parent = target; 2008e70: fa 20 40 00 st %i5, [ %g1 ] <== NOT EXECUTED /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 2008e74: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED 2008e78: c2 27 40 00 st %g1, [ %i5 ] <== NOT EXECUTED * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node and the child is red. Paint child black. * 3. Deleted a black node and its child is black. This requires some * care and rotations. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 2008e7c: 80 a0 a0 00 cmp %g2, 0 2008e80: 32 80 00 0c bne,a 2008eb0 <_RBTree_Extract_unprotected+0x120> 2008e84: c2 06 20 04 ld [ %i0 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008e88: 80 a7 20 00 cmp %i4, 0 2008e8c: 22 80 00 09 be,a 2008eb0 <_RBTree_Extract_unprotected+0x120> 2008e90: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008e94: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2008e98: 80 a0 60 01 cmp %g1, 1 2008e9c: 22 80 00 04 be,a 2008eac <_RBTree_Extract_unprotected+0x11c><== ALWAYS TAKEN 2008ea0: c0 27 20 10 clr [ %i4 + 0x10 ] if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008ea4: 7f ff fe e8 call 2008a44 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008ea8: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 2008eac: 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; 2008eb0: c0 26 60 08 clr [ %i1 + 8 ] 2008eb4: c0 26 60 04 clr [ %i1 + 4 ] 2008eb8: 80 a0 60 00 cmp %g1, 0 2008ebc: 02 80 00 03 be 2008ec8 <_RBTree_Extract_unprotected+0x138> 2008ec0: c0 26 40 00 clr [ %i1 ] 2008ec4: c0 20 60 10 clr [ %g1 + 0x10 ] 2008ec8: 81 c7 e0 08 ret 2008ecc: 81 e8 00 00 restore * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 2008ed0: 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]; 2008ed4: 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; 2008ed8: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008edc: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008ee0: 86 18 c0 19 xor %g3, %i1, %g3 2008ee4: 80 a0 00 03 cmp %g0, %g3 2008ee8: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 2008eec: 87 28 e0 02 sll %g3, 2, %g3 2008ef0: 82 00 40 03 add %g1, %g3, %g1 2008ef4: 10 bf ff e2 b 2008e7c <_RBTree_Extract_unprotected+0xec> 2008ef8: f8 20 60 04 st %i4, [ %g1 + 4 ] the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 2008efc: 80 a7 20 00 cmp %i4, 0 2008f00: 02 80 00 19 be 2008f64 <_RBTree_Extract_unprotected+0x1d4> 2008f04: ba 97 20 00 orcc %i4, 0, %i5 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2008f08: 12 bf ff b1 bne 2008dcc <_RBTree_Extract_unprotected+0x3c><== ALWAYS TAKEN 2008f0c: f8 26 20 0c st %i4, [ %i0 + 0xc ] * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { 2008f10: b8 90 60 00 orcc %g1, 0, %i4 <== NOT EXECUTED 2008f14: 32 bf ff ef bne,a 2008ed0 <_RBTree_Extract_unprotected+0x140> 2008f18: 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); 2008f1c: 7f ff fe ca call 2008a44 <_RBTree_Extract_validate_unprotected> 2008f20: 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]; 2008f24: 10 bf ff ed b 2008ed8 <_RBTree_Extract_unprotected+0x148> 2008f28: 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]) 2008f2c: 80 a0 60 00 cmp %g1, 0 2008f30: 22 80 00 08 be,a 2008f50 <_RBTree_Extract_unprotected+0x1c0> 2008f34: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008f38: 10 bf ff 9e b 2008db0 <_RBTree_Extract_unprotected+0x20> 2008f3c: c2 26 20 08 st %g1, [ %i0 + 8 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 2008f40: 7f ff fe c1 call 2008a44 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008f44: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED } victim_color = target->color; dir = target != target->parent->child[0]; 2008f48: 10 bf ff b1 b 2008e0c <_RBTree_Extract_unprotected+0x7c> <== NOT EXECUTED 2008f4c: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2008f50: 80 a6 00 02 cmp %i0, %g2 2008f54: 12 bf ff 97 bne 2008db0 <_RBTree_Extract_unprotected+0x20> 2008f58: c4 26 20 08 st %g2, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 2008f5c: 10 bf ff 95 b 2008db0 <_RBTree_Extract_unprotected+0x20> 2008f60: c0 26 20 08 clr [ %i0 + 8 ] /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; 2008f64: c4 06 40 00 ld [ %i1 ], %g2 if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2008f68: 80 a6 00 02 cmp %i0, %g2 2008f6c: 12 bf ff 95 bne 2008dc0 <_RBTree_Extract_unprotected+0x30> 2008f70: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 2008f74: 10 bf ff 93 b 2008dc0 <_RBTree_Extract_unprotected+0x30> 2008f78: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 02008a44 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008a44: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 2008a48: c4 06 00 00 ld [ %i0 ], %g2 if(!parent->parent) return; 2008a4c: c2 00 80 00 ld [ %g2 ], %g1 2008a50: 80 a0 60 00 cmp %g1, 0 2008a54: 02 80 00 cd be 2008d88 <_RBTree_Extract_validate_unprotected+0x344> 2008a58: 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]) 2008a5c: c2 00 a0 04 ld [ %g2 + 4 ], %g1 2008a60: 80 a6 00 01 cmp %i0, %g1 2008a64: 22 80 00 02 be,a 2008a6c <_RBTree_Extract_validate_unprotected+0x28> 2008a68: c2 00 a0 08 ld [ %g2 + 8 ], %g1 /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008a6c: 96 10 20 01 mov 1, %o3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008a70: 80 a6 20 00 cmp %i0, 0 2008a74: 22 80 00 07 be,a 2008a90 <_RBTree_Extract_validate_unprotected+0x4c><== NEVER TAKEN 2008a78: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED 2008a7c: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 2008a80: 80 a0 e0 01 cmp %g3, 1 2008a84: 22 80 00 5b be,a 2008bf0 <_RBTree_Extract_validate_unprotected+0x1ac> 2008a88: 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) { 2008a8c: c6 00 80 00 ld [ %g2 ], %g3 2008a90: 80 a0 e0 00 cmp %g3, 0 2008a94: 02 80 00 56 be 2008bec <_RBTree_Extract_validate_unprotected+0x1a8> 2008a98: 80 a0 60 00 cmp %g1, 0 2008a9c: 02 bf ff f6 be 2008a74 <_RBTree_Extract_validate_unprotected+0x30><== NEVER TAKEN 2008aa0: 80 a6 20 00 cmp %i0, 0 2008aa4: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 2008aa8: 80 a1 20 01 cmp %g4, 1 2008aac: 22 80 00 27 be,a 2008b48 <_RBTree_Extract_validate_unprotected+0x104> 2008ab0: de 00 a0 04 ld [ %g2 + 4 ], %o7 sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008ab4: c6 00 60 08 ld [ %g1 + 8 ], %g3 2008ab8: 80 a0 e0 00 cmp %g3, 0 2008abc: 22 80 00 07 be,a 2008ad8 <_RBTree_Extract_validate_unprotected+0x94> 2008ac0: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008ac4: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008ac8: 80 a0 e0 01 cmp %g3, 1 2008acc: 22 80 00 57 be,a 2008c28 <_RBTree_Extract_validate_unprotected+0x1e4> 2008ad0: c6 00 a0 04 ld [ %g2 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2008ad4: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008ad8: 80 a0 e0 00 cmp %g3, 0 2008adc: 22 80 00 07 be,a 2008af8 <_RBTree_Extract_validate_unprotected+0xb4> 2008ae0: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008ae4: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 2008ae8: 80 a0 e0 01 cmp %g3, 1 2008aec: 22 80 00 4f be,a 2008c28 <_RBTree_Extract_validate_unprotected+0x1e4> 2008af0: c6 00 a0 04 ld [ %g2 + 4 ], %g3 sibling->color = RBT_RED; 2008af4: d6 20 60 10 st %o3, [ %g1 + 0x10 ] 2008af8: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008afc: 80 a0 60 01 cmp %g1, 1 2008b00: 22 80 00 3b be,a 2008bec <_RBTree_Extract_validate_unprotected+0x1a8> 2008b04: c0 20 a0 10 clr [ %g2 + 0x10 ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 2008b08: c6 00 80 00 ld [ %g2 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008b0c: 80 a0 e0 00 cmp %g3, 0 2008b10: 02 80 00 3e be 2008c08 <_RBTree_Extract_validate_unprotected+0x1c4><== NEVER TAKEN 2008b14: b0 10 00 02 mov %g2, %i0 if(!(the_node->parent->parent)) return NULL; 2008b18: c2 00 c0 00 ld [ %g3 ], %g1 2008b1c: 80 a0 60 00 cmp %g1, 0 2008b20: 02 80 00 3d be 2008c14 <_RBTree_Extract_validate_unprotected+0x1d0> 2008b24: 82 10 20 00 clr %g1 if(the_node == the_node->parent->child[RBT_LEFT]) 2008b28: c2 00 e0 04 ld [ %g3 + 4 ], %g1 2008b2c: 80 a0 80 01 cmp %g2, %g1 2008b30: 02 80 00 3b be 2008c1c <_RBTree_Extract_validate_unprotected+0x1d8> 2008b34: 80 a6 20 00 cmp %i0, 0 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008b38: 12 bf ff d1 bne 2008a7c <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 2008b3c: 84 10 00 03 mov %g3, %g2 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008b40: 10 bf ff d4 b 2008a90 <_RBTree_Extract_validate_unprotected+0x4c><== NOT EXECUTED 2008b44: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 2008b48: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008b4c: 9e 1b c0 18 xor %o7, %i0, %o7 2008b50: 80 a0 00 0f cmp %g0, %o7 2008b54: 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; 2008b58: 88 21 00 0d sub %g4, %o5, %g4 2008b5c: 89 29 20 02 sll %g4, 2, %g4 2008b60: 88 00 80 04 add %g2, %g4, %g4 2008b64: de 01 20 04 ld [ %g4 + 4 ], %o7 2008b68: 80 a3 e0 00 cmp %o7, 0 2008b6c: 02 80 00 16 be 2008bc4 <_RBTree_Extract_validate_unprotected+0x180><== NEVER TAKEN 2008b70: c0 20 60 10 clr [ %g1 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008b74: 83 2b 60 02 sll %o5, 2, %g1 2008b78: 98 03 c0 01 add %o7, %g1, %o4 2008b7c: d4 03 20 04 ld [ %o4 + 4 ], %o2 2008b80: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 2008b84: c8 03 20 04 ld [ %o4 + 4 ], %g4 2008b88: 80 a1 20 00 cmp %g4, 0 2008b8c: 02 80 00 04 be 2008b9c <_RBTree_Extract_validate_unprotected+0x158><== NEVER TAKEN 2008b90: 82 03 c0 01 add %o7, %g1, %g1 c->child[dir]->parent = the_node; 2008b94: c4 21 00 00 st %g2, [ %g4 ] 2008b98: c6 00 80 00 ld [ %g2 ], %g3 c->child[dir] = the_node; 2008b9c: c4 20 60 04 st %g2, [ %g1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008ba0: c2 00 e0 04 ld [ %g3 + 4 ], %g1 c->parent = the_node->parent; 2008ba4: 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; 2008ba8: 82 18 80 01 xor %g2, %g1, %g1 c->parent = the_node->parent; the_node->parent = c; 2008bac: de 20 80 00 st %o7, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008bb0: 80 a0 00 01 cmp %g0, %g1 2008bb4: 82 40 20 00 addx %g0, 0, %g1 2008bb8: 83 28 60 02 sll %g1, 2, %g1 2008bbc: 86 00 c0 01 add %g3, %g1, %g3 2008bc0: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 2008bc4: 80 a0 00 0d cmp %g0, %o5 2008bc8: 82 60 3f ff subx %g0, -1, %g1 2008bcc: 83 28 60 02 sll %g1, 2, %g1 2008bd0: 82 00 80 01 add %g2, %g1, %g1 2008bd4: c2 00 60 04 ld [ %g1 + 4 ], %g1 } /* sibling is black, see if both of its children are also black. */ if (sibling && 2008bd8: 80 a0 60 00 cmp %g1, 0 2008bdc: 32 bf ff b7 bne,a 2008ab8 <_RBTree_Extract_validate_unprotected+0x74><== ALWAYS TAKEN 2008be0: c6 00 60 08 ld [ %g1 + 8 ], %g3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008be4: 10 bf ff a4 b 2008a74 <_RBTree_Extract_validate_unprotected+0x30><== NOT EXECUTED 2008be8: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008bec: c2 06 00 00 ld [ %i0 ], %g1 2008bf0: c2 00 40 00 ld [ %g1 ], %g1 2008bf4: 80 a0 60 00 cmp %g1, 0 2008bf8: 22 80 00 02 be,a 2008c00 <_RBTree_Extract_validate_unprotected+0x1bc> 2008bfc: c0 26 20 10 clr [ %i0 + 0x10 ] 2008c00: 81 c7 e0 08 ret 2008c04: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 2008c08: 82 10 20 00 clr %g1 <== NOT EXECUTED 2008c0c: 10 bf ff 99 b 2008a70 <_RBTree_Extract_validate_unprotected+0x2c><== NOT EXECUTED 2008c10: 84 10 20 00 clr %g2 <== NOT EXECUTED if(!(the_node->parent->parent)) return NULL; 2008c14: 10 bf ff 97 b 2008a70 <_RBTree_Extract_validate_unprotected+0x2c> 2008c18: 84 10 00 03 mov %g3, %g2 if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 2008c1c: c2 00 e0 08 ld [ %g3 + 8 ], %g1 2008c20: 10 bf ff 94 b 2008a70 <_RBTree_Extract_validate_unprotected+0x2c> 2008c24: 84 10 00 03 mov %g3, %g2 * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 2008c28: 86 18 c0 18 xor %g3, %i0, %g3 2008c2c: 80 a0 00 03 cmp %g0, %g3 2008c30: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 2008c34: 80 a0 00 03 cmp %g0, %g3 2008c38: 9e 60 3f ff subx %g0, -1, %o7 2008c3c: 9f 2b e0 02 sll %o7, 2, %o7 2008c40: 88 00 40 0f add %g1, %o7, %g4 2008c44: 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); 2008c48: 80 a1 20 00 cmp %g4, 0 2008c4c: 22 80 00 07 be,a 2008c68 <_RBTree_Extract_validate_unprotected+0x224> 2008c50: 89 28 e0 02 sll %g3, 2, %g4 2008c54: da 01 20 10 ld [ %g4 + 0x10 ], %o5 2008c58: 80 a3 60 01 cmp %o5, 1 2008c5c: 22 80 00 28 be,a 2008cfc <_RBTree_Extract_validate_unprotected+0x2b8> 2008c60: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 2008c64: 89 28 e0 02 sll %g3, 2, %g4 2008c68: 88 00 40 04 add %g1, %g4, %g4 _RBTree_Rotate(sibling, !dir); 2008c6c: 98 18 e0 01 xor %g3, 1, %o4 * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 2008c70: 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; 2008c74: 88 10 20 01 mov 1, %g4 2008c78: c8 20 60 10 st %g4, [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008c7c: 88 21 00 0c sub %g4, %o4, %g4 2008c80: 9b 29 20 02 sll %g4, 2, %o5 2008c84: 9a 00 40 0d add %g1, %o5, %o5 2008c88: c8 03 60 04 ld [ %o5 + 4 ], %g4 2008c8c: 80 a1 20 00 cmp %g4, 0 2008c90: 02 80 00 16 be 2008ce8 <_RBTree_Extract_validate_unprotected+0x2a4><== NEVER TAKEN 2008c94: c0 22 e0 10 clr [ %o3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008c98: 99 2b 20 02 sll %o4, 2, %o4 2008c9c: 96 01 00 0c add %g4, %o4, %o3 2008ca0: d4 02 e0 04 ld [ %o3 + 4 ], %o2 2008ca4: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 2008ca8: da 02 e0 04 ld [ %o3 + 4 ], %o5 2008cac: 80 a3 60 00 cmp %o5, 0 2008cb0: 32 80 00 02 bne,a 2008cb8 <_RBTree_Extract_validate_unprotected+0x274> 2008cb4: c2 23 40 00 st %g1, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008cb8: da 00 40 00 ld [ %g1 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008cbc: 98 01 00 0c add %g4, %o4, %o4 2008cc0: c2 23 20 04 st %g1, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008cc4: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 2008cc8: 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; 2008ccc: 98 18 40 0c xor %g1, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 2008cd0: c8 20 40 00 st %g4, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008cd4: 80 a0 00 0c cmp %g0, %o4 2008cd8: 82 40 20 00 addx %g0, 0, %g1 2008cdc: 83 28 60 02 sll %g1, 2, %g1 2008ce0: 9a 03 40 01 add %o5, %g1, %o5 2008ce4: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 2008ce8: 82 00 80 0f add %g2, %o7, %g1 2008cec: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008cf0: 9e 00 40 0f add %g1, %o7, %o7 2008cf4: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 2008cf8: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 2008cfc: de 20 60 10 st %o7, [ %g1 + 0x10 ] parent->color = RBT_BLACK; 2008d00: c0 20 a0 10 clr [ %g2 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2008d04: 9e 10 20 01 mov 1, %o7 2008d08: 9e 23 c0 03 sub %o7, %g3, %o7 2008d0c: 9f 2b e0 02 sll %o7, 2, %o7 2008d10: 9e 00 80 0f add %g2, %o7, %o7 2008d14: c2 03 e0 04 ld [ %o7 + 4 ], %g1 2008d18: 80 a0 60 00 cmp %g1, 0 2008d1c: 02 bf ff b4 be 2008bec <_RBTree_Extract_validate_unprotected+0x1a8><== NEVER TAKEN 2008d20: c0 21 20 10 clr [ %g4 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008d24: 87 28 e0 02 sll %g3, 2, %g3 2008d28: 88 00 40 03 add %g1, %g3, %g4 2008d2c: da 01 20 04 ld [ %g4 + 4 ], %o5 2008d30: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 2008d34: c8 01 20 04 ld [ %g4 + 4 ], %g4 2008d38: 80 a1 20 00 cmp %g4, 0 2008d3c: 32 80 00 02 bne,a 2008d44 <_RBTree_Extract_validate_unprotected+0x300> 2008d40: c4 21 00 00 st %g2, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d44: c8 00 80 00 ld [ %g2 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008d48: 86 00 40 03 add %g1, %g3, %g3 2008d4c: c4 20 e0 04 st %g2, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d50: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 2008d54: c8 20 40 00 st %g4, [ %g1 ] the_node->parent = c; 2008d58: c2 20 80 00 st %g1, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008d5c: 86 18 c0 02 xor %g3, %g2, %g3 2008d60: 80 a0 00 03 cmp %g0, %g3 2008d64: 84 40 20 00 addx %g0, 0, %g2 2008d68: 85 28 a0 02 sll %g2, 2, %g2 2008d6c: 88 01 00 02 add %g4, %g2, %g4 2008d70: c2 21 20 04 st %g1, [ %g4 + 4 ] sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008d74: c2 06 00 00 ld [ %i0 ], %g1 2008d78: c2 00 40 00 ld [ %g1 ], %g1 2008d7c: 80 a0 60 00 cmp %g1, 0 2008d80: 22 bf ff a0 be,a 2008c00 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 2008d84: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 2008d88: 81 c7 e0 08 ret 2008d8c: 81 e8 00 00 restore =============================================================================== 02008ff0 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 2008ff0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 2008ff4: 7f ff e6 85 call 2002a08 2008ff8: 01 00 00 00 nop return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); return return_node; } 2008ffc: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 2009000: 80 a6 20 00 cmp %i0, 0 2009004: 32 80 00 0b bne,a 2009030 <_RBTree_Find+0x40> <== ALWAYS TAKEN 2009008: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200900c: 30 80 00 0c b,a 200903c <_RBTree_Find+0x4c> <== NOT EXECUTED if (the_value == iter_node->value) return(iter_node); RBTree_Direction dir = the_value > iter_node->value; 2009010: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 2009014: 83 28 60 02 sll %g1, 2, %g1 2009018: b0 06 00 01 add %i0, %g1, %i0 200901c: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 2009020: 80 a6 20 00 cmp %i0, 0 2009024: 02 80 00 06 be 200903c <_RBTree_Find+0x4c> <== NEVER TAKEN 2009028: 01 00 00 00 nop if (the_value == iter_node->value) return(iter_node); 200902c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009030: 80 a6 40 01 cmp %i1, %g1 2009034: 12 bf ff f7 bne 2009010 <_RBTree_Find+0x20> 2009038: 80 a0 40 19 cmp %g1, %i1 RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 200903c: 7f ff e6 77 call 2002a18 2009040: 01 00 00 00 nop return return_node; } 2009044: 81 c7 e0 08 ret 2009048: 81 e8 00 00 restore =============================================================================== 02008fa4 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2008fa4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 2008fa8: 7f ff e6 98 call 2002a08 2008fac: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected( RBTree_Node *the_node ) { if(!the_node) return NULL; 2008fb0: 80 a6 20 00 cmp %i0, 0 2008fb4: 02 80 00 0b be 2008fe0 <_RBTree_Find_header+0x3c> <== NEVER TAKEN 2008fb8: ba 10 20 00 clr %i5 if(!(the_node->parent)) return NULL; 2008fbc: fa 06 00 00 ld [ %i0 ], %i5 2008fc0: 80 a7 60 00 cmp %i5, 0 2008fc4: 32 80 00 04 bne,a 2008fd4 <_RBTree_Find_header+0x30> <== ALWAYS TAKEN 2008fc8: c2 07 40 00 ld [ %i5 ], %g1 2008fcc: 30 80 00 05 b,a 2008fe0 <_RBTree_Find_header+0x3c> <== NOT EXECUTED 2008fd0: c2 07 40 00 ld [ %i5 ], %g1 while(the_node->parent) the_node = the_node->parent; 2008fd4: 80 a0 60 00 cmp %g1, 0 2008fd8: 32 bf ff fe bne,a 2008fd0 <_RBTree_Find_header+0x2c> 2008fdc: ba 10 00 01 mov %g1, %i5 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 2008fe0: 7f ff e6 8e call 2002a18 2008fe4: b0 10 00 1d mov %i5, %i0 return return_header; } 2008fe8: 81 c7 e0 08 ret 2008fec: 81 e8 00 00 restore =============================================================================== 02009238 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2009238: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200923c: 80 a6 60 00 cmp %i1, 0 2009240: 02 80 00 14 be 2009290 <_RBTree_Insert_unprotected+0x58> <== NEVER TAKEN 2009244: 82 10 3f ff mov -1, %g1 RBTree_Node *iter_node = the_rbtree->root; 2009248: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (!iter_node) { /* special case: first node inserted */ 200924c: 80 a0 60 00 cmp %g1, 0 2009250: 22 80 00 23 be,a 20092dc <_RBTree_Insert_unprotected+0xa4> 2009254: c0 26 60 10 clr [ %i1 + 0x10 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 2009258: 10 80 00 0a b 2009280 <_RBTree_Insert_unprotected+0x48> 200925c: c6 06 60 0c ld [ %i1 + 0xc ], %g3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; 2009260: 9e 40 20 00 addx %g0, 0, %o7 if (!iter_node->child[dir]) { 2009264: 89 2b e0 02 sll %o7, 2, %g4 2009268: 88 00 40 04 add %g1, %g4, %g4 200926c: c4 01 20 04 ld [ %g4 + 4 ], %g2 2009270: 80 a0 a0 00 cmp %g2, 0 2009274: 22 80 00 09 be,a 2009298 <_RBTree_Insert_unprotected+0x60> 2009278: c0 26 60 08 clr [ %i1 + 8 ] 200927c: 82 10 00 02 mov %g2, %g1 the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); 2009280: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2009284: 80 a0 c0 02 cmp %g3, %g2 2009288: 12 bf ff f6 bne 2009260 <_RBTree_Insert_unprotected+0x28> 200928c: 80 a0 80 03 cmp %g2, %g3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 2009290: 81 c7 e0 08 ret 2009294: 91 e8 00 01 restore %g0, %g1, %o0 /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2009298: c0 26 60 04 clr [ %i1 + 4 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200929c: 9e 03 e0 02 add %o7, 2, %o7 20092a0: 9f 2b e0 02 sll %o7, 2, %o7 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 20092a4: c4 06 00 0f ld [ %i0 + %o7 ], %g2 while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 20092a8: 86 10 20 01 mov 1, %g3 iter_node->child[dir] = the_node; 20092ac: f2 21 20 04 st %i1, [ %g4 + 4 ] while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 20092b0: c6 26 60 10 st %g3, [ %i1 + 0x10 ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 20092b4: 80 a0 40 02 cmp %g1, %g2 20092b8: 02 80 00 07 be 20092d4 <_RBTree_Insert_unprotected+0x9c> 20092bc: c2 26 40 00 st %g1, [ %i1 ] } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 20092c0: 7f ff ff 72 call 2009088 <_RBTree_Validate_insert_unprotected> 20092c4: 90 10 00 19 mov %i1, %o0 } return (RBTree_Node*)0; 20092c8: 82 10 20 00 clr %g1 } 20092cc: 81 c7 e0 08 ret 20092d0: 91 e8 00 01 restore %g0, %g1, %o0 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 20092d4: 10 bf ff fb b 20092c0 <_RBTree_Insert_unprotected+0x88> 20092d8: f2 26 00 0f st %i1, [ %i0 + %o7 ] RBTree_Node *iter_node = the_rbtree->root; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 20092dc: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 20092e0: f2 26 20 0c st %i1, [ %i0 + 0xc ] 20092e4: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 20092e8: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 20092ec: c0 26 60 08 clr [ %i1 + 8 ] 20092f0: 10 bf ff e8 b 2009290 <_RBTree_Insert_unprotected+0x58> 20092f4: c0 26 60 04 clr [ %i1 + 4 ] =============================================================================== 02009088 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2009088: 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) { 200908c: 96 10 20 01 mov 1, %o3 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009090: 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; 2009094: c4 00 40 00 ld [ %g1 ], %g2 2009098: 86 90 a0 00 orcc %g2, 0, %g3 200909c: 22 80 00 06 be,a 20090b4 <_RBTree_Validate_insert_unprotected+0x2c> 20090a0: c0 26 20 10 clr [ %i0 + 0x10 ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 20090a4: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 20090a8: 80 a1 20 01 cmp %g4, 1 20090ac: 22 80 00 04 be,a 20090bc <_RBTree_Validate_insert_unprotected+0x34> 20090b0: c8 00 80 00 ld [ %g2 ], %g4 20090b4: 81 c7 e0 08 ret 20090b8: 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; 20090bc: 80 a1 20 00 cmp %g4, 0 20090c0: 02 80 00 0c be 20090f0 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 20090c4: 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]) 20090c8: 80 a0 40 0f cmp %g1, %o7 20090cc: 02 80 00 59 be 2009230 <_RBTree_Validate_insert_unprotected+0x1a8> 20090d0: 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); 20090d4: 80 a1 20 00 cmp %g4, 0 20090d8: 22 80 00 07 be,a 20090f4 <_RBTree_Validate_insert_unprotected+0x6c> 20090dc: c8 00 60 04 ld [ %g1 + 4 ], %g4 20090e0: da 01 20 10 ld [ %g4 + 0x10 ], %o5 20090e4: 80 a3 60 01 cmp %o5, 1 20090e8: 22 80 00 4c be,a 2009218 <_RBTree_Validate_insert_unprotected+0x190> 20090ec: c0 20 60 10 clr [ %g1 + 0x10 ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 20090f0: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 20090f4: 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]; 20090f8: 88 19 00 18 xor %g4, %i0, %g4 20090fc: 80 a0 00 04 cmp %g0, %g4 2009100: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 2009104: 80 a0 00 0f cmp %g0, %o7 2009108: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200910c: 80 a3 40 04 cmp %o5, %g4 2009110: 02 80 00 46 be 2009228 <_RBTree_Validate_insert_unprotected+0x1a0> 2009114: 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; 2009118: 98 22 c0 04 sub %o3, %g4, %o4 200911c: 9b 2b 20 02 sll %o4, 2, %o5 2009120: 9a 00 40 0d add %g1, %o5, %o5 2009124: de 03 60 04 ld [ %o5 + 4 ], %o7 2009128: 80 a3 e0 00 cmp %o7, 0 200912c: 02 80 00 16 be 2009184 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 2009130: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2009134: 94 03 c0 04 add %o7, %g4, %o2 2009138: d2 02 a0 04 ld [ %o2 + 4 ], %o1 200913c: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 2009140: da 02 a0 04 ld [ %o2 + 4 ], %o5 2009144: 80 a3 60 00 cmp %o5, 0 2009148: 22 80 00 05 be,a 200915c <_RBTree_Validate_insert_unprotected+0xd4> 200914c: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 2009150: c2 23 40 00 st %g1, [ %o5 ] 2009154: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 2009158: 9a 03 c0 04 add %o7, %g4, %o5 200915c: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2009160: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 2009164: 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; 2009168: 9a 18 40 0d xor %g1, %o5, %o5 c->parent = the_node->parent; the_node->parent = c; 200916c: 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; 2009170: 80 a0 00 0d cmp %g0, %o5 2009174: 82 40 20 00 addx %g0, 0, %g1 2009178: 83 28 60 02 sll %g1, 2, %g1 200917c: 84 00 80 01 add %g2, %g1, %g2 2009180: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 2009184: b0 06 00 04 add %i0, %g4, %i0 2009188: f0 06 20 04 ld [ %i0 + 4 ], %i0 200918c: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 2009190: c0 20 60 10 clr [ %g1 + 0x10 ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 2009194: 88 00 c0 04 add %g3, %g4, %g4 2009198: c2 01 20 04 ld [ %g4 + 4 ], %g1 200919c: 80 a0 60 00 cmp %g1, 0 20091a0: 02 bf ff bc be 2009090 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN 20091a4: d6 20 e0 10 st %o3, [ %g3 + 0x10 ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 20091a8: 99 2b 20 02 sll %o4, 2, %o4 20091ac: 84 00 40 0c add %g1, %o4, %g2 20091b0: de 00 a0 04 ld [ %g2 + 4 ], %o7 20091b4: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 20091b8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 20091bc: 80 a0 a0 00 cmp %g2, 0 20091c0: 32 80 00 02 bne,a 20091c8 <_RBTree_Validate_insert_unprotected+0x140> 20091c4: 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; 20091c8: 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; 20091cc: 98 00 40 0c add %g1, %o4, %o4 20091d0: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20091d4: c8 00 a0 04 ld [ %g2 + 4 ], %g4 c->parent = the_node->parent; 20091d8: c4 20 40 00 st %g2, [ %g1 ] the_node->parent = c; 20091dc: 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; 20091e0: 88 19 00 03 xor %g4, %g3, %g4 20091e4: 80 a0 00 04 cmp %g0, %g4 20091e8: 86 40 20 00 addx %g0, 0, %g3 20091ec: 87 28 e0 02 sll %g3, 2, %g3 20091f0: 84 00 80 03 add %g2, %g3, %g2 20091f4: c2 20 a0 04 st %g1, [ %g2 + 4 ] ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 20091f8: 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; 20091fc: c4 00 40 00 ld [ %g1 ], %g2 2009200: 86 90 a0 00 orcc %g2, 0, %g3 2009204: 32 bf ff a9 bne,a 20090a8 <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 2009208: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200920c: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED 2009210: 81 c7 e0 08 ret <== NOT EXECUTED 2009214: 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; 2009218: c0 21 20 10 clr [ %g4 + 0x10 ] g->color = RBT_RED; 200921c: da 20 a0 10 st %o5, [ %g2 + 0x10 ] 2009220: 10 bf ff 9c b 2009090 <_RBTree_Validate_insert_unprotected+0x8> 2009224: b0 10 00 02 mov %g2, %i0 2009228: 10 bf ff da b 2009190 <_RBTree_Validate_insert_unprotected+0x108> 200922c: 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]; 2009230: 10 bf ff a9 b 20090d4 <_RBTree_Validate_insert_unprotected+0x4c> 2009234: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 02006cd0 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2006cd0: 9d e3 bf 98 save %sp, -104, %sp rtems_initialization_tasks_table *user_tasks; /* * Move information into local variables */ user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table; 2006cd4: 03 00 80 6d sethi %hi(0x201b400), %g1 2006cd8: 82 10 61 e4 or %g1, 0x1e4, %g1 ! 201b5e4 2006cdc: fa 00 60 2c ld [ %g1 + 0x2c ], %i5 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 2006ce0: 80 a7 60 00 cmp %i5, 0 2006ce4: 02 80 00 18 be 2006d44 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 2006ce8: f6 00 60 28 ld [ %g1 + 0x28 ], %i3 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006cec: 80 a6 e0 00 cmp %i3, 0 2006cf0: 02 80 00 15 be 2006d44 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2006cf4: b8 10 20 00 clr %i4 return_value = rtems_task_create( 2006cf8: d4 07 60 04 ld [ %i5 + 4 ], %o2 2006cfc: d0 07 40 00 ld [ %i5 ], %o0 2006d00: d2 07 60 08 ld [ %i5 + 8 ], %o1 2006d04: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 2006d08: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2006d0c: 7f ff ff 70 call 2006acc 2006d10: 9a 07 bf fc add %fp, -4, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 2006d14: 94 92 20 00 orcc %o0, 0, %o2 2006d18: 12 80 00 0d bne 2006d4c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d1c: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2006d20: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2006d24: 40 00 00 0e call 2006d5c 2006d28: d2 07 60 10 ld [ %i5 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 2006d2c: 94 92 20 00 orcc %o0, 0, %o2 2006d30: 12 80 00 07 bne 2006d4c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d34: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006d38: 80 a7 00 1b cmp %i4, %i3 2006d3c: 12 bf ff ef bne 2006cf8 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2006d40: ba 07 60 1c add %i5, 0x1c, %i5 2006d44: 81 c7 e0 08 ret 2006d48: 81 e8 00 00 restore id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); 2006d4c: 90 10 20 01 mov 1, %o0 2006d50: 40 00 03 f3 call 2007d1c <_Internal_error_Occurred> 2006d54: 92 10 20 01 mov 1, %o1 =============================================================================== 0200c514 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200c514: 9d e3 bf 98 save %sp, -104, %sp RTEMS_API_Control *api; ASR_Information *asr; rtems_signal_set signal_set; Modes_Control prev_mode; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200c518: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 if ( !api ) 200c51c: 80 a7 60 00 cmp %i5, 0 200c520: 02 80 00 1e be 200c598 <_RTEMS_tasks_Post_switch_extension+0x84><== NEVER TAKEN 200c524: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200c528: 7f ff d7 18 call 2002188 200c52c: 01 00 00 00 nop signal_set = asr->signals_posted; 200c530: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 asr->signals_posted = 0; 200c534: c0 27 60 14 clr [ %i5 + 0x14 ] _ISR_Enable( level ); 200c538: 7f ff d7 18 call 2002198 200c53c: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200c540: 80 a7 20 00 cmp %i4, 0 200c544: 32 80 00 04 bne,a 200c554 <_RTEMS_tasks_Post_switch_extension+0x40> 200c548: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200c54c: 81 c7 e0 08 ret 200c550: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c554: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c558: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c55c: 94 07 bf fc add %fp, -4, %o2 200c560: 37 00 00 3f sethi %hi(0xfc00), %i3 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c564: c2 27 60 1c st %g1, [ %i5 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c568: 40 00 07 d6 call 200e4c0 200c56c: 92 16 e3 ff or %i3, 0x3ff, %o1 (*asr->handler)( signal_set ); 200c570: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200c574: 9f c0 40 00 call %g1 200c578: 90 10 00 1c mov %i4, %o0 asr->nest_level -= 1; 200c57c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c580: d0 07 bf fc ld [ %fp + -4 ], %o0 asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); (*asr->handler)( signal_set ); asr->nest_level -= 1; 200c584: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c588: 92 16 e3 ff or %i3, 0x3ff, %o1 200c58c: 94 07 bf fc add %fp, -4, %o2 200c590: 40 00 07 cc call 200e4c0 200c594: c2 27 60 1c st %g1, [ %i5 + 0x1c ] 200c598: 81 c7 e0 08 ret 200c59c: 81 e8 00 00 restore =============================================================================== 0200c47c <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200c47c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200c480: 80 a0 60 00 cmp %g1, 0 200c484: 22 80 00 0c be,a 200c4b4 <_RTEMS_tasks_Switch_extension+0x38> 200c488: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200c48c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200c490: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200c494: c8 00 80 00 ld [ %g2 ], %g4 200c498: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200c49c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c4a0: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200c4a4: 80 a0 60 00 cmp %g1, 0 200c4a8: 32 bf ff fa bne,a 200c490 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200c4ac: 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; 200c4b0: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200c4b4: 80 a0 60 00 cmp %g1, 0 200c4b8: 02 80 00 0b be 200c4e4 <_RTEMS_tasks_Switch_extension+0x68> 200c4bc: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200c4c0: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200c4c4: 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; 200c4c8: c8 00 80 00 ld [ %g2 ], %g4 200c4cc: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200c4d0: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c4d4: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200c4d8: 80 a0 60 00 cmp %g1, 0 200c4dc: 32 bf ff fa bne,a 200c4c4 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200c4e0: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200c4e4: 81 c3 e0 08 retl =============================================================================== 02007a70 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007a70: 9d e3 bf 98 save %sp, -104, %sp 2007a74: 11 00 80 77 sethi %hi(0x201dc00), %o0 2007a78: 92 10 00 18 mov %i0, %o1 2007a7c: 90 12 23 64 or %o0, 0x364, %o0 2007a80: 40 00 08 20 call 2009b00 <_Objects_Get> 2007a84: 94 07 bf fc add %fp, -4, %o2 /* * When we get here, the Timer is already off the chain so we do not * have to worry about that -- hence no _Watchdog_Remove(). */ the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 2007a88: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a8c: 80 a0 60 00 cmp %g1, 0 2007a90: 12 80 00 17 bne 2007aec <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2007a94: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007a98: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007a9c: 03 00 00 10 sethi %hi(0x4000), %g1 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_period ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_PERIOD); 2007aa0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007aa4: 80 88 80 01 btst %g2, %g1 2007aa8: 22 80 00 08 be,a 2007ac8 <_Rate_monotonic_Timeout+0x58> 2007aac: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ab0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007ab4: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007ab8: 80 a0 80 01 cmp %g2, %g1 2007abc: 02 80 00 1a be 2007b24 <_Rate_monotonic_Timeout+0xb4> 2007ac0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 2007ac4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007ac8: 80 a0 60 01 cmp %g1, 1 2007acc: 02 80 00 0a be 2007af4 <_Rate_monotonic_Timeout+0x84> 2007ad0: 82 10 20 04 mov 4, %g1 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007ad4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] /** * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2007ad8: 03 00 80 78 sethi %hi(0x201e000), %g1 2007adc: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e0d0 <_Thread_Dispatch_disable_level> 2007ae0: 84 00 bf ff add %g2, -1, %g2 2007ae4: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 2007ae8: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 2007aec: 81 c7 e0 08 ret 2007af0: 81 e8 00 00 restore _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007af4: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007af8: 90 10 00 1d mov %i5, %o0 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007afc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007b00: 7f ff fe 5a call 2007468 <_Rate_monotonic_Initiate_statistics> 2007b04: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b08: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b0c: 11 00 80 78 sethi %hi(0x201e000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b10: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b14: 90 12 21 94 or %o0, 0x194, %o0 2007b18: 40 00 0f df call 200ba94 <_Watchdog_Insert> 2007b1c: 92 07 60 10 add %i5, 0x10, %o1 2007b20: 30 bf ff ee b,a 2007ad8 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007b24: 40 00 0a b7 call 200a600 <_Thread_Clear_state> 2007b28: 92 12 63 f8 or %o1, 0x3f8, %o1 the_thread = the_period->owner; if ( _States_Is_waiting_for_period( the_thread->current_state ) && the_thread->Wait.id == the_period->Object.id ) { _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 2007b2c: 10 bf ff f5 b 2007b00 <_Rate_monotonic_Timeout+0x90> 2007b30: 90 10 00 1d mov %i5, %o0 =============================================================================== 02008bc4 <_Scheduler_priority_Yield>: * ready chain * select heir */ void _Scheduler_priority_Yield(void) { 2008bc4: 9d e3 bf a0 save %sp, -96, %sp Scheduler_priority_Per_thread *sched_info; ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 2008bc8: 37 00 80 71 sethi %hi(0x201c400), %i3 2008bcc: b6 16 e0 ac or %i3, 0xac, %i3 ! 201c4ac <_Per_CPU_Information> 2008bd0: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 sched_info = (Scheduler_priority_Per_thread *) executing->scheduler_info; ready = sched_info->ready_chain; 2008bd4: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 _ISR_Disable( level ); 2008bd8: 7f ff e5 6c call 2002188 2008bdc: f8 00 40 00 ld [ %g1 ], %i4 2008be0: b0 10 00 08 mov %o0, %i0 if ( !_Chain_Has_only_one_node( ready ) ) { 2008be4: c4 07 00 00 ld [ %i4 ], %g2 2008be8: c2 07 20 08 ld [ %i4 + 8 ], %g1 2008bec: 80 a0 80 01 cmp %g2, %g1 2008bf0: 02 80 00 17 be 2008c4c <_Scheduler_priority_Yield+0x88> 2008bf4: 86 07 20 04 add %i4, 4, %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008bf8: c2 07 60 04 ld [ %i5 + 4 ], %g1 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2008bfc: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; next->previous = previous; 2008c00: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 2008c04: c4 20 40 00 st %g2, [ %g1 ] Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 2008c08: c2 07 20 08 ld [ %i4 + 8 ], %g1 the_node->next = tail; 2008c0c: c6 27 40 00 st %g3, [ %i5 ] tail->previous = the_node; 2008c10: fa 27 20 08 st %i5, [ %i4 + 8 ] old_last->next = the_node; 2008c14: fa 20 40 00 st %i5, [ %g1 ] the_node->previous = old_last; 2008c18: c2 27 60 04 st %g1, [ %i5 + 4 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 2008c1c: 7f ff e5 5f call 2002198 2008c20: 01 00 00 00 nop 2008c24: 7f ff e5 59 call 2002188 2008c28: 01 00 00 00 nop 2008c2c: b0 10 00 08 mov %o0, %i0 if ( _Thread_Is_heir( executing ) ) 2008c30: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1 2008c34: 80 a7 40 01 cmp %i5, %g1 2008c38: 02 80 00 0b be 2008c64 <_Scheduler_priority_Yield+0xa0> <== ALWAYS TAKEN 2008c3c: 82 10 20 01 mov 1, %g1 _Thread_Heir = (Thread_Control *) _Chain_First( ready ); _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 2008c40: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] <== NOT EXECUTED _ISR_Enable( level ); 2008c44: 7f ff e5 55 call 2002198 2008c48: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) _Chain_First( ready ); _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 2008c4c: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1 2008c50: 80 a7 40 01 cmp %i5, %g1 2008c54: 02 bf ff fc be 2008c44 <_Scheduler_priority_Yield+0x80> <== ALWAYS TAKEN 2008c58: 82 10 20 01 mov 1, %g1 _Thread_Dispatch_necessary = true; 2008c5c: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] <== NOT EXECUTED 2008c60: 30 bf ff f9 b,a 2008c44 <_Scheduler_priority_Yield+0x80> <== NOT EXECUTED _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) _Chain_First( ready ); 2008c64: c2 07 00 00 ld [ %i4 ], %g1 2008c68: c2 26 e0 10 st %g1, [ %i3 + 0x10 ] _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 2008c6c: 82 10 20 01 mov 1, %g1 2008c70: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] 2008c74: 30 bf ff f4 b,a 2008c44 <_Scheduler_priority_Yield+0x80> =============================================================================== 02009170 <_Scheduler_simple_Ready_queue_Enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2009170: 03 00 80 71 sethi %hi(0x201c400), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009174: c2 00 61 64 ld [ %g1 + 0x164 ], %g1 ! 201c564 <_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 ) { 2009178: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200917c: c2 00 40 00 ld [ %g1 ], %g1 2009180: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009184: 80 a0 80 03 cmp %g2, %g3 2009188: 3a 80 00 08 bcc,a 20091a8 <_Scheduler_simple_Ready_queue_Enqueue_first+0x38> 200918c: 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 ) { 2009190: 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 ) { 2009194: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009198: 80 a0 80 03 cmp %g2, %g3 200919c: 2a bf ff fe bcs,a 2009194 <_Scheduler_simple_Ready_queue_Enqueue_first+0x24><== NEVER TAKEN 20091a0: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 20091a4: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 20091a8: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 20091ac: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 20091b0: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 20091b4: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 20091b8: 81 c3 e0 08 retl 20091bc: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02007850 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 2007850: 9d e3 bf 98 save %sp, -104, %sp /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007854: 05 00 80 70 sethi %hi(0x201c000), %g2 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007858: 03 00 80 6d sethi %hi(0x201b400), %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 200785c: c6 00 a3 94 ld [ %g2 + 0x394 ], %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007860: c2 00 61 a8 ld [ %g1 + 0x1a8 ], %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007864: 86 00 e0 01 inc %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007868: bb 28 60 07 sll %g1, 7, %i5 200786c: 89 28 60 02 sll %g1, 2, %g4 2007870: 88 27 40 04 sub %i5, %g4, %g4 2007874: 82 01 00 01 add %g4, %g1, %g1 2007878: 83 28 60 03 sll %g1, 3, %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 200787c: 92 07 bf f8 add %fp, -8, %o1 /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007880: c6 20 a3 94 st %g3, [ %g2 + 0x394 ] { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007884: c2 27 bf fc st %g1, [ %fp + -4 ] 2007888: c0 27 bf f8 clr [ %fp + -8 ] /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 200788c: 11 00 80 70 sethi %hi(0x201c000), %o0 2007890: 40 00 09 2b call 2009d3c <_Timespec_Add_to> 2007894: 90 12 22 fc or %o0, 0x2fc, %o0 ! 201c2fc <_TOD_Uptime> /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); 2007898: 92 07 bf f8 add %fp, -8, %o1 200789c: 11 00 80 70 sethi %hi(0x201c000), %o0 20078a0: 40 00 09 27 call 2009d3c <_Timespec_Add_to> 20078a4: 90 12 23 0c or %o0, 0x30c, %o0 ! 201c30c <_TOD_Now> while ( seconds ) { 20078a8: ba 92 20 00 orcc %o0, 0, %i5 20078ac: 02 80 00 08 be 20078cc <_TOD_Tickle_ticks+0x7c> 20078b0: 39 00 80 70 sethi %hi(0x201c000), %i4 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 20078b4: b8 17 23 38 or %i4, 0x338, %i4 ! 201c338 <_Watchdog_Seconds_chain> 20078b8: 40 00 0a a8 call 200a358 <_Watchdog_Tickle> 20078bc: 90 10 00 1c mov %i4, %o0 20078c0: ba 87 7f ff addcc %i5, -1, %i5 20078c4: 12 bf ff fd bne 20078b8 <_TOD_Tickle_ticks+0x68> <== NEVER TAKEN 20078c8: 01 00 00 00 nop 20078cc: 81 c7 e0 08 ret 20078d0: 81 e8 00 00 restore =============================================================================== 02007498 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007498: 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(); 200749c: 03 00 80 77 sethi %hi(0x201dc00), %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; 20074a0: 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) || 20074a4: 80 a6 20 00 cmp %i0, 0 20074a8: 02 80 00 2c be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN 20074ac: d2 00 60 a8 ld [ %g1 + 0xa8 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 20074b0: 11 00 03 d0 sethi %hi(0xf4000), %o0 20074b4: 40 00 49 0a call 20198dc <.udiv> 20074b8: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20074bc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20074c0: 80 a2 00 01 cmp %o0, %g1 20074c4: 28 80 00 26 bleu,a 200755c <_TOD_Validate+0xc4> 20074c8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 20074cc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20074d0: 80 a0 60 3b cmp %g1, 0x3b 20074d4: 38 80 00 22 bgu,a 200755c <_TOD_Validate+0xc4> 20074d8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20074dc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20074e0: 80 a0 60 3b cmp %g1, 0x3b 20074e4: 38 80 00 1e bgu,a 200755c <_TOD_Validate+0xc4> 20074e8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20074ec: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20074f0: 80 a0 60 17 cmp %g1, 0x17 20074f4: 38 80 00 1a bgu,a 200755c <_TOD_Validate+0xc4> 20074f8: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 20074fc: 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) || 2007500: 80 a0 60 00 cmp %g1, 0 2007504: 02 80 00 15 be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007508: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 200750c: 38 80 00 14 bgu,a 200755c <_TOD_Validate+0xc4> 2007510: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007514: 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) || 2007518: 80 a0 a7 c3 cmp %g2, 0x7c3 200751c: 28 80 00 10 bleu,a 200755c <_TOD_Validate+0xc4> 2007520: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007524: 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) || 2007528: 80 a0 e0 00 cmp %g3, 0 200752c: 02 80 00 0b be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007530: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007534: 32 80 00 0c bne,a 2007564 <_TOD_Validate+0xcc> 2007538: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 200753c: 82 00 60 0d add %g1, 0xd, %g1 2007540: 05 00 80 72 sethi %hi(0x201c800), %g2 2007544: 83 28 60 02 sll %g1, 2, %g1 2007548: 84 10 a1 c0 or %g2, 0x1c0, %g2 200754c: 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( 2007550: 80 a0 40 03 cmp %g1, %g3 2007554: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 2007558: b0 0f 60 01 and %i5, 1, %i0 200755c: 81 c7 e0 08 ret 2007560: 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 ]; 2007564: 05 00 80 72 sethi %hi(0x201c800), %g2 2007568: 84 10 a1 c0 or %g2, 0x1c0, %g2 ! 201c9c0 <_TOD_Days_per_month> 200756c: 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( 2007570: 80 a0 40 03 cmp %g1, %g3 2007574: 10 bf ff f9 b 2007558 <_TOD_Validate+0xc0> 2007578: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02008cd0 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008cd0: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008cd4: 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 ); 2008cd8: 40 00 03 9f call 2009b54 <_Thread_Set_transient> 2008cdc: 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 ) 2008ce0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008ce4: 80 a0 40 19 cmp %g1, %i1 2008ce8: 02 80 00 05 be 2008cfc <_Thread_Change_priority+0x2c> 2008cec: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008cf0: 90 10 00 18 mov %i0, %o0 2008cf4: 40 00 03 7e call 2009aec <_Thread_Set_priority> 2008cf8: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008cfc: 7f ff e5 23 call 2002188 2008d00: 01 00 00 00 nop 2008d04: 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; 2008d08: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 2008d0c: 80 a6 e0 04 cmp %i3, 4 2008d10: 02 80 00 18 be 2008d70 <_Thread_Change_priority+0xa0> 2008d14: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008d18: 02 80 00 0b be 2008d44 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 2008d1c: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2008d20: 7f ff e5 1e call 2002198 <== NOT EXECUTED 2008d24: 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); 2008d28: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 2008d2c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008d30: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2008d34: 32 80 00 0d bne,a 2008d68 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2008d38: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 2008d3c: 81 c7 e0 08 ret 2008d40: 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 ); 2008d44: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008d48: 7f ff e5 14 call 2002198 2008d4c: 90 10 00 19 mov %i1, %o0 2008d50: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008d54: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008d58: 80 8e c0 01 btst %i3, %g1 2008d5c: 02 bf ff f8 be 2008d3c <_Thread_Change_priority+0x6c> 2008d60: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008d64: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2008d68: 40 00 03 30 call 2009a28 <_Thread_queue_Requeue> 2008d6c: 93 e8 00 1d restore %g0, %i5, %o1 2008d70: 39 00 80 6d sethi %hi(0x201b400), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 2008d74: 12 80 00 08 bne 2008d94 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 2008d78: b8 17 22 84 or %i4, 0x284, %i4 ! 201b684 <_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 ) 2008d7c: 80 a6 a0 00 cmp %i2, 0 2008d80: 02 80 00 1b be 2008dec <_Thread_Change_priority+0x11c> 2008d84: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2008d88: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 2008d8c: 9f c0 40 00 call %g1 2008d90: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2008d94: 7f ff e5 01 call 2002198 2008d98: 90 10 00 19 mov %i1, %o0 2008d9c: 7f ff e4 fb call 2002188 2008da0: 01 00 00 00 nop 2008da4: 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(); 2008da8: c2 07 20 08 ld [ %i4 + 8 ], %g1 2008dac: 9f c0 40 00 call %g1 2008db0: 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 ); 2008db4: 03 00 80 71 sethi %hi(0x201c400), %g1 2008db8: 82 10 60 ac or %g1, 0xac, %g1 ! 201c4ac <_Per_CPU_Information> 2008dbc: 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() && 2008dc0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008dc4: 80 a0 80 03 cmp %g2, %g3 2008dc8: 02 80 00 07 be 2008de4 <_Thread_Change_priority+0x114> 2008dcc: 01 00 00 00 nop 2008dd0: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008dd4: 80 a0 a0 00 cmp %g2, 0 2008dd8: 02 80 00 03 be 2008de4 <_Thread_Change_priority+0x114> 2008ddc: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008de0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008de4: 7f ff e4 ed call 2002198 2008de8: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008dec: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 2008df0: 9f c0 40 00 call %g1 2008df4: 90 10 00 1d mov %i5, %o0 2008df8: 30 bf ff e7 b,a 2008d94 <_Thread_Change_priority+0xc4> =============================================================================== 02009014 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009014: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009018: 90 10 00 18 mov %i0, %o0 200901c: 40 00 00 77 call 20091f8 <_Thread_Get> 2009020: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009024: c2 07 bf fc ld [ %fp + -4 ], %g1 2009028: 80 a0 60 00 cmp %g1, 0 200902c: 12 80 00 09 bne 2009050 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2009030: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2009034: 7f ff ff 72 call 2008dfc <_Thread_Clear_state> 2009038: 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--; 200903c: 03 00 80 70 sethi %hi(0x201c000), %g1 2009040: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 201c280 <_Thread_Dispatch_disable_level> 2009044: 84 00 bf ff add %g2, -1, %g2 2009048: c4 20 62 80 st %g2, [ %g1 + 0x280 ] return _Thread_Dispatch_disable_level; 200904c: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 2009050: 81 c7 e0 08 ret 2009054: 81 e8 00 00 restore =============================================================================== 02009058 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2009058: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 200905c: 37 00 80 71 sethi %hi(0x201c400), %i3 2009060: b6 16 e0 ac or %i3, 0xac, %i3 ! 201c4ac <_Per_CPU_Information> _ISR_Disable( level ); 2009064: 7f ff e4 49 call 2002188 2009068: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 200906c: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2009070: 80 a0 60 00 cmp %g1, 0 2009074: 02 80 00 4e be 20091ac <_Thread_Dispatch+0x154> 2009078: 31 00 80 70 sethi %hi(0x201c000), %i0 heir = _Thread_Heir; 200907c: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 2009080: 82 10 20 01 mov 1, %g1 2009084: c2 26 22 80 st %g1, [ %i0 + 0x280 ] _Thread_Dispatch_set_disable_level( 1 ); _Thread_Dispatch_necessary = false; 2009088: c0 2e e0 18 clrb [ %i3 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200908c: 80 a7 40 1c cmp %i5, %i4 2009090: 02 80 00 47 be 20091ac <_Thread_Dispatch+0x154> 2009094: f8 26 e0 0c st %i4, [ %i3 + 0xc ] 2009098: 35 00 80 70 sethi %hi(0x201c000), %i2 200909c: 23 00 80 70 sethi %hi(0x201c000), %l1 20090a0: b4 16 a3 30 or %i2, 0x330, %i2 20090a4: a2 14 63 08 or %l1, 0x308, %l1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 20090a8: 27 00 80 70 sethi %hi(0x201c000), %l3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 20090ac: a0 10 00 1a mov %i2, %l0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 20090b0: 33 00 80 70 sethi %hi(0x201c000), %i1 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 20090b4: 10 80 00 38 b 2009194 <_Thread_Dispatch+0x13c> 20090b8: a4 10 20 01 mov 1, %l2 rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 20090bc: 7f ff e4 37 call 2002198 20090c0: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 20090c4: 40 00 0e 2b call 200c970 <_TOD_Get_uptime> 20090c8: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 20090cc: 90 10 00 10 mov %l0, %o0 20090d0: 92 07 bf f0 add %fp, -16, %o1 20090d4: 40 00 03 33 call 2009da0 <_Timespec_Subtract> 20090d8: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 20090dc: 90 07 60 84 add %i5, 0x84, %o0 20090e0: 40 00 03 17 call 2009d3c <_Timespec_Add_to> 20090e4: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 20090e8: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20090ec: c2 04 40 00 ld [ %l1 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 20090f0: c4 26 80 00 st %g2, [ %i2 ] 20090f4: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20090f8: 80 a0 60 00 cmp %g1, 0 20090fc: 02 80 00 06 be 2009114 <_Thread_Dispatch+0xbc> <== NEVER TAKEN 2009100: c4 26 a0 04 st %g2, [ %i2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 2009104: c4 00 40 00 ld [ %g1 ], %g2 2009108: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200910c: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2009110: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2009114: 90 10 00 1d mov %i5, %o0 2009118: 40 00 03 e6 call 200a0b0 <_User_extensions_Thread_switch> 200911c: 92 10 00 1c mov %i4, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2009120: 90 07 60 c8 add %i5, 0xc8, %o0 2009124: 40 00 05 2a call 200a5cc <_CPU_Context_switch> 2009128: 92 07 20 c8 add %i4, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200912c: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2009130: 80 a0 60 00 cmp %g1, 0 2009134: 02 80 00 0c be 2009164 <_Thread_Dispatch+0x10c> 2009138: d0 06 63 04 ld [ %i1 + 0x304 ], %o0 200913c: 80 a7 40 08 cmp %i5, %o0 2009140: 02 80 00 09 be 2009164 <_Thread_Dispatch+0x10c> 2009144: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2009148: 02 80 00 04 be 2009158 <_Thread_Dispatch+0x100> 200914c: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2009150: 40 00 04 e5 call 200a4e4 <_CPU_Context_save_fp> 2009154: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2009158: 40 00 05 00 call 200a558 <_CPU_Context_restore_fp> 200915c: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2009160: fa 26 63 04 st %i5, [ %i1 + 0x304 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2009164: 7f ff e4 09 call 2002188 2009168: fa 06 e0 0c ld [ %i3 + 0xc ], %i5 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200916c: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1 2009170: 80 a0 60 00 cmp %g1, 0 2009174: 02 80 00 0e be 20091ac <_Thread_Dispatch+0x154> 2009178: 01 00 00 00 nop heir = _Thread_Heir; 200917c: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4 2009180: e4 26 22 80 st %l2, [ %i0 + 0x280 ] _Thread_Dispatch_set_disable_level( 1 ); _Thread_Dispatch_necessary = false; 2009184: c0 2e e0 18 clrb [ %i3 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2009188: 80 a7 00 1d cmp %i4, %i5 200918c: 02 80 00 08 be 20091ac <_Thread_Dispatch+0x154> <== NEVER TAKEN 2009190: f8 26 e0 0c st %i4, [ %i3 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 2009194: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 2009198: 80 a0 60 01 cmp %g1, 1 200919c: 12 bf ff c8 bne 20090bc <_Thread_Dispatch+0x64> 20091a0: c2 04 e1 e4 ld [ %l3 + 0x1e4 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 20091a4: 10 bf ff c6 b 20090bc <_Thread_Dispatch+0x64> 20091a8: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 20091ac: c0 26 22 80 clr [ %i0 + 0x280 ] } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 20091b0: 7f ff e3 fa call 2002198 20091b4: 01 00 00 00 nop _API_extensions_Run_postswitch(); 20091b8: 7f ff f8 11 call 20071fc <_API_extensions_Run_postswitch> 20091bc: 01 00 00 00 nop } 20091c0: 81 c7 e0 08 ret 20091c4: 81 e8 00 00 restore =============================================================================== 0200e864 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e864: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200e868: 03 00 80 71 sethi %hi(0x201c400), %g1 200e86c: fa 00 60 b8 ld [ %g1 + 0xb8 ], %i5 ! 201c4b8 <_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(); 200e870: 3f 00 80 3a sethi %hi(0x200e800), %i7 200e874: be 17 e0 64 or %i7, 0x64, %i7 ! 200e864 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e878: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200e87c: 7f ff ce 47 call 2002198 200e880: 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) && 200e884: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e888: 03 00 80 6f sethi %hi(0x201bc00), %g1 doneConstructors = 1; 200e88c: 86 10 20 01 mov 1, %g3 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e890: f6 08 63 40 ldub [ %g1 + 0x340 ], %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) && 200e894: 80 a0 a0 00 cmp %g2, 0 200e898: 02 80 00 0c be 200e8c8 <_Thread_Handler+0x64> 200e89c: c6 28 63 40 stb %g3, [ %g1 + 0x340 ] #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 ); 200e8a0: 39 00 80 70 sethi %hi(0x201c000), %i4 200e8a4: d0 07 23 04 ld [ %i4 + 0x304 ], %o0 ! 201c304 <_Thread_Allocated_fp> 200e8a8: 80 a7 40 08 cmp %i5, %o0 200e8ac: 02 80 00 07 be 200e8c8 <_Thread_Handler+0x64> 200e8b0: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e8b4: 22 80 00 05 be,a 200e8c8 <_Thread_Handler+0x64> 200e8b8: fa 27 23 04 st %i5, [ %i4 + 0x304 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e8bc: 7f ff ef 0a call 200a4e4 <_CPU_Context_save_fp> 200e8c0: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e8c4: fa 27 23 04 st %i5, [ %i4 + 0x304 ] /* * 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 ); 200e8c8: 7f ff ed 78 call 2009ea8 <_User_extensions_Thread_begin> 200e8cc: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e8d0: 7f ff ea 3e call 20091c8 <_Thread_Enable_dispatch> 200e8d4: 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) */ { 200e8d8: 80 a6 e0 00 cmp %i3, 0 200e8dc: 02 80 00 0c be 200e90c <_Thread_Handler+0xa8> 200e8e0: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e8e4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200e8e8: 80 a0 60 00 cmp %g1, 0 200e8ec: 22 80 00 0c be,a 200e91c <_Thread_Handler+0xb8> <== ALWAYS TAKEN 200e8f0: 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 ); 200e8f4: 7f ff ed 81 call 2009ef8 <_User_extensions_Thread_exitted> 200e8f8: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e8fc: 90 10 20 00 clr %o0 200e900: 92 10 20 01 mov 1, %o1 200e904: 7f ff e5 06 call 2007d1c <_Internal_error_Occurred> 200e908: 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 (); 200e90c: 40 00 33 13 call 201b558 <_init> 200e910: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e914: 10 bf ff f5 b 200e8e8 <_Thread_Handler+0x84> 200e918: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e91c: 9f c0 40 00 call %g1 200e920: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200e924: 10 bf ff f4 b 200e8f4 <_Thread_Handler+0x90> 200e928: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 020092a8 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 20092a8: 9d e3 bf a0 save %sp, -96, %sp 20092ac: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 20092b0: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2 20092b4: e0 00 40 00 ld [ %g1 ], %l0 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 20092b8: c0 26 61 58 clr [ %i1 + 0x158 ] 20092bc: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 20092c0: c0 26 61 54 clr [ %i1 + 0x154 ] /* * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 20092c4: 90 10 00 19 mov %i1, %o0 20092c8: 40 00 02 32 call 2009b90 <_Thread_Stack_Allocate> 20092cc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 20092d0: 80 a2 00 1b cmp %o0, %i3 20092d4: 0a 80 00 4b bcs 2009400 <_Thread_Initialize+0x158> 20092d8: 80 a2 20 00 cmp %o0, 0 20092dc: 02 80 00 49 be 2009400 <_Thread_Initialize+0x158> <== NEVER TAKEN 20092e0: 80 a7 20 00 cmp %i4, 0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20092e4: c2 06 60 c0 ld [ %i1 + 0xc0 ], %g1 the_stack->size = size; 20092e8: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20092ec: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 20092f0: 12 80 00 48 bne 2009410 <_Thread_Initialize+0x168> 20092f4: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20092f8: 23 00 80 70 sethi %hi(0x201c000), %l1 20092fc: c2 04 63 14 ld [ %l1 + 0x314 ], %g1 ! 201c314 <_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; 2009300: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2009304: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2009308: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200930c: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2009310: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009314: 80 a0 60 00 cmp %g1, 0 2009318: 12 80 00 46 bne 2009430 <_Thread_Initialize+0x188> 200931c: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009320: 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; 2009324: b8 10 20 00 clr %i4 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2009328: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200932c: 03 00 80 6d sethi %hi(0x201b400), %g1 2009330: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; 2009334: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 2009338: c2 00 62 9c ld [ %g1 + 0x29c ], %g1 200933c: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009340: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2009344: f4 2e 60 a0 stb %i2, [ %i1 + 0xa0 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009348: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 200934c: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 2009350: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2009354: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2009358: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200935c: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2009360: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2009364: 9f c0 40 00 call %g1 2009368: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200936c: b4 92 20 00 orcc %o0, 0, %i2 2009370: 22 80 00 13 be,a 20093bc <_Thread_Initialize+0x114> 2009374: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2009378: 90 10 00 19 mov %i1, %o0 200937c: 40 00 01 dc call 2009aec <_Thread_Set_priority> 2009380: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009384: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009388: 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 ); 200938c: c0 26 60 84 clr [ %i1 + 0x84 ] 2009390: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009394: 83 28 60 02 sll %g1, 2, %g1 2009398: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200939c: e0 26 60 0c st %l0, [ %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 ); 20093a0: 90 10 00 19 mov %i1, %o0 20093a4: 40 00 02 fc call 2009f94 <_User_extensions_Thread_create> 20093a8: b0 10 20 01 mov 1, %i0 if ( extension_status ) 20093ac: 80 8a 20 ff btst 0xff, %o0 20093b0: 32 80 00 12 bne,a 20093f8 <_Thread_Initialize+0x150> 20093b4: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 20093b8: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 20093bc: 40 00 04 35 call 200a490 <_Workspace_Free> 20093c0: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 20093c4: 40 00 04 33 call 200a490 <_Workspace_Free> 20093c8: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 20093cc: 40 00 04 31 call 200a490 <_Workspace_Free> 20093d0: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 20093d4: 40 00 04 2f call 200a490 <_Workspace_Free> 20093d8: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 20093dc: 40 00 04 2d call 200a490 <_Workspace_Free> 20093e0: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 20093e4: 40 00 04 2b call 200a490 <_Workspace_Free> 20093e8: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 20093ec: 40 00 02 04 call 2009bfc <_Thread_Stack_Free> 20093f0: 90 10 00 19 mov %i1, %o0 return false; } 20093f4: b0 0e 20 01 and %i0, 1, %i0 20093f8: 81 c7 e0 08 ret 20093fc: 81 e8 00 00 restore * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 2009400: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2009404: b0 0e 20 01 and %i0, 1, %i0 2009408: 81 c7 e0 08 ret 200940c: 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 ); 2009410: 40 00 04 18 call 200a470 <_Workspace_Allocate> 2009414: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2009418: b6 92 20 00 orcc %o0, 0, %i3 200941c: 32 bf ff b8 bne,a 20092fc <_Thread_Initialize+0x54> 2009420: 23 00 80 70 sethi %hi(0x201c000), %l1 * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 2009424: b8 10 20 00 clr %i4 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; 2009428: 10 bf ff e4 b 20093b8 <_Thread_Initialize+0x110> 200942c: b4 10 20 00 clr %i2 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 2009430: 82 00 60 01 inc %g1 2009434: 40 00 04 0f call 200a470 <_Workspace_Allocate> 2009438: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200943c: b8 92 20 00 orcc %o0, 0, %i4 2009440: 02 80 00 10 be 2009480 <_Thread_Initialize+0x1d8> 2009444: 86 10 00 1c mov %i4, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2009448: f8 26 61 60 st %i4, [ %i1 + 0x160 ] 200944c: c8 04 63 14 ld [ %l1 + 0x314 ], %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++ ) 2009450: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009454: 10 80 00 03 b 2009460 <_Thread_Initialize+0x1b8> 2009458: 82 10 20 00 clr %g1 200945c: 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; 2009460: 85 28 a0 02 sll %g2, 2, %g2 2009464: 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++ ) 2009468: 82 00 60 01 inc %g1 200946c: 80 a0 40 04 cmp %g1, %g4 2009470: 08 bf ff fb bleu 200945c <_Thread_Initialize+0x1b4> 2009474: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2009478: 10 bf ff ad b 200932c <_Thread_Initialize+0x84> 200947c: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 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; 2009480: 10 bf ff ce b 20093b8 <_Thread_Initialize+0x110> 2009484: b4 10 20 00 clr %i2 =============================================================================== 02009770 <_Thread_queue_Enqueue_priority>: Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 2009770: 9d e3 bf a0 save %sp, -96, %sp Priority_Control priority; States_Control block_state; _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; 2009774: fa 06 60 14 ld [ %i1 + 0x14 ], %i5 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2009778: 82 06 60 38 add %i1, 0x38, %g1 200977c: 84 06 60 3c add %i1, 0x3c, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2009780: c2 26 60 40 st %g1, [ %i1 + 0x40 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009784: c4 26 60 38 st %g2, [ %i1 + 0x38 ] head->previous = NULL; 2009788: c0 26 60 3c clr [ %i1 + 0x3c ] Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 200978c: b8 10 00 18 mov %i0, %i4 RTEMS_INLINE_ROUTINE uint32_t _Thread_queue_Header_number ( Priority_Control the_priority ) { return (the_priority / TASK_QUEUE_DATA_PRIORITIES_PER_HEADER); 2009790: 83 37 60 06 srl %i5, 6, %g1 2009794: 25 00 80 6d sethi %hi(0x201b400), %l2 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2009798: 85 28 60 02 sll %g1, 2, %g2 block_state = the_thread_queue->state; 200979c: f0 06 20 38 ld [ %i0 + 0x38 ], %i0 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 20097a0: 83 28 60 04 sll %g1, 4, %g1 20097a4: a4 14 a1 dc or %l2, 0x1dc, %l2 20097a8: 82 20 40 02 sub %g1, %g2, %g1 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 20097ac: 80 8f 60 20 btst 0x20, %i5 20097b0: 12 80 00 26 bne 2009848 <_Thread_queue_Enqueue_priority+0xd8> 20097b4: a2 07 00 01 add %i4, %g1, %l1 20097b8: a4 04 60 04 add %l1, 4, %l2 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 20097bc: 7f ff e2 73 call 2002188 20097c0: 01 00 00 00 nop 20097c4: 82 10 00 08 mov %o0, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 20097c8: f6 04 40 00 ld [ %l1 ], %i3 search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 20097cc: 80 a6 c0 12 cmp %i3, %l2 20097d0: 32 80 00 12 bne,a 2009818 <_Thread_queue_Enqueue_priority+0xa8> 20097d4: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( _Thread_queue_Is_reverse_search( priority ) ) goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; 20097d8: 10 80 00 63 b 2009964 <_Thread_queue_Enqueue_priority+0x1f4> 20097dc: a0 10 3f ff mov -1, %l0 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 20097e0: 7f ff e2 6e call 2002198 20097e4: 90 10 00 01 mov %g1, %o0 20097e8: 7f ff e2 68 call 2002188 20097ec: 01 00 00 00 nop 20097f0: 82 10 00 08 mov %o0, %g1 RTEMS_INLINE_ROUTINE bool _States_Are_set ( States_Control the_states, States_Control mask ) { return ( (the_states & mask) != STATES_READY); 20097f4: c4 06 e0 10 ld [ %i3 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 20097f8: 80 8e 00 02 btst %i0, %g2 20097fc: 02 80 00 3f be 20098f8 <_Thread_queue_Enqueue_priority+0x188> 2009800: 01 00 00 00 nop _ISR_Enable( level ); goto restart_forward_search; } search_thread = 2009804: f6 06 c0 00 ld [ %i3 ], %i3 restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2009808: 80 a6 c0 12 cmp %i3, %l2 200980c: 22 80 00 07 be,a 2009828 <_Thread_queue_Enqueue_priority+0xb8> 2009810: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 search_priority = search_thread->current_priority; 2009814: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( priority <= search_priority ) 2009818: 80 a7 40 10 cmp %i5, %l0 200981c: 18 bf ff f1 bgu 20097e0 <_Thread_queue_Enqueue_priority+0x70> 2009820: 01 00 00 00 nop } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2009824: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 2009828: 80 a6 20 01 cmp %i0, 1 200982c: 02 80 00 36 be 2009904 <_Thread_queue_Enqueue_priority+0x194><== ALWAYS TAKEN 2009830: 80 a7 40 10 cmp %i5, %l0 * For example, the blocking thread could have been given * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; 2009834: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED return the_thread_queue->sync_state; } 2009838: 81 c7 e0 08 ret <== NOT EXECUTED 200983c: 81 e8 00 00 restore <== NOT EXECUTED if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 2009840: 7f ff e2 56 call 2002198 2009844: 01 00 00 00 nop return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 2009848: 7f ff e2 50 call 2002188 200984c: e0 0c 80 00 ldub [ %l2 ], %l0 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2009850: a0 04 20 01 inc %l0 _ISR_Disable( level ); 2009854: 82 10 00 08 mov %o0, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 2009858: f6 04 60 08 ld [ %l1 + 8 ], %i3 search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 200985c: 80 a6 c0 11 cmp %i3, %l1 2009860: 32 80 00 12 bne,a 20098a8 <_Thread_queue_Enqueue_priority+0x138> 2009864: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2009868: 10 80 00 14 b 20098b8 <_Thread_queue_Enqueue_priority+0x148> 200986c: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 2009870: 7f ff e2 4a call 2002198 2009874: 90 10 00 01 mov %g1, %o0 2009878: 7f ff e2 44 call 2002188 200987c: 01 00 00 00 nop 2009880: 82 10 00 08 mov %o0, %g1 2009884: c4 06 e0 10 ld [ %i3 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2009888: 80 8e 00 02 btst %i0, %g2 200988c: 02 bf ff ed be 2009840 <_Thread_queue_Enqueue_priority+0xd0> 2009890: 01 00 00 00 nop _ISR_Enable( level ); goto restart_reverse_search; } search_thread = (Thread_Control *) 2009894: f6 06 e0 04 ld [ %i3 + 4 ], %i3 restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2009898: 80 a6 c0 11 cmp %i3, %l1 200989c: 22 80 00 07 be,a 20098b8 <_Thread_queue_Enqueue_priority+0x148> 20098a0: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 search_priority = search_thread->current_priority; 20098a4: e0 06 e0 14 ld [ %i3 + 0x14 ], %l0 if ( priority >= search_priority ) 20098a8: 80 a7 40 10 cmp %i5, %l0 20098ac: 0a bf ff f1 bcs 2009870 <_Thread_queue_Enqueue_priority+0x100> 20098b0: 01 00 00 00 nop } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 20098b4: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 20098b8: 80 a6 20 01 cmp %i0, 1 20098bc: 32 bf ff df bne,a 2009838 <_Thread_queue_Enqueue_priority+0xc8><== NEVER TAKEN 20098c0: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 20098c4: 80 a7 40 10 cmp %i5, %l0 20098c8: 02 80 00 1b be 2009934 <_Thread_queue_Enqueue_priority+0x1c4> 20098cc: c0 27 20 30 clr [ %i4 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 20098d0: c4 06 c0 00 ld [ %i3 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 20098d4: f6 26 60 04 st %i3, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 20098d8: c4 26 40 00 st %g2, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; 20098dc: f2 26 c0 00 st %i1, [ %i3 ] next_node->previous = the_node; 20098e0: f2 20 a0 04 st %i1, [ %g2 + 4 ] the_thread->Wait.queue = the_thread_queue; 20098e4: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); 20098e8: 7f ff e2 2c call 2002198 20098ec: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20098f0: 81 c7 e0 08 ret 20098f4: 81 e8 00 00 restore if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 20098f8: 7f ff e2 28 call 2002198 20098fc: 01 00 00 00 nop goto restart_forward_search; 2009900: 30 bf ff af b,a 20097bc <_Thread_queue_Enqueue_priority+0x4c> THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2009904: 02 80 00 0c be 2009934 <_Thread_queue_Enqueue_priority+0x1c4> 2009908: c0 27 20 30 clr [ %i4 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; previous_node = search_node->previous; 200990c: c4 06 e0 04 ld [ %i3 + 4 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2009910: f6 26 40 00 st %i3, [ %i1 ] the_node->previous = previous_node; 2009914: c4 26 60 04 st %g2, [ %i1 + 4 ] previous_node->next = the_node; 2009918: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 200991c: f2 26 e0 04 st %i1, [ %i3 + 4 ] the_thread->Wait.queue = the_thread_queue; 2009920: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); 2009924: 7f ff e2 1d call 2002198 2009928: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 200992c: 81 c7 e0 08 ret 2009930: 81 e8 00 00 restore _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; 2009934: c4 06 e0 40 ld [ %i3 + 0x40 ], %g2 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); 2009938: 86 06 e0 3c add %i3, 0x3c, %g3 previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; 200993c: c4 26 60 04 st %g2, [ %i1 + 4 ] equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2009940: c6 26 40 00 st %g3, [ %i1 ] the_node->previous = previous_node; previous_node->next = the_node; 2009944: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 2009948: f2 26 e0 40 st %i1, [ %i3 + 0x40 ] the_thread->Wait.queue = the_thread_queue; 200994c: f8 26 60 44 st %i4, [ %i1 + 0x44 ] _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2009950: b0 10 20 01 mov 1, %i0 the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2009954: 7f ff e2 11 call 2002198 2009958: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 200995c: 81 c7 e0 08 ret 2009960: 81 e8 00 00 restore } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2009964: 10 bf ff b1 b 2009828 <_Thread_queue_Enqueue_priority+0xb8> 2009968: f0 07 20 30 ld [ %i4 + 0x30 ], %i0 =============================================================================== 02009a28 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009a28: 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 ) 2009a2c: 80 a6 20 00 cmp %i0, 0 2009a30: 02 80 00 13 be 2009a7c <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 2009a34: 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 ) { 2009a38: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2009a3c: 80 a7 20 01 cmp %i4, 1 2009a40: 02 80 00 04 be 2009a50 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 2009a44: 01 00 00 00 nop 2009a48: 81 c7 e0 08 ret <== NOT EXECUTED 2009a4c: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009a50: 7f ff e1 ce call 2002188 2009a54: 01 00 00 00 nop 2009a58: ba 10 00 08 mov %o0, %i5 2009a5c: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2009a60: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009a64: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009a68: 80 88 80 01 btst %g2, %g1 2009a6c: 12 80 00 06 bne 2009a84 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 2009a70: 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 ); 2009a74: 7f ff e1 c9 call 2002198 2009a78: 90 10 00 1d mov %i5, %o0 2009a7c: 81 c7 e0 08 ret 2009a80: 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 ); 2009a84: 92 10 00 19 mov %i1, %o1 2009a88: 94 10 20 01 mov 1, %o2 2009a8c: 40 00 0d 3c call 200cf7c <_Thread_queue_Extract_priority_helper> 2009a90: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009a94: 90 10 00 18 mov %i0, %o0 2009a98: 92 10 00 19 mov %i1, %o1 2009a9c: 7f ff ff 35 call 2009770 <_Thread_queue_Enqueue_priority> 2009aa0: 94 07 bf fc add %fp, -4, %o2 2009aa4: 30 bf ff f4 b,a 2009a74 <_Thread_queue_Requeue+0x4c> =============================================================================== 02009aa8 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009aa8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009aac: 90 10 00 18 mov %i0, %o0 2009ab0: 7f ff fd d2 call 20091f8 <_Thread_Get> 2009ab4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009ab8: c2 07 bf fc ld [ %fp + -4 ], %g1 2009abc: 80 a0 60 00 cmp %g1, 0 2009ac0: 12 80 00 09 bne 2009ae4 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009ac4: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009ac8: 40 00 0d 66 call 200d060 <_Thread_queue_Process_timeout> 2009acc: 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--; 2009ad0: 03 00 80 70 sethi %hi(0x201c000), %g1 2009ad4: c4 00 62 80 ld [ %g1 + 0x280 ], %g2 ! 201c280 <_Thread_Dispatch_disable_level> 2009ad8: 84 00 bf ff add %g2, -1, %g2 2009adc: c4 20 62 80 st %g2, [ %g1 + 0x280 ] return _Thread_Dispatch_disable_level; 2009ae0: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 2009ae4: 81 c7 e0 08 ret 2009ae8: 81 e8 00 00 restore =============================================================================== 02016488 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2016488: 9d e3 bf 88 save %sp, -120, %sp 201648c: 23 00 80 f1 sethi %hi(0x203c400), %l1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016490: a6 07 bf e8 add %fp, -24, %l3 2016494: b2 07 bf ec add %fp, -20, %i1 2016498: b6 07 bf f4 add %fp, -12, %i3 201649c: a4 07 bf f8 add %fp, -8, %l2 20164a0: 21 00 80 f1 sethi %hi(0x203c400), %l0 20164a4: 29 00 80 f1 sethi %hi(0x203c400), %l4 20164a8: f2 27 bf e8 st %i1, [ %fp + -24 ] head->previous = NULL; 20164ac: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20164b0: e6 27 bf f0 st %l3, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20164b4: e4 27 bf f4 st %l2, [ %fp + -12 ] head->previous = NULL; 20164b8: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20164bc: f6 27 bf fc st %i3, [ %fp + -4 ] 20164c0: a2 14 61 64 or %l1, 0x164, %l1 20164c4: b8 06 20 30 add %i0, 0x30, %i4 20164c8: a0 14 20 dc or %l0, 0xdc, %l0 20164cc: b4 06 20 68 add %i0, 0x68, %i2 20164d0: a8 15 20 50 or %l4, 0x50, %l4 20164d4: ae 06 20 08 add %i0, 8, %l7 20164d8: ac 06 20 40 add %i0, 0x40, %l6 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 20164dc: aa 10 20 01 mov 1, %l5 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 20164e0: e6 26 20 78 st %l3, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20164e4: c2 04 40 00 ld [ %l1 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20164e8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20164ec: 94 10 00 1b mov %i3, %o2 20164f0: 90 10 00 1c mov %i4, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20164f4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20164f8: 40 00 12 b7 call 201afd4 <_Watchdog_Adjust_to_chain> 20164fc: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016500: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016504: fa 04 00 00 ld [ %l0 ], %i5 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 2016508: 80 a7 40 0a cmp %i5, %o2 201650c: 18 80 00 2e bgu 20165c4 <_Timer_server_Body+0x13c> 2016510: 92 27 40 0a sub %i5, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2016514: 80 a7 40 0a cmp %i5, %o2 2016518: 0a 80 00 2f bcs 20165d4 <_Timer_server_Body+0x14c> 201651c: 90 10 00 1a mov %i2, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2016520: fa 26 20 74 st %i5, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2016524: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016528: 40 00 02 ff call 2017124 <_Chain_Get> 201652c: 01 00 00 00 nop if ( timer == NULL ) { 2016530: 92 92 20 00 orcc %o0, 0, %o1 2016534: 02 80 00 10 be 2016574 <_Timer_server_Body+0xec> 2016538: 01 00 00 00 nop static void _Timer_server_Insert_timer( Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201653c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2016540: 80 a0 60 01 cmp %g1, 1 2016544: 02 80 00 28 be 20165e4 <_Timer_server_Body+0x15c> 2016548: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 201654c: 12 bf ff f6 bne 2016524 <_Timer_server_Body+0x9c> <== NEVER TAKEN 2016550: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016554: 40 00 12 d1 call 201b098 <_Watchdog_Insert> 2016558: 90 10 00 1a mov %i2, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 201655c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016560: 40 00 02 f1 call 2017124 <_Chain_Get> 2016564: 01 00 00 00 nop if ( timer == NULL ) { 2016568: 92 92 20 00 orcc %o0, 0, %o1 201656c: 32 bf ff f5 bne,a 2016540 <_Timer_server_Body+0xb8> <== NEVER TAKEN 2016570: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2016574: 7f ff e2 29 call 200ee18 2016578: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 201657c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016580: 80 a0 40 19 cmp %g1, %i1 2016584: 02 80 00 1c be 20165f4 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 2016588: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 201658c: 7f ff e2 27 call 200ee28 <== NOT EXECUTED 2016590: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016594: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016598: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201659c: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED 20165a0: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20165a4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165a8: 40 00 12 8b call 201afd4 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 20165ac: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 20165b0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20165b4: fa 04 00 00 ld [ %l0 ], %i5 <== NOT EXECUTED /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 20165b8: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED 20165bc: 08 bf ff d7 bleu 2016518 <_Timer_server_Body+0x90> <== NOT EXECUTED 20165c0: 92 27 40 0a sub %i5, %o2, %o1 <== NOT EXECUTED /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20165c4: 90 10 00 1a mov %i2, %o0 20165c8: 40 00 12 83 call 201afd4 <_Watchdog_Adjust_to_chain> 20165cc: 94 10 00 1b mov %i3, %o2 20165d0: 30 bf ff d4 b,a 2016520 <_Timer_server_Body+0x98> /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 20165d4: 92 10 20 01 mov 1, %o1 20165d8: 40 00 12 50 call 201af18 <_Watchdog_Adjust> 20165dc: 94 22 80 1d sub %o2, %i5, %o2 20165e0: 30 bf ff d0 b,a 2016520 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20165e4: 90 10 00 1c mov %i4, %o0 20165e8: 40 00 12 ac call 201b098 <_Watchdog_Insert> 20165ec: 92 02 60 10 add %o1, 0x10, %o1 20165f0: 30 bf ff cd b,a 2016524 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 20165f4: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 20165f8: 7f ff e2 0c call 200ee28 20165fc: 01 00 00 00 nop _Chain_Initialize_empty( &fire_chain ); while ( true ) { _Timer_server_Get_watchdogs_that_fire_now( ts, &insert_chain, &fire_chain ); if ( !_Chain_Is_empty( &fire_chain ) ) { 2016600: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016604: 80 a0 40 12 cmp %g1, %l2 2016608: 12 80 00 0c bne 2016638 <_Timer_server_Body+0x1b0> 201660c: 01 00 00 00 nop 2016610: 30 80 00 13 b,a 201665c <_Timer_server_Body+0x1d4> Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; new_first->previous = head; 2016614: f6 20 60 04 st %i3, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 2016618: c2 27 bf f4 st %g1, [ %fp + -12 ] * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 201661c: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 2016620: 7f ff e2 02 call 200ee28 2016624: 01 00 00 00 nop /* * The timer server may block here and wait for resources or time. * The system watchdogs are inactive and will remain inactive since * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); 2016628: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 201662c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2016630: 9f c0 40 00 call %g1 2016634: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2016638: 7f ff e1 f8 call 200ee18 201663c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016640: fa 07 bf f4 ld [ %fp + -12 ], %i5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 2016644: 80 a7 40 12 cmp %i5, %l2 2016648: 32 bf ff f3 bne,a 2016614 <_Timer_server_Body+0x18c> 201664c: c2 07 40 00 ld [ %i5 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2016650: 7f ff e1 f6 call 200ee28 2016654: 01 00 00 00 nop 2016658: 30 bf ff a2 b,a 20164e0 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 201665c: c0 2e 20 7c clrb [ %i0 + 0x7c ] /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2016660: c2 05 00 00 ld [ %l4 ], %g1 2016664: 82 00 60 01 inc %g1 2016668: c2 25 00 00 st %g1, [ %l4 ] return _Thread_Dispatch_disable_level; 201666c: c2 05 00 00 ld [ %l4 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016670: d0 06 00 00 ld [ %i0 ], %o0 2016674: 40 00 10 75 call 201a848 <_Thread_Set_state> 2016678: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 201667c: 7f ff ff 5b call 20163e8 <_Timer_server_Reset_interval_system_watchdog> 2016680: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016684: 7f ff ff 6d call 2016438 <_Timer_server_Reset_tod_system_watchdog> 2016688: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 201668c: 40 00 0d fa call 2019e74 <_Thread_Enable_dispatch> 2016690: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016694: 90 10 00 17 mov %l7, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 2016698: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201669c: 40 00 12 e1 call 201b220 <_Watchdog_Remove> 20166a0: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20166a4: 40 00 12 df call 201b220 <_Watchdog_Remove> 20166a8: 90 10 00 16 mov %l6, %o0 20166ac: 30 bf ff 8d b,a 20164e0 <_Timer_server_Body+0x58> =============================================================================== 020166b0 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20166b0: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20166b4: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20166b8: 80 a0 60 00 cmp %g1, 0 20166bc: 02 80 00 05 be 20166d0 <_Timer_server_Schedule_operation_method+0x20> 20166c0: ba 10 00 19 mov %i1, %i5 * server is not preemptible, so we must be in interrupt context here. No * thread dispatch will happen until the timer server finishes its * critical section. We have to use the protected chain methods because * we may be interrupted by a higher priority interrupt. */ _Chain_Append( ts->insert_chain, &timer->Object.Node ); 20166c4: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 20166c8: 40 00 02 83 call 20170d4 <_Chain_Append> 20166cc: 81 e8 00 00 restore /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20166d0: 03 00 80 f1 sethi %hi(0x203c400), %g1 20166d4: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 ! 203c450 <_Thread_Dispatch_disable_level> 20166d8: 84 00 a0 01 inc %g2 20166dc: c4 20 60 50 st %g2, [ %g1 + 0x50 ] return _Thread_Dispatch_disable_level; 20166e0: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 20166e4: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 20166e8: 80 a0 60 01 cmp %g1, 1 20166ec: 02 80 00 28 be 201678c <_Timer_server_Schedule_operation_method+0xdc> 20166f0: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); if ( !ts->active ) { _Timer_server_Reset_interval_system_watchdog( ts ); } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20166f4: 02 80 00 04 be 2016704 <_Timer_server_Schedule_operation_method+0x54> 20166f8: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20166fc: 40 00 0d de call 2019e74 <_Thread_Enable_dispatch> 2016700: 81 e8 00 00 restore } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2016704: 7f ff e1 c5 call 200ee18 2016708: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201670c: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016710: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016714: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016718: 03 00 80 f1 sethi %hi(0x203c400), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 201671c: 80 a0 80 04 cmp %g2, %g4 2016720: 02 80 00 0d be 2016754 <_Timer_server_Schedule_operation_method+0xa4> 2016724: c2 00 60 dc ld [ %g1 + 0xdc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2016728: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 if ( snapshot > last_snapshot ) { 201672c: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016730: 88 03 c0 03 add %o7, %g3, %g4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2016734: 08 80 00 07 bleu 2016750 <_Timer_server_Schedule_operation_method+0xa0> 2016738: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 201673c: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 2016740: 80 a3 c0 03 cmp %o7, %g3 2016744: 08 80 00 03 bleu 2016750 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN 2016748: 88 10 20 00 clr %g4 delta_interval -= delta; 201674c: 88 23 c0 03 sub %o7, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2016750: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2016754: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2016758: 7f ff e1 b4 call 200ee28 201675c: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016760: 90 06 20 68 add %i0, 0x68, %o0 2016764: 40 00 12 4d call 201b098 <_Watchdog_Insert> 2016768: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 201676c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016770: 80 a0 60 00 cmp %g1, 0 2016774: 12 bf ff e2 bne 20166fc <_Timer_server_Schedule_operation_method+0x4c> 2016778: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 201677c: 7f ff ff 2f call 2016438 <_Timer_server_Reset_tod_system_watchdog> 2016780: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016784: 40 00 0d bc call 2019e74 <_Thread_Enable_dispatch> 2016788: 81 e8 00 00 restore if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 201678c: 7f ff e1 a3 call 200ee18 2016790: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016794: 05 00 80 f1 sethi %hi(0x203c400), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016798: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201679c: c4 00 a1 64 ld [ %g2 + 0x164 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 20167a0: c8 06 20 3c ld [ %i0 + 0x3c ], %g4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20167a4: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20167a8: 80 a0 40 03 cmp %g1, %g3 20167ac: 02 80 00 08 be 20167cc <_Timer_server_Schedule_operation_method+0x11c> 20167b0: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20167b4: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 20167b8: 80 a1 00 0f cmp %g4, %o7 20167bc: 1a 80 00 03 bcc 20167c8 <_Timer_server_Schedule_operation_method+0x118> 20167c0: 86 10 20 00 clr %g3 delta_interval -= delta; 20167c4: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 20167c8: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 20167cc: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 20167d0: 7f ff e1 96 call 200ee28 20167d4: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20167d8: 90 06 20 30 add %i0, 0x30, %o0 20167dc: 40 00 12 2f call 201b098 <_Watchdog_Insert> 20167e0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167e4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20167e8: 80 a0 60 00 cmp %g1, 0 20167ec: 12 bf ff c4 bne 20166fc <_Timer_server_Schedule_operation_method+0x4c> 20167f0: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20167f4: 7f ff fe fd call 20163e8 <_Timer_server_Reset_interval_system_watchdog> 20167f8: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20167fc: 40 00 0d 9e call 2019e74 <_Thread_Enable_dispatch> 2016800: 81 e8 00 00 restore =============================================================================== 02009d3c <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 2009d3c: 9d e3 bf a0 save %sp, -96, %sp 2009d40: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009d44: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 2009d48: c8 00 60 04 ld [ %g1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 2009d4c: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 2009d50: c4 06 60 04 ld [ %i1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009d54: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 2009d58: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009d5c: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009d60: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 2009d64: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 2009d68: 80 a0 80 04 cmp %g2, %g4 2009d6c: 08 80 00 0b bleu 2009d98 <_Timespec_Add_to+0x5c> 2009d70: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2009d74: 1f 31 19 4d sethi %hi(0xc4653400), %o7 2009d78: 9e 13 e2 00 or %o7, 0x200, %o7 ! c4653600 2009d7c: 84 00 80 0f add %g2, %o7, %g2 time->tv_sec++; 2009d80: 86 00 e0 01 inc %g3 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009d84: 80 a0 80 04 cmp %g2, %g4 2009d88: 18 bf ff fd bgu 2009d7c <_Timespec_Add_to+0x40> <== NEVER TAKEN 2009d8c: b0 06 20 01 inc %i0 2009d90: c4 20 60 04 st %g2, [ %g1 + 4 ] 2009d94: c6 20 40 00 st %g3, [ %g1 ] time->tv_sec++; seconds++; } return seconds; } 2009d98: 81 c7 e0 08 ret 2009d9c: 81 e8 00 00 restore =============================================================================== 02009f44 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 2009f44: 9d e3 bf a0 save %sp, -96, %sp 2009f48: 39 00 80 71 sethi %hi(0x201c400), %i4 2009f4c: b8 17 20 68 or %i4, 0x68, %i4 ! 201c468 <_User_extensions_List> 2009f50: 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 ); 2009f54: 80 a7 40 1c cmp %i5, %i4 2009f58: 02 80 00 0d be 2009f8c <_User_extensions_Fatal+0x48> <== NEVER TAKEN 2009f5c: 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 ) 2009f60: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009f64: 80 a0 60 00 cmp %g1, 0 2009f68: 02 80 00 05 be 2009f7c <_User_extensions_Fatal+0x38> 2009f6c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 2009f70: 92 10 00 19 mov %i1, %o1 2009f74: 9f c0 40 00 call %g1 2009f78: 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 ) { 2009f7c: 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 ); 2009f80: 80 a7 40 1c cmp %i5, %i4 2009f84: 32 bf ff f8 bne,a 2009f64 <_User_extensions_Fatal+0x20> 2009f88: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009f8c: 81 c7 e0 08 ret 2009f90: 81 e8 00 00 restore =============================================================================== 02009df0 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009df0: 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; 2009df4: 07 00 80 6d sethi %hi(0x201b400), %g3 2009df8: 86 10 e1 9c or %g3, 0x19c, %g3 ! 201b59c initial_extensions = Configuration.User_extension_table; 2009dfc: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3 2009e00: 3b 00 80 71 sethi %hi(0x201c400), %i5 2009e04: 09 00 80 70 sethi %hi(0x201c000), %g4 2009e08: 84 17 60 68 or %i5, 0x68, %g2 2009e0c: 82 11 22 84 or %g4, 0x284, %g1 2009e10: b4 00 a0 04 add %g2, 4, %i2 2009e14: b8 00 60 04 add %g1, 4, %i4 2009e18: f4 27 60 68 st %i2, [ %i5 + 0x68 ] head->previous = NULL; 2009e1c: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 2009e20: 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; 2009e24: f8 21 22 84 st %i4, [ %g4 + 0x284 ] head->previous = NULL; 2009e28: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009e2c: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009e30: 80 a6 e0 00 cmp %i3, 0 2009e34: 02 80 00 1b be 2009ea0 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009e38: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009e3c: 83 2e a0 02 sll %i2, 2, %g1 2009e40: b9 2e a0 04 sll %i2, 4, %i4 2009e44: b8 27 00 01 sub %i4, %g1, %i4 2009e48: b8 07 00 1a add %i4, %i2, %i4 2009e4c: 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 *) 2009e50: 40 00 01 96 call 200a4a8 <_Workspace_Allocate_or_fatal_error> 2009e54: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009e58: 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 *) 2009e5c: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009e60: 40 00 15 87 call 200f47c 2009e64: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009e68: 80 a6 a0 00 cmp %i2, 0 2009e6c: 02 80 00 0d be 2009ea0 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009e70: 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; 2009e74: 92 10 00 1b mov %i3, %o1 2009e78: 94 10 20 20 mov 0x20, %o2 2009e7c: 40 00 15 44 call 200f38c 2009e80: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 2009e84: 40 00 0c 9a call 200d0ec <_User_extensions_Add_set> 2009e88: 90 10 00 1d mov %i5, %o0 2009e8c: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009e90: 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++ ) { 2009e94: 80 a7 00 1a cmp %i4, %i2 2009e98: 12 bf ff f7 bne 2009e74 <_User_extensions_Handler_initialization+0x84> 2009e9c: b6 06 e0 20 add %i3, 0x20, %i3 2009ea0: 81 c7 e0 08 ret 2009ea4: 81 e8 00 00 restore =============================================================================== 02009ea8 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 2009ea8: 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; 2009eac: 39 00 80 71 sethi %hi(0x201c400), %i4 2009eb0: fa 07 20 68 ld [ %i4 + 0x68 ], %i5 ! 201c468 <_User_extensions_List> 2009eb4: b8 17 20 68 or %i4, 0x68, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009eb8: b8 07 20 04 add %i4, 4, %i4 2009ebc: 80 a7 40 1c cmp %i5, %i4 2009ec0: 02 80 00 0c be 2009ef0 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 2009ec4: 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 ) 2009ec8: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009ecc: 80 a0 60 00 cmp %g1, 0 2009ed0: 02 80 00 04 be 2009ee0 <_User_extensions_Thread_begin+0x38> 2009ed4: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 2009ed8: 9f c0 40 00 call %g1 2009edc: 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 ) { 2009ee0: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009ee4: 80 a7 40 1c cmp %i5, %i4 2009ee8: 32 bf ff f9 bne,a 2009ecc <_User_extensions_Thread_begin+0x24> 2009eec: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009ef0: 81 c7 e0 08 ret 2009ef4: 81 e8 00 00 restore =============================================================================== 02009f94 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 2009f94: 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; 2009f98: 39 00 80 71 sethi %hi(0x201c400), %i4 2009f9c: fa 07 20 68 ld [ %i4 + 0x68 ], %i5 ! 201c468 <_User_extensions_List> 2009fa0: b8 17 20 68 or %i4, 0x68, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 2009fa4: b8 07 20 04 add %i4, 4, %i4 2009fa8: 80 a7 40 1c cmp %i5, %i4 2009fac: 02 80 00 12 be 2009ff4 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 2009fb0: 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)( 2009fb4: 37 00 80 71 sethi %hi(0x201c400), %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 ) { 2009fb8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2009fbc: 80 a0 60 00 cmp %g1, 0 2009fc0: 02 80 00 08 be 2009fe0 <_User_extensions_Thread_create+0x4c> 2009fc4: 84 16 e0 ac or %i3, 0xac, %g2 status = (*the_extension->Callouts.thread_create)( 2009fc8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009fcc: 9f c0 40 00 call %g1 2009fd0: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 2009fd4: 80 8a 20 ff btst 0xff, %o0 2009fd8: 02 80 00 0a be 200a000 <_User_extensions_Thread_create+0x6c> 2009fdc: 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 ) { 2009fe0: 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 ); 2009fe4: 80 a7 40 1c cmp %i5, %i4 2009fe8: 32 bf ff f5 bne,a 2009fbc <_User_extensions_Thread_create+0x28> 2009fec: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 2009ff0: 82 10 20 01 mov 1, %g1 } 2009ff4: b0 08 60 01 and %g1, 1, %i0 2009ff8: 81 c7 e0 08 ret 2009ffc: 81 e8 00 00 restore 200a000: b0 08 60 01 and %g1, 1, %i0 200a004: 81 c7 e0 08 ret 200a008: 81 e8 00 00 restore =============================================================================== 0200a00c <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200a00c: 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; 200a010: 39 00 80 71 sethi %hi(0x201c400), %i4 200a014: b8 17 20 68 or %i4, 0x68, %i4 ! 201c468 <_User_extensions_List> 200a018: 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 ); 200a01c: 80 a7 40 1c cmp %i5, %i4 200a020: 02 80 00 0d be 200a054 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200a024: 37 00 80 71 sethi %hi(0x201c400), %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 ) 200a028: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a02c: 80 a0 60 00 cmp %g1, 0 200a030: 02 80 00 05 be 200a044 <_User_extensions_Thread_delete+0x38> 200a034: 84 16 e0 ac or %i3, 0xac, %g2 (*the_extension->Callouts.thread_delete)( 200a038: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a03c: 9f c0 40 00 call %g1 200a040: 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 ) { 200a044: 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 ); 200a048: 80 a7 40 1c cmp %i5, %i4 200a04c: 32 bf ff f8 bne,a 200a02c <_User_extensions_Thread_delete+0x20> 200a050: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a054: 81 c7 e0 08 ret 200a058: 81 e8 00 00 restore =============================================================================== 02009ef8 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 2009ef8: 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; 2009efc: 39 00 80 71 sethi %hi(0x201c400), %i4 2009f00: b8 17 20 68 or %i4, 0x68, %i4 ! 201c468 <_User_extensions_List> 2009f04: 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 ); 2009f08: 80 a7 40 1c cmp %i5, %i4 2009f0c: 02 80 00 0c be 2009f3c <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 2009f10: 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 ) 2009f14: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009f18: 80 a0 60 00 cmp %g1, 0 2009f1c: 02 80 00 04 be 2009f2c <_User_extensions_Thread_exitted+0x34> 2009f20: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 2009f24: 9f c0 40 00 call %g1 2009f28: 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 ) { 2009f2c: 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 ); 2009f30: 80 a7 40 1c cmp %i5, %i4 2009f34: 32 bf ff f9 bne,a 2009f18 <_User_extensions_Thread_exitted+0x20> 2009f38: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009f3c: 81 c7 e0 08 ret 2009f40: 81 e8 00 00 restore =============================================================================== 0200a838 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200a838: 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; 200a83c: 39 00 80 73 sethi %hi(0x201cc00), %i4 200a840: fa 07 23 18 ld [ %i4 + 0x318 ], %i5 ! 201cf18 <_User_extensions_List> 200a844: b8 17 23 18 or %i4, 0x318, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a848: b8 07 20 04 add %i4, 4, %i4 200a84c: 80 a7 40 1c cmp %i5, %i4 200a850: 02 80 00 0d be 200a884 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200a854: 37 00 80 73 sethi %hi(0x201cc00), %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 ) 200a858: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a85c: 80 a0 60 00 cmp %g1, 0 200a860: 02 80 00 05 be 200a874 <_User_extensions_Thread_restart+0x3c> 200a864: 84 16 e3 5c or %i3, 0x35c, %g2 (*the_extension->Callouts.thread_restart)( 200a868: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a86c: 9f c0 40 00 call %g1 200a870: 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 ) { 200a874: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a878: 80 a7 40 1c cmp %i5, %i4 200a87c: 32 bf ff f8 bne,a 200a85c <_User_extensions_Thread_restart+0x24> 200a880: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a884: 81 c7 e0 08 ret 200a888: 81 e8 00 00 restore =============================================================================== 0200a05c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200a05c: 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; 200a060: 39 00 80 71 sethi %hi(0x201c400), %i4 200a064: fa 07 20 68 ld [ %i4 + 0x68 ], %i5 ! 201c468 <_User_extensions_List> 200a068: b8 17 20 68 or %i4, 0x68, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a06c: b8 07 20 04 add %i4, 4, %i4 200a070: 80 a7 40 1c cmp %i5, %i4 200a074: 02 80 00 0d be 200a0a8 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200a078: 37 00 80 71 sethi %hi(0x201c400), %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 ) 200a07c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a080: 80 a0 60 00 cmp %g1, 0 200a084: 02 80 00 05 be 200a098 <_User_extensions_Thread_start+0x3c> 200a088: 84 16 e0 ac or %i3, 0xac, %g2 (*the_extension->Callouts.thread_start)( 200a08c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a090: 9f c0 40 00 call %g1 200a094: 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 ) { 200a098: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a09c: 80 a7 40 1c cmp %i5, %i4 200a0a0: 32 bf ff f8 bne,a 200a080 <_User_extensions_Thread_start+0x24> 200a0a4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a0a8: 81 c7 e0 08 ret 200a0ac: 81 e8 00 00 restore =============================================================================== 0200a0b0 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200a0b0: 9d e3 bf a0 save %sp, -96, %sp 200a0b4: 39 00 80 70 sethi %hi(0x201c000), %i4 200a0b8: fa 07 22 84 ld [ %i4 + 0x284 ], %i5 ! 201c284 <_User_extensions_Switches_list> 200a0bc: b8 17 22 84 or %i4, 0x284, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a0c0: b8 07 20 04 add %i4, 4, %i4 200a0c4: 80 a7 40 1c cmp %i5, %i4 200a0c8: 02 80 00 0a be 200a0f0 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200a0cc: 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 ); 200a0d0: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a0d4: 90 10 00 18 mov %i0, %o0 200a0d8: 9f c0 40 00 call %g1 200a0dc: 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 ) { 200a0e0: 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 ); 200a0e4: 80 a7 40 1c cmp %i5, %i4 200a0e8: 32 bf ff fb bne,a 200a0d4 <_User_extensions_Thread_switch+0x24> 200a0ec: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a0f0: 81 c7 e0 08 ret 200a0f4: 81 e8 00 00 restore =============================================================================== 0200bb64 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200bb64: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200bb68: 7f ff dc d8 call 2002ec8 200bb6c: 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; 200bb70: 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 ); 200bb74: 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 ) ) { 200bb78: 80 a0 40 1b cmp %g1, %i3 200bb7c: 02 80 00 1e be 200bbf4 <_Watchdog_Adjust+0x90> 200bb80: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200bb84: 12 80 00 1e bne 200bbfc <_Watchdog_Adjust+0x98> 200bb88: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bb8c: 80 a6 a0 00 cmp %i2, 0 200bb90: 02 80 00 19 be 200bbf4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bb94: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bb98: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bb9c: 80 a6 80 1c cmp %i2, %i4 200bba0: 1a 80 00 0a bcc 200bbc8 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200bba4: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200bba8: 10 80 00 1c b 200bc18 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200bbac: 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 ) { 200bbb0: 02 80 00 11 be 200bbf4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bbb4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bbb8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bbbc: 80 a7 00 1a cmp %i4, %i2 200bbc0: 38 80 00 16 bgu,a 200bc18 <_Watchdog_Adjust+0xb4> 200bbc4: 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; 200bbc8: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200bbcc: 7f ff dc c3 call 2002ed8 200bbd0: 01 00 00 00 nop _Watchdog_Tickle( header ); 200bbd4: 40 00 00 ab call 200be80 <_Watchdog_Tickle> 200bbd8: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200bbdc: 7f ff dc bb call 2002ec8 200bbe0: 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; 200bbe4: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200bbe8: 80 a6 c0 01 cmp %i3, %g1 200bbec: 32 bf ff f1 bne,a 200bbb0 <_Watchdog_Adjust+0x4c> 200bbf0: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200bbf4: 7f ff dc b9 call 2002ed8 200bbf8: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bbfc: 12 bf ff fe bne 200bbf4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bc00: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bc04: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bc08: b4 00 80 1a add %g2, %i2, %i2 200bc0c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bc10: 7f ff dc b2 call 2002ed8 200bc14: 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; 200bc18: 10 bf ff f7 b 200bbf4 <_Watchdog_Adjust+0x90> 200bc1c: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200a280 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200a280: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200a284: 7f ff df c1 call 2002188 200a288: 01 00 00 00 nop previous_state = the_watchdog->state; 200a28c: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200a290: 80 a7 60 01 cmp %i5, 1 200a294: 02 80 00 2a be 200a33c <_Watchdog_Remove+0xbc> 200a298: 03 00 80 70 sethi %hi(0x201c000), %g1 200a29c: 1a 80 00 09 bcc 200a2c0 <_Watchdog_Remove+0x40> 200a2a0: 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; 200a2a4: 03 00 80 70 sethi %hi(0x201c000), %g1 200a2a8: c2 00 63 94 ld [ %g1 + 0x394 ], %g1 ! 201c394 <_Watchdog_Ticks_since_boot> 200a2ac: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a2b0: 7f ff df ba call 2002198 200a2b4: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a2b8: 81 c7 e0 08 ret 200a2bc: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200a2c0: 18 bf ff fa bgu 200a2a8 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200a2c4: 03 00 80 70 sethi %hi(0x201c000), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 200a2c8: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200a2cc: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200a2d0: c4 00 40 00 ld [ %g1 ], %g2 200a2d4: 80 a0 a0 00 cmp %g2, 0 200a2d8: 02 80 00 07 be 200a2f4 <_Watchdog_Remove+0x74> 200a2dc: 05 00 80 70 sethi %hi(0x201c000), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200a2e0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a2e4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200a2e8: 84 00 c0 02 add %g3, %g2, %g2 200a2ec: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200a2f0: 05 00 80 70 sethi %hi(0x201c000), %g2 200a2f4: c4 00 a3 90 ld [ %g2 + 0x390 ], %g2 ! 201c390 <_Watchdog_Sync_count> 200a2f8: 80 a0 a0 00 cmp %g2, 0 200a2fc: 22 80 00 07 be,a 200a318 <_Watchdog_Remove+0x98> 200a300: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200a304: 05 00 80 71 sethi %hi(0x201c400), %g2 200a308: c6 00 a0 b4 ld [ %g2 + 0xb4 ], %g3 ! 201c4b4 <_Per_CPU_Information+0x8> 200a30c: 05 00 80 70 sethi %hi(0x201c000), %g2 200a310: c6 20 a3 28 st %g3, [ %g2 + 0x328 ] ! 201c328 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200a314: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200a318: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200a31c: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a320: 03 00 80 70 sethi %hi(0x201c000), %g1 200a324: c2 00 63 94 ld [ %g1 + 0x394 ], %g1 ! 201c394 <_Watchdog_Ticks_since_boot> 200a328: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a32c: 7f ff df 9b call 2002198 200a330: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a334: 81 c7 e0 08 ret 200a338: 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; 200a33c: c2 00 63 94 ld [ %g1 + 0x394 ], %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; 200a340: 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; 200a344: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a348: 7f ff df 94 call 2002198 200a34c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a350: 81 c7 e0 08 ret 200a354: 81 e8 00 00 restore =============================================================================== 0200b35c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b35c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b360: 7f ff dd ae call 2002a18 200b364: 01 00 00 00 nop 200b368: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200b36c: 11 00 80 70 sethi %hi(0x201c000), %o0 200b370: 94 10 00 19 mov %i1, %o2 200b374: 92 10 00 18 mov %i0, %o1 200b378: 7f ff e4 c3 call 2004684 200b37c: 90 12 22 68 or %o0, 0x268, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b380: 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 ); 200b384: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200b388: 80 a7 00 19 cmp %i4, %i1 200b38c: 02 80 00 0f be 200b3c8 <_Watchdog_Report_chain+0x6c> 200b390: 11 00 80 70 sethi %hi(0x201c000), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b394: 92 10 00 1c mov %i4, %o1 200b398: 40 00 00 0f call 200b3d4 <_Watchdog_Report> 200b39c: 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 ) 200b3a0: 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 ) ; 200b3a4: 80 a7 00 19 cmp %i4, %i1 200b3a8: 12 bf ff fc bne 200b398 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b3ac: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b3b0: 11 00 80 70 sethi %hi(0x201c000), %o0 200b3b4: 92 10 00 18 mov %i0, %o1 200b3b8: 7f ff e4 b3 call 2004684 200b3bc: 90 12 22 80 or %o0, 0x280, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b3c0: 7f ff dd 9a call 2002a28 200b3c4: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b3c8: 7f ff e4 af call 2004684 200b3cc: 90 12 22 90 or %o0, 0x290, %o0 200b3d0: 30 bf ff fc b,a 200b3c0 <_Watchdog_Report_chain+0x64> =============================================================================== 02007144 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007144: 9d e3 bf 98 save %sp, -104, %sp 2007148: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 200714c: 40 00 01 80 call 200774c <_Chain_Get> 2007150: 90 10 00 1d mov %i5, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2007154: 92 10 20 00 clr %o1 2007158: b8 10 00 08 mov %o0, %i4 200715c: 94 10 00 1a mov %i2, %o2 2007160: 90 10 00 19 mov %i1, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007164: 80 a7 20 00 cmp %i4, 0 2007168: 12 80 00 0a bne 2007190 200716c: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2007170: 7f ff fc f4 call 2006540 2007174: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2007178: 80 a2 20 00 cmp %o0, 0 200717c: 02 bf ff f4 be 200714c <== NEVER TAKEN 2007180: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 2007184: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007188: 81 c7 e0 08 ret 200718c: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2007190: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2007194: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2007198: 81 c7 e0 08 ret 200719c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007dc0 : rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007dc0: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007dc4: 03 00 80 67 sethi %hi(0x2019c00), %g1 2007dc8: c4 00 61 44 ld [ %g1 + 0x144 ], %g2 ! 2019d44 <_Per_CPU_Information+0x8> rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007dcc: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2007dd0: 03 00 80 67 sethi %hi(0x2019c00), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2007dd4: 88 10 20 12 mov 0x12, %g4 rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007dd8: 80 a0 a0 00 cmp %g2, 0 2007ddc: 02 80 00 04 be 2007dec 2007de0: de 00 61 d4 ld [ %g1 + 0x1d4 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007de4: 81 c7 e0 08 ret 2007de8: 91 e8 00 04 restore %g0, %g4, %o0 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 2007dec: 80 a6 a0 00 cmp %i2, 0 2007df0: 02 80 00 40 be 2007ef0 2007df4: 80 a6 60 00 cmp %i1, 0 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 2007df8: 02 80 00 3e be 2007ef0 2007dfc: de 26 80 00 st %o7, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e00: c4 06 40 00 ld [ %i1 ], %g2 2007e04: 80 a0 a0 00 cmp %g2, 0 2007e08: 22 80 00 37 be,a 2007ee4 2007e0c: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 2007e10: 80 a3 c0 18 cmp %o7, %i0 2007e14: 08 bf ff f4 bleu 2007de4 2007e18: 88 10 20 0a mov 0xa, %g4 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007e1c: 05 00 80 66 sethi %hi(0x2019800), %g2 2007e20: c8 00 a3 10 ld [ %g2 + 0x310 ], %g4 ! 2019b10 <_Thread_Dispatch_disable_level> 2007e24: 88 01 20 01 inc %g4 2007e28: c8 20 a3 10 st %g4, [ %g2 + 0x310 ] return _Thread_Dispatch_disable_level; 2007e2c: c4 00 a3 10 ld [ %g2 + 0x310 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2007e30: 80 a6 20 00 cmp %i0, 0 2007e34: 12 80 00 32 bne 2007efc 2007e38: 1f 00 80 67 sethi %hi(0x2019c00), %o7 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2007e3c: c8 00 61 d4 ld [ %g1 + 0x1d4 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2007e40: 80 a1 20 00 cmp %g4, 0 2007e44: 02 80 00 45 be 2007f58 <== NEVER TAKEN 2007e48: c2 03 e1 d8 ld [ %o7 + 0x1d8 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2007e4c: 10 80 00 06 b 2007e64 2007e50: 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 ) { 2007e54: 80 a6 00 04 cmp %i0, %g4 2007e58: 02 80 00 35 be 2007f2c 2007e5c: 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; 2007e60: c4 00 40 00 ld [ %g1 ], %g2 2007e64: 80 a0 a0 00 cmp %g2, 0 2007e68: 32 bf ff fb bne,a 2007e54 2007e6c: b0 06 20 01 inc %i0 2007e70: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007e74: 80 a0 a0 00 cmp %g2, 0 2007e78: 32 bf ff f7 bne,a 2007e54 2007e7c: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007e80: f0 26 80 00 st %i0, [ %i2 ] 2007e84: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2007e88: 80 a1 00 18 cmp %g4, %i0 2007e8c: 02 80 00 29 be 2007f30 <== NEVER TAKEN 2007e90: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007e94: c8 00 c0 00 ld [ %g3 ], %g4 2007e98: c4 03 e1 d8 ld [ %o7 + 0x1d8 ], %g2 2007e9c: 82 23 40 01 sub %o5, %g1, %g1 2007ea0: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2007ea4: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2007ea8: 82 00 80 01 add %g2, %g1, %g1 2007eac: c8 20 60 04 st %g4, [ %g1 + 4 ] 2007eb0: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007eb4: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007eb8: c4 20 60 08 st %g2, [ %g1 + 8 ] 2007ebc: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2007ec0: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2007ec4: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2007ec8: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2007ecc: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2007ed0: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2007ed4: 40 00 07 e3 call 2009e60 <_Thread_Enable_dispatch> 2007ed8: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2007edc: 40 00 20 ff call 20102d8 2007ee0: 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; 2007ee4: 80 a0 a0 00 cmp %g2, 0 2007ee8: 12 bf ff cb bne 2007e14 2007eec: 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; 2007ef0: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2007ef4: 81 c7 e0 08 ret 2007ef8: 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; 2007efc: c8 03 e1 d8 ld [ %o7 + 0x1d8 ], %g4 2007f00: 83 2e 20 03 sll %i0, 3, %g1 2007f04: 9b 2e 20 05 sll %i0, 5, %o5 2007f08: 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; 2007f0c: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2007f10: 80 a3 20 00 cmp %o4, 0 2007f14: 02 80 00 0b be 2007f40 2007f18: 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(); 2007f1c: 40 00 07 d1 call 2009e60 <_Thread_Enable_dispatch> 2007f20: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2007f24: 10 bf ff b0 b 2007de4 2007f28: 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; 2007f2c: 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(); 2007f30: 40 00 07 cc call 2009e60 <_Thread_Enable_dispatch> 2007f34: 01 00 00 00 nop return sc; 2007f38: 10 bf ff ab b 2007de4 2007f3c: 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; 2007f40: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2007f44: 80 a0 a0 00 cmp %g2, 0 2007f48: 12 bf ff f5 bne 2007f1c 2007f4c: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2007f50: 10 bf ff d1 b 2007e94 2007f54: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2007f58: 10 bf ff f6 b 2007f30 <== NOT EXECUTED 2007f5c: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 020094a8 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 20094a8: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 20094ac: 80 a6 20 00 cmp %i0, 0 20094b0: 02 80 00 23 be 200953c <== NEVER TAKEN 20094b4: 37 00 80 7b sethi %hi(0x201ec00), %i3 20094b8: b6 16 e0 ac or %i3, 0xac, %i3 ! 201ecac <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 20094bc: b4 06 e0 0c add %i3, 0xc, %i2 if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) 20094c0: c2 06 c0 00 ld [ %i3 ], %g1 20094c4: 80 a0 60 00 cmp %g1, 0 20094c8: 22 80 00 1a be,a 2009530 20094cc: b6 06 e0 04 add %i3, 4, %i3 continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 20094d0: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 20094d4: 80 a7 20 00 cmp %i4, 0 20094d8: 22 80 00 16 be,a 2009530 20094dc: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 20094e0: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 20094e4: 84 90 60 00 orcc %g1, 0, %g2 20094e8: 22 80 00 12 be,a 2009530 <== NEVER TAKEN 20094ec: b6 06 e0 04 add %i3, 4, %i3 <== NOT EXECUTED 20094f0: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 20094f4: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 20094f8: 83 2f 60 02 sll %i5, 2, %g1 20094fc: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 2009500: 90 90 60 00 orcc %g1, 0, %o0 2009504: 02 80 00 05 be 2009518 2009508: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 200950c: 9f c6 00 00 call %i0 2009510: 01 00 00 00 nop 2009514: 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++ ) { 2009518: 83 28 a0 10 sll %g2, 0x10, %g1 200951c: 83 30 60 10 srl %g1, 0x10, %g1 2009520: 80 a0 40 1d cmp %g1, %i5 2009524: 3a bf ff f5 bcc,a 20094f8 2009528: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200952c: 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++ ) { 2009530: 80 a6 c0 1a cmp %i3, %i2 2009534: 32 bf ff e4 bne,a 20094c4 2009538: c2 06 c0 00 ld [ %i3 ], %g1 200953c: 81 c7 e0 08 ret 2009540: 81 e8 00 00 restore =============================================================================== 02008148 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 2008148: 9d e3 bf a0 save %sp, -96, %sp 200814c: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 2008150: 80 a6 a0 00 cmp %i2, 0 2008154: 02 80 00 21 be 20081d8 2008158: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 200815c: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 2008160: 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 ); 2008164: 40 00 07 5a call 2009ecc <_Objects_Get_information> 2008168: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 200816c: 80 a2 20 00 cmp %o0, 0 2008170: 02 80 00 1a be 20081d8 2008174: 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; 2008178: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 200817c: 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; 2008180: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008184: 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; 2008188: 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; 200818c: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008190: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 2008194: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2008198: 80 a1 20 00 cmp %g4, 0 200819c: 02 80 00 0d be 20081d0 <== NEVER TAKEN 20081a0: 84 10 20 00 clr %g2 20081a4: de 02 20 1c ld [ %o0 + 0x1c ], %o7 20081a8: 86 10 20 01 mov 1, %g3 20081ac: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 20081b0: 87 28 e0 02 sll %g3, 2, %g3 20081b4: 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++ ) 20081b8: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 20081bc: 80 a0 00 03 cmp %g0, %g3 20081c0: 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++ ) 20081c4: 80 a1 00 01 cmp %g4, %g1 20081c8: 1a bf ff fa bcc 20081b0 20081cc: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 20081d0: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 20081d4: b0 10 20 00 clr %i0 } 20081d8: 81 c7 e0 08 ret 20081dc: 81 e8 00 00 restore =============================================================================== 02013db8 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2013db8: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013dbc: 80 a6 20 00 cmp %i0, 0 2013dc0: 12 80 00 04 bne 2013dd0 2013dc4: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013dc8: 81 c7 e0 08 ret 2013dcc: 91 e8 00 01 restore %g0, %g1, %o0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) return RTEMS_INVALID_NAME; if ( !starting_address ) 2013dd0: 80 a6 60 00 cmp %i1, 0 2013dd4: 02 bf ff fd be 2013dc8 2013dd8: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013ddc: 80 a7 60 00 cmp %i5, 0 2013de0: 02 bf ff fa be 2013dc8 <== NEVER TAKEN 2013de4: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013de8: 02 bf ff f8 be 2013dc8 2013dec: 82 10 20 08 mov 8, %g1 2013df0: 80 a6 a0 00 cmp %i2, 0 2013df4: 02 bf ff f5 be 2013dc8 2013df8: 80 a6 80 1b cmp %i2, %i3 2013dfc: 0a bf ff f3 bcs 2013dc8 2013e00: 80 8e e0 07 btst 7, %i3 2013e04: 12 bf ff f1 bne 2013dc8 2013e08: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2013e0c: 12 bf ff ef bne 2013dc8 2013e10: 82 10 20 09 mov 9, %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2013e14: 03 00 80 f1 sethi %hi(0x203c400), %g1 2013e18: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 ! 203c450 <_Thread_Dispatch_disable_level> 2013e1c: 84 00 a0 01 inc %g2 2013e20: c4 20 60 50 st %g2, [ %g1 + 0x50 ] return _Thread_Dispatch_disable_level; 2013e24: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 * This function allocates a partition control block from * the inactive chain of free partition control blocks. */ RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void ) { return (Partition_Control *) _Objects_Allocate( &_Partition_Information ); 2013e28: 23 00 80 f0 sethi %hi(0x203c000), %l1 2013e2c: 40 00 13 04 call 2018a3c <_Objects_Allocate> 2013e30: 90 14 62 64 or %l1, 0x264, %o0 ! 203c264 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2013e34: a0 92 20 00 orcc %o0, 0, %l0 2013e38: 02 80 00 1a be 2013ea0 2013e3c: 92 10 00 1b mov %i3, %o1 #endif the_partition->starting_address = starting_address; the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; 2013e40: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2013e44: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2013e48: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2013e4c: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2013e50: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2013e54: 40 00 61 ab call 202c500 <.udiv> 2013e58: 90 10 00 1a mov %i2, %o0 the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 2013e5c: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2013e60: 94 10 00 08 mov %o0, %o2 the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 2013e64: 96 10 00 1b mov %i3, %o3 2013e68: b8 04 20 24 add %l0, 0x24, %i4 2013e6c: 40 00 0c bd call 2017160 <_Chain_Initialize> 2013e70: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e74: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2013e78: a2 14 62 64 or %l1, 0x264, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e7c: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2013e80: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013e84: 85 28 a0 02 sll %g2, 2, %g2 2013e88: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2013e8c: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2013e90: 40 00 17 f9 call 2019e74 <_Thread_Enable_dispatch> 2013e94: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2013e98: 10 bf ff cc b 2013dc8 2013e9c: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2013ea0: 40 00 17 f5 call 2019e74 <_Thread_Enable_dispatch> 2013ea4: 01 00 00 00 nop return RTEMS_TOO_MANY; 2013ea8: 10 bf ff c8 b 2013dc8 2013eac: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 020075c8 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 20075c8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get ( Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) 20075cc: 11 00 80 77 sethi %hi(0x201dc00), %o0 20075d0: 92 10 00 18 mov %i0, %o1 20075d4: 90 12 23 64 or %o0, 0x364, %o0 20075d8: 40 00 09 4a call 2009b00 <_Objects_Get> 20075dc: 94 07 bf fc add %fp, -4, %o2 rtems_rate_monotonic_period_states local_state; ISR_Level level; the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 20075e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20075e4: 80 a0 60 00 cmp %g1, 0 20075e8: 12 80 00 0d bne 200761c 20075ec: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 20075f0: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20075f4: 39 00 80 78 sethi %hi(0x201e000), %i4 20075f8: b8 17 22 fc or %i4, 0x2fc, %i4 ! 201e2fc <_Per_CPU_Information> 20075fc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2007600: 80 a0 80 01 cmp %g2, %g1 2007604: 02 80 00 08 be 2007624 2007608: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 200760c: 40 00 0c f0 call 200a9cc <_Thread_Enable_dispatch> 2007610: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2007614: 81 c7 e0 08 ret 2007618: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200761c: 81 c7 e0 08 ret 2007620: 91 e8 20 04 restore %g0, 4, %o0 if ( !_Thread_Is_executing( the_period->owner ) ) { _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { 2007624: 12 80 00 0e bne 200765c 2007628: 01 00 00 00 nop switch ( the_period->state ) { 200762c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007630: 80 a0 60 04 cmp %g1, 4 2007634: 18 80 00 06 bgu 200764c <== NEVER TAKEN 2007638: b0 10 20 00 clr %i0 200763c: 83 28 60 02 sll %g1, 2, %g1 2007640: 05 00 80 6f sethi %hi(0x201bc00), %g2 2007644: 84 10 a3 ac or %g2, 0x3ac, %g2 ! 201bfac 2007648: f0 00 80 01 ld [ %g2 + %g1 ], %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 200764c: 40 00 0c e0 call 200a9cc <_Thread_Enable_dispatch> 2007650: 01 00 00 00 nop return RTEMS_TIMEOUT; 2007654: 81 c7 e0 08 ret 2007658: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 200765c: 7f ff ed e3 call 2002de8 2007660: 01 00 00 00 nop 2007664: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2007668: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 200766c: 80 a6 e0 00 cmp %i3, 0 2007670: 02 80 00 14 be 20076c0 2007674: 80 a6 e0 02 cmp %i3, 2 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 2007678: 02 80 00 29 be 200771c 200767c: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2007680: 12 bf ff e5 bne 2007614 <== NEVER TAKEN 2007684: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2007688: 7f ff ff 92 call 20074d0 <_Rate_monotonic_Update_statistics> 200768c: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 2007690: 7f ff ed da call 2002df8 2007694: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007698: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200769c: 92 07 60 10 add %i5, 0x10, %o1 20076a0: 11 00 80 78 sethi %hi(0x201e000), %o0 the_period->next_length = length; 20076a4: f2 27 60 3c st %i1, [ %i5 + 0x3c ] 20076a8: 90 12 21 94 or %o0, 0x194, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 20076ac: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076b0: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076b4: 40 00 10 f8 call 200ba94 <_Watchdog_Insert> 20076b8: b0 10 20 06 mov 6, %i0 20076bc: 30 bf ff e4 b,a 200764c return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 20076c0: 7f ff ed ce call 2002df8 20076c4: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20076c8: 7f ff ff 68 call 2007468 <_Rate_monotonic_Initiate_statistics> 20076cc: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20076d0: 82 10 20 02 mov 2, %g1 20076d4: 92 07 60 10 add %i5, 0x10, %o1 20076d8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20076dc: 11 00 80 78 sethi %hi(0x201e000), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076e0: 03 00 80 1e sethi %hi(0x2007800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076e4: 90 12 21 94 or %o0, 0x194, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076e8: 82 10 62 70 or %g1, 0x270, %g1 the_watchdog->id = id; 20076ec: f0 27 60 30 st %i0, [ %i5 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20076f0: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20076f4: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 20076f8: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 20076fc: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007700: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007704: 40 00 10 e4 call 200ba94 <_Watchdog_Insert> 2007708: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 200770c: 40 00 0c b0 call 200a9cc <_Thread_Enable_dispatch> 2007710: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2007714: 81 c7 e0 08 ret 2007718: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 200771c: 7f ff ff 6d call 20074d0 <_Rate_monotonic_Update_statistics> 2007720: 90 10 00 1d mov %i5, %o0 /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 2007724: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007728: f2 27 60 3c st %i1, [ %i5 + 0x3c ] /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 200772c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007730: 7f ff ed b2 call 2002df8 2007734: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007738: c2 07 20 0c ld [ %i4 + 0xc ], %g1 200773c: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007740: 90 10 00 01 mov %g1, %o0 2007744: 13 00 00 10 sethi %hi(0x4000), %o1 2007748: 40 00 0e f2 call 200b310 <_Thread_Set_state> 200774c: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007750: 7f ff ed a6 call 2002de8 2007754: 01 00 00 00 nop local_state = the_period->state; 2007758: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 200775c: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007760: 7f ff ed a6 call 2002df8 2007764: 01 00 00 00 nop /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) 2007768: 80 a6 a0 03 cmp %i2, 3 200776c: 22 80 00 06 be,a 2007784 2007770: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 2007774: 40 00 0c 96 call 200a9cc <_Thread_Enable_dispatch> 2007778: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200777c: 81 c7 e0 08 ret 2007780: 81 e8 00 00 restore /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007784: 40 00 0b 9f call 200a600 <_Thread_Clear_state> 2007788: 13 00 00 10 sethi %hi(0x4000), %o1 200778c: 30 bf ff fa b,a 2007774 =============================================================================== 02007790 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007790: 9d e3 bf 38 save %sp, -200, %sp rtems_id id; rtems_rate_monotonic_period_statistics the_stats; rtems_rate_monotonic_period_status the_status; char name[5]; if ( !print ) 2007794: 80 a6 60 00 cmp %i1, 0 2007798: 02 80 00 48 be 20078b8 <== NEVER TAKEN 200779c: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 20077a0: 13 00 80 6f sethi %hi(0x201bc00), %o1 20077a4: 9f c6 40 00 call %i1 20077a8: 92 12 63 c0 or %o1, 0x3c0, %o1 ! 201bfc0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 20077ac: 90 10 00 18 mov %i0, %o0 20077b0: 13 00 80 6f sethi %hi(0x201bc00), %o1 20077b4: 9f c6 40 00 call %i1 20077b8: 92 12 63 e0 or %o1, 0x3e0, %o1 ! 201bfe0 (*print)( context, "--- Wall times are in seconds ---\n" ); 20077bc: 90 10 00 18 mov %i0, %o0 20077c0: 13 00 80 70 sethi %hi(0x201c000), %o1 20077c4: 9f c6 40 00 call %i1 20077c8: 92 12 60 08 or %o1, 8, %o1 ! 201c008 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 20077cc: 90 10 00 18 mov %i0, %o0 20077d0: 13 00 80 70 sethi %hi(0x201c000), %o1 20077d4: 9f c6 40 00 call %i1 20077d8: 92 12 60 30 or %o1, 0x30, %o1 ! 201c030 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 20077dc: 90 10 00 18 mov %i0, %o0 20077e0: 13 00 80 70 sethi %hi(0x201c000), %o1 20077e4: 9f c6 40 00 call %i1 20077e8: 92 12 60 80 or %o1, 0x80, %o1 ! 201c080 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20077ec: 39 00 80 77 sethi %hi(0x201dc00), %i4 20077f0: b8 17 23 64 or %i4, 0x364, %i4 ! 201df64 <_Rate_monotonic_Information> 20077f4: fa 07 20 08 ld [ %i4 + 8 ], %i5 20077f8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20077fc: 80 a7 40 01 cmp %i5, %g1 2007800: 18 80 00 2e bgu 20078b8 <== NEVER TAKEN 2007804: 35 00 80 70 sethi %hi(0x201c000), %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 2007808: 23 00 80 70 sethi %hi(0x201c000), %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 200780c: 21 00 80 70 sethi %hi(0x201c000), %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007810: 37 00 80 6c sethi %hi(0x201b000), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007814: b4 16 a0 d0 or %i2, 0xd0, %i2 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 2007818: a2 14 60 e8 or %l1, 0xe8, %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 200781c: a0 14 21 08 or %l0, 0x108, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007820: 10 80 00 06 b 2007838 2007824: b6 16 e2 30 or %i3, 0x230, %i3 * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2007828: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 200782c: 80 a0 40 1d cmp %g1, %i5 2007830: 0a 80 00 22 bcs 20078b8 2007834: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007838: 90 10 00 1d mov %i5, %o0 200783c: 40 00 19 44 call 200dd4c 2007840: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 2007844: 80 a2 20 00 cmp %o0, 0 2007848: 32 bf ff f8 bne,a 2007828 200784c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 #if defined(RTEMS_DEBUG) status = rtems_rate_monotonic_get_status( id, &the_status ); if ( status != RTEMS_SUCCESSFUL ) continue; #else (void) rtems_rate_monotonic_get_status( id, &the_status ); 2007850: 92 07 bf d8 add %fp, -40, %o1 2007854: 40 00 19 6d call 200de08 2007858: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 200785c: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007860: 92 10 20 05 mov 5, %o1 2007864: 40 00 00 b4 call 2007b34 2007868: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200786c: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2007870: 92 10 00 1a mov %i2, %o1 2007874: 94 10 00 1d mov %i5, %o2 2007878: 90 10 00 18 mov %i0, %o0 200787c: 9f c6 40 00 call %i1 2007880: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007884: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2007888: 94 07 bf f0 add %fp, -16, %o2 200788c: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007890: 80 a0 60 00 cmp %g1, 0 2007894: 12 80 00 0b bne 20078c0 2007898: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 200789c: 9f c6 40 00 call %i1 20078a0: 90 10 00 18 mov %i0, %o0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20078a4: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20078a8: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20078ac: 80 a0 40 1d cmp %g1, %i5 20078b0: 1a bf ff e3 bcc 200783c <== ALWAYS TAKEN 20078b4: 90 10 00 1d mov %i5, %o0 20078b8: 81 c7 e0 08 ret 20078bc: 81 e8 00 00 restore struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 20078c0: 40 00 0f 39 call 200b5a4 <_Timespec_Divide_by_integer> 20078c4: 92 10 00 01 mov %g1, %o1 (*print)( context, 20078c8: d0 07 bf ac ld [ %fp + -84 ], %o0 20078cc: 40 00 46 46 call 20191e4 <.div> 20078d0: 92 10 23 e8 mov 0x3e8, %o1 20078d4: aa 10 00 08 mov %o0, %l5 20078d8: d0 07 bf b4 ld [ %fp + -76 ], %o0 20078dc: 40 00 46 42 call 20191e4 <.div> 20078e0: 92 10 23 e8 mov 0x3e8, %o1 20078e4: c2 07 bf f0 ld [ %fp + -16 ], %g1 20078e8: a6 10 00 08 mov %o0, %l3 20078ec: d0 07 bf f4 ld [ %fp + -12 ], %o0 20078f0: e4 07 bf a8 ld [ %fp + -88 ], %l2 20078f4: e8 07 bf b0 ld [ %fp + -80 ], %l4 20078f8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20078fc: 40 00 46 3a call 20191e4 <.div> 2007900: 92 10 23 e8 mov 0x3e8, %o1 2007904: 96 10 00 15 mov %l5, %o3 2007908: 98 10 00 14 mov %l4, %o4 200790c: 9a 10 00 13 mov %l3, %o5 2007910: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007914: 92 10 00 11 mov %l1, %o1 2007918: 94 10 00 12 mov %l2, %o2 200791c: 9f c6 40 00 call %i1 2007920: 90 10 00 18 mov %i0, %o0 struct timespec wall_average; struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); 2007924: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007928: 94 07 bf f0 add %fp, -16, %o2 200792c: 40 00 0f 1e call 200b5a4 <_Timespec_Divide_by_integer> 2007930: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2007934: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007938: 40 00 46 2b call 20191e4 <.div> 200793c: 92 10 23 e8 mov 0x3e8, %o1 2007940: a8 10 00 08 mov %o0, %l4 2007944: d0 07 bf cc ld [ %fp + -52 ], %o0 2007948: 40 00 46 27 call 20191e4 <.div> 200794c: 92 10 23 e8 mov 0x3e8, %o1 2007950: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007954: a4 10 00 08 mov %o0, %l2 2007958: d0 07 bf f4 ld [ %fp + -12 ], %o0 200795c: ea 07 bf c0 ld [ %fp + -64 ], %l5 2007960: e6 07 bf c8 ld [ %fp + -56 ], %l3 2007964: 92 10 23 e8 mov 0x3e8, %o1 2007968: 40 00 46 1f call 20191e4 <.div> 200796c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007970: 92 10 00 10 mov %l0, %o1 2007974: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007978: 94 10 00 15 mov %l5, %o2 200797c: 90 10 00 18 mov %i0, %o0 2007980: 96 10 00 14 mov %l4, %o3 2007984: 98 10 00 13 mov %l3, %o4 2007988: 9f c6 40 00 call %i1 200798c: 9a 10 00 12 mov %l2, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2007990: 10 bf ff a6 b 2007828 2007994: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 020079b0 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 20079b0: 9d e3 bf a0 save %sp, -96, %sp /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20079b4: 03 00 80 78 sethi %hi(0x201e000), %g1 20079b8: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e0d0 <_Thread_Dispatch_disable_level> 20079bc: 84 00 a0 01 inc %g2 20079c0: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 20079c4: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079c8: 39 00 80 77 sethi %hi(0x201dc00), %i4 20079cc: b8 17 23 64 or %i4, 0x364, %i4 ! 201df64 <_Rate_monotonic_Information> 20079d0: fa 07 20 08 ld [ %i4 + 8 ], %i5 20079d4: c2 07 20 0c ld [ %i4 + 0xc ], %g1 20079d8: 80 a7 40 01 cmp %i5, %g1 20079dc: 18 80 00 09 bgu 2007a00 <== NEVER TAKEN 20079e0: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 20079e4: 40 00 00 09 call 2007a08 20079e8: 90 10 00 1d mov %i5, %o0 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079ec: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20079f0: ba 07 60 01 inc %i5 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 20079f4: 80 a0 40 1d cmp %g1, %i5 20079f8: 1a bf ff fb bcc 20079e4 20079fc: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2007a00: 40 00 0b f3 call 200a9cc <_Thread_Enable_dispatch> 2007a04: 81 e8 00 00 restore =============================================================================== 02015374 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2015374: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 2015378: 80 a6 60 00 cmp %i1, 0 201537c: 12 80 00 04 bne 201538c 2015380: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015384: 81 c7 e0 08 ret 2015388: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 201538c: 90 10 00 18 mov %i0, %o0 2015390: 40 00 12 c5 call 2019ea4 <_Thread_Get> 2015394: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2015398: c2 07 bf fc ld [ %fp + -4 ], %g1 201539c: 80 a0 60 00 cmp %g1, 0 20153a0: 12 80 00 20 bne 2015420 20153a4: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20153a8: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 20153ac: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20153b0: 80 a0 60 00 cmp %g1, 0 20153b4: 02 80 00 1e be 201542c 20153b8: 01 00 00 00 nop if ( asr->is_enabled ) { 20153bc: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 20153c0: 80 a0 60 00 cmp %g1, 0 20153c4: 02 80 00 1e be 201543c 20153c8: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 20153cc: 7f ff e6 93 call 200ee18 20153d0: 01 00 00 00 nop *signal_set |= signals; 20153d4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20153d8: b2 10 40 19 or %g1, %i1, %i1 20153dc: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 20153e0: 7f ff e6 92 call 200ee28 20153e4: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20153e8: 03 00 80 f1 sethi %hi(0x203c400), %g1 20153ec: 82 10 62 84 or %g1, 0x284, %g1 ! 203c684 <_Per_CPU_Information> 20153f0: c4 00 60 08 ld [ %g1 + 8 ], %g2 20153f4: 80 a0 a0 00 cmp %g2, 0 20153f8: 02 80 00 06 be 2015410 20153fc: 01 00 00 00 nop 2015400: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015404: 80 a7 00 02 cmp %i4, %g2 2015408: 02 80 00 15 be 201545c <== ALWAYS TAKEN 201540c: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015410: 40 00 12 99 call 2019e74 <_Thread_Enable_dispatch> 2015414: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2015418: 10 bf ff db b 2015384 201541c: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2015420: 82 10 20 04 mov 4, %g1 } 2015424: 81 c7 e0 08 ret 2015428: 91 e8 00 01 restore %g0, %g1, %o0 _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 201542c: 40 00 12 92 call 2019e74 <_Thread_Enable_dispatch> 2015430: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2015434: 10 bf ff d4 b 2015384 2015438: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201543c: 7f ff e6 77 call 200ee18 2015440: 01 00 00 00 nop *signal_set |= signals; 2015444: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2015448: b2 10 40 19 or %g1, %i1, %i1 201544c: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2015450: 7f ff e6 76 call 200ee28 2015454: 01 00 00 00 nop 2015458: 30 bf ff ee b,a 2015410 if ( ! _ASR_Is_null_handler( asr->handler ) ) { if ( asr->is_enabled ) { _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; 201545c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015460: 30 bf ff ec b,a 2015410 =============================================================================== 0200e4c0 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200e4c0: 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 ) 200e4c4: 80 a6 a0 00 cmp %i2, 0 200e4c8: 02 80 00 3b be 200e5b4 200e4cc: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200e4d0: 21 00 80 71 sethi %hi(0x201c400), %l0 200e4d4: a0 14 20 ac or %l0, 0xac, %l0 ! 201c4ac <_Per_CPU_Information> 200e4d8: 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; 200e4dc: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e4e0: 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; 200e4e4: 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 ]; 200e4e8: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e4ec: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e4f0: 80 a0 60 00 cmp %g1, 0 200e4f4: 12 80 00 40 bne 200e5f4 200e4f8: 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; 200e4fc: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 200e500: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e504: 7f ff f0 8d call 200a738 <_CPU_ISR_Get_level> 200e508: 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; 200e50c: a3 2c 60 0a sll %l1, 0xa, %l1 200e510: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200e514: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e518: 80 8e 61 00 btst 0x100, %i1 200e51c: 02 80 00 06 be 200e534 200e520: 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; 200e524: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200e528: 80 a0 00 01 cmp %g0, %g1 200e52c: 82 60 3f ff subx %g0, -1, %g1 200e530: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200e534: 80 8e 62 00 btst 0x200, %i1 200e538: 12 80 00 21 bne 200e5bc 200e53c: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e540: 80 8e 60 0f btst 0xf, %i1 200e544: 12 80 00 27 bne 200e5e0 200e548: 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 ) { 200e54c: 80 8e 64 00 btst 0x400, %i1 200e550: 02 80 00 14 be 200e5a0 200e554: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e558: 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; 200e55c: 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( 200e560: 80 a0 00 18 cmp %g0, %i0 200e564: 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 ) { 200e568: 80 a0 80 01 cmp %g2, %g1 200e56c: 22 80 00 0e be,a 200e5a4 200e570: 03 00 80 70 sethi %hi(0x201c000), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200e574: 7f ff cf 05 call 2002188 200e578: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 200e57c: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200e580: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 200e584: 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; 200e588: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200e58c: 7f ff cf 03 call 2002198 200e590: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200e594: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200e598: 80 a0 00 01 cmp %g0, %g1 200e59c: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200e5a0: 03 00 80 70 sethi %hi(0x201c000), %g1 200e5a4: c4 00 63 dc ld [ %g1 + 0x3dc ], %g2 ! 201c3dc <_System_state_Current> 200e5a8: 80 a0 a0 03 cmp %g2, 3 200e5ac: 02 80 00 1f be 200e628 200e5b0: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 200e5b4: 81 c7 e0 08 ret 200e5b8: 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) ) { 200e5bc: 22 bf ff e1 be,a 200e540 200e5c0: c0 27 60 7c clr [ %i5 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200e5c4: 03 00 80 70 sethi %hi(0x201c000), %g1 200e5c8: c2 00 61 e4 ld [ %g1 + 0x1e4 ], %g1 ! 201c1e4 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e5cc: 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; 200e5d0: 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; 200e5d4: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e5d8: 02 bf ff dd be 200e54c 200e5dc: 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 ); 200e5e0: 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 ) ); 200e5e4: 7f ff ce ed call 2002198 200e5e8: 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 ) { 200e5ec: 10 bf ff d9 b 200e550 200e5f0: 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; 200e5f4: 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; 200e5f8: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e5fc: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e600: 7f ff f0 4e call 200a738 <_CPU_ISR_Get_level> 200e604: 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; 200e608: a3 2c 60 0a sll %l1, 0xa, %l1 200e60c: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 200e610: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e614: 80 8e 61 00 btst 0x100, %i1 200e618: 02 bf ff c7 be 200e534 200e61c: 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; 200e620: 10 bf ff c2 b 200e528 200e624: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 200e628: 80 88 e0 ff btst 0xff, %g3 200e62c: 12 80 00 0a bne 200e654 200e630: c4 04 20 0c ld [ %l0 + 0xc ], %g2 200e634: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 200e638: 80 a0 80 03 cmp %g2, %g3 200e63c: 02 bf ff de be 200e5b4 200e640: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200e644: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200e648: 80 a0 a0 00 cmp %g2, 0 200e64c: 02 bf ff da be 200e5b4 <== NEVER TAKEN 200e650: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200e654: 82 10 20 01 mov 1, %g1 ! 1 200e658: 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(); 200e65c: 7f ff ea 7f call 2009058 <_Thread_Dispatch> 200e660: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200e664: 82 10 20 00 clr %g1 ! 0 } 200e668: 81 c7 e0 08 ret 200e66c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200b1ac : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200b1ac: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200b1b0: 80 a6 60 00 cmp %i1, 0 200b1b4: 02 80 00 07 be 200b1d0 200b1b8: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200b1bc: 03 00 80 65 sethi %hi(0x2019400), %g1 200b1c0: c2 08 63 1c ldub [ %g1 + 0x31c ], %g1 ! 201971c */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200b1c4: 80 a6 40 01 cmp %i1, %g1 200b1c8: 18 80 00 1c bgu 200b238 200b1cc: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200b1d0: 80 a6 a0 00 cmp %i2, 0 200b1d4: 02 80 00 19 be 200b238 200b1d8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200b1dc: 40 00 09 ae call 200d894 <_Thread_Get> 200b1e0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b1e4: c2 07 bf fc ld [ %fp + -4 ], %g1 200b1e8: 80 a0 60 00 cmp %g1, 0 200b1ec: 12 80 00 13 bne 200b238 200b1f0: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b1f4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b1f8: 80 a6 60 00 cmp %i1, 0 200b1fc: 02 80 00 0d be 200b230 200b200: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b204: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b208: 80 a0 60 00 cmp %g1, 0 200b20c: 02 80 00 06 be 200b224 200b210: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200b214: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b218: 80 a6 40 01 cmp %i1, %g1 200b21c: 1a 80 00 05 bcc 200b230 <== ALWAYS TAKEN 200b220: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200b224: 92 10 00 19 mov %i1, %o1 200b228: 40 00 08 51 call 200d36c <_Thread_Change_priority> 200b22c: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b230: 40 00 09 8d call 200d864 <_Thread_Enable_dispatch> 200b234: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200b238: 81 c7 e0 08 ret 200b23c: 81 e8 00 00 restore =============================================================================== 02007604 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 2007604: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 2007608: 80 a6 60 00 cmp %i1, 0 200760c: 02 80 00 1e be 2007684 2007610: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 2007614: 90 10 00 18 mov %i0, %o0 2007618: 40 00 09 31 call 2009adc <_Thread_Get> 200761c: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007620: c2 07 bf fc ld [ %fp + -4 ], %g1 2007624: 80 a0 60 00 cmp %g1, 0 2007628: 12 80 00 19 bne 200768c 200762c: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2007630: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2007634: 80 a0 60 00 cmp %g1, 0 2007638: 02 80 00 10 be 2007678 200763c: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007640: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007644: 80 a0 80 19 cmp %g2, %i1 2007648: 32 80 00 09 bne,a 200766c 200764c: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2007650: 10 80 00 18 b 20076b0 2007654: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2007658: 80 a0 80 19 cmp %g2, %i1 200765c: 22 80 00 0e be,a 2007694 2007660: c4 02 40 00 ld [ %o1 ], %g2 2007664: 82 10 00 09 mov %o1, %g1 _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; 2007668: d2 00 40 00 ld [ %g1 ], %o1 the_thread = _Thread_Get (tid, &location); switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { 200766c: 80 a2 60 00 cmp %o1, 0 2007670: 32 bf ff fa bne,a 2007658 <== ALWAYS TAKEN 2007674: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2007678: 40 00 09 0d call 2009aac <_Thread_Enable_dispatch> 200767c: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2007680: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007684: 81 c7 e0 08 ret 2007688: 91 e8 00 01 restore %g0, %g1, %o0 200768c: 81 c7 e0 08 ret 2007690: 91 e8 00 01 restore %g0, %g1, %o0 case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; 2007694: c4 20 40 00 st %g2, [ %g1 ] else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); 2007698: 40 00 00 2d call 200774c <_RTEMS_Tasks_Invoke_task_variable_dtor> 200769c: 01 00 00 00 nop _Thread_Enable_dispatch(); 20076a0: 40 00 09 03 call 2009aac <_Thread_Enable_dispatch> 20076a4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20076a8: 10 bf ff f7 b 2007684 20076ac: 82 10 20 00 clr %g1 ! 0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 20076b0: 92 10 00 01 mov %g1, %o1 20076b4: 10 bf ff f9 b 2007698 20076b8: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020076bc : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20076bc: 9d e3 bf 98 save %sp, -104, %sp 20076c0: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 20076c4: 80 a6 60 00 cmp %i1, 0 20076c8: 02 80 00 1b be 2007734 20076cc: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 20076d0: 80 a6 a0 00 cmp %i2, 0 20076d4: 02 80 00 1c be 2007744 20076d8: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20076dc: 40 00 09 00 call 2009adc <_Thread_Get> 20076e0: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20076e4: c2 07 bf fc ld [ %fp + -4 ], %g1 20076e8: 80 a0 60 00 cmp %g1, 0 20076ec: 12 80 00 12 bne 2007734 20076f0: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 20076f4: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 20076f8: 80 a0 60 00 cmp %g1, 0 20076fc: 32 80 00 07 bne,a 2007718 2007700: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007704: 30 80 00 0e b,a 200773c 2007708: 80 a0 60 00 cmp %g1, 0 200770c: 02 80 00 0c be 200773c <== NEVER TAKEN 2007710: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007714: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007718: 80 a0 80 19 cmp %g2, %i1 200771c: 32 bf ff fb bne,a 2007708 2007720: c2 00 40 00 ld [ %g1 ], %g1 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; 2007724: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 2007728: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 200772c: 40 00 08 e0 call 2009aac <_Thread_Enable_dispatch> 2007730: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2007734: 81 c7 e0 08 ret 2007738: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 200773c: 40 00 08 dc call 2009aac <_Thread_Enable_dispatch> 2007740: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 2007744: 81 c7 e0 08 ret 2007748: 81 e8 00 00 restore =============================================================================== 02015dd4 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2015dd4: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015dd8: 11 00 80 f1 sethi %hi(0x203c400), %o0 2015ddc: 92 10 00 18 mov %i0, %o1 2015de0: 90 12 23 14 or %o0, 0x314, %o0 2015de4: 40 00 0c 71 call 2018fa8 <_Objects_Get> 2015de8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015dec: c2 07 bf fc ld [ %fp + -4 ], %g1 2015df0: 80 a0 60 00 cmp %g1, 0 2015df4: 12 80 00 0c bne 2015e24 2015df8: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015dfc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015e00: 80 a0 60 04 cmp %g1, 4 2015e04: 02 80 00 04 be 2015e14 <== NEVER TAKEN 2015e08: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015e0c: 40 00 15 05 call 201b220 <_Watchdog_Remove> 2015e10: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2015e14: 40 00 10 18 call 2019e74 <_Thread_Enable_dispatch> 2015e18: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2015e1c: 81 c7 e0 08 ret 2015e20: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015e24: 81 c7 e0 08 ret 2015e28: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 020162fc : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 20162fc: 9d e3 bf 98 save %sp, -104, %sp Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; 2016300: 03 00 80 f1 sethi %hi(0x203c400), %g1 2016304: fa 00 63 54 ld [ %g1 + 0x354 ], %i5 ! 203c754 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016308: b8 10 00 18 mov %i0, %i4 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 201630c: 80 a7 60 00 cmp %i5, 0 2016310: 02 80 00 32 be 20163d8 2016314: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2016318: 03 00 80 f1 sethi %hi(0x203c400), %g1 201631c: c2 08 60 60 ldub [ %g1 + 0x60 ], %g1 ! 203c460 <_TOD_Is_set> 2016320: 80 a0 60 00 cmp %g1, 0 2016324: 02 80 00 2d be 20163d8 <== NEVER TAKEN 2016328: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 201632c: 80 a6 a0 00 cmp %i2, 0 2016330: 02 80 00 2a be 20163d8 2016334: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2016338: 90 10 00 19 mov %i1, %o0 201633c: 7f ff f3 d5 call 2013290 <_TOD_Validate> 2016340: b0 10 20 14 mov 0x14, %i0 2016344: 80 8a 20 ff btst 0xff, %o0 2016348: 02 80 00 24 be 20163d8 201634c: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2016350: 7f ff f3 9c call 20131c0 <_TOD_To_seconds> 2016354: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2016358: 21 00 80 f1 sethi %hi(0x203c400), %l0 201635c: c2 04 20 dc ld [ %l0 + 0xdc ], %g1 ! 203c4dc <_TOD_Now> 2016360: 80 a2 00 01 cmp %o0, %g1 2016364: 08 80 00 1d bleu 20163d8 2016368: b2 10 00 08 mov %o0, %i1 201636c: 92 10 00 1c mov %i4, %o1 2016370: 11 00 80 f1 sethi %hi(0x203c400), %o0 2016374: 94 07 bf fc add %fp, -4, %o2 2016378: 40 00 0b 0c call 2018fa8 <_Objects_Get> 201637c: 90 12 23 14 or %o0, 0x314, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016380: c2 07 bf fc ld [ %fp + -4 ], %g1 2016384: 80 a0 60 00 cmp %g1, 0 2016388: 12 80 00 16 bne 20163e0 201638c: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2016390: 40 00 13 a4 call 201b220 <_Watchdog_Remove> 2016394: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2016398: c4 04 20 dc ld [ %l0 + 0xdc ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 201639c: c2 07 60 04 ld [ %i5 + 4 ], %g1 20163a0: 92 10 00 18 mov %i0, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20163a4: b2 26 40 02 sub %i1, %g2, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 20163a8: 90 10 00 1d mov %i5, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 20163ac: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20163b0: f4 26 20 2c st %i2, [ %i0 + 0x2c ] 20163b4: c4 26 20 38 st %g2, [ %i0 + 0x38 ] the_watchdog->id = id; 20163b8: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 20163bc: f6 26 20 34 st %i3, [ %i0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20163c0: f2 26 20 1c st %i1, [ %i0 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20163c4: c0 26 20 18 clr [ %i0 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 20163c8: 9f c0 40 00 call %g1 20163cc: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20163d0: 40 00 0e a9 call 2019e74 <_Thread_Enable_dispatch> 20163d4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20163d8: 81 c7 e0 08 ret 20163dc: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20163e0: 81 c7 e0 08 ret 20163e4: 91 e8 20 04 restore %g0, 4, %o0