=============================================================================== 00016fb8 <_CORE_message_queue_Broadcast>: { Thread_Control *the_thread; uint32_t number_broadcasted; Thread_Wait_information *waitp; if ( size > the_message_queue->maximum_message_size ) { 16fb8: 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 ) { 16fbc: 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 ) { 16fc0: 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 ) { 16fc4: e1a07000 mov r7, r0 16fc8: e1a05002 mov r5, r2 16fcc: e1a08001 mov r8, r1 16fd0: 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 ) { 16fd4: 3a000016 bcc 17034 <_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 ) { 16fd8: e5906048 ldr r6, [r0, #72] ; 0x48 16fdc: e3560000 cmp r6, #0 *count = 0; 16fe0: 13a00000 movne r0, #0 16fe4: 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 ) { 16fe8: 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 = 16fec: e1a00007 mov r0, r7 16ff0: eb000b08 bl 19c18 <_Thread_queue_Dequeue> 16ff4: e2504000 subs r4, r0, #0 16ff8: 0a00000a beq 17028 <_CORE_message_queue_Broadcast+0x70> const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 16ffc: e594002c ldr r0, [r4, #44] ; 0x2c 17000: e1a01008 mov r1, r8 17004: e1a02005 mov r2, r5 17008: eb002464 bl 201a0 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 1700c: 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 = 17010: e1a00007 mov r0, r7 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 17014: 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 = 17018: eb000afe bl 19c18 <_Thread_queue_Dequeue> 1701c: e2504000 subs r4, r0, #0 _Thread_queue_Dequeue(&the_message_queue->Wait_queue))) { waitp = &the_thread->Wait; number_broadcasted += 1; 17020: 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 = 17024: 1afffff4 bne 16ffc <_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; 17028: e58a6000 str r6, [sl] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 1702c: e1a00004 mov r0, r4 17030: 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; 17034: e3a00001 mov r0, #1 <== NOT EXECUTED #endif } *count = number_broadcasted; return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; } 17038: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc} <== NOT EXECUTED =============================================================================== 0000bc00 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { bc00: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr} bc04: e1a08002 mov r8, r2 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; bc08: e5902010 ldr r2, [r0, #16] Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { bc0c: e24dd01c sub sp, sp, #28 bc10: e1a05001 mov r5, r1 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { bc14: e2911004 adds r1, r1, #4 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { bc18: e1a07000 mov r7, r0 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { bc1c: e58d1000 str r1, [sp] Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { bc20: e1a0b003 mov fp, r3 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; bc24: e58d200c str r2, [sp, #12] Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { bc28: 2a00007a bcs be18 <_Heap_Allocate_aligned_with_boundary+0x218> /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { bc2c: e3530000 cmp r3, #0 bc30: 1a000076 bne be10 <_Heap_Allocate_aligned_with_boundary+0x210> if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } bc34: e5979008 ldr r9, [r7, #8] do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { bc38: e1570009 cmp r7, r9 bc3c: 0a000075 beq be18 <_Heap_Allocate_aligned_with_boundary+0x218> 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 bc40: e59d300c ldr r3, [sp, #12] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; bc44: 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 bc48: e2833007 add r3, r3, #7 bc4c: e58d3010 str r3, [sp, #16] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; bc50: e58d1014 str r1, [sp, #20] do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { bc54: e3a06001 mov 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 ) { bc58: e599a004 ldr sl, [r9, #4] bc5c: e59d2000 ldr r2, [sp] bc60: e152000a cmp r2, sl bc64: 2a000050 bcs bdac <_Heap_Allocate_aligned_with_boundary+0x1ac> if ( alignment == 0 ) { bc68: 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; bc6c: 02894008 addeq r4, r9, #8 bc70: 0a000053 beq bdc4 <_Heap_Allocate_aligned_with_boundary+0x1c4> if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } bc74: 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_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; bc78: 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; bc7c: 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; bc80: 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; bc84: 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_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; bc88: e081400a add r4, r1, sl if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } bc8c: 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; bc90: e0633002 rsb r3, r3, r2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); bc94: 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 bc98: e083a00a add sl, r3, sl bc9c: 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; bca0: e2893008 add r3, r9, #8 bca4: e58d3008 str r3, [sp, #8] RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); bca8: eb0016d1 bl 117f4 <__umodsi3> bcac: 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 ) { bcb0: e15a0004 cmp sl, r4 bcb4: 2a000003 bcs bcc8 <_Heap_Allocate_aligned_with_boundary+0xc8> bcb8: e1a0000a mov r0, sl bcbc: e1a01008 mov r1, r8 bcc0: eb0016cb bl 117f4 <__umodsi3> bcc4: e060400a rsb r4, r0, sl } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { bcc8: e35b0000 cmp fp, #0 bccc: 0a000026 beq bd6c <_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; bcd0: e084a005 add sl, r4, r5 bcd4: e1a0000a mov r0, sl bcd8: e1a0100b mov r1, fp bcdc: eb0016c4 bl 117f4 <__umodsi3> bce0: 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 ) { bce4: e15a0000 cmp sl, r0 bce8: 93a0a000 movls sl, #0 bcec: 83a0a001 movhi sl, #1 bcf0: e1540000 cmp r4, r0 bcf4: 23a0a000 movcs sl, #0 bcf8: e35a0000 cmp sl, #0 bcfc: 0a00001a beq bd6c <_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; bd00: e59d1008 ldr r1, [sp, #8] bd04: e0813005 add r3, 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 ) { bd08: e1530000 cmp r3, r0 bd0c: 958d9018 strls r9, [sp, #24] bd10: 91a09003 movls r9, r3 bd14: 9a000002 bls bd24 <_Heap_Allocate_aligned_with_boundary+0x124> bd18: ea000023 b bdac <_Heap_Allocate_aligned_with_boundary+0x1ac> bd1c: e1590000 cmp r9, r0 bd20: 8a00003e bhi be20 <_Heap_Allocate_aligned_with_boundary+0x220> return 0; } alloc_begin = boundary_line - alloc_size; bd24: e0654000 rsb r4, r5, r0 bd28: e1a01008 mov r1, r8 bd2c: e1a00004 mov r0, r4 bd30: eb0016af bl 117f4 <__umodsi3> bd34: e0604004 rsb r4, r0, r4 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; bd38: e084a005 add sl, r4, r5 bd3c: e1a0000a mov r0, sl bd40: e1a0100b mov r1, fp bd44: eb0016aa bl 117f4 <__umodsi3> bd48: 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 ) { bd4c: e15a0000 cmp sl, r0 bd50: 93a0a000 movls sl, #0 bd54: 83a0a001 movhi sl, #1 bd58: e1540000 cmp r4, r0 bd5c: 23a0a000 movcs sl, #0 bd60: e35a0000 cmp sl, #0 bd64: 1affffec bne bd1c <_Heap_Allocate_aligned_with_boundary+0x11c> bd68: e59d9018 ldr r9, [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 ) { bd6c: e59d2008 ldr r2, [sp, #8] bd70: e1520004 cmp r2, r4 bd74: 8a00000c bhi bdac <_Heap_Allocate_aligned_with_boundary+0x1ac> bd78: e59d100c ldr r1, [sp, #12] bd7c: e1a00004 mov r0, r4 bd80: eb00169b bl 117f4 <__umodsi3> bd84: e269a4ff rsb sl, r9, #-16777216 ; 0xff000000 bd88: e28aa8ff add sl, sl, #16711680 ; 0xff0000 bd8c: e28aacff add sl, sl, #65280 ; 0xff00 bd90: e28aa0f8 add sl, sl, #248 ; 0xf8 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); bd94: 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 ) { bd98: e59d1004 ldr r1, [sp, #4] bd9c: e060300a rsb r3, r0, sl bda0: e15a0000 cmp sl, r0 bda4: 11510003 cmpne r1, r3 bda8: 9a000005 bls bdc4 <_Heap_Allocate_aligned_with_boundary+0x1c4> if ( alloc_begin != 0 ) { break; } block = block->next; bdac: e5999008 ldr r9, [r9, #8] do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { bdb0: e1570009 cmp r7, r9 if ( alloc_begin != 0 ) { break; } block = block->next; bdb4: e2863001 add r3, r6, #1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { bdb8: 0a00001d beq be34 <_Heap_Allocate_aligned_with_boundary+0x234> bdbc: e1a06003 mov r6, r3 bdc0: eaffffa4 b bc58 <_Heap_Allocate_aligned_with_boundary+0x58> } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { bdc4: e3540000 cmp r4, #0 bdc8: 0afffff7 beq bdac <_Heap_Allocate_aligned_with_boundary+0x1ac> search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; bdcc: e2872048 add r2, r7, #72 ; 0x48 bdd0: e892000c ldm r2, {r2, r3} bdd4: e2822001 add r2, r2, #1 stats->searches += search_count; bdd8: e0833006 add r3, r3, r6 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; bddc: e5872048 str r2, [r7, #72] ; 0x48 stats->searches += search_count; bde0: e587304c str r3, [r7, #76] ; 0x4c block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); bde4: e1a00007 mov r0, r7 bde8: e1a01009 mov r1, r9 bdec: e1a02004 mov r2, r4 bdf0: e1a03005 mov r3, r5 bdf4: ebffeb8e bl 6c34 <_Heap_Block_allocate> bdf8: e1a00004 mov r0, r4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { bdfc: e5973044 ldr r3, [r7, #68] ; 0x44 be00: e1530006 cmp r3, r6 stats->max_search = search_count; be04: 35876044 strcc r6, [r7, #68] ; 0x44 } return (void *) alloc_begin; } be08: e28dd01c add sp, sp, #28 be0c: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc} /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { be10: e1550003 cmp r5, r3 be14: 9a000008 bls be3c <_Heap_Allocate_aligned_with_boundary+0x23c> do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { be18: e3a00000 mov r0, #0 be1c: eafffff9 b be08 <_Heap_Allocate_aligned_with_boundary+0x208> be20: e59d9018 ldr r9, [sp, #24] <== NOT EXECUTED if ( alloc_begin != 0 ) { break; } block = block->next; be24: e5999008 ldr r9, [r9, #8] <== NOT EXECUTED do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { be28: e1570009 cmp r7, r9 <== NOT EXECUTED if ( alloc_begin != 0 ) { break; } block = block->next; be2c: e2863001 add r3, r6, #1 <== NOT EXECUTED do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { be30: 1affffe1 bne bdbc <_Heap_Allocate_aligned_with_boundary+0x1bc><== NOT EXECUTED be34: e3a00000 mov r0, #0 be38: eaffffef b bdfc <_Heap_Allocate_aligned_with_boundary+0x1fc> if ( boundary < alloc_size ) { return NULL; } if ( alignment == 0 ) { alignment = page_size; be3c: e3580000 cmp r8, #0 be40: 01a08002 moveq r8, r2 be44: eaffff7a b bc34 <_Heap_Allocate_aligned_with_boundary+0x34> =============================================================================== 0000be48 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { be48: e92d45f0 push {r4, r5, r6, r7, r8, sl, lr} be4c: e1a04000 mov r4, r0 be50: e1a05001 mov r5, r1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); be54: e1a00001 mov r0, r1 be58: e5941010 ldr r1, [r4, #16] be5c: eb001664 bl 117f4 <__umodsi3> be60: 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 be64: 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); be68: 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; be6c: e1550003 cmp r5, r3 be70: 3a00002f bcc bf34 <_Heap_Free+0xec> be74: e5941024 ldr r1, [r4, #36] ; 0x24 be78: e1550001 cmp r5, r1 be7c: 8a00002c bhi bf34 <_Heap_Free+0xec> --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } be80: 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; be84: 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); be88: 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; be8c: e1530002 cmp r3, r2 be90: 8a000027 bhi bf34 <_Heap_Free+0xec> be94: e1510002 cmp r1, r2 be98: 3a000027 bcc bf3c <_Heap_Free+0xf4> be9c: 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 ) ) { bea0: e2170001 ands r0, r7, #1 bea4: 08bd85f0 popeq {r4, r5, r6, r7, r8, sl, pc} return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); bea8: 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; beac: e3c77001 bic r7, r7, #1 beb0: 03a08000 moveq r8, #0 beb4: 0a000004 beq becc <_Heap_Free+0x84> --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } beb8: 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; bebc: e5900004 ldr r0, [r0, #4] return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) bec0: e3100001 tst r0, #1 bec4: 13a08000 movne r8, #0 bec8: 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 ) ) { becc: e21c0001 ands r0, ip, #1 bed0: 1a00001b bne bf44 <_Heap_Free+0xfc> uintptr_t const prev_size = block->prev_size; bed4: 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); bed8: 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; bedc: e153000a cmp r3, sl bee0: 88bd85f0 pophi {r4, r5, r6, r7, r8, sl, pc} bee4: e151000a cmp r1, sl bee8: 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; beec: 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) ) { bef0: e2100001 ands r0, r0, #1 bef4: 08bd85f0 popeq {r4, r5, r6, r7, r8, sl, pc} _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ bef8: e3580000 cmp r8, #0 befc: 0a000039 beq bfe8 <_Heap_Free+0x1a0> uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; bf00: 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; bf04: e0867007 add r7, r6, r7 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } bf08: 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; bf0c: e087c00c add ip, r7, ip --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } bf10: 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; bf14: e2400001 sub r0, r0, #1 prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; bf18: 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; bf1c: e5823008 str r3, [r2, #8] next->prev = prev; bf20: 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; bf24: e5840038 str r0, [r4, #56] ; 0x38 prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; bf28: 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; bf2c: e78ac00c str ip, [sl, ip] bf30: ea00000f b bf74 <_Heap_Free+0x12c> _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { _HAssert( false ); return false; bf34: e3a00000 mov r0, #0 bf38: e8bd85f0 pop {r4, r5, r6, r7, r8, sl, pc} bf3c: e3a00000 mov r0, #0 <== NOT EXECUTED --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } bf40: 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 */ bf44: e3580000 cmp r8, #0 bf48: 0a000014 beq bfa0 <_Heap_Free+0x158> --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } bf4c: 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; bf50: e0877006 add r7, r7, r6 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } bf54: 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; bf58: e3871001 orr r1, r7, #1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; bf5c: e5853008 str r3, [r5, #8] new_block->prev = prev; bf60: e585200c str r2, [r5, #12] next->prev = new_block; prev->next = new_block; bf64: e5825008 str r5, [r2, #8] Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; next->prev = new_block; bf68: e583500c str r5, [r3, #12] bf6c: e5851004 str r1, [r5, #4] next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; bf70: e7857007 str r7, [r5, r7] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; bf74: e5942040 ldr r2, [r4, #64] ; 0x40 ++stats->frees; bf78: e5943050 ldr r3, [r4, #80] ; 0x50 stats->free_size += block_size; bf7c: e5941030 ldr r1, [r4, #48] ; 0x30 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; bf80: e2422001 sub r2, r2, #1 ++stats->frees; bf84: e2833001 add r3, r3, #1 stats->free_size += block_size; bf88: e0816006 add r6, r1, r6 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; bf8c: e5842040 str r2, [r4, #64] ; 0x40 ++stats->frees; bf90: e5843050 str r3, [r4, #80] ; 0x50 stats->free_size += block_size; bf94: e5846030 str r6, [r4, #48] ; 0x30 return( true ); bf98: e3a00001 mov r0, #1 bf9c: 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; bfa0: e3863001 orr r3, r6, #1 bfa4: e5853004 str r3, [r5, #4] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; bfa8: e2843038 add r3, r4, #56 ; 0x38 bfac: e8931008 ldm r3, {r3, ip} } 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; bfb0: 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; bfb4: e5941008 ldr r1, [r4, #8] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; bfb8: 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; bfbc: e3c00001 bic r0, r0, #1 next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { bfc0: e153000c cmp r3, ip new_block->next = next; bfc4: e5851008 str r1, [r5, #8] new_block->prev = block_before; bfc8: 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; bfcc: e5820004 str r0, [r2, #4] block_before->next = new_block; next->prev = new_block; bfd0: e581500c str r5, [r1, #12] next_block->prev_size = block_size; bfd4: 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; bfd8: e5845008 str r5, [r4, #8] /* Statistics */ ++stats->free_blocks; bfdc: e5843038 str r3, [r4, #56] ; 0x38 if ( stats->max_free_blocks < stats->free_blocks ) { stats->max_free_blocks = stats->free_blocks; bfe0: 8584303c strhi r3, [r4, #60] ; 0x3c bfe4: eaffffe2 b bf74 <_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; bfe8: e086c00c add ip, r6, ip prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; bfec: e38c3001 orr r3, ip, #1 bff0: e58a3004 str r3, [sl, #4] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; bff4: e5923004 ldr r3, [r2, #4] bff8: e3c33001 bic r3, r3, #1 bffc: e5823004 str r3, [r2, #4] next_block->prev_size = size; c000: e785c006 str ip, [r5, r6] c004: eaffffda b bf74 <_Heap_Free+0x12c> =============================================================================== 00013624 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 13624: e92d40f0 push {r4, r5, r6, r7, lr} 13628: e1a04000 mov r4, r0 1362c: e1a05001 mov r5, r1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 13630: e1a00001 mov r0, r1 13634: e5941010 ldr r1, [r4, #16] 13638: e1a07002 mov r7, r2 1363c: ebfff86c bl 117f4 <__umodsi3> 13640: 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 13644: 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); 13648: 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; 1364c: e1500003 cmp r0, r3 13650: 3a000010 bcc 13698 <_Heap_Size_of_alloc_area+0x74> 13654: e5942024 ldr r2, [r4, #36] ; 0x24 13658: e1500002 cmp r0, r2 1365c: 8a00000d bhi 13698 <_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; 13660: e5906004 ldr r6, [r0, #4] 13664: 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); 13668: 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; 1366c: e1530006 cmp r3, r6 13670: 8a000008 bhi 13698 <_Heap_Size_of_alloc_area+0x74> 13674: e1520006 cmp r2, r6 13678: 3a000008 bcc 136a0 <_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; 1367c: 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 ) 13680: e2100001 ands r0, r0, #1 ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 13684: 12655004 rsbne r5, r5, #4 13688: 10856006 addne r6, r5, r6 1368c: 15876000 strne r6, [r7] return true; 13690: 13a00001 movne r0, #1 13694: e8bd80f0 pop {r4, r5, r6, r7, pc} if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) ) { return false; 13698: e3a00000 mov r0, #0 1369c: e8bd80f0 pop {r4, r5, r6, r7, pc} 136a0: e3a00000 mov r0, #0 <== NOT EXECUTED } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; } 136a4: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED =============================================================================== 000079a4 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 79a4: 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() ) ) { 79a8: e59f35d8 ldr r3, [pc, #1496] ; 7f88 <_Heap_Walk+0x5e4> 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; 79ac: e31200ff tst r2, #255 ; 0xff if ( !_System_state_Is_up( _System_state_Get() ) ) { 79b0: 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; 79b4: e59f25d0 ldr r2, [pc, #1488] ; 7f8c <_Heap_Walk+0x5e8> 79b8: e59f95d0 ldr r9, [pc, #1488] ; 7f90 <_Heap_Walk+0x5ec> bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 79bc: 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; 79c0: 11a09002 movne r9, r2 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 79c4: 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() ) ) { 79c8: 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; 79cc: e5902014 ldr r2, [r0, #20] Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; 79d0: e5903024 ldr r3, [r0, #36] ; 0x24 bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 79d4: e24dd038 sub sp, sp, #56 ; 0x38 79d8: e1a04000 mov r4, r0 uintptr_t const page_size = heap->page_size; 79dc: e58d1024 str r1, [sp, #36] ; 0x24 uintptr_t const min_block_size = heap->min_block_size; 79e0: e58d2028 str r2, [sp, #40] ; 0x28 Heap_Block *const first_block = heap->first_block; 79e4: e5908020 ldr r8, [r0, #32] Heap_Block *const last_block = heap->last_block; 79e8: 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() ) ) { 79ec: 0a000002 beq 79fc <_Heap_Walk+0x58> } block = next_block; } while ( block != first_block ); return true; 79f0: e3a00001 mov r0, #1 } 79f4: e28dd038 add sp, sp, #56 ; 0x38 79f8: 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)( 79fc: e594101c ldr r1, [r4, #28] 7a00: e5900018 ldr r0, [r0, #24] 7a04: e2842008 add r2, r4, #8 7a08: e892000c ldm r2, {r2, r3} 7a0c: e59dc028 ldr ip, [sp, #40] ; 0x28 7a10: e58d1008 str r1, [sp, #8] 7a14: e59d102c ldr r1, [sp, #44] ; 0x2c 7a18: e58d0004 str r0, [sp, #4] 7a1c: e58d1010 str r1, [sp, #16] 7a20: e58d2014 str r2, [sp, #20] 7a24: e58d3018 str r3, [sp, #24] 7a28: e59f2564 ldr r2, [pc, #1380] ; 7f94 <_Heap_Walk+0x5f0> 7a2c: e58dc000 str ip, [sp] 7a30: e58d800c str r8, [sp, #12] 7a34: e1a0000a mov r0, sl 7a38: e3a01000 mov r1, #0 7a3c: e59d3024 ldr r3, [sp, #36] ; 0x24 7a40: e1a0e00f mov lr, pc 7a44: e12fff19 bx r9 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 7a48: e59d2024 ldr r2, [sp, #36] ; 0x24 7a4c: e3520000 cmp r2, #0 7a50: 0a000026 beq 7af0 <_Heap_Walk+0x14c> (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 7a54: e59d3024 ldr r3, [sp, #36] ; 0x24 7a58: e2135007 ands r5, r3, #7 7a5c: 1a00002a bne 7b0c <_Heap_Walk+0x168> RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 7a60: e59d0028 ldr r0, [sp, #40] ; 0x28 7a64: e59d1024 ldr r1, [sp, #36] ; 0x24 7a68: ebffe55c bl fe0 <__umodsi3> ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 7a6c: e250b000 subs fp, r0, #0 7a70: 1a00002c bne 7b28 <_Heap_Walk+0x184> 7a74: e2880008 add r0, r8, #8 7a78: e59d1024 ldr r1, [sp, #36] ; 0x24 7a7c: ebffe557 bl fe0 <__umodsi3> ); return false; } if ( 7a80: e2506000 subs r6, r0, #0 7a84: 1a00002f bne 7b48 <_Heap_Walk+0x1a4> block = next_block; } while ( block != first_block ); return true; } 7a88: e598b004 ldr fp, [r8, #4] ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 7a8c: e21b5001 ands r5, fp, #1 7a90: 0a0000fc beq 7e88 <_Heap_Walk+0x4e4> - 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; 7a94: e59dc02c ldr ip, [sp, #44] ; 0x2c 7a98: e59c3004 ldr r3, [ip, #4] 7a9c: 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); 7aa0: 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; 7aa4: e5935004 ldr r5, [r3, #4] ); return false; } if ( _Heap_Is_free( last_block ) ) { 7aa8: e2155001 ands r5, r5, #1 7aac: 0a000008 beq 7ad4 <_Heap_Walk+0x130> ); return false; } if ( 7ab0: e1580003 cmp r8, r3 7ab4: 0a00002b beq 7b68 <_Heap_Walk+0x1c4> _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 7ab8: e1a0000a mov r0, sl <== NOT EXECUTED 7abc: e3a01001 mov r1, #1 <== NOT EXECUTED 7ac0: e59f24d0 ldr r2, [pc, #1232] ; 7f98 <_Heap_Walk+0x5f4> <== NOT EXECUTED 7ac4: e1a0e00f mov lr, pc <== NOT EXECUTED 7ac8: 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; 7acc: e1a00006 mov r0, r6 <== NOT EXECUTED 7ad0: eaffffc7 b 79f4 <_Heap_Walk+0x50> <== NOT EXECUTED return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 7ad4: e1a0000a mov r0, sl 7ad8: e3a01001 mov r1, #1 7adc: e59f24b8 ldr r2, [pc, #1208] ; 7f9c <_Heap_Walk+0x5f8> 7ae0: e1a0e00f mov lr, pc 7ae4: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7ae8: e1a00005 mov r0, r5 7aec: eaffffc0 b 79f4 <_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" ); 7af0: e1a0000a mov r0, sl 7af4: e3a01001 mov r1, #1 7af8: e59f24a0 ldr r2, [pc, #1184] ; 7fa0 <_Heap_Walk+0x5fc> 7afc: e1a0e00f mov lr, pc 7b00: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7b04: e59d0024 ldr r0, [sp, #36] ; 0x24 7b08: eaffffb9 b 79f4 <_Heap_Walk+0x50> return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 7b0c: e1a0000a mov r0, sl 7b10: e3a01001 mov r1, #1 7b14: e59f2488 ldr r2, [pc, #1160] ; 7fa4 <_Heap_Walk+0x600> 7b18: e1a0e00f mov lr, pc 7b1c: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7b20: e3a00000 mov r0, #0 7b24: eaffffb2 b 79f4 <_Heap_Walk+0x50> return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 7b28: e1a0000a mov r0, sl 7b2c: e3a01001 mov r1, #1 7b30: e59f2470 ldr r2, [pc, #1136] ; 7fa8 <_Heap_Walk+0x604> 7b34: e59d3028 ldr r3, [sp, #40] ; 0x28 7b38: e1a0e00f mov lr, pc 7b3c: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7b40: e1a00005 mov r0, r5 7b44: eaffffaa b 79f4 <_Heap_Walk+0x50> } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 7b48: e1a0000a mov r0, sl 7b4c: e3a01001 mov r1, #1 7b50: e59f2454 ldr r2, [pc, #1108] ; 7fac <_Heap_Walk+0x608> 7b54: e1a03008 mov r3, r8 7b58: e1a0e00f mov lr, pc 7b5c: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7b60: e1a0000b mov r0, fp 7b64: eaffffa2 b 79f4 <_Heap_Walk+0x50> block = next_block; } while ( block != first_block ); return true; } 7b68: e5946008 ldr r6, [r4, #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 ) { 7b6c: e1540006 cmp r4, r6 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 7b70: 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 ) { 7b74: 05943020 ldreq r3, [r4, #32] 7b78: 0a00002c beq 7c30 <_Heap_Walk+0x28c> block = next_block; } while ( block != first_block ); return true; } 7b7c: 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; 7b80: e1530006 cmp r3, r6 7b84: 8a0000c6 bhi 7ea4 <_Heap_Walk+0x500> 7b88: e594c024 ldr ip, [r4, #36] ; 0x24 7b8c: e15c0006 cmp ip, r6 7b90: 3a0000c3 bcc 7ea4 <_Heap_Walk+0x500> RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 7b94: e2860008 add r0, r6, #8 7b98: e1a01007 mov r1, r7 7b9c: e58d3020 str r3, [sp, #32] 7ba0: e58dc01c str ip, [sp, #28] 7ba4: ebffe50d bl fe0 <__umodsi3> ); return false; } if ( 7ba8: e3500000 cmp r0, #0 7bac: e59d3020 ldr r3, [sp, #32] 7bb0: e59dc01c ldr ip, [sp, #28] 7bb4: 1a0000d8 bne 7f1c <_Heap_Walk+0x578> - 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; 7bb8: e5962004 ldr r2, [r6, #4] 7bbc: e3c22001 bic r2, r2, #1 block = next_block; } while ( block != first_block ); return true; } 7bc0: e0862002 add r2, r6, 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; 7bc4: e5922004 ldr r2, [r2, #4] ); return false; } if ( _Heap_Is_used( free_block ) ) { 7bc8: e3120001 tst r2, #1 7bcc: 1a0000db bne 7f40 <_Heap_Walk+0x59c> 7bd0: e58d8030 str r8, [sp, #48] ; 0x30 7bd4: e58db034 str fp, [sp, #52] ; 0x34 7bd8: e1a02004 mov r2, r4 7bdc: e1a08003 mov r8, r3 7be0: e1a0b00c mov fp, ip ); return false; } if ( free_block->prev != prev_block ) { 7be4: e596100c ldr r1, [r6, #12] 7be8: e1510002 cmp r1, r2 7bec: 1a0000dc bne 7f64 <_Heap_Walk+0x5c0> return false; } prev_block = free_block; free_block = free_block->next; 7bf0: e5965008 ldr r5, [r6, #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 ) { 7bf4: e1540005 cmp r4, r5 7bf8: 0a000009 beq 7c24 <_Heap_Walk+0x280> 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; 7bfc: e1580005 cmp r8, r5 7c00: 9a00007d bls 7dfc <_Heap_Walk+0x458> if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 7c04: e1a0000a mov r0, sl 7c08: e3a01001 mov r1, #1 7c0c: e59f239c ldr r2, [pc, #924] ; 7fb0 <_Heap_Walk+0x60c> 7c10: e1a03005 mov r3, r5 7c14: e1a0e00f mov lr, pc 7c18: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7c1c: e3a00000 mov r0, #0 7c20: eaffff73 b 79f4 <_Heap_Walk+0x50> 7c24: e1a03008 mov r3, r8 7c28: e28d8030 add r8, sp, #48 ; 0x30 7c2c: e8980900 ldm r8, {r8, fp} ); return false; } if ( _Heap_Is_used( free_block ) ) { 7c30: 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; 7c34: 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); 7c38: 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; 7c3c: e1530005 cmp r3, r5 7c40: 9a000008 bls 7c68 <_Heap_Walk+0x2c4> 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)( 7c44: e1a0000a mov r0, sl 7c48: e58d5000 str r5, [sp] 7c4c: e3a01001 mov r1, #1 7c50: e59f235c ldr r2, [pc, #860] ; 7fb4 <_Heap_Walk+0x610> 7c54: e1a03006 mov r3, r6 7c58: e1a0e00f mov lr, pc 7c5c: e12fff19 bx r9 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 7c60: e3a00000 mov r0, #0 7c64: eaffff62 b 79f4 <_Heap_Walk+0x50> 7c68: e5943024 ldr r3, [r4, #36] ; 0x24 7c6c: e1530005 cmp r3, r5 7c70: 3afffff3 bcc 7c44 <_Heap_Walk+0x2a0> RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 7c74: e59d1024 ldr r1, [sp, #36] ; 0x24 7c78: e1a00007 mov r0, r7 7c7c: ebffe4d7 bl fe0 <__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; 7c80: e59d102c ldr r1, [sp, #44] ; 0x2c 7c84: e0563001 subs r3, r6, r1 7c88: 13a03001 movne r3, #1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 7c8c: e3500000 cmp r0, #0 7c90: 0a000001 beq 7c9c <_Heap_Walk+0x2f8> 7c94: e3530000 cmp r3, #0 7c98: 1a000083 bne 7eac <_Heap_Walk+0x508> ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 7c9c: e59d2028 ldr r2, [sp, #40] ; 0x28 7ca0: e1520007 cmp r2, r7 7ca4: 9a000001 bls 7cb0 <_Heap_Walk+0x30c> 7ca8: e3530000 cmp r3, #0 7cac: 1a000087 bne 7ed0 <_Heap_Walk+0x52c> ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 7cb0: e1560005 cmp r6, r5 7cb4: 3a000001 bcc 7cc0 <_Heap_Walk+0x31c> 7cb8: e3530000 cmp r3, #0 7cbc: 1a00008d bne 7ef8 <_Heap_Walk+0x554> 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; 7cc0: e5953004 ldr r3, [r5, #4] ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 7cc4: e3130001 tst r3, #1 7cc8: e20bb001 and fp, fp, #1 7ccc: 0a000018 beq 7d34 <_Heap_Walk+0x390> if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 7cd0: e35b0000 cmp fp, #0 7cd4: 0a00000c beq 7d0c <_Heap_Walk+0x368> (*printer)( 7cd8: e58d7000 str r7, [sp] 7cdc: e1a0000a mov r0, sl 7ce0: e3a01000 mov r1, #0 7ce4: e59f22cc ldr r2, [pc, #716] ; 7fb8 <_Heap_Walk+0x614> 7ce8: e1a03006 mov r3, r6 7cec: e1a0e00f mov lr, pc 7cf0: e12fff19 bx r9 block->prev_size ); } block = next_block; } while ( block != first_block ); 7cf4: e1580005 cmp r8, r5 7cf8: 0affff3c beq 79f0 <_Heap_Walk+0x4c> 7cfc: e595b004 ldr fp, [r5, #4] 7d00: e5943020 ldr r3, [r4, #32] 7d04: e1a06005 mov r6, r5 7d08: eaffffc9 b 7c34 <_Heap_Walk+0x290> "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 7d0c: e58d7000 str r7, [sp] 7d10: e5963000 ldr r3, [r6] 7d14: e1a0000a mov r0, sl 7d18: e58d3004 str r3, [sp, #4] 7d1c: e1a0100b mov r1, fp 7d20: e59f2294 ldr r2, [pc, #660] ; 7fbc <_Heap_Walk+0x618> 7d24: e1a03006 mov r3, r6 7d28: e1a0e00f mov lr, pc 7d2c: e12fff19 bx r9 7d30: eaffffef b 7cf4 <_Heap_Walk+0x350> 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 ? 7d34: 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)( 7d38: e5943008 ldr r3, [r4, #8] 7d3c: e1530002 cmp r3, r2 block = next_block; } while ( block != first_block ); return true; } 7d40: 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)( 7d44: 059f0274 ldreq r0, [pc, #628] ; 7fc0 <_Heap_Walk+0x61c> 7d48: 0a000003 beq 7d5c <_Heap_Walk+0x3b8> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 7d4c: e59f3270 ldr r3, [pc, #624] ; 7fc4 <_Heap_Walk+0x620> 7d50: e1540002 cmp r4, r2 7d54: e59f026c ldr r0, [pc, #620] ; 7fc8 <_Heap_Walk+0x624> 7d58: 01a00003 moveq r0, r3 block->next, block->next == last_free_block ? 7d5c: 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)( 7d60: e1510003 cmp r1, r3 7d64: 059f1260 ldreq r1, [pc, #608] ; 7fcc <_Heap_Walk+0x628> 7d68: 0a000003 beq 7d7c <_Heap_Walk+0x3d8> " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 7d6c: e59fc25c ldr ip, [pc, #604] ; 7fd0 <_Heap_Walk+0x62c> 7d70: e1540003 cmp r4, r3 7d74: e59f124c ldr r1, [pc, #588] ; 7fc8 <_Heap_Walk+0x624> 7d78: 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)( 7d7c: e58d2004 str r2, [sp, #4] 7d80: e58d0008 str r0, [sp, #8] 7d84: e58d300c str r3, [sp, #12] 7d88: e58d1010 str r1, [sp, #16] 7d8c: e1a03006 mov r3, r6 7d90: e58d7000 str r7, [sp] 7d94: e1a0000a mov r0, sl 7d98: e3a01000 mov r1, #0 7d9c: e59f2230 ldr r2, [pc, #560] ; 7fd4 <_Heap_Walk+0x630> 7da0: e1a0e00f mov lr, pc 7da4: e12fff19 bx r9 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 7da8: e5953000 ldr r3, [r5] 7dac: e1570003 cmp r7, r3 7db0: 1a000021 bne 7e3c <_Heap_Walk+0x498> ); return false; } if ( !prev_used ) { 7db4: e35b0000 cmp fp, #0 7db8: 0a00002a beq 7e68 <_Heap_Walk+0x4c4> block = next_block; } while ( block != first_block ); return true; } 7dbc: 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 ) { 7dc0: e1540003 cmp r4, r3 7dc4: 0a000004 beq 7ddc <_Heap_Walk+0x438> if ( free_block == block ) { 7dc8: e1560003 cmp r6, r3 7dcc: 0affffc8 beq 7cf4 <_Heap_Walk+0x350> return true; } free_block = free_block->next; 7dd0: 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 ) { 7dd4: e1540003 cmp r4, r3 7dd8: 1afffffa bne 7dc8 <_Heap_Walk+0x424> return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 7ddc: e1a0000a mov r0, sl 7de0: e3a01001 mov r1, #1 7de4: e59f21ec ldr r2, [pc, #492] ; 7fd8 <_Heap_Walk+0x634> 7de8: e1a03006 mov r3, r6 7dec: e1a0e00f mov lr, pc 7df0: e12fff19 bx r9 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 7df4: e3a00000 mov r0, #0 7df8: eafffefd b 79f4 <_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; 7dfc: e155000b cmp r5, fp RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 7e00: e2850008 add r0, r5, #8 7e04: 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; 7e08: 8affff7d bhi 7c04 <_Heap_Walk+0x260> RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 7e0c: ebffe473 bl fe0 <__umodsi3> ); return false; } if ( 7e10: e3500000 cmp r0, #0 7e14: 1a000041 bne 7f20 <_Heap_Walk+0x57c> - 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; 7e18: e5953004 ldr r3, [r5, #4] 7e1c: e3c33001 bic r3, r3, #1 block = next_block; } while ( block != first_block ); return true; } 7e20: 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; 7e24: e5933004 ldr r3, [r3, #4] ); return false; } if ( _Heap_Is_used( free_block ) ) { 7e28: e3130001 tst r3, #1 7e2c: 1a000044 bne 7f44 <_Heap_Walk+0x5a0> 7e30: e1a02006 mov r2, r6 7e34: e1a06005 mov r6, r5 7e38: eaffff69 b 7be4 <_Heap_Walk+0x240> " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 7e3c: e58d3004 str r3, [sp, #4] 7e40: e1a0000a mov r0, sl 7e44: e58d7000 str r7, [sp] 7e48: e58d5008 str r5, [sp, #8] 7e4c: e3a01001 mov r1, #1 7e50: e59f2184 ldr r2, [pc, #388] ; 7fdc <_Heap_Walk+0x638> 7e54: e1a03006 mov r3, r6 7e58: e1a0e00f mov lr, pc 7e5c: e12fff19 bx r9 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 7e60: e3a00000 mov r0, #0 7e64: eafffee2 b 79f4 <_Heap_Walk+0x50> return false; } if ( !prev_used ) { (*printer)( 7e68: e1a0000a mov r0, sl 7e6c: e3a01001 mov r1, #1 7e70: e59f2168 ldr r2, [pc, #360] ; 7fe0 <_Heap_Walk+0x63c> 7e74: e1a03006 mov r3, r6 7e78: e1a0e00f mov lr, pc 7e7c: e12fff19 bx r9 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 7e80: e1a0000b mov r0, fp 7e84: eafffeda b 79f4 <_Heap_Walk+0x50> return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 7e88: e1a0000a mov r0, sl 7e8c: e3a01001 mov r1, #1 7e90: e59f214c ldr r2, [pc, #332] ; 7fe4 <_Heap_Walk+0x640> 7e94: e1a0e00f mov lr, pc 7e98: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7e9c: e1a00005 mov r0, r5 7ea0: eafffed3 b 79f4 <_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; 7ea4: e1a05006 mov r5, r6 <== NOT EXECUTED 7ea8: eaffff55 b 7c04 <_Heap_Walk+0x260> <== NOT EXECUTED return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 7eac: e1a0000a mov r0, sl 7eb0: e58d7000 str r7, [sp] 7eb4: e3a01001 mov r1, #1 7eb8: e59f2128 ldr r2, [pc, #296] ; 7fe8 <_Heap_Walk+0x644> 7ebc: e1a03006 mov r3, r6 7ec0: e1a0e00f mov lr, pc 7ec4: e12fff19 bx r9 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 7ec8: e3a00000 mov r0, #0 7ecc: eafffec8 b 79f4 <_Heap_Walk+0x50> } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 7ed0: e58d2004 str r2, [sp, #4] 7ed4: e1a0000a mov r0, sl 7ed8: e58d7000 str r7, [sp] 7edc: e3a01001 mov r1, #1 7ee0: e59f2104 ldr r2, [pc, #260] ; 7fec <_Heap_Walk+0x648> 7ee4: e1a03006 mov r3, r6 7ee8: e1a0e00f mov lr, pc 7eec: e12fff19 bx r9 block, block_size, min_block_size ); return false; 7ef0: e3a00000 mov r0, #0 7ef4: eafffebe b 79f4 <_Heap_Walk+0x50> } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 7ef8: e1a0000a mov r0, sl 7efc: e58d5000 str r5, [sp] 7f00: e3a01001 mov r1, #1 7f04: e59f20e4 ldr r2, [pc, #228] ; 7ff0 <_Heap_Walk+0x64c> 7f08: e1a03006 mov r3, r6 7f0c: e1a0e00f mov lr, pc 7f10: e12fff19 bx r9 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 7f14: e3a00000 mov r0, #0 7f18: eafffeb5 b 79f4 <_Heap_Walk+0x50> ); return false; } if ( 7f1c: e1a05006 mov r5, r6 <== NOT EXECUTED !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 7f20: e1a0000a mov r0, sl 7f24: e3a01001 mov r1, #1 7f28: e59f20c4 ldr r2, [pc, #196] ; 7ff4 <_Heap_Walk+0x650> 7f2c: e1a03005 mov r3, r5 7f30: e1a0e00f mov lr, pc 7f34: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7f38: e3a00000 mov r0, #0 7f3c: eafffeac b 79f4 <_Heap_Walk+0x50> ); return false; } if ( _Heap_Is_used( free_block ) ) { 7f40: e1a05006 mov r5, r6 <== NOT EXECUTED (*printer)( 7f44: e1a0000a mov r0, sl 7f48: e3a01001 mov r1, #1 7f4c: e59f20a4 ldr r2, [pc, #164] ; 7ff8 <_Heap_Walk+0x654> 7f50: e1a03005 mov r3, r5 7f54: e1a0e00f mov lr, pc 7f58: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7f5c: e3a00000 mov r0, #0 7f60: eafffea3 b 79f4 <_Heap_Walk+0x50> return false; } if ( free_block->prev != prev_block ) { (*printer)( 7f64: e58d1000 str r1, [sp] 7f68: e1a0000a mov r0, sl 7f6c: e3a01001 mov r1, #1 7f70: e59f2084 ldr r2, [pc, #132] ; 7ffc <_Heap_Walk+0x658> 7f74: e1a03006 mov r3, r6 7f78: e1a0e00f mov lr, pc 7f7c: e12fff19 bx r9 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 7f80: e3a00000 mov r0, #0 7f84: eafffe9a b 79f4 <_Heap_Walk+0x50> =============================================================================== 00006e80 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 6e80: 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 ) 6e84: e5904034 ldr r4, [r0, #52] ; 0x34 6e88: e3540000 cmp r4, #0 */ void _Objects_Extend_information( Objects_Information *information ) { 6e8c: e24dd014 sub sp, sp, #20 6e90: 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 ); 6e94: e1d070b8 ldrh r7, [r0, #8] index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 6e98: 0a00009b beq 710c <_Objects_Extend_information+0x28c> block_count = 0; else { block_count = information->maximum / information->allocation_size; 6e9c: e1d081b4 ldrh r8, [r0, #20] 6ea0: e1d0a1b0 ldrh sl, [r0, #16] 6ea4: e1a01008 mov r1, r8 6ea8: e1a0000a mov r0, sl 6eac: eb002a0a bl 116dc <__aeabi_uidiv> 6eb0: e1a03800 lsl r3, r0, #16 for ( ; block < block_count; block++ ) { 6eb4: e1b03823 lsrs r3, r3, #16 6eb8: 0a000099 beq 7124 <_Objects_Extend_information+0x2a4> if ( information->object_blocks[ block ] == NULL ) { 6ebc: e5949000 ldr r9, [r4] 6ec0: e3590000 cmp r9, #0 6ec4: 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 ); 6ec8: 01a06007 moveq r6, r7 index_base = minimum_index; block = 0; 6ecc: 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 ) { 6ed0: 0a00000c beq 6f08 <_Objects_Extend_information+0x88> 6ed4: e1a02004 mov r2, r4 6ed8: 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 ); 6edc: e1a06007 mov r6, r7 index_base = minimum_index; block = 0; 6ee0: e3a04000 mov r4, #0 6ee4: ea000002 b 6ef4 <_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 ) { 6ee8: e5b29004 ldr r9, [r2, #4]! 6eec: e3590000 cmp r9, #0 6ef0: 0a000004 beq 6f08 <_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++ ) { 6ef4: e2844001 add r4, r4, #1 6ef8: e1530004 cmp r3, r4 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 6efc: 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++ ) { 6f00: 8afffff8 bhi 6ee8 <_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; 6f04: e3a09001 mov r9, #1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 6f08: 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 ) { 6f0c: e35a0801 cmp sl, #65536 ; 0x10000 6f10: 2a000063 bcs 70a4 <_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 ) { 6f14: 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; 6f18: e5950018 ldr r0, [r5, #24] if ( information->auto_extend ) { 6f1c: 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; 6f20: e0000091 mul r0, r1, r0 if ( information->auto_extend ) { 6f24: 1a000060 bne 70ac <_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 ); 6f28: e58d3000 str r3, [sp] 6f2c: eb000879 bl 9118 <_Workspace_Allocate_or_fatal_error> 6f30: e59d3000 ldr r3, [sp] 6f34: e1a08000 mov r8, r0 } /* * Do we need to grow the tables? */ if ( do_extend ) { 6f38: e3590000 cmp r9, #0 6f3c: 0a000039 beq 7028 <_Objects_Extend_information+0x1a8> */ /* * Up the block count and maximum */ block_count++; 6f40: e283b001 add fp, r3, #1 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 6f44: e08b008b add r0, fp, fp, lsl #1 ((maximum + minimum_index) * sizeof(Objects_Control *)); 6f48: e08a0000 add r0, sl, r0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 6f4c: e0800007 add r0, r0, r7 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 6f50: e1a00100 lsl r0, r0, #2 6f54: e58d3000 str r3, [sp] 6f58: eb000864 bl 90f0 <_Workspace_Allocate> if ( !object_blocks ) { 6f5c: e2509000 subs r9, r0, #0 6f60: e59d3000 ldr r3, [sp] 6f64: 0a000073 beq 7138 <_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 ) { 6f68: e1d521b0 ldrh r2, [r5, #16] 6f6c: e1570002 cmp r7, r2 RTEMS_INLINE_ROUTINE void *_Addresses_Add_offset ( const void *base, uintptr_t offset ) { return (void *)((uintptr_t)base + offset); 6f70: e089c10b add ip, r9, fp, lsl #2 6f74: e089b18b add fp, r9, fp, lsl #3 6f78: 3a000051 bcc 70c4 <_Objects_Extend_information+0x244> } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 6f7c: e3570000 cmp r7, #0 6f80: 13a02000 movne r2, #0 6f84: 11a0100b movne r1, fp local_table[ index ] = NULL; 6f88: 11a00002 movne r0, r2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 6f8c: 0a000003 beq 6fa0 <_Objects_Extend_information+0x120> 6f90: e2822001 add r2, r2, #1 6f94: e1570002 cmp r7, r2 local_table[ index ] = NULL; 6f98: e4810004 str r0, [r1], #4 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 6f9c: 8afffffb bhi 6f90 <_Objects_Extend_information+0x110> 6fa0: 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 ); 6fa4: e1d511b4 ldrh r1, [r5, #20] 6fa8: e0861001 add r1, r6, r1 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 6fac: e3a00000 mov r0, #0 inactive_per_block[block_count] = 0; for ( index=index_base ; 6fb0: e1560001 cmp r6, r1 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 6fb4: e7890003 str r0, [r9, r3] inactive_per_block[block_count] = 0; 6fb8: e78c0003 str r0, [ip, r3] for ( index=index_base ; 6fbc: 2a000005 bcs 6fd8 <_Objects_Extend_information+0x158> 6fc0: e08b2106 add r2, fp, r6, lsl #2 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 6fc4: 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++ ) { 6fc8: 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 ; 6fcc: e1530001 cmp r3, r1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 6fd0: 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 ; 6fd4: 3afffffb bcc 6fc8 <_Objects_Extend_information+0x148> 6fd8: e10f3000 mrs r3, CPSR 6fdc: e3832080 orr r2, r3, #128 ; 0x80 6fe0: e129f002 msr CPSR_fc, r2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 6fe4: 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( 6fe8: e1d510b4 ldrh r1, [r5, #4] 6fec: 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; 6ff0: e1a0a80a lsl sl, sl, #16 6ff4: e3822801 orr r2, r2, #65536 ; 0x10000 6ff8: e1a0a82a lsr sl, sl, #16 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 6ffc: 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) | 7000: e182200a orr r2, r2, sl local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 7004: e5950034 ldr r0, [r5, #52] ; 0x34 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; 7008: e585c030 str ip, [r5, #48] ; 0x30 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 700c: e5859034 str r9, [r5, #52] ; 0x34 information->inactive_per_block = inactive_per_block; information->local_table = local_table; 7010: e585b01c str fp, [r5, #28] information->maximum = (Objects_Maximum) maximum; 7014: e1c5a1b0 strh sl, [r5, #16] information->maximum_id = _Objects_Build_id( 7018: e585200c str r2, [r5, #12] static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( 701c: e129f003 msr CPSR_fc, r3 information->maximum ); _ISR_Enable( level ); if ( old_tables ) 7020: e3500000 cmp r0, #0 _Workspace_Free( old_tables ); 7024: 1b000837 blne 9108 <_Workspace_Free> } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 7028: e5953034 ldr r3, [r5, #52] ; 0x34 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 702c: e28d7008 add r7, sp, #8 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 7030: e7838104 str r8, [r3, r4, lsl #2] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 7034: e1a01008 mov r1, r8 7038: e1a00007 mov r0, r7 703c: e1d521b4 ldrh r2, [r5, #20] 7040: e5953018 ldr r3, [r5, #24] 7044: eb00125f bl b9c8 <_Chain_Initialize> } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 7048: e1a04104 lsl r4, r4, #2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 704c: 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 ) { 7050: ea000009 b 707c <_Objects_Extend_information+0x1fc> 7054: e5953000 ldr r3, [r5] the_object->id = _Objects_Build_id( 7058: e1d520b4 ldrh r2, [r5, #4] 705c: e1a03c03 lsl r3, r3, #24 7060: e3833801 orr r3, r3, #65536 ; 0x10000 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 7064: 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) | 7068: e1833006 orr r3, r3, r6 706c: e5813008 str r3, [r1, #8] information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 7070: e1a00008 mov r0, r8 7074: ebfffce9 bl 6420 <_Chain_Append> index++; 7078: 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 ) { 707c: e1a00007 mov r0, r7 7080: ebfffcf9 bl 646c <_Chain_Get> 7084: e2501000 subs r1, r0, #0 7088: 1afffff1 bne 7054 <_Objects_Extend_information+0x1d4> index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 708c: e1d522bc ldrh r2, [r5, #44] ; 0x2c _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 7090: e1d531b4 ldrh r3, [r5, #20] 7094: e5951030 ldr r1, [r5, #48] ; 0x30 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 7098: e0832002 add r2, r3, r2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 709c: e7813004 str r3, [r1, r4] information->inactive = 70a0: e1c522bc strh r2, [r5, #44] ; 0x2c (Objects_Maximum)(information->inactive + information->allocation_size); } 70a4: e28dd014 add sp, sp, #20 70a8: 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 ); 70ac: e58d3000 str r3, [sp] 70b0: eb00080e bl 90f0 <_Workspace_Allocate> if ( !new_object_block ) 70b4: e2508000 subs r8, r0, #0 70b8: e59d3000 ldr r3, [sp] 70bc: 1affff9d bne 6f38 <_Objects_Extend_information+0xb8> 70c0: eafffff7 b 70a4 <_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, 70c4: e1a03103 lsl r3, r3, #2 70c8: e5951034 ldr r1, [r5, #52] ; 0x34 70cc: e1a02003 mov r2, r3 70d0: e88d1008 stm sp, {r3, ip} 70d4: eb001deb bl e888 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 70d8: e89d1008 ldm sp, {r3, ip} 70dc: e1a0000c mov r0, ip 70e0: e1a02003 mov r2, r3 70e4: e5951030 ldr r1, [r5, #48] ; 0x30 70e8: eb001de6 bl e888 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 70ec: e1d521b0 ldrh r2, [r5, #16] 70f0: 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, 70f4: e1a0000b mov r0, fp 70f8: e595101c ldr r1, [r5, #28] 70fc: e1a02102 lsl r2, r2, #2 7100: eb001de0 bl e888 7104: e89d1008 ldm sp, {r3, ip} 7108: eaffffa5 b 6fa4 <_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 ) 710c: e1d0a1b0 ldrh sl, [r0, #16] 7110: 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 ); 7114: 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; 7118: e3a09001 mov r9, #1 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 711c: e1a03004 mov r3, r4 7120: eaffff78 b 6f08 <_Objects_Extend_information+0x88> else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 7124: 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 ); 7128: 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; 712c: e3a09001 mov r9, #1 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 7130: e1a04003 mov r4, r3 <== NOT EXECUTED 7134: eaffff73 b 6f08 <_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 ); 7138: e1a00008 mov r0, r8 713c: eb0007f1 bl 9108 <_Workspace_Free> return; 7140: eaffffd7 b 70a4 <_Objects_Extend_information+0x224> =============================================================================== 000074b0 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 74b0: 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 ); 74b4: e1d040b8 ldrh r4, [r0, #8] block_count = (information->maximum - index_base) / 74b8: e1d051b4 ldrh r5, [r0, #20] */ void _Objects_Shrink_information( Objects_Information *information ) { 74bc: 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) / 74c0: e1d001b0 ldrh r0, [r0, #16] 74c4: e1a01005 mov r1, r5 74c8: e0640000 rsb r0, r4, r0 74cc: eb002882 bl 116dc <__aeabi_uidiv> information->allocation_size; for ( block = 0; block < block_count; block++ ) { 74d0: e3500000 cmp r0, #0 74d4: 08bd80f0 popeq {r4, r5, r6, r7, pc} if ( information->inactive_per_block[ block ] == 74d8: e5962030 ldr r2, [r6, #48] ; 0x30 74dc: e5923000 ldr r3, [r2] 74e0: 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++ ) { 74e4: 13a03000 movne r3, #0 if ( information->inactive_per_block[ block ] == 74e8: 1a000005 bne 7504 <_Objects_Shrink_information+0x54> 74ec: ea000008 b 7514 <_Objects_Shrink_information+0x64> <== NOT EXECUTED 74f0: e5b21004 ldr r1, [r2, #4]! 74f4: e1550001 cmp r5, r1 information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 74f8: e0844005 add r4, r4, r5 74fc: 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 ] == 7500: 0a000004 beq 7518 <_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++ ) { 7504: e2833001 add r3, r3, #1 7508: e1500003 cmp r0, r3 750c: 8afffff7 bhi 74f0 <_Objects_Shrink_information+0x40> 7510: e8bd80f0 pop {r4, r5, r6, r7, pc} if ( information->inactive_per_block[ block ] == 7514: e3a07000 mov r7, #0 <== NOT EXECUTED information->allocation_size ) { /* * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); 7518: e5960020 ldr r0, [r6, #32] 751c: ea000002 b 752c <_Objects_Shrink_information+0x7c> if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 7520: e3550000 cmp r5, #0 7524: 0a00000b beq 7558 <_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; 7528: e1a00005 mov r0, r5 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 752c: 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; if ((index >= index_base) && 7530: e1530004 cmp r3, r4 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; 7534: e5905000 ldr r5, [r0] if ((index >= index_base) && 7538: 3afffff8 bcc 7520 <_Objects_Shrink_information+0x70> (index < (index_base + information->allocation_size))) { 753c: e1d621b4 ldrh r2, [r6, #20] 7540: 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) && 7544: e1530002 cmp r3, r2 7548: 2afffff4 bcs 7520 <_Objects_Shrink_information+0x70> (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 754c: ebfffbbe bl 644c <_Chain_Extract> } } while ( the_object ); 7550: e3550000 cmp r5, #0 7554: 1afffff3 bne 7528 <_Objects_Shrink_information+0x78> /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 7558: e5963034 ldr r3, [r6, #52] ; 0x34 755c: e7930007 ldr r0, [r3, r7] 7560: eb0006e8 bl 9108 <_Workspace_Free> information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 7564: e1d602bc ldrh r0, [r6, #44] ; 0x2c 7568: 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; 756c: e5961034 ldr r1, [r6, #52] ; 0x34 information->inactive_per_block[ block ] = 0; 7570: e5962030 ldr r2, [r6, #48] ; 0x30 information->inactive -= information->allocation_size; 7574: 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; 7578: e7815007 str r5, [r1, r7] information->inactive_per_block[ block ] = 0; 757c: e7825007 str r5, [r2, r7] information->inactive -= information->allocation_size; 7580: e1c632bc strh r3, [r6, #44] ; 0x2c return; 7584: e8bd80f0 pop {r4, r5, r6, r7, pc} =============================================================================== 0000df4c <_POSIX_signals_Clear_process_signals>: static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( df4c: e10f2000 mrs r2, CPSR df50: e3823080 orr r3, r2, #128 ; 0x80 df54: e129f003 msr CPSR_fc, r3 mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { df58: e59f1050 ldr r1, [pc, #80] ; dfb0 <_POSIX_signals_Clear_process_signals+0x64> df5c: e0803080 add r3, r0, r0, lsl #1 df60: e1a03103 lsl r3, r3, #2 df64: e7911003 ldr r1, [r1, r3] df68: e3510002 cmp r1, #2 df6c: 0a000007 beq df90 <_POSIX_signals_Clear_process_signals+0x44> if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; df70: e59f303c ldr r3, [pc, #60] ; dfb4 <_POSIX_signals_Clear_process_signals+0x68> df74: e5931000 ldr r1, [r3] df78: e3a0c001 mov ip, #1 df7c: e2400001 sub r0, r0, #1 df80: e1c1001c bic r0, r1, ip, lsl r0 df84: e5830000 str r0, [r3] static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( df88: e129f002 msr CPSR_fc, r2 } _ISR_Enable( level ); } df8c: e12fff1e bx lr df90: e59f1020 ldr r1, [pc, #32] ; dfb8 <_POSIX_signals_Clear_process_signals+0x6c> RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); df94: e283c004 add ip, r3, #4 ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) df98: e7913003 ldr r3, [r1, r3] df9c: e08c1001 add r1, ip, r1 dfa0: e1530001 cmp r3, r1 dfa4: 0afffff1 beq df70 <_POSIX_signals_Clear_process_signals+0x24> dfa8: e129f002 msr CPSR_fc, r2 <== NOT EXECUTED } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); } dfac: e12fff1e bx lr <== NOT EXECUTED =============================================================================== 000230b0 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 230b0: e92d40f0 push {r4, r5, r6, r7, lr} /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 230b4: e5905010 ldr r5, [r0, #16] 230b8: e3c534ef bic r3, r5, #-285212672 ; 0xef000000 230bc: e3c338ff bic r3, r3, #16711680 ; 0xff0000 230c0: e3c33c7f bic r3, r3, #32512 ; 0x7f00 230c4: e3a0c201 mov ip, #268435456 ; 0x10000000 230c8: e3c330ff bic r3, r3, #255 ; 0xff 230cc: e28cc902 add ip, ip, #32768 ; 0x8000 230d0: e2417001 sub r7, r1, #1 230d4: e3a06001 mov r6, #1 230d8: e153000c cmp r3, ip bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 230dc: e1a04000 mov r4, r0 POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 230e0: e59030fc ldr r3, [r0, #252] ; 0xfc 230e4: e1a07716 lsl r7, r6, r7 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 230e8: 0a00001b beq 2315c <_POSIX_signals_Unblock_thread+0xac> } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 230ec: e59330d0 ldr r3, [r3, #208] ; 0xd0 230f0: e1d77003 bics r7, r7, r3 230f4: 0a000016 beq 23154 <_POSIX_signals_Unblock_thread+0xa4> * it is not blocked, THEN * we need to dispatch at the end of this ISR. * + Any other combination, do nothing. */ if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) { 230f8: e2157201 ands r7, r5, #268435456 ; 0x10000000 230fc: 0a000012 beq 2314c <_POSIX_signals_Unblock_thread+0x9c> */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 23100: e3c564ff bic r6, r5, #-16777216 ; 0xff000000 23104: e3c6673f bic r6, r6, #16515072 ; 0xfc0000 23108: e3c66c41 bic r6, r6, #16640 ; 0x4100 2310c: e3c6601f bic r6, r6, #31 the_thread->Wait.return_code = EINTR; 23110: e3a03004 mov r3, #4 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) 23114: e3560000 cmp r6, #0 * we need to dispatch at the end of this ISR. * + Any other combination, do nothing. */ if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) { the_thread->Wait.return_code = EINTR; 23118: e5803034 str r3, [r0, #52] ; 0x34 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) 2311c: 1a00002e bne 231dc <_POSIX_signals_Unblock_thread+0x12c> _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 23120: e2150008 ands r0, r5, #8 23124: 08bd80f0 popeq {r4, r5, r6, r7, pc} (void) _Watchdog_Remove( &the_thread->Timer ); 23128: e2840048 add r0, r4, #72 ; 0x48 2312c: ebffad17 bl e590 <_Watchdog_Remove> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 23130: e3a01201 mov r1, #268435456 ; 0x10000000 23134: e2811bff add r1, r1, #261120 ; 0x3fc00 23138: e1a00004 mov r0, r4 2313c: e2811ffe add r1, r1, #1016 ; 0x3f8 23140: ebffa80b bl d174 <_Thread_Clear_state> } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 23144: e1a00006 mov r0, r6 23148: e8bd80f0 pop {r4, r5, r6, r7, pc} else if ( _States_Is_delaying(the_thread->current_state) ) { (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 2314c: e3550000 cmp r5, #0 23150: 0a000016 beq 231b0 <_POSIX_signals_Unblock_thread+0x100> if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 23154: e1a00007 mov r0, r7 23158: e8bd80f0 pop {r4, r5, r6, r7, pc} * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 2315c: e5900030 ldr r0, [r0, #48] ; 0x30 23160: e1170000 tst r7, r0 23164: 0a00000d beq 231a0 <_POSIX_signals_Unblock_thread+0xf0> the_thread->Wait.return_code = EINTR; 23168: e3a03004 mov r3, #4 the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 2316c: e3520000 cmp r2, #0 */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { the_thread->Wait.return_code = EINTR; 23170: e5843034 str r3, [r4, #52] ; 0x34 the_info = (siginfo_t *) the_thread->Wait.return_argument; 23174: e5943028 ldr r3, [r4, #40] ; 0x28 if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; } else { *the_info = *info; 23178: 18920007 ldmne r2, {r0, r1, r2} the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 2317c: 05831000 streq r1, [r3] the_info->si_code = SI_USER; 23180: 03a01001 moveq r1, #1 the_info->si_value.sival_int = 0; } else { *the_info = *info; 23184: 18830007 stmne r3, {r0, r1, r2} the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 23188: 05831004 streq r1, [r3, #4] the_info->si_value.sival_int = 0; 2318c: 05832008 streq r2, [r3, #8] } else { *the_info = *info; } _Thread_queue_Extract_with_proxy( the_thread ); 23190: e1a00004 mov r0, r4 23194: ebffaa9e bl dc14 <_Thread_queue_Extract_with_proxy> return true; 23198: e3a00001 mov r0, #1 2319c: e8bd80f0 pop {r4, r5, r6, r7, pc} * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 231a0: e59300d0 ldr r0, [r3, #208] ; 0xd0 231a4: e1d70000 bics r0, r7, r0 231a8: 1affffee bne 23168 <_POSIX_signals_Unblock_thread+0xb8> 231ac: e8bd80f0 pop {r4, r5, r6, r7, pc} (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 231b0: e59f2030 ldr r2, [pc, #48] ; 231e8 <_POSIX_signals_Unblock_thread+0x138> 231b4: e5920000 ldr r0, [r2] 231b8: e3500000 cmp r0, #0 231bc: 08bd80f0 popeq {r4, r5, r6, r7, pc} 231c0: e5923004 ldr r3, [r2, #4] 231c4: e1540003 cmp r4, r3 _Thread_Dispatch_necessary = true; 231c8: 05c26010 strbeq r6, [r2, #16] } } return false; 231cc: 01a00005 moveq r0, r5 (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 231d0: 08bd80f0 popeq {r4, r5, r6, r7, pc} _Thread_Dispatch_necessary = true; } } return false; 231d4: e1a00005 mov r0, r5 <== NOT EXECUTED } 231d8: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 231dc: ebffaa8c bl dc14 <_Thread_queue_Extract_with_proxy> } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 231e0: e3a00000 mov r0, #0 231e4: e8bd80f0 pop {r4, r5, r6, r7, pc} =============================================================================== 00006aac <_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(); 6aac: e59f30b8 ldr r3, [pc, #184] ; 6b6c <_TOD_Validate+0xc0> */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 6ab0: 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) || 6ab4: 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(); 6ab8: 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; 6abc: 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) || 6ac0: 08bd8010 popeq {r4, pc} ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 6ac4: e3a0093d mov r0, #999424 ; 0xf4000 6ac8: e2800d09 add r0, r0, #576 ; 0x240 6acc: eb004a73 bl 194a0 <__aeabi_uidiv> rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 6ad0: e5943018 ldr r3, [r4, #24] 6ad4: e1500003 cmp r0, r3 6ad8: 9a00001f bls 6b5c <_TOD_Validate+0xb0> (the_tod->ticks >= ticks_per_second) || 6adc: e5943014 ldr r3, [r4, #20] 6ae0: e353003b cmp r3, #59 ; 0x3b 6ae4: 8a00001c bhi 6b5c <_TOD_Validate+0xb0> (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 6ae8: e5943010 ldr r3, [r4, #16] 6aec: e353003b cmp r3, #59 ; 0x3b 6af0: 8a000019 bhi 6b5c <_TOD_Validate+0xb0> (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 6af4: e594300c ldr r3, [r4, #12] 6af8: e3530017 cmp r3, #23 6afc: 8a000016 bhi 6b5c <_TOD_Validate+0xb0> (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 6b00: 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) || 6b04: e3500000 cmp r0, #0 6b08: 08bd8010 popeq {r4, pc} (the_tod->month == 0) || 6b0c: e350000c cmp r0, #12 6b10: 8a000011 bhi 6b5c <_TOD_Validate+0xb0> (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 6b14: e5942000 ldr r2, [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) || 6b18: e3a03d1f mov r3, #1984 ; 0x7c0 6b1c: e2833003 add r3, r3, #3 6b20: e1520003 cmp r2, r3 6b24: 9a00000c bls 6b5c <_TOD_Validate+0xb0> (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 6b28: 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) || 6b2c: e3540000 cmp r4, #0 6b30: 0a00000b beq 6b64 <_TOD_Validate+0xb8> (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 6b34: e3120003 tst r2, #3 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 6b38: 059f3030 ldreq r3, [pc, #48] ; 6b70 <_TOD_Validate+0xc4> else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 6b3c: 159f302c ldrne r3, [pc, #44] ; 6b70 <_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 ]; 6b40: 0280000d addeq r0, r0, #13 6b44: 07930100 ldreq r0, [r3, r0, lsl #2] else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 6b48: 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( 6b4c: e1500004 cmp r0, r4 6b50: 33a00000 movcc r0, #0 6b54: 23a00001 movcs r0, #1 6b58: 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; 6b5c: e3a00000 mov r0, #0 6b60: e8bd8010 pop {r4, pc} 6b64: e1a00004 mov r0, r4 <== NOT EXECUTED if ( the_tod->day > days_in_month ) return false; return true; } 6b68: e8bd8010 pop {r4, pc} <== NOT EXECUTED =============================================================================== 00008c78 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 8c78: e92d40f0 push {r4, r5, r6, r7, lr} return false; } } return true; } 8c7c: e59f5050 ldr r5, [pc, #80] ; 8cd4 <_User_extensions_Thread_create+0x5c> 8c80: e4954004 ldr r4, [r5], #4 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 8c84: e1540005 cmp r4, r5 #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 8c88: e1a06000 mov r6, r0 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 8c8c: 0a00000e beq 8ccc <_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)( 8c90: e59f7040 ldr r7, [pc, #64] ; 8cd8 <_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 ) { 8c94: e5943014 ldr r3, [r4, #20] 8c98: e3530000 cmp r3, #0 status = (*the_extension->Callouts.thread_create)( 8c9c: 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 ) { 8ca0: 0a000004 beq 8cb8 <_User_extensions_Thread_create+0x40> status = (*the_extension->Callouts.thread_create)( 8ca4: e5970004 ldr r0, [r7, #4] 8ca8: e1a0e00f mov lr, pc 8cac: e12fff13 bx r3 _Thread_Executing, the_thread ); if ( !status ) 8cb0: e3500000 cmp r0, #0 8cb4: 08bd80f0 popeq {r4, r5, r6, r7, pc} User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 8cb8: e5944000 ldr r4, [r4] { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 8cbc: e1540005 cmp r4, r5 8cc0: 1afffff3 bne 8c94 <_User_extensions_Thread_create+0x1c> if ( !status ) return false; } } return true; 8cc4: e3a00001 mov r0, #1 8cc8: e8bd80f0 pop {r4, r5, r6, r7, pc} 8ccc: e3a00001 mov r0, #1 <== NOT EXECUTED } 8cd0: e8bd80f0 pop {r4, r5, r6, r7, pc} <== NOT EXECUTED =============================================================================== 0000aafc <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { aafc: e92d41f0 push {r4, r5, r6, r7, r8, lr} ab00: e1a04000 mov r4, r0 ab04: e1a05002 mov r5, r2 static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( ab08: e10f2000 mrs r2, CPSR ab0c: e3823080 orr r3, r2, #128 ; 0x80 ab10: e129f003 msr CPSR_fc, r3 } } _ISR_Enable( level ); } ab14: e1a07000 mov r7, r0 ab18: e4973004 ldr r3, [r7], #4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { ab1c: e1530007 cmp r3, r7 ab20: 0a00001a beq ab90 <_Watchdog_Adjust+0x94> switch ( direction ) { ab24: e3510000 cmp r1, #0 ab28: 1a00001a bne ab98 <_Watchdog_Adjust+0x9c> case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { ab2c: e3550000 cmp r5, #0 ab30: 0a000016 beq ab90 <_Watchdog_Adjust+0x94> if ( units < _Watchdog_First( header )->delta_interval ) { ab34: e5936010 ldr r6, [r3, #16] ab38: e1550006 cmp r5, r6 ab3c: 21a01002 movcs r1, r2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; ab40: 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 ) { ab44: 2a000005 bcs ab60 <_Watchdog_Adjust+0x64> ab48: ea00001a b abb8 <_Watchdog_Adjust+0xbc> <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { ab4c: e0555006 subs r5, r5, r6 ab50: 0a00000d beq ab8c <_Watchdog_Adjust+0x90> if ( units < _Watchdog_First( header )->delta_interval ) { ab54: e5936010 ldr r6, [r3, #16] ab58: e1560005 cmp r6, r5 ab5c: 8a000014 bhi abb4 <_Watchdog_Adjust+0xb8> _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; ab60: e5838010 str r8, [r3, #16] static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( ab64: e129f001 msr CPSR_fc, r1 _ISR_Enable( level ); _Watchdog_Tickle( header ); ab68: e1a00004 mov r0, r4 ab6c: eb0000a4 bl ae04 <_Watchdog_Tickle> static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( ab70: e10f1000 mrs r1, CPSR ab74: e3813080 orr r3, r1, #128 ; 0x80 ab78: e129f003 msr CPSR_fc, r3 } } _ISR_Enable( level ); } ab7c: e5942000 ldr r2, [r4] _Watchdog_Tickle( header ); _ISR_Disable( level ); if ( _Chain_Is_empty( header ) ) ab80: e1570002 cmp r7, r2 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_First( Chain_Control *header ) { return ( (Watchdog_Control *) _Chain_First( header ) ); ab84: e1a03002 mov r3, r2 ab88: 1affffef bne ab4c <_Watchdog_Adjust+0x50> ab8c: e1a02001 mov r2, r1 static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( ab90: e129f002 msr CPSR_fc, r2 } } _ISR_Enable( level ); } ab94: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { ab98: e3510001 cmp r1, #1 ab9c: 1afffffb bne ab90 <_Watchdog_Adjust+0x94> case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; aba0: e5931010 ldr r1, [r3, #16] aba4: e0815005 add r5, r1, r5 aba8: e5835010 str r5, [r3, #16] abac: e129f002 msr CPSR_fc, r2 } } _ISR_Enable( level ); } abb0: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( abb4: e1a02001 mov r2, r1 _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; abb8: e0655006 rsb r5, r5, r6 abbc: e5835010 str r5, [r3, #16] break; abc0: eafffff2 b ab90 <_Watchdog_Adjust+0x94> =============================================================================== 000066f8 : ) { rtems_aio_request *req; int mode; if (op != O_SYNC) 66f8: e3500a02 cmp r0, #8192 ; 0x2000 int aio_fsync( int op, struct aiocb *aiocbp ) { 66fc: e92d4030 push {r4, r5, lr} 6700: e1a04001 mov r4, r1 rtems_aio_request *req; int mode; if (op != O_SYNC) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); 6704: 13a05016 movne r5, #22 ) { rtems_aio_request *req; int mode; if (op != O_SYNC) 6708: 1a000011 bne 6754 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 670c: e5910000 ldr r0, [r1] 6710: e3a01003 mov r1, #3 6714: eb001b35 bl d3f0 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6718: e2000003 and r0, r0, #3 671c: e2400001 sub r0, r0, #1 6720: e3500001 cmp r0, #1 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); 6724: 83a05009 movhi r5, #9 if (op != O_SYNC) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6728: 8a000009 bhi 6754 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 672c: e3a00018 mov r0, #24 6730: ebfff3fb bl 3724 if (req == NULL) 6734: e2503000 subs r3, r0, #0 6738: 0a000004 beq 6750 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 673c: e5834014 str r4, [r3, #20] req->aiocbp->aio_lio_opcode = LIO_SYNC; 6740: e3a03003 mov r3, #3 6744: e584302c str r3, [r4, #44] ; 0x2c return rtems_aio_enqueue (req); } 6748: e8bd4030 pop {r4, r5, lr} rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); 674c: ea000172 b 6d1c if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 6750: e3a0500b mov r5, #11 <== NOT EXECUTED 6754: e3e03000 mvn r3, #0 6758: e5845030 str r5, [r4, #48] ; 0x30 675c: e5843034 str r3, [r4, #52] ; 0x34 6760: eb002940 bl 10c68 <__errno> 6764: e5805000 str r5, [r0] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 6768: e3e00000 mvn r0, #0 676c: e8bd8030 pop {r4, r5, pc} =============================================================================== 00006f00 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 6f00: e92d4030 push {r4, r5, lr} rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 6f04: e3a01003 mov r1, #3 * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 6f08: e1a04000 mov r4, r0 rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 6f0c: e5900000 ldr r0, [r0] 6f10: eb001936 bl d3f0 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6f14: e2000003 and r0, r0, #3 6f18: e3500002 cmp r0, #2 6f1c: 13500000 cmpne r0, #0 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); 6f20: 13a05009 movne r5, #9 { rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6f24: 1a00000f bne 6f68 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 6f28: e5943014 ldr r3, [r4, #20] 6f2c: e3530000 cmp r3, #0 6f30: 1a000013 bne 6f84 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 6f34: e5943008 ldr r3, [r4, #8] 6f38: e3530000 cmp r3, #0 6f3c: ba000010 blt 6f84 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 6f40: e3a00018 mov r0, #24 6f44: ebfff1f6 bl 3724 if (req == NULL) 6f48: e2503000 subs r3, r0, #0 6f4c: 0a000004 beq 6f64 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 6f50: e5834014 str r4, [r3, #20] req->aiocbp->aio_lio_opcode = LIO_READ; 6f54: e3a03001 mov r3, #1 6f58: e584302c str r3, [r4, #44] ; 0x2c return rtems_aio_enqueue (req); } 6f5c: e8bd4030 pop {r4, r5, lr} rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); 6f60: eaffff6d b 6d1c if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 6f64: e3a0500b mov r5, #11 <== NOT EXECUTED 6f68: e3e03000 mvn r3, #0 6f6c: e5845030 str r5, [r4, #48] ; 0x30 6f70: e5843034 str r3, [r4, #52] ; 0x34 6f74: eb00273b bl 10c68 <__errno> 6f78: e5805000 str r5, [r0] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 6f7c: e3e00000 mvn r0, #0 6f80: e8bd8030 pop {r4, r5, pc} if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); 6f84: e3a05016 mov r5, #22 6f88: eafffff6 b 6f68 =============================================================================== 00006f94 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 6f94: e92d4030 push {r4, r5, lr} rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 6f98: e3a01003 mov r1, #3 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 6f9c: e1a04000 mov r4, r0 rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 6fa0: e5900000 ldr r0, [r0] 6fa4: eb001911 bl d3f0 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6fa8: e2000003 and r0, r0, #3 6fac: e2400001 sub r0, r0, #1 6fb0: e3500001 cmp r0, #1 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); 6fb4: 83a05009 movhi r5, #9 { rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 6fb8: 8a00000f bhi 6ffc rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 6fbc: e5943014 ldr r3, [r4, #20] 6fc0: e3530000 cmp r3, #0 6fc4: 1a000013 bne 7018 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 6fc8: e5943008 ldr r3, [r4, #8] 6fcc: e3530000 cmp r3, #0 6fd0: ba000010 blt 7018 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 6fd4: e3a00018 mov r0, #24 6fd8: ebfff1d1 bl 3724 if (req == NULL) 6fdc: e2503000 subs r3, r0, #0 6fe0: 0a000004 beq 6ff8 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 6fe4: e5834014 str r4, [r3, #20] req->aiocbp->aio_lio_opcode = LIO_WRITE; 6fe8: e3a03002 mov r3, #2 6fec: e584302c str r3, [r4, #44] ; 0x2c return rtems_aio_enqueue (req); } 6ff0: e8bd4030 pop {r4, r5, lr} rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); 6ff4: eaffff48 b 6d1c if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 6ff8: e3a0500b mov r5, #11 <== NOT EXECUTED 6ffc: e3e03000 mvn r3, #0 7000: e5845030 str r5, [r4, #48] ; 0x30 7004: e5843034 str r3, [r4, #52] ; 0x34 7008: eb002716 bl 10c68 <__errno> 700c: e5805000 str r5, [r0] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 7010: e3e00000 mvn r0, #0 7014: e8bd8030 pop {r4, r5, pc} if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); 7018: e3a05016 mov r5, #22 701c: eafffff6 b 6ffc =============================================================================== 00022da8 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 22da8: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr} 22dac: e24dd00c sub sp, sp, #12 22db0: e1a04000 mov r4, r0 22db4: e1a05001 mov r5, r1 22db8: e1a08002 mov r8, r2 POSIX_signals_Siginfo_node *psiginfo; /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) 22dbc: ebffff40 bl 22ac4 22dc0: e1500004 cmp r0, r4 22dc4: 1a000096 bne 23024 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 22dc8: e3550000 cmp r5, #0 22dcc: 0a000099 beq 23038 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 22dd0: e2454001 sub r4, r5, #1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 22dd4: e354001f cmp r4, #31 22dd8: 8a000096 bhi 23038 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 22ddc: e59f6280 ldr r6, [pc, #640] ; 23064 22de0: e1a07085 lsl r7, r5, #1 22de4: e0873005 add r3, r7, r5 22de8: e0863103 add r3, r6, r3, lsl #2 22dec: e5933008 ldr r3, [r3, #8] 22df0: e3530001 cmp r3, #1 return 0; 22df4: 03a00000 moveq r0, #0 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 22df8: 0a000039 beq 22ee4 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 22dfc: e3550008 cmp r5, #8 22e00: 13550004 cmpne r5, #4 22e04: 0a000038 beq 22eec 22e08: e355000b cmp r5, #11 22e0c: 0a000036 beq 22eec static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 22e10: e3a03001 mov r3, #1 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; 22e14: e58d3004 str r3, [sp, #4] /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 22e18: e58d5000 str r5, [sp] siginfo->si_code = SI_USER; if ( !value ) { 22e1c: e3580000 cmp r8, #0 22e20: e1a04413 lsl r4, r3, r4 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 22e24: 15983000 ldrne r3, [r8] 22e28: 158d3008 strne r3, [sp, #8] 22e2c: e59f3234 ldr r3, [pc, #564] ; 23068 22e30: e5932000 ldr r2, [r3] 22e34: e2822001 add r2, r2, #1 */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; if ( !value ) { siginfo->si_value.sival_int = 0; 22e38: 058d8008 streq r8, [sp, #8] 22e3c: e5832000 str r2, [r3] /* * Is the currently executing thread interested? If so then it will * get it an execute it as soon as the dispatcher executes. */ the_thread = _Thread_Executing; 22e40: e59f3224 ldr r3, [pc, #548] ; 2306c 22e44: e5930004 ldr r0, [r3, #4] api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 22e48: e59030fc ldr r3, [r0, #252] ; 0xfc 22e4c: e59330d0 ldr r3, [r3, #208] ; 0xd0 22e50: e1d43003 bics r3, r4, r3 22e54: 1a000014 bne 22eac } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); return 0; } 22e58: e59f1210 ldr r1, [pc, #528] ; 23070 22e5c: e4913004 ldr r3, [r1], #4 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 22e60: e1530001 cmp r3, r1 22e64: 0a000031 beq 22f30 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 22e68: e5932030 ldr r2, [r3, #48] ; 0x30 22e6c: e1140002 tst r4, r2 for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { the_thread = (Thread_Control *)the_node; 22e70: e1a00003 mov r0, r3 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 22e74: e59320fc ldr r2, [r3, #252] ; 0xfc #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 22e78: 0a000008 beq 22ea0 22e7c: ea00000a b 22eac the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 22e80: e5933000 ldr r3, [r3] /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 22e84: e1530001 cmp r3, r1 22e88: 0a000028 beq 22f30 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 22e8c: e5932030 ldr r2, [r3, #48] ; 0x30 <== NOT EXECUTED 22e90: e1140002 tst r4, r2 <== NOT EXECUTED for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { the_thread = (Thread_Control *)the_node; 22e94: e1a00003 mov r0, r3 <== NOT EXECUTED api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 22e98: e59320fc ldr r2, [r3, #252] ; 0xfc <== NOT EXECUTED #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 22e9c: 1a000002 bne 22eac <== NOT EXECUTED /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 22ea0: e59220d0 ldr r2, [r2, #208] ; 0xd0 22ea4: e1d42002 bics r2, r4, r2 22ea8: 0afffff4 beq 22e80 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 22eac: e1a01005 mov r1, r5 22eb0: e1a0200d mov r2, sp 22eb4: eb00007d bl 230b0 <_POSIX_signals_Unblock_thread> 22eb8: e3500000 cmp r0, #0 22ebc: 1a000006 bne 22edc * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 22ec0: e0875005 add r5, r7, r5 /* * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); 22ec4: e1a00004 mov r0, r4 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 22ec8: e1a05105 lsl r5, r5, #2 /* * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); 22ecc: eb00006d bl 23088 <_POSIX_signals_Set_process_signals> if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 22ed0: e7963005 ldr r3, [r6, r5] 22ed4: e3530002 cmp r3, #2 22ed8: 0a000007 beq 22efc _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 22edc: ebffa982 bl d4ec <_Thread_Enable_dispatch> return 0; 22ee0: e3a00000 mov r0, #0 } 22ee4: e28dd00c add sp, sp, #12 22ee8: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc} * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) return pthread_kill( pthread_self(), sig ); 22eec: eb0000f7 bl 232d0 22ef0: e1a01005 mov r1, r5 22ef4: eb0000bc bl 231ec 22ef8: eafffff9 b 22ee4 _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) _Chain_Get( &_POSIX_signals_Inactive_siginfo ); 22efc: e59f0170 ldr r0, [pc, #368] ; 23074 22f00: ebffa2d5 bl ba5c <_Chain_Get> if ( !psiginfo ) { 22f04: e250c000 subs ip, r0, #0 22f08: 0a00004f beq 2304c _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 22f0c: e1a0300d mov r3, sp 22f10: e8930007 ldm r3, {r0, r1, r2} 22f14: e28c3008 add r3, ip, #8 22f18: e8830007 stm r3, {r0, r1, r2} _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 22f1c: e59f0154 ldr r0, [pc, #340] ; 23078 22f20: e1a0100c mov r1, ip 22f24: e0800005 add r0, r0, r5 22f28: ebffa2b8 bl ba10 <_Chain_Append> 22f2c: eaffffea b 22edc * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 22f30: e59f3144 ldr r3, [pc, #324] ; 2307c 22f34: e5d3e000 ldrb lr, [r3] 22f38: e59fa140 ldr sl, [pc, #320] ; 23080 22f3c: e28ee001 add lr, lr, #1 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 22f40: e3a08000 mov r8, #0 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 22f44: e5ba3004 ldr r3, [sl, #4]! 22f48: e3530000 cmp r3, #0 22f4c: 0a000022 beq 22fdc continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 22f50: e5933004 ldr r3, [r3, #4] */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 22f54: e1d3c1b0 ldrh ip, [r3, #16] object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 22f58: e35c0000 cmp ip, #0 if ( !the_info ) continue; #endif maximum = the_info->maximum; object_table = the_info->local_table; 22f5c: e593101c ldr r1, [r3, #28] for ( index = 1 ; index <= maximum ; index++ ) { 22f60: 0a00001d beq 22fdc 22f64: e3a02001 mov r2, #1 the_thread = (Thread_Control *) object_table[ index ]; 22f68: e5b13004 ldr r3, [r1, #4]! if ( !the_thread ) 22f6c: e3530000 cmp r3, #0 22f70: 0a000016 beq 22fd0 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 22f74: e5930014 ldr r0, [r3, #20] 22f78: e150000e cmp r0, lr 22f7c: 8a000013 bhi 22fd0 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 22f80: e59390fc ldr r9, [r3, #252] ; 0xfc 22f84: e59990d0 ldr r9, [r9, #208] ; 0xd0 22f88: e1d49009 bics r9, r4, r9 22f8c: 0a00000f beq 22fd0 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 22f90: e150000e cmp r0, lr 22f94: 3a00001c bcc 2300c * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 22f98: e3580000 cmp r8, #0 22f9c: 0a00000b beq 22fd0 22fa0: e5989010 ldr r9, [r8, #16] 22fa4: e3590000 cmp r9, #0 22fa8: 0a000008 beq 22fd0 /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 22fac: e593b010 ldr fp, [r3, #16] 22fb0: e35b0000 cmp fp, #0 22fb4: 0a000014 beq 2300c continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 22fb8: e3190201 tst r9, #268435456 ; 0x10000000 22fbc: 1a000003 bne 22fd0 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 22fc0: e20bb201 and fp, fp, #268435456 ; 0x10000000 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 22fc4: e35b0000 cmp fp, #0 22fc8: 11a0e000 movne lr, r0 22fcc: 11a08003 movne r8, r3 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 22fd0: e2822001 add r2, r2, #1 22fd4: e15c0002 cmp ip, r2 22fd8: 2affffe2 bcs 22f68 * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 22fdc: e59f30a0 ldr r3, [pc, #160] ; 23084 22fe0: e15a0003 cmp sl, r3 22fe4: 1affffd6 bne 22f44 } } } } if ( interested ) { 22fe8: e3580000 cmp r8, #0 22fec: 0affffb3 beq 22ec0 22ff0: e1a00008 mov r0, r8 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 22ff4: e1a01005 mov r1, r5 22ff8: e1a0200d mov r2, sp 22ffc: eb00002b bl 230b0 <_POSIX_signals_Unblock_thread> 23000: e3500000 cmp r0, #0 23004: 0affffad beq 22ec0 23008: eaffffb3 b 22edc <== NOT EXECUTED #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2300c: e2822001 add r2, r2, #1 23010: e15c0002 cmp ip, r2 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 23014: e1a0e000 mov lr, r0 23018: e1a08003 mov r8, r3 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2301c: 2affffd1 bcs 22f68 23020: eaffffed b 22fdc /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 23024: ebffc1bd bl 13720 <__errno> 23028: e3a03003 mov r3, #3 2302c: e5803000 str r3, [r0] 23030: e3e00000 mvn r0, #0 23034: eaffffaa b 22ee4 */ if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 23038: ebffc1b8 bl 13720 <__errno> 2303c: e3a03016 mov r3, #22 23040: e5803000 str r3, [r0] 23044: e3e00000 mvn r0, #0 23048: eaffffa5 b 22ee4 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { _Thread_Enable_dispatch(); 2304c: ebffa926 bl d4ec <_Thread_Enable_dispatch> rtems_set_errno_and_return_minus_one( EAGAIN ); 23050: ebffc1b2 bl 13720 <__errno> 23054: e3a0300b mov r3, #11 23058: e5803000 str r3, [r0] 2305c: e3e00000 mvn r0, #0 23060: eaffff9f b 22ee4 =============================================================================== 0000acc8 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { if ( !attr || !attr->is_initialized ) acc8: e3500000 cmp r0, #0 accc: 0a00000e beq ad0c acd0: e5903000 ldr r3, [r0] acd4: e3530000 cmp r3, #0 acd8: 0a00000b beq ad0c return EINVAL; switch ( policy ) { acdc: e3510004 cmp r1, #4 ace0: 9a000001 bls acec case SCHED_SPORADIC: attr->schedpolicy = policy; return 0; default: return ENOTSUP; ace4: e3a00086 mov r0, #134 ; 0x86 } } ace8: e12fff1e bx lr ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { acec: e3a03001 mov r3, #1 acf0: e1a03113 lsl r3, r3, r1 acf4: e3130017 tst r3, #23 case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; acf8: 15801014 strne r1, [r0, #20] return 0; acfc: 13a00000 movne r0, #0 ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { ad00: 112fff1e bxne lr case SCHED_SPORADIC: attr->schedpolicy = policy; return 0; default: return ENOTSUP; ad04: e3a00086 mov r0, #134 ; 0x86 <== NOT EXECUTED } } ad08: e12fff1e bx lr <== NOT EXECUTED pthread_attr_t *attr, int policy ) { if ( !attr || !attr->is_initialized ) return EINVAL; ad0c: e3a00016 mov r0, #22 ad10: e12fff1e bx lr =============================================================================== 00007b7c : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { if ( !attr || !attr->is_initialized ) 7b7c: e3500000 cmp r0, #0 7b80: 0a000008 beq 7ba8 7b84: e5903000 ldr r3, [r0] 7b88: e3530000 cmp r3, #0 7b8c: 0a000005 beq 7ba8 return EINVAL; switch ( pshared ) { 7b90: e3510001 cmp r1, #1 case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 7b94: 95801004 strls r1, [r0, #4] return 0; 7b98: 93a00000 movls r0, #0 ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 7b9c: 912fff1e bxls lr case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; return 0; default: return EINVAL; 7ba0: e3a00016 mov r0, #22 <== NOT EXECUTED } } 7ba4: e12fff1e bx lr <== NOT EXECUTED pthread_mutexattr_t *attr, int pshared ) { if ( !attr || !attr->is_initialized ) return EINVAL; 7ba8: e3a00016 mov r0, #22 7bac: e12fff1e bx lr =============================================================================== 00006fd4 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 6fd4: e92d4030 push {r4, r5, lr} Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 6fd8: e2505000 subs r5, r0, #0 int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 6fdc: e24dd00c sub sp, sp, #12 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 6fe0: 0a00001d beq 705c * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 6fe4: e1a00001 mov r0, r1 6fe8: e28d1004 add r1, sp, #4 6fec: eb001a00 bl d7f4 <_POSIX_Absolute_timeout_to_ticks> 6ff0: e5951000 ldr r1, [r5] 6ff4: e1a04000 mov r4, r0 6ff8: e28d2008 add r2, sp, #8 6ffc: e59f0098 ldr r0, [pc, #152] ; 709c 7000: eb000aae bl 9ac0 <_Objects_Get> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 7004: e59d3008 ldr r3, [sp, #8] 7008: e3530000 cmp r3, #0 700c: 1a000012 bne 705c case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 7010: e5951000 ldr r1, [r5] int _EXFUN(pthread_rwlock_init, (pthread_rwlock_t *__rwlock, _CONST pthread_rwlockattr_t *__attr)); int _EXFUN(pthread_rwlock_destroy, (pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_rdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_tryrdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedrdlock, 7014: e3540003 cmp r4, #3 7018: 13a05000 movne r5, #0 701c: 03a05001 moveq r5, #1 7020: e58d3000 str r3, [sp] 7024: e2800010 add r0, r0, #16 7028: e1a02005 mov r2, r5 702c: e59d3004 ldr r3, [sp, #4] 7030: eb00073d bl 8d2c <_CORE_RWLock_Obtain_for_reading> do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 7034: eb000d80 bl a63c <_Thread_Enable_dispatch> if ( !do_wait ) { 7038: e3550000 cmp r5, #0 703c: 1a000011 bne 7088 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 7040: e59f3058 ldr r3, [pc, #88] ; 70a0 7044: e5933004 ldr r3, [r3, #4] 7048: e5930034 ldr r0, [r3, #52] ; 0x34 704c: e3500002 cmp r0, #2 7050: 0a000004 beq 7068 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7054: eb000046 bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code> 7058: ea000000 b 7060 _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) return EINVAL; 705c: e3a00016 mov r0, #22 case OBJECTS_ERROR: break; } return EINVAL; } 7060: e28dd00c add sp, sp, #12 7064: e8bd8030 pop {r4, r5, pc} ); _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 7068: e3540000 cmp r4, #0 706c: 0afffffa beq 705c return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 7070: e2444001 sub r4, r4, #1 7074: e3540001 cmp r4, #1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 7078: 93a00074 movls r0, #116 ; 0x74 _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 707c: 9afffff7 bls 7060 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7080: eb00003b bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code><== NOT EXECUTED 7084: eafffff5 b 7060 <== NOT EXECUTED ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 7088: e59f3010 ldr r3, [pc, #16] ; 70a0 708c: e5933004 ldr r3, [r3, #4] 7090: e5930034 ldr r0, [r3, #52] ; 0x34 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7094: eb000036 bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code> 7098: eafffff0 b 7060 =============================================================================== 000070a4 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 70a4: e92d4030 push {r4, r5, lr} Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 70a8: e2505000 subs r5, r0, #0 int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 70ac: e24dd00c sub sp, sp, #12 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 70b0: 0a00001d beq 712c * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 70b4: e1a00001 mov r0, r1 70b8: e28d1004 add r1, sp, #4 70bc: eb0019cc bl d7f4 <_POSIX_Absolute_timeout_to_ticks> 70c0: e5951000 ldr r1, [r5] 70c4: e1a04000 mov r4, r0 70c8: e28d2008 add r2, sp, #8 70cc: e59f0098 ldr r0, [pc, #152] ; 716c 70d0: eb000a7a bl 9ac0 <_Objects_Get> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 70d4: e59d3008 ldr r3, [sp, #8] 70d8: e3530000 cmp r3, #0 70dc: 1a000012 bne 712c case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 70e0: e5951000 ldr r1, [r5] (pthread_rwlock_t *__rwlock, _CONST struct timespec *__abstime)); int _EXFUN(pthread_rwlock_unlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_wrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_trywrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedwrlock, 70e4: e3540003 cmp r4, #3 70e8: 13a05000 movne r5, #0 70ec: 03a05001 moveq r5, #1 70f0: e58d3000 str r3, [sp] 70f4: e2800010 add r0, r0, #16 70f8: e1a02005 mov r2, r5 70fc: e59d3004 ldr r3, [sp, #4] 7100: eb000740 bl 8e08 <_CORE_RWLock_Obtain_for_writing> do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 7104: eb000d4c bl a63c <_Thread_Enable_dispatch> if ( !do_wait && 7108: e3550000 cmp r5, #0 710c: 1a000011 bne 7158 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 7110: e59f3058 ldr r3, [pc, #88] ; 7170 7114: e5933004 ldr r3, [r3, #4] 7118: e5930034 ldr r0, [r3, #52] ; 0x34 ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 711c: e3500002 cmp r0, #2 7120: 0a000004 beq 7138 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7124: eb000012 bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code> 7128: ea000000 b 7130 _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) return EINVAL; 712c: e3a00016 mov r0, #22 case OBJECTS_ERROR: break; } return EINVAL; } 7130: e28dd00c add sp, sp, #12 7134: e8bd8030 pop {r4, r5, pc} ); _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 7138: e3540000 cmp r4, #0 713c: 0afffffa beq 712c return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 7140: e2444001 sub r4, r4, #1 7144: e3540001 cmp r4, #1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 7148: 93a00074 movls r0, #116 ; 0x74 _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 714c: 9afffff7 bls 7130 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7150: eb000007 bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code><== NOT EXECUTED 7154: eafffff5 b 7130 <== NOT EXECUTED ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 7158: e59f3010 ldr r3, [pc, #16] ; 7170 715c: e5933004 ldr r3, [r3, #4] 7160: e5930034 ldr r0, [r3, #52] ; 0x34 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 7164: eb000002 bl 7174 <_POSIX_RWLock_Translate_core_RWLock_return_code> 7168: eafffff0 b 7130 =============================================================================== 0000790c : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { if ( !attr ) 790c: e3500000 cmp r0, #0 7910: 0a000008 beq 7938 return EINVAL; if ( !attr->is_initialized ) 7914: e5903000 ldr r3, [r0] 7918: e3530000 cmp r3, #0 791c: 0a000005 beq 7938 return EINVAL; switch ( pshared ) { 7920: e3510001 cmp r1, #1 case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 7924: 95801004 strls r1, [r0, #4] return 0; 7928: 93a00000 movls r0, #0 return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 792c: 912fff1e bxls lr case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; return 0; default: return EINVAL; 7930: e3a00016 mov r0, #22 } } 7934: e12fff1e bx lr <== NOT EXECUTED { if ( !attr ) return EINVAL; if ( !attr->is_initialized ) return EINVAL; 7938: e3a00016 mov r0, #22 793c: e12fff1e bx lr =============================================================================== 00006d1c : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 6d1c: e92d41f0 push {r4, r5, r6, r7, r8, lr} struct sched_param param; /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); 6d20: e59f41c4 ldr r4, [pc, #452] ; 6eec * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 6d24: e24dd024 sub sp, sp, #36 ; 0x24 6d28: e1a06000 mov r6, r0 struct sched_param param; /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); 6d2c: e1a00004 mov r0, r4 6d30: eb000256 bl 7690 if (result != 0) { 6d34: e2505000 subs r5, r0, #0 6d38: 1a00002a bne 6de8 return result; } /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); 6d3c: eb000486 bl 7f5c 6d40: e28d101c add r1, sp, #28 6d44: e1a0200d mov r2, sp 6d48: eb000380 bl 7b50 req->caller_thread = pthread_self (); 6d4c: eb000482 bl 7f5c req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 6d50: e5963014 ldr r3, [r6, #20] 6d54: e59dc000 ldr ip, [sp] 6d58: e5932014 ldr r2, [r3, #20] 6d5c: e062200c rsb r2, r2, ip req->policy = policy; req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 6d60: e5941068 ldr r1, [r4, #104] ; 0x68 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 6d64: e586200c str r2, [r6, #12] req->policy = policy; 6d68: e59d201c ldr r2, [sp, #28] req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 6d6c: e3510000 cmp r1, #0 we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; 6d70: e5862008 str r2, [r6, #8] req->aiocbp->error_code = EINPROGRESS; 6d74: e3a02077 mov r2, #119 ; 0x77 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); 6d78: e5860010 str r0, [r6, #16] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 6d7c: e5832030 str r2, [r3, #48] ; 0x30 req->aiocbp->return_value = 0; 6d80: e5835034 str r5, [r3, #52] ; 0x34 if ((aio_request_queue.idle_threads == 0) && 6d84: 1a000002 bne 6d94 6d88: e5942064 ldr r2, [r4, #100] ; 0x64 6d8c: e3520004 cmp r2, #4 6d90: da000017 ble 6df4 else { /* the maximum number of threads has been already created even though some of them might be idle. The request belongs to one of the active fd chain */ r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, 6d94: e59f0154 ldr r0, [pc, #340] ; 6ef0 6d98: e5931000 ldr r1, [r3] 6d9c: e3a02000 mov r2, #0 6da0: ebfffeb3 bl 6874 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 6da4: e2507000 subs r7, r0, #0 6da8: 0a00002e beq 6e68 { pthread_mutex_lock (&r_chain->mutex); 6dac: e287401c add r4, r7, #28 6db0: e1a00004 mov r0, r4 6db4: eb000235 bl 7690 rtems_aio_insert_prio (&r_chain->perfd, req); 6db8: e2870008 add r0, r7, #8 6dbc: e1a01006 mov r1, r6 6dc0: ebffff8f bl 6c04 pthread_cond_signal (&r_chain->cond); 6dc4: e2870020 add r0, r7, #32 6dc8: eb00011a bl 7238 pthread_mutex_unlock (&r_chain->mutex); 6dcc: e1a00004 mov r0, r4 6dd0: eb00024f bl 7714 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 6dd4: e59f0110 ldr r0, [pc, #272] ; 6eec 6dd8: eb00024d bl 7714 return 0; } 6ddc: e1a00005 mov r0, r5 6de0: e28dd024 add sp, sp, #36 ; 0x24 6de4: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); if (result != 0) { free (req); 6de8: e1a00006 mov r0, r6 <== NOT EXECUTED 6dec: ebfff0ad bl 30a8 <== NOT EXECUTED return result; 6df0: eafffff9 b 6ddc <== NOT EXECUTED if ((aio_request_queue.idle_threads == 0) && aio_request_queue.active_threads < AIO_MAX_THREADS) /* we still have empty places on the active_threads chain */ { chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 6df4: e5931000 ldr r1, [r3] 6df8: e2840048 add r0, r4, #72 ; 0x48 6dfc: e3a02001 mov r2, #1 6e00: ebfffe9b bl 6874 if (r_chain->new_fd == 1) { 6e04: e5903018 ldr r3, [r0, #24] 6e08: e3530001 cmp r3, #1 if ((aio_request_queue.idle_threads == 0) && aio_request_queue.active_threads < AIO_MAX_THREADS) /* we still have empty places on the active_threads chain */ { chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 6e0c: e1a07000 mov r7, r0 if (r_chain->new_fd == 1) { 6e10: 1affffe5 bne 6dac RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 6e14: e1a01006 mov r1, r6 6e18: e2800008 add r0, r0, #8 6e1c: eb0008a3 bl 90b0 <_Chain_Insert> rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 6e20: e1a01005 mov r1, r5 chain = &aio_request_queue.work_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); if (r_chain->new_fd == 1) { rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 6e24: e5875018 str r5, [r7, #24] pthread_mutex_init (&r_chain->mutex, NULL); 6e28: e287001c add r0, r7, #28 6e2c: eb0001c4 bl 7544 pthread_cond_init (&r_chain->cond, NULL); 6e30: e1a01005 mov r1, r5 6e34: e2870020 add r0, r7, #32 6e38: eb0000cd bl 7174 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 6e3c: e28d0020 add r0, sp, #32 6e40: e2841008 add r1, r4, #8 6e44: e59f20a8 ldr r2, [pc, #168] ; 6ef4 6e48: e1a03007 mov r3, r7 6e4c: eb000296 bl 78ac rtems_aio_handle, (void *) r_chain); if (result != 0) { 6e50: e2506000 subs r6, r0, #0 6e54: 1a000020 bne 6edc pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 6e58: e5943064 ldr r3, [r4, #100] ; 0x64 6e5c: e2833001 add r3, r3, #1 6e60: e5843064 str r3, [r4, #100] ; 0x64 6e64: eaffffda b 6dd4 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 6e68: e5963014 ldr r3, [r6, #20] 6e6c: e59f0084 ldr r0, [pc, #132] ; 6ef8 6e70: e5931000 ldr r1, [r3] 6e74: e3a02001 mov r2, #1 6e78: ebfffe7d bl 6874 if (r_chain->new_fd == 1) { 6e7c: e5903018 ldr r3, [r0, #24] 6e80: e3530001 cmp r3, #1 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 6e84: e1a08000 mov r8, r0 if (r_chain->new_fd == 1) { 6e88: 0a000008 beq 6eb0 r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); pthread_cond_init (&r_chain->cond, NULL); } else /* just insert the request in the existing fd chain */ rtems_aio_insert_prio (&r_chain->perfd, req); 6e8c: e2800008 add r0, r0, #8 6e90: e1a01006 mov r1, r6 6e94: ebffff5a bl 6c04 if (aio_request_queue.idle_threads > 0) 6e98: e5943068 ldr r3, [r4, #104] ; 0x68 6e9c: e3530000 cmp r3, #0 6ea0: daffffcb ble 6dd4 pthread_cond_signal (&aio_request_queue.new_req); 6ea4: e59f0050 ldr r0, [pc, #80] ; 6efc <== NOT EXECUTED 6ea8: eb0000e2 bl 7238 <== NOT EXECUTED 6eac: eaffffc8 b 6dd4 <== NOT EXECUTED 6eb0: e1a01006 mov r1, r6 6eb4: e2800008 add r0, r0, #8 6eb8: eb00087c bl 90b0 <_Chain_Insert> /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; pthread_mutex_init (&r_chain->mutex, NULL); 6ebc: e1a01007 mov r1, r7 if (r_chain->new_fd == 1) { /* If this is a new fd chain we signal the idle threads that might be waiting for requests */ AIO_printf (" New chain on waiting queue \n "); rtems_chain_prepend (&r_chain->perfd, &req->next_prio); r_chain->new_fd = 0; 6ec0: e5887018 str r7, [r8, #24] pthread_mutex_init (&r_chain->mutex, NULL); 6ec4: e288001c add r0, r8, #28 6ec8: eb00019d bl 7544 pthread_cond_init (&r_chain->cond, NULL); 6ecc: e2880020 add r0, r8, #32 6ed0: e1a01007 mov r1, r7 6ed4: eb0000a6 bl 7174 6ed8: eaffffee b 6e98 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, rtems_aio_handle, (void *) r_chain); if (result != 0) { pthread_mutex_unlock (&aio_request_queue.mutex); 6edc: e1a00004 mov r0, r4 <== NOT EXECUTED 6ee0: eb00020b bl 7714 <== NOT EXECUTED return result; 6ee4: e1a05006 mov r5, r6 <== NOT EXECUTED 6ee8: eaffffbb b 6ddc <== NOT EXECUTED =============================================================================== 00006998 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 6998: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr} 699c: e24dd02c sub sp, sp, #44 ; 0x2c 69a0: e1a05000 mov r5, r0 69a4: e280601c add r6, r0, #28 node = rtems_chain_first (chain); req = (rtems_aio_request *) node; /* See _POSIX_PRIORITIZE_IO and _POSIX_PRIORITY_SCHEDULING discussion in rtems_aio_enqueue () */ pthread_getschedparam (pthread_self(), &policy, ¶m); 69a8: e28d8028 add r8, sp, #40 ; 0x28 69ac: e28d7004 add r7, sp, #4 if (result == -1) { req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; req->aiocbp->error_code = 0; 69b0: e3a09000 mov r9, #0 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 69b4: e1a00006 mov r0, r6 69b8: eb000334 bl 7690 if (result != 0) 69bc: e250a000 subs sl, r0, #0 69c0: 1a000022 bne 6a50 } } AIO_printf ("Thread finished\n"); return NULL; } 69c4: e5954008 ldr r4, [r5, #8] RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 69c8: e285300c add r3, r5, #12 /* If the locked chain is not empty, take the first request extract it, unlock the chain and process the request, in this way the user can supply more requests to this fd chain */ if (!rtems_chain_is_empty (chain)) { 69cc: e1540003 cmp r4, r3 69d0: 0a000039 beq 6abc node = rtems_chain_first (chain); req = (rtems_aio_request *) node; /* See _POSIX_PRIORITIZE_IO and _POSIX_PRIORITY_SCHEDULING discussion in rtems_aio_enqueue () */ pthread_getschedparam (pthread_self(), &policy, ¶m); 69d4: eb000560 bl 7f5c 69d8: e1a01008 mov r1, r8 69dc: e1a02007 mov r2, r7 69e0: eb00045a bl 7b50 param.sched_priority = req->priority; 69e4: e594300c ldr r3, [r4, #12] 69e8: e58d3004 str r3, [sp, #4] pthread_setschedparam (pthread_self(), req->policy, ¶m); 69ec: eb00055a bl 7f5c 69f0: e5941008 ldr r1, [r4, #8] 69f4: e1a02007 mov r2, r7 69f8: eb00055c bl 7f70 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 69fc: e1a00004 mov r0, r4 6a00: eb000995 bl 905c <_Chain_Extract> rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 6a04: e1a00006 mov r0, r6 6a08: eb000341 bl 7714 switch (req->aiocbp->aio_lio_opcode) { 6a0c: e594a014 ldr sl, [r4, #20] 6a10: e59a302c ldr r3, [sl, #44] ; 0x2c 6a14: e3530002 cmp r3, #2 6a18: 0a00001f beq 6a9c 6a1c: e3530003 cmp r3, #3 6a20: 0a00001a beq 6a90 6a24: e3530001 cmp r3, #1 6a28: 0a00000b beq 6a5c default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 6a2c: e3e01000 mvn r1, #0 <== NOT EXECUTED 6a30: e58a1034 str r1, [sl, #52] ; 0x34 <== NOT EXECUTED req->aiocbp->error_code = errno; 6a34: eb00288b bl 10c68 <__errno> <== NOT EXECUTED 6a38: e5903000 ldr r3, [r0] <== NOT EXECUTED /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 6a3c: e1a00006 mov r0, r6 <== NOT EXECUTED default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; 6a40: e58a3030 str r3, [sl, #48] ; 0x30 <== NOT EXECUTED /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 6a44: eb000311 bl 7690 <== NOT EXECUTED if (result != 0) 6a48: e250a000 subs sl, r0, #0 <== NOT EXECUTED 6a4c: 0affffdc beq 69c4 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 6a50: e3a00000 mov r0, #0 6a54: e28dd02c add sp, sp, #44 ; 0x2c 6a58: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc} pthread_mutex_unlock (&r_chain->mutex); switch (req->aiocbp->aio_lio_opcode) { case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 6a5c: e59ac008 ldr ip, [sl, #8] 6a60: e59a0000 ldr r0, [sl] 6a64: e28a100c add r1, sl, #12 6a68: e8910006 ldm r1, {r1, r2} 6a6c: e59a3004 ldr r3, [sl, #4] 6a70: e58dc000 str ip, [sp] 6a74: eb002b7f bl 11878 break; default: result = -1; } if (result == -1) { 6a78: e3700001 cmn r0, #1 6a7c: 0a000056 beq 6bdc req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 6a80: e5943014 ldr r3, [r4, #20] 6a84: e5830034 str r0, [r3, #52] ; 0x34 req->aiocbp->error_code = 0; 6a88: e5839030 str r9, [r3, #48] ; 0x30 6a8c: eaffffc8 b 69b4 req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 6a90: e59a0000 ldr r0, [sl] <== NOT EXECUTED 6a94: eb001ad3 bl d5e8 <== NOT EXECUTED break; 6a98: eafffff6 b 6a78 <== NOT EXECUTED req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 6a9c: e59ac008 ldr ip, [sl, #8] 6aa0: e59a0000 ldr r0, [sl] 6aa4: e28a100c add r1, sl, #12 6aa8: e8910006 ldm r1, {r1, r2} 6aac: e59a3004 ldr r3, [sl, #4] 6ab0: e58dc000 str ip, [sp] 6ab4: eb002bb9 bl 119a0 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 6ab8: eaffffee b 6a78 struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); 6abc: e59fb138 ldr fp, [pc, #312] ; 6bfc struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); 6ac0: e1a00006 mov r0, r6 6ac4: eb000312 bl 7714 pthread_mutex_lock (&aio_request_queue.mutex); 6ac8: e1a0000b mov r0, fp 6acc: eb0002ef bl 7690 if (rtems_chain_is_empty (chain)) 6ad0: e5953008 ldr r3, [r5, #8] 6ad4: e1540003 cmp r4, r3 6ad8: 0a000002 beq 6ae8 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 6adc: e59f0118 ldr r0, [pc, #280] ; 6bfc 6ae0: eb00030b bl 7714 6ae4: eaffffb2 b 69b4 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 6ae8: e28d1020 add r1, sp, #32 6aec: e3a00001 mov r0, #1 6af0: eb00014a bl 7020 timeout.tv_sec += 3; 6af4: e59d3020 ldr r3, [sp, #32] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 6af8: e2854020 add r4, r5, #32 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 6afc: e2833003 add r3, r3, #3 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 6b00: e1a00004 mov r0, r4 6b04: e1a0100b mov r1, fp 6b08: e28d2020 add r2, sp, #32 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 6b0c: e58d3020 str r3, [sp, #32] timeout.tv_nsec = 0; 6b10: e58da024 str sl, [sp, #36] ; 0x24 result = pthread_cond_timedwait (&r_chain->cond, 6b14: eb0001e1 bl 72a0 &aio_request_queue.mutex, &timeout); /* If no requests were added to the chain we delete the fd chain from the queue and start working with idle fd chains */ if (result == ETIMEDOUT) { 6b18: e3500074 cmp r0, #116 ; 0x74 6b1c: 1affffee bne 6adc 6b20: e1a00005 mov r0, r5 6b24: eb00094c bl 905c <_Chain_Extract> rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 6b28: e1a00006 mov r0, r6 6b2c: eb000234 bl 7404 pthread_cond_destroy (&r_chain->cond); 6b30: e1a00004 mov r0, r4 6b34: eb00015b bl 70a8 free (r_chain); 6b38: e1a00005 mov r0, r5 6b3c: ebfff159 bl 30a8 } } AIO_printf ("Thread finished\n"); return NULL; } 6b40: e59b5054 ldr r5, [fp, #84] ; 0x54 pthread_cond_destroy (&r_chain->cond); free (r_chain); /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 6b44: e59f20b4 ldr r2, [pc, #180] ; 6c00 6b48: e1550002 cmp r5, r2 6b4c: 0a00000d beq 6b88 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 6b50: e59f30a4 ldr r3, [pc, #164] ; 6bfc 6b54: e5932068 ldr r2, [r3, #104] ; 0x68 ++aio_request_queue.active_threads; 6b58: e5933064 ldr r3, [r3, #100] ; 0x64 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 6b5c: e59fc098 ldr ip, [pc, #152] ; 6bfc 6b60: e2422001 sub r2, r2, #1 ++aio_request_queue.active_threads; 6b64: e2833001 add r3, r3, #1 6b68: e1a00005 mov r0, r5 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 6b6c: e58c2068 str r2, [ip, #104] ; 0x68 ++aio_request_queue.active_threads; 6b70: e58c3064 str r3, [ip, #100] ; 0x64 6b74: eb000938 bl 905c <_Chain_Extract> node = rtems_chain_first (&aio_request_queue.idle_req); rtems_chain_extract (node); r_chain = (rtems_aio_request_chain *) node; rtems_aio_move_to_work (r_chain); 6b78: e1a00005 mov r0, r5 6b7c: ebffff6f bl 6940 6b80: e285601c add r6, r5, #28 6b84: eaffffd4 b 6adc /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 6b88: e59b2068 ldr r2, [fp, #104] ; 0x68 --aio_request_queue.active_threads; 6b8c: e59b3064 ldr r3, [fp, #100] ; 0x64 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 6b90: e2822001 add r2, r2, #1 --aio_request_queue.active_threads; 6b94: e2433001 sub r3, r3, #1 clock_gettime (CLOCK_REALTIME, &timeout); 6b98: e28d1020 add r1, sp, #32 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 6b9c: e58b2068 str r2, [fp, #104] ; 0x68 --aio_request_queue.active_threads; 6ba0: e58b3064 str r3, [fp, #100] ; 0x64 clock_gettime (CLOCK_REALTIME, &timeout); 6ba4: e3a00001 mov r0, #1 6ba8: eb00011c bl 7020 timeout.tv_sec += 3; 6bac: e59d3020 ldr r3, [sp, #32] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 6bb0: e28b0004 add r0, fp, #4 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 6bb4: e2833003 add r3, r3, #3 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 6bb8: e1a0100b mov r1, fp 6bbc: e28d2020 add r2, sp, #32 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 6bc0: e58d3020 str r3, [sp, #32] timeout.tv_nsec = 0; 6bc4: e58da024 str sl, [sp, #36] ; 0x24 result = pthread_cond_timedwait (&aio_request_queue.new_req, 6bc8: eb0001b4 bl 72a0 &aio_request_queue.mutex, &timeout); /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { 6bcc: e3500074 cmp r0, #116 ; 0x74 6bd0: 0a000003 beq 6be4 6bd4: e59b5054 ldr r5, [fp, #84] ; 0x54 <== NOT EXECUTED 6bd8: eaffffdc b 6b50 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 6bdc: e594a014 ldr sl, [r4, #20] <== NOT EXECUTED 6be0: eaffff91 b 6a2c <== NOT EXECUTED /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 6be4: e59b3068 ldr r3, [fp, #104] ; 0x68 6be8: e2433001 sub r3, r3, #1 pthread_mutex_unlock (&aio_request_queue.mutex); 6bec: e1a0000b mov r0, fp /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 6bf0: e58b3068 str r3, [fp, #104] ; 0x68 pthread_mutex_unlock (&aio_request_queue.mutex); 6bf4: eb0002c6 bl 7714 return NULL; 6bf8: eaffff94 b 6a50 =============================================================================== 00006770 : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 6770: e92d4070 push {r4, r5, r6, lr} int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 6774: e59f00e8 ldr r0, [pc, #232] ; 6864 6778: eb00042b bl 782c if (result != 0) 677c: e2505000 subs r5, r0, #0 6780: 0a000001 beq 678c aio_request_queue.active_threads = 0; aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; return result; } 6784: e1a00005 mov r0, r5 <== NOT EXECUTED 6788: e8bd8070 pop {r4, r5, r6, pc} <== NOT EXECUTED result = pthread_attr_init (&aio_request_queue.attr); if (result != 0) return result; result = 678c: e59f00d0 ldr r0, [pc, #208] ; 6864 6790: e1a01005 mov r1, r5 6794: eb000437 bl 7878 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 6798: e3500000 cmp r0, #0 679c: 1a00001c bne 6814 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 67a0: e59f40c0 ldr r4, [pc, #192] ; 6868 67a4: e3a01000 mov r1, #0 67a8: e1a00004 mov r0, r4 67ac: eb000364 bl 7544 if (result != 0) 67b0: e3500000 cmp r0, #0 67b4: 1a00001e bne 6834 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 67b8: e59f00ac ldr r0, [pc, #172] ; 686c 67bc: e3a01000 mov r1, #0 67c0: eb00026b bl 7174 if (result != 0) { 67c4: e2505000 subs r5, r0, #0 67c8: 1a000020 bne 6850 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 67cc: e59f209c ldr r2, [pc, #156] ; 6870 rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 67d0: e3a01a0b mov r1, #45056 ; 0xb000 head->previous = NULL; 67d4: e3a03000 mov r3, #0 tail->previous = head; 67d8: e2820008 add r0, r2, #8 67dc: e2426004 sub r6, r2, #4 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 67e0: e282c00c add ip, r2, #12 67e4: e281100b add r1, r1, #11 head->previous = NULL; tail->previous = head; 67e8: e584005c str r0, [r4, #92] ; 0x5c ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 67ec: e5842048 str r2, [r4, #72] ; 0x48 head->previous = NULL; 67f0: e584304c str r3, [r4, #76] ; 0x4c tail->previous = head; 67f4: e5846050 str r6, [r4, #80] ; 0x50 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 67f8: e584c054 str ip, [r4, #84] ; 0x54 head->previous = NULL; 67fc: e5843058 str r3, [r4, #88] ; 0x58 } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 6800: e5843064 str r3, [r4, #100] ; 0x64 aio_request_queue.idle_threads = 0; 6804: e5843068 str r3, [r4, #104] ; 0x68 aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 6808: e5841060 str r1, [r4, #96] ; 0x60 return result; } 680c: e1a00005 mov r0, r5 6810: e8bd8070 pop {r4, r5, r6, pc} PTHREAD_CREATE_DETACHED); if (result != 0) pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 6814: e59f404c ldr r4, [pc, #76] ; 6868 <== NOT EXECUTED result = pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) pthread_attr_destroy (&aio_request_queue.attr); 6818: e59f0044 ldr r0, [pc, #68] ; 6864 <== NOT EXECUTED 681c: eb0003f9 bl 7808 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 6820: e3a01000 mov r1, #0 <== NOT EXECUTED 6824: e1a00004 mov r0, r4 <== NOT EXECUTED 6828: eb000345 bl 7544 <== NOT EXECUTED if (result != 0) 682c: e3500000 cmp r0, #0 <== NOT EXECUTED 6830: 0affffe0 beq 67b8 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 6834: e2840008 add r0, r4, #8 <== NOT EXECUTED 6838: eb0003f2 bl 7808 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 683c: e59f0028 ldr r0, [pc, #40] ; 686c <== NOT EXECUTED 6840: e3a01000 mov r1, #0 <== NOT EXECUTED 6844: eb00024a bl 7174 <== NOT EXECUTED if (result != 0) { 6848: e2505000 subs r5, r0, #0 <== NOT EXECUTED 684c: 0affffde beq 67cc <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 6850: e59f0010 ldr r0, [pc, #16] ; 6868 <== NOT EXECUTED 6854: eb0002ea bl 7404 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 6858: e59f0004 ldr r0, [pc, #4] ; 6864 <== NOT EXECUTED 685c: eb0003e9 bl 7808 <== NOT EXECUTED 6860: eaffffd9 b 67cc <== NOT EXECUTED =============================================================================== 00006c04 : } } AIO_printf ("Thread finished\n"); return NULL; } 6c04: e1a03000 mov r3, r0 6c08: e4932004 ldr r2, [r3], #4 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 6c0c: e1520003 cmp r2, r3 * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 6c10: e1a0c001 mov ip, r1 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 6c14: 0a00000f beq 6c58 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 6c18: e5910014 ldr r0, [r1, #20] if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 6c1c: e5921014 ldr r1, [r2, #20] while (req->aiocbp->aio_reqprio > prio && 6c20: e5900014 ldr r0, [r0, #20] 6c24: e5911014 ldr r1, [r1, #20] 6c28: e1510000 cmp r1, r0 6c2c: ba000002 blt 6c3c 6c30: ea000006 b 6c50 6c34: e1520003 cmp r2, r3 <== NOT EXECUTED 6c38: 0a000007 beq 6c5c <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 6c3c: e5922000 ldr r2, [r2] <== NOT EXECUTED int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 6c40: e5921014 ldr r1, [r2, #20] <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 6c44: e5911014 ldr r1, [r1, #20] <== NOT EXECUTED 6c48: e1510000 cmp r1, r0 <== NOT EXECUTED 6c4c: bafffff8 blt 6c34 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 6c50: e5920004 ldr r0, [r2, #4] 6c54: e1a0100c mov r1, ip 6c58: ea000914 b 90b0 <_Chain_Insert> } } AIO_printf ("Thread finished\n"); return NULL; } 6c5c: e1a02003 mov r2, r3 <== NOT EXECUTED 6c60: eafffffa b 6c50 <== NOT EXECUTED =============================================================================== 00006940 : } } AIO_printf ("Thread finished\n"); return NULL; } 6940: e59f204c ldr r2, [pc, #76] ; 6994 6944: e5923048 ldr r3, [r2, #72] ; 0x48 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 6948: e590c014 ldr ip, [r0, #20] * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 694c: e1a01000 mov r1, r0 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 6950: e5930014 ldr r0, [r3, #20] 6954: e150000c cmp r0, ip 6958: aa000009 bge 6984 695c: e282204c add r2, r2, #76 ; 0x4c 6960: e1530002 cmp r3, r2 6964: 1a000002 bne 6974 6968: ea000005 b 6984 <== NOT EXECUTED 696c: e1530002 cmp r3, r2 6970: 0a000005 beq 698c } } AIO_printf ("Thread finished\n"); return NULL; } 6974: e5933000 ldr r3, [r3] rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 6978: e5930014 ldr r0, [r3, #20] 697c: e150000c cmp r0, ip 6980: bafffff9 blt 696c 6984: e5930004 ldr r0, [r3, #4] 6988: ea0009c8 b 90b0 <_Chain_Insert> 698c: e1a03002 mov r3, r2 <== NOT EXECUTED 6990: eafffffb b 6984 <== NOT EXECUTED =============================================================================== 00006c64 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 6c64: e92d41f0 push {r4, r5, r6, r7, r8, lr} } } AIO_printf ("Thread finished\n"); return NULL; } 6c68: e5904008 ldr r4, [r0, #8] RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 6c6c: e280600c add r6, r0, #12 rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 6c70: e1540006 cmp r4, r6 { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 6c74: 13a0808c movne r8, #140 ; 0x8c req->aiocbp->return_value = -1; 6c78: 13e07000 mvnne r7, #0 rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 6c7c: 1a000001 bne 6c88 6c80: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); 6c84: e1a04005 mov r4, r5 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 6c88: e1a00004 mov r0, r4 6c8c: eb0008f2 bl 905c <_Chain_Extract> req->aiocbp->error_code = ECANCELED; 6c90: e5943014 ldr r3, [r4, #20] } } AIO_printf ("Thread finished\n"); return NULL; } 6c94: e5945000 ldr r5, [r4] rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; req->aiocbp->return_value = -1; free (req); 6c98: e1a00004 mov r0, r4 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 6c9c: e5838030 str r8, [r3, #48] ; 0x30 req->aiocbp->return_value = -1; 6ca0: e5837034 str r7, [r3, #52] ; 0x34 free (req); 6ca4: ebfff0ff bl 30a8 rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 6ca8: e1550006 cmp r5, r6 6cac: 1afffff4 bne 6c84 6cb0: e8bd81f0 pop {r4, r5, r6, r7, r8, pc} =============================================================================== 00006cb4 : * AIO_NOTCANCELED - if request was not canceled * AIO_CANCELED - if request was canceled */ int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp) { 6cb4: e92d4010 push {r4, lr} } } AIO_printf ("Thread finished\n"); return NULL; } 6cb8: e4903004 ldr r3, [r0], #4 * AIO_CANCELED - if request was canceled */ int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp) { if (rtems_chain_is_empty (chain)) 6cbc: e1530000 cmp r3, r0 return AIO_ALLDONE; 6cc0: 03a00002 moveq r0, #2 * AIO_CANCELED - if request was canceled */ int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp) { if (rtems_chain_is_empty (chain)) 6cc4: 1a000003 bne 6cd8 6cc8: e8bd8010 pop {r4, pc} } } AIO_printf ("Thread finished\n"); return NULL; } 6ccc: e5933000 ldr r3, [r3] <== NOT EXECUTED rtems_chain_node *node = rtems_chain_first (chain); rtems_aio_request *current; current = (rtems_aio_request *) node; while (!rtems_chain_is_tail (chain, node) && current->aiocbp != aiocbp) { 6cd0: e1530000 cmp r3, r0 <== NOT EXECUTED 6cd4: 0a00000e beq 6d14 <== NOT EXECUTED 6cd8: e5932014 ldr r2, [r3, #20] 6cdc: e1520001 cmp r2, r1 return AIO_ALLDONE; rtems_chain_node *node = rtems_chain_first (chain); rtems_aio_request *current; current = (rtems_aio_request *) node; 6ce0: e1a04003 mov r4, r3 while (!rtems_chain_is_tail (chain, node) && current->aiocbp != aiocbp) { 6ce4: 1afffff8 bne 6ccc 6ce8: e1a00003 mov r0, r3 6cec: eb0008da bl 905c <_Chain_Extract> if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; 6cf0: e5943014 ldr r3, [r4, #20] 6cf4: e3a0208c mov r2, #140 ; 0x8c 6cf8: e5832030 str r2, [r3, #48] ; 0x30 current->aiocbp->return_value = -1; 6cfc: e3e02000 mvn r2, #0 free (current); 6d00: e1a00004 mov r0, r4 return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; current->aiocbp->return_value = -1; 6d04: e5832034 str r2, [r3, #52] ; 0x34 free (current); 6d08: ebfff0e6 bl 30a8 } return AIO_CANCELED; 6d0c: e3a00000 mov r0, #0 6d10: e8bd8010 pop {r4, pc} node = rtems_chain_next (node); current = (rtems_aio_request *) node; } if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; 6d14: e3a00001 mov r0, #1 <== NOT EXECUTED current->aiocbp->return_value = -1; free (current); } return AIO_CANCELED; } 6d18: e8bd8010 pop {r4, pc} <== NOT EXECUTED =============================================================================== 00007418 : rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 7418: e59f3150 ldr r3, [pc, #336] ; 7570 741c: e593c000 ldr ip, [r3] 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; 7420: e59f314c ldr r3, [pc, #332] ; 7574 if ( rtems_interrupt_is_in_progress() ) 7424: 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 ) { 7428: e92d4030 push {r4, r5, lr} 742c: e1a04000 mov r4, r0 rtems_device_major_number major_limit = _IO_Number_of_drivers; 7430: e5930000 ldr r0, [r3] if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 7434: 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() ) 7438: 18bd8030 popne {r4, r5, pc} return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 743c: e3520000 cmp r2, #0 7440: 0a00003f beq 7544 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 7444: e3510000 cmp r1, #0 if ( registered_major == NULL ) return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; 7448: e5820000 str r0, [r2] if ( driver_table == NULL ) 744c: 0a00003c beq 7544 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 7450: e591c000 ldr ip, [r1] 7454: e35c0000 cmp ip, #0 7458: 0a000036 beq 7538 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 745c: e1500004 cmp r0, r4 7460: 9a000027 bls 7504 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 7464: e59f010c ldr r0, [pc, #268] ; 7578 7468: e590c000 ldr ip, [r0] 746c: e28cc001 add ip, ip, #1 7470: e580c000 str ip, [r0] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 7474: e3540000 cmp r4, #0 7478: 1a000023 bne 750c static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 747c: e593c000 ldr ip, [r3] rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 7480: e35c0000 cmp ip, #0 7484: 0a000030 beq 754c 7488: e59fe0ec ldr lr, [pc, #236] ; 757c 748c: e59e3000 ldr r3, [lr] 7490: ea000003 b 74a4 7494: e2844001 add r4, r4, #1 7498: e15c0004 cmp ip, r4 749c: e2833018 add r3, r3, #24 74a0: 9a000005 bls 74bc static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 74a4: e5930000 ldr r0, [r3] 74a8: e3500000 cmp r0, #0 74ac: 1afffff8 bne 7494 74b0: e5930004 ldr r0, [r3, #4] 74b4: e3500000 cmp r0, #0 74b8: 1afffff5 bne 7494 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 74bc: e15c0004 cmp ip, r4 74c0: 1084c084 addne ip, r4, r4, lsl #1 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 74c4: e5824000 str r4, [r2] if ( m != n ) 74c8: 11a0c18c lslne ip, ip, #3 74cc: 0a00001f beq 7550 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 74d0: e59e5000 ldr r5, [lr] 74d4: e1a0e001 mov lr, r1 74d8: e8be000f ldm lr!, {r0, r1, r2, r3} 74dc: e085c00c add ip, r5, ip 74e0: e8ac000f stmia ip!, {r0, r1, r2, r3} 74e4: e89e0003 ldm lr, {r0, r1} 74e8: e88c0003 stm ip, {r0, r1} _Thread_Enable_dispatch(); 74ec: eb000753 bl 9240 <_Thread_Enable_dispatch> return rtems_io_initialize( major, 0, NULL ); 74f0: e3a01000 mov r1, #0 74f4: e1a00004 mov r0, r4 74f8: e1a02001 mov r2, r1 } 74fc: e8bd4030 pop {r4, r5, lr} _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 7500: ea00213d b f9fc if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) return RTEMS_INVALID_NUMBER; 7504: e3a0000a mov r0, #10 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 7508: 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; 750c: e59fe068 ldr lr, [pc, #104] ; 757c 7510: e084c084 add ip, r4, r4, lsl #1 7514: e59e3000 ldr r3, [lr] 7518: e1a0c18c lsl ip, ip, #3 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 751c: e793000c ldr r0, [r3, ip] 7520: e3500000 cmp r0, #0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 7524: 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; 7528: 0a00000b beq 755c 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(); 752c: eb000743 bl 9240 <_Thread_Enable_dispatch> return RTEMS_RESOURCE_IN_USE; 7530: e3a0000c mov r0, #12 7534: 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; 7538: e591c004 ldr ip, [r1, #4] 753c: e35c0000 cmp ip, #0 7540: 1affffc5 bne 745c if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 7544: e3a00009 mov r0, #9 7548: e8bd8030 pop {r4, r5, pc} if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 754c: 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(); 7550: eb00073a bl 9240 <_Thread_Enable_dispatch> *major = m; if ( m != n ) return RTEMS_SUCCESSFUL; return RTEMS_TOO_MANY; 7554: 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; 7558: 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; 755c: e5933004 ldr r3, [r3, #4] 7560: e3530000 cmp r3, #0 7564: 1afffff0 bne 752c if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 7568: e5824000 str r4, [r2] 756c: eaffffd7 b 74d0 =============================================================================== 00005d58 : ) { const rtems_assoc_t *api_assoc; const rtems_assoc_t *class_assoc; if ( the_api == OBJECTS_INTERNAL_API ) 5d58: e3500001 cmp r0, #1 const char *rtems_object_get_api_class_name( int the_api, int the_class ) { 5d5c: e52de004 push {lr} ; (str lr, [sp, #-4]!) const rtems_assoc_t *api_assoc; const rtems_assoc_t *class_assoc; if ( the_api == OBJECTS_INTERNAL_API ) 5d60: 0a00000d beq 5d9c api_assoc = rtems_object_api_internal_assoc; else if ( the_api == OBJECTS_CLASSIC_API ) 5d64: e3500002 cmp r0, #2 5d68: 0a000004 beq 5d80 api_assoc = rtems_object_api_classic_assoc; #ifdef RTEMS_POSIX_API else if ( the_api == OBJECTS_POSIX_API ) 5d6c: e3500003 cmp r0, #3 api_assoc = rtems_object_api_posix_assoc; 5d70: 059f003c ldreq r0, [pc, #60] ; 5db4 if ( the_api == OBJECTS_INTERNAL_API ) api_assoc = rtems_object_api_internal_assoc; else if ( the_api == OBJECTS_CLASSIC_API ) api_assoc = rtems_object_api_classic_assoc; #ifdef RTEMS_POSIX_API else if ( the_api == OBJECTS_POSIX_API ) 5d74: 0a000002 beq 5d84 api_assoc = rtems_object_api_posix_assoc; #endif else return "BAD API"; 5d78: e59f0038 ldr r0, [pc, #56] ; 5db8 5d7c: e49df004 pop {pc} ; (ldr pc, [sp], #4) const rtems_assoc_t *class_assoc; if ( the_api == OBJECTS_INTERNAL_API ) api_assoc = rtems_object_api_internal_assoc; else if ( the_api == OBJECTS_CLASSIC_API ) api_assoc = rtems_object_api_classic_assoc; 5d80: e59f0034 ldr r0, [pc, #52] ; 5dbc else if ( the_api == OBJECTS_POSIX_API ) api_assoc = rtems_object_api_posix_assoc; #endif else return "BAD API"; class_assoc = rtems_assoc_ptr_by_local( api_assoc, the_class ); 5d84: eb00137c bl ab7c if ( class_assoc ) 5d88: e3500000 cmp r0, #0 return class_assoc->name; 5d8c: 15900000 ldrne r0, [r0] api_assoc = rtems_object_api_posix_assoc; #endif else return "BAD API"; class_assoc = rtems_assoc_ptr_by_local( api_assoc, the_class ); if ( class_assoc ) 5d90: 149df004 popne {pc} ; (ldrne pc, [sp], #4) return class_assoc->name; return "BAD CLASS"; 5d94: e59f0024 ldr r0, [pc, #36] ; 5dc0 } 5d98: e49df004 pop {pc} ; (ldr pc, [sp], #4) { const rtems_assoc_t *api_assoc; const rtems_assoc_t *class_assoc; if ( the_api == OBJECTS_INTERNAL_API ) api_assoc = rtems_object_api_internal_assoc; 5d9c: e59f0020 ldr r0, [pc, #32] ; 5dc4 else if ( the_api == OBJECTS_POSIX_API ) api_assoc = rtems_object_api_posix_assoc; #endif else return "BAD API"; class_assoc = rtems_assoc_ptr_by_local( api_assoc, the_class ); 5da0: eb001375 bl ab7c if ( class_assoc ) 5da4: e3500000 cmp r0, #0 return class_assoc->name; 5da8: 15900000 ldrne r0, [r0] api_assoc = rtems_object_api_posix_assoc; #endif else return "BAD API"; class_assoc = rtems_assoc_ptr_by_local( api_assoc, the_class ); if ( class_assoc ) 5dac: 149df004 popne {pc} ; (ldrne pc, [sp], #4) 5db0: eafffff7 b 5d94 <== NOT EXECUTED =============================================================================== 0000daa8 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { daa8: e92d4ff0 push {r4, r5, r6, r7, r8, r9, sl, fp, lr} ASR_Information *asr; bool is_asr_enabled = false; bool needs_asr_dispatching = false; rtems_mode old_mode; if ( !previous_mode_set ) daac: e2525000 subs r5, r2, #0 rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { dab0: e1a04000 mov r4, r0 dab4: e1a06001 mov r6, r1 bool is_asr_enabled = false; bool needs_asr_dispatching = false; rtems_mode old_mode; if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; dab8: 03a00009 moveq r0, #9 ASR_Information *asr; bool is_asr_enabled = false; bool needs_asr_dispatching = false; rtems_mode old_mode; if ( !previous_mode_set ) dabc: 08bd8ff0 popeq {r4, r5, r6, r7, r8, r9, sl, fp, pc} return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; dac0: e59f9148 ldr r9, [pc, #328] ; dc10 dac4: e5997004 ldr r7, [r9, #4] api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; dac8: e5d7a074 ldrb sl, [r7, #116] ; 0x74 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; dacc: e59780f8 ldr r8, [r7, #248] ; 0xf8 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) dad0: e597307c ldr r3, [r7, #124] ; 0x7c executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; dad4: e35a0000 cmp sl, #0 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; dad8: e5d8b008 ldrb fp, [r8, #8] executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; dadc: 03a0ac01 moveq sl, #256 ; 0x100 dae0: 13a0a000 movne sl, #0 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) dae4: e3530000 cmp r3, #0 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; dae8: 138aac02 orrne sl, sl, #512 ; 0x200 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; daec: e35b0000 cmp fp, #0 daf0: 03a0bb01 moveq fp, #1024 ; 0x400 daf4: 13a0b000 movne fp, #0 old_mode |= _ISR_Get_level(); daf8: ebffee78 bl 94e0 <_CPU_ISR_Get_level> if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; dafc: e18bb000 orr fp, fp, r0 old_mode |= _ISR_Get_level(); db00: e18ba00a orr sl, fp, sl *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) db04: e3160c01 tst r6, #256 ; 0x100 old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; old_mode |= _ISR_Get_level(); *previous_mode_set = old_mode; db08: e585a000 str sl, [r5] /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) db0c: 0a000003 beq db20 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; db10: e3140c01 tst r4, #256 ; 0x100 db14: 13a03000 movne r3, #0 db18: 03a03001 moveq r3, #1 db1c: e5c73074 strb r3, [r7, #116] ; 0x74 if ( mask & RTEMS_TIMESLICE_MASK ) { db20: e3160c02 tst r6, #512 ; 0x200 db24: 1a000028 bne dbcc } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) db28: e3160080 tst r6, #128 ; 0x80 db2c: 1a00002f bne dbf0 * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { db30: e2166b01 ands r6, r6, #1024 ; 0x400 db34: 0a000012 beq db84 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( db38: e3140b01 tst r4, #1024 ; 0x400 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { db3c: e5d82008 ldrb r2, [r8, #8] * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( db40: 13a03000 movne r3, #0 db44: 03a03001 moveq r3, #1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { db48: e1520003 cmp r2, r3 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; db4c: 03a06000 moveq r6, #0 if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { db50: 0a00000b beq db84 asr->is_enabled = is_asr_enabled; db54: e5c83008 strb r3, [r8, #8] static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( db58: e10f3000 mrs r3, CPSR db5c: e3832080 orr r2, r3, #128 ; 0x80 db60: e129f002 msr CPSR_fc, r2 { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; db64: e5981018 ldr r1, [r8, #24] information->signals_pending = information->signals_posted; db68: e5982014 ldr r2, [r8, #20] information->signals_posted = _signals; db6c: e5881014 str r1, [r8, #20] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; db70: e5882018 str r2, [r8, #24] static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( db74: e129f003 msr CPSR_fc, r3 _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { db78: e5986014 ldr r6, [r8, #20] db7c: e3560000 cmp r6, #0 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; db80: 13a06001 movne r6, #1 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { db84: e59f3088 ldr r3, [pc, #136] ; dc14 db88: e5933000 ldr r3, [r3] db8c: e3530003 cmp r3, #3 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; db90: 13a00000 movne r0, #0 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { db94: 18bd8ff0 popne {r4, r5, r6, r7, r8, r9, sl, fp, pc} { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || db98: e3560000 cmp r6, #0 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; db9c: e5993004 ldr r3, [r9, #4] if ( are_signals_pending || dba0: 1a000015 bne dbfc dba4: e59f2064 ldr r2, [pc, #100] ; dc10 dba8: e5922008 ldr r2, [r2, #8] dbac: e1530002 cmp r3, r2 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; dbb0: 01a00006 moveq r0, r6 dbb4: 08bd8ff0 popeq {r4, r5, r6, r7, r8, r9, sl, fp, pc} (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { dbb8: e5d33074 ldrb r3, [r3, #116] ; 0x74 dbbc: e3530000 cmp r3, #0 dbc0: 1a00000d bne dbfc dbc4: e1a00006 mov r0, r6 <== NOT EXECUTED } dbc8: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc} <== NOT EXECUTED */ if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { dbcc: e2143c02 ands r3, r4, #512 ; 0x200 executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; dbd0: 159f3040 ldrne r3, [pc, #64] ; dc18 dbd4: 15933000 ldrne r3, [r3] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; dbd8: 13a02001 movne r2, #1 dbdc: 1587207c strne r2, [r7, #124] ; 0x7c executing->cpu_time_budget = _Thread_Ticks_per_timeslice; dbe0: 15873078 strne r3, [r7, #120] ; 0x78 } else executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; dbe4: 0587307c streq r3, [r7, #124] ; 0x7c } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) dbe8: e3160080 tst r6, #128 ; 0x80 dbec: 0affffcf beq db30 */ RTEMS_INLINE_ROUTINE void _Modes_Set_interrupt_level ( Modes_Control mode_set ) { _ISR_Set_level( _Modes_Get_interrupt_level( mode_set ) ); dbf0: e2040080 and r0, r4, #128 ; 0x80 dbf4: ebffee34 bl 94cc <_CPU_ISR_Set_level> dbf8: eaffffcc b db30 _Thread_Dispatch_necessary = true; dbfc: e3a03001 mov r3, #1 dc00: e5c93010 strb r3, [r9, #16] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); dc04: ebffe854 bl 7d5c <_Thread_Dispatch> } return RTEMS_SUCCESSFUL; dc08: e3a00000 mov r0, #0 dc0c: e8bd8ff0 pop {r4, r5, r6, r7, r8, r9, sl, fp, pc} =============================================================================== 00008b4c : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 8b4c: e92d4010 push {r4, lr} 8b50: e24dd004 sub sp, sp, #4 8b54: e1a04000 mov r4, r0 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 8b58: e1a00001 mov r0, r1 8b5c: e1a0100d mov r1, sp 8b60: eb001670 bl e528 <_POSIX_Absolute_timeout_to_ticks> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 8b64: e3500003 cmp r0, #3 8b68: 0a000005 beq 8b84 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 8b6c: e1a00004 mov r0, r4 <== NOT EXECUTED 8b70: e3a01000 mov r1, #0 <== NOT EXECUTED 8b74: e59d2000 ldr r2, [sp] <== NOT EXECUTED 8b78: eb001986 bl f198 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED lock_status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) rtems_set_errno_and_return_minus_one( ETIMEDOUT ); } return lock_status; } 8b7c: e28dd004 add sp, sp, #4 8b80: e8bd8010 pop {r4, pc} */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 8b84: e1a00004 mov r0, r4 8b88: e3a01001 mov r1, #1 8b8c: e59d2000 ldr r2, [sp] 8b90: eb001980 bl f198 <_POSIX_Semaphore_Wait_support> 8b94: eafffff8 b 8b7c =============================================================================== 000063a4 : struct sigaction *oact ) { ISR_Level level; if ( oact ) 63a4: e2523000 subs r3, r2, #0 *oact = _POSIX_signals_Vectors[ sig ]; 63a8: 159f20c4 ldrne r2, [pc, #196] ; 6474 int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 63ac: e92d4070 push {r4, r5, r6, lr} 63b0: e1a05001 mov r5, r1 ISR_Level level; if ( oact ) *oact = _POSIX_signals_Vectors[ sig ]; 63b4: 10801080 addne r1, r0, r0, lsl #1 63b8: 10822101 addne r2, r2, r1, lsl #2 int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 63bc: e1a04000 mov r4, r0 ISR_Level level; if ( oact ) *oact = _POSIX_signals_Vectors[ sig ]; 63c0: 18920007 ldmne r2, {r0, r1, r2} 63c4: 18830007 stmne r3, {r0, r1, r2} if ( !sig ) 63c8: e3540000 cmp r4, #0 63cc: 0a000023 beq 6460 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 63d0: e2443001 sub r3, r4, #1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 63d4: e353001f cmp r3, #31 63d8: 8a000020 bhi 6460 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 63dc: e3540009 cmp r4, #9 63e0: 0a00001e beq 6460 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 63e4: e3550000 cmp r5, #0 63e8: 0a00001a beq 6458 static inline uint32_t arm_interrupt_disable( void ) { uint32_t arm_switch_reg; uint32_t level; asm volatile ( 63ec: e10f6000 mrs r6, CPSR 63f0: e3863080 orr r3, r6, #128 ; 0x80 63f4: e129f003 msr CPSR_fc, r3 * Unless the user is installing the default signal actions, then * we can just copy the provided sigaction structure into the vectors. */ _ISR_Disable( level ); if ( act->sa_handler == SIG_DFL ) { 63f8: e5953008 ldr r3, [r5, #8] 63fc: e3530000 cmp r3, #0 6400: 0a000009 beq 642c _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 6404: e1a00004 mov r0, r4 6408: eb001743 bl c11c <_POSIX_signals_Clear_process_signals> _POSIX_signals_Vectors[ sig ] = *act; 640c: e59f3060 ldr r3, [pc, #96] ; 6474 6410: e8950007 ldm r5, {r0, r1, r2} 6414: e0844084 add r4, r4, r4, lsl #1 6418: e0834104 add r4, r3, r4, lsl #2 641c: e8840007 stm r4, {r0, r1, r2} static inline void arm_interrupt_enable( uint32_t level ) { ARM_SWITCH_REGISTERS; asm volatile ( 6420: e129f006 msr CPSR_fc, r6 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 6424: e3a00000 mov r0, #0 6428: e8bd8070 pop {r4, r5, r6, pc} * we can just copy the provided sigaction structure into the vectors. */ _ISR_Disable( level ); if ( act->sa_handler == SIG_DFL ) { _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 642c: e0844084 add r4, r4, r4, lsl #1 6430: e59f3040 ldr r3, [pc, #64] ; 6478 6434: e1a04104 lsl r4, r4, #2 6438: e0833004 add r3, r3, r4 643c: e8930007 ldm r3, {r0, r1, r2} 6440: e59f302c ldr r3, [pc, #44] ; 6474 6444: e0834004 add r4, r3, r4 6448: e8840007 stm r4, {r0, r1, r2} 644c: e129f006 msr CPSR_fc, r6 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 6450: e3a00000 mov r0, #0 6454: e8bd8070 pop {r4, r5, r6, pc} 6458: e1a00005 mov r0, r5 <== NOT EXECUTED } 645c: e8bd8070 pop {r4, r5, r6, pc} <== NOT EXECUTED * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) rtems_set_errno_and_return_minus_one( EINVAL ); 6460: eb0023a5 bl f2fc <__errno> 6464: e3a03016 mov r3, #22 6468: e5803000 str r3, [r0] 646c: e3e00000 mvn r0, #0 6470: e8bd8070 pop {r4, r5, r6, pc} =============================================================================== 00008a14 : int sigwait( const sigset_t *set, int *sig ) { 8a14: e92d4010 push {r4, lr} 8a18: e1a04001 mov r4, r1 int status; status = sigtimedwait( set, NULL, NULL ); 8a1c: e3a01000 mov r1, #0 8a20: e1a02001 mov r2, r1 8a24: ebffff7f bl 8828 if ( status != -1 ) { 8a28: e3700001 cmn r0, #1 8a2c: 0a000005 beq 8a48 if ( sig ) 8a30: e3540000 cmp r4, #0 *sig = status; 8a34: 15840000 strne r0, [r4] return 0; 8a38: 13a00000 movne r0, #0 int status; status = sigtimedwait( set, NULL, NULL ); if ( status != -1 ) { if ( sig ) 8a3c: 18bd8010 popne {r4, pc} *sig = status; return 0; 8a40: e1a00004 mov r0, r4 <== NOT EXECUTED } return errno; } 8a44: e8bd8010 pop {r4, pc} <== NOT EXECUTED if ( sig ) *sig = status; return 0; } return errno; 8a48: eb002305 bl 11664 <__errno> 8a4c: e5900000 ldr r0, [r0] 8a50: e8bd8010 pop {r4, pc}