02006350 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2006350: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 2006354: 23 00 80 6b sethi %hi(0x201ac00), %l1 2006358: e0 04 62 54 ld [ %l1 + 0x254 ], %l0 ! 201ae54 <_API_extensions_List> 200635c: a2 14 62 54 or %l1, 0x254, %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 2006360: a2 04 60 04 add %l1, 4, %l1 2006364: 80 a4 00 11 cmp %l0, %l1 2006368: 02 80 00 09 be 200638c <_API_extensions_Run_postdriver+0x3c> 200636c: 01 00 00 00 nop * Currently all APIs configure this hook so it is always non-NULL. */ #if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API) if ( the_extension->postdriver_hook ) #endif (*the_extension->postdriver_hook)(); 2006370: c2 04 20 08 ld [ %l0 + 8 ], %g1 2006374: 9f c0 40 00 call %g1 2006378: 01 00 00 00 nop Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 200637c: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 2006380: 80 a4 00 11 cmp %l0, %l1 2006384: 32 bf ff fc bne,a 2006374 <_API_extensions_Run_postdriver+0x24> 2006388: c2 04 20 08 ld [ %l0 + 8 ], %g1 <== NOT EXECUTED 200638c: 81 c7 e0 08 ret 2006390: 81 e8 00 00 restore 02006394 <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 2006394: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 2006398: 23 00 80 6b sethi %hi(0x201ac00), %l1 200639c: e0 04 62 54 ld [ %l1 + 0x254 ], %l0 ! 201ae54 <_API_extensions_List> 20063a0: a2 14 62 54 or %l1, 0x254, %l1 20063a4: a2 04 60 04 add %l1, 4, %l1 20063a8: 80 a4 00 11 cmp %l0, %l1 20063ac: 02 80 00 0a be 20063d4 <_API_extensions_Run_postswitch+0x40> 20063b0: 25 00 80 6b sethi %hi(0x201ac00), %l2 20063b4: a4 14 a0 d0 or %l2, 0xd0, %l2 ! 201acd0 <_Thread_Executing> * provide this hook. */ #if defined(RTEMS_ITRON_API) if ( the_extension->postswitch_hook ) #endif (*the_extension->postswitch_hook)( _Thread_Executing ); 20063b8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 20063bc: 9f c0 40 00 call %g1 20063c0: d0 04 80 00 ld [ %l2 ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 20063c4: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 20063c8: 80 a4 00 11 cmp %l0, %l1 20063cc: 32 bf ff fc bne,a 20063bc <_API_extensions_Run_postswitch+0x28> 20063d0: c2 04 20 0c ld [ %l0 + 0xc ], %g1 <== NOT EXECUTED 20063d4: 81 c7 e0 08 ret 20063d8: 81 e8 00 00 restore 0200b960 <_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 ) { 200b960: 9d e3 bf a0 save %sp, -96, %sp { Thread_Control *executing; /* disabled when you get here */ executing = _Thread_Executing; 200b964: 03 00 80 6b sethi %hi(0x201ac00), %g1 200b968: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 ! 201acd0 <_Thread_Executing> executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; 200b96c: c0 20 60 34 clr [ %g1 + 0x34 ] if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 200b970: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 200b974: 80 a0 a0 00 cmp %g2, 0 200b978: 22 80 00 13 be,a 200b9c4 <_CORE_mutex_Seize_interrupt_trylock+0x64> 200b97c: c4 06 20 5c ld [ %i0 + 0x5c ], %g2 the_mutex->lock = CORE_MUTEX_LOCKED; 200b980: c0 26 20 50 clr [ %i0 + 0x50 ] the_mutex->holder = executing; the_mutex->holder_id = executing->Object.id; 200b984: 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; 200b988: 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; 200b98c: 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; 200b990: c2 26 20 5c st %g1, [ %i0 + 0x5c ] the_mutex->holder_id = executing->Object.id; the_mutex->nest_count = 1; 200b994: 86 10 20 01 mov 1, %g3 if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 200b998: 80 a0 a0 02 cmp %g2, 2 200b99c: 02 80 00 0f be 200b9d8 <_CORE_mutex_Seize_interrupt_trylock+0x78> 200b9a0: c6 26 20 54 st %g3, [ %i0 + 0x54 ] 200b9a4: 80 a0 a0 03 cmp %g2, 3 200b9a8: 22 80 00 1f be,a 200ba24 <_CORE_mutex_Seize_interrupt_trylock+0xc4> 200b9ac: da 00 60 1c ld [ %g1 + 0x1c ], %o5 executing->resource_count++; } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 200b9b0: d0 06 40 00 ld [ %i1 ], %o0 200b9b4: 7f ff d8 f3 call 2001d80 200b9b8: b0 10 20 00 clr %i0 200b9bc: 81 c7 e0 08 ret 200b9c0: 81 e8 00 00 restore /* * 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 ) ) { 200b9c4: 80 a0 40 02 cmp %g1, %g2 200b9c8: 22 80 00 0c be,a 200b9f8 <_CORE_mutex_Seize_interrupt_trylock+0x98> 200b9cc: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 return _CORE_mutex_Seize_interrupt_trylock_body( the_mutex, level_p ); } 200b9d0: 81 c7 e0 08 ret 200b9d4: 91 e8 20 01 restore %g0, 1, %o0 _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 200b9d8: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 200b9dc: 84 00 a0 01 inc %g2 200b9e0: c4 20 60 1c st %g2, [ %g1 + 0x1c ] } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 200b9e4: d0 06 40 00 ld [ %i1 ], %o0 200b9e8: 7f ff d8 e6 call 2001d80 200b9ec: b0 10 20 00 clr %i0 200b9f0: 81 c7 e0 08 ret 200b9f4: 81 e8 00 00 restore * 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 ) ) { switch ( the_mutex->Attributes.lock_nesting_behavior ) { 200b9f8: 80 a0 a0 00 cmp %g2, 0 200b9fc: 12 80 00 2b bne 200baa8 <_CORE_mutex_Seize_interrupt_trylock+0x148> 200ba00: 80 a0 a0 01 cmp %g2, 1 case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; 200ba04: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 200ba08: 82 00 60 01 inc %g1 200ba0c: c2 26 20 54 st %g1, [ %i0 + 0x54 ] _ISR_Enable( *level_p ); 200ba10: d0 06 40 00 ld [ %i1 ], %o0 200ba14: 7f ff d8 db call 2001d80 200ba18: b0 10 20 00 clr %i0 200ba1c: 81 c7 e0 08 ret 200ba20: 81 e8 00 00 restore { Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; current = executing->current_priority; 200ba24: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 200ba28: 88 03 60 01 add %o5, 1, %g4 200ba2c: c8 20 60 1c st %g4, [ %g1 + 0x1c ] */ { Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; 200ba30: c8 06 20 4c ld [ %i0 + 0x4c ], %g4 current = executing->current_priority; if ( current == ceiling ) { 200ba34: 80 a1 00 02 cmp %g4, %g2 200ba38: 02 80 00 24 be 200bac8 <_CORE_mutex_Seize_interrupt_trylock+0x168> 200ba3c: 01 00 00 00 nop _ISR_Enable( *level_p ); return 0; } if ( current > ceiling ) { 200ba40: 1a 80 00 11 bcc 200ba84 <_CORE_mutex_Seize_interrupt_trylock+0x124> 200ba44: 84 10 20 06 mov 6, %g2 ! 6 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200ba48: 03 00 80 6b sethi %hi(0x201ac00), %g1 200ba4c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 ! 201ac10 <_Thread_Dispatch_disable_level> 200ba50: 84 00 a0 01 inc %g2 200ba54: c4 20 60 10 st %g2, [ %g1 + 0x10 ] _Thread_Disable_dispatch(); _ISR_Enable( *level_p ); 200ba58: 7f ff d8 ca call 2001d80 200ba5c: d0 06 40 00 ld [ %i1 ], %o0 _Thread_Change_priority( 200ba60: d2 06 20 4c ld [ %i0 + 0x4c ], %o1 200ba64: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 200ba68: 94 10 20 00 clr %o2 200ba6c: 7f ff ef 3e call 2007764 <_Thread_Change_priority> 200ba70: b0 10 20 00 clr %i0 the_mutex->holder, the_mutex->Attributes.priority_ceiling, false ); _Thread_Enable_dispatch(); 200ba74: 7f ff f0 da call 2007ddc <_Thread_Enable_dispatch> 200ba78: 01 00 00 00 nop 200ba7c: 81 c7 e0 08 ret 200ba80: 81 e8 00 00 restore return 0; } /* if ( current < ceiling ) */ { executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED; 200ba84: c4 20 60 34 st %g2, [ %g1 + 0x34 ] the_mutex->lock = CORE_MUTEX_UNLOCKED; 200ba88: c6 26 20 50 st %g3, [ %i0 + 0x50 ] the_mutex->nest_count = 0; /* undo locking above */ 200ba8c: c0 26 20 54 clr [ %i0 + 0x54 ] executing->resource_count--; /* undo locking above */ 200ba90: da 20 60 1c st %o5, [ %g1 + 0x1c ] _ISR_Enable( *level_p ); 200ba94: d0 06 40 00 ld [ %i1 ], %o0 200ba98: 7f ff d8 ba call 2001d80 200ba9c: b0 10 20 00 clr %i0 200baa0: 81 c7 e0 08 ret 200baa4: 81 e8 00 00 restore * 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 ) ) { switch ( the_mutex->Attributes.lock_nesting_behavior ) { 200baa8: 12 bf ff ca bne 200b9d0 <_CORE_mutex_Seize_interrupt_trylock+0x70> 200baac: 84 10 20 02 mov 2, %g2 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; 200bab0: c4 20 60 34 st %g2, [ %g1 + 0x34 ] <== NOT EXECUTED _ISR_Enable( *level_p ); 200bab4: d0 06 40 00 ld [ %i1 ], %o0 <== NOT EXECUTED 200bab8: 7f ff d8 b2 call 2001d80 <== NOT EXECUTED 200babc: b0 10 20 00 clr %i0 <== NOT EXECUTED 200bac0: 81 c7 e0 08 ret <== NOT EXECUTED 200bac4: 81 e8 00 00 restore <== NOT EXECUTED Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; current = executing->current_priority; if ( current == ceiling ) { _ISR_Enable( *level_p ); 200bac8: d0 06 40 00 ld [ %i1 ], %o0 200bacc: 7f ff d8 ad call 2001d80 200bad0: b0 10 20 00 clr %i0 200bad4: 81 c7 e0 08 ret 200bad8: 81 e8 00 00 restore 0200674c <_CORE_mutex_Surrender>: #else Objects_Id id __attribute__((unused)), CORE_mutex_API_mp_support_callout api_mutex_mp_support __attribute__((unused)) #endif ) { 200674c: 9d e3 bf a0 save %sp, -96, %sp * allowed when the mutex in quetion is FIFO or simple Priority * discipline. But Priority Ceiling or Priority Inheritance mutexes * must be released by the thread which acquired them. */ if ( the_mutex->Attributes.only_owner_release ) { 2006750: c2 0e 20 44 ldub [ %i0 + 0x44 ], %g1 #else Objects_Id id __attribute__((unused)), CORE_mutex_API_mp_support_callout api_mutex_mp_support __attribute__((unused)) #endif ) { 2006754: a0 10 00 18 mov %i0, %l0 * allowed when the mutex in quetion is FIFO or simple Priority * discipline. But Priority Ceiling or Priority Inheritance mutexes * must be released by the thread which acquired them. */ if ( the_mutex->Attributes.only_owner_release ) { 2006758: 80 a0 60 00 cmp %g1, 0 200675c: 02 80 00 07 be 2006778 <_CORE_mutex_Surrender+0x2c> 2006760: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 if ( !_Thread_Is_executing( holder ) ) 2006764: 03 00 80 6b sethi %hi(0x201ac00), %g1 2006768: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 ! 201acd0 <_Thread_Executing> 200676c: 80 a2 00 01 cmp %o0, %g1 2006770: 12 80 00 31 bne 2006834 <_CORE_mutex_Surrender+0xe8> 2006774: b0 10 20 03 mov 3, %i0 return CORE_MUTEX_STATUS_NOT_OWNER_OF_RESOURCE; } /* XXX already unlocked -- not right status */ if ( !the_mutex->nest_count ) 2006778: c2 04 20 54 ld [ %l0 + 0x54 ], %g1 200677c: 80 a0 60 00 cmp %g1, 0 2006780: 02 80 00 22 be 2006808 <_CORE_mutex_Surrender+0xbc> 2006784: 82 00 7f ff add %g1, -1, %g1 return CORE_MUTEX_STATUS_SUCCESSFUL; the_mutex->nest_count--; if ( the_mutex->nest_count != 0 ) { 2006788: 80 a0 60 00 cmp %g1, 0 200678c: 12 80 00 1f bne 2006808 <_CORE_mutex_Surrender+0xbc> 2006790: c2 24 20 54 st %g1, [ %l0 + 0x54 ] */ RTEMS_INLINE_ROUTINE bool _CORE_mutex_Is_inherit_priority( CORE_mutex_Attributes *the_attribute ) { return the_attribute->discipline == CORE_MUTEX_DISCIPLINES_PRIORITY_INHERIT; 2006794: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 /* * Formally release the mutex before possibly transferring it to a * blocked thread. */ if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 2006798: 80 a0 60 02 cmp %g1, 2 200679c: 02 80 00 34 be 200686c <_CORE_mutex_Surrender+0x120> 20067a0: 80 a0 60 03 cmp %g1, 3 20067a4: 22 80 00 33 be,a 2006870 <_CORE_mutex_Surrender+0x124> 20067a8: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 } first_node = _Chain_Get_first_unprotected(&holder->lock_mutex); #endif holder->resource_count--; } the_mutex->holder = NULL; 20067ac: c0 24 20 5c clr [ %l0 + 0x5c ] /* * Whether or not someone is waiting for the mutex, an * inherited priority must be lowered if this is the last * mutex (i.e. resource) this task has. */ if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 20067b0: 80 a0 60 02 cmp %g1, 2 20067b4: 02 80 00 22 be 200683c <_CORE_mutex_Surrender+0xf0> 20067b8: c0 24 20 60 clr [ %l0 + 0x60 ] 20067bc: 80 a0 60 03 cmp %g1, 3 20067c0: 22 80 00 20 be,a 2006840 <_CORE_mutex_Surrender+0xf4> 20067c4: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 /* * Now we check if another thread was waiting for this mutex. If so, * transfer the mutex to that thread. */ if ( ( the_thread = _Thread_queue_Dequeue( &the_mutex->Wait_queue ) ) ) { 20067c8: 40 00 06 82 call 20081d0 <_Thread_queue_Dequeue> 20067cc: 90 10 00 10 mov %l0, %o0 20067d0: 82 92 20 00 orcc %o0, 0, %g1 20067d4: 22 80 00 2f be,a 2006890 <_CORE_mutex_Surrender+0x144> 20067d8: 82 10 20 01 mov 1, %g1 } else #endif { the_mutex->holder = the_thread; the_mutex->holder_id = the_thread->Object.id; 20067dc: c6 00 60 08 ld [ %g1 + 8 ], %g3 the_mutex->nest_count = 1; switch ( the_mutex->Attributes.discipline ) { 20067e0: c4 04 20 48 ld [ %l0 + 0x48 ], %g2 } else #endif { the_mutex->holder = the_thread; the_mutex->holder_id = the_thread->Object.id; 20067e4: c6 24 20 60 st %g3, [ %l0 + 0x60 ] } else #endif { the_mutex->holder = the_thread; 20067e8: c2 24 20 5c st %g1, [ %l0 + 0x5c ] the_mutex->holder_id = the_thread->Object.id; the_mutex->nest_count = 1; 20067ec: 86 10 20 01 mov 1, %g3 switch ( the_mutex->Attributes.discipline ) { 20067f0: 80 a0 a0 02 cmp %g2, 2 20067f4: 02 80 00 22 be 200687c <_CORE_mutex_Surrender+0x130> 20067f8: c6 24 20 54 st %g3, [ %l0 + 0x54 ] 20067fc: 80 a0 a0 03 cmp %g2, 3 2006800: 22 80 00 04 be,a 2006810 <_CORE_mutex_Surrender+0xc4> 2006804: c6 00 60 1c ld [ %g1 + 0x1c ], %g3 } } else the_mutex->lock = CORE_MUTEX_UNLOCKED; return CORE_MUTEX_STATUS_SUCCESSFUL; } 2006808: 81 c7 e0 08 ret 200680c: 91 e8 20 00 restore %g0, 0, %o0 _Chain_Prepend_unprotected(&the_thread->lock_mutex,&the_mutex->queue.lock_queue); the_mutex->queue.priority_before = the_thread->current_priority; #endif the_thread->resource_count++; if (the_mutex->Attributes.priority_ceiling < the_thread->current_priority){ 2006810: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 case CORE_MUTEX_DISCIPLINES_PRIORITY_CEILING: #ifdef __RTEMS_STRICT_ORDER_MUTEX__ _Chain_Prepend_unprotected(&the_thread->lock_mutex,&the_mutex->queue.lock_queue); the_mutex->queue.priority_before = the_thread->current_priority; #endif the_thread->resource_count++; 2006814: 86 00 e0 01 inc %g3 2006818: c6 20 60 1c st %g3, [ %g1 + 0x1c ] if (the_mutex->Attributes.priority_ceiling < 200681c: d2 04 20 4c ld [ %l0 + 0x4c ], %o1 the_thread->current_priority){ 2006820: 80 a2 40 02 cmp %o1, %g2 2006824: 1a bf ff f9 bcc 2006808 <_CORE_mutex_Surrender+0xbc> 2006828: 94 10 20 00 clr %o2 _Thread_Change_priority( 200682c: 40 00 03 ce call 2007764 <_Thread_Change_priority> <== NOT EXECUTED 2006830: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006834: 81 c7 e0 08 ret 2006838: 81 e8 00 00 restore _CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { #ifdef __RTEMS_STRICT_ORDER_MUTEX__ if(the_mutex->queue.priority_before != holder->current_priority) _Thread_Change_priority(holder,the_mutex->queue.priority_before,true); #endif if ( holder->resource_count == 0 && 200683c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 2006840: 80 a0 60 00 cmp %g1, 0 2006844: 12 bf ff e1 bne 20067c8 <_CORE_mutex_Surrender+0x7c> 2006848: 01 00 00 00 nop holder->real_priority != holder->current_priority ) { 200684c: d2 02 20 18 ld [ %o0 + 0x18 ], %o1 2006850: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 2006854: 80 a2 40 01 cmp %o1, %g1 2006858: 02 bf ff dc be 20067c8 <_CORE_mutex_Surrender+0x7c> 200685c: 01 00 00 00 nop _Thread_Change_priority( holder, holder->real_priority, true ); 2006860: 40 00 03 c1 call 2007764 <_Thread_Change_priority> 2006864: 94 10 20 01 mov 1, %o2 ! 1 2006868: 30 bf ff d8 b,a 20067c8 <_CORE_mutex_Surrender+0x7c> the_mutex->nest_count++; return CORE_MUTEX_RELEASE_NOT_ORDER; } first_node = _Chain_Get_first_unprotected(&holder->lock_mutex); #endif holder->resource_count--; 200686c: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 2006870: 84 00 bf ff add %g2, -1, %g2 2006874: 10 bf ff ce b 20067ac <_CORE_mutex_Surrender+0x60> 2006878: c4 22 20 1c st %g2, [ %o0 + 0x1c ] case CORE_MUTEX_DISCIPLINES_PRIORITY_INHERIT: #ifdef __RTEMS_STRICT_ORDER_MUTEX__ _Chain_Prepend_unprotected(&the_thread->lock_mutex,&the_mutex->queue.lock_queue); the_mutex->queue.priority_before = the_thread->current_priority; #endif the_thread->resource_count++; 200687c: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 2006880: 84 00 a0 01 inc %g2 2006884: c4 20 60 1c st %g2, [ %g1 + 0x1c ] break; 2006888: 81 c7 e0 08 ret 200688c: 91 e8 20 00 restore %g0, 0, %o0 } break; } } } else the_mutex->lock = CORE_MUTEX_UNLOCKED; 2006890: c2 24 20 50 st %g1, [ %l0 + 0x50 ] 2006894: 81 c7 e0 08 ret 2006898: 91 e8 20 00 restore %g0, 0, %o0 0200bbd4 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200bbd4: 9d e3 bf 98 save %sp, -104, %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; 200bbd8: a8 06 60 04 add %i1, 4, %l4 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200bbdc: a0 10 00 18 mov %i0, %l0 - HEAP_BLOCK_SIZE_OFFSET; uintptr_t const page_size = heap->page_size; uintptr_t alloc_begin = 0; uint32_t search_count = 0; if ( block_size_floor < alloc_size ) { 200bbe0: 80 a6 40 14 cmp %i1, %l4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200bbe4: e4 06 20 08 ld [ %i0 + 8 ], %l2 200bbe8: 18 80 00 75 bgu 200bdbc <_Heap_Allocate_aligned_with_boundary+0x1e8> 200bbec: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200bbf0: 80 a6 e0 00 cmp %i3, 0 200bbf4: 12 80 00 70 bne 200bdb4 <_Heap_Allocate_aligned_with_boundary+0x1e0> 200bbf8: 80 a6 40 1b cmp %i1, %i3 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200bbfc: 80 a4 00 12 cmp %l0, %l2 200bc00: 02 80 00 72 be 200bdc8 <_Heap_Allocate_aligned_with_boundary+0x1f4> 200bc04: 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; 200bc08: 82 10 20 04 mov 4, %g1 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200bc0c: b8 07 60 07 add %i5, 7, %i4 uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200bc10: 82 20 40 19 sub %g1, %i1, %g1 200bc14: 10 80 00 09 b 200bc38 <_Heap_Allocate_aligned_with_boundary+0x64> 200bc18: c2 27 bf fc st %g1, [ %fp + -4 ] boundary ); } } if ( alloc_begin != 0 ) { 200bc1c: 80 a6 20 00 cmp %i0, 0 200bc20: 32 80 00 57 bne,a 200bd7c <_Heap_Allocate_aligned_with_boundary+0x1a8> 200bc24: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 break; } block = block->next; 200bc28: e4 04 a0 08 ld [ %l2 + 8 ], %l2 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200bc2c: 80 a4 00 12 cmp %l0, %l2 200bc30: 22 80 00 5a be,a 200bd98 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200bc34: b0 10 20 00 clr %i0 /* * 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 ) { 200bc38: e6 04 a0 04 ld [ %l2 + 4 ], %l3 200bc3c: 80 a5 00 13 cmp %l4, %l3 200bc40: 1a bf ff fa bcc 200bc28 <_Heap_Allocate_aligned_with_boundary+0x54> 200bc44: a2 04 60 01 inc %l1 if ( alignment == 0 ) { 200bc48: 80 a6 a0 00 cmp %i2, 0 200bc4c: 02 bf ff f4 be 200bc1c <_Heap_Allocate_aligned_with_boundary+0x48> 200bc50: b0 04 a0 08 add %l2, 8, %i0 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; 200bc54: c2 07 bf fc ld [ %fp + -4 ], %g1 uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200bc58: ee 04 20 14 ld [ %l0 + 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; 200bc5c: a6 0c ff fe and %l3, -2, %l3 200bc60: 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; 200bc64: b0 00 40 13 add %g1, %l3, %i0 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200bc68: 82 27 00 17 sub %i4, %l7, %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200bc6c: 90 10 00 18 mov %i0, %o0 200bc70: a6 00 40 13 add %g1, %l3, %l3 200bc74: 40 00 2f 3b call 2017960 <.urem> 200bc78: 92 10 00 1a mov %i2, %o1 200bc7c: b0 26 00 08 sub %i0, %o0, %i0 uintptr_t alloc_begin = alloc_end - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { 200bc80: 80 a4 c0 18 cmp %l3, %i0 200bc84: 1a 80 00 06 bcc 200bc9c <_Heap_Allocate_aligned_with_boundary+0xc8> 200bc88: ac 04 a0 08 add %l2, 8, %l6 200bc8c: 90 10 00 13 mov %l3, %o0 200bc90: 40 00 2f 34 call 2017960 <.urem> 200bc94: 92 10 00 1a mov %i2, %o1 200bc98: b0 24 c0 08 sub %l3, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200bc9c: 80 a6 e0 00 cmp %i3, 0 200bca0: 02 80 00 26 be 200bd38 <_Heap_Allocate_aligned_with_boundary+0x164> 200bca4: 80 a5 80 18 cmp %l6, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200bca8: a6 06 00 19 add %i0, %i1, %l3 200bcac: 92 10 00 1b mov %i3, %o1 200bcb0: 40 00 2f 2c call 2017960 <.urem> 200bcb4: 90 10 00 13 mov %l3, %o0 200bcb8: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200bcbc: 80 a4 c0 08 cmp %l3, %o0 200bcc0: 08 80 00 1e bleu 200bd38 <_Heap_Allocate_aligned_with_boundary+0x164> 200bcc4: 80 a5 80 18 cmp %l6, %i0 200bcc8: 80 a6 00 08 cmp %i0, %o0 200bccc: 1a 80 00 1b bcc 200bd38 <_Heap_Allocate_aligned_with_boundary+0x164> 200bcd0: 80 a5 80 18 cmp %l6, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200bcd4: aa 05 80 19 add %l6, %i1, %l5 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200bcd8: 80 a5 40 08 cmp %l5, %o0 200bcdc: 28 80 00 0a bleu,a 200bd04 <_Heap_Allocate_aligned_with_boundary+0x130> 200bce0: b0 22 00 19 sub %o0, %i1, %i0 if ( alloc_begin != 0 ) { break; } block = block->next; 200bce4: 10 bf ff d2 b 200bc2c <_Heap_Allocate_aligned_with_boundary+0x58> 200bce8: e4 04 a0 08 ld [ %l2 + 8 ], %l2 /* 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 ) { 200bcec: 1a 80 00 13 bcc 200bd38 <_Heap_Allocate_aligned_with_boundary+0x164> 200bcf0: 80 a5 80 18 cmp %l6, %i0 if ( boundary_line < boundary_floor ) { 200bcf4: 80 a5 40 08 cmp %l5, %o0 200bcf8: 38 bf ff cd bgu,a 200bc2c <_Heap_Allocate_aligned_with_boundary+0x58> 200bcfc: e4 04 a0 08 ld [ %l2 + 8 ], %l2 <== NOT EXECUTED return 0; } alloc_begin = boundary_line - alloc_size; 200bd00: b0 22 00 19 sub %o0, %i1, %i0 200bd04: 92 10 00 1a mov %i2, %o1 200bd08: 40 00 2f 16 call 2017960 <.urem> 200bd0c: 90 10 00 18 mov %i0, %o0 200bd10: 92 10 00 1b mov %i3, %o1 200bd14: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200bd18: a6 06 00 19 add %i0, %i1, %l3 200bd1c: 40 00 2f 11 call 2017960 <.urem> 200bd20: 90 10 00 13 mov %l3, %o0 200bd24: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200bd28: 80 a4 c0 08 cmp %l3, %o0 200bd2c: 18 bf ff f0 bgu 200bcec <_Heap_Allocate_aligned_with_boundary+0x118> 200bd30: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200bd34: 80 a5 80 18 cmp %l6, %i0 200bd38: 18 bf ff bc bgu 200bc28 <_Heap_Allocate_aligned_with_boundary+0x54> 200bd3c: 82 10 3f f8 mov -8, %g1 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; 200bd40: 90 10 00 18 mov %i0, %o0 200bd44: a6 20 40 12 sub %g1, %l2, %l3 200bd48: 92 10 00 1d mov %i5, %o1 200bd4c: 40 00 2f 05 call 2017960 <.urem> 200bd50: a6 04 c0 18 add %l3, %i0, %l3 if ( free_size >= min_block_size || free_size == 0 ) { 200bd54: 90 a4 c0 08 subcc %l3, %o0, %o0 200bd58: 02 bf ff b2 be 200bc20 <_Heap_Allocate_aligned_with_boundary+0x4c> 200bd5c: 80 a6 20 00 cmp %i0, 0 200bd60: 80 a5 c0 08 cmp %l7, %o0 200bd64: 38 bf ff b2 bgu,a 200bc2c <_Heap_Allocate_aligned_with_boundary+0x58> 200bd68: e4 04 a0 08 ld [ %l2 + 8 ], %l2 boundary ); } } if ( alloc_begin != 0 ) { 200bd6c: 80 a6 20 00 cmp %i0, 0 200bd70: 22 bf ff af be,a 200bc2c <_Heap_Allocate_aligned_with_boundary+0x58> 200bd74: e4 04 a0 08 ld [ %l2 + 8 ], %l2 <== NOT EXECUTED block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200bd78: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200bd7c: 92 10 00 12 mov %l2, %o1 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200bd80: 82 00 40 11 add %g1, %l1, %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200bd84: 96 10 00 19 mov %i1, %o3 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200bd88: c2 24 20 4c st %g1, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200bd8c: 90 10 00 10 mov %l0, %o0 200bd90: 7f ff eb ba call 2006c78 <_Heap_Block_allocate> 200bd94: 94 10 00 18 mov %i0, %o2 uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { Heap_Statistics *const stats = &heap->stats; 200bd98: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200bd9c: 80 a0 40 11 cmp %g1, %l1 200bda0: 1a 80 00 08 bcc 200bdc0 <_Heap_Allocate_aligned_with_boundary+0x1ec> 200bda4: 01 00 00 00 nop ); } /* Statistics */ if ( stats->max_search < search_count ) { stats->max_search = search_count; 200bda8: e2 24 20 44 st %l1, [ %l0 + 0x44 ] 200bdac: 81 c7 e0 08 ret 200bdb0: 81 e8 00 00 restore /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200bdb4: 08 80 00 07 bleu 200bdd0 <_Heap_Allocate_aligned_with_boundary+0x1fc> 200bdb8: 80 a6 a0 00 cmp %i2, 0 ); } /* Statistics */ if ( stats->max_search < search_count ) { stats->max_search = search_count; 200bdbc: b0 10 20 00 clr %i0 } return (void *) alloc_begin; } 200bdc0: 81 c7 e0 08 ret 200bdc4: 81 e8 00 00 restore if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200bdc8: 10 bf ff f4 b 200bd98 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200bdcc: b0 10 20 00 clr %i0 if ( boundary != 0 ) { if ( boundary < alloc_size ) { return NULL; } if ( alignment == 0 ) { 200bdd0: 22 bf ff 8b be,a 200bbfc <_Heap_Allocate_aligned_with_boundary+0x28> 200bdd4: b4 10 00 1d mov %i5, %i2 alignment = page_size; } } while ( block != free_list_tail ) { 200bdd8: 10 bf ff 8a b 200bc00 <_Heap_Allocate_aligned_with_boundary+0x2c> 200bddc: 80 a4 00 12 cmp %l0, %l2 02007bfc <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2007bfc: 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; 2007c00: 25 00 80 20 sethi %hi(0x2008000), %l2 2007c04: 80 8e a0 ff btst 0xff, %i2 2007c08: a4 14 a1 fc or %l2, 0x1fc, %l2 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2007c0c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 uintptr_t const min_block_size = heap->min_block_size; 2007c10: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const last_block = heap->last_block; 2007c14: 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; 2007c18: 12 80 00 04 bne 2007c28 <_Heap_Walk+0x2c> 2007c1c: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 2007c20: 25 00 80 1e sethi %hi(0x2007800), %l2 2007c24: a4 14 a3 f4 or %l2, 0x3f4, %l2 ! 2007bf4 <_Heap_Walk_print_nothing> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2007c28: 03 00 80 75 sethi %hi(0x201d400), %g1 2007c2c: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1 ! 201d5b0 <_System_state_Current> 2007c30: 80 a0 60 03 cmp %g1, 3 2007c34: 22 80 00 04 be,a 2007c44 <_Heap_Walk+0x48> 2007c38: da 06 20 18 ld [ %i0 + 0x18 ], %o5 block = next_block; } return true; } 2007c3c: 81 c7 e0 08 ret 2007c40: 91 e8 20 01 restore %g0, 1, %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)( 2007c44: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 2007c48: c4 06 20 08 ld [ %i0 + 8 ], %g2 2007c4c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2007c50: 90 10 00 19 mov %i1, %o0 2007c54: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2007c58: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2007c5c: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2007c60: e0 23 a0 60 st %l0, [ %sp + 0x60 ] 2007c64: e8 23 a0 64 st %l4, [ %sp + 0x64 ] 2007c68: 92 10 20 00 clr %o1 2007c6c: 15 00 80 6a sethi %hi(0x201a800), %o2 2007c70: 96 10 00 15 mov %l5, %o3 2007c74: 94 12 a1 60 or %o2, 0x160, %o2 2007c78: 9f c4 80 00 call %l2 2007c7c: 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 ) { 2007c80: 80 a5 60 00 cmp %l5, 0 2007c84: 02 80 00 36 be 2007d5c <_Heap_Walk+0x160> 2007c88: 80 8d 60 07 btst 7, %l5 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2007c8c: 12 80 00 3c bne 2007d7c <_Heap_Walk+0x180> 2007c90: 90 10 00 13 mov %l3, %o0 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2007c94: 7f ff e7 8c call 2001ac4 <.urem> 2007c98: 92 10 00 15 mov %l5, %o1 2007c9c: 80 a2 20 00 cmp %o0, 0 2007ca0: 12 80 00 40 bne 2007da0 <_Heap_Walk+0x1a4> 2007ca4: 90 04 20 08 add %l0, 8, %o0 ); return false; } if ( 2007ca8: 7f ff e7 87 call 2001ac4 <.urem> 2007cac: 92 10 00 15 mov %l5, %o1 2007cb0: 80 a2 20 00 cmp %o0, 0 2007cb4: 32 80 00 44 bne,a 2007dc4 <_Heap_Walk+0x1c8> 2007cb8: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2007cbc: ec 04 20 04 ld [ %l0 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2007cc0: ae 8d a0 01 andcc %l6, 1, %l7 2007cc4: 22 80 00 48 be,a 2007de4 <_Heap_Walk+0x1e8> 2007cc8: 90 10 00 19 mov %i1, %o0 ); return false; } if ( first_block->prev_size != page_size ) { 2007ccc: d6 04 00 00 ld [ %l0 ], %o3 2007cd0: 80 a5 40 0b cmp %l5, %o3 2007cd4: 32 80 00 1a bne,a 2007d3c <_Heap_Walk+0x140> 2007cd8: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2007cdc: c2 05 20 04 ld [ %l4 + 4 ], %g1 2007ce0: 82 08 7f fe and %g1, -2, %g1 2007ce4: 82 05 00 01 add %l4, %g1, %g1 2007ce8: c2 00 60 04 ld [ %g1 + 4 ], %g1 2007cec: 80 88 60 01 btst 1, %g1 2007cf0: 22 80 01 23 be,a 200817c <_Heap_Walk+0x580> 2007cf4: 90 10 00 19 mov %i1, %o0 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2007cf8: e2 06 20 08 ld [ %i0 + 8 ], %l1 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 ) { 2007cfc: 80 a6 00 11 cmp %i0, %l1 2007d00: 02 80 00 6f be 2007ebc <_Heap_Walk+0x2c0> 2007d04: f4 06 20 10 ld [ %i0 + 0x10 ], %i2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2007d08: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 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 2007d0c: 80 a7 00 11 cmp %i4, %l1 2007d10: 28 80 00 3c bleu,a 2007e00 <_Heap_Walk+0x204> 2007d14: f6 06 20 24 ld [ %i0 + 0x24 ], %i3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2007d18: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2007d1c: 96 10 00 11 mov %l1, %o3 2007d20: 92 10 20 01 mov 1, %o1 2007d24: 15 00 80 6a sethi %hi(0x201a800), %o2 2007d28: b0 10 20 00 clr %i0 2007d2c: 9f c4 80 00 call %l2 2007d30: 94 12 a3 08 or %o2, 0x308, %o2 2007d34: 81 c7 e0 08 ret 2007d38: 81 e8 00 00 restore return false; } if ( first_block->prev_size != page_size ) { (*printer)( 2007d3c: 98 10 00 15 mov %l5, %o4 2007d40: 92 10 20 01 mov 1, %o1 2007d44: 15 00 80 6a sethi %hi(0x201a800), %o2 2007d48: b0 10 20 00 clr %i0 2007d4c: 9f c4 80 00 call %l2 2007d50: 94 12 a2 c0 or %o2, 0x2c0, %o2 2007d54: 81 c7 e0 08 ret 2007d58: 81 e8 00 00 restore first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 2007d5c: 90 10 00 19 mov %i1, %o0 2007d60: 92 10 20 01 mov 1, %o1 2007d64: 15 00 80 6a sethi %hi(0x201a800), %o2 2007d68: b0 10 20 00 clr %i0 2007d6c: 9f c4 80 00 call %l2 2007d70: 94 12 a1 f8 or %o2, 0x1f8, %o2 2007d74: 81 c7 e0 08 ret 2007d78: 81 e8 00 00 restore return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2007d7c: 90 10 00 19 mov %i1, %o0 2007d80: 96 10 00 15 mov %l5, %o3 2007d84: 92 10 20 01 mov 1, %o1 2007d88: 15 00 80 6a sethi %hi(0x201a800), %o2 2007d8c: b0 10 20 00 clr %i0 2007d90: 9f c4 80 00 call %l2 2007d94: 94 12 a2 10 or %o2, 0x210, %o2 2007d98: 81 c7 e0 08 ret 2007d9c: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2007da0: 90 10 00 19 mov %i1, %o0 2007da4: 96 10 00 13 mov %l3, %o3 2007da8: 92 10 20 01 mov 1, %o1 2007dac: 15 00 80 6a sethi %hi(0x201a800), %o2 2007db0: b0 10 20 00 clr %i0 2007db4: 9f c4 80 00 call %l2 2007db8: 94 12 a2 30 or %o2, 0x230, %o2 2007dbc: 81 c7 e0 08 ret 2007dc0: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2007dc4: 96 10 00 10 mov %l0, %o3 2007dc8: 92 10 20 01 mov 1, %o1 2007dcc: 15 00 80 6a sethi %hi(0x201a800), %o2 2007dd0: b0 10 20 00 clr %i0 2007dd4: 9f c4 80 00 call %l2 2007dd8: 94 12 a2 58 or %o2, 0x258, %o2 2007ddc: 81 c7 e0 08 ret 2007de0: 81 e8 00 00 restore return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2007de4: 92 10 20 01 mov 1, %o1 2007de8: 15 00 80 6a sethi %hi(0x201a800), %o2 2007dec: b0 10 20 00 clr %i0 2007df0: 9f c4 80 00 call %l2 2007df4: 94 12 a2 90 or %o2, 0x290, %o2 2007df8: 81 c7 e0 08 ret 2007dfc: 81 e8 00 00 restore 2007e00: 80 a6 c0 11 cmp %i3, %l1 2007e04: 0a bf ff c6 bcs 2007d1c <_Heap_Walk+0x120> 2007e08: 90 10 00 19 mov %i1, %o0 ); return false; } if ( 2007e0c: 90 04 60 08 add %l1, 8, %o0 2007e10: 7f ff e7 2d call 2001ac4 <.urem> 2007e14: 92 10 00 1a mov %i2, %o1 2007e18: 80 a2 20 00 cmp %o0, 0 2007e1c: 12 80 00 df bne 2008198 <_Heap_Walk+0x59c> 2007e20: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2007e24: c2 04 60 04 ld [ %l1 + 4 ], %g1 2007e28: 82 08 7f fe and %g1, -2, %g1 2007e2c: 82 04 40 01 add %l1, %g1, %g1 2007e30: c2 00 60 04 ld [ %g1 + 4 ], %g1 2007e34: 80 88 60 01 btst 1, %g1 2007e38: 12 80 00 ea bne 20081e0 <_Heap_Walk+0x5e4> 2007e3c: 96 10 00 11 mov %l1, %o3 ); return false; } if ( free_block->prev != prev_block ) { 2007e40: d8 04 60 0c ld [ %l1 + 0xc ], %o4 2007e44: 80 a6 00 0c cmp %i0, %o4 2007e48: 02 80 00 19 be 2007eac <_Heap_Walk+0x2b0> 2007e4c: ba 10 00 11 mov %l1, %i5 2007e50: 30 80 00 dc b,a 20081c0 <_Heap_Walk+0x5c4> <== NOT EXECUTED 2007e54: 0a bf ff b2 bcs 2007d1c <_Heap_Walk+0x120> 2007e58: 90 10 00 19 mov %i1, %o0 2007e5c: 80 a6 c0 11 cmp %i3, %l1 2007e60: 0a bf ff b0 bcs 2007d20 <_Heap_Walk+0x124> 2007e64: 96 10 00 11 mov %l1, %o3 ); return false; } if ( 2007e68: 90 04 60 08 add %l1, 8, %o0 2007e6c: 7f ff e7 16 call 2001ac4 <.urem> 2007e70: 92 10 00 1a mov %i2, %o1 2007e74: 80 a2 20 00 cmp %o0, 0 2007e78: 32 80 00 c8 bne,a 2008198 <_Heap_Walk+0x59c> 2007e7c: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2007e80: c2 04 60 04 ld [ %l1 + 4 ], %g1 2007e84: 82 08 7f fe and %g1, -2, %g1 2007e88: 82 00 40 11 add %g1, %l1, %g1 2007e8c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2007e90: 80 88 60 01 btst 1, %g1 2007e94: 32 80 00 d2 bne,a 20081dc <_Heap_Walk+0x5e0> 2007e98: 90 10 00 19 mov %i1, %o0 ); return false; } if ( free_block->prev != prev_block ) { 2007e9c: d8 04 60 0c ld [ %l1 + 0xc ], %o4 2007ea0: 80 a3 00 1d cmp %o4, %i5 2007ea4: 12 80 00 c5 bne 20081b8 <_Heap_Walk+0x5bc> 2007ea8: ba 10 00 11 mov %l1, %i5 return false; } prev_block = free_block; free_block = free_block->next; 2007eac: e2 04 60 08 ld [ %l1 + 8 ], %l1 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 ) { 2007eb0: 80 a6 00 11 cmp %i0, %l1 2007eb4: 12 bf ff e8 bne 2007e54 <_Heap_Walk+0x258> 2007eb8: 80 a4 40 1c cmp %l1, %i4 if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; } while ( block != last_block ) { 2007ebc: 80 a5 00 10 cmp %l4, %l0 2007ec0: 02 bf ff 5f be 2007c3c <_Heap_Walk+0x40> 2007ec4: 37 00 80 6a sethi %hi(0x201a800), %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2007ec8: 35 00 80 6a sethi %hi(0x201a800), %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 2007ecc: 39 00 80 6b sethi %hi(0x201ac00), %i4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2007ed0: ba 10 00 15 mov %l5, %i5 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)( 2007ed4: b6 16 e3 b0 or %i3, 0x3b0, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2007ed8: b4 16 a3 c8 or %i2, 0x3c8, %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 2007edc: b8 17 21 60 or %i4, 0x160, %i4 2007ee0: aa 10 00 14 mov %l4, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2007ee4: ac 0d bf fe and %l6, -2, %l6 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 ) { 2007ee8: 80 a5 e0 00 cmp %l7, 0 2007eec: 02 80 00 16 be 2007f44 <_Heap_Walk+0x348> 2007ef0: a2 05 80 10 add %l6, %l0, %l1 (*printer)( 2007ef4: 90 10 00 19 mov %i1, %o0 2007ef8: 92 10 20 00 clr %o1 2007efc: 94 10 00 1b mov %i3, %o2 2007f00: 96 10 00 10 mov %l0, %o3 2007f04: 9f c4 80 00 call %l2 2007f08: 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 2007f0c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2007f10: 80 a0 40 11 cmp %g1, %l1 2007f14: 28 80 00 18 bleu,a 2007f74 <_Heap_Walk+0x378> 2007f18: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 block->prev_size ); } if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 2007f1c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2007f20: 96 10 00 10 mov %l0, %o3 2007f24: 98 10 00 11 mov %l1, %o4 2007f28: 92 10 20 01 mov 1, %o1 2007f2c: 15 00 80 6a sethi %hi(0x201a800), %o2 2007f30: b0 10 20 00 clr %i0 2007f34: 9f c4 80 00 call %l2 2007f38: 94 12 a3 f0 or %o2, 0x3f0, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2007f3c: 81 c7 e0 08 ret 2007f40: 81 e8 00 00 restore "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2007f44: da 04 00 00 ld [ %l0 ], %o5 2007f48: 90 10 00 19 mov %i1, %o0 2007f4c: 92 10 20 00 clr %o1 2007f50: 94 10 00 1a mov %i2, %o2 2007f54: 96 10 00 10 mov %l0, %o3 2007f58: 9f c4 80 00 call %l2 2007f5c: 98 10 00 16 mov %l6, %o4 2007f60: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2007f64: 80 a0 40 11 cmp %g1, %l1 2007f68: 18 bf ff ee bgu 2007f20 <_Heap_Walk+0x324> 2007f6c: 90 10 00 19 mov %i1, %o0 2007f70: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2007f74: 80 a0 40 11 cmp %g1, %l1 2007f78: 0a bf ff ea bcs 2007f20 <_Heap_Walk+0x324> 2007f7c: 90 10 00 19 mov %i1, %o0 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) ) { 2007f80: 90 10 00 16 mov %l6, %o0 2007f84: 7f ff e6 d0 call 2001ac4 <.urem> 2007f88: 92 10 00 1d mov %i5, %o1 2007f8c: 80 a2 20 00 cmp %o0, 0 2007f90: 12 80 00 5d bne 2008104 <_Heap_Walk+0x508> 2007f94: 80 a4 c0 16 cmp %l3, %l6 ); return false; } if ( block_size < min_block_size ) { 2007f98: 18 80 00 65 bgu 200812c <_Heap_Walk+0x530> 2007f9c: 80 a4 00 11 cmp %l0, %l1 ); return false; } if ( next_block_begin <= block_begin ) { 2007fa0: 3a 80 00 6e bcc,a 2008158 <_Heap_Walk+0x55c> 2007fa4: 90 10 00 19 mov %i1, %o0 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2007fa8: c2 04 60 04 ld [ %l1 + 4 ], %g1 2007fac: 80 88 60 01 btst 1, %g1 2007fb0: 12 80 00 40 bne 20080b0 <_Heap_Walk+0x4b4> 2007fb4: 80 a5 40 11 cmp %l5, %l1 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; 2007fb8: e8 04 20 04 ld [ %l0 + 4 ], %l4 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)( 2007fbc: 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; 2007fc0: 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; 2007fc4: ac 0d 3f fe and %l4, -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; 2007fc8: 1b 00 80 6b sethi %hi(0x201ac00), %o5 2007fcc: 80 a0 40 0c cmp %g1, %o4 } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 2007fd0: 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); 2007fd4: 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; 2007fd8: 02 80 00 07 be 2007ff4 <_Heap_Walk+0x3f8> 2007fdc: 9a 13 60 b8 or %o5, 0xb8, %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)" : ""), 2007fe0: 1b 00 80 6b sethi %hi(0x201ac00), %o5 2007fe4: 80 a3 00 18 cmp %o4, %i0 2007fe8: 02 80 00 03 be 2007ff4 <_Heap_Walk+0x3f8> 2007fec: 9a 13 60 c8 or %o5, 0xc8, %o5 2007ff0: 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)( 2007ff4: c2 04 20 08 ld [ %l0 + 8 ], %g1 2007ff8: 05 00 80 6b sethi %hi(0x201ac00), %g2 2007ffc: 80 a0 c0 01 cmp %g3, %g1 2008000: 02 80 00 07 be 200801c <_Heap_Walk+0x420> 2008004: 84 10 a0 d8 or %g2, 0xd8, %g2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 2008008: 05 00 80 6b sethi %hi(0x201ac00), %g2 200800c: 80 a0 40 18 cmp %g1, %i0 2008010: 02 80 00 03 be 200801c <_Heap_Walk+0x420> 2008014: 84 10 a0 e8 or %g2, 0xe8, %g2 2008018: 84 10 00 1c mov %i4, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200801c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2008020: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 2008024: 90 10 00 19 mov %i1, %o0 2008028: 92 10 20 00 clr %o1 200802c: 15 00 80 6b sethi %hi(0x201ac00), %o2 2008030: 96 10 00 10 mov %l0, %o3 2008034: 9f c4 80 00 call %l2 2008038: 94 12 a0 f8 or %o2, 0xf8, %o2 block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 200803c: da 05 c0 00 ld [ %l7 ], %o5 2008040: 80 a5 80 0d cmp %l6, %o5 2008044: 02 80 00 0c be 2008074 <_Heap_Walk+0x478> 2008048: 90 10 00 19 mov %i1, %o0 (*printer)( 200804c: ee 23 a0 5c st %l7, [ %sp + 0x5c ] 2008050: 96 10 00 10 mov %l0, %o3 2008054: 98 10 00 16 mov %l6, %o4 2008058: 92 10 20 01 mov 1, %o1 200805c: 15 00 80 6b sethi %hi(0x201ac00), %o2 2008060: b0 10 20 00 clr %i0 2008064: 9f c4 80 00 call %l2 2008068: 94 12 a1 28 or %o2, 0x128, %o2 200806c: 81 c7 e0 08 ret 2008070: 81 e8 00 00 restore ); return false; } if ( !prev_used ) { 2008074: 80 8d 20 01 btst 1, %l4 2008078: 02 80 00 1c be 20080e8 <_Heap_Walk+0x4ec> 200807c: 96 10 00 10 mov %l0, %o3 2008080: c2 06 20 08 ld [ %i0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008084: 80 a0 40 18 cmp %g1, %i0 2008088: 12 80 00 07 bne 20080a4 <_Heap_Walk+0x4a8> 200808c: 80 a0 40 10 cmp %g1, %l0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008090: 10 80 00 0f b 20080cc <_Heap_Walk+0x4d0> <== NOT EXECUTED 2008094: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED ) { 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 ) { 2008098: 80 a0 40 18 cmp %g1, %i0 200809c: 02 80 00 0a be 20080c4 <_Heap_Walk+0x4c8> 20080a0: 80 a0 40 10 cmp %g1, %l0 if ( free_block == block ) { 20080a4: 32 bf ff fd bne,a 2008098 <_Heap_Walk+0x49c> 20080a8: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; } while ( block != last_block ) { 20080ac: 80 a5 40 11 cmp %l5, %l1 20080b0: 02 bf fe e3 be 2007c3c <_Heap_Walk+0x40> 20080b4: a0 10 00 11 mov %l1, %l0 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 ) { 20080b8: ec 04 60 04 ld [ %l1 + 4 ], %l6 20080bc: 10 bf ff 8a b 2007ee4 <_Heap_Walk+0x2e8> 20080c0: ae 0d a0 01 and %l6, 1, %l7 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 20080c4: 90 10 00 19 mov %i1, %o0 20080c8: 96 10 00 10 mov %l0, %o3 20080cc: 92 10 20 01 mov 1, %o1 20080d0: 15 00 80 6b sethi %hi(0x201ac00), %o2 20080d4: b0 10 20 00 clr %i0 20080d8: 9f c4 80 00 call %l2 20080dc: 94 12 a1 98 or %o2, 0x198, %o2 20080e0: 81 c7 e0 08 ret 20080e4: 81 e8 00 00 restore return false; } if ( !prev_used ) { (*printer)( 20080e8: 92 10 20 01 mov 1, %o1 20080ec: 15 00 80 6b sethi %hi(0x201ac00), %o2 20080f0: b0 10 20 00 clr %i0 20080f4: 9f c4 80 00 call %l2 20080f8: 94 12 a1 68 or %o2, 0x168, %o2 20080fc: 81 c7 e0 08 ret 2008100: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( block_size, page_size ) ) { (*printer)( 2008104: 90 10 00 19 mov %i1, %o0 2008108: 96 10 00 10 mov %l0, %o3 200810c: 98 10 00 16 mov %l6, %o4 2008110: 92 10 20 01 mov 1, %o1 2008114: 15 00 80 6b sethi %hi(0x201ac00), %o2 2008118: b0 10 20 00 clr %i0 200811c: 9f c4 80 00 call %l2 2008120: 94 12 a0 20 or %o2, 0x20, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008124: 81 c7 e0 08 ret 2008128: 81 e8 00 00 restore } if ( block_size < min_block_size ) { (*printer)( 200812c: 90 10 00 19 mov %i1, %o0 2008130: 96 10 00 10 mov %l0, %o3 2008134: 98 10 00 16 mov %l6, %o4 2008138: 9a 10 00 13 mov %l3, %o5 200813c: 92 10 20 01 mov 1, %o1 2008140: 15 00 80 6b sethi %hi(0x201ac00), %o2 2008144: b0 10 20 00 clr %i0 2008148: 9f c4 80 00 call %l2 200814c: 94 12 a0 50 or %o2, 0x50, %o2 block, block_size, min_block_size ); return false; 2008150: 81 c7 e0 08 ret 2008154: 81 e8 00 00 restore } if ( next_block_begin <= block_begin ) { (*printer)( 2008158: 96 10 00 10 mov %l0, %o3 200815c: 98 10 00 11 mov %l1, %o4 2008160: 92 10 20 01 mov 1, %o1 2008164: 15 00 80 6b sethi %hi(0x201ac00), %o2 2008168: b0 10 20 00 clr %i0 200816c: 9f c4 80 00 call %l2 2008170: 94 12 a0 80 or %o2, 0x80, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008174: 81 c7 e0 08 ret 2008178: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 200817c: 92 10 20 01 mov 1, %o1 2008180: 15 00 80 6a sethi %hi(0x201a800), %o2 2008184: b0 10 20 00 clr %i0 2008188: 9f c4 80 00 call %l2 200818c: 94 12 a2 f0 or %o2, 0x2f0, %o2 2008190: 81 c7 e0 08 ret 2008194: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008198: 96 10 00 11 mov %l1, %o3 200819c: 92 10 20 01 mov 1, %o1 20081a0: 15 00 80 6a sethi %hi(0x201a800), %o2 20081a4: b0 10 20 00 clr %i0 20081a8: 9f c4 80 00 call %l2 20081ac: 94 12 a3 28 or %o2, 0x328, %o2 20081b0: 81 c7 e0 08 ret 20081b4: 81 e8 00 00 restore return false; } if ( free_block->prev != prev_block ) { (*printer)( 20081b8: 90 10 00 19 mov %i1, %o0 20081bc: 96 10 00 11 mov %l1, %o3 20081c0: 92 10 20 01 mov 1, %o1 20081c4: 15 00 80 6a sethi %hi(0x201a800), %o2 20081c8: b0 10 20 00 clr %i0 20081cc: 9f c4 80 00 call %l2 20081d0: 94 12 a3 78 or %o2, 0x378, %o2 20081d4: 81 c7 e0 08 ret 20081d8: 81 e8 00 00 restore return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 20081dc: 96 10 00 11 mov %l1, %o3 20081e0: 92 10 20 01 mov 1, %o1 20081e4: 15 00 80 6a sethi %hi(0x201a800), %o2 20081e8: b0 10 20 00 clr %i0 20081ec: 9f c4 80 00 call %l2 20081f0: 94 12 a3 58 or %o2, 0x358, %o2 20081f4: 81 c7 e0 08 ret 20081f8: 81 e8 00 00 restore 02006f38 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2006f38: 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 ) 2006f3c: e8 06 20 34 ld [ %i0 + 0x34 ], %l4 2006f40: 80 a5 20 00 cmp %l4, 0 2006f44: 02 80 00 ab be 20071f0 <_Objects_Extend_information+0x2b8> 2006f48: e6 16 20 0a lduh [ %i0 + 0xa ], %l3 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2006f4c: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 2006f50: e4 16 20 14 lduh [ %i0 + 0x14 ], %l2 2006f54: ab 2d 60 10 sll %l5, 0x10, %l5 2006f58: 92 10 00 12 mov %l2, %o1 2006f5c: 40 00 41 d5 call 20176b0 <.udiv> 2006f60: 91 35 60 10 srl %l5, 0x10, %o0 2006f64: 91 2a 20 10 sll %o0, 0x10, %o0 2006f68: b9 32 20 10 srl %o0, 0x10, %i4 for ( ; block < block_count; block++ ) { 2006f6c: 80 a7 20 00 cmp %i4, 0 2006f70: 02 80 00 a7 be 200720c <_Objects_Extend_information+0x2d4> 2006f74: 90 10 00 12 mov %l2, %o0 if ( information->object_blocks[ block ] == NULL ) 2006f78: c2 05 00 00 ld [ %l4 ], %g1 2006f7c: 80 a0 60 00 cmp %g1, 0 2006f80: 02 80 00 a4 be 2007210 <_Objects_Extend_information+0x2d8> 2006f84: a2 10 00 13 mov %l3, %l1 2006f88: 10 80 00 06 b 2006fa0 <_Objects_Extend_information+0x68> 2006f8c: a0 10 20 00 clr %l0 2006f90: c2 05 00 01 ld [ %l4 + %g1 ], %g1 2006f94: 80 a0 60 00 cmp %g1, 0 2006f98: 22 80 00 08 be,a 2006fb8 <_Objects_Extend_information+0x80> 2006f9c: ab 35 60 10 srl %l5, 0x10, %l5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2006fa0: a0 04 20 01 inc %l0 if ( information->object_blocks[ block ] == NULL ) break; else index_base += information->allocation_size; 2006fa4: a2 04 40 12 add %l1, %l2, %l1 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2006fa8: 80 a7 00 10 cmp %i4, %l0 2006fac: 18 bf ff f9 bgu 2006f90 <_Objects_Extend_information+0x58> 2006fb0: 83 2c 20 02 sll %l0, 2, %g1 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2006fb4: ab 35 60 10 srl %l5, 0x10, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2006fb8: 03 00 00 3f sethi %hi(0xfc00), %g1 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2006fbc: aa 05 40 08 add %l5, %o0, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2006fc0: 82 10 63 ff or %g1, 0x3ff, %g1 2006fc4: 80 a5 40 01 cmp %l5, %g1 2006fc8: 18 80 00 96 bgu 2007220 <_Objects_Extend_information+0x2e8> 2006fcc: 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; 2006fd0: 40 00 41 7e call 20175c8 <.umul> 2006fd4: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2006fd8: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2006fdc: 80 a0 60 00 cmp %g1, 0 2006fe0: 12 80 00 6d bne 2007194 <_Objects_Extend_information+0x25c> 2006fe4: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 2006fe8: 40 00 08 d2 call 2009330 <_Workspace_Allocate_or_fatal_error> 2006fec: 01 00 00 00 nop 2006ff0: 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 ) { 2006ff4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2006ff8: 80 a4 40 01 cmp %l1, %g1 2006ffc: 2a 80 00 43 bcs,a 2007108 <_Objects_Extend_information+0x1d0> 2007000: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007004: a8 07 20 01 add %i4, 1, %l4 * 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 ); 2007008: 91 2d 20 01 sll %l4, 1, %o0 200700c: 90 02 00 14 add %o0, %l4, %o0 2007010: 90 05 40 08 add %l5, %o0, %o0 2007014: 90 02 00 13 add %o0, %l3, %o0 2007018: 40 00 08 d5 call 200936c <_Workspace_Allocate> 200701c: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2007020: ac 92 20 00 orcc %o0, 0, %l6 2007024: 02 80 00 7d be 2007218 <_Objects_Extend_information+0x2e0> 2007028: a9 2d 20 02 sll %l4, 2, %l4 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 200702c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007030: 80 a4 c0 01 cmp %l3, %g1 RTEMS_INLINE_ROUTINE void *_Addresses_Add_offset ( const void *base, uintptr_t offset ) { return (void *)((uintptr_t)base + offset); 2007034: ae 05 80 14 add %l6, %l4, %l7 2007038: 0a 80 00 5e bcs 20071b0 <_Objects_Extend_information+0x278> 200703c: a8 05 c0 14 add %l7, %l4, %l4 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2007040: 80 a4 e0 00 cmp %l3, 0 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2007044: 82 10 20 00 clr %g1 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2007048: 02 80 00 08 be 2007068 <_Objects_Extend_information+0x130> 200704c: bb 2f 20 02 sll %i4, 2, %i5 local_table[ index ] = NULL; 2007050: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2007054: 82 00 60 01 inc %g1 2007058: 80 a4 c0 01 cmp %l3, %g1 200705c: 18 bf ff fd bgu 2007050 <_Objects_Extend_information+0x118> 2007060: c0 20 80 14 clr [ %g2 + %l4 ] 2007064: bb 2f 20 02 sll %i4, 2, %i5 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007068: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; 200706c: c0 25 c0 1d clr [ %l7 + %i5 ] for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007070: 86 04 40 03 add %l1, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007074: 80 a4 40 03 cmp %l1, %g3 2007078: 1a 80 00 0a bcc 20070a0 <_Objects_Extend_information+0x168> 200707c: c0 25 80 1d clr [ %l6 + %i5 ] 2007080: 85 2c 60 02 sll %l1, 2, %g2 2007084: 82 10 00 11 mov %l1, %g1 2007088: 84 05 00 02 add %l4, %g2, %g2 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 200708c: c0 20 80 00 clr [ %g2 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 2007090: 82 00 60 01 inc %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007094: 80 a0 40 03 cmp %g1, %g3 2007098: 0a bf ff fd bcs 200708c <_Objects_Extend_information+0x154> 200709c: 84 00 a0 04 add %g2, 4, %g2 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 20070a0: 7f ff eb 34 call 2001d70 20070a4: 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( 20070a8: c6 06 00 00 ld [ %i0 ], %g3 20070ac: 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; 20070b0: ea 36 20 10 sth %l5, [ %i0 + 0x10 ] local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 20070b4: e6 06 20 34 ld [ %i0 + 0x34 ], %l3 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; 20070b8: ee 26 20 30 st %l7, [ %i0 + 0x30 ] information->local_table = local_table; 20070bc: e8 26 20 1c st %l4, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 20070c0: 87 28 e0 18 sll %g3, 0x18, %g3 20070c4: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 20070c8: ec 26 20 34 st %l6, [ %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( 20070cc: ab 2d 60 10 sll %l5, 0x10, %l5 20070d0: 03 00 00 40 sethi %hi(0x10000), %g1 20070d4: ab 35 60 10 srl %l5, 0x10, %l5 20070d8: 82 10 c0 01 or %g3, %g1, %g1 20070dc: 82 10 40 02 or %g1, %g2, %g1 20070e0: 82 10 40 15 or %g1, %l5, %g1 20070e4: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 20070e8: 7f ff eb 26 call 2001d80 20070ec: 01 00 00 00 nop if ( old_tables ) 20070f0: 80 a4 e0 00 cmp %l3, 0 20070f4: 22 80 00 05 be,a 2007108 <_Objects_Extend_information+0x1d0> 20070f8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 _Workspace_Free( old_tables ); 20070fc: 40 00 08 a5 call 2009390 <_Workspace_Free> 2007100: 90 10 00 13 mov %l3, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007104: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007108: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 200710c: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2007110: 92 10 00 12 mov %l2, %o1 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2007114: a1 2c 20 02 sll %l0, 2, %l0 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007118: a6 06 20 20 add %i0, 0x20, %l3 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 200711c: e4 20 40 10 st %l2, [ %g1 + %l0 ] */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { the_object->id = _Objects_Build_id( 2007120: 29 00 00 40 sethi %hi(0x10000), %l4 information->object_blocks[ block ] = new_object_block; /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2007124: a4 07 bf f4 add %fp, -12, %l2 2007128: 40 00 12 00 call 200b928 <_Chain_Initialize> 200712c: 90 10 00 12 mov %l2, %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 ) { 2007130: 30 80 00 0c b,a 2007160 <_Objects_Extend_information+0x228> the_object->id = _Objects_Build_id( 2007134: c4 16 20 04 lduh [ %i0 + 4 ], %g2 2007138: 83 28 60 18 sll %g1, 0x18, %g1 200713c: 85 28 a0 1b sll %g2, 0x1b, %g2 2007140: 82 10 40 14 or %g1, %l4, %g1 2007144: 82 10 40 02 or %g1, %g2, %g1 2007148: 82 10 40 11 or %g1, %l1, %g1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 200714c: 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( 2007150: c2 22 20 08 st %g1, [ %o0 + 8 ] index ); _Chain_Append( &information->Inactive, &the_object->Node ); index++; 2007154: a2 04 60 01 inc %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2007158: 7f ff fc e2 call 20064e0 <_Chain_Append> 200715c: 90 10 00 13 mov %l3, %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 ) { 2007160: 40 00 11 df call 200b8dc <_Chain_Get> 2007164: 90 10 00 12 mov %l2, %o0 2007168: 80 a2 20 00 cmp %o0, 0 200716c: 32 bf ff f2 bne,a 2007134 <_Objects_Extend_information+0x1fc> 2007170: c2 06 00 00 ld [ %i0 ], %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2007174: c2 16 20 2c lduh [ %i0 + 0x2c ], %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007178: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 200717c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 information->inactive = 2007180: 82 01 00 01 add %g4, %g1, %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007184: c8 20 80 10 st %g4, [ %g2 + %l0 ] information->inactive = 2007188: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 200718c: 81 c7 e0 08 ret 2007190: 81 e8 00 00 restore * 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; if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); 2007194: 40 00 08 76 call 200936c <_Workspace_Allocate> 2007198: 01 00 00 00 nop if ( !new_object_block ) 200719c: a4 92 20 00 orcc %o0, 0, %l2 20071a0: 32 bf ff 96 bne,a 2006ff8 <_Objects_Extend_information+0xc0> 20071a4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 20071a8: 81 c7 e0 08 ret 20071ac: 81 e8 00 00 restore /* * 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, 20071b0: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 20071b4: bb 2f 20 02 sll %i4, 2, %i5 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 20071b8: 40 00 1e 51 call 200eafc 20071bc: 94 10 00 1d mov %i5, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 20071c0: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 20071c4: 94 10 00 1d mov %i5, %o2 20071c8: 40 00 1e 4d call 200eafc 20071cc: 90 10 00 17 mov %l7, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20071d0: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 20071d4: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 20071d8: 94 04 c0 0a add %l3, %o2, %o2 20071dc: 90 10 00 14 mov %l4, %o0 20071e0: 40 00 1e 47 call 200eafc 20071e4: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20071e8: 10 bf ff a1 b 200706c <_Objects_Extend_information+0x134> 20071ec: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 20071f0: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 20071f4: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 20071f8: ab 2d 60 10 sll %l5, 0x10, %l5 20071fc: a2 10 00 13 mov %l3, %l1 2007200: a0 10 20 00 clr %l0 2007204: 10 bf ff 6c b 2006fb4 <_Objects_Extend_information+0x7c> 2007208: b8 10 20 00 clr %i4 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) 200720c: a2 10 00 13 mov %l3, %l1 <== NOT EXECUTED 2007210: 10 bf ff 69 b 2006fb4 <_Objects_Extend_information+0x7c> <== NOT EXECUTED 2007214: a0 10 20 00 clr %l0 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 2007218: 40 00 08 5e call 2009390 <_Workspace_Free> 200721c: 90 10 00 12 mov %l2, %o0 return; 2007220: 81 c7 e0 08 ret 2007224: 81 e8 00 00 restore 0200743c <_Objects_Initialize_information>: , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 200743c: 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; 2007440: 05 00 80 6a sethi %hi(0x201a800), %g2 2007444: 83 2e 60 02 sll %i1, 2, %g1 2007448: 84 10 a3 70 or %g2, 0x370, %g2 200744c: 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; 2007450: 85 2f 20 10 sll %i4, 0x10, %g2 2007454: 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; 2007458: 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; 200745c: 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; 2007460: 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; 2007464: 85 36 e0 1f srl %i3, 0x1f, %g2 maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 2007468: 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; 200746c: f2 26 00 00 st %i1, [ %i0 ] information->the_class = the_class; 2007470: f4 36 20 04 sth %i2, [ %i0 + 4 ] information->size = size; information->local_table = 0; 2007474: c0 26 20 1c clr [ %i0 + 0x1c ] information->inactive_per_block = 0; 2007478: c0 26 20 30 clr [ %i0 + 0x30 ] information->object_blocks = 0; 200747c: c0 26 20 34 clr [ %i0 + 0x34 ] information->inactive = 0; 2007480: 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; 2007484: 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 = 2007488: c4 2e 20 12 stb %g2, [ %i0 + 0x12 ] (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 200748c: b6 2e c0 01 andn %i3, %g1, %i3 /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 2007490: 80 a0 a0 00 cmp %g2, 0 2007494: 02 80 00 05 be 20074a8 <_Objects_Initialize_information+0x6c> 2007498: c2 07 a0 5c ld [ %fp + 0x5c ], %g1 200749c: 80 a6 e0 00 cmp %i3, 0 20074a0: 02 80 00 28 be 2007540 <_Objects_Initialize_information+0x104> 20074a4: 90 10 20 00 clr %o0 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; 20074a8: 07 00 80 6a sethi %hi(0x201a800), %g3 20074ac: 86 10 e0 dc or %g3, 0xdc, %g3 ! 201a8dc /* * Calculate minimum and maximum Id's */ minimum_index = (maximum_per_allocation == 0) ? 0 : 1; information->minimum_id = 20074b0: 80 a0 00 1b cmp %g0, %i3 20074b4: b3 2e 60 18 sll %i1, 0x18, %i1 20074b8: 84 40 20 00 addx %g0, 0, %g2 20074bc: 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; 20074c0: c6 26 20 1c st %g3, [ %i0 + 0x1c ] } /* * The allocation unit is the maximum value */ information->allocation_size = maximum_per_allocation; 20074c4: 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 = 20074c8: 07 00 00 40 sethi %hi(0x10000), %g3 20074cc: b2 16 40 03 or %i1, %g3, %i1 20074d0: b4 16 40 1a or %i1, %i2, %i2 20074d4: b4 16 80 02 or %i2, %g2, %i2 20074d8: 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) & 20074dc: 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) ) 20074e0: 80 88 60 03 btst 3, %g1 20074e4: 02 80 00 0c be 2007514 <_Objects_Initialize_information+0xd8> 20074e8: 84 08 bf fc and %g2, -4, %g2 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 20074ec: 82 06 20 24 add %i0, 0x24, %g1 <== NOT EXECUTED name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; 20074f0: c4 36 20 38 sth %g2, [ %i0 + 0x38 ] <== NOT EXECUTED 20074f4: c2 26 20 20 st %g1, [ %i0 + 0x20 ] <== NOT EXECUTED the_chain->permanent_null = NULL; 20074f8: c0 26 20 24 clr [ %i0 + 0x24 ] <== NOT EXECUTED the_chain->last = _Chain_Head(the_chain); 20074fc: 82 06 20 20 add %i0, 0x20, %g1 <== NOT EXECUTED _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 2007500: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 2007504: 12 80 00 0d bne 2007538 <_Objects_Initialize_information+0xfc> <== NOT EXECUTED 2007508: c2 26 20 28 st %g1, [ %i0 + 0x28 ] <== NOT EXECUTED 200750c: 81 c7 e0 08 ret 2007510: 81 e8 00 00 restore /* * Calculate the maximum name length */ name_length = maximum_name_length; if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) 2007514: 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); 2007518: 82 06 20 24 add %i0, 0x24, %g1 name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; 200751c: c4 36 20 38 sth %g2, [ %i0 + 0x38 ] 2007520: c2 26 20 20 st %g1, [ %i0 + 0x20 ] the_chain->permanent_null = NULL; 2007524: c0 26 20 24 clr [ %i0 + 0x24 ] the_chain->last = _Chain_Head(the_chain); 2007528: 82 06 20 20 add %i0, 0x20, %g1 _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 200752c: 80 a6 e0 00 cmp %i3, 0 2007530: 02 bf ff f7 be 200750c <_Objects_Initialize_information+0xd0> 2007534: 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 ); 2007538: 7f ff fe 80 call 2006f38 <_Objects_Extend_information> 200753c: 81 e8 00 00 restore /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { _Internal_error_Occurred( 2007540: 92 10 20 01 mov 1, %o1 2007544: 7f ff fe 1e call 2006dbc <_Internal_error_Occurred> 2007548: 94 10 20 14 mov 0x14, %o2 200754c: 01 00 00 00 nop 0200760c <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 200760c: 9d e3 bf a0 save %sp, -96, %sp /* * Search the list to find block or chunk with all objects inactive. */ index_base = _Objects_Get_index( information->minimum_id ); 2007610: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 block_count = (information->maximum - index_base) / 2007614: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 2007618: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 200761c: 92 10 00 11 mov %l1, %o1 2007620: 40 00 40 24 call 20176b0 <.udiv> 2007624: 90 22 00 10 sub %o0, %l0, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2007628: 80 a2 20 00 cmp %o0, 0 200762c: 02 80 00 12 be 2007674 <_Objects_Shrink_information+0x68> 2007630: a4 10 20 04 mov 4, %l2 if ( information->inactive_per_block[ block ] == 2007634: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 2007638: c4 00 c0 00 ld [ %g3 ], %g2 200763c: 80 a4 40 02 cmp %l1, %g2 2007640: 12 80 00 09 bne 2007664 <_Objects_Shrink_information+0x58> 2007644: 82 10 20 00 clr %g1 2007648: 10 80 00 0d b 200767c <_Objects_Shrink_information+0x70> <== NOT EXECUTED 200764c: a4 10 20 00 clr %l2 <== NOT EXECUTED information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 2007650: a0 04 00 11 add %l0, %l1, %l0 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 2007654: 80 a4 40 02 cmp %l1, %g2 2007658: 02 80 00 09 be 200767c <_Objects_Shrink_information+0x70> 200765c: 84 04 a0 04 add %l2, 4, %g2 2007660: a4 10 00 02 mov %g2, %l2 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2007664: 82 00 60 01 inc %g1 2007668: 80 a2 00 01 cmp %o0, %g1 200766c: 38 bf ff f9 bgu,a 2007650 <_Objects_Shrink_information+0x44> 2007670: c4 00 c0 12 ld [ %g3 + %l2 ], %g2 2007674: 81 c7 e0 08 ret 2007678: 81 e8 00 00 restore information->allocation_size ) { /* * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; 200767c: 10 80 00 06 b 2007694 <_Objects_Shrink_information+0x88> 2007680: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2007684: 80 a4 60 00 cmp %l1, 0 2007688: 22 80 00 12 be,a 20076d0 <_Objects_Shrink_information+0xc4> 200768c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2007690: 90 10 00 11 mov %l1, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; do { index = _Objects_Get_index( the_object->id ); 2007694: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2007698: 80 a0 40 10 cmp %g1, %l0 200769c: 0a bf ff fa bcs 2007684 <_Objects_Shrink_information+0x78> 20076a0: e2 02 00 00 ld [ %o0 ], %l1 (index < (index_base + information->allocation_size))) { 20076a4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20076a8: 84 04 00 02 add %l0, %g2, %g2 20076ac: 80 a0 40 02 cmp %g1, %g2 20076b0: 1a bf ff f6 bcc 2007688 <_Objects_Shrink_information+0x7c> 20076b4: 80 a4 60 00 cmp %l1, 0 _Chain_Extract( &extract_me->Node ); 20076b8: 40 00 10 7f call 200b8b4 <_Chain_Extract> 20076bc: 01 00 00 00 nop } } while ( the_object ); 20076c0: 80 a4 60 00 cmp %l1, 0 20076c4: 12 bf ff f4 bne 2007694 <_Objects_Shrink_information+0x88> 20076c8: 90 10 00 11 mov %l1, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 20076cc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 20076d0: 40 00 07 30 call 2009390 <_Workspace_Free> 20076d4: d0 00 40 12 ld [ %g1 + %l2 ], %o0 information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 20076d8: c6 16 20 2c lduh [ %i0 + 0x2c ], %g3 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 20076dc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; 20076e0: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 information->inactive -= information->allocation_size; 20076e4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; 20076e8: c0 21 00 12 clr [ %g4 + %l2 ] information->inactive -= information->allocation_size; 20076ec: 84 20 c0 02 sub %g3, %g2, %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 20076f0: c0 20 40 12 clr [ %g1 + %l2 ] information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 20076f4: c4 36 20 2c sth %g2, [ %i0 + 0x2c ] return; 20076f8: 81 c7 e0 08 ret 20076fc: 81 e8 00 00 restore 0200b664 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200b664: 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 ]; 200b668: e0 06 21 60 ld [ %i0 + 0x160 ], %l0 if ( !api ) 200b66c: 80 a4 20 00 cmp %l0, 0 200b670: 02 80 00 1f be 200b6ec <_RTEMS_tasks_Post_switch_extension+0x88> 200b674: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200b678: 7f ff d9 be call 2001d70 200b67c: 01 00 00 00 nop signal_set = asr->signals_posted; 200b680: e2 04 20 14 ld [ %l0 + 0x14 ], %l1 asr->signals_posted = 0; 200b684: c0 24 20 14 clr [ %l0 + 0x14 ] _ISR_Enable( level ); 200b688: 7f ff d9 be call 2001d80 200b68c: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200b690: 80 a4 60 00 cmp %l1, 0 200b694: 32 80 00 04 bne,a 200b6a4 <_RTEMS_tasks_Post_switch_extension+0x40> 200b698: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 200b69c: 81 c7 e0 08 ret <== NOT EXECUTED 200b6a0: 81 e8 00 00 restore <== NOT EXECUTED return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6a4: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200b6a8: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6ac: a4 07 bf fc add %fp, -4, %l2 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200b6b0: c2 24 20 1c st %g1, [ %l0 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6b4: 94 10 00 12 mov %l2, %o2 200b6b8: 27 00 00 3f sethi %hi(0xfc00), %l3 200b6bc: 40 00 07 cd call 200d5f0 200b6c0: 92 14 e3 ff or %l3, 0x3ff, %o1 ! ffff (*asr->handler)( signal_set ); 200b6c4: c2 04 20 0c ld [ %l0 + 0xc ], %g1 200b6c8: 9f c0 40 00 call %g1 200b6cc: 90 10 00 11 mov %l1, %o0 asr->nest_level -= 1; 200b6d0: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6d4: 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; 200b6d8: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6dc: 92 14 e3 ff or %l3, 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; 200b6e0: c2 24 20 1c st %g1, [ %l0 + 0x1c ] rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200b6e4: 40 00 07 c3 call 200d5f0 200b6e8: 94 10 00 12 mov %l2, %o2 200b6ec: 81 c7 e0 08 ret 200b6f0: 81 e8 00 00 restore 02007764 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2007764: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 2007768: 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 ); 200776c: 40 00 04 7c call 200895c <_Thread_Set_transient> 2007770: 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 ) 2007774: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007778: 80 a0 40 19 cmp %g1, %i1 200777c: 02 80 00 05 be 2007790 <_Thread_Change_priority+0x2c> 2007780: a0 10 00 18 mov %i0, %l0 _Thread_Set_priority( the_thread, new_priority ); 2007784: 92 10 00 19 mov %i1, %o1 2007788: 40 00 03 f9 call 200876c <_Thread_Set_priority> 200778c: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 2007790: 7f ff e9 78 call 2001d70 2007794: 01 00 00 00 nop 2007798: 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; 200779c: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 if ( state != STATES_TRANSIENT ) { 20077a0: 80 a4 a0 04 cmp %l2, 4 20077a4: 02 80 00 18 be 2007804 <_Thread_Change_priority+0xa0> 20077a8: 80 8c 60 04 btst 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 20077ac: 02 80 00 0b be 20077d8 <_Thread_Change_priority+0x74> 20077b0: 82 0c bf fb and %l2, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 20077b4: 7f ff e9 73 call 2001d80 <== NOT EXECUTED 20077b8: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 20077bc: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 20077c0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED 20077c4: 80 8c 80 01 btst %l2, %g1 <== NOT EXECUTED 20077c8: 32 80 00 0d bne,a 20077fc <_Thread_Change_priority+0x98> <== NOT EXECUTED 20077cc: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 <== NOT EXECUTED 20077d0: 81 c7 e0 08 ret 20077d4: 81 e8 00 00 restore */ state = the_thread->current_state; if ( state != STATES_TRANSIENT ) { /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 20077d8: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 20077dc: 7f ff e9 69 call 2001d80 20077e0: 90 10 00 18 mov %i0, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20077e4: 03 00 00 ef sethi %hi(0x3bc00), %g1 20077e8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20077ec: 80 8c 80 01 btst %l2, %g1 20077f0: 02 bf ff f8 be 20077d0 <_Thread_Change_priority+0x6c> 20077f4: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20077f8: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 20077fc: 40 00 03 ac call 20086ac <_Thread_queue_Requeue> 2007800: 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 ) ) { 2007804: 12 80 00 14 bne 2007854 <_Thread_Change_priority+0xf0> 2007808: 23 00 80 6b sethi %hi(0x201ac00), %l1 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 200780c: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 2007810: c4 14 20 96 lduh [ %l0 + 0x96 ], %g2 2007814: c6 10 40 00 lduh [ %g1 ], %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 ); 2007818: c0 24 20 10 clr [ %l0 + 0x10 ] 200781c: 84 10 c0 02 or %g3, %g2, %g2 2007820: c4 30 40 00 sth %g2, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 2007824: c4 14 60 c4 lduh [ %l1 + 0xc4 ], %g2 2007828: c2 14 20 94 lduh [ %l0 + 0x94 ], %g1 _Priority_Add_to_bit_map( &the_thread->Priority_map ); if ( prepend_it ) 200782c: 80 8e a0 ff btst 0xff, %i2 2007830: 82 10 80 01 or %g2, %g1, %g1 2007834: c2 34 60 c4 sth %g1, [ %l1 + 0xc4 ] 2007838: 02 80 00 48 be 2007958 <_Thread_Change_priority+0x1f4> 200783c: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2007840: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2007844: c2 24 20 04 st %g1, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2007848: e0 20 40 00 st %l0, [ %g1 ] the_node->next = before_node; before_node->previous = the_node; 200784c: 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; 2007850: c4 24 00 00 st %g2, [ %l0 ] _Chain_Prepend_unprotected( the_thread->ready, &the_thread->Object.Node ); else _Chain_Append_unprotected( the_thread->ready, &the_thread->Object.Node ); } _ISR_Flash( level ); 2007854: 7f ff e9 4b call 2001d80 2007858: 90 10 00 18 mov %i0, %o0 200785c: 7f ff e9 45 call 2001d70 2007860: 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 ); 2007864: c2 14 60 c4 lduh [ %l1 + 0xc4 ], %g1 */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) _Thread_Ready_chain[ _Priority_Get_highest() ].first; 2007868: 05 00 80 6a sethi %hi(0x201a800), %g2 200786c: 83 28 60 10 sll %g1, 0x10, %g1 2007870: da 00 a3 64 ld [ %g2 + 0x364 ], %o5 2007874: 85 30 60 10 srl %g1, 0x10, %g2 2007878: 80 a0 a0 ff cmp %g2, 0xff 200787c: 08 80 00 27 bleu 2007918 <_Thread_Change_priority+0x1b4> 2007880: 07 00 80 65 sethi %hi(0x2019400), %g3 2007884: 83 30 60 18 srl %g1, 0x18, %g1 2007888: 86 10 e1 10 or %g3, 0x110, %g3 200788c: c4 08 c0 01 ldub [ %g3 + %g1 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007890: 09 00 80 6b sethi %hi(0x201ac00), %g4 2007894: 85 28 a0 10 sll %g2, 0x10, %g2 2007898: 88 11 21 40 or %g4, 0x140, %g4 200789c: 83 30 a0 0f srl %g2, 0xf, %g1 20078a0: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 20078a4: 83 28 60 10 sll %g1, 0x10, %g1 20078a8: 89 30 60 10 srl %g1, 0x10, %g4 20078ac: 80 a1 20 ff cmp %g4, 0xff 20078b0: 18 80 00 28 bgu 2007950 <_Thread_Change_priority+0x1ec> 20078b4: 83 30 60 18 srl %g1, 0x18, %g1 20078b8: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 20078bc: 82 00 60 08 add %g1, 8, %g1 * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 20078c0: 85 30 a0 0c srl %g2, 0xc, %g2 20078c4: 83 28 60 10 sll %g1, 0x10, %g1 20078c8: 83 30 60 10 srl %g1, 0x10, %g1 20078cc: 82 00 40 02 add %g1, %g2, %g1 20078d0: 85 28 60 04 sll %g1, 4, %g2 20078d4: 83 28 60 02 sll %g1, 2, %g1 20078d8: 82 20 80 01 sub %g2, %g1, %g1 20078dc: c2 03 40 01 ld [ %o5 + %g1 ], %g1 * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 20078e0: 05 00 80 6b sethi %hi(0x201ac00), %g2 20078e4: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 ! 201acd0 <_Thread_Executing> * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 20078e8: 07 00 80 6b sethi %hi(0x201ac00), %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() && 20078ec: 80 a0 40 02 cmp %g1, %g2 20078f0: 02 80 00 08 be 2007910 <_Thread_Change_priority+0x1ac> 20078f4: c2 20 e0 a0 st %g1, [ %g3 + 0xa0 ] _Thread_Executing->is_preemptible ) 20078f8: c2 08 a0 75 ldub [ %g2 + 0x75 ], %g1 20078fc: 80 a0 60 00 cmp %g1, 0 2007900: 02 80 00 04 be 2007910 <_Thread_Change_priority+0x1ac> 2007904: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 2007908: 03 00 80 6b sethi %hi(0x201ac00), %g1 200790c: c4 28 60 e0 stb %g2, [ %g1 + 0xe0 ] ! 201ace0 <_Context_Switch_necessary> _ISR_Enable( level ); 2007910: 7f ff e9 1c call 2001d80 2007914: 81 e8 00 00 restore 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 ); 2007918: 86 10 e1 10 or %g3, 0x110, %g3 200791c: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007920: 09 00 80 6b sethi %hi(0x201ac00), %g4 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 ); 2007924: 84 00 a0 08 add %g2, 8, %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007928: 88 11 21 40 or %g4, 0x140, %g4 200792c: 85 28 a0 10 sll %g2, 0x10, %g2 2007930: 83 30 a0 0f srl %g2, 0xf, %g1 2007934: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 2007938: 83 28 60 10 sll %g1, 0x10, %g1 200793c: 89 30 60 10 srl %g1, 0x10, %g4 2007940: 80 a1 20 ff cmp %g4, 0xff 2007944: 28 bf ff de bleu,a 20078bc <_Thread_Change_priority+0x158> 2007948: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 200794c: 83 30 60 18 srl %g1, 0x18, %g1 2007950: 10 bf ff dc b 20078c0 <_Thread_Change_priority+0x15c> 2007954: c2 08 c0 01 ldub [ %g3 + %g1 ], %g1 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 2007958: 84 00 60 04 add %g1, 4, %g2 200795c: c4 24 00 00 st %g2, [ %l0 ] old_last_node = the_chain->last; 2007960: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_chain->last = the_node; 2007964: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 2007968: 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; 200796c: 10 bf ff ba b 2007854 <_Thread_Change_priority+0xf0> 2007970: e0 20 80 00 st %l0, [ %g2 ] 0200c43c <_Thread_Reset_timeslice>: * ready chain * select heir */ void _Thread_Reset_timeslice( void ) { 200c43c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 200c440: 03 00 80 6b sethi %hi(0x201ac00), %g1 200c444: e0 00 60 d0 ld [ %g1 + 0xd0 ], %l0 ! 201acd0 <_Thread_Executing> ready = executing->ready; _ISR_Disable( level ); 200c448: 7f ff d6 4a call 2001d70 200c44c: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 200c450: b0 10 00 08 mov %o0, %i0 if ( _Chain_Has_only_one_node( ready ) ) { 200c454: c4 04 40 00 ld [ %l1 ], %g2 200c458: c2 04 60 08 ld [ %l1 + 8 ], %g1 200c45c: 80 a0 80 01 cmp %g2, %g1 200c460: 02 80 00 1f be 200c4dc <_Thread_Reset_timeslice+0xa0> 200c464: 86 04 60 04 add %l1, 4, %g3 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200c468: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 200c46c: c4 04 20 04 ld [ %l0 + 4 ], %g2 next->previous = previous; previous->next = next; 200c470: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 200c474: c6 24 00 00 st %g3, [ %l0 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 200c478: 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; 200c47c: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_chain->last = the_node; 200c480: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 200c484: 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; 200c488: e0 20 40 00 st %l0, [ %g1 ] return; } _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 200c48c: 7f ff d6 3d call 2001d80 200c490: 01 00 00 00 nop 200c494: 7f ff d6 37 call 2001d70 200c498: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 200c49c: 03 00 80 6b sethi %hi(0x201ac00), %g1 200c4a0: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 ! 201aca0 <_Thread_Heir> 200c4a4: 80 a4 00 02 cmp %l0, %g2 200c4a8: 02 80 00 06 be 200c4c0 <_Thread_Reset_timeslice+0x84> 200c4ac: 84 10 20 01 mov 1, %g2 _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; 200c4b0: 03 00 80 6b sethi %hi(0x201ac00), %g1 <== NOT EXECUTED 200c4b4: c4 28 60 e0 stb %g2, [ %g1 + 0xe0 ] ! 201ace0 <_Context_Switch_necessary> <== NOT EXECUTED _ISR_Enable( level ); 200c4b8: 7f ff d6 32 call 2001d80 <== NOT EXECUTED 200c4bc: 81 e8 00 00 restore <== NOT EXECUTED _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; 200c4c0: c4 04 40 00 ld [ %l1 ], %g2 200c4c4: c4 20 60 a0 st %g2, [ %g1 + 0xa0 ] _Context_Switch_necessary = true; 200c4c8: 84 10 20 01 mov 1, %g2 200c4cc: 03 00 80 6b sethi %hi(0x201ac00), %g1 200c4d0: c4 28 60 e0 stb %g2, [ %g1 + 0xe0 ] ! 201ace0 <_Context_Switch_necessary> _ISR_Enable( level ); 200c4d4: 7f ff d6 2b call 2001d80 200c4d8: 81 e8 00 00 restore executing = _Thread_Executing; ready = executing->ready; _ISR_Disable( level ); if ( _Chain_Has_only_one_node( ready ) ) { _ISR_Enable( level ); 200c4dc: 7f ff d6 29 call 2001d80 200c4e0: 81 e8 00 00 restore 200c4e4: 01 00 00 00 nop 02008b9c <_Thread_Yield_processor>: * ready chain * select heir */ void _Thread_Yield_processor( void ) { 2008b9c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 2008ba0: 03 00 80 6b sethi %hi(0x201ac00), %g1 2008ba4: e0 00 60 d0 ld [ %g1 + 0xd0 ], %l0 ! 201acd0 <_Thread_Executing> ready = executing->ready; _ISR_Disable( level ); 2008ba8: 7f ff e4 72 call 2001d70 2008bac: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 2008bb0: b0 10 00 08 mov %o0, %i0 if ( !_Chain_Has_only_one_node( ready ) ) { 2008bb4: c4 04 40 00 ld [ %l1 ], %g2 2008bb8: c2 04 60 08 ld [ %l1 + 8 ], %g1 2008bbc: 80 a0 80 01 cmp %g2, %g1 2008bc0: 02 80 00 19 be 2008c24 <_Thread_Yield_processor+0x88> 2008bc4: 86 04 60 04 add %l1, 4, %g3 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2008bc8: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 2008bcc: c4 04 20 04 ld [ %l0 + 4 ], %g2 next->previous = previous; previous->next = next; 2008bd0: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 2008bd4: c6 24 00 00 st %g3, [ %l0 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2008bd8: 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; 2008bdc: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_chain->last = the_node; 2008be0: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 2008be4: 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; 2008be8: e0 20 40 00 st %l0, [ %g1 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 2008bec: 7f ff e4 65 call 2001d80 2008bf0: 01 00 00 00 nop 2008bf4: 7f ff e4 5f call 2001d70 2008bf8: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 2008bfc: 03 00 80 6b sethi %hi(0x201ac00), %g1 2008c00: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 ! 201aca0 <_Thread_Heir> 2008c04: 80 a4 00 02 cmp %l0, %g2 2008c08: 22 80 00 0e be,a 2008c40 <_Thread_Yield_processor+0xa4> 2008c0c: c4 04 40 00 ld [ %l1 ], %g2 _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Context_Switch_necessary = true; 2008c10: 84 10 20 01 mov 1, %g2 2008c14: 03 00 80 6b sethi %hi(0x201ac00), %g1 2008c18: c4 28 60 e0 stb %g2, [ %g1 + 0xe0 ] ! 201ace0 <_Context_Switch_necessary> _ISR_Enable( level ); 2008c1c: 7f ff e4 59 call 2001d80 2008c20: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 2008c24: 03 00 80 6b sethi %hi(0x201ac00), %g1 2008c28: c2 00 60 a0 ld [ %g1 + 0xa0 ], %g1 ! 201aca0 <_Thread_Heir> 2008c2c: 80 a4 00 01 cmp %l0, %g1 2008c30: 32 bf ff f9 bne,a 2008c14 <_Thread_Yield_processor+0x78> 2008c34: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED _Context_Switch_necessary = true; _ISR_Enable( level ); 2008c38: 7f ff e4 52 call 2001d80 2008c3c: 81 e8 00 00 restore _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; 2008c40: 10 bf ff f4 b 2008c10 <_Thread_Yield_processor+0x74> 2008c44: c4 20 60 a0 st %g2, [ %g1 + 0xa0 ] 020083f0 <_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 ) { 20083f0: 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; 20083f4: 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); 20083f8: 82 06 60 3c add %i1, 0x3c, %g1 the_chain->permanent_null = NULL; 20083fc: 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); 2008400: c2 26 60 38 st %g1, [ %i1 + 0x38 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2008404: 82 06 60 38 add %i1, 0x38, %g1 2008408: c2 26 60 40 st %g1, [ %i1 + 0x40 ] 200840c: 2d 00 80 68 sethi %hi(0x201a000), %l6 header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008410: 83 34 20 06 srl %l0, 6, %g1 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2008414: 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 ]; 2008418: ab 28 60 04 sll %g1, 4, %l5 200841c: ac 15 a2 44 or %l6, 0x244, %l6 2008420: 83 28 60 02 sll %g1, 2, %g1 block_state = the_thread_queue->state; 2008424: e8 06 20 38 ld [ %i0 + 0x38 ], %l4 _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 ]; 2008428: aa 25 40 01 sub %l5, %g1, %l5 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 200842c: 12 80 00 24 bne 20084bc <_Thread_queue_Enqueue_priority+0xcc> 2008430: aa 06 00 15 add %i0, %l5, %l5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 2008434: ac 05 60 04 add %l5, 4, %l6 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 2008438: 7f ff e6 4e call 2001d70 200843c: 01 00 00 00 nop 2008440: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->first; 2008444: c2 05 40 00 ld [ %l5 ], %g1 while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008448: 80 a0 40 16 cmp %g1, %l6 200844c: 02 80 00 3a be 2008534 <_Thread_queue_Enqueue_priority+0x144> 2008450: a2 10 00 01 mov %g1, %l1 search_priority = search_thread->current_priority; 2008454: e6 00 60 14 ld [ %g1 + 0x14 ], %l3 if ( priority <= search_priority ) 2008458: 80 a4 00 13 cmp %l0, %l3 200845c: 18 80 00 0b bgu 2008488 <_Thread_queue_Enqueue_priority+0x98> 2008460: 01 00 00 00 nop } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2008464: 10 80 00 36 b 200853c <_Thread_queue_Enqueue_priority+0x14c> 2008468: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 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 ) ) { 200846c: 80 a4 40 16 cmp %l1, %l6 2008470: 02 80 00 32 be 2008538 <_Thread_queue_Enqueue_priority+0x148> 2008474: 82 10 00 11 mov %l1, %g1 search_priority = search_thread->current_priority; 2008478: e6 04 60 14 ld [ %l1 + 0x14 ], %l3 if ( priority <= search_priority ) 200847c: 80 a4 00 13 cmp %l0, %l3 2008480: 28 80 00 2f bleu,a 200853c <_Thread_queue_Enqueue_priority+0x14c> 2008484: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 2008488: 7f ff e6 3e call 2001d80 200848c: 90 10 00 12 mov %l2, %o0 2008490: 7f ff e6 38 call 2001d70 2008494: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008498: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 200849c: 80 8d 00 01 btst %l4, %g1 20084a0: 32 bf ff f3 bne,a 200846c <_Thread_queue_Enqueue_priority+0x7c> 20084a4: e2 04 40 00 ld [ %l1 ], %l1 _ISR_Enable( level ); 20084a8: 7f ff e6 36 call 2001d80 <== NOT EXECUTED 20084ac: 90 10 00 12 mov %l2, %o0 <== NOT EXECUTED goto restart_forward_search; 20084b0: 30 bf ff e2 b,a 2008438 <_Thread_queue_Enqueue_priority+0x48> <== NOT EXECUTED if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 20084b4: 7f ff e6 33 call 2001d80 20084b8: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 20084bc: 7f ff e6 2d call 2001d70 20084c0: e6 0d 80 00 ldub [ %l6 ], %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; 20084c4: a6 04 e0 01 inc %l3 _ISR_Disable( level ); 20084c8: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->last; 20084cc: c2 05 60 08 ld [ %l5 + 8 ], %g1 while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 20084d0: 80 a0 40 15 cmp %g1, %l5 20084d4: 02 80 00 20 be 2008554 <_Thread_queue_Enqueue_priority+0x164> 20084d8: a2 10 00 01 mov %g1, %l1 search_priority = search_thread->current_priority; 20084dc: e6 00 60 14 ld [ %g1 + 0x14 ], %l3 if ( priority >= search_priority ) 20084e0: 80 a4 00 13 cmp %l0, %l3 20084e4: 0a 80 00 0b bcs 2008510 <_Thread_queue_Enqueue_priority+0x120> 20084e8: 01 00 00 00 nop } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 20084ec: 10 80 00 1b b 2008558 <_Thread_queue_Enqueue_priority+0x168> 20084f0: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 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 ) ) { 20084f4: 80 a4 40 15 cmp %l1, %l5 20084f8: 02 80 00 17 be 2008554 <_Thread_queue_Enqueue_priority+0x164> 20084fc: 82 10 00 11 mov %l1, %g1 search_priority = search_thread->current_priority; 2008500: e6 04 60 14 ld [ %l1 + 0x14 ], %l3 if ( priority >= search_priority ) 2008504: 80 a4 00 13 cmp %l0, %l3 2008508: 3a 80 00 14 bcc,a 2008558 <_Thread_queue_Enqueue_priority+0x168> 200850c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 2008510: 7f ff e6 1c call 2001d80 2008514: 90 10 00 12 mov %l2, %o0 2008518: 7f ff e6 16 call 2001d70 200851c: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008520: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 2008524: 80 8d 00 01 btst %l4, %g1 2008528: 32 bf ff f3 bne,a 20084f4 <_Thread_queue_Enqueue_priority+0x104> 200852c: e2 04 60 04 ld [ %l1 + 4 ], %l1 2008530: 30 bf ff e1 b,a 20084b4 <_Thread_queue_Enqueue_priority+0xc4> 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 ) ) { 2008534: a6 10 3f ff mov -1, %l3 } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2008538: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 200853c: 80 a0 a0 01 cmp %g2, 1 2008540: 02 80 00 17 be 200859c <_Thread_queue_Enqueue_priority+0x1ac> 2008544: 80 a4 00 13 cmp %l0, %l3 * 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; 2008548: e4 26 80 00 st %l2, [ %i2 ] return the_thread_queue->sync_state; } 200854c: 81 c7 e0 08 ret 2008550: 91 e8 00 02 restore %g0, %g2, %o0 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2008554: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 2008558: 80 a0 a0 01 cmp %g2, 1 200855c: 32 bf ff fc bne,a 200854c <_Thread_queue_Enqueue_priority+0x15c> 2008560: e4 26 80 00 st %l2, [ %i2 ] THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2008564: 80 a4 00 13 cmp %l0, %l3 2008568: 02 80 00 1a be 20085d0 <_Thread_queue_Enqueue_priority+0x1e0> 200856c: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 2008570: c4 00 40 00 ld [ %g1 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 2008574: c2 26 60 04 st %g1, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 2008578: c4 26 40 00 st %g2, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; next_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 200857c: 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; 2008580: f2 20 40 00 st %i1, [ %g1 ] next_node->previous = the_node; 2008584: f2 20 a0 04 st %i1, [ %g2 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2008588: b0 10 20 01 mov 1, %i0 200858c: 7f ff e5 fd call 2001d80 2008590: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008594: 81 c7 e0 08 ret 2008598: 81 e8 00 00 restore THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 200859c: 02 80 00 0d be 20085d0 <_Thread_queue_Enqueue_priority+0x1e0> 20085a0: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; previous_node = search_node->previous; 20085a4: c4 00 60 04 ld [ %g1 + 4 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 20085a8: c2 26 40 00 st %g1, [ %i1 ] the_node->previous = previous_node; 20085ac: c4 26 60 04 st %g2, [ %i1 + 4 ] previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 20085b0: 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; 20085b4: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 20085b8: f2 20 60 04 st %i1, [ %g1 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 20085bc: b0 10 20 01 mov 1, %i0 20085c0: 7f ff e5 f0 call 2001d80 20085c4: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20085c8: 81 c7 e0 08 ret 20085cc: 81 e8 00 00 restore 20085d0: 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; 20085d4: c2 04 60 04 ld [ %l1 + 4 ], %g1 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 20085d8: e2 26 40 00 st %l1, [ %i1 ] the_node->previous = previous_node; 20085dc: 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; 20085e0: 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; 20085e4: f2 20 40 00 st %i1, [ %g1 ] search_node->previous = the_node; 20085e8: f2 24 60 04 st %i1, [ %l1 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 20085ec: b0 10 20 01 mov 1, %i0 20085f0: 7f ff e5 e4 call 2001d80 20085f4: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20085f8: 81 c7 e0 08 ret 20085fc: 81 e8 00 00 restore 020086ac <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 20086ac: 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 ) 20086b0: 80 a6 20 00 cmp %i0, 0 20086b4: 02 80 00 13 be 2008700 <_Thread_queue_Requeue+0x54> 20086b8: 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 ) { 20086bc: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 20086c0: 80 a4 60 01 cmp %l1, 1 20086c4: 02 80 00 04 be 20086d4 <_Thread_queue_Requeue+0x28> 20086c8: 01 00 00 00 nop 20086cc: 81 c7 e0 08 ret <== NOT EXECUTED 20086d0: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 20086d4: 7f ff e5 a7 call 2001d70 20086d8: 01 00 00 00 nop 20086dc: a0 10 00 08 mov %o0, %l0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 20086e0: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 20086e4: 03 00 00 ef sethi %hi(0x3bc00), %g1 20086e8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20086ec: 80 88 80 01 btst %g2, %g1 20086f0: 12 80 00 06 bne 2008708 <_Thread_queue_Requeue+0x5c> 20086f4: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); } _ISR_Enable( level ); 20086f8: 7f ff e5 a2 call 2001d80 20086fc: 90 10 00 10 mov %l0, %o0 2008700: 81 c7 e0 08 ret 2008704: 81 e8 00 00 restore ISR_Level level_ignored; _ISR_Disable( level ); if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2008708: 92 10 00 19 mov %i1, %o1 200870c: e2 26 20 30 st %l1, [ %i0 + 0x30 ] 2008710: 40 00 0e a9 call 200c1b4 <_Thread_queue_Extract_priority_helper> 2008714: 94 10 20 01 mov 1, %o2 (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2008718: 90 10 00 18 mov %i0, %o0 200871c: 92 10 00 19 mov %i1, %o1 2008720: 7f ff ff 34 call 20083f0 <_Thread_queue_Enqueue_priority> 2008724: 94 07 bf fc add %fp, -4, %o2 2008728: 30 bf ff f4 b,a 20086f8 <_Thread_queue_Requeue+0x4c> 02015b60 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2015b60: 9d e3 bf 88 save %sp, -120, %sp 2015b64: 2d 00 80 ec sethi %hi(0x203b000), %l6 2015b68: ba 07 bf f4 add %fp, -12, %i5 2015b6c: a8 07 bf f8 add %fp, -8, %l4 2015b70: a4 07 bf e8 add %fp, -24, %l2 2015b74: ae 07 bf ec add %fp, -20, %l7 2015b78: 2b 00 80 ec sethi %hi(0x203b000), %l5 2015b7c: 39 00 80 ec sethi %hi(0x203b000), %i4 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); the_chain->permanent_null = NULL; 2015b80: c0 27 bf f8 clr [ %fp + -8 ] 2015b84: c0 27 bf ec clr [ %fp + -20 ] the_chain->last = _Chain_Head(the_chain); 2015b88: fa 27 bf fc st %i5, [ %fp + -4 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2015b8c: e8 27 bf f4 st %l4, [ %fp + -12 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2015b90: e4 27 bf f0 st %l2, [ %fp + -16 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2015b94: ee 27 bf e8 st %l7, [ %fp + -24 ] 2015b98: ac 15 a1 94 or %l6, 0x194, %l6 2015b9c: aa 15 60 d4 or %l5, 0xd4, %l5 2015ba0: b8 17 20 40 or %i4, 0x40, %i4 */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015ba4: a2 06 20 30 add %i0, 0x30, %l1 /* * 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 ); 2015ba8: a6 06 20 68 add %i0, 0x68, %l3 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015bac: b2 06 20 08 add %i0, 8, %i1 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2015bb0: b4 06 20 40 add %i0, 0x40, %i2 _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; 2015bb4: b6 10 20 01 mov 1, %i3 { /* * 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; 2015bb8: fa 26 20 78 st %i5, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2015bbc: c2 05 80 00 ld [ %l6 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2015bc0: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015bc4: 90 10 00 11 mov %l1, %o0 2015bc8: 92 20 40 09 sub %g1, %o1, %o1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2015bcc: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015bd0: 40 00 12 08 call 201a3f0 <_Watchdog_Adjust_to_chain> 2015bd4: 94 10 00 12 mov %l2, %o2 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2015bd8: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2015bdc: e0 05 40 00 ld [ %l5 ], %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 ) { 2015be0: 80 a4 00 09 cmp %l0, %o1 2015be4: 38 80 00 2f bgu,a 2015ca0 <_Timer_server_Body+0x140> 2015be8: 92 24 00 09 sub %l0, %o1, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2015bec: 80 a4 00 09 cmp %l0, %o1 2015bf0: 0a 80 00 30 bcs 2015cb0 <_Timer_server_Body+0x150> 2015bf4: 94 22 40 10 sub %o1, %l0, %o2 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2015bf8: 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 ); 2015bfc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2015c00: 40 00 02 98 call 2016660 <_Chain_Get> 2015c04: 01 00 00 00 nop if ( timer == NULL ) { 2015c08: 80 a2 20 00 cmp %o0, 0 2015c0c: 02 80 00 10 be 2015c4c <_Timer_server_Body+0xec> 2015c10: 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 ) { 2015c14: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2015c18: 80 a0 60 01 cmp %g1, 1 2015c1c: 02 80 00 29 be 2015cc0 <_Timer_server_Body+0x160> 2015c20: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2015c24: 12 bf ff f6 bne 2015bfc <_Timer_server_Body+0x9c> 2015c28: 92 02 20 10 add %o0, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2015c2c: 40 00 12 27 call 201a4c8 <_Watchdog_Insert> 2015c30: 90 10 00 13 mov %l3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2015c34: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2015c38: 40 00 02 8a call 2016660 <_Chain_Get> 2015c3c: 01 00 00 00 nop if ( timer == NULL ) { 2015c40: 80 a2 20 00 cmp %o0, 0 2015c44: 32 bf ff f5 bne,a 2015c18 <_Timer_server_Body+0xb8> 2015c48: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 2015c4c: 7f ff e3 a4 call 200eadc 2015c50: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2015c54: c2 07 bf f4 ld [ %fp + -12 ], %g1 2015c58: 80 a5 00 01 cmp %l4, %g1 2015c5c: 02 80 00 1d be 2015cd0 <_Timer_server_Body+0x170> 2015c60: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2015c64: 7f ff e3 a2 call 200eaec <== NOT EXECUTED 2015c68: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2015c6c: c2 05 80 00 ld [ %l6 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2015c70: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015c74: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED 2015c78: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2015c7c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015c80: 40 00 11 dc call 201a3f0 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 2015c84: 94 10 00 12 mov %l2, %o2 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2015c88: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2015c8c: e0 05 40 00 ld [ %l5 ], %l0 <== NOT EXECUTED /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 2015c90: 80 a4 00 09 cmp %l0, %o1 <== NOT EXECUTED 2015c94: 08 bf ff d7 bleu 2015bf0 <_Timer_server_Body+0x90> <== NOT EXECUTED 2015c98: 01 00 00 00 nop <== NOT EXECUTED /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2015c9c: 92 24 00 09 sub %l0, %o1, %o1 <== NOT EXECUTED 2015ca0: 90 10 00 13 mov %l3, %o0 2015ca4: 40 00 11 d3 call 201a3f0 <_Watchdog_Adjust_to_chain> 2015ca8: 94 10 00 12 mov %l2, %o2 2015cac: 30 bf ff d3 b,a 2015bf8 <_Timer_server_Body+0x98> /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 2015cb0: 90 10 00 13 mov %l3, %o0 2015cb4: 40 00 11 9f call 201a330 <_Watchdog_Adjust> 2015cb8: 92 10 20 01 mov 1, %o1 2015cbc: 30 bf ff cf b,a 2015bf8 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2015cc0: 92 02 20 10 add %o0, 0x10, %o1 2015cc4: 40 00 12 01 call 201a4c8 <_Watchdog_Insert> 2015cc8: 90 10 00 11 mov %l1, %o0 2015ccc: 30 bf ff cc b,a 2015bfc <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 2015cd0: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2015cd4: 7f ff e3 86 call 200eaec 2015cd8: 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 ) ) { 2015cdc: c2 07 bf e8 ld [ %fp + -24 ], %g1 2015ce0: 80 a5 c0 01 cmp %l7, %g1 2015ce4: 12 80 00 0c bne 2015d14 <_Timer_server_Body+0x1b4> 2015ce8: 01 00 00 00 nop 2015cec: 30 80 00 13 b,a 2015d38 <_Timer_server_Body+0x1d8> * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 2015cf0: c0 24 20 08 clr [ %l0 + 8 ] Chain_Node *return_node; Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; the_chain->first = new_first; 2015cf4: c2 27 bf e8 st %g1, [ %fp + -24 ] new_first->previous = _Chain_Head(the_chain); 2015cf8: e4 20 60 04 st %l2, [ %g1 + 4 ] _ISR_Enable( level ); 2015cfc: 7f ff e3 7c call 200eaec 2015d00: 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 ); 2015d04: d2 04 20 24 ld [ %l0 + 0x24 ], %o1 2015d08: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 2015d0c: 9f c0 40 00 call %g1 2015d10: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 2015d14: 7f ff e3 72 call 200eadc 2015d18: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 2015d1c: 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)) 2015d20: 80 a5 c0 10 cmp %l7, %l0 2015d24: 32 bf ff f3 bne,a 2015cf0 <_Timer_server_Body+0x190> 2015d28: c2 04 00 00 ld [ %l0 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2015d2c: 7f ff e3 70 call 200eaec 2015d30: 01 00 00 00 nop 2015d34: 30 bf ff a1 b,a 2015bb8 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2015d38: c0 2e 20 7c clrb [ %i0 + 0x7c ] 2015d3c: c2 07 00 00 ld [ %i4 ], %g1 2015d40: 82 00 60 01 inc %g1 2015d44: c2 27 00 00 st %g1, [ %i4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2015d48: d0 06 00 00 ld [ %i0 ], %o0 2015d4c: 40 00 0e d3 call 2019898 <_Thread_Set_state> 2015d50: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2015d54: 7f ff ff 59 call 2015ab8 <_Timer_server_Reset_interval_system_watchdog> 2015d58: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2015d5c: 7f ff ff 6c call 2015b0c <_Timer_server_Reset_tod_system_watchdog> 2015d60: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2015d64: 40 00 0b df call 2018ce0 <_Thread_Enable_dispatch> 2015d68: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015d6c: 90 10 00 19 mov %i1, %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; 2015d70: f6 2e 20 7c stb %i3, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2015d74: 40 00 12 42 call 201a67c <_Watchdog_Remove> 2015d78: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2015d7c: 40 00 12 40 call 201a67c <_Watchdog_Remove> 2015d80: 90 10 00 1a mov %i2, %o0 2015d84: 30 bf ff 8d b,a 2015bb8 <_Timer_server_Body+0x58> 0200b238 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b238: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b23c: 7f ff de 9a call 2002ca4 200b240: 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)); 200b244: 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; 200b248: 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 ) ) { 200b24c: 80 a0 40 11 cmp %g1, %l1 200b250: 02 80 00 1f be 200b2cc <_Watchdog_Adjust+0x94> 200b254: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b258: 12 80 00 1f bne 200b2d4 <_Watchdog_Adjust+0x9c> 200b25c: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b260: 80 a6 a0 00 cmp %i2, 0 200b264: 02 80 00 1a be 200b2cc <_Watchdog_Adjust+0x94> 200b268: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200b26c: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 200b270: 80 a6 80 19 cmp %i2, %i1 200b274: 1a 80 00 0b bcc 200b2a0 <_Watchdog_Adjust+0x68> 200b278: a4 10 20 01 mov 1, %l2 _Watchdog_First( header )->delta_interval -= units; 200b27c: 10 80 00 1d b 200b2f0 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200b280: b4 26 40 1a sub %i1, %i2, %i2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b284: b4 a6 80 19 subcc %i2, %i1, %i2 200b288: 02 80 00 11 be 200b2cc <_Watchdog_Adjust+0x94> 200b28c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200b290: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 200b294: 80 a6 40 1a cmp %i1, %i2 200b298: 38 80 00 16 bgu,a 200b2f0 <_Watchdog_Adjust+0xb8> 200b29c: b4 26 40 1a sub %i1, %i2, %i2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200b2a0: e4 20 60 10 st %l2, [ %g1 + 0x10 ] _ISR_Enable( level ); 200b2a4: 7f ff de 84 call 2002cb4 200b2a8: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b2ac: 40 00 00 b6 call 200b584 <_Watchdog_Tickle> 200b2b0: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 200b2b4: 7f ff de 7c call 2002ca4 200b2b8: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 200b2bc: c4 04 00 00 ld [ %l0 ], %g2 if ( _Chain_Is_empty( header ) ) 200b2c0: 80 a4 40 02 cmp %l1, %g2 200b2c4: 12 bf ff f0 bne 200b284 <_Watchdog_Adjust+0x4c> 200b2c8: 82 10 00 02 mov %g2, %g1 } break; } } _ISR_Enable( level ); 200b2cc: 7f ff de 7a call 2002cb4 200b2d0: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200b2d4: 12 bf ff fe bne 200b2cc <_Watchdog_Adjust+0x94> 200b2d8: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b2dc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b2e0: b4 00 80 1a add %g2, %i2, %i2 200b2e4: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200b2e8: 7f ff de 73 call 2002cb4 200b2ec: 91 e8 00 08 restore %g0, %o0, %o0 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; 200b2f0: 10 bf ff f7 b 200b2cc <_Watchdog_Adjust+0x94> 200b2f4: f4 20 60 10 st %i2, [ %g1 + 0x10 ] 02007fd8 : rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007fd8: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007fdc: 03 00 80 83 sethi %hi(0x2020c00), %g1 2007fe0: c2 00 63 bc ld [ %g1 + 0x3bc ], %g1 ! 2020fbc <_ISR_Nest_level> rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; 2007fe4: 09 00 80 84 sethi %hi(0x2021000), %g4 if ( rtems_interrupt_is_in_progress() ) 2007fe8: 80 a0 60 00 cmp %g1, 0 2007fec: 84 10 20 12 mov 0x12, %g2 rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2007ff0: 82 10 00 19 mov %i1, %g1 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2007ff4: 12 80 00 49 bne 2008118 2007ff8: c6 01 22 20 ld [ %g4 + 0x220 ], %g3 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 2007ffc: 80 a6 a0 00 cmp %i2, 0 2008000: 02 80 00 4b be 200812c 2008004: 80 a6 60 00 cmp %i1, 0 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 2008008: 02 80 00 49 be 200812c 200800c: c6 26 80 00 st %g3, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008010: c4 06 40 00 ld [ %i1 ], %g2 2008014: 80 a0 a0 00 cmp %g2, 0 2008018: 22 80 00 42 be,a 2008120 200801c: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 2008020: 80 a0 c0 18 cmp %g3, %i0 2008024: 08 80 00 3d bleu 2008118 2008028: 84 10 20 0a mov 0xa, %g2 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 200802c: 05 00 80 83 sethi %hi(0x2020c00), %g2 2008030: c6 00 a3 20 ld [ %g2 + 0x320 ], %g3 ! 2020f20 <_Thread_Dispatch_disable_level> 2008034: 86 00 e0 01 inc %g3 2008038: c6 20 a3 20 st %g3, [ %g2 + 0x320 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 200803c: 80 a6 20 00 cmp %i0, 0 2008040: 12 80 00 2b bne 20080ec 2008044: 05 00 80 84 sethi %hi(0x2021000), %g2 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2008048: da 01 22 20 ld [ %g4 + 0x220 ], %o5 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 200804c: 80 a3 60 00 cmp %o5, 0 2008050: 02 80 00 3a be 2008138 2008054: d8 00 a2 24 ld [ %g2 + 0x224 ], %o4 2008058: 10 80 00 05 b 200806c 200805c: 86 10 00 0c mov %o4, %g3 2008060: 80 a3 40 18 cmp %o5, %i0 2008064: 08 80 00 0b bleu 2008090 2008068: 86 00 e0 18 add %g3, 0x18, %g3 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 200806c: c8 00 c0 00 ld [ %g3 ], %g4 2008070: 80 a1 20 00 cmp %g4, 0 2008074: 32 bf ff fb bne,a 2008060 2008078: b0 06 20 01 inc %i0 200807c: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2008080: 80 a1 20 00 cmp %g4, 0 2008084: 32 bf ff f7 bne,a 2008060 2008088: b0 06 20 01 inc %i0 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 200808c: 80 a3 40 18 cmp %o5, %i0 2008090: 02 80 00 2b be 200813c 2008094: f0 26 80 00 st %i0, [ %i2 ] 2008098: 85 2e 20 03 sll %i0, 3, %g2 200809c: 87 2e 20 05 sll %i0, 5, %g3 20080a0: 84 20 c0 02 sub %g3, %g2, %g2 20080a4: 84 03 00 02 add %o4, %g2, %g2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20080a8: c6 00 40 00 ld [ %g1 ], %g3 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 20080ac: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20080b0: c6 20 80 00 st %g3, [ %g2 ] 20080b4: c6 00 60 04 ld [ %g1 + 4 ], %g3 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 20080b8: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20080bc: c6 20 a0 04 st %g3, [ %g2 + 4 ] 20080c0: c6 00 60 08 ld [ %g1 + 8 ], %g3 20080c4: c6 20 a0 08 st %g3, [ %g2 + 8 ] 20080c8: c6 00 60 0c ld [ %g1 + 0xc ], %g3 20080cc: c6 20 a0 0c st %g3, [ %g2 + 0xc ] 20080d0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 20080d4: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] 20080d8: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 _Thread_Enable_dispatch(); 20080dc: 40 00 07 2b call 2009d88 <_Thread_Enable_dispatch> 20080e0: c2 20 a0 14 st %g1, [ %g2 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 20080e4: 40 00 24 31 call 20111a8 20080e8: 81 e8 00 00 restore _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 20080ec: c6 00 a2 24 ld [ %g2 + 0x224 ], %g3 20080f0: 89 2e 20 05 sll %i0, 5, %g4 20080f4: 85 2e 20 03 sll %i0, 3, %g2 20080f8: 84 21 00 02 sub %g4, %g2, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 20080fc: c8 00 c0 02 ld [ %g3 + %g2 ], %g4 2008100: 80 a1 20 00 cmp %g4, 0 2008104: 02 80 00 12 be 200814c 2008108: 84 00 c0 02 add %g3, %g2, %g2 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 200810c: 40 00 07 1f call 2009d88 <_Thread_Enable_dispatch> 2008110: 01 00 00 00 nop 2008114: 84 10 20 0c mov 0xc, %g2 ! c _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2008118: 81 c7 e0 08 ret 200811c: 91 e8 00 02 restore %g0, %g2, %o0 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008120: 80 a0 a0 00 cmp %g2, 0 2008124: 12 bf ff c0 bne 2008024 2008128: 80 a0 c0 18 cmp %g3, %i0 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 200812c: 84 10 20 09 mov 9, %g2 } 2008130: 81 c7 e0 08 ret 2008134: 91 e8 00 02 restore %g0, %g2, %o0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2008138: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 200813c: 40 00 07 13 call 2009d88 <_Thread_Enable_dispatch> 2008140: 01 00 00 00 nop return sc; 2008144: 10 bf ff f5 b 2008118 2008148: 84 10 20 05 mov 5, %g2 ! 5 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 200814c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008150: 80 a0 e0 00 cmp %g3, 0 2008154: 12 bf ff ee bne 200810c 2008158: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 200815c: 10 bf ff d3 b 20080a8 2008160: f0 26 80 00 st %i0, [ %i2 ] 02008a80 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2008a80: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 2008a84: 80 a6 20 00 cmp %i0, 0 2008a88: 02 80 00 23 be 2008b14 2008a8c: 25 00 80 a3 sethi %hi(0x2028c00), %l2 2008a90: a4 14 a2 b4 or %l2, 0x2b4, %l2 ! 2028eb4 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 2008a94: a6 04 a0 10 add %l2, 0x10, %l3 if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { if ( !_Objects_Information_table[ api_index ] ) 2008a98: c2 04 80 00 ld [ %l2 ], %g1 2008a9c: 80 a0 60 00 cmp %g1, 0 2008aa0: 22 80 00 1a be,a 2008b08 2008aa4: a4 04 a0 04 add %l2, 4, %l2 continue; information = _Objects_Information_table[ api_index ][ 1 ]; 2008aa8: e2 00 60 04 ld [ %g1 + 4 ], %l1 if ( !information ) 2008aac: 80 a4 60 00 cmp %l1, 0 2008ab0: 22 80 00 16 be,a 2008b08 2008ab4: a4 04 a0 04 add %l2, 4, %l2 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2008ab8: c2 14 60 10 lduh [ %l1 + 0x10 ], %g1 2008abc: 84 90 60 00 orcc %g1, 0, %g2 2008ac0: 22 80 00 12 be,a 2008b08 2008ac4: a4 04 a0 04 add %l2, 4, %l2 <== NOT EXECUTED 2008ac8: a0 10 20 01 mov 1, %l0 the_thread = (Thread_Control *)information->local_table[ i ]; 2008acc: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 2008ad0: 83 2c 20 02 sll %l0, 2, %g1 2008ad4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 2008ad8: 90 90 60 00 orcc %g1, 0, %o0 2008adc: 02 80 00 05 be 2008af0 2008ae0: a0 04 20 01 inc %l0 continue; (*routine)(the_thread); 2008ae4: 9f c6 00 00 call %i0 2008ae8: 01 00 00 00 nop 2008aec: c4 14 60 10 lduh [ %l1 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2008af0: 83 28 a0 10 sll %g2, 0x10, %g1 2008af4: 83 30 60 10 srl %g1, 0x10, %g1 2008af8: 80 a0 40 10 cmp %g1, %l0 2008afc: 3a bf ff f5 bcc,a 2008ad0 2008b00: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 2008b04: a4 04 a0 04 add %l2, 4, %l2 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2008b08: 80 a4 80 13 cmp %l2, %l3 2008b0c: 32 bf ff e4 bne,a 2008a9c 2008b10: c2 04 80 00 ld [ %l2 ], %g1 2008b14: 81 c7 e0 08 ret 2008b18: 81 e8 00 00 restore