=============================================================================== 40008f08 <_API_extensions_Add_post_switch>: */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 40008f08: c2 02 00 00 ld [ %o0 ], %g1 40008f0c: 80 a0 60 00 cmp %g1, 0 40008f10: 22 80 00 04 be,a 40008f20 <_API_extensions_Add_post_switch+0x18> 40008f14: c2 02 20 04 ld [ %o0 + 4 ], %g1 40008f18: 81 c3 e0 08 retl 40008f1c: 01 00 00 00 nop 40008f20: 80 a0 60 00 cmp %g1, 0 40008f24: 12 bf ff fd bne 40008f18 <_API_extensions_Add_post_switch+0x10><== NEVER TAKEN 40008f28: 03 10 00 7b sethi %hi(0x4001ec00), %g1 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 40008f2c: 82 10 60 80 or %g1, 0x80, %g1 ! 4001ec80 <_API_extensions_Post_switch_list> 40008f30: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_node->next = tail; 40008f34: 86 00 60 04 add %g1, 4, %g3 tail->previous = the_node; 40008f38: d0 20 60 08 st %o0, [ %g1 + 8 ] ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; the_node->next = tail; 40008f3c: c6 22 00 00 st %g3, [ %o0 ] tail->previous = the_node; old_last->next = the_node; 40008f40: d0 20 80 00 st %o0, [ %g2 ] the_node->previous = old_last; 40008f44: 81 c3 e0 08 retl 40008f48: c4 22 20 04 st %g2, [ %o0 + 4 ] =============================================================================== 40008f4c <_API_extensions_Run_postdriver>: } } #endif void _API_extensions_Run_postdriver( void ) { 40008f4c: 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; 40008f50: 39 10 00 7b sethi %hi(0x4001ec00), %i4 40008f54: fa 07 21 c8 ld [ %i4 + 0x1c8 ], %i5 ! 4001edc8 <_API_extensions_List> 40008f58: b8 17 21 c8 or %i4, 0x1c8, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 40008f5c: b8 07 20 04 add %i4, 4, %i4 40008f60: 80 a7 40 1c cmp %i5, %i4 40008f64: 02 80 00 09 be 40008f88 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 40008f68: 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)(); 40008f6c: c2 07 60 08 ld [ %i5 + 8 ], %g1 40008f70: 9f c0 40 00 call %g1 40008f74: 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 ) { 40008f78: 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 ); 40008f7c: 80 a7 40 1c cmp %i5, %i4 40008f80: 32 bf ff fc bne,a 40008f70 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 40008f84: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 40008f88: 81 c7 e0 08 ret 40008f8c: 81 e8 00 00 restore =============================================================================== 400123c4 <_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 ) { 400123c4: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 400123c8: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 400123cc: f4 26 20 44 st %i2, [ %i0 + 0x44 ] /* * Check if allocated_message_size is aligned to uintptr-size boundary. * If not, it will increase allocated_message_size to multiplicity of pointer * size. */ if (allocated_message_size & (sizeof(uintptr_t) - 1)) { 400123d0: 80 8e e0 03 btst 3, %i3 400123d4: 02 80 00 0b be 40012400 <_CORE_message_queue_Initialize+0x3c> 400123d8: f6 26 20 4c st %i3, [ %i0 + 0x4c ] allocated_message_size += sizeof(uintptr_t); 400123dc: 96 06 e0 04 add %i3, 4, %o3 allocated_message_size &= ~(sizeof(uintptr_t) - 1); 400123e0: 96 0a ff fc and %o3, -4, %o3 /* * Check for an overflow. It can occur while increasing allocated_message_size * to multiplicity of uintptr_t above. */ if (allocated_message_size < maximum_message_size) 400123e4: 80 a6 c0 0b cmp %i3, %o3 400123e8: 08 80 00 08 bleu 40012408 <_CORE_message_queue_Initialize+0x44> 400123ec: ba 02 e0 10 add %o3, 0x10, %i5 return false; 400123f0: b0 10 20 00 clr %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 400123f4: b0 0e 20 01 and %i0, 1, %i0 400123f8: 81 c7 e0 08 ret 400123fc: 81 e8 00 00 restore /* * Check if allocated_message_size is aligned to uintptr-size boundary. * If not, it will increase allocated_message_size to multiplicity of pointer * size. */ if (allocated_message_size & (sizeof(uintptr_t) - 1)) { 40012400: 96 10 00 1b mov %i3, %o3 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 40012404: ba 02 e0 10 add %o3, 0x10, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 40012408: 90 10 20 00 clr %o0 4001240c: 92 10 00 1a mov %i2, %o1 40012410: 94 10 20 00 clr %o2 40012414: 40 00 3f 28 call 400220b4 <__muldi3> 40012418: 96 10 00 1d mov %i5, %o3 if ( x > SIZE_MAX ) 4001241c: 80 a2 20 00 cmp %o0, 0 40012420: 34 bf ff f5 bg,a 400123f4 <_CORE_message_queue_Initialize+0x30> 40012424: b0 10 20 00 clr %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 40012428: 40 00 0c 92 call 40015670 <_Workspace_Allocate> 4001242c: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 40012430: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 40012434: 80 a2 20 00 cmp %o0, 0 40012438: 02 bf ff ee be 400123f0 <_CORE_message_queue_Initialize+0x2c><== NEVER TAKEN 4001243c: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 40012440: 90 06 20 60 add %i0, 0x60, %o0 40012444: 94 10 00 1a mov %i2, %o2 40012448: 7f ff ff c6 call 40012360 <_Chain_Initialize> 4001244c: 96 10 00 1d mov %i5, %o3 */ RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority( CORE_message_queue_Attributes *the_attribute ) { return 40012450: 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 ); 40012454: 82 06 20 50 add %i0, 0x50, %g1 40012458: 84 18 a0 01 xor %g2, 1, %g2 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 4001245c: 80 a0 00 02 cmp %g0, %g2 40012460: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 40012464: 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; 40012468: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 4001246c: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 40012470: c0 26 20 54 clr [ %i0 + 0x54 ] 40012474: 92 60 3f ff subx %g0, -1, %o1 40012478: 94 10 20 80 mov 0x80, %o2 4001247c: 96 10 20 06 mov 6, %o3 40012480: 40 00 0a 2d call 40014d34 <_Thread_queue_Initialize> 40012484: b0 10 20 01 mov 1, %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 40012488: b0 0e 20 01 and %i0, 1, %i0 4001248c: 81 c7 e0 08 ret 40012490: 81 e8 00 00 restore =============================================================================== 400092ac <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 400092ac: 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 ) 400092b0: 3b 10 00 7b sethi %hi(0x4001ec00), %i5 400092b4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 ! 4001ec10 <_Thread_Dispatch_disable_level> 400092b8: 80 a0 60 00 cmp %g1, 0 400092bc: 02 80 00 1f be 40009338 <_CORE_mutex_Seize+0x8c> 400092c0: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 400092c4: 80 a6 a0 00 cmp %i2, 0 400092c8: 02 80 00 2c be 40009378 <_CORE_mutex_Seize+0xcc> 400092cc: 90 10 00 18 mov %i0, %o0 400092d0: 03 10 00 7b sethi %hi(0x4001ec00), %g1 400092d4: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 4001ee0c <_System_state_Current> 400092d8: 80 a0 60 01 cmp %g1, 1 400092dc: 38 80 00 2e bgu,a 40009394 <_CORE_mutex_Seize+0xe8> 400092e0: 90 10 20 00 clr %o0 400092e4: 40 00 12 6a call 4000dc8c <_CORE_mutex_Seize_interrupt_trylock> 400092e8: 92 07 a0 54 add %fp, 0x54, %o1 400092ec: 80 a2 20 00 cmp %o0, 0 400092f0: 02 80 00 27 be 4000938c <_CORE_mutex_Seize+0xe0> <== ALWAYS TAKEN 400092f4: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 400092f8: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 400092fc: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40009300: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 ! 4001ee20 <_Per_CPU_Information+0x10> 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; 40009304: 86 10 20 01 mov 1, %g3 40009308: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 4000930c: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 40009310: f2 20 60 20 st %i1, [ %g1 + 0x20 ] ++level; 40009314: 82 00 a0 01 add %g2, 1, %g1 _Thread_Dispatch_disable_level = level; 40009318: c2 27 60 10 st %g1, [ %i5 + 0x10 ] 4000931c: 7f ff e4 71 call 400024e0 40009320: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40009324: 90 10 00 18 mov %i0, %o0 40009328: 7f ff ff ba call 40009210 <_CORE_mutex_Seize_interrupt_blocking> 4000932c: 92 10 00 1b mov %i3, %o1 40009330: 81 c7 e0 08 ret 40009334: 81 e8 00 00 restore 40009338: 90 10 00 18 mov %i0, %o0 4000933c: 40 00 12 54 call 4000dc8c <_CORE_mutex_Seize_interrupt_trylock> 40009340: 92 07 a0 54 add %fp, 0x54, %o1 40009344: 80 a2 20 00 cmp %o0, 0 40009348: 02 bf ff fa be 40009330 <_CORE_mutex_Seize+0x84> 4000934c: 80 a6 a0 00 cmp %i2, 0 40009350: 12 bf ff ea bne 400092f8 <_CORE_mutex_Seize+0x4c> 40009354: 01 00 00 00 nop 40009358: 7f ff e4 62 call 400024e0 4000935c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40009360: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40009364: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 ! 4001ee20 <_Per_CPU_Information+0x10> 40009368: 84 10 20 01 mov 1, %g2 4000936c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 40009370: 81 c7 e0 08 ret 40009374: 81 e8 00 00 restore 40009378: 40 00 12 45 call 4000dc8c <_CORE_mutex_Seize_interrupt_trylock> 4000937c: 92 07 a0 54 add %fp, 0x54, %o1 40009380: 80 a2 20 00 cmp %o0, 0 40009384: 12 bf ff f5 bne 40009358 <_CORE_mutex_Seize+0xac> <== NEVER TAKEN 40009388: 01 00 00 00 nop 4000938c: 81 c7 e0 08 ret 40009390: 81 e8 00 00 restore 40009394: 92 10 20 00 clr %o1 40009398: 40 00 01 c1 call 40009a9c <_Internal_error_Occurred> 4000939c: 94 10 20 12 mov 0x12, %o2 =============================================================================== 4000951c <_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 ) { 4000951c: 9d e3 bf a0 save %sp, -96, %sp 40009520: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 40009524: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 40009528: 40 00 07 90 call 4000b368 <_Thread_queue_Dequeue> 4000952c: 90 10 00 1d mov %i5, %o0 40009530: 80 a2 20 00 cmp %o0, 0 40009534: 02 80 00 04 be 40009544 <_CORE_semaphore_Surrender+0x28> 40009538: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 4000953c: 81 c7 e0 08 ret 40009540: 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 ); 40009544: 7f ff e3 e3 call 400024d0 40009548: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 4000954c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 40009550: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 40009554: 80 a0 40 02 cmp %g1, %g2 40009558: 1a 80 00 05 bcc 4000956c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 4000955c: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 40009560: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 40009564: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 40009568: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 4000956c: 7f ff e3 dd call 400024e0 40009570: 01 00 00 00 nop } return status; } 40009574: 81 c7 e0 08 ret 40009578: 81 e8 00 00 restore =============================================================================== 400090dc <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 400090dc: 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; 400090e0: 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 ); 400090e4: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 400090e8: 80 a6 a0 00 cmp %i2, 0 400090ec: 02 80 00 13 be 40009138 <_Chain_Initialize+0x5c> <== NEVER TAKEN 400090f0: 92 06 bf ff add %i2, -1, %o1 400090f4: 86 10 00 09 mov %o1, %g3 400090f8: 82 10 00 19 mov %i1, %g1 400090fc: 84 10 00 18 mov %i0, %g2 current->next = next; 40009100: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 40009104: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 40009108: 86 00 ff ff add %g3, -1, %g3 4000910c: 84 10 00 01 mov %g1, %g2 40009110: 80 a0 ff ff cmp %g3, -1 40009114: 12 bf ff fb bne 40009100 <_Chain_Initialize+0x24> 40009118: 82 00 40 1b add %g1, %i3, %g1 #include #include #include #include void _Chain_Initialize( 4000911c: 40 00 3e 70 call 40018adc <.umul> 40009120: 90 10 00 1b mov %i3, %o0 40009124: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 40009128: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 4000912c: d0 26 20 08 st %o0, [ %i0 + 8 ] 40009130: 81 c7 e0 08 ret 40009134: 81 e8 00 00 restore ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 40009138: 10 bf ff fc b 40009128 <_Chain_Initialize+0x4c> <== NOT EXECUTED 4000913c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED =============================================================================== 400080f8 <_Event_Surrender>: rtems_event_set event_in, Event_Control *event, Thread_blocking_operation_States *sync_state, States_Control wait_state ) { 400080f8: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set seized_events; rtems_option option_set; option_set = the_thread->Wait.option; _ISR_Disable( level ); 400080fc: 7f ff e8 f5 call 400024d0 40008100: fa 06 20 30 ld [ %i0 + 0x30 ], %i5 RTEMS_INLINE_ROUTINE void _Event_sets_Post( rtems_event_set the_new_events, rtems_event_set *the_event_set ) { *the_event_set |= the_new_events; 40008104: c2 06 80 00 ld [ %i2 ], %g1 40008108: b2 16 40 01 or %i1, %g1, %i1 4000810c: f2 26 80 00 st %i1, [ %i2 ] _Event_sets_Post( event_in, &event->pending_events ); pending_events = event->pending_events; event_condition = the_thread->Wait.count; 40008110: 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 ) ) { 40008114: 84 8e 40 01 andcc %i1, %g1, %g2 40008118: 02 80 00 35 be 400081ec <_Event_Surrender+0xf4> 4000811c: 07 10 00 7b sethi %hi(0x4001ec00), %g3 /* * 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() && 40008120: 86 10 e2 10 or %g3, 0x210, %g3 ! 4001ee10 <_Per_CPU_Information> 40008124: c8 00 e0 08 ld [ %g3 + 8 ], %g4 40008128: 80 a1 20 00 cmp %g4, 0 4000812c: 32 80 00 1c bne,a 4000819c <_Event_Surrender+0xa4> 40008130: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 RTEMS_INLINE_ROUTINE bool _States_Are_set ( States_Control the_states, States_Control mask ) { return ( (the_states & mask) != STATES_READY); 40008134: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Are_set( the_thread->current_state, wait_state ) ) { 40008138: 80 8f 00 03 btst %i4, %g3 4000813c: 02 80 00 2c be 400081ec <_Event_Surrender+0xf4> 40008140: 80 a0 40 02 cmp %g1, %g2 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 40008144: 02 80 00 04 be 40008154 <_Event_Surrender+0x5c> 40008148: 80 8f 60 02 btst 2, %i5 4000814c: 02 80 00 28 be 400081ec <_Event_Surrender+0xf4> <== NEVER TAKEN 40008150: 01 00 00 00 nop event->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40008154: 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) ); 40008158: b2 2e 40 02 andn %i1, %g2, %i1 /* * Otherwise, this is a normal send to another thread */ if ( _States_Are_set( the_thread->current_state, wait_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { event->pending_events = _Event_sets_Clear( 4000815c: f2 26 80 00 st %i1, [ %i2 ] pending_events, seized_events ); the_thread->Wait.count = 0; 40008160: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40008164: c4 20 40 00 st %g2, [ %g1 ] _ISR_Flash( level ); 40008168: 7f ff e8 de call 400024e0 4000816c: 01 00 00 00 nop 40008170: 7f ff e8 d8 call 400024d0 40008174: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 40008178: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 4000817c: 80 a0 60 02 cmp %g1, 2 40008180: 02 80 00 1d be 400081f4 <_Event_Surrender+0xfc> 40008184: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 40008188: 7f ff e8 d6 call 400024e0 4000818c: 33 04 01 ff sethi %hi(0x1007fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40008190: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 40008194: 40 00 0a b9 call 4000ac78 <_Thread_Clear_state> 40008198: 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() && 4000819c: 80 a6 00 03 cmp %i0, %g3 400081a0: 32 bf ff e6 bne,a 40008138 <_Event_Surrender+0x40> 400081a4: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 _Thread_Is_executing( the_thread ) && ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 400081a8: c6 06 c0 00 ld [ %i3 ], %g3 400081ac: 86 00 ff ff add %g3, -1, %g3 /* * 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 ) && 400081b0: 80 a0 e0 01 cmp %g3, 1 400081b4: 38 bf ff e1 bgu,a 40008138 <_Event_Surrender+0x40> 400081b8: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 400081bc: 80 a0 40 02 cmp %g1, %g2 400081c0: 02 80 00 04 be 400081d0 <_Event_Surrender+0xd8> 400081c4: 80 8f 60 02 btst 2, %i5 400081c8: 02 80 00 09 be 400081ec <_Event_Surrender+0xf4> <== NEVER TAKEN 400081cc: 01 00 00 00 nop event->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 400081d0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 400081d4: b2 2e 40 02 andn %i1, %g2, %i1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { event->pending_events = _Event_sets_Clear( 400081d8: f2 26 80 00 st %i1, [ %i2 ] pending_events, seized_events ); the_thread->Wait.count = 0; 400081dc: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 400081e0: c4 20 40 00 st %g2, [ %g1 ] *sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 400081e4: 82 10 20 03 mov 3, %g1 400081e8: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 400081ec: 7f ff e8 bd call 400024e0 400081f0: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 400081f4: 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 ); 400081f8: 7f ff e8 ba call 400024e0 400081fc: 33 04 01 ff sethi %hi(0x1007fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 40008200: 40 00 0f 19 call 4000be64 <_Watchdog_Remove> 40008204: 90 06 20 48 add %i0, 0x48, %o0 40008208: b2 16 63 f8 or %i1, 0x3f8, %i1 4000820c: 40 00 0a 9b call 4000ac78 <_Thread_Clear_state> 40008210: 81 e8 00 00 restore =============================================================================== 40008214 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *arg ) { 40008214: 9d e3 bf 98 save %sp, -104, %sp ISR_Level level; Thread_blocking_operation_States *sync_state; sync_state = arg; the_thread = _Thread_Get( id, &location ); 40008218: 90 10 00 18 mov %i0, %o0 4000821c: 40 00 0b 90 call 4000b05c <_Thread_Get> 40008220: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40008224: c2 07 bf fc ld [ %fp + -4 ], %g1 40008228: 80 a0 60 00 cmp %g1, 0 4000822c: 12 80 00 15 bne 40008280 <_Event_Timeout+0x6c> <== NEVER TAKEN 40008230: 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 ); 40008234: 7f ff e8 a7 call 400024d0 40008238: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 4000823c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 40008240: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 ! 4001ee20 <_Per_CPU_Information+0x10> 40008244: 80 a7 40 01 cmp %i5, %g1 40008248: 02 80 00 10 be 40008288 <_Event_Timeout+0x74> 4000824c: c0 27 60 24 clr [ %i5 + 0x24 ] if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) *sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 40008250: 82 10 20 06 mov 6, %g1 40008254: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 40008258: 7f ff e8 a2 call 400024e0 4000825c: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40008260: 90 10 00 1d mov %i5, %o0 40008264: 13 04 01 ff sethi %hi(0x1007fc00), %o1 40008268: 40 00 0a 84 call 4000ac78 <_Thread_Clear_state> 4000826c: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1007fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 40008270: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40008274: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 ! 4001ec10 <_Thread_Dispatch_disable_level> --level; 40008278: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 4000827c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 40008280: 81 c7 e0 08 ret 40008284: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 40008288: c2 06 40 00 ld [ %i1 ], %g1 4000828c: 80 a0 60 01 cmp %g1, 1 40008290: 12 bf ff f1 bne 40008254 <_Event_Timeout+0x40> 40008294: 82 10 20 06 mov 6, %g1 *sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 40008298: 82 10 20 02 mov 2, %g1 4000829c: 10 bf ff ed b 40008250 <_Event_Timeout+0x3c> 400082a0: c2 26 40 00 st %g1, [ %i1 ] =============================================================================== 4000ddcc <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 4000ddcc: 9d e3 bf 98 save %sp, -104, %sp Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 4000ddd0: a2 06 60 04 add %i1, 4, %l1 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 4000ddd4: a0 10 00 18 mov %i0, %l0 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 4000ddd8: 80 a6 40 11 cmp %i1, %l1 4000dddc: 18 80 00 85 bgu 4000dff0 <_Heap_Allocate_aligned_with_boundary+0x224> 4000dde0: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 4000dde4: 80 a6 e0 00 cmp %i3, 0 4000dde8: 12 80 00 7c bne 4000dfd8 <_Heap_Allocate_aligned_with_boundary+0x20c> 4000ddec: 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; 4000ddf0: fa 04 20 08 ld [ %l0 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000ddf4: 80 a4 00 1d cmp %l0, %i5 4000ddf8: 02 80 00 18 be 4000de58 <_Heap_Allocate_aligned_with_boundary+0x8c> 4000ddfc: b8 10 20 00 clr %i4 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; 4000de00: ac 10 20 04 mov 4, %l6 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 4000de04: ae 05 60 07 add %l5, 7, %l7 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 4000de08: ac 25 80 19 sub %l6, %i1, %l6 4000de0c: 10 80 00 0b b 4000de38 <_Heap_Allocate_aligned_with_boundary+0x6c> 4000de10: ec 27 bf fc st %l6, [ %fp + -4 ] * 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 ) { 4000de14: 12 80 00 18 bne 4000de74 <_Heap_Allocate_aligned_with_boundary+0xa8> 4000de18: b0 07 60 08 add %i5, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 4000de1c: 80 a6 20 00 cmp %i0, 0 4000de20: 12 80 00 4d bne 4000df54 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN 4000de24: b8 07 20 01 inc %i4 break; } block = block->next; 4000de28: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000de2c: 80 a4 00 1d cmp %l0, %i5 4000de30: 22 80 00 0b be,a 4000de5c <_Heap_Allocate_aligned_with_boundary+0x90> 4000de34: c2 04 20 44 ld [ %l0 + 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 ) { 4000de38: c2 07 60 04 ld [ %i5 + 4 ], %g1 4000de3c: 80 a4 40 01 cmp %l1, %g1 4000de40: 0a bf ff f5 bcs 4000de14 <_Heap_Allocate_aligned_with_boundary+0x48> 4000de44: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 4000de48: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000de4c: 80 a4 00 1d cmp %l0, %i5 4000de50: 12 bf ff fa bne 4000de38 <_Heap_Allocate_aligned_with_boundary+0x6c> 4000de54: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 4000de58: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 4000de5c: 80 a0 40 1c cmp %g1, %i4 4000de60: 1a 80 00 03 bcc 4000de6c <_Heap_Allocate_aligned_with_boundary+0xa0> 4000de64: b0 10 20 00 clr %i0 stats->max_search = search_count; 4000de68: f8 24 20 44 st %i4, [ %l0 + 0x44 ] } return (void *) alloc_begin; 4000de6c: 81 c7 e0 08 ret 4000de70: 81 e8 00 00 restore uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 4000de74: e8 04 20 14 ld [ %l0 + 0x14 ], %l4 - 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; 4000de78: a4 08 7f fe and %g1, -2, %l2 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; 4000de7c: c2 07 bf fc ld [ %fp + -4 ], %g1 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; 4000de80: 84 25 c0 14 sub %l7, %l4, %g2 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; 4000de84: a4 07 40 12 add %i5, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000de88: 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; 4000de8c: b0 00 40 12 add %g1, %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 4000de90: a4 00 80 12 add %g2, %l2, %l2 4000de94: 40 00 2b f8 call 40018e74 <.urem> 4000de98: 90 10 00 18 mov %i0, %o0 4000de9c: 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 ) { 4000dea0: 80 a4 80 18 cmp %l2, %i0 4000dea4: 1a 80 00 06 bcc 4000debc <_Heap_Allocate_aligned_with_boundary+0xf0> 4000dea8: a6 07 60 08 add %i5, 8, %l3 4000deac: 90 10 00 12 mov %l2, %o0 4000deb0: 40 00 2b f1 call 40018e74 <.urem> 4000deb4: 92 10 00 1a mov %i2, %o1 4000deb8: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 4000debc: 80 a6 e0 00 cmp %i3, 0 4000dec0: 02 80 00 37 be 4000df9c <_Heap_Allocate_aligned_with_boundary+0x1d0> 4000dec4: 80 a4 c0 18 cmp %l3, %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; 4000dec8: 86 06 00 19 add %i0, %i1, %g3 4000decc: 92 10 00 1b mov %i3, %o1 4000ded0: 90 10 00 03 mov %g3, %o0 4000ded4: 40 00 2b e8 call 40018e74 <.urem> 4000ded8: c6 27 bf f8 st %g3, [ %fp + -8 ] 4000dedc: c6 07 bf f8 ld [ %fp + -8 ], %g3 4000dee0: 90 20 c0 08 sub %g3, %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 ) { 4000dee4: 80 a6 00 08 cmp %i0, %o0 4000dee8: 1a 80 00 2c bcc 4000df98 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000deec: a4 04 c0 19 add %l3, %i1, %l2 4000def0: 80 a2 00 03 cmp %o0, %g3 4000def4: 2a 80 00 12 bcs,a 4000df3c <_Heap_Allocate_aligned_with_boundary+0x170> 4000def8: 80 a4 80 08 cmp %l2, %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 ) { 4000defc: 10 80 00 28 b 4000df9c <_Heap_Allocate_aligned_with_boundary+0x1d0> 4000df00: 80 a4 c0 18 cmp %l3, %i0 4000df04: 92 10 00 1a mov %i2, %o1 4000df08: 40 00 2b db call 40018e74 <.urem> 4000df0c: 90 10 00 18 mov %i0, %o0 4000df10: 92 10 00 1b mov %i3, %o1 4000df14: b0 26 00 08 sub %i0, %o0, %i0 if ( boundary_line < boundary_floor ) { return 0; } alloc_begin = boundary_line - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 4000df18: ac 06 00 19 add %i0, %i1, %l6 4000df1c: 40 00 2b d6 call 40018e74 <.urem> 4000df20: 90 10 00 16 mov %l6, %o0 4000df24: 90 25 80 08 sub %l6, %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 ) { 4000df28: 80 a2 00 16 cmp %o0, %l6 4000df2c: 1a 80 00 1b bcc 4000df98 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000df30: 80 a6 00 08 cmp %i0, %o0 4000df34: 1a 80 00 19 bcc 4000df98 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000df38: 80 a4 80 08 cmp %l2, %o0 if ( boundary_line < boundary_floor ) { 4000df3c: 08 bf ff f2 bleu 4000df04 <_Heap_Allocate_aligned_with_boundary+0x138> 4000df40: b0 22 00 19 sub %o0, %i1, %i0 return 0; 4000df44: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 4000df48: 80 a6 20 00 cmp %i0, 0 4000df4c: 02 bf ff b7 be 4000de28 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN 4000df50: 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; 4000df54: c6 04 20 48 ld [ %l0 + 0x48 ], %g3 stats->searches += search_count; 4000df58: c4 04 20 4c ld [ %l0 + 0x4c ], %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 4000df5c: 86 00 e0 01 inc %g3 stats->searches += search_count; 4000df60: 84 00 80 1c add %g2, %i4, %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 4000df64: c6 24 20 48 st %g3, [ %l0 + 0x48 ] stats->searches += search_count; 4000df68: c4 24 20 4c st %g2, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 4000df6c: 90 10 00 10 mov %l0, %o0 4000df70: 92 10 00 1d mov %i5, %o1 4000df74: 94 10 00 18 mov %i0, %o2 4000df78: 7f ff ee 7d call 4000996c <_Heap_Block_allocate> 4000df7c: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 4000df80: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 4000df84: 80 a0 40 1c cmp %g1, %i4 4000df88: 2a bf ff b9 bcs,a 4000de6c <_Heap_Allocate_aligned_with_boundary+0xa0> 4000df8c: f8 24 20 44 st %i4, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 4000df90: 81 c7 e0 08 ret 4000df94: 81 e8 00 00 restore 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 ) { 4000df98: 80 a4 c0 18 cmp %l3, %i0 4000df9c: 18 bf ff ea bgu 4000df44 <_Heap_Allocate_aligned_with_boundary+0x178> 4000dfa0: 82 10 3f f8 mov -8, %g1 4000dfa4: 90 10 00 18 mov %i0, %o0 4000dfa8: a4 20 40 1d sub %g1, %i5, %l2 4000dfac: 92 10 00 15 mov %l5, %o1 4000dfb0: 40 00 2b b1 call 40018e74 <.urem> 4000dfb4: 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 ) { 4000dfb8: 90 a4 80 08 subcc %l2, %o0, %o0 4000dfbc: 02 bf ff 99 be 4000de20 <_Heap_Allocate_aligned_with_boundary+0x54> 4000dfc0: 80 a6 20 00 cmp %i0, 0 4000dfc4: 80 a2 00 14 cmp %o0, %l4 4000dfc8: 1a bf ff 96 bcc 4000de20 <_Heap_Allocate_aligned_with_boundary+0x54> 4000dfcc: 80 a6 20 00 cmp %i0, 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 ) { if ( boundary_line < boundary_floor ) { return 0; 4000dfd0: 10 bf ff de b 4000df48 <_Heap_Allocate_aligned_with_boundary+0x17c> 4000dfd4: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 4000dfd8: 18 80 00 06 bgu 4000dff0 <_Heap_Allocate_aligned_with_boundary+0x224> 4000dfdc: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 4000dfe0: 22 bf ff 84 be,a 4000ddf0 <_Heap_Allocate_aligned_with_boundary+0x24> 4000dfe4: b4 10 00 15 mov %l5, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 4000dfe8: 10 bf ff 83 b 4000ddf4 <_Heap_Allocate_aligned_with_boundary+0x28> 4000dfec: fa 04 20 08 ld [ %l0 + 8 ], %i5 uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { /* Integer overflow occured */ return NULL; 4000dff0: 81 c7 e0 08 ret 4000dff4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 4000dc0c <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t unused __attribute__((unused)) ) { 4000dc0c: 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; 4000dc10: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 4000dc14: c0 27 bf fc clr [ %fp + -4 ] Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t unused __attribute__((unused)) ) { 4000dc18: b8 10 00 18 mov %i0, %i4 Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 4000dc1c: e2 06 20 20 ld [ %i0 + 0x20 ], %l1 Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; 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; 4000dc20: a0 06 40 1a add %i1, %i2, %l0 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 4000dc24: e4 06 20 10 ld [ %i0 + 0x10 ], %l2 uintptr_t const min_block_size = heap->min_block_size; 4000dc28: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const free_size = stats->free_size; uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 4000dc2c: 80 a6 40 10 cmp %i1, %l0 4000dc30: 08 80 00 04 bleu 4000dc40 <_Heap_Extend+0x34> 4000dc34: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 return 0; 4000dc38: 81 c7 e0 08 ret 4000dc3c: 91 e8 20 00 restore %g0, 0, %o0 } extend_area_ok = _Heap_Get_first_and_last_block( 4000dc40: 90 10 00 19 mov %i1, %o0 4000dc44: 92 10 00 1a mov %i2, %o1 4000dc48: 94 10 00 12 mov %l2, %o2 4000dc4c: 98 07 bf f8 add %fp, -8, %o4 4000dc50: 7f ff ee 0e call 40009488 <_Heap_Get_first_and_last_block> 4000dc54: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 4000dc58: 80 8a 20 ff btst 0xff, %o0 4000dc5c: 02 bf ff f7 be 4000dc38 <_Heap_Extend+0x2c> 4000dc60: ba 10 00 11 mov %l1, %i5 4000dc64: aa 10 20 00 clr %l5 4000dc68: ac 10 20 00 clr %l6 4000dc6c: a6 10 20 00 clr %l3 4000dc70: 10 80 00 10 b 4000dcb0 <_Heap_Extend+0xa4> 4000dc74: a8 10 20 00 clr %l4 return 0; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 4000dc78: 2a 80 00 02 bcs,a 4000dc80 <_Heap_Extend+0x74> 4000dc7c: ac 10 00 1d mov %i5, %l6 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 4000dc80: 80 a6 c0 19 cmp %i3, %i1 4000dc84: 22 80 00 1e be,a 4000dcfc <_Heap_Extend+0xf0> 4000dc88: e0 27 40 00 st %l0, [ %i5 ] start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 4000dc8c: 80 a6 40 1b cmp %i1, %i3 4000dc90: 38 80 00 02 bgu,a 4000dc98 <_Heap_Extend+0x8c> 4000dc94: aa 10 00 08 mov %o0, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000dc98: fa 02 20 04 ld [ %o0 + 4 ], %i5 4000dc9c: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000dca0: ba 02 00 1d add %o0, %i5, %i5 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 4000dca4: 80 a4 40 1d cmp %l1, %i5 4000dca8: 22 80 00 1c be,a 4000dd18 <_Heap_Extend+0x10c> 4000dcac: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 return 0; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 4000dcb0: 80 a7 40 11 cmp %i5, %l1 4000dcb4: 22 80 00 03 be,a 4000dcc0 <_Heap_Extend+0xb4> 4000dcb8: f4 07 20 18 ld [ %i4 + 0x18 ], %i2 4000dcbc: b4 10 00 1d mov %i5, %i2 uintptr_t const sub_area_end = start_block->prev_size; 4000dcc0: f6 07 40 00 ld [ %i5 ], %i3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000dcc4: 92 10 00 12 mov %l2, %o1 4000dcc8: 40 00 15 93 call 40013314 <.urem> 4000dccc: 90 10 00 1b mov %i3, %o0 4000dcd0: 82 06 ff f8 add %i3, -8, %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 4000dcd4: 80 a6 80 10 cmp %i2, %l0 4000dcd8: 0a 80 00 64 bcs 4000de68 <_Heap_Extend+0x25c> 4000dcdc: 90 20 40 08 sub %g1, %o0, %o0 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return 0; } if ( extend_area_end == sub_area_begin ) { 4000dce0: 80 a6 80 10 cmp %i2, %l0 4000dce4: 12 bf ff e5 bne 4000dc78 <_Heap_Extend+0x6c> 4000dce8: 80 a4 00 1b cmp %l0, %i3 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 ) { 4000dcec: 80 a6 c0 19 cmp %i3, %i1 4000dcf0: 12 bf ff e7 bne 4000dc8c <_Heap_Extend+0x80> <== ALWAYS TAKEN 4000dcf4: a8 10 00 1d mov %i5, %l4 start_block->prev_size = extend_area_end; 4000dcf8: e0 27 40 00 st %l0, [ %i5 ] <== NOT EXECUTED - 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; 4000dcfc: fa 02 20 04 ld [ %o0 + 4 ], %i5 4000dd00: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000dd04: ba 02 00 1d add %o0, %i5, %i5 } 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 ); 4000dd08: 80 a4 40 1d cmp %l1, %i5 4000dd0c: 12 bf ff e9 bne 4000dcb0 <_Heap_Extend+0xa4> <== NEVER TAKEN 4000dd10: a6 10 00 08 mov %o0, %l3 if ( extend_area_begin < heap->area_begin ) { 4000dd14: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 4000dd18: 80 a6 40 01 cmp %i1, %g1 4000dd1c: 3a 80 00 4e bcc,a 4000de54 <_Heap_Extend+0x248> 4000dd20: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 4000dd24: f2 27 20 18 st %i1, [ %i4 + 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; 4000dd28: c2 07 bf f8 ld [ %fp + -8 ], %g1 4000dd2c: 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 ) { 4000dd30: c8 07 20 20 ld [ %i4 + 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 = 4000dd34: 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; 4000dd38: e0 20 40 00 st %l0, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 4000dd3c: ba 10 e0 01 or %g3, 1, %i5 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 = 4000dd40: fa 20 60 04 st %i5, [ %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; 4000dd44: 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 ) { 4000dd48: 80 a1 00 01 cmp %g4, %g1 4000dd4c: 08 80 00 3c bleu 4000de3c <_Heap_Extend+0x230> 4000dd50: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 4000dd54: c2 27 20 20 st %g1, [ %i4 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 4000dd58: 80 a5 20 00 cmp %l4, 0 4000dd5c: 02 80 00 47 be 4000de78 <_Heap_Extend+0x26c> 4000dd60: 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; 4000dd64: fa 07 20 10 ld [ %i4 + 0x10 ], %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 4000dd68: 92 10 00 1d mov %i5, %o1 4000dd6c: 40 00 15 6a call 40013314 <.urem> 4000dd70: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 4000dd74: 80 a2 20 00 cmp %o0, 0 4000dd78: 02 80 00 04 be 4000dd88 <_Heap_Extend+0x17c> 4000dd7c: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 4000dd80: b2 06 40 1d add %i1, %i5, %i1 4000dd84: 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 = 4000dd88: 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; 4000dd8c: 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 = 4000dd90: 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; 4000dd94: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 4000dd98: 90 10 00 1c mov %i4, %o0 4000dd9c: 92 10 00 01 mov %g1, %o1 4000dda0: 7f ff ff 85 call 4000dbb4 <_Heap_Free_block> 4000dda4: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 4000dda8: 80 a4 e0 00 cmp %l3, 0 4000ddac: 02 80 00 3a be 4000de94 <_Heap_Extend+0x288> 4000ddb0: a0 04 3f f8 add %l0, -8, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000ddb4: d2 07 20 10 ld [ %i4 + 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( 4000ddb8: a0 24 00 13 sub %l0, %l3, %l0 4000ddbc: 40 00 15 56 call 40013314 <.urem> 4000ddc0: 90 10 00 10 mov %l0, %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) 4000ddc4: c2 04 e0 04 ld [ %l3 + 4 ], %g1 4000ddc8: a0 24 00 08 sub %l0, %o0, %l0 4000ddcc: 82 20 40 10 sub %g1, %l0, %g1 | HEAP_PREV_BLOCK_USED; 4000ddd0: 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 = 4000ddd4: 84 04 00 13 add %l0, %l3, %g2 4000ddd8: 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; 4000dddc: 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 ); 4000dde0: 90 10 00 1c mov %i4, %o0 4000dde4: 82 08 60 01 and %g1, 1, %g1 4000dde8: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 4000ddec: a0 14 00 01 or %l0, %g1, %l0 4000ddf0: 7f ff ff 71 call 4000dbb4 <_Heap_Free_block> 4000ddf4: e0 24 e0 04 st %l0, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000ddf8: 80 a4 e0 00 cmp %l3, 0 4000ddfc: 02 80 00 33 be 4000dec8 <_Heap_Extend+0x2bc> 4000de00: 80 a5 20 00 cmp %l4, 0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 4000de04: c2 07 20 24 ld [ %i4 + 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( 4000de08: fa 07 20 20 ld [ %i4 + 0x20 ], %i5 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; 4000de0c: c8 00 60 04 ld [ %g1 + 4 ], %g4 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 4000de10: c4 07 20 2c ld [ %i4 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 4000de14: c6 07 20 30 ld [ %i4 + 0x30 ], %g3 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 4000de18: ba 27 40 01 sub %i5, %g1, %i5 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; 4000de1c: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 4000de20: 88 17 40 04 or %i5, %g4, %g4 4000de24: c8 20 60 04 st %g4, [ %g1 + 4 ] 4000de28: b0 20 c0 18 sub %g3, %i0, %i0 /* Statistics */ stats->size += extended_size; 4000de2c: 82 00 80 18 add %g2, %i0, %g1 4000de30: c2 27 20 2c st %g1, [ %i4 + 0x2c ] return extended_size; } 4000de34: 81 c7 e0 08 ret 4000de38: 81 e8 00 00 restore 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 ) { 4000de3c: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 4000de40: 80 a0 40 02 cmp %g1, %g2 4000de44: 2a bf ff c5 bcs,a 4000dd58 <_Heap_Extend+0x14c> 4000de48: c4 27 20 24 st %g2, [ %i4 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 4000de4c: 10 bf ff c4 b 4000dd5c <_Heap_Extend+0x150> 4000de50: 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 ) { 4000de54: 80 a4 00 01 cmp %l0, %g1 4000de58: 38 bf ff b4 bgu,a 4000dd28 <_Heap_Extend+0x11c> 4000de5c: e0 27 20 1c st %l0, [ %i4 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 4000de60: 10 bf ff b3 b 4000dd2c <_Heap_Extend+0x120> 4000de64: 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 ( 4000de68: 80 a6 40 1b cmp %i1, %i3 4000de6c: 1a bf ff 9e bcc 4000dce4 <_Heap_Extend+0xd8> 4000de70: 80 a6 80 10 cmp %i2, %l0 4000de74: 30 bf ff 71 b,a 4000dc38 <_Heap_Extend+0x2c> 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 ) { 4000de78: 80 a5 a0 00 cmp %l6, 0 4000de7c: 02 bf ff cc be 4000ddac <_Heap_Extend+0x1a0> 4000de80: 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; 4000de84: ac 25 80 02 sub %l6, %g2, %l6 4000de88: 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 = 4000de8c: 10 bf ff c8 b 4000ddac <_Heap_Extend+0x1a0> 4000de90: ec 20 a0 04 st %l6, [ %g2 + 4 ] ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 4000de94: 80 a5 60 00 cmp %l5, 0 4000de98: 02 bf ff d8 be 4000ddf8 <_Heap_Extend+0x1ec> 4000de9c: 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; 4000dea0: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 4000dea4: c2 07 bf fc ld [ %fp + -4 ], %g1 4000dea8: 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 ); 4000deac: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 4000deb0: 84 10 80 03 or %g2, %g3, %g2 4000deb4: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 4000deb8: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000debc: 84 10 a0 01 or %g2, 1, %g2 4000dec0: 10 bf ff ce b 4000ddf8 <_Heap_Extend+0x1ec> 4000dec4: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000dec8: 32 bf ff d0 bne,a 4000de08 <_Heap_Extend+0x1fc> 4000decc: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 4000ded0: d2 07 bf f8 ld [ %fp + -8 ], %o1 4000ded4: 7f ff ff 38 call 4000dbb4 <_Heap_Free_block> 4000ded8: 90 10 00 1c mov %i4, %o0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 4000dedc: 10 bf ff cb b 4000de08 <_Heap_Extend+0x1fc> 4000dee0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 =============================================================================== 4000dff8 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 4000dff8: 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 ) { 4000dffc: 80 a6 60 00 cmp %i1, 0 4000e000: 02 80 00 3c be 4000e0f0 <_Heap_Free+0xf8> 4000e004: 82 10 20 01 mov 1, %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000e008: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 4000e00c: 40 00 2b 9a call 40018e74 <.urem> 4000e010: 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 4000e014: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000e018: 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); 4000e01c: 90 27 40 08 sub %i5, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4000e020: 80 a2 00 02 cmp %o0, %g2 4000e024: 0a 80 00 30 bcs 4000e0e4 <_Heap_Free+0xec> 4000e028: 82 10 20 00 clr %g1 4000e02c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 4000e030: 80 a2 00 04 cmp %o0, %g4 4000e034: 38 80 00 2d bgu,a 4000e0e8 <_Heap_Free+0xf0> <== NEVER TAKEN 4000e038: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED - 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; 4000e03c: f6 02 20 04 ld [ %o0 + 4 ], %i3 4000e040: ba 0e ff fe and %i3, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000e044: 86 02 00 1d add %o0, %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; 4000e048: 80 a0 80 03 cmp %g2, %g3 4000e04c: 38 80 00 27 bgu,a 4000e0e8 <_Heap_Free+0xf0> <== NEVER TAKEN 4000e050: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED 4000e054: 80 a1 00 03 cmp %g4, %g3 4000e058: 2a 80 00 24 bcs,a 4000e0e8 <_Heap_Free+0xf0> <== NEVER TAKEN 4000e05c: b0 08 60 ff and %g1, 0xff, %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; 4000e060: f8 00 e0 04 ld [ %g3 + 4 ], %i4 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 4000e064: 80 8f 20 01 btst 1, %i4 4000e068: 02 80 00 1f be 4000e0e4 <_Heap_Free+0xec> <== NEVER TAKEN 4000e06c: 80 a1 00 03 cmp %g4, %g3 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 4000e070: 02 80 00 23 be 4000e0fc <_Heap_Free+0x104> 4000e074: b8 0f 3f fe and %i4, -2, %i4 4000e078: 82 00 c0 1c add %g3, %i4, %g1 4000e07c: c2 00 60 04 ld [ %g1 + 4 ], %g1 4000e080: 80 88 60 01 btst 1, %g1 4000e084: 12 80 00 1f bne 4000e100 <_Heap_Free+0x108> 4000e088: 80 8e e0 01 btst 1, %i3 if ( !_Heap_Is_prev_used( block ) ) { 4000e08c: 02 80 00 20 be 4000e10c <_Heap_Free+0x114> 4000e090: b2 10 20 01 mov 1, %i1 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 4000e094: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 4000e098: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 4000e09c: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; 4000e0a0: c2 22 20 0c st %g1, [ %o0 + 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; 4000e0a4: b8 07 00 1d add %i4, %i5, %i4 next->prev = new_block; 4000e0a8: d0 20 a0 0c st %o0, [ %g2 + 0xc ] prev->next = new_block; 4000e0ac: d0 20 60 08 st %o0, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000e0b0: 84 17 20 01 or %i4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 4000e0b4: f8 22 00 1c st %i4, [ %o0 + %i4 ] 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; 4000e0b8: c4 22 20 04 st %g2, [ %o0 + 4 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 4000e0bc: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000e0c0: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; stats->free_size += block_size; 4000e0c4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 4000e0c8: 82 00 60 01 inc %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000e0cc: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 4000e0d0: ba 00 c0 1d add %g3, %i5, %i5 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 4000e0d4: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000e0d8: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 4000e0dc: fa 26 20 30 st %i5, [ %i0 + 0x30 ] return( true ); 4000e0e0: 82 10 20 01 mov 1, %g1 4000e0e4: b0 08 60 ff and %g1, 0xff, %i0 4000e0e8: 81 c7 e0 08 ret 4000e0ec: 81 e8 00 00 restore 4000e0f0: b0 08 60 ff and %g1, 0xff, %i0 4000e0f4: 81 c7 e0 08 ret 4000e0f8: 81 e8 00 00 restore 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 ) ) { 4000e0fc: 80 8e e0 01 btst 1, %i3 4000e100: 32 80 00 1e bne,a 4000e178 <_Heap_Free+0x180> 4000e104: c4 06 20 08 ld [ %i0 + 8 ], %g2 if ( !_Heap_Protection_determine_block_free( heap, block ) ) { return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 4000e108: b2 10 20 00 clr %i1 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { uintptr_t const prev_size = block->prev_size; 4000e10c: f4 02 00 00 ld [ %o0 ], %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000e110: b6 22 00 1a sub %o0, %i2, %i3 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; 4000e114: 80 a0 80 1b cmp %g2, %i3 4000e118: 18 bf ff f3 bgu 4000e0e4 <_Heap_Free+0xec> <== NEVER TAKEN 4000e11c: 82 10 20 00 clr %g1 4000e120: 80 a1 00 1b cmp %g4, %i3 4000e124: 2a bf ff f1 bcs,a 4000e0e8 <_Heap_Free+0xf0> <== NEVER TAKEN 4000e128: b0 08 60 ff and %g1, 0xff, %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; 4000e12c: c4 06 e0 04 ld [ %i3 + 4 ], %g2 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) ) { 4000e130: 80 88 a0 01 btst 1, %g2 4000e134: 02 bf ff ec be 4000e0e4 <_Heap_Free+0xec> <== NEVER TAKEN 4000e138: 80 8e 60 ff btst 0xff, %i1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 4000e13c: 22 80 00 21 be,a 4000e1c0 <_Heap_Free+0x1c8> 4000e140: b4 07 40 1a add %i5, %i2, %i2 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 4000e144: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 4000e148: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 4000e14c: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 4000e150: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 4000e154: c4 20 60 0c st %g2, [ %g1 + 0xc ] 4000e158: 82 00 ff ff add %g3, -1, %g1 4000e15c: 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; 4000e160: b8 07 40 1c add %i5, %i4, %i4 4000e164: b4 07 00 1a add %i4, %i2, %i2 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000e168: 82 16 a0 01 or %i2, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 4000e16c: f4 26 c0 1a st %i2, [ %i3 + %i2 ] 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; 4000e170: 10 bf ff d3 b 4000e0bc <_Heap_Free+0xc4> 4000e174: c2 26 e0 04 st %g1, [ %i3 + 4 ] 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; 4000e178: 82 17 60 01 or %i5, 1, %g1 4000e17c: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000e180: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 4000e184: f0 22 20 0c st %i0, [ %o0 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 4000e188: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 4000e18c: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 4000e190: d0 20 a0 0c st %o0, [ %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; 4000e194: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 4000e198: fa 22 00 1d st %i5, [ %o0 + %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; 4000e19c: 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 ) { 4000e1a0: 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; 4000e1a4: 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; 4000e1a8: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 4000e1ac: 80 a0 40 02 cmp %g1, %g2 4000e1b0: 08 bf ff c3 bleu 4000e0bc <_Heap_Free+0xc4> 4000e1b4: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 4000e1b8: 10 bf ff c1 b 4000e0bc <_Heap_Free+0xc4> 4000e1bc: 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; 4000e1c0: 82 16 a0 01 or %i2, 1, %g1 4000e1c4: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000e1c8: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 4000e1cc: f4 22 00 1d st %i2, [ %o0 + %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; 4000e1d0: 82 08 7f fe and %g1, -2, %g1 4000e1d4: 10 bf ff ba b 4000e0bc <_Heap_Free+0xc4> 4000e1d8: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 40013cc4 <_Heap_Get_free_information>: return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 40013cc4: c2 02 20 08 ld [ %o0 + 8 ], %g1 ) { Heap_Block *the_block; Heap_Block *const tail = _Heap_Free_list_tail(the_heap); info->number = 0; 40013cc8: c0 22 40 00 clr [ %o1 ] info->largest = 0; 40013ccc: c0 22 60 04 clr [ %o1 + 4 ] info->total = 0; 40013cd0: c0 22 60 08 clr [ %o1 + 8 ] for(the_block = _Heap_Free_list_first(the_heap); 40013cd4: 88 10 20 01 mov 1, %g4 40013cd8: 9a 10 20 00 clr %o5 40013cdc: 80 a2 00 01 cmp %o0, %g1 40013ce0: 12 80 00 04 bne 40013cf0 <_Heap_Get_free_information+0x2c><== ALWAYS TAKEN 40013ce4: 86 10 20 00 clr %g3 40013ce8: 30 80 00 10 b,a 40013d28 <_Heap_Get_free_information+0x64><== NOT EXECUTED 40013cec: 88 10 00 0c mov %o4, %g4 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 40013cf0: c4 00 60 04 ld [ %g1 + 4 ], %g2 40013cf4: 98 01 20 01 add %g4, 1, %o4 40013cf8: 84 08 bf fe and %g2, -2, %g2 /* As we always coalesce free blocks, prev block must have been used. */ _HAssert(_Heap_Is_prev_used(the_block)); info->number++; info->total += the_size; if ( info->largest < the_size ) 40013cfc: 80 a0 80 0d cmp %g2, %o5 40013d00: 08 80 00 03 bleu 40013d0c <_Heap_Get_free_information+0x48> 40013d04: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 40013d08: c4 22 60 04 st %g2, [ %o1 + 4 ] info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); the_block != tail; the_block = the_block->next) 40013d0c: c2 00 60 08 ld [ %g1 + 8 ], %g1 info->number = 0; info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); 40013d10: 80 a2 00 01 cmp %o0, %g1 40013d14: 32 bf ff f6 bne,a 40013cec <_Heap_Get_free_information+0x28> 40013d18: da 02 60 04 ld [ %o1 + 4 ], %o5 40013d1c: c8 22 40 00 st %g4, [ %o1 ] 40013d20: 81 c3 e0 08 retl 40013d24: c6 22 60 08 st %g3, [ %o1 + 8 ] 40013d28: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 4000b7a8 <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, const uintptr_t *block_sizes, size_t block_count ) { 4000b7a8: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 4000b7ac: 80 a6 a0 00 cmp %i2, 0 4000b7b0: 02 80 00 35 be 4000b884 <_Heap_Greedy_allocate+0xdc> 4000b7b4: b8 10 00 18 mov %i0, %i4 4000b7b8: ba 10 20 00 clr %i5 4000b7bc: b6 10 20 00 clr %i3 #include "config.h" #endif #include Heap_Block *_Heap_Greedy_allocate( 4000b7c0: 83 2f 60 02 sll %i5, 2, %g1 * @brief See _Heap_Allocate_aligned_with_boundary() with alignment and * boundary equals zero. */ RTEMS_INLINE_ROUTINE void *_Heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 4000b7c4: d2 06 40 01 ld [ %i1 + %g1 ], %o1 4000b7c8: 94 10 20 00 clr %o2 4000b7cc: 96 10 20 00 clr %o3 4000b7d0: 40 00 1d 92 call 40012e18 <_Heap_Allocate_aligned_with_boundary> 4000b7d4: 90 10 00 1c mov %i4, %o0 size_t i; for (i = 0; i < block_count; ++i) { void *next = _Heap_Allocate( heap, block_sizes [i] ); if ( next != NULL ) { 4000b7d8: 82 92 20 00 orcc %o0, 0, %g1 4000b7dc: 22 80 00 09 be,a 4000b800 <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN 4000b7e0: ba 07 60 01 inc %i5 <== NOT EXECUTED RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000b7e4: d2 07 20 10 ld [ %i4 + 0x10 ], %o1 4000b7e8: 40 00 33 83 call 400185f4 <.urem> 4000b7ec: b0 00 7f f8 add %g1, -8, %i0 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 4000b7f0: 90 26 00 08 sub %i0, %o0, %o0 Heap_Block *next_block = _Heap_Block_of_alloc_area( (uintptr_t) next, heap->page_size ); next_block->next = allocated_blocks; 4000b7f4: f6 22 20 08 st %i3, [ %o0 + 8 ] 4000b7f8: b6 10 00 08 mov %o0, %i3 Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 4000b7fc: ba 07 60 01 inc %i5 4000b800: 80 a7 40 1a cmp %i5, %i2 4000b804: 12 bf ff f0 bne 4000b7c4 <_Heap_Greedy_allocate+0x1c> 4000b808: 83 2f 60 02 sll %i5, 2, %g1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 4000b80c: fa 07 20 08 ld [ %i4 + 8 ], %i5 next_block->next = allocated_blocks; allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { 4000b810: 80 a7 00 1d cmp %i4, %i5 4000b814: 02 80 00 17 be 4000b870 <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN 4000b818: b0 10 20 00 clr %i0 4000b81c: 10 80 00 03 b 4000b828 <_Heap_Greedy_allocate+0x80> 4000b820: b4 10 20 00 clr %i2 4000b824: ba 10 00 01 mov %g1, %i5 - 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; 4000b828: d6 07 60 04 ld [ %i5 + 4 ], %o3 _Heap_Block_allocate( 4000b82c: 92 10 00 1d mov %i5, %o1 4000b830: 96 0a ff fe and %o3, -2, %o3 4000b834: 94 07 60 08 add %i5, 8, %o2 4000b838: 90 10 00 1c mov %i4, %o0 4000b83c: 40 00 00 e0 call 4000bbbc <_Heap_Block_allocate> 4000b840: 96 02 ff f8 add %o3, -8, %o3 current, _Heap_Alloc_area_of_block( current ), _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; 4000b844: f4 27 60 08 st %i2, [ %i5 + 8 ] return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 4000b848: c2 07 20 08 ld [ %i4 + 8 ], %g1 next_block->next = allocated_blocks; allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { 4000b84c: 80 a7 00 01 cmp %i4, %g1 4000b850: 12 bf ff f5 bne 4000b824 <_Heap_Greedy_allocate+0x7c> 4000b854: b4 10 00 1d mov %i5, %i2 4000b858: 10 80 00 06 b 4000b870 <_Heap_Greedy_allocate+0xc8> 4000b85c: b0 10 00 1d mov %i5, %i0 } while ( allocated_blocks != NULL ) { current = allocated_blocks; allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 4000b860: 92 06 e0 08 add %i3, 8, %o1 4000b864: 90 10 00 1c mov %i4, %o0 4000b868: 40 00 1d f7 call 40013044 <_Heap_Free> 4000b86c: b6 10 00 1a mov %i2, %i3 current->next = blocks; blocks = current; } while ( allocated_blocks != NULL ) { 4000b870: 80 a6 e0 00 cmp %i3, 0 4000b874: 32 bf ff fb bne,a 4000b860 <_Heap_Greedy_allocate+0xb8> 4000b878: f4 06 e0 08 ld [ %i3 + 8 ], %i2 allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); } return blocks; } 4000b87c: 81 c7 e0 08 ret 4000b880: 81 e8 00 00 restore const uintptr_t *block_sizes, size_t block_count ) { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *allocated_blocks = NULL; 4000b884: 10 bf ff e2 b 4000b80c <_Heap_Greedy_allocate+0x64> 4000b888: b6 10 20 00 clr %i3 =============================================================================== 4000b88c <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 4000b88c: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 4000b890: 80 a6 60 00 cmp %i1, 0 4000b894: 02 80 00 09 be 4000b8b8 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN 4000b898: 01 00 00 00 nop Heap_Block *current = blocks; blocks = blocks->next; 4000b89c: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 4000b8a0: 92 06 60 08 add %i1, 8, %o1 4000b8a4: 40 00 1d e8 call 40013044 <_Heap_Free> 4000b8a8: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 4000b8ac: b2 97 60 00 orcc %i5, 0, %i1 4000b8b0: 32 bf ff fc bne,a 4000b8a0 <_Heap_Greedy_free+0x14> 4000b8b4: fa 06 60 08 ld [ %i1 + 8 ], %i5 4000b8b8: 81 c7 e0 08 ret 4000b8bc: 81 e8 00 00 restore =============================================================================== 40013d90 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 40013d90: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED Heap_Block *current = heap->first_block; 40013d94: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 <== NOT EXECUTED Heap_Block *end = heap->last_block; 40013d98: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 <== NOT EXECUTED bool stop = false; while ( !stop && current != end ) { 40013d9c: 80 a0 40 1c cmp %g1, %i4 <== NOT EXECUTED 40013da0: 32 80 00 08 bne,a 40013dc0 <_Heap_Iterate+0x30> <== NOT EXECUTED 40013da4: d2 00 60 04 ld [ %g1 + 4 ], %o1 <== NOT EXECUTED 40013da8: 30 80 00 10 b,a 40013de8 <_Heap_Iterate+0x58> <== NOT EXECUTED 40013dac: 90 1a 20 01 xor %o0, 1, %o0 <== NOT EXECUTED 40013db0: 80 8a 20 ff btst 0xff, %o0 <== NOT EXECUTED 40013db4: 02 80 00 0d be 40013de8 <_Heap_Iterate+0x58> <== NOT EXECUTED 40013db8: 01 00 00 00 nop <== NOT EXECUTED 40013dbc: d2 00 60 04 ld [ %g1 + 4 ], %o1 <== NOT EXECUTED uintptr_t size = _Heap_Block_size( current ); Heap_Block *next = _Heap_Block_at( current, size ); bool used = _Heap_Is_prev_used( next ); stop = (*visitor)( current, size, used, visitor_arg ); 40013dc0: 90 10 00 01 mov %g1, %o0 <== NOT EXECUTED 40013dc4: 92 0a 7f fe and %o1, -2, %o1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 40013dc8: ba 00 40 09 add %g1, %o1, %i5 <== 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; 40013dcc: d4 07 60 04 ld [ %i5 + 4 ], %o2 <== NOT EXECUTED 40013dd0: 96 10 00 1a mov %i2, %o3 <== NOT EXECUTED 40013dd4: 9f c6 40 00 call %i1 <== NOT EXECUTED 40013dd8: 94 0a a0 01 and %o2, 1, %o2 <== NOT EXECUTED { Heap_Block *current = heap->first_block; Heap_Block *end = heap->last_block; bool stop = false; while ( !stop && current != end ) { 40013ddc: 80 a7 00 1d cmp %i4, %i5 <== NOT EXECUTED 40013de0: 12 bf ff f3 bne 40013dac <_Heap_Iterate+0x1c> <== NOT EXECUTED 40013de4: 82 10 00 1d mov %i5, %g1 <== NOT EXECUTED 40013de8: 81 c7 e0 08 ret <== NOT EXECUTED 40013dec: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4001beac <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 4001beac: 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); 4001beb0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 4001beb4: 7f ff f3 f0 call 40018e74 <.urem> 4001beb8: 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 4001bebc: 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); 4001bec0: 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); 4001bec4: 90 20 80 08 sub %g2, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4001bec8: 80 a2 00 01 cmp %o0, %g1 4001becc: 0a 80 00 16 bcs 4001bf24 <_Heap_Size_of_alloc_area+0x78> 4001bed0: 84 10 20 00 clr %g2 4001bed4: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 4001bed8: 80 a2 00 03 cmp %o0, %g3 4001bedc: 18 80 00 13 bgu 4001bf28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 4001bee0: b0 08 a0 ff and %g2, 0xff, %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; 4001bee4: c8 02 20 04 ld [ %o0 + 4 ], %g4 4001bee8: 88 09 3f fe and %g4, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4001beec: 90 02 00 04 add %o0, %g4, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4001bef0: 80 a0 40 08 cmp %g1, %o0 4001bef4: 18 80 00 0d bgu 4001bf28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 4001bef8: 01 00 00 00 nop 4001befc: 80 a0 c0 08 cmp %g3, %o0 4001bf00: 0a 80 00 0a bcs 4001bf28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 4001bf04: 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; 4001bf08: c2 02 20 04 ld [ %o0 + 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 ) 4001bf0c: 80 88 60 01 btst 1, %g1 4001bf10: 02 80 00 06 be 4001bf28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 4001bf14: 90 22 00 19 sub %o0, %i1, %o0 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 4001bf18: 84 10 20 01 mov 1, %g2 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 4001bf1c: 90 02 20 04 add %o0, 4, %o0 4001bf20: d0 26 80 00 st %o0, [ %i2 ] 4001bf24: b0 08 a0 ff and %g2, 0xff, %i0 4001bf28: 81 c7 e0 08 ret 4001bf2c: 81 e8 00 00 restore =============================================================================== 4000a404 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 4000a404: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const page_size = heap->page_size; 4000a408: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 uintptr_t const min_block_size = heap->min_block_size; 4000a40c: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 4000a410: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 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; 4000a414: 80 a6 a0 00 cmp %i2, 0 4000a418: 02 80 00 0c be 4000a448 <_Heap_Walk+0x44> 4000a41c: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 if ( !_System_state_Is_up( _System_state_Get() ) ) { 4000a420: 03 10 00 65 sethi %hi(0x40019400), %g1 4000a424: c4 00 60 bc ld [ %g1 + 0xbc ], %g2 ! 400194bc <_System_state_Current> 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; 4000a428: 07 10 00 28 sethi %hi(0x4000a000), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 4000a42c: 82 10 20 01 mov 1, %g1 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; if ( !_System_state_Is_up( _System_state_Get() ) ) { 4000a430: 80 a0 a0 03 cmp %g2, 3 4000a434: 02 80 00 0c be 4000a464 <_Heap_Walk+0x60> <== ALWAYS TAKEN 4000a438: ae 10 e3 a0 or %g3, 0x3a0, %l7 4000a43c: b0 08 60 ff and %g1, 0xff, %i0 4000a440: 81 c7 e0 08 ret 4000a444: 81 e8 00 00 restore 4000a448: 03 10 00 65 sethi %hi(0x40019400), %g1 4000a44c: c4 00 60 bc ld [ %g1 + 0xbc ], %g2 ! 400194bc <_System_state_Current> 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; 4000a450: 07 10 00 28 sethi %hi(0x4000a000), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 4000a454: 82 10 20 01 mov 1, %g1 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; if ( !_System_state_Is_up( _System_state_Get() ) ) { 4000a458: 80 a0 a0 03 cmp %g2, 3 4000a45c: 12 bf ff f8 bne 4000a43c <_Heap_Walk+0x38> 4000a460: ae 10 e3 98 or %g3, 0x398, %l7 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)( 4000a464: da 06 20 18 ld [ %i0 + 0x18 ], %o5 4000a468: c8 06 20 1c ld [ %i0 + 0x1c ], %g4 4000a46c: c4 06 20 08 ld [ %i0 + 8 ], %g2 4000a470: c2 06 20 0c ld [ %i0 + 0xc ], %g1 4000a474: 90 10 00 19 mov %i1, %o0 4000a478: c8 23 a0 5c st %g4, [ %sp + 0x5c ] 4000a47c: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 4000a480: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 4000a484: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 4000a488: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 4000a48c: 92 10 20 00 clr %o1 4000a490: 96 10 00 1b mov %i3, %o3 4000a494: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a498: 98 10 00 10 mov %l0, %o4 4000a49c: 9f c5 c0 00 call %l7 4000a4a0: 94 12 a1 b8 or %o2, 0x1b8, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 4000a4a4: 80 a6 e0 00 cmp %i3, 0 4000a4a8: 02 80 00 2a be 4000a550 <_Heap_Walk+0x14c> 4000a4ac: 80 8e e0 07 btst 7, %i3 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 4000a4b0: 12 80 00 2f bne 4000a56c <_Heap_Walk+0x168> 4000a4b4: 90 10 00 10 mov %l0, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 4000a4b8: 7f ff dd ae call 40001b70 <.urem> 4000a4bc: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 4000a4c0: 80 a2 20 00 cmp %o0, 0 4000a4c4: 12 80 00 32 bne 4000a58c <_Heap_Walk+0x188> 4000a4c8: 90 07 20 08 add %i4, 8, %o0 4000a4cc: 7f ff dd a9 call 40001b70 <.urem> 4000a4d0: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 4000a4d4: 80 a2 20 00 cmp %o0, 0 4000a4d8: 32 80 00 35 bne,a 4000a5ac <_Heap_Walk+0x1a8> 4000a4dc: 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; 4000a4e0: ec 07 20 04 ld [ %i4 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 4000a4e4: b4 8d a0 01 andcc %l6, 1, %i2 4000a4e8: 22 80 00 38 be,a 4000a5c8 <_Heap_Walk+0x1c4> 4000a4ec: 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; 4000a4f0: c2 04 60 04 ld [ %l1 + 4 ], %g1 4000a4f4: 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); 4000a4f8: 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; 4000a4fc: fa 00 60 04 ld [ %g1 + 4 ], %i5 ); return false; } if ( _Heap_Is_free( last_block ) ) { 4000a500: 80 8f 60 01 btst 1, %i5 4000a504: 02 80 00 0c be 4000a534 <_Heap_Walk+0x130> 4000a508: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 4000a50c: 02 80 00 35 be 4000a5e0 <_Heap_Walk+0x1dc> 4000a510: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 4000a514: 92 10 20 01 mov 1, %o1 4000a518: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a51c: 9f c5 c0 00 call %l7 4000a520: 94 12 a3 30 or %o2, 0x330, %o2 ! 40016b30 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a524: 82 10 20 00 clr %g1 4000a528: b0 08 60 ff and %g1, 0xff, %i0 4000a52c: 81 c7 e0 08 ret 4000a530: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 4000a534: 90 10 00 19 mov %i1, %o0 4000a538: 92 10 20 01 mov 1, %o1 4000a53c: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a540: 9f c5 c0 00 call %l7 4000a544: 94 12 a3 18 or %o2, 0x318, %o2 ! 40016b18 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a548: 10 bf ff f8 b 4000a528 <_Heap_Walk+0x124> 4000a54c: 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" ); 4000a550: 90 10 00 19 mov %i1, %o0 4000a554: 92 10 20 01 mov 1, %o1 4000a558: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a55c: 9f c5 c0 00 call %l7 4000a560: 94 12 a2 50 or %o2, 0x250, %o2 ! 40016a50 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a564: 10 bf ff f1 b 4000a528 <_Heap_Walk+0x124> 4000a568: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 4000a56c: 90 10 00 19 mov %i1, %o0 4000a570: 92 10 20 01 mov 1, %o1 4000a574: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a578: 96 10 00 1b mov %i3, %o3 4000a57c: 9f c5 c0 00 call %l7 4000a580: 94 12 a2 68 or %o2, 0x268, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a584: 10 bf ff e9 b 4000a528 <_Heap_Walk+0x124> 4000a588: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 4000a58c: 90 10 00 19 mov %i1, %o0 4000a590: 92 10 20 01 mov 1, %o1 4000a594: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a598: 96 10 00 10 mov %l0, %o3 4000a59c: 9f c5 c0 00 call %l7 4000a5a0: 94 12 a2 88 or %o2, 0x288, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a5a4: 10 bf ff e1 b 4000a528 <_Heap_Walk+0x124> 4000a5a8: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 4000a5ac: 92 10 20 01 mov 1, %o1 4000a5b0: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a5b4: 96 10 00 1c mov %i4, %o3 4000a5b8: 9f c5 c0 00 call %l7 4000a5bc: 94 12 a2 b0 or %o2, 0x2b0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a5c0: 10 bf ff da b 4000a528 <_Heap_Walk+0x124> 4000a5c4: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 4000a5c8: 92 10 20 01 mov 1, %o1 4000a5cc: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a5d0: 9f c5 c0 00 call %l7 4000a5d4: 94 12 a2 e8 or %o2, 0x2e8, %o2 ! 40016ae8 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a5d8: 10 bf ff d4 b 4000a528 <_Heap_Walk+0x124> 4000a5dc: 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; 4000a5e0: fa 06 20 08 ld [ %i0 + 8 ], %i5 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 4000a5e4: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 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 ) { 4000a5e8: 80 a6 00 1d cmp %i0, %i5 4000a5ec: 02 80 00 0d be 4000a620 <_Heap_Walk+0x21c> 4000a5f0: da 06 20 20 ld [ %i0 + 0x20 ], %o5 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; 4000a5f4: 80 a3 40 1d cmp %o5, %i5 4000a5f8: 28 80 00 bf bleu,a 4000a8f4 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN 4000a5fc: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 4000a600: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 4000a604: 92 10 20 01 mov 1, %o1 4000a608: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a60c: 96 10 00 1d mov %i5, %o3 4000a610: 9f c5 c0 00 call %l7 4000a614: 94 12 a3 60 or %o2, 0x360, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a618: 10 bf ff c4 b 4000a528 <_Heap_Walk+0x124> 4000a61c: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 4000a620: 27 10 00 5b sethi %hi(0x40016c00), %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 4000a624: 25 10 00 5b sethi %hi(0x40016c00), %l2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 4000a628: aa 10 00 1c mov %i4, %l5 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 4000a62c: a6 14 e1 90 or %l3, 0x190, %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 4000a630: a4 14 a1 78 or %l2, 0x178, %l2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 4000a634: 29 10 00 5b sethi %hi(0x40016c00), %l4 - 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; 4000a638: ac 0d bf fe and %l6, -2, %l6 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000a63c: ba 05 80 15 add %l6, %l5, %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; 4000a640: 80 a3 40 1d cmp %o5, %i5 4000a644: 28 80 00 0b bleu,a 4000a670 <_Heap_Walk+0x26c> <== ALWAYS TAKEN 4000a648: de 06 20 24 ld [ %i0 + 0x24 ], %o7 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)( 4000a64c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 4000a650: 92 10 20 01 mov 1, %o1 4000a654: 96 10 00 15 mov %l5, %o3 4000a658: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a65c: 98 10 00 1d mov %i5, %o4 4000a660: 9f c5 c0 00 call %l7 4000a664: 94 12 a0 08 or %o2, 8, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 4000a668: 10 bf ff 75 b 4000a43c <_Heap_Walk+0x38> 4000a66c: 82 10 20 00 clr %g1 4000a670: 80 a3 c0 1d cmp %o7, %i5 4000a674: 0a bf ff f7 bcs 4000a650 <_Heap_Walk+0x24c> 4000a678: 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; 4000a67c: 9e 1d 40 11 xor %l5, %l1, %o7 4000a680: 80 a0 00 0f cmp %g0, %o7 4000a684: 9a 40 20 00 addx %g0, 0, %o5 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 4000a688: 90 10 00 16 mov %l6, %o0 4000a68c: da 27 bf fc st %o5, [ %fp + -4 ] 4000a690: 7f ff dd 38 call 40001b70 <.urem> 4000a694: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 4000a698: 80 a2 20 00 cmp %o0, 0 4000a69c: 02 80 00 18 be 4000a6fc <_Heap_Walk+0x2f8> 4000a6a0: da 07 bf fc ld [ %fp + -4 ], %o5 4000a6a4: 80 8b 60 ff btst 0xff, %o5 4000a6a8: 12 80 00 8b bne 4000a8d4 <_Heap_Walk+0x4d0> 4000a6ac: 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; 4000a6b0: de 07 60 04 ld [ %i5 + 4 ], %o7 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 4000a6b4: 80 8b e0 01 btst 1, %o7 4000a6b8: 02 80 00 2b be 4000a764 <_Heap_Walk+0x360> 4000a6bc: 80 a6 a0 00 cmp %i2, 0 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 4000a6c0: 22 80 00 21 be,a 4000a744 <_Heap_Walk+0x340> 4000a6c4: da 05 40 00 ld [ %l5 ], %o5 (*printer)( 4000a6c8: 90 10 00 19 mov %i1, %o0 4000a6cc: 92 10 20 00 clr %o1 4000a6d0: 94 10 00 12 mov %l2, %o2 4000a6d4: 96 10 00 15 mov %l5, %o3 4000a6d8: 9f c5 c0 00 call %l7 4000a6dc: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 4000a6e0: 80 a7 00 1d cmp %i4, %i5 4000a6e4: 02 80 00 51 be 4000a828 <_Heap_Walk+0x424> 4000a6e8: aa 10 00 1d mov %i5, %l5 4000a6ec: ec 07 60 04 ld [ %i5 + 4 ], %l6 4000a6f0: da 06 20 20 ld [ %i0 + 0x20 ], %o5 4000a6f4: 10 bf ff d1 b 4000a638 <_Heap_Walk+0x234> 4000a6f8: b4 0d a0 01 and %l6, 1, %i2 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 4000a6fc: 80 a5 80 10 cmp %l6, %l0 4000a700: 0a 80 00 69 bcs 4000a8a4 <_Heap_Walk+0x4a0> 4000a704: 80 8b 60 ff btst 0xff, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 4000a708: 80 a5 40 1d cmp %l5, %i5 4000a70c: 2a bf ff ea bcs,a 4000a6b4 <_Heap_Walk+0x2b0> 4000a710: de 07 60 04 ld [ %i5 + 4 ], %o7 4000a714: 80 8b 60 ff btst 0xff, %o5 4000a718: 22 bf ff e7 be,a 4000a6b4 <_Heap_Walk+0x2b0> 4000a71c: de 07 60 04 ld [ %i5 + 4 ], %o7 (*printer)( 4000a720: 90 10 00 19 mov %i1, %o0 4000a724: 92 10 20 01 mov 1, %o1 4000a728: 96 10 00 15 mov %l5, %o3 4000a72c: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a730: 98 10 00 1d mov %i5, %o4 4000a734: 9f c5 c0 00 call %l7 4000a738: 94 12 a0 98 or %o2, 0x98, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 4000a73c: 10 bf ff 40 b 4000a43c <_Heap_Walk+0x38> 4000a740: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 4000a744: 96 10 00 15 mov %l5, %o3 4000a748: 90 10 00 19 mov %i1, %o0 4000a74c: 92 10 20 00 clr %o1 4000a750: 94 10 00 13 mov %l3, %o2 4000a754: 9f c5 c0 00 call %l7 4000a758: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 4000a75c: 10 bf ff e2 b 4000a6e4 <_Heap_Walk+0x2e0> 4000a760: 80 a7 00 1d cmp %i4, %i5 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 ? 4000a764: da 05 60 0c ld [ %l5 + 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)( 4000a768: de 06 20 08 ld [ %i0 + 8 ], %o7 4000a76c: 80 a3 c0 0d cmp %o7, %o5 4000a770: 02 80 00 3d be 4000a864 <_Heap_Walk+0x460> 4000a774: d8 06 20 0c ld [ %i0 + 0xc ], %o4 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 4000a778: 80 a6 00 0d cmp %i0, %o5 4000a77c: 02 80 00 40 be 4000a87c <_Heap_Walk+0x478> 4000a780: 96 15 21 40 or %l4, 0x140, %o3 block->next, block->next == last_free_block ? 4000a784: de 05 60 08 ld [ %l5 + 8 ], %o7 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 4000a788: 80 a3 00 0f cmp %o4, %o7 4000a78c: 02 80 00 33 be 4000a858 <_Heap_Walk+0x454> 4000a790: 80 a6 00 0f cmp %i0, %o7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 4000a794: 02 80 00 37 be 4000a870 <_Heap_Walk+0x46c> 4000a798: 98 15 21 40 or %l4, 0x140, %o4 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 4000a79c: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 4000a7a0: d8 23 a0 64 st %o4, [ %sp + 0x64 ] 4000a7a4: de 23 a0 60 st %o7, [ %sp + 0x60 ] 4000a7a8: 90 10 00 19 mov %i1, %o0 4000a7ac: 92 10 20 00 clr %o1 4000a7b0: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a7b4: 96 10 00 15 mov %l5, %o3 4000a7b8: 94 12 a0 d0 or %o2, 0xd0, %o2 4000a7bc: 9f c5 c0 00 call %l7 4000a7c0: 98 10 00 16 mov %l6, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 4000a7c4: da 07 40 00 ld [ %i5 ], %o5 4000a7c8: 80 a5 80 0d cmp %l6, %o5 4000a7cc: 12 80 00 19 bne 4000a830 <_Heap_Walk+0x42c> 4000a7d0: 80 a6 a0 00 cmp %i2, 0 ); return false; } if ( !prev_used ) { 4000a7d4: 02 80 00 2d be 4000a888 <_Heap_Walk+0x484> 4000a7d8: 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; 4000a7dc: c4 06 20 08 ld [ %i0 + 8 ], %g2 ) { 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 ) { 4000a7e0: 80 a6 00 02 cmp %i0, %g2 4000a7e4: 02 80 00 0b be 4000a810 <_Heap_Walk+0x40c> <== NEVER TAKEN 4000a7e8: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 4000a7ec: 80 a5 40 02 cmp %l5, %g2 4000a7f0: 02 bf ff bd be 4000a6e4 <_Heap_Walk+0x2e0> 4000a7f4: 80 a7 00 1d cmp %i4, %i5 return true; } free_block = free_block->next; 4000a7f8: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ) { 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 ) { 4000a7fc: 80 a6 00 02 cmp %i0, %g2 4000a800: 12 bf ff fc bne 4000a7f0 <_Heap_Walk+0x3ec> 4000a804: 80 a5 40 02 cmp %l5, %g2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 4000a808: 90 10 00 19 mov %i1, %o0 4000a80c: 92 10 20 01 mov 1, %o1 4000a810: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a814: 96 10 00 15 mov %l5, %o3 4000a818: 9f c5 c0 00 call %l7 4000a81c: 94 12 a1 b8 or %o2, 0x1b8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a820: 10 bf ff 42 b 4000a528 <_Heap_Walk+0x124> 4000a824: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 4000a828: 10 bf ff 05 b 4000a43c <_Heap_Walk+0x38> 4000a82c: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 4000a830: fa 23 a0 5c st %i5, [ %sp + 0x5c ] 4000a834: 90 10 00 19 mov %i1, %o0 4000a838: 92 10 20 01 mov 1, %o1 4000a83c: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a840: 96 10 00 15 mov %l5, %o3 4000a844: 94 12 a1 08 or %o2, 0x108, %o2 4000a848: 9f c5 c0 00 call %l7 4000a84c: 98 10 00 16 mov %l6, %o4 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a850: 10 bf ff 36 b 4000a528 <_Heap_Walk+0x124> 4000a854: 82 10 20 00 clr %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)( 4000a858: 03 10 00 5a sethi %hi(0x40016800), %g1 4000a85c: 10 bf ff d0 b 4000a79c <_Heap_Walk+0x398> 4000a860: 98 10 61 98 or %g1, 0x198, %o4 ! 40016998 <__log2table+0x140> 4000a864: 03 10 00 5a sethi %hi(0x40016800), %g1 4000a868: 10 bf ff c7 b 4000a784 <_Heap_Walk+0x380> 4000a86c: 96 10 61 78 or %g1, 0x178, %o3 ! 40016978 <__log2table+0x120> " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 4000a870: 03 10 00 5a sethi %hi(0x40016800), %g1 4000a874: 10 bf ff ca b 4000a79c <_Heap_Walk+0x398> 4000a878: 98 10 61 a8 or %g1, 0x1a8, %o4 ! 400169a8 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 4000a87c: 17 10 00 5a sethi %hi(0x40016800), %o3 4000a880: 10 bf ff c1 b 4000a784 <_Heap_Walk+0x380> 4000a884: 96 12 e1 88 or %o3, 0x188, %o3 ! 40016988 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 4000a888: 92 10 20 01 mov 1, %o1 4000a88c: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a890: 96 10 00 15 mov %l5, %o3 4000a894: 9f c5 c0 00 call %l7 4000a898: 94 12 a1 48 or %o2, 0x148, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a89c: 10 bf ff 23 b 4000a528 <_Heap_Walk+0x124> 4000a8a0: 82 10 20 00 clr %g1 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 4000a8a4: 02 bf ff 9a be 4000a70c <_Heap_Walk+0x308> <== NEVER TAKEN 4000a8a8: 80 a5 40 1d cmp %l5, %i5 (*printer)( 4000a8ac: 90 10 00 19 mov %i1, %o0 4000a8b0: 92 10 20 01 mov 1, %o1 4000a8b4: 96 10 00 15 mov %l5, %o3 4000a8b8: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a8bc: 98 10 00 16 mov %l6, %o4 4000a8c0: 94 12 a0 68 or %o2, 0x68, %o2 4000a8c4: 9f c5 c0 00 call %l7 4000a8c8: 9a 10 00 10 mov %l0, %o5 block, block_size, min_block_size ); return false; 4000a8cc: 10 bf fe dc b 4000a43c <_Heap_Walk+0x38> 4000a8d0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 4000a8d4: 92 10 20 01 mov 1, %o1 4000a8d8: 96 10 00 15 mov %l5, %o3 4000a8dc: 15 10 00 5b sethi %hi(0x40016c00), %o2 4000a8e0: 98 10 00 16 mov %l6, %o4 4000a8e4: 9f c5 c0 00 call %l7 4000a8e8: 94 12 a0 38 or %o2, 0x38, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 4000a8ec: 10 bf fe d4 b 4000a43c <_Heap_Walk+0x38> 4000a8f0: 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; 4000a8f4: 80 a4 c0 1d cmp %l3, %i5 4000a8f8: 0a bf ff 43 bcs 4000a604 <_Heap_Walk+0x200> <== NEVER TAKEN 4000a8fc: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 4000a900: da 27 bf fc st %o5, [ %fp + -4 ] 4000a904: 90 07 60 08 add %i5, 8, %o0 4000a908: 7f ff dc 9a call 40001b70 <.urem> 4000a90c: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 4000a910: 80 a2 20 00 cmp %o0, 0 4000a914: 12 80 00 36 bne 4000a9ec <_Heap_Walk+0x5e8> <== NEVER TAKEN 4000a918: da 07 bf fc ld [ %fp + -4 ], %o5 - 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; 4000a91c: c2 07 60 04 ld [ %i5 + 4 ], %g1 4000a920: 82 08 7f fe and %g1, -2, %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; 4000a924: 82 07 40 01 add %i5, %g1, %g1 4000a928: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 4000a92c: 80 88 60 01 btst 1, %g1 4000a930: 12 80 00 27 bne 4000a9cc <_Heap_Walk+0x5c8> <== NEVER TAKEN 4000a934: a4 10 00 1d mov %i5, %l2 4000a938: 10 80 00 19 b 4000a99c <_Heap_Walk+0x598> 4000a93c: 82 10 00 18 mov %i0, %g1 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 ) { 4000a940: 80 a6 00 1d cmp %i0, %i5 4000a944: 02 bf ff 37 be 4000a620 <_Heap_Walk+0x21c> 4000a948: 80 a7 40 0d cmp %i5, %o5 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; 4000a94c: 0a bf ff 2e bcs 4000a604 <_Heap_Walk+0x200> 4000a950: 90 10 00 19 mov %i1, %o0 4000a954: 80 a7 40 13 cmp %i5, %l3 4000a958: 18 bf ff 2c bgu 4000a608 <_Heap_Walk+0x204> <== NEVER TAKEN 4000a95c: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 4000a960: da 27 bf fc st %o5, [ %fp + -4 ] 4000a964: 90 07 60 08 add %i5, 8, %o0 4000a968: 7f ff dc 82 call 40001b70 <.urem> 4000a96c: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 4000a970: 80 a2 20 00 cmp %o0, 0 4000a974: 12 80 00 1e bne 4000a9ec <_Heap_Walk+0x5e8> 4000a978: da 07 bf fc ld [ %fp + -4 ], %o5 - 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; 4000a97c: de 07 60 04 ld [ %i5 + 4 ], %o7 4000a980: 82 10 00 12 mov %l2, %g1 4000a984: 9e 0b ff fe and %o7, -2, %o7 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; 4000a988: 9e 03 c0 1d add %o7, %i5, %o7 4000a98c: de 03 e0 04 ld [ %o7 + 4 ], %o7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 4000a990: 80 8b e0 01 btst 1, %o7 4000a994: 12 80 00 0e bne 4000a9cc <_Heap_Walk+0x5c8> 4000a998: a4 10 00 1d mov %i5, %l2 ); return false; } if ( free_block->prev != prev_block ) { 4000a99c: d8 07 60 0c ld [ %i5 + 0xc ], %o4 4000a9a0: 80 a3 00 01 cmp %o4, %g1 4000a9a4: 22 bf ff e7 be,a 4000a940 <_Heap_Walk+0x53c> 4000a9a8: fa 07 60 08 ld [ %i5 + 8 ], %i5 (*printer)( 4000a9ac: 90 10 00 19 mov %i1, %o0 4000a9b0: 92 10 20 01 mov 1, %o1 4000a9b4: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a9b8: 96 10 00 1d mov %i5, %o3 4000a9bc: 9f c5 c0 00 call %l7 4000a9c0: 94 12 a3 d0 or %o2, 0x3d0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a9c4: 10 bf fe d9 b 4000a528 <_Heap_Walk+0x124> 4000a9c8: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 4000a9cc: 90 10 00 19 mov %i1, %o0 4000a9d0: 92 10 20 01 mov 1, %o1 4000a9d4: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a9d8: 96 10 00 1d mov %i5, %o3 4000a9dc: 9f c5 c0 00 call %l7 4000a9e0: 94 12 a3 b0 or %o2, 0x3b0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000a9e4: 10 bf fe d1 b 4000a528 <_Heap_Walk+0x124> 4000a9e8: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 4000a9ec: 90 10 00 19 mov %i1, %o0 4000a9f0: 92 10 20 01 mov 1, %o1 4000a9f4: 15 10 00 5a sethi %hi(0x40016800), %o2 4000a9f8: 96 10 00 1d mov %i5, %o3 4000a9fc: 9f c5 c0 00 call %l7 4000aa00: 94 12 a3 80 or %o2, 0x380, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000aa04: 10 bf fe c9 b 4000a528 <_Heap_Walk+0x124> 4000aa08: 82 10 20 00 clr %g1 =============================================================================== 40008e0c <_IO_Initialize_all_drivers>: _IO_Driver_address_table[index] = driver_table[index]; } void _IO_Initialize_all_drivers( void ) { 40008e0c: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 40008e10: 39 10 00 7b sethi %hi(0x4001ec00), %i4 40008e14: c2 07 22 b8 ld [ %i4 + 0x2b8 ], %g1 ! 4001eeb8 <_IO_Number_of_drivers> 40008e18: ba 10 20 00 clr %i5 40008e1c: 80 a0 60 00 cmp %g1, 0 40008e20: 02 80 00 0b be 40008e4c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 40008e24: b8 17 22 b8 or %i4, 0x2b8, %i4 (void) rtems_io_initialize( major, 0, NULL ); 40008e28: 90 10 00 1d mov %i5, %o0 40008e2c: 92 10 20 00 clr %o1 40008e30: 40 00 13 77 call 4000dc0c 40008e34: 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 ++ ) 40008e38: c2 07 00 00 ld [ %i4 ], %g1 40008e3c: ba 07 60 01 inc %i5 40008e40: 80 a0 40 1d cmp %g1, %i5 40008e44: 18 bf ff fa bgu 40008e2c <_IO_Initialize_all_drivers+0x20> 40008e48: 90 10 00 1d mov %i5, %o0 40008e4c: 81 c7 e0 08 ret 40008e50: 81 e8 00 00 restore =============================================================================== 40008d3c <_IO_Manager_initialization>: #include #include void _IO_Manager_initialization(void) { 40008d3c: 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 = rtems_configuration_get_device_driver_table(); 40008d40: 03 10 00 70 sethi %hi(0x4001c000), %g1 40008d44: 82 10 61 b8 or %g1, 0x1b8, %g1 ! 4001c1b8 drivers_in_table = rtems_configuration_get_number_of_device_drivers(); 40008d48: f8 00 60 38 ld [ %g1 + 0x38 ], %i4 number_of_drivers = rtems_configuration_get_maximum_drivers(); 40008d4c: f6 00 60 34 ld [ %g1 + 0x34 ], %i3 /* * 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 ) 40008d50: 80 a7 00 1b cmp %i4, %i3 40008d54: 0a 80 00 08 bcs 40008d74 <_IO_Manager_initialization+0x38> 40008d58: fa 00 60 3c ld [ %g1 + 0x3c ], %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; 40008d5c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40008d60: fa 20 62 bc st %i5, [ %g1 + 0x2bc ] ! 4001eebc <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 40008d64: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40008d68: f8 20 62 b8 st %i4, [ %g1 + 0x2b8 ] ! 4001eeb8 <_IO_Number_of_drivers> return; 40008d6c: 81 c7 e0 08 ret 40008d70: 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 ) 40008d74: 83 2e e0 03 sll %i3, 3, %g1 40008d78: b5 2e e0 05 sll %i3, 5, %i2 40008d7c: 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( 40008d80: 40 00 0c fd call 4000c174 <_Workspace_Allocate_or_fatal_error> 40008d84: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40008d88: 03 10 00 7b sethi %hi(0x4001ec00), %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 *) 40008d8c: 33 10 00 7b sethi %hi(0x4001ec00), %i1 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40008d90: f6 20 62 b8 st %i3, [ %g1 + 0x2b8 ] /* * 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 *) 40008d94: d0 26 62 bc st %o0, [ %i1 + 0x2bc ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 40008d98: 92 10 20 00 clr %o1 40008d9c: 40 00 1d cb call 400104c8 40008da0: 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++ ) 40008da4: 80 a7 20 00 cmp %i4, 0 40008da8: 02 bf ff f1 be 40008d6c <_IO_Manager_initialization+0x30> <== NEVER TAKEN 40008dac: c8 06 62 bc ld [ %i1 + 0x2bc ], %g4 #include #include #include void _IO_Manager_initialization(void) 40008db0: 85 2f 20 03 sll %i4, 3, %g2 40008db4: b7 2f 20 05 sll %i4, 5, %i3 40008db8: 82 10 20 00 clr %g1 40008dbc: b6 26 c0 02 sub %i3, %g2, %i3 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) _IO_Driver_address_table[index] = driver_table[index]; 40008dc0: c4 07 40 01 ld [ %i5 + %g1 ], %g2 40008dc4: 86 07 40 01 add %i5, %g1, %g3 40008dc8: c4 21 00 01 st %g2, [ %g4 + %g1 ] 40008dcc: f8 00 e0 04 ld [ %g3 + 4 ], %i4 40008dd0: 84 01 00 01 add %g4, %g1, %g2 40008dd4: f8 20 a0 04 st %i4, [ %g2 + 4 ] 40008dd8: f8 00 e0 08 ld [ %g3 + 8 ], %i4 40008ddc: 82 00 60 18 add %g1, 0x18, %g1 40008de0: f8 20 a0 08 st %i4, [ %g2 + 8 ] 40008de4: f8 00 e0 0c ld [ %g3 + 0xc ], %i4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 40008de8: 80 a0 40 1b cmp %g1, %i3 _IO_Driver_address_table[index] = driver_table[index]; 40008dec: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 40008df0: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4 40008df4: f8 20 a0 10 st %i4, [ %g2 + 0x10 ] 40008df8: 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++ ) 40008dfc: 12 bf ff f1 bne 40008dc0 <_IO_Manager_initialization+0x84> 40008e00: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 40008e04: 81 c7 e0 08 ret 40008e08: 81 e8 00 00 restore =============================================================================== 40009a9c <_Internal_error_Occurred>: void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40009a9c: 9d e3 bf 90 save %sp, -112, %sp Internal_errors_t error ) { User_extensions_Fatal_context ctx = { source, is_internal, error }; _User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor ); 40009aa0: 13 10 00 2e sethi %hi(0x4000b800), %o1 40009aa4: 90 07 bf f4 add %fp, -12, %o0 40009aa8: 92 12 63 ac or %o1, 0x3ac, %o1 Internal_errors_Source source, bool is_internal, Internal_errors_t error ) { User_extensions_Fatal_context ctx = { source, is_internal, error }; 40009aac: f0 27 bf f4 st %i0, [ %fp + -12 ] 40009ab0: f2 2f bf f8 stb %i1, [ %fp + -8 ] _User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor ); 40009ab4: 40 00 08 49 call 4000bbd8 <_User_extensions_Iterate> 40009ab8: f4 27 bf fc st %i2, [ %fp + -4 ] _User_extensions_Fatal( the_source, is_internal, the_error ); _Internal_errors_What_happened.the_source = the_source; 40009abc: 05 10 00 7b sethi %hi(0x4001ec00), %g2 <== NOT EXECUTED 40009ac0: 82 10 a2 00 or %g2, 0x200, %g1 ! 4001ee00 <_Internal_errors_What_happened><== NOT EXECUTED 40009ac4: f0 20 a2 00 st %i0, [ %g2 + 0x200 ] <== NOT EXECUTED _Internal_errors_What_happened.is_internal = is_internal; 40009ac8: f2 28 60 04 stb %i1, [ %g1 + 4 ] <== NOT EXECUTED _Internal_errors_What_happened.the_error = the_error; 40009acc: f4 20 60 08 st %i2, [ %g1 + 8 ] <== NOT EXECUTED RTEMS_INLINE_ROUTINE void _System_state_Set ( System_state_Codes state ) { _System_state_Current = state; 40009ad0: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED 40009ad4: 03 10 00 7b sethi %hi(0x4001ec00), %g1 <== NOT EXECUTED _System_state_Set( SYSTEM_STATE_FAILED ); _CPU_Fatal_halt( the_error ); 40009ad8: 7f ff e2 7e call 400024d0 <== NOT EXECUTED 40009adc: c4 20 62 0c st %g2, [ %g1 + 0x20c ] ! 4001ee0c <_System_state_Current><== NOT EXECUTED 40009ae0: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED 40009ae4: 30 80 00 00 b,a 40009ae4 <_Internal_error_Occurred+0x48> <== NOT EXECUTED =============================================================================== 40009b54 <_Objects_Allocate>: #endif Objects_Control *_Objects_Allocate( Objects_Information *information ) { 40009b54: 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 ) 40009b58: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 40009b5c: 80 a0 60 00 cmp %g1, 0 40009b60: 02 80 00 26 be 40009bf8 <_Objects_Allocate+0xa4> <== NEVER TAKEN 40009b64: ba 10 00 18 mov %i0, %i5 /* * 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 ); 40009b68: b8 06 20 20 add %i0, 0x20, %i4 40009b6c: 7f ff fd 4c call 4000909c <_Chain_Get> 40009b70: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 40009b74: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 40009b78: 80 a0 60 00 cmp %g1, 0 40009b7c: 02 80 00 16 be 40009bd4 <_Objects_Allocate+0x80> 40009b80: 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 ) { 40009b84: 80 a2 20 00 cmp %o0, 0 40009b88: 02 80 00 15 be 40009bdc <_Objects_Allocate+0x88> 40009b8c: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 40009b90: c4 07 60 08 ld [ %i5 + 8 ], %g2 40009b94: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 40009b98: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 40009b9c: 03 00 00 3f sethi %hi(0xfc00), %g1 40009ba0: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 40009ba4: 90 0a 00 01 and %o0, %g1, %o0 40009ba8: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 40009bac: 40 00 3c 06 call 40018bc4 <.udiv> 40009bb0: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 40009bb4: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 40009bb8: 91 2a 20 02 sll %o0, 2, %o0 40009bbc: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 40009bc0: 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 ]--; 40009bc4: 86 00 ff ff add %g3, -1, %g3 40009bc8: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 40009bcc: 82 00 bf ff add %g2, -1, %g1 40009bd0: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 40009bd4: 81 c7 e0 08 ret 40009bd8: 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 ); 40009bdc: 40 00 00 10 call 40009c1c <_Objects_Extend_information> 40009be0: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 40009be4: 7f ff fd 2e call 4000909c <_Chain_Get> 40009be8: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 40009bec: b0 92 20 00 orcc %o0, 0, %i0 40009bf0: 32 bf ff e9 bne,a 40009b94 <_Objects_Allocate+0x40> 40009bf4: c4 07 60 08 ld [ %i5 + 8 ], %g2 * 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 ) return NULL; 40009bf8: 81 c7 e0 08 ret 40009bfc: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 40009c1c <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 40009c1c: 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 ) 40009c20: f2 06 20 34 ld [ %i0 + 0x34 ], %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 ); 40009c24: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 40009c28: 80 a6 60 00 cmp %i1, 0 40009c2c: 02 80 00 a1 be 40009eb0 <_Objects_Extend_information+0x294> 40009c30: e2 16 20 10 lduh [ %i0 + 0x10 ], %l1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 40009c34: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 40009c38: a3 2c 60 10 sll %l1, 0x10, %l1 40009c3c: 92 10 00 1b mov %i3, %o1 40009c40: 40 00 3b e1 call 40018bc4 <.udiv> 40009c44: 91 34 60 10 srl %l1, 0x10, %o0 40009c48: 91 2a 20 10 sll %o0, 0x10, %o0 40009c4c: b5 32 20 10 srl %o0, 0x10, %i2 for ( ; block < block_count; block++ ) { 40009c50: 80 a6 a0 00 cmp %i2, 0 40009c54: 02 80 00 af be 40009f10 <_Objects_Extend_information+0x2f4><== NEVER TAKEN 40009c58: 90 10 00 1b mov %i3, %o0 if ( information->object_blocks[ block ] == NULL ) { 40009c5c: c2 06 40 00 ld [ %i1 ], %g1 40009c60: 80 a0 60 00 cmp %g1, 0 40009c64: 02 80 00 b1 be 40009f28 <_Objects_Extend_information+0x30c><== NEVER TAKEN 40009c68: b8 10 00 10 mov %l0, %i4 * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 40009c6c: 10 80 00 06 b 40009c84 <_Objects_Extend_information+0x68> 40009c70: ba 10 20 00 clr %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 40009c74: c2 06 40 01 ld [ %i1 + %g1 ], %g1 40009c78: 80 a0 60 00 cmp %g1, 0 40009c7c: 22 80 00 08 be,a 40009c9c <_Objects_Extend_information+0x80> 40009c80: b6 10 20 00 clr %i3 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 40009c84: ba 07 60 01 inc %i5 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 40009c88: b8 07 00 1b add %i4, %i3, %i4 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 40009c8c: 80 a6 80 1d cmp %i2, %i5 40009c90: 18 bf ff f9 bgu 40009c74 <_Objects_Extend_information+0x58> 40009c94: 83 2f 60 02 sll %i5, 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; 40009c98: b6 10 20 01 mov 1, %i3 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 40009c9c: b3 34 60 10 srl %l1, 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 ) { 40009ca0: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 40009ca4: 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 ) { 40009ca8: 82 10 63 ff or %g1, 0x3ff, %g1 40009cac: 80 a6 40 01 cmp %i1, %g1 40009cb0: 18 80 00 9c bgu 40009f20 <_Objects_Extend_information+0x304> 40009cb4: 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; 40009cb8: 40 00 3b 89 call 40018adc <.umul> 40009cbc: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 40009cc0: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 40009cc4: 80 a0 60 00 cmp %g1, 0 40009cc8: 02 80 00 6d be 40009e7c <_Objects_Extend_information+0x260> 40009ccc: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 40009cd0: 40 00 09 1b call 4000c13c <_Workspace_Allocate> 40009cd4: 01 00 00 00 nop if ( !new_object_block ) 40009cd8: a2 92 20 00 orcc %o0, 0, %l1 40009cdc: 02 80 00 91 be 40009f20 <_Objects_Extend_information+0x304> 40009ce0: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 40009ce4: 80 8e e0 ff btst 0xff, %i3 40009ce8: 22 80 00 42 be,a 40009df0 <_Objects_Extend_information+0x1d4> 40009cec: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 40009cf0: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 */ /* * Up the block count and maximum */ block_count++; 40009cf4: b6 06 a0 01 add %i2, 1, %i3 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 40009cf8: 80 a0 60 00 cmp %g1, 0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 40009cfc: 91 2e e0 01 sll %i3, 1, %o0 40009d00: 90 02 00 1b add %o0, %i3, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 40009d04: 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 *)) + 40009d08: 90 02 00 10 add %o0, %l0, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 40009d0c: 12 80 00 60 bne 40009e8c <_Objects_Extend_information+0x270> 40009d10: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { _Workspace_Free( new_object_block ); return; } } else { object_blocks = _Workspace_Allocate_or_fatal_error( block_size ); 40009d14: 40 00 09 18 call 4000c174 <_Workspace_Allocate_or_fatal_error> 40009d18: 01 00 00 00 nop 40009d1c: a4 10 00 08 mov %o0, %l2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 40009d20: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 /* * Break the block into the various sections. */ inactive_per_block = (uint32_t *) _Addresses_Add_offset( object_blocks, block_count * sizeof(void*) ); 40009d24: b7 2e e0 02 sll %i3, 2, %i3 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 40009d28: 80 a4 00 01 cmp %l0, %g1 40009d2c: a6 04 80 1b add %l2, %i3, %l3 40009d30: 0a 80 00 67 bcs 40009ecc <_Objects_Extend_information+0x2b0> 40009d34: b6 04 c0 1b add %l3, %i3, %i3 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 40009d38: 85 2c 20 02 sll %l0, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 40009d3c: 80 a4 20 00 cmp %l0, 0 40009d40: 02 80 00 07 be 40009d5c <_Objects_Extend_information+0x140><== NEVER TAKEN 40009d44: 82 10 20 00 clr %g1 local_table[ index ] = NULL; 40009d48: c0 20 40 1b clr [ %g1 + %i3 ] 40009d4c: 82 00 60 04 add %g1, 4, %g1 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 40009d50: 80 a0 40 02 cmp %g1, %g2 40009d54: 32 bf ff fe bne,a 40009d4c <_Objects_Extend_information+0x130><== NEVER TAKEN 40009d58: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED 40009d5c: b5 2e a0 02 sll %i2, 2, %i2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40009d60: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 40009d64: c0 24 80 1a clr [ %l2 + %i2 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40009d68: 82 07 00 03 add %i4, %g3, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 40009d6c: 80 a7 00 01 cmp %i4, %g1 40009d70: 1a 80 00 0b bcc 40009d9c <_Objects_Extend_information+0x180><== NEVER TAKEN 40009d74: c0 24 c0 1a clr [ %l3 + %i2 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 40009d78: 85 2f 20 02 sll %i4, 2, %g2 40009d7c: 87 28 e0 02 sll %g3, 2, %g3 40009d80: 84 06 c0 02 add %i3, %g2, %g2 40009d84: 82 10 20 00 clr %g1 inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 40009d88: c0 20 80 01 clr [ %g2 + %g1 ] 40009d8c: 82 00 60 04 add %g1, 4, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 40009d90: 80 a0 40 03 cmp %g1, %g3 40009d94: 32 bf ff fe bne,a 40009d8c <_Objects_Extend_information+0x170> 40009d98: c0 20 80 01 clr [ %g2 + %g1 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 40009d9c: 7f ff e1 cd call 400024d0 40009da0: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40009da4: 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( 40009da8: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 40009dac: f4 06 20 34 ld [ %i0 + 0x34 ], %i2 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 40009db0: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 40009db4: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40009db8: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 40009dbc: e4 26 20 34 st %l2, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 40009dc0: e6 26 20 30 st %l3, [ %i0 + 0x30 ] information->local_table = local_table; 40009dc4: f6 26 20 1c st %i3, [ %i0 + 0x1c ] uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40009dc8: 03 00 00 40 sethi %hi(0x10000), %g1 40009dcc: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40009dd0: 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) | 40009dd4: b2 10 40 19 or %g1, %i1, %i1 information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 40009dd8: f2 26 20 0c st %i1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 40009ddc: 7f ff e1 c1 call 400024e0 40009de0: 01 00 00 00 nop _Workspace_Free( old_tables ); 40009de4: 40 00 08 de call 4000c15c <_Workspace_Free> 40009de8: 90 10 00 1a mov %i2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 40009dec: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 40009df0: bb 2f 60 02 sll %i5, 2, %i5 40009df4: e2 20 40 1d st %l1, [ %g1 + %i5 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 40009df8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 40009dfc: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 40009e00: d2 00 40 1d ld [ %g1 + %i5 ], %o1 40009e04: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 40009e08: 90 07 bf f4 add %fp, -12, %o0 40009e0c: 7f ff fc b4 call 400090dc <_Chain_Initialize> 40009e10: 35 00 00 40 sethi %hi(0x10000), %i2 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 40009e14: 10 80 00 0d b 40009e48 <_Objects_Extend_information+0x22c> 40009e18: b6 06 20 20 add %i0, 0x20, %i3 the_object->id = _Objects_Build_id( 40009e1c: c6 16 20 04 lduh [ %i0 + 4 ], %g3 40009e20: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40009e24: 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) | 40009e28: 84 10 80 1a or %g2, %i2, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40009e2c: 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) | 40009e30: 84 10 80 1c or %g2, %i4, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 40009e34: 90 10 00 1b mov %i3, %o0 40009e38: 92 10 00 01 mov %g1, %o1 index++; 40009e3c: b8 07 20 01 inc %i4 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 40009e40: 7f ff fc 8c call 40009070 <_Chain_Append> 40009e44: 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 ) { 40009e48: 7f ff fc 95 call 4000909c <_Chain_Get> 40009e4c: 90 07 bf f4 add %fp, -12, %o0 40009e50: 82 92 20 00 orcc %o0, 0, %g1 40009e54: 32 bf ff f2 bne,a 40009e1c <_Objects_Extend_information+0x200> 40009e58: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 40009e5c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 40009e60: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 40009e64: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 40009e68: c8 20 c0 1d st %g4, [ %g3 + %i5 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 40009e6c: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 40009e70: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 40009e74: 81 c7 e0 08 ret 40009e78: 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 ); 40009e7c: 40 00 08 be call 4000c174 <_Workspace_Allocate_or_fatal_error> 40009e80: 01 00 00 00 nop 40009e84: 10 bf ff 98 b 40009ce4 <_Objects_Extend_information+0xc8> 40009e88: a2 10 00 08 mov %o0, %l1 */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { object_blocks = _Workspace_Allocate( block_size ); 40009e8c: 40 00 08 ac call 4000c13c <_Workspace_Allocate> 40009e90: 01 00 00 00 nop if ( !object_blocks ) { 40009e94: a4 92 20 00 orcc %o0, 0, %l2 40009e98: 32 bf ff a3 bne,a 40009d24 <_Objects_Extend_information+0x108> 40009e9c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 _Workspace_Free( new_object_block ); 40009ea0: 40 00 08 af call 4000c15c <_Workspace_Free> 40009ea4: 90 10 00 11 mov %l1, %o0 40009ea8: 81 c7 e0 08 ret 40009eac: 81 e8 00 00 restore 40009eb0: 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 ); 40009eb4: b8 10 00 10 mov %l0, %i4 /* * 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; 40009eb8: b6 10 20 01 mov 1, %i3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 40009ebc: ba 10 20 00 clr %i5 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 40009ec0: b4 10 20 00 clr %i2 40009ec4: 10 bf ff 76 b 40009c9c <_Objects_Extend_information+0x80> 40009ec8: a3 2c 60 10 sll %l1, 0x10, %l1 /* * 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, 40009ecc: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 40009ed0: b5 2e a0 02 sll %i2, 2, %i2 /* * 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, 40009ed4: 90 10 00 12 mov %l2, %o0 40009ed8: 40 00 19 3f call 400103d4 40009edc: 94 10 00 1a mov %i2, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 40009ee0: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 40009ee4: 94 10 00 1a mov %i2, %o2 40009ee8: 40 00 19 3b call 400103d4 40009eec: 90 10 00 13 mov %l3, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 40009ef0: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 40009ef4: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 40009ef8: 94 02 80 10 add %o2, %l0, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 40009efc: 90 10 00 1b mov %i3, %o0 40009f00: 40 00 19 35 call 400103d4 40009f04: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40009f08: 10 bf ff 97 b 40009d64 <_Objects_Extend_information+0x148> 40009f0c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 /* * 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 ); 40009f10: b8 10 00 10 mov %l0, %i4 <== 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; 40009f14: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 40009f18: 10 bf ff 61 b 40009c9c <_Objects_Extend_information+0x80> <== NOT EXECUTED 40009f1c: ba 10 20 00 clr %i5 <== NOT EXECUTED 40009f20: 81 c7 e0 08 ret 40009f24: 81 e8 00 00 restore else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 40009f28: b6 10 20 00 clr %i3 <== NOT EXECUTED * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 40009f2c: 10 bf ff 5c b 40009c9c <_Objects_Extend_information+0x80> <== NOT EXECUTED 40009f30: ba 10 20 00 clr %i5 <== NOT EXECUTED =============================================================================== 40009fe4 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 40009fe4: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 40009fe8: 80 a6 60 00 cmp %i1, 0 40009fec: 02 80 00 19 be 4000a050 <_Objects_Get_information+0x6c> 40009ff0: 01 00 00 00 nop /* * 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 ); 40009ff4: 40 00 10 7a call 4000e1dc <_Objects_API_maximum_class> 40009ff8: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 40009ffc: 80 a2 20 00 cmp %o0, 0 4000a000: 02 80 00 14 be 4000a050 <_Objects_Get_information+0x6c> 4000a004: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 4000a008: 0a 80 00 12 bcs 4000a050 <_Objects_Get_information+0x6c> 4000a00c: 03 10 00 7a sethi %hi(0x4001e800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 4000a010: b1 2e 20 02 sll %i0, 2, %i0 4000a014: 82 10 63 74 or %g1, 0x374, %g1 4000a018: c2 00 40 18 ld [ %g1 + %i0 ], %g1 4000a01c: 80 a0 60 00 cmp %g1, 0 4000a020: 02 80 00 0c be 4000a050 <_Objects_Get_information+0x6c> <== NEVER TAKEN 4000a024: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 4000a028: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 4000a02c: 80 a6 20 00 cmp %i0, 0 4000a030: 02 80 00 08 be 4000a050 <_Objects_Get_information+0x6c> <== NEVER TAKEN 4000a034: 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 ) 4000a038: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 4000a03c: 80 a0 60 00 cmp %g1, 0 4000a040: 02 80 00 04 be 4000a050 <_Objects_Get_information+0x6c> 4000a044: 01 00 00 00 nop return NULL; #endif return info; } 4000a048: 81 c7 e0 08 ret 4000a04c: 81 e8 00 00 restore { Objects_Information *info; int the_class_api_maximum; if ( !the_class ) return NULL; 4000a050: 81 c7 e0 08 ret 4000a054: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 40017bd4 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 40017bd4: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 40017bd8: 80 a6 60 00 cmp %i1, 0 40017bdc: 02 80 00 3d be 40017cd0 <_Objects_Get_name_as_string+0xfc> 40017be0: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 40017be4: 02 80 00 3b be 40017cd0 <_Objects_Get_name_as_string+0xfc> 40017be8: ba 96 20 00 orcc %i0, 0, %i5 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 40017bec: 02 80 00 36 be 40017cc4 <_Objects_Get_name_as_string+0xf0> 40017bf0: 03 10 00 c8 sethi %hi(0x40032000), %g1 information = _Objects_Get_information_id( tmpId ); 40017bf4: 7f ff e2 c5 call 40010708 <_Objects_Get_information_id> 40017bf8: 90 10 00 1d mov %i5, %o0 if ( !information ) 40017bfc: 80 a2 20 00 cmp %o0, 0 40017c00: 02 80 00 34 be 40017cd0 <_Objects_Get_name_as_string+0xfc> 40017c04: 92 10 00 1d mov %i5, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 40017c08: 7f ff e3 00 call 40010808 <_Objects_Get> 40017c0c: 94 07 bf f4 add %fp, -12, %o2 switch ( location ) { 40017c10: c2 07 bf f4 ld [ %fp + -12 ], %g1 40017c14: 80 a0 60 00 cmp %g1, 0 40017c18: 32 80 00 2f bne,a 40017cd4 <_Objects_Get_name_as_string+0x100> 40017c1c: 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; 40017c20: 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'; 40017c24: c0 2f bf fc clrb [ %fp + -4 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 40017c28: 87 30 60 18 srl %g1, 0x18, %g3 lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 40017c2c: 85 30 60 08 srl %g1, 8, %g2 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 40017c30: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 40017c34: c4 2f bf fa stb %g2, [ %fp + -6 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 40017c38: c6 2f bf f8 stb %g3, [ %fp + -8 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 40017c3c: c8 2f bf f9 stb %g4, [ %fp + -7 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 40017c40: c2 2f bf fb stb %g1, [ %fp + -5 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 40017c44: b2 86 7f ff addcc %i1, -1, %i1 40017c48: 02 80 00 25 be 40017cdc <_Objects_Get_name_as_string+0x108><== NEVER TAKEN 40017c4c: 84 10 00 03 mov %g3, %g2 40017c50: 80 a0 e0 00 cmp %g3, 0 40017c54: 02 80 00 17 be 40017cb0 <_Objects_Get_name_as_string+0xdc> 40017c58: 86 10 00 1a mov %i2, %g3 40017c5c: 39 10 00 c2 sethi %hi(0x40030800), %i4 40017c60: 82 10 20 00 clr %g1 40017c64: 10 80 00 06 b 40017c7c <_Objects_Get_name_as_string+0xa8> 40017c68: b8 17 23 b0 or %i4, 0x3b0, %i4 40017c6c: fa 49 00 01 ldsb [ %g4 + %g1 ], %i5 40017c70: 80 a7 60 00 cmp %i5, 0 40017c74: 02 80 00 0f be 40017cb0 <_Objects_Get_name_as_string+0xdc> 40017c78: c4 08 40 04 ldub [ %g1 + %g4 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 40017c7c: fa 07 00 00 ld [ %i4 ], %i5 40017c80: 88 08 a0 ff and %g2, 0xff, %g4 40017c84: 88 07 40 04 add %i5, %g4, %g4 40017c88: fa 49 20 01 ldsb [ %g4 + 1 ], %i5 40017c8c: 80 8f 60 97 btst 0x97, %i5 40017c90: 12 80 00 03 bne 40017c9c <_Objects_Get_name_as_string+0xc8> 40017c94: 88 07 bf f8 add %fp, -8, %g4 40017c98: 84 10 20 2a mov 0x2a, %g2 40017c9c: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 40017ca0: 82 00 60 01 inc %g1 40017ca4: 80 a0 40 19 cmp %g1, %i1 40017ca8: 12 bf ff f1 bne 40017c6c <_Objects_Get_name_as_string+0x98> 40017cac: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; 40017cb0: c0 28 c0 00 clrb [ %g3 ] _Thread_Enable_dispatch(); 40017cb4: 7f ff e6 d2 call 400117fc <_Thread_Enable_dispatch> 40017cb8: b0 10 00 1a mov %i2, %i0 return name; } return NULL; /* unreachable path */ } 40017cbc: 81 c7 e0 08 ret 40017cc0: 81 e8 00 00 restore return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 40017cc4: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 40017cc8: 10 bf ff cb b 40017bf4 <_Objects_Get_name_as_string+0x20> 40017ccc: fa 00 60 08 ld [ %g1 + 8 ], %i5 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 40017cd0: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 40017cd4: 81 c7 e0 08 ret 40017cd8: 91 e8 00 1a restore %g0, %i2, %o0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 40017cdc: 10 bf ff f5 b 40017cb0 <_Objects_Get_name_as_string+0xdc> <== NOT EXECUTED 40017ce0: 86 10 00 1a mov %i2, %g3 <== NOT EXECUTED =============================================================================== 4001a3fc <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 4001a3fc: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) 4001a400: 80 a6 20 00 cmp %i0, 0 4001a404: 02 80 00 29 be 4001a4a8 <_Objects_Get_next+0xac> 4001a408: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( !location_p ) 4001a40c: 02 80 00 27 be 4001a4a8 <_Objects_Get_next+0xac> 4001a410: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 4001a414: 02 80 00 25 be 4001a4a8 <_Objects_Get_next+0xac> 4001a418: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 4001a41c: 80 a0 60 00 cmp %g1, 0 4001a420: 22 80 00 13 be,a 4001a46c <_Objects_Get_next+0x70> 4001a424: 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) 4001a428: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 4001a42c: 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); 4001a430: 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) 4001a434: 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); 4001a438: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 4001a43c: 80 a0 80 01 cmp %g2, %g1 4001a440: 0a 80 00 13 bcs 4001a48c <_Objects_Get_next+0x90> 4001a444: 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); 4001a448: 7f ff d8 f0 call 40010808 <_Objects_Get> 4001a44c: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 4001a450: c2 06 80 00 ld [ %i2 ], %g1 4001a454: 80 a0 60 00 cmp %g1, 0 4001a458: 32 bf ff f5 bne,a 4001a42c <_Objects_Get_next+0x30> 4001a45c: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 *next_id_p = next_id; 4001a460: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 4001a464: 81 c7 e0 08 ret 4001a468: 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) 4001a46c: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 4001a470: 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); 4001a474: 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) 4001a478: 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); 4001a47c: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 4001a480: 80 a0 80 01 cmp %g2, %g1 4001a484: 1a bf ff f1 bcc 4001a448 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN 4001a488: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 4001a48c: 82 10 20 01 mov 1, %g1 4001a490: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 4001a494: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 4001a498: 82 10 3f ff mov -1, %g1 4001a49c: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 4001a4a0: 81 c7 e0 08 ret 4001a4a4: 91 e8 00 08 restore %g0, %o0, %o0 { Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 4001a4a8: 10 bf ff ef b 4001a464 <_Objects_Get_next+0x68> 4001a4ac: 90 10 20 00 clr %o0 =============================================================================== 4001b518 <_Objects_Get_no_protection>: /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 4001b518: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 4001b51c: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1 /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 4001b520: 92 22 40 02 sub %o1, %g2, %o1 4001b524: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 4001b528: 80 a2 40 01 cmp %o1, %g1 4001b52c: 18 80 00 09 bgu 4001b550 <_Objects_Get_no_protection+0x38> 4001b530: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 4001b534: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 4001b538: d0 00 40 09 ld [ %g1 + %o1 ], %o0 4001b53c: 80 a2 20 00 cmp %o0, 0 4001b540: 02 80 00 05 be 4001b554 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 4001b544: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 4001b548: 81 c3 e0 08 retl 4001b54c: c0 22 80 00 clr [ %o2 ] /* * This isn't supported or required yet for Global objects so * if it isn't local, we don't find it. */ *location = OBJECTS_ERROR; 4001b550: 82 10 20 01 mov 1, %g1 return NULL; 4001b554: 90 10 20 00 clr %o0 } 4001b558: 81 c3 e0 08 retl 4001b55c: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 4001087c <_Objects_Id_to_name>: Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 4001087c: 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; 40010880: 80 a6 20 00 cmp %i0, 0 40010884: 12 80 00 06 bne 4001089c <_Objects_Id_to_name+0x20> 40010888: 83 36 20 18 srl %i0, 0x18, %g1 4001088c: 03 10 00 c8 sethi %hi(0x40032000), %g1 40010890: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 ! 40032020 <_Per_CPU_Information+0x10> 40010894: f0 00 60 08 ld [ %g1 + 8 ], %i0 40010898: 83 36 20 18 srl %i0, 0x18, %g1 4001089c: 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 ) 400108a0: 84 00 7f ff add %g1, -1, %g2 400108a4: 80 a0 a0 02 cmp %g2, 2 400108a8: 18 80 00 18 bgu 40010908 <_Objects_Id_to_name+0x8c> 400108ac: 83 28 60 02 sll %g1, 2, %g1 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 400108b0: 05 10 00 c7 sethi %hi(0x40031c00), %g2 400108b4: 84 10 a1 34 or %g2, 0x134, %g2 ! 40031d34 <_Objects_Information_table> 400108b8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 400108bc: 80 a0 60 00 cmp %g1, 0 400108c0: 02 80 00 12 be 40010908 <_Objects_Id_to_name+0x8c> 400108c4: 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 ]; 400108c8: 85 28 a0 02 sll %g2, 2, %g2 400108cc: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 400108d0: 80 a2 20 00 cmp %o0, 0 400108d4: 02 80 00 0d be 40010908 <_Objects_Id_to_name+0x8c> <== NEVER TAKEN 400108d8: 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 ); 400108dc: 7f ff ff cb call 40010808 <_Objects_Get> 400108e0: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 400108e4: 80 a2 20 00 cmp %o0, 0 400108e8: 02 80 00 08 be 40010908 <_Objects_Id_to_name+0x8c> 400108ec: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 400108f0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 400108f4: b0 10 20 00 clr %i0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 400108f8: 40 00 03 c1 call 400117fc <_Thread_Enable_dispatch> 400108fc: c2 26 40 00 st %g1, [ %i1 ] 40010900: 81 c7 e0 08 ret 40010904: 81 e8 00 00 restore tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; 40010908: 81 c7 e0 08 ret 4001090c: 91 e8 20 03 restore %g0, 3, %o0 =============================================================================== 4000a2d0 <_Objects_Shrink_information>: #include void _Objects_Shrink_information( Objects_Information *information ) { 4000a2d0: 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 ); 4000a2d4: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 block_count = (information->maximum - index_base) / 4000a2d8: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 4000a2dc: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 4000a2e0: 92 10 00 1b mov %i3, %o1 4000a2e4: 40 00 3a 38 call 40018bc4 <.udiv> 4000a2e8: 90 22 00 1c sub %o0, %i4, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 4000a2ec: 80 a2 20 00 cmp %o0, 0 4000a2f0: 02 80 00 36 be 4000a3c8 <_Objects_Shrink_information+0xf8><== NEVER TAKEN 4000a2f4: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 4000a2f8: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 4000a2fc: c2 01 00 00 ld [ %g4 ], %g1 4000a300: 80 a6 c0 01 cmp %i3, %g1 4000a304: 02 80 00 0f be 4000a340 <_Objects_Shrink_information+0x70><== NEVER TAKEN 4000a308: 82 10 20 00 clr %g1 4000a30c: 10 80 00 07 b 4000a328 <_Objects_Shrink_information+0x58> 4000a310: ba 10 20 04 mov 4, %i5 4000a314: c4 01 00 1d ld [ %g4 + %i5 ], %g2 4000a318: 80 a6 c0 02 cmp %i3, %g2 4000a31c: 02 80 00 0a be 4000a344 <_Objects_Shrink_information+0x74> 4000a320: 86 07 60 04 add %i5, 4, %g3 4000a324: ba 10 00 03 mov %g3, %i5 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 4000a328: 82 00 60 01 inc %g1 4000a32c: 80 a0 40 08 cmp %g1, %o0 4000a330: 12 bf ff f9 bne 4000a314 <_Objects_Shrink_information+0x44> 4000a334: b8 07 00 1b add %i4, %i3, %i4 4000a338: 81 c7 e0 08 ret 4000a33c: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 4000a340: ba 10 20 00 clr %i5 <== NOT EXECUTED * 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 ); 4000a344: 35 00 00 3f sethi %hi(0xfc00), %i2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 4000a348: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 4000a34c: 10 80 00 05 b 4000a360 <_Objects_Shrink_information+0x90> 4000a350: b4 16 a3 ff or %i2, 0x3ff, %i2 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 4000a354: 90 96 e0 00 orcc %i3, 0, %o0 4000a358: 22 80 00 12 be,a 4000a3a0 <_Objects_Shrink_information+0xd0> 4000a35c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * 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 ); 4000a360: c2 02 20 08 ld [ %o0 + 8 ], %g1 4000a364: 82 08 40 1a and %g1, %i2, %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) && 4000a368: 80 a0 40 1c cmp %g1, %i4 4000a36c: 0a bf ff fa bcs 4000a354 <_Objects_Shrink_information+0x84> 4000a370: f6 02 00 00 ld [ %o0 ], %i3 (index < (index_base + information->allocation_size))) { 4000a374: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 4000a378: 84 07 00 02 add %i4, %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) && 4000a37c: 80 a0 40 02 cmp %g1, %g2 4000a380: 3a bf ff f6 bcc,a 4000a358 <_Objects_Shrink_information+0x88> 4000a384: 90 96 e0 00 orcc %i3, 0, %o0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 4000a388: 40 00 0e 38 call 4000dc68 <_Chain_Extract> 4000a38c: 01 00 00 00 nop } } while ( the_object ); 4000a390: 90 96 e0 00 orcc %i3, 0, %o0 4000a394: 32 bf ff f4 bne,a 4000a364 <_Objects_Shrink_information+0x94><== ALWAYS TAKEN 4000a398: c2 02 20 08 ld [ %o0 + 8 ], %g1 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 4000a39c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 4000a3a0: 40 00 07 6f call 4000c15c <_Workspace_Free> 4000a3a4: d0 00 40 1d ld [ %g1 + %i5 ], %o0 information->object_blocks[ block ] = NULL; 4000a3a8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 4000a3ac: 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; 4000a3b0: c0 20 40 1d clr [ %g1 + %i5 ] information->inactive_per_block[ block ] = 0; 4000a3b4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 4000a3b8: 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; 4000a3bc: c0 20 c0 1d clr [ %g3 + %i5 ] information->inactive -= information->allocation_size; 4000a3c0: 82 20 80 01 sub %g2, %g1, %g1 4000a3c4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 4000a3c8: 81 c7 e0 08 ret 4000a3cc: 81 e8 00 00 restore =============================================================================== 4000af60 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 4000af60: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 4000af64: 80 a6 60 00 cmp %i1, 0 4000af68: 02 80 00 4c be 4000b098 <_RBTree_Extract_unprotected+0x138> 4000af6c: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 4000af70: c2 06 20 08 ld [ %i0 + 8 ], %g1 4000af74: 80 a0 40 19 cmp %g1, %i1 4000af78: 02 80 00 56 be 4000b0d0 <_RBTree_Extract_unprotected+0x170> 4000af7c: 90 10 00 19 mov %i1, %o0 the_rbtree->first[RBT_LEFT] = next; } /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 4000af80: c2 06 20 0c ld [ %i0 + 0xc ], %g1 4000af84: 80 a0 40 19 cmp %g1, %i1 4000af88: 02 80 00 56 be 4000b0e0 <_RBTree_Extract_unprotected+0x180> 4000af8c: 90 10 00 19 mov %i1, %o0 * 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]) { 4000af90: fa 06 60 04 ld [ %i1 + 4 ], %i5 4000af94: 80 a7 60 00 cmp %i5, 0 4000af98: 22 80 00 5a be,a 4000b100 <_RBTree_Extract_unprotected+0x1a0> 4000af9c: f8 06 60 08 ld [ %i1 + 8 ], %i4 4000afa0: c2 06 60 08 ld [ %i1 + 8 ], %g1 4000afa4: 80 a0 60 00 cmp %g1, 0 4000afa8: 32 80 00 05 bne,a 4000afbc <_RBTree_Extract_unprotected+0x5c> 4000afac: c2 07 60 08 ld [ %i5 + 8 ], %g1 4000afb0: 10 80 00 3c b 4000b0a0 <_RBTree_Extract_unprotected+0x140> 4000afb4: b8 10 00 1d mov %i5, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 4000afb8: c2 07 60 08 ld [ %i5 + 8 ], %g1 4000afbc: 80 a0 60 00 cmp %g1, 0 4000afc0: 32 bf ff fe bne,a 4000afb8 <_RBTree_Extract_unprotected+0x58> 4000afc4: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 4000afc8: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 4000afcc: 80 a7 20 00 cmp %i4, 0 4000afd0: 02 80 00 48 be 4000b0f0 <_RBTree_Extract_unprotected+0x190> 4000afd4: 01 00 00 00 nop leaf->parent = target->parent; 4000afd8: c2 07 40 00 ld [ %i5 ], %g1 4000afdc: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 4000afe0: c4 07 40 00 ld [ %i5 ], %g2 target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 4000afe4: c2 06 40 00 ld [ %i1 ], %g1 } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 4000afe8: c8 00 a0 04 ld [ %g2 + 4 ], %g4 leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 4000afec: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 4000aff0: 88 1f 40 04 xor %i5, %g4, %g4 4000aff4: 80 a0 00 04 cmp %g0, %g4 4000aff8: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 4000affc: 89 29 20 02 sll %g4, 2, %g4 4000b000: 84 00 80 04 add %g2, %g4, %g2 4000b004: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 4000b008: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000b00c: 84 18 80 19 xor %g2, %i1, %g2 4000b010: 80 a0 00 02 cmp %g0, %g2 4000b014: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 4000b018: 85 28 a0 02 sll %g2, 2, %g2 4000b01c: 82 00 40 02 add %g1, %g2, %g1 4000b020: fa 20 60 04 st %i5, [ %g1 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 4000b024: c2 06 60 08 ld [ %i1 + 8 ], %g1 4000b028: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 4000b02c: c2 06 60 08 ld [ %i1 + 8 ], %g1 4000b030: 80 a0 60 00 cmp %g1, 0 4000b034: 32 80 00 02 bne,a 4000b03c <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 4000b038: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 4000b03c: c2 06 60 04 ld [ %i1 + 4 ], %g1 4000b040: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 4000b044: c2 06 60 04 ld [ %i1 + 4 ], %g1 4000b048: 80 a0 60 00 cmp %g1, 0 4000b04c: 32 80 00 02 bne,a 4000b054 <_RBTree_Extract_unprotected+0xf4> 4000b050: fa 20 40 00 st %i5, [ %g1 ] /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 4000b054: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 4000b058: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 4000b05c: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 4000b060: c2 27 60 0c st %g1, [ %i5 + 0xc ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 4000b064: 80 a0 e0 00 cmp %g3, 0 4000b068: 32 80 00 06 bne,a 4000b080 <_RBTree_Extract_unprotected+0x120> 4000b06c: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 4000b070: 80 a7 20 00 cmp %i4, 0 4000b074: 32 80 00 02 bne,a 4000b07c <_RBTree_Extract_unprotected+0x11c> 4000b078: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 4000b07c: 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; 4000b080: c0 26 60 08 clr [ %i1 + 8 ] 4000b084: c0 26 60 04 clr [ %i1 + 4 ] 4000b088: 80 a0 60 00 cmp %g1, 0 4000b08c: 02 80 00 03 be 4000b098 <_RBTree_Extract_unprotected+0x138> 4000b090: c0 26 40 00 clr [ %i1 ] 4000b094: c0 20 60 0c clr [ %g1 + 0xc ] 4000b098: 81 c7 e0 08 ret 4000b09c: 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; 4000b0a0: c2 06 40 00 ld [ %i1 ], %g1 4000b0a4: 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]; 4000b0a8: 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; 4000b0ac: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 4000b0b0: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000b0b4: 84 18 80 19 xor %g2, %i1, %g2 4000b0b8: 80 a0 00 02 cmp %g0, %g2 4000b0bc: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 4000b0c0: 85 28 a0 02 sll %g2, 2, %g2 4000b0c4: 82 00 40 02 add %g1, %g2, %g1 4000b0c8: 10 bf ff e7 b 4000b064 <_RBTree_Extract_unprotected+0x104> 4000b0cc: f8 20 60 04 st %i4, [ %g1 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_RIGHT ); 4000b0d0: 40 00 00 eb call 4000b47c <_RBTree_Next_unprotected> 4000b0d4: 92 10 20 01 mov 1, %o1 /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { RBTree_Node *next; next = _RBTree_Successor_unprotected(the_node); the_rbtree->first[RBT_LEFT] = next; 4000b0d8: 10 bf ff aa b 4000af80 <_RBTree_Extract_unprotected+0x20> 4000b0dc: d0 26 20 08 st %o0, [ %i0 + 8 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_LEFT ); 4000b0e0: 40 00 00 e7 call 4000b47c <_RBTree_Next_unprotected> 4000b0e4: 92 10 20 00 clr %o1 /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { RBTree_Node *previous; previous = _RBTree_Predecessor_unprotected(the_node); the_rbtree->first[RBT_RIGHT] = previous; 4000b0e8: 10 bf ff aa b 4000af90 <_RBTree_Extract_unprotected+0x30> 4000b0ec: d0 26 20 0c st %o0, [ %i0 + 0xc ] 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); 4000b0f0: 7f ff fe d3 call 4000ac3c <_RBTree_Extract_validate_unprotected> 4000b0f4: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 4000b0f8: 10 bf ff bb b 4000afe4 <_RBTree_Extract_unprotected+0x84> 4000b0fc: c4 07 40 00 ld [ %i5 ], %g2 * 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 ) { 4000b100: 80 a7 20 00 cmp %i4, 0 4000b104: 32 bf ff e8 bne,a 4000b0a4 <_RBTree_Extract_unprotected+0x144> 4000b108: 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); 4000b10c: 7f ff fe cc call 4000ac3c <_RBTree_Extract_validate_unprotected> 4000b110: 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]; 4000b114: 10 bf ff e6 b 4000b0ac <_RBTree_Extract_unprotected+0x14c> 4000b118: c2 06 40 00 ld [ %i1 ], %g1 =============================================================================== 4000ac3c <_RBTree_Extract_validate_unprotected>: ) { RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 4000ac3c: c2 02 00 00 ld [ %o0 ], %g1 if(!parent->parent) return; 4000ac40: c4 00 40 00 ld [ %g1 ], %g2 4000ac44: 80 a0 a0 00 cmp %g2, 0 4000ac48: 02 80 00 3f be 4000ad44 <_RBTree_Extract_validate_unprotected+0x108> 4000ac4c: 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]) 4000ac50: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000ac54: 80 a2 00 02 cmp %o0, %g2 4000ac58: 22 80 00 02 be,a 4000ac60 <_RBTree_Extract_validate_unprotected+0x24> 4000ac5c: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 4000ac60: c6 02 20 0c ld [ %o0 + 0xc ], %g3 4000ac64: 80 a0 e0 01 cmp %g3, 1 4000ac68: 02 80 00 32 be 4000ad30 <_RBTree_Extract_validate_unprotected+0xf4> 4000ac6c: 9a 10 20 01 mov 1, %o5 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) { 4000ac70: c6 00 40 00 ld [ %g1 ], %g3 4000ac74: 80 a0 e0 00 cmp %g3, 0 4000ac78: 02 80 00 2e be 4000ad30 <_RBTree_Extract_validate_unprotected+0xf4> 4000ac7c: 80 a0 a0 00 cmp %g2, 0 4000ac80: 22 80 00 07 be,a 4000ac9c <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 4000ac84: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 4000ac88: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 4000ac8c: 80 a1 20 01 cmp %g4, 1 4000ac90: 22 80 00 63 be,a 4000ae1c <_RBTree_Extract_validate_unprotected+0x1e0> 4000ac94: d8 00 60 04 ld [ %g1 + 4 ], %o4 _RBTree_Rotate(parent, dir); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 4000ac98: c6 00 a0 08 ld [ %g2 + 8 ], %g3 4000ac9c: 80 a0 e0 00 cmp %g3, 0 4000aca0: 22 80 00 07 be,a 4000acbc <_RBTree_Extract_validate_unprotected+0x80> 4000aca4: c6 00 a0 04 ld [ %g2 + 4 ], %g3 4000aca8: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 4000acac: 80 a0 e0 01 cmp %g3, 1 4000acb0: 22 80 00 29 be,a 4000ad54 <_RBTree_Extract_validate_unprotected+0x118> 4000acb4: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 4000acb8: c6 00 a0 04 ld [ %g2 + 4 ], %g3 4000acbc: 80 a0 e0 00 cmp %g3, 0 4000acc0: 22 80 00 07 be,a 4000acdc <_RBTree_Extract_validate_unprotected+0xa0> 4000acc4: da 20 a0 0c st %o5, [ %g2 + 0xc ] 4000acc8: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 4000accc: 80 a0 e0 01 cmp %g3, 1 4000acd0: 22 80 00 21 be,a 4000ad54 <_RBTree_Extract_validate_unprotected+0x118> 4000acd4: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 4000acd8: da 20 a0 0c st %o5, [ %g2 + 0xc ] 4000acdc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 4000ace0: 80 a0 a0 01 cmp %g2, 1 4000ace4: 22 80 00 99 be,a 4000af48 <_RBTree_Extract_validate_unprotected+0x30c> 4000ace8: c0 20 60 0c clr [ %g1 + 0xc ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 4000acec: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 4000acf0: 80 a0 e0 00 cmp %g3, 0 4000acf4: 02 80 00 6c be 4000aea4 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN 4000acf8: 90 10 00 01 mov %g1, %o0 if(!(the_node->parent->parent)) return NULL; 4000acfc: c4 00 c0 00 ld [ %g3 ], %g2 4000ad00: 80 a0 a0 00 cmp %g2, 0 4000ad04: 02 80 00 69 be 4000aea8 <_RBTree_Extract_validate_unprotected+0x26c> 4000ad08: 84 10 20 00 clr %g2 if(the_node == the_node->parent->child[RBT_LEFT]) 4000ad0c: c4 00 e0 04 ld [ %g3 + 4 ], %g2 4000ad10: 80 a0 40 02 cmp %g1, %g2 4000ad14: 22 80 00 0e be,a 4000ad4c <_RBTree_Extract_validate_unprotected+0x110> 4000ad18: c4 00 e0 08 ld [ %g3 + 8 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 4000ad1c: 82 10 00 03 mov %g3, %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 4000ad20: c6 02 20 0c ld [ %o0 + 0xc ], %g3 4000ad24: 80 a0 e0 01 cmp %g3, 1 4000ad28: 32 bf ff d3 bne,a 4000ac74 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 4000ad2c: c6 00 40 00 ld [ %g1 ], %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 4000ad30: c2 02 00 00 ld [ %o0 ], %g1 4000ad34: c2 00 40 00 ld [ %g1 ], %g1 4000ad38: 80 a0 60 00 cmp %g1, 0 4000ad3c: 02 80 00 5f be 4000aeb8 <_RBTree_Extract_validate_unprotected+0x27c> 4000ad40: 01 00 00 00 nop 4000ad44: 81 c3 e0 08 retl 4000ad48: 01 00 00 00 nop RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 4000ad4c: 10 bf ff f5 b 4000ad20 <_RBTree_Extract_validate_unprotected+0xe4> 4000ad50: 82 10 00 03 mov %g3, %g1 * 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]; 4000ad54: 86 1a 00 03 xor %o0, %g3, %g3 4000ad58: 80 a0 00 03 cmp %g0, %g3 4000ad5c: 9a 40 20 00 addx %g0, 0, %o5 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 4000ad60: 86 1b 60 01 xor %o5, 1, %g3 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 4000ad64: 87 28 e0 02 sll %g3, 2, %g3 4000ad68: 88 00 80 03 add %g2, %g3, %g4 4000ad6c: 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); 4000ad70: 80 a1 20 00 cmp %g4, 0 4000ad74: 22 80 00 07 be,a 4000ad90 <_RBTree_Extract_validate_unprotected+0x154> 4000ad78: 9b 2b 60 02 sll %o5, 2, %o5 4000ad7c: d8 01 20 0c ld [ %g4 + 0xc ], %o4 4000ad80: 80 a3 20 01 cmp %o4, 1 4000ad84: 22 80 00 4f be,a 4000aec0 <_RBTree_Extract_validate_unprotected+0x284> 4000ad88: d6 00 60 0c ld [ %g1 + 0xc ], %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 4000ad8c: 9b 2b 60 02 sll %o5, 2, %o5 4000ad90: 98 00 80 0d add %g2, %o5, %o4 4000ad94: c8 03 20 04 ld [ %o4 + 4 ], %g4 * 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[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; 4000ad98: 96 10 20 01 mov 1, %o3 4000ad9c: d6 20 a0 0c st %o3, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 4000ada0: 80 a1 20 00 cmp %g4, 0 4000ada4: 02 80 00 15 be 4000adf8 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 4000ada8: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 4000adac: 96 01 00 03 add %g4, %g3, %o3 4000adb0: d4 02 e0 04 ld [ %o3 + 4 ], %o2 4000adb4: d4 23 20 04 st %o2, [ %o4 + 4 ] if (c->child[dir]) 4000adb8: d8 02 e0 04 ld [ %o3 + 4 ], %o4 4000adbc: 80 a3 20 00 cmp %o4, 0 4000adc0: 32 80 00 02 bne,a 4000adc8 <_RBTree_Extract_validate_unprotected+0x18c> 4000adc4: c4 23 00 00 st %g2, [ %o4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000adc8: d8 00 80 00 ld [ %g2 ], %o4 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 4000adcc: 96 01 00 03 add %g4, %g3, %o3 4000add0: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000add4: d6 03 20 04 ld [ %o4 + 4 ], %o3 c->parent = the_node->parent; 4000add8: d8 21 00 00 st %o4, [ %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; 4000addc: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 4000ade0: c8 20 80 00 st %g4, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000ade4: 80 a0 00 0b cmp %g0, %o3 4000ade8: 84 40 20 00 addx %g0, 0, %g2 4000adec: 85 28 a0 02 sll %g2, 2, %g2 4000adf0: 98 03 00 02 add %o4, %g2, %o4 4000adf4: c8 23 20 04 st %g4, [ %o4 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 4000adf8: c8 00 60 0c ld [ %g1 + 0xc ], %g4 dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; 4000adfc: 84 00 40 03 add %g1, %g3, %g2 4000ae00: c4 00 a0 04 ld [ %g2 + 4 ], %g2 } sibling->color = parent->color; 4000ae04: c8 20 a0 0c st %g4, [ %g2 + 0xc ] 4000ae08: 88 00 80 03 add %g2, %g3, %g4 4000ae0c: c8 01 20 04 ld [ %g4 + 4 ], %g4 parent->color = RBT_BLACK; 4000ae10: c0 20 60 0c clr [ %g1 + 0xc ] sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; 4000ae14: 10 80 00 33 b 4000aee0 <_RBTree_Extract_validate_unprotected+0x2a4> 4000ae18: c0 21 20 0c clr [ %g4 + 0xc ] * 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; 4000ae1c: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 4000ae20: 88 1b 00 08 xor %o4, %o0, %g4 4000ae24: 80 a0 00 04 cmp %g0, %g4 4000ae28: 94 40 20 00 addx %g0, 0, %o2 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 4000ae2c: 96 1a a0 01 xor %o2, 1, %o3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 4000ae30: 97 2a e0 02 sll %o3, 2, %o3 4000ae34: 98 00 40 0b add %g1, %o3, %o4 4000ae38: c8 03 20 04 ld [ %o4 + 4 ], %g4 4000ae3c: 80 a1 20 00 cmp %g4, 0 4000ae40: 02 80 00 1c be 4000aeb0 <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN 4000ae44: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 4000ae48: 95 2a a0 02 sll %o2, 2, %o2 4000ae4c: 84 01 00 0a add %g4, %o2, %g2 4000ae50: d2 00 a0 04 ld [ %g2 + 4 ], %o1 4000ae54: d2 23 20 04 st %o1, [ %o4 + 4 ] if (c->child[dir]) 4000ae58: c4 00 a0 04 ld [ %g2 + 4 ], %g2 4000ae5c: 80 a0 a0 00 cmp %g2, 0 4000ae60: 02 80 00 04 be 4000ae70 <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN 4000ae64: 94 01 00 0a add %g4, %o2, %o2 c->child[dir]->parent = the_node; 4000ae68: c2 20 80 00 st %g1, [ %g2 ] 4000ae6c: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 4000ae70: c2 22 a0 04 st %g1, [ %o2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000ae74: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 4000ae78: c6 21 00 00 st %g3, [ %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; 4000ae7c: 84 18 40 02 xor %g1, %g2, %g2 4000ae80: 80 a0 00 02 cmp %g0, %g2 4000ae84: 84 40 20 00 addx %g0, 0, %g2 4000ae88: 85 28 a0 02 sll %g2, 2, %g2 4000ae8c: 96 00 40 0b add %g1, %o3, %o3 4000ae90: 86 00 c0 02 add %g3, %g2, %g3 c->parent = the_node->parent; the_node->parent = c; 4000ae94: 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; 4000ae98: c8 20 e0 04 st %g4, [ %g3 + 4 ] 4000ae9c: 10 bf ff 7f b 4000ac98 <_RBTree_Extract_validate_unprotected+0x5c> 4000aea0: c4 02 e0 04 ld [ %o3 + 4 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 4000aea4: 84 10 20 00 clr %g2 <== NOT EXECUTED 4000aea8: 10 bf ff 9e b 4000ad20 <_RBTree_Extract_validate_unprotected+0xe4> 4000aeac: 82 10 00 03 mov %g3, %g1 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 4000aeb0: 10 bf ff 7a b 4000ac98 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED 4000aeb4: 84 10 20 00 clr %g2 <== NOT EXECUTED sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 4000aeb8: 81 c3 e0 08 retl 4000aebc: c0 22 20 0c clr [ %o0 + 0xc ] 4000aec0: 98 00 40 03 add %g1, %g3, %o4 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 4000aec4: d6 20 a0 0c st %o3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 4000aec8: c0 20 60 0c clr [ %g1 + 0xc ] 4000aecc: c4 03 20 04 ld [ %o4 + 4 ], %g2 4000aed0: 80 a0 a0 00 cmp %g2, 0 4000aed4: 02 bf ff 97 be 4000ad30 <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN 4000aed8: c0 21 20 0c clr [ %g4 + 0xc ] 4000aedc: 9b 2b 60 02 sll %o5, 2, %o5 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 4000aee0: 88 00 80 0d add %g2, %o5, %g4 4000aee4: d8 01 20 04 ld [ %g4 + 4 ], %o4 4000aee8: 86 00 40 03 add %g1, %g3, %g3 4000aeec: d8 20 e0 04 st %o4, [ %g3 + 4 ] if (c->child[dir]) 4000aef0: c6 01 20 04 ld [ %g4 + 4 ], %g3 4000aef4: 80 a0 e0 00 cmp %g3, 0 4000aef8: 32 80 00 02 bne,a 4000af00 <_RBTree_Extract_validate_unprotected+0x2c4> 4000aefc: c2 20 c0 00 st %g1, [ %g3 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000af00: c6 00 40 00 ld [ %g1 ], %g3 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 4000af04: 9a 00 80 0d add %g2, %o5, %o5 4000af08: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000af0c: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 4000af10: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 4000af14: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000af18: 88 18 40 04 xor %g1, %g4, %g4 4000af1c: 80 a0 00 04 cmp %g0, %g4 4000af20: 82 40 20 00 addx %g0, 0, %g1 4000af24: 83 28 60 02 sll %g1, 2, %g1 4000af28: 86 00 c0 01 add %g3, %g1, %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 4000af2c: c2 02 00 00 ld [ %o0 ], %g1 4000af30: c4 20 e0 04 st %g2, [ %g3 + 4 ] 4000af34: c2 00 40 00 ld [ %g1 ], %g1 4000af38: 80 a0 60 00 cmp %g1, 0 4000af3c: 12 bf ff 82 bne 4000ad44 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 4000af40: 01 00 00 00 nop 4000af44: 30 bf ff dd b,a 4000aeb8 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED 4000af48: c2 02 00 00 ld [ %o0 ], %g1 4000af4c: c2 00 40 00 ld [ %g1 ], %g1 4000af50: 80 a0 60 00 cmp %g1, 0 4000af54: 12 bf ff 7c bne 4000ad44 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 4000af58: 01 00 00 00 nop 4000af5c: 30 bf ff d7 b,a 4000aeb8 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED =============================================================================== 4000bdf8 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 4000bdf8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 4000bdfc: 7f ff df 48 call 40003b1c 4000be00: b8 10 00 18 mov %i0, %i4 4000be04: b6 10 00 08 mov %o0, %i3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 4000be08: fa 06 20 04 ld [ %i0 + 4 ], %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 4000be0c: 80 a7 60 00 cmp %i5, 0 4000be10: 02 80 00 15 be 4000be64 <_RBTree_Find+0x6c> <== NEVER TAKEN 4000be14: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 4000be18: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 4000be1c: 92 10 00 1d mov %i5, %o1 4000be20: 9f c0 40 00 call %g1 4000be24: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 4000be28: 83 3a 20 1f sra %o0, 0x1f, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 4000be2c: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 4000be30: 82 20 40 08 sub %g1, %o0, %g1 4000be34: 83 30 60 1f srl %g1, 0x1f, %g1 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 4000be38: 83 28 60 02 sll %g1, 2, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 4000be3c: 12 80 00 06 bne 4000be54 <_RBTree_Find+0x5c> 4000be40: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 4000be44: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 4000be48: 80 a0 a0 00 cmp %g2, 0 4000be4c: 12 80 00 0a bne 4000be74 <_RBTree_Find+0x7c> 4000be50: b0 10 00 1d mov %i5, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 4000be54: fa 00 60 04 ld [ %g1 + 4 ], %i5 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 4000be58: 80 a7 60 00 cmp %i5, 0 4000be5c: 32 bf ff f0 bne,a 4000be1c <_RBTree_Find+0x24> 4000be60: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 4000be64: 7f ff df 32 call 40003b2c 4000be68: 90 10 00 1b mov %i3, %o0 return return_node; } 4000be6c: 81 c7 e0 08 ret 4000be70: 81 e8 00 00 restore RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 4000be74: 7f ff df 2e call 40003b2c 4000be78: 90 10 00 1b mov %i3, %o0 return return_node; } 4000be7c: 81 c7 e0 08 ret 4000be80: 81 e8 00 00 restore =============================================================================== 4000c264 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 4000c264: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 4000c268: 80 a6 20 00 cmp %i0, 0 4000c26c: 02 80 00 0f be 4000c2a8 <_RBTree_Initialize+0x44> <== NEVER TAKEN 4000c270: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 4000c274: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 4000c278: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 4000c27c: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 4000c280: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 4000c284: f2 26 20 10 st %i1, [ %i0 + 0x10 ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 4000c288: 02 80 00 08 be 4000c2a8 <_RBTree_Initialize+0x44> <== NEVER TAKEN 4000c28c: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 4000c290: 92 10 00 1a mov %i2, %o1 4000c294: 7f ff ff 0b call 4000bec0 <_RBTree_Insert_unprotected> 4000c298: 90 10 00 18 mov %i0, %o0 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 4000c29c: b6 86 ff ff addcc %i3, -1, %i3 4000c2a0: 12 bf ff fc bne 4000c290 <_RBTree_Initialize+0x2c> 4000c2a4: b4 06 80 1c add %i2, %i4, %i2 4000c2a8: 81 c7 e0 08 ret 4000c2ac: 81 e8 00 00 restore =============================================================================== 4000b140 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 4000b140: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 4000b144: 80 a6 60 00 cmp %i1, 0 4000b148: 02 80 00 9c be 4000b3b8 <_RBTree_Insert_unprotected+0x278> 4000b14c: b8 10 00 18 mov %i0, %i4 RBTree_Node *iter_node = the_rbtree->root; 4000b150: fa 06 20 04 ld [ %i0 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 4000b154: 80 a7 60 00 cmp %i5, 0 4000b158: 32 80 00 05 bne,a 4000b16c <_RBTree_Insert_unprotected+0x2c> 4000b15c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 4000b160: 10 80 00 9a b 4000b3c8 <_RBTree_Insert_unprotected+0x288> 4000b164: c0 26 60 0c clr [ %i1 + 0xc ] 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) { compare_result = the_rbtree->compare_function(the_node, iter_node); 4000b168: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 4000b16c: 92 10 00 1d mov %i5, %o1 4000b170: 9f c0 40 00 call %g1 4000b174: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 4000b178: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 4000b17c: b6 38 00 08 xnor %g0, %o0, %i3 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) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 4000b180: 80 a0 a0 00 cmp %g2, 0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 4000b184: b7 36 e0 1f srl %i3, 0x1f, %i3 if (!iter_node->child[dir]) { 4000b188: 83 2e e0 02 sll %i3, 2, %g1 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) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 4000b18c: 02 80 00 05 be 4000b1a0 <_RBTree_Insert_unprotected+0x60> 4000b190: 82 07 40 01 add %i5, %g1, %g1 4000b194: 80 a2 20 00 cmp %o0, 0 4000b198: 02 80 00 8a be 4000b3c0 <_RBTree_Insert_unprotected+0x280> 4000b19c: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { 4000b1a0: f0 00 60 04 ld [ %g1 + 4 ], %i0 4000b1a4: 80 a6 20 00 cmp %i0, 0 4000b1a8: 32 bf ff f0 bne,a 4000b168 <_RBTree_Insert_unprotected+0x28> 4000b1ac: ba 10 00 18 mov %i0, %i5 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 4000b1b0: c4 07 20 10 ld [ %i4 + 0x10 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 4000b1b4: b4 06 e0 02 add %i3, 2, %i2 4000b1b8: 87 2e a0 02 sll %i2, 2, %g3 4000b1bc: d2 07 00 03 ld [ %i4 + %g3 ], %o1 compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 4000b1c0: c0 26 60 08 clr [ %i1 + 8 ] 4000b1c4: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; 4000b1c8: f2 20 60 04 st %i1, [ %g1 + 4 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 4000b1cc: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; 4000b1d0: fa 26 40 00 st %i5, [ %i1 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 4000b1d4: c2 26 60 0c st %g1, [ %i1 + 0xc ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 4000b1d8: 9f c0 80 00 call %g2 4000b1dc: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 4000b1e0: 80 a6 e0 00 cmp %i3, 0 4000b1e4: 12 80 00 10 bne 4000b224 <_RBTree_Insert_unprotected+0xe4> 4000b1e8: 80 a2 20 00 cmp %o0, 0 4000b1ec: 06 80 00 10 bl 4000b22c <_RBTree_Insert_unprotected+0xec> 4000b1f0: b5 2e a0 02 sll %i2, 2, %i2 4000b1f4: c2 06 40 00 ld [ %i1 ], %g1 if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; g->color = RBT_RED; 4000b1f8: b4 10 20 01 mov 1, %i2 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 4000b1fc: c4 00 40 00 ld [ %g1 ], %g2 4000b200: 86 90 a0 00 orcc %g2, 0, %g3 4000b204: 22 80 00 06 be,a 4000b21c <_RBTree_Insert_unprotected+0xdc> 4000b208: c0 26 60 0c clr [ %i1 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 4000b20c: c8 00 60 0c ld [ %g1 + 0xc ], %g4 4000b210: 80 a1 20 01 cmp %g4, 1 4000b214: 22 80 00 08 be,a 4000b234 <_RBTree_Insert_unprotected+0xf4> 4000b218: f6 00 80 00 ld [ %g2 ], %i3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 4000b21c: 81 c7 e0 08 ret 4000b220: 81 e8 00 00 restore compare_result = the_rbtree->compare_function( the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || (dir && _RBTree_Is_greater(compare_result)) ) { 4000b224: 04 bf ff f4 ble 4000b1f4 <_RBTree_Insert_unprotected+0xb4> 4000b228: b5 2e a0 02 sll %i2, 2, %i2 the_rbtree->first[dir] = the_node; 4000b22c: 10 bf ff f2 b 4000b1f4 <_RBTree_Insert_unprotected+0xb4> 4000b230: f2 27 00 1a st %i1, [ %i4 + %i2 ] ) { 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; 4000b234: 80 a6 e0 00 cmp %i3, 0 4000b238: 02 80 00 0c be 4000b268 <_RBTree_Insert_unprotected+0x128><== NEVER TAKEN 4000b23c: c8 00 a0 04 ld [ %g2 + 4 ], %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]) 4000b240: 80 a1 00 01 cmp %g4, %g1 4000b244: 02 80 00 5b be 4000b3b0 <_RBTree_Insert_unprotected+0x270> 4000b248: ba 10 00 04 mov %g4, %i5 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 4000b24c: 80 a7 60 00 cmp %i5, 0 4000b250: 22 80 00 07 be,a 4000b26c <_RBTree_Insert_unprotected+0x12c> 4000b254: fa 00 60 04 ld [ %g1 + 4 ], %i5 4000b258: f8 07 60 0c ld [ %i5 + 0xc ], %i4 4000b25c: 80 a7 20 01 cmp %i4, 1 4000b260: 22 80 00 4f be,a 4000b39c <_RBTree_Insert_unprotected+0x25c> 4000b264: c0 20 60 0c clr [ %g1 + 0xc ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 4000b268: fa 00 60 04 ld [ %g1 + 4 ], %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 4000b26c: 88 18 40 04 xor %g1, %g4, %g4 4000b270: 80 a0 00 04 cmp %g0, %g4 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]; 4000b274: ba 1e 40 1d xor %i1, %i5, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 4000b278: 88 40 20 00 addx %g0, 0, %g4 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]; 4000b27c: 80 a0 00 1d cmp %g0, %i5 4000b280: ba 40 20 00 addx %g0, 0, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 4000b284: 80 a7 40 04 cmp %i5, %g4 4000b288: 02 80 00 20 be 4000b308 <_RBTree_Insert_unprotected+0x1c8> 4000b28c: 80 a0 00 04 cmp %g0, %g4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 4000b290: b6 60 3f ff subx %g0, -1, %i3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 4000b294: b7 2e e0 02 sll %i3, 2, %i3 4000b298: b6 00 40 1b add %g1, %i3, %i3 4000b29c: fa 06 e0 04 ld [ %i3 + 4 ], %i5 4000b2a0: 80 a7 60 00 cmp %i5, 0 4000b2a4: 02 80 00 16 be 4000b2fc <_RBTree_Insert_unprotected+0x1bc><== NEVER TAKEN 4000b2a8: b9 29 20 02 sll %g4, 2, %i4 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 4000b2ac: 9e 07 40 1c add %i5, %i4, %o7 4000b2b0: da 03 e0 04 ld [ %o7 + 4 ], %o5 4000b2b4: da 26 e0 04 st %o5, [ %i3 + 4 ] if (c->child[dir]) 4000b2b8: f6 03 e0 04 ld [ %o7 + 4 ], %i3 4000b2bc: 80 a6 e0 00 cmp %i3, 0 4000b2c0: 22 80 00 05 be,a 4000b2d4 <_RBTree_Insert_unprotected+0x194> 4000b2c4: b6 07 40 1c add %i5, %i4, %i3 c->child[dir]->parent = the_node; 4000b2c8: c2 26 c0 00 st %g1, [ %i3 ] 4000b2cc: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 4000b2d0: b6 07 40 1c add %i5, %i4, %i3 4000b2d4: c2 26 e0 04 st %g1, [ %i3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000b2d8: f6 00 a0 04 ld [ %g2 + 4 ], %i3 c->parent = the_node->parent; 4000b2dc: c4 27 40 00 st %g2, [ %i5 ] 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; 4000b2e0: b6 1e c0 01 xor %i3, %g1, %i3 c->parent = the_node->parent; the_node->parent = c; 4000b2e4: fa 20 40 00 st %i5, [ %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; 4000b2e8: 80 a0 00 1b cmp %g0, %i3 4000b2ec: 82 40 20 00 addx %g0, 0, %g1 4000b2f0: 83 28 60 02 sll %g1, 2, %g1 4000b2f4: 84 00 80 01 add %g2, %g1, %g2 4000b2f8: fa 20 a0 04 st %i5, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 4000b2fc: b2 06 40 1c add %i1, %i4, %i1 4000b300: f2 06 60 04 ld [ %i1 + 4 ], %i1 4000b304: c2 06 40 00 ld [ %i1 ], %g1 } the_node->parent->color = RBT_BLACK; 4000b308: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 4000b30c: 88 26 80 04 sub %i2, %g4, %g4 4000b310: ba 19 20 01 xor %g4, 1, %i5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 4000b314: bb 2f 60 02 sll %i5, 2, %i5 4000b318: ba 00 c0 1d add %g3, %i5, %i5 4000b31c: c4 07 60 04 ld [ %i5 + 4 ], %g2 4000b320: 80 a0 a0 00 cmp %g2, 0 4000b324: 02 bf ff b6 be 4000b1fc <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN 4000b328: f4 20 e0 0c st %i2, [ %g3 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 4000b32c: 89 29 20 02 sll %g4, 2, %g4 4000b330: 82 00 80 04 add %g2, %g4, %g1 4000b334: f8 00 60 04 ld [ %g1 + 4 ], %i4 4000b338: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 4000b33c: c2 00 60 04 ld [ %g1 + 4 ], %g1 4000b340: 80 a0 60 00 cmp %g1, 0 4000b344: 32 80 00 02 bne,a 4000b34c <_RBTree_Insert_unprotected+0x20c> 4000b348: c6 20 40 00 st %g3, [ %g1 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000b34c: fa 00 c0 00 ld [ %g3 ], %i5 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 4000b350: 88 00 80 04 add %g2, %g4, %g4 the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; 4000b354: fa 20 80 00 st %i5, [ %g2 ] the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 4000b358: c6 21 20 04 st %g3, [ %g4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 4000b35c: c8 07 60 04 ld [ %i5 + 4 ], %g4 c->parent = the_node->parent; the_node->parent = c; 4000b360: c4 20 c0 00 st %g2, [ %g3 ] 4000b364: c2 06 40 00 ld [ %i1 ], %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; 4000b368: 86 18 c0 04 xor %g3, %g4, %g3 4000b36c: 80 a0 00 03 cmp %g0, %g3 4000b370: 86 40 20 00 addx %g0, 0, %g3 4000b374: 87 28 e0 02 sll %g3, 2, %g3 4000b378: ba 07 40 03 add %i5, %g3, %i5 4000b37c: c4 27 60 04 st %g2, [ %i5 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 4000b380: c4 00 40 00 ld [ %g1 ], %g2 4000b384: 86 90 a0 00 orcc %g2, 0, %g3 4000b388: 32 bf ff a2 bne,a 4000b210 <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN 4000b38c: c8 00 60 0c ld [ %g1 + 0xc ], %g4 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 4000b390: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 4000b394: 81 c7 e0 08 ret <== NOT EXECUTED 4000b398: 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; 4000b39c: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; 4000b3a0: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 4000b3a4: 82 10 00 1b mov %i3, %g1 4000b3a8: 10 bf ff 95 b 4000b1fc <_RBTree_Insert_unprotected+0xbc> 4000b3ac: b2 10 00 02 mov %g2, %i1 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]; 4000b3b0: 10 bf ff a7 b 4000b24c <_RBTree_Insert_unprotected+0x10c> 4000b3b4: fa 00 a0 08 ld [ %g2 + 8 ], %i5 RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { if(!the_node) return (RBTree_Node*)-1; 4000b3b8: 81 c7 e0 08 ret 4000b3bc: 91 e8 3f ff restore %g0, -1, %o0 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) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 4000b3c0: 81 c7 e0 08 ret 4000b3c4: 91 e8 00 1d restore %g0, %i5, %o0 RBTree_Node *iter_node = the_rbtree->root; int compare_result; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 4000b3c8: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 4000b3cc: f2 26 20 0c st %i1, [ %i0 + 0xc ] 4000b3d0: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 4000b3d4: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 4000b3d8: c0 26 60 08 clr [ %i1 + 8 ] 4000b3dc: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 4000b3e0: 81 c7 e0 08 ret 4000b3e4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 4000b418 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 4000b418: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 4000b41c: 80 a0 00 19 cmp %g0, %i1 4000b420: 82 60 3f ff subx %g0, -1, %g1 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 4000b424: 82 00 60 02 add %g1, 2, %g1 4000b428: 83 28 60 02 sll %g1, 2, %g1 4000b42c: fa 06 00 01 ld [ %i0 + %g1 ], %i5 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 4000b430: 80 a7 60 00 cmp %i5, 0 4000b434: 12 80 00 06 bne 4000b44c <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN 4000b438: 94 10 00 1b mov %i3, %o2 4000b43c: 30 80 00 0e b,a 4000b474 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED 4000b440: 80 8f 20 ff btst 0xff, %i4 4000b444: 02 80 00 0c be 4000b474 <_RBTree_Iterate_unprotected+0x5c><== NEVER TAKEN 4000b448: 94 10 00 1b mov %i3, %o2 stop = (*visitor)( current, dir, visitor_arg ); 4000b44c: 90 10 00 1d mov %i5, %o0 4000b450: 9f c6 80 00 call %i2 4000b454: 92 10 00 19 mov %i1, %o1 current = _RBTree_Next_unprotected( current, dir ); 4000b458: 92 10 00 19 mov %i1, %o1 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { stop = (*visitor)( current, dir, visitor_arg ); 4000b45c: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 4000b460: 40 00 00 07 call 4000b47c <_RBTree_Next_unprotected> 4000b464: 90 10 00 1d mov %i5, %o0 { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 4000b468: ba 92 20 00 orcc %o0, 0, %i5 4000b46c: 12 bf ff f5 bne 4000b440 <_RBTree_Iterate_unprotected+0x28> 4000b470: b8 1f 20 01 xor %i4, 1, %i4 4000b474: 81 c7 e0 08 ret 4000b478: 81 e8 00 00 restore =============================================================================== 40009618 <_RTEMS_signal_Post_switch_hook>: #include #include #include static void _RTEMS_signal_Post_switch_hook( Thread_Control *executing ) { 40009618: 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 ]; 4000961c: fa 06 21 4c ld [ %i0 + 0x14c ], %i5 if ( !api ) 40009620: 80 a7 60 00 cmp %i5, 0 40009624: 02 80 00 1e be 4000969c <_RTEMS_signal_Post_switch_hook+0x84><== NEVER TAKEN 40009628: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 4000962c: 7f ff e7 52 call 40003374 40009630: 01 00 00 00 nop signal_set = asr->signals_posted; 40009634: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 asr->signals_posted = 0; 40009638: c0 27 60 14 clr [ %i5 + 0x14 ] _ISR_Enable( level ); 4000963c: 7f ff e7 52 call 40003384 40009640: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 40009644: 80 a7 20 00 cmp %i4, 0 40009648: 32 80 00 04 bne,a 40009658 <_RTEMS_signal_Post_switch_hook+0x40> 4000964c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 40009650: 81 c7 e0 08 ret 40009654: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 40009658: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 4000965c: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 40009660: 94 07 bf fc add %fp, -4, %o2 40009664: 37 00 00 3f sethi %hi(0xfc00), %i3 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 40009668: c2 27 60 1c st %g1, [ %i5 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000966c: 40 00 01 07 call 40009a88 40009670: 92 16 e3 ff or %i3, 0x3ff, %o1 (*asr->handler)( signal_set ); 40009674: c2 07 60 0c ld [ %i5 + 0xc ], %g1 40009678: 9f c0 40 00 call %g1 4000967c: 90 10 00 1c mov %i4, %o0 asr->nest_level -= 1; 40009680: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 40009684: 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; 40009688: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000968c: 92 16 e3 ff or %i3, 0x3ff, %o1 40009690: 94 07 bf fc add %fp, -4, %o2 40009694: 40 00 00 fd call 40009a88 40009698: c2 27 60 1c st %g1, [ %i5 + 0x1c ] 4000969c: 81 c7 e0 08 ret 400096a0: 81 e8 00 00 restore =============================================================================== 400089cc <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 400089cc: 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; 400089d0: 03 10 00 77 sethi %hi(0x4001dc00), %g1 400089d4: 82 10 62 c4 or %g1, 0x2c4, %g1 ! 4001dec4 400089d8: 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 ) 400089dc: 80 a7 60 00 cmp %i5, 0 400089e0: 02 80 00 18 be 40008a40 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 400089e4: 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++ ) { 400089e8: 80 a6 e0 00 cmp %i3, 0 400089ec: 02 80 00 15 be 40008a40 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 400089f0: b8 10 20 00 clr %i4 return_value = rtems_task_create( 400089f4: d4 07 60 04 ld [ %i5 + 4 ], %o2 400089f8: d0 07 40 00 ld [ %i5 ], %o0 400089fc: d2 07 60 08 ld [ %i5 + 8 ], %o1 40008a00: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 40008a04: d8 07 60 0c ld [ %i5 + 0xc ], %o4 40008a08: 7f ff ff 70 call 400087c8 40008a0c: 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 ) ) 40008a10: 94 92 20 00 orcc %o0, 0, %o2 40008a14: 12 80 00 0d bne 40008a48 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 40008a18: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 40008a1c: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 40008a20: 40 00 00 0e call 40008a58 40008a24: 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 ) ) 40008a28: 94 92 20 00 orcc %o0, 0, %o2 40008a2c: 12 80 00 07 bne 40008a48 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 40008a30: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 40008a34: 80 a7 00 1b cmp %i4, %i3 40008a38: 12 bf ff ef bne 400089f4 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 40008a3c: ba 07 60 1c add %i5, 0x1c, %i5 40008a40: 81 c7 e0 08 ret 40008a44: 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 ); 40008a48: 90 10 20 01 mov 1, %o0 40008a4c: 40 00 04 14 call 40009a9c <_Internal_error_Occurred> 40008a50: 92 10 20 01 mov 1, %o1 =============================================================================== 4000d9b0 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 4000d9b0: c2 02 21 58 ld [ %o0 + 0x158 ], %g1 while (tvp) { 4000d9b4: 80 a0 60 00 cmp %g1, 0 4000d9b8: 22 80 00 0c be,a 4000d9e8 <_RTEMS_tasks_Switch_extension+0x38> 4000d9bc: c2 02 61 58 ld [ %o1 + 0x158 ], %g1 tvp->tval = *tvp->ptr; 4000d9c0: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 4000d9c4: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 4000d9c8: c8 00 80 00 ld [ %g2 ], %g4 4000d9cc: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 4000d9d0: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 4000d9d4: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 4000d9d8: 80 a0 60 00 cmp %g1, 0 4000d9dc: 32 bf ff fa bne,a 4000d9c4 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 4000d9e0: 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; 4000d9e4: c2 02 61 58 ld [ %o1 + 0x158 ], %g1 while (tvp) { 4000d9e8: 80 a0 60 00 cmp %g1, 0 4000d9ec: 02 80 00 0d be 4000da20 <_RTEMS_tasks_Switch_extension+0x70> 4000d9f0: 01 00 00 00 nop tvp->gval = *tvp->ptr; 4000d9f4: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 4000d9f8: 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; 4000d9fc: c8 00 80 00 ld [ %g2 ], %g4 4000da00: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 4000da04: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 4000da08: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 4000da0c: 80 a0 60 00 cmp %g1, 0 4000da10: 32 bf ff fa bne,a 4000d9f8 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 4000da14: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 4000da18: 81 c3 e0 08 retl 4000da1c: 01 00 00 00 nop 4000da20: 81 c3 e0 08 retl =============================================================================== 40037a18 <_Rate_monotonic_Get_status>: bool _Rate_monotonic_Get_status( Rate_monotonic_Control *the_period, Rate_monotonic_Period_time_t *wall_since_last_period, Thread_CPU_usage_t *cpu_since_last_period ) { 40037a18: 9d e3 bf 98 save %sp, -104, %sp */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 40037a1c: 13 10 01 a0 sethi %hi(0x40068000), %o1 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 40037a20: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 40037a24: 90 07 bf f8 add %fp, -8, %o0 40037a28: 7f ff 45 62 call 40008fb0 <_TOD_Get_with_nanoseconds> 40037a2c: 92 12 60 b0 or %o1, 0xb0, %o1 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 40037a30: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 40037a34: f8 1e 20 50 ldd [ %i0 + 0x50 ], %i4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 40037a38: 03 10 01 a0 sethi %hi(0x40068000), %g1 40037a3c: 82 10 63 60 or %g1, 0x360, %g1 ! 40068360 <_Per_CPU_Information> 40037a40: de 00 60 10 ld [ %g1 + 0x10 ], %o7 40037a44: ba a0 c0 1d subcc %g3, %i5, %i5 40037a48: b8 60 80 1c subx %g2, %i4, %i4 40037a4c: f8 3e 40 00 std %i4, [ %i1 ] if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 40037a50: 88 10 20 01 mov 1, %g4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 40037a54: 80 a3 c0 1b cmp %o7, %i3 40037a58: 02 80 00 05 be 40037a6c <_Rate_monotonic_Get_status+0x54> 40037a5c: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 40037a60: b0 09 20 01 and %g4, 1, %i0 40037a64: 81 c7 e0 08 ret 40037a68: 81 e8 00 00 restore 40037a6c: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40037a70: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 40037a74: 86 a0 c0 0d subcc %g3, %o5, %g3 40037a78: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 40037a7c: 9a 87 40 03 addcc %i5, %g3, %o5 40037a80: 98 47 00 02 addx %i4, %g2, %o4 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 40037a84: 80 a6 00 0c cmp %i0, %o4 40037a88: 14 bf ff f6 bg 40037a60 <_Rate_monotonic_Get_status+0x48> <== NEVER TAKEN 40037a8c: 88 10 20 00 clr %g4 40037a90: 02 80 00 09 be 40037ab4 <_Rate_monotonic_Get_status+0x9c> 40037a94: 80 a6 40 0d cmp %i1, %o5 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 40037a98: 9a a3 40 19 subcc %o5, %i1, %o5 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 40037a9c: 88 10 20 01 mov 1, %g4 40037aa0: 98 63 00 18 subx %o4, %i0, %o4 } 40037aa4: b0 09 20 01 and %g4, 1, %i0 40037aa8: d8 3e 80 00 std %o4, [ %i2 ] 40037aac: 81 c7 e0 08 ret 40037ab0: 81 e8 00 00 restore /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 40037ab4: 28 bf ff fa bleu,a 40037a9c <_Rate_monotonic_Get_status+0x84> 40037ab8: 9a a3 40 19 subcc %o5, %i1, %o5 return false; 40037abc: 10 bf ff e9 b 40037a60 <_Rate_monotonic_Get_status+0x48> 40037ac0: 88 10 20 00 clr %g4 =============================================================================== 40037e68 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 40037e68: 9d e3 bf 98 save %sp, -104, %sp 40037e6c: 11 10 01 a1 sethi %hi(0x40068400), %o0 40037e70: 92 10 00 18 mov %i0, %o1 40037e74: 90 12 21 88 or %o0, 0x188, %o0 40037e78: 7f ff 47 22 call 40009b00 <_Objects_Get> 40037e7c: 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 ) { 40037e80: c2 07 bf fc ld [ %fp + -4 ], %g1 40037e84: 80 a0 60 00 cmp %g1, 0 40037e88: 12 80 00 16 bne 40037ee0 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 40037e8c: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 40037e90: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 40037e94: 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); 40037e98: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 40037e9c: 80 88 80 01 btst %g2, %g1 40037ea0: 22 80 00 08 be,a 40037ec0 <_Rate_monotonic_Timeout+0x58> 40037ea4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 40037ea8: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 40037eac: c2 07 60 08 ld [ %i5 + 8 ], %g1 40037eb0: 80 a0 80 01 cmp %g2, %g1 40037eb4: 02 80 00 19 be 40037f18 <_Rate_monotonic_Timeout+0xb0> 40037eb8: 13 04 01 ff sethi %hi(0x1007fc00), %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 ) { 40037ebc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 40037ec0: 80 a0 60 01 cmp %g1, 1 40037ec4: 02 80 00 09 be 40037ee8 <_Rate_monotonic_Timeout+0x80> 40037ec8: 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; 40037ecc: 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) { uint32_t level = _Thread_Dispatch_disable_level; 40037ed0: 03 10 01 a0 sethi %hi(0x40068000), %g1 40037ed4: c4 00 61 60 ld [ %g1 + 0x160 ], %g2 ! 40068160 <_Thread_Dispatch_disable_level> --level; 40037ed8: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 40037edc: c4 20 61 60 st %g2, [ %g1 + 0x160 ] 40037ee0: 81 c7 e0 08 ret 40037ee4: 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; 40037ee8: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 40037eec: 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; 40037ef0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 40037ef4: 7f ff ff 43 call 40037c00 <_Rate_monotonic_Initiate_statistics> 40037ef8: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40037efc: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037f00: 11 10 01 a0 sethi %hi(0x40068000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40037f04: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037f08: 90 12 21 f8 or %o0, 0x1f8, %o0 40037f0c: 7f ff 4d d8 call 4000b66c <_Watchdog_Insert> 40037f10: 92 07 60 10 add %i5, 0x10, %o1 40037f14: 30 bf ff ef b,a 40037ed0 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40037f18: 7f ff 49 b9 call 4000a5fc <_Thread_Clear_state> 40037f1c: 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 ); 40037f20: 10 bf ff f5 b 40037ef4 <_Rate_monotonic_Timeout+0x8c> 40037f24: 90 10 00 1d mov %i5, %o0 =============================================================================== 40037ac4 <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 40037ac4: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 40037ac8: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 40037acc: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 40037ad0: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 40037ad4: 80 a0 60 04 cmp %g1, 4 40037ad8: 02 80 00 32 be 40037ba0 <_Rate_monotonic_Update_statistics+0xdc> 40037adc: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 40037ae0: 90 10 00 18 mov %i0, %o0 40037ae4: 92 07 bf f8 add %fp, -8, %o1 40037ae8: 7f ff ff cc call 40037a18 <_Rate_monotonic_Get_status> 40037aec: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 40037af0: 80 8a 20 ff btst 0xff, %o0 40037af4: 02 80 00 21 be 40037b78 <_Rate_monotonic_Update_statistics+0xb4> 40037af8: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 40037afc: f8 1e 20 70 ldd [ %i0 + 0x70 ], %i4 * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 40037b00: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 40037b04: b6 87 40 03 addcc %i5, %g3, %i3 40037b08: b4 47 00 02 addx %i4, %g2, %i2 40037b0c: 80 a0 40 02 cmp %g1, %g2 40037b10: 04 80 00 1c ble 40037b80 <_Rate_monotonic_Update_statistics+0xbc> 40037b14: f4 3e 20 70 std %i2, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 40037b18: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 40037b1c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 40037b20: 80 a0 40 02 cmp %g1, %g2 40037b24: 26 80 00 05 bl,a 40037b38 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 40037b28: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 40037b2c: 80 a0 40 02 cmp %g1, %g2 40037b30: 22 80 00 28 be,a 40037bd0 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 40037b34: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 /* * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); 40037b38: c4 1f bf f8 ldd [ %fp + -8 ], %g2 40037b3c: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 40037b40: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 40037b44: b6 87 40 03 addcc %i5, %g3, %i3 40037b48: b4 47 00 02 addx %i4, %g2, %i2 40037b4c: 80 a0 40 02 cmp %g1, %g2 40037b50: 14 80 00 1b bg 40037bbc <_Rate_monotonic_Update_statistics+0xf8> 40037b54: f4 3e 20 88 std %i2, [ %i0 + 0x88 ] 40037b58: 80 a0 40 02 cmp %g1, %g2 40037b5c: 22 80 00 15 be,a 40037bb0 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN 40037b60: c2 06 20 7c ld [ %i0 + 0x7c ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 40037b64: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 40037b68: 80 a0 40 02 cmp %g1, %g2 40037b6c: 16 80 00 1e bge 40037be4 <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN 40037b70: 01 00 00 00 nop stats->max_wall_time = since_last_period; 40037b74: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 40037b78: 81 c7 e0 08 ret 40037b7c: 81 e8 00 00 restore * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 40037b80: 32 bf ff e8 bne,a 40037b20 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 40037b84: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 40037b88: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 40037b8c: 80 a0 40 03 cmp %g1, %g3 40037b90: 28 bf ff e4 bleu,a 40037b20 <_Rate_monotonic_Update_statistics+0x5c> 40037b94: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 40037b98: 10 bf ff e1 b 40037b1c <_Rate_monotonic_Update_statistics+0x58> 40037b9c: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 40037ba0: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 40037ba4: 82 00 60 01 inc %g1 40037ba8: 10 bf ff ce b 40037ae0 <_Rate_monotonic_Update_statistics+0x1c> 40037bac: c2 26 20 5c st %g1, [ %i0 + 0x5c ] * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 40037bb0: 80 a0 40 03 cmp %g1, %g3 40037bb4: 28 bf ff ed bleu,a 40037b68 <_Rate_monotonic_Update_statistics+0xa4> 40037bb8: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 40037bbc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 40037bc0: 80 a0 40 02 cmp %g1, %g2 40037bc4: 06 bf ff ec bl 40037b74 <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 40037bc8: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 40037bcc: 30 80 00 06 b,a 40037be4 <_Rate_monotonic_Update_statistics+0x120> _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) stats->min_cpu_time = executed; if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 40037bd0: 80 a0 40 03 cmp %g1, %g3 40037bd4: 3a bf ff da bcc,a 40037b3c <_Rate_monotonic_Update_statistics+0x78> 40037bd8: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 40037bdc: 10 bf ff d7 b 40037b38 <_Rate_monotonic_Update_statistics+0x74> 40037be0: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 40037be4: 12 bf ff e5 bne 40037b78 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 40037be8: 01 00 00 00 nop 40037bec: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 40037bf0: 80 a0 40 03 cmp %g1, %g3 40037bf4: 2a bf ff e1 bcs,a 40037b78 <_Rate_monotonic_Update_statistics+0xb4> 40037bf8: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 40037bfc: 30 bf ff df b,a 40037b78 <_Rate_monotonic_Update_statistics+0xb4> =============================================================================== 4000af28 <_Scheduler_CBS_Allocate>: #include void *_Scheduler_CBS_Allocate( Thread_Control *the_thread ) { 4000af28: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_CBS_Per_thread *schinfo; sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread)); 4000af2c: 40 00 07 02 call 4000cb34 <_Workspace_Allocate> 4000af30: 90 10 20 1c mov 0x1c, %o0 if ( sched ) { 4000af34: 80 a2 20 00 cmp %o0, 0 4000af38: 02 80 00 06 be 4000af50 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN 4000af3c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 4000af40: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info); schinfo->edf_per_thread.thread = the_thread; 4000af44: f0 22 00 00 st %i0, [ %o0 ] schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 4000af48: c2 22 20 14 st %g1, [ %o0 + 0x14 ] schinfo->cbs_server = NULL; 4000af4c: c0 22 20 18 clr [ %o0 + 0x18 ] } return sched; } 4000af50: 81 c7 e0 08 ret 4000af54: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 4000c2fc <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 4000c2fc: 9d e3 bf 98 save %sp, -104, %sp Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server_id server_id; /* Put violating task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 4000c300: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 4000c304: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 4000c308: 80 a0 40 09 cmp %g1, %o1 4000c30c: 32 80 00 02 bne,a 4000c314 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 4000c310: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 4000c314: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 4000c318: 80 a0 40 09 cmp %g1, %o1 4000c31c: 02 80 00 04 be 4000c32c <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 4000c320: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 4000c324: 40 00 01 90 call 4000c964 <_Thread_Change_priority> 4000c328: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 4000c32c: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 4000c330: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 4000c334: c4 00 60 0c ld [ %g1 + 0xc ], %g2 4000c338: 80 a0 a0 00 cmp %g2, 0 4000c33c: 02 80 00 09 be 4000c360 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 4000c340: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 4000c344: d0 00 40 00 ld [ %g1 ], %o0 4000c348: 7f ff ff d5 call 4000c29c <_Scheduler_CBS_Get_server_id> 4000c34c: 92 07 bf fc add %fp, -4, %o1 sched_info->cbs_server->task_id, &server_id ); sched_info->cbs_server->cbs_budget_overrun( server_id ); 4000c350: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 4000c354: c2 00 60 0c ld [ %g1 + 0xc ], %g1 4000c358: 9f c0 40 00 call %g1 4000c35c: d0 07 bf fc ld [ %fp + -4 ], %o0 4000c360: 81 c7 e0 08 ret 4000c364: 81 e8 00 00 restore =============================================================================== 4000be54 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 4000be54: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000be58: 39 10 00 85 sethi %hi(0x40021400), %i4 4000be5c: c2 07 23 00 ld [ %i4 + 0x300 ], %g1 ! 40021700 <_Scheduler_CBS_Maximum_servers> 4000be60: 80 a0 60 00 cmp %g1, 0 4000be64: 02 80 00 18 be 4000bec4 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 4000be68: 03 10 00 89 sethi %hi(0x40022400), %g1 4000be6c: 37 10 00 89 sethi %hi(0x40022400), %i3 4000be70: c4 06 e2 68 ld [ %i3 + 0x268 ], %g2 ! 40022668 <_Scheduler_CBS_Server_list> 4000be74: ba 10 20 00 clr %i5 4000be78: b8 17 23 00 or %i4, 0x300, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 4000be7c: 83 2f 60 02 sll %i5, 2, %g1 4000be80: c2 00 80 01 ld [ %g2 + %g1 ], %g1 4000be84: 80 a0 60 00 cmp %g1, 0 4000be88: 02 80 00 05 be 4000be9c <_Scheduler_CBS_Cleanup+0x48> 4000be8c: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 4000be90: 40 00 00 46 call 4000bfa8 <_Scheduler_CBS_Destroy_server> 4000be94: 01 00 00 00 nop 4000be98: c4 06 e2 68 ld [ %i3 + 0x268 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000be9c: c2 07 00 00 ld [ %i4 ], %g1 4000bea0: ba 07 60 01 inc %i5 4000bea4: 80 a0 40 1d cmp %g1, %i5 4000bea8: 18 bf ff f6 bgu 4000be80 <_Scheduler_CBS_Cleanup+0x2c> 4000beac: 83 2f 60 02 sll %i5, 2, %g1 if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); return SCHEDULER_CBS_OK; } 4000beb0: b0 10 20 00 clr %i0 for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); 4000beb4: 40 00 08 32 call 4000df7c <_Workspace_Free> 4000beb8: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 4000bebc: 81 c7 e0 08 ret 4000bec0: 81 e8 00 00 restore 4000bec4: 10 bf ff fb b 4000beb0 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 4000bec8: c4 00 62 68 ld [ %g1 + 0x268 ], %g2 <== NOT EXECUTED =============================================================================== 4000becc <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 4000becc: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 4000bed0: c2 06 20 04 ld [ %i0 + 4 ], %g1 4000bed4: 80 a0 60 00 cmp %g1, 0 4000bed8: 04 80 00 30 ble 4000bf98 <_Scheduler_CBS_Create_server+0xcc> 4000bedc: b8 10 00 18 mov %i0, %i4 4000bee0: c2 06 00 00 ld [ %i0 ], %g1 4000bee4: 80 a0 60 00 cmp %g1, 0 4000bee8: 04 80 00 2c ble 4000bf98 <_Scheduler_CBS_Create_server+0xcc> 4000beec: 03 10 00 85 sethi %hi(0x40021400), %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000bef0: c8 00 63 00 ld [ %g1 + 0x300 ], %g4 ! 40021700 <_Scheduler_CBS_Maximum_servers> 4000bef4: 80 a1 20 00 cmp %g4, 0 4000bef8: 02 80 00 11 be 4000bf3c <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN 4000befc: 37 10 00 89 sethi %hi(0x40022400), %i3 if ( !_Scheduler_CBS_Server_list[i] ) 4000bf00: fa 06 e2 68 ld [ %i3 + 0x268 ], %i5 ! 40022668 <_Scheduler_CBS_Server_list> 4000bf04: c2 07 40 00 ld [ %i5 ], %g1 4000bf08: 80 a0 60 00 cmp %g1, 0 4000bf0c: 02 80 00 21 be 4000bf90 <_Scheduler_CBS_Create_server+0xc4> 4000bf10: b0 10 20 00 clr %i0 4000bf14: 10 80 00 06 b 4000bf2c <_Scheduler_CBS_Create_server+0x60> 4000bf18: 82 10 20 00 clr %g1 4000bf1c: c6 07 40 02 ld [ %i5 + %g2 ], %g3 4000bf20: 80 a0 e0 00 cmp %g3, 0 4000bf24: 02 80 00 08 be 4000bf44 <_Scheduler_CBS_Create_server+0x78> 4000bf28: b0 10 00 02 mov %g2, %i0 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000bf2c: 82 00 60 01 inc %g1 4000bf30: 80 a0 40 04 cmp %g1, %g4 4000bf34: 12 bf ff fa bne 4000bf1c <_Scheduler_CBS_Create_server+0x50> 4000bf38: 85 28 60 02 sll %g1, 2, %g2 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 4000bf3c: 81 c7 e0 08 ret 4000bf40: 91 e8 3f e6 restore %g0, -26, %o0 *server_id = i; 4000bf44: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 4000bf48: 40 00 08 05 call 4000df5c <_Workspace_Allocate> 4000bf4c: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 4000bf50: c2 06 80 00 ld [ %i2 ], %g1 if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 4000bf54: d0 27 40 18 st %o0, [ %i5 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 4000bf58: c4 06 e2 68 ld [ %i3 + 0x268 ], %g2 4000bf5c: 83 28 60 02 sll %g1, 2, %g1 4000bf60: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 4000bf64: 80 a0 60 00 cmp %g1, 0 4000bf68: 02 80 00 0e be 4000bfa0 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN 4000bf6c: 86 10 3f ff mov -1, %g3 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 4000bf70: c4 07 00 00 ld [ %i4 ], %g2 4000bf74: c4 20 60 04 st %g2, [ %g1 + 4 ] 4000bf78: c4 07 20 04 ld [ %i4 + 4 ], %g2 the_server->task_id = -1; 4000bf7c: c6 20 40 00 st %g3, [ %g1 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 4000bf80: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 4000bf84: f2 20 60 0c st %i1, [ %g1 + 0xc ] return SCHEDULER_CBS_OK; 4000bf88: 81 c7 e0 08 ret 4000bf8c: 91 e8 20 00 restore %g0, 0, %o0 params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( !_Scheduler_CBS_Server_list[i] ) 4000bf90: 10 bf ff ed b 4000bf44 <_Scheduler_CBS_Create_server+0x78> 4000bf94: 82 10 20 00 clr %g1 if ( params->budget <= 0 || params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 4000bf98: 81 c7 e0 08 ret 4000bf9c: 91 e8 3f ee restore %g0, -18, %o0 the_server->parameters = *params; the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; } 4000bfa0: 81 c7 e0 08 ret <== NOT EXECUTED 4000bfa4: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 4000c028 <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 4000c028: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Thread_Control *the_thread; Scheduler_CBS_Per_thread *sched_info; the_thread = _Thread_Get(task_id, &location); 4000c02c: 92 07 bf fc add %fp, -4, %o1 4000c030: 40 00 03 93 call 4000ce7c <_Thread_Get> 4000c034: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 4000c038: ba 92 20 00 orcc %o0, 0, %i5 4000c03c: 02 80 00 1e be 4000c0b4 <_Scheduler_CBS_Detach_thread+0x8c> 4000c040: 01 00 00 00 nop _Thread_Enable_dispatch(); 4000c044: 40 00 03 82 call 4000ce4c <_Thread_Enable_dispatch> 4000c048: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 4000c04c: 03 10 00 85 sethi %hi(0x40021400), %g1 4000c050: c2 00 63 00 ld [ %g1 + 0x300 ], %g1 ! 40021700 <_Scheduler_CBS_Maximum_servers> 4000c054: 80 a6 00 01 cmp %i0, %g1 4000c058: 1a 80 00 17 bcc 4000c0b4 <_Scheduler_CBS_Detach_thread+0x8c> 4000c05c: 03 10 00 89 sethi %hi(0x40022400), %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 4000c060: c2 00 62 68 ld [ %g1 + 0x268 ], %g1 ! 40022668 <_Scheduler_CBS_Server_list> 4000c064: b1 2e 20 02 sll %i0, 2, %i0 4000c068: c2 00 40 18 ld [ %g1 + %i0 ], %g1 4000c06c: 80 a0 60 00 cmp %g1, 0 4000c070: 02 80 00 13 be 4000c0bc <_Scheduler_CBS_Detach_thread+0x94> 4000c074: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 4000c078: c4 00 40 00 ld [ %g1 ], %g2 4000c07c: 80 a0 80 19 cmp %g2, %i1 4000c080: 12 80 00 0d bne 4000c0b4 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN 4000c084: 84 10 3f ff mov -1, %g2 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 4000c088: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 4000c08c: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 4000c090: c4 20 40 00 st %g2, [ %g1 ] sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; 4000c094: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 the_thread->is_preemptible = the_thread->Start.is_preemptible; 4000c098: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 4000c09c: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 4000c0a0: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 4000c0a4: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 4000c0a8: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 4000c0ac: 81 c7 e0 08 ret 4000c0b0: 91 e8 20 00 restore %g0, 0, %o0 if ( the_thread ) { _Thread_Enable_dispatch(); } if ( server_id >= _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 4000c0b4: 81 c7 e0 08 ret 4000c0b8: 91 e8 3f ee restore %g0, -18, %o0 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; } 4000c0bc: 81 c7 e0 08 ret 4000c0c0: 91 e8 3f e7 restore %g0, -25, %o0 =============================================================================== 4000c29c <_Scheduler_CBS_Get_server_id>: rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000c29c: 03 10 00 85 sethi %hi(0x40021400), %g1 4000c2a0: c6 00 63 00 ld [ %g1 + 0x300 ], %g3 ! 40021700 <_Scheduler_CBS_Maximum_servers> 4000c2a4: 80 a0 e0 00 cmp %g3, 0 4000c2a8: 02 80 00 11 be 4000c2ec <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN 4000c2ac: 03 10 00 89 sethi %hi(0x40022400), %g1 4000c2b0: c8 00 62 68 ld [ %g1 + 0x268 ], %g4 ! 40022668 <_Scheduler_CBS_Server_list> 4000c2b4: 82 10 20 00 clr %g1 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 4000c2b8: 85 28 60 02 sll %g1, 2, %g2 Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && 4000c2bc: c4 01 00 02 ld [ %g4 + %g2 ], %g2 4000c2c0: 80 a0 a0 00 cmp %g2, 0 4000c2c4: 22 80 00 07 be,a 4000c2e0 <_Scheduler_CBS_Get_server_id+0x44> 4000c2c8: 82 00 60 01 inc %g1 4000c2cc: c4 00 80 00 ld [ %g2 ], %g2 4000c2d0: 80 a0 80 08 cmp %g2, %o0 4000c2d4: 22 80 00 08 be,a 4000c2f4 <_Scheduler_CBS_Get_server_id+0x58> 4000c2d8: c2 22 40 00 st %g1, [ %o1 ] rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 4000c2dc: 82 00 60 01 inc %g1 4000c2e0: 80 a0 40 03 cmp %g1, %g3 4000c2e4: 12 bf ff f6 bne 4000c2bc <_Scheduler_CBS_Get_server_id+0x20> 4000c2e8: 85 28 60 02 sll %g1, 2, %g2 *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; } 4000c2ec: 81 c3 e0 08 retl 4000c2f0: 90 10 3f e7 mov -25, %o0 unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; 4000c2f4: 81 c3 e0 08 retl 4000c2f8: 90 10 20 00 clr %o0 =============================================================================== 4000c368 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 4000c368: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); 4000c36c: 3b 10 00 85 sethi %hi(0x40021400), %i5 4000c370: d0 07 63 00 ld [ %i5 + 0x300 ], %o0 ! 40021700 <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 4000c374: 40 00 06 fa call 4000df5c <_Workspace_Allocate> 4000c378: 91 2a 20 02 sll %o0, 2, %o0 4000c37c: 09 10 00 89 sethi %hi(0x40022400), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 4000c380: 80 a2 20 00 cmp %o0, 0 4000c384: 02 80 00 10 be 4000c3c4 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 4000c388: d0 21 22 68 st %o0, [ %g4 + 0x268 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 4000c38c: c6 07 63 00 ld [ %i5 + 0x300 ], %g3 4000c390: 80 a0 e0 00 cmp %g3, 0 4000c394: 12 80 00 05 bne 4000c3a8 <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN 4000c398: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 4000c39c: 81 c7 e0 08 ret <== NOT EXECUTED 4000c3a0: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED 4000c3a4: d0 01 22 68 ld [ %g4 + 0x268 ], %o0 _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; 4000c3a8: 85 28 60 02 sll %g1, 2, %g2 unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 4000c3ac: 82 00 60 01 inc %g1 4000c3b0: 80 a0 40 03 cmp %g1, %g3 4000c3b4: 12 bf ff fc bne 4000c3a4 <_Scheduler_CBS_Initialize+0x3c> 4000c3b8: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 4000c3bc: 81 c7 e0 08 ret 4000c3c0: 91 e8 20 00 restore %g0, 0, %o0 { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 4000c3c4: b0 10 3f ef mov -17, %i0 <== NOT EXECUTED for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; } 4000c3c8: 81 c7 e0 08 ret <== NOT EXECUTED 4000c3cc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000af58 <_Scheduler_CBS_Release_job>: { Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; Scheduler_CBS_Server *serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 4000af58: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 4000af5c: 80 a2 60 00 cmp %o1, 0 4000af60: 02 80 00 11 be 4000afa4 <_Scheduler_CBS_Release_job+0x4c> 4000af64: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 4000af68: 80 a0 60 00 cmp %g1, 0 4000af6c: 02 80 00 13 be 4000afb8 <_Scheduler_CBS_Release_job+0x60> 4000af70: 07 10 00 82 sethi %hi(0x40020800), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 4000af74: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000af78: d2 00 e1 48 ld [ %g3 + 0x148 ], %o1 4000af7c: 92 02 40 02 add %o1, %g2, %o1 4000af80: 05 20 00 00 sethi %hi(0x80000000), %g2 4000af84: 92 2a 40 02 andn %o1, %g2, %o1 new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) the_thread->cpu_time_budget = serv_info->parameters.budget; 4000af88: c2 00 60 08 ld [ %g1 + 8 ], %g1 4000af8c: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 4000af90: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 4000af94: 94 10 20 01 mov 1, %o2 4000af98: 82 13 c0 00 mov %o7, %g1 4000af9c: 40 00 01 38 call 4000b47c <_Thread_Change_priority> 4000afa0: 9e 10 40 00 mov %g1, %o7 /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) 4000afa4: 80 a0 60 00 cmp %g1, 0 4000afa8: 12 bf ff f8 bne 4000af88 <_Scheduler_CBS_Release_job+0x30><== ALWAYS TAKEN 4000afac: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 4000afb0: 10 bf ff f9 b 4000af94 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 4000afb4: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED /* Initializing or shifting deadline. */ if (serv_info) new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) & ~SCHEDULER_EDF_PRIO_MSB; else new_priority = (_Watchdog_Ticks_since_boot + deadline) 4000afb8: 03 10 00 82 sethi %hi(0x40020800), %g1 4000afbc: c2 00 61 48 ld [ %g1 + 0x148 ], %g1 ! 40020948 <_Watchdog_Ticks_since_boot> 4000afc0: 92 02 40 01 add %o1, %g1, %o1 4000afc4: 03 20 00 00 sethi %hi(0x80000000), %g1 4000afc8: 10 bf ff f2 b 4000af90 <_Scheduler_CBS_Release_job+0x38> 4000afcc: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 4000afd0 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 4000afd0: 9d e3 bf a0 save %sp, -96, %sp Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server *serv_info; Priority_Control new_priority; _Scheduler_EDF_Enqueue(the_thread); 4000afd4: 40 00 00 50 call 4000b114 <_Scheduler_EDF_Enqueue> 4000afd8: 90 10 00 18 mov %i0, %o0 /* TODO: flash critical section? */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 4000afdc: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 4000afe0: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 * Late unblock rule for deadline-driven tasks. The remaining time to * deadline must be sufficient to serve the remaining computation time * without increased utilization of this task. It might cause a deadline * miss of another task. */ if (serv_info) { 4000afe4: 80 a7 60 00 cmp %i5, 0 4000afe8: 02 80 00 19 be 4000b04c <_Scheduler_CBS_Unblock+0x7c> 4000afec: 03 10 00 82 sethi %hi(0x40020800), %g1 time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 4000aff0: d2 07 60 04 ld [ %i5 + 4 ], %o1 */ if (serv_info) { time_t deadline = serv_info->parameters.deadline; time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - 4000aff4: d0 00 61 48 ld [ %g1 + 0x148 ], %o0 4000aff8: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 4000affc: 40 00 3d 3a call 4001a4e4 <.umul> 4000b000: 90 27 00 08 sub %i4, %o0, %o0 4000b004: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 4000b008: b6 10 00 08 mov %o0, %i3 4000b00c: 40 00 3d 36 call 4001a4e4 <.umul> 4000b010: d0 07 60 08 ld [ %i5 + 8 ], %o0 4000b014: 80 a6 c0 08 cmp %i3, %o0 4000b018: 24 80 00 0e ble,a 4000b050 <_Scheduler_CBS_Unblock+0x80> 4000b01c: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 /* Put late unblocked task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 4000b020: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 4000b024: 80 a7 00 09 cmp %i4, %o1 4000b028: 32 80 00 02 bne,a 4000b030 <_Scheduler_CBS_Unblock+0x60> 4000b02c: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 4000b030: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 4000b034: 80 a2 00 09 cmp %o0, %o1 4000b038: 02 80 00 07 be 4000b054 <_Scheduler_CBS_Unblock+0x84> 4000b03c: 3b 10 00 82 sethi %hi(0x40020800), %i5 _Thread_Change_priority(the_thread, new_priority, true); 4000b040: 90 10 00 18 mov %i0, %o0 4000b044: 40 00 01 0e call 4000b47c <_Thread_Change_priority> 4000b048: 94 10 20 01 mov 1, %o2 4000b04c: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, 4000b050: 3b 10 00 82 sethi %hi(0x40020800), %i5 4000b054: ba 17 62 60 or %i5, 0x260, %i5 ! 40020a60 <_Per_CPU_Information> 4000b058: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 4000b05c: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 4000b060: 03 10 00 7e sethi %hi(0x4001f800), %g1 4000b064: c2 00 63 54 ld [ %g1 + 0x354 ], %g1 ! 4001fb54 <_Scheduler+0x30> 4000b068: 9f c0 40 00 call %g1 4000b06c: 01 00 00 00 nop 4000b070: 80 a2 20 00 cmp %o0, 0 4000b074: 04 80 00 0a ble 4000b09c <_Scheduler_CBS_Unblock+0xcc> 4000b078: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000b07c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; 4000b080: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 4000b084: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 4000b088: 80 a0 60 00 cmp %g1, 0 4000b08c: 22 80 00 06 be,a 4000b0a4 <_Scheduler_CBS_Unblock+0xd4> 4000b090: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 4000b094: 82 10 20 01 mov 1, %g1 4000b098: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 4000b09c: 81 c7 e0 08 ret 4000b0a0: 81 e8 00 00 restore * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000b0a4: 80 a0 60 00 cmp %g1, 0 4000b0a8: 12 bf ff fd bne 4000b09c <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 4000b0ac: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 4000b0b0: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 4000b0b4: 30 bf ff fa b,a 4000b09c <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 4000af28 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 4000af28: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 4000af2c: 40 00 06 d9 call 4000ca90 <_Workspace_Allocate> 4000af30: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 4000af34: 80 a2 20 00 cmp %o0, 0 4000af38: 02 80 00 05 be 4000af4c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 4000af3c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 4000af40: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 4000af44: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 4000af48: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 4000af4c: 81 c7 e0 08 ret 4000af50: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 4000b10c <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 4000b10c: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 4000b110: 7f ff ff a8 call 4000afb0 <_Scheduler_EDF_Enqueue> 4000b114: 90 10 00 18 mov %i0, %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( 4000b118: 3b 10 00 82 sethi %hi(0x40020800), %i5 4000b11c: ba 17 61 c0 or %i5, 0x1c0, %i5 ! 400209c0 <_Per_CPU_Information> 4000b120: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 4000b124: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 4000b128: 03 10 00 7e sethi %hi(0x4001f800), %g1 4000b12c: c2 00 62 b4 ld [ %g1 + 0x2b4 ], %g1 ! 4001fab4 <_Scheduler+0x30> 4000b130: 9f c0 40 00 call %g1 4000b134: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 4000b138: 80 a2 20 00 cmp %o0, 0 4000b13c: 26 80 00 04 bl,a 4000b14c <_Scheduler_EDF_Unblock+0x40> 4000b140: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 4000b144: 81 c7 e0 08 ret 4000b148: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 4000b14c: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 4000b150: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 4000b154: 80 a0 60 00 cmp %g1, 0 4000b158: 22 80 00 06 be,a 4000b170 <_Scheduler_EDF_Unblock+0x64> 4000b15c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 4000b160: 82 10 20 01 mov 1, %g1 4000b164: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 4000b168: 81 c7 e0 08 ret 4000b16c: 81 e8 00 00 restore */ if ( _Scheduler_Is_priority_lower_than( _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000b170: 80 a0 60 00 cmp %g1, 0 4000b174: 12 bf ff f4 bne 4000b144 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 4000b178: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 4000b17c: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 4000b180: 30 bf ff fa b,a 4000b168 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 4000b11c <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 4000b11c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 4000b120: c2 00 63 44 ld [ %g1 + 0x344 ], %g1 ! 4001ef44 <_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 ) { 4000b124: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 4000b128: c2 00 40 00 ld [ %g1 ], %g1 4000b12c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 4000b130: 80 a0 80 03 cmp %g2, %g3 4000b134: 3a 80 00 08 bcc,a 4000b154 <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 4000b138: 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 ) { 4000b13c: 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 ) { 4000b140: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 4000b144: 80 a0 80 03 cmp %g2, %g3 4000b148: 2a bf ff fe bcs,a 4000b140 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 4000b14c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 4000b150: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 4000b154: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 4000b158: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 4000b15c: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 4000b160: c4 22 00 00 st %g2, [ %o0 ] before_node->previous = the_node; 4000b164: 81 c3 e0 08 retl 4000b168: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 40009240 <_TOD_Validate>: }; bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 40009240: 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(); 40009244: 03 10 00 79 sethi %hi(0x4001e400), %g1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 40009248: d2 00 60 0c ld [ %g1 + 0xc ], %o1 ! 4001e40c 4000924c: 11 00 03 d0 sethi %hi(0xf4000), %o0 40009250: 40 00 46 c5 call 4001ad64 <.udiv> 40009254: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 40009258: 80 a6 20 00 cmp %i0, 0 4000925c: 02 80 00 2c be 4000930c <_TOD_Validate+0xcc> <== NEVER TAKEN 40009260: 82 10 20 00 clr %g1 40009264: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 40009268: 80 a2 00 02 cmp %o0, %g2 4000926c: 28 80 00 26 bleu,a 40009304 <_TOD_Validate+0xc4> 40009270: b0 08 60 01 and %g1, 1, %i0 (the_tod->ticks >= ticks_per_second) || 40009274: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 40009278: 80 a0 a0 3b cmp %g2, 0x3b 4000927c: 38 80 00 22 bgu,a 40009304 <_TOD_Validate+0xc4> 40009280: b0 08 60 01 and %g1, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 40009284: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 40009288: 80 a0 a0 3b cmp %g2, 0x3b 4000928c: 38 80 00 1e bgu,a 40009304 <_TOD_Validate+0xc4> 40009290: b0 08 60 01 and %g1, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 40009294: c4 06 20 0c ld [ %i0 + 0xc ], %g2 40009298: 80 a0 a0 17 cmp %g2, 0x17 4000929c: 38 80 00 1a bgu,a 40009304 <_TOD_Validate+0xc4> 400092a0: b0 08 60 01 and %g1, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 400092a4: c4 06 20 04 ld [ %i0 + 4 ], %g2 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) || 400092a8: 80 a0 a0 00 cmp %g2, 0 400092ac: 02 80 00 15 be 40009300 <_TOD_Validate+0xc0> <== NEVER TAKEN 400092b0: 80 a0 a0 0c cmp %g2, 0xc (the_tod->month == 0) || 400092b4: 38 80 00 14 bgu,a 40009304 <_TOD_Validate+0xc4> 400092b8: b0 08 60 01 and %g1, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 400092bc: c6 06 00 00 ld [ %i0 ], %g3 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 400092c0: 80 a0 e7 c3 cmp %g3, 0x7c3 400092c4: 28 80 00 10 bleu,a 40009304 <_TOD_Validate+0xc4> 400092c8: b0 08 60 01 and %g1, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 400092cc: c8 06 20 08 ld [ %i0 + 8 ], %g4 (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) || 400092d0: 80 a1 20 00 cmp %g4, 0 400092d4: 02 80 00 0b be 40009300 <_TOD_Validate+0xc0> <== NEVER TAKEN 400092d8: 80 88 e0 03 btst 3, %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 400092dc: 32 80 00 0f bne,a 40009318 <_TOD_Validate+0xd8> 400092e0: 85 28 a0 02 sll %g2, 2, %g2 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 400092e4: 82 00 a0 0d add %g2, 0xd, %g1 400092e8: 05 10 00 7d sethi %hi(0x4001f400), %g2 400092ec: 83 28 60 02 sll %g1, 2, %g1 400092f0: 84 10 a0 f8 or %g2, 0xf8, %g2 400092f4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; if ( the_tod->day > days_in_month ) 400092f8: 80 a0 40 04 cmp %g1, %g4 400092fc: 82 60 3f ff subx %g0, -1, %g1 return false; return true; } 40009300: b0 08 60 01 and %g1, 1, %i0 40009304: 81 c7 e0 08 ret 40009308: 81 e8 00 00 restore 4000930c: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED 40009310: 81 c7 e0 08 ret <== NOT EXECUTED 40009314: 81 e8 00 00 restore <== NOT EXECUTED 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 ]; 40009318: 03 10 00 7d sethi %hi(0x4001f400), %g1 4000931c: 82 10 60 f8 or %g1, 0xf8, %g1 ! 4001f4f8 <_TOD_Days_per_month> 40009320: c2 00 40 02 ld [ %g1 + %g2 ], %g1 if ( the_tod->day > days_in_month ) 40009324: 80 a0 40 04 cmp %g1, %g4 40009328: 10 bf ff f6 b 40009300 <_TOD_Validate+0xc0> 4000932c: 82 60 3f ff subx %g0, -1, %g1 =============================================================================== 4000ab44 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 4000ab44: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 4000ab48: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 /* * 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 ); 4000ab4c: 40 00 03 90 call 4000b98c <_Thread_Set_transient> 4000ab50: 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 ) 4000ab54: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 4000ab58: 80 a0 40 19 cmp %g1, %i1 4000ab5c: 02 80 00 05 be 4000ab70 <_Thread_Change_priority+0x2c> 4000ab60: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 4000ab64: 90 10 00 18 mov %i0, %o0 4000ab68: 40 00 03 6f call 4000b924 <_Thread_Set_priority> 4000ab6c: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 4000ab70: 7f ff de 58 call 400024d0 4000ab74: 01 00 00 00 nop 4000ab78: 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; 4000ab7c: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 4000ab80: 80 a7 20 04 cmp %i4, 4 4000ab84: 02 80 00 18 be 4000abe4 <_Thread_Change_priority+0xa0> 4000ab88: 80 8e e0 04 btst 4, %i3 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 4000ab8c: 02 80 00 0b be 4000abb8 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 4000ab90: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 4000ab94: 7f ff de 53 call 400024e0 <== NOT EXECUTED 4000ab98: 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); 4000ab9c: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 4000aba0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 4000aba4: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED 4000aba8: 32 80 00 0d bne,a 4000abdc <_Thread_Change_priority+0x98><== NOT EXECUTED 4000abac: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 4000abb0: 81 c7 e0 08 ret 4000abb4: 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 ); 4000abb8: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 4000abbc: 7f ff de 49 call 400024e0 4000abc0: 90 10 00 19 mov %i1, %o0 4000abc4: 03 00 00 ef sethi %hi(0x3bc00), %g1 4000abc8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 4000abcc: 80 8f 00 01 btst %i4, %g1 4000abd0: 02 bf ff f8 be 4000abb0 <_Thread_Change_priority+0x6c> 4000abd4: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 4000abd8: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 4000abdc: 40 00 03 22 call 4000b864 <_Thread_queue_Requeue> 4000abe0: 93 e8 00 1d restore %g0, %i5, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 4000abe4: 22 80 00 19 be,a 4000ac48 <_Thread_Change_priority+0x104><== ALWAYS TAKEN 4000abe8: c0 27 60 10 clr [ %i5 + 0x10 ] 4000abec: 39 10 00 77 sethi %hi(0x4001dc00), %i4 <== NOT EXECUTED 4000abf0: b8 17 23 44 or %i4, 0x344, %i4 ! 4001df44 <_Scheduler> <== NOT EXECUTED _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 4000abf4: 7f ff de 3b call 400024e0 4000abf8: 90 10 00 19 mov %i1, %o0 4000abfc: 7f ff de 35 call 400024d0 4000ac00: 01 00 00 00 nop 4000ac04: 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(); 4000ac08: c2 07 20 08 ld [ %i4 + 8 ], %g1 4000ac0c: 9f c0 40 00 call %g1 4000ac10: 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 ); 4000ac14: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000ac18: 82 10 62 10 or %g1, 0x210, %g1 ! 4001ee10 <_Per_CPU_Information> * 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() && 4000ac1c: c4 18 60 10 ldd [ %g1 + 0x10 ], %g2 4000ac20: 80 a0 80 03 cmp %g2, %g3 4000ac24: 02 80 00 07 be 4000ac40 <_Thread_Change_priority+0xfc> 4000ac28: 01 00 00 00 nop 4000ac2c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 4000ac30: 80 a0 a0 00 cmp %g2, 0 4000ac34: 02 80 00 03 be 4000ac40 <_Thread_Change_priority+0xfc> 4000ac38: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 4000ac3c: c4 28 60 0c stb %g2, [ %g1 + 0xc ] _ISR_Enable( level ); 4000ac40: 7f ff de 28 call 400024e0 4000ac44: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 4000ac48: 39 10 00 77 sethi %hi(0x4001dc00), %i4 * 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 ) 4000ac4c: 80 a6 a0 00 cmp %i2, 0 4000ac50: 02 80 00 06 be 4000ac68 <_Thread_Change_priority+0x124> 4000ac54: b8 17 23 44 or %i4, 0x344, %i4 4000ac58: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 4000ac5c: 9f c0 40 00 call %g1 4000ac60: 90 10 00 1d mov %i5, %o0 4000ac64: 30 bf ff e4 b,a 4000abf4 <_Thread_Change_priority+0xb0> */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 4000ac68: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 4000ac6c: 9f c0 40 00 call %g1 4000ac70: 90 10 00 1d mov %i5, %o0 4000ac74: 30 bf ff e0 b,a 4000abf4 <_Thread_Change_priority+0xb0> =============================================================================== 4000ae64 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 4000ae64: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 4000ae68: 90 10 00 18 mov %i0, %o0 4000ae6c: 40 00 00 7c call 4000b05c <_Thread_Get> 4000ae70: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 4000ae74: c2 07 bf fc ld [ %fp + -4 ], %g1 4000ae78: 80 a0 60 00 cmp %g1, 0 4000ae7c: 12 80 00 08 bne 4000ae9c <_Thread_Delay_ended+0x38> <== NEVER TAKEN 4000ae80: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 4000ae84: 7f ff ff 7d call 4000ac78 <_Thread_Clear_state> 4000ae88: 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) { uint32_t level = _Thread_Dispatch_disable_level; 4000ae8c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000ae90: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 ! 4001ec10 <_Thread_Dispatch_disable_level> --level; 4000ae94: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 4000ae98: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 4000ae9c: 81 c7 e0 08 ret 4000aea0: 81 e8 00 00 restore =============================================================================== 4000aea4 <_Thread_Dispatch>: #if defined(RTEMS_SMP) #include #endif void _Thread_Dispatch( void ) { 4000aea4: 9d e3 bf 98 save %sp, -104, %sp #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 4000aea8: 31 10 00 7b sethi %hi(0x4001ec00), %i0 4000aeac: b0 16 22 10 or %i0, 0x210, %i0 ! 4001ee10 <_Per_CPU_Information> _ISR_Disable( level ); 4000aeb0: 7f ff dd 88 call 400024d0 4000aeb4: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 while ( _Thread_Dispatch_necessary == true ) { 4000aeb8: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 4000aebc: 80 a0 60 00 cmp %g1, 0 4000aec0: 02 80 00 46 be 4000afd8 <_Thread_Dispatch+0x134> 4000aec4: 21 10 00 7b sethi %hi(0x4001ec00), %l0 heir = _Thread_Heir; 4000aec8: f4 06 20 14 ld [ %i0 + 0x14 ], %i2 * 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; 4000aecc: 82 10 20 01 mov 1, %g1 4000aed0: c2 24 20 10 st %g1, [ %l0 + 0x10 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 4000aed4: c0 2e 20 0c clrb [ %i0 + 0xc ] /* * 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 ) 4000aed8: 80 a6 c0 1a cmp %i3, %i2 4000aedc: 02 80 00 3f be 4000afd8 <_Thread_Dispatch+0x134> 4000aee0: f4 26 20 10 st %i2, [ %i0 + 0x10 ] 4000aee4: 23 10 00 78 sethi %hi(0x4001e000), %l1 4000aee8: 27 10 00 7b sethi %hi(0x4001ec00), %l3 4000aeec: a2 14 60 70 or %l1, 0x70, %l1 */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 4000aef0: 25 10 00 7a sethi %hi(0x4001e800), %l2 4000aef4: a6 14 e0 7c or %l3, 0x7c, %l3 4000aef8: b2 04 60 04 add %l1, 4, %i1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000aefc: 2b 10 00 7a sethi %hi(0x4001e800), %l5 4000af00: a4 14 a3 60 or %l2, 0x360, %l2 4000af04: a8 10 20 01 mov 1, %l4 */ #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 ) 4000af08: c2 06 a0 78 ld [ %i2 + 0x78 ], %g1 4000af0c: 80 a0 60 01 cmp %g1, 1 4000af10: 02 80 00 45 be 4000b024 <_Thread_Dispatch+0x180> 4000af14: c2 05 63 70 ld [ %l5 + 0x370 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 4000af18: 7f ff dd 72 call 400024e0 4000af1c: 01 00 00 00 nop 4000af20: 90 07 bf f8 add %fp, -8, %o0 4000af24: 7f ff f9 96 call 4000957c <_TOD_Get_with_nanoseconds> 4000af28: 92 10 00 12 mov %l2, %o1 4000af2c: c4 1e e0 80 ldd [ %i3 + 0x80 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 4000af30: f8 1e 20 20 ldd [ %i0 + 0x20 ], %i4 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 4000af34: d8 1f bf f8 ldd [ %fp + -8 ], %o4 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 4000af38: c2 04 c0 00 ld [ %l3 ], %g1 4000af3c: ba a3 40 1d subcc %o5, %i5, %i5 4000af40: b8 63 00 1c subx %o4, %i4, %i4 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 4000af44: 96 80 c0 1d addcc %g3, %i5, %o3 4000af48: 94 40 80 1c addx %g2, %i4, %o2 4000af4c: d4 3e e0 80 std %o2, [ %i3 + 0x80 ] 4000af50: 80 a0 60 00 cmp %g1, 0 4000af54: 02 80 00 06 be 4000af6c <_Thread_Dispatch+0xc8> <== NEVER TAKEN 4000af58: d8 3e 20 20 std %o4, [ %i0 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 4000af5c: c4 00 40 00 ld [ %g1 ], %g2 4000af60: c4 26 e1 48 st %g2, [ %i3 + 0x148 ] *_Thread_libc_reent = heir->libc_reent; 4000af64: c4 06 a1 48 ld [ %i2 + 0x148 ], %g2 4000af68: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 4000af6c: fa 04 40 00 ld [ %l1 ], %i5 { const Chain_Control *chain = &_User_extensions_Switches_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 4000af70: 80 a7 40 19 cmp %i5, %i1 4000af74: 02 80 00 0b be 4000afa0 <_Thread_Dispatch+0xfc> <== NEVER TAKEN 4000af78: 90 06 e0 c0 add %i3, 0xc0, %o0 const User_extensions_Switch_control *extension = (const User_extensions_Switch_control *) node; (*extension->thread_switch)( executing, heir ); 4000af7c: c2 07 60 08 ld [ %i5 + 8 ], %g1 4000af80: 90 10 00 1b mov %i3, %o0 4000af84: 9f c0 40 00 call %g1 4000af88: 92 10 00 1a mov %i2, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 4000af8c: fa 07 40 00 ld [ %i5 ], %i5 { const Chain_Control *chain = &_User_extensions_Switches_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 4000af90: 80 a7 40 19 cmp %i5, %i1 4000af94: 32 bf ff fb bne,a 4000af80 <_Thread_Dispatch+0xdc> 4000af98: c2 07 60 08 ld [ %i5 + 8 ], %g1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 4000af9c: 90 06 e0 c0 add %i3, 0xc0, %o0 4000afa0: 40 00 04 84 call 4000c1b0 <_CPU_Context_switch> 4000afa4: 92 06 a0 c0 add %i2, 0xc0, %o1 #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 4000afa8: 7f ff dd 4a call 400024d0 4000afac: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 4000afb0: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 4000afb4: 80 a0 60 00 cmp %g1, 0 4000afb8: 02 80 00 08 be 4000afd8 <_Thread_Dispatch+0x134> 4000afbc: 01 00 00 00 nop heir = _Thread_Heir; 4000afc0: f4 06 20 14 ld [ %i0 + 0x14 ], %i2 4000afc4: e8 24 20 10 st %l4, [ %l0 + 0x10 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 4000afc8: c0 2e 20 0c clrb [ %i0 + 0xc ] /* * 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 ) 4000afcc: 80 a6 80 1b cmp %i2, %i3 4000afd0: 12 bf ff ce bne 4000af08 <_Thread_Dispatch+0x64> <== ALWAYS TAKEN 4000afd4: f4 26 20 10 st %i2, [ %i0 + 0x10 ] 4000afd8: c0 24 20 10 clr [ %l0 + 0x10 ] post_switch: #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 0 ); #endif _ISR_Enable( level ); 4000afdc: 7f ff dd 41 call 400024e0 4000afe0: 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; 4000afe4: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000afe8: fa 00 60 80 ld [ %g1 + 0x80 ], %i5 ! 4001ec80 <_API_extensions_Post_switch_list> 4000afec: 82 10 60 80 or %g1, 0x80, %g1 { const Chain_Control *chain = &_API_extensions_Post_switch_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 4000aff0: b8 00 60 04 add %g1, 4, %i4 4000aff4: 80 a7 40 1c cmp %i5, %i4 4000aff8: 02 80 00 09 be 4000b01c <_Thread_Dispatch+0x178> 4000affc: 01 00 00 00 nop const API_extensions_Post_switch_control *post_switch = (const API_extensions_Post_switch_control *) node; (*post_switch->hook)( executing ); 4000b000: c2 07 60 08 ld [ %i5 + 8 ], %g1 4000b004: 9f c0 40 00 call %g1 4000b008: 90 10 00 1b mov %i3, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 4000b00c: fa 07 40 00 ld [ %i5 ], %i5 { const Chain_Control *chain = &_API_extensions_Post_switch_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 4000b010: 80 a7 40 1c cmp %i5, %i4 4000b014: 32 bf ff fc bne,a 4000b004 <_Thread_Dispatch+0x160> <== NEVER TAKEN 4000b018: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 4000b01c: 81 c7 e0 08 ret 4000b020: 81 e8 00 00 restore #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000b024: 10 bf ff bd b 4000af18 <_Thread_Dispatch+0x74> 4000b028: c2 26 a0 74 st %g1, [ %i2 + 0x74 ] =============================================================================== 4000f8e4 <_Thread_Handler>: #define INIT_NAME __main #define EXECUTE_GLOBAL_CONSTRUCTORS #endif void _Thread_Handler( void ) { 4000f8e4: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 4000f8e8: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000f8ec: fa 00 62 20 ld [ %g1 + 0x220 ], %i5 ! 4001ee20 <_Per_CPU_Information+0x10> /* * 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(); 4000f8f0: 3f 10 00 3e sethi %hi(0x4000f800), %i7 4000f8f4: be 17 e0 e4 or %i7, 0xe4, %i7 ! 4000f8e4 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 4000f8f8: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 4000f8fc: 7f ff ca f9 call 400024e0 4000f900: 91 2a 20 08 sll %o0, 8, %o0 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 4000f904: 03 10 00 79 sethi %hi(0x4001e400), %g1 doneConstructors = true; 4000f908: 84 10 20 01 mov 1, %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 4000f90c: f8 08 63 a0 ldub [ %g1 + 0x3a0 ], %i4 ); } static inline void _User_extensions_Thread_begin( Thread_Control *executing ) { _User_extensions_Iterate( 4000f910: 90 10 00 1d mov %i5, %o0 4000f914: 13 10 00 2e sethi %hi(0x4000b800), %o1 4000f918: 92 12 63 64 or %o1, 0x364, %o1 ! 4000bb64 <_User_extensions_Thread_begin_visitor> 4000f91c: 7f ff f0 af call 4000bbd8 <_User_extensions_Iterate> 4000f920: c4 28 63 a0 stb %g2, [ %g1 + 0x3a0 ] _User_extensions_Thread_begin( executing ); /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 4000f924: 7f ff ed c2 call 4000b02c <_Thread_Enable_dispatch> 4000f928: 01 00 00 00 nop /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { 4000f92c: 80 8f 20 ff btst 0xff, %i4 4000f930: 02 80 00 0e be 4000f968 <_Thread_Handler+0x84> 4000f934: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000f938: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 4000f93c: 80 a0 60 00 cmp %g1, 0 4000f940: 22 80 00 0e be,a 4000f978 <_Thread_Handler+0x94> <== ALWAYS TAKEN 4000f944: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 } } static inline void _User_extensions_Thread_exitted( Thread_Control *executing ) { _User_extensions_Iterate( 4000f948: 90 10 00 1d mov %i5, %o0 4000f94c: 13 10 00 2e sethi %hi(0x4000b800), %o1 4000f950: 7f ff f0 a2 call 4000bbd8 <_User_extensions_Iterate> 4000f954: 92 12 63 88 or %o1, 0x388, %o1 ! 4000bb88 <_User_extensions_Thread_exitted_visitor> * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); _Internal_error_Occurred( 4000f958: 90 10 20 00 clr %o0 4000f95c: 92 10 20 01 mov 1, %o1 4000f960: 7f ff e8 4f call 40009a9c <_Internal_error_Occurred> 4000f964: 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 (doCons) /* && (volatile void *)_init) */ { INIT_NAME (); 4000f968: 40 00 39 42 call 4001de70 <_init> 4000f96c: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000f970: 10 bf ff f3 b 4000f93c <_Thread_Handler+0x58> 4000f974: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 4000f978: 9f c0 40 00 call %g1 4000f97c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 4000f980: 10 bf ff f2 b 4000f948 <_Thread_Handler+0x64> 4000f984: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 4000b2bc <_Thread_Handler_initialization>: #if defined(RTEMS_SMP) #include #endif void _Thread_Handler_initialization(void) { 4000b2bc: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 4000b2c0: 03 10 00 70 sethi %hi(0x4001c000), %g1 4000b2c4: 82 10 61 b8 or %g1, 0x1b8, %g1 ! 4001c1b8 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 4000b2c8: c6 00 60 28 ld [ %g1 + 0x28 ], %g3 #include #endif void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 4000b2cc: fa 00 60 14 ld [ %g1 + 0x14 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 4000b2d0: f8 00 60 08 ld [ %g1 + 8 ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 4000b2d4: 80 a0 e0 00 cmp %g3, 0 4000b2d8: 02 80 00 1f be 4000b354 <_Thread_Handler_initialization+0x98><== NEVER TAKEN 4000b2dc: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 4000b2e0: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 4000b2e4: 80 a0 e0 00 cmp %g3, 0 4000b2e8: 02 80 00 1b be 4000b354 <_Thread_Handler_initialization+0x98> 4000b2ec: 80 a0 a0 00 cmp %g2, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 4000b2f0: 22 80 00 05 be,a 4000b304 <_Thread_Handler_initialization+0x48> 4000b2f4: 03 10 00 7b sethi %hi(0x4001ec00), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 4000b2f8: 9f c0 80 00 call %g2 4000b2fc: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 4001ec04 <_Thread_BSP_context+0x7c> _Thread_Dispatch_necessary = false; 4000b300: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000b304: 82 10 62 10 or %g1, 0x210, %g1 ! 4001ee10 <_Per_CPU_Information> 4000b308: c0 28 60 0c clrb [ %g1 + 0xc ] _Thread_Executing = NULL; 4000b30c: c0 20 60 10 clr [ %g1 + 0x10 ] _Thread_Heir = NULL; 4000b310: c0 20 60 14 clr [ %g1 + 0x14 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; #endif _Thread_Maximum_extensions = maximum_extensions; 4000b314: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000b318: f8 20 60 8c st %i4, [ %g1 + 0x8c ] ! 4001ec8c <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 4000b31c: 03 10 00 7a sethi %hi(0x4001e800), %g1 4000b320: fa 20 63 70 st %i5, [ %g1 + 0x370 ] ! 4001eb70 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 4000b324: 82 10 20 08 mov 8, %g1 4000b328: 11 10 00 7b sethi %hi(0x4001ec00), %o0 4000b32c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 4000b330: 90 12 21 00 or %o0, 0x100, %o0 4000b334: 92 10 20 01 mov 1, %o1 4000b338: 94 10 20 01 mov 1, %o2 4000b33c: 96 10 20 01 mov 1, %o3 4000b340: 98 10 21 60 mov 0x160, %o4 4000b344: 7f ff fb 7f call 4000a140 <_Objects_Initialize_information> 4000b348: 9a 10 20 00 clr %o5 4000b34c: 81 c7 e0 08 ret 4000b350: 81 e8 00 00 restore _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || rtems_configuration_get_stack_free_hook() == NULL) _Internal_error_Occurred( 4000b354: 90 10 20 00 clr %o0 4000b358: 92 10 20 01 mov 1, %o1 4000b35c: 7f ff f9 d0 call 40009a9c <_Internal_error_Occurred> 4000b360: 94 10 20 0e mov 0xe, %o2 =============================================================================== 4000b108 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 4000b108: 9d e3 bf 98 save %sp, -104, %sp 4000b10c: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 4000b110: f8 0f a0 5f ldub [ %fp + 0x5f ], %i4 4000b114: f4 00 40 00 ld [ %g1 ], %i2 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 4000b118: c0 26 61 4c clr [ %i1 + 0x14c ] 4000b11c: c0 26 61 50 clr [ %i1 + 0x150 ] extensions_area = NULL; the_thread->libc_reent = NULL; 4000b120: c0 26 61 48 clr [ %i1 + 0x148 ] /* * 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 ); 4000b124: 90 10 00 19 mov %i1, %o0 4000b128: 40 00 02 28 call 4000b9c8 <_Thread_Stack_Allocate> 4000b12c: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 4000b130: 80 a2 00 1b cmp %o0, %i3 4000b134: 0a 80 00 48 bcs 4000b254 <_Thread_Initialize+0x14c> 4000b138: 80 a2 20 00 cmp %o0, 0 4000b13c: 02 80 00 46 be 4000b254 <_Thread_Initialize+0x14c> <== NEVER TAKEN 4000b140: 37 10 00 7b sethi %hi(0x4001ec00), %i3 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 4000b144: c4 06 60 b8 ld [ %i1 + 0xb8 ], %g2 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 4000b148: c2 06 e0 8c ld [ %i3 + 0x8c ], %g1 4000b14c: c4 26 60 b4 st %g2, [ %i1 + 0xb4 ] the_stack->size = size; 4000b150: d0 26 60 b0 st %o0, [ %i1 + 0xb0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 4000b154: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 4000b158: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 4000b15c: c0 26 60 68 clr [ %i1 + 0x68 ] 4000b160: 80 a0 60 00 cmp %g1, 0 4000b164: 12 80 00 40 bne 4000b264 <_Thread_Initialize+0x15c> 4000b168: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 4000b16c: c0 26 61 54 clr [ %i1 + 0x154 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 4000b170: a0 10 20 00 clr %l0 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 4000b174: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 4000b178: 03 10 00 77 sethi %hi(0x4001dc00), %g1 4000b17c: c4 26 60 a0 st %g2, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; 4000b180: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 4000b184: c2 00 63 5c ld [ %g1 + 0x35c ], %g1 4000b188: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 4000b18c: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 4000b190: f8 2e 60 9c stb %i4, [ %i1 + 0x9c ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 4000b194: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 4000b198: b6 10 20 01 mov 1, %i3 the_thread->Wait.queue = NULL; 4000b19c: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 4000b1a0: f6 26 60 10 st %i3, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 4000b1a4: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 4000b1a8: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 4000b1ac: fa 26 60 ac st %i5, [ %i1 + 0xac ] 4000b1b0: 9f c0 40 00 call %g1 4000b1b4: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 4000b1b8: b8 92 20 00 orcc %o0, 0, %i4 4000b1bc: 22 80 00 17 be,a 4000b218 <_Thread_Initialize+0x110> 4000b1c0: d0 06 61 48 ld [ %i1 + 0x148 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 4000b1c4: 90 10 00 19 mov %i1, %o0 4000b1c8: 40 00 01 d7 call 4000b924 <_Thread_Set_priority> 4000b1cc: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000b1d0: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 4000b1d4: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 4000b1d8: c0 26 60 80 clr [ %i1 + 0x80 ] 4000b1dc: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000b1e0: 83 28 60 02 sll %g1, 2, %g1 4000b1e4: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 4000b1e8: f4 26 60 0c st %i2, [ %i1 + 0xc ] * @{ */ static inline bool _User_extensions_Thread_create( Thread_Control *created ) { User_extensions_Thread_create_context ctx = { created, true }; 4000b1ec: f2 27 bf f8 st %i1, [ %fp + -8 ] 4000b1f0: f6 2f bf fc stb %i3, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Thread_create_visitor ); 4000b1f4: 90 07 bf f8 add %fp, -8, %o0 4000b1f8: 13 10 00 2e sethi %hi(0x4000b800), %o1 4000b1fc: 40 00 02 77 call 4000bbd8 <_User_extensions_Iterate> 4000b200: 92 12 62 b0 or %o1, 0x2b0, %o1 ! 4000bab0 <_User_extensions_Thread_create_visitor> * 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 ); if ( extension_status ) 4000b204: c2 0f bf fc ldub [ %fp + -4 ], %g1 4000b208: 80 a0 60 00 cmp %g1, 0 4000b20c: 12 80 00 0f bne 4000b248 <_Thread_Initialize+0x140> 4000b210: b0 10 20 01 mov 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 4000b214: d0 06 61 48 ld [ %i1 + 0x148 ], %o0 4000b218: 40 00 03 d1 call 4000c15c <_Workspace_Free> 4000b21c: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 4000b220: 40 00 03 cf call 4000c15c <_Workspace_Free> 4000b224: d0 06 61 4c ld [ %i1 + 0x14c ], %o0 4000b228: 40 00 03 cd call 4000c15c <_Workspace_Free> 4000b22c: d0 06 61 50 ld [ %i1 + 0x150 ], %o0 _Workspace_Free( extensions_area ); 4000b230: 40 00 03 cb call 4000c15c <_Workspace_Free> 4000b234: 90 10 00 10 mov %l0, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); #endif _Workspace_Free( sched ); 4000b238: 40 00 03 c9 call 4000c15c <_Workspace_Free> 4000b23c: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 4000b240: 40 00 01 f2 call 4000ba08 <_Thread_Stack_Free> 4000b244: 90 10 00 19 mov %i1, %o0 4000b248: b0 0e 20 ff and %i0, 0xff, %i0 4000b24c: 81 c7 e0 08 ret 4000b250: 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 */ 4000b254: b0 10 20 00 clr %i0 4000b258: b0 0e 20 ff and %i0, 0xff, %i0 4000b25c: 81 c7 e0 08 ret 4000b260: 81 e8 00 00 restore /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 4000b264: 90 00 60 01 add %g1, 1, %o0 4000b268: 40 00 03 b5 call 4000c13c <_Workspace_Allocate> 4000b26c: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 4000b270: a0 92 20 00 orcc %o0, 0, %l0 4000b274: 02 80 00 10 be 4000b2b4 <_Thread_Initialize+0x1ac> 4000b278: 86 10 00 10 mov %l0, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 4000b27c: e0 26 61 54 st %l0, [ %i1 + 0x154 ] 4000b280: c8 06 e0 8c ld [ %i3 + 0x8c ], %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++ ) 4000b284: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 4000b288: 10 80 00 03 b 4000b294 <_Thread_Initialize+0x18c> 4000b28c: 82 10 20 00 clr %g1 4000b290: c6 06 61 54 ld [ %i1 + 0x154 ], %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; 4000b294: 85 28 a0 02 sll %g2, 2, %g2 4000b298: 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++ ) 4000b29c: 82 00 60 01 inc %g1 4000b2a0: 80 a0 40 04 cmp %g1, %g4 4000b2a4: 08 bf ff fb bleu 4000b290 <_Thread_Initialize+0x188> 4000b2a8: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 4000b2ac: 10 bf ff b3 b 4000b178 <_Thread_Initialize+0x70> 4000b2b0: 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; 4000b2b4: 10 bf ff d8 b 4000b214 <_Thread_Initialize+0x10c> 4000b2b8: b8 10 20 00 clr %i4 =============================================================================== 4000f988 <_Thread_queue_Extract_fifo>: void _Thread_queue_Extract_fifo( Thread_queue_Control *the_thread_queue __attribute__((unused)), Thread_Control *the_thread ) { 4000f988: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED ISR_Level level; _ISR_Disable( level ); 4000f98c: 7f ff ca d1 call 400024d0 <== NOT EXECUTED 4000f990: 01 00 00 00 nop <== NOT EXECUTED 4000f994: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED 4000f998: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 <== NOT EXECUTED 4000f99c: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 4000f9a0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 4000f9a4: 80 88 80 01 btst %g2, %g1 <== NOT EXECUTED 4000f9a8: 02 80 00 1a be 4000fa10 <_Thread_queue_Extract_fifo+0x88> <== NOT EXECUTED 4000f9ac: 01 00 00 00 nop <== NOT EXECUTED ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 4000f9b0: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED previous = the_node->previous; 4000f9b4: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED _Chain_Extract_unprotected( &the_thread->Object.Node ); the_thread->Wait.queue = NULL; if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 4000f9b8: c6 06 60 50 ld [ %i1 + 0x50 ], %g3 <== NOT EXECUTED next->previous = previous; 4000f9bc: c2 20 a0 04 st %g1, [ %g2 + 4 ] <== NOT EXECUTED previous->next = next; 4000f9c0: c4 20 40 00 st %g2, [ %g1 ] <== NOT EXECUTED 4000f9c4: 80 a0 e0 02 cmp %g3, 2 <== NOT EXECUTED 4000f9c8: 02 80 00 08 be 4000f9e8 <_Thread_queue_Extract_fifo+0x60> <== NOT EXECUTED 4000f9cc: c0 26 60 44 clr [ %i1 + 0x44 ] <== NOT EXECUTED _ISR_Enable( level ); 4000f9d0: 7f ff ca c4 call 400024e0 <== NOT EXECUTED 4000f9d4: b0 10 00 19 mov %i1, %i0 <== NOT EXECUTED 4000f9d8: 33 04 01 ff sethi %hi(0x1007fc00), %i1 <== NOT EXECUTED 4000f9dc: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <== NOT EXECUTED 4000f9e0: 7f ff ec a6 call 4000ac78 <_Thread_Clear_state> <== NOT EXECUTED 4000f9e4: 81 e8 00 00 restore <== NOT EXECUTED 4000f9e8: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 4000f9ec: c2 26 60 50 st %g1, [ %i1 + 0x50 ] <== NOT EXECUTED } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 4000f9f0: 7f ff ca bc call 400024e0 <== NOT EXECUTED 4000f9f4: b0 10 00 19 mov %i1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 4000f9f8: 7f ff f1 1b call 4000be64 <_Watchdog_Remove> <== NOT EXECUTED 4000f9fc: 90 06 60 48 add %i1, 0x48, %o0 <== NOT EXECUTED 4000fa00: 33 04 01 ff sethi %hi(0x1007fc00), %i1 <== NOT EXECUTED 4000fa04: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <== NOT EXECUTED 4000fa08: 7f ff ec 9c call 4000ac78 <_Thread_Clear_state> <== NOT EXECUTED 4000fa0c: 81 e8 00 00 restore <== NOT EXECUTED ISR_Level level; _ISR_Disable( level ); if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _ISR_Enable( level ); 4000fa10: 7f ff ca b4 call 400024e0 <== NOT EXECUTED 4000fa14: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000b864 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 4000b864: 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 ) 4000b868: 80 a6 20 00 cmp %i0, 0 4000b86c: 02 80 00 13 be 4000b8b8 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 4000b870: 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 ) { 4000b874: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 4000b878: 80 a7 60 01 cmp %i5, 1 4000b87c: 02 80 00 04 be 4000b88c <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 4000b880: 01 00 00 00 nop 4000b884: 81 c7 e0 08 ret <== NOT EXECUTED 4000b888: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 4000b88c: 7f ff db 11 call 400024d0 4000b890: 01 00 00 00 nop 4000b894: b8 10 00 08 mov %o0, %i4 4000b898: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 4000b89c: 03 00 00 ef sethi %hi(0x3bc00), %g1 4000b8a0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 4000b8a4: 80 88 80 01 btst %g2, %g1 4000b8a8: 12 80 00 06 bne 4000b8c0 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 4000b8ac: 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 ); 4000b8b0: 7f ff db 0c call 400024e0 4000b8b4: 90 10 00 1c mov %i4, %o0 4000b8b8: 81 c7 e0 08 ret 4000b8bc: 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 ); 4000b8c0: 92 10 00 19 mov %i1, %o1 4000b8c4: 94 10 20 01 mov 1, %o2 4000b8c8: 40 00 0a a5 call 4000e35c <_Thread_queue_Extract_priority_helper> 4000b8cc: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 4000b8d0: 90 10 00 18 mov %i0, %o0 4000b8d4: 92 10 00 19 mov %i1, %o1 4000b8d8: 7f ff ff 35 call 4000b5ac <_Thread_queue_Enqueue_priority> 4000b8dc: 94 07 bf fc add %fp, -4, %o2 4000b8e0: 30 bf ff f4 b,a 4000b8b0 <_Thread_queue_Requeue+0x4c> =============================================================================== 4000b8e4 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 4000b8e4: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 4000b8e8: 90 10 00 18 mov %i0, %o0 4000b8ec: 7f ff fd dc call 4000b05c <_Thread_Get> 4000b8f0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 4000b8f4: c2 07 bf fc ld [ %fp + -4 ], %g1 4000b8f8: 80 a0 60 00 cmp %g1, 0 4000b8fc: 12 80 00 08 bne 4000b91c <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 4000b900: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 4000b904: 40 00 0a cf call 4000e440 <_Thread_queue_Process_timeout> 4000b908: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 4000b90c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000b910: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 ! 4001ec10 <_Thread_Dispatch_disable_level> --level; 4000b914: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 4000b918: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 4000b91c: 81 c7 e0 08 ret 4000b920: 81 e8 00 00 restore =============================================================================== 40018af0 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 40018af0: 9d e3 bf 88 save %sp, -120, %sp 40018af4: 21 10 00 f4 sethi %hi(0x4003d000), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 40018af8: a4 07 bf e8 add %fp, -24, %l2 40018afc: b4 07 bf ec add %fp, -20, %i2 40018b00: b8 07 bf f4 add %fp, -12, %i4 40018b04: a2 07 bf f8 add %fp, -8, %l1 40018b08: 33 10 00 f3 sethi %hi(0x4003cc00), %i1 40018b0c: 27 10 00 f4 sethi %hi(0x4003d000), %l3 40018b10: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 40018b14: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 40018b18: e4 27 bf f0 st %l2, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 40018b1c: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 40018b20: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 40018b24: f8 27 bf fc st %i4, [ %fp + -4 ] 40018b28: a0 14 20 e8 or %l0, 0xe8, %l0 40018b2c: b6 06 20 30 add %i0, 0x30, %i3 40018b30: b2 16 63 48 or %i1, 0x348, %i1 40018b34: ba 06 20 68 add %i0, 0x68, %i5 40018b38: a6 14 e0 00 mov %l3, %l3 40018b3c: ac 06 20 08 add %i0, 8, %l6 40018b40: aa 06 20 40 add %i0, 0x40, %l5 _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; 40018b44: a8 10 20 01 mov 1, %l4 { /* * 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; 40018b48: e4 26 20 78 st %l2, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 40018b4c: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 40018b50: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 40018b54: 90 10 00 1b mov %i3, %o0 40018b58: 92 20 40 09 sub %g1, %o1, %o1 40018b5c: 94 10 00 1c mov %i4, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 40018b60: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 40018b64: 40 00 11 d4 call 4001d2b4 <_Watchdog_Adjust_to_chain> 40018b68: 01 00 00 00 nop 40018b6c: d0 1e 40 00 ldd [ %i1 ], %o0 40018b70: 94 10 20 00 clr %o2 40018b74: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 40018b78: 40 00 4d 55 call 4002c0cc <__divdi3> 40018b7c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 40018b80: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 40018b84: 80 a2 40 0a cmp %o1, %o2 40018b88: 18 80 00 2b bgu 40018c34 <_Timer_server_Body+0x144> 40018b8c: ae 10 00 09 mov %o1, %l7 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 40018b90: 80 a2 40 0a cmp %o1, %o2 40018b94: 0a 80 00 20 bcs 40018c14 <_Timer_server_Body+0x124> 40018b98: 90 10 00 1d mov %i5, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 40018b9c: ee 26 20 74 st %l7, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 40018ba0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 40018ba4: 40 00 02 a6 call 4001963c <_Chain_Get> 40018ba8: 01 00 00 00 nop if ( timer == NULL ) { 40018bac: 92 92 20 00 orcc %o0, 0, %o1 40018bb0: 02 80 00 10 be 40018bf0 <_Timer_server_Body+0x100> 40018bb4: 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 ) { 40018bb8: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 40018bbc: 80 a0 60 01 cmp %g1, 1 40018bc0: 02 80 00 19 be 40018c24 <_Timer_server_Body+0x134> 40018bc4: 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 ) { 40018bc8: 12 bf ff f6 bne 40018ba0 <_Timer_server_Body+0xb0> <== NEVER TAKEN 40018bcc: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40018bd0: 40 00 11 e5 call 4001d364 <_Watchdog_Insert> 40018bd4: 90 10 00 1d mov %i5, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 40018bd8: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 40018bdc: 40 00 02 98 call 4001963c <_Chain_Get> 40018be0: 01 00 00 00 nop if ( timer == NULL ) { 40018be4: 92 92 20 00 orcc %o0, 0, %o1 40018be8: 32 bf ff f5 bne,a 40018bbc <_Timer_server_Body+0xcc> <== NEVER TAKEN 40018bec: 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 ); 40018bf0: 7f ff da 73 call 4000f5bc 40018bf4: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 40018bf8: c2 07 bf e8 ld [ %fp + -24 ], %g1 40018bfc: 80 a0 40 1a cmp %g1, %i2 40018c00: 02 80 00 12 be 40018c48 <_Timer_server_Body+0x158> <== ALWAYS TAKEN 40018c04: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 40018c08: 7f ff da 71 call 4000f5cc <== NOT EXECUTED 40018c0c: 01 00 00 00 nop <== NOT EXECUTED 40018c10: 30 bf ff cf b,a 40018b4c <_Timer_server_Body+0x5c> <== NOT EXECUTED /* * 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 ); 40018c14: 92 10 20 01 mov 1, %o1 ! 1 40018c18: 40 00 11 77 call 4001d1f4 <_Watchdog_Adjust> 40018c1c: 94 22 80 17 sub %o2, %l7, %o2 40018c20: 30 bf ff df b,a 40018b9c <_Timer_server_Body+0xac> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 40018c24: 90 10 00 1b mov %i3, %o0 40018c28: 40 00 11 cf call 4001d364 <_Watchdog_Insert> 40018c2c: 92 02 60 10 add %o1, 0x10, %o1 40018c30: 30 bf ff dc b,a 40018ba0 <_Timer_server_Body+0xb0> /* * 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 ); 40018c34: 92 22 40 0a sub %o1, %o2, %o1 40018c38: 90 10 00 1d mov %i5, %o0 40018c3c: 40 00 11 9e call 4001d2b4 <_Watchdog_Adjust_to_chain> 40018c40: 94 10 00 1c mov %i4, %o2 40018c44: 30 bf ff d6 b,a 40018b9c <_Timer_server_Body+0xac> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 40018c48: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 40018c4c: 7f ff da 60 call 4000f5cc 40018c50: 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 ) ) { 40018c54: c2 07 bf f4 ld [ %fp + -12 ], %g1 40018c58: 80 a0 40 11 cmp %g1, %l1 40018c5c: 12 80 00 0c bne 40018c8c <_Timer_server_Body+0x19c> 40018c60: 01 00 00 00 nop 40018c64: 30 80 00 13 b,a 40018cb0 <_Timer_server_Body+0x1c0> 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; 40018c68: f8 20 60 04 st %i4, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 40018c6c: 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; 40018c70: c0 25 e0 08 clr [ %l7 + 8 ] _ISR_Enable( level ); 40018c74: 7f ff da 56 call 4000f5cc 40018c78: 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 ); 40018c7c: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0 40018c80: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1 40018c84: 9f c0 40 00 call %g1 40018c88: d2 05 e0 24 ld [ %l7 + 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 ); 40018c8c: 7f ff da 4c call 4000f5bc 40018c90: 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; 40018c94: ee 07 bf f4 ld [ %fp + -12 ], %l7 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 40018c98: 80 a5 c0 11 cmp %l7, %l1 40018c9c: 32 bf ff f3 bne,a 40018c68 <_Timer_server_Body+0x178> 40018ca0: c2 05 c0 00 ld [ %l7 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 40018ca4: 7f ff da 4a call 4000f5cc 40018ca8: 01 00 00 00 nop 40018cac: 30 bf ff a7 b,a 40018b48 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 40018cb0: 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) { uint32_t level = _Thread_Dispatch_disable_level; 40018cb4: c2 04 c0 00 ld [ %l3 ], %g1 ++level; 40018cb8: 82 00 60 01 inc %g1 _Thread_Dispatch_disable_level = level; 40018cbc: c2 24 c0 00 st %g1, [ %l3 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 40018cc0: d0 06 00 00 ld [ %i0 ], %o0 40018cc4: 40 00 10 63 call 4001ce50 <_Thread_Set_state> 40018cc8: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 40018ccc: 7f ff ff 07 call 400188e8 <_Timer_server_Reset_interval_system_watchdog> 40018cd0: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 40018cd4: 7f ff ff 19 call 40018938 <_Timer_server_Reset_tod_system_watchdog> 40018cd8: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 40018cdc: 40 00 0d f9 call 4001c4c0 <_Thread_Enable_dispatch> 40018ce0: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 40018ce4: 90 10 00 16 mov %l6, %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; 40018ce8: e8 2e 20 7c stb %l4, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 40018cec: 40 00 11 fd call 4001d4e0 <_Watchdog_Remove> 40018cf0: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 40018cf4: 40 00 11 fb call 4001d4e0 <_Watchdog_Remove> 40018cf8: 90 10 00 15 mov %l5, %o0 40018cfc: 30 bf ff 93 b,a 40018b48 <_Timer_server_Body+0x58> =============================================================================== 40018988 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 40018988: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 4001898c: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 40018990: 80 a0 60 00 cmp %g1, 0 40018994: 02 80 00 05 be 400189a8 <_Timer_server_Schedule_operation_method+0x20> 40018998: 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 ); 4001899c: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 400189a0: 40 00 03 1c call 40019610 <_Chain_Append> 400189a4: 81 e8 00 00 restore * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 400189a8: 03 10 00 f4 sethi %hi(0x4003d000), %g1 400189ac: c4 00 60 00 ld [ %g1 ], %g2 ++level; 400189b0: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 400189b4: c4 20 60 00 st %g2, [ %g1 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 400189b8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 400189bc: 80 a0 60 01 cmp %g1, 1 400189c0: 02 80 00 2b be 40018a6c <_Timer_server_Schedule_operation_method+0xe4> 400189c4: 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 ) { 400189c8: 02 80 00 04 be 400189d8 <_Timer_server_Schedule_operation_method+0x50> 400189cc: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 400189d0: 40 00 0e bc call 4001c4c0 <_Thread_Enable_dispatch> 400189d4: 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 ); 400189d8: 7f ff da f9 call 4000f5bc 400189dc: 01 00 00 00 nop 400189e0: b8 10 00 08 mov %o0, %i4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 400189e4: 03 10 00 f3 sethi %hi(0x4003cc00), %g1 400189e8: d0 18 63 48 ldd [ %g1 + 0x348 ], %o0 ! 4003cf48 <_TOD> 400189ec: 94 10 20 00 clr %o2 400189f0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 400189f4: 40 00 4d b6 call 4002c0cc <__divdi3> 400189f8: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 400189fc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; 40018a00: c4 06 20 74 ld [ %i0 + 0x74 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 40018a04: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 40018a08: 80 a0 40 03 cmp %g1, %g3 40018a0c: 02 80 00 0a be 40018a34 <_Timer_server_Schedule_operation_method+0xac> 40018a10: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 40018a14: 08 80 00 34 bleu 40018ae4 <_Timer_server_Schedule_operation_method+0x15c> 40018a18: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 40018a1c: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 40018a20: 80 a1 00 02 cmp %g4, %g2 40018a24: 08 80 00 03 bleu 40018a30 <_Timer_server_Schedule_operation_method+0xa8><== NEVER TAKEN 40018a28: 86 10 20 00 clr %g3 delta_interval -= delta; 40018a2c: 86 21 00 02 sub %g4, %g2, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 40018a30: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 40018a34: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 40018a38: 7f ff da e5 call 4000f5cc 40018a3c: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40018a40: 90 06 20 68 add %i0, 0x68, %o0 40018a44: 40 00 12 48 call 4001d364 <_Watchdog_Insert> 40018a48: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 40018a4c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 40018a50: 80 a0 60 00 cmp %g1, 0 40018a54: 12 bf ff df bne 400189d0 <_Timer_server_Schedule_operation_method+0x48> 40018a58: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 40018a5c: 7f ff ff b7 call 40018938 <_Timer_server_Reset_tod_system_watchdog> 40018a60: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 40018a64: 40 00 0e 97 call 4001c4c0 <_Thread_Enable_dispatch> 40018a68: 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 ); 40018a6c: 7f ff da d4 call 4000f5bc 40018a70: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 40018a74: 05 10 00 f4 sethi %hi(0x4003d000), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 40018a78: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 40018a7c: c4 00 a0 e8 ld [ %g2 + 0xe8 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 40018a80: 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 ); 40018a84: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 40018a88: 80 a0 40 03 cmp %g1, %g3 40018a8c: 02 80 00 08 be 40018aac <_Timer_server_Schedule_operation_method+0x124> 40018a90: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 40018a94: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 40018a98: 80 a1 00 1c cmp %g4, %i4 40018a9c: 1a 80 00 03 bcc 40018aa8 <_Timer_server_Schedule_operation_method+0x120> 40018aa0: 86 10 20 00 clr %g3 delta_interval -= delta; 40018aa4: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 40018aa8: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 40018aac: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 40018ab0: 7f ff da c7 call 4000f5cc 40018ab4: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 40018ab8: 90 06 20 30 add %i0, 0x30, %o0 40018abc: 40 00 12 2a call 4001d364 <_Watchdog_Insert> 40018ac0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 40018ac4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 40018ac8: 80 a0 60 00 cmp %g1, 0 40018acc: 12 bf ff c1 bne 400189d0 <_Timer_server_Schedule_operation_method+0x48> 40018ad0: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 40018ad4: 7f ff ff 85 call 400188e8 <_Timer_server_Reset_interval_system_watchdog> 40018ad8: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 40018adc: 40 00 0e 79 call 4001c4c0 <_Thread_Enable_dispatch> 40018ae0: 81 e8 00 00 restore } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 40018ae4: 84 01 00 02 add %g4, %g2, %g2 delta_interval += delta; 40018ae8: 10 bf ff d2 b 40018a30 <_Timer_server_Schedule_operation_method+0xa8> 40018aec: 86 20 80 09 sub %g2, %o1, %g3 =============================================================================== 4000bfd0 <_Timespec_Add_to>: ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000bfd0: d8 02 00 00 ld [ %o0 ], %o4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 4000bfd4: c4 02 40 00 ld [ %o1 ], %g2 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 4000bfd8: c6 02 20 04 ld [ %o0 + 4 ], %g3 4000bfdc: c2 02 60 04 ld [ %o1 + 4 ], %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000bfe0: 98 03 00 02 add %o4, %g2, %o4 time->tv_nsec += add->tv_nsec; 4000bfe4: 82 00 c0 01 add %g3, %g1, %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000bfe8: d8 22 00 00 st %o4, [ %o0 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 4000bfec: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 4000bff0: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 4000bff4: 80 a0 40 04 cmp %g1, %g4 4000bff8: 08 80 00 0d bleu 4000c02c <_Timespec_Add_to+0x5c> 4000bffc: c2 22 20 04 st %g1, [ %o0 + 4 ] 4000c000: 98 03 20 01 inc %o4 time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 4000c004: 1b 31 19 4d sethi %hi(0xc4653400), %o5 #include #include #include #include uint32_t _Timespec_Add_to( 4000c008: 98 23 00 02 sub %o4, %g2, %o4 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 ) { time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 4000c00c: 9a 13 62 00 or %o5, 0x200, %o5 4000c010: 82 00 40 0d add %g1, %o5, %g1 #include #include #include #include uint32_t _Timespec_Add_to( 4000c014: 86 03 00 02 add %o4, %g2, %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 ) { 4000c018: 80 a0 40 04 cmp %g1, %g4 4000c01c: 18 bf ff fd bgu 4000c010 <_Timespec_Add_to+0x40> <== NEVER TAKEN 4000c020: 84 00 a0 01 inc %g2 4000c024: c2 22 20 04 st %g1, [ %o0 + 4 ] 4000c028: c6 22 00 00 st %g3, [ %o0 ] time->tv_sec++; seconds++; } return seconds; } 4000c02c: 81 c3 e0 08 retl 4000c030: 90 10 00 02 mov %g2, %o0 =============================================================================== 4000d354 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 4000d354: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 4000d358: d4 1e 40 00 ldd [ %i1 ], %o2 4000d35c: 80 92 80 0b orcc %o2, %o3, %g0 4000d360: 22 80 00 2f be,a 4000d41c <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 4000d364: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 4000d368: e0 1e 00 00 ldd [ %i0 ], %l0 4000d36c: 83 2c 20 02 sll %l0, 2, %g1 4000d370: 89 34 60 1e srl %l1, 0x1e, %g4 4000d374: 87 2c 60 02 sll %l1, 2, %g3 4000d378: 84 11 00 01 or %g4, %g1, %g2 4000d37c: 83 30 e0 1b srl %g3, 0x1b, %g1 4000d380: 9b 28 e0 05 sll %g3, 5, %o5 4000d384: 99 28 a0 05 sll %g2, 5, %o4 4000d388: 86 a3 40 03 subcc %o5, %g3, %g3 4000d38c: 98 10 40 0c or %g1, %o4, %o4 4000d390: 84 63 00 02 subx %o4, %g2, %g2 4000d394: 92 80 c0 11 addcc %g3, %l1, %o1 4000d398: 83 32 60 1e srl %o1, 0x1e, %g1 4000d39c: 90 40 80 10 addx %g2, %l0, %o0 4000d3a0: b3 2a 60 02 sll %o1, 2, %i1 4000d3a4: b1 2a 20 02 sll %o0, 2, %i0 4000d3a8: 86 82 40 19 addcc %o1, %i1, %g3 4000d3ac: b0 10 40 18 or %g1, %i0, %i0 4000d3b0: 83 30 e0 1e srl %g3, 0x1e, %g1 4000d3b4: 84 42 00 18 addx %o0, %i0, %g2 4000d3b8: bb 28 e0 02 sll %g3, 2, %i5 4000d3bc: b9 28 a0 02 sll %g2, 2, %i4 4000d3c0: 92 80 c0 1d addcc %g3, %i5, %o1 4000d3c4: b8 10 40 1c or %g1, %i4, %i4 4000d3c8: 87 32 60 1b srl %o1, 0x1b, %g3 4000d3cc: 90 40 80 1c addx %g2, %i4, %o0 4000d3d0: 83 2a 60 05 sll %o1, 5, %g1 4000d3d4: 85 2a 20 05 sll %o0, 5, %g2 4000d3d8: 92 10 00 01 mov %g1, %o1 4000d3dc: 40 00 37 ba call 4001b2c4 <__divdi3> 4000d3e0: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 4000d3e4: 94 10 20 00 clr %o2 * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 4000d3e8: b8 10 00 08 mov %o0, %i4 4000d3ec: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 4000d3f0: 40 00 37 b5 call 4001b2c4 <__divdi3> 4000d3f4: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 4000d3f8: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 4000d3fc: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 4000d400: 94 10 20 00 clr %o2 4000d404: 96 10 23 e8 mov 0x3e8, %o3 4000d408: 40 00 38 9a call 4001b670 <__moddi3> 4000d40c: 92 10 00 1d mov %i5, %o1 4000d410: d2 26 c0 00 st %o1, [ %i3 ] 4000d414: 81 c7 e0 08 ret 4000d418: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 4000d41c: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 4000d420: 81 c7 e0 08 ret <== NOT EXECUTED 4000d424: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000bca8 <_User_extensions_Handler_initialization>: } } void _User_extensions_Handler_initialization(void) { 4000bca8: 9d e3 bf 98 save %sp, -104, %sp uint32_t number_of_initial_extensions = 4000bcac: 03 10 00 70 sethi %hi(0x4001c000), %g1 4000bcb0: c2 00 61 f8 ld [ %g1 + 0x1f8 ], %g1 ! 4001c1f8 rtems_configuration_get_number_of_initial_extensions(); if ( number_of_initial_extensions > 0 ) { 4000bcb4: 80 a0 60 00 cmp %g1, 0 4000bcb8: 02 80 00 0a be 4000bce0 <_User_extensions_Handler_initialization+0x38><== NEVER TAKEN 4000bcbc: 91 28 60 02 sll %g1, 2, %o0 User_extensions_Switch_control *initial_extension_switch_controls = _Workspace_Allocate_or_fatal_error( number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) 4000bcc0: 83 28 60 04 sll %g1, 4, %g1 { uint32_t number_of_initial_extensions = rtems_configuration_get_number_of_initial_extensions(); if ( number_of_initial_extensions > 0 ) { User_extensions_Switch_control *initial_extension_switch_controls = 4000bcc4: 40 00 01 2c call 4000c174 <_Workspace_Allocate_or_fatal_error> 4000bcc8: 90 20 40 08 sub %g1, %o0, %o0 number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) ); User_extensions_Switch_context ctx = { initial_extension_switch_controls }; _User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor ); 4000bccc: 13 10 00 2f sethi %hi(0x4000bc00), %o1 User_extensions_Switch_control *initial_extension_switch_controls = _Workspace_Allocate_or_fatal_error( number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) ); User_extensions_Switch_context ctx = { initial_extension_switch_controls }; 4000bcd0: d0 27 bf fc st %o0, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor ); 4000bcd4: 92 12 60 64 or %o1, 0x64, %o1 4000bcd8: 7f ff ff c0 call 4000bbd8 <_User_extensions_Iterate> 4000bcdc: 90 07 bf fc add %fp, -4, %o0 4000bce0: 81 c7 e0 08 ret 4000bce4: 81 e8 00 00 restore =============================================================================== 4000bbd8 <_User_extensions_Iterate>: void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { 4000bbd8: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing = _Thread_Executing; const User_extensions_Table *callouts_current = 4000bbdc: 03 10 00 70 sethi %hi(0x4001c000), %g1 4000bbe0: 82 10 61 b8 or %g1, 0x1b8, %g1 ! 4001c1b8 4000bbe4: fa 00 60 44 ld [ %g1 + 0x44 ], %i5 rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); 4000bbe8: f6 00 60 40 ld [ %g1 + 0x40 ], %i3 void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { Thread_Control *executing = _Thread_Executing; 4000bbec: 03 10 00 7b sethi %hi(0x4001ec00), %g1 const User_extensions_Table *callouts_current = rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); 4000bbf0: b7 2e e0 05 sll %i3, 5, %i3 ) { Thread_Control *executing = _Thread_Executing; const User_extensions_Table *callouts_current = rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = 4000bbf4: b6 07 40 1b add %i5, %i3, %i3 callouts_current + rtems_configuration_get_number_of_initial_extensions(); const Chain_Node *node; const Chain_Node *tail; while ( callouts_current != callouts_end ) { 4000bbf8: 80 a7 40 1b cmp %i5, %i3 4000bbfc: 02 80 00 0a be 4000bc24 <_User_extensions_Iterate+0x4c> <== NEVER TAKEN 4000bc00: f8 00 62 20 ld [ %g1 + 0x220 ], %i4 (*visitor)( executing, arg, callouts_current ); 4000bc04: 94 10 00 1d mov %i5, %o2 4000bc08: 90 10 00 1c mov %i4, %o0 4000bc0c: 9f c6 40 00 call %i1 4000bc10: 92 10 00 18 mov %i0, %o1 ++callouts_current; 4000bc14: ba 07 60 20 add %i5, 0x20, %i5 const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); const Chain_Node *node; const Chain_Node *tail; while ( callouts_current != callouts_end ) { 4000bc18: 80 a6 c0 1d cmp %i3, %i5 4000bc1c: 12 bf ff fb bne 4000bc08 <_User_extensions_Iterate+0x30> 4000bc20: 94 10 00 1d mov %i5, %o2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 4000bc24: 37 10 00 78 sethi %hi(0x4001e000), %i3 4000bc28: fa 06 e0 64 ld [ %i3 + 0x64 ], %i5 ! 4001e064 <_User_extensions_List> 4000bc2c: b6 16 e0 64 or %i3, 0x64, %i3 ++callouts_current; } node = _Chain_Immutable_first( &_User_extensions_List ); tail = _Chain_Immutable_tail( &_User_extensions_List ); while ( node != tail ) { 4000bc30: b6 06 e0 04 add %i3, 4, %i3 4000bc34: 80 a7 40 1b cmp %i5, %i3 4000bc38: 02 80 00 09 be 4000bc5c <_User_extensions_Iterate+0x84> 4000bc3c: 94 07 60 14 add %i5, 0x14, %o2 const User_extensions_Control *extension = (const User_extensions_Control *) node; (*visitor)( executing, arg, &extension->Callouts ); 4000bc40: 90 10 00 1c mov %i4, %o0 4000bc44: 9f c6 40 00 call %i1 4000bc48: 92 10 00 18 mov %i0, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 4000bc4c: fa 07 40 00 ld [ %i5 ], %i5 ++callouts_current; } node = _Chain_Immutable_first( &_User_extensions_List ); tail = _Chain_Immutable_tail( &_User_extensions_List ); while ( node != tail ) { 4000bc50: 80 a7 40 1b cmp %i5, %i3 4000bc54: 12 bf ff fb bne 4000bc40 <_User_extensions_Iterate+0x68> 4000bc58: 94 07 60 14 add %i5, 0x14, %o2 4000bc5c: 81 c7 e0 08 ret 4000bc60: 81 e8 00 00 restore =============================================================================== 4000d6a0 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 4000d6a0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 4000d6a4: 7f ff d6 d9 call 40003208 4000d6a8: 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; 4000d6ac: 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 ); 4000d6b0: b8 06 20 04 add %i0, 4, %i4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 4000d6b4: 80 a0 40 1c cmp %g1, %i4 4000d6b8: 02 80 00 1f be 4000d734 <_Watchdog_Adjust+0x94> 4000d6bc: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 4000d6c0: 12 80 00 1f bne 4000d73c <_Watchdog_Adjust+0x9c> 4000d6c4: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 4000d6c8: 80 a6 a0 00 cmp %i2, 0 4000d6cc: 02 80 00 1a be 4000d734 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000d6d0: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000d6d4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000d6d8: 80 a6 80 02 cmp %i2, %g2 4000d6dc: 1a 80 00 0a bcc 4000d704 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 4000d6e0: b6 10 20 01 mov 1, %i3 _Watchdog_First( header )->delta_interval -= units; 4000d6e4: 10 80 00 1d b 4000d758 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 4000d6e8: 84 20 80 1a sub %g2, %i2, %g2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 4000d6ec: 02 80 00 12 be 4000d734 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000d6f0: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000d6f4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000d6f8: 80 a0 80 1a cmp %g2, %i2 4000d6fc: 38 80 00 17 bgu,a 4000d758 <_Watchdog_Adjust+0xb8> 4000d700: 84 20 80 1a sub %g2, %i2, %g2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 4000d704: f6 20 60 10 st %i3, [ %g1 + 0x10 ] while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; 4000d708: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 4000d70c: 7f ff d6 c3 call 40003218 4000d710: 01 00 00 00 nop _Watchdog_Tickle( header ); 4000d714: 40 00 00 a8 call 4000d9b4 <_Watchdog_Tickle> 4000d718: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 4000d71c: 7f ff d6 bb call 40003208 4000d720: 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; 4000d724: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 4000d728: 80 a7 00 01 cmp %i4, %g1 4000d72c: 12 bf ff f0 bne 4000d6ec <_Watchdog_Adjust+0x4c> 4000d730: 80 a6 a0 00 cmp %i2, 0 } break; } } _ISR_Enable( level ); 4000d734: 7f ff d6 b9 call 40003218 4000d738: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 4000d73c: 12 bf ff fe bne 4000d734 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000d740: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 4000d744: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000d748: b4 00 80 1a add %g2, %i2, %i2 4000d74c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 4000d750: 7f ff d6 b2 call 40003218 4000d754: 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; 4000d758: 10 bf ff f7 b 4000d734 <_Watchdog_Adjust+0x94> 4000d75c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] =============================================================================== 4001d2b4 <_Watchdog_Adjust_to_chain>: Chain_Control *header, Watchdog_Interval units_arg, Chain_Control *to_fire ) { 4001d2b4: 9d e3 bf a0 save %sp, -96, %sp Watchdog_Interval units = units_arg; ISR_Level level; Watchdog_Control *first; _ISR_Disable( level ); 4001d2b8: 7f ff c8 c1 call 4000f5bc 4001d2bc: 01 00 00 00 nop 4001d2c0: c2 06 00 00 ld [ %i0 ], %g1 4001d2c4: ba 06 20 04 add %i0, 4, %i5 4001d2c8: b8 06 a0 04 add %i2, 4, %i4 while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 4001d2cc: 80 a7 40 01 cmp %i5, %g1 4001d2d0: 02 80 00 20 be 4001d350 <_Watchdog_Adjust_to_chain+0x9c> 4001d2d4: 01 00 00 00 nop /* * If it is longer than "units" until the first element on the chain * fires, then bump it and quit. */ if ( units < first->delta_interval ) { 4001d2d8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4001d2dc: 80 a6 40 02 cmp %i1, %g2 4001d2e0: 2a 80 00 1e bcs,a 4001d358 <_Watchdog_Adjust_to_chain+0xa4> 4001d2e4: 84 20 80 19 sub %g2, %i1, %g2 /* * The first set happens in less than units, so take all of them * off the chain and adjust units to reflect this. */ units -= first->delta_interval; 4001d2e8: b2 26 40 02 sub %i1, %g2, %i1 first->delta_interval = 0; 4001d2ec: c0 20 60 10 clr [ %g1 + 0x10 ] { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 4001d2f0: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 4001d2f4: c6 00 40 00 ld [ %g1 ], %g3 previous = the_node->previous; next->previous = previous; 4001d2f8: c4 20 e0 04 st %g2, [ %g3 + 4 ] previous->next = next; 4001d2fc: c6 20 80 00 st %g3, [ %g2 ] Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 4001d300: c4 06 a0 08 ld [ %i2 + 8 ], %g2 the_node->next = tail; 4001d304: f8 20 40 00 st %i4, [ %g1 ] tail->previous = the_node; 4001d308: c2 26 a0 08 st %g1, [ %i2 + 8 ] old_last->next = the_node; 4001d30c: c2 20 80 00 st %g1, [ %g2 ] the_node->previous = old_last; 4001d310: c4 20 60 04 st %g2, [ %g1 + 4 ] while ( 1 ) { _Chain_Extract_unprotected( &first->Node ); _Chain_Append_unprotected( to_fire, &first->Node ); _ISR_Flash( level ); 4001d314: 7f ff c8 ae call 4000f5cc 4001d318: 01 00 00 00 nop 4001d31c: 7f ff c8 a8 call 4000f5bc 4001d320: 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; 4001d324: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 4001d328: 80 a7 40 01 cmp %i5, %g1 4001d32c: 02 bf ff e9 be 4001d2d0 <_Watchdog_Adjust_to_chain+0x1c> 4001d330: 01 00 00 00 nop break; first = _Watchdog_First( header ); if ( first->delta_interval != 0 ) 4001d334: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4001d338: 80 a0 a0 00 cmp %g2, 0 4001d33c: 22 bf ff ee be,a 4001d2f4 <_Watchdog_Adjust_to_chain+0x40> 4001d340: c4 00 60 04 ld [ %g1 + 4 ], %g2 Watchdog_Control *first; _ISR_Disable( level ); while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 4001d344: 80 a7 40 01 cmp %i5, %g1 4001d348: 12 bf ff e6 bne 4001d2e0 <_Watchdog_Adjust_to_chain+0x2c> <== ALWAYS TAKEN 4001d34c: 80 a6 40 02 cmp %i1, %g2 if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 4001d350: 7f ff c8 9f call 4000f5cc 4001d354: 91 e8 00 08 restore %g0, %o0, %o0 /* * If it is longer than "units" until the first element on the chain * fires, then bump it and quit. */ if ( units < first->delta_interval ) { first->delta_interval -= units; 4001d358: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 4001d35c: 7f ff c8 9c call 4000f5cc 4001d360: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 4000be64 <_Watchdog_Remove>: #include Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 4000be64: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 4000be68: 7f ff d9 9a call 400024d0 4000be6c: 01 00 00 00 nop previous_state = the_watchdog->state; 4000be70: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 4000be74: 80 a7 60 01 cmp %i5, 1 4000be78: 02 80 00 2a be 4000bf20 <_Watchdog_Remove+0xbc> 4000be7c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000be80: 1a 80 00 09 bcc 4000bea4 <_Watchdog_Remove+0x40> 4000be84: 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; 4000be88: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000be8c: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 4001ecf8 <_Watchdog_Ticks_since_boot> 4000be90: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000be94: 7f ff d9 93 call 400024e0 4000be98: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 4000be9c: 81 c7 e0 08 ret 4000bea0: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 4000bea4: 18 bf ff fa bgu 4000be8c <_Watchdog_Remove+0x28> <== NEVER TAKEN 4000bea8: 03 10 00 7b sethi %hi(0x4001ec00), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 4000beac: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 4000beb0: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 4000beb4: c4 00 40 00 ld [ %g1 ], %g2 4000beb8: 80 a0 a0 00 cmp %g2, 0 4000bebc: 02 80 00 07 be 4000bed8 <_Watchdog_Remove+0x74> 4000bec0: 05 10 00 7b sethi %hi(0x4001ec00), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 4000bec4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 4000bec8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 4000becc: 84 00 c0 02 add %g3, %g2, %g2 4000bed0: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 4000bed4: 05 10 00 7b sethi %hi(0x4001ec00), %g2 4000bed8: c4 00 a0 f4 ld [ %g2 + 0xf4 ], %g2 ! 4001ecf4 <_Watchdog_Sync_count> 4000bedc: 80 a0 a0 00 cmp %g2, 0 4000bee0: 22 80 00 07 be,a 4000befc <_Watchdog_Remove+0x98> 4000bee4: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 4000bee8: 05 10 00 7b sethi %hi(0x4001ec00), %g2 4000beec: c6 00 a2 18 ld [ %g2 + 0x218 ], %g3 ! 4001ee18 <_Per_CPU_Information+0x8> 4000bef0: 05 10 00 7b sethi %hi(0x4001ec00), %g2 4000bef4: c6 20 a0 94 st %g3, [ %g2 + 0x94 ] ! 4001ec94 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 4000bef8: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 4000befc: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 4000bf00: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 4000bf04: 03 10 00 7b sethi %hi(0x4001ec00), %g1 4000bf08: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 4001ecf8 <_Watchdog_Ticks_since_boot> 4000bf0c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000bf10: 7f ff d9 74 call 400024e0 4000bf14: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 4000bf18: 81 c7 e0 08 ret 4000bf1c: 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; 4000bf20: c2 00 60 f8 ld [ %g1 + 0xf8 ], %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; 4000bf24: 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; 4000bf28: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000bf2c: 7f ff d9 6d call 400024e0 4000bf30: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 4000bf34: 81 c7 e0 08 ret 4000bf38: 81 e8 00 00 restore =============================================================================== 4000d0ec <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 4000d0ec: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 4000d0f0: 7f ff d7 44 call 40002e00 4000d0f4: 01 00 00 00 nop 4000d0f8: b6 10 00 08 mov %o0, %i3 printk( "Watchdog Chain: %s %p\n", name, header ); 4000d0fc: 11 10 00 7b sethi %hi(0x4001ec00), %o0 4000d100: 94 10 00 19 mov %i1, %o2 4000d104: 92 10 00 18 mov %i0, %o1 4000d108: 7f ff e2 2e call 400059c0 4000d10c: 90 12 21 d8 or %o0, 0x1d8, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 4000d110: fa 06 40 00 ld [ %i1 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 4000d114: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 4000d118: 80 a7 40 19 cmp %i5, %i1 4000d11c: 02 80 00 0f be 4000d158 <_Watchdog_Report_chain+0x6c> 4000d120: 11 10 00 7b sethi %hi(0x4001ec00), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 4000d124: 92 10 00 1d mov %i5, %o1 4000d128: 40 00 00 0f call 4000d164 <_Watchdog_Report> 4000d12c: 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 ) 4000d130: fa 07 40 00 ld [ %i5 ], %i5 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 4000d134: 80 a7 40 19 cmp %i5, %i1 4000d138: 12 bf ff fc bne 4000d128 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 4000d13c: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 4000d140: 11 10 00 7b sethi %hi(0x4001ec00), %o0 4000d144: 92 10 00 18 mov %i0, %o1 4000d148: 7f ff e2 1e call 400059c0 4000d14c: 90 12 21 f0 or %o0, 0x1f0, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 4000d150: 7f ff d7 30 call 40002e10 4000d154: 91 e8 00 1b restore %g0, %i3, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 4000d158: 7f ff e2 1a call 400059c0 4000d15c: 90 12 22 00 or %o0, 0x200, %o0 4000d160: 30 bf ff fc b,a 4000d150 <_Watchdog_Report_chain+0x64> =============================================================================== 4000bf3c <_Watchdog_Tickle>: #include void _Watchdog_Tickle( Chain_Control *header ) { 4000bf3c: 9d e3 bf a0 save %sp, -96, %sp * See the comment in watchdoginsert.c and watchdogadjust.c * about why it's safe not to declare header a pointer to * volatile data - till, 2003/7 */ _ISR_Disable( level ); 4000bf40: 7f ff d9 64 call 400024d0 4000bf44: 01 00 00 00 nop 4000bf48: b8 10 00 08 mov %o0, %i4 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 4000bf4c: fa 06 00 00 ld [ %i0 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 4000bf50: b4 06 20 04 add %i0, 4, %i2 if ( _Chain_Is_empty( header ) ) 4000bf54: 80 a7 40 1a cmp %i5, %i2 4000bf58: 02 80 00 09 be 4000bf7c <_Watchdog_Tickle+0x40> 4000bf5c: 01 00 00 00 nop * to be inserted has already had its delta_interval adjusted to 0, and * so is added to the head of the chain with a delta_interval of 0. * * Steven Johnson - 12/2005 (gcc-3.2.3 -O3 on powerpc) */ if (the_watchdog->delta_interval != 0) { 4000bf60: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 4000bf64: 80 a0 60 00 cmp %g1, 0 4000bf68: 02 80 00 15 be 4000bfbc <_Watchdog_Tickle+0x80> <== NEVER TAKEN 4000bf6c: 82 00 7f ff add %g1, -1, %g1 the_watchdog->delta_interval--; if ( the_watchdog->delta_interval != 0 ) 4000bf70: 80 a0 60 00 cmp %g1, 0 4000bf74: 02 80 00 12 be 4000bfbc <_Watchdog_Tickle+0x80> 4000bf78: c2 27 60 10 st %g1, [ %i5 + 0x10 ] the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && (the_watchdog->delta_interval == 0) ); leave: _ISR_Enable(level); 4000bf7c: 7f ff d9 59 call 400024e0 4000bf80: 91 e8 00 1c restore %g0, %i4, %o0 _ISR_Enable( level ); switch( watchdog_state ) { case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 4000bf84: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 4000bf88: 9f c0 40 00 call %g1 4000bf8c: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 case WATCHDOG_REMOVE_IT: break; } _ISR_Disable( level ); 4000bf90: 7f ff d9 50 call 400024d0 4000bf94: 01 00 00 00 nop 4000bf98: b8 10 00 08 mov %o0, %i4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 4000bf9c: fa 06 00 00 ld [ %i0 ], %i5 the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && (the_watchdog->delta_interval == 0) ); 4000bfa0: 80 a6 80 1d cmp %i2, %i5 4000bfa4: 02 bf ff f6 be 4000bf7c <_Watchdog_Tickle+0x40> 4000bfa8: 01 00 00 00 nop } _ISR_Disable( level ); the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && 4000bfac: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 4000bfb0: 80 a0 60 00 cmp %g1, 0 4000bfb4: 12 bf ff f2 bne 4000bf7c <_Watchdog_Tickle+0x40> 4000bfb8: 01 00 00 00 nop if ( the_watchdog->delta_interval != 0 ) goto leave; } do { watchdog_state = _Watchdog_Remove( the_watchdog ); 4000bfbc: 7f ff ff aa call 4000be64 <_Watchdog_Remove> 4000bfc0: 90 10 00 1d mov %i5, %o0 4000bfc4: b6 10 00 08 mov %o0, %i3 _ISR_Enable( level ); 4000bfc8: 7f ff d9 46 call 400024e0 4000bfcc: 90 10 00 1c mov %i4, %o0 switch( watchdog_state ) { 4000bfd0: 80 a6 e0 02 cmp %i3, 2 4000bfd4: 12 bf ff ef bne 4000bf90 <_Watchdog_Tickle+0x54> 4000bfd8: 01 00 00 00 nop case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 4000bfdc: 10 bf ff ea b 4000bf84 <_Watchdog_Tickle+0x48> 4000bfe0: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 =============================================================================== 4000bfe4 <_Workspace_Handler_initialization>: void _Workspace_Handler_initialization( Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { 4000bfe4: 9d e3 bf 98 save %sp, -104, %sp Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t remaining = rtems_configuration_get_work_space_size(); 4000bfe8: 05 10 00 70 sethi %hi(0x4001c000), %g2 4000bfec: 82 10 a1 b8 or %g2, 0x1b8, %g1 ! 4001c1b8 4000bff0: c6 08 60 32 ldub [ %g1 + 0x32 ], %g3 4000bff4: f6 00 a1 b8 ld [ %g2 + 0x1b8 ], %i3 4000bff8: 80 a0 e0 00 cmp %g3, 0 4000bffc: 12 80 00 03 bne 4000c008 <_Workspace_Handler_initialization+0x24> 4000c000: 84 10 20 00 clr %g2 4000c004: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000c008: b6 00 80 1b add %g2, %i3, %i3 bool do_zero = rtems_configuration_get_do_zero_of_workspace(); 4000c00c: c4 08 60 30 ldub [ %g1 + 0x30 ], %g2 bool unified = rtems_configuration_get_unified_work_area(); 4000c010: c2 08 60 31 ldub [ %g1 + 0x31 ], %g1 Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t remaining = rtems_configuration_get_work_space_size(); bool do_zero = rtems_configuration_get_do_zero_of_workspace(); 4000c014: c4 2f bf ff stb %g2, [ %fp + -1 ] bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 4000c018: 80 a6 60 00 cmp %i1, 0 4000c01c: 02 80 00 3c be 4000c10c <_Workspace_Handler_initialization+0x128><== NEVER TAKEN 4000c020: c2 2f bf fe stb %g1, [ %fp + -2 ] Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; 4000c024: 23 10 00 26 sethi %hi(0x40009800), %l1 } else { size = 0; } } space_available = (*init_or_extend)( 4000c028: 27 10 00 7b sethi %hi(0x4001ec00), %l3 bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 4000c02c: b8 10 20 00 clr %i4 Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; 4000c030: a2 14 60 28 or %l1, 0x28, %l1 4000c034: a0 08 a0 ff and %g2, 0xff, %l0 if ( area->size > overhead ) { uintptr_t space_available; uintptr_t size; if ( unified ) { 4000c038: a4 08 60 ff and %g1, 0xff, %l2 } else { size = 0; } } space_available = (*init_or_extend)( 4000c03c: 10 80 00 22 b 4000c0c4 <_Workspace_Handler_initialization+0xe0> 4000c040: a6 14 e0 20 or %l3, 0x20, %l3 if ( do_zero ) { memset( area->begin, 0, area->size ); } if ( area->size > overhead ) { 4000c044: 80 a7 60 16 cmp %i5, 0x16 4000c048: 28 80 00 1c bleu,a 4000c0b8 <_Workspace_Handler_initialization+0xd4> 4000c04c: b8 07 20 01 inc %i4 uintptr_t space_available; uintptr_t size; if ( unified ) { 4000c050: 80 a4 a0 00 cmp %l2, 0 4000c054: 32 80 00 0a bne,a 4000c07c <_Workspace_Handler_initialization+0x98> 4000c058: d2 06 00 00 ld [ %i0 ], %o1 size = area->size; } else { if ( remaining > 0 ) { 4000c05c: 80 a6 e0 00 cmp %i3, 0 4000c060: 22 80 00 22 be,a 4000c0e8 <_Workspace_Handler_initialization+0x104><== NEVER TAKEN 4000c064: d2 06 00 00 ld [ %i0 ], %o1 <== NOT EXECUTED size = remaining < area->size - overhead ? 4000c068: 82 07 7f ea add %i5, -22, %g1 remaining + overhead : area->size; 4000c06c: 80 a0 40 1b cmp %g1, %i3 4000c070: 38 80 00 02 bgu,a 4000c078 <_Workspace_Handler_initialization+0x94><== ALWAYS TAKEN 4000c074: ba 06 e0 16 add %i3, 0x16, %i5 } else { size = 0; } } space_available = (*init_or_extend)( 4000c078: d2 06 00 00 ld [ %i0 ], %o1 4000c07c: 94 10 00 1d mov %i5, %o2 4000c080: 90 10 00 13 mov %l3, %o0 4000c084: 9f c4 40 00 call %l1 4000c088: 96 10 20 08 mov 8, %o3 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 4000c08c: c2 06 00 00 ld [ %i0 ], %g1 area->size -= size; 4000c090: c4 06 20 04 ld [ %i0 + 4 ], %g2 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 4000c094: 82 00 40 1d add %g1, %i5, %g1 area->size -= size; 4000c098: ba 20 80 1d sub %g2, %i5, %i5 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 4000c09c: c2 26 00 00 st %g1, [ %i0 ] area->size -= size; if ( space_available < remaining ) { 4000c0a0: 80 a2 00 1b cmp %o0, %i3 4000c0a4: 1a 80 00 1f bcc 4000c120 <_Workspace_Handler_initialization+0x13c><== ALWAYS TAKEN 4000c0a8: fa 26 20 04 st %i5, [ %i0 + 4 ] remaining -= space_available; 4000c0ac: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED } else { remaining = 0; } init_or_extend = extend; 4000c0b0: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 4000c0b4: b8 07 20 01 inc %i4 4000c0b8: 80 a7 00 19 cmp %i4, %i1 4000c0bc: 02 80 00 14 be 4000c10c <_Workspace_Handler_initialization+0x128><== ALWAYS TAKEN 4000c0c0: b0 06 20 08 add %i0, 8, %i0 Heap_Area *area = &areas [i]; if ( do_zero ) { 4000c0c4: 80 a4 20 00 cmp %l0, 0 4000c0c8: 22 bf ff df be,a 4000c044 <_Workspace_Handler_initialization+0x60> 4000c0cc: fa 06 20 04 ld [ %i0 + 4 ], %i5 memset( area->begin, 0, area->size ); 4000c0d0: d0 06 00 00 ld [ %i0 ], %o0 4000c0d4: d4 06 20 04 ld [ %i0 + 4 ], %o2 4000c0d8: 40 00 10 fc call 400104c8 4000c0dc: 92 10 20 00 clr %o1 } if ( area->size > overhead ) { 4000c0e0: 10 bf ff d9 b 4000c044 <_Workspace_Handler_initialization+0x60> 4000c0e4: fa 06 20 04 ld [ %i0 + 4 ], %i5 } else { size = 0; } } space_available = (*init_or_extend)( 4000c0e8: 90 10 00 13 mov %l3, %o0 <== NOT EXECUTED 4000c0ec: 94 10 20 00 clr %o2 <== NOT EXECUTED 4000c0f0: 9f c4 40 00 call %l1 <== NOT EXECUTED 4000c0f4: 96 10 20 08 mov 8, %o3 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 4000c0f8: b8 07 20 01 inc %i4 <== NOT EXECUTED remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 4000c0fc: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 4000c100: 80 a7 00 19 cmp %i4, %i1 <== NOT EXECUTED 4000c104: 12 bf ff f0 bne 4000c0c4 <_Workspace_Handler_initialization+0xe0><== NOT EXECUTED 4000c108: b0 06 20 08 add %i0, 8, %i0 <== NOT EXECUTED init_or_extend = extend; } } if ( remaining > 0 ) { 4000c10c: 80 a6 e0 00 cmp %i3, 0 4000c110: 12 80 00 07 bne 4000c12c <_Workspace_Handler_initialization+0x148> 4000c114: 90 10 20 00 clr %o0 4000c118: 81 c7 e0 08 ret 4000c11c: 81 e8 00 00 restore remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 4000c120: a2 10 00 1a mov %i2, %l1 area->size -= size; if ( space_available < remaining ) { remaining -= space_available; } else { remaining = 0; 4000c124: 10 bf ff e4 b 4000c0b4 <_Workspace_Handler_initialization+0xd0> 4000c128: b6 10 20 00 clr %i3 init_or_extend = extend; } } if ( remaining > 0 ) { _Internal_error_Occurred( 4000c12c: 92 10 20 01 mov 1, %o1 4000c130: 7f ff f6 5b call 40009a9c <_Internal_error_Occurred> 4000c134: 94 10 20 02 mov 2, %o2 =============================================================================== 4000c120 <_Workspace_String_duplicate>: char *_Workspace_String_duplicate( const char *string, size_t len ) { 4000c120: 9d e3 bf a0 save %sp, -96, %sp char *dup = _Workspace_Allocate(len + 1); 4000c124: 7f ff ff e2 call 4000c0ac <_Workspace_Allocate> 4000c128: 90 06 60 01 add %i1, 1, %o0 if (dup != NULL) { 4000c12c: ba 92 20 00 orcc %o0, 0, %i5 4000c130: 02 80 00 05 be 4000c144 <_Workspace_String_duplicate+0x24><== NEVER TAKEN 4000c134: 92 10 00 18 mov %i0, %o1 dup [len] = '\0'; 4000c138: c0 2f 40 19 clrb [ %i5 + %i1 ] memcpy(dup, string, len); 4000c13c: 40 00 10 6a call 400102e4 4000c140: 94 10 00 19 mov %i1, %o2 } return dup; } 4000c144: 81 c7 e0 08 ret 4000c148: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 400092bc : rtems_rbtree_control *chunk_tree, rtems_rbheap_chunk *a, rtems_rbheap_chunk *b ) { if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) { 400092bc: 80 a2 ff f8 cmp %o3, -8 400092c0: 02 80 00 23 be 4000934c 400092c4: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 400092c8: c2 02 c0 00 ld [ %o3 ], %g1 400092cc: 80 a0 60 00 cmp %g1, 0 400092d0: 22 80 00 1c be,a 40009340 400092d4: c4 02 e0 04 ld [ %o3 + 4 ], %g2 if (b->begin < a->begin) { 400092d8: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 400092dc: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2 400092e0: 80 a0 c0 02 cmp %g3, %g2 400092e4: 3a 80 00 07 bcc,a 40009300 400092e8: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 400092ec: 84 10 00 0a mov %o2, %g2 400092f0: c2 02 80 00 ld [ %o2 ], %g1 400092f4: 94 10 00 0b mov %o3, %o2 400092f8: 96 10 00 02 mov %g2, %o3 a = b; b = t; } a->size += b->size; 400092fc: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 40009300: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 40009304: c4 02 e0 04 ld [ %o3 + 4 ], %g2 40009308: 86 01 00 03 add %g4, %g3, %g3 4000930c: c6 22 a0 1c st %g3, [ %o2 + 0x1c ] next->previous = previous; previous->next = next; 40009310: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 40009314: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 40009318: c2 02 00 00 ld [ %o0 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 4000931c: d0 22 e0 04 st %o0, [ %o3 + 4 ] before_node = after_node->next; after_node->next = the_node; 40009320: d6 22 00 00 st %o3, [ %o0 ] the_node->next = before_node; 40009324: c2 22 c0 00 st %g1, [ %o3 ] rtems_chain_extract_unprotected(&b->chain_node); add_to_chain(free_chain, b); _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); 40009328: 90 10 00 09 mov %o1, %o0 before_node->previous = the_node; 4000932c: d6 20 60 04 st %o3, [ %g1 + 4 ] 40009330: 92 02 e0 08 add %o3, 8, %o1 40009334: 82 13 c0 00 mov %o7, %g1 40009338: 40 00 07 0a call 4000af60 <_RBTree_Extract_unprotected> 4000933c: 9e 10 40 00 mov %g1, %o7 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 40009340: 80 a0 a0 00 cmp %g2, 0 40009344: 32 bf ff e6 bne,a 400092dc <== NEVER TAKEN 40009348: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED 4000934c: 81 c3 e0 08 retl =============================================================================== 40008f10 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 40008f10: 9d e3 bf 98 save %sp, -104, %sp */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 40008f14: 40 00 01 85 call 40009528 <_Chain_Get> 40008f18: 90 10 00 18 mov %i0, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 40008f1c: 92 10 20 00 clr %o1 40008f20: ba 10 00 08 mov %o0, %i5 40008f24: 94 10 00 1a mov %i2, %o2 40008f28: 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 40008f2c: 80 a7 60 00 cmp %i5, 0 40008f30: 12 80 00 0a bne 40008f58 40008f34: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 40008f38: 7f ff fc df call 400082b4 40008f3c: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 40008f40: 80 a2 20 00 cmp %o0, 0 40008f44: 02 bf ff f4 be 40008f14 <== NEVER TAKEN 40008f48: 01 00 00 00 nop timeout, &out ); } *node_ptr = node; 40008f4c: fa 26 c0 00 st %i5, [ %i3 ] return sc; } 40008f50: 81 c7 e0 08 ret 40008f54: 91 e8 00 08 restore %g0, %o0, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 40008f58: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 40008f5c: fa 26 c0 00 st %i5, [ %i3 ] return sc; } 40008f60: 81 c7 e0 08 ret 40008f64: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 40011fd0 : rtems_event_set event_in, rtems_option option_set, rtems_interval ticks, rtems_event_set *event_out ) { 40011fd0: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc; if ( event_out != NULL ) { 40011fd4: 80 a6 e0 00 cmp %i3, 0 40011fd8: 02 80 00 0a be 40012000 <== NEVER TAKEN 40011fdc: 82 10 20 09 mov 9, %g1 Thread_Control *executing = _Thread_Executing; 40011fe0: 03 10 00 6e sethi %hi(0x4001b800), %g1 40011fe4: fa 00 63 a0 ld [ %g1 + 0x3a0 ], %i5 ! 4001bba0 <_Per_CPU_Information+0x10> RTEMS_API_Control *api = executing->API_Extensions[ THREAD_API_RTEMS ]; Event_Control *event = &api->System_event; if ( !_Event_sets_Is_empty( event_in ) ) { 40011fe8: 80 a6 20 00 cmp %i0, 0 40011fec: 12 80 00 07 bne 40012008 <== ALWAYS TAKEN 40011ff0: da 07 61 4c ld [ %i5 + 0x14c ], %o5 ); _Thread_Enable_dispatch(); sc = executing->Wait.return_code; } else { *event_out = event->pending_events; 40011ff4: c4 03 60 04 ld [ %o5 + 4 ], %g2 <== NOT EXECUTED sc = RTEMS_SUCCESSFUL; 40011ff8: 82 10 20 00 clr %g1 <== NOT EXECUTED ); _Thread_Enable_dispatch(); sc = executing->Wait.return_code; } else { *event_out = event->pending_events; 40011ffc: c4 26 c0 00 st %g2, [ %i3 ] <== NOT EXECUTED } else { sc = RTEMS_INVALID_ADDRESS; } return sc; } 40012000: 81 c7 e0 08 ret <== NOT EXECUTED 40012004: 91 e8 00 01 restore %g0, %g1, %o0 <== NOT EXECUTED * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 40012008: 03 10 00 6e sethi %hi(0x4001b800), %g1 4001200c: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 4001b990 <_Thread_Dispatch_disable_level> ++level; 40012010: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 40012014: c4 20 61 90 st %g2, [ %g1 + 0x190 ] RTEMS_API_Control *api = executing->API_Extensions[ THREAD_API_RTEMS ]; Event_Control *event = &api->System_event; if ( !_Event_sets_Is_empty( event_in ) ) { _Thread_Disable_dispatch(); _Event_Seize( 40012018: 03 00 01 00 sethi %hi(0x40000), %g1 4001201c: 90 10 00 18 mov %i0, %o0 40012020: 92 10 00 19 mov %i1, %o1 40012024: 94 10 00 1a mov %i2, %o2 40012028: 96 10 00 1b mov %i3, %o3 4001202c: 98 10 00 1d mov %i5, %o4 40012030: 9a 03 60 04 add %o5, 4, %o5 40012034: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 40012038: 03 10 00 6e sethi %hi(0x4001b800), %g1 4001203c: 82 10 63 f0 or %g1, 0x3f0, %g1 ! 4001bbf0 <_System_event_Sync_state> 40012040: 7f ff dc ed call 400093f4 <_Event_Seize> 40012044: c2 23 a0 5c st %g1, [ %sp + 0x5c ] executing, event, &_System_event_Sync_state, STATES_WAITING_FOR_SYSTEM_EVENT ); _Thread_Enable_dispatch(); 40012048: 7f ff e9 59 call 4000c5ac <_Thread_Enable_dispatch> 4001204c: 01 00 00 00 nop sc = executing->Wait.return_code; 40012050: c2 07 60 34 ld [ %i5 + 0x34 ], %g1 } else { sc = RTEMS_INVALID_ADDRESS; } return sc; } 40012054: 81 c7 e0 08 ret 40012058: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 40008774 : rtems_status_code rtems_event_system_send( rtems_id id, rtems_event_set event_in ) { 40008774: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc; Thread_Control *thread; Objects_Locations location; RTEMS_API_Control *api; thread = _Thread_Get( id, &location ); 40008778: 90 10 00 18 mov %i0, %o0 4000877c: 40 00 0a 38 call 4000b05c <_Thread_Get> 40008780: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40008784: c2 07 bf fc ld [ %fp + -4 ], %g1 40008788: 80 a0 60 00 cmp %g1, 0 4000878c: 12 80 00 0d bne 400087c0 <== NEVER TAKEN 40008790: 92 10 00 19 mov %i1, %o1 case OBJECTS_LOCAL: api = thread->API_Extensions[ THREAD_API_RTEMS ]; _Event_Surrender( 40008794: d4 02 21 4c ld [ %o0 + 0x14c ], %o2 40008798: 94 02 a0 04 add %o2, 4, %o2 4000879c: 19 00 01 00 sethi %hi(0x40000), %o4 400087a0: 17 10 00 7b sethi %hi(0x4001ec00), %o3 400087a4: 96 12 e2 70 or %o3, 0x270, %o3 ! 4001ee70 <_System_event_Sync_state> 400087a8: 7f ff fe 54 call 400080f8 <_Event_Surrender> 400087ac: b0 10 20 00 clr %i0 event_in, &api->System_event, &_System_event_Sync_state, STATES_WAITING_FOR_SYSTEM_EVENT ); _Thread_Enable_dispatch(); 400087b0: 40 00 0a 1f call 4000b02c <_Thread_Enable_dispatch> 400087b4: 01 00 00 00 nop sc = RTEMS_SUCCESSFUL; break; 400087b8: 81 c7 e0 08 ret 400087bc: 81 e8 00 00 restore sc = RTEMS_INVALID_ID; break; } return sc; } 400087c0: 81 c7 e0 08 ret <== NOT EXECUTED 400087c4: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED =============================================================================== 4000a1fc : 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 ) { 4000a1fc: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 4000a200: 03 10 00 6e sethi %hi(0x4001b800), %g1 4000a204: c4 00 63 98 ld [ %g1 + 0x398 ], %g2 ! 4001bb98 <_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 ) { 4000a208: ba 10 00 18 mov %i0, %i5 rtems_device_major_number major_limit = _IO_Number_of_drivers; 4000a20c: 03 10 00 6f sethi %hi(0x4001bc00), %g1 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 ) { 4000a210: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 4000a214: c8 00 60 38 ld [ %g1 + 0x38 ], %g4 if ( rtems_interrupt_is_in_progress() ) 4000a218: 80 a0 a0 00 cmp %g2, 0 4000a21c: 12 80 00 1f bne 4000a298 4000a220: b0 10 20 12 mov 0x12, %i0 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 4000a224: 80 a6 a0 00 cmp %i2, 0 4000a228: 02 80 00 21 be 4000a2ac 4000a22c: 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 ) 4000a230: 02 80 00 1f be 4000a2ac 4000a234: c8 26 80 00 st %g4, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 4000a238: c4 06 40 00 ld [ %i1 ], %g2 4000a23c: 80 a0 a0 00 cmp %g2, 0 4000a240: 22 80 00 18 be,a 4000a2a0 4000a244: 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 ) 4000a248: 80 a1 00 1d cmp %g4, %i5 4000a24c: 08 80 00 13 bleu 4000a298 4000a250: b0 10 20 0a mov 0xa, %i0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 4000a254: 05 10 00 6e sethi %hi(0x4001b800), %g2 4000a258: c8 00 a1 90 ld [ %g2 + 0x190 ], %g4 ! 4001b990 <_Thread_Dispatch_disable_level> ++level; 4000a25c: 88 01 20 01 inc %g4 _Thread_Dispatch_disable_level = level; 4000a260: c8 20 a1 90 st %g4, [ %g2 + 0x190 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 4000a264: 80 a7 60 00 cmp %i5, 0 4000a268: 02 80 00 13 be 4000a2b4 4000a26c: 39 10 00 6f sethi %hi(0x4001bc00), %i4 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 4000a270: c8 07 20 3c ld [ %i4 + 0x3c ], %g4 ! 4001bc3c <_IO_Driver_address_table> 4000a274: 85 2f 60 03 sll %i5, 3, %g2 4000a278: b7 2f 60 05 sll %i5, 5, %i3 4000a27c: 82 26 c0 02 sub %i3, %g2, %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 4000a280: f2 01 00 01 ld [ %g4 + %g1 ], %i1 4000a284: 80 a6 60 00 cmp %i1, 0 4000a288: 02 80 00 3a be 4000a370 4000a28c: 82 01 00 01 add %g4, %g1, %g1 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(); 4000a290: 40 00 08 c7 call 4000c5ac <_Thread_Enable_dispatch> 4000a294: b0 10 20 0c mov 0xc, %i0 return RTEMS_RESOURCE_IN_USE; 4000a298: 81 c7 e0 08 ret 4000a29c: 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; 4000a2a0: 80 a0 a0 00 cmp %g2, 0 4000a2a4: 12 bf ff ea bne 4000a24c 4000a2a8: 80 a1 00 1d cmp %g4, %i5 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 4000a2ac: 81 c7 e0 08 ret 4000a2b0: 91 e8 20 09 restore %g0, 9, %o0 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 4000a2b4: c8 00 60 38 ld [ %g1 + 0x38 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 4000a2b8: 80 a1 20 00 cmp %g4, 0 4000a2bc: 02 80 00 33 be 4000a388 <== NEVER TAKEN 4000a2c0: c2 07 20 3c ld [ %i4 + 0x3c ], %g1 4000a2c4: 30 80 00 04 b,a 4000a2d4 4000a2c8: 80 a7 40 04 cmp %i5, %g4 4000a2cc: 02 80 00 24 be 4000a35c 4000a2d0: 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; 4000a2d4: c4 00 40 00 ld [ %g1 ], %g2 4000a2d8: 80 a0 a0 00 cmp %g2, 0 4000a2dc: 32 bf ff fb bne,a 4000a2c8 4000a2e0: ba 07 60 01 inc %i5 4000a2e4: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000a2e8: 80 a0 a0 00 cmp %g2, 0 4000a2ec: 32 bf ff f7 bne,a 4000a2c8 4000a2f0: ba 07 60 01 inc %i5 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 4000a2f4: fa 26 80 00 st %i5, [ %i2 ] 4000a2f8: 85 2f 60 03 sll %i5, 3, %g2 if ( m != n ) 4000a2fc: 80 a1 00 1d cmp %g4, %i5 4000a300: 02 80 00 18 be 4000a360 <== NEVER TAKEN 4000a304: b7 2f 60 05 sll %i5, 5, %i3 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 4000a308: c8 00 c0 00 ld [ %g3 ], %g4 4000a30c: c2 07 20 3c ld [ %i4 + 0x3c ], %g1 4000a310: 84 26 c0 02 sub %i3, %g2, %g2 4000a314: c8 20 40 02 st %g4, [ %g1 + %g2 ] 4000a318: c8 00 e0 04 ld [ %g3 + 4 ], %g4 4000a31c: 82 00 40 02 add %g1, %g2, %g1 4000a320: c8 20 60 04 st %g4, [ %g1 + 4 ] 4000a324: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 4000a328: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 4000a32c: c4 20 60 08 st %g2, [ %g1 + 8 ] 4000a330: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 4000a334: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 4000a338: c4 20 60 0c st %g2, [ %g1 + 0xc ] 4000a33c: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 4000a340: b0 10 00 1d mov %i5, %i0 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 4000a344: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 4000a348: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 4000a34c: 40 00 08 98 call 4000c5ac <_Thread_Enable_dispatch> 4000a350: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 4000a354: 40 00 20 4d call 40012488 4000a358: 81 e8 00 00 restore if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 4000a35c: fa 26 80 00 st %i5, [ %i2 ] if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 4000a360: 40 00 08 93 call 4000c5ac <_Thread_Enable_dispatch> 4000a364: b0 10 20 05 mov 5, %i0 return sc; 4000a368: 81 c7 e0 08 ret 4000a36c: 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; 4000a370: c2 00 60 04 ld [ %g1 + 4 ], %g1 4000a374: 80 a0 60 00 cmp %g1, 0 4000a378: 12 bf ff c6 bne 4000a290 4000a37c: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 4000a380: 10 bf ff e2 b 4000a308 4000a384: fa 26 80 00 st %i5, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 4000a388: 10 bf ff f6 b 4000a360 <== NOT EXECUTED 4000a38c: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 4000b2fc : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 4000b2fc: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 4000b300: 80 a6 20 00 cmp %i0, 0 4000b304: 02 80 00 23 be 4000b390 <== NEVER TAKEN 4000b308: 37 10 00 85 sethi %hi(0x40021400), %i3 4000b30c: b6 16 e3 88 or %i3, 0x388, %i3 ! 40021788 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 4000b310: 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 ] ) 4000b314: c2 06 c0 00 ld [ %i3 ], %g1 4000b318: 80 a0 60 00 cmp %g1, 0 4000b31c: 22 80 00 1a be,a 4000b384 4000b320: b6 06 e0 04 add %i3, 4, %i3 continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 4000b324: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 4000b328: 80 a7 20 00 cmp %i4, 0 4000b32c: 22 80 00 16 be,a 4000b384 4000b330: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 4000b334: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 4000b338: 86 90 60 00 orcc %g1, 0, %g3 4000b33c: 22 80 00 12 be,a 4000b384 <== NEVER TAKEN 4000b340: b6 06 e0 04 add %i3, 4, %i3 <== NOT EXECUTED 4000b344: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 4000b348: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 4000b34c: 83 2f 60 02 sll %i5, 2, %g1 4000b350: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_thread ) 4000b354: 90 90 60 00 orcc %g1, 0, %o0 4000b358: 02 80 00 05 be 4000b36c <== NEVER TAKEN 4000b35c: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 4000b360: 9f c6 00 00 call %i0 4000b364: 01 00 00 00 nop 4000b368: c6 17 20 10 lduh [ %i4 + 0x10 ], %g3 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 4000b36c: 83 28 e0 10 sll %g3, 0x10, %g1 4000b370: 83 30 60 10 srl %g1, 0x10, %g1 4000b374: 80 a0 40 1d cmp %g1, %i5 4000b378: 3a bf ff f5 bcc,a 4000b34c 4000b37c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 4000b380: 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++ ) { 4000b384: 80 a6 c0 1a cmp %i3, %i2 4000b388: 32 bf ff e4 bne,a 4000b318 4000b38c: c2 06 c0 00 ld [ %i3 ], %g1 4000b390: 81 c7 e0 08 ret 4000b394: 81 e8 00 00 restore =============================================================================== 40009f54 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 40009f54: 9d e3 bf a0 save %sp, -96, %sp int i; /* * Validate parameters and look up information structure. */ if ( !info ) 40009f58: 80 a6 a0 00 cmp %i2, 0 40009f5c: 02 80 00 21 be 40009fe0 40009f60: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 40009f64: 93 2e 60 10 sll %i1, 0x10, %o1 40009f68: 90 10 00 18 mov %i0, %o0 40009f6c: 40 00 07 b0 call 4000be2c <_Objects_Get_information> 40009f70: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 40009f74: 80 a2 20 00 cmp %o0, 0 40009f78: 02 80 00 1a be 40009fe0 40009f7c: 82 10 20 0a mov 0xa, %g1 * Return information about this object class to the user. */ 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; 40009f80: 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; 40009f84: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; 40009f88: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; 40009f8c: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 40009f90: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; 40009f94: c4 26 a0 04 st %g2, [ %i2 + 4 ] info->auto_extend = obj_info->auto_extend; 40009f98: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 40009f9c: 80 a1 20 00 cmp %g4, 0 40009fa0: 02 80 00 12 be 40009fe8 <== NEVER TAKEN 40009fa4: c8 26 a0 08 st %g4, [ %i2 + 8 ] 40009fa8: fa 02 20 1c ld [ %o0 + 0x1c ], %i5 40009fac: 86 10 20 01 mov 1, %g3 40009fb0: 82 10 20 01 mov 1, %g1 40009fb4: 84 10 20 00 clr %g2 if ( !obj_info->local_table[i] ) 40009fb8: 87 28 e0 02 sll %g3, 2, %g3 40009fbc: c6 07 40 03 ld [ %i5 + %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++ ) 40009fc0: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 40009fc4: 80 a0 00 03 cmp %g0, %g3 40009fc8: 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++ ) 40009fcc: 80 a1 00 01 cmp %g4, %g1 40009fd0: 1a bf ff fa bcc 40009fb8 40009fd4: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 40009fd8: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 40009fdc: 82 10 20 00 clr %g1 } 40009fe0: 81 c7 e0 08 ret 40009fe4: 91 e8 00 01 restore %g0, %g1, %o0 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++ ) 40009fe8: 84 10 20 00 clr %g2 <== NOT EXECUTED if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; return RTEMS_SUCCESSFUL; 40009fec: 82 10 20 00 clr %g1 <== NOT EXECUTED for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 40009ff0: 10 bf ff fc b 40009fe0 <== NOT EXECUTED 40009ff4: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] <== NOT EXECUTED =============================================================================== 40015fb8 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 40015fb8: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 40015fbc: 80 a6 20 00 cmp %i0, 0 40015fc0: 12 80 00 04 bne 40015fd0 40015fc4: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 40015fc8: 81 c7 e0 08 ret 40015fcc: 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 ) 40015fd0: 80 a6 60 00 cmp %i1, 0 40015fd4: 02 bf ff fd be 40015fc8 40015fd8: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 40015fdc: 80 a7 60 00 cmp %i5, 0 40015fe0: 02 bf ff fa be 40015fc8 <== NEVER TAKEN 40015fe4: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 40015fe8: 02 bf ff f8 be 40015fc8 40015fec: 82 10 20 08 mov 8, %g1 40015ff0: 80 a6 a0 00 cmp %i2, 0 40015ff4: 02 bf ff f5 be 40015fc8 40015ff8: 80 a6 80 1b cmp %i2, %i3 40015ffc: 0a bf ff f3 bcs 40015fc8 40016000: 80 8e e0 07 btst 7, %i3 40016004: 12 bf ff f1 bne 40015fc8 40016008: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 4001600c: 12 bf ff ef bne 40015fc8 40016010: 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) { uint32_t level = _Thread_Dispatch_disable_level; 40016014: 03 10 00 f4 sethi %hi(0x4003d000), %g1 40016018: c4 00 60 00 ld [ %g1 ], %g2 ++level; 4001601c: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 40016020: c4 20 60 00 st %g2, [ %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 ); 40016024: 23 10 00 f3 sethi %hi(0x4003cc00), %l1 40016028: 40 00 13 de call 4001afa0 <_Objects_Allocate> 4001602c: 90 14 61 fc or %l1, 0x1fc, %o0 ! 4003cdfc <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 40016030: a0 92 20 00 orcc %o0, 0, %l0 40016034: 02 80 00 1a be 4001609c 40016038: 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; 4001603c: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 40016040: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 40016044: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 40016048: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 4001604c: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 40016050: 40 00 56 95 call 4002baa4 <.udiv> 40016054: 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, 40016058: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 4001605c: 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, 40016060: 96 10 00 1b mov %i3, %o3 40016064: b8 04 20 24 add %l0, 0x24, %i4 40016068: 40 00 0d 85 call 4001967c <_Chain_Initialize> 4001606c: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 40016070: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40016074: a2 14 61 fc or %l1, 0x1fc, %l1 40016078: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 4001607c: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40016080: 85 28 a0 02 sll %g2, 2, %g2 40016084: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 40016088: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 4001608c: 40 00 19 0d call 4001c4c0 <_Thread_Enable_dispatch> 40016090: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 40016094: 10 bf ff cd b 40015fc8 40016098: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 4001609c: 40 00 19 09 call 4001c4c0 <_Thread_Enable_dispatch> 400160a0: 01 00 00 00 nop return RTEMS_TOO_MANY; 400160a4: 10 bf ff c9 b 40015fc8 400160a8: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 400161dc : rtems_status_code rtems_partition_return_buffer( rtems_id id, void *buffer ) { 400161dc: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get ( Objects_Id id, Objects_Locations *location ) { return (Partition_Control *) 400161e0: 11 10 00 f3 sethi %hi(0x4003cc00), %o0 400161e4: 92 10 00 18 mov %i0, %o1 400161e8: 90 12 21 fc or %o0, 0x1fc, %o0 400161ec: 40 00 14 dd call 4001b560 <_Objects_Get> 400161f0: 94 07 bf fc add %fp, -4, %o2 register Partition_Control *the_partition; Objects_Locations location; the_partition = _Partition_Get( id, &location ); switch ( location ) { 400161f4: c2 07 bf fc ld [ %fp + -4 ], %g1 400161f8: 80 a0 60 00 cmp %g1, 0 400161fc: 12 80 00 19 bne 40016260 40016200: ba 10 00 08 mov %o0, %i5 ) { void *starting; void *ending; starting = the_partition->starting_address; 40016204: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 40016208: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 4001620c: 82 02 00 01 add %o0, %g1, %g1 ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 40016210: 80 a6 40 01 cmp %i1, %g1 40016214: 18 80 00 15 bgu 40016268 <== NEVER TAKEN 40016218: 80 a6 40 08 cmp %i1, %o0 4001621c: 0a 80 00 13 bcs 40016268 40016220: 01 00 00 00 nop offset = (uint32_t) _Addresses_Subtract( the_buffer, the_partition->starting_address ); return ((offset % the_partition->buffer_size) == 0); 40016224: d2 07 60 18 ld [ %i5 + 0x18 ], %o1 40016228: 40 00 56 cb call 4002bd54 <.urem> 4001622c: 90 26 40 08 sub %i1, %o0, %o0 starting = the_partition->starting_address; ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 40016230: 80 a2 20 00 cmp %o0, 0 40016234: 12 80 00 0d bne 40016268 40016238: 90 07 60 24 add %i5, 0x24, %o0 RTEMS_INLINE_ROUTINE void _Partition_Free_buffer ( Partition_Control *the_partition, Chain_Node *the_buffer ) { _Chain_Append( &the_partition->Memory, the_buffer ); 4001623c: 40 00 0c f5 call 40019610 <_Chain_Append> 40016240: 92 10 00 19 mov %i1, %o1 case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 40016244: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 40016248: b0 10 20 00 clr %i0 switch ( location ) { case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 4001624c: 82 00 7f ff add %g1, -1, %g1 _Thread_Enable_dispatch(); 40016250: 40 00 18 9c call 4001c4c0 <_Thread_Enable_dispatch> 40016254: c2 27 60 20 st %g1, [ %i5 + 0x20 ] 40016258: 81 c7 e0 08 ret 4001625c: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 40016260: 81 c7 e0 08 ret 40016264: 91 e8 20 04 restore %g0, 4, %o0 _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 40016268: 40 00 18 96 call 4001c4c0 <_Thread_Enable_dispatch> 4001626c: b0 10 20 09 mov 9, %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40016270: 81 c7 e0 08 ret 40016274: 81 e8 00 00 restore =============================================================================== 40037c8c : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 40037c8c: 9d e3 bf 98 save %sp, -104, %sp 40037c90: 11 10 01 a1 sethi %hi(0x40068400), %o0 40037c94: 92 10 00 18 mov %i0, %o1 40037c98: 90 12 21 88 or %o0, 0x188, %o0 40037c9c: 7f ff 47 99 call 40009b00 <_Objects_Get> 40037ca0: 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 ) { 40037ca4: c2 07 bf fc ld [ %fp + -4 ], %g1 40037ca8: 80 a0 60 00 cmp %g1, 0 40037cac: 12 80 00 0d bne 40037ce0 40037cb0: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 40037cb4: 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 ); 40037cb8: 39 10 01 a0 sethi %hi(0x40068000), %i4 40037cbc: b8 17 23 60 or %i4, 0x360, %i4 ! 40068360 <_Per_CPU_Information> 40037cc0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 40037cc4: 80 a0 80 01 cmp %g2, %g1 40037cc8: 02 80 00 08 be 40037ce8 40037ccc: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 40037cd0: 7f ff 4b 38 call 4000a9b0 <_Thread_Enable_dispatch> 40037cd4: b0 10 20 17 mov 0x17, %i0 40037cd8: 81 c7 e0 08 ret 40037cdc: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40037ce0: 81 c7 e0 08 ret 40037ce4: 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 ) { 40037ce8: 12 80 00 0e bne 40037d20 40037cec: 01 00 00 00 nop switch ( the_period->state ) { 40037cf0: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 40037cf4: 80 a0 60 04 cmp %g1, 4 40037cf8: 18 80 00 06 bgu 40037d10 <== NEVER TAKEN 40037cfc: b0 10 20 00 clr %i0 40037d00: 83 28 60 02 sll %g1, 2, %g1 40037d04: 05 10 01 87 sethi %hi(0x40061c00), %g2 40037d08: 84 10 a2 a8 or %g2, 0x2a8, %g2 ! 40061ea8 40037d0c: f0 00 80 01 ld [ %g2 + %g1 ], %i0 id, NULL ); _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 40037d10: 7f ff 4b 28 call 4000a9b0 <_Thread_Enable_dispatch> 40037d14: 01 00 00 00 nop 40037d18: 81 c7 e0 08 ret 40037d1c: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 40037d20: 7f ff 29 60 call 400022a0 40037d24: 01 00 00 00 nop 40037d28: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 40037d2c: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 40037d30: 80 a6 e0 00 cmp %i3, 0 40037d34: 02 80 00 1c be 40037da4 40037d38: 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 ) { 40037d3c: 02 80 00 2e be 40037df4 40037d40: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 40037d44: 12 bf ff e5 bne 40037cd8 <== NEVER TAKEN 40037d48: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 40037d4c: 7f ff ff 5e call 40037ac4 <_Rate_monotonic_Update_statistics> 40037d50: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 40037d54: 7f ff 29 57 call 400022b0 40037d58: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 40037d5c: 82 10 20 02 mov 2, %g1 40037d60: 92 07 60 10 add %i5, 0x10, %o1 40037d64: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 40037d68: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40037d6c: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037d70: 11 10 01 a0 sethi %hi(0x40068000), %o0 40037d74: 7f ff 4e 3e call 4000b66c <_Watchdog_Insert> 40037d78: 90 12 21 f8 or %o0, 0x1f8, %o0 ! 400681f8 <_Watchdog_Ticks_chain> 40037d7c: d0 07 60 40 ld [ %i5 + 0x40 ], %o0 40037d80: d2 07 60 3c ld [ %i5 + 0x3c ], %o1 40037d84: 03 10 01 8f sethi %hi(0x40063c00), %g1 40037d88: c2 00 61 74 ld [ %g1 + 0x174 ], %g1 ! 40063d74 <_Scheduler+0x34> 40037d8c: 9f c0 40 00 call %g1 40037d90: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Scheduler_Release_job(the_period->owner, the_period->next_length); _Thread_Enable_dispatch(); 40037d94: 7f ff 4b 07 call 4000a9b0 <_Thread_Enable_dispatch> 40037d98: 01 00 00 00 nop 40037d9c: 81 c7 e0 08 ret 40037da0: 81 e8 00 00 restore return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 40037da4: 7f ff 29 43 call 400022b0 40037da8: 01 00 00 00 nop the_period->next_length = length; /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 40037dac: 90 10 00 1d mov %i5, %o0 40037db0: 7f ff ff 94 call 40037c00 <_Rate_monotonic_Initiate_statistics> 40037db4: f2 27 60 3c st %i1, [ %i5 + 0x3c ] the_period->state = RATE_MONOTONIC_ACTIVE; 40037db8: 82 10 20 02 mov 2, %g1 40037dbc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40037dc0: 03 10 00 df sethi %hi(0x40037c00), %g1 40037dc4: 82 10 62 68 or %g1, 0x268, %g1 ! 40037e68 <_Rate_monotonic_Timeout> the_watchdog->id = id; 40037dc8: f0 27 60 30 st %i0, [ %i5 + 0x30 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037dcc: 92 07 60 10 add %i5, 0x10, %o1 40037dd0: 11 10 01 a0 sethi %hi(0x40068000), %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 40037dd4: c0 27 60 18 clr [ %i5 + 0x18 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037dd8: 90 12 21 f8 or %o0, 0x1f8, %o0 ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 40037ddc: c0 27 60 34 clr [ %i5 + 0x34 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40037de0: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40037de4: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40037de8: 7f ff 4e 21 call 4000b66c <_Watchdog_Insert> 40037dec: b0 10 20 00 clr %i0 40037df0: 30 bf ff c8 b,a 40037d10 if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 40037df4: 7f ff ff 34 call 40037ac4 <_Rate_monotonic_Update_statistics> 40037df8: 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; 40037dfc: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 40037e00: 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; 40037e04: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 40037e08: 7f ff 29 2a call 400022b0 40037e0c: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 40037e10: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 40037e14: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 40037e18: 90 10 00 01 mov %g1, %o0 40037e1c: 13 00 00 10 sethi %hi(0x4000), %o1 40037e20: 7f ff 4d 2a call 4000b2c8 <_Thread_Set_state> 40037e24: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 40037e28: 7f ff 29 1e call 400022a0 40037e2c: 01 00 00 00 nop local_state = the_period->state; 40037e30: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 40037e34: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 40037e38: 7f ff 29 1e call 400022b0 40037e3c: 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 ) 40037e40: 80 a6 a0 03 cmp %i2, 3 40037e44: 22 80 00 06 be,a 40037e5c 40037e48: d0 07 20 10 ld [ %i4 + 0x10 ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 40037e4c: 7f ff 4a d9 call 4000a9b0 <_Thread_Enable_dispatch> 40037e50: b0 10 20 00 clr %i0 40037e54: 81 c7 e0 08 ret 40037e58: 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 ); 40037e5c: 7f ff 49 e8 call 4000a5fc <_Thread_Clear_state> 40037e60: 13 00 00 10 sethi %hi(0x4000), %o1 40037e64: 30 bf ff fa b,a 40037e4c =============================================================================== 40029740 : void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 40029740: 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 ) 40029744: 80 a6 60 00 cmp %i1, 0 40029748: 02 80 00 48 be 40029868 <== NEVER TAKEN 4002974c: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 40029750: 13 10 01 7c sethi %hi(0x4005f000), %o1 40029754: 9f c6 40 00 call %i1 40029758: 92 12 61 80 or %o1, 0x180, %o1 ! 4005f180 <_TOD_Days_per_month+0x68> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 4002975c: 90 10 00 18 mov %i0, %o0 40029760: 13 10 01 7c sethi %hi(0x4005f000), %o1 40029764: 9f c6 40 00 call %i1 40029768: 92 12 61 a0 or %o1, 0x1a0, %o1 ! 4005f1a0 <_TOD_Days_per_month+0x88> (*print)( context, "--- Wall times are in seconds ---\n" ); 4002976c: 90 10 00 18 mov %i0, %o0 40029770: 13 10 01 7c sethi %hi(0x4005f000), %o1 40029774: 9f c6 40 00 call %i1 40029778: 92 12 61 c8 or %o1, 0x1c8, %o1 ! 4005f1c8 <_TOD_Days_per_month+0xb0> Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 4002977c: 90 10 00 18 mov %i0, %o0 40029780: 13 10 01 7c sethi %hi(0x4005f000), %o1 40029784: 9f c6 40 00 call %i1 40029788: 92 12 61 f0 or %o1, 0x1f0, %o1 ! 4005f1f0 <_TOD_Days_per_month+0xd8> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 4002978c: 90 10 00 18 mov %i0, %o0 40029790: 13 10 01 7c sethi %hi(0x4005f000), %o1 40029794: 9f c6 40 00 call %i1 40029798: 92 12 62 40 or %o1, 0x240, %o1 ! 4005f240 <_TOD_Days_per_month+0x128> /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 4002979c: 39 10 01 a1 sethi %hi(0x40068400), %i4 400297a0: b8 17 21 88 or %i4, 0x188, %i4 ! 40068588 <_Rate_monotonic_Information> 400297a4: fa 07 20 08 ld [ %i4 + 8 ], %i5 400297a8: c2 07 20 0c ld [ %i4 + 0xc ], %g1 400297ac: 80 a7 40 01 cmp %i5, %g1 400297b0: 18 80 00 2e bgu 40029868 <== NEVER TAKEN 400297b4: 35 10 01 7c sethi %hi(0x4005f000), %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, 400297b8: 27 10 01 7c sethi %hi(0x4005f000), %l3 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, 400297bc: 25 10 01 7c sethi %hi(0x4005f000), %l2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 400297c0: 37 10 01 81 sethi %hi(0x40060400), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 400297c4: b4 16 a2 90 or %i2, 0x290, %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, 400297c8: a6 14 e2 a8 or %l3, 0x2a8, %l3 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, 400297cc: a4 14 a2 c8 or %l2, 0x2c8, %l2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 400297d0: 10 80 00 06 b 400297e8 400297d4: b6 16 e3 58 or %i3, 0x358, %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++ ) { 400297d8: 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 ; 400297dc: 80 a0 40 1d cmp %g1, %i5 400297e0: 0a 80 00 22 bcs 40029868 400297e4: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 400297e8: 90 10 00 1d mov %i5, %o0 400297ec: 40 00 37 d2 call 40037734 400297f0: 92 07 bf c8 add %fp, -56, %o1 if ( status != RTEMS_SUCCESSFUL ) 400297f4: 80 a2 20 00 cmp %o0, 0 400297f8: 32 bf ff f8 bne,a 400297d8 400297fc: 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 ); 40029800: 92 07 bf b0 add %fp, -80, %o1 40029804: 40 00 38 3e call 400378fc 40029808: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 4002980c: d0 07 bf b0 ld [ %fp + -80 ], %o0 40029810: 94 07 bf a0 add %fp, -96, %o2 40029814: 7f ff 98 e2 call 4000fb9c 40029818: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 4002981c: d8 1f bf c8 ldd [ %fp + -56 ], %o4 40029820: 92 10 00 1a mov %i2, %o1 40029824: 94 10 00 1d mov %i5, %o2 40029828: 90 10 00 18 mov %i0, %o0 4002982c: 9f c6 40 00 call %i1 40029830: 96 07 bf a0 add %fp, -96, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 40029834: c2 07 bf c8 ld [ %fp + -56 ], %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 ); 40029838: 94 07 bf a8 add %fp, -88, %o2 4002983c: 90 07 bf e0 add %fp, -32, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 40029840: 80 a0 60 00 cmp %g1, 0 40029844: 12 80 00 0b bne 40029870 40029848: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 4002984c: 9f c6 40 00 call %i1 40029850: 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 ; 40029854: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 40029858: 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 ; 4002985c: 80 a0 40 1d cmp %g1, %i5 40029860: 1a bf ff e3 bcc 400297ec <== ALWAYS TAKEN 40029864: 90 10 00 1d mov %i5, %o0 40029868: 81 c7 e0 08 ret 4002986c: 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 ); 40029870: 40 00 03 52 call 4002a5b8 <_Timespec_Divide_by_integer> 40029874: 92 10 00 01 mov %g1, %o1 (*print)( context, 40029878: d0 07 bf d4 ld [ %fp + -44 ], %o0 4002987c: 40 00 ae dd call 400553f0 <.div> 40029880: 92 10 23 e8 mov 0x3e8, %o1 40029884: aa 10 00 08 mov %o0, %l5 40029888: d0 07 bf dc ld [ %fp + -36 ], %o0 4002988c: 40 00 ae d9 call 400553f0 <.div> 40029890: 92 10 23 e8 mov 0x3e8, %o1 40029894: c2 07 bf a8 ld [ %fp + -88 ], %g1 40029898: a2 10 00 08 mov %o0, %l1 4002989c: d0 07 bf ac ld [ %fp + -84 ], %o0 400298a0: e0 07 bf d0 ld [ %fp + -48 ], %l0 400298a4: e8 07 bf d8 ld [ %fp + -40 ], %l4 400298a8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 400298ac: 40 00 ae d1 call 400553f0 <.div> 400298b0: 92 10 23 e8 mov 0x3e8, %o1 400298b4: 96 10 00 15 mov %l5, %o3 400298b8: 98 10 00 14 mov %l4, %o4 400298bc: 9a 10 00 11 mov %l1, %o5 400298c0: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 400298c4: 92 10 00 13 mov %l3, %o1 400298c8: 94 10 00 10 mov %l0, %o2 400298cc: 9f c6 40 00 call %i1 400298d0: 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); 400298d4: d2 07 bf c8 ld [ %fp + -56 ], %o1 400298d8: 94 07 bf a8 add %fp, -88, %o2 400298dc: 40 00 03 37 call 4002a5b8 <_Timespec_Divide_by_integer> 400298e0: 90 07 bf f8 add %fp, -8, %o0 (*print)( context, 400298e4: d0 07 bf ec ld [ %fp + -20 ], %o0 400298e8: 40 00 ae c2 call 400553f0 <.div> 400298ec: 92 10 23 e8 mov 0x3e8, %o1 400298f0: a8 10 00 08 mov %o0, %l4 400298f4: d0 07 bf f4 ld [ %fp + -12 ], %o0 400298f8: 40 00 ae be call 400553f0 <.div> 400298fc: 92 10 23 e8 mov 0x3e8, %o1 40029900: c2 07 bf a8 ld [ %fp + -88 ], %g1 40029904: a0 10 00 08 mov %o0, %l0 40029908: d0 07 bf ac ld [ %fp + -84 ], %o0 4002990c: ea 07 bf e8 ld [ %fp + -24 ], %l5 40029910: e2 07 bf f0 ld [ %fp + -16 ], %l1 40029914: 92 10 23 e8 mov 0x3e8, %o1 40029918: 40 00 ae b6 call 400553f0 <.div> 4002991c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 40029920: 92 10 00 12 mov %l2, %o1 40029924: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 40029928: 94 10 00 15 mov %l5, %o2 4002992c: 90 10 00 18 mov %i0, %o0 40029930: 96 10 00 14 mov %l4, %o3 40029934: 98 10 00 11 mov %l1, %o4 40029938: 9f c6 40 00 call %i1 4002993c: 9a 10 00 10 mov %l0, %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 ; 40029940: 10 bf ff a6 b 400297d8 40029944: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 40029960 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 40029960: 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) { uint32_t level = _Thread_Dispatch_disable_level; 40029964: 03 10 01 a0 sethi %hi(0x40068000), %g1 40029968: c4 00 61 60 ld [ %g1 + 0x160 ], %g2 ! 40068160 <_Thread_Dispatch_disable_level> ++level; 4002996c: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 40029970: c4 20 61 60 st %g2, [ %g1 + 0x160 ] /* * 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 ; 40029974: 39 10 01 a1 sethi %hi(0x40068400), %i4 40029978: b8 17 21 88 or %i4, 0x188, %i4 ! 40068588 <_Rate_monotonic_Information> 4002997c: fa 07 20 08 ld [ %i4 + 8 ], %i5 40029980: c2 07 20 0c ld [ %i4 + 0xc ], %g1 40029984: 80 a7 40 01 cmp %i5, %g1 40029988: 18 80 00 09 bgu 400299ac <== NEVER TAKEN 4002998c: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 40029990: 40 00 00 09 call 400299b4 40029994: 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 ; 40029998: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 4002999c: 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 ; 400299a0: 80 a0 40 1d cmp %g1, %i5 400299a4: 1a bf ff fb bcc 40029990 400299a8: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 400299ac: 7f ff 84 01 call 4000a9b0 <_Thread_Enable_dispatch> 400299b0: 81 e8 00 00 restore =============================================================================== 40009484 : return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { 40009484: 9d e3 bf a0 save %sp, -96, %sp void *ptr = NULL; rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; 40009488: fa 06 20 30 ld [ %i0 + 0x30 ], %i5 #include static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 4000948c: 90 10 00 19 mov %i1, %o0 40009490: 40 00 2b f7 call 4001446c <.urem> 40009494: 92 10 00 1d mov %i5, %o1 if (excess > 0) { 40009498: 80 a2 20 00 cmp %o0, 0 4000949c: 02 80 00 26 be 40009534 <== ALWAYS TAKEN 400094a0: b6 10 00 19 mov %i1, %i3 value += alignment - excess; 400094a4: ba 06 40 1d add %i1, %i5, %i5 <== NOT EXECUTED 400094a8: b6 27 40 08 sub %i5, %o0, %i3 <== NOT EXECUTED 400094ac: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED 400094b0: 82 60 3f ff subx %g0, -1, %g1 <== NOT EXECUTED rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { 400094b4: 80 88 60 ff btst 0xff, %g1 400094b8: 02 80 00 1d be 4000952c <== NEVER TAKEN 400094bc: 80 a6 60 00 cmp %i1, 0 400094c0: 02 80 00 1b be 4000952c 400094c4: 82 06 20 04 add %i0, 4, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 400094c8: fa 06 00 00 ld [ %i0 ], %i5 { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_chunk *big_enough = NULL; while (current != tail && big_enough == NULL) { 400094cc: 80 a7 40 01 cmp %i5, %g1 400094d0: 02 80 00 17 be 4000952c 400094d4: 01 00 00 00 nop rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current; if (free_chunk->size >= size) { 400094d8: f8 07 60 1c ld [ %i5 + 0x1c ], %i4 400094dc: 80 a6 c0 1c cmp %i3, %i4 400094e0: 38 80 00 10 bgu,a 40009520 400094e4: fa 07 40 00 ld [ %i5 ], %i5 uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { rtems_rbheap_chunk *free_chunk = search_free_chunk(free_chain, aligned_size); if (free_chunk != NULL) { 400094e8: 80 a7 60 00 cmp %i5, 0 400094ec: 02 80 00 10 be 4000952c <== NEVER TAKEN 400094f0: 80 a7 00 1b cmp %i4, %i3 uintptr_t free_size = free_chunk->size; if (free_size > aligned_size) { 400094f4: 18 80 00 12 bgu 4000953c 400094f8: 01 00 00 00 nop ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 400094fc: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 40009500: c2 07 60 04 ld [ %i5 + 4 ], %g1 ptr = (void *) new_chunk->begin; } } else { rtems_chain_extract_unprotected(&free_chunk->chain_node); rtems_chain_set_off_chain(&free_chunk->chain_node); ptr = (void *) free_chunk->begin; 40009504: f0 07 60 18 ld [ %i5 + 0x18 ], %i0 next->previous = previous; 40009508: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 4000950c: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain( Chain_Node *node ) { node->next = node->previous = NULL; 40009510: c0 27 60 04 clr [ %i5 + 4 ] 40009514: c0 27 40 00 clr [ %i5 ] } } } return ptr; } 40009518: 81 c7 e0 08 ret 4000951c: 81 e8 00 00 restore { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_chunk *big_enough = NULL; while (current != tail && big_enough == NULL) { 40009520: 80 a0 40 1d cmp %g1, %i5 40009524: 32 bf ff ee bne,a 400094dc <== NEVER TAKEN 40009528: f8 07 60 1c ld [ %i5 + 0x1c ], %i4 <== NOT EXECUTED return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { void *ptr = NULL; 4000952c: 81 c7 e0 08 ret 40009530: 91 e8 20 00 restore %g0, 0, %o0 static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; if (excess > 0) { 40009534: 10 bf ff e0 b 400094b4 40009538: 82 10 20 01 mov 1, %g1 if (free_chunk != NULL) { uintptr_t free_size = free_chunk->size; if (free_size > aligned_size) { rtems_rbheap_chunk *new_chunk = get_chunk(control); 4000953c: 7f ff ff 46 call 40009254 40009540: 90 10 00 18 mov %i0, %o0 if (new_chunk != NULL) { 40009544: b4 92 20 00 orcc %o0, 0, %i2 40009548: 02 bf ff f9 be 4000952c <== NEVER TAKEN 4000954c: b8 27 00 1b sub %i4, %i3, %i4 uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 40009550: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 rtems_rbheap_chunk *new_chunk = get_chunk(control); if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; 40009554: f8 27 60 1c st %i4, [ %i5 + 0x1c ] new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; 40009558: f6 26 a0 1c st %i3, [ %i2 + 0x1c ] if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 4000955c: b8 07 00 01 add %i4, %g1, %i4 40009560: c0 26 a0 04 clr [ %i2 + 4 ] 40009564: f8 26 a0 18 st %i4, [ %i2 + 0x18 ] 40009568: c0 26 80 00 clr [ %i2 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_chunk *chunk ) { _RBTree_Insert_unprotected(tree, &chunk->tree_node); 4000956c: 90 06 20 18 add %i0, 0x18, %o0 40009570: 40 00 06 f4 call 4000b140 <_RBTree_Insert_unprotected> 40009574: 92 06 a0 08 add %i2, 8, %o1 free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; rtems_chain_set_off_chain(&new_chunk->chain_node); insert_into_tree(chunk_tree, new_chunk); ptr = (void *) new_chunk->begin; 40009578: f0 06 a0 18 ld [ %i2 + 0x18 ], %i0 4000957c: 81 c7 e0 08 ret 40009580: 81 e8 00 00 restore =============================================================================== 400096c8 : /* Do nothing */ } void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control) { 400096c8: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk)); 400096cc: 7f ff ec f2 call 40004a94 <== NOT EXECUTED 400096d0: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED if (chunk != NULL) { 400096d4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 400096d8: 02 80 00 07 be 400096f4 <== NOT EXECUTED 400096dc: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 400096e0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED after_node->next = the_node; 400096e4: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 400096e8: c4 22 20 04 st %g2, [ %o0 + 4 ] <== NOT EXECUTED before_node = after_node->next; after_node->next = the_node; the_node->next = before_node; 400096ec: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED before_node->previous = the_node; 400096f0: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED 400096f4: 81 c7 e0 08 ret <== NOT EXECUTED 400096f8: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 40009584 : _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); } } rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { 40009584: 9d e3 bf 80 save %sp, -128, %sp 40009588: b4 10 00 18 mov %i0, %i2 rtems_status_code sc = RTEMS_SUCCESSFUL; if (ptr != NULL) { 4000958c: 80 a6 60 00 cmp %i1, 0 40009590: 02 80 00 2a be 40009638 40009594: b0 10 20 00 clr %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 40009598: fa 06 a0 1c ld [ %i2 + 0x1c ], %i5 #define NULL_PAGE rtems_rbheap_chunk_of_node(NULL) static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key) { rtems_rbheap_chunk chunk = { .begin = key }; 4000959c: c0 27 bf fc clr [ %fp + -4 ] 400095a0: c0 27 bf e0 clr [ %fp + -32 ] 400095a4: c0 27 bf e4 clr [ %fp + -28 ] 400095a8: c0 27 bf e8 clr [ %fp + -24 ] 400095ac: c0 27 bf ec clr [ %fp + -20 ] 400095b0: c0 27 bf f0 clr [ %fp + -16 ] 400095b4: c0 27 bf f4 clr [ %fp + -12 ] 400095b8: f2 27 bf f8 st %i1, [ %fp + -8 ] RBTree_Node* found = NULL; int compare_result; while (iter_node) { 400095bc: 80 a7 60 00 cmp %i5, 0 400095c0: 02 80 00 3e be 400096b8 <== NEVER TAKEN 400095c4: b8 06 a0 18 add %i2, 0x18, %i4 400095c8: b6 10 20 00 clr %i3 compare_result = the_rbtree->compare_function(the_node, iter_node); 400095cc: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 400095d0: 92 10 00 1d mov %i5, %o1 400095d4: 9f c0 40 00 call %g1 400095d8: 90 07 bf e8 add %fp, -24, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 400095dc: 83 3a 20 1f sra %o0, 0x1f, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 400095e0: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 400095e4: 82 20 40 08 sub %g1, %o0, %g1 400095e8: 83 30 60 1f srl %g1, 0x1f, %g1 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 400095ec: 83 28 60 02 sll %g1, 2, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 400095f0: 12 80 00 06 bne 40009608 400095f4: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 400095f8: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 400095fc: 80 a0 a0 00 cmp %g2, 0 40009600: 12 80 00 10 bne 40009640 <== ALWAYS TAKEN 40009604: b6 10 00 1d mov %i5, %i3 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 40009608: fa 00 60 04 ld [ %g1 + 4 ], %i5 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 4000960c: 80 a7 60 00 cmp %i5, 0 40009610: 32 bf ff f0 bne,a 400095d0 40009614: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return rtems_rbheap_chunk_of_node( 40009618: ba 06 ff f8 add %i3, -8, %i5 if (ptr != NULL) { rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; rtems_rbheap_chunk *chunk = find(chunk_tree, (uintptr_t) ptr); if (chunk != NULL_PAGE) { 4000961c: 80 a7 7f f8 cmp %i5, -8 40009620: 02 80 00 06 be 40009638 40009624: b0 10 20 04 mov 4, %i0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 40009628: c2 06 ff f8 ld [ %i3 + -8 ], %g1 4000962c: 80 a0 60 00 cmp %g1, 0 40009630: 02 80 00 06 be 40009648 40009634: b0 10 20 0e mov 0xe, %i0 sc = RTEMS_INVALID_ID; } } return sc; } 40009638: 81 c7 e0 08 ret 4000963c: 81 e8 00 00 restore static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key) { rtems_rbheap_chunk chunk = { .begin = key }; return rtems_rbheap_chunk_of_node( 40009640: 10 bf ff f7 b 4000961c 40009644: ba 06 ff f8 add %i3, -8, %i5 40009648: c2 06 ff fc ld [ %i3 + -4 ], %g1 4000964c: 80 a0 60 00 cmp %g1, 0 40009650: 12 bf ff fa bne 40009638 <== NEVER TAKEN 40009654: 92 10 20 00 clr %o1 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 40009658: 40 00 07 89 call 4000b47c <_RBTree_Next_unprotected> 4000965c: 90 10 00 1b mov %i3, %o0 40009660: 92 10 20 01 mov 1, %o1 40009664: b2 10 00 08 mov %o0, %i1 40009668: 40 00 07 85 call 4000b47c <_RBTree_Next_unprotected> 4000966c: 90 10 00 1b mov %i3, %o0 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 40009670: 92 10 00 1c mov %i4, %o1 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 40009674: 96 02 3f f8 add %o0, -8, %o3 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 40009678: 94 10 00 1d mov %i5, %o2 4000967c: 7f ff ff 10 call 400092bc 40009680: 90 10 00 1a mov %i2, %o0 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 40009684: c2 06 80 00 ld [ %i2 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 40009688: f4 26 ff fc st %i2, [ %i3 + -4 ] before_node = after_node->next; after_node->next = the_node; 4000968c: fa 26 80 00 st %i5, [ %i2 ] the_node->next = before_node; 40009690: c2 26 ff f8 st %g1, [ %i3 + -8 ] before_node->previous = the_node; 40009694: fa 20 60 04 st %i5, [ %g1 + 4 ] add_to_chain(free_chain, chunk); check_and_merge(free_chain, chunk_tree, chunk, pred); 40009698: 90 10 00 1a mov %i2, %o0 4000969c: 92 10 00 1c mov %i4, %o1 400096a0: 94 10 00 1d mov %i5, %o2 400096a4: 96 06 7f f8 add %i1, -8, %o3 400096a8: 7f ff ff 05 call 400092bc 400096ac: b0 10 20 00 clr %i0 400096b0: 81 c7 e0 08 ret 400096b4: 81 e8 00 00 restore sc = RTEMS_INVALID_ID; } } return sc; } 400096b8: 81 c7 e0 08 ret <== NOT EXECUTED 400096bc: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED =============================================================================== 40009354 : uintptr_t area_size, uintptr_t alignment, rtems_rbheap_extend_descriptors extend_descriptors, void *handler_arg ) { 40009354: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; if (alignment > 0) { 40009358: 80 a6 e0 00 cmp %i3, 0 4000935c: 12 80 00 04 bne 4000936c 40009360: 82 10 20 0a mov 0xa, %g1 } else { sc = RTEMS_INVALID_NUMBER; } return sc; } 40009364: 81 c7 e0 08 ret 40009368: 91 e8 00 01 restore %g0, %g1, %o0 #include static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 4000936c: 90 10 00 19 mov %i1, %o0 40009370: 92 10 00 1b mov %i3, %o1 40009374: 40 00 2c 3e call 4001446c <.urem> 40009378: b4 06 40 1a add %i1, %i2, %i2 if (excess > 0) { 4000937c: 80 a2 20 00 cmp %o0, 0 40009380: 32 80 00 09 bne,a 400093a4 40009384: a0 06 40 1b add %i1, %i3, %l0 40009388: 82 10 20 01 mov 1, %g1 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 4000938c: 80 88 60 ff btst 0xff, %g1 40009390: 12 80 00 0b bne 400093bc <== ALWAYS TAKEN 40009394: a0 10 00 19 mov %i1, %l0 insert_into_tree(chunk_tree, first); } else { sc = RTEMS_NO_MEMORY; } } else { sc = RTEMS_INVALID_ADDRESS; 40009398: 82 10 20 09 mov 9, %g1 <== NOT EXECUTED } else { sc = RTEMS_INVALID_NUMBER; } return sc; } 4000939c: 81 c7 e0 08 ret 400093a0: 91 e8 00 01 restore %g0, %g1, %o0 static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; if (excess > 0) { value += alignment - excess; 400093a4: a0 24 00 08 sub %l0, %o0, %l0 400093a8: 80 a4 00 19 cmp %l0, %i1 400093ac: 82 60 3f ff subx %g0, -1, %g1 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 400093b0: 80 88 60 ff btst 0xff, %g1 400093b4: 02 bf ff fa be 4000939c 400093b8: 82 10 20 09 mov 9, %g1 400093bc: 80 a6 40 1a cmp %i1, %i2 400093c0: 1a bf ff f7 bcc 4000939c 400093c4: 82 10 20 09 mov 9, %g1 return value; } static uintptr_t align_down(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 400093c8: 90 10 00 1a mov %i2, %o0 400093cc: 40 00 2c 28 call 4001446c <.urem> 400093d0: 92 10 00 1b mov %i3, %o1 return value - excess; 400093d4: b4 26 80 08 sub %i2, %o0, %i2 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 400093d8: 80 a4 00 1a cmp %l0, %i2 400093dc: 1a bf ff e2 bcc 40009364 400093e0: 82 10 20 09 mov 9, %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 400093e4: 82 06 20 04 add %i0, 4, %g1 head->next = tail; 400093e8: c2 26 00 00 st %g1, [ %i0 ] 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 ); 400093ec: 82 06 20 0c add %i0, 0xc, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 400093f0: c2 26 20 14 st %g1, [ %i0 + 0x14 ] the_rbtree->permanent_null = NULL; the_rbtree->root = NULL; the_rbtree->first[0] = NULL; the_rbtree->first[1] = NULL; the_rbtree->compare_function = compare_function; the_rbtree->is_unique = is_unique; 400093f4: 82 10 20 01 mov 1, %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 400093f8: 84 06 20 10 add %i0, 0x10, %g2 400093fc: c2 2e 20 2c stb %g1, [ %i0 + 0x2c ] { the_rbtree->permanent_null = NULL; the_rbtree->root = NULL; the_rbtree->first[0] = NULL; the_rbtree->first[1] = NULL; the_rbtree->compare_function = compare_function; 40009400: 03 10 00 24 sethi %hi(0x40009000), %g1 40009404: 82 10 62 44 or %g1, 0x244, %g1 ! 40009244 head->next = tail; head->previous = NULL; 40009408: c0 26 20 04 clr [ %i0 + 4 ] 4000940c: c2 26 20 28 st %g1, [ %i0 + 0x28 ] tail->previous = head; 40009410: f0 26 20 08 st %i0, [ %i0 + 8 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 40009414: c0 26 20 10 clr [ %i0 + 0x10 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 40009418: c4 26 20 0c st %g2, [ %i0 + 0xc ] RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 4000941c: c0 26 20 18 clr [ %i0 + 0x18 ] the_rbtree->root = NULL; 40009420: c0 26 20 1c clr [ %i0 + 0x1c ] the_rbtree->first[0] = NULL; 40009424: c0 26 20 20 clr [ %i0 + 0x20 ] the_rbtree->first[1] = NULL; 40009428: c0 26 20 24 clr [ %i0 + 0x24 ] rtems_rbheap_chunk *first = NULL; rtems_chain_initialize_empty(free_chain); rtems_chain_initialize_empty(&control->spare_descriptor_chain); rtems_rbtree_initialize_empty(chunk_tree, chunk_compare, true); control->alignment = alignment; 4000942c: f6 26 20 30 st %i3, [ %i0 + 0x30 ] control->handler_arg = handler_arg; 40009430: fa 26 20 38 st %i5, [ %i0 + 0x38 ] control->extend_descriptors = extend_descriptors; 40009434: f8 26 20 34 st %i4, [ %i0 + 0x34 ] first = get_chunk(control); 40009438: 7f ff ff 87 call 40009254 4000943c: 90 10 00 18 mov %i0, %o0 first->begin = aligned_begin; first->size = aligned_end - aligned_begin; add_to_chain(free_chain, first); insert_into_tree(chunk_tree, first); } else { sc = RTEMS_NO_MEMORY; 40009440: 82 10 20 1a mov 0x1a, %g1 control->alignment = alignment; control->handler_arg = handler_arg; control->extend_descriptors = extend_descriptors; first = get_chunk(control); if (first != NULL) { 40009444: 80 a2 20 00 cmp %o0, 0 40009448: 02 bf ff c7 be 40009364 4000944c: 92 10 00 08 mov %o0, %o1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 40009450: c2 06 00 00 ld [ %i0 ], %g1 first->begin = aligned_begin; first->size = aligned_end - aligned_begin; 40009454: b4 26 80 10 sub %i2, %l0, %i2 control->handler_arg = handler_arg; control->extend_descriptors = extend_descriptors; first = get_chunk(control); if (first != NULL) { first->begin = aligned_begin; 40009458: e0 22 20 18 st %l0, [ %o0 + 0x18 ] first->size = aligned_end - aligned_begin; 4000945c: f4 22 20 1c st %i2, [ %o0 + 0x1c ] Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 40009460: f0 22 20 04 st %i0, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 40009464: d0 26 00 00 st %o0, [ %i0 ] the_node->next = before_node; 40009468: c2 22 00 00 st %g1, [ %o0 ] before_node->previous = the_node; 4000946c: d0 20 60 04 st %o0, [ %g1 + 4 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_chunk *chunk ) { _RBTree_Insert_unprotected(tree, &chunk->tree_node); 40009470: 92 02 60 08 add %o1, 8, %o1 40009474: 40 00 07 33 call 4000b140 <_RBTree_Insert_unprotected> 40009478: 90 06 20 18 add %i0, 0x18, %o0 uintptr_t alignment, rtems_rbheap_extend_descriptors extend_descriptors, void *handler_arg ) { rtems_status_code sc = RTEMS_SUCCESSFUL; 4000947c: 10 bf ff ba b 40009364 40009480: 82 10 20 00 clr %g1 =============================================================================== 40017790 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 40017790: 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 ) 40017794: 80 a6 60 00 cmp %i1, 0 40017798: 12 80 00 04 bne 400177a8 4001779c: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 400177a0: 81 c7 e0 08 ret 400177a4: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 400177a8: 90 10 00 18 mov %i0, %o0 400177ac: 40 00 13 51 call 4001c4f0 <_Thread_Get> 400177b0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 400177b4: c2 07 bf fc ld [ %fp + -4 ], %g1 400177b8: 80 a0 60 00 cmp %g1, 0 400177bc: 12 80 00 20 bne 4001783c 400177c0: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 400177c4: fa 02 21 4c ld [ %o0 + 0x14c ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 400177c8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 400177cc: 80 a0 60 00 cmp %g1, 0 400177d0: 02 80 00 1e be 40017848 400177d4: 01 00 00 00 nop if ( asr->is_enabled ) { 400177d8: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 400177dc: 80 a0 60 00 cmp %g1, 0 400177e0: 02 80 00 1e be 40017858 400177e4: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 400177e8: 7f ff df 75 call 4000f5bc 400177ec: 01 00 00 00 nop *signal_set |= signals; 400177f0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 400177f4: b2 10 40 19 or %g1, %i1, %i1 400177f8: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 400177fc: 7f ff df 74 call 4000f5cc 40017800: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 40017804: 03 10 00 f4 sethi %hi(0x4003d000), %g1 40017808: 82 10 62 10 or %g1, 0x210, %g1 ! 4003d210 <_Per_CPU_Information> 4001780c: c4 00 60 08 ld [ %g1 + 8 ], %g2 40017810: 80 a0 a0 00 cmp %g2, 0 40017814: 02 80 00 06 be 4001782c 40017818: 01 00 00 00 nop 4001781c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 40017820: 80 a7 00 02 cmp %i4, %g2 40017824: 02 80 00 15 be 40017878 <== ALWAYS TAKEN 40017828: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 4001782c: 40 00 13 25 call 4001c4c0 <_Thread_Enable_dispatch> 40017830: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 40017834: 10 bf ff db b 400177a0 40017838: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 4001783c: 82 10 20 04 mov 4, %g1 } 40017840: 81 c7 e0 08 ret 40017844: 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(); 40017848: 40 00 13 1e call 4001c4c0 <_Thread_Enable_dispatch> 4001784c: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 40017850: 10 bf ff d4 b 400177a0 40017854: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 40017858: 7f ff df 59 call 4000f5bc 4001785c: 01 00 00 00 nop *signal_set |= signals; 40017860: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 40017864: b2 10 40 19 or %g1, %i1, %i1 40017868: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 4001786c: 7f ff df 58 call 4000f5cc 40017870: 01 00 00 00 nop 40017874: 30 bf ff ee b,a 4001782c 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; 40017878: c4 28 60 0c stb %g2, [ %g1 + 0xc ] 4001787c: 30 bf ff ec b,a 4001782c =============================================================================== 4001205c : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 4001205c: 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 ) 40012060: 80 a6 a0 00 cmp %i2, 0 40012064: 02 80 00 3b be 40012150 40012068: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 4001206c: 21 10 00 6e sethi %hi(0x4001b800), %l0 40012070: a0 14 23 90 or %l0, 0x390, %l0 ! 4001bb90 <_Per_CPU_Information> 40012074: fa 04 20 10 ld [ %l0 + 0x10 ], %i5 api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 40012078: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4001207c: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 40012080: 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 ]; 40012084: f8 07 61 4c ld [ %i5 + 0x14c ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 40012088: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4001208c: 80 a0 60 00 cmp %g1, 0 40012090: 12 80 00 40 bne 40012190 40012094: 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; 40012098: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 4001209c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 400120a0: 7f ff ed f9 call 4000d884 <_CPU_ISR_Get_level> 400120a4: 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; 400120a8: a3 2c 60 0a sll %l1, 0xa, %l1 400120ac: 90 14 40 08 or %l1, %o0, %o0 old_mode |= _ISR_Get_level(); 400120b0: b6 12 00 1b or %o0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 400120b4: 80 8e 61 00 btst 0x100, %i1 400120b8: 02 80 00 06 be 400120d0 400120bc: 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; 400120c0: 83 36 20 08 srl %i0, 8, %g1 400120c4: 82 18 60 01 xor %g1, 1, %g1 400120c8: 82 08 60 01 and %g1, 1, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 400120cc: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 400120d0: 80 8e 62 00 btst 0x200, %i1 400120d4: 12 80 00 21 bne 40012158 400120d8: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 400120dc: 80 8e 60 0f btst 0xf, %i1 400120e0: 12 80 00 27 bne 4001217c 400120e4: 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 ) { 400120e8: 80 8e 64 00 btst 0x400, %i1 400120ec: 02 80 00 14 be 4001213c 400120f0: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 400120f4: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; 400120f8: b1 36 20 0a srl %i0, 0xa, %i0 400120fc: b0 1e 20 01 xor %i0, 1, %i0 40012100: b0 0e 20 01 and %i0, 1, %i0 if ( is_asr_enabled != asr->is_enabled ) { 40012104: 80 a6 00 01 cmp %i0, %g1 40012108: 22 80 00 0e be,a 40012140 4001210c: 03 10 00 6e sethi %hi(0x4001b800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 40012110: 7f ff c2 aa call 40002bb8 40012114: f0 2f 20 08 stb %i0, [ %i4 + 8 ] _signals = information->signals_pending; 40012118: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 4001211c: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 40012120: 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; 40012124: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 40012128: 7f ff c2 a8 call 40002bc8 4001212c: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 40012130: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 40012134: 80 a0 00 01 cmp %g0, %g1 40012138: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 4001213c: 03 10 00 6e sethi %hi(0x4001b800), %g1 40012140: c4 00 63 8c ld [ %g1 + 0x38c ], %g2 ! 4001bb8c <_System_state_Current> 40012144: 80 a0 a0 03 cmp %g2, 3 40012148: 02 80 00 1f be 400121c4 4001214c: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 40012150: 81 c7 e0 08 ret 40012154: 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) ) { 40012158: 22 bf ff e1 be,a 400120dc 4001215c: c0 27 60 78 clr [ %i5 + 0x78 ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 40012160: 03 10 00 6e sethi %hi(0x4001b800), %g1 40012164: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1 ! 4001b8f0 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 40012168: 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; 4001216c: c2 27 60 74 st %g1, [ %i5 + 0x74 ] 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; 40012170: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 40012174: 02 bf ff dd be 400120e8 40012178: c2 27 60 78 st %g1, [ %i5 + 0x78 ] */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 4001217c: 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 ) ); 40012180: 7f ff c2 92 call 40002bc8 40012184: 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 ) { 40012188: 10 bf ff d9 b 400120ec 4001218c: 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; 40012190: 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; 40012194: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 40012198: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 4001219c: 7f ff ed ba call 4000d884 <_CPU_ISR_Get_level> 400121a0: 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; 400121a4: a3 2c 60 0a sll %l1, 0xa, %l1 400121a8: 90 14 40 08 or %l1, %o0, %o0 old_mode |= _ISR_Get_level(); 400121ac: b6 12 00 1b or %o0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 400121b0: 80 8e 61 00 btst 0x100, %i1 400121b4: 02 bf ff c7 be 400120d0 400121b8: 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; 400121bc: 10 bf ff c2 b 400120c4 400121c0: 83 36 20 08 srl %i0, 8, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 400121c4: 80 88 e0 ff btst 0xff, %g3 400121c8: 12 80 00 0a bne 400121f0 400121cc: c4 04 20 10 ld [ %l0 + 0x10 ], %g2 400121d0: c6 04 20 14 ld [ %l0 + 0x14 ], %g3 400121d4: 80 a0 80 03 cmp %g2, %g3 400121d8: 02 bf ff de be 40012150 400121dc: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 400121e0: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 400121e4: 80 a0 a0 00 cmp %g2, 0 400121e8: 02 bf ff da be 40012150 <== NEVER TAKEN 400121ec: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 400121f0: 82 10 20 01 mov 1, %g1 ! 1 400121f4: c2 2c 20 0c stb %g1, [ %l0 + 0xc ] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 400121f8: 7f ff e8 8b call 4000c424 <_Thread_Dispatch> 400121fc: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 40012200: 82 10 20 00 clr %g1 ! 0 } 40012204: 81 c7 e0 08 ret 40012208: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 4000cf44 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 4000cf44: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 4000cf48: 80 a6 60 00 cmp %i1, 0 4000cf4c: 02 80 00 08 be 4000cf6c 4000cf50: 80 a6 a0 00 cmp %i2, 0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 4000cf54: 03 10 00 6a sethi %hi(0x4001a800), %g1 4000cf58: c4 08 63 1c ldub [ %g1 + 0x31c ], %g2 ! 4001ab1c */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 4000cf5c: 80 a6 40 02 cmp %i1, %g2 4000cf60: 18 80 00 1e bgu 4000cfd8 4000cf64: 82 10 20 13 mov 0x13, %g1 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 4000cf68: 80 a6 a0 00 cmp %i2, 0 4000cf6c: 02 80 00 1b be 4000cfd8 4000cf70: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 4000cf74: 90 10 00 18 mov %i0, %o0 4000cf78: 40 00 09 fb call 4000f764 <_Thread_Get> 4000cf7c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 4000cf80: c2 07 bf fc ld [ %fp + -4 ], %g1 4000cf84: 80 a0 60 00 cmp %g1, 0 4000cf88: 12 80 00 16 bne 4000cfe0 4000cf8c: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 4000cf90: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 4000cf94: 80 a6 60 00 cmp %i1, 0 4000cf98: 02 80 00 0d be 4000cfcc 4000cf9c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 4000cfa0: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 4000cfa4: 80 a0 60 00 cmp %g1, 0 4000cfa8: 02 80 00 06 be 4000cfc0 4000cfac: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 4000cfb0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 4000cfb4: 80 a6 40 01 cmp %i1, %g1 4000cfb8: 1a 80 00 05 bcc 4000cfcc <== ALWAYS TAKEN 4000cfbc: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 4000cfc0: 92 10 00 19 mov %i1, %o1 4000cfc4: 40 00 08 a2 call 4000f24c <_Thread_Change_priority> 4000cfc8: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 4000cfcc: 40 00 09 da call 4000f734 <_Thread_Enable_dispatch> 4000cfd0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 4000cfd4: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 4000cfd8: 81 c7 e0 08 ret 4000cfdc: 91 e8 00 01 restore %g0, %g1, %o0 4000cfe0: 81 c7 e0 08 ret 4000cfe4: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 4000716c : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 4000716c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 40007170: 80 a6 60 00 cmp %i1, 0 40007174: 02 80 00 1e be 400071ec 40007178: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 4000717c: 90 10 00 18 mov %i0, %o0 40007180: 40 00 08 92 call 400093c8 <_Thread_Get> 40007184: 92 07 bf fc add %fp, -4, %o1 switch (location) { 40007188: c2 07 bf fc ld [ %fp + -4 ], %g1 4000718c: 80 a0 60 00 cmp %g1, 0 40007190: 12 80 00 19 bne 400071f4 40007194: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 40007198: c2 02 21 58 ld [ %o0 + 0x158 ], %g1 while (tvp) { 4000719c: 80 a0 60 00 cmp %g1, 0 400071a0: 02 80 00 10 be 400071e0 400071a4: 01 00 00 00 nop if (tvp->ptr == ptr) { 400071a8: c4 00 60 04 ld [ %g1 + 4 ], %g2 400071ac: 80 a0 80 19 cmp %g2, %i1 400071b0: 32 80 00 09 bne,a 400071d4 400071b4: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 400071b8: 10 80 00 18 b 40007218 400071bc: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 400071c0: 80 a0 80 19 cmp %g2, %i1 400071c4: 22 80 00 0e be,a 400071fc 400071c8: c4 02 40 00 ld [ %o1 ], %g2 400071cc: 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; 400071d0: 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) { 400071d4: 80 a2 60 00 cmp %o1, 0 400071d8: 32 bf ff fa bne,a 400071c0 <== ALWAYS TAKEN 400071dc: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 400071e0: 40 00 08 6e call 40009398 <_Thread_Enable_dispatch> 400071e4: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 400071e8: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 400071ec: 81 c7 e0 08 ret 400071f0: 91 e8 00 01 restore %g0, %g1, %o0 400071f4: 81 c7 e0 08 ret 400071f8: 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; 400071fc: 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 ); 40007200: 40 00 00 2e call 400072b8 <_RTEMS_Tasks_Invoke_task_variable_dtor> 40007204: 01 00 00 00 nop _Thread_Enable_dispatch(); 40007208: 40 00 08 64 call 40009398 <_Thread_Enable_dispatch> 4000720c: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 40007210: 10 bf ff f7 b 400071ec 40007214: 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; 40007218: 92 10 00 01 mov %g1, %o1 4000721c: 10 bf ff f9 b 40007200 40007220: c4 22 21 58 st %g2, [ %o0 + 0x158 ] =============================================================================== 40007224 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 40007224: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 40007228: 80 a6 60 00 cmp %i1, 0 4000722c: 02 80 00 1b be 40007298 40007230: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !result ) 40007234: 80 a6 a0 00 cmp %i2, 0 40007238: 02 80 00 18 be 40007298 4000723c: 90 10 00 18 mov %i0, %o0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 40007240: 40 00 08 62 call 400093c8 <_Thread_Get> 40007244: 92 07 bf fc add %fp, -4, %o1 switch (location) { 40007248: c2 07 bf fc ld [ %fp + -4 ], %g1 4000724c: 80 a0 60 00 cmp %g1, 0 40007250: 12 80 00 14 bne 400072a0 40007254: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 40007258: c2 02 21 58 ld [ %o0 + 0x158 ], %g1 while (tvp) { 4000725c: 80 a0 60 00 cmp %g1, 0 40007260: 32 80 00 07 bne,a 4000727c 40007264: c4 00 60 04 ld [ %g1 + 4 ], %g2 40007268: 30 80 00 10 b,a 400072a8 4000726c: 80 a0 60 00 cmp %g1, 0 40007270: 02 80 00 0e be 400072a8 <== NEVER TAKEN 40007274: 01 00 00 00 nop if (tvp->ptr == ptr) { 40007278: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000727c: 80 a0 80 19 cmp %g2, %i1 40007280: 32 bf ff fb bne,a 4000726c 40007284: 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; 40007288: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); 4000728c: 40 00 08 43 call 40009398 <_Thread_Enable_dispatch> 40007290: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 40007294: 82 10 20 00 clr %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40007298: 81 c7 e0 08 ret 4000729c: 91 e8 00 01 restore %g0, %g1, %o0 400072a0: 81 c7 e0 08 ret 400072a4: 91 e8 00 01 restore %g0, %g1, %o0 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 400072a8: 40 00 08 3c call 40009398 <_Thread_Enable_dispatch> 400072ac: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 400072b0: 10 bf ff fa b 40007298 400072b4: 82 10 20 09 mov 9, %g1 ! 9 =============================================================================== 4001827c : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 4001827c: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 40018280: 11 10 00 f4 sethi %hi(0x4003d000), %o0 40018284: 92 10 00 18 mov %i0, %o1 40018288: 90 12 22 b8 or %o0, 0x2b8, %o0 4001828c: 40 00 0c b5 call 4001b560 <_Objects_Get> 40018290: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 40018294: c2 07 bf fc ld [ %fp + -4 ], %g1 40018298: 80 a0 60 00 cmp %g1, 0 4001829c: 12 80 00 0c bne 400182cc 400182a0: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 400182a4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 400182a8: 80 a0 60 04 cmp %g1, 4 400182ac: 02 80 00 04 be 400182bc <== NEVER TAKEN 400182b0: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 400182b4: 40 00 14 8b call 4001d4e0 <_Watchdog_Remove> 400182b8: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 400182bc: 40 00 10 81 call 4001c4c0 <_Thread_Enable_dispatch> 400182c0: b0 10 20 00 clr %i0 400182c4: 81 c7 e0 08 ret 400182c8: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 400182cc: 81 c7 e0 08 ret 400182d0: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 400187d4 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 400187d4: 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; 400187d8: 03 10 00 f4 sethi %hi(0x4003d000), %g1 400187dc: fa 00 62 f8 ld [ %g1 + 0x2f8 ], %i5 ! 4003d2f8 <_Timer_server> if ( !timer_server ) 400187e0: 80 a7 60 00 cmp %i5, 0 400187e4: 02 80 00 08 be 40018804 400187e8: 82 10 20 0e mov 0xe, %g1 return RTEMS_INCORRECT_STATE; if ( !_TOD.is_set ) 400187ec: 39 10 00 f3 sethi %hi(0x4003cc00), %i4 400187f0: 82 17 23 48 or %i4, 0x348, %g1 ! 4003cf48 <_TOD> 400187f4: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2 400187f8: 80 a0 a0 00 cmp %g2, 0 400187fc: 12 80 00 04 bne 4001880c <== ALWAYS TAKEN 40018800: 82 10 20 0b mov 0xb, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40018804: 81 c7 e0 08 ret 40018808: 91 e8 00 01 restore %g0, %g1, %o0 return RTEMS_INCORRECT_STATE; if ( !_TOD.is_set ) return RTEMS_NOT_DEFINED; if ( !routine ) 4001880c: 80 a6 a0 00 cmp %i2, 0 40018810: 02 bf ff fd be 40018804 40018814: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 40018818: 7f ff f3 1e call 40015490 <_TOD_Validate> 4001881c: 90 10 00 19 mov %i1, %o0 40018820: 80 8a 20 ff btst 0xff, %o0 40018824: 12 80 00 04 bne 40018834 40018828: 82 10 20 14 mov 0x14, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 4001882c: 81 c7 e0 08 ret 40018830: 91 e8 00 01 restore %g0, %g1, %o0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 40018834: 7f ff f2 dd call 400153a8 <_TOD_To_seconds> 40018838: 90 10 00 19 mov %i1, %o0 4001883c: b2 10 00 08 mov %o0, %i1 40018840: d0 1f 23 48 ldd [ %i4 + 0x348 ], %o0 40018844: 94 10 20 00 clr %o2 40018848: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 4001884c: 40 00 4e 20 call 4002c0cc <__divdi3> 40018850: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 if ( seconds <= _TOD_Seconds_since_epoch() ) 40018854: 80 a6 40 09 cmp %i1, %o1 40018858: 08 bf ff f5 bleu 4001882c 4001885c: 82 10 20 14 mov 0x14, %g1 40018860: 92 10 00 18 mov %i0, %o1 40018864: 11 10 00 f4 sethi %hi(0x4003d000), %o0 40018868: 94 07 bf fc add %fp, -4, %o2 4001886c: 40 00 0b 3d call 4001b560 <_Objects_Get> 40018870: 90 12 22 b8 or %o0, 0x2b8, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 40018874: c2 07 bf fc ld [ %fp + -4 ], %g1 40018878: 80 a0 60 00 cmp %g1, 0 4001887c: 12 80 00 19 bne 400188e0 40018880: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 40018884: 40 00 13 17 call 4001d4e0 <_Watchdog_Remove> 40018888: 90 02 20 10 add %o0, 0x10, %o0 4001888c: d0 1f 23 48 ldd [ %i4 + 0x348 ], %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 40018890: 82 10 20 03 mov 3, %g1 40018894: 94 10 20 00 clr %o2 40018898: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 4001889c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 400188a0: c0 24 20 18 clr [ %l0 + 0x18 ] 400188a4: 96 12 e2 00 or %o3, 0x200, %o3 the_watchdog->routine = routine; 400188a8: f4 24 20 2c st %i2, [ %l0 + 0x2c ] the_watchdog->id = id; 400188ac: f0 24 20 30 st %i0, [ %l0 + 0x30 ] 400188b0: 40 00 4e 07 call 4002c0cc <__divdi3> 400188b4: f6 24 20 34 st %i3, [ %l0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 400188b8: c2 07 60 04 ld [ %i5 + 4 ], %g1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 400188bc: b2 26 40 09 sub %i1, %o1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 400188c0: 90 10 00 1d mov %i5, %o0 400188c4: 92 10 00 10 mov %l0, %o1 400188c8: 9f c0 40 00 call %g1 400188cc: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 400188d0: 40 00 0e fc call 4001c4c0 <_Thread_Enable_dispatch> 400188d4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 400188d8: 10 bf ff cb b 40018804 400188dc: 82 10 20 00 clr %g1 ! 0 #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 400188e0: 10 bf ff c9 b 40018804 400188e4: 82 10 20 04 mov 4, %g1