30016d44 <_CORE_message_queue_Broadcast>:
{
Thread_Control *the_thread;
uint32_t number_broadcasted;
Thread_Wait_information *waitp;
if ( size > the_message_queue->maximum_message_size ) {
30016d44: e590304c ldr r3, [r0, #76] ; 0x4c
Objects_Id id __attribute__((unused)),
CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)),
#endif
uint32_t *count
)
{
30016d48: e92d45f0 push {r4, r5, r6, r7, r8, sl, lr}
Thread_Control *the_thread;
uint32_t number_broadcasted;
Thread_Wait_information *waitp;
if ( size > the_message_queue->maximum_message_size ) {
30016d4c: e1530002 cmp r3, r2
Objects_Id id __attribute__((unused)),
CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)),
#endif
uint32_t *count
)
{
30016d50: e1a07000 mov r7, r0 30016d54: e1a05002 mov r5, r2 30016d58: e1a08001 mov r8, r1 30016d5c: e59da020 ldr sl, [sp, #32]
Thread_Control *the_thread;
uint32_t number_broadcasted;
Thread_Wait_information *waitp;
if ( size > the_message_queue->maximum_message_size ) {
30016d60: 3a000016 bcc 30016dc0 <_CORE_message_queue_Broadcast+0x7c>
* NOTE: This check is critical because threads can block on
* send and receive and this ensures that we are broadcasting
* the message to threads waiting to receive -- not to send.
*/
if ( the_message_queue->number_of_pending_messages != 0 ) {
30016d64: e5906048 ldr r6, [r0, #72] ; 0x48 30016d68: e3560000 cmp r6, #0
*count = 0;
30016d6c: 13a00000 movne r0, #0 30016d70: 158a0000 strne r0, [sl]
* NOTE: This check is critical because threads can block on
* send and receive and this ensures that we are broadcasting
* the message to threads waiting to receive -- not to send.
*/
if ( the_message_queue->number_of_pending_messages != 0 ) {
30016d74: 18bd85f0 popne {r4, r5, r6, r7, r8, sl, pc}
/* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread =
30016d78: e1a00007 mov r0, r7 30016d7c: eb000a0d bl 300195b8 <_Thread_queue_Dequeue> 30016d80: e2504000 subs r4, r0, #0
30016d84: 0a00000a beq 30016db4 <_CORE_message_queue_Broadcast+0x70>
const void *source,
void *destination,
size_t size
)
{
memcpy(destination, source, size);
30016d88: e594002c ldr r0, [r4, #44] ; 0x2c 30016d8c: e1a01008 mov r1, r8 30016d90: e1a02005 mov r2, r5 30016d94: eb00207d bl 3001ef90 <memcpy>
buffer,
waitp->return_argument_second.mutable_object,
size
);
*(size_t *) the_thread->Wait.return_argument = size;
30016d98: e5943028 ldr r3, [r4, #40] ; 0x28
/* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread =
30016d9c: e1a00007 mov r0, r7
buffer,
waitp->return_argument_second.mutable_object,
size
);
*(size_t *) the_thread->Wait.return_argument = size;
30016da0: e5835000 str r5, [r3]
/* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread =
30016da4: eb000a03 bl 300195b8 <_Thread_queue_Dequeue> 30016da8: e2504000 subs r4, r0, #0
_Thread_queue_Dequeue(&the_message_queue->Wait_queue))) {
waitp = &the_thread->Wait;
number_broadcasted += 1;
30016dac: e2866001 add r6, r6, #1
/*
* There must be no pending messages if there is a thread waiting to
* receive a message.
*/
number_broadcasted = 0;
while ((the_thread =
30016db0: 1afffff4 bne 30016d88 <_CORE_message_queue_Broadcast+0x44>
if ( !_Objects_Is_local_id( the_thread->Object.id ) )
(*api_message_queue_mp_support) ( the_thread, id );
#endif
}
*count = number_broadcasted;
30016db4: e58a6000 str r6, [sl]
return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL;
30016db8: e1a00004 mov r0, r4
30016dbc: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc}
Thread_Control *the_thread;
uint32_t number_broadcasted;
Thread_Wait_information *waitp;
if ( size > the_message_queue->maximum_message_size ) {
return CORE_MESSAGE_QUEUE_STATUS_INVALID_SIZE;
30016dc0: e3a00001 mov r0, #1 <== NOT EXECUTED
#endif
}
*count = number_broadcasted;
return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL;
}
30016dc4: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc} <== NOT EXECUTED
3000ac0c <_CORE_mutex_Seize_interrupt_trylock>:
{
Thread_Control *executing;
/* disabled when you get here */
executing = _Thread_Executing;
3000ac0c: e59f215c ldr r2, [pc, #348] ; 3000ad70 <_CORE_mutex_Seize_interrupt_trylock+0x164>
executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL;
if ( !_CORE_mutex_Is_locked( the_mutex ) ) {
3000ac10: e590c050 ldr ip, [r0, #80] ; 0x50
#if defined(__RTEMS_DO_NOT_INLINE_CORE_MUTEX_SEIZE__)
int _CORE_mutex_Seize_interrupt_trylock(
CORE_mutex_Control *the_mutex,
ISR_Level *level_p
)
{
3000ac14: e1a03000 mov r3, r0
{
Thread_Control *executing;
/* disabled when you get here */
executing = _Thread_Executing;
3000ac18: e5922004 ldr r2, [r2, #4]
executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL;
3000ac1c: e3a00000 mov r0, #0
if ( !_CORE_mutex_Is_locked( the_mutex ) ) {
3000ac20: e15c0000 cmp ip, r0
3000ac24: e92d40f0 push {r4, r5, r6, r7, lr}
Thread_Control *executing;
/* disabled when you get here */
executing = _Thread_Executing;
executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL;
3000ac28: e5820034 str r0, [r2, #52] ; 0x34
if ( !_CORE_mutex_Is_locked( the_mutex ) ) {
3000ac2c: 0a00000e beq 3000ac6c <_CORE_mutex_Seize_interrupt_trylock+0x60>
return _CORE_mutex_Seize_interrupt_trylock_body( the_mutex, level_p );
}
3000ac30: e593c048 ldr ip, [r3, #72] ; 0x48
the_mutex->lock = CORE_MUTEX_LOCKED;
the_mutex->holder = executing;
the_mutex->holder_id = executing->Object.id;
3000ac34: e5925008 ldr r5, [r2, #8]
the_mutex->nest_count = 1;
3000ac38: e3a04001 mov r4, #1
if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) ||
3000ac3c: e35c0002 cmp ip, #2
/* disabled when you get here */
executing = _Thread_Executing;
executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL;
if ( !_CORE_mutex_Is_locked( the_mutex ) ) {
the_mutex->lock = CORE_MUTEX_LOCKED;
3000ac40: e5830050 str r0, [r3, #80] ; 0x50
the_mutex->holder = executing;
3000ac44: e583205c str r2, [r3, #92] ; 0x5c
the_mutex->holder_id = executing->Object.id;
3000ac48: e5835060 str r5, [r3, #96] ; 0x60
the_mutex->nest_count = 1;
3000ac4c: e5834054 str r4, [r3, #84] ; 0x54
if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) ||
3000ac50: 0a000013 beq 3000aca4 <_CORE_mutex_Seize_interrupt_trylock+0x98>
3000ac54: e35c0003 cmp ip, #3
3000ac58: 0a000018 beq 3000acc0 <_CORE_mutex_Seize_interrupt_trylock+0xb4>
3000ac5c: e5913000 ldr r3, [r1] 3000ac60: e129f003 msr CPSR_fc, r3
executing->resource_count++;
}
if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) {
_ISR_Enable( *level_p );
return 0;
3000ac64: e3a00000 mov r0, #0
3000ac68: e8bd80f0 pop {r4, r5, r6, r7, pc}
/*
* 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 ) ) {
3000ac6c: e593005c ldr r0, [r3, #92] ; 0x5c 3000ac70: e1520000 cmp r2, r0
/*
* The mutex is not available and the caller must deal with the possibility
* of blocking.
*/
return 1;
3000ac74: 13a00001 movne r0, #1
/*
* 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 ) ) {
3000ac78: 18bd80f0 popne {r4, r5, r6, r7, pc}
switch ( the_mutex->Attributes.lock_nesting_behavior ) {
3000ac7c: e5930040 ldr r0, [r3, #64] ; 0x40 3000ac80: e3500000 cmp r0, #0
3000ac84: 1a00001e bne 3000ad04 <_CORE_mutex_Seize_interrupt_trylock+0xf8>
case CORE_MUTEX_NESTING_ACQUIRES:
the_mutex->nest_count++;
3000ac88: e5932054 ldr r2, [r3, #84] ; 0x54 3000ac8c: e2822001 add r2, r2, #1 3000ac90: e5832054 str r2, [r3, #84] ; 0x54 3000ac94: e5913000 ldr r3, [r1] 3000ac98: e129f003 msr CPSR_fc, r3
_ISR_Enable( *level_p );
return 0;
3000ac9c: e3a00000 mov r0, #0
3000aca0: e8bd80f0 pop {r4, r5, r6, r7, pc}
_Chain_Prepend_unprotected( &executing->lock_mutex,
&the_mutex->queue.lock_queue );
the_mutex->queue.priority_before = executing->current_priority;
#endif
executing->resource_count++;
3000aca4: e592301c ldr r3, [r2, #28] 3000aca8: e2833001 add r3, r3, #1 3000acac: e582301c str r3, [r2, #28] 3000acb0: e5913000 ldr r3, [r1] 3000acb4: e129f003 msr CPSR_fc, r3
}
if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) {
_ISR_Enable( *level_p );
return 0;
3000acb8: e3a00000 mov r0, #0
3000acbc: e8bd80f0 pop {r4, r5, r6, r7, pc}
_Chain_Prepend_unprotected( &executing->lock_mutex,
&the_mutex->queue.lock_queue );
the_mutex->queue.priority_before = executing->current_priority;
#endif
executing->resource_count++;
3000acc0: e592c01c ldr ip, [r2, #28]
*/
{
Priority_Control ceiling;
Priority_Control current;
ceiling = the_mutex->Attributes.priority_ceiling;
3000acc4: e593704c ldr r7, [r3, #76] ; 0x4c
current = executing->current_priority;
3000acc8: e5926014 ldr r6, [r2, #20]
_Chain_Prepend_unprotected( &executing->lock_mutex,
&the_mutex->queue.lock_queue );
the_mutex->queue.priority_before = executing->current_priority;
#endif
executing->resource_count++;
3000accc: e08c5004 add r5, ip, r4
Priority_Control ceiling;
Priority_Control current;
ceiling = the_mutex->Attributes.priority_ceiling;
current = executing->current_priority;
if ( current == ceiling ) {
3000acd0: e1570006 cmp r7, r6
_Chain_Prepend_unprotected( &executing->lock_mutex,
&the_mutex->queue.lock_queue );
the_mutex->queue.priority_before = executing->current_priority;
#endif
executing->resource_count++;
3000acd4: e582501c str r5, [r2, #28]
Priority_Control ceiling;
Priority_Control current;
ceiling = the_mutex->Attributes.priority_ceiling;
current = executing->current_priority;
if ( current == ceiling ) {
3000acd8: 0a000020 beq 3000ad60 <_CORE_mutex_Seize_interrupt_trylock+0x154>
_ISR_Enable( *level_p );
return 0;
}
if ( current > ceiling ) {
3000acdc: 3a000012 bcc 3000ad2c <_CORE_mutex_Seize_interrupt_trylock+0x120>
);
_Thread_Enable_dispatch();
return 0;
}
/* if ( current < ceiling ) */ {
executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED;
3000ace0: e3a05006 mov r5, #6 3000ace4: e5825034 str r5, [r2, #52] ; 0x34
the_mutex->lock = CORE_MUTEX_UNLOCKED;
3000ace8: e5834050 str r4, [r3, #80] ; 0x50
the_mutex->nest_count = 0; /* undo locking above */
3000acec: e5830054 str r0, [r3, #84] ; 0x54
executing->resource_count--; /* undo locking above */
3000acf0: e582c01c str ip, [r2, #28] 3000acf4: e5913000 ldr r3, [r1] 3000acf8: e129f003 msr CPSR_fc, r3
_ISR_Enable( *level_p );
return 0;
3000acfc: e3a00000 mov r0, #0
3000ad00: e8bd80f0 pop {r4, r5, r6, r7, pc}
* 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 ) {
3000ad04: e3500001 cmp r0, #1
3000ad08: 0a000001 beq 3000ad14 <_CORE_mutex_Seize_interrupt_trylock+0x108>
/*
* The mutex is not available and the caller must deal with the possibility
* of blocking.
*/
return 1;
3000ad0c: e3a00001 mov r0, #1
3000ad10: e8bd80f0 pop {r4, r5, r6, r7, pc}
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;
3000ad14: e3a03002 mov r3, #2 <== NOT EXECUTED 3000ad18: e5823034 str r3, [r2, #52] ; 0x34 <== NOT EXECUTED 3000ad1c: e5913000 ldr r3, [r1] <== NOT EXECUTED 3000ad20: e129f003 msr CPSR_fc, r3 <== NOT EXECUTED
_ISR_Enable( *level_p );
return 0;
3000ad24: e3a00000 mov r0, #0 <== NOT EXECUTED
3000ad28: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED
rtems_fatal_error_occurred( 99 );
}
}
#endif
_Thread_Dispatch_disable_level += 1;
3000ad2c: e59f2040 ldr r2, [pc, #64] ; 3000ad74 <_CORE_mutex_Seize_interrupt_trylock+0x168> 3000ad30: e5920000 ldr r0, [r2] 3000ad34: e2800001 add r0, r0, #1 3000ad38: e5820000 str r0, [r2] 3000ad3c: e5912000 ldr r2, [r1] 3000ad40: e129f002 msr CPSR_fc, r2
}
if ( current > ceiling ) {
_Thread_Disable_dispatch();
_ISR_Enable( *level_p );
_Thread_Change_priority(
3000ad44: e3a02000 mov r2, #0 3000ad48: e593005c ldr r0, [r3, #92] ; 0x5c 3000ad4c: e593104c ldr r1, [r3, #76] ; 0x4c 3000ad50: ebfff149 bl 3000727c <_Thread_Change_priority>
the_mutex->holder,
the_mutex->Attributes.priority_ceiling,
false
);
_Thread_Enable_dispatch();
3000ad54: ebfff2a3 bl 300077e8 <_Thread_Enable_dispatch>
return 0;
3000ad58: e3a00000 mov r0, #0
3000ad5c: e8bd80f0 pop {r4, r5, r6, r7, pc}
3000ad60: e5913000 ldr r3, [r1]
3000ad64: e129f003 msr CPSR_fc, r3
ceiling = the_mutex->Attributes.priority_ceiling;
current = executing->current_priority;
if ( current == ceiling ) {
_ISR_Enable( *level_p );
return 0;
3000ad68: e3a00000 mov r0, #0
3000ad6c: e8bd80f0 pop {r4, r5, r6, r7, pc}
3000abb0 <_Chain_Initialize>:
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
next = starting_address;
while ( count-- ) {
3000abb0: e3520000 cmp r2, #0
Chain_Node *current;
Chain_Node *next;
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
3000abb4: e3a0c000 mov ip, #0
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
3000abb8: e92d0070 push {r4, r5, r6}
Chain_Node *current;
Chain_Node *next;
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
3000abbc: e580c004 str ip, [r0, #4]
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Head(
Chain_Control *the_chain
)
{
return (Chain_Node *) the_chain;
3000abc0: e1a04000 mov r4, r0
next = starting_address;
3000abc4: 11a05002 movne r5, r2 3000abc8: 11a0c001 movne ip, r1
while ( count-- ) {
3000abcc: 1a000002 bne 3000abdc <_Chain_Initialize+0x2c>
3000abd0: ea000008 b 3000abf8 <_Chain_Initialize+0x48> <== NOT EXECUTED
3000abd4: e1a0400c mov r4, ip
current->next = next;
next->previous = current;
current = next;
next = (Chain_Node *)
3000abd8: e1a0c006 mov ip, r6
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
next = starting_address;
while ( count-- ) {
3000abdc: e2555001 subs r5, r5, #1
current->next = next;
3000abe0: e584c000 str ip, [r4]
next->previous = current;
3000abe4: e58c4004 str r4, [ip, #4]
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
3000abe8: e08c6003 add r6, ip, r3
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
next = starting_address;
while ( count-- ) {
3000abec: 1afffff8 bne 3000abd4 <_Chain_Initialize+0x24>
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
3000abf0: e2422001 sub r2, r2, #1
count = number_nodes;
current = _Chain_Head( the_chain );
the_chain->permanent_null = NULL;
next = starting_address;
while ( count-- ) {
3000abf4: e0241293 mla r4, r3, r2, r1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail(
Chain_Control *the_chain
)
{
return (Chain_Node *) &the_chain->permanent_null;
3000abf8: e2803004 add r3, r0, #4
next->previous = current;
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = _Chain_Tail( the_chain );
3000abfc: e5843000 str r3, [r4]
the_chain->last = current;
3000ac00: e5804008 str r4, [r0, #8]
}
3000ac04: e8bd0070 pop {r4, r5, r6}
3000ac08: e12fff1e bx lr
3000adec <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
3000adec: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr}
3000adf0: e1a08002 mov r8, r2
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;
uintptr_t const page_size = heap->page_size;
3000adf4: e5902010 ldr r2, [r0, #16]
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
3000adf8: e24dd01c sub sp, sp, #28 3000adfc: e1a05001 mov r5, r1
- 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 ) {
3000ae00: e2911004 adds r1, r1, #4
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
3000ae04: e1a07000 mov r7, r0
- 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 ) {
3000ae08: e58d1000 str r1, [sp]
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
3000ae0c: e1a0b003 mov fp, r3
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
3000ae10: e5909008 ldr r9, [r0, #8]
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;
uintptr_t const page_size = heap->page_size;
3000ae14: e58d200c str r2, [sp, #12]
uintptr_t alloc_begin = 0;
uint32_t search_count = 0;
if ( block_size_floor < alloc_size ) {
3000ae18: 2a000073 bcs 3000afec <_Heap_Allocate_aligned_with_boundary+0x200>
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
3000ae1c: e3530000 cmp r3, #0
3000ae20: 1a00006f bne 3000afe4 <_Heap_Allocate_aligned_with_boundary+0x1f8>
if ( alignment == 0 ) {
alignment = page_size;
}
}
while ( block != free_list_tail ) {
3000ae24: e1570009 cmp r7, r9
3000ae28: 0a00006f beq 3000afec <_Heap_Allocate_aligned_with_boundary+0x200>
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
3000ae2c: e59d300c ldr r3, [sp, #12]
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET;
3000ae30: e2651004 rsb r1, r5, #4
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
3000ae34: e2833007 add r3, r3, #7
if ( alignment == 0 ) {
alignment = page_size;
}
}
while ( block != free_list_tail ) {
3000ae38: e3a06000 mov r6, #0
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
3000ae3c: e58d3010 str r3, [sp, #16]
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET;
3000ae40: e58d1014 str r1, [sp, #20]
/*
* 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 ) {
3000ae44: e599a004 ldr sl, [r9, #4] 3000ae48: e59d2000 ldr r2, [sp]
while ( block != free_list_tail ) {
_HAssert( _Heap_Is_prev_used( block ) );
/* Statistics */
++search_count;
3000ae4c: e2866001 add r6, r6, #1
/*
* 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 ) {
3000ae50: e152000a cmp r2, sl
3000ae54: 2a00004f bcs 3000af98 <_Heap_Allocate_aligned_with_boundary+0x1ac>
if ( alignment == 0 ) {
3000ae58: e3580000 cmp r8, #0
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Alloc_area_of_block(
const Heap_Block *block
)
{
return (uintptr_t) block + HEAP_BLOCK_HEADER_SIZE;
3000ae5c: 02894008 addeq r4, r9, #8
3000ae60: 0a00004a beq 3000af90 <_Heap_Allocate_aligned_with_boundary+0x1a4>
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
3000ae64: e5973014 ldr r3, [r7, #20]
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;
3000ae68: e59d1014 ldr r1, [sp, #20]
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;
3000ae6c: e59d2010 ldr r2, [sp, #16]
- 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;
3000ae70: e3caa001 bic sl, sl, #1
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
3000ae74: e089a00a add sl, r9, sl
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;
3000ae78: e081400a add r4, r1, sl
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
3000ae7c: e58d3004 str r3, [sp, #4]
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;
3000ae80: e0633002 rsb r3, r3, r2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
3000ae84: e1a00004 mov r0, r4
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
3000ae88: e083a00a add sl, r3, sl 3000ae8c: e1a01008 mov r1, r8
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Alloc_area_of_block(
const Heap_Block *block
)
{
return (uintptr_t) block + HEAP_BLOCK_HEADER_SIZE;
3000ae90: e2893008 add r3, r9, #8 3000ae94: e58d3008 str r3, [sp, #8]
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
3000ae98: eb00157b bl 3001048c <__umodsi3> 3000ae9c: e0604004 rsb r4, r0, r4
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 ) {
3000aea0: e15a0004 cmp sl, r4
3000aea4: 2a000003 bcs 3000aeb8 <_Heap_Allocate_aligned_with_boundary+0xcc>
3000aea8: e1a0000a mov r0, sl 3000aeac: e1a01008 mov r1, r8 3000aeb0: eb001575 bl 3001048c <__umodsi3> 3000aeb4: e060400a rsb r4, r0, sl
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
3000aeb8: e35b0000 cmp fp, #0
3000aebc: 0a000025 beq 3000af58 <_Heap_Allocate_aligned_with_boundary+0x16c>
/* 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;
3000aec0: e084a005 add sl, r4, r5 3000aec4: e1a0000a mov r0, sl 3000aec8: e1a0100b mov r1, fp 3000aecc: eb00156e bl 3001048c <__umodsi3> 3000aed0: e060000a rsb r0, r0, sl
/* 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 ) {
3000aed4: e1540000 cmp r4, r0 3000aed8: 23a03000 movcs r3, #0 3000aedc: 33a03001 movcc r3, #1 3000aee0: e15a0000 cmp sl, r0 3000aee4: 93a03000 movls r3, #0 3000aee8: e3530000 cmp r3, #0
3000aeec: 0a000019 beq 3000af58 <_Heap_Allocate_aligned_with_boundary+0x16c>
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
3000aef0: e59d1008 ldr r1, [sp, #8] 3000aef4: e081a005 add sl, r1, r5
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
if ( boundary_line < boundary_floor ) {
3000aef8: e15a0000 cmp sl, r0 3000aefc: 958d6018 strls r6, [sp, #24]
3000af00: 9a000002 bls 3000af10 <_Heap_Allocate_aligned_with_boundary+0x124>
3000af04: ea000023 b 3000af98 <_Heap_Allocate_aligned_with_boundary+0x1ac> 3000af08: e15a0000 cmp sl, r0
3000af0c: 8a000038 bhi 3000aff4 <_Heap_Allocate_aligned_with_boundary+0x208>
return 0;
}
alloc_begin = boundary_line - alloc_size;
3000af10: e0654000 rsb r4, r5, r0 3000af14: e1a01008 mov r1, r8 3000af18: e1a00004 mov r0, r4 3000af1c: eb00155a bl 3001048c <__umodsi3> 3000af20: e0604004 rsb r4, r0, r4
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
alloc_end = alloc_begin + alloc_size;
3000af24: e0846005 add r6, r4, r5 3000af28: e1a00006 mov r0, r6 3000af2c: e1a0100b mov r1, fp 3000af30: eb001555 bl 3001048c <__umodsi3> 3000af34: e0600006 rsb r0, r0, r6
/* 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 ) {
3000af38: e1560000 cmp r6, r0 3000af3c: 93a06000 movls r6, #0 3000af40: 83a06001 movhi r6, #1 3000af44: e1540000 cmp r4, r0 3000af48: 23a06000 movcs r6, #0 3000af4c: e3560000 cmp r6, #0
3000af50: 1affffec bne 3000af08 <_Heap_Allocate_aligned_with_boundary+0x11c>
3000af54: e59d6018 ldr r6, [sp, #24]
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 ) {
3000af58: e59d2008 ldr r2, [sp, #8] 3000af5c: e1520004 cmp r2, r4
3000af60: 8a00000c bhi 3000af98 <_Heap_Allocate_aligned_with_boundary+0x1ac>
3000af64: e59d100c ldr r1, [sp, #12] 3000af68: e1a00004 mov r0, r4 3000af6c: eb001546 bl 3001048c <__umodsi3> 3000af70: e3e0a007 mvn sl, #7 3000af74: e069a00a rsb sl, r9, sl
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
3000af78: e08aa004 add sl, sl, r4
uintptr_t const alloc_block_begin =
(uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size );
uintptr_t const free_size = alloc_block_begin - block_begin;
if ( free_size >= min_block_size || free_size == 0 ) {
3000af7c: e59d1004 ldr r1, [sp, #4] 3000af80: e060300a rsb r3, r0, sl 3000af84: e15a0000 cmp sl, r0 3000af88: 11510003 cmpne r1, r3
3000af8c: 8a000001 bhi 3000af98 <_Heap_Allocate_aligned_with_boundary+0x1ac>
boundary
);
}
}
if ( alloc_begin != 0 ) {
3000af90: e3540000 cmp r4, #0
3000af94: 1a000004 bne 3000afac <_Heap_Allocate_aligned_with_boundary+0x1c0>
break;
}
block = block->next;
3000af98: e5999008 ldr r9, [r9, #8]
if ( alignment == 0 ) {
alignment = page_size;
}
}
while ( block != free_list_tail ) {
3000af9c: e1570009 cmp r7, r9
3000afa0: 1affffa7 bne 3000ae44 <_Heap_Allocate_aligned_with_boundary+0x58>
3000afa4: e3a00000 mov r0, #0 3000afa8: ea000008 b 3000afd0 <_Heap_Allocate_aligned_with_boundary+0x1e4>
block = block->next;
}
if ( alloc_begin != 0 ) {
/* Statistics */
stats->searches += search_count;
3000afac: e597304c ldr r3, [r7, #76] ; 0x4c
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
3000afb0: e1a00007 mov r0, r7
block = block->next;
}
if ( alloc_begin != 0 ) {
/* Statistics */
stats->searches += search_count;
3000afb4: e0833006 add r3, r3, r6 3000afb8: e587304c str r3, [r7, #76] ; 0x4c
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
3000afbc: e1a01009 mov r1, r9 3000afc0: e1a02004 mov r2, r4 3000afc4: e1a03005 mov r3, r5 3000afc8: ebffee29 bl 30006874 <_Heap_Block_allocate> 3000afcc: e1a00004 mov r0, r4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
3000afd0: e5973044 ldr r3, [r7, #68] ; 0x44 3000afd4: e1530006 cmp r3, r6
stats->max_search = search_count;
3000afd8: 35876044 strcc r6, [r7, #68] ; 0x44
}
return (void *) alloc_begin;
}
3000afdc: e28dd01c add sp, sp, #28
3000afe0: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc}
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
3000afe4: e1550003 cmp r5, r3
3000afe8: 9a000006 bls 3000b008 <_Heap_Allocate_aligned_with_boundary+0x21c>
if ( alignment == 0 ) {
alignment = page_size;
}
}
while ( block != free_list_tail ) {
3000afec: e3a00000 mov r0, #0 3000aff0: eafffff9 b 3000afdc <_Heap_Allocate_aligned_with_boundary+0x1f0>
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
3000aff4: e5999008 ldr r9, [r9, #8] <== NOT EXECUTED 3000aff8: e59d6018 ldr r6, [sp, #24] <== NOT EXECUTED
if ( alignment == 0 ) {
alignment = page_size;
}
}
while ( block != free_list_tail ) {
3000affc: e1570009 cmp r7, r9 <== NOT EXECUTED 3000b000: 1affff8f bne 3000ae44 <_Heap_Allocate_aligned_with_boundary+0x58><== NOT EXECUTED 3000b004: eaffffe6 b 3000afa4 <_Heap_Allocate_aligned_with_boundary+0x1b8><== NOT EXECUTED
if ( boundary < alloc_size ) {
return NULL;
}
if ( alignment == 0 ) {
alignment = page_size;
3000b008: e3580000 cmp r8, #0 3000b00c: 01a08002 moveq r8, r2 3000b010: eaffff83 b 3000ae24 <_Heap_Allocate_aligned_with_boundary+0x38>
3000b014 <_Heap_Free>:
#include <rtems/system.h>
#include <rtems/score/sysstate.h>
#include <rtems/score/heap.h>
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
3000b014: e92d45f0 push {r4, r5, r6, r7, r8, sl, lr}
3000b018: e1a04000 mov r4, r0
3000b01c: e1a05001 mov r5, r1
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
3000b020: e1a00001 mov r0, r1 3000b024: e5941010 ldr r1, [r4, #16] 3000b028: eb001517 bl 3001048c <__umodsi3> 3000b02c: e2455008 sub r5, r5, #8
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
3000b030: e5943020 ldr r3, [r4, #32]
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
3000b034: e0605005 rsb r5, r0, r5
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;
3000b038: e1550003 cmp r5, r3
3000b03c: 3a00002f bcc 3000b100 <_Heap_Free+0xec>
3000b040: e5941024 ldr r1, [r4, #36] ; 0x24 3000b044: e1550001 cmp r5, r1
3000b048: 8a00002c bhi 3000b100 <_Heap_Free+0xec>
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b04c: e595c004 ldr ip, [r5, #4]
- 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;
3000b050: e3cc6001 bic r6, ip, #1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
3000b054: e0852006 add r2, r5, r6
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;
3000b058: e1530002 cmp r3, r2
3000b05c: 8a000027 bhi 3000b100 <_Heap_Free+0xec>
3000b060: e1510002 cmp r1, r2
3000b064: 3a000027 bcc 3000b108 <_Heap_Free+0xf4>
3000b068: e5927004 ldr r7, [r2, #4]
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
_HAssert( false );
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
3000b06c: e2170001 ands r0, r7, #1
3000b070: 08bd85f0 popeq {r4, r5, r6, r7, r8, sl, pc}
return false;
}
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
3000b074: e1510002 cmp r1, r2
- 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;
3000b078: e3c77001 bic r7, r7, #1 3000b07c: 03a08000 moveq r8, #0
3000b080: 0a000004 beq 3000b098 <_Heap_Free+0x84>
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b084: e0820007 add r0, r2, r7
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;
3000b088: e5900004 ldr r0, [r0, #4]
#include <rtems/system.h>
#include <rtems/score/sysstate.h>
#include <rtems/score/heap.h>
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
3000b08c: e3100001 tst r0, #1 3000b090: 13a08000 movne r8, #0 3000b094: 03a08001 moveq r8, #1
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
if ( !_Heap_Is_prev_used( block ) ) {
3000b098: e21c0001 ands r0, ip, #1
3000b09c: 1a00001b bne 3000b110 <_Heap_Free+0xfc>
uintptr_t const prev_size = block->prev_size;
3000b0a0: e595c000 ldr ip, [r5]
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
3000b0a4: e06ca005 rsb sl, ip, r5
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;
3000b0a8: e153000a cmp r3, sl
3000b0ac: 88bd85f0 pophi {r4, r5, r6, r7, r8, sl, pc}
3000b0b0: e151000a cmp r1, sl
3000b0b4: 38bd85f0 popcc {r4, r5, r6, r7, r8, sl, pc}
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;
3000b0b8: e59a0004 ldr r0, [sl, #4]
return( false );
}
/* As we always coalesce free blocks, the block that preceedes prev_block
must have been used. */
if ( !_Heap_Is_prev_used ( prev_block) ) {
3000b0bc: e2100001 ands r0, r0, #1
3000b0c0: 08bd85f0 popeq {r4, r5, r6, r7, r8, sl, pc}
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
3000b0c4: e3580000 cmp r8, #0
3000b0c8: 0a000039 beq 3000b1b4 <_Heap_Free+0x1a0>
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
3000b0cc: e5940038 ldr r0, [r4, #56] ; 0x38
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
3000b0d0: e0867007 add r7, r6, r7
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b0d4: e5923008 ldr r3, [r2, #8]
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
3000b0d8: e087c00c add ip, r7, ip
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b0dc: e592200c ldr r2, [r2, #12]
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
3000b0e0: e2400001 sub r0, r0, #1
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
3000b0e4: e38c1001 orr r1, ip, #1
RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block )
{
Heap_Block *next = block->next;
Heap_Block *prev = block->prev;
prev->next = next;
3000b0e8: e5823008 str r3, [r2, #8]
next->prev = prev;
3000b0ec: e583200c str r2, [r3, #12]
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
3000b0f0: e5840038 str r0, [r4, #56] ; 0x38
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
3000b0f4: e58a1004 str r1, [sl, #4]
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
3000b0f8: e78ac00c str ip, [sl, ip] 3000b0fc: ea00000f b 3000b140 <_Heap_Free+0x12c>
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
_HAssert( false );
return false;
3000b100: e3a00000 mov r0, #0
3000b104: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc}
3000b108: e3a00000 mov r0, #0 <== NOT EXECUTED
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b10c: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc} <== NOT EXECUTED
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
3000b110: e3580000 cmp r8, #0
3000b114: 0a000014 beq 3000b16c <_Heap_Free+0x158>
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b118: e5923008 ldr r3, [r2, #8]
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
3000b11c: e0877006 add r7, r7, r6
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
3000b120: e592200c ldr r2, [r2, #12]
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
3000b124: e3871001 orr r1, r7, #1
)
{
Heap_Block *next = old_block->next;
Heap_Block *prev = old_block->prev;
new_block->next = next;
3000b128: e5853008 str r3, [r5, #8]
new_block->prev = prev;
3000b12c: e585200c str r2, [r5, #12]
next->prev = new_block;
prev->next = new_block;
3000b130: e5825008 str r5, [r2, #8]
Heap_Block *prev = old_block->prev;
new_block->next = next;
new_block->prev = prev;
next->prev = new_block;
3000b134: e583500c str r5, [r3, #12] 3000b138: e5851004 str r1, [r5, #4]
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
3000b13c: e7857007 str r7, [r5, r7]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
3000b140: e5942040 ldr r2, [r4, #64] ; 0x40
++stats->frees;
3000b144: e5943050 ldr r3, [r4, #80] ; 0x50
stats->free_size += block_size;
3000b148: e5941030 ldr r1, [r4, #48] ; 0x30
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
3000b14c: e2422001 sub r2, r2, #1
++stats->frees;
3000b150: e2833001 add r3, r3, #1
stats->free_size += block_size;
3000b154: e0816006 add r6, r1, r6
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
3000b158: e5842040 str r2, [r4, #64] ; 0x40
++stats->frees;
3000b15c: e5843050 str r3, [r4, #80] ; 0x50
stats->free_size += block_size;
3000b160: e5846030 str r6, [r4, #48] ; 0x30
return( true );
3000b164: e3a00001 mov r0, #1
3000b168: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc}
next_block->prev_size = size;
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
3000b16c: e3863001 orr r3, r6, #1 3000b170: e5853004 str r3, [r5, #4]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
3000b174: e5943038 ldr r3, [r4, #56] ; 0x38
if ( stats->max_free_blocks < stats->free_blocks ) {
3000b178: e594c03c ldr ip, [r4, #60] ; 0x3c
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
3000b17c: e5920004 ldr r0, [r2, #4]
RTEMS_INLINE_ROUTINE void _Heap_Free_list_insert_after(
Heap_Block *block_before,
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
3000b180: e5941008 ldr r1, [r4, #8]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
3000b184: e2833001 add r3, r3, #1
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
3000b188: e3c00001 bic r0, r0, #1
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
if ( stats->max_free_blocks < stats->free_blocks ) {
3000b18c: e153000c cmp r3, ip
new_block->next = next;
3000b190: e5851008 str r1, [r5, #8]
new_block->prev = block_before;
3000b194: e585400c str r4, [r5, #12]
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
3000b198: e5820004 str r0, [r2, #4]
block_before->next = new_block; next->prev = new_block;
3000b19c: e581500c str r5, [r1, #12]
next_block->prev_size = block_size;
3000b1a0: e7856006 str r6, [r5, r6]
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
block_before->next = new_block;
3000b1a4: e5845008 str r5, [r4, #8]
/* Statistics */
++stats->free_blocks;
3000b1a8: e5843038 str r3, [r4, #56] ; 0x38
if ( stats->max_free_blocks < stats->free_blocks ) {
stats->max_free_blocks = stats->free_blocks;
3000b1ac: 8584303c strhi r3, [r4, #60] ; 0x3c 3000b1b0: eaffffe2 b 3000b140 <_Heap_Free+0x12c>
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
} else { /* coalesce prev */
uintptr_t const size = block_size + prev_size;
3000b1b4: e086c00c add ip, r6, ip
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
3000b1b8: e38c3001 orr r3, ip, #1 3000b1bc: e58a3004 str r3, [sl, #4]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
3000b1c0: e5923004 ldr r3, [r2, #4]
next_block->prev_size = size;
3000b1c4: e785c006 str ip, [r5, r6]
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
} else { /* coalesce prev */
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
3000b1c8: e3c33001 bic r3, r3, #1 3000b1cc: e5823004 str r3, [r2, #4] 3000b1d0: eaffffda b 3000b140 <_Heap_Free+0x12c>
30012a18 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
30012a18: e92d40f0 push {r4, r5, r6, r7, lr}
30012a1c: e1a04000 mov r4, r0
30012a20: e1a05001 mov r5, r1
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
30012a24: e1a00001 mov r0, r1 30012a28: e5941010 ldr r1, [r4, #16] 30012a2c: e1a07002 mov r7, r2 30012a30: ebfff695 bl 3001048c <__umodsi3> 30012a34: e2456008 sub r6, r5, #8
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
30012a38: e5943020 ldr r3, [r4, #32]
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
30012a3c: e0600006 rsb r0, r0, r6
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;
30012a40: e1500003 cmp r0, r3
30012a44: 3a000010 bcc 30012a8c <_Heap_Size_of_alloc_area+0x74>
30012a48: e5942024 ldr r2, [r4, #36] ; 0x24 30012a4c: e1500002 cmp r0, r2
30012a50: 8a00000d bhi 30012a8c <_Heap_Size_of_alloc_area+0x74>
- 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;
30012a54: e5906004 ldr r6, [r0, #4] 30012a58: e3c66001 bic r6, r6, #1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
30012a5c: e0806006 add r6, r0, r6
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;
30012a60: e1530006 cmp r3, r6
30012a64: 8a000008 bhi 30012a8c <_Heap_Size_of_alloc_area+0x74>
30012a68: e1520006 cmp r2, r6
30012a6c: 3a000008 bcc 30012a94 <_Heap_Size_of_alloc_area+0x7c>
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;
30012a70: e5960004 ldr r0, [r6, #4]
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if (
!_Heap_Is_block_in_heap( heap, next_block )
|| !_Heap_Is_prev_used( next_block )
30012a74: e2100001 ands r0, r0, #1
) {
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_BLOCK_SIZE_OFFSET - alloc_begin;
30012a78: 12655004 rsbne r5, r5, #4 30012a7c: 10856006 addne r6, r5, r6 30012a80: 15876000 strne r6, [r7]
return true;
30012a84: 13a00001 movne r0, #1
30012a88: e8bd80f0 pop {r4, r5, r6, r7, pc}
if (
!_Heap_Is_block_in_heap( heap, next_block )
|| !_Heap_Is_prev_used( next_block )
) {
return false;
30012a8c: e3a00000 mov r0, #0
30012a90: e8bd80f0 pop {r4, r5, r6, r7, pc}
30012a94: e3a00000 mov r0, #0 <== NOT EXECUTED
}
*alloc_size = (uintptr_t) next_block + HEAP_BLOCK_SIZE_OFFSET - alloc_begin;
return true;
}
30012a98: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED
300075bc <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
300075bc: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr}
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
if ( !_System_state_Is_up( _System_state_Get() ) ) {
300075c0: e59f35cc ldr r3, [pc, #1484] ; 30007b94 <_Heap_Walk+0x5d8>
uintptr_t const min_block_size = heap->min_block_size;
Heap_Block *const first_block = heap->first_block;
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
300075c4: e31200ff tst r2, #255 ; 0xff
if ( !_System_state_Is_up( _System_state_Get() ) ) {
300075c8: e5933000 ldr r3, [r3]
uintptr_t const min_block_size = heap->min_block_size;
Heap_Block *const first_block = heap->first_block;
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
300075cc: e59f25c4 ldr r2, [pc, #1476] ; 30007b98 <_Heap_Walk+0x5dc> 300075d0: e59f95c4 ldr r9, [pc, #1476] ; 30007b9c <_Heap_Walk+0x5e0>
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
300075d4: e1a0a001 mov sl, r1
uintptr_t const min_block_size = heap->min_block_size;
Heap_Block *const first_block = heap->first_block;
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
300075d8: 11a09002 movne r9, r2
Heap_Control *heap,
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
300075dc: e5901010 ldr r1, [r0, #16]
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
if ( !_System_state_Is_up( _System_state_Get() ) ) {
300075e0: e3530003 cmp r3, #3
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
300075e4: e5902014 ldr r2, [r0, #20]
Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block;
300075e8: e5903024 ldr r3, [r0, #36] ; 0x24
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
300075ec: e24dd038 sub sp, sp, #56 ; 0x38 300075f0: e1a04000 mov r4, r0
uintptr_t const page_size = heap->page_size;
300075f4: e58d1024 str r1, [sp, #36] ; 0x24
uintptr_t const min_block_size = heap->min_block_size;
300075f8: e58d2028 str r2, [sp, #40] ; 0x28
Heap_Block *const first_block = heap->first_block;
300075fc: e5908020 ldr r8, [r0, #32]
Heap_Block *const last_block = heap->last_block;
30007600: e58d302c str r3, [sp, #44] ; 0x2c
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
if ( !_System_state_Is_up( _System_state_Get() ) ) {
30007604: 0a000002 beq 30007614 <_Heap_Walk+0x58>
}
block = next_block;
} while ( block != first_block );
return true;
30007608: e3a00001 mov r0, #1
}
3000760c: e28dd038 add sp, sp, #56 ; 0x38
30007610: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc}
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)(
30007614: e594101c ldr r1, [r4, #28] 30007618: e5900018 ldr r0, [r0, #24] 3000761c: e5942008 ldr r2, [r4, #8] 30007620: e594300c ldr r3, [r4, #12] 30007624: e59dc028 ldr ip, [sp, #40] ; 0x28 30007628: e58d1008 str r1, [sp, #8] 3000762c: e59d102c ldr r1, [sp, #44] ; 0x2c 30007630: e58d0004 str r0, [sp, #4] 30007634: e58d1010 str r1, [sp, #16] 30007638: e58d2014 str r2, [sp, #20] 3000763c: e58d3018 str r3, [sp, #24] 30007640: e59f2558 ldr r2, [pc, #1368] ; 30007ba0 <_Heap_Walk+0x5e4> 30007644: e58dc000 str ip, [sp] 30007648: e58d800c str r8, [sp, #12] 3000764c: e1a0000a mov r0, sl 30007650: e3a01000 mov r1, #0 30007654: e59d3024 ldr r3, [sp, #36] ; 0x24 30007658: e1a0e00f mov lr, pc 3000765c: e12fff19 bx r9
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
30007660: e59d2024 ldr r2, [sp, #36] ; 0x24 30007664: e3520000 cmp r2, #0
30007668: 0a000026 beq 30007708 <_Heap_Walk+0x14c>
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
3000766c: e59d3024 ldr r3, [sp, #36] ; 0x24 30007670: e2135003 ands r5, r3, #3
30007674: 1a00002a bne 30007724 <_Heap_Walk+0x168>
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
30007678: e59d0028 ldr r0, [sp, #40] ; 0x28 3000767c: e59d1024 ldr r1, [sp, #36] ; 0x24 30007680: ebffe543 bl 30000b94 <__umodsi3>
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
30007684: e250b000 subs fp, r0, #0
30007688: 1a00002c bne 30007740 <_Heap_Walk+0x184>
3000768c: e2880008 add r0, r8, #8 30007690: e59d1024 ldr r1, [sp, #36] ; 0x24 30007694: ebffe53e bl 30000b94 <__umodsi3>
);
return false;
}
if (
30007698: e2506000 subs r6, r0, #0
3000769c: 1a00002f bne 30007760 <_Heap_Walk+0x1a4>
block = next_block;
} while ( block != first_block );
return true;
}
300076a0: e598b004 ldr fp, [r8, #4]
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
300076a4: e21b5001 ands r5, fp, #1
300076a8: 0a0000cd beq 300079e4 <_Heap_Walk+0x428>
- 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;
300076ac: e59dc02c ldr ip, [sp, #44] ; 0x2c 300076b0: e59c3004 ldr r3, [ip, #4] 300076b4: e3c33001 bic r3, r3, #1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
300076b8: e08c3003 add r3, ip, r3
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;
300076bc: e5935004 ldr r5, [r3, #4]
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
300076c0: e2155001 ands r5, r5, #1
300076c4: 0a000008 beq 300076ec <_Heap_Walk+0x130>
);
return false;
}
if (
300076c8: e1580003 cmp r8, r3
300076cc: 0a00002b beq 30007780 <_Heap_Walk+0x1c4>
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
300076d0: e1a0000a mov r0, sl <== NOT EXECUTED 300076d4: e3a01001 mov r1, #1 <== NOT EXECUTED 300076d8: e59f24c4 ldr r2, [pc, #1220] ; 30007ba4 <_Heap_Walk+0x5e8> <== NOT EXECUTED 300076dc: e1a0e00f mov lr, pc <== NOT EXECUTED 300076e0: e12fff19 bx r9 <== NOT EXECUTED
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
300076e4: e1a00006 mov r0, r6 <== NOT EXECUTED 300076e8: eaffffc7 b 3000760c <_Heap_Walk+0x50> <== NOT EXECUTED
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
300076ec: e1a0000a mov r0, sl 300076f0: e3a01001 mov r1, #1 300076f4: e59f24ac ldr r2, [pc, #1196] ; 30007ba8 <_Heap_Walk+0x5ec> 300076f8: e1a0e00f mov lr, pc 300076fc: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007700: e1a00005 mov r0, r5 30007704: eaffffc0 b 3000760c <_Heap_Walk+0x50>
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
(*printer)( source, true, "page size is zero\n" );
30007708: e1a0000a mov r0, sl 3000770c: e3a01001 mov r1, #1 30007710: e59f2494 ldr r2, [pc, #1172] ; 30007bac <_Heap_Walk+0x5f0> 30007714: e1a0e00f mov lr, pc 30007718: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
3000771c: e59d0024 ldr r0, [sp, #36] ; 0x24 30007720: eaffffb9 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
30007724: e1a0000a mov r0, sl 30007728: e3a01001 mov r1, #1 3000772c: e59f247c ldr r2, [pc, #1148] ; 30007bb0 <_Heap_Walk+0x5f4> 30007730: e1a0e00f mov lr, pc 30007734: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007738: e3a00000 mov r0, #0 3000773c: eaffffb2 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
30007740: e1a0000a mov r0, sl 30007744: e3a01001 mov r1, #1 30007748: e59f2464 ldr r2, [pc, #1124] ; 30007bb4 <_Heap_Walk+0x5f8> 3000774c: e59d3028 ldr r3, [sp, #40] ; 0x28 30007750: e1a0e00f mov lr, pc 30007754: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007758: e1a00005 mov r0, r5 3000775c: eaffffaa b 3000760c <_Heap_Walk+0x50>
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
30007760: e1a0000a mov r0, sl 30007764: e3a01001 mov r1, #1 30007768: e59f2448 ldr r2, [pc, #1096] ; 30007bb8 <_Heap_Walk+0x5fc> 3000776c: e1a03008 mov r3, r8 30007770: e1a0e00f mov lr, pc 30007774: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007778: e1a0000b mov r0, fp 3000777c: eaffffa2 b 3000760c <_Heap_Walk+0x50>
block = next_block;
} while ( block != first_block );
return true;
}
30007780: e5945008 ldr r5, [r4, #8]
int source,
Heap_Walk_printer printer,
Heap_Control *heap
)
{
uintptr_t const page_size = heap->page_size;
30007784: e5947010 ldr r7, [r4, #16]
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 ) {
30007788: e1540005 cmp r4, r5 3000778c: 05943020 ldreq r3, [r4, #32]
30007790: 0a00000d beq 300077cc <_Heap_Walk+0x210>
block = next_block;
} while ( block != first_block );
return true;
}
30007794: e5943020 ldr r3, [r4, #32]
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;
30007798: e1530005 cmp r3, r5
3000779c: 9a000097 bls 30007a00 <_Heap_Walk+0x444>
const Heap_Block *prev_block = free_list_tail;
const Heap_Block *free_block = first_free_block;
while ( free_block != free_list_tail ) {
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
300077a0: e1a0000a mov r0, sl 300077a4: e3a01001 mov r1, #1 300077a8: e59f240c ldr r2, [pc, #1036] ; 30007bbc <_Heap_Walk+0x600> 300077ac: e1a03005 mov r3, r5 300077b0: e1a0e00f mov lr, pc 300077b4: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
300077b8: e3a00000 mov r0, #0 300077bc: eaffff92 b 3000760c <_Heap_Walk+0x50> 300077c0: e1a03008 mov r3, r8 300077c4: e59db034 ldr fp, [sp, #52] ; 0x34 300077c8: e59d8030 ldr r8, [sp, #48] ; 0x30
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
300077cc: e1a06008 mov r6, r8
- 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;
300077d0: e3cb7001 bic r7, fp, #1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
300077d4: e0875006 add r5, r7, r6
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;
300077d8: e1530005 cmp r3, r5
300077dc: 9a000008 bls 30007804 <_Heap_Walk+0x248>
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
uintptr_t const next_block_begin = (uintptr_t) next_block;
bool const is_not_last_block = block != last_block;
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
(*printer)(
300077e0: e1a0000a mov r0, sl 300077e4: e58d5000 str r5, [sp] 300077e8: e3a01001 mov r1, #1 300077ec: e59f23cc ldr r2, [pc, #972] ; 30007bc0 <_Heap_Walk+0x604> 300077f0: e1a03006 mov r3, r6 300077f4: e1a0e00f mov lr, pc 300077f8: e12fff19 bx r9
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
300077fc: e3a00000 mov r0, #0 30007800: eaffff81 b 3000760c <_Heap_Walk+0x50> 30007804: e5943024 ldr r3, [r4, #36] ; 0x24 30007808: e1530005 cmp r3, r5
3000780c: 3afffff3 bcc 300077e0 <_Heap_Walk+0x224>
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
30007810: e59d1024 ldr r1, [sp, #36] ; 0x24 30007814: e1a00007 mov r0, r7 30007818: ebffe4dd bl 30000b94 <__umodsi3>
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
bool const prev_used = _Heap_Is_prev_used( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
uintptr_t const next_block_begin = (uintptr_t) next_block;
bool const is_not_last_block = block != last_block;
3000781c: e59d102c ldr r1, [sp, #44] ; 0x2c 30007820: e0563001 subs r3, r6, r1 30007824: 13a03001 movne r3, #1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
30007828: e3500000 cmp r0, #0
3000782c: 0a000001 beq 30007838 <_Heap_Walk+0x27c>
30007830: e3530000 cmp r3, #0
30007834: 1a0000aa bne 30007ae4 <_Heap_Walk+0x528>
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
30007838: e59d2028 ldr r2, [sp, #40] ; 0x28 3000783c: e1520007 cmp r2, r7
30007840: 9a000001 bls 3000784c <_Heap_Walk+0x290>
30007844: e3530000 cmp r3, #0
30007848: 1a0000ae bne 30007b08 <_Heap_Walk+0x54c>
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
3000784c: e1560005 cmp r6, r5
30007850: 3a000001 bcc 3000785c <_Heap_Walk+0x2a0>
30007854: e3530000 cmp r3, #0
30007858: 1a0000b4 bne 30007b30 <_Heap_Walk+0x574>
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;
3000785c: e5953004 ldr r3, [r5, #4] 30007860: e20bb001 and fp, fp, #1
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
30007864: e3130001 tst r3, #1
30007868: 0a000018 beq 300078d0 <_Heap_Walk+0x314>
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
3000786c: e35b0000 cmp fp, #0
30007870: 0a00000c beq 300078a8 <_Heap_Walk+0x2ec>
(*printer)(
30007874: e58d7000 str r7, [sp] 30007878: e1a0000a mov r0, sl 3000787c: e3a01000 mov r1, #0 30007880: e59f233c ldr r2, [pc, #828] ; 30007bc4 <_Heap_Walk+0x608> 30007884: e1a03006 mov r3, r6 30007888: e1a0e00f mov lr, pc 3000788c: e12fff19 bx r9
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
30007890: e1580005 cmp r8, r5
30007894: 0affff5b beq 30007608 <_Heap_Walk+0x4c>
30007898: e595b004 ldr fp, [r5, #4] 3000789c: e5943020 ldr r3, [r4, #32] 300078a0: e1a06005 mov r6, r5 300078a4: eaffffc9 b 300077d0 <_Heap_Walk+0x214>
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
300078a8: e58d7000 str r7, [sp] 300078ac: e5963000 ldr r3, [r6] 300078b0: e1a0000a mov r0, sl 300078b4: e58d3004 str r3, [sp, #4] 300078b8: e1a0100b mov r1, fp 300078bc: e59f2304 ldr r2, [pc, #772] ; 30007bc8 <_Heap_Walk+0x60c> 300078c0: e1a03006 mov r3, r6 300078c4: e1a0e00f mov lr, pc 300078c8: e12fff19 bx r9 300078cc: eaffffef b 30007890 <_Heap_Walk+0x2d4>
false,
"block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n",
block,
block_size,
block->prev,
block->prev == first_free_block ?
300078d0: e596200c ldr r2, [r6, #12]
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)(
300078d4: e5943008 ldr r3, [r4, #8]
block = next_block;
} while ( block != first_block );
return true;
}
300078d8: e594100c ldr r1, [r4, #12]
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)(
300078dc: e1530002 cmp r3, r2 300078e0: 059f02e4 ldreq r0, [pc, #740] ; 30007bcc <_Heap_Walk+0x610>
300078e4: 0a000003 beq 300078f8 <_Heap_Walk+0x33c>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
300078e8: e59f32e0 ldr r3, [pc, #736] ; 30007bd0 <_Heap_Walk+0x614> 300078ec: e1540002 cmp r4, r2 300078f0: e59f02dc ldr r0, [pc, #732] ; 30007bd4 <_Heap_Walk+0x618> 300078f4: 01a00003 moveq r0, r3
block->next,
block->next == last_free_block ?
300078f8: e5963008 ldr r3, [r6, #8]
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)(
300078fc: e1510003 cmp r1, r3 30007900: 059f12d0 ldreq r1, [pc, #720] ; 30007bd8 <_Heap_Walk+0x61c>
30007904: 0a000003 beq 30007918 <_Heap_Walk+0x35c>
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
30007908: e59fc2cc ldr ip, [pc, #716] ; 30007bdc <_Heap_Walk+0x620> 3000790c: e1540003 cmp r4, r3 30007910: e59f12bc ldr r1, [pc, #700] ; 30007bd4 <_Heap_Walk+0x618> 30007914: 01a0100c moveq r1, ip
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)(
30007918: e58d2004 str r2, [sp, #4] 3000791c: e58d0008 str r0, [sp, #8] 30007920: e58d300c str r3, [sp, #12] 30007924: e58d1010 str r1, [sp, #16] 30007928: e1a03006 mov r3, r6 3000792c: e58d7000 str r7, [sp] 30007930: e1a0000a mov r0, sl 30007934: e3a01000 mov r1, #0 30007938: e59f22a0 ldr r2, [pc, #672] ; 30007be0 <_Heap_Walk+0x624> 3000793c: e1a0e00f mov lr, pc 30007940: e12fff19 bx r9
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
30007944: e5953000 ldr r3, [r5] 30007948: e1570003 cmp r7, r3
3000794c: 1a000011 bne 30007998 <_Heap_Walk+0x3dc>
);
return false;
}
if ( !prev_used ) {
30007950: e35b0000 cmp fp, #0
30007954: 0a00001a beq 300079c4 <_Heap_Walk+0x408>
block = next_block;
} while ( block != first_block );
return true;
}
30007958: e5943008 ldr r3, [r4, #8]
)
{
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 ) {
3000795c: e1540003 cmp r4, r3
30007960: 0a000004 beq 30007978 <_Heap_Walk+0x3bc>
if ( free_block == block ) {
30007964: e1560003 cmp r6, r3
30007968: 0affffc8 beq 30007890 <_Heap_Walk+0x2d4>
return true;
}
free_block = free_block->next;
3000796c: e5933008 ldr r3, [r3, #8]
)
{
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 ) {
30007970: e1540003 cmp r4, r3
30007974: 1afffffa bne 30007964 <_Heap_Walk+0x3a8>
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
30007978: e1a0000a mov r0, sl 3000797c: e3a01001 mov r1, #1 30007980: e59f225c ldr r2, [pc, #604] ; 30007be4 <_Heap_Walk+0x628> 30007984: e1a03006 mov r3, r6 30007988: e1a0e00f mov lr, pc 3000798c: e12fff19 bx r9
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
30007990: e3a00000 mov r0, #0 30007994: eaffff1c b 3000760c <_Heap_Walk+0x50>
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
30007998: e58d3004 str r3, [sp, #4] 3000799c: e1a0000a mov r0, sl 300079a0: e58d7000 str r7, [sp] 300079a4: e58d5008 str r5, [sp, #8] 300079a8: e3a01001 mov r1, #1 300079ac: e59f2234 ldr r2, [pc, #564] ; 30007be8 <_Heap_Walk+0x62c> 300079b0: e1a03006 mov r3, r6 300079b4: e1a0e00f mov lr, pc 300079b8: e12fff19 bx r9
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
300079bc: e3a00000 mov r0, #0 300079c0: eaffff11 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( !prev_used ) {
(*printer)(
300079c4: e1a0000a mov r0, sl 300079c8: e3a01001 mov r1, #1 300079cc: e59f2218 ldr r2, [pc, #536] ; 30007bec <_Heap_Walk+0x630> 300079d0: e1a03006 mov r3, r6 300079d4: e1a0e00f mov lr, pc 300079d8: e12fff19 bx r9
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
300079dc: e1a0000b mov r0, fp 300079e0: eaffff09 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
300079e4: e1a0000a mov r0, sl 300079e8: e3a01001 mov r1, #1 300079ec: e59f21fc ldr r2, [pc, #508] ; 30007bf0 <_Heap_Walk+0x634> 300079f0: e1a0e00f mov lr, pc 300079f4: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
300079f8: e1a00005 mov r0, r5 300079fc: eaffff02 b 3000760c <_Heap_Walk+0x50>
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;
30007a00: e594c024 ldr ip, [r4, #36] ; 0x24 30007a04: e15c0005 cmp ip, r5
30007a08: 3affff64 bcc 300077a0 <_Heap_Walk+0x1e4>
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
30007a0c: e2850008 add r0, r5, #8 30007a10: e1a01007 mov r1, r7 30007a14: e58d301c str r3, [sp, #28] 30007a18: e58dc020 str ip, [sp, #32] 30007a1c: ebffe45c bl 30000b94 <__umodsi3>
);
return false;
}
if (
30007a20: e3500000 cmp r0, #0 30007a24: e59d301c ldr r3, [sp, #28] 30007a28: e59dc020 ldr ip, [sp, #32]
30007a2c: 1a000048 bne 30007b54 <_Heap_Walk+0x598>
- 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;
30007a30: e5952004 ldr r2, [r5, #4] 30007a34: e3c22001 bic r2, r2, #1
block = next_block;
} while ( block != first_block );
return true;
}
30007a38: e0852002 add r2, r5, r2
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;
30007a3c: e5922004 ldr r2, [r2, #4]
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
30007a40: e3120001 tst r2, #1
30007a44: 1a00004a bne 30007b74 <_Heap_Walk+0x5b8>
30007a48: e58d8030 str r8, [sp, #48] ; 0x30 30007a4c: e58db034 str fp, [sp, #52] ; 0x34 30007a50: e1a01004 mov r1, r4 30007a54: e1a06005 mov r6, r5 30007a58: e1a0b00c mov fp, ip 30007a5c: e1a08003 mov r8, r3 30007a60: ea000013 b 30007ab4 <_Heap_Walk+0x4f8>
return false;
}
prev_block = free_block;
free_block = free_block->next;
30007a64: e5955008 ldr r5, [r5, #8]
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 ) {
30007a68: e1540005 cmp r4, r5
30007a6c: 0affff53 beq 300077c0 <_Heap_Walk+0x204>
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;
30007a70: e1580005 cmp r8, r5
30007a74: 8affff49 bhi 300077a0 <_Heap_Walk+0x1e4>
30007a78: e155000b cmp r5, fp
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
30007a7c: e2850008 add r0, r5, #8 30007a80: e1a01007 mov r1, r7
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;
30007a84: 8affff45 bhi 300077a0 <_Heap_Walk+0x1e4>
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
30007a88: ebffe441 bl 30000b94 <__umodsi3>
);
return false;
}
if (
30007a8c: e3500000 cmp r0, #0
30007a90: 1a00002f bne 30007b54 <_Heap_Walk+0x598>
- 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;
30007a94: e5953004 ldr r3, [r5, #4]
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
30007a98: e1a01006 mov r1, r6 30007a9c: e3c33001 bic r3, r3, #1
block = next_block;
} while ( block != first_block );
return true;
}
30007aa0: e0833005 add r3, r3, r5
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;
30007aa4: e5933004 ldr r3, [r3, #4]
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
30007aa8: e1a06005 mov r6, r5 30007aac: e3130001 tst r3, #1
30007ab0: 1a00002f bne 30007b74 <_Heap_Walk+0x5b8>
);
return false;
}
if ( free_block->prev != prev_block ) {
30007ab4: e595200c ldr r2, [r5, #12] 30007ab8: e1520001 cmp r2, r1
30007abc: 0affffe8 beq 30007a64 <_Heap_Walk+0x4a8>
(*printer)(
30007ac0: e58d2000 str r2, [sp] 30007ac4: e1a0000a mov r0, sl 30007ac8: e3a01001 mov r1, #1 30007acc: e59f2120 ldr r2, [pc, #288] ; 30007bf4 <_Heap_Walk+0x638> 30007ad0: e1a03005 mov r3, r5 30007ad4: e1a0e00f mov lr, pc 30007ad8: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007adc: e3a00000 mov r0, #0 30007ae0: eafffec9 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
30007ae4: e1a0000a mov r0, sl 30007ae8: e58d7000 str r7, [sp] 30007aec: e3a01001 mov r1, #1 30007af0: e59f2100 ldr r2, [pc, #256] ; 30007bf8 <_Heap_Walk+0x63c> 30007af4: e1a03006 mov r3, r6 30007af8: e1a0e00f mov lr, pc 30007afc: e12fff19 bx r9
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
30007b00: e3a00000 mov r0, #0 30007b04: eafffec0 b 3000760c <_Heap_Walk+0x50>
}
if ( block_size < min_block_size && is_not_last_block ) {
(*printer)(
30007b08: e58d2004 str r2, [sp, #4] 30007b0c: e1a0000a mov r0, sl 30007b10: e58d7000 str r7, [sp] 30007b14: e3a01001 mov r1, #1 30007b18: e59f20dc ldr r2, [pc, #220] ; 30007bfc <_Heap_Walk+0x640> 30007b1c: e1a03006 mov r3, r6 30007b20: e1a0e00f mov lr, pc 30007b24: e12fff19 bx r9
block,
block_size,
min_block_size
);
return false;
30007b28: e3a00000 mov r0, #0 30007b2c: eafffeb6 b 3000760c <_Heap_Walk+0x50>
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
(*printer)(
30007b30: e1a0000a mov r0, sl 30007b34: e58d5000 str r5, [sp] 30007b38: e3a01001 mov r1, #1 30007b3c: e59f20bc ldr r2, [pc, #188] ; 30007c00 <_Heap_Walk+0x644> 30007b40: e1a03006 mov r3, r6 30007b44: e1a0e00f mov lr, pc 30007b48: e12fff19 bx r9
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
30007b4c: e3a00000 mov r0, #0 30007b50: eafffead b 3000760c <_Heap_Walk+0x50>
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
30007b54: e1a0000a mov r0, sl 30007b58: e3a01001 mov r1, #1 30007b5c: e59f20a0 ldr r2, [pc, #160] ; 30007c04 <_Heap_Walk+0x648> 30007b60: e1a03005 mov r3, r5 30007b64: e1a0e00f mov lr, pc 30007b68: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007b6c: e3a00000 mov r0, #0 30007b70: eafffea5 b 3000760c <_Heap_Walk+0x50>
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
30007b74: e1a0000a mov r0, sl 30007b78: e3a01001 mov r1, #1 30007b7c: e59f2084 ldr r2, [pc, #132] ; 30007c08 <_Heap_Walk+0x64c> 30007b80: e1a03005 mov r3, r5 30007b84: e1a0e00f mov lr, pc 30007b88: e12fff19 bx r9
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
30007b8c: e3a00000 mov r0, #0 30007b90: eafffe9d b 3000760c <_Heap_Walk+0x50>
300069b8 <_Internal_error_Occurred>:
bool is_internal,
Internal_errors_t the_error
)
{
_Internal_errors_What_happened.the_source = the_source;
300069b8: e59f303c ldr r3, [pc, #60] ; 300069fc <_Internal_error_Occurred+0x44>
void _Internal_error_Occurred(
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300069bc: e201c0ff and ip, r1, #255 ; 0xff
300069c0: e52de004 push {lr} ; (str lr, [sp, #-4]!)
_Internal_errors_What_happened.the_source = the_source;
_Internal_errors_What_happened.is_internal = is_internal;
_Internal_errors_What_happened.the_error = the_error;
_User_extensions_Fatal( the_source, is_internal, the_error );
300069c4: e1a0100c mov r1, ip
bool is_internal,
Internal_errors_t the_error
)
{
_Internal_errors_What_happened.the_source = the_source;
300069c8: e5830000 str r0, [r3]
_Internal_errors_What_happened.is_internal = is_internal;
300069cc: e5c3c004 strb ip, [r3, #4]
_Internal_errors_What_happened.the_error = the_error;
300069d0: e5832008 str r2, [r3, #8]
void _Internal_error_Occurred(
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300069d4: e1a04002 mov r4, r2
_Internal_errors_What_happened.the_source = the_source;
_Internal_errors_What_happened.is_internal = is_internal;
_Internal_errors_What_happened.the_error = the_error;
_User_extensions_Fatal( the_source, is_internal, the_error );
300069d8: eb000735 bl 300086b4 <_User_extensions_Fatal>
RTEMS_INLINE_ROUTINE void _System_state_Set (
System_state_Codes state
)
{
_System_state_Current = state;
300069dc: e59f301c ldr r3, [pc, #28] ; 30006a00 <_Internal_error_Occurred+0x48><== NOT EXECUTED 300069e0: e3a02005 mov r2, #5 <== NOT EXECUTED 300069e4: e5832000 str r2, [r3] <== NOT EXECUTED
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
300069e8: e10f2000 mrs r2, CPSR <== NOT EXECUTED 300069ec: e3823080 orr r3, r2, #128 ; 0x80 <== NOT EXECUTED 300069f0: e129f003 msr CPSR_fc, r3 <== NOT EXECUTED
_System_state_Set( SYSTEM_STATE_FAILED );
_CPU_Fatal_halt( the_error );
300069f4: e1a00004 mov r0, r4 <== NOT EXECUTED 300069f8: eafffffe b 300069f8 <_Internal_error_Occurred+0x40> <== NOT EXECUTED
30006ac0 <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
30006ac0: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr}
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
30006ac4: e5904034 ldr r4, [r0, #52] ; 0x34
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
30006ac8: e24dd014 sub sp, sp, #20
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
30006acc: e3540000 cmp r4, #0
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
30006ad0: e1a05000 mov r5, r0
/* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id );
30006ad4: e1d070b8 ldrh r7, [r0, #8]
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
30006ad8: 0a00009b beq 30006d4c <_Objects_Extend_information+0x28c>
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
30006adc: e1d081b4 ldrh r8, [r0, #20] 30006ae0: e1d0a1b0 ldrh sl, [r0, #16] 30006ae4: e1a01008 mov r1, r8 30006ae8: e1a0000a mov r0, sl 30006aec: eb002620 bl 30010374 <__aeabi_uidiv> 30006af0: e1a03800 lsl r3, r0, #16
for ( ; block < block_count; block++ ) {
30006af4: e1b03823 lsrs r3, r3, #16
30006af8: 0a000099 beq 30006d64 <_Objects_Extend_information+0x2a4>
if ( information->object_blocks[ block ] == NULL ) {
30006afc: e5949000 ldr r9, [r4] 30006b00: e3590000 cmp r9, #0 30006b04: 01a01008 moveq r1, r8
/* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id );
30006b08: 01a06007 moveq r6, r7
index_base = minimum_index; block = 0;
30006b0c: 01a04009 moveq r4, r9
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
30006b10: 0a00000c beq 30006b48 <_Objects_Extend_information+0x88>
30006b14: e1a02004 mov r2, r4 30006b18: e1a01008 mov r1, r8
/* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id );
30006b1c: e1a06007 mov r6, r7
index_base = minimum_index; block = 0;
30006b20: e3a04000 mov r4, #0 30006b24: ea000002 b 30006b34 <_Objects_Extend_information+0x74>
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
30006b28: e5b29004 ldr r9, [r2, #4]! 30006b2c: e3590000 cmp r9, #0
30006b30: 0a000004 beq 30006b48 <_Objects_Extend_information+0x88>
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
30006b34: e2844001 add r4, r4, #1 30006b38: e1530004 cmp r3, r4
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
30006b3c: e0866008 add r6, r6, r8
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
30006b40: 8afffff8 bhi 30006b28 <_Objects_Extend_information+0x68>
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
30006b44: e3a09001 mov r9, #1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
30006b48: e08aa001 add sl, sl, r1
/*
* 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 ) {
30006b4c: e35a0801 cmp sl, #65536 ; 0x10000
30006b50: 2a000063 bcs 30006ce4 <_Objects_Extend_information+0x224>
/*
* 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 ) {
30006b54: e5d52012 ldrb r2, [r5, #18]
/*
* 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;
30006b58: e5950018 ldr r0, [r5, #24]
if ( information->auto_extend ) {
30006b5c: e3520000 cmp r2, #0
/*
* 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;
30006b60: e0000091 mul r0, r1, r0
if ( information->auto_extend ) {
30006b64: 1a000060 bne 30006cec <_Objects_Extend_information+0x22c>
new_object_block = _Workspace_Allocate( block_size );
if ( !new_object_block )
return;
} else {
new_object_block = _Workspace_Allocate_or_fatal_error( block_size );
30006b68: e58d3000 str r3, [sp] 30006b6c: eb000813 bl 30008bc0 <_Workspace_Allocate_or_fatal_error> 30006b70: e59d3000 ldr r3, [sp] 30006b74: e1a08000 mov r8, r0
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
30006b78: e3590000 cmp r9, #0
30006b7c: 0a000039 beq 30006c68 <_Objects_Extend_information+0x1a8>
*/
/*
* Up the block count and maximum
*/
block_count++;
30006b80: e283b001 add fp, r3, #1
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
30006b84: e08b008b add r0, fp, fp, lsl #1
((maximum + minimum_index) * sizeof(Objects_Control *));
30006b88: e08a0000 add r0, sl, r0
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
30006b8c: e0800007 add r0, r0, r7
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
30006b90: e1a00100 lsl r0, r0, #2 30006b94: e58d3000 str r3, [sp] 30006b98: eb0007fe bl 30008b98 <_Workspace_Allocate>
if ( !object_blocks ) {
30006b9c: e2509000 subs r9, r0, #0 30006ba0: e59d3000 ldr r3, [sp]
30006ba4: 0a000073 beq 30006d78 <_Objects_Extend_information+0x2b8>
* Take the block count down. Saves all the (block_count - 1)
* in the copies.
*/
block_count--;
if ( information->maximum > minimum_index ) {
30006ba8: e1d521b0 ldrh r2, [r5, #16]
RTEMS_INLINE_ROUTINE void *_Addresses_Add_offset (
const void *base,
uintptr_t offset
)
{
return (void *)((uintptr_t)base + offset);
30006bac: e089c10b add ip, r9, fp, lsl #2 30006bb0: e1570002 cmp r7, r2 30006bb4: e089b18b add fp, r9, fp, lsl #3
30006bb8: 3a000051 bcc 30006d04 <_Objects_Extend_information+0x244>
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
30006bbc: e3570000 cmp r7, #0 30006bc0: 13a02000 movne r2, #0 30006bc4: 11a0100b movne r1, fp
local_table[ index ] = NULL;
30006bc8: 11a00002 movne r0, r2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
30006bcc: 0a000003 beq 30006be0 <_Objects_Extend_information+0x120>
30006bd0: e2822001 add r2, r2, #1 30006bd4: e1570002 cmp r7, r2
local_table[ index ] = NULL;
30006bd8: e4810004 str r0, [r1], #4
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
30006bdc: 8afffffb bhi 30006bd0 <_Objects_Extend_information+0x110>
30006be0: e1a03103 lsl r3, r3, #2
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
30006be4: e1d511b4 ldrh r1, [r5, #20]
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
30006be8: e3a00000 mov r0, #0
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
30006bec: e0861001 add r1, r6, r1
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
30006bf0: e1560001 cmp r6, r1
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
30006bf4: e7890003 str r0, [r9, r3]
inactive_per_block[block_count] = 0;
30006bf8: e78c0003 str r0, [ip, r3]
for ( index=index_base ;
30006bfc: 2a000005 bcs 30006c18 <_Objects_Extend_information+0x158>
30006c00: e08b2106 add r2, fp, r6, lsl #2
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
30006c04: e1a03006 mov r3, r6
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
index++ ) {
30006c08: e2833001 add r3, r3, #1
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
30006c0c: e1530001 cmp r3, r1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
30006c10: e4820004 str r0, [r2], #4
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
30006c14: 3afffffb bcc 30006c08 <_Objects_Extend_information+0x148>
30006c18: e10f3000 mrs r3, CPSR 30006c1c: e3832080 orr r2, r3, #128 ; 0x80 30006c20: e129f002 msr CPSR_fc, r2
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
30006c24: e5952000 ldr r2, [r5]
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(
30006c28: e1d510b4 ldrh r1, [r5, #4] 30006c2c: e1a02c02 lsl r2, r2, #24
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;
30006c30: e1a0a80a lsl sl, sl, #16 30006c34: e3822801 orr r2, r2, #65536 ; 0x10000 30006c38: e1a0a82a lsr sl, sl, #16
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
30006c3c: e1822d81 orr r2, r2, r1, lsl #27
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
30006c40: e182200a orr r2, r2, sl
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
30006c44: e5950034 ldr r0, [r5, #52] ; 0x34
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
30006c48: e585c030 str ip, [r5, #48] ; 0x30
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
30006c4c: e5859034 str r9, [r5, #52] ; 0x34
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
30006c50: e585b01c str fp, [r5, #28]
information->maximum = (Objects_Maximum) maximum;
30006c54: e1c5a1b0 strh sl, [r5, #16]
information->maximum_id = _Objects_Build_id(
30006c58: e585200c str r2, [r5, #12]
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
30006c5c: e129f003 msr CPSR_fc, r3
information->maximum
);
_ISR_Enable( level );
if ( old_tables )
30006c60: e3500000 cmp r0, #0
_Workspace_Free( old_tables );
30006c64: 1b0007d1 blne 30008bb0 <_Workspace_Free>
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
30006c68: e5953034 ldr r3, [r5, #52] ; 0x34
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
30006c6c: e28d7008 add r7, sp, #8
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
30006c70: e7838104 str r8, [r3, r4, lsl #2]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
30006c74: e1a01008 mov r1, r8 30006c78: e1a00007 mov r0, r7 30006c7c: e1d521b4 ldrh r2, [r5, #20] 30006c80: e5953018 ldr r3, [r5, #24] 30006c84: eb000fc9 bl 3000abb0 <_Chain_Initialize>
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
30006c88: e1a04104 lsl r4, r4, #2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
30006c8c: e2858020 add r8, r5, #32
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
30006c90: ea000009 b 30006cbc <_Objects_Extend_information+0x1fc> 30006c94: e5953000 ldr r3, [r5]
the_object->id = _Objects_Build_id(
30006c98: e1d520b4 ldrh r2, [r5, #4] 30006c9c: e1a03c03 lsl r3, r3, #24 30006ca0: e3833801 orr r3, r3, #65536 ; 0x10000
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
30006ca4: e1833d82 orr r3, r3, r2, lsl #27
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
30006ca8: e1833006 orr r3, r3, r6 30006cac: e5813008 str r3, [r1, #8]
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
30006cb0: e1a00008 mov r0, r8 30006cb4: ebfffce4 bl 3000604c <_Chain_Append>
index++;
30006cb8: e2866001 add r6, r6, #1
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
30006cbc: e1a00007 mov r0, r7 30006cc0: ebfffcf4 bl 30006098 <_Chain_Get> 30006cc4: e2501000 subs r1, r0, #0
30006cc8: 1afffff1 bne 30006c94 <_Objects_Extend_information+0x1d4>
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
30006ccc: e1d522bc ldrh r2, [r5, #44] ; 0x2c
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
30006cd0: e1d531b4 ldrh r3, [r5, #20] 30006cd4: e5951030 ldr r1, [r5, #48] ; 0x30
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
30006cd8: e0832002 add r2, r3, r2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
30006cdc: e7813004 str r3, [r1, r4]
information->inactive =
30006ce0: e1c522bc strh r2, [r5, #44] ; 0x2c
(Objects_Maximum)(information->inactive + information->allocation_size);
}
30006ce4: e28dd014 add sp, sp, #20
30006ce8: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc}
* 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 );
30006cec: e58d3000 str r3, [sp] 30006cf0: eb0007a8 bl 30008b98 <_Workspace_Allocate>
if ( !new_object_block )
30006cf4: e2508000 subs r8, r0, #0 30006cf8: e59d3000 ldr r3, [sp]
30006cfc: 1affff9d bne 30006b78 <_Objects_Extend_information+0xb8>
30006d00: eafffff7 b 30006ce4 <_Objects_Extend_information+0x224>
/*
* 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,
30006d04: e1a03103 lsl r3, r3, #2
30006d08: e5951034 ldr r1, [r5, #52] ; 0x34
30006d0c: e1a02003 mov r2, r3
30006d10: e88d1008 stm sp, {r3, ip}
30006d14: eb001a15 bl 3000d570 <memcpy>
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
30006d18: e89d1008 ldm sp, {r3, ip}
30006d1c: e1a0000c mov r0, ip
30006d20: e1a02003 mov r2, r3
30006d24: e5951030 ldr r1, [r5, #48] ; 0x30
30006d28: eb001a10 bl 3000d570 <memcpy>
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
30006d2c: e1d521b0 ldrh r2, [r5, #16]
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
30006d30: e1a0000b mov r0, fp
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
30006d34: e0872002 add r2, r7, r2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
30006d38: e595101c ldr r1, [r5, #28]
30006d3c: e1a02102 lsl r2, r2, #2
30006d40: eb001a0a bl 3000d570 <memcpy>
30006d44: e89d1008 ldm sp, {r3, ip}
30006d48: eaffffa5 b 30006be4 <_Objects_Extend_information+0x124>
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
30006d4c: e1d0a1b0 ldrh sl, [r0, #16] 30006d50: e1d011b4 ldrh r1, [r0, #20]
/* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id );
30006d54: e1a06007 mov r6, r7
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
30006d58: e3a09001 mov r9, #1
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
30006d5c: e1a03004 mov r3, r4 30006d60: eaffff78 b 30006b48 <_Objects_Extend_information+0x88>
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
30006d64: e1a01008 mov r1, r8 <== NOT EXECUTED
/* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id );
30006d68: e1a06007 mov r6, r7 <== NOT EXECUTED
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
30006d6c: e3a09001 mov r9, #1 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0;
30006d70: e1a04003 mov r4, r3 <== NOT EXECUTED 30006d74: eaffff73 b 30006b48 <_Objects_Extend_information+0x88> <== 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 );
30006d78: e1a00008 mov r0, r8 30006d7c: eb00078b bl 30008bb0 <_Workspace_Free>
return;
30006d80: eaffffd7 b 30006ce4 <_Objects_Extend_information+0x224>
300070bc <_Objects_Shrink_information>:
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
300070bc: e92d40f0 push {r4, r5, r6, r7, lr}
/*
* Search the list to find block or chunk with all objects inactive.
*/
index_base = _Objects_Get_index( information->minimum_id );
300070c0: e1d040b8 ldrh r4, [r0, #8]
block_count = (information->maximum - index_base) /
300070c4: e1d051b4 ldrh r5, [r0, #20]
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
300070c8: e1a06000 mov r6, r0
/*
* Search the list to find block or chunk with all objects inactive.
*/
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
300070cc: e1d001b0 ldrh r0, [r0, #16] 300070d0: e1a01005 mov r1, r5 300070d4: e0640000 rsb r0, r4, r0 300070d8: eb0024a5 bl 30010374 <__aeabi_uidiv>
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
300070dc: e3500000 cmp r0, #0
300070e0: 08bd80f0 popeq {r4, r5, r6, r7, pc}
if ( information->inactive_per_block[ block ] ==
300070e4: e5962030 ldr r2, [r6, #48] ; 0x30 300070e8: e5923000 ldr r3, [r2] 300070ec: e1550003 cmp r5, r3
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
300070f0: 13a03000 movne r3, #0
if ( information->inactive_per_block[ block ] ==
300070f4: 1a000005 bne 30007110 <_Objects_Shrink_information+0x54>
300070f8: ea000008 b 30007120 <_Objects_Shrink_information+0x64> <== NOT EXECUTED
300070fc: e5b21004 ldr r1, [r2, #4]!
information->inactive -= information->allocation_size;
return;
}
index_base += information->allocation_size;
30007100: e0844005 add r4, r4, r5
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 ] ==
30007104: e1550001 cmp r5, r1
information->inactive -= information->allocation_size;
return;
}
index_base += information->allocation_size;
30007108: e1a07103 lsl r7, r3, #2
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 ] ==
3000710c: 0a000004 beq 30007124 <_Objects_Shrink_information+0x68>
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
30007110: e2833001 add r3, r3, #1 30007114: e1500003 cmp r0, r3
30007118: 8afffff7 bhi 300070fc <_Objects_Shrink_information+0x40>
3000711c: e8bd80f0 pop {r4, r5, r6, r7, pc}
if ( information->inactive_per_block[ block ] ==
30007120: e3a07000 mov r7, #0 <== NOT EXECUTED
information->allocation_size ) {
/*
* Assume the Inactive chain is never empty at this point
*/
the_object = (Objects_Control *) information->Inactive.first;
30007124: e5960020 ldr r0, [r6, #32] 30007128: ea000002 b 30007138 <_Objects_Shrink_information+0x7c>
if ((index >= index_base) &&
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
}
}
while ( the_object );
3000712c: e3550000 cmp r5, #0
30007130: 0a00000b beq 30007164 <_Objects_Shrink_information+0xa8>
index = _Objects_Get_index( the_object->id );
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
30007134: e1a00005 mov r0, r5
* 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 );
30007138: e1d030b8 ldrh r3, [r0, #8]
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
3000713c: e5905000 ldr r5, [r0]
if ((index >= index_base) &&
30007140: e1530004 cmp r3, r4
30007144: 3afffff8 bcc 3000712c <_Objects_Shrink_information+0x70>
(index < (index_base + information->allocation_size))) {
30007148: e1d621b4 ldrh r2, [r6, #20] 3000714c: e0842002 add r2, r4, r2
/*
* 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) &&
30007150: e1530002 cmp r3, r2
30007154: 2afffff4 bcs 3000712c <_Objects_Shrink_information+0x70>
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
30007158: ebfffbc6 bl 30006078 <_Chain_Extract>
}
}
while ( the_object );
3000715c: e3550000 cmp r5, #0
30007160: 1afffff3 bne 30007134 <_Objects_Shrink_information+0x78>
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
30007164: e5963034 ldr r3, [r6, #52] ; 0x34 30007168: e7930007 ldr r0, [r3, r7] 3000716c: eb00068f bl 30008bb0 <_Workspace_Free>
information->object_blocks[ block ] = NULL;
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
30007170: e1d602bc ldrh r0, [r6, #44] ; 0x2c 30007174: e1d631b4 ldrh r3, [r6, #20]
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
information->object_blocks[ block ] = NULL;
30007178: e5961034 ldr r1, [r6, #52] ; 0x34
information->inactive_per_block[ block ] = 0;
3000717c: e5962030 ldr r2, [r6, #48] ; 0x30
information->inactive -= information->allocation_size;
30007180: e0633000 rsb r3, r3, r0
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
information->object_blocks[ block ] = NULL;
30007184: e7815007 str r5, [r1, r7]
information->inactive_per_block[ block ] = 0;
30007188: e7825007 str r5, [r2, r7]
information->inactive -= information->allocation_size;
3000718c: e1c632bc strh r3, [r6, #44] ; 0x2c
return;
30007190: e8bd80f0 pop {r4, r5, r6, r7, pc}
30006730 <_TOD_Validate>:
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
30006730: e59f30b0 ldr r3, [pc, #176] ; 300067e8 <_TOD_Validate+0xb8>
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
30006734: e92d4010 push {r4, lr}
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
30006738: e2504000 subs r4, r0, #0
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
3000673c: e593100c ldr r1, [r3, #12]
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
return false;
30006740: 01a00004 moveq r0, r4
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
30006744: 08bd8010 popeq {r4, pc}
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
30006748: e59f009c ldr r0, [pc, #156] ; 300067ec <_TOD_Validate+0xbc> 3000674c: eb004540 bl 30017c54 <__aeabi_uidiv>
rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) ||
30006750: e5943018 ldr r3, [r4, #24] 30006754: e1500003 cmp r0, r3
30006758: 9a00001e bls 300067d8 <_TOD_Validate+0xa8>
(the_tod->ticks >= ticks_per_second) ||
3000675c: e5943014 ldr r3, [r4, #20] 30006760: e353003b cmp r3, #59 ; 0x3b
30006764: 8a00001b bhi 300067d8 <_TOD_Validate+0xa8>
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
30006768: e5943010 ldr r3, [r4, #16] 3000676c: e353003b cmp r3, #59 ; 0x3b
30006770: 8a000018 bhi 300067d8 <_TOD_Validate+0xa8>
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
30006774: e594300c ldr r3, [r4, #12] 30006778: e3530017 cmp r3, #23
3000677c: 8a000015 bhi 300067d8 <_TOD_Validate+0xa8>
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
30006780: e5940004 ldr r0, [r4, #4]
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
30006784: e3500000 cmp r0, #0
30006788: 08bd8010 popeq {r4, pc}
(the_tod->month == 0) ||
3000678c: e350000c cmp r0, #12
30006790: 8a000010 bhi 300067d8 <_TOD_Validate+0xa8>
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
30006794: e5943000 ldr r3, [r4]
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
30006798: e59f2050 ldr r2, [pc, #80] ; 300067f0 <_TOD_Validate+0xc0> 3000679c: e1530002 cmp r3, r2
300067a0: 9a00000c bls 300067d8 <_TOD_Validate+0xa8>
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
300067a4: e5944008 ldr r4, [r4, #8]
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
300067a8: e3540000 cmp r4, #0
300067ac: 0a00000b beq 300067e0 <_TOD_Validate+0xb0>
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
300067b0: e3130003 tst r3, #3
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
300067b4: 059f3038 ldreq r3, [pc, #56] ; 300067f4 <_TOD_Validate+0xc4>
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
300067b8: 159f3034 ldrne r3, [pc, #52] ; 300067f4 <_TOD_Validate+0xc4>
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
300067bc: 0280000d addeq r0, r0, #13 300067c0: 07930100 ldreq r0, [r3, r0, lsl #2]
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
300067c4: 17930100 ldrne r0, [r3, r0, lsl #2]
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
300067c8: e1500004 cmp r0, r4
300067cc: 33a00000 movcc r0, #0
300067d0: 23a00001 movcs r0, #1
300067d4: e8bd8010 pop {r4, pc}
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
return false;
300067d8: e3a00000 mov r0, #0
300067dc: e8bd8010 pop {r4, pc}
300067e0: e1a00004 mov r0, r4 <== NOT EXECUTED
if ( the_tod->day > days_in_month )
return false;
return true;
}
300067e4: e8bd8010 pop {r4, pc} <== NOT EXECUTED
30007d28 <_Thread_queue_Enqueue_priority>:
Priority_Control priority;
States_Control block_state;
_Chain_Initialize_empty( &the_thread->Wait.Block2n );
priority = the_thread->current_priority;
30007d28: e5913014 ldr r3, [r1, #20]
Thread_blocking_operation_States _Thread_queue_Enqueue_priority (
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread,
ISR_Level *level_p
)
{
30007d2c: e92d0ff0 push {r4, r5, r6, r7, r8, r9, sl, fp}
30007d30: e281403c add r4, r1, #60 ; 0x3c
Chain_Node *previous_node;
Chain_Node *search_node;
Priority_Control priority;
States_Control block_state;
_Chain_Initialize_empty( &the_thread->Wait.Block2n );
30007d34: e281c038 add ip, r1, #56 ; 0x38
*/
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
the_chain->first = _Chain_Tail(the_chain);
30007d38: e5814038 str r4, [r1, #56] ; 0x38
priority = the_thread->current_priority;
header_index = _Thread_queue_Header_number( priority );
header = &the_thread_queue->Queues.Priority[ header_index ];
block_state = the_thread_queue->state;
if ( _Thread_queue_Is_reverse_search( priority ) )
30007d3c: e3130020 tst r3, #32
the_chain->permanent_null = NULL;
30007d40: e3a04000 mov r4, #0 30007d44: e581403c str r4, [r1, #60] ; 0x3c
the_chain->last = _Chain_Head(the_chain);
30007d48: e581c040 str ip, [r1, #64] ; 0x40
RTEMS_INLINE_ROUTINE uint32_t _Thread_queue_Header_number (
Priority_Control the_priority
)
{
return (the_priority / TASK_QUEUE_DATA_PRIORITIES_PER_HEADER);
30007d4c: e1a08323 lsr r8, r3, #6
_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 ];
block_state = the_thread_queue->state;
30007d50: e5905038 ldr r5, [r0, #56] ; 0x38
if ( _Thread_queue_Is_reverse_search( priority ) )
30007d54: 1a00001f bne 30007dd8 <_Thread_queue_Enqueue_priority+0xb0>
goto restart_reverse_search;
restart_forward_search:
search_priority = PRIORITY_MINIMUM - 1;
_ISR_Disable( level );
search_thread = (Thread_Control *) header->first;
30007d58: e0888088 add r8, r8, r8, lsl #1 30007d5c: e1a09108 lsl r9, r8, #2
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail(
Chain_Control *the_chain
)
{
return (Chain_Node *) &the_chain->permanent_null;
30007d60: e2898004 add r8, r9, #4 30007d64: e0808008 add r8, r0, r8 30007d68: e0809009 add r9, r0, r9
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
30007d6c: e10f7000 mrs r7, CPSR 30007d70: e387c080 orr ip, r7, #128 ; 0x80 30007d74: e129f00c msr CPSR_fc, ip 30007d78: e1a0a007 mov sl, r7 30007d7c: e599c000 ldr ip, [r9]
while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) {
30007d80: e15c0008 cmp ip, r8
30007d84: 1a000009 bne 30007db0 <_Thread_queue_Enqueue_priority+0x88>
30007d88: ea000054 b 30007ee0 <_Thread_queue_Enqueue_priority+0x1b8>
static inline void arm_interrupt_flash( uint32_t level )
{
uint32_t arm_switch_reg;
asm volatile (
30007d8c: e10f6000 mrs r6, CPSR 30007d90: e129f007 msr CPSR_fc, r7 30007d94: e129f006 msr CPSR_fc, r6
RTEMS_INLINE_ROUTINE bool _States_Are_set (
States_Control the_states,
States_Control mask
)
{
return ( (the_states & mask) != STATES_READY);
30007d98: e59c6010 ldr r6, [ip, #16]
search_priority = search_thread->current_priority;
if ( priority <= search_priority )
break;
#endif
_ISR_Flash( level );
if ( !_States_Are_set( search_thread->current_state, block_state) ) {
30007d9c: e1150006 tst r5, r6
30007da0: 0a000036 beq 30007e80 <_Thread_queue_Enqueue_priority+0x158>
_ISR_Enable( level );
goto restart_forward_search;
}
search_thread =
(Thread_Control *)search_thread->Object.Node.next;
30007da4: e59cc000 ldr ip, [ip]
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 ) ) {
30007da8: e15c0008 cmp ip, r8
30007dac: 0a000002 beq 30007dbc <_Thread_queue_Enqueue_priority+0x94>
search_priority = search_thread->current_priority;
30007db0: e59c4014 ldr r4, [ip, #20]
if ( priority <= search_priority )
30007db4: e1530004 cmp r3, r4
30007db8: 8afffff3 bhi 30007d8c <_Thread_queue_Enqueue_priority+0x64>
}
search_thread =
(Thread_Control *)search_thread->Object.Node.next;
}
if ( the_thread_queue->sync_state !=
30007dbc: e5905030 ldr r5, [r0, #48] ; 0x30 30007dc0: e3550001 cmp r5, #1
30007dc4: 0a00002f beq 30007e88 <_Thread_queue_Enqueue_priority+0x160> * 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;
30007dc8: e582a000 str sl, [r2]
return the_thread_queue->sync_state; }
30007dcc: e1a00005 mov r0, r5
30007dd0: e8bd0ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp}
30007dd4: e12fff1e bx lr
_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 ];
30007dd8: e0888088 add r8, r8, r8, lsl #1 30007ddc: e0808108 add r8, r0, r8, lsl #2 30007de0: e59f9100 ldr r9, [pc, #256] ; 30007ee8 <_Thread_queue_Enqueue_priority+0x1c0>
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
_ISR_Disable( level );
search_thread = (Thread_Control *) header->last;
30007de4: e1a0b008 mov fp, r8
the_thread->Wait.queue = the_thread_queue;
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
30007de8: e5d94000 ldrb r4, [r9] 30007dec: e2844001 add r4, r4, #1
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
30007df0: e10f7000 mrs r7, CPSR 30007df4: e387c080 orr ip, r7, #128 ; 0x80 30007df8: e129f00c msr CPSR_fc, ip 30007dfc: e1a0a007 mov sl, r7
_ISR_Disable( level );
search_thread = (Thread_Control *) header->last;
30007e00: e59bc008 ldr ip, [fp, #8]
while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) {
30007e04: e15c0008 cmp ip, r8
30007e08: 1a000009 bne 30007e34 <_Thread_queue_Enqueue_priority+0x10c>
30007e0c: ea00000b b 30007e40 <_Thread_queue_Enqueue_priority+0x118>
static inline void arm_interrupt_flash( uint32_t level )
{
uint32_t arm_switch_reg;
asm volatile (
30007e10: e10f6000 mrs r6, CPSR 30007e14: e129f007 msr CPSR_fc, r7 30007e18: e129f006 msr CPSR_fc, r6 30007e1c: e59c6010 ldr r6, [ip, #16]
search_priority = search_thread->current_priority;
if ( priority >= search_priority )
break;
#endif
_ISR_Flash( level );
if ( !_States_Are_set( search_thread->current_state, block_state) ) {
30007e20: e1150006 tst r5, r6
30007e24: 0a000013 beq 30007e78 <_Thread_queue_Enqueue_priority+0x150>
_ISR_Enable( level );
goto restart_reverse_search;
}
search_thread = (Thread_Control *)
search_thread->Object.Node.previous;
30007e28: e59cc004 ldr ip, [ip, #4]
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 ) ) {
30007e2c: e15c0008 cmp ip, r8
30007e30: 0a000002 beq 30007e40 <_Thread_queue_Enqueue_priority+0x118>
search_priority = search_thread->current_priority;
30007e34: e59c4014 ldr r4, [ip, #20]
if ( priority >= search_priority )
30007e38: e1530004 cmp r3, r4
30007e3c: 3afffff3 bcc 30007e10 <_Thread_queue_Enqueue_priority+0xe8>
}
search_thread = (Thread_Control *)
search_thread->Object.Node.previous;
}
if ( the_thread_queue->sync_state !=
30007e40: e5905030 ldr r5, [r0, #48] ; 0x30 30007e44: e3550001 cmp r5, #1
30007e48: 1affffde bne 30007dc8 <_Thread_queue_Enqueue_priority+0xa0>
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
if ( priority == search_priority )
30007e4c: e1530004 cmp r3, r4
if ( the_thread_queue->sync_state !=
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
30007e50: e3a03000 mov r3, #0 30007e54: e5803030 str r3, [r0, #48] ; 0x30
if ( priority == search_priority )
30007e58: 0a000016 beq 30007eb8 <_Thread_queue_Enqueue_priority+0x190>
goto equal_priority;
search_node = (Chain_Node *) search_thread;
next_node = search_node->next;
30007e5c: e59c3000 ldr r3, [ip]
the_node = (Chain_Node *) the_thread;
the_node->next = next_node;
the_node->previous = search_node;
30007e60: e8811008 stm r1, {r3, ip}
search_node->next = the_node; next_node->previous = the_node;
30007e64: e5831004 str r1, [r3, #4]
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;
30007e68: e58c1000 str r1, [ip]
next_node->previous = the_node; the_thread->Wait.queue = the_thread_queue;
30007e6c: e5810044 str r0, [r1, #68] ; 0x44
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
30007e70: e129f007 msr CPSR_fc, r7
_ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
30007e74: eaffffd4 b 30007dcc <_Thread_queue_Enqueue_priority+0xa4>
30007e78: e129f007 msr CPSR_fc, r7 <== NOT EXECUTED 30007e7c: eaffffd9 b 30007de8 <_Thread_queue_Enqueue_priority+0xc0> <== NOT EXECUTED
30007e80: e129f007 msr CPSR_fc, r7 30007e84: eaffffb8 b 30007d6c <_Thread_queue_Enqueue_priority+0x44>
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
if ( priority == search_priority )
30007e88: e1530004 cmp r3, r4
if ( the_thread_queue->sync_state !=
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
30007e8c: e3a03000 mov r3, #0 30007e90: e5803030 str r3, [r0, #48] ; 0x30
if ( priority == search_priority )
30007e94: 0a000007 beq 30007eb8 <_Thread_queue_Enqueue_priority+0x190>
goto equal_priority;
search_node = (Chain_Node *) search_thread;
previous_node = search_node->previous;
30007e98: e59c3004 ldr r3, [ip, #4]
the_node = (Chain_Node *) the_thread;
the_node->next = search_node;
30007e9c: e581c000 str ip, [r1]
the_node->previous = previous_node;
30007ea0: e5813004 str r3, [r1, #4]
previous_node->next = the_node;
30007ea4: e5831000 str r1, [r3]
search_node->previous = the_node;
30007ea8: e58c1004 str r1, [ip, #4]
the_thread->Wait.queue = the_thread_queue;
30007eac: e5810044 str r0, [r1, #68] ; 0x44 30007eb0: e129f007 msr CPSR_fc, r7
_ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
30007eb4: eaffffc4 b 30007dcc <_Thread_queue_Enqueue_priority+0xa4> 30007eb8: e28cc03c add ip, ip, #60 ; 0x3c
_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;
30007ebc: e59c3004 ldr r3, [ip, #4]
the_node = (Chain_Node *) the_thread;
the_node->next = search_node;
30007ec0: e581c000 str ip, [r1]
the_node->previous = previous_node;
30007ec4: e5813004 str r3, [r1, #4]
previous_node->next = the_node;
30007ec8: e5831000 str r1, [r3]
search_node->previous = the_node;
30007ecc: e58c1004 str r1, [ip, #4]
the_thread->Wait.queue = the_thread_queue;
30007ed0: e5810044 str r0, [r1, #68] ; 0x44 30007ed4: e129f00a msr CPSR_fc, sl
_ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
30007ed8: e3a05001 mov r5, #1 30007edc: eaffffba b 30007dcc <_Thread_queue_Enqueue_priority+0xa4>
if ( _Thread_queue_Is_reverse_search( priority ) )
goto restart_reverse_search;
restart_forward_search:
search_priority = PRIORITY_MINIMUM - 1;
30007ee0: e3e04000 mvn r4, #0 30007ee4: eaffffb4 b 30007dbc <_Thread_queue_Enqueue_priority+0x94>
3000b344 <_Thread_queue_Extract_priority_helper>:
void _Thread_queue_Extract_priority_helper(
Thread_queue_Control *the_thread_queue __attribute__((unused)),
Thread_Control *the_thread,
bool requeuing
)
{
3000b344: e92d4070 push {r4, r5, r6, lr}
3000b348: e20220ff and r2, r2, #255 ; 0xff
3000b34c: e24dd004 sub sp, sp, #4
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
3000b350: e10fc000 mrs ip, CPSR 3000b354: e38c3080 orr r3, ip, #128 ; 0x80 3000b358: e129f003 msr CPSR_fc, r3
*/
RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue (
States_Control the_states
)
{
return (the_states & STATES_WAITING_ON_THREAD_QUEUE);
3000b35c: e59f30bc ldr r3, [pc, #188] ; 3000b420 <_Thread_queue_Extract_priority_helper+0xdc> 3000b360: e5910010 ldr r0, [r1, #16] 3000b364: e0003003 and r3, r0, r3
Chain_Node *new_second_node;
Chain_Node *last_node;
the_node = (Chain_Node *) the_thread;
_ISR_Disable( level );
if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
3000b368: e3530000 cmp r3, #0
3000b36c: 0a000021 beq 3000b3f8 <_Thread_queue_Extract_priority_helper+0xb4>
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
Chain_Control *the_chain
)
{
return (the_chain->first == _Chain_Tail(the_chain));
3000b370: e5913038 ldr r3, [r1, #56] ; 0x38
/*
* The thread was actually waiting on a thread queue so let's remove it.
*/
next_node = the_node->next;
3000b374: e8910030 ldm r1, {r4, r5}
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail(
Chain_Control *the_chain
)
{
return (Chain_Node *) &the_chain->permanent_null;
3000b378: e281003c add r0, r1, #60 ; 0x3c
previous_node = the_node->previous;
if ( !_Chain_Is_empty( &the_thread->Wait.Block2n ) ) {
3000b37c: e1530000 cmp r3, r0
new_first_thread->Wait.Block2n.last = last_node;
last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n );
}
} else {
previous_node->next = next_node;
3000b380: 05854000 streq r4, [r5]
next_node->previous = previous_node;
3000b384: 05845004 streq r5, [r4, #4]
*/
next_node = the_node->next;
previous_node = the_node->previous;
if ( !_Chain_Is_empty( &the_thread->Wait.Block2n ) ) {
3000b388: 0a00000c beq 3000b3c0 <_Thread_queue_Extract_priority_helper+0x7c>
new_first_node = the_thread->Wait.Block2n.first;
new_first_thread = (Thread_Control *) new_first_node;
last_node = the_thread->Wait.Block2n.last;
3000b38c: e5910040 ldr r0, [r1, #64] ; 0x40
new_second_node = new_first_node->next;
3000b390: e5936000 ldr r6, [r3]
previous_node->next = new_first_node;
next_node->previous = new_first_node;
new_first_node->next = next_node;
new_first_node->previous = previous_node;
if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) {
3000b394: e1500003 cmp r0, r3
new_first_node = the_thread->Wait.Block2n.first;
new_first_thread = (Thread_Control *) new_first_node;
last_node = the_thread->Wait.Block2n.last;
new_second_node = new_first_node->next;
previous_node->next = new_first_node;
3000b398: e5853000 str r3, [r5]
next_node->previous = new_first_node;
3000b39c: e5843004 str r3, [r4, #4]
new_first_node->next = next_node;
3000b3a0: e8830030 stm r3, {r4, r5}
new_first_node->previous = previous_node;
if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) {
3000b3a4: 0a000005 beq 3000b3c0 <_Thread_queue_Extract_priority_helper+0x7c>
/* > two threads on 2-n */
new_second_node->previous =
_Chain_Head( &new_first_thread->Wait.Block2n );
3000b3a8: e2835038 add r5, r3, #56 ; 0x38 3000b3ac: e283403c add r4, r3, #60 ; 0x3c
new_first_node->next = next_node;
new_first_node->previous = previous_node;
if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) {
/* > two threads on 2-n */
new_second_node->previous =
3000b3b0: e5865004 str r5, [r6, #4]
_Chain_Head( &new_first_thread->Wait.Block2n );
new_first_thread->Wait.Block2n.first = new_second_node;
3000b3b4: e5836038 str r6, [r3, #56] ; 0x38
new_first_thread->Wait.Block2n.last = last_node;
3000b3b8: e5830040 str r0, [r3, #64] ; 0x40
last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n );
3000b3bc: e5804000 str r4, [r0]
/*
* If we are not supposed to touch timers or the thread's state, return.
*/
if ( requeuing ) {
3000b3c0: e3520000 cmp r2, #0
3000b3c4: 1a000008 bne 3000b3ec <_Thread_queue_Extract_priority_helper+0xa8>
_ISR_Enable( level );
return;
}
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
3000b3c8: e5913050 ldr r3, [r1, #80] ; 0x50 3000b3cc: e3530002 cmp r3, #2
3000b3d0: 0a00000a beq 3000b400 <_Thread_queue_Extract_priority_helper+0xbc>
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
3000b3d4: e129f00c msr CPSR_fc, ip 3000b3d8: e1a00001 mov r0, r1 3000b3dc: e59f1040 ldr r1, [pc, #64] ; 3000b424 <_Thread_queue_Extract_priority_helper+0xe0>
#if defined(RTEMS_MULTIPROCESSING)
if ( !_Objects_Is_local_id( the_thread->Object.id ) )
_Thread_MP_Free_proxy( the_thread );
#endif
}
3000b3e0: e28dd004 add sp, sp, #4
3000b3e4: e8bd4070 pop {r4, r5, r6, lr}
3000b3e8: eafff007 b 3000740c <_Thread_Clear_state>
3000b3ec: e129f00c msr CPSR_fc, ip
3000b3f0: e28dd004 add sp, sp, #4
3000b3f4: e8bd8070 pop {r4, r5, r6, pc}
3000b3f8: e129f00c msr CPSR_fc, ip
3000b3fc: eafffffb b 3000b3f0 <_Thread_queue_Extract_priority_helper+0xac>
3000b400: e3a03003 mov r3, #3 <== NOT EXECUTED 3000b404: e5813050 str r3, [r1, #80] ; 0x50 <== NOT EXECUTED 3000b408: e129f00c msr CPSR_fc, ip <== NOT EXECUTED
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
_ISR_Enable( level );
} else {
_Watchdog_Deactivate( &the_thread->Timer );
_ISR_Enable( level );
(void) _Watchdog_Remove( &the_thread->Timer );
3000b40c: e2810048 add r0, r1, #72 ; 0x48 <== NOT EXECUTED 3000b410: e58d1000 str r1, [sp] <== NOT EXECUTED 3000b414: ebfff576 bl 300089f4 <_Watchdog_Remove> <== NOT EXECUTED 3000b418: e59d1000 ldr r1, [sp] <== NOT EXECUTED 3000b41c: eaffffed b 3000b3d8 <_Thread_queue_Extract_priority_helper+0x94><== NOT EXECUTED
30016118 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
30016118: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr}
3001611c: e24dd024 sub sp, sp, #36 ; 0x24
30016120: e28d700c add r7, sp, #12
30016124: e28d2018 add r2, sp, #24
30016128: e282a004 add sl, r2, #4
3001612c: e2872004 add r2, r7, #4
30016130: e58d2000 str r2, [sp]
Chain_Control *the_chain
)
{
the_chain->first = _Chain_Tail(the_chain);
the_chain->permanent_null = NULL;
the_chain->last = _Chain_Head(the_chain);
30016134: e28d2018 add r2, sp, #24 30016138: e58d2020 str r2, [sp, #32]
*/
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
the_chain->first = _Chain_Tail(the_chain);
3001613c: e59d2000 ldr r2, [sp]
the_chain->permanent_null = NULL;
30016140: e3a03000 mov r3, #0
*/
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
the_chain->first = _Chain_Tail(the_chain);
30016144: e58d200c str r2, [sp, #12] 30016148: e2802008 add r2, r0, #8 3001614c: e58d2004 str r2, [sp, #4] 30016150: e59f91bc ldr r9, [pc, #444] ; 30016314 <_Timer_server_Body+0x1fc> 30016154: e2802040 add r2, r0, #64 ; 0x40 30016158: e59fb1b8 ldr fp, [pc, #440] ; 30016318 <_Timer_server_Body+0x200> 3001615c: e1a04000 mov r4, r0 30016160: e58da018 str sl, [sp, #24]
the_chain->permanent_null = NULL;
30016164: e58d301c str r3, [sp, #28] 30016168: e58d3010 str r3, [sp, #16]
the_chain->last = _Chain_Head(the_chain);
3001616c: e58d7014 str r7, [sp, #20] 30016170: e2806030 add r6, r0, #48 ; 0x30 30016174: e2808068 add r8, r0, #104 ; 0x68 30016178: e58d2008 str r2, [sp, #8]
{
/*
* 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;
3001617c: e28d3018 add r3, sp, #24 30016180: e5843078 str r3, [r4, #120] ; 0x78
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
30016184: e5993000 ldr r3, [r9]
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
30016188: e594103c ldr r1, [r4, #60] ; 0x3c
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
3001618c: e1a02007 mov r2, r7 30016190: e1a00006 mov r0, r6
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
30016194: e584303c str r3, [r4, #60] ; 0x3c
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
30016198: e0611003 rsb r1, r1, r3 3001619c: eb001150 bl 3001a6e4 <_Watchdog_Adjust_to_chain>
static void _Timer_server_Process_tod_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
300161a0: e59b5000 ldr r5, [fp]
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
300161a4: e5942074 ldr r2, [r4, #116] ; 0x74
/*
* 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 ) {
300161a8: e1550002 cmp r5, r2
300161ac: 8a000022 bhi 3001623c <_Timer_server_Body+0x124>
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
} else if ( snapshot < last_snapshot ) {
300161b0: 3a000018 bcc 30016218 <_Timer_server_Body+0x100>
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
300161b4: e5845074 str r5, [r4, #116] ; 0x74
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
300161b8: e5940078 ldr r0, [r4, #120] ; 0x78 300161bc: eb0002bc bl 30016cb4 <_Chain_Get>
if ( timer == NULL ) {
300161c0: e2501000 subs r1, r0, #0
300161c4: 0a00000b beq 300161f8 <_Timer_server_Body+0xe0>
static void _Timer_server_Insert_timer(
Timer_server_Control *ts,
Timer_Control *timer
)
{
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
300161c8: e5913038 ldr r3, [r1, #56] ; 0x38 300161cc: e3530001 cmp r3, #1
300161d0: 0a000015 beq 3001622c <_Timer_server_Body+0x114>
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
300161d4: e3530003 cmp r3, #3
300161d8: 1afffff6 bne 300161b8 <_Timer_server_Body+0xa0>
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
300161dc: e2811010 add r1, r1, #16 300161e0: e1a00008 mov r0, r8 300161e4: eb001168 bl 3001a78c <_Watchdog_Insert>
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
300161e8: e5940078 ldr r0, [r4, #120] ; 0x78 300161ec: eb0002b0 bl 30016cb4 <_Chain_Get>
if ( timer == NULL ) {
300161f0: e2501000 subs r1, r0, #0
300161f4: 1afffff3 bne 300161c8 <_Timer_server_Body+0xb0>
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
300161f8: e10f2000 mrs r2, CPSR 300161fc: e3823080 orr r3, r2, #128 ; 0x80 30016200: e129f003 msr CPSR_fc, r3
* body loop.
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
30016204: e59d3018 ldr r3, [sp, #24] 30016208: e15a0003 cmp sl, r3
3001620c: 0a00000f beq 30016250 <_Timer_server_Body+0x138>
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
30016210: e129f002 msr CPSR_fc, r2 <== NOT EXECUTED 30016214: eaffffda b 30016184 <_Timer_server_Body+0x6c> <== NOT EXECUTED
/*
* The current TOD is before the last TOD which indicates that
* TOD has been set backwards.
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
30016218: e1a00008 mov r0, r8 3001621c: e3a01001 mov r1, #1 30016220: e0652002 rsb r2, r5, r2 30016224: eb0010ff bl 3001a628 <_Watchdog_Adjust> 30016228: eaffffe1 b 300161b4 <_Timer_server_Body+0x9c>
Timer_server_Control *ts,
Timer_Control *timer
)
{
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
3001622c: e1a00006 mov r0, r6 30016230: e2811010 add r1, r1, #16 30016234: eb001154 bl 3001a78c <_Watchdog_Insert> 30016238: eaffffde b 300161b8 <_Timer_server_Body+0xa0>
/*
* 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 );
3001623c: e0621005 rsb r1, r2, r5 30016240: e1a00008 mov r0, r8 30016244: e1a02007 mov r2, r7 30016248: eb001125 bl 3001a6e4 <_Watchdog_Adjust_to_chain> 3001624c: eaffffd8 b 300161b4 <_Timer_server_Body+0x9c>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
30016250: e5841078 str r1, [r4, #120] ; 0x78 30016254: e129f002 msr CPSR_fc, r2
_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 ) ) {
30016258: e59d300c ldr r3, [sp, #12] 3001625c: e59d2000 ldr r2, [sp] 30016260: e1520003 cmp r2, r3
30016264: 0a000015 beq 300162c0 <_Timer_server_Body+0x1a8>
30016268: e1a05004 mov r5, r4 3001626c: e59d4000 ldr r4, [sp] 30016270: ea000009 b 3001629c <_Timer_server_Body+0x184>
{
Chain_Node *return_node;
Chain_Node *new_first;
return_node = the_chain->first;
new_first = return_node->next;
30016274: e5932000 ldr r2, [r3]
the_chain->first = new_first; new_first->previous = _Chain_Head(the_chain);
30016278: e5827004 str r7, [r2, #4]
Chain_Node *return_node;
Chain_Node *new_first;
return_node = the_chain->first;
new_first = return_node->next;
the_chain->first = new_first;
3001627c: e58d200c str r2, [sp, #12]
* service routine may remove a watchdog from the chain.
*/
_ISR_Disable( level );
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
30016280: e3a02000 mov r2, #0 30016284: e5832008 str r2, [r3, #8] 30016288: e129f001 msr CPSR_fc, r1
/*
* 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 );
3001628c: e5930020 ldr r0, [r3, #32] 30016290: e5931024 ldr r1, [r3, #36] ; 0x24 30016294: e1a0e00f mov lr, pc 30016298: e593f01c ldr pc, [r3, #28]
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
3001629c: e10f1000 mrs r1, CPSR 300162a0: e3813080 orr r3, r1, #128 ; 0x80 300162a4: e129f003 msr CPSR_fc, r3
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
Chain_Control *the_chain
)
{
return (the_chain->first == _Chain_Tail(the_chain));
300162a8: e59d300c ldr r3, [sp, #12]
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected(
Chain_Control *the_chain
)
{
if ( !_Chain_Is_empty(the_chain))
300162ac: e1540003 cmp r4, r3
300162b0: 1affffef bne 30016274 <_Timer_server_Body+0x15c>
300162b4: e1a04005 mov r4, r5
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
300162b8: e129f001 msr CPSR_fc, r1 300162bc: eaffffae b 3001617c <_Timer_server_Body+0x64> 300162c0: e59f2054 ldr r2, [pc, #84] ; 3001631c <_Timer_server_Body+0x204>
}
} else {
ts->active = false;
300162c4: e3a03000 mov r3, #0 300162c8: e5c4307c strb r3, [r4, #124] ; 0x7c 300162cc: e5923000 ldr r3, [r2] 300162d0: e2833001 add r3, r3, #1 300162d4: e5823000 str r3, [r2]
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
300162d8: e3a01008 mov r1, #8 300162dc: e5940000 ldr r0, [r4] 300162e0: eb000e77 bl 30019cc4 <_Thread_Set_state>
_Timer_server_Reset_interval_system_watchdog( ts );
300162e4: e1a00004 mov r0, r4 300162e8: ebffff5e bl 30016068 <_Timer_server_Reset_interval_system_watchdog>
_Timer_server_Reset_tod_system_watchdog( ts );
300162ec: e1a00004 mov r0, r4 300162f0: ebffff72 bl 300160c0 <_Timer_server_Reset_tod_system_watchdog>
_Thread_Enable_dispatch();
300162f4: eb000be6 bl 30019294 <_Thread_Enable_dispatch>
ts->active = true;
300162f8: e3a03001 mov r3, #1 300162fc: e5c4307c strb r3, [r4, #124] ; 0x7c
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
30016300: e59d0004 ldr r0, [sp, #4] 30016304: eb00118d bl 3001a940 <_Watchdog_Remove>
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
30016308: e59d0008 ldr r0, [sp, #8] 3001630c: eb00118b bl 3001a940 <_Watchdog_Remove> 30016310: eaffff99 b 3001617c <_Timer_server_Body+0x64>
3000a314 <_Timespec_Greater_than>:
bool _Timespec_Greater_than(
const struct timespec *lhs,
const struct timespec *rhs
)
{
if ( lhs->tv_sec > rhs->tv_sec )
3000a314: e5902000 ldr r2, [r0] 3000a318: e5913000 ldr r3, [r1] 3000a31c: e1520003 cmp r2, r3
return true;
3000a320: c3a00001 movgt r0, #1
bool _Timespec_Greater_than(
const struct timespec *lhs,
const struct timespec *rhs
)
{
if ( lhs->tv_sec > rhs->tv_sec )
3000a324: c12fff1e bxgt lr
return true;
if ( lhs->tv_sec < rhs->tv_sec )
3000a328: ba000005 blt 3000a344 <_Timespec_Greater_than+0x30>
#include <rtems/system.h>
#include <rtems/score/timespec.h>
#include <rtems/score/tod.h>
bool _Timespec_Greater_than(
3000a32c: e5900004 ldr r0, [r0, #4] 3000a330: e5913004 ldr r3, [r1, #4] 3000a334: e1500003 cmp r0, r3 3000a338: d3a00000 movle r0, #0 3000a33c: c3a00001 movgt r0, #1 3000a340: e12fff1e bx lr
{
if ( lhs->tv_sec > rhs->tv_sec )
return true;
if ( lhs->tv_sec < rhs->tv_sec )
return false;
3000a344: e3a00000 mov r0, #0 <== NOT EXECUTED
/* ASSERT: lhs->tv_sec == rhs->tv_sec */
if ( lhs->tv_nsec > rhs->tv_nsec )
return true;
return false;
}
3000a348: e12fff1e bx lr <== NOT EXECUTED
300086b4 <_User_extensions_Fatal>:
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300086b4: e92d41f0 push {r4, r5, r6, r7, r8, lr}
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
300086b8: e59f5040 ldr r5, [pc, #64] ; 30008700 <_User_extensions_Fatal+0x4c>
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300086bc: e1a08000 mov r8, r0
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
300086c0: e5954008 ldr r4, [r5, #8]
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300086c4: e1a07002 mov r7, r2
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
300086c8: e1540005 cmp r4, r5
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
300086cc: e20160ff and r6, r1, #255 ; 0xff
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
300086d0: 08bd81f0 popeq {r4, r5, r6, r7, r8, pc}
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.fatal != NULL )
300086d4: e5943030 ldr r3, [r4, #48] ; 0x30
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
300086d8: e1a00008 mov r0, r8
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.fatal != NULL )
300086dc: e3530000 cmp r3, #0
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
300086e0: e1a01006 mov r1, r6 300086e4: e1a02007 mov r2, r7 300086e8: 11a0e00f movne lr, pc 300086ec: 112fff13 bxne r3
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
300086f0: e5944004 ldr r4, [r4, #4]
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _User_extensions_List.last ;
300086f4: e1540005 cmp r4, r5
300086f8: 1afffff5 bne 300086d4 <_User_extensions_Fatal+0x20>
300086fc: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} <== NOT EXECUTED
30008704 <_User_extensions_Thread_create>:
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
30008704: e92d40f0 push {r4, r5, r6, r7, lr}
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _User_extensions_List.first ;
30008708: e59f5050 ldr r5, [pc, #80] ; 30008760 <_User_extensions_Thread_create+0x5c>
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
3000870c: e1a06000 mov r6, r0
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _User_extensions_List.first ;
30008710: e4954004 ldr r4, [r5], #4 30008714: e1540005 cmp r4, r5
30008718: 0a00000e beq 30008758 <_User_extensions_Thread_create+0x54>
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
status = (*the_extension->Callouts.thread_create)(
3000871c: e59f7040 ldr r7, [pc, #64] ; 30008764 <_User_extensions_Thread_create+0x60>
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
30008720: e5943014 ldr r3, [r4, #20]
status = (*the_extension->Callouts.thread_create)(
30008724: e1a01006 mov r1, r6
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
30008728: e3530000 cmp r3, #0
3000872c: 0a000004 beq 30008744 <_User_extensions_Thread_create+0x40>
status = (*the_extension->Callouts.thread_create)(
30008730: e5970004 ldr r0, [r7, #4] 30008734: e1a0e00f mov lr, pc 30008738: e12fff13 bx r3
_Thread_Executing,
the_thread
);
if ( !status )
3000873c: e3500000 cmp r0, #0
30008740: 08bd80f0 popeq {r4, r5, r6, r7, pc}
User_extensions_Control *the_extension;
bool status;
for ( the_node = _User_extensions_List.first ;
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
30008744: e5944000 ldr r4, [r4]
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _User_extensions_List.first ;
30008748: e1540005 cmp r4, r5
3000874c: 1afffff3 bne 30008720 <_User_extensions_Thread_create+0x1c>
if ( !status )
return false;
}
}
return true;
30008750: e3a00001 mov r0, #1
30008754: e8bd80f0 pop {r4, r5, r6, r7, pc}
30008758: e3a00001 mov r0, #1 <== NOT EXECUTED
}
3000875c: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED
3000a6b0 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
3000a6b0: e92d41f0 push {r4, r5, r6, r7, r8, lr}
3000a6b4: e1a04000 mov r4, r0
3000a6b8: e1a05002 mov r5, r2
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
3000a6bc: e10f3000 mrs r3, CPSR 3000a6c0: e3832080 orr r2, r3, #128 ; 0x80 3000a6c4: e129f002 msr CPSR_fc, r2
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
Chain_Control *the_chain
)
{
return (the_chain->first == _Chain_Tail(the_chain));
3000a6c8: e1a07000 mov r7, r0 3000a6cc: e4972004 ldr r2, [r7], #4
* hence the compiler must not assume *header to remain
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
3000a6d0: e1520007 cmp r2, r7
3000a6d4: 0a000018 beq 3000a73c <_Watchdog_Adjust+0x8c>
switch ( direction ) {
3000a6d8: e3510000 cmp r1, #0
3000a6dc: 1a000018 bne 3000a744 <_Watchdog_Adjust+0x94>
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
3000a6e0: e3550000 cmp r5, #0
3000a6e4: 0a000014 beq 3000a73c <_Watchdog_Adjust+0x8c>
if ( units < _Watchdog_First( header )->delta_interval ) {
3000a6e8: e5926010 ldr r6, [r2, #16] 3000a6ec: e1550006 cmp r5, r6
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
_Watchdog_First( header )->delta_interval = 1;
3000a6f0: 23a08001 movcs r8, #1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
if ( units < _Watchdog_First( header )->delta_interval ) {
3000a6f4: 2a000005 bcs 3000a710 <_Watchdog_Adjust+0x60>
3000a6f8: ea000018 b 3000a760 <_Watchdog_Adjust+0xb0> <== NOT EXECUTED
switch ( direction ) {
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
3000a6fc: e0555006 subs r5, r5, r6
3000a700: 0a00000d beq 3000a73c <_Watchdog_Adjust+0x8c>
if ( units < _Watchdog_First( header )->delta_interval ) {
3000a704: e5926010 ldr r6, [r2, #16] 3000a708: e1560005 cmp r6, r5
3000a70c: 8a000013 bhi 3000a760 <_Watchdog_Adjust+0xb0>
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
_Watchdog_First( header )->delta_interval = 1;
3000a710: e5828010 str r8, [r2, #16]
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
3000a714: e129f003 msr CPSR_fc, r3
_ISR_Enable( level );
_Watchdog_Tickle( header );
3000a718: e1a00004 mov r0, r4 3000a71c: eb0000aa bl 3000a9cc <_Watchdog_Tickle>
static inline uint32_t arm_interrupt_disable( void )
{
uint32_t arm_switch_reg;
uint32_t level;
asm volatile (
3000a720: e10f3000 mrs r3, CPSR 3000a724: e3832080 orr r2, r3, #128 ; 0x80 3000a728: e129f002 msr CPSR_fc, r2 3000a72c: e5941000 ldr r1, [r4]
_ISR_Disable( level );
if ( _Chain_Is_empty( header ) )
3000a730: e1570001 cmp r7, r1
RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_First(
Chain_Control *header
)
{
return ( (Watchdog_Control *) header->first );
3000a734: e1a02001 mov r2, r1
3000a738: 1affffef bne 3000a6fc <_Watchdog_Adjust+0x4c>
static inline void arm_interrupt_enable( uint32_t level )
{
ARM_SWITCH_REGISTERS;
asm volatile (
3000a73c: e129f003 msr CPSR_fc, r3
}
}
_ISR_Enable( level );
}
3000a740: e8bd81f0 pop {r4, r5, r6, r7, r8, pc}
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
3000a744: e3510001 cmp r1, #1
3000a748: 1afffffb bne 3000a73c <_Watchdog_Adjust+0x8c>
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
3000a74c: e5921010 ldr r1, [r2, #16] 3000a750: e0815005 add r5, r1, r5 3000a754: e5825010 str r5, [r2, #16] 3000a758: e129f003 msr CPSR_fc, r3
}
}
_ISR_Enable( level );
}
3000a75c: e8bd81f0 pop {r4, r5, r6, r7, r8, pc}
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
if ( units < _Watchdog_First( header )->delta_interval ) {
_Watchdog_First( header )->delta_interval -= units;
3000a760: e0655006 rsb r5, r5, r6 3000a764: e5825010 str r5, [r2, #16]
break;
3000a768: eafffff3 b 3000a73c <_Watchdog_Adjust+0x8c>
30007324 <rtems_io_register_driver>:
rtems_device_major_number *registered_major
)
{
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
30007324: e59fc150 ldr ip, [pc, #336] ; 3000747c <rtems_io_register_driver+0x158>
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;
30007328: e59f3150 ldr r3, [pc, #336] ; 30007480 <rtems_io_register_driver+0x15c>
if ( rtems_interrupt_is_in_progress() )
3000732c: e59cc000 ldr ip, [ip]
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
)
{
30007330: e92d4030 push {r4, r5, lr}
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
30007334: e35c0000 cmp ip, #0
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
)
{
30007338: e1a04000 mov r4, r0
rtems_device_major_number major_limit = _IO_Number_of_drivers;
3000733c: e5930000 ldr r0, [r3]
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
30007340: 13a00012 movne r0, #18
rtems_device_major_number *registered_major
)
{
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
30007344: 18bd8030 popne {r4, r5, pc}
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
30007348: e3520000 cmp r2, #0
3000734c: 0a00003f beq 30007450 <rtems_io_register_driver+0x12c>
return RTEMS_INVALID_ADDRESS;
/* Set it to an invalid value */
*registered_major = major_limit;
if ( driver_table == NULL )
30007350: e3510000 cmp r1, #0
if ( registered_major == NULL )
return RTEMS_INVALID_ADDRESS;
/* Set it to an invalid value */
*registered_major = major_limit;
30007354: e5820000 str r0, [r2]
if ( driver_table == NULL )
30007358: 0a00003c beq 30007450 <rtems_io_register_driver+0x12c>
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
3000735c: e591c000 ldr ip, [r1] 30007360: e35c0000 cmp ip, #0
30007364: 0a000036 beq 30007444 <rtems_io_register_driver+0x120>
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
if ( major >= major_limit )
30007368: e1500004 cmp r0, r4
3000736c: 9a000027 bls 30007410 <rtems_io_register_driver+0xec>
rtems_fatal_error_occurred( 99 );
}
}
#endif
_Thread_Dispatch_disable_level += 1;
30007370: e59f010c ldr r0, [pc, #268] ; 30007484 <rtems_io_register_driver+0x160> 30007374: e590c000 ldr ip, [r0] 30007378: e28cc001 add ip, ip, #1 3000737c: e580c000 str ip, [r0]
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
30007380: e3540000 cmp r4, #0
30007384: 1a000023 bne 30007418 <rtems_io_register_driver+0xf4>
static rtems_status_code rtems_io_obtain_major_number(
rtems_device_major_number *major
)
{
rtems_device_major_number n = _IO_Number_of_drivers;
30007388: e593c000 ldr ip, [r3]
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
3000738c: e35c0000 cmp ip, #0
30007390: 0a000030 beq 30007458 <rtems_io_register_driver+0x134>
30007394: e59fe0ec ldr lr, [pc, #236] ; 30007488 <rtems_io_register_driver+0x164> 30007398: e59e3000 ldr r3, [lr] 3000739c: ea000003 b 300073b0 <rtems_io_register_driver+0x8c> 300073a0: e2844001 add r4, r4, #1 300073a4: e15c0004 cmp ip, r4 300073a8: e2833018 add r3, r3, #24
300073ac: 9a000005 bls 300073c8 <rtems_io_register_driver+0xa4>
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
300073b0: e5930000 ldr r0, [r3] 300073b4: e3500000 cmp r0, #0
300073b8: 1afffff8 bne 300073a0 <rtems_io_register_driver+0x7c>
300073bc: e5930004 ldr r0, [r3, #4] 300073c0: e3500000 cmp r0, #0
300073c4: 1afffff5 bne 300073a0 <rtems_io_register_driver+0x7c>
}
/* Assigns invalid value in case of failure */
*major = m;
if ( m != n )
300073c8: e15c0004 cmp ip, r4 300073cc: 1084c084 addne ip, r4, r4, lsl #1
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
300073d0: e5824000 str r4, [r2]
if ( m != n )
300073d4: 11a0c18c lslne ip, ip, #3
300073d8: 0a00001f beq 3000745c <rtems_io_register_driver+0x138>
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
300073dc: e59e5000 ldr r5, [lr]
300073e0: e1a0e001 mov lr, r1
300073e4: e085c00c add ip, r5, ip
300073e8: e8be000f ldm lr!, {r0, r1, r2, r3}
300073ec: e8ac000f stmia ip!, {r0, r1, r2, r3}
300073f0: e89e0003 ldm lr, {r0, r1}
300073f4: e88c0003 stm ip, {r0, r1}
_Thread_Enable_dispatch();
300073f8: eb0006a8 bl 30008ea0 <_Thread_Enable_dispatch>
return rtems_io_initialize( major, 0, NULL );
300073fc: e3a01000 mov r1, #0 30007400: e1a00004 mov r0, r4 30007404: e1a02001 mov r2, r1
}
30007408: e8bd4030 pop {r4, r5, lr}
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
3000740c: ea001f08 b 3000f034 <rtems_io_initialize>
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
if ( major >= major_limit )
return RTEMS_INVALID_NUMBER;
30007410: e3a0000a mov r0, #10
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
30007414: e8bd8030 pop {r4, r5, pc}
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
30007418: e59fe068 ldr lr, [pc, #104] ; 30007488 <rtems_io_register_driver+0x164> 3000741c: e0840084 add r0, r4, r4, lsl #1 30007420: e59e3000 ldr r3, [lr] 30007424: e1a0c180 lsl ip, r0, #3
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
30007428: e7930180 ldr r0, [r3, r0, lsl #3]
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
3000742c: e083300c add r3, r3, ip
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
30007430: e3500000 cmp r0, #0
30007434: 0a00000b beq 30007468 <rtems_io_register_driver+0x144>
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();
30007438: eb000698 bl 30008ea0 <_Thread_Enable_dispatch>
return RTEMS_RESOURCE_IN_USE;
3000743c: e3a0000c mov r0, #12
30007440: e8bd8030 pop {r4, r5, pc}
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
30007444: e591c004 ldr ip, [r1, #4] 30007448: e35c0000 cmp ip, #0
3000744c: 1affffc5 bne 30007368 <rtems_io_register_driver+0x44>
if ( driver_table == NULL )
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
30007450: e3a00009 mov r0, #9
30007454: e8bd8030 pop {r4, r5, pc}
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
30007458: e5824000 str r4, [r2] <== NOT EXECUTED
if ( major == 0 ) {
rtems_status_code sc = rtems_io_obtain_major_number( registered_major );
if ( sc != RTEMS_SUCCESSFUL ) {
_Thread_Enable_dispatch();
3000745c: eb00068f bl 30008ea0 <_Thread_Enable_dispatch>
*major = m;
if ( m != n )
return RTEMS_SUCCESSFUL;
return RTEMS_TOO_MANY;
30007460: e3a00005 mov r0, #5
if ( major == 0 ) {
rtems_status_code sc = rtems_io_obtain_major_number( registered_major );
if ( sc != RTEMS_SUCCESSFUL ) {
_Thread_Enable_dispatch();
return sc;
30007464: e8bd8030 pop {r4, r5, pc}
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
30007468: e5933004 ldr r3, [r3, #4] 3000746c: e3530000 cmp r3, #0
30007470: 1afffff0 bne 30007438 <rtems_io_register_driver+0x114>
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
30007474: e5824000 str r4, [r2] 30007478: eaffffd7 b 300073dc <rtems_io_register_driver+0xb8>