=============================================================================== 020012a8 <_Barrier_Manager_initialization>: #include #include void _Barrier_Manager_initialization(void) { } 20012a8: 81 c3 e0 08 retl =============================================================================== 02016888 <_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 ) { 2016888: 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 ) { 201688c: 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 ) { 2016890: 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 ) { 2016894: 80 a6 80 01 cmp %i2, %g1 2016898: 18 80 00 17 bgu 20168f4 <_CORE_message_queue_Broadcast+0x6c><== NEVER TAKEN 201689c: 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 ) { 20168a0: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 20168a4: 80 a0 60 00 cmp %g1, 0 20168a8: 02 80 00 0a be 20168d0 <_CORE_message_queue_Broadcast+0x48> 20168ac: a2 10 20 00 clr %l1 *count = 0; 20168b0: c0 27 40 00 clr [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 20168b4: 81 c7 e0 08 ret 20168b8: 91 e8 20 00 restore %g0, 0, %o0 const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 20168bc: d0 04 a0 2c ld [ %l2 + 0x2c ], %o0 20168c0: 40 00 27 b7 call 202079c 20168c4: a2 04 60 01 inc %l1 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 20168c8: c2 04 a0 28 ld [ %l2 + 0x28 ], %g1 20168cc: 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 = _Thread_queue_Dequeue(&the_message_queue->Wait_queue))) { 20168d0: 40 00 0a 2a call 2019178 <_Thread_queue_Dequeue> 20168d4: 90 10 00 10 mov %l0, %o0 20168d8: 92 10 00 19 mov %i1, %o1 20168dc: a4 10 00 08 mov %o0, %l2 /* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread = 20168e0: 80 a2 20 00 cmp %o0, 0 20168e4: 12 bf ff f6 bne 20168bc <_CORE_message_queue_Broadcast+0x34> 20168e8: 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; 20168ec: e2 27 40 00 st %l1, [ %i5 ] 20168f0: b0 10 20 00 clr %i0 return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; } 20168f4: 81 c7 e0 08 ret 20168f8: 81 e8 00 00 restore =============================================================================== 020100fc <_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 ) { 20100fc: 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; 2010100: 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; 2010104: 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; 2010108: f6 26 20 4c st %i3, [ %i0 + 0x4c ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 201010c: 80 8e e0 03 btst 3, %i3 2010110: 02 80 00 07 be 201012c <_CORE_message_queue_Initialize+0x30> 2010114: a2 10 00 1b mov %i3, %l1 allocated_message_size += sizeof(uint32_t); 2010118: a2 06 e0 04 add %i3, 4, %l1 allocated_message_size &= ~(sizeof(uint32_t) - 1); 201011c: a2 0c 7f fc and %l1, -4, %l1 } if (allocated_message_size < maximum_message_size) 2010120: 80 a4 40 1b cmp %l1, %i3 2010124: 0a 80 00 23 bcs 20101b0 <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 2010128: 01 00 00 00 nop /* * 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)); 201012c: a0 04 60 10 add %l1, 0x10, %l0 /* * 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 * 2010130: 92 10 00 1a mov %i2, %o1 2010134: 40 00 50 e0 call 20244b4 <.umul> 2010138: 90 10 00 10 mov %l0, %o0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 201013c: 80 a2 00 11 cmp %o0, %l1 2010140: 0a 80 00 1c bcs 20101b0 <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 2010144: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010148: 40 00 0b c6 call 2013060 <_Workspace_Allocate> 201014c: 01 00 00 00 nop 2010150: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010154: 80 a2 20 00 cmp %o0, 0 2010158: 02 80 00 16 be 20101b0 <_CORE_message_queue_Initialize+0xb4> 201015c: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010160: 90 06 20 60 add %i0, 0x60, %o0 2010164: 94 10 00 1a mov %i2, %o2 2010168: 40 00 18 34 call 2016238 <_Chain_Initialize> 201016c: 96 10 00 10 mov %l0, %o3 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2010170: c2 06 40 00 ld [ %i1 ], %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); the_chain->permanent_null = NULL; 2010174: c0 26 20 54 clr [ %i0 + 0x54 ] 2010178: 82 18 60 01 xor %g1, 1, %g1 201017c: 80 a0 00 01 cmp %g0, %g1 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2010180: 82 06 20 54 add %i0, 0x54, %g1 2010184: c2 26 20 50 st %g1, [ %i0 + 0x50 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2010188: 82 06 20 50 add %i0, 0x50, %g1 201018c: 90 10 00 18 mov %i0, %o0 2010190: c2 26 20 58 st %g1, [ %i0 + 0x58 ] 2010194: 92 60 3f ff subx %g0, -1, %o1 2010198: 94 10 20 80 mov 0x80, %o2 201019c: 96 10 20 06 mov 6, %o3 20101a0: 40 00 08 9e call 2012418 <_Thread_queue_Initialize> 20101a4: b0 10 20 01 mov 1, %i0 THREAD_QUEUE_DISCIPLINE_PRIORITY : THREAD_QUEUE_DISCIPLINE_FIFO, STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; 20101a8: 81 c7 e0 08 ret 20101ac: 81 e8 00 00 restore } 20101b0: 81 c7 e0 08 ret 20101b4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020101b8 <_CORE_message_queue_Seize>: void *buffer, size_t *size_p, bool wait, Watchdog_Interval timeout ) { 20101b8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; CORE_message_queue_Buffer_control *the_message; Thread_Control *executing; executing = _Thread_Executing; 20101bc: 23 00 80 ac sethi %hi(0x202b000), %l1 20101c0: e0 04 61 60 ld [ %l1 + 0x160 ], %l0 ! 202b160 <_Thread_Executing> void *buffer, size_t *size_p, bool wait, Watchdog_Interval timeout ) { 20101c4: a4 10 00 19 mov %i1, %l2 CORE_message_queue_Buffer_control *the_message; Thread_Control *executing; executing = _Thread_Executing; executing->Wait.return_code = CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; _ISR_Disable( level ); 20101c8: 7f ff dc e0 call 2007548 20101cc: c0 24 20 34 clr [ %l0 + 0x34 ] 20101d0: 82 10 00 08 mov %o0, %g1 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 20101d4: e6 06 20 50 ld [ %i0 + 0x50 ], %l3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 20101d8: 84 06 20 54 add %i0, 0x54, %g2 20101dc: 80 a4 c0 02 cmp %l3, %g2 20101e0: 02 80 00 15 be 2010234 <_CORE_message_queue_Seize+0x7c> 20101e4: 86 06 20 50 add %i0, 0x50, %g3 { Chain_Node *return_node; Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; 20101e8: c4 04 c0 00 ld [ %l3 ], %g2 the_chain->first = new_first; 20101ec: c4 26 20 50 st %g2, [ %i0 + 0x50 ] the_message = _CORE_message_queue_Get_pending_message( the_message_queue ); if ( the_message != NULL ) { 20101f0: 80 a4 e0 00 cmp %l3, 0 20101f4: 02 80 00 10 be 2010234 <_CORE_message_queue_Seize+0x7c> <== NEVER TAKEN 20101f8: c6 20 a0 04 st %g3, [ %g2 + 4 ] the_message_queue->number_of_pending_messages -= 1; 20101fc: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2010200: 82 00 7f ff add %g1, -1, %g1 2010204: c2 26 20 48 st %g1, [ %i0 + 0x48 ] _ISR_Enable( level ); 2010208: 7f ff dc d4 call 2007558 201020c: b0 06 20 60 add %i0, 0x60, %i0 *size_p = the_message->Contents.size; _Thread_Executing->Wait.count = 2010210: c2 04 61 60 ld [ %l1 + 0x160 ], %g1 the_message = _CORE_message_queue_Get_pending_message( the_message_queue ); if ( the_message != NULL ) { the_message_queue->number_of_pending_messages -= 1; _ISR_Enable( level ); *size_p = the_message->Contents.size; 2010214: d4 04 e0 08 ld [ %l3 + 8 ], %o2 _Thread_Executing->Wait.count = 2010218: c0 20 60 24 clr [ %g1 + 0x24 ] the_message = _CORE_message_queue_Get_pending_message( the_message_queue ); if ( the_message != NULL ) { the_message_queue->number_of_pending_messages -= 1; _ISR_Enable( level ); *size_p = the_message->Contents.size; 201021c: d4 26 c0 00 st %o2, [ %i3 ] const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 2010220: 90 10 00 1a mov %i2, %o0 2010224: 40 00 24 7c call 2019414 2010228: 92 04 e0 0c add %l3, 0xc, %o1 RTEMS_INLINE_ROUTINE void _CORE_message_queue_Free_message_buffer ( CORE_message_queue_Control *the_message_queue, CORE_message_queue_Buffer_control *the_message ) { _Chain_Append( &the_message_queue->Inactive_messages, &the_message->Node ); 201022c: 7f ff ff 83 call 2010038 <_Chain_Append> 2010230: 93 e8 00 13 restore %g0, %l3, %o1 return; } #endif } if ( !wait ) { 2010234: 80 8f 20 ff btst 0xff, %i4 2010238: 12 80 00 08 bne 2010258 <_CORE_message_queue_Seize+0xa0> 201023c: 84 10 20 01 mov 1, %g2 _ISR_Enable( level ); 2010240: 7f ff dc c6 call 2007558 2010244: 90 10 00 01 mov %g1, %o0 executing->Wait.return_code = CORE_MESSAGE_QUEUE_STATUS_UNSATISFIED_NOWAIT; 2010248: 82 10 20 04 mov 4, %g1 201024c: c2 24 20 34 st %g1, [ %l0 + 0x34 ] executing->Wait.return_argument = size_p; /* Wait.count will be filled in with the message priority */ _ISR_Enable( level ); _Thread_queue_Enqueue( &the_message_queue->Wait_queue, timeout ); } 2010250: 81 c7 e0 08 ret 2010254: 81 e8 00 00 restore 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; 2010258: c4 26 20 30 st %g2, [ %i0 + 0x30 ] _Thread_queue_Enter_critical_section( &the_message_queue->Wait_queue ); executing->Wait.queue = &the_message_queue->Wait_queue; executing->Wait.id = id; executing->Wait.return_argument_second.mutable_object = buffer; executing->Wait.return_argument = size_p; 201025c: f6 24 20 28 st %i3, [ %l0 + 0x28 ] return; } _Thread_queue_Enter_critical_section( &the_message_queue->Wait_queue ); executing->Wait.queue = &the_message_queue->Wait_queue; executing->Wait.id = id; 2010260: e4 24 20 20 st %l2, [ %l0 + 0x20 ] executing->Wait.return_argument_second.mutable_object = buffer; 2010264: f4 24 20 2c st %i2, [ %l0 + 0x2c ] executing->Wait.return_code = CORE_MESSAGE_QUEUE_STATUS_UNSATISFIED_NOWAIT; return; } _Thread_queue_Enter_critical_section( &the_message_queue->Wait_queue ); executing->Wait.queue = &the_message_queue->Wait_queue; 2010268: f0 24 20 44 st %i0, [ %l0 + 0x44 ] executing->Wait.id = id; executing->Wait.return_argument_second.mutable_object = buffer; executing->Wait.return_argument = size_p; /* Wait.count will be filled in with the message priority */ _ISR_Enable( level ); 201026c: 90 10 00 01 mov %g1, %o0 2010270: 7f ff dc ba call 2007558 2010274: 35 00 80 49 sethi %hi(0x2012400), %i2 _Thread_queue_Enqueue( &the_message_queue->Wait_queue, timeout ); 2010278: b2 10 00 1d mov %i5, %i1 201027c: 40 00 07 c7 call 2012198 <_Thread_queue_Enqueue_with_handler> 2010280: 95 ee a0 e4 restore %i2, 0xe4, %o2 =============================================================================== 02006e68 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2006e68: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2006e6c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006e70: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 ! 201cc20 <_Thread_Dispatch_disable_level> 2006e74: 80 a0 60 00 cmp %g1, 0 2006e78: 02 80 00 0d be 2006eac <_CORE_mutex_Seize+0x44> 2006e7c: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2006e80: 80 8e a0 ff btst 0xff, %i2 2006e84: 02 80 00 0b be 2006eb0 <_CORE_mutex_Seize+0x48> <== NEVER TAKEN 2006e88: 90 10 00 18 mov %i0, %o0 2006e8c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006e90: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 ! 201cdc0 <_System_state_Current> 2006e94: 80 a0 60 01 cmp %g1, 1 2006e98: 08 80 00 05 bleu 2006eac <_CORE_mutex_Seize+0x44> 2006e9c: 90 10 20 00 clr %o0 2006ea0: 92 10 20 00 clr %o1 2006ea4: 40 00 01 d3 call 20075f0 <_Internal_error_Occurred> 2006ea8: 94 10 20 13 mov 0x13, %o2 2006eac: 90 10 00 18 mov %i0, %o0 2006eb0: 40 00 17 0c call 200cae0 <_CORE_mutex_Seize_interrupt_trylock> 2006eb4: 92 07 a0 54 add %fp, 0x54, %o1 2006eb8: 80 a2 20 00 cmp %o0, 0 2006ebc: 02 80 00 09 be 2006ee0 <_CORE_mutex_Seize+0x78> 2006ec0: 80 8e a0 ff btst 0xff, %i2 2006ec4: 12 80 00 09 bne 2006ee8 <_CORE_mutex_Seize+0x80> 2006ec8: 35 00 80 73 sethi %hi(0x201cc00), %i2 2006ecc: 7f ff ec 42 call 2001fd4 2006ed0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2006ed4: c2 06 a0 e0 ld [ %i2 + 0xe0 ], %g1 2006ed8: 84 10 20 01 mov 1, %g2 2006edc: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2006ee0: 81 c7 e0 08 ret 2006ee4: 81 e8 00 00 restore 2006ee8: c4 06 a0 e0 ld [ %i2 + 0xe0 ], %g2 2006eec: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006ef0: c6 00 60 20 ld [ %g1 + 0x20 ], %g3 ! 201cc20 <_Thread_Dispatch_disable_level> 2006ef4: f2 20 a0 20 st %i1, [ %g2 + 0x20 ] 2006ef8: f0 20 a0 44 st %i0, [ %g2 + 0x44 ] 2006efc: 84 00 e0 01 add %g3, 1, %g2 2006f00: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 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; 2006f04: 82 10 20 01 mov 1, %g1 2006f08: c2 26 20 30 st %g1, [ %i0 + 0x30 ] 2006f0c: 7f ff ec 32 call 2001fd4 2006f10: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2006f14: 90 10 00 18 mov %i0, %o0 2006f18: 7f ff ff bb call 2006e04 <_CORE_mutex_Seize_interrupt_blocking> 2006f1c: 92 10 00 1b mov %i3, %o1 2006f20: 81 c7 e0 08 ret 2006f24: 81 e8 00 00 restore =============================================================================== 0200cae0 <_CORE_mutex_Seize_interrupt_trylock>: #if defined(__RTEMS_DO_NOT_INLINE_CORE_MUTEX_SEIZE__) int _CORE_mutex_Seize_interrupt_trylock( CORE_mutex_Control *the_mutex, ISR_Level *level_p ) { 200cae0: 9d e3 bf a0 save %sp, -96, %sp { Thread_Control *executing; /* disabled when you get here */ executing = _Thread_Executing; 200cae4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200cae8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 201cce0 <_Thread_Executing> executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; 200caec: c0 20 60 34 clr [ %g1 + 0x34 ] if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 200caf0: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 200caf4: 80 a0 a0 00 cmp %g2, 0 200caf8: 22 80 00 2f be,a 200cbb4 <_CORE_mutex_Seize_interrupt_trylock+0xd4> 200cafc: c4 06 20 5c ld [ %i0 + 0x5c ], %g2 the_mutex->lock = CORE_MUTEX_LOCKED; 200cb00: c0 26 20 50 clr [ %i0 + 0x50 ] the_mutex->holder = executing; the_mutex->holder_id = executing->Object.id; 200cb04: c6 00 60 08 ld [ %g1 + 8 ], %g3 */ RTEMS_INLINE_ROUTINE bool _CORE_mutex_Is_inherit_priority( CORE_mutex_Attributes *the_attribute ) { return the_attribute->discipline == CORE_MUTEX_DISCIPLINES_PRIORITY_INHERIT; 200cb08: c4 06 20 48 ld [ %i0 + 0x48 ], %g2 executing = _Thread_Executing; executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; if ( !_CORE_mutex_Is_locked( the_mutex ) ) { the_mutex->lock = CORE_MUTEX_LOCKED; the_mutex->holder = executing; the_mutex->holder_id = executing->Object.id; 200cb0c: c6 26 20 60 st %g3, [ %i0 + 0x60 ] executing = _Thread_Executing; executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; if ( !_CORE_mutex_Is_locked( the_mutex ) ) { the_mutex->lock = CORE_MUTEX_LOCKED; the_mutex->holder = executing; 200cb10: c2 26 20 5c st %g1, [ %i0 + 0x5c ] the_mutex->holder_id = executing->Object.id; the_mutex->nest_count = 1; 200cb14: 86 10 20 01 mov 1, %g3 if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 200cb18: 80 a0 a0 02 cmp %g2, 2 200cb1c: 02 80 00 05 be 200cb30 <_CORE_mutex_Seize_interrupt_trylock+0x50> 200cb20: c6 26 20 54 st %g3, [ %i0 + 0x54 ] 200cb24: 80 a0 a0 03 cmp %g2, 3 200cb28: 12 80 00 31 bne 200cbec <_CORE_mutex_Seize_interrupt_trylock+0x10c> 200cb2c: 01 00 00 00 nop _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 200cb30: c6 00 60 1c ld [ %g1 + 0x1c ], %g3 } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { 200cb34: 80 a0 a0 03 cmp %g2, 3 _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 200cb38: 84 00 e0 01 add %g3, 1, %g2 } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { 200cb3c: 12 80 00 2c bne 200cbec <_CORE_mutex_Seize_interrupt_trylock+0x10c> 200cb40: c4 20 60 1c st %g2, [ %g1 + 0x1c ] */ { Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; 200cb44: c4 06 20 4c ld [ %i0 + 0x4c ], %g2 current = executing->current_priority; 200cb48: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 if ( current == ceiling ) { 200cb4c: 80 a0 c0 02 cmp %g3, %g2 200cb50: 02 80 00 27 be 200cbec <_CORE_mutex_Seize_interrupt_trylock+0x10c> 200cb54: 01 00 00 00 nop _ISR_Enable( *level_p ); return 0; } if ( current > ceiling ) { 200cb58: 08 80 00 0f bleu 200cb94 <_CORE_mutex_Seize_interrupt_trylock+0xb4> 200cb5c: 84 10 20 06 mov 6, %g2 ! 6 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200cb60: 03 00 80 73 sethi %hi(0x201cc00), %g1 200cb64: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201cc20 <_Thread_Dispatch_disable_level> 200cb68: 84 00 a0 01 inc %g2 200cb6c: c4 20 60 20 st %g2, [ %g1 + 0x20 ] _Thread_Disable_dispatch(); _ISR_Enable( *level_p ); 200cb70: 7f ff d5 19 call 2001fd4 200cb74: d0 06 40 00 ld [ %i1 ], %o0 _Thread_Change_priority( 200cb78: d2 06 20 4c ld [ %i0 + 0x4c ], %o1 200cb7c: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 200cb80: 7f ff ec f4 call 2007f50 <_Thread_Change_priority> 200cb84: 94 10 20 00 clr %o2 the_mutex->holder, the_mutex->Attributes.priority_ceiling, false ); _Thread_Enable_dispatch(); 200cb88: 7f ff ee 7d call 200857c <_Thread_Enable_dispatch> 200cb8c: b0 10 20 00 clr %i0 200cb90: 30 80 00 1a b,a 200cbf8 <_CORE_mutex_Seize_interrupt_trylock+0x118> return 0; } /* if ( current < ceiling ) */ { executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED; 200cb94: c4 20 60 34 st %g2, [ %g1 + 0x34 ] the_mutex->lock = CORE_MUTEX_UNLOCKED; 200cb98: 84 10 20 01 mov 1, %g2 the_mutex->nest_count = 0; /* undo locking above */ 200cb9c: c0 26 20 54 clr [ %i0 + 0x54 ] _Thread_Enable_dispatch(); return 0; } /* if ( current < ceiling ) */ { executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED; the_mutex->lock = CORE_MUTEX_UNLOCKED; 200cba0: c4 26 20 50 st %g2, [ %i0 + 0x50 ] the_mutex->nest_count = 0; /* undo locking above */ executing->resource_count--; /* undo locking above */ 200cba4: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 200cba8: 84 00 bf ff add %g2, -1, %g2 200cbac: 10 80 00 10 b 200cbec <_CORE_mutex_Seize_interrupt_trylock+0x10c> 200cbb0: c4 20 60 1c st %g2, [ %g1 + 0x1c ] /* * At this point, we know the mutex was not available. If this thread * is the thread that has locked the mutex, let's see if we are allowed * to nest access. */ if ( _Thread_Is_executing( the_mutex->holder ) ) { 200cbb4: 80 a0 80 01 cmp %g2, %g1 200cbb8: 12 80 00 12 bne 200cc00 <_CORE_mutex_Seize_interrupt_trylock+0x120> 200cbbc: 01 00 00 00 nop switch ( the_mutex->Attributes.lock_nesting_behavior ) { 200cbc0: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 200cbc4: 80 a0 60 00 cmp %g1, 0 200cbc8: 22 80 00 07 be,a 200cbe4 <_CORE_mutex_Seize_interrupt_trylock+0x104> 200cbcc: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 200cbd0: 80 a0 60 01 cmp %g1, 1 200cbd4: 12 80 00 0b bne 200cc00 <_CORE_mutex_Seize_interrupt_trylock+0x120><== ALWAYS TAKEN 200cbd8: 82 10 20 02 mov 2, %g1 case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; _ISR_Enable( *level_p ); return 0; case CORE_MUTEX_NESTING_IS_ERROR: executing->Wait.return_code = CORE_MUTEX_STATUS_NESTING_NOT_ALLOWED; 200cbdc: 10 80 00 04 b 200cbec <_CORE_mutex_Seize_interrupt_trylock+0x10c><== NOT EXECUTED 200cbe0: c2 20 a0 34 st %g1, [ %g2 + 0x34 ] <== NOT EXECUTED * to nest access. */ if ( _Thread_Is_executing( the_mutex->holder ) ) { switch ( the_mutex->Attributes.lock_nesting_behavior ) { case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; 200cbe4: 82 00 60 01 inc %g1 200cbe8: c2 26 20 54 st %g1, [ %i0 + 0x54 ] _ISR_Enable( *level_p ); return 0; case CORE_MUTEX_NESTING_IS_ERROR: executing->Wait.return_code = CORE_MUTEX_STATUS_NESTING_NOT_ALLOWED; _ISR_Enable( *level_p ); 200cbec: 7f ff d4 fa call 2001fd4 200cbf0: d0 06 40 00 ld [ %i1 ], %o0 200cbf4: b0 10 20 00 clr %i0 200cbf8: 81 c7 e0 08 ret 200cbfc: 81 e8 00 00 restore return _CORE_mutex_Seize_interrupt_trylock_body( the_mutex, level_p ); } 200cc00: 81 c7 e0 08 ret 200cc04: 91 e8 20 01 restore %g0, 1, %o0 =============================================================================== 020070cc <_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 ) { 20070cc: 9d e3 bf a0 save %sp, -96, %sp 20070d0: a0 10 00 18 mov %i0, %l0 ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 20070d4: b0 10 20 00 clr %i0 20070d8: 40 00 06 1f call 2008954 <_Thread_queue_Dequeue> 20070dc: 90 10 00 10 mov %l0, %o0 20070e0: 80 a2 20 00 cmp %o0, 0 20070e4: 12 80 00 0e bne 200711c <_CORE_semaphore_Surrender+0x50> 20070e8: 01 00 00 00 nop if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 20070ec: 7f ff eb b6 call 2001fc4 20070f0: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 20070f4: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 20070f8: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 20070fc: 80 a0 40 02 cmp %g1, %g2 2007100: 1a 80 00 05 bcc 2007114 <_CORE_semaphore_Surrender+0x48> <== NEVER TAKEN 2007104: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007108: 82 00 60 01 inc %g1 200710c: b0 10 20 00 clr %i0 2007110: c2 24 20 48 st %g1, [ %l0 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007114: 7f ff eb b0 call 2001fd4 2007118: 01 00 00 00 nop } return status; } 200711c: 81 c7 e0 08 ret 2007120: 81 e8 00 00 restore =============================================================================== 020012b0 <_Dual_ported_memory_Manager_initialization>: #include #include void _Dual_ported_memory_Manager_initialization(void) { } 20012b0: 81 c3 e0 08 retl =============================================================================== 020012b8 <_Event_Manager_initialization>: #include #include void _Event_Manager_initialization(void) { } 20012b8: 81 c3 e0 08 retl =============================================================================== 02005d38 <_Event_Seize>: rtems_event_set event_in, rtems_option option_set, rtems_interval ticks, rtems_event_set *event_out ) { 2005d38: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set pending_events; ISR_Level level; RTEMS_API_Control *api; Thread_blocking_operation_States sync_state; executing = _Thread_Executing; 2005d3c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2005d40: e0 00 60 e0 ld [ %g1 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> executing->Wait.return_code = RTEMS_SUCCESSFUL; 2005d44: c0 24 20 34 clr [ %l0 + 0x34 ] api = executing->API_Extensions[ THREAD_API_RTEMS ]; _ISR_Disable( level ); 2005d48: 7f ff f0 9f call 2001fc4 2005d4c: e4 04 21 60 ld [ %l0 + 0x160 ], %l2 pending_events = api->pending_events; 2005d50: c2 04 80 00 ld [ %l2 ], %g1 seized_events = _Event_sets_Get( pending_events, event_in ); if ( !_Event_sets_Is_empty( seized_events ) && 2005d54: a2 8e 00 01 andcc %i0, %g1, %l1 2005d58: 02 80 00 0e be 2005d90 <_Event_Seize+0x58> 2005d5c: 80 8e 60 01 btst 1, %i1 2005d60: 80 a4 40 18 cmp %l1, %i0 2005d64: 02 80 00 04 be 2005d74 <_Event_Seize+0x3c> 2005d68: 80 8e 60 02 btst 2, %i1 2005d6c: 02 80 00 09 be 2005d90 <_Event_Seize+0x58> <== NEVER TAKEN 2005d70: 80 8e 60 01 btst 1, %i1 (seized_events == event_in || _Options_Is_any( option_set )) ) { api->pending_events = 2005d74: 82 28 40 11 andn %g1, %l1, %g1 2005d78: c2 24 80 00 st %g1, [ %l2 ] _Event_sets_Clear( pending_events, seized_events ); _ISR_Enable( level ); 2005d7c: 7f ff f0 96 call 2001fd4 2005d80: 01 00 00 00 nop 2005d84: e2 26 c0 00 st %l1, [ %i3 ] 2005d88: 81 c7 e0 08 ret 2005d8c: 81 e8 00 00 restore *event_out = seized_events; return; } if ( _Options_Is_no_wait( option_set ) ) { 2005d90: 22 80 00 09 be,a 2005db4 <_Event_Seize+0x7c> 2005d94: f2 24 20 30 st %i1, [ %l0 + 0x30 ] _ISR_Enable( level ); 2005d98: 7f ff f0 8f call 2001fd4 2005d9c: 01 00 00 00 nop executing->Wait.return_code = RTEMS_UNSATISFIED; 2005da0: 82 10 20 0d mov 0xd, %g1 ! d 2005da4: c2 24 20 34 st %g1, [ %l0 + 0x34 ] *event_out = seized_events; 2005da8: e2 26 c0 00 st %l1, [ %i3 ] 2005dac: 81 c7 e0 08 ret 2005db0: 81 e8 00 00 restore * * NOTE: Since interrupts are disabled, this isn't that much of an * issue but better safe than sorry. */ executing->Wait.option = (uint32_t) option_set; executing->Wait.count = (uint32_t) event_in; 2005db4: f0 24 20 24 st %i0, [ %l0 + 0x24 ] executing->Wait.return_argument = event_out; 2005db8: f6 24 20 28 st %i3, [ %l0 + 0x28 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2005dbc: 84 10 20 01 mov 1, %g2 2005dc0: 03 00 80 73 sethi %hi(0x201cc00), %g1 2005dc4: c4 20 62 dc st %g2, [ %g1 + 0x2dc ] ! 201cedc <_Event_Sync_state> _ISR_Enable( level ); 2005dc8: 7f ff f0 83 call 2001fd4 2005dcc: 01 00 00 00 nop if ( ticks ) { 2005dd0: 80 a6 a0 00 cmp %i2, 0 2005dd4: 02 80 00 0f be 2005e10 <_Event_Seize+0xd8> 2005dd8: 90 10 00 10 mov %l0, %o0 _Watchdog_Initialize( 2005ddc: c2 04 20 08 ld [ %l0 + 8 ], %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005de0: 11 00 80 73 sethi %hi(0x201cc00), %o0 void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; the_watchdog->id = id; 2005de4: c2 24 20 68 st %g1, [ %l0 + 0x68 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005de8: 03 00 80 17 sethi %hi(0x2005c00), %g1 2005dec: 82 10 63 e0 or %g1, 0x3e0, %g1 ! 2005fe0 <_Event_Timeout> Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2005df0: f4 24 20 54 st %i2, [ %l0 + 0x54 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005df4: c0 24 20 50 clr [ %l0 + 0x50 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 2005df8: c0 24 20 6c clr [ %l0 + 0x6c ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005dfc: c2 24 20 64 st %g1, [ %l0 + 0x64 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005e00: 90 12 21 00 or %o0, 0x100, %o0 2005e04: 40 00 0e 2c call 20096b4 <_Watchdog_Insert> 2005e08: 92 04 20 48 add %l0, 0x48, %o1 NULL ); _Watchdog_Insert_ticks( &executing->Timer, ticks ); } _Thread_Set_state( executing, STATES_WAITING_FOR_EVENT ); 2005e0c: 90 10 00 10 mov %l0, %o0 2005e10: 40 00 0c 31 call 2008ed4 <_Thread_Set_state> 2005e14: 92 10 21 00 mov 0x100, %o1 _ISR_Disable( level ); 2005e18: 7f ff f0 6b call 2001fc4 2005e1c: 01 00 00 00 nop sync_state = _Event_Sync_state; 2005e20: 03 00 80 73 sethi %hi(0x201cc00), %g1 2005e24: f0 00 62 dc ld [ %g1 + 0x2dc ], %i0 ! 201cedc <_Event_Sync_state> _Event_Sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; 2005e28: c0 20 62 dc clr [ %g1 + 0x2dc ] if ( sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) { 2005e2c: 80 a6 20 01 cmp %i0, 1 2005e30: 12 80 00 04 bne 2005e40 <_Event_Seize+0x108> 2005e34: b2 10 00 10 mov %l0, %i1 _ISR_Enable( level ); 2005e38: 7f ff f0 67 call 2001fd4 2005e3c: 91 e8 00 08 restore %g0, %o0, %o0 * An interrupt completed the thread's blocking request. * The blocking thread was satisfied by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ _Thread_blocking_operation_Cancel( sync_state, executing, level ); 2005e40: 40 00 08 2f call 2007efc <_Thread_blocking_operation_Cancel> 2005e44: 95 e8 00 08 restore %g0, %o0, %o2 =============================================================================== 02005ea4 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2005ea4: 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 ]; 2005ea8: e2 06 21 60 ld [ %i0 + 0x160 ], %l1 option_set = (rtems_option) the_thread->Wait.option; 2005eac: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 _ISR_Disable( level ); 2005eb0: 7f ff f0 45 call 2001fc4 2005eb4: a0 10 00 18 mov %i0, %l0 2005eb8: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 2005ebc: c4 04 40 00 ld [ %l1 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2005ec0: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2005ec4: 82 88 c0 02 andcc %g3, %g2, %g1 2005ec8: 02 80 00 43 be 2005fd4 <_Event_Surrender+0x130> 2005ecc: 09 00 80 73 sethi %hi(0x201cc00), %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() && 2005ed0: c8 01 20 bc ld [ %g4 + 0xbc ], %g4 ! 201ccbc <_ISR_Nest_level> 2005ed4: 80 a1 20 00 cmp %g4, 0 2005ed8: 22 80 00 1e be,a 2005f50 <_Event_Surrender+0xac> 2005edc: c8 04 20 10 ld [ %l0 + 0x10 ], %g4 2005ee0: 09 00 80 73 sethi %hi(0x201cc00), %g4 2005ee4: c8 01 20 e0 ld [ %g4 + 0xe0 ], %g4 ! 201cce0 <_Thread_Executing> 2005ee8: 80 a4 00 04 cmp %l0, %g4 2005eec: 32 80 00 19 bne,a 2005f50 <_Event_Surrender+0xac> 2005ef0: c8 04 20 10 ld [ %l0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2005ef4: 09 00 80 73 sethi %hi(0x201cc00), %g4 2005ef8: da 01 22 dc ld [ %g4 + 0x2dc ], %o5 ! 201cedc <_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() && 2005efc: 80 a3 60 02 cmp %o5, 2 2005f00: 02 80 00 07 be 2005f1c <_Event_Surrender+0x78> <== NEVER TAKEN 2005f04: 80 a0 40 03 cmp %g1, %g3 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2005f08: c8 01 22 dc ld [ %g4 + 0x2dc ], %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() && 2005f0c: 80 a1 20 01 cmp %g4, 1 2005f10: 32 80 00 10 bne,a 2005f50 <_Event_Surrender+0xac> 2005f14: c8 04 20 10 ld [ %l0 + 0x10 ], %g4 _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) ) { 2005f18: 80 a0 40 03 cmp %g1, %g3 2005f1c: 02 80 00 04 be 2005f2c <_Event_Surrender+0x88> 2005f20: 80 8c a0 02 btst 2, %l2 2005f24: 02 80 00 2c be 2005fd4 <_Event_Surrender+0x130> <== NEVER TAKEN 2005f28: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2005f2c: 84 28 80 01 andn %g2, %g1, %g2 2005f30: c4 24 40 00 st %g2, [ %l1 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005f34: c4 04 20 28 ld [ %l0 + 0x28 ], %g2 _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 ); the_thread->Wait.count = 0; 2005f38: c0 24 20 24 clr [ %l0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005f3c: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2005f40: 84 10 20 03 mov 3, %g2 2005f44: 03 00 80 73 sethi %hi(0x201cc00), %g1 2005f48: c4 20 62 dc st %g2, [ %g1 + 0x2dc ] ! 201cedc <_Event_Sync_state> 2005f4c: 30 80 00 22 b,a 2005fd4 <_Event_Surrender+0x130> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2005f50: 80 89 21 00 btst 0x100, %g4 2005f54: 02 80 00 20 be 2005fd4 <_Event_Surrender+0x130> 2005f58: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2005f5c: 02 80 00 04 be 2005f6c <_Event_Surrender+0xc8> 2005f60: 80 8c a0 02 btst 2, %l2 2005f64: 02 80 00 1c be 2005fd4 <_Event_Surrender+0x130> <== NEVER TAKEN 2005f68: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2005f6c: 84 28 80 01 andn %g2, %g1, %g2 2005f70: c4 24 40 00 st %g2, [ %l1 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005f74: c4 04 20 28 ld [ %l0 + 0x28 ], %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 ); the_thread->Wait.count = 0; 2005f78: c0 24 20 24 clr [ %l0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2005f7c: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 2005f80: 7f ff f0 15 call 2001fd4 2005f84: 90 10 00 18 mov %i0, %o0 2005f88: 7f ff f0 0f call 2001fc4 2005f8c: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2005f90: c2 04 20 50 ld [ %l0 + 0x50 ], %g1 2005f94: 80 a0 60 02 cmp %g1, 2 2005f98: 02 80 00 06 be 2005fb0 <_Event_Surrender+0x10c> 2005f9c: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2005fa0: 7f ff f0 0d call 2001fd4 2005fa4: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2005fa8: 10 80 00 08 b 2005fc8 <_Event_Surrender+0x124> 2005fac: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2005fb0: c2 24 20 50 st %g1, [ %l0 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2005fb4: 7f ff f0 08 call 2001fd4 2005fb8: 90 10 00 18 mov %i0, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 2005fbc: 40 00 0e 1a call 2009824 <_Watchdog_Remove> 2005fc0: 90 04 20 48 add %l0, 0x48, %o0 2005fc4: 33 04 00 ff sethi %hi(0x1003fc00), %i1 2005fc8: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2005fcc: 40 00 08 5a call 2008134 <_Thread_Clear_state> 2005fd0: 91 e8 00 10 restore %g0, %l0, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2005fd4: 7f ff f0 00 call 2001fd4 2005fd8: 81 e8 00 00 restore =============================================================================== 02005fe0 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2005fe0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2005fe4: 90 10 00 18 mov %i0, %o0 2005fe8: 40 00 09 72 call 20085b0 <_Thread_Get> 2005fec: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2005ff0: c2 07 bf fc ld [ %fp + -4 ], %g1 2005ff4: 80 a0 60 00 cmp %g1, 0 2005ff8: 12 80 00 1c bne 2006068 <_Event_Timeout+0x88> <== NEVER TAKEN 2005ffc: 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 ); 2006000: 7f ff ef f1 call 2001fc4 2006004: 01 00 00 00 nop return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006008: 03 00 80 73 sethi %hi(0x201cc00), %g1 200600c: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 201cce0 <_Thread_Executing> 2006010: 80 a4 00 01 cmp %l0, %g1 2006014: 12 80 00 09 bne 2006038 <_Event_Timeout+0x58> 2006018: c0 24 20 24 clr [ %l0 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 200601c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2006020: c4 00 62 dc ld [ %g1 + 0x2dc ], %g2 ! 201cedc <_Event_Sync_state> 2006024: 80 a0 a0 01 cmp %g2, 1 2006028: 32 80 00 05 bne,a 200603c <_Event_Timeout+0x5c> 200602c: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006030: 84 10 20 02 mov 2, %g2 2006034: c4 20 62 dc st %g2, [ %g1 + 0x2dc ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006038: 82 10 20 06 mov 6, %g1 200603c: c2 24 20 34 st %g1, [ %l0 + 0x34 ] _ISR_Enable( level ); 2006040: 7f ff ef e5 call 2001fd4 2006044: 01 00 00 00 nop 2006048: 90 10 00 10 mov %l0, %o0 200604c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2006050: 40 00 08 39 call 2008134 <_Thread_Clear_state> 2006054: 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; 2006058: 03 00 80 73 sethi %hi(0x201cc00), %g1 200605c: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201cc20 <_Thread_Dispatch_disable_level> 2006060: 84 00 bf ff add %g2, -1, %g2 2006064: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 2006068: 81 c7 e0 08 ret 200606c: 81 e8 00 00 restore =============================================================================== 020012f0 <_Extension_Manager_initialization>: #include #include void _Extension_Manager_initialization(void) { } 20012f0: 81 c3 e0 08 retl =============================================================================== 0200cc84 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200cc84: 9d e3 bf 90 save %sp, -112, %sp Heap_Statistics *const stats = &heap->stats; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *block = _Heap_Free_list_first( heap ); uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE - HEAP_BLOCK_SIZE_OFFSET; 200cc88: ac 06 60 04 add %i1, 4, %l6 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200cc8c: e4 06 20 08 ld [ %i0 + 8 ], %l2 uintptr_t const page_size = heap->page_size; uintptr_t alloc_begin = 0; uint32_t search_count = 0; if ( block_size_floor < alloc_size ) { 200cc90: 80 a5 80 19 cmp %l6, %i1 200cc94: 0a 80 00 6d bcs 200ce48 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200cc98: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200cc9c: 80 a6 e0 00 cmp %i3, 0 200cca0: 02 80 00 08 be 200ccc0 <_Heap_Allocate_aligned_with_boundary+0x3c> 200cca4: 82 10 20 04 mov 4, %g1 if ( boundary < alloc_size ) { 200cca8: 80 a6 c0 19 cmp %i3, %i1 200ccac: 0a 80 00 67 bcs 200ce48 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200ccb0: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200ccb4: 22 80 00 03 be,a 200ccc0 <_Heap_Allocate_aligned_with_boundary+0x3c> 200ccb8: b4 10 00 14 mov %l4, %i2 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_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccbc: 82 10 20 04 mov 4, %g1 200ccc0: 82 20 40 19 sub %g1, %i1, %g1 if ( boundary != 0 ) { if ( boundary < alloc_size ) { return NULL; } if ( alignment == 0 ) { 200ccc4: a2 10 20 00 clr %l1 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_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccc8: c2 27 bf f4 st %g1, [ %fp + -12 ] /* Ensure that the we have a valid new block at the beginning */ 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; 200cccc: b8 10 3f f8 mov -8, %i4 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; 200ccd0: 82 05 20 07 add %l4, 7, %g1 200ccd4: 10 80 00 4b b 200ce00 <_Heap_Allocate_aligned_with_boundary+0x17c> 200ccd8: c2 27 bf f8 st %g1, [ %fp + -8 ] /* * 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 ) { 200ccdc: 80 a4 c0 16 cmp %l3, %l6 200cce0: 08 80 00 47 bleu 200cdfc <_Heap_Allocate_aligned_with_boundary+0x178> 200cce4: a2 04 60 01 inc %l1 if ( alignment == 0 ) { 200cce8: 80 a6 a0 00 cmp %i2, 0 200ccec: 12 80 00 04 bne 200ccfc <_Heap_Allocate_aligned_with_boundary+0x78> 200ccf0: aa 04 a0 08 add %l2, 8, %l5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Alloc_area_of_block( const Heap_Block *block ) { return (uintptr_t) block + HEAP_BLOCK_HEADER_SIZE; 200ccf4: 10 80 00 3f b 200cdf0 <_Heap_Allocate_aligned_with_boundary+0x16c> 200ccf8: a0 10 00 15 mov %l5, %l0 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_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccfc: c4 07 bf f4 ld [ %fp + -12 ], %g2 uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200cd00: ee 06 20 14 ld [ %i0 + 0x14 ], %l7 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200cd04: a6 0c ff fe and %l3, -2, %l3 200cd08: a6 04 80 13 add %l2, %l3, %l3 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_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200cd0c: a0 00 80 13 add %g2, %l3, %l0 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; 200cd10: c4 07 bf f8 ld [ %fp + -8 ], %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200cd14: 90 10 00 10 mov %l0, %o0 200cd18: 82 20 80 17 sub %g2, %l7, %g1 200cd1c: 92 10 00 1a mov %i2, %o1 200cd20: 40 00 2f fe call 2018d18 <.urem> 200cd24: a6 00 40 13 add %g1, %l3, %l3 200cd28: a0 24 00 08 sub %l0, %o0, %l0 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 ) { 200cd2c: 80 a4 00 13 cmp %l0, %l3 200cd30: 08 80 00 07 bleu 200cd4c <_Heap_Allocate_aligned_with_boundary+0xc8> 200cd34: 80 a6 e0 00 cmp %i3, 0 200cd38: 90 10 00 13 mov %l3, %o0 200cd3c: 40 00 2f f7 call 2018d18 <.urem> 200cd40: 92 10 00 1a mov %i2, %o1 200cd44: a0 24 c0 08 sub %l3, %o0, %l0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200cd48: 80 a6 e0 00 cmp %i3, 0 200cd4c: 02 80 00 1d be 200cdc0 <_Heap_Allocate_aligned_with_boundary+0x13c> 200cd50: 80 a4 00 15 cmp %l0, %l5 /* 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; 200cd54: a6 04 00 19 add %l0, %i1, %l3 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200cd58: 82 05 40 19 add %l5, %i1, %g1 200cd5c: 92 10 00 1b mov %i3, %o1 200cd60: 90 10 00 13 mov %l3, %o0 200cd64: 10 80 00 0b b 200cd90 <_Heap_Allocate_aligned_with_boundary+0x10c> 200cd68: c2 27 bf fc st %g1, [ %fp + -4 ] uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200cd6c: 80 a0 40 02 cmp %g1, %g2 200cd70: 2a 80 00 24 bcs,a 200ce00 <_Heap_Allocate_aligned_with_boundary+0x17c> 200cd74: e4 04 a0 08 ld [ %l2 + 8 ], %l2 200cd78: 40 00 2f e8 call 2018d18 <.urem> 200cd7c: 01 00 00 00 nop 200cd80: 92 10 00 1b mov %i3, %o1 200cd84: a0 27 40 08 sub %i5, %o0, %l0 return 0; } alloc_begin = boundary_line - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200cd88: a6 04 00 19 add %l0, %i1, %l3 200cd8c: 90 10 00 13 mov %l3, %o0 200cd90: 40 00 2f e2 call 2018d18 <.urem> 200cd94: 01 00 00 00 nop 200cd98: 92 10 00 1a mov %i2, %o1 200cd9c: 82 24 c0 08 sub %l3, %o0, %g1 while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { return 0; } alloc_begin = boundary_line - alloc_size; 200cda0: ba 20 40 19 sub %g1, %i1, %i5 /* 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 ) { 200cda4: 80 a0 40 13 cmp %g1, %l3 200cda8: 1a 80 00 05 bcc 200cdbc <_Heap_Allocate_aligned_with_boundary+0x138> 200cdac: 90 10 00 1d mov %i5, %o0 200cdb0: 80 a4 00 01 cmp %l0, %g1 200cdb4: 0a bf ff ee bcs 200cd6c <_Heap_Allocate_aligned_with_boundary+0xe8> 200cdb8: c4 07 bf fc ld [ %fp + -4 ], %g2 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 ) { 200cdbc: 80 a4 00 15 cmp %l0, %l5 200cdc0: 0a 80 00 0f bcs 200cdfc <_Heap_Allocate_aligned_with_boundary+0x178> 200cdc4: a6 27 00 12 sub %i4, %l2, %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; 200cdc8: 90 10 00 10 mov %l0, %o0 200cdcc: a6 04 c0 10 add %l3, %l0, %l3 200cdd0: 40 00 2f d2 call 2018d18 <.urem> 200cdd4: 92 10 00 14 mov %l4, %o1 if ( free_size >= min_block_size || free_size == 0 ) { 200cdd8: 90 a4 c0 08 subcc %l3, %o0, %o0 200cddc: 02 80 00 06 be 200cdf4 <_Heap_Allocate_aligned_with_boundary+0x170> 200cde0: 80 a4 20 00 cmp %l0, 0 200cde4: 80 a2 00 17 cmp %o0, %l7 200cde8: 2a 80 00 06 bcs,a 200ce00 <_Heap_Allocate_aligned_with_boundary+0x17c> 200cdec: e4 04 a0 08 ld [ %l2 + 8 ], %l2 boundary ); } } if ( alloc_begin != 0 ) { 200cdf0: 80 a4 20 00 cmp %l0, 0 200cdf4: 32 80 00 08 bne,a 200ce14 <_Heap_Allocate_aligned_with_boundary+0x190><== ALWAYS TAKEN 200cdf8: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 break; } block = block->next; 200cdfc: e4 04 a0 08 ld [ %l2 + 8 ], %l2 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200ce00: 80 a4 80 18 cmp %l2, %i0 200ce04: 32 bf ff b6 bne,a 200ccdc <_Heap_Allocate_aligned_with_boundary+0x58> 200ce08: e6 04 a0 04 ld [ %l2 + 4 ], %l3 200ce0c: 10 80 00 09 b 200ce30 <_Heap_Allocate_aligned_with_boundary+0x1ac> 200ce10: a0 10 20 00 clr %l0 if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce14: 92 10 00 12 mov %l2, %o1 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200ce18: 82 00 40 11 add %g1, %l1, %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce1c: 96 10 00 19 mov %i1, %o3 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200ce20: c2 26 20 4c st %g1, [ %i0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce24: 90 10 00 18 mov %i0, %o0 200ce28: 7f ff e9 a1 call 20074ac <_Heap_Block_allocate> 200ce2c: 94 10 00 10 mov %l0, %o2 uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { Heap_Statistics *const stats = &heap->stats; 200ce30: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200ce34: 80 a0 40 11 cmp %g1, %l1 200ce38: 2a 80 00 02 bcs,a 200ce40 <_Heap_Allocate_aligned_with_boundary+0x1bc> 200ce3c: e2 26 20 44 st %l1, [ %i0 + 0x44 ] /* Statistics */ if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; 200ce40: 81 c7 e0 08 ret 200ce44: 91 e8 00 10 restore %g0, %l0, %o0 } 200ce48: 81 c7 e0 08 ret 200ce4c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020114ec <_Heap_Extend>: Heap_Control *heap, void *area_begin_ptr, uintptr_t area_size, uintptr_t *amount_extended ) { 20114ec: 9d e3 bf a0 save %sp, -96, %sp Heap_Statistics *const stats = &heap->stats; uintptr_t const area_begin = (uintptr_t) area_begin_ptr; uintptr_t const heap_area_begin = heap->area_begin; uintptr_t const heap_area_end = heap->area_end; 20114f0: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 Heap_Control *heap, void *area_begin_ptr, uintptr_t area_size, uintptr_t *amount_extended ) { 20114f4: a0 10 00 18 mov %i0, %l0 * 5. non-contiguous higher address (NOT SUPPORTED) * * As noted, this code only supports (4). */ if ( area_begin >= heap_area_begin && area_begin < heap_area_end ) { 20114f8: 80 a6 40 01 cmp %i1, %g1 20114fc: 1a 80 00 07 bcc 2011518 <_Heap_Extend+0x2c> 2011500: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 uintptr_t *amount_extended ) { Heap_Statistics *const stats = &heap->stats; uintptr_t const area_begin = (uintptr_t) area_begin_ptr; uintptr_t const heap_area_begin = heap->area_begin; 2011504: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 2011508: 80 a6 40 02 cmp %i1, %g2 201150c: 1a 80 00 28 bcc 20115ac <_Heap_Extend+0xc0> 2011510: b0 10 20 01 mov 1, %i0 * As noted, this code only supports (4). */ if ( area_begin >= heap_area_begin && area_begin < heap_area_end ) { return HEAP_EXTEND_ERROR; /* case 3 */ } else if ( area_begin != heap_area_end ) { 2011514: 80 a6 40 01 cmp %i1, %g1 2011518: 12 80 00 25 bne 20115ac <_Heap_Extend+0xc0> 201151c: b0 10 20 02 mov 2, %i0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 2011520: d2 04 20 10 ld [ %l0 + 0x10 ], %o1 { Heap_Statistics *const stats = &heap->stats; uintptr_t const area_begin = (uintptr_t) area_begin_ptr; uintptr_t const heap_area_begin = heap->area_begin; uintptr_t const heap_area_end = heap->area_end; uintptr_t const new_heap_area_end = heap_area_end + area_size; 2011524: b4 06 40 1a add %i1, %i2, %i2 * block and free it. */ heap->area_end = new_heap_area_end; extend_size = new_heap_area_end 2011528: b2 26 80 11 sub %i2, %l1, %i1 * Currently only case 4 should make it to this point. * The basic trick is to make the extend area look like a used * block and free it. */ heap->area_end = new_heap_area_end; 201152c: f4 24 20 1c st %i2, [ %l0 + 0x1c ] extend_size = new_heap_area_end 2011530: b2 06 7f f8 add %i1, -8, %i1 2011534: 7f ff cb 1b call 20041a0 <.urem> 2011538: 90 10 00 19 mov %i1, %o0 201153c: 90 26 40 08 sub %i1, %o0, %o0 - (uintptr_t) last_block - HEAP_BLOCK_HEADER_SIZE; extend_size = _Heap_Align_down( extend_size, heap->page_size ); *amount_extended = extend_size; 2011540: d0 26 c0 00 st %o0, [ %i3 ] if( extend_size >= heap->min_block_size ) { 2011544: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 2011548: 80 a2 00 01 cmp %o0, %g1 201154c: 0a 80 00 18 bcs 20115ac <_Heap_Extend+0xc0> <== NEVER TAKEN 2011550: b0 10 20 00 clr %i0 uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; block->size_and_flag = size | flag; 2011554: c2 04 60 04 ld [ %l1 + 4 ], %g1 Heap_Block *const new_last_block = _Heap_Block_at( last_block, extend_size ); _Heap_Block_set_size( last_block, extend_size ); new_last_block->size_and_flag = 2011558: c4 04 20 20 ld [ %l0 + 0x20 ], %g2 201155c: 82 08 60 01 and %g1, 1, %g1 2011560: 82 12 00 01 or %o0, %g1, %g1 2011564: c2 24 60 04 st %g1, [ %l1 + 4 ] RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2011568: 82 02 00 11 add %o0, %l1, %g1 201156c: 84 20 80 01 sub %g2, %g1, %g2 2011570: 84 10 a0 01 or %g2, 1, %g2 2011574: c4 20 60 04 st %g2, [ %g1 + 4 ] heap->last_block = new_last_block; /* Statistics */ stats->size += extend_size; ++stats->used_blocks; 2011578: c6 04 20 40 ld [ %l0 + 0x40 ], %g3 | HEAP_PREV_BLOCK_USED; heap->last_block = new_last_block; /* Statistics */ stats->size += extend_size; 201157c: f2 04 20 2c ld [ %l0 + 0x2c ], %i1 ++stats->used_blocks; --stats->frees; /* Do not count subsequent call as actual free() */ 2011580: c4 04 20 50 ld [ %l0 + 0x50 ], %g2 new_last_block->size_and_flag = ((uintptr_t) heap->first_block - (uintptr_t) new_last_block) | HEAP_PREV_BLOCK_USED; heap->last_block = new_last_block; 2011584: c2 24 20 24 st %g1, [ %l0 + 0x24 ] /* Statistics */ stats->size += extend_size; ++stats->used_blocks; 2011588: 82 00 e0 01 add %g3, 1, %g1 | HEAP_PREV_BLOCK_USED; heap->last_block = new_last_block; /* Statistics */ stats->size += extend_size; 201158c: 90 06 40 08 add %i1, %o0, %o0 ++stats->used_blocks; 2011590: c2 24 20 40 st %g1, [ %l0 + 0x40 ] --stats->frees; /* Do not count subsequent call as actual free() */ 2011594: 82 00 bf ff add %g2, -1, %g1 | HEAP_PREV_BLOCK_USED; heap->last_block = new_last_block; /* Statistics */ stats->size += extend_size; 2011598: d0 24 20 2c st %o0, [ %l0 + 0x2c ] ++stats->used_blocks; --stats->frees; /* Do not count subsequent call as actual free() */ 201159c: c2 24 20 50 st %g1, [ %l0 + 0x50 ] _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( last_block )); 20115a0: 90 10 00 10 mov %l0, %o0 20115a4: 7f ff e6 8c call 200afd4 <_Heap_Free> 20115a8: 92 04 60 08 add %l1, 8, %o1 } return HEAP_EXTEND_SUCCESSFUL; } 20115ac: 81 c7 e0 08 ret 20115b0: 81 e8 00 00 restore =============================================================================== 0200ce50 <_Heap_Free>: #include #include #include bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200ce50: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 200ce54: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200ce58: 40 00 2f b0 call 2018d18 <.urem> 200ce5c: 90 10 00 19 mov %i1, %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; 200ce60: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 200ce64: b2 06 7f f8 add %i1, -8, %i1 200ce68: 90 26 40 08 sub %i1, %o0, %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 200ce6c: 80 a2 00 01 cmp %o0, %g1 200ce70: 0a 80 00 05 bcs 200ce84 <_Heap_Free+0x34> 200ce74: 84 10 20 00 clr %g2 200ce78: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200ce7c: 80 a0 80 08 cmp %g2, %o0 200ce80: 84 60 3f ff subx %g0, -1, %g2 Heap_Block *next_block = NULL; uintptr_t block_size = 0; uintptr_t next_block_size = 0; bool next_is_free = false; if ( !_Heap_Is_block_in_heap( heap, block ) ) { 200ce84: 80 a0 a0 00 cmp %g2, 0 200ce88: 02 80 00 6a be 200d030 <_Heap_Free+0x1e0> 200ce8c: 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; 200ce90: c8 02 20 04 ld [ %o0 + 4 ], %g4 200ce94: 86 09 3f fe and %g4, -2, %g3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200ce98: 84 02 00 03 add %o0, %g3, %g2 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 200ce9c: 80 a0 80 01 cmp %g2, %g1 200cea0: 0a 80 00 05 bcs 200ceb4 <_Heap_Free+0x64> <== NEVER TAKEN 200cea4: 9a 10 20 00 clr %o5 200cea8: da 06 20 24 ld [ %i0 + 0x24 ], %o5 200ceac: 80 a3 40 02 cmp %o5, %g2 200ceb0: 9a 60 3f ff subx %g0, -1, %o5 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 200ceb4: 80 a3 60 00 cmp %o5, 0 200ceb8: 02 80 00 5e be 200d030 <_Heap_Free+0x1e0> <== NEVER TAKEN 200cebc: 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; 200cec0: da 00 a0 04 ld [ %g2 + 4 ], %o5 _HAssert( false ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200cec4: 80 8b 60 01 btst 1, %o5 200cec8: 02 80 00 5a be 200d030 <_Heap_Free+0x1e0> <== NEVER TAKEN 200cecc: 9a 0b 7f fe and %o5, -2, %o5 return false; } 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 )); 200ced0: d2 06 20 24 ld [ %i0 + 0x24 ], %o1 _HAssert( false ); return false; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 200ced4: 80 a0 80 09 cmp %g2, %o1 200ced8: 02 80 00 06 be 200cef0 <_Heap_Free+0xa0> 200cedc: 96 10 20 00 clr %o3 200cee0: 98 00 80 0d add %g2, %o5, %o4 200cee4: d6 03 20 04 ld [ %o4 + 4 ], %o3 200cee8: 96 0a e0 01 and %o3, 1, %o3 200ceec: 96 1a e0 01 xor %o3, 1, %o3 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200cef0: 80 89 20 01 btst 1, %g4 200cef4: 12 80 00 26 bne 200cf8c <_Heap_Free+0x13c> 200cef8: 80 a2 e0 00 cmp %o3, 0 uintptr_t const prev_size = block->prev_size; 200cefc: d8 02 00 00 ld [ %o0 ], %o4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200cf00: 88 22 00 0c sub %o0, %o4, %g4 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 200cf04: 80 a1 00 01 cmp %g4, %g1 200cf08: 0a 80 00 04 bcs 200cf18 <_Heap_Free+0xc8> <== NEVER TAKEN 200cf0c: 94 10 20 00 clr %o2 200cf10: 80 a2 40 04 cmp %o1, %g4 200cf14: 94 60 3f ff subx %g0, -1, %o2 Heap_Block * const prev_block = _Heap_Block_at( block, -prev_size ); if ( !_Heap_Is_block_in_heap( heap, prev_block ) ) { 200cf18: 80 a2 a0 00 cmp %o2, 0 200cf1c: 02 80 00 45 be 200d030 <_Heap_Free+0x1e0> <== NEVER TAKEN 200cf20: 01 00 00 00 nop 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) ) { 200cf24: c2 01 20 04 ld [ %g4 + 4 ], %g1 200cf28: 80 88 60 01 btst 1, %g1 200cf2c: 02 80 00 41 be 200d030 <_Heap_Free+0x1e0> <== NEVER TAKEN 200cf30: 80 a2 e0 00 cmp %o3, 0 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200cf34: 22 80 00 0f be,a 200cf70 <_Heap_Free+0x120> 200cf38: 98 00 c0 0c add %g3, %o4, %o4 uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200cf3c: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; 200cf40: d6 00 a0 0c ld [ %g2 + 0xc ], %o3 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200cf44: c4 00 a0 08 ld [ %g2 + 8 ], %g2 200cf48: 82 00 7f ff add %g1, -1, %g1 200cf4c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200cf50: 9a 00 c0 0d add %g3, %o5, %o5 Heap_Block *prev = block->prev; prev->next = next; next->prev = prev; 200cf54: d6 20 a0 0c st %o3, [ %g2 + 0xc ] 200cf58: 98 03 40 0c add %o5, %o4, %o4 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 200cf5c: c4 22 e0 08 st %g2, [ %o3 + 8 ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200cf60: d8 21 00 0c st %o4, [ %g4 + %o4 ] 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; 200cf64: 98 13 20 01 or %o4, 1, %o4 200cf68: 10 80 00 27 b 200d004 <_Heap_Free+0x1b4> 200cf6c: d8 21 20 04 st %o4, [ %g4 + 4 ] 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; 200cf70: 82 13 20 01 or %o4, 1, %g1 200cf74: c2 21 20 04 st %g1, [ %g4 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cf78: c2 00 a0 04 ld [ %g2 + 4 ], %g1 next_block->prev_size = size; 200cf7c: d8 22 00 03 st %o4, [ %o0 + %g3 ] _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; 200cf80: 82 08 7f fe and %g1, -2, %g1 200cf84: 10 80 00 20 b 200d004 <_Heap_Free+0x1b4> 200cf88: c2 20 a0 04 st %g1, [ %g2 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200cf8c: 02 80 00 0d be 200cfc0 <_Heap_Free+0x170> 200cf90: 82 10 e0 01 or %g3, 1, %g1 Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; 200cf94: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200cf98: c4 00 a0 08 ld [ %g2 + 8 ], %g2 Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; 200cf9c: c2 22 20 0c st %g1, [ %o0 + 0xc ] ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200cfa0: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; next->prev = new_block; prev->next = new_block; 200cfa4: d0 20 60 08 st %o0, [ %g1 + 8 ] Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; next->prev = new_block; 200cfa8: d0 20 a0 0c st %o0, [ %g2 + 0xc ] uintptr_t const size = block_size + next_block_size; 200cfac: 82 03 40 03 add %o5, %g3, %g1 _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200cfb0: c2 22 00 01 st %g1, [ %o0 + %g1 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cfb4: 82 10 60 01 or %g1, 1, %g1 200cfb8: 10 80 00 13 b 200d004 <_Heap_Free+0x1b4> 200cfbc: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200cfc0: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cfc4: c2 00 a0 04 ld [ %g2 + 4 ], %g1 RTEMS_INLINE_ROUTINE void _Heap_Free_list_insert_after( Heap_Block *block_before, Heap_Block *new_block ) { Heap_Block *next = block_before->next; 200cfc8: c8 06 20 08 ld [ %i0 + 8 ], %g4 200cfcc: 82 08 7f fe and %g1, -2, %g1 next_block->prev_size = block_size; 200cfd0: c6 22 00 03 st %g3, [ %o0 + %g3 ] } 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; 200cfd4: c2 20 a0 04 st %g1, [ %g2 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cfd8: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 new_block->next = next; 200cfdc: c8 22 20 08 st %g4, [ %o0 + 8 ] new_block->prev = block_before; 200cfe0: f0 22 20 0c st %i0, [ %o0 + 0xc ] #include #include bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { Heap_Statistics *const stats = &heap->stats; 200cfe4: c4 06 20 3c ld [ %i0 + 0x3c ], %g2 block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cfe8: 82 00 60 01 inc %g1 block_before->next = new_block; next->prev = new_block; 200cfec: d0 21 20 0c st %o0, [ %g4 + 0xc ] { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; block_before->next = new_block; 200cff0: d0 26 20 08 st %o0, [ %i0 + 8 ] #include #include bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { Heap_Statistics *const stats = &heap->stats; 200cff4: 80 a0 80 01 cmp %g2, %g1 200cff8: 1a 80 00 03 bcc 200d004 <_Heap_Free+0x1b4> 200cffc: c2 26 20 38 st %g1, [ %i0 + 0x38 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { stats->max_free_blocks = stats->free_blocks; 200d000: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200d004: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200d008: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200d00c: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d010: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 200d014: 86 01 00 03 add %g4, %g3, %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d018: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 200d01c: c6 26 20 30 st %g3, [ %i0 + 0x30 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200d020: 82 00 60 01 inc %g1 200d024: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; return( true ); 200d028: 81 c7 e0 08 ret 200d02c: 91 e8 20 01 restore %g0, 1, %o0 } 200d030: 81 c7 e0 08 ret 200d034: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0201a690 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 201a690: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 201a694: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 201a698: 7f ff f9 a0 call 2018d18 <.urem> 201a69c: 90 10 00 19 mov %i1, %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; 201a6a0: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 201a6a4: 84 06 7f f8 add %i1, -8, %g2 201a6a8: 90 20 80 08 sub %g2, %o0, %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 201a6ac: 80 a2 00 01 cmp %o0, %g1 201a6b0: 0a 80 00 05 bcs 201a6c4 <_Heap_Size_of_alloc_area+0x34> 201a6b4: 84 10 20 00 clr %g2 201a6b8: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 201a6bc: 80 a0 80 08 cmp %g2, %o0 201a6c0: 84 60 3f ff subx %g0, -1, %g2 uintptr_t const alloc_begin = (uintptr_t) alloc_begin_ptr; Heap_Block *block = _Heap_Block_of_alloc_area( alloc_begin, page_size ); Heap_Block *next_block = NULL; uintptr_t block_size = 0; if ( !_Heap_Is_block_in_heap( heap, block ) ) { 201a6c4: 80 a0 a0 00 cmp %g2, 0 201a6c8: 02 80 00 16 be 201a720 <_Heap_Size_of_alloc_area+0x90> 201a6cc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 201a6d0: c4 02 20 04 ld [ %o0 + 4 ], %g2 201a6d4: 84 08 bf fe and %g2, -2, %g2 201a6d8: 84 02 00 02 add %o0, %g2, %g2 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 201a6dc: 80 a0 80 01 cmp %g2, %g1 201a6e0: 0a 80 00 05 bcs 201a6f4 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 201a6e4: 86 10 20 00 clr %g3 201a6e8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 201a6ec: 80 a0 40 02 cmp %g1, %g2 201a6f0: 86 60 3f ff subx %g0, -1, %g3 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 201a6f4: 80 a0 e0 00 cmp %g3, 0 201a6f8: 02 80 00 0a be 201a720 <_Heap_Size_of_alloc_area+0x90> <== NEVER TAKEN 201a6fc: 01 00 00 00 nop 201a700: c2 00 a0 04 ld [ %g2 + 4 ], %g1 201a704: 80 88 60 01 btst 1, %g1 201a708: 02 80 00 06 be 201a720 <_Heap_Size_of_alloc_area+0x90> <== NEVER TAKEN 201a70c: 84 20 80 19 sub %g2, %i1, %g2 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_BLOCK_SIZE_OFFSET - alloc_begin; 201a710: 84 00 a0 04 add %g2, 4, %g2 201a714: c4 26 80 00 st %g2, [ %i2 ] return true; 201a718: 81 c7 e0 08 ret 201a71c: 91 e8 20 01 restore %g0, 1, %o0 } 201a720: 81 c7 e0 08 ret 201a724: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02008414 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008414: 9d e3 bf 88 save %sp, -120, %sp uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const last_block = heap->last_block; Heap_Block *block = heap->first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008418: 23 00 80 22 sethi %hi(0x2008800), %l1 200841c: 80 8e a0 ff btst 0xff, %i2 2008420: a2 14 60 ec or %l1, 0xec, %l1 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2008424: e4 06 20 10 ld [ %i0 + 0x10 ], %l2 uintptr_t const min_block_size = heap->min_block_size; 2008428: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const last_block = heap->last_block; 200842c: e8 06 20 24 ld [ %i0 + 0x24 ], %l4 Heap_Block *block = heap->first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008430: 12 80 00 04 bne 2008440 <_Heap_Walk+0x2c> 2008434: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 2008438: 23 00 80 21 sethi %hi(0x2008400), %l1 200843c: a2 14 60 0c or %l1, 0xc, %l1 ! 200840c <_Heap_Walk_print_nothing> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008440: 03 00 80 7d sethi %hi(0x201f400), %g1 2008444: c2 00 62 10 ld [ %g1 + 0x210 ], %g1 ! 201f610 <_System_state_Current> 2008448: 80 a0 60 03 cmp %g1, 3 200844c: 12 80 01 1e bne 20088c4 <_Heap_Walk+0x4b0> 2008450: 90 10 00 19 mov %i1, %o0 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)( 2008454: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008458: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 200845c: c4 06 20 08 ld [ %i0 + 8 ], %g2 2008460: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008464: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008468: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 200846c: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008470: e0 23 a0 60 st %l0, [ %sp + 0x60 ] 2008474: e8 23 a0 64 st %l4, [ %sp + 0x64 ] 2008478: 92 10 20 00 clr %o1 200847c: 15 00 80 71 sethi %hi(0x201c400), %o2 2008480: 96 10 00 12 mov %l2, %o3 2008484: 94 12 a1 70 or %o2, 0x170, %o2 2008488: 9f c4 40 00 call %l1 200848c: 98 10 00 13 mov %l3, %o4 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008490: 80 a4 a0 00 cmp %l2, 0 2008494: 12 80 00 07 bne 20084b0 <_Heap_Walk+0x9c> 2008498: 80 8c a0 07 btst 7, %l2 (*printer)( source, true, "page size is zero\n" ); 200849c: 15 00 80 71 sethi %hi(0x201c400), %o2 20084a0: 90 10 00 19 mov %i1, %o0 20084a4: 92 10 20 01 mov 1, %o1 20084a8: 10 80 00 27 b 2008544 <_Heap_Walk+0x130> 20084ac: 94 12 a2 08 or %o2, 0x208, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 20084b0: 22 80 00 08 be,a 20084d0 <_Heap_Walk+0xbc> 20084b4: 90 10 00 13 mov %l3, %o0 (*printer)( 20084b8: 15 00 80 71 sethi %hi(0x201c400), %o2 20084bc: 90 10 00 19 mov %i1, %o0 20084c0: 96 10 00 12 mov %l2, %o3 20084c4: 92 10 20 01 mov 1, %o1 20084c8: 10 80 01 05 b 20088dc <_Heap_Walk+0x4c8> 20084cc: 94 12 a2 20 or %o2, 0x220, %o2 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20084d0: 7f ff e5 82 call 2001ad8 <.urem> 20084d4: 92 10 00 12 mov %l2, %o1 20084d8: 80 a2 20 00 cmp %o0, 0 20084dc: 22 80 00 08 be,a 20084fc <_Heap_Walk+0xe8> 20084e0: 90 04 20 08 add %l0, 8, %o0 (*printer)( 20084e4: 15 00 80 71 sethi %hi(0x201c400), %o2 20084e8: 90 10 00 19 mov %i1, %o0 20084ec: 96 10 00 13 mov %l3, %o3 20084f0: 92 10 20 01 mov 1, %o1 20084f4: 10 80 00 fa b 20088dc <_Heap_Walk+0x4c8> 20084f8: 94 12 a2 40 or %o2, 0x240, %o2 ); return false; } if ( 20084fc: 7f ff e5 77 call 2001ad8 <.urem> 2008500: 92 10 00 12 mov %l2, %o1 2008504: 80 a2 20 00 cmp %o0, 0 2008508: 22 80 00 08 be,a 2008528 <_Heap_Walk+0x114> 200850c: c2 04 20 04 ld [ %l0 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008510: 15 00 80 71 sethi %hi(0x201c400), %o2 2008514: 90 10 00 19 mov %i1, %o0 2008518: 96 10 00 10 mov %l0, %o3 200851c: 92 10 20 01 mov 1, %o1 2008520: 10 80 00 ef b 20088dc <_Heap_Walk+0x4c8> 2008524: 94 12 a2 68 or %o2, 0x268, %o2 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008528: 80 88 60 01 btst 1, %g1 200852c: 32 80 00 09 bne,a 2008550 <_Heap_Walk+0x13c> 2008530: ea 04 00 00 ld [ %l0 ], %l5 (*printer)( 2008534: 15 00 80 71 sethi %hi(0x201c400), %o2 2008538: 90 10 00 19 mov %i1, %o0 200853c: 92 10 20 01 mov 1, %o1 2008540: 94 12 a2 a0 or %o2, 0x2a0, %o2 2008544: 9f c4 40 00 call %l1 2008548: b0 10 20 00 clr %i0 200854c: 30 80 00 e6 b,a 20088e4 <_Heap_Walk+0x4d0> ); return false; } if ( first_block->prev_size != page_size ) { 2008550: 80 a5 40 12 cmp %l5, %l2 2008554: 22 80 00 09 be,a 2008578 <_Heap_Walk+0x164> 2008558: c2 05 20 04 ld [ %l4 + 4 ], %g1 (*printer)( 200855c: 15 00 80 71 sethi %hi(0x201c400), %o2 2008560: 90 10 00 19 mov %i1, %o0 2008564: 96 10 00 15 mov %l5, %o3 2008568: 98 10 00 12 mov %l2, %o4 200856c: 92 10 20 01 mov 1, %o1 2008570: 10 80 00 88 b 2008790 <_Heap_Walk+0x37c> 2008574: 94 12 a2 d0 or %o2, 0x2d0, %o2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2008578: 82 08 7f fe and %g1, -2, %g1 200857c: 82 05 00 01 add %l4, %g1, %g1 2008580: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008584: 80 88 60 01 btst 1, %g1 2008588: 32 80 00 07 bne,a 20085a4 <_Heap_Walk+0x190> 200858c: d6 06 20 08 ld [ %i0 + 8 ], %o3 (*printer)( 2008590: 15 00 80 71 sethi %hi(0x201c400), %o2 2008594: 90 10 00 19 mov %i1, %o0 2008598: 92 10 20 01 mov 1, %o1 200859c: 10 bf ff ea b 2008544 <_Heap_Walk+0x130> 20085a0: 94 12 a3 00 or %o2, 0x300, %o2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 20085a4: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20085a8: a4 10 00 18 mov %i0, %l2 20085ac: 10 80 00 32 b 2008674 <_Heap_Walk+0x260> 20085b0: ae 10 00 0b mov %o3, %l7 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 20085b4: 80 a0 80 17 cmp %g2, %l7 20085b8: 18 80 00 05 bgu 20085cc <_Heap_Walk+0x1b8> 20085bc: 82 10 20 00 clr %g1 20085c0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 20085c4: 80 a0 40 17 cmp %g1, %l7 20085c8: 82 60 3f ff subx %g0, -1, %g1 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 ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { 20085cc: 80 a0 60 00 cmp %g1, 0 20085d0: 32 80 00 08 bne,a 20085f0 <_Heap_Walk+0x1dc> 20085d4: 90 05 e0 08 add %l7, 8, %o0 (*printer)( 20085d8: 15 00 80 71 sethi %hi(0x201c400), %o2 20085dc: 96 10 00 17 mov %l7, %o3 20085e0: 90 10 00 19 mov %i1, %o0 20085e4: 92 10 20 01 mov 1, %o1 20085e8: 10 80 00 bd b 20088dc <_Heap_Walk+0x4c8> 20085ec: 94 12 a3 18 or %o2, 0x318, %o2 ); return false; } if ( 20085f0: 7f ff e5 3a call 2001ad8 <.urem> 20085f4: 92 10 00 16 mov %l6, %o1 20085f8: 80 a2 20 00 cmp %o0, 0 20085fc: 22 80 00 08 be,a 200861c <_Heap_Walk+0x208> 2008600: c2 05 e0 04 ld [ %l7 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008604: 15 00 80 71 sethi %hi(0x201c400), %o2 2008608: 96 10 00 17 mov %l7, %o3 200860c: 90 10 00 19 mov %i1, %o0 2008610: 92 10 20 01 mov 1, %o1 2008614: 10 80 00 b2 b 20088dc <_Heap_Walk+0x4c8> 2008618: 94 12 a3 38 or %o2, 0x338, %o2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200861c: 82 08 7f fe and %g1, -2, %g1 2008620: 82 05 c0 01 add %l7, %g1, %g1 2008624: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008628: 80 88 60 01 btst 1, %g1 200862c: 22 80 00 08 be,a 200864c <_Heap_Walk+0x238> 2008630: d8 05 e0 0c ld [ %l7 + 0xc ], %o4 (*printer)( 2008634: 15 00 80 71 sethi %hi(0x201c400), %o2 2008638: 96 10 00 17 mov %l7, %o3 200863c: 90 10 00 19 mov %i1, %o0 2008640: 92 10 20 01 mov 1, %o1 2008644: 10 80 00 a6 b 20088dc <_Heap_Walk+0x4c8> 2008648: 94 12 a3 68 or %o2, 0x368, %o2 ); return false; } if ( free_block->prev != prev_block ) { 200864c: 80 a3 00 12 cmp %o4, %l2 2008650: 02 80 00 08 be 2008670 <_Heap_Walk+0x25c> 2008654: a4 10 00 17 mov %l7, %l2 (*printer)( 2008658: 15 00 80 71 sethi %hi(0x201c400), %o2 200865c: 96 10 00 17 mov %l7, %o3 2008660: 90 10 00 19 mov %i1, %o0 2008664: 92 10 20 01 mov 1, %o1 2008668: 10 80 00 4a b 2008790 <_Heap_Walk+0x37c> 200866c: 94 12 a3 88 or %o2, 0x388, %o2 return false; } prev_block = free_block; free_block = free_block->next; 2008670: ee 05 e0 08 ld [ %l7 + 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 ) { 2008674: 80 a5 c0 18 cmp %l7, %i0 2008678: 32 bf ff cf bne,a 20085b4 <_Heap_Walk+0x1a0> 200867c: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008680: 10 80 00 89 b 20088a4 <_Heap_Walk+0x490> 2008684: 37 00 80 71 sethi %hi(0x201c400), %i3 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; if ( prev_used ) { 2008688: 80 8d a0 01 btst 1, %l6 - 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; 200868c: ac 0d bf fe and %l6, -2, %l6 2008690: 02 80 00 0a be 20086b8 <_Heap_Walk+0x2a4> 2008694: a4 04 00 16 add %l0, %l6, %l2 (*printer)( 2008698: 90 10 00 19 mov %i1, %o0 200869c: 92 10 20 00 clr %o1 20086a0: 94 10 00 1a mov %i2, %o2 20086a4: 96 10 00 10 mov %l0, %o3 20086a8: 9f c4 40 00 call %l1 20086ac: 98 10 00 16 mov %l6, %o4 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 20086b0: 10 80 00 0a b 20086d8 <_Heap_Walk+0x2c4> 20086b4: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20086b8: da 04 00 00 ld [ %l0 ], %o5 20086bc: 90 10 00 19 mov %i1, %o0 20086c0: 92 10 20 00 clr %o1 20086c4: 94 10 00 1b mov %i3, %o2 20086c8: 96 10 00 10 mov %l0, %o3 20086cc: 9f c4 40 00 call %l1 20086d0: 98 10 00 16 mov %l6, %o4 20086d4: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 20086d8: 80 a0 80 12 cmp %g2, %l2 20086dc: 18 80 00 05 bgu 20086f0 <_Heap_Walk+0x2dc> <== NEVER TAKEN 20086e0: 82 10 20 00 clr %g1 20086e4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 20086e8: 80 a0 40 12 cmp %g1, %l2 20086ec: 82 60 3f ff subx %g0, -1, %g1 block_size, block->prev_size ); } if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 20086f0: 80 a0 60 00 cmp %g1, 0 20086f4: 32 80 00 09 bne,a 2008718 <_Heap_Walk+0x304> 20086f8: 90 10 00 16 mov %l6, %o0 (*printer)( 20086fc: 15 00 80 72 sethi %hi(0x201c800), %o2 2008700: 90 10 00 19 mov %i1, %o0 2008704: 96 10 00 10 mov %l0, %o3 2008708: 98 10 00 12 mov %l2, %o4 200870c: 92 10 20 01 mov 1, %o1 2008710: 10 80 00 20 b 2008790 <_Heap_Walk+0x37c> 2008714: 94 12 a0 00 mov %o2, %o2 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) ) { 2008718: 7f ff e4 f0 call 2001ad8 <.urem> 200871c: 92 10 00 15 mov %l5, %o1 2008720: 80 a2 20 00 cmp %o0, 0 2008724: 02 80 00 09 be 2008748 <_Heap_Walk+0x334> 2008728: 80 a5 80 13 cmp %l6, %l3 (*printer)( 200872c: 15 00 80 72 sethi %hi(0x201c800), %o2 2008730: 90 10 00 19 mov %i1, %o0 2008734: 96 10 00 10 mov %l0, %o3 2008738: 98 10 00 16 mov %l6, %o4 200873c: 92 10 20 01 mov 1, %o1 2008740: 10 80 00 14 b 2008790 <_Heap_Walk+0x37c> 2008744: 94 12 a0 30 or %o2, 0x30, %o2 ); return false; } if ( block_size < min_block_size ) { 2008748: 1a 80 00 0a bcc 2008770 <_Heap_Walk+0x35c> 200874c: 80 a4 80 10 cmp %l2, %l0 (*printer)( 2008750: 15 00 80 72 sethi %hi(0x201c800), %o2 2008754: 90 10 00 19 mov %i1, %o0 2008758: 96 10 00 10 mov %l0, %o3 200875c: 98 10 00 16 mov %l6, %o4 2008760: 9a 10 00 13 mov %l3, %o5 2008764: 92 10 20 01 mov 1, %o1 2008768: 10 80 00 3b b 2008854 <_Heap_Walk+0x440> 200876c: 94 12 a0 60 or %o2, 0x60, %o2 ); return false; } if ( next_block_begin <= block_begin ) { 2008770: 38 80 00 0b bgu,a 200879c <_Heap_Walk+0x388> 2008774: c2 04 a0 04 ld [ %l2 + 4 ], %g1 (*printer)( 2008778: 15 00 80 72 sethi %hi(0x201c800), %o2 200877c: 90 10 00 19 mov %i1, %o0 2008780: 96 10 00 10 mov %l0, %o3 2008784: 98 10 00 12 mov %l2, %o4 2008788: 92 10 20 01 mov 1, %o1 200878c: 94 12 a0 90 or %o2, 0x90, %o2 2008790: 9f c4 40 00 call %l1 2008794: b0 10 20 00 clr %i0 2008798: 30 80 00 53 b,a 20088e4 <_Heap_Walk+0x4d0> ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200879c: 80 88 60 01 btst 1, %g1 20087a0: 32 80 00 46 bne,a 20088b8 <_Heap_Walk+0x4a4> 20087a4: a0 10 00 12 mov %l2, %l0 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; 20087a8: fa 04 20 04 ld [ %l0 + 4 ], %i5 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)( 20087ac: d8 04 20 0c ld [ %l0 + 0xc ], %o4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20087b0: c2 06 20 08 ld [ %i0 + 8 ], %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; 20087b4: ac 0f 7f fe and %i5, -2, %l6 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20087b8: 1b 00 80 72 sethi %hi(0x201c800), %o5 20087bc: 80 a3 00 01 cmp %o4, %g1 } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 20087c0: c6 06 20 0c ld [ %i0 + 0xc ], %g3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20087c4: ae 04 00 16 add %l0, %l6, %l7 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20087c8: 02 80 00 07 be 20087e4 <_Heap_Walk+0x3d0> 20087cc: 9a 13 60 c8 or %o5, 0xc8, %o5 "block 0x%08x: prev 0x%08x%s, next 0x%08x%s\n", block, block->prev, block->prev == first_free_block ? " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), 20087d0: 1b 00 80 72 sethi %hi(0x201c800), %o5 20087d4: 80 a3 00 18 cmp %o4, %i0 20087d8: 02 80 00 03 be 20087e4 <_Heap_Walk+0x3d0> 20087dc: 9a 13 60 e0 or %o5, 0xe0, %o5 20087e0: 9a 10 00 1c mov %i4, %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)( 20087e4: c4 04 20 08 ld [ %l0 + 8 ], %g2 20087e8: 03 00 80 72 sethi %hi(0x201c800), %g1 20087ec: 80 a0 80 03 cmp %g2, %g3 20087f0: 02 80 00 07 be 200880c <_Heap_Walk+0x3f8> 20087f4: 82 10 60 f0 or %g1, 0xf0, %g1 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 20087f8: 03 00 80 72 sethi %hi(0x201c800), %g1 20087fc: 80 a0 80 18 cmp %g2, %i0 2008800: 02 80 00 03 be 200880c <_Heap_Walk+0x3f8> 2008804: 82 10 61 00 or %g1, 0x100, %g1 2008808: 82 10 00 1c mov %i4, %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)( 200880c: c4 23 a0 5c st %g2, [ %sp + 0x5c ] 2008810: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008814: 90 10 00 19 mov %i1, %o0 2008818: 92 10 20 00 clr %o1 200881c: 15 00 80 72 sethi %hi(0x201c800), %o2 2008820: 96 10 00 10 mov %l0, %o3 2008824: 9f c4 40 00 call %l1 2008828: 94 12 a1 10 or %o2, 0x110, %o2 block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 200882c: da 05 c0 00 ld [ %l7 ], %o5 2008830: 80 a5 80 0d cmp %l6, %o5 2008834: 02 80 00 0b be 2008860 <_Heap_Walk+0x44c> 2008838: 15 00 80 72 sethi %hi(0x201c800), %o2 (*printer)( 200883c: ee 23 a0 5c st %l7, [ %sp + 0x5c ] 2008840: 90 10 00 19 mov %i1, %o0 2008844: 96 10 00 10 mov %l0, %o3 2008848: 98 10 00 16 mov %l6, %o4 200884c: 92 10 20 01 mov 1, %o1 2008850: 94 12 a1 40 or %o2, 0x140, %o2 2008854: 9f c4 40 00 call %l1 2008858: b0 10 20 00 clr %i0 200885c: 30 80 00 22 b,a 20088e4 <_Heap_Walk+0x4d0> ); return false; } if ( !prev_used ) { 2008860: 80 8f 60 01 btst 1, %i5 2008864: 32 80 00 0b bne,a 2008890 <_Heap_Walk+0x47c> 2008868: c2 06 20 08 ld [ %i0 + 8 ], %g1 (*printer)( 200886c: 15 00 80 72 sethi %hi(0x201c800), %o2 2008870: 90 10 00 19 mov %i1, %o0 2008874: 96 10 00 10 mov %l0, %o3 2008878: 92 10 20 01 mov 1, %o1 200887c: 10 80 00 18 b 20088dc <_Heap_Walk+0x4c8> 2008880: 94 12 a1 80 or %o2, 0x180, %o2 { 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 ) { if ( free_block == block ) { 2008884: 22 80 00 0d be,a 20088b8 <_Heap_Walk+0x4a4> 2008888: a0 10 00 12 mov %l2, %l0 return true; } free_block = free_block->next; 200888c: 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 ) { 2008890: 80 a0 40 18 cmp %g1, %i0 2008894: 12 bf ff fc bne 2008884 <_Heap_Walk+0x470> 2008898: 80 a0 40 10 cmp %g1, %l0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200889c: 10 80 00 0c b 20088cc <_Heap_Walk+0x4b8> 20088a0: 15 00 80 72 sethi %hi(0x201c800), %o2 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; if ( prev_used ) { (*printer)( 20088a4: 35 00 80 71 sethi %hi(0x201c400), %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 20088a8: 39 00 80 72 sethi %hi(0x201c800), %i4 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20088ac: b6 16 e3 d8 or %i3, 0x3d8, %i3 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; if ( prev_used ) { (*printer)( 20088b0: b4 16 a3 c0 or %i2, 0x3c0, %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 20088b4: b8 17 20 d8 or %i4, 0xd8, %i4 if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; } while ( block != last_block ) { 20088b8: 80 a4 00 14 cmp %l0, %l4 20088bc: 32 bf ff 73 bne,a 2008688 <_Heap_Walk+0x274> 20088c0: ec 04 20 04 ld [ %l0 + 4 ], %l6 block = next_block; } return true; } 20088c4: 81 c7 e0 08 ret 20088c8: 91 e8 20 01 restore %g0, 1, %o0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 20088cc: 90 10 00 19 mov %i1, %o0 20088d0: 96 10 00 10 mov %l0, %o3 20088d4: 92 10 20 01 mov 1, %o1 20088d8: 94 12 a1 b0 or %o2, 0x1b0, %o2 20088dc: 9f c4 40 00 call %l1 20088e0: b0 10 20 00 clr %i0 20088e4: 81 c7 e0 08 ret 20088e8: 81 e8 00 00 restore =============================================================================== 020012c0 <_Message_queue_Manager_initialization>: #include #include void _Message_queue_Manager_initialization(void) { } 20012c0: 81 c3 e0 08 retl =============================================================================== 020076a8 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20076a8: 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 ) 20076ac: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20076b0: 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 ) 20076b4: 80 a0 60 00 cmp %g1, 0 20076b8: 02 80 00 20 be 2007738 <_Objects_Allocate+0x90> <== NEVER TAKEN 20076bc: 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 ); 20076c0: a2 04 20 20 add %l0, 0x20, %l1 20076c4: 7f ff fd 8f call 2006d00 <_Chain_Get> 20076c8: 90 10 00 11 mov %l1, %o0 if ( information->auto_extend ) { 20076cc: c2 0c 20 12 ldub [ %l0 + 0x12 ], %g1 20076d0: 80 a0 60 00 cmp %g1, 0 20076d4: 02 80 00 19 be 2007738 <_Objects_Allocate+0x90> 20076d8: 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 ) { 20076dc: 80 a2 20 00 cmp %o0, 0 20076e0: 32 80 00 0a bne,a 2007708 <_Objects_Allocate+0x60> 20076e4: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 _Objects_Extend_information( information ); 20076e8: 40 00 00 1e call 2007760 <_Objects_Extend_information> 20076ec: 90 10 00 10 mov %l0, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20076f0: 7f ff fd 84 call 2006d00 <_Chain_Get> 20076f4: 90 10 00 11 mov %l1, %o0 } if ( the_object ) { 20076f8: b0 92 20 00 orcc %o0, 0, %i0 20076fc: 02 80 00 0f be 2007738 <_Objects_Allocate+0x90> 2007700: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007704: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 2007708: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 200770c: d2 14 20 14 lduh [ %l0 + 0x14 ], %o1 2007710: 40 00 44 d6 call 2018a68 <.udiv> 2007714: 90 22 00 01 sub %o0, %g1, %o0 2007718: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 200771c: 91 2a 20 02 sll %o0, 2, %o0 information->inactive--; 2007720: c6 14 20 2c lduh [ %l0 + 0x2c ], %g3 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 2007724: c4 00 40 08 ld [ %g1 + %o0 ], %g2 information->inactive--; 2007728: 86 00 ff ff add %g3, -1, %g3 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 200772c: 84 00 bf ff add %g2, -1, %g2 information->inactive--; 2007730: c6 34 20 2c sth %g3, [ %l0 + 0x2c ] block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 2007734: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; } } return the_object; } 2007738: 81 c7 e0 08 ret 200773c: 81 e8 00 00 restore =============================================================================== 02007760 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007760: 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 ) 2007764: e4 06 20 34 ld [ %i0 + 0x34 ], %l2 2007768: 80 a4 a0 00 cmp %l2, 0 200776c: 12 80 00 06 bne 2007784 <_Objects_Extend_information+0x24> 2007770: e6 16 20 0a lduh [ %i0 + 0xa ], %l3 2007774: a0 10 00 13 mov %l3, %l0 2007778: a2 10 20 00 clr %l1 200777c: 10 80 00 15 b 20077d0 <_Objects_Extend_information+0x70> 2007780: a8 10 20 00 clr %l4 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007784: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 2007788: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 200778c: 40 00 44 b7 call 2018a68 <.udiv> 2007790: 92 10 00 11 mov %l1, %o1 for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) 2007794: 82 10 00 11 mov %l1, %g1 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007798: 91 2a 20 10 sll %o0, 0x10, %o0 200779c: a0 10 00 13 mov %l3, %l0 20077a0: a9 32 20 10 srl %o0, 0x10, %l4 for ( ; block < block_count; block++ ) { 20077a4: 10 80 00 08 b 20077c4 <_Objects_Extend_information+0x64> 20077a8: a2 10 20 00 clr %l1 if ( information->object_blocks[ block ] == NULL ) 20077ac: c4 04 80 02 ld [ %l2 + %g2 ], %g2 20077b0: 80 a0 a0 00 cmp %g2, 0 20077b4: 22 80 00 08 be,a 20077d4 <_Objects_Extend_information+0x74> 20077b8: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 20077bc: a0 04 00 01 add %l0, %g1, %l0 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 20077c0: a2 04 60 01 inc %l1 20077c4: 80 a4 40 14 cmp %l1, %l4 20077c8: 0a bf ff f9 bcs 20077ac <_Objects_Extend_information+0x4c> 20077cc: 85 2c 60 02 sll %l1, 2, %g2 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 20077d0: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 20077d4: ec 16 20 10 lduh [ %i0 + 0x10 ], %l6 /* * 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 ) { 20077d8: 03 00 00 3f sethi %hi(0xfc00), %g1 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 20077dc: ac 02 00 16 add %o0, %l6, %l6 /* * 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 ) { 20077e0: 82 10 63 ff or %g1, 0x3ff, %g1 20077e4: 80 a5 80 01 cmp %l6, %g1 20077e8: 18 80 00 88 bgu 2007a08 <_Objects_Extend_information+0x2a8><== NEVER TAKEN 20077ec: 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; 20077f0: 40 00 44 64 call 2018980 <.umul> 20077f4: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 20077f8: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 20077fc: 80 a0 60 00 cmp %g1, 0 2007800: 02 80 00 09 be 2007824 <_Objects_Extend_information+0xc4> 2007804: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007808: 40 00 08 68 call 20099a8 <_Workspace_Allocate> 200780c: 01 00 00 00 nop if ( !new_object_block ) 2007810: a4 92 20 00 orcc %o0, 0, %l2 2007814: 32 80 00 08 bne,a 2007834 <_Objects_Extend_information+0xd4> 2007818: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 200781c: 81 c7 e0 08 ret 2007820: 81 e8 00 00 restore return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 2007824: 40 00 08 53 call 2009970 <_Workspace_Allocate_or_fatal_error> 2007828: 01 00 00 00 nop 200782c: a4 10 00 08 mov %o0, %l2 } /* * If the index_base is the maximum we need to grow the tables. */ if (index_base >= information->maximum ) { 2007830: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007834: 80 a4 00 01 cmp %l0, %g1 2007838: 2a 80 00 53 bcs,a 2007984 <_Objects_Extend_information+0x224> 200783c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007840: 82 05 80 13 add %l6, %l3, %g1 */ /* * Up the block count and maximum */ block_count++; 2007844: ae 05 20 01 add %l4, 1, %l7 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2007848: 91 2d e0 01 sll %l7, 1, %o0 200784c: 90 02 00 17 add %o0, %l7, %o0 2007850: 90 00 40 08 add %g1, %o0, %o0 2007854: 40 00 08 55 call 20099a8 <_Workspace_Allocate> 2007858: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 200785c: aa 92 20 00 orcc %o0, 0, %l5 2007860: 32 80 00 06 bne,a 2007878 <_Objects_Extend_information+0x118> 2007864: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 _Workspace_Free( new_object_block ); 2007868: 40 00 08 59 call 20099cc <_Workspace_Free> 200786c: 90 10 00 12 mov %l2, %o0 return; 2007870: 81 c7 e0 08 ret 2007874: 81 e8 00 00 restore } /* * Break the block into the various sections. */ inactive_per_block = (uint32_t *) _Addresses_Add_offset( 2007878: af 2d e0 02 sll %l7, 2, %l7 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 200787c: 80 a0 40 13 cmp %g1, %l3 RTEMS_INLINE_ROUTINE void *_Addresses_Add_offset ( const void *base, uintptr_t offset ) { return (void *)((uintptr_t)base + offset); 2007880: ba 05 40 17 add %l5, %l7, %i5 2007884: 82 10 20 00 clr %g1 2007888: 08 80 00 14 bleu 20078d8 <_Objects_Extend_information+0x178> 200788c: ae 07 40 17 add %i5, %l7, %l7 /* * 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, 2007890: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2007894: b9 2d 20 02 sll %l4, 2, %i4 /* * 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, 2007898: 40 00 21 5d call 200fe0c 200789c: 94 10 00 1c mov %i4, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 20078a0: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 20078a4: 94 10 00 1c mov %i4, %o2 20078a8: 40 00 21 59 call 200fe0c 20078ac: 90 10 00 1d mov %i5, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20078b0: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 20078b4: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 20078b8: a6 04 c0 01 add %l3, %g1, %l3 20078bc: 90 10 00 17 mov %l7, %o0 20078c0: 40 00 21 53 call 200fe0c 20078c4: 95 2c e0 02 sll %l3, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20078c8: 10 80 00 08 b 20078e8 <_Objects_Extend_information+0x188> 20078cc: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20078d0: 82 00 60 01 inc %g1 local_table[ index ] = NULL; 20078d4: c0 20 80 17 clr [ %g2 + %l7 ] } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20078d8: 80 a0 40 13 cmp %g1, %l3 20078dc: 2a bf ff fd bcs,a 20078d0 <_Objects_Extend_information+0x170> 20078e0: 85 28 60 02 sll %g1, 2, %g2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20078e4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20078e8: a9 2d 20 02 sll %l4, 2, %l4 inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20078ec: 85 2c 20 02 sll %l0, 2, %g2 /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; 20078f0: c0 27 40 14 clr [ %i5 + %l4 ] } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20078f4: c0 25 40 14 clr [ %l5 + %l4 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20078f8: 86 04 00 03 add %l0, %g3, %g3 20078fc: 84 05 c0 02 add %l7, %g2, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007900: 10 80 00 04 b 2007910 <_Objects_Extend_information+0x1b0> 2007904: 82 10 00 10 mov %l0, %g1 index < ( information->allocation_size + index_base ); index++ ) { 2007908: 82 00 60 01 inc %g1 200790c: 84 00 a0 04 add %g2, 4, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007910: 80 a0 40 03 cmp %g1, %g3 2007914: 2a bf ff fd bcs,a 2007908 <_Objects_Extend_information+0x1a8> 2007918: c0 20 80 00 clr [ %g2 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 200791c: 7f ff e9 aa call 2001fc4 2007920: 01 00 00 00 nop 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( 2007924: c8 06 00 00 ld [ %i0 ], %g4 2007928: c4 16 20 04 lduh [ %i0 + 4 ], %g2 old_tables = information->object_blocks; information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 200792c: ec 36 20 10 sth %l6, [ %i0 + 0x10 ] information->maximum_id = _Objects_Build_id( 2007930: ad 2d a0 10 sll %l6, 0x10, %l6 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2007934: e6 06 20 34 ld [ %i0 + 0x34 ], %l3 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( 2007938: 83 35 a0 10 srl %l6, 0x10, %g1 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; 200793c: fa 26 20 30 st %i5, [ %i0 + 0x30 ] information->local_table = local_table; 2007940: ee 26 20 1c st %l7, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007944: 89 29 20 18 sll %g4, 0x18, %g4 2007948: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 200794c: ea 26 20 34 st %l5, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007950: 07 00 00 40 sethi %hi(0x10000), %g3 2007954: ac 11 00 03 or %g4, %g3, %l6 2007958: ac 15 80 02 or %l6, %g2, %l6 200795c: ac 15 80 01 or %l6, %g1, %l6 2007960: ec 26 20 0c st %l6, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2007964: 7f ff e9 9c call 2001fd4 2007968: 01 00 00 00 nop if ( old_tables ) 200796c: 80 a4 e0 00 cmp %l3, 0 2007970: 22 80 00 05 be,a 2007984 <_Objects_Extend_information+0x224> 2007974: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 _Workspace_Free( old_tables ); 2007978: 40 00 08 15 call 20099cc <_Workspace_Free> 200797c: 90 10 00 13 mov %l3, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007980: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007984: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2007988: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 200798c: 92 10 00 12 mov %l2, %o1 2007990: 90 07 bf f4 add %fp, -12, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007994: a3 2c 60 02 sll %l1, 2, %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007998: a8 06 20 20 add %i0, 0x20, %l4 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 200799c: e4 20 40 11 st %l2, [ %g1 + %l1 ] */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { the_object->id = _Objects_Build_id( 20079a0: 27 00 00 40 sethi %hi(0x10000), %l3 information->object_blocks[ block ] = new_object_block; /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20079a4: 40 00 14 07 call 200c9c0 <_Chain_Initialize> 20079a8: a4 10 00 08 mov %o0, %l2 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20079ac: 30 80 00 0c b,a 20079dc <_Objects_Extend_information+0x27c> the_object->id = _Objects_Build_id( 20079b0: c4 16 20 04 lduh [ %i0 + 4 ], %g2 20079b4: 83 28 60 18 sll %g1, 0x18, %g1 20079b8: 85 28 a0 1b sll %g2, 0x1b, %g2 20079bc: 82 10 40 13 or %g1, %l3, %g1 20079c0: 82 10 40 02 or %g1, %g2, %g1 20079c4: 82 10 40 10 or %g1, %l0, %g1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20079c8: 92 10 00 08 mov %o0, %o1 */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { the_object->id = _Objects_Build_id( 20079cc: c2 22 20 08 st %g1, [ %o0 + 8 ] index ); _Chain_Append( &information->Inactive, &the_object->Node ); index++; 20079d0: a0 04 20 01 inc %l0 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20079d4: 7f ff fc b5 call 2006ca8 <_Chain_Append> 20079d8: 90 10 00 14 mov %l4, %o0 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20079dc: 7f ff fc c9 call 2006d00 <_Chain_Get> 20079e0: 90 10 00 12 mov %l2, %o0 20079e4: 80 a2 20 00 cmp %o0, 0 20079e8: 32 bf ff f2 bne,a 20079b0 <_Objects_Extend_information+0x250> 20079ec: c2 06 00 00 ld [ %i0 ], %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20079f0: c2 16 20 2c lduh [ %i0 + 0x2c ], %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20079f4: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20079f8: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 information->inactive = 20079fc: 82 01 00 01 add %g4, %g1, %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007a00: c8 20 80 11 st %g4, [ %g2 + %l1 ] information->inactive = 2007a04: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2007a08: 81 c7 e0 08 ret 2007a0c: 81 e8 00 00 restore =============================================================================== 02007ab8 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint32_t the_class ) { 2007ab8: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007abc: 80 a6 60 00 cmp %i1, 0 2007ac0: 22 80 00 1a be,a 2007b28 <_Objects_Get_information+0x70> 2007ac4: b0 10 20 00 clr %i0 /* * 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 ); 2007ac8: 40 00 15 5c call 200d038 <_Objects_API_maximum_class> 2007acc: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007ad0: 80 a2 20 00 cmp %o0, 0 2007ad4: 22 80 00 15 be,a 2007b28 <_Objects_Get_information+0x70> 2007ad8: b0 10 20 00 clr %i0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2007adc: 80 a6 40 08 cmp %i1, %o0 2007ae0: 38 80 00 12 bgu,a 2007b28 <_Objects_Get_information+0x70> 2007ae4: b0 10 20 00 clr %i0 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007ae8: b1 2e 20 02 sll %i0, 2, %i0 2007aec: 03 00 80 72 sethi %hi(0x201c800), %g1 2007af0: 82 10 63 80 or %g1, 0x380, %g1 ! 201cb80 <_Objects_Information_table> 2007af4: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2007af8: 80 a0 60 00 cmp %g1, 0 2007afc: 02 80 00 0b be 2007b28 <_Objects_Get_information+0x70> <== NEVER TAKEN 2007b00: b0 10 20 00 clr %i0 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007b04: b3 2e 60 02 sll %i1, 2, %i1 2007b08: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 2007b0c: 80 a6 20 00 cmp %i0, 0 2007b10: 02 80 00 06 be 2007b28 <_Objects_Get_information+0x70> <== NEVER TAKEN 2007b14: 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 ) 2007b18: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007b1c: 80 a0 60 00 cmp %g1, 0 2007b20: 22 80 00 02 be,a 2007b28 <_Objects_Get_information+0x70> 2007b24: b0 10 20 00 clr %i0 return NULL; #endif return info; } 2007b28: 81 c7 e0 08 ret 2007b2c: 81 e8 00 00 restore =============================================================================== 0201828c <_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; 201828c: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 2018290: 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; 2018294: 84 22 40 02 sub %o1, %g2, %g2 2018298: 84 00 a0 01 inc %g2 if ( information->maximum >= index ) { 201829c: 80 a0 40 02 cmp %g1, %g2 20182a0: 0a 80 00 09 bcs 20182c4 <_Objects_Get_no_protection+0x38> 20182a4: 85 28 a0 02 sll %g2, 2, %g2 if ( (the_object = information->local_table[ index ]) != NULL ) { 20182a8: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 20182ac: d0 00 40 02 ld [ %g1 + %g2 ], %o0 20182b0: 80 a2 20 00 cmp %o0, 0 20182b4: 02 80 00 05 be 20182c8 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 20182b8: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 20182bc: 81 c3 e0 08 retl 20182c0: 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; 20182c4: 82 10 20 01 mov 1, %g1 20182c8: 90 10 20 00 clr %o0 return NULL; } 20182cc: 81 c3 e0 08 retl 20182d0: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 0200c484 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200c484: 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; 200c488: 92 96 20 00 orcc %i0, 0, %o1 200c48c: 12 80 00 06 bne 200c4a4 <_Objects_Id_to_name+0x20> 200c490: 83 32 60 18 srl %o1, 0x18, %g1 200c494: 03 00 80 b5 sethi %hi(0x202d400), %g1 200c498: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 ! 202d750 <_Thread_Executing> 200c49c: d2 00 60 08 ld [ %g1 + 8 ], %o1 */ RTEMS_INLINE_ROUTINE Objects_APIs _Objects_Get_API( Objects_Id id ) { return (Objects_APIs) ((id >> OBJECTS_API_START_BIT) & OBJECTS_API_VALID_BITS); 200c4a0: 83 32 60 18 srl %o1, 0x18, %g1 200c4a4: 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 ) 200c4a8: 84 00 7f ff add %g1, -1, %g2 200c4ac: 80 a0 a0 03 cmp %g2, 3 200c4b0: 18 80 00 14 bgu 200c500 <_Objects_Id_to_name+0x7c> 200c4b4: 83 28 60 02 sll %g1, 2, %g1 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 200c4b8: 10 80 00 14 b 200c508 <_Objects_Id_to_name+0x84> 200c4bc: 05 00 80 b5 sethi %hi(0x202d400), %g2 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 200c4c0: 85 28 a0 02 sll %g2, 2, %g2 200c4c4: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 200c4c8: 80 a2 20 00 cmp %o0, 0 200c4cc: 02 80 00 0d be 200c500 <_Objects_Id_to_name+0x7c> <== NEVER TAKEN 200c4d0: 01 00 00 00 nop #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 ); 200c4d4: 7f ff ff cf call 200c410 <_Objects_Get> 200c4d8: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 200c4dc: 80 a2 20 00 cmp %o0, 0 200c4e0: 02 80 00 08 be 200c500 <_Objects_Id_to_name+0x7c> 200c4e4: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200c4e8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); 200c4ec: b0 10 20 00 clr %i0 200c4f0: 40 00 02 65 call 200ce84 <_Thread_Enable_dispatch> 200c4f4: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 200c4f8: 81 c7 e0 08 ret 200c4fc: 81 e8 00 00 restore } 200c500: 81 c7 e0 08 ret 200c504: 91 e8 20 03 restore %g0, 3, %o0 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 200c508: 84 10 a1 f0 or %g2, 0x1f0, %g2 200c50c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200c510: 80 a0 60 00 cmp %g1, 0 200c514: 12 bf ff eb bne 200c4c0 <_Objects_Id_to_name+0x3c> 200c518: 85 32 60 1b srl %o1, 0x1b, %g2 200c51c: 30 bf ff f9 b,a 200c500 <_Objects_Id_to_name+0x7c> =============================================================================== 02007c18 <_Objects_Initialize_information>: , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 2007c18: 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; 2007c1c: 05 00 80 72 sethi %hi(0x201c800), %g2 2007c20: 83 2e 60 02 sll %i1, 2, %g1 2007c24: 84 10 a3 80 or %g2, 0x380, %g2 2007c28: c2 00 80 01 ld [ %g2 + %g1 ], %g1 uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 2007c2c: 85 2f 20 10 sll %i4, 0x10, %g2 2007c30: 85 30 a0 10 srl %g2, 0x10, %g2 information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 2007c34: 87 2e a0 02 sll %i2, 2, %g3 uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 2007c38: c4 26 20 18 st %g2, [ %i0 + 0x18 ] information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 2007c3c: f0 20 40 03 st %i0, [ %g1 + %g3 ] /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; 2007c40: 85 36 e0 1f srl %i3, 0x1f, %g2 maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 2007c44: 03 20 00 00 sethi %hi(0x80000000), %g1 uint32_t maximum_per_allocation; #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; 2007c48: f2 26 00 00 st %i1, [ %i0 ] information->the_class = the_class; 2007c4c: f4 36 20 04 sth %i2, [ %i0 + 4 ] information->size = size; information->local_table = 0; 2007c50: c0 26 20 1c clr [ %i0 + 0x1c ] information->inactive_per_block = 0; 2007c54: c0 26 20 30 clr [ %i0 + 0x30 ] information->object_blocks = 0; 2007c58: c0 26 20 34 clr [ %i0 + 0x34 ] information->inactive = 0; 2007c5c: 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; 2007c60: c0 36 20 10 clrh [ %i0 + 0x10 ] _Objects_Information_table[ the_api ][ the_class ] = information; /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = 2007c64: c4 2e 20 12 stb %g2, [ %i0 + 0x12 ] (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 2007c68: b6 2e c0 01 andn %i3, %g1, %i3 /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 2007c6c: 80 a0 a0 00 cmp %g2, 0 2007c70: 02 80 00 09 be 2007c94 <_Objects_Initialize_information+0x7c> 2007c74: c2 07 a0 5c ld [ %fp + 0x5c ], %g1 2007c78: 80 a6 e0 00 cmp %i3, 0 2007c7c: 12 80 00 07 bne 2007c98 <_Objects_Initialize_information+0x80> 2007c80: 07 00 80 72 sethi %hi(0x201c800), %g3 _Internal_error_Occurred( 2007c84: 90 10 20 00 clr %o0 2007c88: 92 10 20 01 mov 1, %o1 2007c8c: 7f ff fe 59 call 20075f0 <_Internal_error_Occurred> 2007c90: 94 10 20 14 mov 0x14, %o2 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; 2007c94: 07 00 80 72 sethi %hi(0x201c800), %g3 2007c98: 86 10 e0 c8 or %g3, 0xc8, %g3 ! 201c8c8 /* * Calculate minimum and maximum Id's */ minimum_index = (maximum_per_allocation == 0) ? 0 : 1; information->minimum_id = 2007c9c: 80 a0 00 1b cmp %g0, %i3 2007ca0: b3 2e 60 18 sll %i1, 0x18, %i1 2007ca4: 84 40 20 00 addx %g0, 0, %g2 2007ca8: 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; 2007cac: c6 26 20 1c st %g3, [ %i0 + 0x1c ] } /* * The allocation unit is the maximum value */ information->allocation_size = maximum_per_allocation; 2007cb0: f6 36 20 14 sth %i3, [ %i0 + 0x14 ] /* * Calculate minimum and maximum Id's */ minimum_index = (maximum_per_allocation == 0) ? 0 : 1; information->minimum_id = 2007cb4: 07 00 00 40 sethi %hi(0x10000), %g3 2007cb8: b2 16 40 03 or %i1, %g3, %i1 2007cbc: b4 16 40 1a or %i1, %i2, %i2 2007cc0: b4 16 80 02 or %i2, %g2, %i2 2007cc4: f4 26 20 08 st %i2, [ %i0 + 8 ] * Calculate the maximum name length */ name_length = maximum_name_length; if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & 2007cc8: 84 00 60 04 add %g1, 4, %g2 /* * Calculate the maximum name length */ name_length = maximum_name_length; if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) 2007ccc: 80 88 60 03 btst 3, %g1 2007cd0: 12 80 00 03 bne 2007cdc <_Objects_Initialize_information+0xc4><== NEVER TAKEN 2007cd4: 84 08 bf fc and %g2, -4, %g2 2007cd8: 84 10 00 01 mov %g1, %g2 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2007cdc: 82 06 20 24 add %i0, 0x24, %g1 name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; 2007ce0: c4 36 20 38 sth %g2, [ %i0 + 0x38 ] 2007ce4: c2 26 20 20 st %g1, [ %i0 + 0x20 ] the_chain->permanent_null = NULL; 2007ce8: c0 26 20 24 clr [ %i0 + 0x24 ] the_chain->last = _Chain_Head(the_chain); 2007cec: 82 06 20 20 add %i0, 0x20, %g1 _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 2007cf0: 80 a6 e0 00 cmp %i3, 0 2007cf4: 02 80 00 04 be 2007d04 <_Objects_Initialize_information+0xec> 2007cf8: c2 26 20 28 st %g1, [ %i0 + 0x28 ] /* * 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 ); 2007cfc: 7f ff fe 99 call 2007760 <_Objects_Extend_information> 2007d00: 81 e8 00 00 restore 2007d04: 81 c7 e0 08 ret 2007d08: 81 e8 00 00 restore =============================================================================== 020012c8 <_Partition_Manager_initialization>: #include #include void _Partition_Manager_initialization(void) { } 20012c8: 81 c3 e0 08 retl =============================================================================== 0200c780 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200c780: 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 ]; 200c784: e0 06 21 60 ld [ %i0 + 0x160 ], %l0 if ( !api ) 200c788: 80 a4 20 00 cmp %l0, 0 200c78c: 02 80 00 1d be 200c800 <_RTEMS_tasks_Post_switch_extension+0x80><== NEVER TAKEN 200c790: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200c794: 7f ff d6 0c call 2001fc4 200c798: 01 00 00 00 nop signal_set = asr->signals_posted; 200c79c: e6 04 20 14 ld [ %l0 + 0x14 ], %l3 asr->signals_posted = 0; 200c7a0: c0 24 20 14 clr [ %l0 + 0x14 ] _ISR_Enable( level ); 200c7a4: 7f ff d6 0c call 2001fd4 200c7a8: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200c7ac: 80 a4 e0 00 cmp %l3, 0 200c7b0: 02 80 00 14 be 200c800 <_RTEMS_tasks_Post_switch_extension+0x80><== NEVER TAKEN 200c7b4: a2 07 bf fc add %fp, -4, %l1 return; asr->nest_level += 1; 200c7b8: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c7bc: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c7c0: 82 00 60 01 inc %g1 200c7c4: c2 24 20 1c st %g1, [ %l0 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c7c8: 94 10 00 11 mov %l1, %o2 200c7cc: 25 00 00 3f sethi %hi(0xfc00), %l2 200c7d0: 40 00 09 ec call 200ef80 200c7d4: 92 14 a3 ff or %l2, 0x3ff, %o1 ! ffff (*asr->handler)( signal_set ); 200c7d8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 200c7dc: 9f c0 40 00 call %g1 200c7e0: 90 10 00 13 mov %l3, %o0 asr->nest_level -= 1; 200c7e4: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c7e8: 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; 200c7ec: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c7f0: 92 14 a3 ff or %l2, 0x3ff, %o1 asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); (*asr->handler)( signal_set ); asr->nest_level -= 1; 200c7f4: c2 24 20 1c st %g1, [ %l0 + 0x1c ] rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c7f8: 40 00 09 e2 call 200ef80 200c7fc: 94 10 00 11 mov %l1, %o2 200c800: 81 c7 e0 08 ret 200c804: 81 e8 00 00 restore =============================================================================== 020012e8 <_Rate_monotonic_Manager_initialization>: #include #include void _Rate_monotonic_Manager_initialization(void) { } 20012e8: 81 c3 e0 08 retl =============================================================================== 0203fe40 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 203fe40: 9d e3 bf 98 save %sp, -104, %sp 203fe44: 11 00 81 b6 sethi %hi(0x206d800), %o0 203fe48: 92 10 00 18 mov %i0, %o1 203fe4c: 90 12 20 40 or %o0, 0x40, %o0 203fe50: 7f ff 3a 5c call 200e7c0 <_Objects_Get> 203fe54: 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 ) { 203fe58: c2 07 bf fc ld [ %fp + -4 ], %g1 203fe5c: 80 a0 60 00 cmp %g1, 0 203fe60: 12 80 00 26 bne 203fef8 <_Rate_monotonic_Timeout+0xb8> <== NEVER TAKEN 203fe64: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: the_thread = the_period->owner; 203fe68: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 203fe6c: 03 00 00 10 sethi %hi(0x4000), %g1 203fe70: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 203fe74: 80 88 80 01 btst %g2, %g1 203fe78: 22 80 00 0c be,a 203fea8 <_Rate_monotonic_Timeout+0x68> 203fe7c: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 the_thread->Wait.id == the_period->Object.id ) { 203fe80: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 203fe84: c2 04 20 08 ld [ %l0 + 8 ], %g1 203fe88: 80 a0 80 01 cmp %g2, %g1 203fe8c: 32 80 00 07 bne,a 203fea8 <_Rate_monotonic_Timeout+0x68> 203fe90: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 203fe94: 13 04 00 ff sethi %hi(0x1003fc00), %o1 203fe98: 7f ff 3b aa call 200ed40 <_Thread_Clear_state> 203fe9c: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 203fea0: 10 80 00 08 b 203fec0 <_Rate_monotonic_Timeout+0x80> 203fea4: 90 10 00 10 mov %l0, %o0 _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 203fea8: 80 a0 60 01 cmp %g1, 1 203feac: 12 80 00 0e bne 203fee4 <_Rate_monotonic_Timeout+0xa4> 203feb0: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 203feb4: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 203feb8: 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; 203febc: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 203fec0: 7f ff fe ef call 203fa7c <_Rate_monotonic_Initiate_statistics> 203fec4: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203fec8: c2 04 20 3c ld [ %l0 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fecc: 92 04 20 10 add %l0, 0x10, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203fed0: c2 24 20 1c st %g1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fed4: 11 00 81 b5 sethi %hi(0x206d400), %o0 203fed8: 7f ff 41 10 call 2010318 <_Watchdog_Insert> 203fedc: 90 12 20 a0 or %o0, 0xa0, %o0 ! 206d4a0 <_Watchdog_Ticks_chain> 203fee0: 30 80 00 02 b,a 203fee8 <_Rate_monotonic_Timeout+0xa8> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 203fee4: 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; 203fee8: 03 00 81 b4 sethi %hi(0x206d000), %g1 203feec: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 206d3c0 <_Thread_Dispatch_disable_level> 203fef0: 84 00 bf ff add %g2, -1, %g2 203fef4: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] 203fef8: 81 c7 e0 08 ret 203fefc: 81 e8 00 00 restore =============================================================================== 020012d0 <_Region_Manager_initialization>: #include #include void _Region_Manager_initialization(void) { } 20012d0: 81 c3 e0 08 retl =============================================================================== 020073b8 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 20073b8: 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(); 20073bc: 03 00 80 8a sethi %hi(0x2022800), %g1 if ((!the_tod) || 20073c0: 80 a6 20 00 cmp %i0, 0 20073c4: 02 80 00 2d be 2007478 <_TOD_Validate+0xc0> <== NEVER TAKEN 20073c8: d2 00 60 d4 ld [ %g1 + 0xd4 ], %o1 (the_tod->ticks >= ticks_per_second) || 20073cc: 11 00 03 d0 sethi %hi(0xf4000), %o0 20073d0: 40 00 5a b8 call 201deb0 <.udiv> 20073d4: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 20073d8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20073dc: 80 a0 40 08 cmp %g1, %o0 20073e0: 1a 80 00 26 bcc 2007478 <_TOD_Validate+0xc0> 20073e4: 01 00 00 00 nop (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20073e8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20073ec: 80 a0 60 3b cmp %g1, 0x3b 20073f0: 18 80 00 22 bgu 2007478 <_TOD_Validate+0xc0> 20073f4: 01 00 00 00 nop (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20073f8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20073fc: 80 a0 60 3b cmp %g1, 0x3b 2007400: 18 80 00 1e bgu 2007478 <_TOD_Validate+0xc0> 2007404: 01 00 00 00 nop (the_tod->hour >= TOD_HOURS_PER_DAY) || 2007408: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200740c: 80 a0 60 17 cmp %g1, 0x17 2007410: 18 80 00 1a bgu 2007478 <_TOD_Validate+0xc0> 2007414: 01 00 00 00 nop (the_tod->month == 0) || 2007418: c2 06 20 04 ld [ %i0 + 4 ], %g1 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 200741c: 80 a0 60 00 cmp %g1, 0 2007420: 02 80 00 16 be 2007478 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007424: 80 a0 60 0c cmp %g1, 0xc 2007428: 18 80 00 14 bgu 2007478 <_TOD_Validate+0xc0> 200742c: 01 00 00 00 nop (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) || 2007430: c6 06 00 00 ld [ %i0 ], %g3 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007434: 80 a0 e7 c3 cmp %g3, 0x7c3 2007438: 08 80 00 10 bleu 2007478 <_TOD_Validate+0xc0> 200743c: 01 00 00 00 nop (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) || (the_tod->day == 0) ) 2007440: c4 06 20 08 ld [ %i0 + 8 ], %g2 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007444: 80 a0 a0 00 cmp %g2, 0 2007448: 02 80 00 0c be 2007478 <_TOD_Validate+0xc0> <== NEVER TAKEN 200744c: 80 88 e0 03 btst 3, %g3 2007450: 07 00 80 83 sethi %hi(0x2020c00), %g3 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007454: 12 80 00 03 bne 2007460 <_TOD_Validate+0xa8> 2007458: 86 10 e3 94 or %g3, 0x394, %g3 ! 2020f94 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 200745c: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2007460: 83 28 60 02 sll %g1, 2, %g1 2007464: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2007468: 80 a0 40 02 cmp %g1, %g2 200746c: b0 60 3f ff subx %g0, -1, %i0 2007470: 81 c7 e0 08 ret 2007474: 81 e8 00 00 restore if ( the_tod->day > days_in_month ) return false; return true; } 2007478: 81 c7 e0 08 ret 200747c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02007f50 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2007f50: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 2007f54: 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 ); 2007f58: 40 00 04 42 call 2009060 <_Thread_Set_transient> 2007f5c: 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 ) 2007f60: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2007f64: a0 10 00 18 mov %i0, %l0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 2007f68: 80 a0 40 19 cmp %g1, %i1 2007f6c: 02 80 00 04 be 2007f7c <_Thread_Change_priority+0x2c> 2007f70: 92 10 00 19 mov %i1, %o1 _Thread_Set_priority( the_thread, new_priority ); 2007f74: 40 00 03 be call 2008e6c <_Thread_Set_priority> 2007f78: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 2007f7c: 7f ff e8 12 call 2001fc4 2007f80: 01 00 00 00 nop 2007f84: 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; 2007f88: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 if ( state != STATES_TRANSIENT ) { 2007f8c: 80 a4 a0 04 cmp %l2, 4 2007f90: 02 80 00 10 be 2007fd0 <_Thread_Change_priority+0x80> 2007f94: a2 0c 60 04 and %l1, 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2007f98: 80 a4 60 00 cmp %l1, 0 2007f9c: 12 80 00 03 bne 2007fa8 <_Thread_Change_priority+0x58> <== NEVER TAKEN 2007fa0: 82 0c bf fb and %l2, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2007fa4: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 2007fa8: 7f ff e8 0b call 2001fd4 2007fac: 90 10 00 18 mov %i0, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2007fb0: 03 00 00 ef sethi %hi(0x3bc00), %g1 2007fb4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2007fb8: 80 8c 80 01 btst %l2, %g1 2007fbc: 02 80 00 5c be 200812c <_Thread_Change_priority+0x1dc> 2007fc0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2007fc4: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 2007fc8: 40 00 03 7c call 2008db8 <_Thread_queue_Requeue> 2007fcc: 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 ) ) { 2007fd0: 80 a4 60 00 cmp %l1, 0 2007fd4: 12 80 00 1c bne 2008044 <_Thread_Change_priority+0xf4> <== NEVER TAKEN 2007fd8: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 2007fdc: c4 04 20 90 ld [ %l0 + 0x90 ], %g2 2007fe0: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 2007fe4: c8 10 80 00 lduh [ %g2 ], %g4 _Priority_Major_bit_map |= the_priority_map->ready_major; 2007fe8: 03 00 80 73 sethi %hi(0x201cc00), %g1 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 2007fec: 86 11 00 03 or %g4, %g3, %g3 2007ff0: c6 30 80 00 sth %g3, [ %g2 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 2007ff4: c4 10 60 d4 lduh [ %g1 + 0xd4 ], %g2 2007ff8: c6 14 20 94 lduh [ %l0 + 0x94 ], %g3 * Interrupts are STILL disabled. * We now know the thread will be in the READY state when we remove * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2007ffc: c0 24 20 10 clr [ %l0 + 0x10 ] 2008000: 84 10 c0 02 or %g3, %g2, %g2 2008004: c4 30 60 d4 sth %g2, [ %g1 + 0xd4 ] _Priority_Add_to_bit_map( &the_thread->Priority_map ); if ( prepend_it ) 2008008: 80 8e a0 ff btst 0xff, %i2 200800c: 02 80 00 08 be 200802c <_Thread_Change_priority+0xdc> 2008010: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008014: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008018: c2 24 20 04 st %g1, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200801c: e0 20 40 00 st %l0, [ %g1 ] the_node->next = before_node; before_node->previous = the_node; 2008020: e0 20 a0 04 st %l0, [ %g2 + 4 ] Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; after_node->next = the_node; the_node->next = before_node; 2008024: 10 80 00 08 b 2008044 <_Thread_Change_priority+0xf4> 2008028: c4 24 00 00 st %g2, [ %l0 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 200802c: 84 00 60 04 add %g1, 4, %g2 2008030: c4 24 00 00 st %g2, [ %l0 ] old_last_node = the_chain->last; 2008034: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_chain->last = the_node; 2008038: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 200803c: c4 24 20 04 st %g2, [ %l0 + 4 ] Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 2008040: e0 20 80 00 st %l0, [ %g2 ] _Chain_Prepend_unprotected( the_thread->ready, &the_thread->Object.Node ); else _Chain_Append_unprotected( the_thread->ready, &the_thread->Object.Node ); } _ISR_Flash( level ); 2008044: 7f ff e7 e4 call 2001fd4 2008048: 90 10 00 18 mov %i0, %o0 200804c: 7f ff e7 de call 2001fc4 2008050: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2008054: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008058: c4 10 60 d4 lduh [ %g1 + 0xd4 ], %g2 ! 201ccd4 <_Priority_Major_bit_map> */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) _Thread_Ready_chain[ _Priority_Get_highest() ].first; 200805c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008060: 85 28 a0 10 sll %g2, 0x10, %g2 2008064: da 00 63 74 ld [ %g1 + 0x374 ], %o5 2008068: 87 30 a0 10 srl %g2, 0x10, %g3 200806c: 03 00 80 6c sethi %hi(0x201b000), %g1 2008070: 80 a0 e0 ff cmp %g3, 0xff 2008074: 18 80 00 05 bgu 2008088 <_Thread_Change_priority+0x138> 2008078: 82 10 60 a8 or %g1, 0xa8, %g1 200807c: c4 08 40 03 ldub [ %g1 + %g3 ], %g2 2008080: 10 80 00 04 b 2008090 <_Thread_Change_priority+0x140> 2008084: 84 00 a0 08 add %g2, 8, %g2 2008088: 85 30 a0 18 srl %g2, 0x18, %g2 200808c: c4 08 40 02 ldub [ %g1 + %g2 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2008090: 83 28 a0 10 sll %g2, 0x10, %g1 2008094: 07 00 80 73 sethi %hi(0x201cc00), %g3 2008098: 83 30 60 0f srl %g1, 0xf, %g1 200809c: 86 10 e1 50 or %g3, 0x150, %g3 20080a0: c6 10 c0 01 lduh [ %g3 + %g1 ], %g3 20080a4: 03 00 80 6c sethi %hi(0x201b000), %g1 20080a8: 87 28 e0 10 sll %g3, 0x10, %g3 20080ac: 89 30 e0 10 srl %g3, 0x10, %g4 20080b0: 80 a1 20 ff cmp %g4, 0xff 20080b4: 18 80 00 05 bgu 20080c8 <_Thread_Change_priority+0x178> 20080b8: 82 10 60 a8 or %g1, 0xa8, %g1 20080bc: c2 08 40 04 ldub [ %g1 + %g4 ], %g1 20080c0: 10 80 00 04 b 20080d0 <_Thread_Change_priority+0x180> 20080c4: 82 00 60 08 add %g1, 8, %g1 20080c8: 87 30 e0 18 srl %g3, 0x18, %g3 20080cc: c2 08 40 03 ldub [ %g1 + %g3 ], %g1 * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 20080d0: 83 28 60 10 sll %g1, 0x10, %g1 20080d4: 83 30 60 10 srl %g1, 0x10, %g1 20080d8: 85 28 a0 10 sll %g2, 0x10, %g2 20080dc: 85 30 a0 0c srl %g2, 0xc, %g2 20080e0: 84 00 40 02 add %g1, %g2, %g2 20080e4: 83 28 a0 04 sll %g2, 4, %g1 20080e8: 85 28 a0 02 sll %g2, 2, %g2 20080ec: 84 20 40 02 sub %g1, %g2, %g2 20080f0: c4 03 40 02 ld [ %o5 + %g2 ], %g2 * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 20080f4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20080f8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 201cce0 <_Thread_Executing> * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 20080fc: 07 00 80 73 sethi %hi(0x201cc00), %g3 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Thread_Calculate_heir(); if ( !_Thread_Is_executing_also_the_heir() && 2008100: 80 a0 40 02 cmp %g1, %g2 2008104: 02 80 00 08 be 2008124 <_Thread_Change_priority+0x1d4> 2008108: c4 20 e0 b0 st %g2, [ %g3 + 0xb0 ] _Thread_Executing->is_preemptible ) 200810c: c2 08 60 75 ldub [ %g1 + 0x75 ], %g1 2008110: 80 a0 60 00 cmp %g1, 0 2008114: 02 80 00 04 be 2008124 <_Thread_Change_priority+0x1d4> 2008118: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 200811c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008120: c4 28 60 f0 stb %g2, [ %g1 + 0xf0 ] ! 201ccf0 <_Context_Switch_necessary> _ISR_Enable( level ); 2008124: 7f ff e7 ac call 2001fd4 2008128: 81 e8 00 00 restore 200812c: 81 c7 e0 08 ret 2008130: 81 e8 00 00 restore =============================================================================== 02008134 <_Thread_Clear_state>: void _Thread_Clear_state( Thread_Control *the_thread, States_Control state ) { 2008134: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 2008138: 7f ff e7 a3 call 2001fc4 200813c: a0 10 00 18 mov %i0, %l0 2008140: b0 10 00 08 mov %o0, %i0 current_state = the_thread->current_state; 2008144: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & state ) { 2008148: 80 8e 40 01 btst %i1, %g1 200814c: 02 80 00 2d be 2008200 <_Thread_Clear_state+0xcc> 2008150: 01 00 00 00 nop RTEMS_INLINE_ROUTINE States_Control _States_Clear ( States_Control states_to_clear, States_Control current_state ) { return (current_state & ~states_to_clear); 2008154: b2 28 40 19 andn %g1, %i1, %i1 current_state = the_thread->current_state = _States_Clear( state, current_state ); if ( _States_Is_ready( current_state ) ) { 2008158: 80 a6 60 00 cmp %i1, 0 200815c: 12 80 00 29 bne 2008200 <_Thread_Clear_state+0xcc> 2008160: f2 24 20 10 st %i1, [ %l0 + 0x10 ] RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 2008164: c4 04 20 90 ld [ %l0 + 0x90 ], %g2 _Priority_Add_to_bit_map( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 2008168: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 200816c: c8 10 80 00 lduh [ %g2 ], %g4 2008170: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 2008174: 86 11 00 03 or %g4, %g3, %g3 2008178: c6 30 80 00 sth %g3, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 200817c: 84 00 60 04 add %g1, 4, %g2 _Priority_Major_bit_map |= the_priority_map->ready_major; 2008180: da 14 20 94 lduh [ %l0 + 0x94 ], %o5 2008184: c4 24 00 00 st %g2, [ %l0 ] 2008188: 07 00 80 73 sethi %hi(0x201cc00), %g3 old_last_node = the_chain->last; 200818c: c4 00 60 08 ld [ %g1 + 8 ], %g2 2008190: c8 10 e0 d4 lduh [ %g3 + 0xd4 ], %g4 the_chain->last = the_node; 2008194: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 2008198: c4 24 20 04 st %g2, [ %l0 + 4 ] 200819c: 82 13 40 04 or %o5, %g4, %g1 Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 20081a0: e0 20 80 00 st %l0, [ %g2 ] 20081a4: c2 30 e0 d4 sth %g1, [ %g3 + 0xd4 ] _ISR_Flash( level ); 20081a8: 7f ff e7 8b call 2001fd4 20081ac: 01 00 00 00 nop 20081b0: 7f ff e7 85 call 2001fc4 20081b4: 01 00 00 00 nop * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( the_thread->current_priority < _Thread_Heir->current_priority ) { 20081b8: 05 00 80 73 sethi %hi(0x201cc00), %g2 20081bc: c6 00 a0 b0 ld [ %g2 + 0xb0 ], %g3 ! 201ccb0 <_Thread_Heir> 20081c0: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 20081c4: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 20081c8: 80 a0 40 03 cmp %g1, %g3 20081cc: 1a 80 00 0d bcc 2008200 <_Thread_Clear_state+0xcc> 20081d0: 07 00 80 73 sethi %hi(0x201cc00), %g3 _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 20081d4: c6 00 e0 e0 ld [ %g3 + 0xe0 ], %g3 ! 201cce0 <_Thread_Executing> * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( the_thread->current_priority < _Thread_Heir->current_priority ) { _Thread_Heir = the_thread; 20081d8: e0 20 a0 b0 st %l0, [ %g2 + 0xb0 ] if ( _Thread_Executing->is_preemptible || 20081dc: c4 08 e0 75 ldub [ %g3 + 0x75 ], %g2 20081e0: 80 a0 a0 00 cmp %g2, 0 20081e4: 12 80 00 05 bne 20081f8 <_Thread_Clear_state+0xc4> 20081e8: 84 10 20 01 mov 1, %g2 20081ec: 80 a0 60 00 cmp %g1, 0 20081f0: 12 80 00 04 bne 2008200 <_Thread_Clear_state+0xcc> <== ALWAYS TAKEN 20081f4: 01 00 00 00 nop the_thread->current_priority == 0 ) _Context_Switch_necessary = true; 20081f8: 03 00 80 73 sethi %hi(0x201cc00), %g1 20081fc: c4 28 60 f0 stb %g2, [ %g1 + 0xf0 ] ! 201ccf0 <_Context_Switch_necessary> } } } _ISR_Enable( level ); 2008200: 7f ff e7 75 call 2001fd4 2008204: 81 e8 00 00 restore =============================================================================== 020083b8 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 20083b8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20083bc: 90 10 00 18 mov %i0, %o0 20083c0: 40 00 00 7c call 20085b0 <_Thread_Get> 20083c4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20083c8: c2 07 bf fc ld [ %fp + -4 ], %g1 20083cc: 80 a0 60 00 cmp %g1, 0 20083d0: 12 80 00 08 bne 20083f0 <_Thread_Delay_ended+0x38> <== NEVER TAKEN 20083d4: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 20083d8: 7f ff ff 57 call 2008134 <_Thread_Clear_state> 20083dc: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 20083e0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20083e4: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201cc20 <_Thread_Dispatch_disable_level> 20083e8: 84 00 bf ff add %g2, -1, %g2 20083ec: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 20083f0: 81 c7 e0 08 ret 20083f4: 81 e8 00 00 restore =============================================================================== 020083f8 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 20083f8: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 20083fc: 2f 00 80 73 sethi %hi(0x201cc00), %l7 _ISR_Disable( level ); 2008400: 7f ff e6 f1 call 2001fc4 2008404: e0 05 e0 e0 ld [ %l7 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> while ( _Context_Switch_necessary == true ) { 2008408: 2d 00 80 73 sethi %hi(0x201cc00), %l6 200840c: 33 00 80 73 sethi %hi(0x201cc00), %i1 heir = _Thread_Heir; 2008410: 35 00 80 73 sethi %hi(0x201cc00), %i2 #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; 2008414: 37 00 80 72 sethi %hi(0x201c800), %i3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008418: 25 00 80 73 sethi %hi(0x201cc00), %l2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200841c: 39 00 80 73 sethi %hi(0x201cc00), %i4 #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 ); 2008420: 2b 00 80 73 sethi %hi(0x201cc00), %l5 _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; _Context_Switch_necessary = false; _Thread_Executing = heir; 2008424: ae 15 e0 e0 or %l7, 0xe0, %l7 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { 2008428: ac 15 a0 f0 or %l6, 0xf0, %l6 heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 200842c: b2 16 60 20 or %i1, 0x20, %i1 ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { heir = _Thread_Heir; 2008430: b4 16 a0 b0 or %i2, 0xb0, %i2 #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; 2008434: b6 16 e3 78 or %i3, 0x378, %i3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008438: a4 14 a0 e8 or %l2, 0xe8, %l2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200843c: b8 17 20 ac or %i4, 0xac, %i4 2008440: aa 15 60 a8 or %l5, 0xa8, %l5 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 2008444: ba 10 20 01 mov 1, %i5 _ISR_Enable( level ); #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008448: a8 07 bf f8 add %fp, -8, %l4 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { 200844c: 10 80 00 37 b 2008528 <_Thread_Dispatch+0x130> 2008450: a6 07 bf f0 add %fp, -16, %l3 heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 2008454: fa 26 40 00 st %i5, [ %i1 ] _Thread_Executing = heir; #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 ) 2008458: c2 04 60 7c ld [ %l1 + 0x7c ], %g1 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; _Context_Switch_necessary = false; 200845c: c0 2d 80 00 clrb [ %l6 ] _Thread_Executing = heir; #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 ) 2008460: 80 a0 60 01 cmp %g1, 1 2008464: 12 80 00 04 bne 2008474 <_Thread_Dispatch+0x7c> 2008468: e2 25 c0 00 st %l1, [ %l7 ] heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200846c: c2 06 c0 00 ld [ %i3 ], %g1 2008470: c2 24 60 78 st %g1, [ %l1 + 0x78 ] _ISR_Enable( level ); 2008474: 7f ff e6 d8 call 2001fd4 2008478: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 200847c: 40 00 11 e3 call 200cc08 <_TOD_Get_uptime> 2008480: 90 10 00 14 mov %l4, %o0 _Timestamp_Subtract( 2008484: 90 10 00 12 mov %l2, %o0 2008488: 92 10 00 14 mov %l4, %o1 200848c: 40 00 03 c5 call 20093a0 <_Timespec_Subtract> 2008490: 94 10 00 13 mov %l3, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008494: 90 04 20 84 add %l0, 0x84, %o0 2008498: 40 00 03 a8 call 2009338 <_Timespec_Add_to> 200849c: 92 10 00 13 mov %l3, %o1 _Thread_Time_of_last_context_switch = uptime; 20084a0: c4 07 bf f8 ld [ %fp + -8 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20084a4: 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; 20084a8: c4 24 80 00 st %g2, [ %l2 ] 20084ac: c4 07 bf fc ld [ %fp + -4 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 20084b0: 80 a0 60 00 cmp %g1, 0 20084b4: 02 80 00 06 be 20084cc <_Thread_Dispatch+0xd4> <== NEVER TAKEN 20084b8: c4 24 a0 04 st %g2, [ %l2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 20084bc: c4 00 40 00 ld [ %g1 ], %g2 20084c0: c4 24 21 5c st %g2, [ %l0 + 0x15c ] *_Thread_libc_reent = heir->libc_reent; 20084c4: c4 04 61 5c ld [ %l1 + 0x15c ], %g2 20084c8: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 20084cc: 90 10 00 10 mov %l0, %o0 20084d0: 40 00 04 69 call 2009674 <_User_extensions_Thread_switch> 20084d4: 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 ); 20084d8: 92 04 60 d0 add %l1, 0xd0, %o1 20084dc: 40 00 05 96 call 2009b34 <_CPU_Context_switch> 20084e0: 90 04 20 d0 add %l0, 0xd0, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 20084e4: c2 04 21 58 ld [ %l0 + 0x158 ], %g1 20084e8: 80 a0 60 00 cmp %g1, 0 20084ec: 02 80 00 0d be 2008520 <_Thread_Dispatch+0x128> 20084f0: 01 00 00 00 nop 20084f4: d0 05 40 00 ld [ %l5 ], %o0 20084f8: 80 a4 00 08 cmp %l0, %o0 20084fc: 02 80 00 09 be 2008520 <_Thread_Dispatch+0x128> 2008500: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008504: 02 80 00 04 be 2008514 <_Thread_Dispatch+0x11c> 2008508: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200850c: 40 00 05 50 call 2009a4c <_CPU_Context_save_fp> 2008510: 90 02 21 58 add %o0, 0x158, %o0 _Context_Restore_fp( &executing->fp_context ); 2008514: 40 00 05 6b call 2009ac0 <_CPU_Context_restore_fp> 2008518: 90 04 21 58 add %l0, 0x158, %o0 _Thread_Allocated_fp = executing; 200851c: e0 25 40 00 st %l0, [ %l5 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2008520: 7f ff e6 a9 call 2001fc4 2008524: e0 05 c0 00 ld [ %l7 ], %l0 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { 2008528: c2 0d 80 00 ldub [ %l6 ], %g1 200852c: 80 a0 60 00 cmp %g1, 0 2008530: 32 bf ff c9 bne,a 2008454 <_Thread_Dispatch+0x5c> 2008534: e2 06 80 00 ld [ %i2 ], %l1 executing = _Thread_Executing; _ISR_Disable( level ); } _Thread_Dispatch_disable_level = 0; 2008538: 03 00 80 73 sethi %hi(0x201cc00), %g1 200853c: c0 20 60 20 clr [ %g1 + 0x20 ] ! 201cc20 <_Thread_Dispatch_disable_level> _ISR_Enable( level ); 2008540: 7f ff e6 a5 call 2001fd4 2008544: 01 00 00 00 nop if ( _Thread_Do_post_task_switch_extension || 2008548: 03 00 80 73 sethi %hi(0x201cc00), %g1 200854c: c2 00 60 c4 ld [ %g1 + 0xc4 ], %g1 ! 201ccc4 <_Thread_Do_post_task_switch_extension> 2008550: 80 a0 60 00 cmp %g1, 0 2008554: 12 80 00 06 bne 200856c <_Thread_Dispatch+0x174> <== NEVER TAKEN 2008558: 01 00 00 00 nop executing->do_post_task_switch_extension ) { 200855c: c2 0c 20 74 ldub [ %l0 + 0x74 ], %g1 2008560: 80 a0 60 00 cmp %g1, 0 2008564: 02 80 00 04 be 2008574 <_Thread_Dispatch+0x17c> 2008568: 01 00 00 00 nop executing->do_post_task_switch_extension = false; _API_extensions_Run_postswitch(); 200856c: 7f ff f9 7d call 2006b60 <_API_extensions_Run_postswitch> 2008570: c0 2c 20 74 clrb [ %l0 + 0x74 ] 2008574: 81 c7 e0 08 ret 2008578: 81 e8 00 00 restore =============================================================================== 0200f298 <_Thread_Evaluate_mode>: bool _Thread_Evaluate_mode( void ) { Thread_Control *executing; executing = _Thread_Executing; 200f298: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f29c: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 ! 201cce0 <_Thread_Executing> if ( !_States_Is_ready( executing->current_state ) || 200f2a0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200f2a4: 80 a0 a0 00 cmp %g2, 0 200f2a8: 12 80 00 0b bne 200f2d4 <_Thread_Evaluate_mode+0x3c> <== NEVER TAKEN 200f2ac: 84 10 20 01 mov 1, %g2 200f2b0: 05 00 80 73 sethi %hi(0x201cc00), %g2 200f2b4: c4 00 a0 b0 ld [ %g2 + 0xb0 ], %g2 ! 201ccb0 <_Thread_Heir> 200f2b8: 80 a0 40 02 cmp %g1, %g2 200f2bc: 02 80 00 0b be 200f2e8 <_Thread_Evaluate_mode+0x50> 200f2c0: 01 00 00 00 nop ( !_Thread_Is_heir( executing ) && executing->is_preemptible ) ) { 200f2c4: c2 08 60 75 ldub [ %g1 + 0x75 ], %g1 200f2c8: 80 a0 60 00 cmp %g1, 0 200f2cc: 02 80 00 07 be 200f2e8 <_Thread_Evaluate_mode+0x50> <== NEVER TAKEN 200f2d0: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 200f2d4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f2d8: 90 10 20 01 mov 1, %o0 200f2dc: c4 28 60 f0 stb %g2, [ %g1 + 0xf0 ] return true; 200f2e0: 81 c3 e0 08 retl 200f2e4: 01 00 00 00 nop } return false; } 200f2e8: 81 c3 e0 08 retl 200f2ec: 90 10 20 00 clr %o0 ! 0 =============================================================================== 0200f2f0 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200f2f0: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200f2f4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f2f8: e0 00 60 e0 ld [ %g1 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> /* * 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(); 200f2fc: 3f 00 80 3c sethi %hi(0x200f000), %i7 200f300: be 17 e2 f0 or %i7, 0x2f0, %i7 ! 200f2f0 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f304: d0 04 20 b8 ld [ %l0 + 0xb8 ], %o0 _ISR_Set_level(level); 200f308: 7f ff cb 33 call 2001fd4 200f30c: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f310: 03 00 80 72 sethi %hi(0x201c800), %g1 doneConstructors = 1; 200f314: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200f318: e2 08 60 d6 ldub [ %g1 + 0xd6 ], %l1 doneConstructors = 1; 200f31c: c4 28 60 d6 stb %g2, [ %g1 + 0xd6 ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f320: c2 04 21 58 ld [ %l0 + 0x158 ], %g1 200f324: 80 a0 60 00 cmp %g1, 0 200f328: 02 80 00 0c be 200f358 <_Thread_Handler+0x68> 200f32c: 03 00 80 73 sethi %hi(0x201cc00), %g1 #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 ); 200f330: d0 00 60 a8 ld [ %g1 + 0xa8 ], %o0 ! 201cca8 <_Thread_Allocated_fp> 200f334: 80 a4 00 08 cmp %l0, %o0 200f338: 02 80 00 08 be 200f358 <_Thread_Handler+0x68> 200f33c: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f340: 22 80 00 06 be,a 200f358 <_Thread_Handler+0x68> 200f344: e0 20 60 a8 st %l0, [ %g1 + 0xa8 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f348: 7f ff e9 c1 call 2009a4c <_CPU_Context_save_fp> 200f34c: 90 02 21 58 add %o0, 0x158, %o0 _Thread_Allocated_fp = executing; 200f350: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f354: e0 20 60 a8 st %l0, [ %g1 + 0xa8 ] ! 201cca8 <_Thread_Allocated_fp> /* * 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 ); 200f358: 7f ff e8 54 call 20094a8 <_User_extensions_Thread_begin> 200f35c: 90 10 00 10 mov %l0, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f360: 7f ff e4 87 call 200857c <_Thread_Enable_dispatch> 200f364: a3 2c 60 18 sll %l1, 0x18, %l1 /* * _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) */ { 200f368: 80 a4 60 00 cmp %l1, 0 200f36c: 32 80 00 05 bne,a 200f380 <_Thread_Handler+0x90> 200f370: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 INIT_NAME (); 200f374: 40 00 33 3d call 201c068 <_init> 200f378: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f37c: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 200f380: 80 a0 60 00 cmp %g1, 0 200f384: 12 80 00 06 bne 200f39c <_Thread_Handler+0xac> <== NEVER TAKEN 200f388: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f38c: c2 04 20 9c ld [ %l0 + 0x9c ], %g1 200f390: 9f c0 40 00 call %g1 200f394: d0 04 20 a8 ld [ %l0 + 0xa8 ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200f398: d0 24 20 28 st %o0, [ %l0 + 0x28 ] * 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 ); 200f39c: 7f ff e8 54 call 20094ec <_User_extensions_Thread_exitted> 200f3a0: 90 10 00 10 mov %l0, %o0 _Internal_error_Occurred( 200f3a4: 90 10 20 00 clr %o0 200f3a8: 92 10 20 01 mov 1, %o1 200f3ac: 7f ff e0 91 call 20075f0 <_Internal_error_Occurred> 200f3b0: 94 10 20 06 mov 6, %o2 =============================================================================== 0200865c <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200865c: 9d e3 bf a0 save %sp, -96, %sp 2008660: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 2008664: c0 26 61 60 clr [ %i1 + 0x160 ] Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008668: e0 00 40 00 ld [ %g1 ], %l0 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 200866c: c0 26 61 64 clr [ %i1 + 0x164 ] 2008670: c0 26 61 68 clr [ %i1 + 0x168 ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008674: c0 26 61 5c clr [ %i1 + 0x15c ] Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008678: e2 0f a0 5f ldub [ %fp + 0x5f ], %l1 /* * 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 ); 200867c: 90 10 00 19 mov %i1, %o0 2008680: 40 00 02 9d call 20090f4 <_Thread_Stack_Allocate> 2008684: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008688: 80 a2 00 1b cmp %o0, %i3 200868c: 0a 80 00 04 bcs 200869c <_Thread_Initialize+0x40> 2008690: 80 a2 20 00 cmp %o0, 0 2008694: 32 80 00 04 bne,a 20086a4 <_Thread_Initialize+0x48> <== ALWAYS TAKEN 2008698: c2 06 60 cc ld [ %i1 + 0xcc ], %g1 200869c: 81 c7 e0 08 ret 20086a0: 91 e8 20 00 restore %g0, 0, %o0 void *starting_address, size_t size ) { the_stack->area = starting_address; the_stack->size = size; 20086a4: d0 26 60 c0 st %o0, [ %i1 + 0xc0 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20086a8: c2 26 60 c4 st %g1, [ %i1 + 0xc4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 20086ac: 80 8f 20 ff btst 0xff, %i4 20086b0: 02 80 00 08 be 20086d0 <_Thread_Initialize+0x74> 20086b4: a4 10 20 00 clr %l2 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 20086b8: 90 10 20 88 mov 0x88, %o0 20086bc: 40 00 04 bb call 20099a8 <_Workspace_Allocate> 20086c0: b6 10 20 00 clr %i3 if ( !fp_area ) 20086c4: a4 92 20 00 orcc %o0, 0, %l2 20086c8: 22 80 00 3e be,a 20087c0 <_Thread_Initialize+0x164> 20086cc: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20086d0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20086d4: d0 00 60 c0 ld [ %g1 + 0xc0 ], %o0 ! 201ccc0 <_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; 20086d8: e4 26 61 58 st %l2, [ %i1 + 0x158 ] the_thread->Start.fp_context = fp_area; 20086dc: e4 26 60 c8 st %l2, [ %i1 + 0xc8 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20086e0: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 20086e4: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 20086e8: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 20086ec: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20086f0: 80 a2 20 00 cmp %o0, 0 20086f4: 02 80 00 08 be 2008714 <_Thread_Initialize+0xb8> 20086f8: b6 10 20 00 clr %i3 extensions_area = _Workspace_Allocate( 20086fc: 90 02 20 01 inc %o0 2008700: 40 00 04 aa call 20099a8 <_Workspace_Allocate> 2008704: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008708: b6 92 20 00 orcc %o0, 0, %i3 200870c: 22 80 00 2d be,a 20087c0 <_Thread_Initialize+0x164> 2008710: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 * if they are linked to the thread. An extension user may * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { 2008714: 80 a6 e0 00 cmp %i3, 0 2008718: 02 80 00 0c be 2008748 <_Thread_Initialize+0xec> 200871c: f6 26 61 6c st %i3, [ %i1 + 0x16c ] for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008720: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008724: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201ccc0 <_Thread_Maximum_extensions> 2008728: 10 80 00 05 b 200873c <_Thread_Initialize+0xe0> 200872c: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 2008730: 87 28 60 02 sll %g1, 2, %g3 * 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++ ) 2008734: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 2008738: c0 21 00 03 clr [ %g4 + %g3 ] * 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++ ) 200873c: 80 a0 40 02 cmp %g1, %g2 2008740: 28 bf ff fc bleu,a 2008730 <_Thread_Initialize+0xd4> 2008744: c8 06 61 6c ld [ %i1 + 0x16c ], %g4 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2008748: c2 07 a0 60 ld [ %fp + 0x60 ], %g1 #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 200874c: 92 10 00 1d mov %i5, %o1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2008750: c2 26 60 b0 st %g1, [ %i1 + 0xb0 ] the_thread->Start.budget_callout = budget_callout; 2008754: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 2008758: 90 10 00 19 mov %i1, %o0 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 200875c: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008760: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008764: e2 2e 60 ac stb %l1, [ %i1 + 0xac ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008768: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] the_thread->current_state = STATES_DORMANT; 200876c: 82 10 20 01 mov 1, %g1 the_thread->Wait.queue = NULL; 2008770: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2008774: c2 26 60 10 st %g1, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008778: c0 26 60 1c clr [ %i1 + 0x1c ] #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; 200877c: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 2008780: 40 00 01 bb call 2008e6c <_Thread_Set_priority> 2008784: fa 26 60 bc st %i5, [ %i1 + 0xbc ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008788: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 200878c: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 2008790: 83 28 60 02 sll %g1, 2, %g1 information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008794: e0 26 60 0c st %l0, [ %i1 + 0xc ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008798: f2 20 80 01 st %i1, [ %g2 + %g1 ] /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 200879c: c0 26 60 84 clr [ %i1 + 0x84 ] 20087a0: c0 26 60 88 clr [ %i1 + 0x88 ] * 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 ); 20087a4: 90 10 00 19 mov %i1, %o0 20087a8: 40 00 03 75 call 200957c <_User_extensions_Thread_create> 20087ac: b0 10 20 01 mov 1, %i0 if ( extension_status ) 20087b0: 80 8a 20 ff btst 0xff, %o0 20087b4: 12 80 00 27 bne 2008850 <_Thread_Initialize+0x1f4> 20087b8: 01 00 00 00 nop return true; failed: if ( the_thread->libc_reent ) 20087bc: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 20087c0: 80 a2 20 00 cmp %o0, 0 20087c4: 22 80 00 05 be,a 20087d8 <_Thread_Initialize+0x17c> 20087c8: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 _Workspace_Free( the_thread->libc_reent ); 20087cc: 40 00 04 80 call 20099cc <_Workspace_Free> 20087d0: 01 00 00 00 nop for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 20087d4: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 20087d8: 80 a2 20 00 cmp %o0, 0 20087dc: 22 80 00 05 be,a 20087f0 <_Thread_Initialize+0x194> 20087e0: d0 06 61 64 ld [ %i1 + 0x164 ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 20087e4: 40 00 04 7a call 20099cc <_Workspace_Free> 20087e8: 01 00 00 00 nop failed: if ( the_thread->libc_reent ) _Workspace_Free( the_thread->libc_reent ); for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 20087ec: d0 06 61 64 ld [ %i1 + 0x164 ], %o0 20087f0: 80 a2 20 00 cmp %o0, 0 20087f4: 22 80 00 05 be,a 2008808 <_Thread_Initialize+0x1ac> <== ALWAYS TAKEN 20087f8: d0 06 61 68 ld [ %i1 + 0x168 ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 20087fc: 40 00 04 74 call 20099cc <_Workspace_Free> <== NOT EXECUTED 2008800: 01 00 00 00 nop <== NOT EXECUTED failed: if ( the_thread->libc_reent ) _Workspace_Free( the_thread->libc_reent ); for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 2008804: d0 06 61 68 ld [ %i1 + 0x168 ], %o0 <== NOT EXECUTED 2008808: 80 a2 20 00 cmp %o0, 0 200880c: 02 80 00 05 be 2008820 <_Thread_Initialize+0x1c4> <== ALWAYS TAKEN 2008810: 80 a6 e0 00 cmp %i3, 0 _Workspace_Free( the_thread->API_Extensions[i] ); 2008814: 40 00 04 6e call 20099cc <_Workspace_Free> <== NOT EXECUTED 2008818: 01 00 00 00 nop <== NOT EXECUTED if ( extensions_area ) 200881c: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 2008820: 02 80 00 05 be 2008834 <_Thread_Initialize+0x1d8> 2008824: 80 a4 a0 00 cmp %l2, 0 (void) _Workspace_Free( extensions_area ); 2008828: 40 00 04 69 call 20099cc <_Workspace_Free> 200882c: 90 10 00 1b mov %i3, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( fp_area ) 2008830: 80 a4 a0 00 cmp %l2, 0 2008834: 02 80 00 05 be 2008848 <_Thread_Initialize+0x1ec> 2008838: 90 10 00 19 mov %i1, %o0 (void) _Workspace_Free( fp_area ); 200883c: 40 00 04 64 call 20099cc <_Workspace_Free> 2008840: 90 10 00 12 mov %l2, %o0 #endif _Thread_Stack_Free( the_thread ); 2008844: 90 10 00 19 mov %i1, %o0 2008848: 40 00 02 42 call 2009150 <_Thread_Stack_Free> 200884c: b0 10 20 00 clr %i0 return false; } 2008850: 81 c7 e0 08 ret 2008854: 81 e8 00 00 restore =============================================================================== 0200d45c <_Thread_Reset_timeslice>: * ready chain * select heir */ void _Thread_Reset_timeslice( void ) { 200d45c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 200d460: 03 00 80 73 sethi %hi(0x201cc00), %g1 200d464: e0 00 60 e0 ld [ %g1 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> ready = executing->ready; _ISR_Disable( level ); 200d468: 7f ff d2 d7 call 2001fc4 200d46c: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 200d470: b0 10 00 08 mov %o0, %i0 if ( _Chain_Has_only_one_node( ready ) ) { 200d474: c4 04 40 00 ld [ %l1 ], %g2 200d478: c2 04 60 08 ld [ %l1 + 8 ], %g1 200d47c: 80 a0 80 01 cmp %g2, %g1 200d480: 02 80 00 19 be 200d4e4 <_Thread_Reset_timeslice+0x88> 200d484: 86 04 60 04 add %l1, 4, %g3 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200d488: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 200d48c: c4 04 20 04 ld [ %l0 + 4 ], %g2 next->previous = previous; previous->next = next; 200d490: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 200d494: c6 24 00 00 st %g3, [ %l0 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 200d498: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 200d49c: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_chain->last = the_node; 200d4a0: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 200d4a4: c2 24 20 04 st %g1, [ %l0 + 4 ] Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 200d4a8: e0 20 40 00 st %l0, [ %g1 ] return; } _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 200d4ac: 7f ff d2 ca call 2001fd4 200d4b0: 01 00 00 00 nop 200d4b4: 7f ff d2 c4 call 2001fc4 200d4b8: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 200d4bc: 03 00 80 73 sethi %hi(0x201cc00), %g1 200d4c0: c4 00 60 b0 ld [ %g1 + 0xb0 ], %g2 ! 201ccb0 <_Thread_Heir> 200d4c4: 80 a4 00 02 cmp %l0, %g2 200d4c8: 12 80 00 05 bne 200d4dc <_Thread_Reset_timeslice+0x80> <== NEVER TAKEN 200d4cc: 84 10 20 01 mov 1, %g2 _Thread_Heir = (Thread_Control *) ready->first; 200d4d0: c4 04 40 00 ld [ %l1 ], %g2 200d4d4: c4 20 60 b0 st %g2, [ %g1 + 0xb0 ] _Context_Switch_necessary = true; 200d4d8: 84 10 20 01 mov 1, %g2 200d4dc: 03 00 80 73 sethi %hi(0x201cc00), %g1 200d4e0: c4 28 60 f0 stb %g2, [ %g1 + 0xf0 ] ! 201ccf0 <_Context_Switch_necessary> _ISR_Enable( level ); 200d4e4: 7f ff d2 bc call 2001fd4 200d4e8: 81 e8 00 00 restore =============================================================================== 0200c5d4 <_Thread_Resume>: void _Thread_Resume( Thread_Control *the_thread, bool force ) { 200c5d4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 200c5d8: 7f ff d6 cb call 2002104 200c5dc: a0 10 00 18 mov %i0, %l0 200c5e0: b0 10 00 08 mov %o0, %i0 _ISR_Enable( level ); return; } #endif current_state = the_thread->current_state; 200c5e4: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & STATES_SUSPENDED ) { 200c5e8: 80 88 60 02 btst 2, %g1 200c5ec: 02 80 00 2c be 200c69c <_Thread_Resume+0xc8> <== NEVER TAKEN 200c5f0: 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 ) ) { 200c5f4: 80 a0 60 00 cmp %g1, 0 200c5f8: 12 80 00 29 bne 200c69c <_Thread_Resume+0xc8> 200c5fc: c2 24 20 10 st %g1, [ %l0 + 0x10 ] RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 200c600: c4 04 20 90 ld [ %l0 + 0x90 ], %g2 _Priority_Add_to_bit_map( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 200c604: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 200c608: c8 10 80 00 lduh [ %g2 ], %g4 200c60c: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 200c610: 86 11 00 03 or %g4, %g3, %g3 200c614: c6 30 80 00 sth %g3, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 200c618: 84 00 60 04 add %g1, 4, %g2 _Priority_Major_bit_map |= the_priority_map->ready_major; 200c61c: da 14 20 94 lduh [ %l0 + 0x94 ], %o5 200c620: c4 24 00 00 st %g2, [ %l0 ] 200c624: 07 00 80 81 sethi %hi(0x2020400), %g3 old_last_node = the_chain->last; 200c628: c4 00 60 08 ld [ %g1 + 8 ], %g2 200c62c: c8 10 e3 d4 lduh [ %g3 + 0x3d4 ], %g4 the_chain->last = the_node; 200c630: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 200c634: c4 24 20 04 st %g2, [ %l0 + 4 ] 200c638: 82 13 40 04 or %o5, %g4, %g1 Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 200c63c: e0 20 80 00 st %l0, [ %g2 ] 200c640: c2 30 e3 d4 sth %g1, [ %g3 + 0x3d4 ] _ISR_Flash( level ); 200c644: 7f ff d6 b4 call 2002114 200c648: 01 00 00 00 nop 200c64c: 7f ff d6 ae call 2002104 200c650: 01 00 00 00 nop if ( the_thread->current_priority < _Thread_Heir->current_priority ) { 200c654: 05 00 80 81 sethi %hi(0x2020400), %g2 200c658: c6 00 a3 b0 ld [ %g2 + 0x3b0 ], %g3 ! 20207b0 <_Thread_Heir> 200c65c: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 200c660: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 200c664: 80 a0 40 03 cmp %g1, %g3 200c668: 1a 80 00 0d bcc 200c69c <_Thread_Resume+0xc8> 200c66c: 07 00 80 81 sethi %hi(0x2020400), %g3 _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200c670: c6 00 e3 e0 ld [ %g3 + 0x3e0 ], %g3 ! 20207e0 <_Thread_Executing> _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); _ISR_Flash( level ); if ( the_thread->current_priority < _Thread_Heir->current_priority ) { _Thread_Heir = the_thread; 200c674: e0 20 a3 b0 st %l0, [ %g2 + 0x3b0 ] if ( _Thread_Executing->is_preemptible || 200c678: c4 08 e0 75 ldub [ %g3 + 0x75 ], %g2 200c67c: 80 a0 a0 00 cmp %g2, 0 200c680: 12 80 00 05 bne 200c694 <_Thread_Resume+0xc0> 200c684: 84 10 20 01 mov 1, %g2 200c688: 80 a0 60 00 cmp %g1, 0 200c68c: 12 80 00 04 bne 200c69c <_Thread_Resume+0xc8> <== ALWAYS TAKEN 200c690: 01 00 00 00 nop the_thread->current_priority == 0 ) _Context_Switch_necessary = true; 200c694: 03 00 80 81 sethi %hi(0x2020400), %g1 200c698: c4 28 63 f0 stb %g2, [ %g1 + 0x3f0 ] ! 20207f0 <_Context_Switch_necessary> } } } _ISR_Enable( level ); 200c69c: 7f ff d6 9e call 2002114 200c6a0: 81 e8 00 00 restore =============================================================================== 02009294 <_Thread_Yield_processor>: * ready chain * select heir */ void _Thread_Yield_processor( void ) { 2009294: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 2009298: 03 00 80 73 sethi %hi(0x201cc00), %g1 200929c: e0 00 60 e0 ld [ %g1 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> ready = executing->ready; _ISR_Disable( level ); 20092a0: 7f ff e3 49 call 2001fc4 20092a4: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 20092a8: b0 10 00 08 mov %o0, %i0 if ( !_Chain_Has_only_one_node( ready ) ) { 20092ac: c4 04 40 00 ld [ %l1 ], %g2 20092b0: c2 04 60 08 ld [ %l1 + 8 ], %g1 20092b4: 80 a0 80 01 cmp %g2, %g1 20092b8: 02 80 00 17 be 2009314 <_Thread_Yield_processor+0x80> 20092bc: 25 00 80 73 sethi %hi(0x201cc00), %l2 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 20092c0: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 20092c4: c4 04 20 04 ld [ %l0 + 4 ], %g2 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 20092c8: 86 04 60 04 add %l1, 4, %g3 Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; previous->next = next; 20092cc: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 20092d0: c6 24 00 00 st %g3, [ %l0 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 20092d4: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 20092d8: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_chain->last = the_node; 20092dc: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 20092e0: c2 24 20 04 st %g1, [ %l0 + 4 ] Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 20092e4: e0 20 40 00 st %l0, [ %g1 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 20092e8: 7f ff e3 3b call 2001fd4 20092ec: 01 00 00 00 nop 20092f0: 7f ff e3 35 call 2001fc4 20092f4: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 20092f8: c2 04 a0 b0 ld [ %l2 + 0xb0 ], %g1 20092fc: 80 a4 00 01 cmp %l0, %g1 2009300: 12 80 00 09 bne 2009324 <_Thread_Yield_processor+0x90> <== NEVER TAKEN 2009304: 84 10 20 01 mov 1, %g2 _Thread_Heir = (Thread_Control *) ready->first; 2009308: c2 04 40 00 ld [ %l1 ], %g1 200930c: 10 80 00 06 b 2009324 <_Thread_Yield_processor+0x90> 2009310: c2 24 a0 b0 st %g1, [ %l2 + 0xb0 ] _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 2009314: c2 04 a0 b0 ld [ %l2 + 0xb0 ], %g1 2009318: 80 a4 00 01 cmp %l0, %g1 200931c: 02 80 00 04 be 200932c <_Thread_Yield_processor+0x98> <== ALWAYS TAKEN 2009320: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 2009324: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009328: c4 28 60 f0 stb %g2, [ %g1 + 0xf0 ] ! 201ccf0 <_Context_Switch_necessary> _ISR_Enable( level ); 200932c: 7f ff e3 2a call 2001fd4 2009330: 81 e8 00 00 restore =============================================================================== 02008b74 <_Thread_queue_Enqueue_priority>: Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 2008b74: 9d e3 bf a0 save %sp, -96, %sp Priority_Control priority; States_Control block_state; _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; 2008b78: e0 06 60 14 ld [ %i1 + 0x14 ], %l0 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2008b7c: 82 06 60 3c add %i1, 0x3c, %g1 the_chain->permanent_null = NULL; 2008b80: c0 26 60 3c clr [ %i1 + 0x3c ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2008b84: c2 26 60 38 st %g1, [ %i1 + 0x38 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2008b88: 82 06 60 38 add %i1, 0x38, %g1 2008b8c: c2 26 60 40 st %g1, [ %i1 + 0x40 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2008b90: 2d 00 80 70 sethi %hi(0x201c000), %l6 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008b94: 83 34 20 06 srl %l0, 6, %g1 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2008b98: 80 8c 20 20 btst 0x20, %l0 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008b9c: a7 28 60 04 sll %g1, 4, %l3 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2008ba0: ac 15 a1 64 or %l6, 0x164, %l6 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008ba4: 83 28 60 02 sll %g1, 2, %g1 block_state = the_thread_queue->state; 2008ba8: ea 06 20 38 ld [ %i0 + 0x38 ], %l5 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008bac: a6 24 c0 01 sub %l3, %g1, %l3 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2008bb0: 12 80 00 23 bne 2008c3c <_Thread_queue_Enqueue_priority+0xc8> 2008bb4: a6 06 00 13 add %i0, %l3, %l3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 2008bb8: ac 04 e0 04 add %l3, 4, %l6 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 2008bbc: 7f ff e5 02 call 2001fc4 2008bc0: 01 00 00 00 nop 2008bc4: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->first; 2008bc8: a8 10 3f ff mov -1, %l4 while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008bcc: 10 80 00 10 b 2008c0c <_Thread_queue_Enqueue_priority+0x98> 2008bd0: e2 04 c0 00 ld [ %l3 ], %l1 search_priority = search_thread->current_priority; if ( priority <= search_priority ) 2008bd4: 80 a4 00 14 cmp %l0, %l4 2008bd8: 28 80 00 11 bleu,a 2008c1c <_Thread_queue_Enqueue_priority+0xa8> 2008bdc: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 2008be0: 7f ff e4 fd call 2001fd4 2008be4: 90 10 00 12 mov %l2, %o0 2008be8: 7f ff e4 f7 call 2001fc4 2008bec: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008bf0: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 2008bf4: 80 8d 40 01 btst %l5, %g1 2008bf8: 32 80 00 05 bne,a 2008c0c <_Thread_queue_Enqueue_priority+0x98><== ALWAYS TAKEN 2008bfc: e2 04 40 00 ld [ %l1 ], %l1 _ISR_Enable( level ); 2008c00: 7f ff e4 f5 call 2001fd4 <== NOT EXECUTED 2008c04: 90 10 00 12 mov %l2, %o0 <== NOT EXECUTED goto restart_forward_search; 2008c08: 30 bf ff ed b,a 2008bbc <_Thread_queue_Enqueue_priority+0x48><== NOT EXECUTED restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) header->first; while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008c0c: 80 a4 40 16 cmp %l1, %l6 2008c10: 32 bf ff f1 bne,a 2008bd4 <_Thread_queue_Enqueue_priority+0x60> 2008c14: e8 04 60 14 ld [ %l1 + 0x14 ], %l4 } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2008c18: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2008c1c: 80 a0 60 01 cmp %g1, 1 2008c20: 12 80 00 37 bne 2008cfc <_Thread_queue_Enqueue_priority+0x188> 2008c24: 90 10 00 12 mov %l2, %o0 THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2008c28: 80 a4 00 14 cmp %l0, %l4 2008c2c: 12 80 00 2a bne 2008cd4 <_Thread_queue_Enqueue_priority+0x160> 2008c30: c0 26 20 30 clr [ %i0 + 0x30 ] 2008c34: 10 80 00 28 b 2008cd4 <_Thread_queue_Enqueue_priority+0x160> 2008c38: a2 04 60 3c add %l1, 0x3c, %l1 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 2008c3c: 7f ff e4 e2 call 2001fc4 2008c40: e8 0d 80 00 ldub [ %l6 ], %l4 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2008c44: a8 05 20 01 inc %l4 _ISR_Disable( level ); 2008c48: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->last; while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2008c4c: 10 80 00 10 b 2008c8c <_Thread_queue_Enqueue_priority+0x118> 2008c50: e2 04 e0 08 ld [ %l3 + 8 ], %l1 search_priority = search_thread->current_priority; if ( priority >= search_priority ) 2008c54: 80 a4 00 14 cmp %l0, %l4 2008c58: 3a 80 00 11 bcc,a 2008c9c <_Thread_queue_Enqueue_priority+0x128> 2008c5c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 2008c60: 7f ff e4 dd call 2001fd4 2008c64: 90 10 00 12 mov %l2, %o0 2008c68: 7f ff e4 d7 call 2001fc4 2008c6c: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008c70: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 2008c74: 80 8d 40 01 btst %l5, %g1 2008c78: 32 80 00 05 bne,a 2008c8c <_Thread_queue_Enqueue_priority+0x118> 2008c7c: e2 04 60 04 ld [ %l1 + 4 ], %l1 _ISR_Enable( level ); 2008c80: 7f ff e4 d5 call 2001fd4 2008c84: 90 10 00 12 mov %l2, %o0 goto restart_reverse_search; 2008c88: 30 bf ff ed b,a 2008c3c <_Thread_queue_Enqueue_priority+0xc8> restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); search_thread = (Thread_Control *) header->last; while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2008c8c: 80 a4 40 13 cmp %l1, %l3 2008c90: 32 bf ff f1 bne,a 2008c54 <_Thread_queue_Enqueue_priority+0xe0> 2008c94: e8 04 60 14 ld [ %l1 + 0x14 ], %l4 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2008c98: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2008c9c: 80 a0 60 01 cmp %g1, 1 2008ca0: 12 80 00 17 bne 2008cfc <_Thread_queue_Enqueue_priority+0x188> 2008ca4: 90 10 00 12 mov %l2, %o0 THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2008ca8: 80 a4 00 14 cmp %l0, %l4 2008cac: 02 80 00 09 be 2008cd0 <_Thread_queue_Enqueue_priority+0x15c> 2008cb0: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 2008cb4: c2 04 40 00 ld [ %l1 ], %g1 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 2008cb8: e2 26 60 04 st %l1, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 2008cbc: c2 26 40 00 st %g1, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; next_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 2008cc0: f0 26 60 44 st %i0, [ %i1 + 0x44 ] next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; search_node->next = the_node; 2008cc4: f2 24 40 00 st %i1, [ %l1 ] next_node->previous = the_node; 2008cc8: 10 80 00 09 b 2008cec <_Thread_queue_Enqueue_priority+0x178> 2008ccc: f2 20 60 04 st %i1, [ %g1 + 4 ] 2008cd0: a2 04 60 3c add %l1, 0x3c, %l1 _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; 2008cd4: c2 04 60 04 ld [ %l1 + 4 ], %g1 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2008cd8: e2 26 40 00 st %l1, [ %i1 ] the_node->previous = previous_node; 2008cdc: c2 26 60 04 st %g1, [ %i1 + 4 ] previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 2008ce0: f0 26 60 44 st %i0, [ %i1 + 0x44 ] previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; 2008ce4: f2 20 40 00 st %i1, [ %g1 ] search_node->previous = the_node; 2008ce8: f2 24 60 04 st %i1, [ %l1 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2008cec: 7f ff e4 ba call 2001fd4 2008cf0: b0 10 20 01 mov 1, %i0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008cf4: 81 c7 e0 08 ret 2008cf8: 81 e8 00 00 restore * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; return the_thread_queue->sync_state; 2008cfc: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 * For example, the blocking thread could have been given * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; 2008d00: d0 26 80 00 st %o0, [ %i2 ] return the_thread_queue->sync_state; } 2008d04: 81 c7 e0 08 ret 2008d08: 81 e8 00 00 restore =============================================================================== 02008db8 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2008db8: 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 ) 2008dbc: 80 a6 20 00 cmp %i0, 0 2008dc0: 02 80 00 19 be 2008e24 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2008dc4: 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 ) { 2008dc8: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 2008dcc: 80 a4 60 01 cmp %l1, 1 2008dd0: 12 80 00 15 bne 2008e24 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2008dd4: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2008dd8: 7f ff e4 7b call 2001fc4 2008ddc: 01 00 00 00 nop 2008de0: a0 10 00 08 mov %o0, %l0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2008de4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2008de8: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008dec: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2008df0: 80 88 80 01 btst %g2, %g1 2008df4: 02 80 00 0a be 2008e1c <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 2008df8: 94 10 20 01 mov 1, %o2 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2008dfc: 90 10 00 18 mov %i0, %o0 2008e00: 92 10 00 19 mov %i1, %o1 2008e04: 40 00 10 f5 call 200d1d8 <_Thread_queue_Extract_priority_helper> 2008e08: e2 26 20 30 st %l1, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2008e0c: 90 10 00 18 mov %i0, %o0 2008e10: 92 10 00 19 mov %i1, %o1 2008e14: 7f ff ff 58 call 2008b74 <_Thread_queue_Enqueue_priority> 2008e18: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 2008e1c: 7f ff e4 6e call 2001fd4 2008e20: 90 10 00 10 mov %l0, %o0 2008e24: 81 c7 e0 08 ret 2008e28: 81 e8 00 00 restore =============================================================================== 02008e2c <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008e2c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008e30: 90 10 00 18 mov %i0, %o0 2008e34: 7f ff fd df call 20085b0 <_Thread_Get> 2008e38: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008e3c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008e40: 80 a0 60 00 cmp %g1, 0 2008e44: 12 80 00 08 bne 2008e64 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 2008e48: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2008e4c: 40 00 11 1a call 200d2b4 <_Thread_queue_Process_timeout> 2008e50: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 2008e54: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008e58: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 201cc20 <_Thread_Dispatch_disable_level> 2008e5c: 84 00 bf ff add %g2, -1, %g2 2008e60: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 2008e64: 81 c7 e0 08 ret 2008e68: 81 e8 00 00 restore =============================================================================== 020012e0 <_Timer_Manager_initialization>: #include #include void _Timer_Manager_initialization(void) { } 20012e0: 81 c3 e0 08 retl =============================================================================== 02015de4 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2015de4: 9d e3 bf 88 save %sp, -120, %sp static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2015de8: 35 00 80 f6 sethi %hi(0x203d800), %i2 2015dec: b2 07 bf f4 add %fp, -12, %i1 2015df0: ac 07 bf f8 add %fp, -8, %l6 2015df4: a2 07 bf e8 add %fp, -24, %l1 2015df8: a6 07 bf ec add %fp, -20, %l3 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2015dfc: 37 00 80 f6 sethi %hi(0x203d800), %i3 2015e00: 2b 00 80 f5 sethi %hi(0x203d400), %l5 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); the_chain->permanent_null = NULL; 2015e04: c0 27 bf f8 clr [ %fp + -8 ] 2015e08: c0 27 bf ec clr [ %fp + -20 ] the_chain->last = _Chain_Head(the_chain); 2015e0c: f2 27 bf fc st %i1, [ %fp + -4 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2015e10: ec 27 bf f4 st %l6, [ %fp + -12 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2015e14: e2 27 bf f0 st %l1, [ %fp + -16 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2015e18: e6 27 bf e8 st %l3, [ %fp + -24 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2015e1c: b4 16 a0 e4 or %i2, 0xe4, %i2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2015e20: b6 16 e0 24 or %i3, 0x24, %i3 2015e24: aa 15 63 90 or %l5, 0x390, %l5 */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015e28: a8 06 20 30 add %i0, 0x30, %l4 /* * 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 ); 2015e2c: a4 06 20 68 add %i0, 0x68, %l2 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015e30: b8 06 20 08 add %i0, 8, %i4 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2015e34: ba 06 20 40 add %i0, 0x40, %i5 _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; 2015e38: ae 10 20 01 mov 1, %l7 { /* * 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; 2015e3c: f2 26 20 78 st %i1, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2015e40: c2 06 80 00 ld [ %i2 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2015e44: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015e48: 94 10 00 11 mov %l1, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2015e4c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015e50: 92 20 40 09 sub %g1, %o1, %o1 2015e54: 40 00 11 3a call 201a33c <_Watchdog_Adjust_to_chain> 2015e58: 90 10 00 14 mov %l4, %o0 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2015e5c: 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(); 2015e60: e0 06 c0 00 ld [ %i3 ], %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 ) { 2015e64: 80 a4 00 0a cmp %l0, %o2 2015e68: 08 80 00 06 bleu 2015e80 <_Timer_server_Body+0x9c> 2015e6c: 92 24 00 0a sub %l0, %o2, %o1 /* * 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 ); 2015e70: 90 10 00 12 mov %l2, %o0 2015e74: 40 00 11 32 call 201a33c <_Watchdog_Adjust_to_chain> 2015e78: 94 10 00 11 mov %l1, %o2 2015e7c: 30 80 00 06 b,a 2015e94 <_Timer_server_Body+0xb0> } else if ( snapshot < last_snapshot ) { 2015e80: 1a 80 00 05 bcc 2015e94 <_Timer_server_Body+0xb0> 2015e84: 94 22 80 10 sub %o2, %l0, %o2 /* * 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 ); 2015e88: 90 10 00 12 mov %l2, %o0 2015e8c: 40 00 11 05 call 201a2a0 <_Watchdog_Adjust> 2015e90: 92 10 20 01 mov 1, %o1 } watchdogs->last_snapshot = snapshot; 2015e94: 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 ); 2015e98: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2015e9c: 40 00 02 5d call 2016810 <_Chain_Get> 2015ea0: 01 00 00 00 nop if ( timer == NULL ) { 2015ea4: 80 a2 20 00 cmp %o0, 0 2015ea8: 02 80 00 0f be 2015ee4 <_Timer_server_Body+0x100> 2015eac: 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 ) { 2015eb0: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015eb4: 80 a0 60 01 cmp %g1, 1 2015eb8: 12 80 00 05 bne 2015ecc <_Timer_server_Body+0xe8> 2015ebc: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2015ec0: 92 02 20 10 add %o0, 0x10, %o1 2015ec4: 10 80 00 05 b 2015ed8 <_Timer_server_Body+0xf4> 2015ec8: 90 10 00 14 mov %l4, %o0 } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2015ecc: 12 bf ff f3 bne 2015e98 <_Timer_server_Body+0xb4> <== NEVER TAKEN 2015ed0: 92 02 20 10 add %o0, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2015ed4: 90 10 00 12 mov %l2, %o0 2015ed8: 40 00 11 4e call 201a410 <_Watchdog_Insert> 2015edc: 01 00 00 00 nop 2015ee0: 30 bf ff ee b,a 2015e98 <_Timer_server_Body+0xb4> * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2015ee4: 7f ff e2 57 call 200e840 2015ee8: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2015eec: c2 07 bf f4 ld [ %fp + -12 ], %g1 2015ef0: 80 a0 40 16 cmp %g1, %l6 2015ef4: 12 80 00 0a bne 2015f1c <_Timer_server_Body+0x138> <== NEVER TAKEN 2015ef8: 01 00 00 00 nop ts->insert_chain = NULL; 2015efc: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2015f00: 7f ff e2 54 call 200e850 2015f04: 01 00 00 00 nop _Chain_Initialize_empty( &fire_chain ); while ( true ) { _Timer_server_Get_watchdogs_that_fire_now( ts, &insert_chain, &fire_chain ); if ( !_Chain_Is_empty( &fire_chain ) ) { 2015f08: c2 07 bf e8 ld [ %fp + -24 ], %g1 2015f0c: 80 a0 40 13 cmp %g1, %l3 2015f10: 12 80 00 06 bne 2015f28 <_Timer_server_Body+0x144> 2015f14: 01 00 00 00 nop 2015f18: 30 80 00 1a b,a 2015f80 <_Timer_server_Body+0x19c> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2015f1c: 7f ff e2 4d call 200e850 <== NOT EXECUTED 2015f20: 01 00 00 00 nop <== NOT EXECUTED 2015f24: 30 bf ff c7 b,a 2015e40 <_Timer_server_Body+0x5c> <== NOT EXECUTED /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2015f28: 7f ff e2 46 call 200e840 2015f2c: 01 00 00 00 nop 2015f30: 84 10 00 08 mov %o0, %g2 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 2015f34: 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)) 2015f38: 80 a4 00 13 cmp %l0, %l3 2015f3c: 02 80 00 0e be 2015f74 <_Timer_server_Body+0x190> 2015f40: 80 a4 20 00 cmp %l0, 0 { Chain_Node *return_node; Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; 2015f44: c2 04 00 00 ld [ %l0 ], %g1 the_chain->first = new_first; 2015f48: c2 27 bf e8 st %g1, [ %fp + -24 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { 2015f4c: 02 80 00 0a be 2015f74 <_Timer_server_Body+0x190> <== NEVER TAKEN 2015f50: e2 20 60 04 st %l1, [ %g1 + 4 ] watchdog->state = WATCHDOG_INACTIVE; 2015f54: c0 24 20 08 clr [ %l0 + 8 ] _ISR_Enable( level ); 2015f58: 7f ff e2 3e call 200e850 2015f5c: 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 ); 2015f60: d2 04 20 24 ld [ %l0 + 0x24 ], %o1 2015f64: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 2015f68: 9f c0 40 00 call %g1 2015f6c: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 } 2015f70: 30 bf ff ee b,a 2015f28 <_Timer_server_Body+0x144> watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2015f74: 7f ff e2 37 call 200e850 2015f78: 90 10 00 02 mov %g2, %o0 2015f7c: 30 bf ff b0 b,a 2015e3c <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2015f80: c0 2e 20 7c clrb [ %i0 + 0x7c ] 2015f84: c2 05 40 00 ld [ %l5 ], %g1 2015f88: 82 00 60 01 inc %g1 2015f8c: c2 25 40 00 st %g1, [ %l5 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2015f90: d0 06 00 00 ld [ %i0 ], %o0 2015f94: 40 00 0e 32 call 201985c <_Thread_Set_state> 2015f98: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2015f9c: 7f ff ff 68 call 2015d3c <_Timer_server_Reset_interval_system_watchdog> 2015fa0: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2015fa4: 7f ff ff 7b call 2015d90 <_Timer_server_Reset_tod_system_watchdog> 2015fa8: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2015fac: 40 00 0b 67 call 2018d48 <_Thread_Enable_dispatch> 2015fb0: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015fb4: 90 10 00 1c mov %i4, %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; 2015fb8: ee 2e 20 7c stb %l7, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015fbc: 40 00 11 71 call 201a580 <_Watchdog_Remove> 2015fc0: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2015fc4: 40 00 11 6f call 201a580 <_Watchdog_Remove> 2015fc8: 90 10 00 1d mov %i5, %o0 2015fcc: 30 bf ff 9c b,a 2015e3c <_Timer_server_Body+0x58> =============================================================================== 020404bc <_Timespec_Greater_than>: bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { if ( lhs->tv_sec > rhs->tv_sec ) 20404bc: c6 02 00 00 ld [ %o0 ], %g3 20404c0: c4 02 40 00 ld [ %o1 ], %g2 bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { 20404c4: 82 10 00 08 mov %o0, %g1 if ( lhs->tv_sec > rhs->tv_sec ) 20404c8: 80 a0 c0 02 cmp %g3, %g2 20404cc: 14 80 00 0b bg 20404f8 <_Timespec_Greater_than+0x3c> 20404d0: 90 10 20 01 mov 1, %o0 return true; if ( lhs->tv_sec < rhs->tv_sec ) 20404d4: 80 a0 c0 02 cmp %g3, %g2 20404d8: 06 80 00 08 bl 20404f8 <_Timespec_Greater_than+0x3c> <== NEVER TAKEN 20404dc: 90 10 20 00 clr %o0 #include #include #include bool _Timespec_Greater_than( 20404e0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20404e4: c2 02 60 04 ld [ %o1 + 4 ], %g1 20404e8: 80 a0 80 01 cmp %g2, %g1 20404ec: 14 80 00 03 bg 20404f8 <_Timespec_Greater_than+0x3c> 20404f0: 90 10 20 01 mov 1, %o0 20404f4: 90 10 20 00 clr %o0 /* ASSERT: lhs->tv_sec == rhs->tv_sec */ if ( lhs->tv_nsec > rhs->tv_nsec ) return true; return false; } 20404f8: 81 c3 e0 08 retl =============================================================================== 0200b838 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b838: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b83c: 7f ff dd c8 call 2002f5c 200b840: a0 10 00 18 mov %i0, %l0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 200b844: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 200b848: a2 06 20 04 add %i0, 4, %l1 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200b84c: 80 a0 40 11 cmp %g1, %l1 200b850: 02 80 00 1e be 200b8c8 <_Watchdog_Adjust+0x90> 200b854: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b858: 02 80 00 19 be 200b8bc <_Watchdog_Adjust+0x84> 200b85c: a4 10 20 01 mov 1, %l2 200b860: 80 a6 60 01 cmp %i1, 1 200b864: 12 80 00 19 bne 200b8c8 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200b868: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b86c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b870: 10 80 00 07 b 200b88c <_Watchdog_Adjust+0x54> 200b874: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200b878: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 200b87c: 80 a6 80 19 cmp %i2, %i1 200b880: 3a 80 00 05 bcc,a 200b894 <_Watchdog_Adjust+0x5c> 200b884: e4 20 60 10 st %l2, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200b888: b4 26 40 1a sub %i1, %i2, %i2 break; 200b88c: 10 80 00 0f b 200b8c8 <_Watchdog_Adjust+0x90> 200b890: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200b894: 7f ff dd b6 call 2002f6c 200b898: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b89c: 40 00 00 94 call 200baec <_Watchdog_Tickle> 200b8a0: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 200b8a4: 7f ff dd ae call 2002f5c 200b8a8: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200b8ac: c2 04 00 00 ld [ %l0 ], %g1 200b8b0: 80 a0 40 11 cmp %g1, %l1 200b8b4: 02 80 00 05 be 200b8c8 <_Watchdog_Adjust+0x90> 200b8b8: b4 26 80 19 sub %i2, %i1, %i2 switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b8bc: 80 a6 a0 00 cmp %i2, 0 200b8c0: 32 bf ff ee bne,a 200b878 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200b8c4: c2 04 00 00 ld [ %l0 ], %g1 } break; } } _ISR_Enable( level ); 200b8c8: 7f ff dd a9 call 2002f6c 200b8cc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009824 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009824: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009828: 7f ff e1 e7 call 2001fc4 200982c: a0 10 00 18 mov %i0, %l0 previous_state = the_watchdog->state; 2009830: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 2009834: 80 a6 20 01 cmp %i0, 1 2009838: 22 80 00 1e be,a 20098b0 <_Watchdog_Remove+0x8c> 200983c: c0 24 20 08 clr [ %l0 + 8 ] 2009840: 0a 80 00 1d bcs 20098b4 <_Watchdog_Remove+0x90> 2009844: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009848: 80 a6 20 03 cmp %i0, 3 200984c: 18 80 00 1a bgu 20098b4 <_Watchdog_Remove+0x90> <== NEVER TAKEN 2009850: 01 00 00 00 nop 2009854: c2 04 00 00 ld [ %l0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009858: c0 24 20 08 clr [ %l0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200985c: c4 00 40 00 ld [ %g1 ], %g2 2009860: 80 a0 a0 00 cmp %g2, 0 2009864: 22 80 00 07 be,a 2009880 <_Watchdog_Remove+0x5c> 2009868: 03 00 80 73 sethi %hi(0x201cc00), %g1 next_watchdog->delta_interval += the_watchdog->delta_interval; 200986c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 ! 201cc10 <_Thread_BSP_context+0x78> 2009870: c4 04 20 10 ld [ %l0 + 0x10 ], %g2 2009874: 84 00 c0 02 add %g3, %g2, %g2 2009878: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200987c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009880: c2 00 61 70 ld [ %g1 + 0x170 ], %g1 ! 201cd70 <_Watchdog_Sync_count> 2009884: 80 a0 60 00 cmp %g1, 0 2009888: 22 80 00 07 be,a 20098a4 <_Watchdog_Remove+0x80> 200988c: c2 04 00 00 ld [ %l0 ], %g1 _Watchdog_Sync_level = _ISR_Nest_level; 2009890: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009894: c4 00 60 bc ld [ %g1 + 0xbc ], %g2 ! 201ccbc <_ISR_Nest_level> 2009898: 03 00 80 73 sethi %hi(0x201cc00), %g1 200989c: c4 20 60 dc st %g2, [ %g1 + 0xdc ] ! 201ccdc <_Watchdog_Sync_level> ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 20098a0: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 20098a4: c4 04 20 04 ld [ %l0 + 4 ], %g2 next->previous = previous; previous->next = next; 20098a8: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 20098ac: c4 20 60 04 st %g2, [ %g1 + 4 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 20098b0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20098b4: c2 00 61 74 ld [ %g1 + 0x174 ], %g1 ! 201cd74 <_Watchdog_Ticks_since_boot> 20098b8: c2 24 20 18 st %g1, [ %l0 + 0x18 ] _ISR_Enable( level ); 20098bc: 7f ff e1 c6 call 2001fd4 20098c0: 01 00 00 00 nop return( previous_state ); } 20098c4: 81 c7 e0 08 ret 20098c8: 81 e8 00 00 restore =============================================================================== 0200afc8 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200afc8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200afcc: 7f ff de a2 call 2002a54 200afd0: a0 10 00 18 mov %i0, %l0 200afd4: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200afd8: 11 00 80 82 sethi %hi(0x2020800), %o0 200afdc: 94 10 00 19 mov %i1, %o2 200afe0: 90 12 21 d0 or %o0, 0x1d0, %o0 200afe4: 7f ff e5 ee call 200479c 200afe8: 92 10 00 10 mov %l0, %o1 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 200afec: e2 06 40 00 ld [ %i1 ], %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 200aff0: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200aff4: 80 a4 40 19 cmp %l1, %i1 200aff8: 02 80 00 0e be 200b030 <_Watchdog_Report_chain+0x68> 200affc: 11 00 80 82 sethi %hi(0x2020800), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b000: 92 10 00 11 mov %l1, %o1 200b004: 40 00 00 10 call 200b044 <_Watchdog_Report> 200b008: 90 10 20 00 clr %o0 _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = header->first ; node != _Chain_Tail(header) ; node = node->next ) 200b00c: 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 = header->first ; 200b010: 80 a4 40 19 cmp %l1, %i1 200b014: 12 bf ff fc bne 200b004 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b018: 92 10 00 11 mov %l1, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b01c: 92 10 00 10 mov %l0, %o1 200b020: 11 00 80 82 sethi %hi(0x2020800), %o0 200b024: 7f ff e5 de call 200479c 200b028: 90 12 21 e8 or %o0, 0x1e8, %o0 ! 20209e8 200b02c: 30 80 00 03 b,a 200b038 <_Watchdog_Report_chain+0x70> } else { printk( "Chain is empty\n" ); 200b030: 7f ff e5 db call 200479c 200b034: 90 12 21 f8 or %o0, 0x1f8, %o0 } _ISR_Enable( level ); 200b038: 7f ff de 8b call 2002a64 200b03c: 81 e8 00 00 restore =============================================================================== 02009228 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2009228: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200922c: 80 a6 20 00 cmp %i0, 0 2009230: 02 80 00 1d be 20092a4 <== NEVER TAKEN 2009234: 21 00 80 8d sethi %hi(0x2023400), %l0 2009238: a0 14 22 f4 or %l0, 0x2f4, %l0 ! 20236f4 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200923c: a6 04 20 10 add %l0, 0x10, %l3 if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { if ( !_Objects_Information_table[ api_index ] ) 2009240: c2 04 00 00 ld [ %l0 ], %g1 2009244: 80 a0 60 00 cmp %g1, 0 2009248: 22 80 00 14 be,a 2009298 200924c: a0 04 20 04 add %l0, 4, %l0 continue; information = _Objects_Information_table[ api_index ][ 1 ]; 2009250: e4 00 60 04 ld [ %g1 + 4 ], %l2 if ( !information ) 2009254: 80 a4 a0 00 cmp %l2, 0 2009258: 12 80 00 0b bne 2009284 200925c: a2 10 20 01 mov 1, %l1 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009260: 10 80 00 0e b 2009298 2009264: a0 04 20 04 add %l0, 4, %l0 the_thread = (Thread_Control *)information->local_table[ i ]; 2009268: c2 04 a0 1c ld [ %l2 + 0x1c ], %g1 200926c: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !the_thread ) 2009270: 80 a2 20 00 cmp %o0, 0 2009274: 02 80 00 04 be 2009284 <== NEVER TAKEN 2009278: a2 04 60 01 inc %l1 continue; (*routine)(the_thread); 200927c: 9f c6 00 00 call %i0 2009280: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2009284: c2 14 a0 10 lduh [ %l2 + 0x10 ], %g1 2009288: 80 a4 40 01 cmp %l1, %g1 200928c: 08 bf ff f7 bleu 2009268 2009290: 85 2c 60 02 sll %l1, 2, %g2 2009294: a0 04 20 04 add %l0, 4, %l0 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2009298: 80 a4 00 13 cmp %l0, %l3 200929c: 32 bf ff ea bne,a 2009244 20092a0: c2 04 00 00 ld [ %l0 ], %g1 20092a4: 81 c7 e0 08 ret 20092a8: 81 e8 00 00 restore =============================================================================== 0201365c : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 201365c: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2013660: a0 96 20 00 orcc %i0, 0, %l0 2013664: 02 80 00 1c be 20136d4 2013668: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !starting_address ) 201366c: 80 a6 60 00 cmp %i1, 0 2013670: 02 80 00 34 be 2013740 2013674: 80 a7 60 00 cmp %i5, 0 return RTEMS_INVALID_ADDRESS; if ( !id ) 2013678: 02 80 00 32 be 2013740 <== NEVER TAKEN 201367c: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2013680: 02 80 00 32 be 2013748 2013684: 80 a6 a0 00 cmp %i2, 0 2013688: 02 80 00 30 be 2013748 201368c: 80 a6 80 1b cmp %i2, %i3 2013690: 0a 80 00 2e bcs 2013748 2013694: 80 8e e0 07 btst 7, %i3 2013698: 12 80 00 2c bne 2013748 201369c: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 20136a0: 12 80 00 28 bne 2013740 20136a4: 03 00 80 f5 sethi %hi(0x203d400), %g1 20136a8: c4 00 63 90 ld [ %g1 + 0x390 ], %g2 ! 203d790 <_Thread_Dispatch_disable_level> 20136ac: 84 00 a0 01 inc %g2 20136b0: c4 20 63 90 st %g2, [ %g1 + 0x390 ] * 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 ); 20136b4: 25 00 80 f5 sethi %hi(0x203d400), %l2 20136b8: 40 00 11 b6 call 2017d90 <_Objects_Allocate> 20136bc: 90 14 a1 94 or %l2, 0x194, %o0 ! 203d594 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 20136c0: a2 92 20 00 orcc %o0, 0, %l1 20136c4: 32 80 00 06 bne,a 20136dc 20136c8: f4 24 60 14 st %i2, [ %l1 + 0x14 ] _Thread_Enable_dispatch(); 20136cc: 40 00 15 9f call 2018d48 <_Thread_Enable_dispatch> 20136d0: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 20136d4: 81 c7 e0 08 ret 20136d8: 81 e8 00 00 restore 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, 20136dc: 90 10 00 1a mov %i2, %o0 20136e0: 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; 20136e4: f8 24 60 1c st %i4, [ %l1 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 20136e8: f2 24 60 10 st %i1, [ %l1 + 0x10 ] the_partition->length = length; the_partition->buffer_size = buffer_size; 20136ec: f6 24 60 18 st %i3, [ %l1 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 20136f0: 40 00 64 49 call 202c814 <.udiv> 20136f4: c0 24 60 20 clr [ %l1 + 0x20 ] 20136f8: 92 10 00 19 mov %i1, %o1 20136fc: 94 10 00 08 mov %o0, %o2 2013700: 96 10 00 1b mov %i3, %o3 2013704: b4 04 60 24 add %l1, 0x24, %i2 2013708: 40 00 0c 52 call 2016850 <_Chain_Initialize> 201370c: 90 10 00 1a mov %i2, %o0 2013710: c2 14 60 0a lduh [ %l1 + 0xa ], %g1 2013714: c6 04 60 08 ld [ %l1 + 8 ], %g3 2013718: a4 14 a1 94 or %l2, 0x194, %l2 201371c: c4 04 a0 1c ld [ %l2 + 0x1c ], %g2 information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2013720: e0 24 60 0c st %l0, [ %l1 + 0xc ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2013724: 83 28 60 02 sll %g1, 2, %g1 &_Partition_Information, &the_partition->Object, (Objects_Name) name ); *id = the_partition->Object.id; 2013728: c6 27 40 00 st %g3, [ %i5 ] 201372c: e2 20 80 01 st %l1, [ %g2 + %g1 ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2013730: 40 00 15 86 call 2018d48 <_Thread_Enable_dispatch> 2013734: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2013738: 81 c7 e0 08 ret 201373c: 81 e8 00 00 restore 2013740: 81 c7 e0 08 ret 2013744: 91 e8 20 09 restore %g0, 9, %o0 2013748: b0 10 20 08 mov 8, %i0 } 201374c: 81 c7 e0 08 ret 2013750: 81 e8 00 00 restore =============================================================================== 0203fc8c : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 203fc8c: 9d e3 bf 98 save %sp, -104, %sp 203fc90: 11 00 81 b6 sethi %hi(0x206d800), %o0 203fc94: 92 10 00 18 mov %i0, %o1 203fc98: 90 12 20 40 or %o0, 0x40, %o0 203fc9c: 7f ff 3a c9 call 200e7c0 <_Objects_Get> 203fca0: 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 ) { 203fca4: c2 07 bf fc ld [ %fp + -4 ], %g1 203fca8: 80 a0 60 00 cmp %g1, 0 203fcac: 12 80 00 63 bne 203fe38 203fcb0: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 203fcb4: 25 00 81 b5 sethi %hi(0x206d400), %l2 203fcb8: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 203fcbc: c2 04 a0 80 ld [ %l2 + 0x80 ], %g1 203fcc0: 80 a0 80 01 cmp %g2, %g1 203fcc4: 02 80 00 06 be 203fcdc 203fcc8: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 203fccc: 7f ff 3d 2f call 200f188 <_Thread_Enable_dispatch> 203fcd0: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 203fcd4: 81 c7 e0 08 ret 203fcd8: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 203fcdc: 12 80 00 0b bne 203fd08 203fce0: 01 00 00 00 nop switch ( the_period->state ) { 203fce4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 203fce8: 80 a0 60 04 cmp %g1, 4 203fcec: 18 80 00 4f bgu 203fe28 <== NEVER TAKEN 203fcf0: b0 10 20 00 clr %i0 203fcf4: 83 28 60 02 sll %g1, 2, %g1 203fcf8: 05 00 81 9d sethi %hi(0x2067400), %g2 203fcfc: 84 10 a1 58 or %g2, 0x158, %g2 ! 2067558 203fd00: 10 80 00 4a b 203fe28 203fd04: f0 00 80 01 ld [ %g2 + %g1 ], %i0 } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 203fd08: 7f ff 0e a9 call 20037ac 203fd0c: 01 00 00 00 nop 203fd10: a6 10 00 08 mov %o0, %l3 switch ( the_period->state ) { 203fd14: e2 04 20 38 ld [ %l0 + 0x38 ], %l1 203fd18: 80 a4 60 02 cmp %l1, 2 203fd1c: 02 80 00 1a be 203fd84 203fd20: 80 a4 60 04 cmp %l1, 4 203fd24: 02 80 00 34 be 203fdf4 203fd28: 80 a4 60 00 cmp %l1, 0 203fd2c: 12 80 00 43 bne 203fe38 <== NEVER TAKEN 203fd30: 01 00 00 00 nop case RATE_MONOTONIC_INACTIVE: { _ISR_Enable( level ); 203fd34: 7f ff 0e a2 call 20037bc 203fd38: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 203fd3c: 7f ff ff 50 call 203fa7c <_Rate_monotonic_Initiate_statistics> 203fd40: 90 10 00 10 mov %l0, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 203fd44: 82 10 20 02 mov 2, %g1 203fd48: c2 24 20 38 st %g1, [ %l0 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 203fd4c: 03 00 80 ff sethi %hi(0x203fc00), %g1 203fd50: 82 10 62 40 or %g1, 0x240, %g1 ! 203fe40 <_Rate_monotonic_Timeout> the_watchdog->id = id; 203fd54: f0 24 20 30 st %i0, [ %l0 + 0x30 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fd58: 92 04 20 10 add %l0, 0x10, %o1 203fd5c: 11 00 81 b5 sethi %hi(0x206d400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203fd60: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fd64: 90 12 20 a0 or %o0, 0xa0, %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 203fd68: c0 24 20 18 clr [ %l0 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 203fd6c: c0 24 20 34 clr [ %l0 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 203fd70: f2 24 20 3c st %i1, [ %l0 + 0x3c ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 203fd74: c2 24 20 2c st %g1, [ %l0 + 0x2c ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fd78: 7f ff 41 68 call 2010318 <_Watchdog_Insert> 203fd7c: b0 10 20 00 clr %i0 203fd80: 30 80 00 2a b,a 203fe28 case RATE_MONOTONIC_ACTIVE: /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 203fd84: 7f ff ff 84 call 203fb94 <_Rate_monotonic_Update_statistics> 203fd88: 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; 203fd8c: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 203fd90: 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; 203fd94: c2 24 20 38 st %g1, [ %l0 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 203fd98: 7f ff 0e 89 call 20037bc 203fd9c: 90 10 00 13 mov %l3, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 203fda0: c2 04 a0 80 ld [ %l2 + 0x80 ], %g1 203fda4: c4 04 20 08 ld [ %l0 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 203fda8: 90 10 00 01 mov %g1, %o0 the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; the_period->next_length = length; _ISR_Enable( level ); _Thread_Executing->Wait.id = the_period->Object.id; 203fdac: c4 20 60 20 st %g2, [ %g1 + 0x20 ] _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 203fdb0: 7f ff 3f 62 call 200fb38 <_Thread_Set_state> 203fdb4: 13 00 00 10 sethi %hi(0x4000), %o1 /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 203fdb8: 7f ff 0e 7d call 20037ac 203fdbc: 01 00 00 00 nop local_state = the_period->state; 203fdc0: e6 04 20 38 ld [ %l0 + 0x38 ], %l3 the_period->state = RATE_MONOTONIC_ACTIVE; 203fdc4: e2 24 20 38 st %l1, [ %l0 + 0x38 ] _ISR_Enable( level ); 203fdc8: 7f ff 0e 7d call 20037bc 203fdcc: 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 ) 203fdd0: 80 a4 e0 03 cmp %l3, 3 203fdd4: 12 80 00 04 bne 203fde4 203fdd8: d0 04 a0 80 ld [ %l2 + 0x80 ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 203fddc: 7f ff 3b d9 call 200ed40 <_Thread_Clear_state> 203fde0: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 203fde4: 7f ff 3c e9 call 200f188 <_Thread_Enable_dispatch> 203fde8: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 203fdec: 81 c7 e0 08 ret 203fdf0: 81 e8 00 00 restore case RATE_MONOTONIC_EXPIRED: /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 203fdf4: 7f ff ff 68 call 203fb94 <_Rate_monotonic_Update_statistics> 203fdf8: 90 10 00 10 mov %l0, %o0 _ISR_Enable( level ); 203fdfc: 7f ff 0e 70 call 20037bc 203fe00: 90 10 00 13 mov %l3, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 203fe04: 82 10 20 02 mov 2, %g1 203fe08: 92 04 20 10 add %l0, 0x10, %o1 203fe0c: 11 00 81 b5 sethi %hi(0x206d400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203fe10: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 203fe14: 90 12 20 a0 or %o0, 0xa0, %o0 the_period->next_length = length; 203fe18: f2 24 20 3c st %i1, [ %l0 + 0x3c ] */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 203fe1c: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 203fe20: 7f ff 41 3e call 2010318 <_Watchdog_Insert> 203fe24: b0 10 20 06 mov 6, %i0 the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 203fe28: 7f ff 3c d8 call 200f188 <_Thread_Enable_dispatch> 203fe2c: 01 00 00 00 nop return RTEMS_TIMEOUT; 203fe30: 81 c7 e0 08 ret 203fe34: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 203fe38: 81 c7 e0 08 ret 203fe3c: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 0202b1dc : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 202b1dc: 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 ) 202b1e0: 80 a6 60 00 cmp %i1, 0 202b1e4: 02 80 00 7a be 202b3cc <== NEVER TAKEN 202b1e8: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 202b1ec: 13 00 81 8e sethi %hi(0x2063800), %o1 202b1f0: 9f c6 40 00 call %i1 202b1f4: 92 12 60 58 or %o1, 0x58, %o1 ! 2063858 <_TOD_Days_per_month+0x6c> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 202b1f8: 90 10 00 18 mov %i0, %o0 202b1fc: 13 00 81 8e sethi %hi(0x2063800), %o1 202b200: 9f c6 40 00 call %i1 202b204: 92 12 60 78 or %o1, 0x78, %o1 ! 2063878 <_TOD_Days_per_month+0x8c> (*print)( context, "--- Wall times are in seconds ---\n" ); 202b208: 90 10 00 18 mov %i0, %o0 202b20c: 13 00 81 8e sethi %hi(0x2063800), %o1 202b210: 9f c6 40 00 call %i1 202b214: 92 12 60 a0 or %o1, 0xa0, %o1 ! 20638a0 <_TOD_Days_per_month+0xb4> Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 202b218: 90 10 00 18 mov %i0, %o0 202b21c: 13 00 81 8e sethi %hi(0x2063800), %o1 202b220: 9f c6 40 00 call %i1 202b224: 92 12 60 c8 or %o1, 0xc8, %o1 ! 20638c8 <_TOD_Days_per_month+0xdc> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 202b228: 90 10 00 18 mov %i0, %o0 202b22c: 13 00 81 8e sethi %hi(0x2063800), %o1 202b230: 9f c6 40 00 call %i1 202b234: 92 12 61 18 or %o1, 0x118, %o1 ! 2063918 <_TOD_Days_per_month+0x12c> /* * 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 ; 202b238: 03 00 81 b6 sethi %hi(0x206d800), %g1 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202b23c: 2d 00 81 8e sethi %hi(0x2063800), %l6 /* * 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 ; 202b240: 82 10 60 40 or %g1, 0x40, %g1 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, 202b244: 2b 00 81 8e sethi %hi(0x2063800), %l5 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 202b248: 29 00 81 8e sethi %hi(0x2063800), %l4 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 202b24c: 27 00 81 8e sethi %hi(0x2063800), %l3 * 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++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 202b250: ba 07 bf a0 add %fp, -96, %i5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 202b254: ae 10 00 01 mov %g1, %l7 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202b258: ac 15 a1 68 or %l6, 0x168, %l6 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, 202b25c: aa 15 61 88 or %l5, 0x188, %l5 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 202b260: a8 15 21 a8 or %l4, 0x1a8, %l4 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 202b264: a6 14 e1 80 or %l3, 0x180, %l3 /* * 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 ; 202b268: e0 00 60 08 ld [ %g1 + 8 ], %l0 status = rtems_rate_monotonic_get_statistics( id, &the_stats ); if ( status != RTEMS_SUCCESSFUL ) continue; /* If the above passed, so should this but check it anyway */ status = rtems_rate_monotonic_get_status( id, &the_status ); 202b26c: b8 07 bf d8 add %fp, -40, %i4 #if defined(RTEMS_DEBUG) if ( status != RTEMS_SUCCESSFUL ) continue; #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 202b270: a4 07 bf f8 add %fp, -8, %l2 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 ); 202b274: b4 07 bf b8 add %fp, -72, %i2 /* * 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 ; 202b278: 10 80 00 51 b 202b3bc 202b27c: a2 07 bf f0 add %fp, -16, %l1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 202b280: 40 00 51 a3 call 203f90c 202b284: 92 10 00 1d mov %i5, %o1 if ( status != RTEMS_SUCCESSFUL ) 202b288: 80 a2 20 00 cmp %o0, 0 202b28c: 32 80 00 4c bne,a 202b3bc 202b290: a0 04 20 01 inc %l0 continue; /* If the above passed, so should this but check it anyway */ status = rtems_rate_monotonic_get_status( id, &the_status ); 202b294: 92 10 00 1c mov %i4, %o1 202b298: 40 00 51 ca call 203f9c0 202b29c: 90 10 00 10 mov %l0, %o0 #if defined(RTEMS_DEBUG) if ( status != RTEMS_SUCCESSFUL ) continue; #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 202b2a0: d0 07 bf d8 ld [ %fp + -40 ], %o0 202b2a4: 94 10 00 12 mov %l2, %o2 202b2a8: 7f ff 85 53 call 200c7f4 202b2ac: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202b2b0: d8 1f bf a0 ldd [ %fp + -96 ], %o4 202b2b4: 92 10 00 16 mov %l6, %o1 202b2b8: 94 10 00 10 mov %l0, %o2 202b2bc: 90 10 00 18 mov %i0, %o0 202b2c0: 9f c6 40 00 call %i1 202b2c4: 96 10 00 12 mov %l2, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 202b2c8: 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 ); 202b2cc: 94 10 00 11 mov %l1, %o2 202b2d0: 90 10 00 1a mov %i2, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 202b2d4: 80 a0 60 00 cmp %g1, 0 202b2d8: 12 80 00 06 bne 202b2f0 202b2dc: 92 10 00 13 mov %l3, %o1 (*print)( context, "\n" ); 202b2e0: 9f c6 40 00 call %i1 202b2e4: 90 10 00 18 mov %i0, %o0 continue; 202b2e8: 10 80 00 35 b 202b3bc 202b2ec: a0 04 20 01 inc %l0 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 ); 202b2f0: 40 00 05 87 call 202c90c <_Timespec_Divide_by_integer> 202b2f4: 92 10 00 01 mov %g1, %o1 (*print)( context, 202b2f8: d0 07 bf ac ld [ %fp + -84 ], %o0 202b2fc: 40 00 bf 7a call 205b0e4 <.div> 202b300: 92 10 23 e8 mov 0x3e8, %o1 202b304: 96 10 00 08 mov %o0, %o3 202b308: d0 07 bf b4 ld [ %fp + -76 ], %o0 202b30c: d6 27 bf 9c st %o3, [ %fp + -100 ] 202b310: 40 00 bf 75 call 205b0e4 <.div> 202b314: 92 10 23 e8 mov 0x3e8, %o1 202b318: c2 07 bf f0 ld [ %fp + -16 ], %g1 202b31c: b6 10 00 08 mov %o0, %i3 202b320: d0 07 bf f4 ld [ %fp + -12 ], %o0 202b324: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202b328: 40 00 bf 6f call 205b0e4 <.div> 202b32c: 92 10 23 e8 mov 0x3e8, %o1 202b330: d8 07 bf b0 ld [ %fp + -80 ], %o4 202b334: d6 07 bf 9c ld [ %fp + -100 ], %o3 202b338: d4 07 bf a8 ld [ %fp + -88 ], %o2 202b33c: 9a 10 00 1b mov %i3, %o5 202b340: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202b344: 92 10 00 15 mov %l5, %o1 202b348: 9f c6 40 00 call %i1 202b34c: 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); 202b350: d2 07 bf a0 ld [ %fp + -96 ], %o1 202b354: 94 10 00 11 mov %l1, %o2 202b358: 40 00 05 6d call 202c90c <_Timespec_Divide_by_integer> 202b35c: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 202b360: d0 07 bf c4 ld [ %fp + -60 ], %o0 202b364: 40 00 bf 60 call 205b0e4 <.div> 202b368: 92 10 23 e8 mov 0x3e8, %o1 202b36c: 96 10 00 08 mov %o0, %o3 202b370: d0 07 bf cc ld [ %fp + -52 ], %o0 202b374: d6 27 bf 9c st %o3, [ %fp + -100 ] 202b378: 40 00 bf 5b call 205b0e4 <.div> 202b37c: 92 10 23 e8 mov 0x3e8, %o1 202b380: c2 07 bf f0 ld [ %fp + -16 ], %g1 202b384: b6 10 00 08 mov %o0, %i3 202b388: d0 07 bf f4 ld [ %fp + -12 ], %o0 202b38c: 92 10 23 e8 mov 0x3e8, %o1 202b390: 40 00 bf 55 call 205b0e4 <.div> 202b394: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202b398: d4 07 bf c0 ld [ %fp + -64 ], %o2 202b39c: d6 07 bf 9c ld [ %fp + -100 ], %o3 202b3a0: d8 07 bf c8 ld [ %fp + -56 ], %o4 202b3a4: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202b3a8: 9a 10 00 1b mov %i3, %o5 202b3ac: 90 10 00 18 mov %i0, %o0 202b3b0: 9f c6 40 00 call %i1 202b3b4: 92 10 00 14 mov %l4, %o1 * 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++ ) { 202b3b8: 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 ; 202b3bc: c2 05 e0 0c ld [ %l7 + 0xc ], %g1 202b3c0: 80 a4 00 01 cmp %l0, %g1 202b3c4: 08 bf ff af bleu 202b280 202b3c8: 90 10 00 10 mov %l0, %o0 202b3cc: 81 c7 e0 08 ret 202b3d0: 81 e8 00 00 restore =============================================================================== 02014c44 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2014c44: 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 ) 2014c48: 82 10 20 0a mov 0xa, %g1 2014c4c: 80 a6 60 00 cmp %i1, 0 2014c50: 02 80 00 2a be 2014cf8 2014c54: 90 10 00 18 mov %i0, %o0 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2014c58: 40 00 10 5f call 2018dd4 <_Thread_Get> 2014c5c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2014c60: c4 07 bf fc ld [ %fp + -4 ], %g2 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2014c64: a0 10 00 08 mov %o0, %l0 switch ( location ) { 2014c68: 80 a0 a0 00 cmp %g2, 0 2014c6c: 12 80 00 23 bne 2014cf8 2014c70: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2014c74: d2 02 21 60 ld [ %o0 + 0x160 ], %o1 asr = &api->Signal; 2014c78: c2 02 60 0c ld [ %o1 + 0xc ], %g1 2014c7c: 80 a0 60 00 cmp %g1, 0 2014c80: 02 80 00 1b be 2014cec 2014c84: 01 00 00 00 nop if ( ! _ASR_Is_null_handler( asr->handler ) ) { if ( asr->is_enabled ) { 2014c88: c2 0a 60 08 ldub [ %o1 + 8 ], %g1 2014c8c: 80 a0 60 00 cmp %g1, 0 2014c90: 02 80 00 11 be 2014cd4 2014c94: 90 10 00 19 mov %i1, %o0 _ASR_Post_signals( signal_set, &asr->signals_posted ); 2014c98: 7f ff ff e2 call 2014c20 <_ASR_Post_signals> 2014c9c: 92 02 60 14 add %o1, 0x14, %o1 the_thread->do_post_task_switch_extension = true; if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2014ca0: 03 00 80 f6 sethi %hi(0x203d800), %g1 2014ca4: c4 00 60 2c ld [ %g1 + 0x2c ], %g2 ! 203d82c <_ISR_Nest_level> if ( ! _ASR_Is_null_handler( asr->handler ) ) { if ( asr->is_enabled ) { _ASR_Post_signals( signal_set, &asr->signals_posted ); the_thread->do_post_task_switch_extension = true; 2014ca8: 82 10 20 01 mov 1, %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2014cac: 80 a0 a0 00 cmp %g2, 0 2014cb0: 02 80 00 0b be 2014cdc 2014cb4: c2 2c 20 74 stb %g1, [ %l0 + 0x74 ] 2014cb8: 05 00 80 f6 sethi %hi(0x203d800), %g2 2014cbc: c4 00 a0 50 ld [ %g2 + 0x50 ], %g2 ! 203d850 <_Thread_Executing> 2014cc0: 80 a4 00 02 cmp %l0, %g2 2014cc4: 12 80 00 06 bne 2014cdc <== NEVER TAKEN 2014cc8: 05 00 80 f6 sethi %hi(0x203d800), %g2 _ISR_Signals_to_thread_executing = true; 2014ccc: 10 80 00 04 b 2014cdc 2014cd0: c2 28 a0 e8 stb %g1, [ %g2 + 0xe8 ] ! 203d8e8 <_ISR_Signals_to_thread_executing> } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); 2014cd4: 7f ff ff d3 call 2014c20 <_ASR_Post_signals> 2014cd8: 92 02 60 18 add %o1, 0x18, %o1 } _Thread_Enable_dispatch(); 2014cdc: 40 00 10 1b call 2018d48 <_Thread_Enable_dispatch> 2014ce0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2014ce4: 10 80 00 05 b 2014cf8 2014ce8: 82 10 20 00 clr %g1 ! 0 } _Thread_Enable_dispatch(); 2014cec: 40 00 10 17 call 2018d48 <_Thread_Enable_dispatch> 2014cf0: 01 00 00 00 nop 2014cf4: 82 10 20 0b mov 0xb, %g1 ! b case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2014cf8: 81 c7 e0 08 ret 2014cfc: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200ef80 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200ef80: 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 ) 200ef84: 80 a6 a0 00 cmp %i2, 0 200ef88: 02 80 00 54 be 200f0d8 200ef8c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200ef90: 03 00 80 73 sethi %hi(0x201cc00), %g1 200ef94: e0 00 60 e0 ld [ %g1 + 0xe0 ], %l0 ! 201cce0 <_Thread_Executing> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200ef98: c4 0c 20 75 ldub [ %l0 + 0x75 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200ef9c: 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; 200efa0: 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 ]; 200efa4: e2 04 21 60 ld [ %l0 + 0x160 ], %l1 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200efa8: a4 60 3f ff subx %g0, -1, %l2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200efac: 80 a0 60 00 cmp %g1, 0 200efb0: 02 80 00 03 be 200efbc 200efb4: a5 2c a0 08 sll %l2, 8, %l2 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200efb8: a4 14 a2 00 or %l2, 0x200, %l2 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; 200efbc: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 200efc0: 80 a0 00 01 cmp %g0, %g1 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; old_mode |= _ISR_Get_level(); 200efc4: 7f ff eb e1 call 2009f48 <_CPU_ISR_Get_level> 200efc8: a6 60 3f ff subx %g0, -1, %l3 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; 200efcc: a7 2c e0 0a sll %l3, 0xa, %l3 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; 200efd0: a6 14 c0 08 or %l3, %o0, %l3 old_mode |= _ISR_Get_level(); *previous_mode_set = old_mode; 200efd4: a4 14 c0 12 or %l3, %l2, %l2 /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200efd8: 80 8e 61 00 btst 0x100, %i1 200efdc: 02 80 00 06 be 200eff4 200efe0: e4 26 80 00 st %l2, [ %i2 ] executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200efe4: 83 36 20 08 srl %i0, 8, %g1 200efe8: 82 18 60 01 xor %g1, 1, %g1 200efec: 82 08 60 01 and %g1, 1, %g1 200eff0: c2 2c 20 75 stb %g1, [ %l0 + 0x75 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200eff4: 80 8e 62 00 btst 0x200, %i1 200eff8: 02 80 00 0b be 200f024 200effc: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200f000: 80 8e 22 00 btst 0x200, %i0 200f004: 22 80 00 07 be,a 200f020 200f008: c0 24 20 7c clr [ %l0 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200f00c: 03 00 80 72 sethi %hi(0x201c800), %g1 200f010: c2 00 63 78 ld [ %g1 + 0x378 ], %g1 ! 201cb78 <_Thread_Ticks_per_timeslice> 200f014: 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; 200f018: 82 10 20 01 mov 1, %g1 200f01c: c2 24 20 7c st %g1, [ %l0 + 0x7c ] /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200f020: 80 8e 60 0f btst 0xf, %i1 200f024: 02 80 00 06 be 200f03c 200f028: 80 8e 64 00 btst 0x400, %i1 */ RTEMS_INLINE_ROUTINE void _Modes_Set_interrupt_level ( Modes_Control mode_set ) { _ISR_Set_level( _Modes_Get_interrupt_level( mode_set ) ); 200f02c: 90 0e 20 0f and %i0, 0xf, %o0 200f030: 7f ff cb e9 call 2001fd4 200f034: 91 2a 20 08 sll %o0, 8, %o0 */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 200f038: 80 8e 64 00 btst 0x400, %i1 200f03c: 22 80 00 18 be,a 200f09c 200f040: a0 10 20 00 clr %l0 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; 200f044: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 200f048: b1 36 20 0a srl %i0, 0xa, %i0 200f04c: b0 1e 20 01 xor %i0, 1, %i0 200f050: b0 0e 20 01 and %i0, 1, %i0 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; 200f054: 80 a6 00 01 cmp %i0, %g1 200f058: 22 80 00 11 be,a 200f09c 200f05c: a0 10 20 00 clr %l0 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200f060: 7f ff cb d9 call 2001fc4 200f064: f0 2c 60 08 stb %i0, [ %l1 + 8 ] _signals = information->signals_pending; 200f068: c4 04 60 18 ld [ %l1 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 200f06c: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 information->signals_posted = _signals; 200f070: 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; 200f074: c2 24 60 18 st %g1, [ %l1 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200f078: 7f ff cb d7 call 2001fd4 200f07c: 01 00 00 00 nop 200f080: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 200f084: 80 a0 60 00 cmp %g1, 0 200f088: 22 80 00 05 be,a 200f09c 200f08c: a0 10 20 00 clr %l0 if ( is_asr_enabled != asr->is_enabled ) { asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { needs_asr_dispatching = true; executing->do_post_task_switch_extension = true; 200f090: 82 10 20 01 mov 1, %g1 200f094: c2 2c 20 74 stb %g1, [ %l0 + 0x74 ] 200f098: a0 10 20 01 mov 1, %l0 } } } if ( _System_state_Is_up( _System_state_Get() ) ) 200f09c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f0a0: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 ! 201cdc0 <_System_state_Current> 200f0a4: 80 a0 60 03 cmp %g1, 3 200f0a8: 12 80 00 0c bne 200f0d8 <== NEVER TAKEN 200f0ac: 82 10 20 00 clr %g1 if ( _Thread_Evaluate_mode() || needs_asr_dispatching ) 200f0b0: 40 00 00 7a call 200f298 <_Thread_Evaluate_mode> 200f0b4: 01 00 00 00 nop 200f0b8: 80 8a 20 ff btst 0xff, %o0 200f0bc: 12 80 00 04 bne 200f0cc 200f0c0: 80 8c 20 ff btst 0xff, %l0 200f0c4: 02 80 00 05 be 200f0d8 200f0c8: 82 10 20 00 clr %g1 _Thread_Dispatch(); 200f0cc: 7f ff e4 cb call 20083f8 <_Thread_Dispatch> 200f0d0: 01 00 00 00 nop 200f0d4: 82 10 20 00 clr %g1 ! 0 return RTEMS_SUCCESSFUL; } 200f0d8: 81 c7 e0 08 ret 200f0dc: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200afc8 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200afc8: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200afcc: 80 a6 60 00 cmp %i1, 0 200afd0: 02 80 00 07 be 200afec 200afd4: 90 10 00 18 mov %i0, %o0 200afd8: 03 00 80 82 sethi %hi(0x2020800), %g1 200afdc: c2 08 62 54 ldub [ %g1 + 0x254 ], %g1 ! 2020a54 200afe0: 80 a6 40 01 cmp %i1, %g1 200afe4: 18 80 00 1c bgu 200b054 200afe8: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200afec: 80 a6 a0 00 cmp %i2, 0 200aff0: 02 80 00 19 be 200b054 200aff4: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200aff8: 40 00 08 21 call 200d07c <_Thread_Get> 200affc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b000: c2 07 bf fc ld [ %fp + -4 ], %g1 200b004: 80 a0 60 00 cmp %g1, 0 200b008: 12 80 00 13 bne 200b054 200b00c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200b010: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200b014: 80 a6 60 00 cmp %i1, 0 200b018: 02 80 00 0d be 200b04c 200b01c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200b020: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200b024: 80 a0 60 00 cmp %g1, 0 200b028: 02 80 00 06 be 200b040 200b02c: f2 22 20 18 st %i1, [ %o0 + 0x18 ] the_thread->current_priority > new_priority ) 200b030: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b034: 80 a0 40 19 cmp %g1, %i1 200b038: 08 80 00 05 bleu 200b04c <== ALWAYS TAKEN 200b03c: 01 00 00 00 nop _Thread_Change_priority( the_thread, new_priority, false ); 200b040: 92 10 00 19 mov %i1, %o1 200b044: 40 00 06 60 call 200c9c4 <_Thread_Change_priority> 200b048: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200b04c: 40 00 07 e9 call 200cff0 <_Thread_Enable_dispatch> 200b050: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200b054: 81 c7 e0 08 ret 200b058: 81 e8 00 00 restore =============================================================================== 020155fc : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 20155fc: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2015600: 11 00 80 f6 sethi %hi(0x203d800), %o0 2015604: 92 10 00 18 mov %i0, %o1 2015608: 90 12 22 98 or %o0, 0x298, %o0 201560c: 40 00 0b 32 call 20182d4 <_Objects_Get> 2015610: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015614: c2 07 bf fc ld [ %fp + -4 ], %g1 2015618: 80 a0 60 00 cmp %g1, 0 201561c: 12 80 00 0a bne 2015644 2015620: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2015624: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015628: 80 a0 60 04 cmp %g1, 4 201562c: 02 80 00 04 be 201563c <== NEVER TAKEN 2015630: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2015634: 40 00 13 d3 call 201a580 <_Watchdog_Remove> 2015638: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 201563c: 40 00 0d c3 call 2018d48 <_Thread_Enable_dispatch> 2015640: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015644: 81 c7 e0 08 ret 2015648: 81 e8 00 00 restore =============================================================================== 02015aec : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2015aec: 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; 2015af0: 03 00 80 f6 sethi %hi(0x203d800), %g1 2015af4: e0 00 62 d8 ld [ %g1 + 0x2d8 ], %l0 ! 203dad8 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2015af8: 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 ) 2015afc: 80 a4 20 00 cmp %l0, 0 2015b00: 02 80 00 32 be 2015bc8 2015b04: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2015b08: 03 00 80 f5 sethi %hi(0x203d400), %g1 2015b0c: c2 08 63 a4 ldub [ %g1 + 0x3a4 ], %g1 ! 203d7a4 <_TOD_Is_set> 2015b10: 80 a0 60 00 cmp %g1, 0 2015b14: 02 80 00 2d be 2015bc8 <== NEVER TAKEN 2015b18: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2015b1c: 80 a6 a0 00 cmp %i2, 0 2015b20: 02 80 00 2a be 2015bc8 2015b24: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2015b28: 7f ff f4 0e call 2012b60 <_TOD_Validate> 2015b2c: 90 10 00 19 mov %i1, %o0 2015b30: 80 8a 20 ff btst 0xff, %o0 2015b34: 22 80 00 25 be,a 2015bc8 2015b38: b0 10 20 14 mov 0x14, %i0 return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2015b3c: 7f ff f3 d5 call 2012a90 <_TOD_To_seconds> 2015b40: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2015b44: 27 00 80 f6 sethi %hi(0x203d800), %l3 2015b48: c2 04 e0 24 ld [ %l3 + 0x24 ], %g1 ! 203d824 <_TOD_Now> 2015b4c: 80 a2 00 01 cmp %o0, %g1 2015b50: 08 80 00 20 bleu 2015bd0 2015b54: a4 10 00 08 mov %o0, %l2 2015b58: 11 00 80 f6 sethi %hi(0x203d800), %o0 2015b5c: 92 10 00 11 mov %l1, %o1 2015b60: 90 12 22 98 or %o0, 0x298, %o0 2015b64: 40 00 09 dc call 20182d4 <_Objects_Get> 2015b68: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2015b6c: c2 07 bf fc ld [ %fp + -4 ], %g1 2015b70: b2 10 00 08 mov %o0, %i1 2015b74: 80 a0 60 00 cmp %g1, 0 2015b78: 12 80 00 14 bne 2015bc8 2015b7c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2015b80: 40 00 12 80 call 201a580 <_Watchdog_Remove> 2015b84: 90 02 20 10 add %o0, 0x10, %o0 the_watchdog->routine = routine; the_watchdog->id = id; 2015b88: e2 26 60 30 st %l1, [ %i1 + 0x30 ] 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(); 2015b8c: c4 04 e0 24 ld [ %l3 + 0x24 ], %g2 (*timer_server->schedule_operation)( timer_server, the_timer ); 2015b90: c2 04 20 04 ld [ %l0 + 4 ], %g1 2015b94: 90 10 00 10 mov %l0, %o0 2015b98: 92 10 00 19 mov %i1, %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(); 2015b9c: a4 24 80 02 sub %l2, %g2, %l2 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; 2015ba0: 84 10 20 03 mov 3, %g2 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2015ba4: f4 26 60 2c st %i2, [ %i1 + 0x2c ] 2015ba8: c4 26 60 38 st %g2, [ %i1 + 0x38 ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2015bac: f6 26 60 34 st %i3, [ %i1 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2015bb0: e4 26 60 1c st %l2, [ %i1 + 0x1c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2015bb4: c0 26 60 18 clr [ %i1 + 0x18 ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2015bb8: 9f c0 40 00 call %g1 2015bbc: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2015bc0: 40 00 0c 62 call 2018d48 <_Thread_Enable_dispatch> 2015bc4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2015bc8: 81 c7 e0 08 ret 2015bcc: 81 e8 00 00 restore 2015bd0: b0 10 20 14 mov 0x14, %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015bd4: 81 c7 e0 08 ret 2015bd8: 81 e8 00 00 restore