=============================================================================== 02006f38 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2006f38: 9d e3 bf a0 save %sp, -96, %sp the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); } } 2006f3c: 23 00 80 58 sethi %hi(0x2016000), %l1 2006f40: e0 04 60 f4 ld [ %l1 + 0xf4 ], %l0 ! 20160f4 <_API_extensions_List> 2006f44: a2 14 60 f4 or %l1, 0xf4, %l1 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006f48: a2 04 60 04 add %l1, 4, %l1 2006f4c: 80 a4 00 11 cmp %l0, %l1 2006f50: 02 80 00 09 be 2006f74 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2006f54: 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)(); 2006f58: c2 04 20 08 ld [ %l0 + 8 ], %g1 2006f5c: 9f c0 40 00 call %g1 2006f60: 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 ) { 2006f64: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006f68: 80 a4 00 11 cmp %l0, %l1 2006f6c: 32 bf ff fc bne,a 2006f5c <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 2006f70: c2 04 20 08 ld [ %l0 + 8 ], %g1 <== NOT EXECUTED 2006f74: 81 c7 e0 08 ret 2006f78: 81 e8 00 00 restore =============================================================================== 02006f7c <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 2006f7c: 9d e3 bf a0 save %sp, -96, %sp the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); } } 2006f80: 23 00 80 58 sethi %hi(0x2016000), %l1 2006f84: e0 04 60 f4 ld [ %l1 + 0xf4 ], %l0 ! 20160f4 <_API_extensions_List> 2006f88: a2 14 60 f4 or %l1, 0xf4, %l1 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006f8c: a2 04 60 04 add %l1, 4, %l1 2006f90: 80 a4 00 11 cmp %l0, %l1 2006f94: 02 80 00 0a be 2006fbc <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 2006f98: 25 00 80 58 sethi %hi(0x2016000), %l2 2006f9c: a4 14 a1 2c or %l2, 0x12c, %l2 ! 201612c <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 2006fa0: c2 04 20 0c ld [ %l0 + 0xc ], %g1 2006fa4: 9f c0 40 00 call %g1 2006fa8: d0 04 a0 0c ld [ %l2 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 2006fac: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2006fb0: 80 a4 00 11 cmp %l0, %l1 2006fb4: 32 bf ff fc bne,a 2006fa4 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 2006fb8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 <== NOT EXECUTED 2006fbc: 81 c7 e0 08 ret 2006fc0: 81 e8 00 00 restore =============================================================================== 020175e8 <_CORE_message_queue_Broadcast>: Objects_Id id __attribute__((unused)), CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)), #endif uint32_t *count ) { 20175e8: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; uint32_t number_broadcasted; Thread_Wait_information *waitp; if ( size > the_message_queue->maximum_message_size ) { 20175ec: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 Objects_Id id __attribute__((unused)), CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)), #endif uint32_t *count ) { 20175f0: a0 10 00 18 mov %i0, %l0 Thread_Control *the_thread; uint32_t number_broadcasted; Thread_Wait_information *waitp; if ( size > the_message_queue->maximum_message_size ) { 20175f4: 80 a0 40 1a cmp %g1, %i2 20175f8: 0a 80 00 17 bcs 2017654 <_CORE_message_queue_Broadcast+0x6c><== NEVER TAKEN 20175fc: b0 10 20 01 mov 1, %i0 * NOTE: This check is critical because threads can block on * send and receive and this ensures that we are broadcasting * the message to threads waiting to receive -- not to send. */ if ( the_message_queue->number_of_pending_messages != 0 ) { 2017600: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 2017604: 80 a0 60 00 cmp %g1, 0 2017608: 02 80 00 0a be 2017630 <_CORE_message_queue_Broadcast+0x48> 201760c: a4 10 20 00 clr %l2 *count = 0; 2017610: c0 27 40 00 clr [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 2017614: 81 c7 e0 08 ret 2017618: 91 e8 20 00 restore %g0, 0, %o0 const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 201761c: d0 04 60 2c ld [ %l1 + 0x2c ], %o0 2017620: 40 00 23 7b call 202040c 2017624: a4 04 a0 01 inc %l2 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 2017628: c2 04 60 28 ld [ %l1 + 0x28 ], %g1 201762c: f4 20 40 00 st %i2, [ %g1 ] /* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread = 2017630: 40 00 0b 8f call 201a46c <_Thread_queue_Dequeue> 2017634: 90 10 00 10 mov %l0, %o0 2017638: 92 10 00 19 mov %i1, %o1 201763c: a2 10 00 08 mov %o0, %l1 2017640: 80 a2 20 00 cmp %o0, 0 2017644: 12 bf ff f6 bne 201761c <_CORE_message_queue_Broadcast+0x34> 2017648: 94 10 00 1a mov %i2, %o2 if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_message_queue_mp_support) ( the_thread, id ); #endif } *count = number_broadcasted; 201764c: e4 27 40 00 st %l2, [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 2017650: b0 10 20 00 clr %i0 } 2017654: 81 c7 e0 08 ret 2017658: 81 e8 00 00 restore =============================================================================== 02010ea8 <_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 ) { 2010ea8: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010eac: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010eb0: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; the_message_queue->maximum_message_size = maximum_message_size; 2010eb4: f6 26 20 4c st %i3, [ %i0 + 0x4c ] 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 ) { 2010eb8: a0 10 00 18 mov %i0, %l0 /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2010ebc: 80 8e e0 03 btst 3, %i3 2010ec0: 02 80 00 07 be 2010edc <_CORE_message_queue_Initialize+0x34> 2010ec4: a4 10 00 1b mov %i3, %l2 allocated_message_size += sizeof(uint32_t); 2010ec8: a4 06 e0 04 add %i3, 4, %l2 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010ecc: a4 0c bf fc and %l2, -4, %l2 } if (allocated_message_size < maximum_message_size) 2010ed0: 80 a6 c0 12 cmp %i3, %l2 2010ed4: 18 80 00 22 bgu 2010f5c <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 2010ed8: b0 10 20 00 clr %i0 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 2010edc: a2 04 a0 10 add %l2, 0x10, %l1 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 2010ee0: 92 10 00 1a mov %i2, %o1 2010ee4: 90 10 00 11 mov %l1, %o0 2010ee8: 40 00 41 2b call 2021394 <.umul> 2010eec: b0 10 20 00 clr %i0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 2010ef0: 80 a2 00 12 cmp %o0, %l2 2010ef4: 0a 80 00 1a bcs 2010f5c <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 2010ef8: 01 00 00 00 nop /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010efc: 40 00 0c 99 call 2014160 <_Workspace_Allocate> 2010f00: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010f04: d0 24 20 5c st %o0, [ %l0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010f08: 80 a2 20 00 cmp %o0, 0 2010f0c: 02 80 00 14 be 2010f5c <_CORE_message_queue_Initialize+0xb4> 2010f10: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010f14: 90 04 20 60 add %l0, 0x60, %o0 2010f18: 94 10 00 1a mov %i2, %o2 2010f1c: 40 00 15 7f call 2016518 <_Chain_Initialize> 2010f20: 96 10 00 11 mov %l1, %o3 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); 2010f24: 82 04 20 50 add %l0, 0x50, %g1 Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2010f28: c0 24 20 54 clr [ %l0 + 0x54 ] 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 ); 2010f2c: 84 04 20 54 add %l0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010f30: c2 24 20 58 st %g1, [ %l0 + 0x58 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2010f34: c4 24 20 50 st %g2, [ %l0 + 0x50 ] allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2010f38: c2 06 40 00 ld [ %i1 ], %g1 THREAD_QUEUE_DISCIPLINE_PRIORITY : THREAD_QUEUE_DISCIPLINE_FIFO, STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; 2010f3c: b0 10 20 01 mov 1, %i0 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2010f40: 82 18 60 01 xor %g1, 1, %g1 2010f44: 80 a0 00 01 cmp %g0, %g1 2010f48: 90 10 00 10 mov %l0, %o0 2010f4c: 94 10 20 80 mov 0x80, %o2 2010f50: 92 60 3f ff subx %g0, -1, %o1 2010f54: 40 00 09 b0 call 2013614 <_Thread_queue_Initialize> 2010f58: 96 10 20 06 mov 6, %o3 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010f5c: 81 c7 e0 08 ret 2010f60: 81 e8 00 00 restore =============================================================================== 020072c8 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 20072c8: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 20072cc: 21 00 80 57 sethi %hi(0x2015c00), %l0 20072d0: c2 04 22 e0 ld [ %l0 + 0x2e0 ], %g1 ! 2015ee0 <_Thread_Dispatch_disable_level> 20072d4: 80 a0 60 00 cmp %g1, 0 20072d8: 02 80 00 05 be 20072ec <_CORE_mutex_Seize+0x24> 20072dc: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 20072e0: 80 8e a0 ff btst 0xff, %i2 20072e4: 12 80 00 1a bne 200734c <_CORE_mutex_Seize+0x84> <== ALWAYS TAKEN 20072e8: 03 00 80 58 sethi %hi(0x2016000), %g1 20072ec: 90 10 00 18 mov %i0, %o0 20072f0: 40 00 14 9f call 200c56c <_CORE_mutex_Seize_interrupt_trylock> 20072f4: 92 07 a0 54 add %fp, 0x54, %o1 20072f8: 80 a2 20 00 cmp %o0, 0 20072fc: 02 80 00 12 be 2007344 <_CORE_mutex_Seize+0x7c> 2007300: 80 8e a0 ff btst 0xff, %i2 2007304: 02 80 00 1a be 200736c <_CORE_mutex_Seize+0xa4> 2007308: 01 00 00 00 nop 200730c: c4 04 22 e0 ld [ %l0 + 0x2e0 ], %g2 2007310: 03 00 80 58 sethi %hi(0x2016000), %g1 2007314: c2 00 61 38 ld [ %g1 + 0x138 ], %g1 ! 2016138 <_Per_CPU_Information+0xc> RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2007318: 86 10 20 01 mov 1, %g3 200731c: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 2007320: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2007324: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 2007328: 82 00 a0 01 add %g2, 1, %g1 200732c: c2 24 22 e0 st %g1, [ %l0 + 0x2e0 ] 2007330: 7f ff eb e2 call 20022b8 2007334: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2007338: 90 10 00 18 mov %i0, %o0 200733c: 7f ff ff c0 call 200723c <_CORE_mutex_Seize_interrupt_blocking> 2007340: 92 10 00 1b mov %i3, %o1 2007344: 81 c7 e0 08 ret 2007348: 81 e8 00 00 restore 200734c: c2 00 60 5c ld [ %g1 + 0x5c ], %g1 2007350: 80 a0 60 01 cmp %g1, 1 2007354: 28 bf ff e7 bleu,a 20072f0 <_CORE_mutex_Seize+0x28> 2007358: 90 10 00 18 mov %i0, %o0 200735c: 90 10 20 00 clr %o0 2007360: 92 10 20 00 clr %o1 2007364: 40 00 01 d8 call 2007ac4 <_Internal_error_Occurred> 2007368: 94 10 20 12 mov 0x12, %o2 200736c: 7f ff eb d3 call 20022b8 2007370: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2007374: 03 00 80 58 sethi %hi(0x2016000), %g1 2007378: c2 00 61 38 ld [ %g1 + 0x138 ], %g1 ! 2016138 <_Per_CPU_Information+0xc> 200737c: 84 10 20 01 mov 1, %g2 2007380: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2007384: 81 c7 e0 08 ret 2007388: 81 e8 00 00 restore =============================================================================== 02007508 <_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 ) { 2007508: 9d e3 bf a0 save %sp, -96, %sp 200750c: a0 10 00 18 mov %i0, %l0 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007510: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2007514: 40 00 07 16 call 200916c <_Thread_queue_Dequeue> 2007518: 90 10 00 10 mov %l0, %o0 200751c: 80 a2 20 00 cmp %o0, 0 2007520: 02 80 00 04 be 2007530 <_CORE_semaphore_Surrender+0x28> 2007524: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2007528: 81 c7 e0 08 ret 200752c: 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 ); 2007530: 7f ff eb 5e call 20022a8 2007534: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2007538: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 200753c: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 2007540: 80 a0 40 02 cmp %g1, %g2 2007544: 1a 80 00 05 bcc 2007558 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2007548: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 200754c: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007550: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007554: c2 24 20 48 st %g1, [ %l0 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007558: 7f ff eb 58 call 20022b8 200755c: 01 00 00 00 nop } return status; } 2007560: 81 c7 e0 08 ret 2007564: 81 e8 00 00 restore =============================================================================== 0200c504 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200c504: 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; 200c508: 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 ); 200c50c: a0 06 20 04 add %i0, 4, %l0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c510: 80 a6 a0 00 cmp %i2, 0 200c514: 02 80 00 12 be 200c55c <_Chain_Initialize+0x58> <== NEVER TAKEN 200c518: 90 10 00 18 mov %i0, %o0 200c51c: b4 06 bf ff add %i2, -1, %i2 { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; 200c520: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200c524: 92 10 00 1a mov %i2, %o1 ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 200c528: 10 80 00 05 b 200c53c <_Chain_Initialize+0x38> 200c52c: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c530: 84 10 00 01 mov %g1, %g2 200c534: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200c538: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200c53c: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200c540: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c544: 80 a6 a0 00 cmp %i2, 0 200c548: 12 bf ff fa bne 200c530 <_Chain_Initialize+0x2c> 200c54c: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200c550: 40 00 17 1b call 20121bc <.umul> 200c554: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c558: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200c55c: e0 22 00 00 st %l0, [ %o0 ] tail->previous = current; 200c560: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200c564: 81 c7 e0 08 ret 200c568: 81 e8 00 00 restore =============================================================================== 020061c4 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 20061c4: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20061c8: e0 06 21 58 ld [ %i0 + 0x158 ], %l0 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 20061cc: 7f ff f0 37 call 20022a8 20061d0: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 20061d4: a2 10 00 08 mov %o0, %l1 pending_events = api->pending_events; 20061d8: c4 04 00 00 ld [ %l0 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 20061dc: 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 ) ) { 20061e0: 86 88 40 02 andcc %g1, %g2, %g3 20061e4: 02 80 00 3e be 20062dc <_Event_Surrender+0x118> 20061e8: 09 00 80 58 sethi %hi(0x2016000), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 20061ec: 88 11 21 2c or %g4, 0x12c, %g4 ! 201612c <_Per_CPU_Information> 20061f0: da 01 20 08 ld [ %g4 + 8 ], %o5 20061f4: 80 a3 60 00 cmp %o5, 0 20061f8: 32 80 00 1d bne,a 200626c <_Event_Surrender+0xa8> 20061fc: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 2006200: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2006204: 80 89 21 00 btst 0x100, %g4 2006208: 02 80 00 33 be 20062d4 <_Event_Surrender+0x110> 200620c: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2006210: 02 80 00 04 be 2006220 <_Event_Surrender+0x5c> 2006214: 80 8c a0 02 btst 2, %l2 2006218: 02 80 00 2f be 20062d4 <_Event_Surrender+0x110> <== NEVER TAKEN 200621c: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006220: 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) ); 2006224: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2006228: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 200622c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006230: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 2006234: 7f ff f0 21 call 20022b8 2006238: 90 10 00 11 mov %l1, %o0 200623c: 7f ff f0 1b call 20022a8 2006240: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2006244: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2006248: 80 a0 60 02 cmp %g1, 2 200624c: 02 80 00 26 be 20062e4 <_Event_Surrender+0x120> 2006250: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2006254: 90 10 00 11 mov %l1, %o0 2006258: 7f ff f0 18 call 20022b8 200625c: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006260: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006264: 40 00 09 ed call 2008a18 <_Thread_Clear_state> 2006268: 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() && 200626c: 80 a6 00 04 cmp %i0, %g4 2006270: 32 bf ff e5 bne,a 2006204 <_Event_Surrender+0x40> 2006274: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006278: 09 00 80 58 sethi %hi(0x2016000), %g4 200627c: da 01 21 80 ld [ %g4 + 0x180 ], %o5 ! 2016180 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 2006280: 80 a3 60 02 cmp %o5, 2 2006284: 02 80 00 07 be 20062a0 <_Event_Surrender+0xdc> <== NEVER TAKEN 2006288: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 200628c: da 01 21 80 ld [ %g4 + 0x180 ], %o5 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006290: 80 a3 60 01 cmp %o5, 1 2006294: 32 bf ff dc bne,a 2006204 <_Event_Surrender+0x40> 2006298: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 200629c: 80 a0 40 03 cmp %g1, %g3 20062a0: 02 80 00 04 be 20062b0 <_Event_Surrender+0xec> 20062a4: 80 8c a0 02 btst 2, %l2 20062a8: 02 80 00 09 be 20062cc <_Event_Surrender+0x108> <== NEVER TAKEN 20062ac: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20062b0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 20062b4: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 20062b8: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 20062bc: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20062c0: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 20062c4: 82 10 20 03 mov 3, %g1 20062c8: c2 21 21 80 st %g1, [ %g4 + 0x180 ] } _ISR_Enable( level ); 20062cc: 7f ff ef fb call 20022b8 20062d0: 91 e8 00 11 restore %g0, %l1, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 20062d4: 7f ff ef f9 call 20022b8 20062d8: 91 e8 00 11 restore %g0, %l1, %o0 /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { _ISR_Enable( level ); 20062dc: 7f ff ef f7 call 20022b8 20062e0: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 20062e4: 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 ); 20062e8: 7f ff ef f4 call 20022b8 20062ec: 90 10 00 11 mov %l1, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 20062f0: 40 00 0f 21 call 2009f74 <_Watchdog_Remove> 20062f4: 90 06 20 48 add %i0, 0x48, %o0 20062f8: 33 04 00 ff sethi %hi(0x1003fc00), %i1 20062fc: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006300: 40 00 09 c6 call 2008a18 <_Thread_Clear_state> 2006304: 81 e8 00 00 restore =============================================================================== 0200630c <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 200630c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006310: 90 10 00 18 mov %i0, %o0 2006314: 40 00 0a c2 call 2008e1c <_Thread_Get> 2006318: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200631c: c2 07 bf fc ld [ %fp + -4 ], %g1 2006320: 80 a0 60 00 cmp %g1, 0 2006324: 12 80 00 15 bne 2006378 <_Event_Timeout+0x6c> <== NEVER TAKEN 2006328: a0 10 00 08 mov %o0, %l0 * * 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 ); 200632c: 7f ff ef df call 20022a8 2006330: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006334: 03 00 80 58 sethi %hi(0x2016000), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006338: c2 00 61 38 ld [ %g1 + 0x138 ], %g1 ! 2016138 <_Per_CPU_Information+0xc> 200633c: 80 a4 00 01 cmp %l0, %g1 2006340: 02 80 00 10 be 2006380 <_Event_Timeout+0x74> 2006344: c0 24 20 24 clr [ %l0 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006348: 82 10 20 06 mov 6, %g1 200634c: c2 24 20 34 st %g1, [ %l0 + 0x34 ] _ISR_Enable( level ); 2006350: 7f ff ef da call 20022b8 2006354: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006358: 90 10 00 10 mov %l0, %o0 200635c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2006360: 40 00 09 ae call 2008a18 <_Thread_Clear_state> 2006364: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2006368: 03 00 80 57 sethi %hi(0x2015c00), %g1 200636c: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 2015ee0 <_Thread_Dispatch_disable_level> 2006370: 84 00 bf ff add %g2, -1, %g2 2006374: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] 2006378: 81 c7 e0 08 ret 200637c: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 2006380: 03 00 80 58 sethi %hi(0x2016000), %g1 2006384: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 2016180 <_Event_Sync_state> 2006388: 80 a0 a0 01 cmp %g2, 1 200638c: 32 bf ff f0 bne,a 200634c <_Event_Timeout+0x40> 2006390: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006394: 84 10 20 02 mov 2, %g2 2006398: c4 20 61 80 st %g2, [ %g1 + 0x180 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 200639c: 10 bf ff ec b 200634c <_Event_Timeout+0x40> 20063a0: 82 10 20 06 mov 6, %g1 =============================================================================== 0200c73c <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200c73c: 9d e3 bf 98 save %sp, -104, %sp 200c740: a0 10 00 18 mov %i0, %l0 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200c744: a4 06 60 04 add %i1, 4, %l2 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200c748: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200c74c: 80 a6 40 12 cmp %i1, %l2 200c750: 18 80 00 6e bgu 200c908 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200c754: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200c758: 80 a6 e0 00 cmp %i3, 0 200c75c: 12 80 00 75 bne 200c930 <_Heap_Allocate_aligned_with_boundary+0x1f4> 200c760: 80 a6 40 1b cmp %i1, %i3 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200c764: e8 04 20 08 ld [ %l0 + 8 ], %l4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200c768: 80 a4 00 14 cmp %l0, %l4 200c76c: 02 80 00 67 be 200c908 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200c770: b0 10 20 00 clr %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 200c774: 82 07 60 07 add %i5, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200c778: b8 10 20 04 mov 4, %i4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200c77c: a2 10 20 01 mov 1, %l1 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 200c780: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200c784: b8 27 00 19 sub %i4, %i1, %i4 /* * 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 ) { 200c788: e6 05 20 04 ld [ %l4 + 4 ], %l3 200c78c: 80 a4 80 13 cmp %l2, %l3 200c790: 3a 80 00 4b bcc,a 200c8bc <_Heap_Allocate_aligned_with_boundary+0x180> 200c794: e8 05 20 08 ld [ %l4 + 8 ], %l4 if ( alignment == 0 ) { 200c798: 80 a6 a0 00 cmp %i2, 0 200c79c: 02 80 00 44 be 200c8ac <_Heap_Allocate_aligned_with_boundary+0x170> 200c7a0: b0 05 20 08 add %l4, 8, %i0 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; 200c7a4: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200c7a8: ee 04 20 14 ld [ %l0 + 0x14 ], %l7 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200c7ac: a6 0c ff fe and %l3, -2, %l3 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; 200c7b0: 82 20 80 17 sub %g2, %l7, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200c7b4: a6 05 00 13 add %l4, %l3, %l3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200c7b8: 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; 200c7bc: b0 07 00 13 add %i4, %l3, %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 200c7c0: a6 00 40 13 add %g1, %l3, %l3 200c7c4: 40 00 17 64 call 2012554 <.urem> 200c7c8: 90 10 00 18 mov %i0, %o0 200c7cc: 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 ) { 200c7d0: 80 a4 c0 18 cmp %l3, %i0 200c7d4: 1a 80 00 06 bcc 200c7ec <_Heap_Allocate_aligned_with_boundary+0xb0> 200c7d8: ac 05 20 08 add %l4, 8, %l6 200c7dc: 90 10 00 13 mov %l3, %o0 200c7e0: 40 00 17 5d call 2012554 <.urem> 200c7e4: 92 10 00 1a mov %i2, %o1 200c7e8: b0 24 c0 08 sub %l3, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200c7ec: 80 a6 e0 00 cmp %i3, 0 200c7f0: 02 80 00 24 be 200c880 <_Heap_Allocate_aligned_with_boundary+0x144> 200c7f4: 80 a5 80 18 cmp %l6, %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; 200c7f8: a6 06 00 19 add %i0, %i1, %l3 200c7fc: 92 10 00 1b mov %i3, %o1 200c800: 40 00 17 55 call 2012554 <.urem> 200c804: 90 10 00 13 mov %l3, %o0 200c808: 90 24 c0 08 sub %l3, %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 ) { 200c80c: 80 a2 00 13 cmp %o0, %l3 200c810: 1a 80 00 1b bcc 200c87c <_Heap_Allocate_aligned_with_boundary+0x140> 200c814: 80 a6 00 08 cmp %i0, %o0 200c818: 1a 80 00 1a bcc 200c880 <_Heap_Allocate_aligned_with_boundary+0x144> 200c81c: 80 a5 80 18 cmp %l6, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200c820: aa 05 80 19 add %l6, %i1, %l5 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200c824: 80 a5 40 08 cmp %l5, %o0 200c828: 28 80 00 09 bleu,a 200c84c <_Heap_Allocate_aligned_with_boundary+0x110> 200c82c: b0 22 00 19 sub %o0, %i1, %i0 if ( alloc_begin != 0 ) { break; } block = block->next; 200c830: 10 80 00 23 b 200c8bc <_Heap_Allocate_aligned_with_boundary+0x180> 200c834: e8 05 20 08 ld [ %l4 + 8 ], %l4 /* 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 ) { 200c838: 1a 80 00 11 bcc 200c87c <_Heap_Allocate_aligned_with_boundary+0x140> 200c83c: 80 a5 40 08 cmp %l5, %o0 if ( boundary_line < boundary_floor ) { 200c840: 38 80 00 1f bgu,a 200c8bc <_Heap_Allocate_aligned_with_boundary+0x180><== NEVER TAKEN 200c844: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED return 0; } alloc_begin = boundary_line - alloc_size; 200c848: b0 22 00 19 sub %o0, %i1, %i0 200c84c: 92 10 00 1a mov %i2, %o1 200c850: 40 00 17 41 call 2012554 <.urem> 200c854: 90 10 00 18 mov %i0, %o0 200c858: 92 10 00 1b mov %i3, %o1 200c85c: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200c860: a6 06 00 19 add %i0, %i1, %l3 200c864: 40 00 17 3c call 2012554 <.urem> 200c868: 90 10 00 13 mov %l3, %o0 200c86c: 90 24 c0 08 sub %l3, %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 ) { 200c870: 80 a2 00 13 cmp %o0, %l3 200c874: 0a bf ff f1 bcs 200c838 <_Heap_Allocate_aligned_with_boundary+0xfc> 200c878: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200c87c: 80 a5 80 18 cmp %l6, %i0 200c880: 38 80 00 0f bgu,a 200c8bc <_Heap_Allocate_aligned_with_boundary+0x180> 200c884: e8 05 20 08 ld [ %l4 + 8 ], %l4 200c888: 82 10 3f f8 mov -8, %g1 200c88c: 90 10 00 18 mov %i0, %o0 200c890: a6 20 40 14 sub %g1, %l4, %l3 200c894: 92 10 00 1d mov %i5, %o1 200c898: 40 00 17 2f call 2012554 <.urem> 200c89c: a6 04 c0 18 add %l3, %i0, %l3 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 ) { 200c8a0: 90 a4 c0 08 subcc %l3, %o0, %o0 200c8a4: 12 80 00 1b bne 200c910 <_Heap_Allocate_aligned_with_boundary+0x1d4> 200c8a8: 80 a2 00 17 cmp %o0, %l7 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200c8ac: 80 a6 20 00 cmp %i0, 0 200c8b0: 32 80 00 08 bne,a 200c8d0 <_Heap_Allocate_aligned_with_boundary+0x194><== ALWAYS TAKEN 200c8b4: c4 04 20 48 ld [ %l0 + 0x48 ], %g2 break; } block = block->next; 200c8b8: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200c8bc: 80 a4 00 14 cmp %l0, %l4 200c8c0: 02 80 00 1a be 200c928 <_Heap_Allocate_aligned_with_boundary+0x1ec> 200c8c4: 82 04 60 01 add %l1, 1, %g1 200c8c8: 10 bf ff b0 b 200c788 <_Heap_Allocate_aligned_with_boundary+0x4c> 200c8cc: a2 10 00 01 mov %g1, %l1 } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; stats->searches += search_count; 200c8d0: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200c8d4: 84 00 a0 01 inc %g2 stats->searches += search_count; 200c8d8: 82 00 40 11 add %g1, %l1, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200c8dc: c4 24 20 48 st %g2, [ %l0 + 0x48 ] stats->searches += search_count; 200c8e0: c2 24 20 4c st %g1, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200c8e4: 90 10 00 10 mov %l0, %o0 200c8e8: 92 10 00 14 mov %l4, %o1 200c8ec: 94 10 00 18 mov %i0, %o2 200c8f0: 7f ff ec 29 call 2007994 <_Heap_Block_allocate> 200c8f4: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200c8f8: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200c8fc: 80 a0 40 11 cmp %g1, %l1 200c900: 2a 80 00 02 bcs,a 200c908 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200c904: e2 24 20 44 st %l1, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 200c908: 81 c7 e0 08 ret 200c90c: 81 e8 00 00 restore if ( alloc_begin >= alloc_begin_floor ) { 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 ) { 200c910: 1a bf ff e8 bcc 200c8b0 <_Heap_Allocate_aligned_with_boundary+0x174> 200c914: 80 a6 20 00 cmp %i0, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200c918: e8 05 20 08 ld [ %l4 + 8 ], %l4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200c91c: 80 a4 00 14 cmp %l0, %l4 200c920: 12 bf ff ea bne 200c8c8 <_Heap_Allocate_aligned_with_boundary+0x18c> 200c924: 82 04 60 01 add %l1, 1, %g1 200c928: 10 bf ff f4 b 200c8f8 <_Heap_Allocate_aligned_with_boundary+0x1bc> 200c92c: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200c930: 18 bf ff f6 bgu 200c908 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200c934: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200c938: 22 bf ff 8b be,a 200c764 <_Heap_Allocate_aligned_with_boundary+0x28> 200c93c: b4 10 00 1d mov %i5, %i2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200c940: 10 bf ff 8a b 200c768 <_Heap_Allocate_aligned_with_boundary+0x2c> 200c944: e8 04 20 08 ld [ %l0 + 8 ], %l4 =============================================================================== 0200cc50 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200cc50: 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; 200cc54: c0 27 bf fc clr [ %fp + -4 ] Heap_Block *extend_last_block = NULL; 200cc58: c0 27 bf f8 clr [ %fp + -8 ] Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200cc5c: a0 10 00 18 mov %i0, %l0 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; 200cc60: a2 06 40 1a add %i1, %i2, %l1 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200cc64: e4 06 20 20 ld [ %i0 + 0x20 ], %l2 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; 200cc68: e6 06 20 10 ld [ %i0 + 0x10 ], %l3 uintptr_t const min_block_size = heap->min_block_size; 200cc6c: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 200cc70: e8 06 20 30 ld [ %i0 + 0x30 ], %l4 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200cc74: 80 a6 40 11 cmp %i1, %l1 200cc78: 18 80 00 86 bgu 200ce90 <_Heap_Extend+0x240> 200cc7c: b0 10 20 00 clr %i0 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200cc80: 90 10 00 19 mov %i1, %o0 200cc84: 92 10 00 1a mov %i2, %o1 200cc88: 94 10 00 13 mov %l3, %o2 200cc8c: 98 07 bf fc add %fp, -4, %o4 200cc90: 7f ff eb a2 call 2007b18 <_Heap_Get_first_and_last_block> 200cc94: 9a 07 bf f8 add %fp, -8, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200cc98: 80 8a 20 ff btst 0xff, %o0 200cc9c: 02 80 00 7d be 200ce90 <_Heap_Extend+0x240> 200cca0: ba 10 20 00 clr %i5 200cca4: b0 10 00 12 mov %l2, %i0 200cca8: b8 10 20 00 clr %i4 200ccac: ac 10 20 00 clr %l6 200ccb0: 10 80 00 14 b 200cd00 <_Heap_Extend+0xb0> 200ccb4: ae 10 20 00 clr %l7 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200ccb8: 2a 80 00 02 bcs,a 200ccc0 <_Heap_Extend+0x70> 200ccbc: b8 10 00 18 mov %i0, %i4 200ccc0: 90 10 00 15 mov %l5, %o0 200ccc4: 40 00 17 77 call 2012aa0 <.urem> 200ccc8: 92 10 00 13 mov %l3, %o1 200cccc: 82 05 7f f8 add %l5, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200ccd0: 80 a5 40 19 cmp %l5, %i1 200ccd4: 02 80 00 1c be 200cd44 <_Heap_Extend+0xf4> 200ccd8: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200ccdc: 80 a6 40 15 cmp %i1, %l5 200cce0: 38 80 00 02 bgu,a 200cce8 <_Heap_Extend+0x98> 200cce4: 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; 200cce8: f0 00 60 04 ld [ %g1 + 4 ], %i0 200ccec: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200ccf0: b0 00 40 18 add %g1, %i0, %i0 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200ccf4: 80 a4 80 18 cmp %l2, %i0 200ccf8: 22 80 00 1b be,a 200cd64 <_Heap_Extend+0x114> 200ccfc: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200cd00: 80 a6 00 12 cmp %i0, %l2 200cd04: 02 80 00 65 be 200ce98 <_Heap_Extend+0x248> 200cd08: 82 10 00 18 mov %i0, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200cd0c: 80 a0 40 11 cmp %g1, %l1 200cd10: 0a 80 00 6f bcs 200cecc <_Heap_Extend+0x27c> 200cd14: ea 06 00 00 ld [ %i0 ], %l5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200cd18: 80 a0 40 11 cmp %g1, %l1 200cd1c: 12 bf ff e7 bne 200ccb8 <_Heap_Extend+0x68> 200cd20: 80 a4 40 15 cmp %l1, %l5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200cd24: 90 10 00 15 mov %l5, %o0 200cd28: 40 00 17 5e call 2012aa0 <.urem> 200cd2c: 92 10 00 13 mov %l3, %o1 200cd30: 82 05 7f f8 add %l5, -8, %g1 200cd34: ae 10 00 18 mov %i0, %l7 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 ) { 200cd38: 80 a5 40 19 cmp %l5, %i1 200cd3c: 12 bf ff e8 bne 200ccdc <_Heap_Extend+0x8c> <== ALWAYS TAKEN 200cd40: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200cd44: e2 26 00 00 st %l1, [ %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; 200cd48: f0 00 60 04 ld [ %g1 + 4 ], %i0 200cd4c: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200cd50: b0 00 40 18 add %g1, %i0, %i0 } 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 ); 200cd54: 80 a4 80 18 cmp %l2, %i0 200cd58: 12 bf ff ea bne 200cd00 <_Heap_Extend+0xb0> <== NEVER TAKEN 200cd5c: ac 10 00 01 mov %g1, %l6 if ( extend_area_begin < heap->area_begin ) { 200cd60: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 200cd64: 80 a6 40 01 cmp %i1, %g1 200cd68: 3a 80 00 54 bcc,a 200ceb8 <_Heap_Extend+0x268> 200cd6c: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200cd70: f2 24 20 18 st %i1, [ %l0 + 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; 200cd74: c2 07 bf fc ld [ %fp + -4 ], %g1 200cd78: c4 07 bf f8 ld [ %fp + -8 ], %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 ) { 200cd7c: c8 04 20 20 ld [ %l0 + 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 = 200cd80: 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; 200cd84: e2 20 40 00 st %l1, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200cd88: 9a 10 e0 01 or %g3, 1, %o5 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 = 200cd8c: da 20 60 04 st %o5, [ %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; 200cd90: 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 ) { 200cd94: 80 a1 00 01 cmp %g4, %g1 200cd98: 08 80 00 42 bleu 200cea0 <_Heap_Extend+0x250> 200cd9c: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200cda0: c2 24 20 20 st %g1, [ %l0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200cda4: 80 a5 e0 00 cmp %l7, 0 200cda8: 02 80 00 62 be 200cf30 <_Heap_Extend+0x2e0> 200cdac: 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; 200cdb0: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200cdb4: 92 10 00 12 mov %l2, %o1 200cdb8: 40 00 17 3a call 2012aa0 <.urem> 200cdbc: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200cdc0: 80 a2 20 00 cmp %o0, 0 200cdc4: 02 80 00 04 be 200cdd4 <_Heap_Extend+0x184> <== ALWAYS TAKEN 200cdc8: c4 05 c0 00 ld [ %l7 ], %g2 return value - remainder + alignment; 200cdcc: b2 06 40 12 add %i1, %l2, %i1 <== NOT EXECUTED 200cdd0: b2 26 40 08 sub %i1, %o0, %i1 <== NOT EXECUTED 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 = 200cdd4: 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; 200cdd8: 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 = 200cddc: 84 25 c0 01 sub %l7, %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; 200cde0: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200cde4: 90 10 00 10 mov %l0, %o0 200cde8: 92 10 00 01 mov %g1, %o1 200cdec: 7f ff ff 8e call 200cc24 <_Heap_Free_block> 200cdf0: c4 20 60 04 st %g2, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200cdf4: 80 a5 a0 00 cmp %l6, 0 200cdf8: 02 80 00 3a be 200cee0 <_Heap_Extend+0x290> 200cdfc: a2 04 7f f8 add %l1, -8, %l1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200ce00: d2 04 20 10 ld [ %l0 + 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( 200ce04: a2 24 40 16 sub %l1, %l6, %l1 200ce08: 40 00 17 26 call 2012aa0 <.urem> 200ce0c: 90 10 00 11 mov %l1, %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) 200ce10: c2 05 a0 04 ld [ %l6 + 4 ], %g1 200ce14: a2 24 40 08 sub %l1, %o0, %l1 200ce18: 82 20 40 11 sub %g1, %l1, %g1 | HEAP_PREV_BLOCK_USED; 200ce1c: 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 = 200ce20: 84 04 40 16 add %l1, %l6, %g2 200ce24: 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; 200ce28: c2 05 a0 04 ld [ %l6 + 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 ); 200ce2c: 90 10 00 10 mov %l0, %o0 200ce30: 82 08 60 01 and %g1, 1, %g1 200ce34: 92 10 00 16 mov %l6, %o1 block->size_and_flag = size | flag; 200ce38: a2 14 40 01 or %l1, %g1, %l1 200ce3c: 7f ff ff 7a call 200cc24 <_Heap_Free_block> 200ce40: e2 25 a0 04 st %l1, [ %l6 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200ce44: 80 a5 a0 00 cmp %l6, 0 200ce48: 02 80 00 33 be 200cf14 <_Heap_Extend+0x2c4> 200ce4c: 80 a5 e0 00 cmp %l7, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200ce50: c2 04 20 24 ld [ %l0 + 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( 200ce54: da 04 20 20 ld [ %l0 + 0x20 ], %o5 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; 200ce58: 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; 200ce5c: c4 04 20 2c ld [ %l0 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200ce60: c6 04 20 30 ld [ %l0 + 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( 200ce64: 9a 23 40 01 sub %o5, %g1, %o5 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; 200ce68: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200ce6c: 88 13 40 04 or %o5, %g4, %g4 200ce70: c8 20 60 04 st %g4, [ %g1 + 4 ] 200ce74: a8 20 c0 14 sub %g3, %l4, %l4 /* Statistics */ stats->size += extended_size; 200ce78: 82 00 80 14 add %g2, %l4, %g1 200ce7c: c2 24 20 2c st %g1, [ %l0 + 0x2c ] if ( extended_size_ptr != NULL ) 200ce80: 80 a6 e0 00 cmp %i3, 0 200ce84: 02 80 00 03 be 200ce90 <_Heap_Extend+0x240> <== NEVER TAKEN 200ce88: b0 10 20 01 mov 1, %i0 *extended_size_ptr = extended_size; 200ce8c: e8 26 c0 00 st %l4, [ %i3 ] 200ce90: 81 c7 e0 08 ret 200ce94: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200ce98: 10 bf ff 9d b 200cd0c <_Heap_Extend+0xbc> 200ce9c: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200cea0: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 200cea4: 80 a0 40 02 cmp %g1, %g2 200cea8: 2a bf ff bf bcs,a 200cda4 <_Heap_Extend+0x154> 200ceac: c4 24 20 24 st %g2, [ %l0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200ceb0: 10 bf ff be b 200cda8 <_Heap_Extend+0x158> 200ceb4: 80 a5 e0 00 cmp %l7, 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 ) { 200ceb8: 80 a4 40 01 cmp %l1, %g1 200cebc: 38 bf ff ae bgu,a 200cd74 <_Heap_Extend+0x124> 200cec0: e2 24 20 1c st %l1, [ %l0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200cec4: 10 bf ff ad b 200cd78 <_Heap_Extend+0x128> 200cec8: c2 07 bf fc ld [ %fp + -4 ], %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 ( 200cecc: 80 a6 40 15 cmp %i1, %l5 200ced0: 1a bf ff 93 bcc 200cd1c <_Heap_Extend+0xcc> 200ced4: 80 a0 40 11 cmp %g1, %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200ced8: 81 c7 e0 08 ret 200cedc: 91 e8 20 00 restore %g0, 0, %o0 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200cee0: 80 a7 60 00 cmp %i5, 0 200cee4: 02 bf ff d8 be 200ce44 <_Heap_Extend+0x1f4> 200cee8: c4 07 bf fc ld [ %fp + -4 ], %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; 200ceec: c6 07 60 04 ld [ %i5 + 4 ], %g3 _Heap_Link_above( 200cef0: c2 07 bf f8 ld [ %fp + -8 ], %g1 200cef4: 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 ); 200cef8: 84 20 80 1d sub %g2, %i5, %g2 block->size_and_flag = size | flag; 200cefc: 84 10 80 03 or %g2, %g3, %g2 200cf00: c4 27 60 04 st %g2, [ %i5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200cf04: c4 00 60 04 ld [ %g1 + 4 ], %g2 200cf08: 84 10 a0 01 or %g2, 1, %g2 200cf0c: 10 bf ff ce b 200ce44 <_Heap_Extend+0x1f4> 200cf10: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200cf14: 32 bf ff d0 bne,a 200ce54 <_Heap_Extend+0x204> 200cf18: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200cf1c: d2 07 bf fc ld [ %fp + -4 ], %o1 200cf20: 7f ff ff 41 call 200cc24 <_Heap_Free_block> 200cf24: 90 10 00 10 mov %l0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200cf28: 10 bf ff cb b 200ce54 <_Heap_Extend+0x204> 200cf2c: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200cf30: 80 a7 20 00 cmp %i4, 0 200cf34: 02 bf ff b1 be 200cdf8 <_Heap_Extend+0x1a8> 200cf38: 80 a5 a0 00 cmp %l6, 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; 200cf3c: b8 27 00 02 sub %i4, %g2, %i4 200cf40: b8 17 20 01 or %i4, 1, %i4 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 200cf44: 10 bf ff ad b 200cdf8 <_Heap_Extend+0x1a8> 200cf48: f8 20 a0 04 st %i4, [ %g2 + 4 ] =============================================================================== 0200c948 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200c948: 9d e3 bf a0 save %sp, -96, %sp 200c94c: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200c950: 40 00 17 01 call 2012554 <.urem> 200c954: 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 200c958: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 200c95c: a0 10 00 18 mov %i0, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200c960: a2 06 7f f8 add %i1, -8, %l1 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200c964: 90 24 40 08 sub %l1, %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; 200c968: 80 a2 00 01 cmp %o0, %g1 200c96c: 0a 80 00 4d bcs 200caa0 <_Heap_Free+0x158> 200c970: b0 10 20 00 clr %i0 200c974: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 200c978: 80 a2 00 03 cmp %o0, %g3 200c97c: 18 80 00 49 bgu 200caa0 <_Heap_Free+0x158> 200c980: 01 00 00 00 nop --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c984: da 02 20 04 ld [ %o0 + 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; 200c988: 88 0b 7f fe and %o5, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c98c: 84 02 00 04 add %o0, %g4, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200c990: 80 a0 40 02 cmp %g1, %g2 200c994: 18 80 00 43 bgu 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200c998: 80 a0 c0 02 cmp %g3, %g2 200c99c: 0a 80 00 41 bcs 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200c9a0: 01 00 00 00 nop 200c9a4: d8 00 a0 04 ld [ %g2 + 4 ], %o4 if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { _HAssert( false ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200c9a8: 80 8b 20 01 btst 1, %o4 200c9ac: 02 80 00 3d be 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200c9b0: 96 0b 3f fe and %o4, -2, %o3 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 )); 200c9b4: 80 a0 c0 02 cmp %g3, %g2 200c9b8: 02 80 00 06 be 200c9d0 <_Heap_Free+0x88> 200c9bc: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c9c0: 98 00 80 0b add %g2, %o3, %o4 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; 200c9c4: d8 03 20 04 ld [ %o4 + 4 ], %o4 200c9c8: 98 0b 20 01 and %o4, 1, %o4 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200c9cc: 98 1b 20 01 xor %o4, 1, %o4 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 ) ) { 200c9d0: 80 8b 60 01 btst 1, %o5 200c9d4: 12 80 00 1d bne 200ca48 <_Heap_Free+0x100> 200c9d8: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 200c9dc: d4 02 00 00 ld [ %o0 ], %o2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c9e0: 9a 22 00 0a sub %o0, %o2, %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; 200c9e4: 80 a0 40 0d cmp %g1, %o5 200c9e8: 18 80 00 2e bgu 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200c9ec: b0 10 20 00 clr %i0 200c9f0: 80 a0 c0 0d cmp %g3, %o5 200c9f4: 0a 80 00 2b bcs 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200c9f8: 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; 200c9fc: c2 03 60 04 ld [ %o5 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200ca00: 80 88 60 01 btst 1, %g1 200ca04: 02 80 00 27 be 200caa0 <_Heap_Free+0x158> <== NEVER TAKEN 200ca08: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200ca0c: 22 80 00 39 be,a 200caf0 <_Heap_Free+0x1a8> 200ca10: 94 01 00 0a add %g4, %o2, %o2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ca14: c2 00 a0 08 ld [ %g2 + 8 ], %g1 200ca18: c4 00 a0 0c ld [ %g2 + 0xc ], %g2 } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200ca1c: c6 04 20 38 ld [ %l0 + 0x38 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 200ca20: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200ca24: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200ca28: 82 00 ff ff add %g3, -1, %g1 200ca2c: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200ca30: 96 01 00 0b add %g4, %o3, %o3 200ca34: 94 02 c0 0a add %o3, %o2, %o2 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ca38: 82 12 a0 01 or %o2, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200ca3c: d4 23 40 0a st %o2, [ %o5 + %o2 ] 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; 200ca40: 10 80 00 0e b 200ca78 <_Heap_Free+0x130> 200ca44: c2 23 60 04 st %g1, [ %o5 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200ca48: 22 80 00 18 be,a 200caa8 <_Heap_Free+0x160> 200ca4c: c6 04 20 08 ld [ %l0 + 8 ], %g3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ca50: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200ca54: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200ca58: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = prev; 200ca5c: 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; 200ca60: 96 02 c0 04 add %o3, %g4, %o3 next->prev = new_block; 200ca64: d0 20 e0 0c st %o0, [ %g3 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ca68: 84 12 e0 01 or %o3, 1, %g2 prev->next = new_block; 200ca6c: d0 20 60 08 st %o0, [ %g1 + 8 ] 200ca70: c4 22 20 04 st %g2, [ %o0 + 4 ] next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200ca74: d6 22 00 0b st %o3, [ %o0 + %o3 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ca78: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 ++stats->frees; 200ca7c: c2 04 20 50 ld [ %l0 + 0x50 ], %g1 stats->free_size += block_size; 200ca80: c6 04 20 30 ld [ %l0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ca84: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200ca88: 82 00 60 01 inc %g1 stats->free_size += block_size; 200ca8c: 88 00 c0 04 add %g3, %g4, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ca90: c4 24 20 40 st %g2, [ %l0 + 0x40 ] ++stats->frees; 200ca94: c2 24 20 50 st %g1, [ %l0 + 0x50 ] stats->free_size += block_size; 200ca98: c8 24 20 30 st %g4, [ %l0 + 0x30 ] return( true ); 200ca9c: b0 10 20 01 mov 1, %i0 } 200caa0: 81 c7 e0 08 ret 200caa4: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200caa8: 82 11 20 01 or %g4, 1, %g1 200caac: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cab0: da 00 a0 04 ld [ %g2 + 4 ], %o5 next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cab4: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200cab8: e0 22 20 0c st %l0, [ %o0 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200cabc: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200cac0: d0 20 e0 0c st %o0, [ %g3 + 0xc ] /* 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; next_block->prev_size = block_size; 200cac4: c8 22 00 04 st %g4, [ %o0 + %g4 ] } 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; 200cac8: 86 0b 7f fe and %o5, -2, %g3 200cacc: c6 20 a0 04 st %g3, [ %g2 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { 200cad0: c4 04 20 3c ld [ %l0 + 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; 200cad4: 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; 200cad8: d0 24 20 08 st %o0, [ %l0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200cadc: 80 a0 40 02 cmp %g1, %g2 200cae0: 08 bf ff e6 bleu 200ca78 <_Heap_Free+0x130> 200cae4: c2 24 20 38 st %g1, [ %l0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200cae8: 10 bf ff e4 b 200ca78 <_Heap_Free+0x130> 200caec: c2 24 20 3c st %g1, [ %l0 + 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; 200caf0: 82 12 a0 01 or %o2, 1, %g1 200caf4: c2 23 60 04 st %g1, [ %o5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200caf8: c2 00 a0 04 ld [ %g2 + 4 ], %g1 next_block->prev_size = size; 200cafc: d4 22 00 04 st %o2, [ %o0 + %g4 ] _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; 200cb00: 82 08 7f fe and %g1, -2, %g1 200cb04: 10 bf ff dd b 200ca78 <_Heap_Free+0x130> 200cb08: c2 20 a0 04 st %g1, [ %g2 + 4 ] =============================================================================== 0200d66c <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200d66c: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200d670: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *const end = the_heap->last_block; 200d674: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 memset(the_info, 0, sizeof(*the_info)); 200d678: c0 26 40 00 clr [ %i1 ] 200d67c: c0 26 60 04 clr [ %i1 + 4 ] 200d680: c0 26 60 08 clr [ %i1 + 8 ] 200d684: c0 26 60 0c clr [ %i1 + 0xc ] 200d688: c0 26 60 10 clr [ %i1 + 0x10 ] while ( the_block != end ) { 200d68c: 80 a0 40 02 cmp %g1, %g2 200d690: 02 80 00 17 be 200d6ec <_Heap_Get_information+0x80> <== NEVER TAKEN 200d694: c0 26 60 14 clr [ %i1 + 0x14 ] 200d698: da 00 60 04 ld [ %g1 + 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; 200d69c: 88 0b 7f fe and %o5, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d6a0: 82 00 40 04 add %g1, %g4, %g1 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200d6a4: da 00 60 04 ld [ %g1 + 4 ], %o5 while ( the_block != end ) { uintptr_t const the_size = _Heap_Block_size(the_block); Heap_Block *const next_block = _Heap_Block_at(the_block, the_size); Heap_Information *info; if ( _Heap_Is_prev_used(next_block) ) 200d6a8: 80 8b 60 01 btst 1, %o5 200d6ac: 02 80 00 03 be 200d6b8 <_Heap_Get_information+0x4c> 200d6b0: 86 10 00 19 mov %i1, %g3 info = &the_info->Used; 200d6b4: 86 06 60 0c add %i1, 0xc, %g3 else info = &the_info->Free; info->number++; 200d6b8: d4 00 c0 00 ld [ %g3 ], %o2 info->total += the_size; 200d6bc: d6 00 e0 08 ld [ %g3 + 8 ], %o3 if ( info->largest < the_size ) 200d6c0: d8 00 e0 04 ld [ %g3 + 4 ], %o4 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200d6c4: 94 02 a0 01 inc %o2 info->total += the_size; 200d6c8: 96 02 c0 04 add %o3, %g4, %o3 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200d6cc: d4 20 c0 00 st %o2, [ %g3 ] info->total += the_size; if ( info->largest < the_size ) 200d6d0: 80 a3 00 04 cmp %o4, %g4 200d6d4: 1a 80 00 03 bcc 200d6e0 <_Heap_Get_information+0x74> 200d6d8: d6 20 e0 08 st %o3, [ %g3 + 8 ] info->largest = the_size; 200d6dc: c8 20 e0 04 st %g4, [ %g3 + 4 ] Heap_Block *the_block = the_heap->first_block; Heap_Block *const end = the_heap->last_block; memset(the_info, 0, sizeof(*the_info)); while ( the_block != end ) { 200d6e0: 80 a0 80 01 cmp %g2, %g1 200d6e4: 12 bf ff ef bne 200d6a0 <_Heap_Get_information+0x34> 200d6e8: 88 0b 7f fe and %o5, -2, %g4 200d6ec: 81 c7 e0 08 ret 200d6f0: 81 e8 00 00 restore =============================================================================== 02013ff8 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2013ff8: 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); 2013ffc: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 2014000: 7f ff f9 55 call 2012554 <.urem> 2014004: 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 2014008: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 201400c: a0 10 00 18 mov %i0, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 2014010: 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); 2014014: 84 20 80 08 sub %g2, %o0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2014018: 80 a0 80 01 cmp %g2, %g1 201401c: 0a 80 00 15 bcs 2014070 <_Heap_Size_of_alloc_area+0x78> 2014020: b0 10 20 00 clr %i0 2014024: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 2014028: 80 a0 80 03 cmp %g2, %g3 201402c: 18 80 00 11 bgu 2014070 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 2014030: 01 00 00 00 nop - 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; 2014034: c8 00 a0 04 ld [ %g2 + 4 ], %g4 2014038: 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); 201403c: 84 00 80 04 add %g2, %g4, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2014040: 80 a0 40 02 cmp %g1, %g2 2014044: 18 80 00 0b bgu 2014070 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 2014048: 80 a0 c0 02 cmp %g3, %g2 201404c: 0a 80 00 09 bcs 2014070 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 2014050: 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; 2014054: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 2014058: 80 88 60 01 btst 1, %g1 201405c: 02 80 00 05 be 2014070 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 2014060: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2014064: b0 10 20 01 mov 1, %i0 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 2014068: 84 00 a0 04 add %g2, 4, %g2 201406c: c4 26 80 00 st %g2, [ %i2 ] return true; } 2014070: 81 c7 e0 08 ret 2014074: 81 e8 00 00 restore =============================================================================== 02008958 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008958: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 200895c: 23 00 80 22 sethi %hi(0x2008800), %l1 bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008960: a0 10 00 18 mov %i0, %l0 uintptr_t const page_size = heap->page_size; 2008964: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 uintptr_t const min_block_size = heap->min_block_size; 2008968: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const first_block = heap->first_block; 200896c: e4 06 20 20 ld [ %i0 + 0x20 ], %l2 Heap_Block *const last_block = heap->last_block; 2008970: ea 06 20 24 ld [ %i0 + 0x24 ], %l5 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008974: 80 8e a0 ff btst 0xff, %i2 2008978: 02 80 00 04 be 2008988 <_Heap_Walk+0x30> 200897c: a2 14 60 ec or %l1, 0xec, %l1 2008980: 23 00 80 22 sethi %hi(0x2008800), %l1 2008984: a2 14 60 f4 or %l1, 0xf4, %l1 ! 20088f4 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008988: 03 00 80 62 sethi %hi(0x2018800), %g1 200898c: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 ! 201881c <_System_state_Current> 2008990: 80 a0 60 03 cmp %g1, 3 2008994: 12 80 00 33 bne 2008a60 <_Heap_Walk+0x108> 2008998: b0 10 20 01 mov 1, %i0 Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 200899c: da 04 20 18 ld [ %l0 + 0x18 ], %o5 20089a0: c6 04 20 1c ld [ %l0 + 0x1c ], %g3 20089a4: c4 04 20 08 ld [ %l0 + 8 ], %g2 20089a8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 20089ac: 90 10 00 19 mov %i1, %o0 20089b0: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20089b4: e4 23 a0 60 st %l2, [ %sp + 0x60 ] 20089b8: ea 23 a0 64 st %l5, [ %sp + 0x64 ] 20089bc: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 20089c0: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20089c4: 92 10 20 00 clr %o1 20089c8: 96 10 00 14 mov %l4, %o3 20089cc: 15 00 80 57 sethi %hi(0x2015c00), %o2 20089d0: 98 10 00 13 mov %l3, %o4 20089d4: 9f c4 40 00 call %l1 20089d8: 94 12 a1 c8 or %o2, 0x1c8, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 20089dc: 80 a5 20 00 cmp %l4, 0 20089e0: 02 80 00 2a be 2008a88 <_Heap_Walk+0x130> 20089e4: 80 8d 20 07 btst 7, %l4 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 20089e8: 12 80 00 30 bne 2008aa8 <_Heap_Walk+0x150> 20089ec: 90 10 00 13 mov %l3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20089f0: 7f ff e4 30 call 2001ab0 <.urem> 20089f4: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20089f8: 80 a2 20 00 cmp %o0, 0 20089fc: 12 80 00 34 bne 2008acc <_Heap_Walk+0x174> 2008a00: 90 04 a0 08 add %l2, 8, %o0 2008a04: 7f ff e4 2b call 2001ab0 <.urem> 2008a08: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 2008a0c: 80 a2 20 00 cmp %o0, 0 2008a10: 32 80 00 38 bne,a 2008af0 <_Heap_Walk+0x198> 2008a14: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 2008a18: f8 04 a0 04 ld [ %l2 + 4 ], %i4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008a1c: 80 8f 20 01 btst 1, %i4 2008a20: 22 80 00 4d be,a 2008b54 <_Heap_Walk+0x1fc> 2008a24: 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; 2008a28: c2 05 60 04 ld [ %l5 + 4 ], %g1 2008a2c: 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); 2008a30: 82 05 40 01 add %l5, %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; 2008a34: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2008a38: 80 88 a0 01 btst 1, %g2 2008a3c: 02 80 00 0b be 2008a68 <_Heap_Walk+0x110> 2008a40: 80 a4 80 01 cmp %l2, %g1 ); return false; } if ( 2008a44: 02 80 00 33 be 2008b10 <_Heap_Walk+0x1b8> <== ALWAYS TAKEN 2008a48: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008a4c: 92 10 20 01 mov 1, %o1 <== NOT EXECUTED 2008a50: 15 00 80 57 sethi %hi(0x2015c00), %o2 <== NOT EXECUTED if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008a54: b0 10 20 00 clr %i0 <== NOT EXECUTED } if ( _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008a58: 9f c4 40 00 call %l1 <== NOT EXECUTED 2008a5c: 94 12 a3 40 or %o2, 0x340, %o2 <== NOT EXECUTED 2008a60: 81 c7 e0 08 ret 2008a64: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2008a68: 90 10 00 19 mov %i1, %o0 2008a6c: 92 10 20 01 mov 1, %o1 2008a70: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008a74: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2008a78: 9f c4 40 00 call %l1 2008a7c: 94 12 a3 28 or %o2, 0x328, %o2 2008a80: 81 c7 e0 08 ret 2008a84: 81 e8 00 00 restore first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 2008a88: 90 10 00 19 mov %i1, %o0 2008a8c: 92 10 20 01 mov 1, %o1 2008a90: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008a94: b0 10 20 00 clr %i0 first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 2008a98: 9f c4 40 00 call %l1 2008a9c: 94 12 a2 60 or %o2, 0x260, %o2 2008aa0: 81 c7 e0 08 ret 2008aa4: 81 e8 00 00 restore return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2008aa8: 90 10 00 19 mov %i1, %o0 2008aac: 92 10 20 01 mov 1, %o1 2008ab0: 96 10 00 14 mov %l4, %o3 2008ab4: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008ab8: b0 10 20 00 clr %i0 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2008abc: 9f c4 40 00 call %l1 2008ac0: 94 12 a2 78 or %o2, 0x278, %o2 2008ac4: 81 c7 e0 08 ret 2008ac8: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008acc: 90 10 00 19 mov %i1, %o0 2008ad0: 92 10 20 01 mov 1, %o1 2008ad4: 96 10 00 13 mov %l3, %o3 2008ad8: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008adc: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008ae0: 9f c4 40 00 call %l1 2008ae4: 94 12 a2 98 or %o2, 0x298, %o2 2008ae8: 81 c7 e0 08 ret 2008aec: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008af0: 92 10 20 01 mov 1, %o1 2008af4: 96 10 00 12 mov %l2, %o3 2008af8: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008afc: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008b00: 9f c4 40 00 call %l1 2008b04: 94 12 a2 c0 or %o2, 0x2c0, %o2 2008b08: 81 c7 e0 08 ret 2008b0c: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 2008b10: ee 04 20 08 ld [ %l0 + 8 ], %l7 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 ) { 2008b14: 80 a4 00 17 cmp %l0, %l7 2008b18: 02 80 01 18 be 2008f78 <_Heap_Walk+0x620> 2008b1c: f6 04 20 10 ld [ %l0 + 0x10 ], %i3 block = next_block; } while ( block != first_block ); return true; } 2008b20: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008b24: 80 a0 40 17 cmp %g1, %l7 2008b28: 08 80 00 12 bleu 2008b70 <_Heap_Walk+0x218> <== ALWAYS TAKEN 2008b2c: ac 10 00 17 mov %l7, %l6 const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2008b30: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008b34: 92 10 20 01 mov 1, %o1 2008b38: 96 10 00 16 mov %l6, %o3 2008b3c: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008b40: b0 10 20 00 clr %i0 const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2008b44: 9f c4 40 00 call %l1 2008b48: 94 12 a3 70 or %o2, 0x370, %o2 2008b4c: 81 c7 e0 08 ret 2008b50: 81 e8 00 00 restore return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2008b54: 92 10 20 01 mov 1, %o1 2008b58: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008b5c: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2008b60: 9f c4 40 00 call %l1 2008b64: 94 12 a2 f8 or %o2, 0x2f8, %o2 2008b68: 81 c7 e0 08 ret 2008b6c: 81 e8 00 00 restore 2008b70: fa 04 20 24 ld [ %l0 + 0x24 ], %i5 2008b74: 80 a7 40 17 cmp %i5, %l7 2008b78: 0a bf ff ef bcs 2008b34 <_Heap_Walk+0x1dc> <== NEVER TAKEN 2008b7c: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008b80: c2 27 bf fc st %g1, [ %fp + -4 ] 2008b84: 90 05 e0 08 add %l7, 8, %o0 2008b88: 7f ff e3 ca call 2001ab0 <.urem> 2008b8c: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 2008b90: 80 a2 20 00 cmp %o0, 0 2008b94: 12 80 00 2d bne 2008c48 <_Heap_Walk+0x2f0> <== NEVER TAKEN 2008b98: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2008b9c: c4 05 e0 04 ld [ %l7 + 4 ], %g2 2008ba0: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008ba4: 84 05 c0 02 add %l7, %g2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2008ba8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008bac: 80 88 a0 01 btst 1, %g2 2008bb0: 12 80 00 2f bne 2008c6c <_Heap_Walk+0x314> <== NEVER TAKEN 2008bb4: 84 10 00 10 mov %l0, %g2 2008bb8: 10 80 00 17 b 2008c14 <_Heap_Walk+0x2bc> 2008bbc: b4 10 00 01 mov %g1, %i2 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 ) { 2008bc0: 80 a4 00 16 cmp %l0, %l6 2008bc4: 02 80 00 33 be 2008c90 <_Heap_Walk+0x338> 2008bc8: 80 a6 80 16 cmp %i2, %l6 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008bcc: 18 bf ff da bgu 2008b34 <_Heap_Walk+0x1dc> 2008bd0: 90 10 00 19 mov %i1, %o0 2008bd4: 80 a5 80 1d cmp %l6, %i5 2008bd8: 18 bf ff d8 bgu 2008b38 <_Heap_Walk+0x1e0> <== NEVER TAKEN 2008bdc: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008be0: 90 05 a0 08 add %l6, 8, %o0 2008be4: 7f ff e3 b3 call 2001ab0 <.urem> 2008be8: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 2008bec: 80 a2 20 00 cmp %o0, 0 2008bf0: 12 80 00 16 bne 2008c48 <_Heap_Walk+0x2f0> 2008bf4: 84 10 00 17 mov %l7, %g2 - 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; 2008bf8: c2 05 a0 04 ld [ %l6 + 4 ], %g1 2008bfc: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 2008c00: 82 00 40 16 add %g1, %l6, %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; 2008c04: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c08: 80 88 60 01 btst 1, %g1 2008c0c: 12 80 00 18 bne 2008c6c <_Heap_Walk+0x314> 2008c10: ae 10 00 16 mov %l6, %l7 ); return false; } if ( free_block->prev != prev_block ) { 2008c14: d8 05 e0 0c ld [ %l7 + 0xc ], %o4 2008c18: 80 a3 00 02 cmp %o4, %g2 2008c1c: 22 bf ff e9 be,a 2008bc0 <_Heap_Walk+0x268> 2008c20: ec 05 e0 08 ld [ %l7 + 8 ], %l6 (*printer)( 2008c24: 90 10 00 19 mov %i1, %o0 2008c28: 92 10 20 01 mov 1, %o1 2008c2c: 96 10 00 17 mov %l7, %o3 2008c30: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c34: b0 10 20 00 clr %i0 return false; } if ( free_block->prev != prev_block ) { (*printer)( 2008c38: 9f c4 40 00 call %l1 2008c3c: 94 12 a3 e0 or %o2, 0x3e0, %o2 2008c40: 81 c7 e0 08 ret 2008c44: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008c48: 90 10 00 19 mov %i1, %o0 2008c4c: 92 10 20 01 mov 1, %o1 2008c50: 96 10 00 16 mov %l6, %o3 2008c54: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c58: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008c5c: 9f c4 40 00 call %l1 2008c60: 94 12 a3 90 or %o2, 0x390, %o2 2008c64: 81 c7 e0 08 ret 2008c68: 81 e8 00 00 restore return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008c6c: 90 10 00 19 mov %i1, %o0 2008c70: 92 10 20 01 mov 1, %o1 2008c74: 96 10 00 16 mov %l6, %o3 2008c78: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c7c: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008c80: 9f c4 40 00 call %l1 2008c84: 94 12 a3 c0 or %o2, 0x3c0, %o2 2008c88: 81 c7 e0 08 ret 2008c8c: 81 e8 00 00 restore 2008c90: 82 10 00 1a mov %i2, %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008c94: 35 00 80 58 sethi %hi(0x2016000), %i2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2008c98: 31 00 80 58 sethi %hi(0x2016000), %i0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c9c: ae 10 00 12 mov %l2, %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008ca0: b4 16 a1 a0 or %i2, 0x1a0, %i2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2008ca4: b0 16 21 88 or %i0, 0x188, %i0 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008ca8: 37 00 80 58 sethi %hi(0x2016000), %i3 - 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; 2008cac: ba 0f 3f fe and %i4, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008cb0: ac 07 40 17 add %i5, %l7, %l6 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; 2008cb4: 80 a0 40 16 cmp %g1, %l6 2008cb8: 28 80 00 0c bleu,a 2008ce8 <_Heap_Walk+0x390> <== ALWAYS TAKEN 2008cbc: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 2008cc0: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008cc4: 92 10 20 01 mov 1, %o1 2008cc8: 96 10 00 17 mov %l7, %o3 2008ccc: 15 00 80 58 sethi %hi(0x2016000), %o2 2008cd0: 98 10 00 16 mov %l6, %o4 2008cd4: 94 12 a0 18 or %o2, 0x18, %o2 2008cd8: 9f c4 40 00 call %l1 2008cdc: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2008ce0: 81 c7 e0 08 ret 2008ce4: 81 e8 00 00 restore 2008ce8: 80 a0 40 16 cmp %g1, %l6 2008cec: 0a bf ff f6 bcs 2008cc4 <_Heap_Walk+0x36c> 2008cf0: 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; 2008cf4: 82 1d c0 15 xor %l7, %l5, %g1 2008cf8: 80 a0 00 01 cmp %g0, %g1 2008cfc: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008d00: 90 10 00 1d mov %i5, %o0 2008d04: c2 27 bf fc st %g1, [ %fp + -4 ] 2008d08: 7f ff e3 6a call 2001ab0 <.urem> 2008d0c: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2008d10: 80 a2 20 00 cmp %o0, 0 2008d14: 02 80 00 05 be 2008d28 <_Heap_Walk+0x3d0> 2008d18: c2 07 bf fc ld [ %fp + -4 ], %g1 2008d1c: 80 88 60 ff btst 0xff, %g1 2008d20: 12 80 00 79 bne 2008f04 <_Heap_Walk+0x5ac> 2008d24: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008d28: 80 a4 c0 1d cmp %l3, %i5 2008d2c: 08 80 00 05 bleu 2008d40 <_Heap_Walk+0x3e8> 2008d30: 80 a5 c0 16 cmp %l7, %l6 2008d34: 80 88 60 ff btst 0xff, %g1 2008d38: 12 80 00 7c bne 2008f28 <_Heap_Walk+0x5d0> <== ALWAYS TAKEN 2008d3c: 80 a5 c0 16 cmp %l7, %l6 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2008d40: 2a 80 00 06 bcs,a 2008d58 <_Heap_Walk+0x400> 2008d44: c2 05 a0 04 ld [ %l6 + 4 ], %g1 2008d48: 80 88 60 ff btst 0xff, %g1 2008d4c: 12 80 00 82 bne 2008f54 <_Heap_Walk+0x5fc> 2008d50: 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; 2008d54: c2 05 a0 04 ld [ %l6 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008d58: 80 88 60 01 btst 1, %g1 2008d5c: 02 80 00 19 be 2008dc0 <_Heap_Walk+0x468> 2008d60: b8 0f 20 01 and %i4, 1, %i4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2008d64: 80 a7 20 00 cmp %i4, 0 2008d68: 22 80 00 0e be,a 2008da0 <_Heap_Walk+0x448> 2008d6c: da 05 c0 00 ld [ %l7 ], %o5 (*printer)( 2008d70: 90 10 00 19 mov %i1, %o0 2008d74: 92 10 20 00 clr %o1 2008d78: 94 10 00 18 mov %i0, %o2 2008d7c: 96 10 00 17 mov %l7, %o3 2008d80: 9f c4 40 00 call %l1 2008d84: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008d88: 80 a4 80 16 cmp %l2, %l6 2008d8c: 02 80 00 43 be 2008e98 <_Heap_Walk+0x540> 2008d90: ae 10 00 16 mov %l6, %l7 2008d94: f8 05 a0 04 ld [ %l6 + 4 ], %i4 2008d98: 10 bf ff c5 b 2008cac <_Heap_Walk+0x354> 2008d9c: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008da0: 96 10 00 17 mov %l7, %o3 2008da4: 90 10 00 19 mov %i1, %o0 2008da8: 92 10 20 00 clr %o1 2008dac: 94 10 00 1a mov %i2, %o2 2008db0: 9f c4 40 00 call %l1 2008db4: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008db8: 10 bf ff f5 b 2008d8c <_Heap_Walk+0x434> 2008dbc: 80 a4 80 16 cmp %l2, %l6 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 ? 2008dc0: da 05 e0 0c ld [ %l7 + 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)( 2008dc4: c2 04 20 08 ld [ %l0 + 8 ], %g1 2008dc8: 05 00 80 57 sethi %hi(0x2015c00), %g2 block = next_block; } while ( block != first_block ); return true; } 2008dcc: c8 04 20 0c ld [ %l0 + 0xc ], %g4 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)( 2008dd0: 80 a0 40 0d cmp %g1, %o5 2008dd4: 02 80 00 05 be 2008de8 <_Heap_Walk+0x490> 2008dd8: 86 10 a1 88 or %g2, 0x188, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008ddc: 80 a4 00 0d cmp %l0, %o5 2008de0: 02 80 00 3e be 2008ed8 <_Heap_Walk+0x580> 2008de4: 86 16 e1 50 or %i3, 0x150, %g3 block->next, block->next == last_free_block ? 2008de8: c2 05 e0 08 ld [ %l7 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008dec: 19 00 80 57 sethi %hi(0x2015c00), %o4 2008df0: 80 a1 00 01 cmp %g4, %g1 2008df4: 02 80 00 05 be 2008e08 <_Heap_Walk+0x4b0> 2008df8: 84 13 21 a8 or %o4, 0x1a8, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008dfc: 80 a4 00 01 cmp %l0, %g1 2008e00: 02 80 00 33 be 2008ecc <_Heap_Walk+0x574> 2008e04: 84 16 e1 50 or %i3, 0x150, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008e08: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008e0c: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008e10: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008e14: 90 10 00 19 mov %i1, %o0 2008e18: 92 10 20 00 clr %o1 2008e1c: 15 00 80 58 sethi %hi(0x2016000), %o2 2008e20: 96 10 00 17 mov %l7, %o3 2008e24: 94 12 a0 e0 or %o2, 0xe0, %o2 2008e28: 9f c4 40 00 call %l1 2008e2c: 98 10 00 1d mov %i5, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2008e30: da 05 80 00 ld [ %l6 ], %o5 2008e34: 80 a7 40 0d cmp %i5, %o5 2008e38: 12 80 00 1a bne 2008ea0 <_Heap_Walk+0x548> 2008e3c: 80 a7 20 00 cmp %i4, 0 ); return false; } if ( !prev_used ) { 2008e40: 02 80 00 29 be 2008ee4 <_Heap_Walk+0x58c> 2008e44: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 2008e48: c2 04 20 08 ld [ %l0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008e4c: 80 a4 00 01 cmp %l0, %g1 2008e50: 02 80 00 0b be 2008e7c <_Heap_Walk+0x524> <== NEVER TAKEN 2008e54: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008e58: 80 a5 c0 01 cmp %l7, %g1 2008e5c: 02 bf ff cc be 2008d8c <_Heap_Walk+0x434> 2008e60: 80 a4 80 16 cmp %l2, %l6 return true; } free_block = free_block->next; 2008e64: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008e68: 80 a4 00 01 cmp %l0, %g1 2008e6c: 12 bf ff fc bne 2008e5c <_Heap_Walk+0x504> 2008e70: 80 a5 c0 01 cmp %l7, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008e74: 90 10 00 19 mov %i1, %o0 2008e78: 92 10 20 01 mov 1, %o1 2008e7c: 96 10 00 17 mov %l7, %o3 2008e80: 15 00 80 58 sethi %hi(0x2016000), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008e84: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008e88: 9f c4 40 00 call %l1 2008e8c: 94 12 a1 c8 or %o2, 0x1c8, %o2 2008e90: 81 c7 e0 08 ret 2008e94: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 2008e98: 81 c7 e0 08 ret 2008e9c: 91 e8 20 01 restore %g0, 1, %o0 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008ea0: ec 23 a0 5c st %l6, [ %sp + 0x5c ] 2008ea4: 90 10 00 19 mov %i1, %o0 2008ea8: 92 10 20 01 mov 1, %o1 2008eac: 96 10 00 17 mov %l7, %o3 2008eb0: 15 00 80 58 sethi %hi(0x2016000), %o2 2008eb4: 98 10 00 1d mov %i5, %o4 2008eb8: 94 12 a1 18 or %o2, 0x118, %o2 2008ebc: 9f c4 40 00 call %l1 2008ec0: b0 10 20 00 clr %i0 2008ec4: 81 c7 e0 08 ret 2008ec8: 81 e8 00 00 restore " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008ecc: 09 00 80 57 sethi %hi(0x2015c00), %g4 2008ed0: 10 bf ff ce b 2008e08 <_Heap_Walk+0x4b0> 2008ed4: 84 11 21 b8 or %g4, 0x1b8, %g2 ! 2015db8 <_Status_Object_name_errors_to_status+0x68> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008ed8: 19 00 80 57 sethi %hi(0x2015c00), %o4 2008edc: 10 bf ff c3 b 2008de8 <_Heap_Walk+0x490> 2008ee0: 86 13 21 98 or %o4, 0x198, %g3 ! 2015d98 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008ee4: 92 10 20 01 mov 1, %o1 2008ee8: 96 10 00 17 mov %l7, %o3 2008eec: 15 00 80 58 sethi %hi(0x2016000), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008ef0: b0 10 20 00 clr %i0 return false; } if ( !prev_used ) { (*printer)( 2008ef4: 9f c4 40 00 call %l1 2008ef8: 94 12 a1 58 or %o2, 0x158, %o2 2008efc: 81 c7 e0 08 ret 2008f00: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008f04: 92 10 20 01 mov 1, %o1 2008f08: 96 10 00 17 mov %l7, %o3 2008f0c: 15 00 80 58 sethi %hi(0x2016000), %o2 2008f10: 98 10 00 1d mov %i5, %o4 2008f14: 94 12 a0 48 or %o2, 0x48, %o2 2008f18: 9f c4 40 00 call %l1 2008f1c: b0 10 20 00 clr %i0 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008f20: 81 c7 e0 08 ret 2008f24: 81 e8 00 00 restore } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008f28: 90 10 00 19 mov %i1, %o0 2008f2c: 92 10 20 01 mov 1, %o1 2008f30: 96 10 00 17 mov %l7, %o3 2008f34: 15 00 80 58 sethi %hi(0x2016000), %o2 2008f38: 98 10 00 1d mov %i5, %o4 2008f3c: 94 12 a0 78 or %o2, 0x78, %o2 2008f40: 9a 10 00 13 mov %l3, %o5 2008f44: 9f c4 40 00 call %l1 2008f48: b0 10 20 00 clr %i0 block, block_size, min_block_size ); return false; 2008f4c: 81 c7 e0 08 ret 2008f50: 81 e8 00 00 restore } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008f54: 92 10 20 01 mov 1, %o1 2008f58: 96 10 00 17 mov %l7, %o3 2008f5c: 15 00 80 58 sethi %hi(0x2016000), %o2 2008f60: 98 10 00 16 mov %l6, %o4 2008f64: 94 12 a0 a8 or %o2, 0xa8, %o2 2008f68: 9f c4 40 00 call %l1 2008f6c: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008f70: 81 c7 e0 08 ret 2008f74: 81 e8 00 00 restore 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 ) { 2008f78: 10 bf ff 47 b 2008c94 <_Heap_Walk+0x33c> 2008f7c: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 =============================================================================== 02006e4c <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2006e4c: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2006e50: 23 00 80 58 sethi %hi(0x2016000), %l1 2006e54: c2 04 61 c4 ld [ %l1 + 0x1c4 ], %g1 ! 20161c4 <_IO_Number_of_drivers> 2006e58: 80 a0 60 00 cmp %g1, 0 2006e5c: 02 80 00 0c be 2006e8c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2006e60: a0 10 20 00 clr %l0 2006e64: a2 14 61 c4 or %l1, 0x1c4, %l1 (void) rtems_io_initialize( major, 0, NULL ); 2006e68: 90 10 00 10 mov %l0, %o0 2006e6c: 92 10 20 00 clr %o1 2006e70: 40 00 15 8e call 200c4a8 2006e74: 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 ++ ) 2006e78: c2 04 40 00 ld [ %l1 ], %g1 2006e7c: a0 04 20 01 inc %l0 2006e80: 80 a0 40 10 cmp %g1, %l0 2006e84: 18 bf ff fa bgu 2006e6c <_IO_Initialize_all_drivers+0x20> 2006e88: 90 10 00 10 mov %l0, %o0 2006e8c: 81 c7 e0 08 ret 2006e90: 81 e8 00 00 restore =============================================================================== 02006d80 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2006d80: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 2006d84: 03 00 80 54 sethi %hi(0x2015000), %g1 2006d88: 82 10 63 08 or %g1, 0x308, %g1 ! 2015308 drivers_in_table = Configuration.number_of_device_drivers; 2006d8c: e2 00 60 34 ld [ %g1 + 0x34 ], %l1 number_of_drivers = Configuration.maximum_drivers; 2006d90: e8 00 60 30 ld [ %g1 + 0x30 ], %l4 /* * 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 ) 2006d94: 80 a4 40 14 cmp %l1, %l4 2006d98: 0a 80 00 08 bcs 2006db8 <_IO_Manager_initialization+0x38> 2006d9c: e0 00 60 38 ld [ %g1 + 0x38 ], %l0 * 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; 2006da0: 03 00 80 58 sethi %hi(0x2016000), %g1 2006da4: e0 20 61 c8 st %l0, [ %g1 + 0x1c8 ] ! 20161c8 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2006da8: 03 00 80 58 sethi %hi(0x2016000), %g1 2006dac: e2 20 61 c4 st %l1, [ %g1 + 0x1c4 ] ! 20161c4 <_IO_Number_of_drivers> return; 2006db0: 81 c7 e0 08 ret 2006db4: 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 ) 2006db8: 83 2d 20 03 sll %l4, 3, %g1 2006dbc: a7 2d 20 05 sll %l4, 5, %l3 2006dc0: a6 24 c0 01 sub %l3, %g1, %l3 * 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( 2006dc4: 40 00 0c fb call 200a1b0 <_Workspace_Allocate_or_fatal_error> 2006dc8: 90 10 00 13 mov %l3, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2006dcc: 03 00 80 58 sethi %hi(0x2016000), %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 *) 2006dd0: 25 00 80 58 sethi %hi(0x2016000), %l2 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2006dd4: e8 20 61 c4 st %l4, [ %g1 + 0x1c4 ] /* * 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 *) 2006dd8: d0 24 a1 c8 st %o0, [ %l2 + 0x1c8 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2006ddc: 92 10 20 00 clr %o1 2006de0: 40 00 21 78 call 200f3c0 2006de4: 94 10 00 13 mov %l3, %o2 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2006de8: 80 a4 60 00 cmp %l1, 0 2006dec: 02 bf ff f1 be 2006db0 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2006df0: da 04 a1 c8 ld [ %l2 + 0x1c8 ], %o5 2006df4: 82 10 20 00 clr %g1 2006df8: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 2006dfc: c4 04 00 01 ld [ %l0 + %g1 ], %g2 2006e00: 86 04 00 01 add %l0, %g1, %g3 2006e04: c4 23 40 01 st %g2, [ %o5 + %g1 ] 2006e08: d8 00 e0 04 ld [ %g3 + 4 ], %o4 2006e0c: 84 03 40 01 add %o5, %g1, %g2 2006e10: d8 20 a0 04 st %o4, [ %g2 + 4 ] 2006e14: d8 00 e0 08 ld [ %g3 + 8 ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2006e18: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 2006e1c: d8 20 a0 08 st %o4, [ %g2 + 8 ] 2006e20: d8 00 e0 0c ld [ %g3 + 0xc ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2006e24: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 2006e28: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 2006e2c: d8 00 e0 10 ld [ %g3 + 0x10 ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2006e30: 80 a4 40 04 cmp %l1, %g4 _IO_Driver_address_table[index] = driver_table[index]; 2006e34: d8 20 a0 10 st %o4, [ %g2 + 0x10 ] 2006e38: 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++ ) 2006e3c: 18 bf ff f0 bgu 2006dfc <_IO_Manager_initialization+0x7c> 2006e40: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2006e44: 81 c7 e0 08 ret 2006e48: 81 e8 00 00 restore =============================================================================== 02007b78 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007b78: 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 ) 2007b7c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007b80: a0 10 00 18 mov %i0, %l0 * 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 ) 2007b84: 80 a0 60 00 cmp %g1, 0 2007b88: 02 80 00 19 be 2007bec <_Objects_Allocate+0x74> <== NEVER TAKEN 2007b8c: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007b90: a2 04 20 20 add %l0, 0x20, %l1 2007b94: 7f ff fd 5c call 2007104 <_Chain_Get> 2007b98: 90 10 00 11 mov %l1, %o0 if ( information->auto_extend ) { 2007b9c: c2 0c 20 12 ldub [ %l0 + 0x12 ], %g1 2007ba0: 80 a0 60 00 cmp %g1, 0 2007ba4: 02 80 00 12 be 2007bec <_Objects_Allocate+0x74> 2007ba8: 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 ) { 2007bac: 80 a2 20 00 cmp %o0, 0 2007bb0: 02 80 00 11 be 2007bf4 <_Objects_Allocate+0x7c> 2007bb4: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007bb8: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 2007bbc: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007bc0: d2 14 20 14 lduh [ %l0 + 0x14 ], %o1 2007bc4: 40 00 29 b8 call 20122a4 <.udiv> 2007bc8: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007bcc: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 2007bd0: 91 2a 20 02 sll %o0, 2, %o0 2007bd4: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007bd8: c4 14 20 2c lduh [ %l0 + 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 ]--; 2007bdc: 86 00 ff ff add %g3, -1, %g3 2007be0: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007be4: 82 00 bf ff add %g2, -1, %g1 2007be8: c2 34 20 2c sth %g1, [ %l0 + 0x2c ] ); } #endif return the_object; } 2007bec: 81 c7 e0 08 ret 2007bf0: 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 ); 2007bf4: 40 00 00 11 call 2007c38 <_Objects_Extend_information> 2007bf8: 90 10 00 10 mov %l0, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007bfc: 7f ff fd 42 call 2007104 <_Chain_Get> 2007c00: 90 10 00 11 mov %l1, %o0 } if ( the_object ) { 2007c04: b0 92 20 00 orcc %o0, 0, %i0 2007c08: 32 bf ff ed bne,a 2007bbc <_Objects_Allocate+0x44> 2007c0c: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 ); } #endif return the_object; } 2007c10: 81 c7 e0 08 ret 2007c14: 81 e8 00 00 restore =============================================================================== 02007c38 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007c38: 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 ) 2007c3c: e8 06 20 34 ld [ %i0 + 0x34 ], %l4 2007c40: 80 a5 20 00 cmp %l4, 0 2007c44: 02 80 00 a6 be 2007edc <_Objects_Extend_information+0x2a4> 2007c48: e4 16 20 0a lduh [ %i0 + 0xa ], %l2 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007c4c: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 2007c50: e6 16 20 14 lduh [ %i0 + 0x14 ], %l3 2007c54: ab 2d 60 10 sll %l5, 0x10, %l5 2007c58: 92 10 00 13 mov %l3, %o1 2007c5c: 40 00 29 92 call 20122a4 <.udiv> 2007c60: 91 35 60 10 srl %l5, 0x10, %o0 2007c64: bb 2a 20 10 sll %o0, 0x10, %i5 2007c68: bb 37 60 10 srl %i5, 0x10, %i5 for ( ; block < block_count; block++ ) { 2007c6c: 80 a7 60 00 cmp %i5, 0 2007c70: 02 80 00 a3 be 2007efc <_Objects_Extend_information+0x2c4><== NEVER TAKEN 2007c74: 90 10 00 13 mov %l3, %o0 if ( information->object_blocks[ block ] == NULL ) { 2007c78: c2 05 00 00 ld [ %l4 ], %g1 2007c7c: 80 a0 60 00 cmp %g1, 0 2007c80: 02 80 00 a3 be 2007f0c <_Objects_Extend_information+0x2d4><== NEVER TAKEN 2007c84: a2 10 00 12 mov %l2, %l1 * 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; 2007c88: 10 80 00 06 b 2007ca0 <_Objects_Extend_information+0x68> 2007c8c: a0 10 20 00 clr %l0 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2007c90: c2 05 00 01 ld [ %l4 + %g1 ], %g1 2007c94: 80 a0 60 00 cmp %g1, 0 2007c98: 22 80 00 08 be,a 2007cb8 <_Objects_Extend_information+0x80> 2007c9c: a8 10 20 00 clr %l4 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007ca0: a0 04 20 01 inc %l0 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007ca4: a2 04 40 13 add %l1, %l3, %l1 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007ca8: 80 a7 40 10 cmp %i5, %l0 2007cac: 18 bf ff f9 bgu 2007c90 <_Objects_Extend_information+0x58> 2007cb0: 83 2c 20 02 sll %l0, 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; 2007cb4: a8 10 20 01 mov 1, %l4 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007cb8: ab 35 60 10 srl %l5, 0x10, %l5 /* * 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 ) { 2007cbc: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007cc0: aa 05 40 08 add %l5, %o0, %l5 /* * 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 ) { 2007cc4: 82 10 63 ff or %g1, 0x3ff, %g1 2007cc8: 80 a5 40 01 cmp %l5, %g1 2007ccc: 18 80 00 95 bgu 2007f20 <_Objects_Extend_information+0x2e8> 2007cd0: 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; 2007cd4: 40 00 29 3a call 20121bc <.umul> 2007cd8: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007cdc: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007ce0: 80 a0 60 00 cmp %g1, 0 2007ce4: 02 80 00 6a be 2007e8c <_Objects_Extend_information+0x254> 2007ce8: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007cec: 40 00 09 1e call 200a164 <_Workspace_Allocate> 2007cf0: 01 00 00 00 nop if ( !new_object_block ) 2007cf4: a6 92 20 00 orcc %o0, 0, %l3 2007cf8: 02 80 00 8a be 2007f20 <_Objects_Extend_information+0x2e8> 2007cfc: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2007d00: 80 8d 20 ff btst 0xff, %l4 2007d04: 22 80 00 3f be,a 2007e00 <_Objects_Extend_information+0x1c8> 2007d08: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007d0c: a8 07 60 01 add %i5, 1, %l4 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007d10: 91 2d 20 01 sll %l4, 1, %o0 2007d14: 90 02 00 14 add %o0, %l4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2007d18: 90 05 40 08 add %l5, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007d1c: 90 02 00 12 add %o0, %l2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007d20: 40 00 09 11 call 200a164 <_Workspace_Allocate> 2007d24: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2007d28: ac 92 20 00 orcc %o0, 0, %l6 2007d2c: 02 80 00 7b be 2007f18 <_Objects_Extend_information+0x2e0> 2007d30: a9 2d 20 02 sll %l4, 2, %l4 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2007d34: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007d38: 80 a4 80 01 cmp %l2, %g1 2007d3c: ae 05 80 14 add %l6, %l4, %l7 2007d40: 0a 80 00 57 bcs 2007e9c <_Objects_Extend_information+0x264> 2007d44: a8 05 c0 14 add %l7, %l4, %l4 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2007d48: 80 a4 a0 00 cmp %l2, 0 2007d4c: 02 80 00 07 be 2007d68 <_Objects_Extend_information+0x130><== NEVER TAKEN 2007d50: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007d54: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2007d58: 82 00 60 01 inc %g1 2007d5c: 80 a4 80 01 cmp %l2, %g1 2007d60: 18 bf ff fd bgu 2007d54 <_Objects_Extend_information+0x11c><== NEVER TAKEN 2007d64: c0 20 80 14 clr [ %g2 + %l4 ] 2007d68: bb 2f 60 02 sll %i5, 2, %i5 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007d6c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2007d70: c0 25 80 1d clr [ %l6 + %i5 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007d74: 86 04 40 03 add %l1, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007d78: 80 a4 40 03 cmp %l1, %g3 2007d7c: 1a 80 00 0a bcc 2007da4 <_Objects_Extend_information+0x16c><== NEVER TAKEN 2007d80: c0 25 c0 1d clr [ %l7 + %i5 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2007d84: 83 2c 60 02 sll %l1, 2, %g1 2007d88: 84 10 00 11 mov %l1, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007d8c: 82 05 00 01 add %l4, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2007d90: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 2007d94: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007d98: 80 a0 80 03 cmp %g2, %g3 2007d9c: 0a bf ff fd bcs 2007d90 <_Objects_Extend_information+0x158> 2007da0: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2007da4: 7f ff e9 41 call 20022a8 2007da8: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2007dac: 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( 2007db0: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2007db4: e4 06 20 34 ld [ %i0 + 0x34 ], %l2 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2007db8: ea 36 20 10 sth %l5, [ %i0 + 0x10 ] 2007dbc: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007dc0: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2007dc4: ec 26 20 34 st %l6, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2007dc8: ee 26 20 30 st %l7, [ %i0 + 0x30 ] information->local_table = local_table; 2007dcc: e8 26 20 1c st %l4, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007dd0: ab 2d 60 10 sll %l5, 0x10, %l5 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2007dd4: 03 00 00 40 sethi %hi(0x10000), %g1 2007dd8: ab 35 60 10 srl %l5, 0x10, %l5 2007ddc: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007de0: 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) | 2007de4: 82 10 40 15 or %g1, %l5, %g1 2007de8: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2007dec: 7f ff e9 33 call 20022b8 2007df0: 01 00 00 00 nop _Workspace_Free( old_tables ); 2007df4: 40 00 08 e5 call 200a188 <_Workspace_Free> 2007df8: 90 10 00 12 mov %l2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007dfc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007e00: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2007e04: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2007e08: 92 10 00 13 mov %l3, %o1 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007e0c: a1 2c 20 02 sll %l0, 2, %l0 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007e10: a4 07 bf f4 add %fp, -12, %l2 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007e14: e6 20 40 10 st %l3, [ %g1 + %l0 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007e18: 90 10 00 12 mov %l2, %o0 2007e1c: 40 00 11 ba call 200c504 <_Chain_Initialize> 2007e20: 29 00 00 40 sethi %hi(0x10000), %l4 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2007e24: 10 80 00 0d b 2007e58 <_Objects_Extend_information+0x220> 2007e28: a6 06 20 20 add %i0, 0x20, %l3 the_object->id = _Objects_Build_id( 2007e2c: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2007e30: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007e34: 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) | 2007e38: 84 10 80 14 or %g2, %l4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2007e3c: 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) | 2007e40: 84 10 80 11 or %g2, %l1, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007e44: 90 10 00 13 mov %l3, %o0 2007e48: 92 10 00 01 mov %g1, %o1 index++; 2007e4c: a2 04 60 01 inc %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007e50: 7f ff fc 97 call 20070ac <_Chain_Append> 2007e54: 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 ) { 2007e58: 7f ff fc ab call 2007104 <_Chain_Get> 2007e5c: 90 10 00 12 mov %l2, %o0 2007e60: 82 92 20 00 orcc %o0, 0, %g1 2007e64: 32 bf ff f2 bne,a 2007e2c <_Objects_Extend_information+0x1f4> 2007e68: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007e6c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2007e70: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2007e74: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007e78: c8 20 c0 10 st %g4, [ %g3 + %l0 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2007e7c: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2007e80: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2007e84: 81 c7 e0 08 ret 2007e88: 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 ); 2007e8c: 40 00 08 c9 call 200a1b0 <_Workspace_Allocate_or_fatal_error> 2007e90: 01 00 00 00 nop 2007e94: 10 bf ff 9b b 2007d00 <_Objects_Extend_information+0xc8> 2007e98: a6 10 00 08 mov %o0, %l3 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2007e9c: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2007ea0: bb 2f 60 02 sll %i5, 2, %i5 /* * 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, 2007ea4: 40 00 1d 0e call 200f2dc 2007ea8: 94 10 00 1d mov %i5, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2007eac: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2007eb0: 94 10 00 1d mov %i5, %o2 2007eb4: 40 00 1d 0a call 200f2dc 2007eb8: 90 10 00 17 mov %l7, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2007ebc: 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, 2007ec0: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2007ec4: 94 04 80 0a add %l2, %o2, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2007ec8: 90 10 00 14 mov %l4, %o0 2007ecc: 40 00 1d 04 call 200f2dc 2007ed0: 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 ); 2007ed4: 10 bf ff a7 b 2007d70 <_Objects_Extend_information+0x138> 2007ed8: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007edc: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 2007ee0: 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 ); 2007ee4: a2 10 00 12 mov %l2, %l1 /* * 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; 2007ee8: a8 10 20 01 mov 1, %l4 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2007eec: a0 10 20 00 clr %l0 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2007ef0: ba 10 20 00 clr %i5 2007ef4: 10 bf ff 71 b 2007cb8 <_Objects_Extend_information+0x80> 2007ef8: ab 2d 60 10 sll %l5, 0x10, %l5 /* * 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 ); 2007efc: a2 10 00 12 mov %l2, %l1 <== 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; 2007f00: a8 10 20 01 mov 1, %l4 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2007f04: 10 bf ff 6d b 2007cb8 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2007f08: a0 10 20 00 clr %l0 <== NOT EXECUTED else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 2007f0c: a8 10 20 00 clr %l4 <== 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; 2007f10: 10 bf ff 6a b 2007cb8 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2007f14: a0 10 20 00 clr %l0 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 2007f18: 40 00 08 9c call 200a188 <_Workspace_Free> 2007f1c: 90 10 00 13 mov %l3, %o0 return; 2007f20: 81 c7 e0 08 ret 2007f24: 81 e8 00 00 restore =============================================================================== 02007fd4 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2007fd4: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007fd8: b3 2e 60 10 sll %i1, 0x10, %i1 2007fdc: b3 36 60 10 srl %i1, 0x10, %i1 2007fe0: 80 a6 60 00 cmp %i1, 0 2007fe4: 12 80 00 04 bne 2007ff4 <_Objects_Get_information+0x20> 2007fe8: a0 10 20 00 clr %l0 if ( info->maximum == 0 ) return NULL; #endif return info; } 2007fec: 81 c7 e0 08 ret 2007ff0: 91 e8 00 10 restore %g0, %l0, %o0 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 2007ff4: 40 00 12 c6 call 200cb0c <_Objects_API_maximum_class> 2007ff8: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007ffc: 80 a2 20 00 cmp %o0, 0 2008000: 02 bf ff fb be 2007fec <_Objects_Get_information+0x18> 2008004: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2008008: 0a bf ff f9 bcs 2007fec <_Objects_Get_information+0x18> 200800c: 03 00 80 57 sethi %hi(0x2015c00), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2008010: b1 2e 20 02 sll %i0, 2, %i0 2008014: 82 10 62 48 or %g1, 0x248, %g1 2008018: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200801c: 80 a0 60 00 cmp %g1, 0 2008020: 02 bf ff f3 be 2007fec <_Objects_Get_information+0x18> <== NEVER TAKEN 2008024: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2008028: e0 00 40 19 ld [ %g1 + %i1 ], %l0 if ( !info ) 200802c: 80 a4 20 00 cmp %l0, 0 2008030: 02 bf ff ef be 2007fec <_Objects_Get_information+0x18> <== NEVER TAKEN 2008034: 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 ) 2008038: c2 14 20 10 lduh [ %l0 + 0x10 ], %g1 return NULL; 200803c: 80 a0 00 01 cmp %g0, %g1 2008040: 82 60 20 00 subx %g0, 0, %g1 2008044: 10 bf ff ea b 2007fec <_Objects_Get_information+0x18> 2008048: a0 0c 00 01 and %l0, %g1, %l0 =============================================================================== 02009d84 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009d84: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009d88: 80 a6 60 00 cmp %i1, 0 2009d8c: 12 80 00 05 bne 2009da0 <_Objects_Get_name_as_string+0x1c> 2009d90: 80 a6 a0 00 cmp %i2, 0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009d94: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009d98: 81 c7 e0 08 ret 2009d9c: 91 e8 00 1a restore %g0, %i2, %o0 Objects_Id tmpId; if ( length == 0 ) return NULL; if ( name == NULL ) 2009da0: 02 bf ff fe be 2009d98 <_Objects_Get_name_as_string+0x14> 2009da4: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009da8: 12 80 00 04 bne 2009db8 <_Objects_Get_name_as_string+0x34> 2009dac: 03 00 80 7e sethi %hi(0x201f800), %g1 2009db0: c2 00 60 08 ld [ %g1 + 8 ], %g1 ! 201f808 <_Per_CPU_Information+0xc> 2009db4: f0 00 60 08 ld [ %g1 + 8 ], %i0 information = _Objects_Get_information_id( tmpId ); 2009db8: 7f ff ff b1 call 2009c7c <_Objects_Get_information_id> 2009dbc: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009dc0: 80 a2 20 00 cmp %o0, 0 2009dc4: 22 bf ff f5 be,a 2009d98 <_Objects_Get_name_as_string+0x14> 2009dc8: b4 10 20 00 clr %i2 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009dcc: 92 10 00 18 mov %i0, %o1 2009dd0: 40 00 00 2c call 2009e80 <_Objects_Get> 2009dd4: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009dd8: c2 07 bf fc ld [ %fp + -4 ], %g1 2009ddc: 80 a0 60 00 cmp %g1, 0 2009de0: 32 bf ff ee bne,a 2009d98 <_Objects_Get_name_as_string+0x14> 2009de4: 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; 2009de8: 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'; 2009dec: c0 2f bf f4 clrb [ %fp + -12 ] { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 2009df0: 85 30 60 08 srl %g1, 8, %g2 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009df4: 87 30 60 18 srl %g1, 0x18, %g3 lname[ 1 ] = (u32_name >> 16) & 0xff; 2009df8: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009dfc: c4 2f bf f2 stb %g2, [ %fp + -14 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009e00: c6 2f bf f0 stb %g3, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009e04: c8 2f bf f1 stb %g4, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 2009e08: c2 2f bf f3 stb %g1, [ %fp + -13 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009e0c: b2 86 7f ff addcc %i1, -1, %i1 2009e10: 02 80 00 19 be 2009e74 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 2009e14: 84 10 00 1a mov %i2, %g2 2009e18: 80 a0 e0 00 cmp %g3, 0 2009e1c: 02 80 00 16 be 2009e74 <_Objects_Get_name_as_string+0xf0> 2009e20: 19 00 80 7a sethi %hi(0x201e800), %o4 2009e24: 82 10 20 00 clr %g1 2009e28: 10 80 00 06 b 2009e40 <_Objects_Get_name_as_string+0xbc> 2009e2c: 98 13 20 3c or %o4, 0x3c, %o4 2009e30: da 49 00 01 ldsb [ %g4 + %g1 ], %o5 2009e34: 80 a3 60 00 cmp %o5, 0 2009e38: 02 80 00 0f be 2009e74 <_Objects_Get_name_as_string+0xf0> 2009e3c: c6 09 00 01 ldub [ %g4 + %g1 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009e40: da 03 00 00 ld [ %o4 ], %o5 2009e44: 88 08 e0 ff and %g3, 0xff, %g4 2009e48: 88 03 40 04 add %o5, %g4, %g4 2009e4c: da 49 20 01 ldsb [ %g4 + 1 ], %o5 2009e50: 80 8b 60 97 btst 0x97, %o5 2009e54: 12 80 00 03 bne 2009e60 <_Objects_Get_name_as_string+0xdc> 2009e58: 88 07 bf f0 add %fp, -16, %g4 2009e5c: 86 10 20 2a mov 0x2a, %g3 2009e60: c6 28 80 00 stb %g3, [ %g2 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009e64: 82 00 60 01 inc %g1 2009e68: 80 a0 40 19 cmp %g1, %i1 2009e6c: 0a bf ff f1 bcs 2009e30 <_Objects_Get_name_as_string+0xac> 2009e70: 84 00 a0 01 inc %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009e74: 40 00 03 20 call 200aaf4 <_Thread_Enable_dispatch> 2009e78: c0 28 80 00 clrb [ %g2 ] return name; 2009e7c: 30 bf ff c7 b,a 2009d98 <_Objects_Get_name_as_string+0x14> =============================================================================== 02019378 <_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; 2019378: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 201937c: 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; 2019380: 84 22 40 02 sub %o1, %g2, %g2 2019384: 84 00 a0 01 inc %g2 if ( information->maximum >= index ) { 2019388: 80 a0 80 01 cmp %g2, %g1 201938c: 18 80 00 09 bgu 20193b0 <_Objects_Get_no_protection+0x38> 2019390: 85 28 a0 02 sll %g2, 2, %g2 if ( (the_object = information->local_table[ index ]) != NULL ) { 2019394: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 2019398: d0 00 40 02 ld [ %g1 + %g2 ], %o0 201939c: 80 a2 20 00 cmp %o0, 0 20193a0: 02 80 00 05 be 20193b4 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 20193a4: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 20193a8: 81 c3 e0 08 retl 20193ac: 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; 20193b0: 82 10 20 01 mov 1, %g1 return NULL; 20193b4: 90 10 20 00 clr %o0 } 20193b8: 81 c3 e0 08 retl 20193bc: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 02009878 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2009878: 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; 200987c: 80 a6 20 00 cmp %i0, 0 2009880: 12 80 00 06 bne 2009898 <_Objects_Id_to_name+0x20> 2009884: 83 36 20 18 srl %i0, 0x18, %g1 2009888: 03 00 80 79 sethi %hi(0x201e400), %g1 200988c: c2 00 60 c8 ld [ %g1 + 0xc8 ], %g1 ! 201e4c8 <_Per_CPU_Information+0xc> 2009890: f0 00 60 08 ld [ %g1 + 8 ], %i0 2009894: 83 36 20 18 srl %i0, 0x18, %g1 2009898: 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 ) 200989c: 84 00 7f ff add %g1, -1, %g2 20098a0: 80 a0 a0 02 cmp %g2, 2 20098a4: 18 80 00 17 bgu 2009900 <_Objects_Id_to_name+0x88> 20098a8: a0 10 20 03 mov 3, %l0 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 20098ac: 83 28 60 02 sll %g1, 2, %g1 20098b0: 05 00 80 78 sethi %hi(0x201e000), %g2 20098b4: 84 10 a1 d8 or %g2, 0x1d8, %g2 ! 201e1d8 <_Objects_Information_table> 20098b8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 20098bc: 80 a0 60 00 cmp %g1, 0 20098c0: 02 80 00 10 be 2009900 <_Objects_Id_to_name+0x88> 20098c4: 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 ]; 20098c8: 85 28 a0 02 sll %g2, 2, %g2 20098cc: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 20098d0: 80 a2 20 00 cmp %o0, 0 20098d4: 02 80 00 0b be 2009900 <_Objects_Id_to_name+0x88> <== NEVER TAKEN 20098d8: 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 ); 20098dc: 7f ff ff ca call 2009804 <_Objects_Get> 20098e0: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 20098e4: 80 a2 20 00 cmp %o0, 0 20098e8: 02 80 00 06 be 2009900 <_Objects_Id_to_name+0x88> 20098ec: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 20098f0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 20098f4: a0 10 20 00 clr %l0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 20098f8: 40 00 03 30 call 200a5b8 <_Thread_Enable_dispatch> 20098fc: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2009900: 81 c7 e0 08 ret 2009904: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 02008134 <_Objects_Initialize_information>: , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 2008134: 9d e3 bf a0 save %sp, -96, %sp information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 2008138: 05 00 80 57 sethi %hi(0x2015c00), %g2 200813c: 83 2e 60 02 sll %i1, 2, %g1 2008140: 84 10 a2 48 or %g2, 0x248, %g2 2008144: c2 00 80 01 ld [ %g2 + %g1 ], %g1 #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; 2008148: f4 36 20 04 sth %i2, [ %i0 + 4 ] uint32_t maximum_per_allocation; #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; 200814c: f2 26 00 00 st %i1, [ %i0 ] information->the_class = the_class; information->size = size; 2008150: 85 2f 20 10 sll %i4, 0x10, %g2 information->local_table = 0; 2008154: c0 26 20 1c clr [ %i0 + 0x1c ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 2008158: 85 30 a0 10 srl %g2, 0x10, %g2 information->local_table = 0; information->inactive_per_block = 0; 200815c: c0 26 20 30 clr [ %i0 + 0x30 ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 2008160: c4 26 20 18 st %g2, [ %i0 + 0x18 ] information->local_table = 0; information->inactive_per_block = 0; information->object_blocks = 0; 2008164: c0 26 20 34 clr [ %i0 + 0x34 ] information->inactive = 0; 2008168: c0 36 20 2c clrh [ %i0 + 0x2c ] /* * Set the maximum value to 0. It will be updated when objects are * added to the inactive set from _Objects_Extend_information() */ information->maximum = 0; 200816c: c0 36 20 10 clrh [ %i0 + 0x10 ] , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 2008170: c6 07 a0 5c ld [ %fp + 0x5c ], %g3 information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 2008174: b5 2e a0 10 sll %i2, 0x10, %i2 2008178: b5 36 a0 10 srl %i2, 0x10, %i2 200817c: 85 2e a0 02 sll %i2, 2, %g2 2008180: f0 20 40 02 st %i0, [ %g1 + %g2 ] /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; 2008184: 83 36 e0 1f srl %i3, 0x1f, %g1 _Objects_Information_table[ the_api ][ the_class ] = information; /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = 2008188: c2 2e 20 12 stb %g1, [ %i0 + 0x12 ] maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 200818c: 80 a0 60 00 cmp %g1, 0 /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 2008190: 03 20 00 00 sethi %hi(0x80000000), %g1 /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 2008194: 02 80 00 05 be 20081a8 <_Objects_Initialize_information+0x74> 2008198: b6 2e c0 01 andn %i3, %g1, %i3 200819c: 80 a6 e0 00 cmp %i3, 0 20081a0: 02 80 00 27 be 200823c <_Objects_Initialize_information+0x108> 20081a4: 90 10 20 00 clr %o0 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20081a8: 05 00 00 40 sethi %hi(0x10000), %g2 information->local_table = &null_local_table; /* * Calculate minimum and maximum Id's */ minimum_index = (maximum_per_allocation == 0) ? 0 : 1; 20081ac: 80 a0 00 1b cmp %g0, %i3 20081b0: b3 2e 60 18 sll %i1, 0x18, %i1 20081b4: 82 40 20 00 addx %g0, 0, %g1 20081b8: b2 16 40 02 or %i1, %g2, %i1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20081bc: b5 2e a0 1b sll %i2, 0x1b, %i2 information->allocation_size = maximum_per_allocation; /* * Provide a null local table entry for the case of any empty table. */ information->local_table = &null_local_table; 20081c0: 05 00 80 56 sethi %hi(0x2015800), %g2 20081c4: b4 16 40 1a or %i1, %i2, %i2 20081c8: 84 10 a3 94 or %g2, 0x394, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20081cc: b4 16 80 01 or %i2, %g1, %i2 } /* * The allocation unit is the maximum value */ information->allocation_size = maximum_per_allocation; 20081d0: f6 36 20 14 sth %i3, [ %i0 + 0x14 ] /* * Provide a null local table entry for the case of any empty table. */ information->local_table = &null_local_table; 20081d4: c4 26 20 1c st %g2, [ %i0 + 0x1c ] * lengths that may be an odd number of bytes. */ name_length = maximum_name_length; #if !defined(RTEMS_POSIX_API) if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) 20081d8: 80 88 e0 03 btst 3, %g3 20081dc: 12 80 00 0c bne 200820c <_Objects_Initialize_information+0xd8><== NEVER TAKEN 20081e0: f4 26 20 08 st %i2, [ %i0 + 8 ] 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 ); 20081e4: 84 06 20 24 add %i0, 0x24, %g2 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); 20081e8: 82 06 20 20 add %i0, 0x20, %g1 name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); #endif information->name_length = name_length; 20081ec: c6 36 20 38 sth %g3, [ %i0 + 0x38 ] Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20081f0: c4 26 20 20 st %g2, [ %i0 + 0x20 ] head->previous = NULL; 20081f4: c0 26 20 24 clr [ %i0 + 0x24 ] _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 20081f8: 80 a6 e0 00 cmp %i3, 0 20081fc: 12 80 00 0e bne 2008234 <_Objects_Initialize_information+0x100> 2008200: c2 26 20 28 st %g1, [ %i0 + 0x28 ] 2008204: 81 c7 e0 08 ret 2008208: 81 e8 00 00 restore */ name_length = maximum_name_length; #if !defined(RTEMS_POSIX_API) if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & 200820c: 86 00 e0 04 add %g3, 4, %g3 <== NOT EXECUTED 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 ); 2008210: 84 06 20 24 add %i0, 0x24, %g2 <== NOT EXECUTED 2008214: 86 08 ff fc and %g3, -4, %g3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); 2008218: 82 06 20 20 add %i0, 0x20, %g1 <== NOT EXECUTED ~(OBJECTS_NAME_ALIGNMENT-1); #endif information->name_length = name_length; 200821c: c6 36 20 38 sth %g3, [ %i0 + 0x38 ] <== NOT EXECUTED Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2008220: c4 26 20 20 st %g2, [ %i0 + 0x20 ] <== NOT EXECUTED head->previous = NULL; 2008224: c0 26 20 24 clr [ %i0 + 0x24 ] <== NOT EXECUTED _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 2008228: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 200822c: 02 bf ff f6 be 2008204 <_Objects_Initialize_information+0xd0><== NOT EXECUTED 2008230: c2 26 20 28 st %g1, [ %i0 + 0x28 ] <== NOT EXECUTED /* * Always have the maximum size available so the current performance * figures are create are met. If the user moves past the maximum * number then a performance hit is taken. */ _Objects_Extend_information( information ); 2008234: 7f ff fe 81 call 2007c38 <_Objects_Extend_information> 2008238: 81 e8 00 00 restore /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { _Internal_error_Occurred( 200823c: 92 10 20 01 mov 1, %o1 2008240: 7f ff fe 21 call 2007ac4 <_Internal_error_Occurred> 2008244: 94 10 20 13 mov 0x13, %o2 =============================================================================== 02008304 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2008304: 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 ); 2008308: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 block_count = (information->maximum - index_base) / 200830c: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 2008310: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2008314: 92 10 00 11 mov %l1, %o1 2008318: 40 00 27 e3 call 20122a4 <.udiv> 200831c: 90 22 00 10 sub %o0, %l0, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2008320: 80 a2 20 00 cmp %o0, 0 2008324: 02 80 00 34 be 20083f4 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 2008328: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 200832c: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2008330: c2 01 00 00 ld [ %g4 ], %g1 2008334: 80 a4 40 01 cmp %l1, %g1 2008338: 02 80 00 0f be 2008374 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 200833c: 82 10 20 00 clr %g1 2008340: 10 80 00 07 b 200835c <_Objects_Shrink_information+0x58> 2008344: a4 10 20 04 mov 4, %l2 information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 2008348: 86 04 a0 04 add %l2, 4, %g3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 200834c: 80 a4 40 02 cmp %l1, %g2 2008350: 02 80 00 0a be 2008378 <_Objects_Shrink_information+0x74> 2008354: a0 04 00 11 add %l0, %l1, %l0 2008358: a4 10 00 03 mov %g3, %l2 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 200835c: 82 00 60 01 inc %g1 2008360: 80 a2 00 01 cmp %o0, %g1 2008364: 38 bf ff f9 bgu,a 2008348 <_Objects_Shrink_information+0x44> 2008368: c4 01 00 12 ld [ %g4 + %l2 ], %g2 200836c: 81 c7 e0 08 ret 2008370: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2008374: a4 10 20 00 clr %l2 <== NOT EXECUTED information->allocation_size ) { /* * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); 2008378: 10 80 00 06 b 2008390 <_Objects_Shrink_information+0x8c> 200837c: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2008380: 80 a4 60 00 cmp %l1, 0 2008384: 22 80 00 12 be,a 20083cc <_Objects_Shrink_information+0xc8> 2008388: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 200838c: 90 10 00 11 mov %l1, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2008390: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2008394: 80 a0 40 10 cmp %g1, %l0 2008398: 0a bf ff fa bcs 2008380 <_Objects_Shrink_information+0x7c> 200839c: e2 02 00 00 ld [ %o0 ], %l1 (index < (index_base + information->allocation_size))) { 20083a0: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20083a4: 84 04 00 02 add %l0, %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) && 20083a8: 80 a0 40 02 cmp %g1, %g2 20083ac: 1a bf ff f6 bcc 2008384 <_Objects_Shrink_information+0x80> 20083b0: 80 a4 60 00 cmp %l1, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 20083b4: 7f ff fb 4a call 20070dc <_Chain_Extract> 20083b8: 01 00 00 00 nop } } while ( the_object ); 20083bc: 80 a4 60 00 cmp %l1, 0 20083c0: 12 bf ff f4 bne 2008390 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 20083c4: 90 10 00 11 mov %l1, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 20083c8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 20083cc: 40 00 07 6f call 200a188 <_Workspace_Free> 20083d0: d0 00 40 12 ld [ %g1 + %l2 ], %o0 information->object_blocks[ block ] = NULL; 20083d4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; 20083d8: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 20083dc: 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; 20083e0: c0 20 40 12 clr [ %g1 + %l2 ] information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 20083e4: 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; 20083e8: c0 20 c0 12 clr [ %g3 + %l2 ] information->inactive -= information->allocation_size; 20083ec: 82 20 80 01 sub %g2, %g1, %g1 20083f0: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 20083f4: 81 c7 e0 08 ret 20083f8: 81 e8 00 00 restore =============================================================================== 02006a74 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2006a74: 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; 2006a78: 03 00 80 54 sethi %hi(0x2015000), %g1 2006a7c: 82 10 62 d0 or %g1, 0x2d0, %g1 ! 20152d0 2006a80: e0 00 60 2c ld [ %g1 + 0x2c ], %l0 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 2006a84: 80 a4 20 00 cmp %l0, 0 2006a88: 02 80 00 19 be 2006aec <_RTEMS_tasks_Initialize_user_tasks_body+0x78> 2006a8c: e4 00 60 28 ld [ %g1 + 0x28 ], %l2 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006a90: 80 a4 a0 00 cmp %l2, 0 2006a94: 02 80 00 16 be 2006aec <_RTEMS_tasks_Initialize_user_tasks_body+0x78><== NEVER TAKEN 2006a98: a2 10 20 00 clr %l1 2006a9c: a6 07 bf fc add %fp, -4, %l3 return_value = rtems_task_create( 2006aa0: d4 04 20 04 ld [ %l0 + 4 ], %o2 2006aa4: d0 04 00 00 ld [ %l0 ], %o0 2006aa8: d2 04 20 08 ld [ %l0 + 8 ], %o1 2006aac: d6 04 20 14 ld [ %l0 + 0x14 ], %o3 2006ab0: d8 04 20 0c ld [ %l0 + 0xc ], %o4 2006ab4: 7f ff ff 6d call 2006868 2006ab8: 9a 10 00 13 mov %l3, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 2006abc: 94 92 20 00 orcc %o0, 0, %o2 2006ac0: 12 80 00 0d bne 2006af4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 2006ac4: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2006ac8: d4 04 20 18 ld [ %l0 + 0x18 ], %o2 2006acc: 40 00 00 0e call 2006b04 2006ad0: d2 04 20 10 ld [ %l0 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 2006ad4: 94 92 20 00 orcc %o0, 0, %o2 2006ad8: 12 80 00 07 bne 2006af4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 2006adc: a2 04 60 01 inc %l1 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006ae0: 80 a4 80 11 cmp %l2, %l1 2006ae4: 18 bf ff ef bgu 2006aa0 <_RTEMS_tasks_Initialize_user_tasks_body+0x2c><== NEVER TAKEN 2006ae8: a0 04 20 1c add %l0, 0x1c, %l0 2006aec: 81 c7 e0 08 ret 2006af0: 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 ); 2006af4: 90 10 20 01 mov 1, %o0 2006af8: 40 00 03 f3 call 2007ac4 <_Internal_error_Occurred> 2006afc: 92 10 20 01 mov 1, %o1 =============================================================================== 0200c264 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200c264: 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 ]; 200c268: e0 06 21 58 ld [ %i0 + 0x158 ], %l0 if ( !api ) 200c26c: 80 a4 20 00 cmp %l0, 0 200c270: 02 80 00 1f be 200c2ec <_RTEMS_tasks_Post_switch_extension+0x88><== NEVER TAKEN 200c274: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200c278: 7f ff d8 0c call 20022a8 200c27c: 01 00 00 00 nop signal_set = asr->signals_posted; 200c280: e2 04 20 14 ld [ %l0 + 0x14 ], %l1 asr->signals_posted = 0; 200c284: c0 24 20 14 clr [ %l0 + 0x14 ] _ISR_Enable( level ); 200c288: 7f ff d8 0c call 20022b8 200c28c: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200c290: 80 a4 60 00 cmp %l1, 0 200c294: 32 80 00 04 bne,a 200c2a4 <_RTEMS_tasks_Post_switch_extension+0x40> 200c298: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 200c29c: 81 c7 e0 08 ret 200c2a0: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c2a4: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c2a8: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c2ac: a4 07 bf fc add %fp, -4, %l2 200c2b0: 27 00 00 3f sethi %hi(0xfc00), %l3 200c2b4: 94 10 00 12 mov %l2, %o2 200c2b8: 92 14 e3 ff or %l3, 0x3ff, %o1 200c2bc: 40 00 08 33 call 200e388 200c2c0: c2 24 20 1c st %g1, [ %l0 + 0x1c ] (*asr->handler)( signal_set ); 200c2c4: c2 04 20 0c ld [ %l0 + 0xc ], %g1 200c2c8: 9f c0 40 00 call %g1 200c2cc: 90 10 00 11 mov %l1, %o0 asr->nest_level -= 1; 200c2d0: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c2d4: 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; 200c2d8: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c2dc: 92 14 e3 ff or %l3, 0x3ff, %o1 200c2e0: 94 10 00 12 mov %l2, %o2 200c2e4: 40 00 08 29 call 200e388 200c2e8: c2 24 20 1c st %g1, [ %l0 + 0x1c ] 200c2ec: 81 c7 e0 08 ret 200c2f0: 81 e8 00 00 restore =============================================================================== 0200c1d4 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200c1d4: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200c1d8: 80 a0 60 00 cmp %g1, 0 200c1dc: 22 80 00 0b be,a 200c208 <_RTEMS_tasks_Switch_extension+0x34> 200c1e0: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200c1e4: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200c1e8: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200c1ec: c8 00 80 00 ld [ %g2 ], %g4 200c1f0: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; 200c1f4: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200c1f8: 80 a0 60 00 cmp %g1, 0 200c1fc: 12 bf ff fa bne 200c1e4 <_RTEMS_tasks_Switch_extension+0x10><== NEVER TAKEN 200c200: c6 20 80 00 st %g3, [ %g2 ] tvp->tval = *tvp->ptr; *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; 200c204: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200c208: 80 a0 60 00 cmp %g1, 0 200c20c: 02 80 00 0a be 200c234 <_RTEMS_tasks_Switch_extension+0x60> 200c210: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200c214: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200c218: 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; 200c21c: c8 00 80 00 ld [ %g2 ], %g4 200c220: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; tvp = (rtems_task_variable_t *)tvp->next; 200c224: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200c228: 80 a0 60 00 cmp %g1, 0 200c22c: 12 bf ff fa bne 200c214 <_RTEMS_tasks_Switch_extension+0x40><== NEVER TAKEN 200c230: c6 20 80 00 st %g3, [ %g2 ] 200c234: 81 c3 e0 08 retl =============================================================================== 02007d8c <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007d8c: 9d e3 bf 98 save %sp, -104, %sp 2007d90: 11 00 80 79 sethi %hi(0x201e400), %o0 2007d94: 92 10 00 18 mov %i0, %o1 2007d98: 90 12 23 e4 or %o0, 0x3e4, %o0 2007d9c: 40 00 08 3a call 2009e84 <_Objects_Get> 2007da0: 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 ) { 2007da4: c2 07 bf fc ld [ %fp + -4 ], %g1 2007da8: 80 a0 60 00 cmp %g1, 0 2007dac: 12 80 00 16 bne 2007e04 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 2007db0: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007db4: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007db8: 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); 2007dbc: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007dc0: 80 88 80 01 btst %g2, %g1 2007dc4: 22 80 00 08 be,a 2007de4 <_Rate_monotonic_Timeout+0x58> 2007dc8: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 2007dcc: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007dd0: c2 04 20 08 ld [ %l0 + 8 ], %g1 2007dd4: 80 a0 80 01 cmp %g2, %g1 2007dd8: 02 80 00 19 be 2007e3c <_Rate_monotonic_Timeout+0xb0> 2007ddc: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 2007de0: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 2007de4: 80 a0 60 01 cmp %g1, 1 2007de8: 02 80 00 09 be 2007e0c <_Rate_monotonic_Timeout+0x80> 2007dec: 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; 2007df0: c2 24 20 38 st %g1, [ %l0 + 0x38 ] */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2007df4: 03 00 80 7a sethi %hi(0x201e800), %g1 2007df8: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201e950 <_Thread_Dispatch_disable_level> 2007dfc: 84 00 bf ff add %g2, -1, %g2 2007e00: c4 20 61 50 st %g2, [ %g1 + 0x150 ] 2007e04: 81 c7 e0 08 ret 2007e08: 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; 2007e0c: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007e10: 90 10 00 10 mov %l0, %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; 2007e14: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007e18: 7f ff fe 4c call 2007748 <_Rate_monotonic_Initiate_statistics> 2007e1c: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007e20: c2 04 20 3c ld [ %l0 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007e24: 11 00 80 7a sethi %hi(0x201e800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007e28: c2 24 20 1c st %g1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007e2c: 90 12 22 34 or %o0, 0x234, %o0 2007e30: 40 00 0f d2 call 200bd78 <_Watchdog_Insert> 2007e34: 92 04 20 10 add %l0, 0x10, %o1 2007e38: 30 bf ff ef b,a 2007df4 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007e3c: 40 00 0a 68 call 200a7dc <_Thread_Clear_state> 2007e40: 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 ); 2007e44: 10 bf ff f5 b 2007e18 <_Rate_monotonic_Timeout+0x8c> 2007e48: 90 10 00 10 mov %l0, %o0 =============================================================================== 0200cb34 <_Scheduler_priority_Block>: void _Scheduler_priority_Block( Scheduler_Control *the_scheduler, Thread_Control *the_thread ) { 200cb34: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE void _Scheduler_priority_Ready_queue_extract( Thread_Control *the_thread ) { Chain_Control *ready = the_thread->scheduler.priority->ready_chain; 200cb38: c2 06 60 8c ld [ %i1 + 0x8c ], %g1 200cb3c: c2 00 40 00 ld [ %g1 ], %g1 if ( _Chain_Has_only_one_node( ready ) ) { 200cb40: c6 00 40 00 ld [ %g1 ], %g3 200cb44: c4 00 60 08 ld [ %g1 + 8 ], %g2 200cb48: 80 a0 c0 02 cmp %g3, %g2 200cb4c: 22 80 00 39 be,a 200cc30 <_Scheduler_priority_Block+0xfc> 200cb50: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200cb54: c4 06 40 00 ld [ %i1 ], %g2 previous = the_node->previous; 200cb58: c2 06 60 04 ld [ %i1 + 4 ], %g1 next->previous = previous; 200cb5c: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200cb60: c4 20 40 00 st %g2, [ %g1 ] RTEMS_INLINE_ROUTINE bool _Thread_Is_heir ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Heir ); 200cb64: 03 00 80 58 sethi %hi(0x2016000), %g1 200cb68: 82 10 61 2c or %g1, 0x12c, %g1 ! 201612c <_Per_CPU_Information> { _Scheduler_priority_Ready_queue_extract(the_thread); /* TODO: flash critical section */ if ( _Thread_Is_heir( the_thread ) ) 200cb6c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200cb70: 80 a6 40 02 cmp %i1, %g2 200cb74: 02 80 00 09 be 200cb98 <_Scheduler_priority_Block+0x64> 200cb78: 05 00 80 58 sethi %hi(0x2016000), %g2 _Scheduler_priority_Schedule_body(the_scheduler); if ( _Thread_Is_executing( the_thread ) ) 200cb7c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200cb80: 80 a6 40 02 cmp %i1, %g2 200cb84: 12 80 00 03 bne 200cb90 <_Scheduler_priority_Block+0x5c> 200cb88: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 200cb8c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 200cb90: 81 c7 e0 08 ret 200cb94: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 200cb98: c4 10 a1 50 lduh [ %g2 + 0x150 ], %g2 200cb9c: 85 28 a0 10 sll %g2, 0x10, %g2 200cba0: 89 30 a0 10 srl %g2, 0x10, %g4 200cba4: 80 a1 20 ff cmp %g4, 0xff 200cba8: 18 80 00 38 bgu 200cc88 <_Scheduler_priority_Block+0x154> 200cbac: c6 06 00 00 ld [ %i0 ], %g3 200cbb0: 1b 00 80 52 sethi %hi(0x2014800), %o5 200cbb4: 9a 13 61 50 or %o5, 0x150, %o5 ! 2014950 <__log2table> 200cbb8: c4 0b 40 04 ldub [ %o5 + %g4 ], %g2 200cbbc: 84 00 a0 08 add %g2, 8, %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 200cbc0: 85 28 a0 10 sll %g2, 0x10, %g2 200cbc4: 19 00 80 58 sethi %hi(0x2016000), %o4 200cbc8: 89 30 a0 0f srl %g2, 0xf, %g4 200cbcc: 98 13 21 60 or %o4, 0x160, %o4 200cbd0: c8 13 00 04 lduh [ %o4 + %g4 ], %g4 200cbd4: 89 29 20 10 sll %g4, 0x10, %g4 200cbd8: 99 31 20 10 srl %g4, 0x10, %o4 200cbdc: 80 a3 20 ff cmp %o4, 0xff 200cbe0: 38 80 00 28 bgu,a 200cc80 <_Scheduler_priority_Block+0x14c> 200cbe4: 89 31 20 18 srl %g4, 0x18, %g4 200cbe8: c8 0b 40 0c ldub [ %o5 + %o4 ], %g4 200cbec: 88 01 20 08 add %g4, 8, %g4 return (_Priority_Bits_index( major ) << 4) + 200cbf0: 85 30 a0 0c srl %g2, 0xc, %g2 _Priority_Bits_index( minor ); 200cbf4: 89 29 20 10 sll %g4, 0x10, %g4 200cbf8: 89 31 20 10 srl %g4, 0x10, %g4 Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); return (_Priority_Bits_index( major ) << 4) + 200cbfc: 88 01 00 02 add %g4, %g2, %g4 Chain_Control *the_ready_queue ) { Priority_Control index = _Priority_bit_map_Get_highest(); if ( !_Chain_Is_empty( &the_ready_queue[ index ] ) ) 200cc00: 9b 29 20 02 sll %g4, 2, %o5 200cc04: 85 29 20 04 sll %g4, 4, %g2 200cc08: 84 20 80 0d sub %g2, %o5, %g2 _Scheduler_priority_Block_body(the_scheduler, the_thread); } 200cc0c: da 00 c0 02 ld [ %g3 + %g2 ], %o5 200cc10: 84 00 c0 02 add %g3, %g2, %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200cc14: 84 00 a0 04 add %g2, 4, %g2 200cc18: 80 a3 40 02 cmp %o5, %g2 200cc1c: 02 80 00 03 be 200cc28 <_Scheduler_priority_Block+0xf4> <== NEVER TAKEN 200cc20: 88 10 20 00 clr %g4 return (Thread_Control *) _Chain_First( &the_ready_queue[ index ] ); 200cc24: 88 10 00 0d mov %o5, %g4 RTEMS_INLINE_ROUTINE void _Scheduler_priority_Schedule_body( Scheduler_Control *the_scheduler ) { _Thread_Heir = _Scheduler_priority_Ready_queue_first( 200cc28: 10 bf ff d5 b 200cb7c <_Scheduler_priority_Block+0x48> 200cc2c: c8 20 60 10 st %g4, [ %g1 + 0x10 ] Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; tail->previous = head; 200cc30: c2 20 60 08 st %g1, [ %g1 + 8 ] 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 ); 200cc34: 84 00 60 04 add %g1, 4, %g2 head->next = tail; 200cc38: c4 20 40 00 st %g2, [ %g1 ] { Chain_Control *ready = the_thread->scheduler.priority->ready_chain; if ( _Chain_Has_only_one_node( ready ) ) { _Chain_Initialize_empty( ready ); _Priority_bit_map_Remove( &the_thread->scheduler.priority->Priority_map ); 200cc3c: c2 06 60 8c ld [ %i1 + 0x8c ], %g1 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Remove ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor &= the_priority_map->block_minor; 200cc40: c6 00 60 04 ld [ %g1 + 4 ], %g3 200cc44: c4 10 60 0e lduh [ %g1 + 0xe ], %g2 200cc48: c8 10 c0 00 lduh [ %g3 ], %g4 200cc4c: 84 09 00 02 and %g4, %g2, %g2 200cc50: c4 30 c0 00 sth %g2, [ %g3 ] if ( *the_priority_map->minor == 0 ) 200cc54: 85 28 a0 10 sll %g2, 0x10, %g2 200cc58: 80 a0 a0 00 cmp %g2, 0 200cc5c: 32 bf ff c3 bne,a 200cb68 <_Scheduler_priority_Block+0x34> 200cc60: 03 00 80 58 sethi %hi(0x2016000), %g1 _Priority_Major_bit_map &= the_priority_map->block_major; 200cc64: 05 00 80 58 sethi %hi(0x2016000), %g2 200cc68: c2 10 60 0c lduh [ %g1 + 0xc ], %g1 200cc6c: c6 10 a1 50 lduh [ %g2 + 0x150 ], %g3 200cc70: 82 08 c0 01 and %g3, %g1, %g1 200cc74: c2 30 a1 50 sth %g1, [ %g2 + 0x150 ] 200cc78: 10 bf ff bc b 200cb68 <_Scheduler_priority_Block+0x34> 200cc7c: 03 00 80 58 sethi %hi(0x2016000), %g1 { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 200cc80: 10 bf ff dc b 200cbf0 <_Scheduler_priority_Block+0xbc> 200cc84: c8 0b 40 04 ldub [ %o5 + %g4 ], %g4 RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 200cc88: 1b 00 80 52 sethi %hi(0x2014800), %o5 200cc8c: 85 30 a0 18 srl %g2, 0x18, %g2 200cc90: 9a 13 61 50 or %o5, 0x150, %o5 200cc94: 10 bf ff cb b 200cbc0 <_Scheduler_priority_Block+0x8c> 200cc98: c4 0b 40 02 ldub [ %o5 + %g2 ], %g2 =============================================================================== 02008570 <_Scheduler_priority_Schedule>: */ void _Scheduler_priority_Schedule( Scheduler_Control *the_scheduler ) { 2008570: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2008574: 03 00 80 58 sethi %hi(0x2016000), %g1 2008578: c2 10 61 50 lduh [ %g1 + 0x150 ], %g1 ! 2016150 <_Priority_Major_bit_map> 200857c: 83 28 60 10 sll %g1, 0x10, %g1 2008580: 87 30 60 10 srl %g1, 0x10, %g3 2008584: 80 a0 e0 ff cmp %g3, 0xff 2008588: 18 80 00 26 bgu 2008620 <_Scheduler_priority_Schedule+0xb0> 200858c: c4 06 00 00 ld [ %i0 ], %g2 2008590: 09 00 80 52 sethi %hi(0x2014800), %g4 2008594: 88 11 21 50 or %g4, 0x150, %g4 ! 2014950 <__log2table> 2008598: c2 09 00 03 ldub [ %g4 + %g3 ], %g1 200859c: 82 00 60 08 add %g1, 8, %g1 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 20085a0: 83 28 60 10 sll %g1, 0x10, %g1 20085a4: 1b 00 80 58 sethi %hi(0x2016000), %o5 20085a8: 87 30 60 0f srl %g1, 0xf, %g3 20085ac: 9a 13 61 60 or %o5, 0x160, %o5 20085b0: c6 13 40 03 lduh [ %o5 + %g3 ], %g3 20085b4: 87 28 e0 10 sll %g3, 0x10, %g3 20085b8: 9b 30 e0 10 srl %g3, 0x10, %o5 20085bc: 80 a3 60 ff cmp %o5, 0xff 20085c0: 38 80 00 16 bgu,a 2008618 <_Scheduler_priority_Schedule+0xa8> 20085c4: 87 30 e0 18 srl %g3, 0x18, %g3 20085c8: c6 09 00 0d ldub [ %g4 + %o5 ], %g3 20085cc: 86 00 e0 08 add %g3, 8, %g3 return (_Priority_Bits_index( major ) << 4) + 20085d0: 83 30 60 0c srl %g1, 0xc, %g1 _Priority_Bits_index( minor ); 20085d4: 87 28 e0 10 sll %g3, 0x10, %g3 20085d8: 87 30 e0 10 srl %g3, 0x10, %g3 Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); return (_Priority_Bits_index( major ) << 4) + 20085dc: 86 00 c0 01 add %g3, %g1, %g3 Chain_Control *the_ready_queue ) { Priority_Control index = _Priority_bit_map_Get_highest(); if ( !_Chain_Is_empty( &the_ready_queue[ index ] ) ) 20085e0: 89 28 e0 02 sll %g3, 2, %g4 20085e4: 83 28 e0 04 sll %g3, 4, %g1 20085e8: 82 20 40 04 sub %g1, %g4, %g1 _Scheduler_priority_Schedule_body( the_scheduler ); } 20085ec: c8 00 80 01 ld [ %g2 + %g1 ], %g4 20085f0: 82 00 80 01 add %g2, %g1, %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20085f4: 82 00 60 04 add %g1, 4, %g1 20085f8: 80 a1 00 01 cmp %g4, %g1 20085fc: 02 80 00 03 be 2008608 <_Scheduler_priority_Schedule+0x98><== NEVER TAKEN 2008600: 86 10 20 00 clr %g3 return (Thread_Control *) _Chain_First( &the_ready_queue[ index ] ); 2008604: 86 10 00 04 mov %g4, %g3 RTEMS_INLINE_ROUTINE void _Scheduler_priority_Schedule_body( Scheduler_Control *the_scheduler ) { _Thread_Heir = _Scheduler_priority_Ready_queue_first( 2008608: 03 00 80 58 sethi %hi(0x2016000), %g1 200860c: c6 20 61 3c st %g3, [ %g1 + 0x13c ] ! 201613c <_Per_CPU_Information+0x10> 2008610: 81 c7 e0 08 ret 2008614: 81 e8 00 00 restore { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2008618: 10 bf ff ee b 20085d0 <_Scheduler_priority_Schedule+0x60> 200861c: c6 09 00 03 ldub [ %g4 + %g3 ], %g3 RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2008620: 09 00 80 52 sethi %hi(0x2014800), %g4 2008624: 83 30 60 18 srl %g1, 0x18, %g1 2008628: 88 11 21 50 or %g4, 0x150, %g4 200862c: 10 bf ff dd b 20085a0 <_Scheduler_priority_Schedule+0x30> 2008630: c2 09 00 01 ldub [ %g4 + %g1 ], %g1 =============================================================================== 02008770 <_Scheduler_priority_Yield>: */ void _Scheduler_priority_Yield( Scheduler_Control *the_scheduler __attribute__((unused)) ) { 2008770: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 2008774: 25 00 80 58 sethi %hi(0x2016000), %l2 2008778: a4 14 a1 2c or %l2, 0x12c, %l2 ! 201612c <_Per_CPU_Information> 200877c: e0 04 a0 0c ld [ %l2 + 0xc ], %l0 ready = executing->scheduler.priority->ready_chain; 2008780: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 _ISR_Disable( level ); 2008784: 7f ff e6 c9 call 20022a8 2008788: e2 00 40 00 ld [ %g1 ], %l1 200878c: b0 10 00 08 mov %o0, %i0 if ( !_Chain_Has_only_one_node( ready ) ) { 2008790: c4 04 40 00 ld [ %l1 ], %g2 2008794: c2 04 60 08 ld [ %l1 + 8 ], %g1 2008798: 80 a0 80 01 cmp %g2, %g1 200879c: 02 80 00 16 be 20087f4 <_Scheduler_priority_Yield+0x84> 20087a0: 86 04 60 04 add %l1, 4, %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 20087a4: c2 04 20 04 ld [ %l0 + 4 ], %g1 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 20087a8: c4 04 00 00 ld [ %l0 ], %g2 previous = the_node->previous; next->previous = previous; 20087ac: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 20087b0: c4 20 40 00 st %g2, [ %g1 ] Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 20087b4: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_node->next = tail; 20087b8: c6 24 00 00 st %g3, [ %l0 ] tail->previous = the_node; 20087bc: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last->next = the_node; 20087c0: e0 20 40 00 st %l0, [ %g1 ] the_node->previous = old_last; 20087c4: c2 24 20 04 st %g1, [ %l0 + 4 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 20087c8: 7f ff e6 bc call 20022b8 20087cc: 01 00 00 00 nop 20087d0: 7f ff e6 b6 call 20022a8 20087d4: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 20087d8: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 20087dc: 80 a4 00 01 cmp %l0, %g1 20087e0: 02 80 00 0b be 200880c <_Scheduler_priority_Yield+0x9c> <== ALWAYS TAKEN 20087e4: 82 10 20 01 mov 1, %g1 _Thread_Heir = (Thread_Control *) _Chain_First( ready ); _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 20087e8: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED _ISR_Enable( level ); 20087ec: 7f ff e6 b3 call 20022b8 20087f0: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) _Chain_First( ready ); _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 20087f4: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 20087f8: 80 a4 00 01 cmp %l0, %g1 20087fc: 02 bf ff fc be 20087ec <_Scheduler_priority_Yield+0x7c> <== ALWAYS TAKEN 2008800: 82 10 20 01 mov 1, %g1 _Thread_Dispatch_necessary = true; 2008804: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED 2008808: 30 bf ff f9 b,a 20087ec <_Scheduler_priority_Yield+0x7c> <== NOT EXECUTED _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) _Chain_First( ready ); 200880c: c2 04 40 00 ld [ %l1 ], %g1 2008810: c2 24 a0 10 st %g1, [ %l2 + 0x10 ] _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 2008814: 82 10 20 01 mov 1, %g1 2008818: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] 200881c: 30 bf ff f4 b,a 20087ec <_Scheduler_priority_Yield+0x7c> =============================================================================== 02007610 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 2007610: 9d e3 bf 98 save %sp, -104, %sp /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007614: 05 00 80 58 sethi %hi(0x2016000), %g2 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007618: 03 00 80 54 sethi %hi(0x2015000), %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 200761c: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007620: c2 00 63 14 ld [ %g1 + 0x314 ], %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007624: 86 00 e0 01 inc %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007628: 9b 28 60 07 sll %g1, 7, %o5 200762c: 89 28 60 02 sll %g1, 2, %g4 2007630: 88 23 40 04 sub %o5, %g4, %g4 2007634: 82 01 00 01 add %g4, %g1, %g1 2007638: 83 28 60 03 sll %g1, 3, %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 200763c: a0 07 bf f8 add %fp, -8, %l0 /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007640: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 2007644: 92 10 00 10 mov %l0, %o1 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2007648: c2 27 bf fc st %g1, [ %fp + -4 ] 200764c: c0 27 bf f8 clr [ %fp + -8 ] /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 2007650: 11 00 80 57 sethi %hi(0x2015c00), %o0 2007654: 40 00 08 ee call 2009a0c <_Timespec_Add_to> 2007658: 90 12 23 5c or %o0, 0x35c, %o0 ! 2015f5c <_TOD_Uptime> /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); 200765c: 92 10 00 10 mov %l0, %o1 2007660: 11 00 80 57 sethi %hi(0x2015c00), %o0 2007664: 40 00 08 ea call 2009a0c <_Timespec_Add_to> 2007668: 90 12 23 8c or %o0, 0x38c, %o0 ! 2015f8c <_TOD_Now> while ( seconds ) { 200766c: a0 92 20 00 orcc %o0, 0, %l0 2007670: 02 80 00 08 be 2007690 <_TOD_Tickle_ticks+0x80> 2007674: 23 00 80 57 sethi %hi(0x2015c00), %l1 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 2007678: a2 14 63 b8 or %l1, 0x3b8, %l1 ! 2015fb8 <_Watchdog_Seconds_chain> 200767c: 40 00 0a 74 call 200a04c <_Watchdog_Tickle> 2007680: 90 10 00 11 mov %l1, %o0 2007684: a0 84 3f ff addcc %l0, -1, %l0 2007688: 12 bf ff fd bne 200767c <_TOD_Tickle_ticks+0x6c> <== NEVER TAKEN 200768c: 01 00 00 00 nop 2007690: 81 c7 e0 08 ret 2007694: 81 e8 00 00 restore =============================================================================== 02007720 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007720: 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(); 2007724: 03 00 80 79 sethi %hi(0x201e400), %g1 */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007728: a0 10 00 18 mov %i0, %l0 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 200772c: d2 00 61 94 ld [ %g1 + 0x194 ], %o1 if ((!the_tod) || 2007730: 80 a4 20 00 cmp %l0, 0 2007734: 02 80 00 2c be 20077e4 <_TOD_Validate+0xc4> <== NEVER TAKEN 2007738: b0 10 20 00 clr %i0 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 200773c: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007740: 40 00 4a b7 call 201a21c <.udiv> 2007744: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007748: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 200774c: 80 a2 00 01 cmp %o0, %g1 2007750: 08 80 00 25 bleu 20077e4 <_TOD_Validate+0xc4> 2007754: 01 00 00 00 nop (the_tod->ticks >= ticks_per_second) || 2007758: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 200775c: 80 a0 60 3b cmp %g1, 0x3b 2007760: 18 80 00 21 bgu 20077e4 <_TOD_Validate+0xc4> 2007764: 01 00 00 00 nop (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2007768: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 200776c: 80 a0 60 3b cmp %g1, 0x3b 2007770: 18 80 00 1d bgu 20077e4 <_TOD_Validate+0xc4> 2007774: 01 00 00 00 nop (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2007778: c2 04 20 0c ld [ %l0 + 0xc ], %g1 200777c: 80 a0 60 17 cmp %g1, 0x17 2007780: 18 80 00 19 bgu 20077e4 <_TOD_Validate+0xc4> 2007784: 01 00 00 00 nop (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2007788: c2 04 20 04 ld [ %l0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 200778c: 80 a0 60 00 cmp %g1, 0 2007790: 02 80 00 15 be 20077e4 <_TOD_Validate+0xc4> <== NEVER TAKEN 2007794: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007798: 18 80 00 13 bgu 20077e4 <_TOD_Validate+0xc4> 200779c: 01 00 00 00 nop (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 20077a0: c4 04 00 00 ld [ %l0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 20077a4: 80 a0 a7 c3 cmp %g2, 0x7c3 20077a8: 08 80 00 0f bleu 20077e4 <_TOD_Validate+0xc4> 20077ac: 01 00 00 00 nop (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 20077b0: c6 04 20 08 ld [ %l0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 20077b4: 80 a0 e0 00 cmp %g3, 0 20077b8: 02 80 00 0b be 20077e4 <_TOD_Validate+0xc4> <== NEVER TAKEN 20077bc: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20077c0: 32 80 00 0b bne,a 20077ec <_TOD_Validate+0xcc> 20077c4: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20077c8: 82 00 60 0d add %g1, 0xd, %g1 20077cc: 05 00 80 74 sethi %hi(0x201d000), %g2 20077d0: 83 28 60 02 sll %g1, 2, %g1 20077d4: 84 10 a2 08 or %g2, 0x208, %g2 20077d8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 20077dc: 80 a0 40 03 cmp %g1, %g3 20077e0: b0 60 3f ff subx %g0, -1, %i0 if ( the_tod->day > days_in_month ) return false; return true; } 20077e4: 81 c7 e0 08 ret 20077e8: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 20077ec: 05 00 80 74 sethi %hi(0x201d000), %g2 20077f0: 84 10 a2 08 or %g2, 0x208, %g2 ! 201d208 <_TOD_Days_per_month> 20077f4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 20077f8: 80 a0 40 03 cmp %g1, %g3 20077fc: b0 60 3f ff subx %g0, -1, %i0 2007800: 81 c7 e0 08 ret 2007804: 81 e8 00 00 restore =============================================================================== 0200887c <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200887c: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 2008880: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 /* * 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 ); 2008884: 40 00 03 cd call 20097b8 <_Thread_Set_transient> 2008888: 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 ) 200888c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008890: 80 a0 40 19 cmp %g1, %i1 2008894: 02 80 00 05 be 20088a8 <_Thread_Change_priority+0x2c> 2008898: a0 10 00 18 mov %i0, %l0 _Thread_Set_priority( the_thread, new_priority ); 200889c: 90 10 00 18 mov %i0, %o0 20088a0: 40 00 03 a9 call 2009744 <_Thread_Set_priority> 20088a4: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 20088a8: 7f ff e6 80 call 20022a8 20088ac: 01 00 00 00 nop 20088b0: b0 10 00 08 mov %o0, %i0 /* * 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; 20088b4: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 if ( state != STATES_TRANSIENT ) { 20088b8: 80 a4 a0 04 cmp %l2, 4 20088bc: 02 80 00 18 be 200891c <_Thread_Change_priority+0xa0> 20088c0: 80 8c 60 04 btst 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 20088c4: 02 80 00 0b be 20088f0 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 20088c8: 82 0c bf fb and %l2, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 20088cc: 7f ff e6 7b call 20022b8 <== NOT EXECUTED 20088d0: 90 10 00 18 mov %i0, %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); 20088d4: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 20088d8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 20088dc: 80 8c 80 01 btst %l2, %g1 <== NOT EXECUTED 20088e0: 32 80 00 0d bne,a 2008914 <_Thread_Change_priority+0x98> <== NOT EXECUTED 20088e4: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 <== NOT EXECUTED 20088e8: 81 c7 e0 08 ret 20088ec: 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 ); 20088f0: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 20088f4: 7f ff e6 71 call 20022b8 20088f8: 90 10 00 18 mov %i0, %o0 20088fc: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008900: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008904: 80 8c 80 01 btst %l2, %g1 2008908: 02 bf ff f8 be 20088e8 <_Thread_Change_priority+0x6c> 200890c: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008910: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 2008914: 40 00 03 5c call 2009684 <_Thread_queue_Requeue> 2008918: 93 e8 00 10 restore %g0, %l0, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 200891c: 12 80 00 15 bne 2008970 <_Thread_Change_priority+0xf4> <== NEVER TAKEN 2008920: 80 8e a0 ff btst 0xff, %i2 * FIXME: hard-coded for priority scheduling. Might be ok since this * function is specific to priority scheduling? */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); if ( prepend_it ) 2008924: 02 80 00 2a be 20089cc <_Thread_Change_priority+0x150> 2008928: c0 24 20 10 clr [ %l0 + 0x10 ] RTEMS_INLINE_ROUTINE void _Scheduler_priority_Ready_queue_enqueue_first( Thread_Control *the_thread ) { _Priority_bit_map_Add( &the_thread->scheduler.priority->Priority_map ); 200892c: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 2008930: 07 00 80 58 sethi %hi(0x2016000), %g3 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 2008934: c8 00 60 04 ld [ %g1 + 4 ], %g4 2008938: da 10 60 0a lduh [ %g1 + 0xa ], %o5 200893c: d8 11 00 00 lduh [ %g4 ], %o4 _Chain_Prepend_unprotected( the_thread->scheduler.priority->ready_chain, 2008940: c4 00 40 00 ld [ %g1 ], %g2 2008944: 9a 13 00 0d or %o4, %o5, %o5 2008948: da 31 00 00 sth %o5, [ %g4 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 200894c: c8 10 60 08 lduh [ %g1 + 8 ], %g4 2008950: da 10 e1 50 lduh [ %g3 + 0x150 ], %o5 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008954: c2 00 80 00 ld [ %g2 ], %g1 2008958: 88 13 40 04 or %o5, %g4, %g4 200895c: c8 30 e1 50 sth %g4, [ %g3 + 0x150 ] Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008960: c4 24 20 04 st %g2, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008964: e0 20 80 00 st %l0, [ %g2 ] the_node->next = before_node; 2008968: c2 24 00 00 st %g1, [ %l0 ] before_node->previous = the_node; 200896c: e0 20 60 04 st %l0, [ %g1 + 4 ] _Scheduler_priority_Ready_queue_enqueue_first( the_thread ); else _Scheduler_priority_Ready_queue_enqueue( the_thread ); } _ISR_Flash( level ); 2008970: 7f ff e6 52 call 20022b8 2008974: 90 10 00 18 mov %i0, %o0 2008978: 7f ff e6 4c call 20022a8 200897c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( Scheduler_Control *the_scheduler ) { the_scheduler->Operations.schedule( the_scheduler ); 2008980: 11 00 80 57 sethi %hi(0x2015c00), %o0 2008984: 90 12 23 68 or %o0, 0x368, %o0 ! 2015f68 <_Scheduler> 2008988: c2 02 20 04 ld [ %o0 + 4 ], %g1 200898c: 9f c0 40 00 call %g1 2008990: 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 ); 2008994: 03 00 80 58 sethi %hi(0x2016000), %g1 2008998: 82 10 61 2c or %g1, 0x12c, %g1 ! 201612c <_Per_CPU_Information> 200899c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Scheduler_Schedule(&_Scheduler); if ( !_Thread_Is_executing_also_the_heir() && 20089a0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 20089a4: 80 a0 80 03 cmp %g2, %g3 20089a8: 02 80 00 07 be 20089c4 <_Thread_Change_priority+0x148> 20089ac: 01 00 00 00 nop 20089b0: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 20089b4: 80 a0 a0 00 cmp %g2, 0 20089b8: 02 80 00 03 be 20089c4 <_Thread_Change_priority+0x148> 20089bc: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 20089c0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 20089c4: 7f ff e6 3d call 20022b8 20089c8: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Scheduler_priority_Ready_queue_enqueue( Thread_Control *the_thread ) { _Priority_bit_map_Add( &the_thread->scheduler.priority->Priority_map ); 20089cc: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 20089d0: 07 00 80 58 sethi %hi(0x2016000), %g3 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 20089d4: c8 00 60 04 ld [ %g1 + 4 ], %g4 20089d8: da 10 60 0a lduh [ %g1 + 0xa ], %o5 20089dc: d8 11 00 00 lduh [ %g4 ], %o4 _Chain_Append_unprotected( the_thread->scheduler.priority->ready_chain, 20089e0: c4 00 40 00 ld [ %g1 ], %g2 20089e4: 9a 13 00 0d or %o4, %o5, %o5 20089e8: da 31 00 00 sth %o5, [ %g4 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 20089ec: c8 10 60 08 lduh [ %g1 + 8 ], %g4 20089f0: da 10 e1 50 lduh [ %g3 + 0x150 ], %o5 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 20089f4: c2 00 a0 08 ld [ %g2 + 8 ], %g1 20089f8: 88 13 40 04 or %o5, %g4, %g4 20089fc: c8 30 e1 50 sth %g4, [ %g3 + 0x150 ] the_node->next = tail; tail->previous = the_node; 2008a00: e0 20 a0 08 st %l0, [ %g2 + 8 ] RTEMS_INLINE_ROUTINE void _Chain_Append_unprotected( Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); 2008a04: 86 00 a0 04 add %g2, 4, %g3 Chain_Node *old_last = tail->previous; the_node->next = tail; 2008a08: c6 24 00 00 st %g3, [ %l0 ] tail->previous = the_node; old_last->next = the_node; 2008a0c: e0 20 40 00 st %l0, [ %g1 ] the_node->previous = old_last; 2008a10: 10 bf ff d8 b 2008970 <_Thread_Change_priority+0xf4> 2008a14: c2 24 20 04 st %g1, [ %l0 + 4 ] =============================================================================== 02008c2c <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008c2c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008c30: 90 10 00 18 mov %i0, %o0 2008c34: 40 00 00 7a call 2008e1c <_Thread_Get> 2008c38: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008c3c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008c40: 80 a0 60 00 cmp %g1, 0 2008c44: 12 80 00 08 bne 2008c64 <_Thread_Delay_ended+0x38> <== NEVER TAKEN 2008c48: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2008c4c: 7f ff ff 73 call 2008a18 <_Thread_Clear_state> 2008c50: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 2008c54: 03 00 80 57 sethi %hi(0x2015c00), %g1 2008c58: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 2015ee0 <_Thread_Dispatch_disable_level> 2008c5c: 84 00 bf ff add %g2, -1, %g2 2008c60: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] 2008c64: 81 c7 e0 08 ret 2008c68: 81 e8 00 00 restore =============================================================================== 02008c6c <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2008c6c: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 2008c70: 25 00 80 58 sethi %hi(0x2016000), %l2 2008c74: a4 14 a1 2c or %l2, 0x12c, %l2 ! 201612c <_Per_CPU_Information> _ISR_Disable( level ); 2008c78: 7f ff e5 8c call 20022a8 2008c7c: e0 04 a0 0c ld [ %l2 + 0xc ], %l0 while ( _Thread_Dispatch_necessary == true ) { 2008c80: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 2008c84: 80 a0 60 00 cmp %g1, 0 2008c88: 02 80 00 50 be 2008dc8 <_Thread_Dispatch+0x15c> 2008c8c: 2f 00 80 57 sethi %hi(0x2015c00), %l7 heir = _Thread_Heir; 2008c90: e2 04 a0 10 ld [ %l2 + 0x10 ], %l1 _Thread_Dispatch_disable_level = 1; 2008c94: 82 10 20 01 mov 1, %g1 2008c98: c2 25 e2 e0 st %g1, [ %l7 + 0x2e0 ] _Thread_Dispatch_necessary = false; 2008c9c: c0 2c a0 18 clrb [ %l2 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2008ca0: 80 a4 00 11 cmp %l0, %l1 2008ca4: 02 80 00 49 be 2008dc8 <_Thread_Dispatch+0x15c> 2008ca8: e2 24 a0 0c st %l1, [ %l2 + 0xc ] 2008cac: 27 00 80 57 sethi %hi(0x2015c00), %l3 2008cb0: 39 00 80 57 sethi %hi(0x2015c00), %i4 2008cb4: a6 14 e3 b0 or %l3, 0x3b0, %l3 2008cb8: aa 07 bf f8 add %fp, -8, %l5 2008cbc: a8 07 bf f0 add %fp, -16, %l4 2008cc0: b8 17 23 88 or %i4, 0x388, %i4 #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; 2008cc4: 35 00 80 57 sethi %hi(0x2015c00), %i2 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008cc8: ba 10 00 13 mov %l3, %i5 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 2008ccc: 2d 00 80 57 sethi %hi(0x2015c00), %l6 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 2008cd0: 10 80 00 38 b 2008db0 <_Thread_Dispatch+0x144> 2008cd4: b6 10 20 01 mov 1, %i3 rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 2008cd8: 7f ff e5 78 call 20022b8 2008cdc: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008ce0: 40 00 0e 7c call 200c6d0 <_TOD_Get_uptime> 2008ce4: 90 10 00 15 mov %l5, %o0 _Timestamp_Subtract( 2008ce8: 90 10 00 1d mov %i5, %o0 2008cec: 92 10 00 15 mov %l5, %o1 2008cf0: 40 00 03 60 call 2009a70 <_Timespec_Subtract> 2008cf4: 94 10 00 14 mov %l4, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008cf8: 90 04 20 84 add %l0, 0x84, %o0 2008cfc: 40 00 03 44 call 2009a0c <_Timespec_Add_to> 2008d00: 92 10 00 14 mov %l4, %o1 _Thread_Time_of_last_context_switch = uptime; 2008d04: c4 07 bf f8 ld [ %fp + -8 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008d08: c2 07 00 00 ld [ %i4 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 2008d0c: c4 24 c0 00 st %g2, [ %l3 ] 2008d10: c4 07 bf fc ld [ %fp + -4 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008d14: 80 a0 60 00 cmp %g1, 0 2008d18: 02 80 00 06 be 2008d30 <_Thread_Dispatch+0xc4> <== NEVER TAKEN 2008d1c: c4 24 e0 04 st %g2, [ %l3 + 4 ] executing->libc_reent = *_Thread_libc_reent; 2008d20: c4 00 40 00 ld [ %g1 ], %g2 2008d24: c4 24 21 54 st %g2, [ %l0 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2008d28: c4 04 61 54 ld [ %l1 + 0x154 ], %g2 2008d2c: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008d30: 90 10 00 10 mov %l0, %o0 2008d34: 40 00 04 13 call 2009d80 <_User_extensions_Thread_switch> 2008d38: 92 10 00 11 mov %l1, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2008d3c: 90 04 20 c8 add %l0, 0xc8, %o0 2008d40: 40 00 05 65 call 200a2d4 <_CPU_Context_switch> 2008d44: 92 04 60 c8 add %l1, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2008d48: c2 04 21 50 ld [ %l0 + 0x150 ], %g1 2008d4c: 80 a0 60 00 cmp %g1, 0 2008d50: 02 80 00 0c be 2008d80 <_Thread_Dispatch+0x114> 2008d54: d0 05 a3 64 ld [ %l6 + 0x364 ], %o0 2008d58: 80 a4 00 08 cmp %l0, %o0 2008d5c: 02 80 00 09 be 2008d80 <_Thread_Dispatch+0x114> 2008d60: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008d64: 02 80 00 04 be 2008d74 <_Thread_Dispatch+0x108> 2008d68: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2008d6c: 40 00 05 20 call 200a1ec <_CPU_Context_save_fp> 2008d70: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008d74: 40 00 05 3b call 200a260 <_CPU_Context_restore_fp> 2008d78: 90 04 21 50 add %l0, 0x150, %o0 _Thread_Allocated_fp = executing; 2008d7c: e0 25 a3 64 st %l0, [ %l6 + 0x364 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2008d80: 7f ff e5 4a call 20022a8 2008d84: e0 04 a0 0c ld [ %l2 + 0xc ], %l0 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2008d88: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 2008d8c: 80 a0 60 00 cmp %g1, 0 2008d90: 02 80 00 0e be 2008dc8 <_Thread_Dispatch+0x15c> 2008d94: 01 00 00 00 nop heir = _Thread_Heir; 2008d98: e2 04 a0 10 ld [ %l2 + 0x10 ], %l1 _Thread_Dispatch_disable_level = 1; 2008d9c: f6 25 e2 e0 st %i3, [ %l7 + 0x2e0 ] _Thread_Dispatch_necessary = false; 2008da0: c0 2c a0 18 clrb [ %l2 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 2008da4: 80 a4 40 10 cmp %l1, %l0 2008da8: 02 80 00 08 be 2008dc8 <_Thread_Dispatch+0x15c> <== NEVER TAKEN 2008dac: e2 24 a0 0c st %l1, [ %l2 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 2008db0: c2 04 60 7c ld [ %l1 + 0x7c ], %g1 2008db4: 80 a0 60 01 cmp %g1, 1 2008db8: 12 bf ff c8 bne 2008cd8 <_Thread_Dispatch+0x6c> 2008dbc: c2 06 a2 44 ld [ %i2 + 0x244 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008dc0: 10 bf ff c6 b 2008cd8 <_Thread_Dispatch+0x6c> 2008dc4: c2 24 60 78 st %g1, [ %l1 + 0x78 ] _ISR_Disable( level ); } post_switch: _Thread_Dispatch_disable_level = 0; 2008dc8: c0 25 e2 e0 clr [ %l7 + 0x2e0 ] _ISR_Enable( level ); 2008dcc: 7f ff e5 3b call 20022b8 2008dd0: 01 00 00 00 nop _API_extensions_Run_postswitch(); 2008dd4: 7f ff f8 6a call 2006f7c <_API_extensions_Run_postswitch> 2008dd8: 01 00 00 00 nop } 2008ddc: 81 c7 e0 08 ret 2008de0: 81 e8 00 00 restore =============================================================================== 02008e1c <_Thread_Get>: */ Thread_Control *_Thread_Get ( Objects_Id id, Objects_Locations *location ) { 2008e1c: 82 10 00 08 mov %o0, %g1 uint32_t the_class; Objects_Information **api_information; Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { 2008e20: 80 a2 20 00 cmp %o0, 0 2008e24: 02 80 00 1d be 2008e98 <_Thread_Get+0x7c> 2008e28: 94 10 00 09 mov %o1, %o2 */ RTEMS_INLINE_ROUTINE Objects_APIs _Objects_Get_API( Objects_Id id ) { return (Objects_APIs) ((id >> OBJECTS_API_START_BIT) & OBJECTS_API_VALID_BITS); 2008e2c: 85 32 20 18 srl %o0, 0x18, %g2 2008e30: 84 08 a0 07 and %g2, 7, %g2 */ RTEMS_INLINE_ROUTINE bool _Objects_Is_api_valid( uint32_t the_api ) { if ( !the_api || the_api > OBJECTS_APIS_LAST ) 2008e34: 86 00 bf ff add %g2, -1, %g3 2008e38: 80 a0 e0 02 cmp %g3, 2 2008e3c: 38 80 00 14 bgu,a 2008e8c <_Thread_Get+0x70> 2008e40: 82 10 20 01 mov 1, %g1 */ RTEMS_INLINE_ROUTINE uint32_t _Objects_Get_class( Objects_Id id ) { return (uint32_t) 2008e44: 89 32 20 1b srl %o0, 0x1b, %g4 *location = OBJECTS_ERROR; goto done; } the_class = _Objects_Get_class( id ); if ( the_class != 1 ) { /* threads are always first class :) */ 2008e48: 80 a1 20 01 cmp %g4, 1 2008e4c: 32 80 00 10 bne,a 2008e8c <_Thread_Get+0x70> 2008e50: 82 10 20 01 mov 1, %g1 *location = OBJECTS_ERROR; goto done; } api_information = _Objects_Information_table[ the_api ]; 2008e54: 85 28 a0 02 sll %g2, 2, %g2 2008e58: 07 00 80 57 sethi %hi(0x2015c00), %g3 2008e5c: 86 10 e2 48 or %g3, 0x248, %g3 ! 2015e48 <_Objects_Information_table> 2008e60: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 /* * There is no way for this to happen if POSIX is enabled. */ #if !defined(RTEMS_POSIX_API) if ( !api_information ) { 2008e64: 80 a0 a0 00 cmp %g2, 0 2008e68: 22 80 00 16 be,a 2008ec0 <_Thread_Get+0xa4> <== NEVER TAKEN 2008e6c: c8 22 80 00 st %g4, [ %o2 ] <== NOT EXECUTED *location = OBJECTS_ERROR; goto done; } #endif information = api_information[ the_class ]; 2008e70: d0 00 a0 04 ld [ %g2 + 4 ], %o0 if ( !information ) { 2008e74: 80 a2 20 00 cmp %o0, 0 2008e78: 02 80 00 10 be 2008eb8 <_Thread_Get+0x9c> 2008e7c: 92 10 00 01 mov %g1, %o1 *location = OBJECTS_ERROR; goto done; } tp = (Thread_Control *) _Objects_Get( information, id, location ); 2008e80: 82 13 c0 00 mov %o7, %g1 2008e84: 7f ff fc 8f call 20080c0 <_Objects_Get> 2008e88: 9e 10 40 00 mov %g1, %o7 { uint32_t the_api; uint32_t the_class; Objects_Information **api_information; Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; 2008e8c: 90 10 20 00 clr %o0 } the_class = _Objects_Get_class( id ); if ( the_class != 1 ) { /* threads are always first class :) */ *location = OBJECTS_ERROR; goto done; 2008e90: 81 c3 e0 08 retl 2008e94: c2 22 80 00 st %g1, [ %o2 ] rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2008e98: 03 00 80 57 sethi %hi(0x2015c00), %g1 2008e9c: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 2015ee0 <_Thread_Dispatch_disable_level> 2008ea0: 84 00 a0 01 inc %g2 2008ea4: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { _Thread_Disable_dispatch(); *location = OBJECTS_LOCAL; tp = _Thread_Executing; 2008ea8: 03 00 80 58 sethi %hi(0x2016000), %g1 Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { _Thread_Disable_dispatch(); *location = OBJECTS_LOCAL; 2008eac: c0 22 40 00 clr [ %o1 ] tp = _Thread_Executing; goto done; 2008eb0: 81 c3 e0 08 retl 2008eb4: d0 00 61 38 ld [ %g1 + 0x138 ], %o0 #endif information = api_information[ the_class ]; if ( !information ) { *location = OBJECTS_ERROR; goto done; 2008eb8: 81 c3 e0 08 retl 2008ebc: c8 22 80 00 st %g4, [ %o2 ] * There is no way for this to happen if POSIX is enabled. */ #if !defined(RTEMS_POSIX_API) if ( !api_information ) { *location = OBJECTS_ERROR; goto done; 2008ec0: 81 c3 e0 08 retl <== NOT EXECUTED 2008ec4: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 0200e714 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e714: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200e718: 03 00 80 58 sethi %hi(0x2016000), %g1 200e71c: e0 00 61 38 ld [ %g1 + 0x138 ], %l0 ! 2016138 <_Per_CPU_Information+0xc> /* * Some CPUs need to tinker with the call frame or registers when the * thread actually begins to execute for the first time. This is a * hook point where the port gets a shot at doing whatever it requires. */ _Context_Initialization_at_thread_begin(); 200e720: 3f 00 80 39 sethi %hi(0x200e400), %i7 200e724: be 17 e3 14 or %i7, 0x314, %i7 ! 200e714 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e728: d0 04 20 ac ld [ %l0 + 0xac ], %o0 _ISR_Set_level(level); 200e72c: 7f ff ce e3 call 20022b8 200e730: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e734: 03 00 80 56 sethi %hi(0x2015800), %g1 doneConstructors = 1; 200e738: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e73c: e4 08 63 9c ldub [ %g1 + 0x39c ], %l2 doneConstructors = 1; 200e740: c4 28 63 9c stb %g2, [ %g1 + 0x39c ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e744: c2 04 21 50 ld [ %l0 + 0x150 ], %g1 200e748: 80 a0 60 00 cmp %g1, 0 200e74c: 02 80 00 0b be 200e778 <_Thread_Handler+0x64> 200e750: 23 00 80 57 sethi %hi(0x2015c00), %l1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 200e754: d0 04 63 64 ld [ %l1 + 0x364 ], %o0 ! 2015f64 <_Thread_Allocated_fp> 200e758: 80 a4 00 08 cmp %l0, %o0 200e75c: 02 80 00 07 be 200e778 <_Thread_Handler+0x64> 200e760: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e764: 22 80 00 05 be,a 200e778 <_Thread_Handler+0x64> 200e768: e0 24 63 64 st %l0, [ %l1 + 0x364 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e76c: 7f ff ee a0 call 200a1ec <_CPU_Context_save_fp> 200e770: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e774: e0 24 63 64 st %l0, [ %l1 + 0x364 ] /* * Take care that 'begin' extensions get to complete before * 'switch' extensions can run. This means must keep dispatch * disabled until all 'begin' extensions complete. */ _User_extensions_Thread_begin( executing ); 200e778: 7f ff ed 02 call 2009b80 <_User_extensions_Thread_begin> 200e77c: 90 10 00 10 mov %l0, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e780: 7f ff e9 99 call 2008de4 <_Thread_Enable_dispatch> 200e784: a5 2c a0 18 sll %l2, 0x18, %l2 /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { 200e788: 80 a4 a0 00 cmp %l2, 0 200e78c: 02 80 00 0c be 200e7bc <_Thread_Handler+0xa8> 200e790: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e794: c2 04 20 94 ld [ %l0 + 0x94 ], %g1 200e798: 80 a0 60 00 cmp %g1, 0 200e79c: 22 80 00 0f be,a 200e7d8 <_Thread_Handler+0xc4> <== ALWAYS TAKEN 200e7a0: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 200e7a4: 7f ff ed 0b call 2009bd0 <_User_extensions_Thread_exitted> 200e7a8: 90 10 00 10 mov %l0, %o0 _Internal_error_Occurred( 200e7ac: 90 10 20 00 clr %o0 200e7b0: 92 10 20 01 mov 1, %o1 200e7b4: 7f ff e4 c4 call 2007ac4 <_Internal_error_Occurred> 200e7b8: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { INIT_NAME (); 200e7bc: 40 00 1a 93 call 2015208 <_init> 200e7c0: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e7c4: c2 04 20 94 ld [ %l0 + 0x94 ], %g1 200e7c8: 80 a0 60 00 cmp %g1, 0 200e7cc: 12 bf ff f6 bne 200e7a4 <_Thread_Handler+0x90> <== NEVER TAKEN 200e7d0: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e7d4: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 200e7d8: 9f c0 40 00 call %g1 200e7dc: d0 04 20 9c ld [ %l0 + 0x9c ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200e7e0: 10 bf ff f1 b 200e7a4 <_Thread_Handler+0x90> 200e7e4: d0 24 20 28 st %o0, [ %l0 + 0x28 ] =============================================================================== 02008ec8 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008ec8: 9d e3 bf a0 save %sp, -96, %sp 2008ecc: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 2008ed0: e0 0f a0 5f ldub [ %fp + 0x5f ], %l0 2008ed4: e2 00 40 00 ld [ %g1 ], %l1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 2008ed8: c0 26 61 58 clr [ %i1 + 0x158 ] 2008edc: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008ee0: c0 26 61 54 clr [ %i1 + 0x154 ] /* * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 2008ee4: 90 10 00 19 mov %i1, %o0 2008ee8: 40 00 02 5b call 2009854 <_Thread_Stack_Allocate> 2008eec: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008ef0: 80 a2 00 1b cmp %o0, %i3 2008ef4: 0a 80 00 4c bcs 2009024 <_Thread_Initialize+0x15c> 2008ef8: 80 a2 20 00 cmp %o0, 0 2008efc: 02 80 00 4a be 2009024 <_Thread_Initialize+0x15c> <== NEVER TAKEN 2008f00: a4 10 20 00 clr %l2 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008f04: c2 06 60 c0 ld [ %i1 + 0xc0 ], %g1 the_stack->size = size; 2008f08: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008f0c: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 2008f10: 80 8f 20 ff btst 0xff, %i4 2008f14: 12 80 00 46 bne 200902c <_Thread_Initialize+0x164> 2008f18: 82 10 20 00 clr %g1 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008f1c: 27 00 80 57 sethi %hi(0x2015c00), %l3 2008f20: c4 04 e3 94 ld [ %l3 + 0x394 ], %g2 ! 2015f94 <_Thread_Maximum_extensions> fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 2008f24: c2 26 61 50 st %g1, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2008f28: c2 26 60 bc st %g1, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008f2c: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008f30: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008f34: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008f38: 80 a0 a0 00 cmp %g2, 0 2008f3c: 12 80 00 4b bne 2009068 <_Thread_Initialize+0x1a0> 2008f40: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2008f44: c0 26 61 60 clr [ %i1 + 0x160 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 2008f48: b6 10 20 00 clr %i3 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2008f4c: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 Scheduler_Control *the_scheduler, Thread_Control *the_thread ) { return the_scheduler->Operations.scheduler_allocate( the_scheduler, the_thread ); 2008f50: 11 00 80 57 sethi %hi(0x2015c00), %o0 2008f54: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; 2008f58: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 2008f5c: 90 12 23 68 or %o0, 0x368, %o0 2008f60: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008f64: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 RTEMS_INLINE_ROUTINE void* _Scheduler_Thread_scheduler_allocate( Scheduler_Control *the_scheduler, Thread_Control *the_thread ) { return 2008f68: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 2008f6c: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2008f70: 84 10 20 01 mov 1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008f74: e0 2e 60 a0 stb %l0, [ %i1 + 0xa0 ] } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 2008f78: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2008f7c: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008f80: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2008f84: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2008f88: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2008f8c: 9f c0 40 00 call %g1 2008f90: 92 10 00 19 mov %i1, %o1 sched =_Scheduler_Thread_scheduler_allocate( &_Scheduler, the_thread ); if ( !sched ) 2008f94: a0 92 20 00 orcc %o0, 0, %l0 2008f98: 22 80 00 13 be,a 2008fe4 <_Thread_Initialize+0x11c> 2008f9c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2008fa0: 90 10 00 19 mov %i1, %o0 2008fa4: 40 00 01 e8 call 2009744 <_Thread_Set_priority> 2008fa8: 92 10 00 1d mov %i5, %o1 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2008fac: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008fb0: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 2008fb4: c0 26 60 84 clr [ %i1 + 0x84 ] 2008fb8: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008fbc: 83 28 60 02 sll %g1, 2, %g1 2008fc0: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008fc4: e2 26 60 0c st %l1, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 2008fc8: 90 10 00 19 mov %i1, %o0 2008fcc: 40 00 03 28 call 2009c6c <_User_extensions_Thread_create> 2008fd0: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008fd4: 80 8a 20 ff btst 0xff, %o0 2008fd8: 12 80 00 35 bne 20090ac <_Thread_Initialize+0x1e4> 2008fdc: 01 00 00 00 nop return true; failed: _Workspace_Free( the_thread->libc_reent ); 2008fe0: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 2008fe4: 40 00 04 69 call 200a188 <_Workspace_Free> 2008fe8: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 2008fec: 40 00 04 67 call 200a188 <_Workspace_Free> 2008ff0: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008ff4: 40 00 04 65 call 200a188 <_Workspace_Free> 2008ff8: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 2008ffc: 40 00 04 63 call 200a188 <_Workspace_Free> 2009000: 90 10 00 1b mov %i3, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2009004: 40 00 04 61 call 200a188 <_Workspace_Free> 2009008: 90 10 00 12 mov %l2, %o0 #endif _Workspace_Free( sched ); 200900c: 40 00 04 5f call 200a188 <_Workspace_Free> 2009010: 90 10 00 10 mov %l0, %o0 _Thread_Stack_Free( the_thread ); 2009014: 40 00 02 2b call 20098c0 <_Thread_Stack_Free> 2009018: 90 10 00 19 mov %i1, %o0 return false; 200901c: 81 c7 e0 08 ret 2009020: 81 e8 00 00 restore } 2009024: 81 c7 e0 08 ret 2009028: 91 e8 20 00 restore %g0, 0, %o0 /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 200902c: 40 00 04 4e call 200a164 <_Workspace_Allocate> 2009030: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2009034: a4 92 20 00 orcc %o0, 0, %l2 2009038: 02 80 00 1f be 20090b4 <_Thread_Initialize+0x1ec> 200903c: 82 10 00 12 mov %l2, %g1 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009040: 27 00 80 57 sethi %hi(0x2015c00), %l3 2009044: c4 04 e3 94 ld [ %l3 + 0x394 ], %g2 ! 2015f94 <_Thread_Maximum_extensions> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2009048: c0 26 60 50 clr [ %i1 + 0x50 ] fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 200904c: c2 26 61 50 st %g1, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2009050: c2 26 60 bc st %g1, [ %i1 + 0xbc ] the_watchdog->routine = routine; 2009054: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2009058: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200905c: 80 a0 a0 00 cmp %g2, 0 2009060: 02 bf ff b9 be 2008f44 <_Thread_Initialize+0x7c> 2009064: c0 26 60 6c clr [ %i1 + 0x6c ] extensions_area = _Workspace_Allocate( 2009068: 84 00 a0 01 inc %g2 200906c: 40 00 04 3e call 200a164 <_Workspace_Allocate> 2009070: 91 28 a0 02 sll %g2, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2009074: b6 92 20 00 orcc %o0, 0, %i3 2009078: 02 80 00 12 be 20090c0 <_Thread_Initialize+0x1f8> 200907c: c6 04 e3 94 ld [ %l3 + 0x394 ], %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2009080: f6 26 61 60 st %i3, [ %i1 + 0x160 ] * 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++ ) 2009084: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009088: 82 10 20 00 clr %g1 * 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; 200908c: 85 28 a0 02 sll %g2, 2, %g2 2009090: c0 26 c0 02 clr [ %i3 + %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++ ) 2009094: 82 00 60 01 inc %g1 2009098: 80 a0 c0 01 cmp %g3, %g1 200909c: 1a bf ff fc bcc 200908c <_Thread_Initialize+0x1c4> 20090a0: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 20090a4: 10 bf ff ab b 2008f50 <_Thread_Initialize+0x88> 20090a8: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 20090ac: 81 c7 e0 08 ret 20090b0: 81 e8 00 00 restore * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 20090b4: b6 10 20 00 clr %i3 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; 20090b8: 10 bf ff ca b 2008fe0 <_Thread_Initialize+0x118> 20090bc: a0 10 20 00 clr %l0 20090c0: 10 bf ff c8 b 2008fe0 <_Thread_Initialize+0x118> 20090c4: a0 10 20 00 clr %l0 =============================================================================== 0200d0c8 <_Thread_Resume>: void _Thread_Resume( Thread_Control *the_thread, bool force ) { 200d0c8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 200d0cc: 7f ff d4 e6 call 2002464 200d0d0: 01 00 00 00 nop 200d0d4: a0 10 00 08 mov %o0, %l0 current_state = the_thread->current_state; 200d0d8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 if ( current_state & STATES_SUSPENDED ) { 200d0dc: 80 88 60 02 btst 2, %g1 200d0e0: 02 80 00 05 be 200d0f4 <_Thread_Resume+0x2c> <== NEVER TAKEN 200d0e4: 82 08 7f fd and %g1, -3, %g1 current_state = the_thread->current_state = _States_Clear(STATES_SUSPENDED, current_state); if ( _States_Is_ready( current_state ) ) { 200d0e8: 80 a0 60 00 cmp %g1, 0 200d0ec: 02 80 00 04 be 200d0fc <_Thread_Resume+0x34> 200d0f0: c2 26 20 10 st %g1, [ %i0 + 0x10 ] _Scheduler_Unblock( &_Scheduler, the_thread ); } } _ISR_Enable( level ); 200d0f4: 7f ff d4 e0 call 2002474 200d0f8: 91 e8 00 10 restore %g0, %l0, %o0 RTEMS_INLINE_ROUTINE void _Scheduler_Unblock( Scheduler_Control *the_scheduler, Thread_Control *the_thread ) { the_scheduler->Operations.unblock( the_scheduler, the_thread ); 200d0fc: 11 00 80 67 sethi %hi(0x2019c00), %o0 200d100: 90 12 22 28 or %o0, 0x228, %o0 ! 2019e28 <_Scheduler> 200d104: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 200d108: 9f c0 40 00 call %g1 200d10c: 92 10 00 18 mov %i0, %o1 200d110: 7f ff d4 d9 call 2002474 200d114: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 02009684 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009684: 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 ) 2009688: 80 a6 20 00 cmp %i0, 0 200968c: 02 80 00 13 be 20096d8 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 2009690: 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 ) { 2009694: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 2009698: 80 a4 60 01 cmp %l1, 1 200969c: 02 80 00 04 be 20096ac <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 20096a0: 01 00 00 00 nop 20096a4: 81 c7 e0 08 ret 20096a8: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 20096ac: 7f ff e2 ff call 20022a8 20096b0: 01 00 00 00 nop 20096b4: a0 10 00 08 mov %o0, %l0 20096b8: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 20096bc: 03 00 00 ef sethi %hi(0x3bc00), %g1 20096c0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 20096c4: 80 88 80 01 btst %g2, %g1 20096c8: 12 80 00 06 bne 20096e0 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 20096cc: 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 ); 20096d0: 7f ff e2 fa call 20022b8 20096d4: 90 10 00 10 mov %l0, %o0 20096d8: 81 c7 e0 08 ret 20096dc: 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 ); 20096e0: 92 10 00 19 mov %i1, %o1 20096e4: 94 10 20 01 mov 1, %o2 20096e8: 40 00 0d cf call 200ce24 <_Thread_queue_Extract_priority_helper> 20096ec: e2 26 20 30 st %l1, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 20096f0: 90 10 00 18 mov %i0, %o0 20096f4: 92 10 00 19 mov %i1, %o1 20096f8: 7f ff ff 31 call 20093bc <_Thread_queue_Enqueue_priority> 20096fc: 94 07 bf fc add %fp, -4, %o2 2009700: 30 bf ff f4 b,a 20096d0 <_Thread_queue_Requeue+0x4c> =============================================================================== 02009704 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009704: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009708: 90 10 00 18 mov %i0, %o0 200970c: 7f ff fd c4 call 2008e1c <_Thread_Get> 2009710: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009714: c2 07 bf fc ld [ %fp + -4 ], %g1 2009718: 80 a0 60 00 cmp %g1, 0 200971c: 12 80 00 08 bne 200973c <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 2009720: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009724: 40 00 0d fb call 200cf10 <_Thread_queue_Process_timeout> 2009728: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 200972c: 03 00 80 57 sethi %hi(0x2015c00), %g1 2009730: c4 00 62 e0 ld [ %g1 + 0x2e0 ], %g2 ! 2015ee0 <_Thread_Dispatch_disable_level> 2009734: 84 00 bf ff add %g2, -1, %g2 2009738: c4 20 62 e0 st %g2, [ %g1 + 0x2e0 ] 200973c: 81 c7 e0 08 ret 2009740: 81 e8 00 00 restore =============================================================================== 020168cc <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 20168cc: 9d e3 bf 88 save %sp, -120, %sp 20168d0: 2f 00 80 f4 sethi %hi(0x203d000), %l7 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20168d4: ba 07 bf f4 add %fp, -12, %i5 20168d8: aa 07 bf f8 add %fp, -8, %l5 20168dc: a4 07 bf e8 add %fp, -24, %l2 20168e0: a8 07 bf ec add %fp, -20, %l4 20168e4: 2d 00 80 f4 sethi %hi(0x203d000), %l6 20168e8: 39 00 80 f4 sethi %hi(0x203d000), %i4 20168ec: ea 27 bf f4 st %l5, [ %fp + -12 ] head->previous = NULL; 20168f0: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20168f4: fa 27 bf fc st %i5, [ %fp + -4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20168f8: e8 27 bf e8 st %l4, [ %fp + -24 ] head->previous = NULL; 20168fc: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2016900: e4 27 bf f0 st %l2, [ %fp + -16 ] 2016904: ae 15 e3 14 or %l7, 0x314, %l7 2016908: a2 06 20 30 add %i0, 0x30, %l1 201690c: ac 15 a2 8c or %l6, 0x28c, %l6 2016910: a6 06 20 68 add %i0, 0x68, %l3 2016914: b8 17 21 e0 or %i4, 0x1e0, %i4 2016918: b4 06 20 08 add %i0, 8, %i2 201691c: b6 06 20 40 add %i0, 0x40, %i3 Chain_Control *tmp; /* * 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; 2016920: fa 26 20 78 st %i5, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016924: c2 05 c0 00 ld [ %l7 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016928: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201692c: 94 10 00 12 mov %l2, %o2 2016930: 90 10 00 11 mov %l1, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016934: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016938: 40 00 12 9a call 201b3a0 <_Watchdog_Adjust_to_chain> 201693c: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016940: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016944: e0 05 80 00 ld [ %l6 ], %l0 /* * 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 ) { 2016948: 80 a4 00 0a cmp %l0, %o2 201694c: 18 80 00 43 bgu 2016a58 <_Timer_server_Body+0x18c> 2016950: 92 24 00 0a sub %l0, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2016954: 0a 80 00 39 bcs 2016a38 <_Timer_server_Body+0x16c> 2016958: 90 10 00 13 mov %l3, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 201695c: e0 26 20 74 st %l0, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2016960: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016964: 40 00 02 f4 call 2017534 <_Chain_Get> 2016968: 01 00 00 00 nop if ( timer == NULL ) { 201696c: 92 92 20 00 orcc %o0, 0, %o1 2016970: 02 80 00 10 be 20169b0 <_Timer_server_Body+0xe4> 2016974: 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 ) { 2016978: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 201697c: 80 a0 60 01 cmp %g1, 1 2016980: 02 80 00 32 be 2016a48 <_Timer_server_Body+0x17c> 2016984: 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 ) { 2016988: 12 bf ff f6 bne 2016960 <_Timer_server_Body+0x94> <== NEVER TAKEN 201698c: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016990: 40 00 12 b7 call 201b46c <_Watchdog_Insert> 2016994: 90 10 00 13 mov %l3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2016998: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 201699c: 40 00 02 e6 call 2017534 <_Chain_Get> 20169a0: 01 00 00 00 nop if ( timer == NULL ) { 20169a4: 92 92 20 00 orcc %o0, 0, %o1 20169a8: 32 bf ff f5 bne,a 201697c <_Timer_server_Body+0xb0> <== NEVER TAKEN 20169ac: 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 ); 20169b0: 7f ff e2 34 call 200f280 20169b4: 01 00 00 00 nop tmp = ts->insert_chain; 20169b8: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 if ( _Chain_Is_empty( insert_chain ) ) { 20169bc: c2 07 bf f4 ld [ %fp + -12 ], %g1 20169c0: 80 a0 40 15 cmp %g1, %l5 20169c4: 02 80 00 29 be 2016a68 <_Timer_server_Body+0x19c> <== ALWAYS TAKEN 20169c8: a0 10 20 01 mov 1, %l0 ts->insert_chain = NULL; do_loop = false; } _ISR_Enable( level ); 20169cc: 7f ff e2 31 call 200f290 20169d0: 01 00 00 00 nop * 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; while ( do_loop ) { 20169d4: 80 8c 20 ff btst 0xff, %l0 20169d8: 12 bf ff d3 bne 2016924 <_Timer_server_Body+0x58> <== NEVER TAKEN 20169dc: c2 07 bf e8 ld [ %fp + -24 ], %g1 _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 ) ) { 20169e0: 80 a0 40 14 cmp %g1, %l4 20169e4: 12 80 00 0c bne 2016a14 <_Timer_server_Body+0x148> 20169e8: 01 00 00 00 nop 20169ec: 30 80 00 22 b,a 2016a74 <_Timer_server_Body+0x1a8> 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; 20169f0: e4 20 60 04 st %l2, [ %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; 20169f4: c2 27 bf e8 st %g1, [ %fp + -24 ] * 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; 20169f8: c0 24 20 08 clr [ %l0 + 8 ] _ISR_Enable( level ); 20169fc: 7f ff e2 25 call 200f290 2016a00: 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 ); 2016a04: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 2016a08: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 2016a0c: 9f c0 40 00 call %g1 2016a10: d2 04 20 24 ld [ %l0 + 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 ); 2016a14: 7f ff e2 1b call 200f280 2016a18: 01 00 00 00 nop initialized = false; } #endif return status; } 2016a1c: e0 07 bf e8 ld [ %fp + -24 ], %l0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 2016a20: 80 a4 00 14 cmp %l0, %l4 2016a24: 32 bf ff f3 bne,a 20169f0 <_Timer_server_Body+0x124> 2016a28: c2 04 00 00 ld [ %l0 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2016a2c: 7f ff e2 19 call 200f290 2016a30: 01 00 00 00 nop 2016a34: 30 bf ff bb b,a 2016920 <_Timer_server_Body+0x54> /* * 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 ); 2016a38: 92 10 20 01 mov 1, %o1 ! 1 2016a3c: 40 00 12 29 call 201b2e0 <_Watchdog_Adjust> 2016a40: 94 22 80 10 sub %o2, %l0, %o2 2016a44: 30 bf ff c6 b,a 201695c <_Timer_server_Body+0x90> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2016a48: 90 10 00 11 mov %l1, %o0 2016a4c: 40 00 12 88 call 201b46c <_Watchdog_Insert> 2016a50: 92 02 60 10 add %o1, 0x10, %o1 2016a54: 30 bf ff c3 b,a 2016960 <_Timer_server_Body+0x94> /* * 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 ); 2016a58: 90 10 00 13 mov %l3, %o0 2016a5c: 40 00 12 51 call 201b3a0 <_Watchdog_Adjust_to_chain> 2016a60: 94 10 00 12 mov %l2, %o2 2016a64: 30 bf ff be b,a 201695c <_Timer_server_Body+0x90> _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); tmp = ts->insert_chain; if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 2016a68: c0 26 20 78 clr [ %i0 + 0x78 ] do_loop = false; 2016a6c: 10 bf ff d8 b 20169cc <_Timer_server_Body+0x100> 2016a70: a0 10 20 00 clr %l0 * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2016a74: c0 2e 20 7c clrb [ %i0 + 0x7c ] 2016a78: c2 07 00 00 ld [ %i4 ], %g1 2016a7c: 82 00 60 01 inc %g1 2016a80: c2 27 00 00 st %g1, [ %i4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016a84: d0 06 00 00 ld [ %i0 ], %o0 2016a88: 40 00 10 30 call 201ab48 <_Thread_Set_state> 2016a8c: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2016a90: 7f ff ff 65 call 2016824 <_Timer_server_Reset_interval_system_watchdog> 2016a94: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016a98: 7f ff ff 78 call 2016878 <_Timer_server_Reset_tod_system_watchdog> 2016a9c: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2016aa0: 40 00 0d 91 call 201a0e4 <_Thread_Enable_dispatch> 2016aa4: 01 00 00 00 nop ts->active = true; 2016aa8: 82 10 20 01 mov 1, %g1 ! 1 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016aac: 90 10 00 1a mov %i2, %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; 2016ab0: c2 2e 20 7c stb %g1, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016ab4: 40 00 12 d9 call 201b618 <_Watchdog_Remove> 2016ab8: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016abc: 40 00 12 d7 call 201b618 <_Watchdog_Remove> 2016ac0: 90 10 00 1b mov %i3, %o0 2016ac4: 30 bf ff 97 b,a 2016920 <_Timer_server_Body+0x54> =============================================================================== 02016ac8 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2016ac8: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2016acc: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2016ad0: 80 a0 60 00 cmp %g1, 0 2016ad4: 02 80 00 05 be 2016ae8 <_Timer_server_Schedule_operation_method+0x20> 2016ad8: a0 10 00 19 mov %i1, %l0 * 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 ); 2016adc: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2016ae0: 40 00 02 7f call 20174dc <_Chain_Append> 2016ae4: 81 e8 00 00 restore 2016ae8: 03 00 80 f4 sethi %hi(0x203d000), %g1 2016aec: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 203d1e0 <_Thread_Dispatch_disable_level> 2016af0: 84 00 a0 01 inc %g2 2016af4: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2016af8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2016afc: 80 a0 60 01 cmp %g1, 1 2016b00: 02 80 00 28 be 2016ba0 <_Timer_server_Schedule_operation_method+0xd8> 2016b04: 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 ) { 2016b08: 02 80 00 04 be 2016b18 <_Timer_server_Schedule_operation_method+0x50> 2016b0c: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016b10: 40 00 0d 75 call 201a0e4 <_Thread_Enable_dispatch> 2016b14: 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 ); 2016b18: 7f ff e1 da call 200f280 2016b1c: 01 00 00 00 nop initialized = false; } #endif return status; } 2016b20: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016b24: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016b28: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016b2c: 03 00 80 f4 sethi %hi(0x203d000), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2016b30: 80 a0 80 04 cmp %g2, %g4 2016b34: 02 80 00 0d be 2016b68 <_Timer_server_Schedule_operation_method+0xa0> 2016b38: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2016b3c: da 00 a0 10 ld [ %g2 + 0x10 ], %o5 if ( snapshot > last_snapshot ) { 2016b40: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016b44: 88 03 40 03 add %o5, %g3, %g4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2016b48: 08 80 00 07 bleu 2016b64 <_Timer_server_Schedule_operation_method+0x9c> 2016b4c: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2016b50: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 2016b54: 80 a3 40 03 cmp %o5, %g3 2016b58: 08 80 00 03 bleu 2016b64 <_Timer_server_Schedule_operation_method+0x9c><== NEVER TAKEN 2016b5c: 88 10 20 00 clr %g4 delta_interval -= delta; 2016b60: 88 23 40 03 sub %o5, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2016b64: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2016b68: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2016b6c: 7f ff e1 c9 call 200f290 2016b70: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016b74: 90 06 20 68 add %i0, 0x68, %o0 2016b78: 40 00 12 3d call 201b46c <_Watchdog_Insert> 2016b7c: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 2016b80: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016b84: 80 a0 60 00 cmp %g1, 0 2016b88: 12 bf ff e2 bne 2016b10 <_Timer_server_Schedule_operation_method+0x48> 2016b8c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2016b90: 7f ff ff 3a call 2016878 <_Timer_server_Reset_tod_system_watchdog> 2016b94: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016b98: 40 00 0d 53 call 201a0e4 <_Thread_Enable_dispatch> 2016b9c: 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 ); 2016ba0: 7f ff e1 b8 call 200f280 2016ba4: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016ba8: 05 00 80 f4 sethi %hi(0x203d000), %g2 initialized = false; } #endif return status; } 2016bac: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = _Watchdog_Ticks_since_boot; 2016bb0: c4 00 a3 14 ld [ %g2 + 0x314 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2016bb4: c8 06 20 3c ld [ %i0 + 0x3c ], %g4 2016bb8: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2016bbc: 80 a0 40 03 cmp %g1, %g3 2016bc0: 02 80 00 08 be 2016be0 <_Timer_server_Schedule_operation_method+0x118> 2016bc4: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2016bc8: da 00 60 10 ld [ %g1 + 0x10 ], %o5 if (delta_interval > delta) { 2016bcc: 80 a1 00 0d cmp %g4, %o5 2016bd0: 1a 80 00 03 bcc 2016bdc <_Timer_server_Schedule_operation_method+0x114> 2016bd4: 86 10 20 00 clr %g3 delta_interval -= delta; 2016bd8: 86 23 40 04 sub %o5, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2016bdc: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2016be0: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2016be4: 7f ff e1 ab call 200f290 2016be8: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2016bec: 90 06 20 30 add %i0, 0x30, %o0 2016bf0: 40 00 12 1f call 201b46c <_Watchdog_Insert> 2016bf4: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 2016bf8: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016bfc: 80 a0 60 00 cmp %g1, 0 2016c00: 12 bf ff c4 bne 2016b10 <_Timer_server_Schedule_operation_method+0x48> 2016c04: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2016c08: 7f ff ff 07 call 2016824 <_Timer_server_Reset_interval_system_watchdog> 2016c0c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016c10: 40 00 0d 35 call 201a0e4 <_Thread_Enable_dispatch> 2016c14: 81 e8 00 00 restore =============================================================================== 02009a0c <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 2009a0c: 9d e3 bf a0 save %sp, -96, %sp 2009a10: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009a14: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 2009a18: c8 06 60 04 ld [ %i1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 2009a1c: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 2009a20: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009a24: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 2009a28: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009a2c: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009a30: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 2009a34: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 2009a38: 80 a0 80 04 cmp %g2, %g4 2009a3c: 08 80 00 0b bleu 2009a68 <_Timespec_Add_to+0x5c> 2009a40: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2009a44: 1b 31 19 4d sethi %hi(0xc4653400), %o5 2009a48: 9a 13 62 00 or %o5, 0x200, %o5 ! c4653600 2009a4c: 84 00 80 0d add %g2, %o5, %g2 * * This routines adds two timespecs. The second argument is added * to the first. */ uint32_t _Timespec_Add_to( 2009a50: 86 00 e0 01 inc %g3 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009a54: 80 a0 80 04 cmp %g2, %g4 2009a58: 18 bf ff fd bgu 2009a4c <_Timespec_Add_to+0x40> <== NEVER TAKEN 2009a5c: b0 06 20 01 inc %i0 2009a60: c4 20 60 04 st %g2, [ %g1 + 4 ] 2009a64: c6 20 40 00 st %g3, [ %g1 ] time->tv_sec++; seconds++; } return seconds; } 2009a68: 81 c7 e0 08 ret 2009a6c: 81 e8 00 00 restore =============================================================================== 0200b990 <_Timespec_Greater_than>: bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { if ( lhs->tv_sec > rhs->tv_sec ) 200b990: c6 02 00 00 ld [ %o0 ], %g3 200b994: c4 02 40 00 ld [ %o1 ], %g2 bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { 200b998: 82 10 00 08 mov %o0, %g1 if ( lhs->tv_sec > rhs->tv_sec ) 200b99c: 80 a0 c0 02 cmp %g3, %g2 200b9a0: 14 80 00 0a bg 200b9c8 <_Timespec_Greater_than+0x38> 200b9a4: 90 10 20 01 mov 1, %o0 return true; if ( lhs->tv_sec < rhs->tv_sec ) 200b9a8: 80 a0 c0 02 cmp %g3, %g2 200b9ac: 06 80 00 07 bl 200b9c8 <_Timespec_Greater_than+0x38> <== NEVER TAKEN 200b9b0: 90 10 20 00 clr %o0 #include #include #include bool _Timespec_Greater_than( 200b9b4: c4 00 60 04 ld [ %g1 + 4 ], %g2 200b9b8: c2 02 60 04 ld [ %o1 + 4 ], %g1 200b9bc: 80 a0 80 01 cmp %g2, %g1 200b9c0: 04 80 00 04 ble 200b9d0 <_Timespec_Greater_than+0x40> 200b9c4: 90 10 20 01 mov 1, %o0 /* ASSERT: lhs->tv_sec == rhs->tv_sec */ if ( lhs->tv_nsec > rhs->tv_nsec ) return true; return false; } 200b9c8: 81 c3 e0 08 retl 200b9cc: 01 00 00 00 nop 200b9d0: 81 c3 e0 08 retl 200b9d4: 90 10 20 00 clr %o0 ! 0 =============================================================================== 02009c1c <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 2009c1c: 9d e3 bf a0 save %sp, -96, %sp the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); } } 2009c20: 23 00 80 58 sethi %hi(0x2016000), %l1 2009c24: a2 14 60 e8 or %l1, 0xe8, %l1 ! 20160e8 <_User_extensions_List> 2009c28: e0 04 60 08 ld [ %l1 + 8 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009c2c: 80 a4 00 11 cmp %l0, %l1 2009c30: 02 80 00 0d be 2009c64 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 2009c34: b2 0e 60 ff and %i1, 0xff, %i1 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 2009c38: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 2009c3c: 80 a0 60 00 cmp %g1, 0 2009c40: 02 80 00 05 be 2009c54 <_User_extensions_Fatal+0x38> 2009c44: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 2009c48: 92 10 00 19 mov %i1, %o1 2009c4c: 9f c0 40 00 call %g1 2009c50: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 2009c54: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009c58: 80 a4 00 11 cmp %l0, %l1 2009c5c: 32 bf ff f8 bne,a 2009c3c <_User_extensions_Fatal+0x20> 2009c60: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 2009c64: 81 c7 e0 08 ret 2009c68: 81 e8 00 00 restore =============================================================================== 02009ac8 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009ac8: 9d e3 bf a0 save %sp, -96, %sp User_extensions_Control *extension; uint32_t i; uint32_t number_of_extensions; User_extensions_Table *initial_extensions; number_of_extensions = Configuration.number_of_initial_extensions; 2009acc: 07 00 80 54 sethi %hi(0x2015000), %g3 2009ad0: 86 10 e3 08 or %g3, 0x308, %g3 ! 2015308 initial_extensions = Configuration.User_extension_table; 2009ad4: e6 00 e0 40 ld [ %g3 + 0x40 ], %l3 2009ad8: 1b 00 80 58 sethi %hi(0x2016000), %o5 2009adc: 09 00 80 57 sethi %hi(0x2015c00), %g4 2009ae0: 84 13 60 e8 or %o5, 0xe8, %g2 2009ae4: 82 11 22 e4 or %g4, 0x2e4, %g1 2009ae8: 96 00 a0 04 add %g2, 4, %o3 2009aec: 98 00 60 04 add %g1, 4, %o4 2009af0: d6 23 60 e8 st %o3, [ %o5 + 0xe8 ] head->previous = NULL; 2009af4: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 2009af8: c4 20 a0 08 st %g2, [ %g2 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009afc: d8 21 22 e4 st %o4, [ %g4 + 0x2e4 ] head->previous = NULL; 2009b00: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009b04: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009b08: 80 a4 e0 00 cmp %l3, 0 2009b0c: 02 80 00 1b be 2009b78 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009b10: e4 00 e0 3c ld [ %g3 + 0x3c ], %l2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009b14: 83 2c a0 02 sll %l2, 2, %g1 2009b18: a3 2c a0 04 sll %l2, 4, %l1 2009b1c: a2 24 40 01 sub %l1, %g1, %l1 2009b20: a2 04 40 12 add %l1, %l2, %l1 2009b24: a3 2c 60 02 sll %l1, 2, %l1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( 2009b28: 40 00 01 a2 call 200a1b0 <_Workspace_Allocate_or_fatal_error> 2009b2c: 90 10 00 11 mov %l1, %o0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009b30: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( 2009b34: a0 10 00 08 mov %o0, %l0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009b38: 40 00 16 22 call 200f3c0 2009b3c: 94 10 00 11 mov %l1, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009b40: 80 a4 a0 00 cmp %l2, 0 2009b44: 02 80 00 0d be 2009b78 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009b48: a2 10 20 00 clr %l1 #include #include #include #include void _User_extensions_Handler_initialization(void) 2009b4c: 93 2c 60 05 sll %l1, 5, %o1 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 2009b50: 94 10 20 20 mov 0x20, %o2 2009b54: 92 04 c0 09 add %l3, %o1, %o1 2009b58: 40 00 15 e1 call 200f2dc 2009b5c: 90 04 20 14 add %l0, 0x14, %o0 _User_extensions_Add_set( extension ); 2009b60: 40 00 0d 11 call 200cfa4 <_User_extensions_Add_set> 2009b64: 90 10 00 10 mov %l0, %o0 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009b68: a2 04 60 01 inc %l1 2009b6c: 80 a4 80 11 cmp %l2, %l1 2009b70: 18 bf ff f7 bgu 2009b4c <_User_extensions_Handler_initialization+0x84> 2009b74: a0 04 20 34 add %l0, 0x34, %l0 2009b78: 81 c7 e0 08 ret 2009b7c: 81 e8 00 00 restore =============================================================================== 02009b80 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 2009b80: 9d e3 bf a0 save %sp, -96, %sp the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); } } 2009b84: 23 00 80 58 sethi %hi(0x2016000), %l1 2009b88: e0 04 60 e8 ld [ %l1 + 0xe8 ], %l0 ! 20160e8 <_User_extensions_List> 2009b8c: a2 14 60 e8 or %l1, 0xe8, %l1 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009b90: a2 04 60 04 add %l1, 4, %l1 2009b94: 80 a4 00 11 cmp %l0, %l1 2009b98: 02 80 00 0c be 2009bc8 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 2009b9c: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 2009ba0: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 2009ba4: 80 a0 60 00 cmp %g1, 0 2009ba8: 02 80 00 04 be 2009bb8 <_User_extensions_Thread_begin+0x38> 2009bac: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 2009bb0: 9f c0 40 00 call %g1 2009bb4: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 2009bb8: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009bbc: 80 a4 00 11 cmp %l0, %l1 2009bc0: 32 bf ff f9 bne,a 2009ba4 <_User_extensions_Thread_begin+0x24> 2009bc4: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 2009bc8: 81 c7 e0 08 ret 2009bcc: 81 e8 00 00 restore =============================================================================== 02009c6c <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 2009c6c: 9d e3 bf a0 save %sp, -96, %sp return false; } } return true; } 2009c70: 23 00 80 58 sethi %hi(0x2016000), %l1 2009c74: e0 04 60 e8 ld [ %l1 + 0xe8 ], %l0 ! 20160e8 <_User_extensions_List> #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 2009c78: a6 10 00 18 mov %i0, %l3 return false; } } return true; } 2009c7c: a2 14 60 e8 or %l1, 0xe8, %l1 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 2009c80: a2 04 60 04 add %l1, 4, %l1 2009c84: 80 a4 00 11 cmp %l0, %l1 2009c88: 02 80 00 13 be 2009cd4 <_User_extensions_Thread_create+0x68><== NEVER TAKEN 2009c8c: b0 10 20 01 mov 1, %i0 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 2009c90: 25 00 80 58 sethi %hi(0x2016000), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 2009c94: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 2009c98: 80 a0 60 00 cmp %g1, 0 2009c9c: 02 80 00 08 be 2009cbc <_User_extensions_Thread_create+0x50> 2009ca0: 84 14 a1 2c or %l2, 0x12c, %g2 status = (*the_extension->Callouts.thread_create)( 2009ca4: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009ca8: 9f c0 40 00 call %g1 2009cac: 92 10 00 13 mov %l3, %o1 _Thread_Executing, the_thread ); if ( !status ) 2009cb0: 80 8a 20 ff btst 0xff, %o0 2009cb4: 22 80 00 08 be,a 2009cd4 <_User_extensions_Thread_create+0x68> 2009cb8: b0 10 20 00 clr %i0 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 2009cbc: e0 04 00 00 ld [ %l0 ], %l0 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 2009cc0: 80 a4 00 11 cmp %l0, %l1 2009cc4: 32 bf ff f5 bne,a 2009c98 <_User_extensions_Thread_create+0x2c> 2009cc8: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 if ( !status ) return false; } } return true; 2009ccc: 81 c7 e0 08 ret 2009cd0: 91 e8 20 01 restore %g0, 1, %o0 } 2009cd4: 81 c7 e0 08 ret 2009cd8: 81 e8 00 00 restore =============================================================================== 02009cdc <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 2009cdc: 9d e3 bf a0 save %sp, -96, %sp (*the_extension->Callouts.thread_delete)( _Thread_Executing, the_thread ); } } 2009ce0: 23 00 80 58 sethi %hi(0x2016000), %l1 2009ce4: a2 14 60 e8 or %l1, 0xe8, %l1 ! 20160e8 <_User_extensions_List> 2009ce8: e0 04 60 08 ld [ %l1 + 8 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009cec: 80 a4 00 11 cmp %l0, %l1 2009cf0: 02 80 00 0d be 2009d24 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 2009cf4: 25 00 80 58 sethi %hi(0x2016000), %l2 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 2009cf8: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 2009cfc: 80 a0 60 00 cmp %g1, 0 2009d00: 02 80 00 05 be 2009d14 <_User_extensions_Thread_delete+0x38> 2009d04: 84 14 a1 2c or %l2, 0x12c, %g2 (*the_extension->Callouts.thread_delete)( 2009d08: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009d0c: 9f c0 40 00 call %g1 2009d10: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 2009d14: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009d18: 80 a4 00 11 cmp %l0, %l1 2009d1c: 32 bf ff f8 bne,a 2009cfc <_User_extensions_Thread_delete+0x20> 2009d20: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 2009d24: 81 c7 e0 08 ret 2009d28: 81 e8 00 00 restore =============================================================================== 02009bd0 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 2009bd0: 9d e3 bf a0 save %sp, -96, %sp the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); } } 2009bd4: 23 00 80 58 sethi %hi(0x2016000), %l1 2009bd8: a2 14 60 e8 or %l1, 0xe8, %l1 ! 20160e8 <_User_extensions_List> 2009bdc: e0 04 60 08 ld [ %l1 + 8 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009be0: 80 a4 00 11 cmp %l0, %l1 2009be4: 02 80 00 0c be 2009c14 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 2009be8: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 2009bec: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 2009bf0: 80 a0 60 00 cmp %g1, 0 2009bf4: 02 80 00 04 be 2009c04 <_User_extensions_Thread_exitted+0x34> 2009bf8: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 2009bfc: 9f c0 40 00 call %g1 2009c00: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 2009c04: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009c08: 80 a4 00 11 cmp %l0, %l1 2009c0c: 32 bf ff f9 bne,a 2009bf0 <_User_extensions_Thread_exitted+0x20> 2009c10: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 2009c14: 81 c7 e0 08 ret 2009c18: 81 e8 00 00 restore =============================================================================== 0200aa74 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200aa74: 9d e3 bf a0 save %sp, -96, %sp (*the_extension->Callouts.thread_restart)( _Thread_Executing, the_thread ); } } 200aa78: 23 00 80 75 sethi %hi(0x201d400), %l1 200aa7c: e0 04 62 f8 ld [ %l1 + 0x2f8 ], %l0 ! 201d6f8 <_User_extensions_List> 200aa80: a2 14 62 f8 or %l1, 0x2f8, %l1 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aa84: a2 04 60 04 add %l1, 4, %l1 200aa88: 80 a4 00 11 cmp %l0, %l1 200aa8c: 02 80 00 0d be 200aac0 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200aa90: 25 00 80 75 sethi %hi(0x201d400), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 200aa94: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 200aa98: 80 a0 60 00 cmp %g1, 0 200aa9c: 02 80 00 05 be 200aab0 <_User_extensions_Thread_restart+0x3c> 200aaa0: 84 14 a3 3c or %l2, 0x33c, %g2 (*the_extension->Callouts.thread_restart)( 200aaa4: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200aaa8: 9f c0 40 00 call %g1 200aaac: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200aab0: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200aab4: 80 a4 00 11 cmp %l0, %l1 200aab8: 32 bf ff f8 bne,a 200aa98 <_User_extensions_Thread_restart+0x24> 200aabc: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 200aac0: 81 c7 e0 08 ret 200aac4: 81 e8 00 00 restore =============================================================================== 02009d2c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 2009d2c: 9d e3 bf a0 save %sp, -96, %sp (*the_extension->Callouts.thread_start)( _Thread_Executing, the_thread ); } } 2009d30: 23 00 80 58 sethi %hi(0x2016000), %l1 2009d34: e0 04 60 e8 ld [ %l1 + 0xe8 ], %l0 ! 20160e8 <_User_extensions_List> 2009d38: a2 14 60 e8 or %l1, 0xe8, %l1 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009d3c: a2 04 60 04 add %l1, 4, %l1 2009d40: 80 a4 00 11 cmp %l0, %l1 2009d44: 02 80 00 0d be 2009d78 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 2009d48: 25 00 80 58 sethi %hi(0x2016000), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 2009d4c: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 2009d50: 80 a0 60 00 cmp %g1, 0 2009d54: 02 80 00 05 be 2009d68 <_User_extensions_Thread_start+0x3c> 2009d58: 84 14 a1 2c or %l2, 0x12c, %g2 (*the_extension->Callouts.thread_start)( 2009d5c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 2009d60: 9f c0 40 00 call %g1 2009d64: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 2009d68: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009d6c: 80 a4 00 11 cmp %l0, %l1 2009d70: 32 bf ff f8 bne,a 2009d50 <_User_extensions_Thread_start+0x24> 2009d74: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 2009d78: 81 c7 e0 08 ret 2009d7c: 81 e8 00 00 restore =============================================================================== 02009d80 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 2009d80: 9d e3 bf a0 save %sp, -96, %sp the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); } } 2009d84: 23 00 80 57 sethi %hi(0x2015c00), %l1 2009d88: e0 04 62 e4 ld [ %l1 + 0x2e4 ], %l0 ! 2015ee4 <_User_extensions_Switches_list> 2009d8c: a2 14 62 e4 or %l1, 0x2e4, %l1 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 2009d90: a2 04 60 04 add %l1, 4, %l1 2009d94: 80 a4 00 11 cmp %l0, %l1 2009d98: 02 80 00 0a be 2009dc0 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 2009d9c: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 2009da0: c2 04 20 08 ld [ %l0 + 8 ], %g1 2009da4: 90 10 00 18 mov %i0, %o0 2009da8: 9f c0 40 00 call %g1 2009dac: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 2009db0: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 2009db4: 80 a4 00 11 cmp %l0, %l1 2009db8: 32 bf ff fb bne,a 2009da4 <_User_extensions_Thread_switch+0x24> 2009dbc: c2 04 20 08 ld [ %l0 + 8 ], %g1 2009dc0: 81 c7 e0 08 ret 2009dc4: 81 e8 00 00 restore =============================================================================== 0200be20 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200be20: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200be24: 7f ff dd 00 call 2003224 200be28: a0 10 00 18 mov %i0, %l0 } } _ISR_Enable( level ); } 200be2c: 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 ); 200be30: a4 06 20 04 add %i0, 4, %l2 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200be34: 80 a0 40 12 cmp %g1, %l2 200be38: 02 80 00 1f be 200beb4 <_Watchdog_Adjust+0x94> 200be3c: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200be40: 12 80 00 1f bne 200bebc <_Watchdog_Adjust+0x9c> 200be44: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200be48: 80 a6 a0 00 cmp %i2, 0 200be4c: 02 80 00 1a be 200beb4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200be50: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200be54: e2 00 60 10 ld [ %g1 + 0x10 ], %l1 200be58: 80 a6 80 11 cmp %i2, %l1 200be5c: 1a 80 00 0b bcc 200be88 <_Watchdog_Adjust+0x68> <== ALWAYS TAKEN 200be60: a6 10 20 01 mov 1, %l3 _Watchdog_First( header )->delta_interval -= units; 200be64: 10 80 00 1d b 200bed8 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200be68: a2 24 40 1a sub %l1, %i2, %l1 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200be6c: b4 a6 80 11 subcc %i2, %l1, %i2 200be70: 02 80 00 11 be 200beb4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200be74: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200be78: e2 00 60 10 ld [ %g1 + 0x10 ], %l1 200be7c: 80 a4 40 1a cmp %l1, %i2 200be80: 38 80 00 16 bgu,a 200bed8 <_Watchdog_Adjust+0xb8> 200be84: a2 24 40 1a sub %l1, %i2, %l1 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200be88: e6 20 60 10 st %l3, [ %g1 + 0x10 ] _ISR_Enable( level ); 200be8c: 7f ff dc ea call 2003234 200be90: 01 00 00 00 nop _Watchdog_Tickle( header ); 200be94: 40 00 00 b4 call 200c164 <_Watchdog_Tickle> 200be98: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 200be9c: 7f ff dc e2 call 2003224 200bea0: 01 00 00 00 nop } } _ISR_Enable( level ); } 200bea4: c4 04 00 00 ld [ %l0 ], %g2 _Watchdog_Tickle( header ); _ISR_Disable( level ); if ( _Chain_Is_empty( header ) ) 200bea8: 80 a4 80 02 cmp %l2, %g2 200beac: 12 bf ff f0 bne 200be6c <_Watchdog_Adjust+0x4c> 200beb0: 82 10 00 02 mov %g2, %g1 } break; } } _ISR_Enable( level ); 200beb4: 7f ff dc e0 call 2003234 200beb8: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bebc: 12 bf ff fe bne 200beb4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200bec0: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bec4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bec8: b4 00 80 1a add %g2, %i2, %i2 200becc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bed0: 7f ff dc d9 call 2003234 200bed4: 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; 200bed8: 10 bf ff f7 b 200beb4 <_Watchdog_Adjust+0x94> 200bedc: e2 20 60 10 st %l1, [ %g1 + 0x10 ] =============================================================================== 02009f74 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009f74: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009f78: 7f ff e0 cc call 20022a8 2009f7c: 01 00 00 00 nop previous_state = the_watchdog->state; 2009f80: e0 06 20 08 ld [ %i0 + 8 ], %l0 switch ( previous_state ) { 2009f84: 80 a4 20 01 cmp %l0, 1 2009f88: 02 80 00 2a be 200a030 <_Watchdog_Remove+0xbc> 2009f8c: 03 00 80 58 sethi %hi(0x2016000), %g1 2009f90: 1a 80 00 09 bcc 2009fb4 <_Watchdog_Remove+0x40> 2009f94: 80 a4 20 03 cmp %l0, 3 _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009f98: 03 00 80 58 sethi %hi(0x2016000), %g1 2009f9c: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 ! 2016014 <_Watchdog_Ticks_since_boot> 2009fa0: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 2009fa4: 7f ff e0 c5 call 20022b8 2009fa8: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 2009fac: 81 c7 e0 08 ret 2009fb0: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 2009fb4: 18 bf ff fa bgu 2009f9c <_Watchdog_Remove+0x28> <== NEVER TAKEN 2009fb8: 03 00 80 58 sethi %hi(0x2016000), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 2009fbc: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009fc0: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 2009fc4: c4 00 40 00 ld [ %g1 ], %g2 2009fc8: 80 a0 a0 00 cmp %g2, 0 2009fcc: 02 80 00 07 be 2009fe8 <_Watchdog_Remove+0x74> 2009fd0: 05 00 80 58 sethi %hi(0x2016000), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 2009fd4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009fd8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2009fdc: 84 00 c0 02 add %g3, %g2, %g2 2009fe0: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 2009fe4: 05 00 80 58 sethi %hi(0x2016000), %g2 2009fe8: c4 00 a0 10 ld [ %g2 + 0x10 ], %g2 ! 2016010 <_Watchdog_Sync_count> 2009fec: 80 a0 a0 00 cmp %g2, 0 2009ff0: 22 80 00 07 be,a 200a00c <_Watchdog_Remove+0x98> 2009ff4: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 2009ff8: 05 00 80 58 sethi %hi(0x2016000), %g2 2009ffc: c6 00 a1 34 ld [ %g2 + 0x134 ], %g3 ! 2016134 <_Per_CPU_Information+0x8> 200a000: 05 00 80 57 sethi %hi(0x2015c00), %g2 200a004: c6 20 a3 a8 st %g3, [ %g2 + 0x3a8 ] ! 2015fa8 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200a008: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200a00c: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200a010: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a014: 03 00 80 58 sethi %hi(0x2016000), %g1 200a018: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 ! 2016014 <_Watchdog_Ticks_since_boot> 200a01c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a020: 7f ff e0 a6 call 20022b8 200a024: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 200a028: 81 c7 e0 08 ret 200a02c: 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; 200a030: c2 00 60 14 ld [ %g1 + 0x14 ], %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; 200a034: 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; 200a038: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a03c: 7f ff e0 9f call 20022b8 200a040: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 200a044: 81 c7 e0 08 ret 200a048: 81 e8 00 00 restore =============================================================================== 0200b668 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b668: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b66c: 7f ff dd c0 call 2002d6c 200b670: 01 00 00 00 nop 200b674: a0 10 00 08 mov %o0, %l0 printk( "Watchdog Chain: %s %p\n", name, header ); 200b678: 11 00 80 72 sethi %hi(0x201c800), %o0 200b67c: 94 10 00 19 mov %i1, %o2 200b680: 92 10 00 18 mov %i0, %o1 200b684: 7f ff e4 87 call 20048a0 200b688: 90 12 22 e0 or %o0, 0x2e0, %o0 printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); } 200b68c: e2 06 40 00 ld [ %i1 ], %l1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b690: b2 06 60 04 add %i1, 4, %i1 ISR_Level level; Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { 200b694: 80 a4 40 19 cmp %l1, %i1 200b698: 02 80 00 0f be 200b6d4 <_Watchdog_Report_chain+0x6c> 200b69c: 11 00 80 72 sethi %hi(0x201c800), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b6a0: 92 10 00 11 mov %l1, %o1 200b6a4: 40 00 00 0f call 200b6e0 <_Watchdog_Report> 200b6a8: 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 ) 200b6ac: e2 04 40 00 ld [ %l1 ], %l1 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200b6b0: 80 a4 40 19 cmp %l1, %i1 200b6b4: 12 bf ff fc bne 200b6a4 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b6b8: 92 10 00 11 mov %l1, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b6bc: 11 00 80 72 sethi %hi(0x201c800), %o0 200b6c0: 92 10 00 18 mov %i0, %o1 200b6c4: 7f ff e4 77 call 20048a0 200b6c8: 90 12 22 f8 or %o0, 0x2f8, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b6cc: 7f ff dd ac call 2002d7c 200b6d0: 91 e8 00 10 restore %g0, %l0, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b6d4: 7f ff e4 73 call 20048a0 200b6d8: 90 12 23 08 or %o0, 0x308, %o0 200b6dc: 30 bf ff fc b,a 200b6cc <_Watchdog_Report_chain+0x64> =============================================================================== 0200edfc : rtems_name name, rtems_attribute attribute_set, uint32_t maximum_waiters, rtems_id *id ) { 200edfc: 9d e3 bf 98 save %sp, -104, %sp 200ee00: a0 10 00 18 mov %i0, %l0 Barrier_Control *the_barrier; CORE_barrier_Attributes the_attributes; if ( !rtems_is_name_valid( name ) ) 200ee04: 80 a4 20 00 cmp %l0, 0 200ee08: 02 80 00 23 be 200ee94 200ee0c: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !id ) 200ee10: 80 a6 e0 00 cmp %i3, 0 200ee14: 02 80 00 20 be 200ee94 200ee18: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; /* Initialize core barrier attributes */ if ( _Attributes_Is_barrier_automatic( attribute_set ) ) { 200ee1c: 80 8e 60 10 btst 0x10, %i1 200ee20: 02 80 00 1f be 200ee9c 200ee24: 80 a6 a0 00 cmp %i2, 0 the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 200ee28: c0 27 bf f8 clr [ %fp + -8 ] if ( maximum_waiters == 0 ) 200ee2c: 02 80 00 1a be 200ee94 200ee30: b0 10 20 0a mov 0xa, %i0 200ee34: 03 00 80 86 sethi %hi(0x2021800), %g1 200ee38: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 2021a10 <_Thread_Dispatch_disable_level> return RTEMS_INVALID_NUMBER; } else the_attributes.discipline = CORE_BARRIER_MANUAL_RELEASE; the_attributes.maximum_count = maximum_waiters; 200ee3c: f4 27 bf fc st %i2, [ %fp + -4 ] 200ee40: 84 00 a0 01 inc %g2 200ee44: c4 20 62 10 st %g2, [ %g1 + 0x210 ] * This function allocates a barrier control block from * the inactive chain of free barrier control blocks. */ RTEMS_INLINE_ROUTINE Barrier_Control *_Barrier_Allocate( void ) { return (Barrier_Control *) _Objects_Allocate( &_Barrier_Information ); 200ee48: 25 00 80 87 sethi %hi(0x2021c00), %l2 200ee4c: 7f ff eb ce call 2009d84 <_Objects_Allocate> 200ee50: 90 14 a0 b0 or %l2, 0xb0, %o0 ! 2021cb0 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 200ee54: a2 92 20 00 orcc %o0, 0, %l1 200ee58: 02 80 00 1e be 200eed0 <== NEVER TAKEN 200ee5c: 90 04 60 14 add %l1, 0x14, %o0 return RTEMS_TOO_MANY; } the_barrier->attribute_set = attribute_set; _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 200ee60: 92 07 bf f8 add %fp, -8, %o1 200ee64: 40 00 02 43 call 200f770 <_CORE_barrier_Initialize> 200ee68: f2 24 60 10 st %i1, [ %l1 + 0x10 ] 200ee6c: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 *id = the_barrier->Object.id; _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 200ee70: a4 14 a0 b0 or %l2, 0xb0, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200ee74: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200ee78: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200ee7c: 85 28 a0 02 sll %g2, 2, %g2 200ee80: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200ee84: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Barrier_Information, &the_barrier->Object, (Objects_Name) name ); *id = the_barrier->Object.id; 200ee88: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Enable_dispatch(); 200ee8c: 7f ff f0 39 call 200af70 <_Thread_Enable_dispatch> 200ee90: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; } 200ee94: 81 c7 e0 08 ret 200ee98: 81 e8 00 00 restore if ( _Attributes_Is_barrier_automatic( attribute_set ) ) { the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; if ( maximum_waiters == 0 ) return RTEMS_INVALID_NUMBER; } else the_attributes.discipline = CORE_BARRIER_MANUAL_RELEASE; 200ee9c: 82 10 20 01 mov 1, %g1 200eea0: c2 27 bf f8 st %g1, [ %fp + -8 ] 200eea4: 03 00 80 86 sethi %hi(0x2021800), %g1 200eea8: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 2021a10 <_Thread_Dispatch_disable_level> the_attributes.maximum_count = maximum_waiters; 200eeac: f4 27 bf fc st %i2, [ %fp + -4 ] 200eeb0: 84 00 a0 01 inc %g2 200eeb4: c4 20 62 10 st %g2, [ %g1 + 0x210 ] 200eeb8: 25 00 80 87 sethi %hi(0x2021c00), %l2 200eebc: 7f ff eb b2 call 2009d84 <_Objects_Allocate> 200eec0: 90 14 a0 b0 or %l2, 0xb0, %o0 ! 2021cb0 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 200eec4: a2 92 20 00 orcc %o0, 0, %l1 200eec8: 12 bf ff e6 bne 200ee60 200eecc: 90 04 60 14 add %l1, 0x14, %o0 _Thread_Enable_dispatch(); 200eed0: 7f ff f0 28 call 200af70 <_Thread_Enable_dispatch> 200eed4: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 200eed8: 81 c7 e0 08 ret 200eedc: 81 e8 00 00 restore =============================================================================== 02007318 : rtems_chain_control *chain, rtems_chain_node *node, rtems_id task, rtems_event_set events ) { 2007318: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE bool rtems_chain_append_with_empty_check( rtems_chain_control *chain, rtems_chain_node *node ) { return _Chain_Append_with_empty_check( chain, node ); 200731c: 90 10 00 18 mov %i0, %o0 2007320: 40 00 01 65 call 20078b4 <_Chain_Append_with_empty_check> 2007324: 92 10 00 19 mov %i1, %o1 rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_append_with_empty_check( chain, node ); if ( was_empty ) { 2007328: 80 8a 20 ff btst 0xff, %o0 200732c: 12 80 00 04 bne 200733c <== ALWAYS TAKEN 2007330: b0 10 20 00 clr %i0 sc = rtems_event_send( task, events ); } return sc; } 2007334: 81 c7 e0 08 ret 2007338: 81 e8 00 00 restore { rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_append_with_empty_check( chain, node ); if ( was_empty ) { sc = rtems_event_send( task, events ); 200733c: b0 10 00 1a mov %i2, %i0 2007340: 7f ff fd 61 call 20068c4 2007344: 93 e8 00 1b restore %g0, %i3, %o1 =============================================================================== 02007380 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2007380: 9d e3 bf 98 save %sp, -104, %sp 2007384: a0 10 00 18 mov %i0, %l0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2007388: a4 07 bf fc add %fp, -4, %l2 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 200738c: 40 00 01 89 call 20079b0 <_Chain_Get> 2007390: 90 10 00 10 mov %l0, %o0 2007394: 92 10 20 00 clr %o1 2007398: a2 10 00 08 mov %o0, %l1 200739c: 94 10 00 1a mov %i2, %o2 20073a0: 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 20073a4: 80 a4 60 00 cmp %l1, 0 20073a8: 12 80 00 0a bne 20073d0 20073ac: 96 10 00 12 mov %l2, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 20073b0: 7f ff fc e2 call 2006738 20073b4: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 20073b8: 80 a2 20 00 cmp %o0, 0 20073bc: 02 bf ff f4 be 200738c <== NEVER TAKEN 20073c0: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 20073c4: e2 26 c0 00 st %l1, [ %i3 ] return sc; } 20073c8: 81 c7 e0 08 ret 20073cc: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 20073d0: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 20073d4: e2 26 c0 00 st %l1, [ %i3 ] return sc; } 20073d8: 81 c7 e0 08 ret 20073dc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020073e0 : rtems_chain_control *chain, rtems_chain_node *node, rtems_id task, rtems_event_set events ) { 20073e0: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE bool rtems_chain_prepend_with_empty_check( rtems_chain_control *chain, rtems_chain_node *node ) { return _Chain_Prepend_with_empty_check( chain, node ); 20073e4: 90 10 00 18 mov %i0, %o0 20073e8: 40 00 01 90 call 2007a28 <_Chain_Prepend_with_empty_check> 20073ec: 92 10 00 19 mov %i1, %o1 rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_prepend_with_empty_check( chain, node ); if (was_empty) { 20073f0: 80 8a 20 ff btst 0xff, %o0 20073f4: 12 80 00 04 bne 2007404 <== ALWAYS TAKEN 20073f8: b0 10 20 00 clr %i0 sc = rtems_event_send( task, events ); } return sc; } 20073fc: 81 c7 e0 08 ret 2007400: 81 e8 00 00 restore { rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_prepend_with_empty_check( chain, node ); if (was_empty) { sc = rtems_event_send( task, events ); 2007404: b0 10 00 1a mov %i2, %i0 2007408: 7f ff fd 2f call 20068c4 200740c: 93 e8 00 1b restore %g0, %i3, %o1 =============================================================================== 020080bc : 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 ) { 20080bc: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 20080c0: 03 00 80 68 sethi %hi(0x201a000), %g1 20080c4: c4 00 63 94 ld [ %g1 + 0x394 ], %g2 ! 201a394 <_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 ) { 20080c8: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 20080cc: 03 00 80 69 sethi %hi(0x201a400), %g1 if ( rtems_interrupt_is_in_progress() ) 20080d0: 80 a0 a0 00 cmp %g2, 0 20080d4: 12 80 00 42 bne 20081dc 20080d8: c8 00 60 24 ld [ %g1 + 0x24 ], %g4 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 20080dc: 80 a6 a0 00 cmp %i2, 0 20080e0: 02 80 00 50 be 2008220 20080e4: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 20080e8: 80 a6 60 00 cmp %i1, 0 20080ec: 02 80 00 4d be 2008220 20080f0: 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; 20080f4: c4 06 40 00 ld [ %i1 ], %g2 20080f8: 80 a0 a0 00 cmp %g2, 0 20080fc: 22 80 00 46 be,a 2008214 2008100: 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 ) 2008104: 80 a1 00 18 cmp %g4, %i0 2008108: 08 80 00 33 bleu 20081d4 200810c: 01 00 00 00 nop rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2008110: 05 00 80 68 sethi %hi(0x201a000), %g2 2008114: c8 00 a1 40 ld [ %g2 + 0x140 ], %g4 ! 201a140 <_Thread_Dispatch_disable_level> 2008118: 88 01 20 01 inc %g4 200811c: c8 20 a1 40 st %g4, [ %g2 + 0x140 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2008120: 80 a6 20 00 cmp %i0, 0 2008124: 12 80 00 30 bne 20081e4 2008128: 1b 00 80 69 sethi %hi(0x201a400), %o5 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 200812c: c8 00 60 24 ld [ %g1 + 0x24 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2008130: 80 a1 20 00 cmp %g4, 0 2008134: 22 80 00 3d be,a 2008228 <== NEVER TAKEN 2008138: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED 200813c: 10 80 00 05 b 2008150 2008140: c2 03 60 28 ld [ %o5 + 0x28 ], %g1 2008144: 80 a1 00 18 cmp %g4, %i0 2008148: 08 80 00 0a bleu 2008170 200814c: 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; 2008150: c4 00 40 00 ld [ %g1 ], %g2 2008154: 80 a0 a0 00 cmp %g2, 0 2008158: 32 bf ff fb bne,a 2008144 200815c: b0 06 20 01 inc %i0 2008160: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008164: 80 a0 a0 00 cmp %g2, 0 2008168: 32 bf ff f7 bne,a 2008144 200816c: b0 06 20 01 inc %i0 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 2008170: 80 a1 00 18 cmp %g4, %i0 2008174: 02 80 00 2d be 2008228 2008178: f0 26 80 00 st %i0, [ %i2 ] 200817c: 83 2e 20 03 sll %i0, 3, %g1 2008180: 85 2e 20 05 sll %i0, 5, %g2 2008184: 84 20 80 01 sub %g2, %g1, %g2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2008188: c8 03 60 28 ld [ %o5 + 0x28 ], %g4 200818c: da 00 c0 00 ld [ %g3 ], %o5 2008190: 82 01 00 02 add %g4, %g2, %g1 2008194: da 21 00 02 st %o5, [ %g4 + %g2 ] 2008198: c4 00 e0 04 ld [ %g3 + 4 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 200819c: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20081a0: c4 20 60 04 st %g2, [ %g1 + 4 ] 20081a4: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 20081a8: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20081ac: c4 20 60 08 st %g2, [ %g1 + 8 ] 20081b0: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 20081b4: c4 20 60 0c st %g2, [ %g1 + 0xc ] 20081b8: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 20081bc: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 20081c0: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 20081c4: 40 00 07 e6 call 200a15c <_Thread_Enable_dispatch> 20081c8: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 20081cc: 40 00 21 df call 2010948 20081d0: 81 e8 00 00 restore } 20081d4: 81 c7 e0 08 ret 20081d8: 91 e8 20 0a restore %g0, 0xa, %o0 ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 20081dc: 81 c7 e0 08 ret 20081e0: 91 e8 20 12 restore %g0, 0x12, %o0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 20081e4: c2 03 60 28 ld [ %o5 + 0x28 ], %g1 20081e8: 89 2e 20 05 sll %i0, 5, %g4 20081ec: 85 2e 20 03 sll %i0, 3, %g2 20081f0: 84 21 00 02 sub %g4, %g2, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 20081f4: c8 00 40 02 ld [ %g1 + %g2 ], %g4 20081f8: 80 a1 20 00 cmp %g4, 0 20081fc: 02 80 00 0f be 2008238 2008200: 82 00 40 02 add %g1, %g2, %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(); 2008204: 40 00 07 d6 call 200a15c <_Thread_Enable_dispatch> 2008208: b0 10 20 0c mov 0xc, %i0 return RTEMS_RESOURCE_IN_USE; 200820c: 81 c7 e0 08 ret 2008210: 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; 2008214: 80 a0 a0 00 cmp %g2, 0 2008218: 32 bf ff bc bne,a 2008108 200821c: 80 a1 00 18 cmp %g4, %i0 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 2008220: 81 c7 e0 08 ret 2008224: 91 e8 20 09 restore %g0, 9, %o0 if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2008228: 40 00 07 cd call 200a15c <_Thread_Enable_dispatch> 200822c: b0 10 20 05 mov 5, %i0 return sc; 2008230: 81 c7 e0 08 ret 2008234: 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; 2008238: c2 00 60 04 ld [ %g1 + 4 ], %g1 200823c: 80 a0 60 00 cmp %g1, 0 2008240: 12 bf ff f1 bne 2008204 2008244: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2008248: 10 bf ff d0 b 2008188 200824c: f0 26 80 00 st %i0, [ %i2 ] =============================================================================== 020097a0 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 20097a0: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 20097a4: 80 a6 20 00 cmp %i0, 0 20097a8: 02 80 00 23 be 2009834 <== NEVER TAKEN 20097ac: 25 00 80 7d sethi %hi(0x201f400), %l2 20097b0: a4 14 a0 dc or %l2, 0xdc, %l2 ! 201f4dc <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 20097b4: a6 04 a0 0c add %l2, 0xc, %l3 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 ] ) 20097b8: c2 04 80 00 ld [ %l2 ], %g1 20097bc: 80 a0 60 00 cmp %g1, 0 20097c0: 22 80 00 1a be,a 2009828 20097c4: a4 04 a0 04 add %l2, 4, %l2 continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 20097c8: e2 00 60 04 ld [ %g1 + 4 ], %l1 if ( !information ) 20097cc: 80 a4 60 00 cmp %l1, 0 20097d0: 22 80 00 16 be,a 2009828 20097d4: a4 04 a0 04 add %l2, 4, %l2 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 20097d8: c2 14 60 10 lduh [ %l1 + 0x10 ], %g1 20097dc: 84 90 60 00 orcc %g1, 0, %g2 20097e0: 22 80 00 12 be,a 2009828 <== NEVER TAKEN 20097e4: a4 04 a0 04 add %l2, 4, %l2 20097e8: a0 10 20 01 mov 1, %l0 the_thread = (Thread_Control *)information->local_table[ i ]; 20097ec: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 20097f0: 83 2c 20 02 sll %l0, 2, %g1 20097f4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 20097f8: 90 90 60 00 orcc %g1, 0, %o0 20097fc: 02 80 00 05 be 2009810 2009800: a0 04 20 01 inc %l0 continue; (*routine)(the_thread); 2009804: 9f c6 00 00 call %i0 2009808: 01 00 00 00 nop 200980c: c4 14 60 10 lduh [ %l1 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009810: 83 28 a0 10 sll %g2, 0x10, %g1 2009814: 83 30 60 10 srl %g1, 0x10, %g1 2009818: 80 a0 40 10 cmp %g1, %l0 200981c: 3a bf ff f5 bcc,a 20097f0 2009820: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 2009824: a4 04 a0 04 add %l2, 4, %l2 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2009828: 80 a4 80 13 cmp %l2, %l3 200982c: 32 bf ff e4 bne,a 20097bc 2009830: c2 04 80 00 ld [ %l2 ], %g1 2009834: 81 c7 e0 08 ret 2009838: 81 e8 00 00 restore =============================================================================== 0200830c : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 200830c: 9d e3 bf a0 save %sp, -96, %sp 2008310: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 2008314: 80 a6 a0 00 cmp %i2, 0 2008318: 02 80 00 21 be 200839c 200831c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008320: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 2008324: b0 10 20 0a mov 0xa, %i0 * Validate parameters and look up information structure. */ if ( !info ) return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 2008328: 40 00 07 76 call 200a100 <_Objects_Get_information> 200832c: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 2008330: 80 a2 20 00 cmp %o0, 0 2008334: 02 80 00 1a be 200839c 2008338: 01 00 00 00 nop /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 200833c: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 2008340: 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; 2008344: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008348: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 200834c: c4 26 a0 04 st %g2, [ %i2 + 4 ] return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 2008350: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 2008354: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 2008358: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 200835c: 80 a1 20 00 cmp %g4, 0 2008360: 02 80 00 0d be 2008394 <== NEVER TAKEN 2008364: 84 10 20 00 clr %g2 2008368: da 02 20 1c ld [ %o0 + 0x1c ], %o5 200836c: 86 10 20 01 mov 1, %g3 2008370: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 2008374: 87 28 e0 02 sll %g3, 2, %g3 2008378: c6 03 40 03 ld [ %o5 + %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++ ) 200837c: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 2008380: 80 a0 00 03 cmp %g0, %g3 2008384: 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++ ) 2008388: 80 a1 00 01 cmp %g4, %g1 200838c: 1a bf ff fa bcc 2008374 2008390: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 2008394: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 2008398: b0 10 20 00 clr %i0 } 200839c: 81 c7 e0 08 ret 20083a0: 81 e8 00 00 restore =============================================================================== 02014198 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2014198: 9d e3 bf a0 save %sp, -96, %sp 201419c: a0 10 00 18 mov %i0, %l0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 20141a0: 80 a4 20 00 cmp %l0, 0 20141a4: 02 80 00 34 be 2014274 20141a8: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !starting_address ) 20141ac: 80 a6 60 00 cmp %i1, 0 20141b0: 02 80 00 31 be 2014274 20141b4: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !id ) 20141b8: 80 a7 60 00 cmp %i5, 0 20141bc: 02 80 00 2e be 2014274 <== NEVER TAKEN 20141c0: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 20141c4: 02 80 00 2e be 201427c 20141c8: 80 a6 a0 00 cmp %i2, 0 20141cc: 02 80 00 2c be 201427c 20141d0: 80 a6 80 1b cmp %i2, %i3 20141d4: 0a 80 00 28 bcs 2014274 20141d8: b0 10 20 08 mov 8, %i0 20141dc: 80 8e e0 07 btst 7, %i3 20141e0: 12 80 00 25 bne 2014274 20141e4: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 20141e8: 12 80 00 23 bne 2014274 20141ec: b0 10 20 09 mov 9, %i0 20141f0: 03 00 80 f4 sethi %hi(0x203d000), %g1 20141f4: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 203d1e0 <_Thread_Dispatch_disable_level> 20141f8: 84 00 a0 01 inc %g2 20141fc: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] * 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 ); 2014200: 25 00 80 f3 sethi %hi(0x203cc00), %l2 2014204: 40 00 13 0b call 2018e30 <_Objects_Allocate> 2014208: 90 14 a3 f4 or %l2, 0x3f4, %o0 ! 203cff4 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 201420c: a2 92 20 00 orcc %o0, 0, %l1 2014210: 02 80 00 1d be 2014284 2014214: 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; 2014218: f8 24 60 1c st %i4, [ %l1 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 201421c: f2 24 60 10 st %i1, [ %l1 + 0x10 ] the_partition->length = length; 2014220: f4 24 60 14 st %i2, [ %l1 + 0x14 ] the_partition->buffer_size = buffer_size; 2014224: f6 24 60 18 st %i3, [ %l1 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2014228: c0 24 60 20 clr [ %l1 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 201422c: 40 00 64 6c call 202d3dc <.udiv> 2014230: 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, 2014234: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2014238: 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, 201423c: 96 10 00 1b mov %i3, %o3 2014240: b8 04 60 24 add %l1, 0x24, %i4 2014244: 40 00 0c cf call 2017580 <_Chain_Initialize> 2014248: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 201424c: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2014250: a4 14 a3 f4 or %l2, 0x3f4, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014254: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014258: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 201425c: 85 28 a0 02 sll %g2, 2, %g2 2014260: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2014264: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Partition_Information, &the_partition->Object, (Objects_Name) name ); *id = the_partition->Object.id; 2014268: c2 27 40 00 st %g1, [ %i5 ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 201426c: 40 00 17 9e call 201a0e4 <_Thread_Enable_dispatch> 2014270: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2014274: 81 c7 e0 08 ret 2014278: 81 e8 00 00 restore } 201427c: 81 c7 e0 08 ret 2014280: 91 e8 20 08 restore %g0, 8, %o0 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2014284: 40 00 17 98 call 201a0e4 <_Thread_Enable_dispatch> 2014288: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 201428c: 81 c7 e0 08 ret 2014290: 81 e8 00 00 restore =============================================================================== 020078b8 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 20078b8: 9d e3 bf 98 save %sp, -104, %sp Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) _Objects_Get( &_Rate_monotonic_Information, id, location ); 20078bc: 11 00 80 79 sethi %hi(0x201e400), %o0 20078c0: 92 10 00 18 mov %i0, %o1 20078c4: 90 12 23 e4 or %o0, 0x3e4, %o0 20078c8: 40 00 09 6f call 2009e84 <_Objects_Get> 20078cc: 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 ) { 20078d0: c2 07 bf fc ld [ %fp + -4 ], %g1 20078d4: 80 a0 60 00 cmp %g1, 0 20078d8: 02 80 00 04 be 20078e8 20078dc: a0 10 00 08 mov %o0, %l0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20078e0: 81 c7 e0 08 ret 20078e4: 91 e8 20 04 restore %g0, 4, %o0 the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 20078e8: 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 ); 20078ec: 23 00 80 7a sethi %hi(0x201e800), %l1 20078f0: a2 14 63 9c or %l1, 0x39c, %l1 ! 201eb9c <_Per_CPU_Information> 20078f4: c2 04 60 0c ld [ %l1 + 0xc ], %g1 20078f8: 80 a0 80 01 cmp %g2, %g1 20078fc: 02 80 00 06 be 2007914 2007900: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 2007904: 40 00 0c a9 call 200aba8 <_Thread_Enable_dispatch> 2007908: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 200790c: 81 c7 e0 08 ret 2007910: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 2007914: 12 80 00 0f bne 2007950 2007918: 01 00 00 00 nop switch ( the_period->state ) { 200791c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007920: 80 a0 60 04 cmp %g1, 4 2007924: 08 80 00 06 bleu 200793c <== ALWAYS TAKEN 2007928: b0 10 20 00 clr %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 200792c: 40 00 0c 9f call 200aba8 <_Thread_Enable_dispatch> 2007930: 01 00 00 00 nop return RTEMS_TIMEOUT; 2007934: 81 c7 e0 08 ret 2007938: 81 e8 00 00 restore _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { switch ( the_period->state ) { 200793c: 83 28 60 02 sll %g1, 2, %g1 2007940: 05 00 80 72 sethi %hi(0x201c800), %g2 2007944: 84 10 a0 44 or %g2, 0x44, %g2 ! 201c844 2007948: 10 bf ff f9 b 200792c 200794c: f0 00 80 01 ld [ %g2 + %g1 ], %i0 } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 2007950: 7f ff ed fe call 2003148 2007954: 01 00 00 00 nop 2007958: a6 10 00 08 mov %o0, %l3 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 200795c: e4 04 20 38 ld [ %l0 + 0x38 ], %l2 2007960: 80 a4 a0 00 cmp %l2, 0 2007964: 02 80 00 14 be 20079b4 2007968: 80 a4 a0 02 cmp %l2, 2 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 200796c: 02 80 00 29 be 2007a10 2007970: 80 a4 a0 04 cmp %l2, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2007974: 12 bf ff e6 bne 200790c <== NEVER TAKEN 2007978: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 200797c: 7f ff ff 8f call 20077b8 <_Rate_monotonic_Update_statistics> 2007980: 90 10 00 10 mov %l0, %o0 _ISR_Enable( level ); 2007984: 7f ff ed f5 call 2003158 2007988: 90 10 00 13 mov %l3, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 200798c: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007990: 92 04 20 10 add %l0, 0x10, %o1 2007994: 11 00 80 7a sethi %hi(0x201e800), %o0 the_period->next_length = length; 2007998: f2 24 20 3c st %i1, [ %l0 + 0x3c ] 200799c: 90 12 22 34 or %o0, 0x234, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 20079a0: c2 24 20 38 st %g1, [ %l0 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20079a4: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20079a8: 40 00 10 f4 call 200bd78 <_Watchdog_Insert> 20079ac: b0 10 20 06 mov 6, %i0 20079b0: 30 bf ff df b,a 200792c return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 20079b4: 7f ff ed e9 call 2003158 20079b8: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20079bc: 7f ff ff 63 call 2007748 <_Rate_monotonic_Initiate_statistics> 20079c0: 90 10 00 10 mov %l0, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20079c4: 82 10 20 02 mov 2, %g1 20079c8: 92 04 20 10 add %l0, 0x10, %o1 20079cc: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 20079d0: 11 00 80 7a sethi %hi(0x201e800), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20079d4: 03 00 80 1f sethi %hi(0x2007c00), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20079d8: 90 12 22 34 or %o0, 0x234, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20079dc: 82 10 61 8c or %g1, 0x18c, %g1 the_watchdog->id = id; 20079e0: f0 24 20 30 st %i0, [ %l0 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20079e4: c2 24 20 2c st %g1, [ %l0 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20079e8: c0 24 20 18 clr [ %l0 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 20079ec: c0 24 20 34 clr [ %l0 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 20079f0: f2 24 20 3c st %i1, [ %l0 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20079f4: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20079f8: 40 00 10 e0 call 200bd78 <_Watchdog_Insert> 20079fc: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 2007a00: 40 00 0c 6a call 200aba8 <_Thread_Enable_dispatch> 2007a04: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2007a08: 81 c7 e0 08 ret 2007a0c: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007a10: 7f ff ff 6a call 20077b8 <_Rate_monotonic_Update_statistics> 2007a14: 90 10 00 10 mov %l0, %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; 2007a18: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2007a1c: f2 24 20 3c st %i1, [ %l0 + 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; 2007a20: c2 24 20 38 st %g1, [ %l0 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007a24: 7f ff ed cd call 2003158 2007a28: 90 10 00 13 mov %l3, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2007a2c: c2 04 60 0c ld [ %l1 + 0xc ], %g1 2007a30: c4 04 20 08 ld [ %l0 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007a34: 90 10 00 01 mov %g1, %o0 2007a38: 13 00 00 10 sethi %hi(0x4000), %o1 2007a3c: 40 00 0e bc call 200b52c <_Thread_Set_state> 2007a40: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007a44: 7f ff ed c1 call 2003148 2007a48: 01 00 00 00 nop local_state = the_period->state; 2007a4c: e6 04 20 38 ld [ %l0 + 0x38 ], %l3 the_period->state = RATE_MONOTONIC_ACTIVE; 2007a50: e4 24 20 38 st %l2, [ %l0 + 0x38 ] _ISR_Enable( level ); 2007a54: 7f ff ed c1 call 2003158 2007a58: 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 ) 2007a5c: 80 a4 e0 03 cmp %l3, 3 2007a60: 22 80 00 06 be,a 2007a78 2007a64: d0 04 60 0c ld [ %l1 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 2007a68: 40 00 0c 50 call 200aba8 <_Thread_Enable_dispatch> 2007a6c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2007a70: 81 c7 e0 08 ret 2007a74: 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 ); 2007a78: 40 00 0b 59 call 200a7dc <_Thread_Clear_state> 2007a7c: 13 00 00 10 sethi %hi(0x4000), %o1 2007a80: 30 bf ff fa b,a 2007a68 =============================================================================== 02007a84 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007a84: 9d e3 bf 30 save %sp, -208, %sp rtems_id id; rtems_rate_monotonic_period_statistics the_stats; rtems_rate_monotonic_period_status the_status; char name[5]; if ( !print ) 2007a88: 80 a6 60 00 cmp %i1, 0 2007a8c: 02 80 00 4c be 2007bbc <== NEVER TAKEN 2007a90: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 2007a94: 13 00 80 72 sethi %hi(0x201c800), %o1 2007a98: 9f c6 40 00 call %i1 2007a9c: 92 12 60 58 or %o1, 0x58, %o1 ! 201c858 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2007aa0: 90 10 00 18 mov %i0, %o0 2007aa4: 13 00 80 72 sethi %hi(0x201c800), %o1 2007aa8: 9f c6 40 00 call %i1 2007aac: 92 12 60 78 or %o1, 0x78, %o1 ! 201c878 (*print)( context, "--- Wall times are in seconds ---\n" ); 2007ab0: 90 10 00 18 mov %i0, %o0 2007ab4: 13 00 80 72 sethi %hi(0x201c800), %o1 2007ab8: 9f c6 40 00 call %i1 2007abc: 92 12 60 a0 or %o1, 0xa0, %o1 ! 201c8a0 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2007ac0: 90 10 00 18 mov %i0, %o0 2007ac4: 13 00 80 72 sethi %hi(0x201c800), %o1 2007ac8: 9f c6 40 00 call %i1 2007acc: 92 12 60 c8 or %o1, 0xc8, %o1 ! 201c8c8 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 2007ad0: 90 10 00 18 mov %i0, %o0 2007ad4: 13 00 80 72 sethi %hi(0x201c800), %o1 2007ad8: 9f c6 40 00 call %i1 2007adc: 92 12 61 18 or %o1, 0x118, %o1 ! 201c918 /* * 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 ; 2007ae0: 23 00 80 79 sethi %hi(0x201e400), %l1 2007ae4: a2 14 63 e4 or %l1, 0x3e4, %l1 ! 201e7e4 <_Rate_monotonic_Information> 2007ae8: e0 04 60 08 ld [ %l1 + 8 ], %l0 2007aec: c2 04 60 0c ld [ %l1 + 0xc ], %g1 2007af0: 80 a4 00 01 cmp %l0, %g1 2007af4: 18 80 00 32 bgu 2007bbc <== NEVER TAKEN 2007af8: 2f 00 80 72 sethi %hi(0x201c800), %l7 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, 2007afc: 39 00 80 72 sethi %hi(0x201c800), %i4 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007b00: 2b 00 80 6e sethi %hi(0x201b800), %l5 2007b04: a4 07 bf a0 add %fp, -96, %l2 #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 ); 2007b08: ba 07 bf d8 add %fp, -40, %i5 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2007b0c: a6 07 bf f8 add %fp, -8, %l3 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007b10: ae 15 e1 68 or %l7, 0x168, %l7 { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ 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; 2007b14: ac 07 bf b8 add %fp, -72, %l6 _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2007b18: a8 07 bf f0 add %fp, -16, %l4 (*print)( context, 2007b1c: b8 17 21 80 or %i4, 0x180, %i4 { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ 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; 2007b20: b4 07 bf d0 add %fp, -48, %i2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007b24: 10 80 00 06 b 2007b3c 2007b28: aa 15 63 68 or %l5, 0x368, %l5 * 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++ ) { 2007b2c: a0 04 20 01 inc %l0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2007b30: 80 a0 40 10 cmp %g1, %l0 2007b34: 0a 80 00 22 bcs 2007bbc 2007b38: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007b3c: 90 10 00 10 mov %l0, %o0 2007b40: 40 00 19 8f call 200e17c 2007b44: 92 10 00 12 mov %l2, %o1 if ( status != RTEMS_SUCCESSFUL ) 2007b48: 80 a2 20 00 cmp %o0, 0 2007b4c: 32 bf ff f8 bne,a 2007b2c 2007b50: c2 04 60 0c ld [ %l1 + 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 ); 2007b54: 92 10 00 1d mov %i5, %o1 2007b58: 40 00 19 b8 call 200e238 2007b5c: 90 10 00 10 mov %l0, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2007b60: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007b64: 94 10 00 13 mov %l3, %o2 2007b68: 40 00 00 b9 call 2007e4c 2007b6c: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007b70: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2007b74: 92 10 00 17 mov %l7, %o1 2007b78: 94 10 00 10 mov %l0, %o2 2007b7c: 90 10 00 18 mov %i0, %o0 2007b80: 9f c6 40 00 call %i1 2007b84: 96 10 00 13 mov %l3, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007b88: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2007b8c: 94 10 00 14 mov %l4, %o2 2007b90: 90 10 00 16 mov %l6, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007b94: 80 a0 60 00 cmp %g1, 0 2007b98: 12 80 00 0b bne 2007bc4 2007b9c: 92 10 00 15 mov %l5, %o1 (*print)( context, "\n" ); 2007ba0: 9f c6 40 00 call %i1 2007ba4: 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 ; 2007ba8: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2007bac: a0 04 20 01 inc %l0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2007bb0: 80 a0 40 10 cmp %g1, %l0 2007bb4: 1a bf ff e3 bcc 2007b40 <== ALWAYS TAKEN 2007bb8: 90 10 00 10 mov %l0, %o0 2007bbc: 81 c7 e0 08 ret 2007bc0: 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 ); 2007bc4: 40 00 0f 31 call 200b888 <_Timespec_Divide_by_integer> 2007bc8: 92 10 00 01 mov %g1, %o1 (*print)( context, 2007bcc: d0 07 bf ac ld [ %fp + -84 ], %o0 2007bd0: 40 00 47 e7 call 2019b6c <.div> 2007bd4: 92 10 23 e8 mov 0x3e8, %o1 2007bd8: 96 10 00 08 mov %o0, %o3 2007bdc: d0 07 bf b4 ld [ %fp + -76 ], %o0 2007be0: d6 27 bf 9c st %o3, [ %fp + -100 ] 2007be4: 40 00 47 e2 call 2019b6c <.div> 2007be8: 92 10 23 e8 mov 0x3e8, %o1 2007bec: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007bf0: b6 10 00 08 mov %o0, %i3 2007bf4: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007bf8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007bfc: 40 00 47 dc call 2019b6c <.div> 2007c00: 92 10 23 e8 mov 0x3e8, %o1 2007c04: d8 07 bf b0 ld [ %fp + -80 ], %o4 2007c08: d6 07 bf 9c ld [ %fp + -100 ], %o3 2007c0c: d4 07 bf a8 ld [ %fp + -88 ], %o2 2007c10: 9a 10 00 1b mov %i3, %o5 2007c14: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007c18: 92 10 00 1c mov %i4, %o1 2007c1c: 9f c6 40 00 call %i1 2007c20: 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); 2007c24: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007c28: 94 10 00 14 mov %l4, %o2 2007c2c: 40 00 0f 17 call 200b888 <_Timespec_Divide_by_integer> 2007c30: 90 10 00 1a mov %i2, %o0 (*print)( context, 2007c34: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007c38: 40 00 47 cd call 2019b6c <.div> 2007c3c: 92 10 23 e8 mov 0x3e8, %o1 2007c40: 96 10 00 08 mov %o0, %o3 2007c44: d0 07 bf cc ld [ %fp + -52 ], %o0 2007c48: d6 27 bf 9c st %o3, [ %fp + -100 ] 2007c4c: 40 00 47 c8 call 2019b6c <.div> 2007c50: 92 10 23 e8 mov 0x3e8, %o1 2007c54: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007c58: b6 10 00 08 mov %o0, %i3 2007c5c: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007c60: 92 10 23 e8 mov 0x3e8, %o1 2007c64: 40 00 47 c2 call 2019b6c <.div> 2007c68: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007c6c: d4 07 bf c0 ld [ %fp + -64 ], %o2 2007c70: d6 07 bf 9c ld [ %fp + -100 ], %o3 2007c74: d8 07 bf c8 ld [ %fp + -56 ], %o4 2007c78: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007c7c: 13 00 80 72 sethi %hi(0x201c800), %o1 2007c80: 90 10 00 18 mov %i0, %o0 2007c84: 92 12 61 a0 or %o1, 0x1a0, %o1 2007c88: 9f c6 40 00 call %i1 2007c8c: 9a 10 00 1b mov %i3, %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 ; 2007c90: 10 bf ff a7 b 2007b2c 2007c94: c2 04 60 0c ld [ %l1 + 0xc ], %g1 =============================================================================== 02007cb4 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 2007cb4: 9d e3 bf a0 save %sp, -96, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2007cb8: 03 00 80 7a sethi %hi(0x201e800), %g1 2007cbc: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 201e950 <_Thread_Dispatch_disable_level> 2007cc0: 84 00 a0 01 inc %g2 2007cc4: c4 20 61 50 st %g2, [ %g1 + 0x150 ] /* * 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 ; 2007cc8: 23 00 80 79 sethi %hi(0x201e400), %l1 2007ccc: a2 14 63 e4 or %l1, 0x3e4, %l1 ! 201e7e4 <_Rate_monotonic_Information> 2007cd0: e0 04 60 08 ld [ %l1 + 8 ], %l0 2007cd4: c2 04 60 0c ld [ %l1 + 0xc ], %g1 2007cd8: 80 a4 00 01 cmp %l0, %g1 2007cdc: 18 80 00 09 bgu 2007d00 <== NEVER TAKEN 2007ce0: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 2007ce4: 40 00 00 0a call 2007d0c 2007ce8: 90 10 00 10 mov %l0, %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 ; 2007cec: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2007cf0: a0 04 20 01 inc %l0 /* * 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 ; 2007cf4: 80 a0 40 10 cmp %g1, %l0 2007cf8: 1a bf ff fb bcc 2007ce4 2007cfc: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2007d00: 40 00 0b aa call 200aba8 <_Thread_Enable_dispatch> 2007d04: 81 e8 00 00 restore =============================================================================== 020157b8 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 20157b8: 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 ) 20157bc: 80 a6 60 00 cmp %i1, 0 20157c0: 12 80 00 04 bne 20157d0 20157c4: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20157c8: 81 c7 e0 08 ret 20157cc: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20157d0: 90 10 00 18 mov %i0, %o0 20157d4: 40 00 12 52 call 201a11c <_Thread_Get> 20157d8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20157dc: c2 07 bf fc ld [ %fp + -4 ], %g1 20157e0: 80 a0 60 00 cmp %g1, 0 20157e4: 02 80 00 05 be 20157f8 20157e8: a2 10 00 08 mov %o0, %l1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20157ec: 82 10 20 04 mov 4, %g1 } 20157f0: 81 c7 e0 08 ret 20157f4: 91 e8 00 01 restore %g0, %g1, %o0 the_thread = _Thread_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20157f8: e0 02 21 58 ld [ %o0 + 0x158 ], %l0 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 20157fc: c2 04 20 0c ld [ %l0 + 0xc ], %g1 2015800: 80 a0 60 00 cmp %g1, 0 2015804: 02 80 00 25 be 2015898 2015808: 01 00 00 00 nop if ( asr->is_enabled ) { 201580c: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 2015810: 80 a0 60 00 cmp %g1, 0 2015814: 02 80 00 15 be 2015868 2015818: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201581c: 7f ff e6 99 call 200f280 2015820: 01 00 00 00 nop *signal_set |= signals; 2015824: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 2015828: b2 10 40 19 or %g1, %i1, %i1 201582c: f2 24 20 14 st %i1, [ %l0 + 0x14 ] _ISR_Enable( _level ); 2015830: 7f ff e6 98 call 200f290 2015834: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2015838: 03 00 80 f5 sethi %hi(0x203d400), %g1 201583c: 82 10 60 34 or %g1, 0x34, %g1 ! 203d434 <_Per_CPU_Information> 2015840: c4 00 60 08 ld [ %g1 + 8 ], %g2 2015844: 80 a0 a0 00 cmp %g2, 0 2015848: 02 80 00 0f be 2015884 201584c: 01 00 00 00 nop 2015850: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015854: 80 a4 40 02 cmp %l1, %g2 2015858: 12 80 00 0b bne 2015884 <== NEVER TAKEN 201585c: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2015860: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015864: 30 80 00 08 b,a 2015884 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015868: 7f ff e6 86 call 200f280 201586c: 01 00 00 00 nop *signal_set |= signals; 2015870: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 2015874: b2 10 40 19 or %g1, %i1, %i1 2015878: f2 24 20 18 st %i1, [ %l0 + 0x18 ] _ISR_Enable( _level ); 201587c: 7f ff e6 85 call 200f290 2015880: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015884: 40 00 12 18 call 201a0e4 <_Thread_Enable_dispatch> 2015888: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 201588c: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015890: 81 c7 e0 08 ret 2015894: 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(); 2015898: 40 00 12 13 call 201a0e4 <_Thread_Enable_dispatch> 201589c: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 20158a0: 10 bf ff ca b 20157c8 20158a4: 82 10 20 0b mov 0xb, %g1 ! b =============================================================================== 0200e388 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200e388: 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 ) 200e38c: 80 a6 a0 00 cmp %i2, 0 200e390: 02 80 00 43 be 200e49c 200e394: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200e398: 27 00 80 58 sethi %hi(0x2016000), %l3 200e39c: a6 14 e1 2c or %l3, 0x12c, %l3 ! 201612c <_Per_CPU_Information> 200e3a0: e0 04 e0 0c ld [ %l3 + 0xc ], %l0 api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e3a4: c4 0c 20 74 ldub [ %l0 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e3a8: c2 04 20 7c ld [ %l0 + 0x7c ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e3ac: 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 ]; 200e3b0: e2 04 21 58 ld [ %l0 + 0x158 ], %l1 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e3b4: a4 60 3f ff subx %g0, -1, %l2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e3b8: 80 a0 60 00 cmp %g1, 0 200e3bc: 12 80 00 3a bne 200e4a4 200e3c0: a5 2c a0 08 sll %l2, 8, %l2 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e3c4: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 200e3c8: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e3cc: 7f ff f0 cc call 200a6fc <_CPU_ISR_Get_level> 200e3d0: a8 60 3f ff subx %g0, -1, %l4 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; 200e3d4: a9 2d 20 0a sll %l4, 0xa, %l4 200e3d8: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 200e3dc: a4 15 00 12 or %l4, %l2, %l2 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e3e0: 80 8e 61 00 btst 0x100, %i1 200e3e4: 02 80 00 06 be 200e3fc 200e3e8: e4 26 80 00 st %l2, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 200e3ec: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200e3f0: 80 a0 00 01 cmp %g0, %g1 200e3f4: 82 60 3f ff subx %g0, -1, %g1 200e3f8: c2 2c 20 74 stb %g1, [ %l0 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200e3fc: 80 8e 62 00 btst 0x200, %i1 200e400: 02 80 00 0b be 200e42c 200e404: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200e408: 80 8e 22 00 btst 0x200, %i0 200e40c: 22 80 00 07 be,a 200e428 200e410: c0 24 20 7c clr [ %l0 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200e414: 03 00 80 57 sethi %hi(0x2015c00), %g1 200e418: c2 00 62 44 ld [ %g1 + 0x244 ], %g1 ! 2015e44 <_Thread_Ticks_per_timeslice> 200e41c: c2 24 20 78 st %g1, [ %l0 + 0x78 ] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200e420: 82 10 20 01 mov 1, %g1 200e424: c2 24 20 7c st %g1, [ %l0 + 0x7c ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e428: 80 8e 60 0f btst 0xf, %i1 200e42c: 12 80 00 3d bne 200e520 200e430: 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 ) { 200e434: 80 8e 64 00 btst 0x400, %i1 200e438: 02 80 00 14 be 200e488 200e43c: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e440: c4 0c 60 08 ldub [ %l1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 200e444: b0 0e 24 00 and %i0, 0x400, %i0 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 200e448: 80 a0 00 18 cmp %g0, %i0 200e44c: 82 60 3f ff subx %g0, -1, %g1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e450: 80 a0 80 01 cmp %g2, %g1 200e454: 22 80 00 0e be,a 200e48c 200e458: 03 00 80 58 sethi %hi(0x2016000), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200e45c: 7f ff cf 93 call 20022a8 200e460: c2 2c 60 08 stb %g1, [ %l1 + 8 ] _signals = information->signals_pending; 200e464: c4 04 60 18 ld [ %l1 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200e468: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 information->signals_posted = _signals; 200e46c: c4 24 60 14 st %g2, [ %l1 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 200e470: c2 24 60 18 st %g1, [ %l1 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200e474: 7f ff cf 91 call 20022b8 200e478: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200e47c: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200e480: 80 a0 00 01 cmp %g0, %g1 200e484: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200e488: 03 00 80 58 sethi %hi(0x2016000), %g1 200e48c: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 ! 201605c <_System_state_Current> 200e490: 80 a0 a0 03 cmp %g2, 3 200e494: 02 80 00 11 be 200e4d8 <== ALWAYS TAKEN 200e498: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 200e49c: 81 c7 e0 08 ret 200e4a0: 91 e8 00 01 restore %g0, %g1, %o0 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; 200e4a4: c2 0c 60 08 ldub [ %l1 + 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; 200e4a8: a4 14 a2 00 or %l2, 0x200, %l2 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e4ac: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e4b0: 7f ff f0 93 call 200a6fc <_CPU_ISR_Get_level> 200e4b4: a8 60 3f ff subx %g0, -1, %l4 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; 200e4b8: a9 2d 20 0a sll %l4, 0xa, %l4 200e4bc: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 200e4c0: a4 15 00 12 or %l4, %l2, %l2 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e4c4: 80 8e 61 00 btst 0x100, %i1 200e4c8: 02 bf ff cd be 200e3fc 200e4cc: e4 26 80 00 st %l2, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 200e4d0: 10 bf ff c8 b 200e3f0 200e4d4: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 200e4d8: 80 88 e0 ff btst 0xff, %g3 200e4dc: 12 80 00 0a bne 200e504 200e4e0: c4 04 e0 0c ld [ %l3 + 0xc ], %g2 200e4e4: c6 04 e0 10 ld [ %l3 + 0x10 ], %g3 200e4e8: 80 a0 80 03 cmp %g2, %g3 200e4ec: 02 bf ff ec be 200e49c 200e4f0: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200e4f4: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200e4f8: 80 a0 a0 00 cmp %g2, 0 200e4fc: 02 bf ff e8 be 200e49c <== NEVER TAKEN 200e500: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200e504: 82 10 20 01 mov 1, %g1 ! 1 200e508: c2 2c e0 18 stb %g1, [ %l3 + 0x18 ] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200e50c: 7f ff e9 d8 call 2008c6c <_Thread_Dispatch> 200e510: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200e514: 82 10 20 00 clr %g1 ! 0 } 200e518: 81 c7 e0 08 ret 200e51c: 91 e8 00 01 restore %g0, %g1, %o0 */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 200e520: 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 ) ); 200e524: 7f ff cf 65 call 20022b8 200e528: 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 ) { 200e52c: 10 bf ff c3 b 200e438 200e530: 80 8e 64 00 btst 0x400, %i1 =============================================================================== 0200b548 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200b548: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200b54c: 80 a6 60 00 cmp %i1, 0 200b550: 02 80 00 07 be 200b56c 200b554: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200b558: 03 00 80 67 sethi %hi(0x2019c00), %g1 200b55c: c2 08 62 94 ldub [ %g1 + 0x294 ], %g1 ! 2019e94 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200b560: 80 a6 40 01 cmp %i1, %g1 200b564: 18 80 00 1c bgu 200b5d4 200b568: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200b56c: 80 a6 a0 00 cmp %i2, 0 200b570: 02 80 00 19 be 200b5d4 200b574: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200b578: 40 00 09 58 call 200dad8 <_Thread_Get> 200b57c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b580: c2 07 bf fc ld [ %fp + -4 ], %g1 200b584: 80 a0 60 00 cmp %g1, 0 200b588: 12 80 00 13 bne 200b5d4 200b58c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b590: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b594: 80 a6 60 00 cmp %i1, 0 200b598: 02 80 00 0d be 200b5cc 200b59c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b5a0: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b5a4: 80 a0 60 00 cmp %g1, 0 200b5a8: 02 80 00 06 be 200b5c0 200b5ac: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200b5b0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b5b4: 80 a6 40 01 cmp %i1, %g1 200b5b8: 1a 80 00 05 bcc 200b5cc <== ALWAYS TAKEN 200b5bc: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200b5c0: 92 10 00 19 mov %i1, %o1 200b5c4: 40 00 07 dd call 200d538 <_Thread_Change_priority> 200b5c8: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b5cc: 40 00 09 35 call 200daa0 <_Thread_Enable_dispatch> 200b5d0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200b5d4: 81 c7 e0 08 ret 200b5d8: 81 e8 00 00 restore =============================================================================== 020078fc : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 20078fc: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 2007900: 80 a6 60 00 cmp %i1, 0 2007904: 02 80 00 1e be 200797c 2007908: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 200790c: 90 10 00 18 mov %i0, %o0 2007910: 40 00 08 e0 call 2009c90 <_Thread_Get> 2007914: 92 07 bf fc add %fp, -4, %o1 switch (location) { 2007918: c2 07 bf fc ld [ %fp + -4 ], %g1 200791c: 80 a0 60 00 cmp %g1, 0 2007920: 12 80 00 19 bne 2007984 2007924: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 2007928: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200792c: 80 a0 60 00 cmp %g1, 0 2007930: 02 80 00 10 be 2007970 2007934: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007938: c4 00 60 04 ld [ %g1 + 4 ], %g2 200793c: 80 a0 80 19 cmp %g2, %i1 2007940: 32 80 00 09 bne,a 2007964 2007944: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 2007948: 10 80 00 19 b 20079ac 200794c: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2007950: 80 a0 80 19 cmp %g2, %i1 2007954: 22 80 00 0e be,a 200798c 2007958: c4 02 40 00 ld [ %o1 ], %g2 200795c: 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; 2007960: 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) { 2007964: 80 a2 60 00 cmp %o1, 0 2007968: 32 bf ff fa bne,a 2007950 <== ALWAYS TAKEN 200796c: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2007970: 40 00 08 ba call 2009c58 <_Thread_Enable_dispatch> 2007974: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2007978: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200797c: 81 c7 e0 08 ret 2007980: 91 e8 00 01 restore %g0, %g1, %o0 2007984: 81 c7 e0 08 ret 2007988: 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; 200798c: 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 ); 2007990: 40 00 00 2e call 2007a48 <_RTEMS_Tasks_Invoke_task_variable_dtor> 2007994: 01 00 00 00 nop _Thread_Enable_dispatch(); 2007998: 40 00 08 b0 call 2009c58 <_Thread_Enable_dispatch> 200799c: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20079a0: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20079a4: 81 c7 e0 08 ret 20079a8: 91 e8 00 01 restore %g0, %g1, %o0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 20079ac: 92 10 00 01 mov %g1, %o1 20079b0: 10 bf ff f8 b 2007990 20079b4: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 020079b8 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 20079b8: 9d e3 bf 98 save %sp, -104, %sp 20079bc: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 20079c0: 80 a6 60 00 cmp %i1, 0 20079c4: 02 80 00 1b be 2007a30 20079c8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 20079cc: 80 a6 a0 00 cmp %i2, 0 20079d0: 02 80 00 1c be 2007a40 20079d4: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20079d8: 40 00 08 ae call 2009c90 <_Thread_Get> 20079dc: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20079e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20079e4: 80 a0 60 00 cmp %g1, 0 20079e8: 12 80 00 12 bne 2007a30 20079ec: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 20079f0: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 20079f4: 80 a0 60 00 cmp %g1, 0 20079f8: 32 80 00 07 bne,a 2007a14 20079fc: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007a00: 30 80 00 0e b,a 2007a38 2007a04: 80 a0 60 00 cmp %g1, 0 2007a08: 02 80 00 0c be 2007a38 <== NEVER TAKEN 2007a0c: 01 00 00 00 nop if (tvp->ptr == ptr) { 2007a10: c4 00 60 04 ld [ %g1 + 4 ], %g2 2007a14: 80 a0 80 19 cmp %g2, %i1 2007a18: 32 bf ff fb bne,a 2007a04 2007a1c: 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; 2007a20: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 2007a24: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 2007a28: 40 00 08 8c call 2009c58 <_Thread_Enable_dispatch> 2007a2c: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2007a30: 81 c7 e0 08 ret 2007a34: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2007a38: 40 00 08 88 call 2009c58 <_Thread_Enable_dispatch> 2007a3c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 2007a40: 81 c7 e0 08 ret 2007a44: 81 e8 00 00 restore =============================================================================== 02016218 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2016218: 9d e3 bf 98 save %sp, -104, %sp Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) _Objects_Get( &_Timer_Information, id, location ); 201621c: 11 00 80 f5 sethi %hi(0x203d400), %o0 2016220: 92 10 00 18 mov %i0, %o1 2016224: 90 12 20 c4 or %o0, 0xc4, %o0 2016228: 40 00 0c 66 call 20193c0 <_Objects_Get> 201622c: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016230: c2 07 bf fc ld [ %fp + -4 ], %g1 2016234: 80 a0 60 00 cmp %g1, 0 2016238: 22 80 00 04 be,a 2016248 201623c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016240: 81 c7 e0 08 ret 2016244: 91 e8 20 04 restore %g0, 4, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2016248: 80 a0 60 04 cmp %g1, 4 201624c: 02 80 00 04 be 201625c <== NEVER TAKEN 2016250: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2016254: 40 00 14 f1 call 201b618 <_Watchdog_Remove> 2016258: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 201625c: 40 00 0f a2 call 201a0e4 <_Thread_Enable_dispatch> 2016260: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2016264: 81 c7 e0 08 ret 2016268: 81 e8 00 00 restore =============================================================================== 02016730 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016730: 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; 2016734: 03 00 80 f5 sethi %hi(0x203d400), %g1 2016738: e0 00 61 04 ld [ %g1 + 0x104 ], %l0 ! 203d504 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 201673c: a2 10 00 18 mov %i0, %l1 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 2016740: 80 a4 20 00 cmp %l0, 0 2016744: 02 80 00 10 be 2016784 2016748: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 201674c: 03 00 80 f4 sethi %hi(0x203d000), %g1 2016750: c2 08 61 f0 ldub [ %g1 + 0x1f0 ], %g1 ! 203d1f0 <_TOD_Is_set> 2016754: 80 a0 60 00 cmp %g1, 0 2016758: 02 80 00 0b be 2016784 <== NEVER TAKEN 201675c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2016760: 80 a6 a0 00 cmp %i2, 0 2016764: 02 80 00 08 be 2016784 2016768: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 201676c: 90 10 00 19 mov %i1, %o0 2016770: 7f ff f3 b2 call 2013638 <_TOD_Validate> 2016774: b0 10 20 14 mov 0x14, %i0 2016778: 80 8a 20 ff btst 0xff, %o0 201677c: 12 80 00 04 bne 201678c 2016780: 01 00 00 00 nop case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016784: 81 c7 e0 08 ret 2016788: 81 e8 00 00 restore return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 201678c: 7f ff f3 75 call 2013560 <_TOD_To_seconds> 2016790: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2016794: 25 00 80 f4 sethi %hi(0x203d000), %l2 2016798: c2 04 a2 8c ld [ %l2 + 0x28c ], %g1 ! 203d28c <_TOD_Now> 201679c: 80 a2 00 01 cmp %o0, %g1 20167a0: 08 bf ff f9 bleu 2016784 20167a4: b2 10 00 08 mov %o0, %i1 20167a8: 92 10 00 11 mov %l1, %o1 20167ac: 11 00 80 f5 sethi %hi(0x203d400), %o0 20167b0: 94 07 bf fc add %fp, -4, %o2 20167b4: 40 00 0b 03 call 20193c0 <_Objects_Get> 20167b8: 90 12 20 c4 or %o0, 0xc4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 20167bc: c2 07 bf fc ld [ %fp + -4 ], %g1 20167c0: 80 a0 60 00 cmp %g1, 0 20167c4: 12 80 00 16 bne 201681c 20167c8: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 20167cc: 40 00 13 93 call 201b618 <_Watchdog_Remove> 20167d0: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20167d4: c4 04 a2 8c ld [ %l2 + 0x28c ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 20167d8: c2 04 20 04 ld [ %l0 + 4 ], %g1 20167dc: 92 10 00 18 mov %i0, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20167e0: b2 26 40 02 sub %i1, %g2, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 20167e4: 90 10 00 10 mov %l0, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 20167e8: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20167ec: f4 26 20 2c st %i2, [ %i0 + 0x2c ] 20167f0: c4 26 20 38 st %g2, [ %i0 + 0x38 ] the_watchdog->id = id; 20167f4: e2 26 20 30 st %l1, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 20167f8: f6 26 20 34 st %i3, [ %i0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 20167fc: f2 26 20 1c st %i1, [ %i0 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2016800: c0 26 20 18 clr [ %i0 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2016804: 9f c0 40 00 call %g1 2016808: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 201680c: 40 00 0e 36 call 201a0e4 <_Thread_Enable_dispatch> 2016810: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2016814: 81 c7 e0 08 ret 2016818: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 201681c: 81 c7 e0 08 ret 2016820: 91 e8 20 04 restore %g0, 4, %o0