0200cc7c <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200cc7c: 9d e3 bf 98 save %sp, -104, %sp Heap_Statistics *const stats = &heap->stats; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *block = _Heap_Free_list_first( heap ); uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE - HEAP_BLOCK_SIZE_OFFSET; 200cc80: a8 06 60 04 add %i1, 4, %l4 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200cc84: a0 10 00 18 mov %i0, %l0 - HEAP_BLOCK_SIZE_OFFSET; uintptr_t const page_size = heap->page_size; uintptr_t alloc_begin = 0; uint32_t search_count = 0; if ( block_size_floor < alloc_size ) { 200cc88: 80 a6 40 14 cmp %i1, %l4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200cc8c: e4 06 20 08 ld [ %i0 + 8 ], %l2 200cc90: 18 80 00 72 bgu 200ce58 <_Heap_Allocate_aligned_with_boundary+0x1dc> 200cc94: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200cc98: 80 a6 e0 00 cmp %i3, 0 200cc9c: 12 80 00 6d bne 200ce50 <_Heap_Allocate_aligned_with_boundary+0x1d4> 200cca0: 80 a6 40 1b cmp %i1, %i3 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200cca4: 80 a4 00 12 cmp %l0, %l2 200cca8: 02 80 00 6f be 200ce64 <_Heap_Allocate_aligned_with_boundary+0x1e8> 200ccac: a2 10 20 00 clr %l1 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccb0: 82 10 20 04 mov 4, %g1 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200ccb4: b8 07 60 07 add %i5, 7, %i4 uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccb8: 82 20 40 19 sub %g1, %i1, %g1 200ccbc: 10 80 00 09 b 200cce0 <_Heap_Allocate_aligned_with_boundary+0x64> 200ccc0: c2 27 bf fc st %g1, [ %fp + -4 ] boundary ); } } if ( alloc_begin != 0 ) { 200ccc4: 80 a6 20 00 cmp %i0, 0 200ccc8: 32 80 00 54 bne,a 200ce18 <_Heap_Allocate_aligned_with_boundary+0x19c> 200cccc: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 break; } block = block->next; 200ccd0: e4 04 a0 08 ld [ %l2 + 8 ], %l2 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200ccd4: 80 a4 00 12 cmp %l0, %l2 200ccd8: 22 80 00 57 be,a 200ce34 <_Heap_Allocate_aligned_with_boundary+0x1b8> 200ccdc: b0 10 20 00 clr %i0 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 200cce0: e6 04 a0 04 ld [ %l2 + 4 ], %l3 200cce4: 80 a5 00 13 cmp %l4, %l3 200cce8: 1a bf ff fa bcc 200ccd0 <_Heap_Allocate_aligned_with_boundary+0x54> 200ccec: a2 04 60 01 inc %l1 if ( alignment == 0 ) { 200ccf0: 80 a6 a0 00 cmp %i2, 0 200ccf4: 02 bf ff f4 be 200ccc4 <_Heap_Allocate_aligned_with_boundary+0x48> 200ccf8: b0 04 a0 08 add %l2, 8, %i0 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200ccfc: c2 07 bf fc ld [ %fp + -4 ], %g1 uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200cd00: ee 04 20 14 ld [ %l0 + 0x14 ], %l7 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200cd04: a6 0c ff fe and %l3, -2, %l3 200cd08: a6 04 80 13 add %l2, %l3, %l3 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 200cd0c: b0 00 40 13 add %g1, %l3, %i0 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200cd10: 82 27 00 17 sub %i4, %l7, %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200cd14: 90 10 00 18 mov %i0, %o0 200cd18: a6 00 40 13 add %g1, %l3, %l3 200cd1c: 40 00 32 24 call 20195ac <.urem> 200cd20: 92 10 00 1a mov %i2, %o1 200cd24: b0 26 00 08 sub %i0, %o0, %i0 uintptr_t alloc_begin = alloc_end - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { 200cd28: 80 a4 c0 18 cmp %l3, %i0 200cd2c: 1a 80 00 06 bcc 200cd44 <_Heap_Allocate_aligned_with_boundary+0xc8> 200cd30: ac 04 a0 08 add %l2, 8, %l6 200cd34: 90 10 00 13 mov %l3, %o0 200cd38: 40 00 32 1d call 20195ac <.urem> 200cd3c: 92 10 00 1a mov %i2, %o1 200cd40: b0 24 c0 08 sub %l3, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200cd44: 80 a6 e0 00 cmp %i3, 0 200cd48: 02 80 00 24 be 200cdd8 <_Heap_Allocate_aligned_with_boundary+0x15c> 200cd4c: 80 a5 80 18 cmp %l6, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200cd50: a6 06 00 19 add %i0, %i1, %l3 200cd54: 92 10 00 1b mov %i3, %o1 200cd58: 40 00 32 15 call 20195ac <.urem> 200cd5c: 90 10 00 13 mov %l3, %o0 200cd60: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200cd64: 80 a4 c0 08 cmp %l3, %o0 200cd68: 08 80 00 1b bleu 200cdd4 <_Heap_Allocate_aligned_with_boundary+0x158> 200cd6c: 80 a6 00 08 cmp %i0, %o0 200cd70: 1a 80 00 1a bcc 200cdd8 <_Heap_Allocate_aligned_with_boundary+0x15c> 200cd74: 80 a5 80 18 cmp %l6, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200cd78: aa 05 80 19 add %l6, %i1, %l5 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200cd7c: 80 a5 40 08 cmp %l5, %o0 200cd80: 28 80 00 09 bleu,a 200cda4 <_Heap_Allocate_aligned_with_boundary+0x128> 200cd84: b0 22 00 19 sub %o0, %i1, %i0 if ( alloc_begin != 0 ) { break; } block = block->next; 200cd88: 10 bf ff d3 b 200ccd4 <_Heap_Allocate_aligned_with_boundary+0x58> 200cd8c: e4 04 a0 08 ld [ %l2 + 8 ], %l2 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200cd90: 1a 80 00 11 bcc 200cdd4 <_Heap_Allocate_aligned_with_boundary+0x158> 200cd94: 80 a5 40 08 cmp %l5, %o0 if ( boundary_line < boundary_floor ) { 200cd98: 38 bf ff cf bgu,a 200ccd4 <_Heap_Allocate_aligned_with_boundary+0x58> 200cd9c: e4 04 a0 08 ld [ %l2 + 8 ], %l2 <== NOT EXECUTED return 0; } alloc_begin = boundary_line - alloc_size; 200cda0: b0 22 00 19 sub %o0, %i1, %i0 200cda4: 92 10 00 1a mov %i2, %o1 200cda8: 40 00 32 01 call 20195ac <.urem> 200cdac: 90 10 00 18 mov %i0, %o0 200cdb0: 92 10 00 1b mov %i3, %o1 200cdb4: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200cdb8: a6 06 00 19 add %i0, %i1, %l3 200cdbc: 40 00 31 fc call 20195ac <.urem> 200cdc0: 90 10 00 13 mov %l3, %o0 200cdc4: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200cdc8: 80 a4 c0 08 cmp %l3, %o0 200cdcc: 18 bf ff f1 bgu 200cd90 <_Heap_Allocate_aligned_with_boundary+0x114> 200cdd0: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200cdd4: 80 a5 80 18 cmp %l6, %i0 200cdd8: 18 bf ff be bgu 200ccd0 <_Heap_Allocate_aligned_with_boundary+0x54> 200cddc: 82 10 3f f8 mov -8, %g1 uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; 200cde0: 90 10 00 18 mov %i0, %o0 200cde4: a6 20 40 12 sub %g1, %l2, %l3 200cde8: 92 10 00 1d mov %i5, %o1 200cdec: 40 00 31 f0 call 20195ac <.urem> 200cdf0: a6 04 c0 18 add %l3, %i0, %l3 if ( free_size >= min_block_size || free_size == 0 ) { 200cdf4: 90 a4 c0 08 subcc %l3, %o0, %o0 200cdf8: 02 bf ff b4 be 200ccc8 <_Heap_Allocate_aligned_with_boundary+0x4c> 200cdfc: 80 a6 20 00 cmp %i0, 0 200ce00: 80 a5 c0 08 cmp %l7, %o0 200ce04: 18 bf ff b3 bgu 200ccd0 <_Heap_Allocate_aligned_with_boundary+0x54> 200ce08: 80 a6 20 00 cmp %i0, 0 boundary ); } } if ( alloc_begin != 0 ) { 200ce0c: 22 bf ff b2 be,a 200ccd4 <_Heap_Allocate_aligned_with_boundary+0x58> 200ce10: e4 04 a0 08 ld [ %l2 + 8 ], %l2 <== NOT EXECUTED block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200ce14: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce18: 92 10 00 12 mov %l2, %o1 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200ce1c: 82 00 40 11 add %g1, %l1, %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce20: 96 10 00 19 mov %i1, %o3 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 200ce24: c2 24 20 4c st %g1, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200ce28: 90 10 00 10 mov %l0, %o0 200ce2c: 7f ff e8 fa call 2007214 <_Heap_Block_allocate> 200ce30: 94 10 00 18 mov %i0, %o2 uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { Heap_Statistics *const stats = &heap->stats; 200ce34: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200ce38: 80 a0 40 11 cmp %g1, %l1 200ce3c: 1a 80 00 08 bcc 200ce5c <_Heap_Allocate_aligned_with_boundary+0x1e0> 200ce40: 01 00 00 00 nop ); } /* Statistics */ if ( stats->max_search < search_count ) { stats->max_search = search_count; 200ce44: e2 24 20 44 st %l1, [ %l0 + 0x44 ] 200ce48: 81 c7 e0 08 ret 200ce4c: 81 e8 00 00 restore /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200ce50: 08 80 00 07 bleu 200ce6c <_Heap_Allocate_aligned_with_boundary+0x1f0> 200ce54: 80 a6 a0 00 cmp %i2, 0 ); } /* Statistics */ if ( stats->max_search < search_count ) { stats->max_search = search_count; 200ce58: b0 10 20 00 clr %i0 } return (void *) alloc_begin; } 200ce5c: 81 c7 e0 08 ret 200ce60: 81 e8 00 00 restore if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 200ce64: 10 bf ff f4 b 200ce34 <_Heap_Allocate_aligned_with_boundary+0x1b8> 200ce68: b0 10 20 00 clr %i0 if ( boundary != 0 ) { if ( boundary < alloc_size ) { return NULL; } if ( alignment == 0 ) { 200ce6c: 22 bf ff 8e be,a 200cca4 <_Heap_Allocate_aligned_with_boundary+0x28> 200ce70: b4 10 00 1d mov %i5, %i2 alignment = page_size; } } while ( block != free_list_tail ) { 200ce74: 10 bf ff 8d b 200cca8 <_Heap_Allocate_aligned_with_boundary+0x2c> 200ce78: 80 a4 00 12 cmp %l0, %l2 0200818c <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 200818c: 9d e3 bf 88 save %sp, -120, %sp uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const last_block = heap->last_block; Heap_Block *block = heap->first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008190: 25 00 80 21 sethi %hi(0x2008400), %l2 2008194: 80 8e a0 ff btst 0xff, %i2 2008198: a4 14 a3 8c or %l2, 0x38c, %l2 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 200819c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 uintptr_t const min_block_size = heap->min_block_size; 20081a0: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const last_block = heap->last_block; 20081a4: e8 06 20 24 ld [ %i0 + 0x24 ], %l4 Heap_Block *block = heap->first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 20081a8: 12 80 00 04 bne 20081b8 <_Heap_Walk+0x2c> 20081ac: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 20081b0: 25 00 80 20 sethi %hi(0x2008000), %l2 20081b4: a4 14 a1 84 or %l2, 0x184, %l2 ! 2008184 <_Heap_Walk_print_nothing> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20081b8: 03 00 80 7d sethi %hi(0x201f400), %g1 20081bc: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 ! 201f6e0 <_System_state_Current> 20081c0: 80 a0 60 03 cmp %g1, 3 20081c4: 22 80 00 04 be,a 20081d4 <_Heap_Walk+0x48> 20081c8: da 06 20 18 ld [ %i0 + 0x18 ], %o5 block = next_block; } return true; } 20081cc: 81 c7 e0 08 ret 20081d0: 91 e8 20 01 restore %g0, 1, %o0 Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 20081d4: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 20081d8: c4 06 20 08 ld [ %i0 + 8 ], %g2 20081dc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20081e0: 90 10 00 19 mov %i1, %o0 20081e4: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20081e8: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 20081ec: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20081f0: e0 23 a0 60 st %l0, [ %sp + 0x60 ] 20081f4: e8 23 a0 64 st %l4, [ %sp + 0x64 ] 20081f8: 92 10 20 00 clr %o1 20081fc: 15 00 80 71 sethi %hi(0x201c400), %o2 2008200: 96 10 00 15 mov %l5, %o3 2008204: 94 12 a2 40 or %o2, 0x240, %o2 2008208: 9f c4 80 00 call %l2 200820c: 98 10 00 13 mov %l3, %o4 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008210: 80 a5 60 00 cmp %l5, 0 2008214: 02 80 00 36 be 20082ec <_Heap_Walk+0x160> 2008218: 80 8d 60 07 btst 7, %l5 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 200821c: 12 80 00 3c bne 200830c <_Heap_Walk+0x180> 2008220: 90 10 00 13 mov %l3, %o0 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2008224: 7f ff e6 28 call 2001ac4 <.urem> 2008228: 92 10 00 15 mov %l5, %o1 200822c: 80 a2 20 00 cmp %o0, 0 2008230: 12 80 00 40 bne 2008330 <_Heap_Walk+0x1a4> 2008234: 90 04 20 08 add %l0, 8, %o0 ); return false; } if ( 2008238: 7f ff e6 23 call 2001ac4 <.urem> 200823c: 92 10 00 15 mov %l5, %o1 2008240: 80 a2 20 00 cmp %o0, 0 2008244: 32 80 00 44 bne,a 2008354 <_Heap_Walk+0x1c8> 2008248: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200824c: ec 04 20 04 ld [ %l0 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008250: ae 8d a0 01 andcc %l6, 1, %l7 2008254: 22 80 00 48 be,a 2008374 <_Heap_Walk+0x1e8> 2008258: 90 10 00 19 mov %i1, %o0 ); return false; } if ( first_block->prev_size != page_size ) { 200825c: d6 04 00 00 ld [ %l0 ], %o3 2008260: 80 a5 40 0b cmp %l5, %o3 2008264: 32 80 00 1a bne,a 20082cc <_Heap_Walk+0x140> 2008268: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200826c: c2 05 20 04 ld [ %l4 + 4 ], %g1 2008270: 82 08 7f fe and %g1, -2, %g1 2008274: 82 05 00 01 add %l4, %g1, %g1 2008278: c2 00 60 04 ld [ %g1 + 4 ], %g1 200827c: 80 88 60 01 btst 1, %g1 2008280: 22 80 01 23 be,a 200870c <_Heap_Walk+0x580> 2008284: 90 10 00 19 mov %i1, %o0 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008288: e2 06 20 08 ld [ %i0 + 8 ], %l1 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 200828c: 80 a6 00 11 cmp %i0, %l1 2008290: 02 80 00 6f be 200844c <_Heap_Walk+0x2c0> 2008294: f4 06 20 10 ld [ %i0 + 0x10 ], %i2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2008298: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 200829c: 80 a7 00 11 cmp %i4, %l1 20082a0: 28 80 00 3c bleu,a 2008390 <_Heap_Walk+0x204> 20082a4: f6 06 20 24 ld [ %i0 + 0x24 ], %i3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 20082a8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20082ac: 96 10 00 11 mov %l1, %o3 20082b0: 92 10 20 01 mov 1, %o1 20082b4: 15 00 80 71 sethi %hi(0x201c400), %o2 20082b8: b0 10 20 00 clr %i0 20082bc: 9f c4 80 00 call %l2 20082c0: 94 12 a3 e8 or %o2, 0x3e8, %o2 20082c4: 81 c7 e0 08 ret 20082c8: 81 e8 00 00 restore return false; } if ( first_block->prev_size != page_size ) { (*printer)( 20082cc: 98 10 00 15 mov %l5, %o4 20082d0: 92 10 20 01 mov 1, %o1 20082d4: 15 00 80 71 sethi %hi(0x201c400), %o2 20082d8: b0 10 20 00 clr %i0 20082dc: 9f c4 80 00 call %l2 20082e0: 94 12 a3 a0 or %o2, 0x3a0, %o2 20082e4: 81 c7 e0 08 ret 20082e8: 81 e8 00 00 restore first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 20082ec: 90 10 00 19 mov %i1, %o0 20082f0: 92 10 20 01 mov 1, %o1 20082f4: 15 00 80 71 sethi %hi(0x201c400), %o2 20082f8: b0 10 20 00 clr %i0 20082fc: 9f c4 80 00 call %l2 2008300: 94 12 a2 d8 or %o2, 0x2d8, %o2 2008304: 81 c7 e0 08 ret 2008308: 81 e8 00 00 restore return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 200830c: 90 10 00 19 mov %i1, %o0 2008310: 96 10 00 15 mov %l5, %o3 2008314: 92 10 20 01 mov 1, %o1 2008318: 15 00 80 71 sethi %hi(0x201c400), %o2 200831c: b0 10 20 00 clr %i0 2008320: 9f c4 80 00 call %l2 2008324: 94 12 a2 f0 or %o2, 0x2f0, %o2 2008328: 81 c7 e0 08 ret 200832c: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008330: 90 10 00 19 mov %i1, %o0 2008334: 96 10 00 13 mov %l3, %o3 2008338: 92 10 20 01 mov 1, %o1 200833c: 15 00 80 71 sethi %hi(0x201c400), %o2 2008340: b0 10 20 00 clr %i0 2008344: 9f c4 80 00 call %l2 2008348: 94 12 a3 10 or %o2, 0x310, %o2 200834c: 81 c7 e0 08 ret 2008350: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008354: 96 10 00 10 mov %l0, %o3 2008358: 92 10 20 01 mov 1, %o1 200835c: 15 00 80 71 sethi %hi(0x201c400), %o2 2008360: b0 10 20 00 clr %i0 2008364: 9f c4 80 00 call %l2 2008368: 94 12 a3 38 or %o2, 0x338, %o2 200836c: 81 c7 e0 08 ret 2008370: 81 e8 00 00 restore return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2008374: 92 10 20 01 mov 1, %o1 2008378: 15 00 80 71 sethi %hi(0x201c400), %o2 200837c: b0 10 20 00 clr %i0 2008380: 9f c4 80 00 call %l2 2008384: 94 12 a3 70 or %o2, 0x370, %o2 2008388: 81 c7 e0 08 ret 200838c: 81 e8 00 00 restore 2008390: 80 a6 c0 11 cmp %i3, %l1 2008394: 0a bf ff c6 bcs 20082ac <_Heap_Walk+0x120> 2008398: 90 10 00 19 mov %i1, %o0 ); return false; } if ( 200839c: 90 04 60 08 add %l1, 8, %o0 20083a0: 7f ff e5 c9 call 2001ac4 <.urem> 20083a4: 92 10 00 1a mov %i2, %o1 20083a8: 80 a2 20 00 cmp %o0, 0 20083ac: 12 80 00 df bne 2008728 <_Heap_Walk+0x59c> 20083b0: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 20083b4: c2 04 60 04 ld [ %l1 + 4 ], %g1 20083b8: 82 08 7f fe and %g1, -2, %g1 20083bc: 82 04 40 01 add %l1, %g1, %g1 20083c0: c2 00 60 04 ld [ %g1 + 4 ], %g1 20083c4: 80 88 60 01 btst 1, %g1 20083c8: 12 80 00 ea bne 2008770 <_Heap_Walk+0x5e4> 20083cc: 96 10 00 11 mov %l1, %o3 ); return false; } if ( free_block->prev != prev_block ) { 20083d0: d8 04 60 0c ld [ %l1 + 0xc ], %o4 20083d4: 80 a6 00 0c cmp %i0, %o4 20083d8: 02 80 00 19 be 200843c <_Heap_Walk+0x2b0> 20083dc: ba 10 00 11 mov %l1, %i5 20083e0: 30 80 00 dc b,a 2008750 <_Heap_Walk+0x5c4> <== NOT EXECUTED 20083e4: 0a bf ff b2 bcs 20082ac <_Heap_Walk+0x120> 20083e8: 90 10 00 19 mov %i1, %o0 20083ec: 80 a6 c0 11 cmp %i3, %l1 20083f0: 0a bf ff b0 bcs 20082b0 <_Heap_Walk+0x124> 20083f4: 96 10 00 11 mov %l1, %o3 ); return false; } if ( 20083f8: 90 04 60 08 add %l1, 8, %o0 20083fc: 7f ff e5 b2 call 2001ac4 <.urem> 2008400: 92 10 00 1a mov %i2, %o1 2008404: 80 a2 20 00 cmp %o0, 0 2008408: 32 80 00 c8 bne,a 2008728 <_Heap_Walk+0x59c> 200840c: 90 10 00 19 mov %i1, %o0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008410: c2 04 60 04 ld [ %l1 + 4 ], %g1 2008414: 82 08 7f fe and %g1, -2, %g1 2008418: 82 00 40 11 add %g1, %l1, %g1 200841c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2008420: 80 88 60 01 btst 1, %g1 2008424: 32 80 00 d2 bne,a 200876c <_Heap_Walk+0x5e0> 2008428: 90 10 00 19 mov %i1, %o0 ); return false; } if ( free_block->prev != prev_block ) { 200842c: d8 04 60 0c ld [ %l1 + 0xc ], %o4 2008430: 80 a3 00 1d cmp %o4, %i5 2008434: 12 80 00 c5 bne 2008748 <_Heap_Walk+0x5bc> 2008438: ba 10 00 11 mov %l1, %i5 return false; } prev_block = free_block; free_block = free_block->next; 200843c: e2 04 60 08 ld [ %l1 + 8 ], %l1 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 2008440: 80 a6 00 11 cmp %i0, %l1 2008444: 12 bf ff e8 bne 20083e4 <_Heap_Walk+0x258> 2008448: 80 a4 40 1c cmp %l1, %i4 if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; } while ( block != last_block ) { 200844c: 80 a5 00 10 cmp %l4, %l0 2008450: 02 bf ff 5f be 20081cc <_Heap_Walk+0x40> 2008454: 37 00 80 72 sethi %hi(0x201c800), %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008458: 35 00 80 72 sethi %hi(0x201c800), %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 200845c: 39 00 80 72 sethi %hi(0x201c800), %i4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008460: ba 10 00 15 mov %l5, %i5 bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; if ( prev_used ) { (*printer)( 2008464: b6 16 e0 90 or %i3, 0x90, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008468: b4 16 a0 a8 or %i2, 0xa8, %i2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 200846c: b8 17 21 a8 or %i4, 0x1a8, %i4 2008470: aa 10 00 14 mov %l4, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2008474: ac 0d bf fe and %l6, -2, %l6 uintptr_t const block_size = _Heap_Block_size( block ); bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; if ( prev_used ) { 2008478: 80 a5 e0 00 cmp %l7, 0 200847c: 02 80 00 16 be 20084d4 <_Heap_Walk+0x348> 2008480: a2 05 80 10 add %l6, %l0, %l1 (*printer)( 2008484: 90 10 00 19 mov %i1, %o0 2008488: 92 10 20 00 clr %o1 200848c: 94 10 00 1b mov %i3, %o2 2008490: 96 10 00 10 mov %l0, %o3 2008494: 9f c4 80 00 call %l2 2008498: 98 10 00 16 mov %l6, %o4 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 200849c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 20084a0: 80 a0 40 11 cmp %g1, %l1 20084a4: 28 80 00 18 bleu,a 2008504 <_Heap_Walk+0x378> 20084a8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 block->prev_size ); } if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 20084ac: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20084b0: 96 10 00 10 mov %l0, %o3 20084b4: 98 10 00 11 mov %l1, %o4 20084b8: 92 10 20 01 mov 1, %o1 20084bc: 15 00 80 72 sethi %hi(0x201c800), %o2 20084c0: b0 10 20 00 clr %i0 20084c4: 9f c4 80 00 call %l2 20084c8: 94 12 a0 d0 or %o2, 0xd0, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 20084cc: 81 c7 e0 08 ret 20084d0: 81 e8 00 00 restore "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20084d4: da 04 00 00 ld [ %l0 ], %o5 20084d8: 90 10 00 19 mov %i1, %o0 20084dc: 92 10 20 00 clr %o1 20084e0: 94 10 00 1a mov %i2, %o2 20084e4: 96 10 00 10 mov %l0, %o3 20084e8: 9f c4 80 00 call %l2 20084ec: 98 10 00 16 mov %l6, %o4 20084f0: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 20084f4: 80 a0 40 11 cmp %g1, %l1 20084f8: 18 bf ff ee bgu 20084b0 <_Heap_Walk+0x324> 20084fc: 90 10 00 19 mov %i1, %o0 2008500: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2008504: 80 a0 40 11 cmp %g1, %l1 2008508: 0a bf ff ea bcs 20084b0 <_Heap_Walk+0x324> 200850c: 90 10 00 19 mov %i1, %o0 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) ) { 2008510: 90 10 00 16 mov %l6, %o0 2008514: 7f ff e5 6c call 2001ac4 <.urem> 2008518: 92 10 00 1d mov %i5, %o1 200851c: 80 a2 20 00 cmp %o0, 0 2008520: 12 80 00 5d bne 2008694 <_Heap_Walk+0x508> 2008524: 80 a4 c0 16 cmp %l3, %l6 ); return false; } if ( block_size < min_block_size ) { 2008528: 18 80 00 65 bgu 20086bc <_Heap_Walk+0x530> 200852c: 80 a4 00 11 cmp %l0, %l1 ); return false; } if ( next_block_begin <= block_begin ) { 2008530: 3a 80 00 6e bcc,a 20086e8 <_Heap_Walk+0x55c> 2008534: 90 10 00 19 mov %i1, %o0 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008538: c2 04 60 04 ld [ %l1 + 4 ], %g1 200853c: 80 88 60 01 btst 1, %g1 2008540: 12 80 00 40 bne 2008640 <_Heap_Walk+0x4b4> 2008544: 80 a5 40 11 cmp %l5, %l1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2008548: e8 04 20 04 ld [ %l0 + 4 ], %l4 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200854c: d8 04 20 0c ld [ %l0 + 0xc ], %o4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008550: c2 06 20 08 ld [ %i0 + 8 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2008554: ac 0d 3f fe and %l4, -2, %l6 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008558: 1b 00 80 72 sethi %hi(0x201c800), %o5 200855c: 80 a0 40 0c cmp %g1, %o4 } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 2008560: c6 06 20 0c ld [ %i0 + 0xc ], %g3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008564: ae 04 00 16 add %l0, %l6, %l7 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2008568: 02 80 00 07 be 2008584 <_Heap_Walk+0x3f8> 200856c: 9a 13 61 98 or %o5, 0x198, %o5 "block 0x%08x: prev 0x%08x%s, next 0x%08x%s\n", block, block->prev, block->prev == first_free_block ? " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), 2008570: 1b 00 80 72 sethi %hi(0x201c800), %o5 2008574: 80 a3 00 18 cmp %o4, %i0 2008578: 02 80 00 03 be 2008584 <_Heap_Walk+0x3f8> 200857c: 9a 13 61 b0 or %o5, 0x1b0, %o5 2008580: 9a 10 00 1c mov %i4, %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008584: c2 04 20 08 ld [ %l0 + 8 ], %g1 2008588: 05 00 80 72 sethi %hi(0x201c800), %g2 200858c: 80 a0 c0 01 cmp %g3, %g1 2008590: 02 80 00 07 be 20085ac <_Heap_Walk+0x420> 2008594: 84 10 a1 c0 or %g2, 0x1c0, %g2 " (= first)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") 2008598: 05 00 80 72 sethi %hi(0x201c800), %g2 200859c: 80 a0 40 18 cmp %g1, %i0 20085a0: 02 80 00 03 be 20085ac <_Heap_Walk+0x420> 20085a4: 84 10 a1 d0 or %g2, 0x1d0, %g2 20085a8: 84 10 00 1c mov %i4, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 20085ac: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20085b0: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 20085b4: 90 10 00 19 mov %i1, %o0 20085b8: 92 10 20 00 clr %o1 20085bc: 15 00 80 72 sethi %hi(0x201c800), %o2 20085c0: 96 10 00 10 mov %l0, %o3 20085c4: 9f c4 80 00 call %l2 20085c8: 94 12 a1 e0 or %o2, 0x1e0, %o2 block->next == last_free_block ? " (= last)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 20085cc: da 05 c0 00 ld [ %l7 ], %o5 20085d0: 80 a5 80 0d cmp %l6, %o5 20085d4: 02 80 00 0c be 2008604 <_Heap_Walk+0x478> 20085d8: 90 10 00 19 mov %i1, %o0 (*printer)( 20085dc: ee 23 a0 5c st %l7, [ %sp + 0x5c ] 20085e0: 96 10 00 10 mov %l0, %o3 20085e4: 98 10 00 16 mov %l6, %o4 20085e8: 92 10 20 01 mov 1, %o1 20085ec: 15 00 80 72 sethi %hi(0x201c800), %o2 20085f0: b0 10 20 00 clr %i0 20085f4: 9f c4 80 00 call %l2 20085f8: 94 12 a2 10 or %o2, 0x210, %o2 20085fc: 81 c7 e0 08 ret 2008600: 81 e8 00 00 restore ); return false; } if ( !prev_used ) { 2008604: 80 8d 20 01 btst 1, %l4 2008608: 02 80 00 1c be 2008678 <_Heap_Walk+0x4ec> 200860c: 96 10 00 10 mov %l0, %o3 2008610: c2 06 20 08 ld [ %i0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008614: 80 a0 40 18 cmp %g1, %i0 2008618: 12 80 00 07 bne 2008634 <_Heap_Walk+0x4a8> 200861c: 80 a0 40 10 cmp %g1, %l0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008620: 10 80 00 0f b 200865c <_Heap_Walk+0x4d0> <== NOT EXECUTED 2008624: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008628: 80 a0 40 18 cmp %g1, %i0 200862c: 02 80 00 0a be 2008654 <_Heap_Walk+0x4c8> 2008630: 80 a0 40 10 cmp %g1, %l0 if ( free_block == block ) { 2008634: 32 bf ff fd bne,a 2008628 <_Heap_Walk+0x49c> 2008638: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; } while ( block != last_block ) { 200863c: 80 a5 40 11 cmp %l5, %l1 2008640: 02 bf fe e3 be 20081cc <_Heap_Walk+0x40> 2008644: a0 10 00 11 mov %l1, %l0 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 2008648: ec 04 60 04 ld [ %l1 + 4 ], %l6 200864c: 10 bf ff 8a b 2008474 <_Heap_Walk+0x2e8> 2008650: ae 0d a0 01 and %l6, 1, %l7 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008654: 90 10 00 19 mov %i1, %o0 2008658: 96 10 00 10 mov %l0, %o3 200865c: 92 10 20 01 mov 1, %o1 2008660: 15 00 80 72 sethi %hi(0x201c800), %o2 2008664: b0 10 20 00 clr %i0 2008668: 9f c4 80 00 call %l2 200866c: 94 12 a2 80 or %o2, 0x280, %o2 2008670: 81 c7 e0 08 ret 2008674: 81 e8 00 00 restore return false; } if ( !prev_used ) { (*printer)( 2008678: 92 10 20 01 mov 1, %o1 200867c: 15 00 80 72 sethi %hi(0x201c800), %o2 2008680: b0 10 20 00 clr %i0 2008684: 9f c4 80 00 call %l2 2008688: 94 12 a2 50 or %o2, 0x250, %o2 200868c: 81 c7 e0 08 ret 2008690: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( block_size, page_size ) ) { (*printer)( 2008694: 90 10 00 19 mov %i1, %o0 2008698: 96 10 00 10 mov %l0, %o3 200869c: 98 10 00 16 mov %l6, %o4 20086a0: 92 10 20 01 mov 1, %o1 20086a4: 15 00 80 72 sethi %hi(0x201c800), %o2 20086a8: b0 10 20 00 clr %i0 20086ac: 9f c4 80 00 call %l2 20086b0: 94 12 a1 00 or %o2, 0x100, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 20086b4: 81 c7 e0 08 ret 20086b8: 81 e8 00 00 restore } if ( block_size < min_block_size ) { (*printer)( 20086bc: 90 10 00 19 mov %i1, %o0 20086c0: 96 10 00 10 mov %l0, %o3 20086c4: 98 10 00 16 mov %l6, %o4 20086c8: 9a 10 00 13 mov %l3, %o5 20086cc: 92 10 20 01 mov 1, %o1 20086d0: 15 00 80 72 sethi %hi(0x201c800), %o2 20086d4: b0 10 20 00 clr %i0 20086d8: 9f c4 80 00 call %l2 20086dc: 94 12 a1 30 or %o2, 0x130, %o2 block, block_size, min_block_size ); return false; 20086e0: 81 c7 e0 08 ret 20086e4: 81 e8 00 00 restore } if ( next_block_begin <= block_begin ) { (*printer)( 20086e8: 96 10 00 10 mov %l0, %o3 20086ec: 98 10 00 11 mov %l1, %o4 20086f0: 92 10 20 01 mov 1, %o1 20086f4: 15 00 80 72 sethi %hi(0x201c800), %o2 20086f8: b0 10 20 00 clr %i0 20086fc: 9f c4 80 00 call %l2 2008700: 94 12 a1 60 or %o2, 0x160, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008704: 81 c7 e0 08 ret 2008708: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 200870c: 92 10 20 01 mov 1, %o1 2008710: 15 00 80 71 sethi %hi(0x201c400), %o2 2008714: b0 10 20 00 clr %i0 2008718: 9f c4 80 00 call %l2 200871c: 94 12 a3 d0 or %o2, 0x3d0, %o2 2008720: 81 c7 e0 08 ret 2008724: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008728: 96 10 00 11 mov %l1, %o3 200872c: 92 10 20 01 mov 1, %o1 2008730: 15 00 80 72 sethi %hi(0x201c800), %o2 2008734: b0 10 20 00 clr %i0 2008738: 9f c4 80 00 call %l2 200873c: 94 12 a0 08 or %o2, 8, %o2 2008740: 81 c7 e0 08 ret 2008744: 81 e8 00 00 restore return false; } if ( free_block->prev != prev_block ) { (*printer)( 2008748: 90 10 00 19 mov %i1, %o0 200874c: 96 10 00 11 mov %l1, %o3 2008750: 92 10 20 01 mov 1, %o1 2008754: 15 00 80 72 sethi %hi(0x201c800), %o2 2008758: b0 10 20 00 clr %i0 200875c: 9f c4 80 00 call %l2 2008760: 94 12 a0 58 or %o2, 0x58, %o2 2008764: 81 c7 e0 08 ret 2008768: 81 e8 00 00 restore return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200876c: 96 10 00 11 mov %l1, %o3 2008770: 92 10 20 01 mov 1, %o1 2008774: 15 00 80 72 sethi %hi(0x201c800), %o2 2008778: b0 10 20 00 clr %i0 200877c: 9f c4 80 00 call %l2 2008780: 94 12 a0 38 or %o2, 0x38, %o2 2008784: 81 c7 e0 08 ret 2008788: 81 e8 00 00 restore 020074d4 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 20074d4: 9d e3 bf 90 save %sp, -112, %sp minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 20074d8: e8 06 20 34 ld [ %i0 + 0x34 ], %l4 20074dc: 80 a5 20 00 cmp %l4, 0 20074e0: 02 80 00 ab be 200778c <_Objects_Extend_information+0x2b8> 20074e4: e6 16 20 0a lduh [ %i0 + 0xa ], %l3 block_count = 0; else { block_count = information->maximum / information->allocation_size; 20074e8: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 20074ec: e4 16 20 14 lduh [ %i0 + 0x14 ], %l2 20074f0: ab 2d 60 10 sll %l5, 0x10, %l5 20074f4: 92 10 00 12 mov %l2, %o1 20074f8: 40 00 47 81 call 20192fc <.udiv> 20074fc: 91 35 60 10 srl %l5, 0x10, %o0 2007500: 91 2a 20 10 sll %o0, 0x10, %o0 2007504: b9 32 20 10 srl %o0, 0x10, %i4 for ( ; block < block_count; block++ ) { 2007508: 80 a7 20 00 cmp %i4, 0 200750c: 02 80 00 a7 be 20077a8 <_Objects_Extend_information+0x2d4> 2007510: 90 10 00 12 mov %l2, %o0 if ( information->object_blocks[ block ] == NULL ) 2007514: c2 05 00 00 ld [ %l4 ], %g1 2007518: 80 a0 60 00 cmp %g1, 0 200751c: 02 80 00 a4 be 20077ac <_Objects_Extend_information+0x2d8> 2007520: a2 10 00 13 mov %l3, %l1 2007524: 10 80 00 06 b 200753c <_Objects_Extend_information+0x68> 2007528: a0 10 20 00 clr %l0 200752c: c2 05 00 01 ld [ %l4 + %g1 ], %g1 2007530: 80 a0 60 00 cmp %g1, 0 2007534: 22 80 00 08 be,a 2007554 <_Objects_Extend_information+0x80> 2007538: ab 35 60 10 srl %l5, 0x10, %l5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 200753c: a0 04 20 01 inc %l0 if ( information->object_blocks[ block ] == NULL ) break; else index_base += information->allocation_size; 2007540: a2 04 40 12 add %l1, %l2, %l1 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007544: 80 a7 00 10 cmp %i4, %l0 2007548: 18 bf ff f9 bgu 200752c <_Objects_Extend_information+0x58> 200754c: 83 2c 20 02 sll %l0, 2, %g1 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007550: ab 35 60 10 srl %l5, 0x10, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2007554: 03 00 00 3f sethi %hi(0xfc00), %g1 else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007558: aa 05 40 08 add %l5, %o0, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 200755c: 82 10 63 ff or %g1, 0x3ff, %g1 2007560: 80 a5 40 01 cmp %l5, %g1 2007564: 18 80 00 96 bgu 20077bc <_Objects_Extend_information+0x2e8> 2007568: 01 00 00 00 nop /* * Allocate the name table, and the objects and if it fails either return or * generate a fatal error depending on auto-extending being active. */ block_size = information->allocation_size * information->size; 200756c: 40 00 47 2a call 2019214 <.umul> 2007570: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007574: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007578: 80 a0 60 00 cmp %g1, 0 200757c: 12 80 00 6d bne 2007730 <_Objects_Extend_information+0x25c> 2007580: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 2007584: 40 00 09 06 call 200999c <_Workspace_Allocate_or_fatal_error> 2007588: 01 00 00 00 nop 200758c: a4 10 00 08 mov %o0, %l2 } /* * If the index_base is the maximum we need to grow the tables. */ if (index_base >= information->maximum ) { 2007590: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007594: 80 a4 40 01 cmp %l1, %g1 2007598: 2a 80 00 43 bcs,a 20076a4 <_Objects_Extend_information+0x1d0> 200759c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 20075a0: a8 07 20 01 add %i4, 1, %l4 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 20075a4: 91 2d 20 01 sll %l4, 1, %o0 20075a8: 90 02 00 14 add %o0, %l4, %o0 20075ac: 90 05 40 08 add %l5, %o0, %o0 20075b0: 90 02 00 13 add %o0, %l3, %o0 20075b4: 40 00 09 09 call 20099d8 <_Workspace_Allocate> 20075b8: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 20075bc: ac 92 20 00 orcc %o0, 0, %l6 20075c0: 02 80 00 7d be 20077b4 <_Objects_Extend_information+0x2e0> 20075c4: a9 2d 20 02 sll %l4, 2, %l4 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 20075c8: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 20075cc: 80 a4 c0 01 cmp %l3, %g1 RTEMS_INLINE_ROUTINE void *_Addresses_Add_offset ( const void *base, uintptr_t offset ) { return (void *)((uintptr_t)base + offset); 20075d0: ae 05 80 14 add %l6, %l4, %l7 20075d4: 0a 80 00 5e bcs 200774c <_Objects_Extend_information+0x278> 20075d8: a8 05 c0 14 add %l7, %l4, %l4 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20075dc: 80 a4 e0 00 cmp %l3, 0 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20075e0: 82 10 20 00 clr %g1 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20075e4: 02 80 00 08 be 2007604 <_Objects_Extend_information+0x130> 20075e8: bb 2f 20 02 sll %i4, 2, %i5 local_table[ index ] = NULL; 20075ec: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20075f0: 82 00 60 01 inc %g1 20075f4: 80 a4 c0 01 cmp %l3, %g1 20075f8: 18 bf ff fd bgu 20075ec <_Objects_Extend_information+0x118> 20075fc: c0 20 80 14 clr [ %g2 + %l4 ] 2007600: bb 2f 20 02 sll %i4, 2, %i5 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007604: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; 2007608: c0 25 c0 1d clr [ %l7 + %i5 ] for ( index=index_base ; index < ( information->allocation_size + index_base ); 200760c: 86 04 40 03 add %l1, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007610: 80 a4 40 03 cmp %l1, %g3 2007614: 1a 80 00 0a bcc 200763c <_Objects_Extend_information+0x168> 2007618: c0 25 80 1d clr [ %l6 + %i5 ] 200761c: 85 2c 60 02 sll %l1, 2, %g2 2007620: 82 10 00 11 mov %l1, %g1 2007624: 84 05 00 02 add %l4, %g2, %g2 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2007628: c0 20 80 00 clr [ %g2 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 200762c: 82 00 60 01 inc %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2007630: 80 a0 40 03 cmp %g1, %g3 2007634: 0a bf ff fd bcs 2007628 <_Objects_Extend_information+0x154> 2007638: 84 00 a0 04 add %g2, 4, %g2 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 200763c: 7f ff eb 1c call 20022ac 2007640: 01 00 00 00 nop information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007644: c6 06 00 00 ld [ %i0 ], %g3 2007648: c4 16 20 04 lduh [ %i0 + 4 ], %g2 old_tables = information->object_blocks; information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 200764c: ea 36 20 10 sth %l5, [ %i0 + 0x10 ] local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2007650: e6 06 20 34 ld [ %i0 + 0x34 ], %l3 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; 2007654: ee 26 20 30 st %l7, [ %i0 + 0x30 ] information->local_table = local_table; 2007658: e8 26 20 1c st %l4, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 200765c: 87 28 e0 18 sll %g3, 0x18, %g3 2007660: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2007664: ec 26 20 34 st %l6, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2007668: ab 2d 60 10 sll %l5, 0x10, %l5 200766c: 03 00 00 40 sethi %hi(0x10000), %g1 2007670: ab 35 60 10 srl %l5, 0x10, %l5 2007674: 82 10 c0 01 or %g3, %g1, %g1 2007678: 82 10 40 02 or %g1, %g2, %g1 200767c: 82 10 40 15 or %g1, %l5, %g1 2007680: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2007684: 7f ff eb 0e call 20022bc 2007688: 01 00 00 00 nop if ( old_tables ) 200768c: 80 a4 e0 00 cmp %l3, 0 2007690: 22 80 00 05 be,a 20076a4 <_Objects_Extend_information+0x1d0> 2007694: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 _Workspace_Free( old_tables ); 2007698: 40 00 08 d9 call 20099fc <_Workspace_Free> 200769c: 90 10 00 13 mov %l3, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20076a0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20076a4: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 20076a8: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 20076ac: 92 10 00 12 mov %l2, %o1 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20076b0: a1 2c 20 02 sll %l0, 2, %l0 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20076b4: a6 06 20 20 add %i0, 0x20, %l3 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20076b8: e4 20 40 10 st %l2, [ %g1 + %l0 ] */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { the_object->id = _Objects_Build_id( 20076bc: 29 00 00 40 sethi %hi(0x10000), %l4 information->object_blocks[ block ] = new_object_block; /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20076c0: a4 07 bf f4 add %fp, -12, %l2 20076c4: 40 00 14 c3 call 200c9d0 <_Chain_Initialize> 20076c8: 90 10 00 12 mov %l2, %o0 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20076cc: 30 80 00 0c b,a 20076fc <_Objects_Extend_information+0x228> the_object->id = _Objects_Build_id( 20076d0: c4 16 20 04 lduh [ %i0 + 4 ], %g2 20076d4: 83 28 60 18 sll %g1, 0x18, %g1 20076d8: 85 28 a0 1b sll %g2, 0x1b, %g2 20076dc: 82 10 40 14 or %g1, %l4, %g1 20076e0: 82 10 40 02 or %g1, %g2, %g1 20076e4: 82 10 40 11 or %g1, %l1, %g1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20076e8: 92 10 00 08 mov %o0, %o1 */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { the_object->id = _Objects_Build_id( 20076ec: c2 22 20 08 st %g1, [ %o0 + 8 ] index ); _Chain_Append( &information->Inactive, &the_object->Node ); index++; 20076f0: a2 04 60 01 inc %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20076f4: 7f ff fc e2 call 2006a7c <_Chain_Append> 20076f8: 90 10 00 13 mov %l3, %o0 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20076fc: 40 00 14 a2 call 200c984 <_Chain_Get> 2007700: 90 10 00 12 mov %l2, %o0 2007704: 80 a2 20 00 cmp %o0, 0 2007708: 32 bf ff f2 bne,a 20076d0 <_Objects_Extend_information+0x1fc> 200770c: c2 06 00 00 ld [ %i0 ], %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2007710: c2 16 20 2c lduh [ %i0 + 0x2c ], %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007714: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2007718: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 information->inactive = 200771c: 82 01 00 01 add %g4, %g1, %g1 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2007720: c8 20 80 10 st %g4, [ %g2 + %l0 ] information->inactive = 2007724: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2007728: 81 c7 e0 08 ret 200772c: 81 e8 00 00 restore * Allocate the name table, and the objects and if it fails either return or * generate a fatal error depending on auto-extending being active. */ block_size = information->allocation_size * information->size; if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); 2007730: 40 00 08 aa call 20099d8 <_Workspace_Allocate> 2007734: 01 00 00 00 nop if ( !new_object_block ) 2007738: a4 92 20 00 orcc %o0, 0, %l2 200773c: 32 bf ff 96 bne,a 2007594 <_Objects_Extend_information+0xc0> 2007740: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2007744: 81 c7 e0 08 ret 2007748: 81 e8 00 00 restore /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 200774c: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2007750: bb 2f 20 02 sll %i4, 2, %i5 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2007754: 40 00 23 f2 call 201071c 2007758: 94 10 00 1d mov %i5, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 200775c: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2007760: 94 10 00 1d mov %i5, %o2 2007764: 40 00 23 ee call 201071c 2007768: 90 10 00 17 mov %l7, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 200776c: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 2007770: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 2007774: 94 04 c0 0a add %l3, %o2, %o2 2007778: 90 10 00 14 mov %l4, %o0 200777c: 40 00 23 e8 call 201071c 2007780: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2007784: 10 bf ff a1 b 2007608 <_Objects_Extend_information+0x134> 2007788: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 200778c: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 2007790: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 2007794: ab 2d 60 10 sll %l5, 0x10, %l5 2007798: a2 10 00 13 mov %l3, %l1 200779c: a0 10 20 00 clr %l0 20077a0: 10 bf ff 6c b 2007550 <_Objects_Extend_information+0x7c> 20077a4: b8 10 20 00 clr %i4 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) 20077a8: a2 10 00 13 mov %l3, %l1 <== NOT EXECUTED 20077ac: 10 bf ff 69 b 2007550 <_Objects_Extend_information+0x7c> <== NOT EXECUTED 20077b0: a0 10 20 00 clr %l0 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 20077b4: 40 00 08 92 call 20099fc <_Workspace_Free> 20077b8: 90 10 00 12 mov %l2, %o0 return; 20077bc: 81 c7 e0 08 ret 20077c0: 81 e8 00 00 restore 02007be0 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2007be0: 9d e3 bf a0 save %sp, -96, %sp /* * Search the list to find block or chunk with all objects inactive. */ index_base = _Objects_Get_index( information->minimum_id ); 2007be4: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 block_count = (information->maximum - index_base) / 2007be8: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 2007bec: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2007bf0: 92 10 00 11 mov %l1, %o1 2007bf4: 40 00 45 c2 call 20192fc <.udiv> 2007bf8: 90 22 00 10 sub %o0, %l0, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2007bfc: 80 a2 20 00 cmp %o0, 0 2007c00: 02 80 00 12 be 2007c48 <_Objects_Shrink_information+0x68> 2007c04: a4 10 20 04 mov 4, %l2 if ( information->inactive_per_block[ block ] == 2007c08: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 2007c0c: c4 00 c0 00 ld [ %g3 ], %g2 2007c10: 80 a4 40 02 cmp %l1, %g2 2007c14: 12 80 00 09 bne 2007c38 <_Objects_Shrink_information+0x58> 2007c18: 82 10 20 00 clr %g1 2007c1c: 10 80 00 0d b 2007c50 <_Objects_Shrink_information+0x70> <== NOT EXECUTED 2007c20: a4 10 20 00 clr %l2 <== NOT EXECUTED information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 2007c24: a0 04 00 11 add %l0, %l1, %l0 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 2007c28: 80 a4 40 02 cmp %l1, %g2 2007c2c: 02 80 00 09 be 2007c50 <_Objects_Shrink_information+0x70> 2007c30: 84 04 a0 04 add %l2, 4, %g2 2007c34: a4 10 00 02 mov %g2, %l2 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2007c38: 82 00 60 01 inc %g1 2007c3c: 80 a2 00 01 cmp %o0, %g1 2007c40: 38 bf ff f9 bgu,a 2007c24 <_Objects_Shrink_information+0x44> 2007c44: c4 00 c0 12 ld [ %g3 + %l2 ], %g2 2007c48: 81 c7 e0 08 ret 2007c4c: 81 e8 00 00 restore information->allocation_size ) { /* * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; 2007c50: 10 80 00 06 b 2007c68 <_Objects_Shrink_information+0x88> 2007c54: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2007c58: 80 a4 60 00 cmp %l1, 0 2007c5c: 22 80 00 12 be,a 2007ca4 <_Objects_Shrink_information+0xc4> 2007c60: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2007c64: 90 10 00 11 mov %l1, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; do { index = _Objects_Get_index( the_object->id ); 2007c68: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2007c6c: 80 a0 40 10 cmp %g1, %l0 2007c70: 0a bf ff fa bcs 2007c58 <_Objects_Shrink_information+0x78> 2007c74: e2 02 00 00 ld [ %o0 ], %l1 (index < (index_base + information->allocation_size))) { 2007c78: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2007c7c: 84 04 00 02 add %l0, %g2, %g2 2007c80: 80 a0 40 02 cmp %g1, %g2 2007c84: 1a bf ff f6 bcc 2007c5c <_Objects_Shrink_information+0x7c> 2007c88: 80 a4 60 00 cmp %l1, 0 _Chain_Extract( &extract_me->Node ); 2007c8c: 40 00 13 34 call 200c95c <_Chain_Extract> 2007c90: 01 00 00 00 nop } } while ( the_object ); 2007c94: 80 a4 60 00 cmp %l1, 0 2007c98: 12 bf ff f4 bne 2007c68 <_Objects_Shrink_information+0x88> 2007c9c: 90 10 00 11 mov %l1, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2007ca0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2007ca4: 40 00 07 56 call 20099fc <_Workspace_Free> 2007ca8: d0 00 40 12 ld [ %g1 + %l2 ], %o0 information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2007cac: c6 16 20 2c lduh [ %i0 + 0x2c ], %g3 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 2007cb0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; 2007cb4: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 information->inactive -= information->allocation_size; 2007cb8: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; 2007cbc: c0 21 00 12 clr [ %g4 + %l2 ] information->inactive -= information->allocation_size; 2007cc0: 84 20 c0 02 sub %g3, %g2, %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 2007cc4: c0 20 40 12 clr [ %g1 + %l2 ] information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2007cc8: c4 36 20 2c sth %g2, [ %i0 + 0x2c ] return; 2007ccc: 81 c7 e0 08 ret 2007cd0: 81 e8 00 00 restore 0200c2c4 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200c2c4: c4 02 21 6c ld [ %o0 + 0x16c ], %g2 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 200c2c8: c6 00 a0 88 ld [ %g2 + 0x88 ], %g3 200c2cc: 05 00 80 70 sethi %hi(0x201c000), %g2 200c2d0: d2 08 a2 24 ldub [ %g2 + 0x224 ], %o1 ! 201c224 */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200c2d4: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200c2d8: 92 22 40 03 sub %o1, %g3, %o1 /* * This will prevent the thread from consuming its entire "budget" * while at low priority. */ the_thread->cpu_time_budget = 0xFFFFFFFF; /* XXX should be based on MAX_U32 */ 200c2dc: 86 10 3f ff mov -1, %g3 new_priority = _POSIX_Priority_To_core(api->schedparam.sched_ss_low_priority); the_thread->real_priority = new_priority; 200c2e0: d2 22 20 18 st %o1, [ %o0 + 0x18 ] */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200c2e4: 80 a0 a0 00 cmp %g2, 0 200c2e8: 12 80 00 06 bne 200c300 <_POSIX_Threads_Sporadic_budget_callout+0x3c> 200c2ec: c6 22 20 78 st %g3, [ %o0 + 0x78 ] /* * Make sure we are actually lowering it. If they have lowered it * to logically lower than sched_ss_low_priority, then we do not want to * change it. */ if ( the_thread->current_priority < new_priority ) { 200c2f0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200c2f4: 80 a0 40 09 cmp %g1, %o1 200c2f8: 0a 80 00 04 bcs 200c308 <_POSIX_Threads_Sporadic_budget_callout+0x44> 200c2fc: 94 10 20 01 mov 1, %o2 200c300: 81 c3 e0 08 retl <== NOT EXECUTED 200c304: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200c308: 82 13 c0 00 mov %o7, %g1 200c30c: 7f ff ee 8b call 2007d38 <_Thread_Change_priority> 200c310: 9e 10 40 00 mov %g1, %o7 02006254 <_POSIX_Timer_TSR>: * This is the operation that is run when a timer expires */ void _POSIX_Timer_TSR( Objects_Id timer __attribute__((unused)), void *data) { 2006254: 9d e3 bf a0 save %sp, -96, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2006258: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 200625c: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2006260: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006264: 80 a0 60 00 cmp %g1, 0 2006268: 12 80 00 0e bne 20062a0 <_POSIX_Timer_TSR+0x4c> 200626c: c4 26 60 68 st %g2, [ %i1 + 0x68 ] ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { 2006270: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2006274: 80 a0 60 00 cmp %g1, 0 2006278: 32 80 00 0b bne,a 20062a4 <_POSIX_Timer_TSR+0x50> 200627c: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; } else { /* Indicates that the timer is stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006280: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 2006284: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] <== NOT EXECUTED /* * The sending of the signal to the process running the handling function * specified for that signal is simulated */ if ( pthread_kill ( ptimer->thread_id, ptimer->inf.sigev_signo ) ) { 2006288: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 200628c: 40 00 1a a2 call 200cd14 2006290: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 2006294: c0 26 60 68 clr [ %i1 + 0x68 ] 2006298: 81 c7 e0 08 ret 200629c: 81 e8 00 00 restore ptimer->overrun = ptimer->overrun + 1; /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 20062a0: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 20062a4: d4 06 60 08 ld [ %i1 + 8 ], %o2 20062a8: 90 06 60 10 add %i1, 0x10, %o0 20062ac: 17 00 80 18 sethi %hi(0x2006000), %o3 20062b0: 98 10 00 19 mov %i1, %o4 20062b4: 40 00 1b c6 call 200d1cc <_POSIX_Timer_Insert_helper> 20062b8: 96 12 e2 54 or %o3, 0x254, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 20062bc: 80 8a 20 ff btst 0xff, %o0 20062c0: 02 bf ff f6 be 2006298 <_POSIX_Timer_TSR+0x44> 20062c4: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 20062c8: 40 00 05 da call 2007a30 <_TOD_Get> 20062cc: 90 06 60 6c add %i1, 0x6c, %o0 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20062d0: 82 10 20 03 mov 3, %g1 /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 20062d4: 10 bf ff ed b 2006288 <_POSIX_Timer_TSR+0x34> 20062d8: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] 0200fa4c <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200fa4c: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200fa50: 7f ff ca 17 call 20022ac 200fa54: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200fa58: 85 2e 20 04 sll %i0, 4, %g2 200fa5c: 83 2e 20 02 sll %i0, 2, %g1 200fa60: 82 20 80 01 sub %g2, %g1, %g1 200fa64: 05 00 80 74 sethi %hi(0x201d000), %g2 200fa68: 84 10 a2 d4 or %g2, 0x2d4, %g2 ! 201d2d4 <_POSIX_signals_Vectors> 200fa6c: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200fa70: 80 a0 a0 02 cmp %g2, 2 200fa74: 02 80 00 11 be 200fab8 <_POSIX_signals_Clear_process_signals+0x6c> 200fa78: 05 00 80 75 sethi %hi(0x201d400), %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200fa7c: 05 00 80 75 sethi %hi(0x201d400), %g2 200fa80: c6 00 a0 c8 ld [ %g2 + 0xc8 ], %g3 ! 201d4c8 <_POSIX_signals_Pending> 200fa84: b0 06 3f ff add %i0, -1, %i0 200fa88: 82 10 20 01 mov 1, %g1 200fa8c: 83 28 40 18 sll %g1, %i0, %g1 200fa90: 82 28 c0 01 andn %g3, %g1, %g1 if ( !_POSIX_signals_Pending ) 200fa94: 80 a0 60 00 cmp %g1, 0 200fa98: 12 80 00 06 bne 200fab0 <_POSIX_signals_Clear_process_signals+0x64> 200fa9c: c2 20 a0 c8 st %g1, [ %g2 + 0xc8 ] _Thread_Do_post_task_switch_extension--; 200faa0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200faa4: c4 00 61 e4 ld [ %g1 + 0x1e4 ], %g2 ! 201cde4 <_Thread_Do_post_task_switch_extension> 200faa8: 84 00 bf ff add %g2, -1, %g2 200faac: c4 20 61 e4 st %g2, [ %g1 + 0x1e4 ] } _ISR_Enable( level ); 200fab0: 7f ff ca 03 call 20022bc 200fab4: 91 e8 00 08 restore %g0, %o0, %o0 ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200fab8: 84 10 a0 cc or %g2, 0xcc, %g2 200fabc: c6 00 40 02 ld [ %g1 + %g2 ], %g3 200fac0: 82 00 40 02 add %g1, %g2, %g1 200fac4: 82 00 60 04 add %g1, 4, %g1 200fac8: 80 a0 c0 01 cmp %g3, %g1 200facc: 02 bf ff ed be 200fa80 <_POSIX_signals_Clear_process_signals+0x34> 200fad0: 05 00 80 75 sethi %hi(0x201d400), %g2 if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; if ( !_POSIX_signals_Pending ) _Thread_Do_post_task_switch_extension--; } _ISR_Enable( level ); 200fad4: 7f ff c9 fa call 20022bc <== NOT EXECUTED 200fad8: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 0200fb20 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 200fb20: 9d e3 bf a0 save %sp, -96, %sp /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 200fb24: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200fb28: 05 04 00 20 sethi %hi(0x10008000), %g2 200fb2c: 88 06 7f ff add %i1, -1, %g4 200fb30: 9a 08 40 02 and %g1, %g2, %o5 200fb34: 86 10 20 01 mov 1, %g3 200fb38: 80 a3 40 02 cmp %o5, %g2 200fb3c: 89 28 c0 04 sll %g3, %g4, %g4 200fb40: 02 80 00 25 be 200fbd4 <_POSIX_signals_Unblock_thread+0xb4> 200fb44: c4 06 21 6c ld [ %i0 + 0x16c ], %g2 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 200fb48: c4 00 a0 cc ld [ %g2 + 0xcc ], %g2 200fb4c: 80 a9 00 02 andncc %g4, %g2, %g0 200fb50: 02 80 00 1f be 200fbcc <_POSIX_signals_Unblock_thread+0xac> 200fb54: 05 04 00 00 sethi %hi(0x10000000), %g2 * + Any other combination, do nothing. */ the_thread->do_post_task_switch_extension = true; if ( the_thread->current_state & STATES_INTERRUPTIBLE_BY_SIGNAL ) { 200fb58: 80 88 40 02 btst %g1, %g2 200fb5c: 02 80 00 11 be 200fba0 <_POSIX_signals_Unblock_thread+0x80> 200fb60: c6 2e 20 74 stb %g3, [ %i0 + 0x74 ] the_thread->Wait.return_code = EINTR; 200fb64: 84 10 20 04 mov 4, %g2 #if 0 if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); else #endif if ( _States_Is_delaying(the_thread->current_state) ){ 200fb68: 80 88 60 08 btst 8, %g1 200fb6c: 02 80 00 18 be 200fbcc <_POSIX_signals_Unblock_thread+0xac> 200fb70: c4 26 20 34 st %g2, [ %i0 + 0x34 ] if ( _Watchdog_Is_active( &the_thread->Timer ) ) 200fb74: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200fb78: 80 a0 60 02 cmp %g1, 2 200fb7c: 02 80 00 36 be 200fc54 <_POSIX_signals_Unblock_thread+0x134> 200fb80: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 200fb84: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200fb88: 13 04 00 ff sethi %hi(0x1003fc00), %o1 200fb8c: b0 10 20 00 clr %i0 200fb90: 7f ff e0 ee call 2007f48 <_Thread_Clear_state> 200fb94: 92 12 63 f8 or %o1, 0x3f8, %o1 200fb98: 81 c7 e0 08 ret 200fb9c: 81 e8 00 00 restore (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 200fba0: 80 a0 60 00 cmp %g1, 0 200fba4: 12 80 00 0a bne 200fbcc <_POSIX_signals_Unblock_thread+0xac> 200fba8: 03 00 80 73 sethi %hi(0x201cc00), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 200fbac: c2 00 61 dc ld [ %g1 + 0x1dc ], %g1 ! 201cddc <_ISR_Nest_level> 200fbb0: 80 a0 60 00 cmp %g1, 0 200fbb4: 02 80 00 06 be 200fbcc <_POSIX_signals_Unblock_thread+0xac> 200fbb8: 03 00 80 73 sethi %hi(0x201cc00), %g1 200fbbc: c2 00 62 00 ld [ %g1 + 0x200 ], %g1 ! 201ce00 <_Thread_Executing> 200fbc0: 80 a6 00 01 cmp %i0, %g1 200fbc4: 02 80 00 21 be 200fc48 <_POSIX_signals_Unblock_thread+0x128> 200fbc8: 03 00 80 73 sethi %hi(0x201cc00), %g1 _ISR_Signals_to_thread_executing = true; } } return false; } 200fbcc: 81 c7 e0 08 ret 200fbd0: 91 e8 20 00 restore %g0, 0, %o0 * 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) ) { 200fbd4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200fbd8: 80 89 00 01 btst %g4, %g1 200fbdc: 22 80 00 12 be,a 200fc24 <_POSIX_signals_Unblock_thread+0x104> 200fbe0: c2 00 a0 cc ld [ %g2 + 0xcc ], %g1 the_thread->Wait.return_code = EINTR; 200fbe4: 82 10 20 04 mov 4, %g1 200fbe8: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 200fbec: 80 a6 a0 00 cmp %i2, 0 200fbf0: 02 80 00 11 be 200fc34 <_POSIX_signals_Unblock_thread+0x114> 200fbf4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 the_info->si_signo = signo; the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; } else { *the_info = *info; 200fbf8: c4 06 80 00 ld [ %i2 ], %g2 200fbfc: c4 20 40 00 st %g2, [ %g1 ] 200fc00: c4 06 a0 04 ld [ %i2 + 4 ], %g2 200fc04: c4 20 60 04 st %g2, [ %g1 + 4 ] 200fc08: c4 06 a0 08 ld [ %i2 + 8 ], %g2 200fc0c: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 200fc10: 90 10 00 18 mov %i0, %o0 200fc14: 7f ff e4 04 call 2008c24 <_Thread_queue_Extract_with_proxy> 200fc18: b0 10 20 01 mov 1, %i0 return true; 200fc1c: 81 c7 e0 08 ret 200fc20: 81 e8 00 00 restore * 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) ) { 200fc24: 80 a9 00 01 andncc %g4, %g1, %g0 200fc28: 12 bf ff f0 bne 200fbe8 <_POSIX_signals_Unblock_thread+0xc8> 200fc2c: 82 10 20 04 mov 4, %g1 200fc30: 30 bf ff e7 b,a 200fbcc <_POSIX_signals_Unblock_thread+0xac> the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 200fc34: 84 10 20 01 mov 1, %g2 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 200fc38: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; 200fc3c: c0 20 60 08 clr [ %g1 + 8 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 200fc40: 10 bf ff f4 b 200fc10 <_POSIX_signals_Unblock_thread+0xf0> 200fc44: c4 20 60 04 st %g2, [ %g1 + 4 ] (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 ) ) _ISR_Signals_to_thread_executing = true; 200fc48: c6 28 62 98 stb %g3, [ %g1 + 0x298 ] 200fc4c: 81 c7 e0 08 ret 200fc50: 91 e8 20 00 restore %g0, 0, %o0 _Thread_queue_Extract_with_proxy( the_thread ); else #endif if ( _States_Is_delaying(the_thread->current_state) ){ if ( _Watchdog_Is_active( &the_thread->Timer ) ) (void) _Watchdog_Remove( &the_thread->Timer ); 200fc54: 7f ff e6 f2 call 200981c <_Watchdog_Remove> 200fc58: 90 06 20 48 add %i0, 0x48, %o0 200fc5c: 10 bf ff cb b 200fb88 <_POSIX_signals_Unblock_thread+0x68> 200fc60: 90 10 00 18 mov %i0, %o0 02007d38 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2007d38: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 2007d3c: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 2007d40: 40 00 04 90 call 2008f80 <_Thread_Set_transient> 2007d44: 90 10 00 18 mov %i0, %o0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 2007d48: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007d4c: 80 a0 40 19 cmp %g1, %i1 2007d50: 02 80 00 05 be 2007d64 <_Thread_Change_priority+0x2c> 2007d54: a0 10 00 18 mov %i0, %l0 _Thread_Set_priority( the_thread, new_priority ); 2007d58: 92 10 00 19 mov %i1, %o1 2007d5c: 40 00 04 0d call 2008d90 <_Thread_Set_priority> 2007d60: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 2007d64: 7f ff e9 52 call 20022ac 2007d68: 01 00 00 00 nop 2007d6c: b0 10 00 08 mov %o0, %i0 /* * If the thread has more than STATES_TRANSIENT set, then it is blocked, * If it is blocked on a thread queue, then we need to requeue it. */ state = the_thread->current_state; 2007d70: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 if ( state != STATES_TRANSIENT ) { 2007d74: 80 a4 a0 04 cmp %l2, 4 2007d78: 02 80 00 18 be 2007dd8 <_Thread_Change_priority+0xa0> 2007d7c: 80 8c 60 04 btst 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2007d80: 02 80 00 0b be 2007dac <_Thread_Change_priority+0x74> 2007d84: 82 0c bf fb and %l2, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2007d88: 7f ff e9 4d call 20022bc <== NOT EXECUTED 2007d8c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2007d90: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 2007d94: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED 2007d98: 80 8c 80 01 btst %l2, %g1 <== NOT EXECUTED 2007d9c: 32 80 00 0d bne,a 2007dd0 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2007da0: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 <== NOT EXECUTED 2007da4: 81 c7 e0 08 ret 2007da8: 81 e8 00 00 restore */ state = the_thread->current_state; if ( state != STATES_TRANSIENT ) { /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2007dac: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 2007db0: 7f ff e9 43 call 20022bc 2007db4: 90 10 00 18 mov %i0, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2007db8: 03 00 00 ef sethi %hi(0x3bc00), %g1 2007dbc: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2007dc0: 80 8c 80 01 btst %l2, %g1 2007dc4: 02 bf ff f8 be 2007da4 <_Thread_Change_priority+0x6c> 2007dc8: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2007dcc: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 2007dd0: 40 00 03 c0 call 2008cd0 <_Thread_queue_Requeue> 2007dd4: 93 e8 00 10 restore %g0, %l0, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 2007dd8: 12 80 00 14 bne 2007e28 <_Thread_Change_priority+0xf0> 2007ddc: 23 00 80 73 sethi %hi(0x201cc00), %l1 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 2007de0: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 2007de4: c4 14 20 96 lduh [ %l0 + 0x96 ], %g2 2007de8: c6 10 40 00 lduh [ %g1 ], %g3 * Interrupts are STILL disabled. * We now know the thread will be in the READY state when we remove * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2007dec: c0 24 20 10 clr [ %l0 + 0x10 ] 2007df0: 84 10 c0 02 or %g3, %g2, %g2 2007df4: c4 30 40 00 sth %g2, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 2007df8: c4 14 61 f4 lduh [ %l1 + 0x1f4 ], %g2 2007dfc: c2 14 20 94 lduh [ %l0 + 0x94 ], %g1 _Priority_Add_to_bit_map( &the_thread->Priority_map ); if ( prepend_it ) 2007e00: 80 8e a0 ff btst 0xff, %i2 2007e04: 82 10 80 01 or %g2, %g1, %g1 2007e08: c2 34 61 f4 sth %g1, [ %l1 + 0x1f4 ] 2007e0c: 02 80 00 48 be 2007f2c <_Thread_Change_priority+0x1f4> 2007e10: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2007e14: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2007e18: c2 24 20 04 st %g1, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2007e1c: e0 20 40 00 st %l0, [ %g1 ] the_node->next = before_node; before_node->previous = the_node; 2007e20: e0 20 a0 04 st %l0, [ %g2 + 4 ] Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; after_node->next = the_node; the_node->next = before_node; 2007e24: c4 24 00 00 st %g2, [ %l0 ] _Chain_Prepend_unprotected( the_thread->ready, &the_thread->Object.Node ); else _Chain_Append_unprotected( the_thread->ready, &the_thread->Object.Node ); } _ISR_Flash( level ); 2007e28: 7f ff e9 25 call 20022bc 2007e2c: 90 10 00 18 mov %i0, %o0 2007e30: 7f ff e9 1f call 20022ac 2007e34: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2007e38: c2 14 61 f4 lduh [ %l1 + 0x1f4 ], %g1 */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) _Thread_Ready_chain[ _Priority_Get_highest() ].first; 2007e3c: 05 00 80 73 sethi %hi(0x201cc00), %g2 2007e40: 83 28 60 10 sll %g1, 0x10, %g1 2007e44: da 00 a0 94 ld [ %g2 + 0x94 ], %o5 2007e48: 85 30 60 10 srl %g1, 0x10, %g2 2007e4c: 80 a0 a0 ff cmp %g2, 0xff 2007e50: 08 80 00 27 bleu 2007eec <_Thread_Change_priority+0x1b4> 2007e54: 07 00 80 6c sethi %hi(0x201b000), %g3 2007e58: 83 30 60 18 srl %g1, 0x18, %g1 2007e5c: 86 10 e1 f0 or %g3, 0x1f0, %g3 2007e60: c4 08 c0 01 ldub [ %g3 + %g1 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007e64: 09 00 80 73 sethi %hi(0x201cc00), %g4 2007e68: 85 28 a0 10 sll %g2, 0x10, %g2 2007e6c: 88 11 22 70 or %g4, 0x270, %g4 2007e70: 83 30 a0 0f srl %g2, 0xf, %g1 2007e74: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 2007e78: 83 28 60 10 sll %g1, 0x10, %g1 2007e7c: 89 30 60 10 srl %g1, 0x10, %g4 2007e80: 80 a1 20 ff cmp %g4, 0xff 2007e84: 18 80 00 28 bgu 2007f24 <_Thread_Change_priority+0x1ec> 2007e88: 83 30 60 18 srl %g1, 0x18, %g1 2007e8c: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 2007e90: 82 00 60 08 add %g1, 8, %g1 * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 2007e94: 85 30 a0 0c srl %g2, 0xc, %g2 2007e98: 83 28 60 10 sll %g1, 0x10, %g1 2007e9c: 83 30 60 10 srl %g1, 0x10, %g1 2007ea0: 82 00 40 02 add %g1, %g2, %g1 2007ea4: 85 28 60 04 sll %g1, 4, %g2 2007ea8: 83 28 60 02 sll %g1, 2, %g1 2007eac: 82 20 80 01 sub %g2, %g1, %g1 2007eb0: c2 03 40 01 ld [ %o5 + %g1 ], %g1 * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 2007eb4: 05 00 80 73 sethi %hi(0x201cc00), %g2 2007eb8: c4 00 a2 00 ld [ %g2 + 0x200 ], %g2 ! 201ce00 <_Thread_Executing> * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 2007ebc: 07 00 80 73 sethi %hi(0x201cc00), %g3 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Thread_Calculate_heir(); if ( !_Thread_Is_executing_also_the_heir() && 2007ec0: 80 a0 40 02 cmp %g1, %g2 2007ec4: 02 80 00 08 be 2007ee4 <_Thread_Change_priority+0x1ac> 2007ec8: c2 20 e1 d0 st %g1, [ %g3 + 0x1d0 ] _Thread_Executing->is_preemptible ) 2007ecc: c2 08 a0 75 ldub [ %g2 + 0x75 ], %g1 2007ed0: 80 a0 60 00 cmp %g1, 0 2007ed4: 02 80 00 04 be 2007ee4 <_Thread_Change_priority+0x1ac> 2007ed8: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 2007edc: 03 00 80 73 sethi %hi(0x201cc00), %g1 2007ee0: c4 28 62 10 stb %g2, [ %g1 + 0x210 ] ! 201ce10 <_Context_Switch_necessary> _ISR_Enable( level ); 2007ee4: 7f ff e8 f6 call 20022bc 2007ee8: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2007eec: 86 10 e1 f0 or %g3, 0x1f0, %g3 2007ef0: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007ef4: 09 00 80 73 sethi %hi(0x201cc00), %g4 RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 2007ef8: 84 00 a0 08 add %g2, 8, %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 2007efc: 88 11 22 70 or %g4, 0x270, %g4 2007f00: 85 28 a0 10 sll %g2, 0x10, %g2 2007f04: 83 30 a0 0f srl %g2, 0xf, %g1 2007f08: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 2007f0c: 83 28 60 10 sll %g1, 0x10, %g1 2007f10: 89 30 60 10 srl %g1, 0x10, %g4 2007f14: 80 a1 20 ff cmp %g4, 0xff 2007f18: 28 bf ff de bleu,a 2007e90 <_Thread_Change_priority+0x158> 2007f1c: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 2007f20: 83 30 60 18 srl %g1, 0x18, %g1 2007f24: 10 bf ff dc b 2007e94 <_Thread_Change_priority+0x15c> 2007f28: c2 08 c0 01 ldub [ %g3 + %g1 ], %g1 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 2007f2c: 84 00 60 04 add %g1, 4, %g2 2007f30: c4 24 00 00 st %g2, [ %l0 ] old_last_node = the_chain->last; 2007f34: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_chain->last = the_node; 2007f38: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 2007f3c: c4 24 20 04 st %g2, [ %l0 + 4 ] Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 2007f40: 10 bf ff ba b 2007e28 <_Thread_Change_priority+0xf0> 2007f44: e0 20 80 00 st %l0, [ %g2 ] 02008494 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008494: 9d e3 bf a0 save %sp, -96, %sp 2008498: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 200849c: c0 26 61 68 clr [ %i1 + 0x168 ] 20084a0: c0 26 61 6c clr [ %i1 + 0x16c ] 20084a4: c0 26 61 70 clr [ %i1 + 0x170 ] extensions_area = NULL; the_thread->libc_reent = NULL; 20084a8: c0 26 61 64 clr [ %i1 + 0x164 ] Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 20084ac: e0 00 40 00 ld [ %g1 ], %l0 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 20084b0: 80 a6 a0 00 cmp %i2, 0 Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 20084b4: e2 07 a0 60 ld [ %fp + 0x60 ], %l1 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 20084b8: 02 80 00 82 be 20086c0 <_Thread_Initialize+0x22c> 20084bc: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 20084c0: c0 2e 60 c0 clrb [ %i1 + 0xc0 ] 20084c4: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 20084c8: f4 26 60 c8 st %i2, [ %i1 + 0xc8 ] the_stack->size = size; 20084cc: d0 26 60 c4 st %o0, [ %i1 + 0xc4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 20084d0: 80 8f 20 ff btst 0xff, %i4 20084d4: 82 10 20 00 clr %g1 20084d8: 12 80 00 56 bne 2008630 <_Thread_Initialize+0x19c> 20084dc: b4 10 20 00 clr %i2 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20084e0: 39 00 80 73 sethi %hi(0x201cc00), %i4 20084e4: c4 07 21 e0 ld [ %i4 + 0x1e0 ], %g2 ! 201cde0 <_Thread_Maximum_extensions> if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; the_thread->Start.fp_context = fp_area; 20084e8: c2 26 60 cc st %g1, [ %i1 + 0xcc ] fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 20084ec: c2 26 61 60 st %g1, [ %i1 + 0x160 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20084f0: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 20084f4: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 20084f8: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 20084fc: 80 a0 a0 00 cmp %g2, 0 2008500: 12 80 00 5c bne 2008670 <_Thread_Initialize+0x1dc> 2008504: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2008508: c0 26 61 74 clr [ %i1 + 0x174 ] 200850c: b6 10 20 00 clr %i3 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2008510: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008514: e4 2e 60 ac stb %l2, [ %i1 + 0xac ] the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2008518: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] switch ( budget_algorithm ) { 200851c: 80 a4 60 02 cmp %l1, 2 2008520: 12 80 00 05 bne 2008534 <_Thread_Initialize+0xa0> 2008524: e2 26 60 b0 st %l1, [ %i1 + 0xb0 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008528: 03 00 80 73 sethi %hi(0x201cc00), %g1 200852c: c2 00 60 98 ld [ %g1 + 0x98 ], %g1 ! 201cc98 <_Thread_Ticks_per_timeslice> 2008530: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008534: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 2008538: 92 10 00 1d mov %i5, %o1 case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200853c: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] the_thread->current_state = STATES_DORMANT; 2008540: 82 10 20 01 mov 1, %g1 #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 2008544: 90 10 00 19 mov %i1, %o0 #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 2008548: c2 26 60 10 st %g1, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; 200854c: c0 26 60 44 clr [ %i1 + 0x44 ] the_thread->resource_count = 0; 2008550: c0 26 60 1c clr [ %i1 + 0x1c ] #if defined(RTEMS_ITRON_API) the_thread->suspend_count = 0; #endif the_thread->real_priority = priority; 2008554: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 2008558: 40 00 02 0e call 2008d90 <_Thread_Set_priority> 200855c: fa 26 60 bc st %i5, [ %i1 + 0xbc ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008560: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 2008564: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 2008568: 83 28 60 02 sll %g1, 2, %g1 information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200856c: e0 26 60 0c st %l0, [ %i1 + 0xc ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008570: f2 20 80 01 st %i1, [ %g2 + %g1 ] /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 2008574: c0 26 60 84 clr [ %i1 + 0x84 ] 2008578: c0 26 60 88 clr [ %i1 + 0x88 ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 200857c: 90 10 00 19 mov %i1, %o0 2008580: 40 00 03 e5 call 2009514 <_User_extensions_Thread_create> 2008584: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008588: 80 8a 20 ff btst 0xff, %o0 200858c: 12 80 00 27 bne 2008628 <_Thread_Initialize+0x194> 2008590: 01 00 00 00 nop return true; failed: if ( the_thread->libc_reent ) 2008594: d0 06 61 64 ld [ %i1 + 0x164 ], %o0 2008598: 80 a2 20 00 cmp %o0, 0 200859c: 22 80 00 05 be,a 20085b0 <_Thread_Initialize+0x11c> 20085a0: d0 06 61 68 ld [ %i1 + 0x168 ], %o0 _Workspace_Free( the_thread->libc_reent ); 20085a4: 40 00 05 16 call 20099fc <_Workspace_Free> 20085a8: 01 00 00 00 nop for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 20085ac: d0 06 61 68 ld [ %i1 + 0x168 ], %o0 20085b0: 80 a2 20 00 cmp %o0, 0 20085b4: 22 80 00 05 be,a 20085c8 <_Thread_Initialize+0x134> 20085b8: d0 06 61 6c ld [ %i1 + 0x16c ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 20085bc: 40 00 05 10 call 20099fc <_Workspace_Free> 20085c0: 01 00 00 00 nop failed: if ( the_thread->libc_reent ) _Workspace_Free( the_thread->libc_reent ); for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 20085c4: d0 06 61 6c ld [ %i1 + 0x16c ], %o0 20085c8: 80 a2 20 00 cmp %o0, 0 20085cc: 22 80 00 05 be,a 20085e0 <_Thread_Initialize+0x14c> 20085d0: d0 06 61 70 ld [ %i1 + 0x170 ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 20085d4: 40 00 05 0a call 20099fc <_Workspace_Free> 20085d8: 01 00 00 00 nop failed: if ( the_thread->libc_reent ) _Workspace_Free( the_thread->libc_reent ); for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 20085dc: d0 06 61 70 ld [ %i1 + 0x170 ], %o0 20085e0: 80 a2 20 00 cmp %o0, 0 20085e4: 02 80 00 05 be 20085f8 <_Thread_Initialize+0x164> 20085e8: 80 a6 e0 00 cmp %i3, 0 _Workspace_Free( the_thread->API_Extensions[i] ); 20085ec: 40 00 05 04 call 20099fc <_Workspace_Free> <== NOT EXECUTED 20085f0: 01 00 00 00 nop <== NOT EXECUTED if ( extensions_area ) 20085f4: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 20085f8: 02 80 00 05 be 200860c <_Thread_Initialize+0x178> 20085fc: 80 a6 a0 00 cmp %i2, 0 (void) _Workspace_Free( extensions_area ); 2008600: 40 00 04 ff call 20099fc <_Workspace_Free> 2008604: 90 10 00 1b mov %i3, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( fp_area ) 2008608: 80 a6 a0 00 cmp %i2, 0 200860c: 02 80 00 05 be 2008620 <_Thread_Initialize+0x18c> 2008610: 90 10 00 19 mov %i1, %o0 (void) _Workspace_Free( fp_area ); 2008614: 40 00 04 fa call 20099fc <_Workspace_Free> 2008618: 90 10 00 1a mov %i2, %o0 #endif _Thread_Stack_Free( the_thread ); 200861c: 90 10 00 19 mov %i1, %o0 2008620: 40 00 02 97 call 200907c <_Thread_Stack_Free> 2008624: b0 10 20 00 clr %i0 return false; } 2008628: 81 c7 e0 08 ret 200862c: 81 e8 00 00 restore /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 2008630: 40 00 04 ea call 20099d8 <_Workspace_Allocate> 2008634: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008638: b6 10 20 00 clr %i3 200863c: b4 92 20 00 orcc %o0, 0, %i2 2008640: 02 bf ff d5 be 2008594 <_Thread_Initialize+0x100> 2008644: 82 10 00 1a mov %i2, %g1 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008648: 39 00 80 73 sethi %hi(0x201cc00), %i4 200864c: c4 07 21 e0 ld [ %i4 + 0x1e0 ], %g2 ! 201cde0 <_Thread_Maximum_extensions> if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; the_thread->Start.fp_context = fp_area; 2008650: c2 26 60 cc st %g1, [ %i1 + 0xcc ] fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 2008654: c2 26 61 60 st %g1, [ %i1 + 0x160 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008658: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200865c: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008660: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008664: 80 a0 a0 00 cmp %g2, 0 2008668: 02 bf ff a8 be 2008508 <_Thread_Initialize+0x74> 200866c: c0 26 60 6c clr [ %i1 + 0x6c ] extensions_area = _Workspace_Allocate( 2008670: 84 00 a0 01 inc %g2 2008674: 40 00 04 d9 call 20099d8 <_Workspace_Allocate> 2008678: 91 28 a0 02 sll %g2, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200867c: b6 92 20 00 orcc %o0, 0, %i3 2008680: 02 bf ff c5 be 2008594 <_Thread_Initialize+0x100> 2008684: c8 07 21 e0 ld [ %i4 + 0x1e0 ], %g4 goto failed; } the_thread->extensions = (void **) extensions_area; 2008688: f6 26 61 74 st %i3, [ %i1 + 0x174 ] 200868c: 86 10 00 1b mov %i3, %g3 * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008690: 84 10 20 00 clr %g2 2008694: 10 80 00 03 b 20086a0 <_Thread_Initialize+0x20c> 2008698: 82 10 20 00 clr %g1 200869c: c6 06 61 74 ld [ %i1 + 0x174 ], %g3 the_thread->extensions[i] = NULL; 20086a0: 85 28 a0 02 sll %g2, 2, %g2 20086a4: c0 20 c0 02 clr [ %g3 + %g2 ] * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 20086a8: 82 00 60 01 inc %g1 20086ac: 80 a1 00 01 cmp %g4, %g1 20086b0: 1a bf ff fb bcc 200869c <_Thread_Initialize+0x208> 20086b4: 84 10 00 01 mov %g1, %g2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 20086b8: 10 bf ff 97 b 2008514 <_Thread_Initialize+0x80> 20086bc: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 20086c0: 90 10 00 19 mov %i1, %o0 20086c4: 40 00 02 53 call 2009010 <_Thread_Stack_Allocate> 20086c8: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 20086cc: 80 a6 c0 08 cmp %i3, %o0 20086d0: 18 80 00 07 bgu 20086ec <_Thread_Initialize+0x258> 20086d4: 80 a2 20 00 cmp %o0, 0 20086d8: 02 80 00 05 be 20086ec <_Thread_Initialize+0x258> 20086dc: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 20086e0: f4 06 60 d0 ld [ %i1 + 0xd0 ], %i2 the_thread->Start.core_allocated_stack = true; 20086e4: 10 bf ff 79 b 20084c8 <_Thread_Initialize+0x34> 20086e8: c2 2e 60 c0 stb %g1, [ %i1 + 0xc0 ] stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) 20086ec: 81 c7 e0 08 ret 20086f0: 91 e8 20 00 restore %g0, 0, %o0 02009208 <_Thread_Yield_processor>: * ready chain * select heir */ void _Thread_Yield_processor( void ) { 2009208: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 200920c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009210: e0 00 62 00 ld [ %g1 + 0x200 ], %l0 ! 201ce00 <_Thread_Executing> ready = executing->ready; _ISR_Disable( level ); 2009214: 7f ff e4 26 call 20022ac 2009218: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 200921c: b0 10 00 08 mov %o0, %i0 if ( !_Chain_Has_only_one_node( ready ) ) { 2009220: c4 04 40 00 ld [ %l1 ], %g2 2009224: c2 04 60 08 ld [ %l1 + 8 ], %g1 2009228: 80 a0 80 01 cmp %g2, %g1 200922c: 02 80 00 19 be 2009290 <_Thread_Yield_processor+0x88> 2009230: 86 04 60 04 add %l1, 4, %g3 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2009234: c2 04 00 00 ld [ %l0 ], %g1 previous = the_node->previous; 2009238: c4 04 20 04 ld [ %l0 + 4 ], %g2 next->previous = previous; previous->next = next; 200923c: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 2009240: c6 24 00 00 st %g3, [ %l0 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2009244: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 2009248: c2 04 60 08 ld [ %l1 + 8 ], %g1 the_chain->last = the_node; 200924c: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; the_node->previous = old_last_node; 2009250: c2 24 20 04 st %g1, [ %l0 + 4 ] Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; the_chain->last = the_node; old_last_node->next = the_node; 2009254: e0 20 40 00 st %l0, [ %g1 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 2009258: 7f ff e4 19 call 20022bc 200925c: 01 00 00 00 nop 2009260: 7f ff e4 13 call 20022ac 2009264: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 2009268: 03 00 80 73 sethi %hi(0x201cc00), %g1 200926c: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 201cdd0 <_Thread_Heir> 2009270: 80 a4 00 02 cmp %l0, %g2 2009274: 22 80 00 0e be,a 20092ac <_Thread_Yield_processor+0xa4> 2009278: c4 04 40 00 ld [ %l1 ], %g2 _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Context_Switch_necessary = true; 200927c: 84 10 20 01 mov 1, %g2 2009280: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009284: c4 28 62 10 stb %g2, [ %g1 + 0x210 ] ! 201ce10 <_Context_Switch_necessary> _ISR_Enable( level ); 2009288: 7f ff e4 0d call 20022bc 200928c: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 2009290: 03 00 80 73 sethi %hi(0x201cc00), %g1 2009294: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 ! 201cdd0 <_Thread_Heir> 2009298: 80 a4 00 01 cmp %l0, %g1 200929c: 32 bf ff f9 bne,a 2009280 <_Thread_Yield_processor+0x78> 20092a0: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED _Context_Switch_necessary = true; _ISR_Enable( level ); 20092a4: 7f ff e4 06 call 20022bc 20092a8: 81 e8 00 00 restore _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; 20092ac: 10 bf ff f4 b 200927c <_Thread_Yield_processor+0x74> 20092b0: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ] 02008a14 <_Thread_queue_Enqueue_priority>: Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 2008a14: 9d e3 bf a0 save %sp, -96, %sp Priority_Control priority; States_Control block_state; _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; 2008a18: e0 06 60 14 ld [ %i1 + 0x14 ], %l0 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2008a1c: 82 06 60 3c add %i1, 0x3c, %g1 the_chain->permanent_null = NULL; 2008a20: c0 26 60 3c clr [ %i1 + 0x3c ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2008a24: c2 26 60 38 st %g1, [ %i1 + 0x38 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 2008a28: 82 06 60 38 add %i1, 0x38, %g1 2008a2c: c2 26 60 40 st %g1, [ %i1 + 0x40 ] 2008a30: 2d 00 80 70 sethi %hi(0x201c000), %l6 header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008a34: 83 34 20 06 srl %l0, 6, %g1 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2008a38: 80 8c 20 20 btst 0x20, %l0 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008a3c: ab 28 60 04 sll %g1, 4, %l5 2008a40: ac 15 a2 24 or %l6, 0x224, %l6 2008a44: 83 28 60 02 sll %g1, 2, %g1 block_state = the_thread_queue->state; 2008a48: e8 06 20 38 ld [ %i0 + 0x38 ], %l4 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2008a4c: aa 25 40 01 sub %l5, %g1, %l5 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2008a50: 12 80 00 24 bne 2008ae0 <_Thread_queue_Enqueue_priority+0xcc> 2008a54: aa 06 00 15 add %i0, %l5, %l5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 2008a58: ac 05 60 04 add %l5, 4, %l6 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 2008a5c: 7f ff e6 14 call 20022ac 2008a60: 01 00 00 00 nop 2008a64: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->first; 2008a68: c2 05 40 00 ld [ %l5 ], %g1 while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008a6c: 80 a0 40 16 cmp %g1, %l6 2008a70: 02 80 00 3a be 2008b58 <_Thread_queue_Enqueue_priority+0x144> 2008a74: a2 10 00 01 mov %g1, %l1 search_priority = search_thread->current_priority; 2008a78: e6 00 60 14 ld [ %g1 + 0x14 ], %l3 if ( priority <= search_priority ) 2008a7c: 80 a4 00 13 cmp %l0, %l3 2008a80: 18 80 00 0b bgu 2008aac <_Thread_queue_Enqueue_priority+0x98> 2008a84: 01 00 00 00 nop } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2008a88: 10 80 00 36 b 2008b60 <_Thread_queue_Enqueue_priority+0x14c> 2008a8c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) header->first; while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008a90: 80 a4 40 16 cmp %l1, %l6 2008a94: 02 80 00 32 be 2008b5c <_Thread_queue_Enqueue_priority+0x148> 2008a98: 82 10 00 11 mov %l1, %g1 search_priority = search_thread->current_priority; 2008a9c: e6 04 60 14 ld [ %l1 + 0x14 ], %l3 if ( priority <= search_priority ) 2008aa0: 80 a4 00 13 cmp %l0, %l3 2008aa4: 28 80 00 2f bleu,a 2008b60 <_Thread_queue_Enqueue_priority+0x14c> 2008aa8: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 2008aac: 7f ff e6 04 call 20022bc 2008ab0: 90 10 00 12 mov %l2, %o0 2008ab4: 7f ff e5 fe call 20022ac 2008ab8: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008abc: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 2008ac0: 80 8d 00 01 btst %l4, %g1 2008ac4: 32 bf ff f3 bne,a 2008a90 <_Thread_queue_Enqueue_priority+0x7c> 2008ac8: e2 04 40 00 ld [ %l1 ], %l1 _ISR_Enable( level ); 2008acc: 7f ff e5 fc call 20022bc <== NOT EXECUTED 2008ad0: 90 10 00 12 mov %l2, %o0 <== NOT EXECUTED goto restart_forward_search; 2008ad4: 30 bf ff e2 b,a 2008a5c <_Thread_queue_Enqueue_priority+0x48><== NOT EXECUTED if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); if ( !_States_Are_set( search_thread->current_state, block_state) ) { _ISR_Enable( level ); 2008ad8: 7f ff e5 f9 call 20022bc 2008adc: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 2008ae0: 7f ff e5 f3 call 20022ac 2008ae4: e6 0d 80 00 ldub [ %l6 ], %l3 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2008ae8: a6 04 e0 01 inc %l3 _ISR_Disable( level ); 2008aec: a4 10 00 08 mov %o0, %l2 search_thread = (Thread_Control *) header->last; 2008af0: c2 05 60 08 ld [ %l5 + 8 ], %g1 while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2008af4: 80 a0 40 15 cmp %g1, %l5 2008af8: 02 80 00 20 be 2008b78 <_Thread_queue_Enqueue_priority+0x164> 2008afc: a2 10 00 01 mov %g1, %l1 search_priority = search_thread->current_priority; 2008b00: e6 00 60 14 ld [ %g1 + 0x14 ], %l3 if ( priority >= search_priority ) 2008b04: 80 a4 00 13 cmp %l0, %l3 2008b08: 0a 80 00 0b bcs 2008b34 <_Thread_queue_Enqueue_priority+0x120> 2008b0c: 01 00 00 00 nop } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2008b10: 10 80 00 1b b 2008b7c <_Thread_queue_Enqueue_priority+0x168> 2008b14: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); search_thread = (Thread_Control *) header->last; while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2008b18: 80 a4 40 15 cmp %l1, %l5 2008b1c: 02 80 00 17 be 2008b78 <_Thread_queue_Enqueue_priority+0x164> 2008b20: 82 10 00 11 mov %l1, %g1 search_priority = search_thread->current_priority; 2008b24: e6 04 60 14 ld [ %l1 + 0x14 ], %l3 if ( priority >= search_priority ) 2008b28: 80 a4 00 13 cmp %l0, %l3 2008b2c: 3a 80 00 14 bcc,a 2008b7c <_Thread_queue_Enqueue_priority+0x168> 2008b30: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 2008b34: 7f ff e5 e2 call 20022bc 2008b38: 90 10 00 12 mov %l2, %o0 2008b3c: 7f ff e5 dc call 20022ac 2008b40: 01 00 00 00 nop if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2008b44: c2 04 60 10 ld [ %l1 + 0x10 ], %g1 2008b48: 80 8d 00 01 btst %l4, %g1 2008b4c: 32 bf ff f3 bne,a 2008b18 <_Thread_queue_Enqueue_priority+0x104> 2008b50: e2 04 60 04 ld [ %l1 + 4 ], %l1 2008b54: 30 bf ff e1 b,a 2008ad8 <_Thread_queue_Enqueue_priority+0xc4> restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) header->first; while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2008b58: a6 10 3f ff mov -1, %l3 } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2008b5c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 2008b60: 80 a0 a0 01 cmp %g2, 1 2008b64: 02 80 00 17 be 2008bc0 <_Thread_queue_Enqueue_priority+0x1ac> 2008b68: 80 a4 00 13 cmp %l0, %l3 * For example, the blocking thread could have been given * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; 2008b6c: e4 26 80 00 st %l2, [ %i2 ] return the_thread_queue->sync_state; } 2008b70: 81 c7 e0 08 ret 2008b74: 91 e8 00 02 restore %g0, %g2, %o0 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 2008b78: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 2008b7c: 80 a0 a0 01 cmp %g2, 1 2008b80: 32 bf ff fc bne,a 2008b70 <_Thread_queue_Enqueue_priority+0x15c> 2008b84: e4 26 80 00 st %l2, [ %i2 ] THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2008b88: 80 a4 00 13 cmp %l0, %l3 2008b8c: 02 80 00 1a be 2008bf4 <_Thread_queue_Enqueue_priority+0x1e0> 2008b90: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 2008b94: c4 00 40 00 ld [ %g1 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 2008b98: c2 26 60 04 st %g1, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 2008b9c: c4 26 40 00 st %g2, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; next_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 2008ba0: f0 26 60 44 st %i0, [ %i1 + 0x44 ] next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; search_node->next = the_node; 2008ba4: f2 20 40 00 st %i1, [ %g1 ] next_node->previous = the_node; 2008ba8: f2 20 a0 04 st %i1, [ %g2 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2008bac: b0 10 20 01 mov 1, %i0 2008bb0: 7f ff e5 c3 call 20022bc 2008bb4: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008bb8: 81 c7 e0 08 ret 2008bbc: 81 e8 00 00 restore THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 2008bc0: 02 80 00 0d be 2008bf4 <_Thread_queue_Enqueue_priority+0x1e0> 2008bc4: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; previous_node = search_node->previous; 2008bc8: c4 00 60 04 ld [ %g1 + 4 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2008bcc: c2 26 40 00 st %g1, [ %i1 ] the_node->previous = previous_node; 2008bd0: c4 26 60 04 st %g2, [ %i1 + 4 ] previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 2008bd4: f0 26 60 44 st %i0, [ %i1 + 0x44 ] previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; 2008bd8: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 2008bdc: f2 20 60 04 st %i1, [ %g1 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2008be0: b0 10 20 01 mov 1, %i0 2008be4: 7f ff e5 b6 call 20022bc 2008be8: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008bec: 81 c7 e0 08 ret 2008bf0: 81 e8 00 00 restore 2008bf4: a2 04 60 3c add %l1, 0x3c, %l1 _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; 2008bf8: c2 04 60 04 ld [ %l1 + 4 ], %g1 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 2008bfc: e2 26 40 00 st %l1, [ %i1 ] the_node->previous = previous_node; 2008c00: c2 26 60 04 st %g1, [ %i1 + 4 ] previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; 2008c04: f0 26 60 44 st %i0, [ %i1 + 0x44 ] previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; 2008c08: f2 20 40 00 st %i1, [ %g1 ] search_node->previous = the_node; 2008c0c: f2 24 60 04 st %i1, [ %l1 + 4 ] the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2008c10: b0 10 20 01 mov 1, %i0 2008c14: 7f ff e5 aa call 20022bc 2008c18: 90 10 00 12 mov %l2, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008c1c: 81 c7 e0 08 ret 2008c20: 81 e8 00 00 restore 02008cd0 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2008cd0: 9d e3 bf 98 save %sp, -104, %sp /* * Just in case the thread really wasn't blocked on a thread queue * when we get here. */ if ( !the_thread_queue ) 2008cd4: 80 a6 20 00 cmp %i0, 0 2008cd8: 02 80 00 13 be 2008d24 <_Thread_queue_Requeue+0x54> 2008cdc: 01 00 00 00 nop /* * If queueing by FIFO, there is nothing to do. This only applies to * priority blocking discipline. */ if ( the_thread_queue->discipline == THREAD_QUEUE_DISCIPLINE_PRIORITY ) { 2008ce0: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 2008ce4: 80 a4 60 01 cmp %l1, 1 2008ce8: 02 80 00 04 be 2008cf8 <_Thread_queue_Requeue+0x28> 2008cec: 01 00 00 00 nop 2008cf0: 81 c7 e0 08 ret <== NOT EXECUTED 2008cf4: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2008cf8: 7f ff e5 6d call 20022ac 2008cfc: 01 00 00 00 nop 2008d00: a0 10 00 08 mov %o0, %l0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2008d04: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2008d08: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008d0c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2008d10: 80 88 80 01 btst %g2, %g1 2008d14: 12 80 00 06 bne 2008d2c <_Thread_queue_Requeue+0x5c> 2008d18: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); } _ISR_Enable( level ); 2008d1c: 7f ff e5 68 call 20022bc 2008d20: 90 10 00 10 mov %l0, %o0 2008d24: 81 c7 e0 08 ret 2008d28: 81 e8 00 00 restore ISR_Level level_ignored; _ISR_Disable( level ); if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2008d2c: 92 10 00 19 mov %i1, %o1 2008d30: e2 26 20 30 st %l1, [ %i0 + 0x30 ] 2008d34: 40 00 11 47 call 200d250 <_Thread_queue_Extract_priority_helper> 2008d38: 94 10 20 01 mov 1, %o2 (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2008d3c: 90 10 00 18 mov %i0, %o0 2008d40: 92 10 00 19 mov %i1, %o1 2008d44: 7f ff ff 34 call 2008a14 <_Thread_queue_Enqueue_priority> 2008d48: 94 07 bf fc add %fp, -4, %o2 2008d4c: 30 bf ff f4 b,a 2008d1c <_Thread_queue_Requeue+0x4c> 020166ec <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 20166ec: 9d e3 bf 88 save %sp, -120, %sp 20166f0: 2d 00 80 f9 sethi %hi(0x203e400), %l6 20166f4: ba 07 bf f4 add %fp, -12, %i5 20166f8: a8 07 bf f8 add %fp, -8, %l4 20166fc: a4 07 bf e8 add %fp, -24, %l2 2016700: ae 07 bf ec add %fp, -20, %l7 2016704: 2b 00 80 f9 sethi %hi(0x203e400), %l5 2016708: 39 00 80 f9 sethi %hi(0x203e400), %i4 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); the_chain->permanent_null = NULL; 201670c: c0 27 bf f8 clr [ %fp + -8 ] 2016710: c0 27 bf ec clr [ %fp + -20 ] the_chain->last = _Chain_Head(the_chain); 2016714: fa 27 bf fc st %i5, [ %fp + -4 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2016718: e8 27 bf f4 st %l4, [ %fp + -12 ] the_chain->permanent_null = NULL; the_chain->last = _Chain_Head(the_chain); 201671c: e4 27 bf f0 st %l2, [ %fp + -16 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 2016720: ee 27 bf e8 st %l7, [ %fp + -24 ] 2016724: ac 15 a2 c4 or %l6, 0x2c4, %l6 2016728: aa 15 62 04 or %l5, 0x204, %l5 201672c: b8 17 21 70 or %i4, 0x170, %i4 */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016730: a2 06 20 30 add %i0, 0x30, %l1 /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016734: a6 06 20 68 add %i0, 0x68, %l3 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016738: b2 06 20 08 add %i0, 8, %i1 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 201673c: b4 06 20 40 add %i0, 0x40, %i2 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 2016740: b6 10 20 01 mov 1, %i3 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 2016744: fa 26 20 78 st %i5, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016748: c2 05 80 00 ld [ %l6 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 201674c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016750: 90 10 00 11 mov %l1, %o0 2016754: 92 20 40 09 sub %g1, %o1, %o1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016758: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201675c: 40 00 12 8c call 201b18c <_Watchdog_Adjust_to_chain> 2016760: 94 10 00 12 mov %l2, %o2 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016764: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016768: e0 05 40 00 ld [ %l5 ], %l0 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 201676c: 80 a4 00 09 cmp %l0, %o1 2016770: 38 80 00 2f bgu,a 201682c <_Timer_server_Body+0x140> 2016774: 92 24 00 09 sub %l0, %o1, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2016778: 80 a4 00 09 cmp %l0, %o1 201677c: 0a 80 00 30 bcs 201683c <_Timer_server_Body+0x150> 2016780: 94 22 40 10 sub %o1, %l0, %o2 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2016784: e0 26 20 74 st %l0, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2016788: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 201678c: 40 00 02 b5 call 2017260 <_Chain_Get> 2016790: 01 00 00 00 nop if ( timer == NULL ) { 2016794: 80 a2 20 00 cmp %o0, 0 2016798: 02 80 00 10 be 20167d8 <_Timer_server_Body+0xec> 201679c: 01 00 00 00 nop static void _Timer_server_Insert_timer( Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 20167a0: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 20167a4: 80 a0 60 01 cmp %g1, 1 20167a8: 02 80 00 29 be 201684c <_Timer_server_Body+0x160> 20167ac: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20167b0: 12 bf ff f6 bne 2016788 <_Timer_server_Body+0x9c> 20167b4: 92 02 20 10 add %o0, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20167b8: 40 00 12 ab call 201b264 <_Watchdog_Insert> 20167bc: 90 10 00 13 mov %l3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20167c0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20167c4: 40 00 02 a7 call 2017260 <_Chain_Get> 20167c8: 01 00 00 00 nop if ( timer == NULL ) { 20167cc: 80 a2 20 00 cmp %o0, 0 20167d0: 32 bf ff f5 bne,a 20167a4 <_Timer_server_Body+0xb8> 20167d4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 20167d8: 7f ff e3 aa call 200f680 20167dc: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 20167e0: c2 07 bf f4 ld [ %fp + -12 ], %g1 20167e4: 80 a5 00 01 cmp %l4, %g1 20167e8: 02 80 00 1d be 201685c <_Timer_server_Body+0x170> 20167ec: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 20167f0: 7f ff e3 a8 call 200f690 <== NOT EXECUTED 20167f4: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20167f8: c2 05 80 00 ld [ %l6 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20167fc: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016800: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED 2016804: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016808: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201680c: 40 00 12 60 call 201b18c <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 2016810: 94 10 00 12 mov %l2, %o2 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016814: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016818: e0 05 40 00 ld [ %l5 ], %l0 <== NOT EXECUTED /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 201681c: 80 a4 00 09 cmp %l0, %o1 <== NOT EXECUTED 2016820: 08 bf ff d7 bleu 201677c <_Timer_server_Body+0x90> <== NOT EXECUTED 2016824: 01 00 00 00 nop <== NOT EXECUTED /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016828: 92 24 00 09 sub %l0, %o1, %o1 <== NOT EXECUTED 201682c: 90 10 00 13 mov %l3, %o0 2016830: 40 00 12 57 call 201b18c <_Watchdog_Adjust_to_chain> 2016834: 94 10 00 12 mov %l2, %o2 2016838: 30 bf ff d3 b,a 2016784 <_Timer_server_Body+0x98> /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 201683c: 90 10 00 13 mov %l3, %o0 2016840: 40 00 12 23 call 201b0cc <_Watchdog_Adjust> 2016844: 92 10 20 01 mov 1, %o1 2016848: 30 bf ff cf b,a 2016784 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201684c: 92 02 20 10 add %o0, 0x10, %o1 2016850: 40 00 12 85 call 201b264 <_Watchdog_Insert> 2016854: 90 10 00 11 mov %l1, %o0 2016858: 30 bf ff cc b,a 2016788 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 201685c: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2016860: 7f ff e3 8c call 200f690 2016864: 01 00 00 00 nop _Chain_Initialize_empty( &fire_chain ); while ( true ) { _Timer_server_Get_watchdogs_that_fire_now( ts, &insert_chain, &fire_chain ); if ( !_Chain_Is_empty( &fire_chain ) ) { 2016868: c2 07 bf e8 ld [ %fp + -24 ], %g1 201686c: 80 a5 c0 01 cmp %l7, %g1 2016870: 12 80 00 0c bne 20168a0 <_Timer_server_Body+0x1b4> 2016874: 01 00 00 00 nop 2016878: 30 80 00 13 b,a 20168c4 <_Timer_server_Body+0x1d8> * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 201687c: c0 24 20 08 clr [ %l0 + 8 ] Chain_Node *return_node; Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; the_chain->first = new_first; 2016880: c2 27 bf e8 st %g1, [ %fp + -24 ] new_first->previous = _Chain_Head(the_chain); 2016884: e4 20 60 04 st %l2, [ %g1 + 4 ] _ISR_Enable( level ); 2016888: 7f ff e3 82 call 200f690 201688c: 01 00 00 00 nop /* * The timer server may block here and wait for resources or time. * The system watchdogs are inactive and will remain inactive since * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); 2016890: d2 04 20 24 ld [ %l0 + 0x24 ], %o1 2016894: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 2016898: 9f c0 40 00 call %g1 201689c: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 20168a0: 7f ff e3 78 call 200f680 20168a4: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 20168a8: e0 07 bf e8 ld [ %fp + -24 ], %l0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 20168ac: 80 a5 c0 10 cmp %l7, %l0 20168b0: 32 bf ff f3 bne,a 201687c <_Timer_server_Body+0x190> 20168b4: c2 04 00 00 ld [ %l0 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 20168b8: 7f ff e3 76 call 200f690 20168bc: 01 00 00 00 nop 20168c0: 30 bf ff a1 b,a 2016744 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20168c4: c0 2e 20 7c clrb [ %i0 + 0x7c ] 20168c8: c2 07 00 00 ld [ %i4 ], %g1 20168cc: 82 00 60 01 inc %g1 20168d0: c2 27 00 00 st %g1, [ %i4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 20168d4: d0 06 00 00 ld [ %i0 ], %o0 20168d8: 40 00 0f 45 call 201a5ec <_Thread_Set_state> 20168dc: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 20168e0: 7f ff ff 59 call 2016644 <_Timer_server_Reset_interval_system_watchdog> 20168e4: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 20168e8: 7f ff ff 6c call 2016698 <_Timer_server_Reset_tod_system_watchdog> 20168ec: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 20168f0: 40 00 0c 3d call 20199e4 <_Thread_Enable_dispatch> 20168f4: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20168f8: 90 10 00 19 mov %i1, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 20168fc: f6 2e 20 7c stb %i3, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016900: 40 00 12 c6 call 201b418 <_Watchdog_Remove> 2016904: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016908: 40 00 12 c4 call 201b418 <_Watchdog_Remove> 201690c: 90 10 00 1a mov %i2, %o0 2016910: 30 bf ff 8d b,a 2016744 <_Timer_server_Body+0x58> 0200b910 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b910: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b914: 7f ff de 47 call 2003230 200b918: a0 10 00 18 mov %i0, %l0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 200b91c: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 200b920: a2 06 20 04 add %i0, 4, %l1 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200b924: 80 a0 40 11 cmp %g1, %l1 200b928: 02 80 00 1f be 200b9a4 <_Watchdog_Adjust+0x94> 200b92c: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b930: 12 80 00 1f bne 200b9ac <_Watchdog_Adjust+0x9c> 200b934: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b938: 80 a6 a0 00 cmp %i2, 0 200b93c: 02 80 00 1a be 200b9a4 <_Watchdog_Adjust+0x94> 200b940: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200b944: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 200b948: 80 a6 80 19 cmp %i2, %i1 200b94c: 1a 80 00 0b bcc 200b978 <_Watchdog_Adjust+0x68> 200b950: a4 10 20 01 mov 1, %l2 _Watchdog_First( header )->delta_interval -= units; 200b954: 10 80 00 1d b 200b9c8 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200b958: b4 26 40 1a sub %i1, %i2, %i2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b95c: b4 a6 80 19 subcc %i2, %i1, %i2 200b960: 02 80 00 11 be 200b9a4 <_Watchdog_Adjust+0x94> 200b964: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200b968: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 200b96c: 80 a6 40 1a cmp %i1, %i2 200b970: 38 80 00 16 bgu,a 200b9c8 <_Watchdog_Adjust+0xb8> 200b974: b4 26 40 1a sub %i1, %i2, %i2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200b978: e4 20 60 10 st %l2, [ %g1 + 0x10 ] _ISR_Enable( level ); 200b97c: 7f ff de 31 call 2003240 200b980: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b984: 40 00 00 b6 call 200bc5c <_Watchdog_Tickle> 200b988: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 200b98c: 7f ff de 29 call 2003230 200b990: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 200b994: c4 04 00 00 ld [ %l0 ], %g2 if ( _Chain_Is_empty( header ) ) 200b998: 80 a4 40 02 cmp %l1, %g2 200b99c: 12 bf ff f0 bne 200b95c <_Watchdog_Adjust+0x4c> 200b9a0: 82 10 00 02 mov %g2, %g1 } break; } } _ISR_Enable( level ); 200b9a4: 7f ff de 27 call 2003240 200b9a8: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200b9ac: 12 bf ff fe bne 200b9a4 <_Watchdog_Adjust+0x94> 200b9b0: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b9b4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b9b8: b4 00 80 1a add %g2, %i2, %i2 200b9bc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200b9c0: 7f ff de 20 call 2003240 200b9c4: 91 e8 00 08 restore %g0, %o0, %o0 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; 200b9c8: 10 bf ff f7 b 200b9a4 <_Watchdog_Adjust+0x94> 200b9cc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] 0200f714 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 200f714: 9d e3 bf 90 save %sp, -112, %sp POSIX_signals_Siginfo_node *psiginfo; /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) 200f718: 7f ff fb a2 call 200e5a0 200f71c: 01 00 00 00 nop 200f720: 80 a2 00 18 cmp %o0, %i0 200f724: 12 80 00 b6 bne 200f9fc 200f728: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 200f72c: 02 80 00 ba be 200fa14 200f730: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 200f734: 80 a0 60 1f cmp %g1, 0x1f 200f738: 18 80 00 b7 bgu 200fa14 200f73c: 23 00 80 74 sethi %hi(0x201d000), %l1 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 ) 200f740: a5 2e 60 02 sll %i1, 2, %l2 200f744: a2 14 62 d4 or %l1, 0x2d4, %l1 200f748: a7 2e 60 04 sll %i1, 4, %l3 200f74c: 84 24 c0 12 sub %l3, %l2, %g2 200f750: 84 04 40 02 add %l1, %g2, %g2 200f754: c4 00 a0 08 ld [ %g2 + 8 ], %g2 200f758: 80 a0 a0 01 cmp %g2, 1 200f75c: 02 80 00 45 be 200f870 200f760: b0 10 20 00 clr %i0 /* * 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 ) ) 200f764: 80 a6 60 04 cmp %i1, 4 200f768: 02 80 00 44 be 200f878 200f76c: 80 a6 60 08 cmp %i1, 8 200f770: 02 80 00 42 be 200f878 200f774: 80 a6 60 0b cmp %i1, 0xb 200f778: 02 80 00 40 be 200f878 200f77c: a0 10 20 01 mov 1, %l0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 200f780: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 200f784: e0 27 bf f8 st %l0, [ %fp + -8 ] if ( !value ) { 200f788: 80 a6 a0 00 cmp %i2, 0 200f78c: 02 80 00 41 be 200f890 200f790: a1 2c 00 01 sll %l0, %g1, %l0 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 200f794: c2 06 80 00 ld [ %i2 ], %g1 200f798: c2 27 bf fc st %g1, [ %fp + -4 ] 200f79c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f7a0: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 201cd40 <_Thread_Dispatch_disable_level> 200f7a4: 84 00 a0 01 inc %g2 200f7a8: c4 20 61 40 st %g2, [ %g1 + 0x140 ] /* * 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; 200f7ac: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f7b0: c2 00 62 00 ld [ %g1 + 0x200 ], %g1 ! 201ce00 <_Thread_Executing> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200f7b4: c4 00 61 6c ld [ %g1 + 0x16c ], %g2 200f7b8: c4 00 a0 cc ld [ %g2 + 0xcc ], %g2 200f7bc: 80 ac 00 02 andncc %l0, %g2, %g0 200f7c0: 12 80 00 1a bne 200f828 200f7c4: 09 00 80 75 sethi %hi(0x201d400), %g4 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = the_chain->first ; 200f7c8: c4 01 20 60 ld [ %g4 + 0x60 ], %g2 ! 201d460 <_POSIX_signals_Wait_queue> 200f7cc: 88 11 20 60 or %g4, 0x60, %g4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 200f7d0: 88 01 20 04 add %g4, 4, %g4 200f7d4: 80 a0 80 04 cmp %g2, %g4 200f7d8: 02 80 00 30 be 200f898 200f7dc: 82 10 00 02 mov %g2, %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 200f7e0: c6 00 a0 30 ld [ %g2 + 0x30 ], %g3 200f7e4: 80 8c 00 03 btst %l0, %g3 200f7e8: 02 80 00 0c be 200f818 200f7ec: c6 00 a1 6c ld [ %g2 + 0x16c ], %g3 * thread needs to do the post context switch extension so it can * evaluate the signals pending. */ process_it: the_thread->do_post_task_switch_extension = true; 200f7f0: 10 80 00 0f b 200f82c 200f7f4: 84 10 20 01 mov 1, %g2 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = the_chain->first ; 200f7f8: 80 a0 80 04 cmp %g2, %g4 200f7fc: 22 80 00 28 be,a 200f89c 200f800: 03 00 80 70 sethi %hi(0x201c000), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 200f804: c2 00 a0 30 ld [ %g2 + 0x30 ], %g1 <== NOT EXECUTED for ( the_node = the_chain->first ; !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { the_thread = (Thread_Control *)the_node; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200f808: c6 00 a1 6c ld [ %g2 + 0x16c ], %g3 <== NOT EXECUTED #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 200f80c: 80 8c 00 01 btst %l0, %g1 <== NOT EXECUTED 200f810: 12 80 00 06 bne 200f828 <== NOT EXECUTED 200f814: 82 10 00 02 mov %g2, %g1 <== NOT EXECUTED /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 200f818: c6 00 e0 cc ld [ %g3 + 0xcc ], %g3 200f81c: 80 ac 00 03 andncc %l0, %g3, %g0 200f820: 22 bf ff f6 be,a 200f7f8 200f824: c4 00 80 00 ld [ %g2 ], %g2 * thread needs to do the post context switch extension so it can * evaluate the signals pending. */ process_it: the_thread->do_post_task_switch_extension = true; 200f828: 84 10 20 01 mov 1, %g2 /* * 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 ) ) { 200f82c: 90 10 00 01 mov %g1, %o0 200f830: 92 10 00 19 mov %i1, %o1 * thread needs to do the post context switch extension so it can * evaluate the signals pending. */ process_it: the_thread->do_post_task_switch_extension = true; 200f834: c4 28 60 74 stb %g2, [ %g1 + 0x74 ] /* * 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 ) ) { 200f838: 40 00 00 ba call 200fb20 <_POSIX_signals_Unblock_thread> 200f83c: 94 07 bf f4 add %fp, -12, %o2 200f840: 80 8a 20 ff btst 0xff, %o0 200f844: 12 80 00 5a bne 200f9ac 200f848: 01 00 00 00 nop /* * 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 ); 200f84c: 40 00 00 a5 call 200fae0 <_POSIX_signals_Set_process_signals> 200f850: 90 10 00 10 mov %l0, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 200f854: a4 24 c0 12 sub %l3, %l2, %l2 200f858: c2 04 40 12 ld [ %l1 + %l2 ], %g1 200f85c: 80 a0 60 02 cmp %g1, 2 200f860: 02 80 00 57 be 200f9bc 200f864: 11 00 80 75 sethi %hi(0x201d400), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 200f868: 7f ff e2 d2 call 20083b0 <_Thread_Enable_dispatch> 200f86c: b0 10 20 00 clr %i0 return 0; } 200f870: 81 c7 e0 08 ret 200f874: 81 e8 00 00 restore * 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 ); 200f878: 40 00 01 38 call 200fd58 200f87c: 01 00 00 00 nop 200f880: 40 00 00 f9 call 200fc64 200f884: 92 10 00 19 mov %i1, %o1 200f888: 81 c7 e0 08 ret 200f88c: 91 e8 00 08 restore %g0, %o0, %o0 */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; if ( !value ) { siginfo->si_value.sival_int = 0; 200f890: 10 bf ff c3 b 200f79c 200f894: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 200f898: 03 00 80 70 sethi %hi(0x201c000), %g1 200f89c: da 08 62 24 ldub [ %g1 + 0x224 ], %o5 ! 201c224 200f8a0: 13 00 80 73 sethi %hi(0x201cc00), %o1 200f8a4: 9a 03 60 01 inc %o5 200f8a8: 92 12 60 a8 or %o1, 0xa8, %o1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 200f8ac: 82 10 20 00 clr %g1 200f8b0: 90 02 60 0c add %o1, 0xc, %o0 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 200f8b4: 35 04 00 00 sethi %hi(0x10000000), %i2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and ITRON is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 200f8b8: c4 02 40 00 ld [ %o1 ], %g2 200f8bc: 80 a0 a0 00 cmp %g2, 0 200f8c0: 22 80 00 2d be,a 200f974 200f8c4: 92 02 60 04 add %o1, 4, %o1 continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 200f8c8: c4 00 a0 04 ld [ %g2 + 4 ], %g2 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 200f8cc: d8 10 a0 10 lduh [ %g2 + 0x10 ], %o4 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 200f8d0: 80 a3 20 00 cmp %o4, 0 200f8d4: 02 80 00 27 be 200f970 200f8d8: d6 00 a0 1c ld [ %g2 + 0x1c ], %o3 200f8dc: 84 10 20 01 mov 1, %g2 the_thread = (Thread_Control *) object_table[ index ]; 200f8e0: 87 28 a0 02 sll %g2, 2, %g3 200f8e4: c6 02 c0 03 ld [ %o3 + %g3 ], %g3 if ( !the_thread ) 200f8e8: 80 a0 e0 00 cmp %g3, 0 200f8ec: 02 80 00 1e be 200f964 200f8f0: 84 00 a0 01 inc %g2 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 200f8f4: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 200f8f8: 80 a1 00 0d cmp %g4, %o5 200f8fc: 18 80 00 1b bgu 200f968 200f900: 80 a3 00 02 cmp %o4, %g2 DEBUG_STEP("2"); /* * If this thread is not interested, then go on to the next thread. */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200f904: d4 00 e1 6c ld [ %g3 + 0x16c ], %o2 200f908: d4 02 a0 cc ld [ %o2 + 0xcc ], %o2 200f90c: 80 ac 00 0a andncc %l0, %o2, %g0 200f910: 02 80 00 16 be 200f968 200f914: 80 a3 00 02 cmp %o4, %g2 * * 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 ) { 200f918: 80 a1 00 0d cmp %g4, %o5 200f91c: 2a 80 00 11 bcs,a 200f960 200f920: 9a 10 00 04 mov %g4, %o5 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( !_States_Is_ready( interested->current_state ) ) { 200f924: d4 00 60 10 ld [ %g1 + 0x10 ], %o2 200f928: 80 a2 a0 00 cmp %o2, 0 200f92c: 02 80 00 0f be 200f968 200f930: 80 a3 00 02 cmp %o4, %g2 /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 200f934: de 00 e0 10 ld [ %g3 + 0x10 ], %o7 200f938: 80 a3 e0 00 cmp %o7, 0 200f93c: 22 80 00 09 be,a 200f960 200f940: 9a 10 00 04 mov %g4, %o5 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 200f944: 80 8a 80 1a btst %o2, %i2 200f948: 12 80 00 08 bne 200f968 200f94c: 80 a3 00 02 cmp %o4, %g2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 200f950: 80 8b c0 1a btst %o7, %i2 200f954: 02 80 00 05 be 200f968 200f958: 80 a3 00 02 cmp %o4, %g2 200f95c: 9a 10 00 04 mov %g4, %o5 200f960: 82 10 00 03 mov %g3, %g1 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 200f964: 80 a3 00 02 cmp %o4, %g2 200f968: 1a bf ff df bcc 200f8e4 200f96c: 87 28 a0 02 sll %g2, 2, %g3 200f970: 92 02 60 04 add %o1, 4, %o1 * + 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++) { 200f974: 80 a2 40 08 cmp %o1, %o0 200f978: 32 bf ff d1 bne,a 200f8bc 200f97c: c4 02 40 00 ld [ %o1 ], %g2 } } } } if ( interested ) { 200f980: 80 a0 60 00 cmp %g1, 0 200f984: 02 bf ff b2 be 200f84c 200f988: 84 10 20 01 mov 1, %g2 /* * 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 ) ) { 200f98c: 90 10 00 01 mov %g1, %o0 200f990: 92 10 00 19 mov %i1, %o1 * thread needs to do the post context switch extension so it can * evaluate the signals pending. */ process_it: the_thread->do_post_task_switch_extension = true; 200f994: c4 28 60 74 stb %g2, [ %g1 + 0x74 ] /* * 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 ) ) { 200f998: 40 00 00 62 call 200fb20 <_POSIX_signals_Unblock_thread> 200f99c: 94 07 bf f4 add %fp, -12, %o2 200f9a0: 80 8a 20 ff btst 0xff, %o0 200f9a4: 02 bf ff aa be 200f84c 200f9a8: 01 00 00 00 nop _Thread_Enable_dispatch(); 200f9ac: 7f ff e2 81 call 20083b0 <_Thread_Enable_dispatch> 200f9b0: b0 10 20 00 clr %i0 ! 0 return 0; 200f9b4: 81 c7 e0 08 ret 200f9b8: 81 e8 00 00 restore */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 200f9bc: 7f ff f3 f2 call 200c984 <_Chain_Get> 200f9c0: 90 12 20 54 or %o0, 0x54, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 200f9c4: 80 a2 20 00 cmp %o0, 0 200f9c8: 02 80 00 19 be 200fa2c 200f9cc: c2 07 bf f4 ld [ %fp + -12 ], %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 200f9d0: 92 10 00 08 mov %o0, %o1 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 200f9d4: c2 22 20 08 st %g1, [ %o0 + 8 ] 200f9d8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200f9dc: c2 22 20 0c st %g1, [ %o0 + 0xc ] 200f9e0: c2 07 bf fc ld [ %fp + -4 ], %g1 200f9e4: c2 22 20 10 st %g1, [ %o0 + 0x10 ] _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 200f9e8: 11 00 80 75 sethi %hi(0x201d400), %o0 200f9ec: 90 12 20 cc or %o0, 0xcc, %o0 ! 201d4cc <_POSIX_signals_Siginfo> 200f9f0: 7f ff dc 23 call 2006a7c <_Chain_Append> 200f9f4: 90 02 00 12 add %o0, %l2, %o0 200f9f8: 30 bf ff 9c b,a 200f868 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 200f9fc: 40 00 01 0c call 200fe2c <__errno> 200fa00: b0 10 3f ff mov -1, %i0 200fa04: 82 10 20 03 mov 3, %g1 200fa08: c2 22 00 00 st %g1, [ %o0 ] 200fa0c: 81 c7 e0 08 ret 200fa10: 81 e8 00 00 restore */ if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 200fa14: 40 00 01 06 call 200fe2c <__errno> 200fa18: b0 10 3f ff mov -1, %i0 200fa1c: 82 10 20 16 mov 0x16, %g1 200fa20: c2 22 00 00 st %g1, [ %o0 ] 200fa24: 81 c7 e0 08 ret 200fa28: 81 e8 00 00 restore 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(); 200fa2c: 7f ff e2 61 call 20083b0 <_Thread_Enable_dispatch> 200fa30: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 200fa34: 40 00 00 fe call 200fe2c <__errno> 200fa38: 01 00 00 00 nop 200fa3c: 82 10 20 0b mov 0xb, %g1 ! b 200fa40: c2 22 00 00 st %g1, [ %o0 ] 200fa44: 81 c7 e0 08 ret 200fa48: 81 e8 00 00 restore 02006944 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2006944: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2006948: 80 a6 60 00 cmp %i1, 0 200694c: 02 80 00 0b be 2006978 2006950: a0 10 00 18 mov %i0, %l0 2006954: 80 a6 20 00 cmp %i0, 0 2006958: 02 80 00 08 be 2006978 200695c: 01 00 00 00 nop return EINVAL; if ( !once_control->init_executed ) { 2006960: c2 06 20 04 ld [ %i0 + 4 ], %g1 2006964: 80 a0 60 00 cmp %g1, 0 2006968: 02 80 00 06 be 2006980 200696c: b0 10 20 00 clr %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006970: 81 c7 e0 08 ret 2006974: 81 e8 00 00 restore int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) 2006978: 81 c7 e0 08 ret 200697c: 91 e8 20 16 restore %g0, 0x16, %o0 return EINVAL; if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2006980: a2 07 bf fc add %fp, -4, %l1 2006984: 90 10 21 00 mov 0x100, %o0 2006988: 92 10 21 00 mov 0x100, %o1 200698c: 40 00 03 09 call 20075b0 2006990: 94 10 00 11 mov %l1, %o2 if ( !once_control->init_executed ) { 2006994: c2 04 20 04 ld [ %l0 + 4 ], %g1 2006998: 80 a0 60 00 cmp %g1, 0 200699c: 02 80 00 09 be 20069c0 20069a0: 82 10 20 01 mov 1, %g1 once_control->is_initialized = true; once_control->init_executed = true; (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20069a4: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 20069a8: 94 10 00 11 mov %l1, %o2 20069ac: 92 10 21 00 mov 0x100, %o1 20069b0: 40 00 03 00 call 20075b0 20069b4: b0 10 20 00 clr %i0 } return 0; } 20069b8: 81 c7 e0 08 ret 20069bc: 81 e8 00 00 restore if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); if ( !once_control->init_executed ) { once_control->is_initialized = true; once_control->init_executed = true; 20069c0: c2 24 20 04 st %g1, [ %l0 + 4 ] (*init_routine)(); 20069c4: 9f c6 40 00 call %i1 20069c8: c2 24 00 00 st %g1, [ %l0 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20069cc: 10 bf ff f7 b 20069a8 20069d0: d0 07 bf fc ld [ %fp + -4 ], %o0 02006554 : * * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 2006554: 9d e3 bf a0 save %sp, -96, %sp * Don't even think about deleting a resource from an ISR. * Besides this request is supposed to be for _Thread_Executing * and the ISR context is not a thread. */ if ( _ISR_Is_in_progress() ) 2006558: 03 00 80 7a sethi %hi(0x201e800), %g1 200655c: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 201ebcc <_ISR_Nest_level> 2006560: 80 a0 60 00 cmp %g1, 0 2006564: 12 80 00 15 bne 20065b8 2006568: 03 00 80 7a sethi %hi(0x201e800), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 200656c: 21 00 80 7a sethi %hi(0x201e800), %l0 2006570: c6 00 63 30 ld [ %g1 + 0x330 ], %g3 2006574: c4 04 23 f0 ld [ %l0 + 0x3f0 ], %g2 2006578: 86 00 e0 01 inc %g3 200657c: c6 20 63 30 st %g3, [ %g1 + 0x330 ] 2006580: c2 00 a1 6c ld [ %g2 + 0x16c ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2006584: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 2006588: 80 a0 a0 00 cmp %g2, 0 200658c: 12 80 00 0d bne 20065c0 2006590: 01 00 00 00 nop thread_support->cancelation_requested ) 2006594: c2 00 60 dc ld [ %g1 + 0xdc ], %g1 2006598: 80 a0 60 00 cmp %g1, 0 200659c: 02 80 00 09 be 20065c0 20065a0: 01 00 00 00 nop cancel = true; _Thread_Enable_dispatch(); 20065a4: 40 00 0a 56 call 2008efc <_Thread_Enable_dispatch> 20065a8: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 20065ac: f0 04 23 f0 ld [ %l0 + 0x3f0 ], %i0 20065b0: 40 00 1a 99 call 200d014 <_POSIX_Thread_Exit> 20065b4: 81 e8 00 00 restore 20065b8: 81 c7 e0 08 ret <== NOT EXECUTED 20065bc: 81 e8 00 00 restore <== NOT EXECUTED _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 20065c0: 40 00 0a 4f call 2008efc <_Thread_Enable_dispatch> 20065c4: 81 e8 00 00 restore 020084ec : 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 ) { 20084ec: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 20084f0: 03 00 80 8c sethi %hi(0x2023000), %g1 20084f4: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 ! 202307c <_ISR_Nest_level> rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; 20084f8: 09 00 80 8e sethi %hi(0x2023800), %g4 if ( rtems_interrupt_is_in_progress() ) 20084fc: 80 a0 60 00 cmp %g1, 0 2008500: 84 10 20 12 mov 0x12, %g2 rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 2008504: 82 10 00 19 mov %i1, %g1 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2008508: 12 80 00 49 bne 200862c 200850c: c6 01 21 8c ld [ %g4 + 0x18c ], %g3 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 2008510: 80 a6 a0 00 cmp %i2, 0 2008514: 02 80 00 4b be 2008640 2008518: 80 a6 60 00 cmp %i1, 0 return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 200851c: 02 80 00 49 be 2008640 2008520: c6 26 80 00 st %g3, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008524: c4 06 40 00 ld [ %i1 ], %g2 2008528: 80 a0 a0 00 cmp %g2, 0 200852c: 22 80 00 42 be,a 2008634 2008530: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 2008534: 80 a0 c0 18 cmp %g3, %i0 2008538: 08 80 00 3d bleu 200862c 200853c: 84 10 20 0a mov 0xa, %g2 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 2008540: 05 00 80 8b sethi %hi(0x2022c00), %g2 2008544: c6 00 a3 e0 ld [ %g2 + 0x3e0 ], %g3 ! 2022fe0 <_Thread_Dispatch_disable_level> 2008548: 86 00 e0 01 inc %g3 200854c: c6 20 a3 e0 st %g3, [ %g2 + 0x3e0 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2008550: 80 a6 20 00 cmp %i0, 0 2008554: 12 80 00 2b bne 2008600 2008558: 05 00 80 8e sethi %hi(0x2023800), %g2 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 200855c: da 01 21 8c ld [ %g4 + 0x18c ], %o5 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2008560: 80 a3 60 00 cmp %o5, 0 2008564: 02 80 00 3a be 200864c 2008568: d8 00 a1 90 ld [ %g2 + 0x190 ], %o4 200856c: 10 80 00 05 b 2008580 2008570: 86 10 00 0c mov %o4, %g3 2008574: 80 a3 40 18 cmp %o5, %i0 2008578: 08 80 00 0b bleu 20085a4 200857c: 86 00 e0 18 add %g3, 0x18, %g3 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008580: c8 00 c0 00 ld [ %g3 ], %g4 2008584: 80 a1 20 00 cmp %g4, 0 2008588: 32 bf ff fb bne,a 2008574 200858c: b0 06 20 01 inc %i0 2008590: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2008594: 80 a1 20 00 cmp %g4, 0 2008598: 32 bf ff f7 bne,a 2008574 200859c: b0 06 20 01 inc %i0 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 20085a0: 80 a3 40 18 cmp %o5, %i0 20085a4: 02 80 00 2b be 2008650 20085a8: f0 26 80 00 st %i0, [ %i2 ] 20085ac: 85 2e 20 03 sll %i0, 3, %g2 20085b0: 87 2e 20 05 sll %i0, 5, %g3 20085b4: 84 20 c0 02 sub %g3, %g2, %g2 20085b8: 84 03 00 02 add %o4, %g2, %g2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20085bc: c6 00 40 00 ld [ %g1 ], %g3 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 20085c0: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20085c4: c6 20 80 00 st %g3, [ %g2 ] 20085c8: c6 00 60 04 ld [ %g1 + 4 ], %g3 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 20085cc: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 20085d0: c6 20 a0 04 st %g3, [ %g2 + 4 ] 20085d4: c6 00 60 08 ld [ %g1 + 8 ], %g3 20085d8: c6 20 a0 08 st %g3, [ %g2 + 8 ] 20085dc: c6 00 60 0c ld [ %g1 + 0xc ], %g3 20085e0: c6 20 a0 0c st %g3, [ %g2 + 0xc ] 20085e4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 20085e8: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] 20085ec: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 _Thread_Enable_dispatch(); 20085f0: 40 00 07 53 call 200a33c <_Thread_Enable_dispatch> 20085f4: c2 20 a0 14 st %g1, [ %g2 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 20085f8: 40 00 27 1b call 2012264 20085fc: 81 e8 00 00 restore _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 2008600: c6 00 a1 90 ld [ %g2 + 0x190 ], %g3 2008604: 89 2e 20 05 sll %i0, 5, %g4 2008608: 85 2e 20 03 sll %i0, 3, %g2 200860c: 84 21 00 02 sub %g4, %g2, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008610: c8 00 c0 02 ld [ %g3 + %g2 ], %g4 2008614: 80 a1 20 00 cmp %g4, 0 2008618: 02 80 00 12 be 2008660 200861c: 84 00 c0 02 add %g3, %g2, %g2 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 2008620: 40 00 07 47 call 200a33c <_Thread_Enable_dispatch> 2008624: 01 00 00 00 nop 2008628: 84 10 20 0c mov 0xc, %g2 ! c _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 200862c: 81 c7 e0 08 ret 2008630: 91 e8 00 02 restore %g0, %g2, %o0 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008634: 80 a0 a0 00 cmp %g2, 0 2008638: 12 bf ff c0 bne 2008538 200863c: 80 a0 c0 18 cmp %g3, %i0 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2008640: 84 10 20 09 mov 9, %g2 } 2008644: 81 c7 e0 08 ret 2008648: 91 e8 00 02 restore %g0, %g2, %o0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 200864c: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2008650: 40 00 07 3b call 200a33c <_Thread_Enable_dispatch> 2008654: 01 00 00 00 nop return sc; 2008658: 10 bf ff f5 b 200862c 200865c: 84 10 20 05 mov 5, %g2 ! 5 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2008660: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008664: 80 a0 e0 00 cmp %g3, 0 2008668: 12 bf ff ee bne 2008620 200866c: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2008670: 10 bf ff d3 b 20085bc 2008674: f0 26 80 00 st %i0, [ %i2 ] 02009370 : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 2009370: 9d e3 bf 98 save %sp, -104, %sp * * 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 ); 2009374: 90 10 00 19 mov %i1, %o0 2009378: 40 00 19 6c call 200f928 <_POSIX_Absolute_timeout_to_ticks> 200937c: 92 07 bf fc add %fp, -4, %o1 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009380: 80 a2 20 03 cmp %o0, 3 2009384: 02 80 00 07 be 20093a0 2009388: d4 07 bf fc ld [ %fp + -4 ], %o2 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 200938c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2009390: 40 00 1c 54 call 20104e0 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 2009394: 92 10 20 00 clr %o1 <== NOT EXECUTED break; } } return lock_status; } 2009398: 81 c7 e0 08 ret <== NOT EXECUTED 200939c: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED */ 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 ); 20093a0: 90 10 00 18 mov %i0, %o0 20093a4: 40 00 1c 4f call 20104e0 <_POSIX_Semaphore_Wait_support> 20093a8: 92 10 20 01 mov 1, %o1 break; } } return lock_status; } 20093ac: 81 c7 e0 08 ret 20093b0: 91 e8 00 08 restore %g0, %o0, %o0 02008c00 : #include int sigsuspend( const sigset_t *sigmask ) { 2008c00: 9d e3 bf 98 save %sp, -104, %sp int status; POSIX_API_Control *api; api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; status = sigprocmask( SIG_BLOCK, sigmask, &saved_signals_blocked ); 2008c04: 90 10 20 01 mov 1, %o0 2008c08: 92 10 00 18 mov %i0, %o1 2008c0c: a0 07 bf fc add %fp, -4, %l0 2008c10: 7f ff ff f1 call 2008bd4 2008c14: 94 10 00 10 mov %l0, %o2 (void) sigfillset( &all_signals ); 2008c18: a2 07 bf f8 add %fp, -8, %l1 2008c1c: 7f ff ff b7 call 2008af8 2008c20: 90 10 00 11 mov %l1, %o0 status = sigtimedwait( &all_signals, NULL, NULL ); 2008c24: 90 10 00 11 mov %l1, %o0 2008c28: 92 10 20 00 clr %o1 2008c2c: 40 00 00 2b call 2008cd8 2008c30: 94 10 20 00 clr %o2 (void) sigprocmask( SIG_SETMASK, &saved_signals_blocked, NULL ); 2008c34: 92 10 00 10 mov %l0, %o1 status = sigprocmask( SIG_BLOCK, sigmask, &saved_signals_blocked ); (void) sigfillset( &all_signals ); status = sigtimedwait( &all_signals, NULL, NULL ); 2008c38: a2 10 00 08 mov %o0, %l1 (void) sigprocmask( SIG_SETMASK, &saved_signals_blocked, NULL ); 2008c3c: 94 10 20 00 clr %o2 2008c40: 7f ff ff e5 call 2008bd4 2008c44: 90 10 20 00 clr %o0 /* * sigtimedwait() returns the signal number while sigsuspend() * is supposed to return -1 and EINTR when a signal is caught. */ if ( status != -1 ) 2008c48: 80 a4 7f ff cmp %l1, -1 2008c4c: 12 80 00 05 bne 2008c60 2008c50: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINTR ); return status; } 2008c54: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 2008c58: 81 c7 e0 08 ret <== NOT EXECUTED 2008c5c: 81 e8 00 00 restore <== NOT EXECUTED /* * sigtimedwait() returns the signal number while sigsuspend() * is supposed to return -1 and EINTR when a signal is caught. */ if ( status != -1 ) rtems_set_errno_and_return_minus_one( EINTR ); 2008c60: 40 00 28 b4 call 2012f30 <__errno> 2008c64: b0 10 3f ff mov -1, %i0 2008c68: 82 10 20 04 mov 4, %g1 2008c6c: c2 22 00 00 st %g1, [ %o0 ] 2008c70: 81 c7 e0 08 ret 2008c74: 81 e8 00 00 restore