=============================================================================== 0200aca0 : { IMFS_jnode_t *node = loc->node_access; IMFS_fs_info_t *fs_info; fs_info = loc->mt_entry->fs_info; switch( node->type ) { 200aca0: c2 02 00 00 ld [ %o0 ], %g1 ) { IMFS_jnode_t *node = loc->node_access; IMFS_fs_info_t *fs_info; fs_info = loc->mt_entry->fs_info; 200aca4: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 switch( node->type ) { 200aca8: c2 00 60 4c ld [ %g1 + 0x4c ], %g1 200acac: 80 a0 60 07 cmp %g1, 7 200acb0: 18 80 00 0a bgu 200acd8 <== NEVER TAKEN 200acb4: c4 00 a0 34 ld [ %g2 + 0x34 ], %g2 200acb8: 83 28 60 02 sll %g1, 2, %g1 200acbc: 07 00 80 2b sethi %hi(0x200ac00), %g3 200acc0: 86 10 e0 24 or %g3, 0x24, %g3 ! 200ac24 200acc4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 200acc8: 81 c0 40 00 jmp %g1 200accc: 01 00 00 00 nop case IMFS_DIRECTORY: loc->handlers = fs_info->directory_handlers; 200acd0: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 200acd4: c2 22 20 08 st %g1, [ %o0 + 8 ] loc->handlers = fs_info->fifo_handlers; break; } return 0; } 200acd8: 81 c3 e0 08 retl 200acdc: 90 10 20 00 clr %o0 break; case IMFS_LINEAR_FILE: loc->handlers = fs_info->memfile_handlers; break; case IMFS_MEMORY_FILE: loc->handlers = fs_info->memfile_handlers; 200ace0: c2 00 a0 08 ld [ %g2 + 8 ], %g1 200ace4: c2 22 20 08 st %g1, [ %o0 + 8 ] loc->handlers = fs_info->fifo_handlers; break; } return 0; } 200ace8: 81 c3 e0 08 retl 200acec: 90 10 20 00 clr %o0 case IMFS_DEVICE: loc->handlers = &IMFS_device_handlers; break; case IMFS_SYM_LINK: case IMFS_HARD_LINK: loc->handlers = &IMFS_link_handlers; 200acf0: 03 00 80 69 sethi %hi(0x201a400), %g1 200acf4: 82 10 63 2c or %g1, 0x32c, %g1 ! 201a72c 200acf8: c2 22 20 08 st %g1, [ %o0 + 8 ] loc->handlers = fs_info->fifo_handlers; break; } return 0; } 200acfc: 81 c3 e0 08 retl 200ad00: 90 10 20 00 clr %o0 break; case IMFS_MEMORY_FILE: loc->handlers = fs_info->memfile_handlers; break; case IMFS_FIFO: loc->handlers = fs_info->fifo_handlers; 200ad04: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 200ad08: c2 22 20 08 st %g1, [ %o0 + 8 ] break; } return 0; } 200ad0c: 81 c3 e0 08 retl 200ad10: 90 10 20 00 clr %o0 switch( node->type ) { case IMFS_DIRECTORY: loc->handlers = fs_info->directory_handlers; break; case IMFS_DEVICE: loc->handlers = &IMFS_device_handlers; 200ad14: 03 00 80 69 sethi %hi(0x201a400), %g1 200ad18: 82 10 62 bc or %g1, 0x2bc, %g1 ! 201a6bc 200ad1c: c2 22 20 08 st %g1, [ %o0 + 8 ] loc->handlers = fs_info->fifo_handlers; break; } return 0; } 200ad20: 81 c3 e0 08 retl 200ad24: 90 10 20 00 clr %o0 =============================================================================== 0200aab0 : IMFS_jnode_types_t type, const char *name, mode_t mode, const IMFS_types_union *info ) { 200aab0: 9d e3 bf a0 save %sp, -96, %sp 200aab4: 82 10 00 18 mov %i0, %g1 IMFS_fs_info_t *fs_info; /* * MUST have a parent node to call this routine. */ if ( parent_loc == NULL ) 200aab8: 80 a0 60 00 cmp %g1, 0 200aabc: 02 80 00 2b be 200ab68 <== NEVER TAKEN 200aac0: b0 10 20 00 clr %i0 return NULL; parent = parent_loc->node_access; fs_info = parent_loc->mt_entry->fs_info; 200aac4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 * MUST have a parent node to call this routine. */ if ( parent_loc == NULL ) return NULL; parent = parent_loc->node_access; 200aac8: e0 00 40 00 ld [ %g1 ], %l0 fs_info = parent_loc->mt_entry->fs_info; /* * Reject creation of FIFOs if support is disabled. */ if ( type == IMFS_FIFO && 200aacc: 80 a6 60 07 cmp %i1, 7 200aad0: 02 80 00 28 be 200ab70 200aad4: fa 00 a0 34 ld [ %g2 + 0x34 ], %i5 return NULL; /* * Allocate filesystem node and fill in basic information */ node = IMFS_allocate_node( type, name, mode & ~rtems_filesystem_umask ); 200aad8: 03 00 80 6e sethi %hi(0x201b800), %g1 200aadc: c2 00 60 8c ld [ %g1 + 0x8c ], %g1 ! 201b88c 200aae0: 90 10 00 19 mov %i1, %o0 200aae4: d4 00 60 2c ld [ %g1 + 0x2c ], %o2 200aae8: 92 10 00 1a mov %i2, %o1 200aaec: 7f ff ff d8 call 200aa4c 200aaf0: 94 2e c0 0a andn %i3, %o2, %o2 if ( !node ) 200aaf4: b0 92 20 00 orcc %o0, 0, %i0 200aaf8: 02 80 00 1c be 200ab68 200aafc: 80 a6 60 01 cmp %i1, 1 return NULL; /* * Set the type specific information */ if ( type == IMFS_DIRECTORY ) { 200ab00: 02 80 00 24 be 200ab90 200ab04: 80 a6 60 03 cmp %i1, 3 rtems_chain_initialize_empty(&node->info.directory.Entries); } else if ( type == IMFS_HARD_LINK ) { 200ab08: 02 80 00 0e be 200ab40 200ab0c: 80 a6 60 04 cmp %i1, 4 node->info.hard_link.link_node = info->hard_link.link_node; } else if ( type == IMFS_SYM_LINK ) { 200ab10: 02 80 00 0c be 200ab40 200ab14: 80 a6 60 02 cmp %i1, 2 node->info.sym_link.name = info->sym_link.name; } else if ( type == IMFS_DEVICE ) { 200ab18: 02 80 00 28 be 200abb8 200ab1c: 80 a6 60 06 cmp %i1, 6 node->info.device.major = info->device.major; node->info.device.minor = info->device.minor; } else if ( type == IMFS_LINEAR_FILE ) { 200ab20: 02 80 00 22 be 200aba8 200ab24: 80 a6 60 05 cmp %i1, 5 node->info.linearfile.size = 0; node->info.linearfile.direct = 0; } else if ( type == IMFS_MEMORY_FILE ) { 200ab28: 02 80 00 29 be 200abcc 200ab2c: 80 a6 60 07 cmp %i1, 7 node->info.file.size = 0; node->info.file.indirect = 0; node->info.file.doubly_indirect = 0; node->info.file.triply_indirect = 0; } else if ( type == IMFS_FIFO ) { 200ab30: 22 80 00 06 be,a 200ab48 <== ALWAYS TAKEN 200ab34: c0 26 20 50 clr [ %i0 + 0x50 ] /* * This node MUST have a parent, so put it in that directory list. */ node->Parent = parent; node->st_ino = ++fs_info->ino_count; 200ab38: 10 80 00 05 b 200ab4c <== NOT EXECUTED 200ab3c: c2 07 60 04 ld [ %i5 + 4 ], %g1 <== NOT EXECUTED if ( type == IMFS_DIRECTORY ) { rtems_chain_initialize_empty(&node->info.directory.Entries); } else if ( type == IMFS_HARD_LINK ) { node->info.hard_link.link_node = info->hard_link.link_node; } else if ( type == IMFS_SYM_LINK ) { node->info.sym_link.name = info->sym_link.name; 200ab40: c2 07 00 00 ld [ %i4 ], %g1 200ab44: c2 26 20 50 st %g1, [ %i0 + 0x50 ] /* * This node MUST have a parent, so put it in that directory list. */ node->Parent = parent; node->st_ino = ++fs_info->ino_count; 200ab48: c2 07 60 04 ld [ %i5 + 4 ], %g1 } /* * This node MUST have a parent, so put it in that directory list. */ node->Parent = parent; 200ab4c: e0 26 20 08 st %l0, [ %i0 + 8 ] node->st_ino = ++fs_info->ino_count; 200ab50: 82 00 60 01 inc %g1 200ab54: c2 27 60 04 st %g1, [ %i5 + 4 ] 200ab58: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 200ab5c: 90 04 20 50 add %l0, 0x50, %o0 200ab60: 7f ff f2 0f call 200739c <_Chain_Append> 200ab64: 92 10 00 18 mov %i0, %o1 rtems_chain_append( &parent->info.directory.Entries, &node->Node ); return node; } 200ab68: 81 c7 e0 08 ret 200ab6c: 81 e8 00 00 restore fs_info = parent_loc->mt_entry->fs_info; /* * Reject creation of FIFOs if support is disabled. */ if ( type == IMFS_FIFO && 200ab70: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 200ab74: 03 00 80 69 sethi %hi(0x201a400), %g1 200ab78: 82 10 62 34 or %g1, 0x234, %g1 ! 201a634 200ab7c: 80 a0 80 01 cmp %g2, %g1 200ab80: 12 bf ff d7 bne 200aadc 200ab84: 03 00 80 6e sethi %hi(0x201b800), %g1 node->st_ino = ++fs_info->ino_count; rtems_chain_append( &parent->info.directory.Entries, &node->Node ); return node; } 200ab88: 81 c7 e0 08 ret 200ab8c: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 200ab90: 82 06 20 50 add %i0, 0x50, %g1 200ab94: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; 200ab98: c0 26 20 54 clr [ %i0 + 0x54 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200ab9c: c4 26 20 50 st %g2, [ %i0 + 0x50 ] head->previous = NULL; tail->previous = head; 200aba0: 10 bf ff ea b 200ab48 200aba4: c2 26 20 58 st %g1, [ %i0 + 0x58 ] node->info.sym_link.name = info->sym_link.name; } else if ( type == IMFS_DEVICE ) { node->info.device.major = info->device.major; node->info.device.minor = info->device.minor; } else if ( type == IMFS_LINEAR_FILE ) { node->info.linearfile.size = 0; 200aba8: c0 26 20 50 clr [ %i0 + 0x50 ] 200abac: c0 26 20 54 clr [ %i0 + 0x54 ] node->info.linearfile.direct = 0; 200abb0: 10 bf ff e6 b 200ab48 200abb4: c0 26 20 58 clr [ %i0 + 0x58 ] } else if ( type == IMFS_HARD_LINK ) { node->info.hard_link.link_node = info->hard_link.link_node; } else if ( type == IMFS_SYM_LINK ) { node->info.sym_link.name = info->sym_link.name; } else if ( type == IMFS_DEVICE ) { node->info.device.major = info->device.major; 200abb8: c4 07 00 00 ld [ %i4 ], %g2 node->info.device.minor = info->device.minor; 200abbc: c2 07 20 04 ld [ %i4 + 4 ], %g1 } else if ( type == IMFS_HARD_LINK ) { node->info.hard_link.link_node = info->hard_link.link_node; } else if ( type == IMFS_SYM_LINK ) { node->info.sym_link.name = info->sym_link.name; } else if ( type == IMFS_DEVICE ) { node->info.device.major = info->device.major; 200abc0: c4 26 20 50 st %g2, [ %i0 + 0x50 ] node->info.device.minor = info->device.minor; 200abc4: 10 bf ff e1 b 200ab48 200abc8: c2 26 20 54 st %g1, [ %i0 + 0x54 ] } else if ( type == IMFS_LINEAR_FILE ) { node->info.linearfile.size = 0; node->info.linearfile.direct = 0; } else if ( type == IMFS_MEMORY_FILE ) { node->info.file.size = 0; 200abcc: c0 26 20 50 clr [ %i0 + 0x50 ] 200abd0: c0 26 20 54 clr [ %i0 + 0x54 ] node->info.file.indirect = 0; 200abd4: c0 26 20 58 clr [ %i0 + 0x58 ] node->info.file.doubly_indirect = 0; 200abd8: c0 26 20 5c clr [ %i0 + 0x5c ] node->info.file.triply_indirect = 0; 200abdc: 10 bf ff db b 200ab48 200abe0: c0 26 20 60 clr [ %i0 + 0x60 ] =============================================================================== 02005160 : */ void IMFS_dump_directory( IMFS_jnode_t *the_directory, int level ) { 2005160: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2005164: fa 06 20 50 ld [ %i0 + 0x50 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 2005168: b8 06 20 54 add %i0, 0x54, %i4 IMFS_assert( level >= 0 ); IMFS_assert( the_directory->type == IMFS_DIRECTORY ); the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); 200516c: 80 a7 40 1c cmp %i5, %i4 2005170: 02 80 00 1e be 20051e8 2005174: 31 00 80 86 sethi %hi(0x2021800), %i0 2005178: 21 00 80 8d sethi %hi(0x2023400), %l0 the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); 200517c: b0 16 20 18 or %i0, 0x18, %i0 IMFS_print_jnode( the_jnode ); if ( the_jnode->type == IMFS_DIRECTORY ) IMFS_dump_directory( the_jnode, level + 1 ); 2005180: a2 06 60 01 add %i1, 1, %l1 !rtems_chain_is_tail( the_chain, the_node ); the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) 2005184: 80 a6 60 00 cmp %i1, 0 2005188: 06 80 00 0e bl 20051c0 <== NEVER TAKEN 200518c: 01 00 00 00 nop 2005190: b6 10 20 00 clr %i3 ! 0 2005194: b4 14 21 90 or %l0, 0x190, %i2 fprintf(stdout, "...." ); 2005198: c2 06 80 00 ld [ %i2 ], %g1 200519c: 90 10 00 18 mov %i0, %o0 20051a0: d6 00 60 08 ld [ %g1 + 8 ], %o3 20051a4: 92 10 20 01 mov 1, %o1 20051a8: 40 00 3c 43 call 20142b4 20051ac: 94 10 20 04 mov 4, %o2 !rtems_chain_is_tail( the_chain, the_node ); the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) 20051b0: b6 06 e0 01 inc %i3 20051b4: 80 a6 40 1b cmp %i1, %i3 20051b8: 36 bf ff f9 bge,a 200519c 20051bc: c2 06 80 00 ld [ %i2 ], %g1 fprintf(stdout, "...." ); IMFS_print_jnode( the_jnode ); 20051c0: 7f ff ff a2 call 2005048 20051c4: 90 10 00 1d mov %i5, %o0 if ( the_jnode->type == IMFS_DIRECTORY ) 20051c8: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 20051cc: 80 a0 60 01 cmp %g1, 1 20051d0: 22 80 00 08 be,a 20051f0 20051d4: 90 10 00 1d mov %i5, %o0 the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); !rtems_chain_is_tail( the_chain, the_node ); the_node = the_node->next ) { 20051d8: fa 07 40 00 ld [ %i5 ], %i5 IMFS_assert( level >= 0 ); IMFS_assert( the_directory->type == IMFS_DIRECTORY ); the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); 20051dc: 80 a7 40 1c cmp %i5, %i4 20051e0: 12 bf ff ea bne 2005188 20051e4: 80 a6 60 00 cmp %i1, 0 20051e8: 81 c7 e0 08 ret 20051ec: 81 e8 00 00 restore for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); IMFS_print_jnode( the_jnode ); if ( the_jnode->type == IMFS_DIRECTORY ) IMFS_dump_directory( the_jnode, level + 1 ); 20051f0: 7f ff ff dc call 2005160 20051f4: 92 10 00 11 mov %l1, %o1 the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); !rtems_chain_is_tail( the_chain, the_node ); the_node = the_node->next ) { 20051f8: 10 bf ff f9 b 20051dc 20051fc: fa 07 40 00 ld [ %i5 ], %i5 =============================================================================== 0200adc0 : const char *pathname, /* IN */ size_t pathnamelen, /* IN */ int flags, /* IN */ rtems_filesystem_location_info_t *pathloc /* IN/OUT */ ) { 200adc0: 9d e3 bf 70 save %sp, -144, %sp int i = 0; 200adc4: c0 27 bf f8 clr [ %fp + -8 ] const char *pathname, /* IN */ size_t pathnamelen, /* IN */ int flags, /* IN */ rtems_filesystem_location_info_t *pathloc /* IN/OUT */ ) { 200adc8: f2 27 a0 48 st %i1, [ %fp + 0x48 ] 200adcc: 92 10 00 19 mov %i1, %o1 IMFS_token_types type = IMFS_CURRENT_DIR; char token[ IMFS_NAME_MAX + 1 ]; IMFS_jnode_t *node; int result; if ( !rtems_libio_is_valid_perms( flags ) ) { 200add0: 80 8e bf f8 btst -8, %i2 200add4: 12 80 00 c1 bne 200b0d8 <== NEVER TAKEN 200add8: ba 10 00 18 mov %i0, %i5 /* * This was filled in by the caller and is valid in the * mount table. */ node = pathloc->node_access; 200addc: f8 06 c0 00 ld [ %i3 ], %i4 200ade0: 90 10 20 00 clr %o0 case IMFS_UP_DIR: /* * Am I at the root of all filesystems? (chroot'ed?) */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) 200ade4: 21 00 80 6e sethi %hi(0x201b800), %l0 * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { type = IMFS_get_token( &pathname[i], pathnamelen, token, &len ); 200ade8: 90 07 40 08 add %i5, %o0, %o0 200adec: 94 07 bf d0 add %fp, -48, %o2 200adf0: 40 00 02 93 call 200b83c 200adf4: 96 07 bf fc add %fp, -4, %o3 pathnamelen -= len; 200adf8: c2 07 bf fc ld [ %fp + -4 ], %g1 200adfc: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 i += len; 200ae00: c4 07 bf f8 ld [ %fp + -8 ], %g2 * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { type = IMFS_get_token( &pathname[i], pathnamelen, token, &len ); 200ae04: b2 10 00 08 mov %o0, %i1 pathnamelen -= len; i += len; if ( !pathloc->node_access ) 200ae08: d0 06 c0 00 ld [ %i3 ], %o0 */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { type = IMFS_get_token( &pathname[i], pathnamelen, token, &len ); pathnamelen -= len; 200ae0c: 92 22 40 01 sub %o1, %g1, %o1 i += len; 200ae10: 82 00 80 01 add %g2, %g1, %g1 */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { type = IMFS_get_token( &pathname[i], pathnamelen, token, &len ); pathnamelen -= len; 200ae14: d2 27 a0 48 st %o1, [ %fp + 0x48 ] i += len; if ( !pathloc->node_access ) 200ae18: 80 a2 20 00 cmp %o0, 0 200ae1c: 02 80 00 99 be 200b080 <== NEVER TAKEN 200ae20: c2 27 bf f8 st %g1, [ %fp + -8 ] rtems_set_errno_and_return_minus_one( ENOENT ); /* * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) 200ae24: 80 a6 60 00 cmp %i1, 0 200ae28: 32 80 00 15 bne,a 200ae7c 200ae2c: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 * new fs root node and let let the mounted filesystem set the handlers. * * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { 200ae30: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200ae34: 80 a0 60 01 cmp %g1, 1 200ae38: 22 80 00 98 be,a 200b098 200ae3c: c6 02 20 5c ld [ %o0 + 0x5c ], %g3 flags, pathloc ); } else { result = IMFS_Set_handlers( pathloc ); } } else { result = IMFS_Set_handlers( pathloc ); 200ae40: 7f ff ff 98 call 200aca0 200ae44: 90 10 00 1b mov %i3, %o0 /* * Verify we have the correct permissions for this node. */ if ( !IMFS_evaluate_permission( pathloc, flags ) ) 200ae48: 92 10 00 1a mov %i2, %o1 flags, pathloc ); } else { result = IMFS_Set_handlers( pathloc ); } } else { result = IMFS_Set_handlers( pathloc ); 200ae4c: b0 10 00 08 mov %o0, %i0 /* * Verify we have the correct permissions for this node. */ if ( !IMFS_evaluate_permission( pathloc, flags ) ) 200ae50: 7f ff ff b6 call 200ad28 200ae54: 90 10 00 1b mov %i3, %o0 200ae58: 80 a2 20 00 cmp %o0, 0 200ae5c: 12 80 00 c6 bne 200b174 200ae60: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EACCES ); 200ae64: 40 00 0f 2c call 200eb14 <__errno> 200ae68: b0 10 3f ff mov -1, %i0 ! ffffffff 200ae6c: 82 10 20 0d mov 0xd, %g1 200ae70: c2 22 00 00 st %g1, [ %o0 ] return result; } 200ae74: 81 c7 e0 08 ret 200ae78: 81 e8 00 00 restore /* * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) 200ae7c: 80 a0 60 01 cmp %g1, 1 200ae80: 22 80 00 53 be,a 200afcc 200ae84: 90 10 00 1b mov %i3, %o0 if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) rtems_set_errno_and_return_minus_one( EACCES ); node = pathloc->node_access; switch( type ) { 200ae88: 80 a6 60 03 cmp %i1, 3 200ae8c: 02 80 00 0b be 200aeb8 200ae90: 80 a6 60 04 cmp %i1, 4 200ae94: 02 80 00 30 be 200af54 200ae98: 80 a6 60 02 cmp %i1, 2 200ae9c: 02 80 00 1c be 200af0c 200aea0: 80 a6 60 04 cmp %i1, 4 /* * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { 200aea4: 02 bf ff e3 be 200ae30 <== NEVER TAKEN 200aea8: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 200aeac: b8 10 00 08 mov %o0, %i4 200aeb0: 10 bf ff ce b 200ade8 200aeb4: d0 07 bf f8 ld [ %fp + -8 ], %o0 case IMFS_NAME: /* * If we are at a link follow it. */ if ( node->type == IMFS_HARD_LINK ) { 200aeb8: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200aebc: 80 a0 60 03 cmp %g1, 3 200aec0: 02 80 00 4d be 200aff4 200aec4: 80 a0 60 04 cmp %g1, 4 * It would be a design error if we evaluated the link and * was broken. */ IMFS_assert( node ); } else if ( node->type == IMFS_SYM_LINK ) { 200aec8: 22 80 00 66 be,a 200b060 200aecc: 90 10 00 1b mov %i3, %o0 } /* * Only a directory can be decended into. */ if ( node->type != IMFS_DIRECTORY ) 200aed0: 80 a0 60 01 cmp %g1, 1 200aed4: 12 80 00 87 bne 200b0f0 200aed8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOTDIR ); /* * Find the token name in the current node. */ node = IMFS_find_match_in_dir( node, token ); 200aedc: 40 00 02 35 call 200b7b0 200aee0: 92 07 bf d0 add %fp, -48, %o1 if ( !node ) 200aee4: b8 92 20 00 orcc %o0, 0, %i4 200aee8: 02 80 00 66 be 200b080 200aeec: 01 00 00 00 nop * file system and not the IMFS. For example the IMFS length is * limited. If the token is a parent directory move back up otherwise * set loc to the new fs root node and let them finish evaluating the * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { 200aef0: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200aef4: 80 a0 60 01 cmp %g1, 1 200aef8: 02 80 00 1d be 200af6c 200aefc: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 } /* * Set the node access to the point we have found. */ pathloc->node_access = node; 200af00: f8 26 c0 00 st %i4, [ %i3 ] /* * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { 200af04: 10 bf ff b9 b 200ade8 200af08: d0 07 bf f8 ld [ %fp + -8 ], %o0 case IMFS_UP_DIR: /* * Am I at the root of all filesystems? (chroot'ed?) */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) 200af0c: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 200af10: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 200af14: 80 a0 40 08 cmp %g1, %o0 200af18: 02 80 00 34 be 200afe8 200af1c: b8 10 00 08 mov %o0, %i4 if ( !IMFS_evaluate_permission( pathloc, flags ) ) rtems_set_errno_and_return_minus_one( EACCES ); return result; } 200af20: c6 06 e0 10 ld [ %i3 + 0x10 ], %g3 /* * Am I at the root of this mounted filesystem? */ if ( rtems_filesystem_is_root_location( pathloc ) ) { 200af24: c2 00 e0 1c ld [ %g3 + 0x1c ], %g1 200af28: 80 a2 00 01 cmp %o0, %g1 200af2c: 22 80 00 38 be,a 200b00c 200af30: c2 00 e0 08 ld [ %g3 + 8 ], %g1 pathnamelen+len, flags,pathloc); } } else { if ( !node->Parent ) 200af34: f8 02 20 08 ld [ %o0 + 8 ], %i4 200af38: 80 a7 20 00 cmp %i4, 0 200af3c: 02 80 00 73 be 200b108 200af40: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOENT ); node = node->Parent; pathloc->node_access = node; 200af44: f8 26 c0 00 st %i4, [ %i3 ] 200af48: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 /* * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { 200af4c: 10 bf ff a7 b 200ade8 200af50: d0 07 bf f8 ld [ %fp + -8 ], %o0 case IMFS_NO_MORE_PATH: case IMFS_CURRENT_DIR: break; case IMFS_INVALID_TOKEN: rtems_set_errno_and_return_minus_one( ENAMETOOLONG ); 200af54: 40 00 0e f0 call 200eb14 <__errno> 200af58: b0 10 3f ff mov -1, %i0 200af5c: 82 10 20 5b mov 0x5b, %g1 200af60: c2 22 00 00 st %g1, [ %o0 ] 200af64: 81 c7 e0 08 ret 200af68: 81 e8 00 00 restore * file system and not the IMFS. For example the IMFS length is * limited. If the token is a parent directory move back up otherwise * set loc to the new fs root node and let them finish evaluating the * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { 200af6c: c2 07 20 5c ld [ %i4 + 0x5c ], %g1 200af70: 80 a0 60 00 cmp %g1, 0 200af74: 22 bf ff e4 be,a 200af04 200af78: f8 26 c0 00 st %i4, [ %i3 ] IMFS_skip_separator( pathname, &pathnamelen, &i); 200af7c: 90 10 00 1d mov %i5, %o0 200af80: 92 07 a0 48 add %fp, 0x48, %o1 200af84: 7f ff ff 30 call 200ac44 200af88: 94 07 bf f8 add %fp, -8, %o2 if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { 200af8c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200af90: c4 4f 40 01 ldsb [ %i5 + %g1 ], %g2 200af94: 80 a0 a0 2e cmp %g2, 0x2e 200af98: 12 80 00 61 bne 200b11c 200af9c: 90 07 40 01 add %i5, %g1, %o0 200afa0: c4 4a 20 01 ldsb [ %o0 + 1 ], %g2 200afa4: 80 a0 a0 2e cmp %g2, 0x2e 200afa8: 12 80 00 5d bne 200b11c 200afac: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 pathnamelen, flags, pathloc ); } i += 2; pathnamelen -= 2; node = node->Parent; 200afb0: f8 07 20 08 ld [ %i4 + 8 ], %i4 *pathloc = node->info.directory.mt_fs->mt_fs_root; return (*pathloc->ops->evalpath_h)( &pathname[i], pathnamelen, flags, pathloc ); } i += 2; 200afb4: 82 00 60 02 add %g1, 2, %g1 pathnamelen -= 2; 200afb8: 92 02 7f fe add %o1, -2, %o1 *pathloc = node->info.directory.mt_fs->mt_fs_root; return (*pathloc->ops->evalpath_h)( &pathname[i], pathnamelen, flags, pathloc ); } i += 2; 200afbc: c2 27 bf f8 st %g1, [ %fp + -8 ] pathnamelen -= 2; 200afc0: d2 27 a0 48 st %o1, [ %fp + 0x48 ] } /* * Set the node access to the point we have found. */ pathloc->node_access = node; 200afc4: 10 bf ff d0 b 200af04 200afc8: f8 26 c0 00 st %i4, [ %i3 ] /* * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) 200afcc: 7f ff ff 57 call 200ad28 200afd0: 92 10 20 01 mov 1, %o1 200afd4: 80 a2 20 00 cmp %o0, 0 200afd8: 02 80 00 63 be 200b164 200afdc: 01 00 00 00 nop 200afe0: 10 bf ff aa b 200ae88 200afe4: d0 06 c0 00 ld [ %i3 ], %o0 200afe8: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 /* * Evaluate all tokens until we are done or an error occurs. */ while( (type != IMFS_NO_MORE_PATH) && (type != IMFS_INVALID_TOKEN) ) { 200afec: 10 bf ff 7f b 200ade8 200aff0: d0 07 bf f8 ld [ %fp + -8 ], %o0 case IMFS_NAME: /* * If we are at a link follow it. */ if ( node->type == IMFS_HARD_LINK ) { IMFS_evaluate_hard_link( pathloc, 0 ); 200aff4: 90 10 00 1b mov %i3, %o0 200aff8: 7f ff ff 5d call 200ad6c 200affc: 92 10 20 00 clr %o1 node = pathloc->node_access; 200b000: d0 06 c0 00 ld [ %i3 ], %o0 200b004: 10 bf ff b3 b 200aed0 200b008: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; /* Throw out the .. in this case */ } else { *pathloc = pathloc->mt_entry->mt_point_node; return (*pathloc->ops->evalpath_h)(&(pathname[i-len]), 200b00c: c4 07 bf fc ld [ %fp + -4 ], %g2 */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; /* Throw out the .. in this case */ } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b010: c2 26 c0 00 st %g1, [ %i3 ] 200b014: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 return (*pathloc->ops->evalpath_h)(&(pathname[i-len]), 200b018: d0 07 bf f8 ld [ %fp + -8 ], %o0 */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; /* Throw out the .. in this case */ } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b01c: c2 26 e0 04 st %g1, [ %i3 + 4 ] 200b020: c2 00 e0 10 ld [ %g3 + 0x10 ], %g1 return (*pathloc->ops->evalpath_h)(&(pathname[i-len]), 200b024: 90 22 00 02 sub %o0, %g2, %o0 */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; /* Throw out the .. in this case */ } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b028: c2 26 e0 08 st %g1, [ %i3 + 8 ] 200b02c: c2 00 e0 14 ld [ %g3 + 0x14 ], %g1 200b030: c2 26 e0 0c st %g1, [ %i3 + 0xc ] return (*pathloc->ops->evalpath_h)(&(pathname[i-len]), 200b034: c2 00 40 00 ld [ %g1 ], %g1 */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; /* Throw out the .. in this case */ } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b038: c6 00 e0 18 ld [ %g3 + 0x18 ], %g3 */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { *pathloc = node->info.directory.mt_fs->mt_fs_root; return (*pathloc->ops->evalpath_h)( &pathname[i-len], 200b03c: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 200b040: 90 07 40 08 add %i5, %o0, %o0 * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b044: c6 26 e0 10 st %g3, [ %i3 + 0x10 ] return (*pathloc->ops->evalpath_h)( &pathname[i-len], 200b048: 92 00 80 09 add %g2, %o1, %o1 200b04c: 94 10 00 1a mov %i2, %o2 200b050: 9f c0 40 00 call %g1 200b054: 96 10 00 1b mov %i3, %o3 200b058: 81 c7 e0 08 ret 200b05c: 91 e8 00 08 restore %g0, %o0, %o0 * was broken. */ IMFS_assert( node ); } else if ( node->type == IMFS_SYM_LINK ) { result = IMFS_evaluate_sym_link( pathloc, 0 ); 200b060: 40 00 00 47 call 200b17c 200b064: 92 10 20 00 clr %o1 200b068: b0 10 00 08 mov %o0, %i0 /* * In contrast to a hard link, it is possible to have a broken * symbolic link. */ node = pathloc->node_access; if ( result == -1 ) 200b06c: 80 a6 3f ff cmp %i0, -1 200b070: 02 bf ff 81 be 200ae74 <== NEVER TAKEN 200b074: d0 06 c0 00 ld [ %i3 ], %o0 200b078: 10 bf ff 96 b 200aed0 200b07c: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 /* * Find the token name in the current node. */ node = IMFS_find_match_in_dir( node, token ); if ( !node ) rtems_set_errno_and_return_minus_one( ENOENT ); 200b080: 40 00 0e a5 call 200eb14 <__errno> 200b084: b0 10 3f ff mov -1, %i0 200b088: 82 10 20 02 mov 2, %g1 200b08c: c2 22 00 00 st %g1, [ %o0 ] 200b090: 81 c7 e0 08 ret 200b094: 81 e8 00 00 restore * * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { 200b098: 80 a0 e0 00 cmp %g3, 0 200b09c: 02 bf ff 69 be 200ae40 <== ALWAYS TAKEN 200b0a0: c4 07 bf fc ld [ %fp + -4 ], %g2 *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b0a4: c2 00 e0 1c ld [ %g3 + 0x1c ], %g1 <== NOT EXECUTED 200b0a8: c2 26 c0 00 st %g1, [ %i3 ] <== NOT EXECUTED 200b0ac: c2 00 e0 20 ld [ %g3 + 0x20 ], %g1 <== NOT EXECUTED return (*pathloc->ops->evalpath_h)( &pathname[i-len], 200b0b0: d0 07 bf f8 ld [ %fp + -8 ], %o0 <== NOT EXECUTED * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b0b4: c2 26 e0 04 st %g1, [ %i3 + 4 ] <== NOT EXECUTED 200b0b8: c2 00 e0 24 ld [ %g3 + 0x24 ], %g1 <== NOT EXECUTED return (*pathloc->ops->evalpath_h)( &pathname[i-len], 200b0bc: 90 22 00 02 sub %o0, %g2, %o0 <== NOT EXECUTED * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b0c0: c2 26 e0 08 st %g1, [ %i3 + 8 ] <== NOT EXECUTED 200b0c4: c2 00 e0 28 ld [ %g3 + 0x28 ], %g1 <== NOT EXECUTED 200b0c8: c2 26 e0 0c st %g1, [ %i3 + 0xc ] <== NOT EXECUTED return (*pathloc->ops->evalpath_h)( &pathname[i-len], 200b0cc: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED * NOTE: The behavior of stat() on a mount point appears to be questionable. */ if ( node->type == IMFS_DIRECTORY ) { if ( node->info.directory.mt_fs != NULL ) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b0d0: 10 bf ff db b 200b03c <== NOT EXECUTED 200b0d4: c6 00 e0 2c ld [ %g3 + 0x2c ], %g3 <== NOT EXECUTED char token[ IMFS_NAME_MAX + 1 ]; IMFS_jnode_t *node; int result; if ( !rtems_libio_is_valid_perms( flags ) ) { rtems_set_errno_and_return_minus_one( EIO ); 200b0d8: 40 00 0e 8f call 200eb14 <__errno> <== NOT EXECUTED 200b0dc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200b0e0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 200b0e4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200b0e8: 81 c7 e0 08 ret <== NOT EXECUTED 200b0ec: 81 e8 00 00 restore <== NOT EXECUTED /* * Only a directory can be decended into. */ if ( node->type != IMFS_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 200b0f0: 40 00 0e 89 call 200eb14 <__errno> 200b0f4: b0 10 3f ff mov -1, %i0 200b0f8: 82 10 20 14 mov 0x14, %g1 200b0fc: c2 22 00 00 st %g1, [ %o0 ] 200b100: 81 c7 e0 08 ret 200b104: 81 e8 00 00 restore flags,pathloc); } } else { if ( !node->Parent ) rtems_set_errno_and_return_minus_one( ENOENT ); 200b108: 40 00 0e 83 call 200eb14 <__errno> 200b10c: b0 10 3f ff mov -1, %i0 200b110: f2 22 00 00 st %i1, [ %o0 ] 200b114: 81 c7 e0 08 ret 200b118: 81 e8 00 00 restore * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( pathname, &pathnamelen, &i); if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b11c: c4 07 20 5c ld [ %i4 + 0x5c ], %g2 return (*pathloc->ops->evalpath_h)( &pathname[i], 200b120: d2 07 a0 48 ld [ %fp + 0x48 ], %o1 * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( pathname, &pathnamelen, &i); if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b124: c2 00 a0 1c ld [ %g2 + 0x1c ], %g1 return (*pathloc->ops->evalpath_h)( &pathname[i], 200b128: 94 10 00 1a mov %i2, %o2 * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( pathname, &pathnamelen, &i); if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b12c: c2 26 c0 00 st %g1, [ %i3 ] 200b130: c2 00 a0 20 ld [ %g2 + 0x20 ], %g1 return (*pathloc->ops->evalpath_h)( &pathname[i], 200b134: 96 10 00 1b mov %i3, %o3 * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( pathname, &pathnamelen, &i); if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b138: c2 26 e0 04 st %g1, [ %i3 + 4 ] 200b13c: c2 00 a0 24 ld [ %g2 + 0x24 ], %g1 200b140: c2 26 e0 08 st %g1, [ %i3 + 8 ] 200b144: c2 00 a0 28 ld [ %g2 + 0x28 ], %g1 200b148: c2 26 e0 0c st %g1, [ %i3 + 0xc ] return (*pathloc->ops->evalpath_h)( &pathname[i], 200b14c: c2 00 40 00 ld [ %g1 ], %g1 * path. */ if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( pathname, &pathnamelen, &i); if ((pathname[i] != '.') || (pathname[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b150: c4 00 a0 2c ld [ %g2 + 0x2c ], %g2 return (*pathloc->ops->evalpath_h)( &pathname[i], 200b154: 9f c0 40 00 call %g1 200b158: c4 26 e0 10 st %g2, [ %i3 + 0x10 ] 200b15c: 81 c7 e0 08 ret 200b160: 91 e8 00 08 restore %g0, %o0, %o0 * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) rtems_set_errno_and_return_minus_one( EACCES ); 200b164: 40 00 0e 6c call 200eb14 <__errno> 200b168: b0 10 3f ff mov -1, %i0 200b16c: 82 10 20 0d mov 0xd, %g1 200b170: c2 22 00 00 st %g1, [ %o0 ] 200b174: 81 c7 e0 08 ret 200b178: 81 e8 00 00 restore =============================================================================== 0200b2e8 : int IMFS_evaluate_for_make( const char *path, /* IN */ rtems_filesystem_location_info_t *pathloc, /* IN/OUT */ const char **name /* OUT */ ) { 200b2e8: 9d e3 bf 70 save %sp, -144, %sp /* * This was filled in by the caller and is valid in the * mount table. */ node = pathloc->node_access; 200b2ec: fa 06 40 00 ld [ %i1 ], %i5 const char *path, /* IN */ rtems_filesystem_location_info_t *pathloc, /* IN/OUT */ const char **name /* OUT */ ) { int i = 0; 200b2f0: c0 27 bf f4 clr [ %fp + -12 ] node = pathloc->node_access; /* * Get the path length. */ pathlen = strlen( path ); 200b2f4: 40 00 13 a0 call 2010174 200b2f8: 90 10 00 18 mov %i0, %o0 int IMFS_evaluate_for_make( const char *path, /* IN */ rtems_filesystem_location_info_t *pathloc, /* IN/OUT */ const char **name /* OUT */ ) { 200b2fc: b8 10 00 18 mov %i0, %i4 node = pathloc->node_access; /* * Get the path length. */ pathlen = strlen( path ); 200b300: 92 10 00 08 mov %o0, %o1 200b304: 82 10 20 00 clr %g1 200b308: d0 27 bf fc st %o0, [ %fp + -4 ] case IMFS_UP_DIR: /* * Am I at the root of all filesystems? (chroot'ed?) */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) 200b30c: 37 00 80 6e sethi %hi(0x201b800), %i3 * Evaluate all tokens until we are done or an error occurs. */ while( !done ) { type = IMFS_get_token( &path[i], pathlen, token, &len ); 200b310: 90 07 00 01 add %i4, %g1, %o0 200b314: 94 07 bf d0 add %fp, -48, %o2 200b318: 40 00 01 49 call 200b83c 200b31c: 96 07 bf f8 add %fp, -8, %o3 pathlen -= len; 200b320: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b324: c4 07 bf fc ld [ %fp + -4 ], %g2 i += len; 200b328: c6 07 bf f4 ld [ %fp + -12 ], %g3 * Evaluate all tokens until we are done or an error occurs. */ while( !done ) { type = IMFS_get_token( &path[i], pathlen, token, &len ); 200b32c: a0 10 00 08 mov %o0, %l0 pathlen -= len; i += len; if ( !pathloc->node_access ) 200b330: d0 06 40 00 ld [ %i1 ], %o0 */ while( !done ) { type = IMFS_get_token( &path[i], pathlen, token, &len ); pathlen -= len; 200b334: 84 20 80 01 sub %g2, %g1, %g2 i += len; 200b338: 82 00 c0 01 add %g3, %g1, %g1 */ while( !done ) { type = IMFS_get_token( &path[i], pathlen, token, &len ); pathlen -= len; 200b33c: c4 27 bf fc st %g2, [ %fp + -4 ] i += len; if ( !pathloc->node_access ) 200b340: 80 a2 20 00 cmp %o0, 0 200b344: 02 80 00 a1 be 200b5c8 <== NEVER TAKEN 200b348: c2 27 bf f4 st %g1, [ %fp + -12 ] /* * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) 200b34c: 80 a4 20 00 cmp %l0, 0 200b350: 32 80 00 08 bne,a 200b370 200b354: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 pathloc->node_access = node; } break; case IMFS_NO_MORE_PATH: rtems_set_errno_and_return_minus_one( EEXIST ); 200b358: 40 00 0d ef call 200eb14 <__errno> 200b35c: b0 10 3f ff mov -1, %i0 200b360: 82 10 20 11 mov 0x11, %g1 200b364: c2 22 00 00 st %g1, [ %o0 ] 200b368: 81 c7 e0 08 ret 200b36c: 81 e8 00 00 restore /* * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) 200b370: 80 a0 60 01 cmp %g1, 1 200b374: 22 80 00 5e be,a 200b4ec 200b378: 90 10 00 19 mov %i1, %o0 if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) rtems_set_errno_and_return_minus_one( EACCES ); node = pathloc->node_access; switch( type ) { 200b37c: 80 a4 20 02 cmp %l0, 2 200b380: 02 80 00 1a be 200b3e8 200b384: c2 06 e0 8c ld [ %i3 + 0x8c ], %g1 200b388: 08 80 00 0a bleu 200b3b0 200b38c: 80 a4 20 00 cmp %l0, 0 200b390: 80 a4 20 03 cmp %l0, 3 200b394: 02 80 00 26 be 200b42c 200b398: 80 a4 20 04 cmp %l0, 4 200b39c: 02 80 00 0d be 200b3d0 <== ALWAYS TAKEN 200b3a0: c2 07 bf f4 ld [ %fp + -12 ], %g1 200b3a4: d2 07 bf fc ld [ %fp + -4 ], %o1 200b3a8: 10 bf ff da b 200b310 200b3ac: ba 10 00 08 mov %o0, %i5 200b3b0: 12 bf ff fd bne 200b3a4 <== ALWAYS TAKEN 200b3b4: c2 07 bf f4 ld [ %fp + -12 ], %g1 pathloc->node_access = node; } break; case IMFS_NO_MORE_PATH: rtems_set_errno_and_return_minus_one( EEXIST ); 200b3b8: 40 00 0d d7 call 200eb14 <__errno> <== NOT EXECUTED 200b3bc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200b3c0: 82 10 20 11 mov 0x11, %g1 <== NOT EXECUTED 200b3c4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200b3c8: 81 c7 e0 08 ret <== NOT EXECUTED 200b3cc: 81 e8 00 00 restore <== NOT EXECUTED break; case IMFS_INVALID_TOKEN: rtems_set_errno_and_return_minus_one( ENAMETOOLONG ); 200b3d0: 40 00 0d d1 call 200eb14 <__errno> 200b3d4: b0 10 3f ff mov -1, %i0 200b3d8: 82 10 20 5b mov 0x5b, %g1 200b3dc: c2 22 00 00 st %g1, [ %o0 ] 200b3e0: 81 c7 e0 08 ret 200b3e4: 81 e8 00 00 restore case IMFS_UP_DIR: /* * Am I at the root of all filesystems? (chroot'ed?) */ if ( pathloc->node_access == rtems_filesystem_root.node_access ) 200b3e8: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 200b3ec: 80 a7 40 08 cmp %i5, %o0 200b3f0: 02 80 00 7c be 200b5e0 200b3f4: c2 07 bf f4 ld [ %fp + -12 ], %g1 if ( !IMFS_evaluate_permission( pathloc, flags ) ) rtems_set_errno_and_return_minus_one( EACCES ); return result; } 200b3f8: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 /* * Am I at the root of this mounted filesystem? */ if ( rtems_filesystem_is_root_location( pathloc ) ) { 200b3fc: c2 00 a0 1c ld [ %g2 + 0x1c ], %g1 200b400: 80 a2 00 01 cmp %o0, %g1 200b404: 22 80 00 79 be,a 200b5e8 200b408: c2 00 a0 08 ld [ %g2 + 8 ], %g1 *pathloc = pathloc->mt_entry->mt_point_node; return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); } } else { if ( !node->Parent ) 200b40c: fa 02 20 08 ld [ %o0 + 8 ], %i5 200b410: 80 a7 60 00 cmp %i5, 0 200b414: 02 80 00 8e be 200b64c 200b418: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOENT ); node = node->Parent; } pathloc->node_access = node; 200b41c: fa 26 40 00 st %i5, [ %i1 ] 200b420: c2 07 bf f4 ld [ %fp + -12 ], %g1 break; 200b424: 10 bf ff bb b 200b310 200b428: d2 07 bf fc ld [ %fp + -4 ], %o1 case IMFS_NAME: if ( node->type == IMFS_HARD_LINK ) { 200b42c: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200b430: 80 a0 60 03 cmp %g1, 3 200b434: 02 80 00 35 be 200b508 200b438: 80 a0 60 04 cmp %g1, 4 result = IMFS_evaluate_link( pathloc, 0 ); if ( result == -1 ) return -1; } else if ( node->type == IMFS_SYM_LINK ) { 200b43c: 22 80 00 34 be,a 200b50c 200b440: 90 10 00 19 mov %i1, %o0 if ( result == -1 ) return -1; } node = pathloc->node_access; if ( !node ) 200b444: 80 a2 20 00 cmp %o0, 0 200b448: 02 80 00 7b be 200b634 <== NEVER TAKEN 200b44c: 01 00 00 00 nop /* * Only a directory can be decended into. */ if ( node->type != IMFS_DIRECTORY ) 200b450: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200b454: 80 a0 60 01 cmp %g1, 1 200b458: 12 80 00 77 bne 200b634 200b45c: 01 00 00 00 nop /* * Find the token name in the present location. */ node = IMFS_find_match_in_dir( node, token ); 200b460: 40 00 00 d4 call 200b7b0 200b464: 92 07 bf d0 add %fp, -48, %o1 /* * If there is no node we have found the name of the node we * wish to create. */ if ( ! node ) 200b468: ba 92 20 00 orcc %o0, 0, %i5 200b46c: 02 80 00 42 be 200b574 200b470: c2 07 bf f4 ld [ %fp + -12 ], %g1 done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { 200b474: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200b478: 80 a0 60 01 cmp %g1, 1 200b47c: 22 80 00 06 be,a 200b494 200b480: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 200b484: c2 07 bf f4 ld [ %fp + -12 ], %g1 200b488: d2 07 bf fc ld [ %fp + -4 ], %o1 } i += 2; pathlen -= 2; node = node->Parent; } pathloc->node_access = node; 200b48c: 10 bf ff a1 b 200b310 200b490: fa 26 40 00 st %i5, [ %i1 ] */ if ( ! node ) done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { 200b494: 80 a0 60 00 cmp %g1, 0 200b498: 02 bf ff fb be 200b484 200b49c: 90 10 00 1c mov %i4, %o0 IMFS_skip_separator( path, &pathlen, &i); 200b4a0: 92 07 bf fc add %fp, -4, %o1 200b4a4: 7f ff fd e8 call 200ac44 200b4a8: 94 07 bf f4 add %fp, -12, %o2 if ((path[i] != '.') || (path[i + 1] != '.')) { 200b4ac: c2 07 bf f4 ld [ %fp + -12 ], %g1 200b4b0: c4 4f 00 01 ldsb [ %i4 + %g1 ], %g2 200b4b4: 80 a0 a0 2e cmp %g2, 0x2e 200b4b8: 12 80 00 70 bne 200b678 200b4bc: 90 07 00 01 add %i4, %g1, %o0 200b4c0: c4 4a 20 01 ldsb [ %o0 + 1 ], %g2 200b4c4: 80 a0 a0 2e cmp %g2, 0x2e 200b4c8: 12 80 00 6c bne 200b678 <== NEVER TAKEN 200b4cc: d2 07 bf fc ld [ %fp + -4 ], %o1 pathloc, name ); } i += 2; pathlen -= 2; node = node->Parent; 200b4d0: fa 07 60 08 ld [ %i5 + 8 ], %i5 *pathloc = node->info.directory.mt_fs->mt_fs_root; return (*pathloc->ops->evalformake_h)( &path[i], pathloc, name ); } i += 2; 200b4d4: 82 00 60 02 add %g1, 2, %g1 pathlen -= 2; 200b4d8: 92 02 7f fe add %o1, -2, %o1 *pathloc = node->info.directory.mt_fs->mt_fs_root; return (*pathloc->ops->evalformake_h)( &path[i], pathloc, name ); } i += 2; 200b4dc: c2 27 bf f4 st %g1, [ %fp + -12 ] pathlen -= 2; 200b4e0: d2 27 bf fc st %o1, [ %fp + -4 ] node = node->Parent; } pathloc->node_access = node; 200b4e4: 10 bf ff 8b b 200b310 200b4e8: fa 26 40 00 st %i5, [ %i1 ] * I cannot move out of this directory without execute permission. */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) 200b4ec: 7f ff fe 0f call 200ad28 200b4f0: 92 10 20 01 mov 1, %o1 200b4f4: 80 a2 20 00 cmp %o0, 0 200b4f8: 02 80 00 5a be 200b660 200b4fc: 01 00 00 00 nop 200b500: 10 bf ff 9f b 200b37c 200b504: d0 06 40 00 ld [ %i1 ], %o0 if ( result == -1 ) return -1; } else if ( node->type == IMFS_SYM_LINK ) { result = IMFS_evaluate_link( pathloc, 0 ); 200b508: 90 10 00 19 mov %i1, %o0 200b50c: 7f ff ff 40 call 200b20c 200b510: 92 10 20 00 clr %o1 if ( result == -1 ) 200b514: 80 a2 3f ff cmp %o0, -1 200b518: 02 bf ff 94 be 200b368 <== NEVER TAKEN 200b51c: b0 10 00 08 mov %o0, %i0 200b520: 10 bf ff c9 b 200b444 200b524: d0 06 40 00 ld [ %i1 ], %o0 /* * Verify we can execute and write to this directory. */ result = IMFS_Set_handlers( pathloc ); 200b528: 7f ff fd de call 200aca0 200b52c: 90 10 00 19 mov %i1, %o0 /* * The returned node must be a directory */ node = pathloc->node_access; if ( node->type != IMFS_DIRECTORY ) 200b530: c2 06 40 00 ld [ %i1 ], %g1 200b534: c2 00 60 4c ld [ %g1 + 0x4c ], %g1 200b538: 80 a0 60 01 cmp %g1, 1 200b53c: 12 80 00 3e bne 200b634 <== NEVER TAKEN 200b540: b0 10 00 08 mov %o0, %i0 /* * We must have Write and execute permission on the returned node. */ if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_WX ) ) 200b544: 90 10 00 19 mov %i1, %o0 200b548: 7f ff fd f8 call 200ad28 200b54c: 92 10 20 03 mov 3, %o1 200b550: 80 a2 20 00 cmp %o0, 0 200b554: 12 80 00 47 bne 200b670 200b558: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EACCES ); 200b55c: 40 00 0d 6e call 200eb14 <__errno> 200b560: b0 10 3f ff mov -1, %i0 ! ffffffff 200b564: 82 10 20 0d mov 0xd, %g1 200b568: c2 22 00 00 st %g1, [ %o0 ] return result; } 200b56c: 81 c7 e0 08 ret 200b570: 81 e8 00 00 restore case IMFS_CURRENT_DIR: break; } } *name = &path[ i - len ]; 200b574: c4 07 bf f8 ld [ %fp + -8 ], %g2 200b578: 84 20 40 02 sub %g1, %g2, %g2 200b57c: 84 07 00 02 add %i4, %g2, %g2 200b580: c4 26 80 00 st %g2, [ %i2 ] /* * We have evaluated the path as far as we can. * Verify there is not any invalid stuff at the end of the name. */ for( ; path[i] != '\0'; i++) { 200b584: d0 0f 00 01 ldub [ %i4 + %g1 ], %o0 200b588: 91 2a 20 18 sll %o0, 0x18, %o0 200b58c: 80 a2 20 00 cmp %o0, 0 200b590: 12 80 00 09 bne 200b5b4 200b594: 01 00 00 00 nop 200b598: 30 bf ff e4 b,a 200b528 200b59c: 82 00 60 01 inc %g1 200b5a0: d0 0f 00 01 ldub [ %i4 + %g1 ], %o0 200b5a4: 91 2a 20 18 sll %o0, 0x18, %o0 200b5a8: 80 a2 20 00 cmp %o0, 0 200b5ac: 02 bf ff df be 200b528 200b5b0: c2 27 bf f4 st %g1, [ %fp + -12 ] if ( !IMFS_is_separator( path[ i ] ) ) 200b5b4: 7f ff e2 58 call 2003f14 200b5b8: 91 3a 20 18 sra %o0, 0x18, %o0 200b5bc: 80 a2 20 00 cmp %o0, 0 200b5c0: 12 bf ff f7 bne 200b59c 200b5c4: c2 07 bf f4 ld [ %fp + -12 ], %g1 rtems_set_errno_and_return_minus_one( ENOENT ); 200b5c8: 40 00 0d 53 call 200eb14 <__errno> 200b5cc: b0 10 3f ff mov -1, %i0 200b5d0: 82 10 20 02 mov 2, %g1 200b5d4: c2 22 00 00 st %g1, [ %o0 ] 200b5d8: 81 c7 e0 08 ret 200b5dc: 81 e8 00 00 restore /* * We must have Write and execute permission on the returned node. */ if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_WX ) ) rtems_set_errno_and_return_minus_one( EACCES ); 200b5e0: 10 bf ff 4c b 200b310 200b5e4: d2 07 bf fc ld [ %fp + -4 ], %o1 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b5e8: c6 07 bf f8 ld [ %fp + -8 ], %g3 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b5ec: c2 26 40 00 st %g1, [ %i1 ] 200b5f0: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b5f4: d0 07 bf f4 ld [ %fp + -12 ], %o0 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b5f8: c2 26 60 04 st %g1, [ %i1 + 4 ] 200b5fc: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b600: 90 22 00 03 sub %o0, %g3, %o0 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b604: c2 26 60 08 st %g1, [ %i1 + 8 ] 200b608: c2 00 a0 14 ld [ %g2 + 0x14 ], %g1 return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b60c: 90 07 00 08 add %i4, %o0, %o0 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b610: c2 26 60 0c st %g1, [ %i1 + 0xc ] return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b614: c2 00 60 04 ld [ %g1 + 4 ], %g1 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b618: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b61c: 92 10 00 19 mov %i1, %o1 if ( pathloc->node_access == rtems_filesystem_root.node_access ) { break; } else { *pathloc = pathloc->mt_entry->mt_point_node; 200b620: c4 26 60 10 st %g2, [ %i1 + 0x10 ] return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); 200b624: 9f c0 40 00 call %g1 200b628: 94 10 00 1a mov %i2, %o2 200b62c: 81 c7 e0 08 ret 200b630: 91 e8 00 08 restore %g0, %o0, %o0 /* * The returned node must be a directory */ node = pathloc->node_access; if ( node->type != IMFS_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 200b634: 40 00 0d 38 call 200eb14 <__errno> 200b638: b0 10 3f ff mov -1, %i0 200b63c: 82 10 20 14 mov 0x14, %g1 200b640: c2 22 00 00 st %g1, [ %o0 ] 200b644: 81 c7 e0 08 ret 200b648: 81 e8 00 00 restore return (*pathloc->ops->evalformake_h)( &path[i-len], pathloc, name ); } } else { if ( !node->Parent ) rtems_set_errno_and_return_minus_one( ENOENT ); 200b64c: 40 00 0d 32 call 200eb14 <__errno> 200b650: b0 10 3f ff mov -1, %i0 200b654: e0 22 00 00 st %l0, [ %o0 ] 200b658: 81 c7 e0 08 ret 200b65c: 81 e8 00 00 restore */ if ( type != IMFS_NO_MORE_PATH ) if ( node->type == IMFS_DIRECTORY ) if ( !IMFS_evaluate_permission( pathloc, RTEMS_LIBIO_PERMS_SEARCH ) ) rtems_set_errno_and_return_minus_one( EACCES ); 200b660: 40 00 0d 2d call 200eb14 <__errno> 200b664: b0 10 3f ff mov -1, %i0 200b668: 82 10 20 0d mov 0xd, %g1 200b66c: c2 22 00 00 st %g1, [ %o0 ] 200b670: 81 c7 e0 08 ret 200b674: 81 e8 00 00 restore done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( path, &pathlen, &i); if ((path[i] != '.') || (path[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b678: c4 07 60 5c ld [ %i5 + 0x5c ], %g2 return (*pathloc->ops->evalformake_h)( &path[i], 200b67c: 92 10 00 19 mov %i1, %o1 done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( path, &pathlen, &i); if ((path[i] != '.') || (path[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b680: c2 00 a0 1c ld [ %g2 + 0x1c ], %g1 return (*pathloc->ops->evalformake_h)( &path[i], 200b684: 94 10 00 1a mov %i2, %o2 done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( path, &pathlen, &i); if ((path[i] != '.') || (path[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b688: c2 26 40 00 st %g1, [ %i1 ] 200b68c: c2 00 a0 20 ld [ %g2 + 0x20 ], %g1 200b690: c2 26 60 04 st %g1, [ %i1 + 4 ] 200b694: c2 00 a0 24 ld [ %g2 + 0x24 ], %g1 200b698: c2 26 60 08 st %g1, [ %i1 + 8 ] 200b69c: c2 00 a0 28 ld [ %g2 + 0x28 ], %g1 200b6a0: c2 26 60 0c st %g1, [ %i1 + 0xc ] return (*pathloc->ops->evalformake_h)( &path[i], 200b6a4: c2 00 60 04 ld [ %g1 + 4 ], %g1 done = true; else { if (( node->type == IMFS_DIRECTORY ) && ( node->info.directory.mt_fs != NULL )) { IMFS_skip_separator( path, &pathlen, &i); if ((path[i] != '.') || (path[i + 1] != '.')) { *pathloc = node->info.directory.mt_fs->mt_fs_root; 200b6a8: c4 00 a0 2c ld [ %g2 + 0x2c ], %g2 return (*pathloc->ops->evalformake_h)( &path[i], 200b6ac: 9f c0 40 00 call %g1 200b6b0: c4 26 60 10 st %g2, [ %i1 + 0x10 ] 200b6b4: 81 c7 e0 08 ret 200b6b8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b20c : */ int IMFS_evaluate_link( rtems_filesystem_location_info_t *node, /* IN/OUT */ int flags /* IN */ ) { 200b20c: 9d e3 bf a0 save %sp, -96, %sp */ rtems_filesystem_link_counts ++; if ( rtems_filesystem_link_counts > MAXSYMLINK ) { rtems_filesystem_link_counts = 0; rtems_set_errno_and_return_minus_one( ELOOP ); 200b210: 3b 00 80 6e sethi %hi(0x201b800), %i5 */ int IMFS_evaluate_link( rtems_filesystem_location_info_t *node, /* IN/OUT */ int flags /* IN */ ) { 200b214: b8 10 00 18 mov %i0, %i4 */ rtems_filesystem_link_counts ++; if ( rtems_filesystem_link_counts > MAXSYMLINK ) { rtems_filesystem_link_counts = 0; rtems_set_errno_and_return_minus_one( ELOOP ); 200b218: 10 80 00 07 b 200b234 200b21c: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 */ if ( jnode->type == IMFS_HARD_LINK ) result = IMFS_evaluate_hard_link( node, flags ); else if (jnode->type == IMFS_SYM_LINK ) 200b220: 02 80 00 21 be 200b2a4 200b224: 84 00 bf fd add %g2, -3, %g2 result = IMFS_evaluate_sym_link( node, flags ); } while ( ( result == 0 ) && ( ( jnode->type == IMFS_SYM_LINK ) || 200b228: 80 a0 a0 01 cmp %g2, 1 200b22c: 38 80 00 1c bgu,a 200b29c <== ALWAYS TAKEN 200b230: c0 30 60 30 clrh [ %g1 + 0x30 ] /* * Increment and check the link counter. */ rtems_filesystem_link_counts ++; 200b234: c4 10 60 30 lduh [ %g1 + 0x30 ], %g2 { IMFS_jnode_t *jnode; int result = 0; do { jnode = node->node_access; 200b238: f6 07 00 00 ld [ %i4 ], %i3 /* * Increment and check the link counter. */ rtems_filesystem_link_counts ++; 200b23c: 84 00 a0 01 inc %g2 200b240: c4 30 60 30 sth %g2, [ %g1 + 0x30 ] if ( rtems_filesystem_link_counts > MAXSYMLINK ) { 200b244: 85 28 a0 10 sll %g2, 0x10, %g2 200b248: 85 30 a0 10 srl %g2, 0x10, %g2 200b24c: 80 a0 a0 05 cmp %g2, 5 200b250: 18 80 00 20 bgu 200b2d0 200b254: 01 00 00 00 nop /* * Follow the Link node. */ if ( jnode->type == IMFS_HARD_LINK ) 200b258: c4 06 e0 4c ld [ %i3 + 0x4c ], %g2 200b25c: 80 a0 a0 03 cmp %g2, 3 200b260: 12 bf ff f0 bne 200b220 200b264: 80 a0 a0 04 cmp %g2, 4 result = IMFS_evaluate_hard_link( node, flags ); 200b268: 90 10 00 1c mov %i4, %o0 200b26c: 7f ff fe c0 call 200ad6c 200b270: 92 10 00 19 mov %i1, %o1 200b274: b0 10 00 08 mov %o0, %i0 else if (jnode->type == IMFS_SYM_LINK ) result = IMFS_evaluate_sym_link( node, flags ); } while ( ( result == 0 ) && ( ( jnode->type == IMFS_SYM_LINK ) || ( jnode->type == IMFS_HARD_LINK ) ) ); 200b278: 80 a6 20 00 cmp %i0, 0 200b27c: 12 80 00 12 bne 200b2c4 200b280: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 200b284: c4 06 e0 4c ld [ %i3 + 0x4c ], %g2 result = IMFS_evaluate_hard_link( node, flags ); else if (jnode->type == IMFS_SYM_LINK ) result = IMFS_evaluate_sym_link( node, flags ); } while ( ( result == 0 ) && ( ( jnode->type == IMFS_SYM_LINK ) || 200b288: 84 00 bf fd add %g2, -3, %g2 200b28c: 80 a0 a0 01 cmp %g2, 1 200b290: 08 bf ff e9 bleu 200b234 <== ALWAYS TAKEN 200b294: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 /* * Clear link counter. */ rtems_filesystem_link_counts = 0; 200b298: c0 30 60 30 clrh [ %g1 + 0x30 ] <== NOT EXECUTED return result; } 200b29c: 81 c7 e0 08 ret 200b2a0: 91 e8 20 00 restore %g0, 0, %o0 if ( jnode->type == IMFS_HARD_LINK ) result = IMFS_evaluate_hard_link( node, flags ); else if (jnode->type == IMFS_SYM_LINK ) result = IMFS_evaluate_sym_link( node, flags ); 200b2a4: 90 10 00 1c mov %i4, %o0 200b2a8: 7f ff ff b5 call 200b17c 200b2ac: 92 10 00 19 mov %i1, %o1 200b2b0: b0 10 00 08 mov %o0, %i0 } while ( ( result == 0 ) && ( ( jnode->type == IMFS_SYM_LINK ) || ( jnode->type == IMFS_HARD_LINK ) ) ); 200b2b4: 80 a6 20 00 cmp %i0, 0 200b2b8: 22 bf ff f4 be,a 200b288 200b2bc: c4 06 e0 4c ld [ %i3 + 0x4c ], %g2 200b2c0: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 /* * Clear link counter. */ rtems_filesystem_link_counts = 0; 200b2c4: c0 30 60 30 clrh [ %g1 + 0x30 ] return result; } 200b2c8: 81 c7 e0 08 ret 200b2cc: 81 e8 00 00 restore */ rtems_filesystem_link_counts ++; if ( rtems_filesystem_link_counts > MAXSYMLINK ) { rtems_filesystem_link_counts = 0; rtems_set_errno_and_return_minus_one( ELOOP ); 200b2d0: 40 00 0e 11 call 200eb14 <__errno> 200b2d4: c0 30 60 30 clrh [ %g1 + 0x30 ] 200b2d8: 82 10 20 5c mov 0x5c, %g1 200b2dc: c2 22 00 00 st %g1, [ %o0 ] 200b2e0: 81 c7 e0 08 ret 200b2e4: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200ad28 : */ int IMFS_evaluate_permission( rtems_filesystem_location_info_t *node, int flags ) { 200ad28: 9d e3 bf a0 save %sp, -96, %sp uid_t st_uid; gid_t st_gid; IMFS_jnode_t *jnode; int flags_to_test; if ( !rtems_libio_is_valid_perms( flags ) ) 200ad2c: 80 8e 7f f8 btst -8, %i1 200ad30: 12 80 00 09 bne 200ad54 <== NEVER TAKEN 200ad34: b3 2e 60 06 sll %i1, 6, %i1 /* * If all of the flags are set we have permission * to do this. */ if ( ( flags_to_test & jnode->st_mode) == flags_to_test ) 200ad38: c2 06 00 00 ld [ %i0 ], %g1 200ad3c: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 return 1; 200ad40: b2 2e 40 01 andn %i1, %g1, %i1 200ad44: 80 a0 00 19 cmp %g0, %i1 200ad48: b0 60 3f ff subx %g0, -1, %i0 return 0; } 200ad4c: 81 c7 e0 08 ret 200ad50: 81 e8 00 00 restore gid_t st_gid; IMFS_jnode_t *jnode; int flags_to_test; if ( !rtems_libio_is_valid_perms( flags ) ) rtems_set_errno_and_return_minus_one( EPERM ); 200ad54: 40 00 0f 70 call 200eb14 <__errno> <== NOT EXECUTED 200ad58: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200ad5c: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 200ad60: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200ad64: 81 c7 e0 08 ret <== NOT EXECUTED 200ad68: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003708 : rtems_off64_t IMFS_fifo_lseek( rtems_libio_t *iop, rtems_off64_t offset, int whence ) { 2003708: 9d e3 bf a0 save %sp, -96, %sp off_t err = pipe_lseek(LIBIO2PIPE(iop), offset, whence, iop); 200370c: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 2003710: 92 10 00 19 mov %i1, %o1 2003714: d0 00 60 50 ld [ %g1 + 0x50 ], %o0 2003718: 98 10 00 18 mov %i0, %o4 200371c: 94 10 00 1a mov %i2, %o2 2003720: 40 00 2a 2a call 200dfc8 2003724: 96 10 00 1b mov %i3, %o3 2003728: b1 3a 20 1f sra %o0, 0x1f, %i0 IMFS_FIFO_RETURN(err); 200372c: 80 a6 20 00 cmp %i0, 0 2003730: 06 80 00 04 bl 2003740 <== ALWAYS TAKEN 2003734: b2 10 00 08 mov %o0, %i1 } 2003738: 81 c7 e0 08 ret <== NOT EXECUTED 200373c: 81 e8 00 00 restore <== NOT EXECUTED rtems_off64_t offset, int whence ) { off_t err = pipe_lseek(LIBIO2PIPE(iop), offset, whence, iop); IMFS_FIFO_RETURN(err); 2003740: 40 00 32 db call 20102ac <__errno> 2003744: 31 3f ff ff sethi %hi(0xfffffc00), %i0 2003748: 82 20 00 19 neg %i1, %g1 200374c: c2 22 00 00 st %g1, [ %o0 ] 2003750: b0 16 23 ff or %i0, 0x3ff, %i0 } 2003754: 81 c7 e0 08 ret 2003758: 93 e8 00 18 restore %g0, %i0, %o1 =============================================================================== 0200375c : ssize_t IMFS_fifo_write( rtems_libio_t *iop, const void *buffer, size_t count ) { 200375c: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *jnode = iop->pathinfo.node_access; 2003760: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 ssize_t IMFS_fifo_write( rtems_libio_t *iop, const void *buffer, size_t count ) { 2003764: 96 10 00 18 mov %i0, %o3 IMFS_jnode_t *jnode = iop->pathinfo.node_access; int err = pipe_write(JNODE2PIPE(jnode), buffer, count, iop); 2003768: d0 07 60 50 ld [ %i5 + 0x50 ], %o0 200376c: 92 10 00 19 mov %i1, %o1 2003770: 40 00 29 81 call 200dd74 2003774: 94 10 00 1a mov %i2, %o2 if (err > 0) { 2003778: b0 92 20 00 orcc %o0, 0, %i0 200377c: 04 80 00 09 ble 20037a0 2003780: 90 07 bf f8 add %fp, -8, %o0 IMFS_mtime_ctime_update(jnode); 2003784: 40 00 04 6f call 2004940 2003788: 92 10 20 00 clr %o1 200378c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2003790: c2 27 60 44 st %g1, [ %i5 + 0x44 ] 2003794: c2 27 60 48 st %g1, [ %i5 + 0x48 ] 2003798: 81 c7 e0 08 ret 200379c: 81 e8 00 00 restore } IMFS_FIFO_RETURN(err); 20037a0: 80 a6 20 00 cmp %i0, 0 20037a4: 12 80 00 04 bne 20037b4 <== ALWAYS TAKEN 20037a8: 01 00 00 00 nop } 20037ac: 81 c7 e0 08 ret <== NOT EXECUTED 20037b0: 81 e8 00 00 restore <== NOT EXECUTED int err = pipe_write(JNODE2PIPE(jnode), buffer, count, iop); if (err > 0) { IMFS_mtime_ctime_update(jnode); } IMFS_FIFO_RETURN(err); 20037b4: 40 00 32 be call 20102ac <__errno> 20037b8: 01 00 00 00 nop 20037bc: 82 20 00 18 neg %i0, %g1 20037c0: c2 22 00 00 st %g1, [ %o0 ] } 20037c4: 81 c7 e0 08 ret 20037c8: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200b7b0 : IMFS_jnode_t *IMFS_find_match_in_dir( IMFS_jnode_t *directory, char *name ) { 200b7b0: 9d e3 bf a0 save %sp, -96, %sp /* * Check for "." and ".." */ if ( !strcmp( name, dotname ) ) 200b7b4: 13 00 80 69 sethi %hi(0x201a400), %o1 200b7b8: 90 10 00 19 mov %i1, %o0 200b7bc: 40 00 10 7d call 200f9b0 200b7c0: 92 12 62 a0 or %o1, 0x2a0, %o1 200b7c4: 80 a2 20 00 cmp %o0, 0 200b7c8: 02 80 00 19 be 200b82c <== NEVER TAKEN 200b7cc: 90 10 00 19 mov %i1, %o0 return directory; if ( !strcmp( name, dotdotname ) ) 200b7d0: 13 00 80 69 sethi %hi(0x201a400), %o1 200b7d4: 40 00 10 77 call 200f9b0 200b7d8: 92 12 62 a8 or %o1, 0x2a8, %o1 ! 201a6a8 200b7dc: 80 a2 20 00 cmp %o0, 0 200b7e0: 02 80 00 12 be 200b828 <== NEVER TAKEN 200b7e4: b8 06 20 54 add %i0, 0x54, %i4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200b7e8: fa 06 20 50 ld [ %i0 + 0x50 ], %i5 return directory->Parent; the_chain = &directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); 200b7ec: 80 a7 40 1c cmp %i5, %i4 200b7f0: 12 80 00 06 bne 200b808 200b7f4: b0 10 20 00 clr %i0 200b7f8: 30 80 00 0d b,a 200b82c 200b7fc: 80 a7 40 1c cmp %i5, %i4 200b800: 02 80 00 0d be 200b834 200b804: 01 00 00 00 nop !rtems_chain_is_tail( the_chain, the_node ); the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; if ( !strcmp( name, the_jnode->name ) ) 200b808: 92 07 60 0c add %i5, 0xc, %o1 200b80c: 40 00 10 69 call 200f9b0 200b810: 90 10 00 19 mov %i1, %o0 200b814: 80 a2 20 00 cmp %o0, 0 200b818: 32 bf ff f9 bne,a 200b7fc 200b81c: fa 07 40 00 ld [ %i5 ], %i5 return the_jnode; } return 0; } 200b820: 81 c7 e0 08 ret 200b824: 91 e8 00 1d restore %g0, %i5, %o0 if ( !strcmp( name, dotname ) ) return directory; if ( !strcmp( name, dotdotname ) ) return directory->Parent; 200b828: f0 06 20 08 ld [ %i0 + 8 ], %i0 <== NOT EXECUTED 200b82c: 81 c7 e0 08 ret 200b830: 81 e8 00 00 restore if ( !strcmp( name, the_jnode->name ) ) return the_jnode; } return 0; 200b834: 81 c7 e0 08 ret 200b838: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200b6bc : ((IMFS_jnode_t *)( rtems_chain_head( jnode_get_control( jnode ) )->next)) int IMFS_fsunmount( rtems_filesystem_mount_table_entry_t *temp_mt_entry ) { 200b6bc: 9d e3 bf 88 save %sp, -120, %sp /* * Traverse tree that starts at the mt_fs_root and deallocate memory * associated memory space */ jnode = (IMFS_jnode_t *)temp_mt_entry->mt_fs_root.node_access; 200b6c0: f8 06 20 1c ld [ %i0 + 0x1c ], %i4 loc = temp_mt_entry->mt_fs_root; 200b6c4: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 200b6c8: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200b6cc: c4 06 20 28 ld [ %i0 + 0x28 ], %g2 200b6d0: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 200b6d4: f8 27 bf ec st %i4, [ %fp + -20 ] 200b6d8: c8 27 bf f0 st %g4, [ %fp + -16 ] 200b6dc: c6 27 bf f4 st %g3, [ %fp + -12 ] 200b6e0: c4 27 bf f8 st %g2, [ %fp + -8 ] 200b6e4: c2 27 bf fc st %g1, [ %fp + -4 ] /* * Set this to null to indicate that it is being unmounted. */ temp_mt_entry->mt_fs_root.node_access = NULL; 200b6e8: c0 26 20 1c clr [ %i0 + 0x1c ] do { next = jnode->Parent; 200b6ec: fa 07 20 08 ld [ %i4 + 8 ], %i5 loc.node_access = (void *)jnode; 200b6f0: f8 27 bf ec st %i4, [ %fp + -20 ] IMFS_Set_handlers( &loc ); 200b6f4: 7f ff fd 6b call 200aca0 200b6f8: 90 07 bf ec add %fp, -20, %o0 if ( jnode->type != IMFS_DIRECTORY ) { 200b6fc: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200b700: 80 a0 60 01 cmp %g1, 1 200b704: 32 80 00 1d bne,a 200b778 <== NEVER TAKEN 200b708: 90 10 20 00 clr %o0 <== NOT EXECUTED result = IMFS_unlink( NULL, &loc ); if (result != 0) return -1; jnode = next; } else if ( jnode_has_no_children( jnode ) ) { 200b70c: c4 07 20 50 ld [ %i4 + 0x50 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b710: 82 07 20 54 add %i4, 0x54, %g1 200b714: 80 a0 80 01 cmp %g2, %g1 200b718: 02 80 00 17 be 200b774 200b71c: 80 a7 20 00 cmp %i4, 0 result = IMFS_unlink( NULL, &loc ); if (result != 0) return -1; jnode = next; } if ( jnode != NULL ) { 200b720: 02 80 00 1e be 200b798 <== NEVER TAKEN 200b724: 01 00 00 00 nop if ( jnode->type == IMFS_DIRECTORY ) { 200b728: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200b72c: 80 a0 60 01 cmp %g1, 1 200b730: 32 bf ff f0 bne,a 200b6f0 <== NEVER TAKEN 200b734: fa 07 20 08 ld [ %i4 + 8 ], %i5 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b738: c2 07 20 50 ld [ %i4 + 0x50 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b73c: 84 07 20 54 add %i4, 0x54, %g2 if ( jnode_has_children( jnode ) ) 200b740: 80 a0 40 02 cmp %g1, %g2 200b744: 02 bf ff ea be 200b6ec 200b748: 80 a0 60 00 cmp %g1, 0 jnode = jnode_get_first_child( jnode ); } } } while (jnode != NULL); 200b74c: 02 80 00 17 be 200b7a8 <== NEVER TAKEN 200b750: b8 10 00 01 mov %g1, %i4 temp_mt_entry->mt_fs_root.node_access = NULL; do { next = jnode->Parent; loc.node_access = (void *)jnode; IMFS_Set_handlers( &loc ); 200b754: 90 07 bf ec add %fp, -20, %o0 */ temp_mt_entry->mt_fs_root.node_access = NULL; do { next = jnode->Parent; 200b758: fa 07 20 08 ld [ %i4 + 8 ], %i5 loc.node_access = (void *)jnode; IMFS_Set_handlers( &loc ); 200b75c: 7f ff fd 51 call 200aca0 200b760: f8 27 bf ec st %i4, [ %fp + -20 ] if ( jnode->type != IMFS_DIRECTORY ) { 200b764: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200b768: 80 a0 60 01 cmp %g1, 1 200b76c: 22 bf ff e9 be,a 200b710 200b770: c4 07 20 50 ld [ %i4 + 0x50 ], %g2 result = IMFS_unlink( NULL, &loc ); if (result != 0) return -1; jnode = next; } else if ( jnode_has_no_children( jnode ) ) { result = IMFS_unlink( NULL, &loc ); 200b774: 90 10 20 00 clr %o0 200b778: 7f ff db fe call 2002770 200b77c: 92 07 bf ec add %fp, -20, %o1 if (result != 0) 200b780: 80 a2 20 00 cmp %o0, 0 200b784: 12 80 00 07 bne 200b7a0 <== NEVER TAKEN 200b788: b8 10 00 1d mov %i5, %i4 return -1; jnode = next; } if ( jnode != NULL ) { 200b78c: 80 a7 20 00 cmp %i4, 0 200b790: 32 bf ff e7 bne,a 200b72c 200b794: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 } } } while (jnode != NULL); return 0; } 200b798: 81 c7 e0 08 ret 200b79c: 91 e8 20 00 restore %g0, 0, %o0 return -1; jnode = next; } else if ( jnode_has_no_children( jnode ) ) { result = IMFS_unlink( NULL, &loc ); if (result != 0) return -1; 200b7a0: 81 c7 e0 08 ret <== NOT EXECUTED 200b7a4: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED jnode = jnode_get_first_child( jnode ); } } } while (jnode != NULL); return 0; 200b7a8: 81 c7 e0 08 ret <== NOT EXECUTED 200b7ac: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED =============================================================================== 0200b83c : const char *path, int pathlen, char *token, int *token_len ) { 200b83c: 9d e3 bf a0 save %sp, -96, %sp register int i = 0; 200b840: ba 10 20 00 clr %i5 /* * Copy a name into token. (Remember NULL is a token.) */ c = path[i]; while ( (!IMFS_is_separator(c)) && (i < pathlen) && (i <= IMFS_NAME_MAX) ) { 200b844: 10 80 00 08 b 200b864 200b848: f8 0e 00 00 ldub [ %i0 ], %i4 200b84c: 16 80 00 0c bge 200b87c <== NEVER TAKEN 200b850: 80 a7 60 20 cmp %i5, 0x20 token[i] = c; 200b854: f8 2e 80 1d stb %i4, [ %i2 + %i5 ] if ( i == IMFS_NAME_MAX ) 200b858: 02 80 00 25 be 200b8ec 200b85c: ba 07 60 01 inc %i5 return IMFS_INVALID_TOKEN; if ( !IMFS_is_valid_name_char(c) ) type = IMFS_INVALID_TOKEN; c = path [++i]; 200b860: f8 0e 00 1d ldub [ %i0 + %i5 ], %i4 /* * Copy a name into token. (Remember NULL is a token.) */ c = path[i]; while ( (!IMFS_is_separator(c)) && (i < pathlen) && (i <= IMFS_NAME_MAX) ) { 200b864: a1 2f 20 18 sll %i4, 0x18, %l0 200b868: 7f ff e1 ab call 2003f14 200b86c: 91 3c 20 18 sra %l0, 0x18, %o0 200b870: 80 a2 20 00 cmp %o0, 0 200b874: 02 bf ff f6 be 200b84c 200b878: 80 a7 40 19 cmp %i5, %i1 /* * Copy a seperator into token. */ if ( i == 0 ) { 200b87c: 80 a7 60 00 cmp %i5, 0 200b880: 12 80 00 0c bne 200b8b0 200b884: 82 06 80 1d add %i2, %i5, %g1 token[i] = c; if ( (token[i] != '\0') && pathlen ) { 200b888: 80 a4 20 00 cmp %l0, 0 200b88c: 02 80 00 1a be 200b8f4 200b890: f8 2e 80 00 stb %i4, [ %i2 ] 200b894: 80 a6 60 00 cmp %i1, 0 200b898: 22 80 00 18 be,a 200b8f8 200b89c: fa 26 c0 00 st %i5, [ %i3 ] i++; 200b8a0: ba 10 20 01 mov 1, %i5 /* * Set token_len to the number of characters copied. */ *token_len = i; 200b8a4: fa 26 c0 00 st %i5, [ %i3 ] if ( i == 0 ) { token[i] = c; if ( (token[i] != '\0') && pathlen ) { i++; type = IMFS_CURRENT_DIR; 200b8a8: 81 c7 e0 08 ret 200b8ac: 91 e8 20 01 restore %g0, 1, %o0 } else { type = IMFS_NO_MORE_PATH; } } else if (token[ i-1 ] != '\0') { 200b8b0: c2 48 7f ff ldsb [ %g1 + -1 ], %g1 200b8b4: 80 a0 60 00 cmp %g1, 0 200b8b8: 32 80 00 02 bne,a 200b8c0 <== ALWAYS TAKEN 200b8bc: c0 2e 80 1d clrb [ %i2 + %i5 ] /* * Set token_len to the number of characters copied. */ *token_len = i; 200b8c0: fa 26 c0 00 st %i5, [ %i3 ] * If we copied something that was not a seperator see if * it was a special name. */ if ( type == IMFS_NAME ) { if ( strcmp( token, "..") == 0 ) 200b8c4: 90 10 00 1a mov %i2, %o0 200b8c8: 13 00 80 69 sethi %hi(0x201a400), %o1 type = IMFS_UP_DIR; 200b8cc: b0 10 20 02 mov 2, %i0 * If we copied something that was not a seperator see if * it was a special name. */ if ( type == IMFS_NAME ) { if ( strcmp( token, "..") == 0 ) 200b8d0: 40 00 10 38 call 200f9b0 200b8d4: 92 12 62 b8 or %o1, 0x2b8, %o1 200b8d8: 80 a2 20 00 cmp %o0, 0 200b8dc: 12 80 00 09 bne 200b900 200b8e0: 90 10 00 1a mov %i2, %o0 else if ( strcmp( token, "." ) == 0 ) type = IMFS_CURRENT_DIR; } return type; } 200b8e4: 81 c7 e0 08 ret 200b8e8: 81 e8 00 00 restore 200b8ec: 81 c7 e0 08 ret 200b8f0: 91 e8 20 04 restore %g0, 4, %o0 /* * Set token_len to the number of characters copied. */ *token_len = i; 200b8f4: fa 26 c0 00 st %i5, [ %i3 ] if ( (token[i] != '\0') && pathlen ) { i++; type = IMFS_CURRENT_DIR; } else { type = IMFS_NO_MORE_PATH; 200b8f8: 81 c7 e0 08 ret 200b8fc: 91 e8 20 00 restore %g0, 0, %o0 */ if ( type == IMFS_NAME ) { if ( strcmp( token, "..") == 0 ) type = IMFS_UP_DIR; else if ( strcmp( token, "." ) == 0 ) 200b900: 13 00 80 69 sethi %hi(0x201a400), %o1 200b904: 40 00 10 2b call 200f9b0 200b908: 92 12 62 b0 or %o1, 0x2b0, %o1 ! 201a6b0 200b90c: 80 a0 00 08 cmp %g0, %o0 200b910: b0 40 3f ff addx %g0, -1, %i0 200b914: b0 0e 3f fe and %i0, -2, %i0 200b918: 81 c7 e0 08 ret 200b91c: 91 ee 20 03 restore %i0, 3, %o0 =============================================================================== 0200234c : const rtems_filesystem_operations_table *op_table, const rtems_filesystem_file_handlers_r *memfile_handlers, const rtems_filesystem_file_handlers_r *directory_handlers, const rtems_filesystem_file_handlers_r *fifo_handlers ) { 200234c: 9d e3 bf a0 save %sp, -96, %sp IMFS_jnode_t *jnode; /* * determine/check value for imfs_memfile_bytes_per_block */ IMFS_determine_bytes_per_block(&imfs_memfile_bytes_per_block, 2002350: 03 00 80 6d sethi %hi(0x201b400), %g1 2002354: c2 00 63 a4 ld [ %g1 + 0x3a4 ], %g1 ! 201b7a4 /* * check, whether requested bytes per block is valid */ for (bit_mask = 16; !is_valid && (bit_mask <= 512); bit_mask <<= 1) { if (bit_mask == requested_bytes_per_block) { 2002358: 80 a0 60 10 cmp %g1, 0x10 200235c: 02 80 00 0d be 2002390 2002360: 86 10 20 05 mov 5, %g3 is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 2002364: 80 a0 60 0f cmp %g1, 0xf 2002368: 04 80 00 09 ble 200238c 200236c: 84 10 20 20 mov 0x20, %g2 /* * check, whether requested bytes per block is valid */ for (bit_mask = 16; !is_valid && (bit_mask <= 512); bit_mask <<= 1) { if (bit_mask == requested_bytes_per_block) { 2002370: 80 a0 40 02 cmp %g1, %g2 2002374: 22 80 00 08 be,a 2002394 2002378: 05 00 80 6f sethi %hi(0x201bc00), %g2 is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 200237c: 06 80 00 04 bl 200238c <== NEVER TAKEN 2002380: 86 80 ff ff addcc %g3, -1, %g3 int bit_mask; /* * check, whether requested bytes per block is valid */ for (bit_mask = 16; !is_valid && (bit_mask <= 512); bit_mask <<= 1) { 2002384: 12 bf ff fb bne 2002370 <== ALWAYS TAKEN 2002388: 85 28 a0 01 sll %g2, 1, %g2 if(bit_mask > requested_bytes_per_block) break; } *dest_bytes_per_block = ((is_valid) ? requested_bytes_per_block : default_bytes_per_block); 200238c: 82 10 20 80 mov 0x80, %g1 break; } if(bit_mask > requested_bytes_per_block) break; } *dest_bytes_per_block = ((is_valid) 2002390: 05 00 80 6f sethi %hi(0x201bc00), %g2 /* * Create the root node * * NOTE: UNIX root is 755 and owned by root/root (0/0). */ temp_mt_entry->mt_fs_root.node_access = IMFS_create_root_node(); 2002394: 40 00 22 14 call 200abe4 2002398: c2 20 a3 1c st %g1, [ %g2 + 0x31c ] ! 201bf1c temp_mt_entry->mt_fs_root.handlers = directory_handlers; temp_mt_entry->mt_fs_root.ops = op_table; temp_mt_entry->pathconf_limits_and_options = IMFS_LIMITS_AND_OPTIONS; 200239c: 94 10 20 30 mov 0x30, %o2 /* * Create the root node * * NOTE: UNIX root is 755 and owned by root/root (0/0). */ temp_mt_entry->mt_fs_root.node_access = IMFS_create_root_node(); 20023a0: d0 26 20 1c st %o0, [ %i0 + 0x1c ] 20023a4: ba 10 00 08 mov %o0, %i5 temp_mt_entry->mt_fs_root.handlers = directory_handlers; 20023a8: f6 26 20 24 st %i3, [ %i0 + 0x24 ] temp_mt_entry->mt_fs_root.ops = op_table; 20023ac: f2 26 20 28 st %i1, [ %i0 + 0x28 ] temp_mt_entry->pathconf_limits_and_options = IMFS_LIMITS_AND_OPTIONS; 20023b0: 90 06 20 38 add %i0, 0x38, %o0 20023b4: 13 00 80 69 sethi %hi(0x201a400), %o1 20023b8: 40 00 34 33 call 200f484 20023bc: 92 12 62 6c or %o1, 0x26c, %o1 ! 201a66c /* * Create custom file system data. */ fs_info = calloc( 1, sizeof( IMFS_fs_info_t ) ); 20023c0: 90 10 20 01 mov 1, %o0 20023c4: 40 00 01 ca call 2002aec 20023c8: 92 10 20 14 mov 0x14, %o1 if ( !fs_info ) { 20023cc: 80 a2 20 00 cmp %o0, 0 20023d0: 02 80 00 0f be 200240c 20023d4: 03 00 80 6f sethi %hi(0x201bc00), %g1 /* * Set st_ino for the root to 1. */ fs_info->instance = imfs_instance++; 20023d8: c6 00 63 20 ld [ %g1 + 0x320 ], %g3 ! 201bf20 fs_info = calloc( 1, sizeof( IMFS_fs_info_t ) ); if ( !fs_info ) { free(temp_mt_entry->mt_fs_root.node_access); rtems_set_errno_and_return_minus_one(ENOMEM); } temp_mt_entry->fs_info = fs_info; 20023dc: d0 26 20 34 st %o0, [ %i0 + 0x34 ] /* * Set st_ino for the root to 1. */ fs_info->instance = imfs_instance++; fs_info->ino_count = 1; 20023e0: 84 10 20 01 mov 1, %g2 /* * Set st_ino for the root to 1. */ fs_info->instance = imfs_instance++; 20023e4: c6 22 00 00 st %g3, [ %o0 ] fs_info->ino_count = 1; 20023e8: c4 22 20 04 st %g2, [ %o0 + 4 ] fs_info->memfile_handlers = memfile_handlers; 20023ec: f4 22 20 08 st %i2, [ %o0 + 8 ] fs_info->directory_handlers = directory_handlers; 20023f0: f6 22 20 0c st %i3, [ %o0 + 0xc ] fs_info->fifo_handlers = fifo_handlers; 20023f4: f8 22 20 10 st %i4, [ %o0 + 0x10 ] /* * Set st_ino for the root to 1. */ fs_info->instance = imfs_instance++; 20023f8: 86 00 e0 01 inc %g3 fs_info->memfile_handlers = memfile_handlers; fs_info->directory_handlers = directory_handlers; fs_info->fifo_handlers = fifo_handlers; jnode = temp_mt_entry->mt_fs_root.node_access; jnode->st_ino = fs_info->ino_count; 20023fc: c4 27 60 38 st %g2, [ %i5 + 0x38 ] /* * Set st_ino for the root to 1. */ fs_info->instance = imfs_instance++; 2002400: c6 20 63 20 st %g3, [ %g1 + 0x320 ] jnode = temp_mt_entry->mt_fs_root.node_access; jnode->st_ino = fs_info->ino_count; return 0; } 2002404: 81 c7 e0 08 ret 2002408: 91 e8 20 00 restore %g0, 0, %o0 /* * Create custom file system data. */ fs_info = calloc( 1, sizeof( IMFS_fs_info_t ) ); if ( !fs_info ) { free(temp_mt_entry->mt_fs_root.node_access); 200240c: 40 00 02 c5 call 2002f20 2002410: 90 10 00 1d mov %i5, %o0 rtems_set_errno_and_return_minus_one(ENOMEM); 2002414: 40 00 31 c0 call 200eb14 <__errno> 2002418: b0 10 3f ff mov -1, %i0 200241c: 82 10 20 0c mov 0xc, %g1 2002420: c2 22 00 00 st %g1, [ %o0 ] 2002424: 81 c7 e0 08 ret 2002428: 81 e8 00 00 restore =============================================================================== 0200d998 : */ MEMFILE_STATIC int IMFS_memfile_extend( IMFS_jnode_t *the_jnode, off_t new_length ) { 200d998: 9d e3 bf 98 save %sp, -104, %sp IMFS_assert( the_jnode->type == IMFS_MEMORY_FILE ); /* * Verify new file size is supported */ if ( new_length >= IMFS_MEMFILE_MAXIMUM_SIZE ) 200d99c: 03 00 80 6f sethi %hi(0x201bc00), %g1 200d9a0: fa 00 63 1c ld [ %g1 + 0x31c ], %i5 ! 201bf1c 200d9a4: b9 37 60 02 srl %i5, 2, %i4 200d9a8: 92 10 00 1c mov %i4, %o1 200d9ac: 40 00 27 9a call 2017814 <.umul> 200d9b0: 90 07 20 01 add %i4, 1, %o0 200d9b4: 92 10 00 1c mov %i4, %o1 200d9b8: 40 00 27 97 call 2017814 <.umul> 200d9bc: 90 02 20 01 inc %o0 200d9c0: 92 10 00 1d mov %i5, %o1 200d9c4: 40 00 27 94 call 2017814 <.umul> 200d9c8: 90 02 3f ff add %o0, -1, %o0 200d9cc: 82 10 20 00 clr %g1 200d9d0: 80 a0 40 19 cmp %g1, %i1 200d9d4: 04 80 00 42 ble 200dadc 200d9d8: b8 10 00 18 mov %i0, %i4 rtems_set_errno_and_return_minus_one( EINVAL ); /* * Verify new file size is actually larger than current size */ if ( new_length <= the_jnode->info.file.size ) 200d9dc: f0 07 20 50 ld [ %i4 + 0x50 ], %i0 200d9e0: 80 a6 40 18 cmp %i1, %i0 200d9e4: 04 80 00 2a ble 200da8c <== ALWAYS TAKEN 200d9e8: e0 07 20 54 ld [ %i4 + 0x54 ], %l0 return 0; /* * Calculate the number of range of blocks to allocate */ new_blocks = new_length / IMFS_MEMFILE_BYTES_PER_BLOCK; 200d9ec: a3 3f 60 1f sra %i5, 0x1f, %l1 <== NOT EXECUTED 200d9f0: 96 10 00 1d mov %i5, %o3 200d9f4: 94 10 00 11 mov %l1, %o2 200d9f8: 90 10 00 19 mov %i1, %o0 200d9fc: 40 00 29 18 call 2017e5c <__divdi3> 200da00: 92 10 00 1a mov %i2, %o1 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200da04: 90 10 00 18 mov %i0, %o0 return 0; /* * Calculate the number of range of blocks to allocate */ new_blocks = new_length / IMFS_MEMFILE_BYTES_PER_BLOCK; 200da08: b6 10 00 09 mov %o1, %i3 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200da0c: 94 10 00 11 mov %l1, %o2 200da10: 92 10 00 10 mov %l0, %o1 200da14: 40 00 29 12 call 2017e5c <__divdi3> 200da18: 96 10 00 1d mov %i5, %o3 /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200da1c: 80 a6 c0 09 cmp %i3, %o1 200da20: 0a 80 00 21 bcs 200daa4 <== NEVER TAKEN 200da24: b0 10 00 09 mov %o1, %i0 200da28: 10 80 00 05 b 200da3c 200da2c: ba 10 00 09 mov %o1, %i5 200da30: 80 a6 c0 1d cmp %i3, %i5 200da34: 0a 80 00 1d bcs 200daa8 200da38: 92 10 20 00 clr %o1 if ( IMFS_memfile_addblock( the_jnode, block ) ) { 200da3c: 92 10 00 1d mov %i5, %o1 200da40: 7f ff ff 39 call 200d724 200da44: 90 10 00 1c mov %i4, %o0 200da48: 80 a2 20 00 cmp %o0, 0 200da4c: 22 bf ff f9 be,a 200da30 200da50: ba 07 60 01 inc %i5 for ( ; block>=old_blocks ; block-- ) { 200da54: 10 80 00 06 b 200da6c 200da58: 80 a6 00 1d cmp %i0, %i5 IMFS_memfile_remove_block( the_jnode, block ); 200da5c: 90 10 00 1c mov %i4, %o0 200da60: 7f ff ff c2 call 200d968 200da64: ba 07 7f ff add %i5, -1, %i5 /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { if ( IMFS_memfile_addblock( the_jnode, block ) ) { for ( ; block>=old_blocks ; block-- ) { 200da68: 80 a6 00 1d cmp %i0, %i5 200da6c: 08 bf ff fc bleu 200da5c 200da70: 92 10 00 1d mov %i5, %o1 IMFS_memfile_remove_block( the_jnode, block ); } rtems_set_errno_and_return_minus_one( ENOSPC ); 200da74: 40 00 04 28 call 200eb14 <__errno> 200da78: b0 10 3f ff mov -1, %i0 200da7c: 82 10 20 1c mov 0x1c, %g1 200da80: c2 22 00 00 st %g1, [ %o0 ] 200da84: 81 c7 e0 08 ret 200da88: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( EINVAL ); /* * Verify new file size is actually larger than current size */ if ( new_length <= the_jnode->info.file.size ) 200da8c: 12 80 00 04 bne 200da9c 200da90: 80 a6 80 10 cmp %i2, %l0 200da94: 18 bf ff d7 bgu 200d9f0 200da98: a3 3f 60 1f sra %i5, 0x1f, %l1 the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); IMFS_update_mtime(the_jnode); return 0; } 200da9c: 81 c7 e0 08 ret 200daa0: 91 e8 20 00 restore %g0, 0, %o0 /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); 200daa4: 92 10 20 00 clr %o1 <== NOT EXECUTED } /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; 200daa8: f2 27 20 50 st %i1, [ %i4 + 0x50 ] 200daac: f4 27 20 54 st %i2, [ %i4 + 0x54 ] IMFS_update_ctime(the_jnode); 200dab0: 7f ff d5 46 call 2002fc8 200dab4: 90 07 bf f8 add %fp, -8, %o0 200dab8: c2 07 bf f8 ld [ %fp + -8 ], %g1 IMFS_update_mtime(the_jnode); 200dabc: 90 07 bf f8 add %fp, -8, %o0 /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); 200dac0: c2 27 20 48 st %g1, [ %i4 + 0x48 ] IMFS_update_mtime(the_jnode); 200dac4: 7f ff d5 41 call 2002fc8 200dac8: 92 10 20 00 clr %o1 200dacc: c2 07 bf f8 ld [ %fp + -8 ], %g1 200dad0: c2 27 20 44 st %g1, [ %i4 + 0x44 ] return 0; 200dad4: 81 c7 e0 08 ret 200dad8: 91 e8 20 00 restore %g0, 0, %o0 IMFS_assert( the_jnode->type == IMFS_MEMORY_FILE ); /* * Verify new file size is supported */ if ( new_length >= IMFS_MEMFILE_MAXIMUM_SIZE ) 200dadc: 12 80 00 04 bne 200daec <== NEVER TAKEN 200dae0: 80 a2 00 1a cmp %o0, %i2 200dae4: 38 bf ff bf bgu,a 200d9e0 200dae8: f0 07 20 50 ld [ %i4 + 0x50 ], %i0 rtems_set_errno_and_return_minus_one( EINVAL ); 200daec: 40 00 04 0a call 200eb14 <__errno> 200daf0: b0 10 3f ff mov -1, %i0 200daf4: 82 10 20 16 mov 0x16, %g1 200daf8: c2 22 00 00 st %g1, [ %o0 ] 200dafc: 81 c7 e0 08 ret 200db00: 81 e8 00 00 restore =============================================================================== 0200d248 : #endif IMFS_jnode_t *the_jnode, unsigned int block, int malloc_it ) { 200d248: 9d e3 bf a0 save %sp, -96, %sp my_block = block; /* * Is the block number in the simple indirect portion? */ if ( my_block <= LAST_INDIRECT ) { 200d24c: 03 00 80 6f sethi %hi(0x201bc00), %g1 200d250: fa 00 63 1c ld [ %g1 + 0x31c ], %i5 ! 201bf1c 200d254: bb 37 60 02 srl %i5, 2, %i5 200d258: 82 07 7f ff add %i5, -1, %g1 200d25c: 80 a6 40 01 cmp %i1, %g1 200d260: 18 80 00 0b bgu 200d28c 200d264: b8 10 00 18 mov %i0, %i4 p = info->indirect; if ( malloc_it ) { 200d268: 80 a6 a0 00 cmp %i2, 0 200d26c: 12 80 00 50 bne 200d3ac 200d270: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 info->indirect = p; } return &info->indirect[ my_block ]; } if ( !p ) 200d274: 80 a2 20 00 cmp %o0, 0 200d278: 02 80 00 64 be 200d408 <== NEVER TAKEN 200d27c: b0 10 20 00 clr %i0 return 0; return &info->indirect[ my_block ]; 200d280: b3 2e 60 02 sll %i1, 2, %i1 200d284: 81 c7 e0 08 ret 200d288: 91 ea 00 19 restore %o0, %i1, %o0 /* * Is the block number in the doubly indirect portion? */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { 200d28c: 90 07 60 01 add %i5, 1, %o0 200d290: 40 00 29 61 call 2017814 <.umul> 200d294: 92 10 00 1d mov %i5, %o1 200d298: 82 02 3f ff add %o0, -1, %g1 200d29c: 80 a6 40 01 cmp %i1, %g1 200d2a0: 08 80 00 2c bleu 200d350 200d2a4: b6 10 00 08 mov %o0, %i3 } /* * Is the block number in the triply indirect portion? */ if ( my_block <= LAST_TRIPLY_INDIRECT ) { 200d2a8: 90 02 20 01 inc %o0 200d2ac: 40 00 29 5a call 2017814 <.umul> 200d2b0: 92 10 00 1d mov %i5, %o1 200d2b4: 90 02 3f ff add %o0, -1, %o0 200d2b8: 80 a6 40 08 cmp %i1, %o0 200d2bc: 18 80 00 53 bgu 200d408 <== NEVER TAKEN 200d2c0: b0 10 20 00 clr %i0 my_block -= FIRST_TRIPLY_INDIRECT; 200d2c4: b2 26 40 1b sub %i1, %i3, %i1 singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200d2c8: 92 10 00 1d mov %i5, %o1 200d2cc: 40 00 2a 38 call 2017bac <.urem> 200d2d0: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200d2d4: 92 10 00 1d mov %i5, %o1 * Is the block number in the triply indirect portion? */ if ( my_block <= LAST_TRIPLY_INDIRECT ) { my_block -= FIRST_TRIPLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200d2d8: a0 10 00 08 mov %o0, %l0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200d2dc: 40 00 29 88 call 20178fc <.udiv> 200d2e0: 90 10 00 19 mov %i1, %o0 triply = doubly / IMFS_MEMFILE_BLOCK_SLOTS; 200d2e4: 92 10 00 1d mov %i5, %o1 200d2e8: 40 00 29 85 call 20178fc <.udiv> 200d2ec: b6 10 00 08 mov %o0, %i3 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200d2f0: 92 10 00 1d mov %i5, %o1 if ( my_block <= LAST_TRIPLY_INDIRECT ) { my_block -= FIRST_TRIPLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; triply = doubly / IMFS_MEMFILE_BLOCK_SLOTS; 200d2f4: b2 10 00 08 mov %o0, %i1 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200d2f8: 40 00 2a 2d call 2017bac <.urem> 200d2fc: 90 10 00 1b mov %i3, %o0 p = info->triply_indirect; 200d300: c2 07 20 60 ld [ %i4 + 0x60 ], %g1 if ( malloc_it ) { 200d304: 80 a6 a0 00 cmp %i2, 0 200d308: 02 80 00 33 be 200d3d4 200d30c: ba 10 00 08 mov %o0, %i5 if ( !p ) { 200d310: 80 a0 60 00 cmp %g1, 0 200d314: 02 80 00 66 be 200d4ac 200d318: 01 00 00 00 nop if ( !p ) return 0; info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; 200d31c: b3 2e 60 02 sll %i1, 2, %i1 200d320: c4 00 40 19 ld [ %g1 + %i1 ], %g2 if ( !p1 ) { 200d324: 80 a0 a0 00 cmp %g2, 0 200d328: 02 80 00 5a be 200d490 200d32c: b2 00 40 19 add %g1, %i1, %i1 if ( !p1 ) return 0; p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; 200d330: bb 2f 60 02 sll %i5, 2, %i5 200d334: d0 00 80 1d ld [ %g2 + %i5 ], %o0 if ( !p2 ) { 200d338: 80 a2 20 00 cmp %o0, 0 200d33c: 02 80 00 47 be 200d458 200d340: ba 00 80 1d add %g2, %i5, %i5 p2 = memfile_alloc_block(); if ( !p2 ) return 0; p1[ doubly ] = (block_p) p2; } return (block_p *)&p2[ singly ]; 200d344: b1 2c 20 02 sll %l0, 2, %i0 200d348: 81 c7 e0 08 ret 200d34c: 91 ea 00 18 restore %o0, %i0, %o0 /* * Is the block number in the doubly indirect portion? */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { my_block -= FIRST_DOUBLY_INDIRECT; 200d350: b2 26 40 1d sub %i1, %i5, %i1 singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200d354: 92 10 00 1d mov %i5, %o1 200d358: 40 00 2a 15 call 2017bac <.urem> 200d35c: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200d360: 92 10 00 1d mov %i5, %o1 */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { my_block -= FIRST_DOUBLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200d364: b6 10 00 08 mov %o0, %i3 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200d368: 40 00 29 65 call 20178fc <.udiv> 200d36c: 90 10 00 19 mov %i1, %o0 p = info->doubly_indirect; 200d370: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( malloc_it ) { 200d374: 80 a6 a0 00 cmp %i2, 0 200d378: 02 80 00 26 be 200d410 200d37c: ba 10 00 08 mov %o0, %i5 if ( !p ) { 200d380: 80 a0 60 00 cmp %g1, 0 200d384: 02 80 00 3c be 200d474 200d388: 01 00 00 00 nop if ( !p ) return 0; info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; 200d38c: bb 2f 60 02 sll %i5, 2, %i5 200d390: d0 00 40 1d ld [ %g1 + %i5 ], %o0 if ( !p1 ) { 200d394: 80 a2 20 00 cmp %o0, 0 200d398: 02 80 00 29 be 200d43c 200d39c: ba 00 40 1d add %g1, %i5, %i5 if ( !p1 ) return 0; p[ doubly ] = (block_p) p1; } return (block_p *)&p1[ singly ]; 200d3a0: b1 2e e0 02 sll %i3, 2, %i0 200d3a4: 81 c7 e0 08 ret 200d3a8: 91 ea 00 18 restore %o0, %i0, %o0 if ( my_block <= LAST_INDIRECT ) { p = info->indirect; if ( malloc_it ) { if ( !p ) { 200d3ac: 80 a2 20 00 cmp %o0, 0 200d3b0: 32 bf ff b5 bne,a 200d284 200d3b4: b3 2e 60 02 sll %i1, 2, %i1 p = memfile_alloc_block(); 200d3b8: 7f ff ff 97 call 200d214 200d3bc: b0 10 20 00 clr %i0 if ( !p ) 200d3c0: 80 a2 20 00 cmp %o0, 0 200d3c4: 02 80 00 11 be 200d408 <== NEVER TAKEN 200d3c8: 01 00 00 00 nop return 0; info->indirect = p; 200d3cc: 10 bf ff ad b 200d280 200d3d0: d0 27 20 58 st %o0, [ %i4 + 0x58 ] p1[ doubly ] = (block_p) p2; } return (block_p *)&p2[ singly ]; } if ( !p ) 200d3d4: 80 a0 60 00 cmp %g1, 0 200d3d8: 02 80 00 0c be 200d408 <== NEVER TAKEN 200d3dc: b3 2e 60 02 sll %i1, 2, %i1 return 0; p1 = (block_p *) p[ triply ]; 200d3e0: c2 00 40 19 ld [ %g1 + %i1 ], %g1 if ( !p1 ) 200d3e4: 80 a0 60 00 cmp %g1, 0 200d3e8: 02 80 00 08 be 200d408 <== NEVER TAKEN 200d3ec: bb 2a 20 02 sll %o0, 2, %i5 return 0; p2 = (block_p *)p1[ doubly ]; 200d3f0: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p2 ) 200d3f4: 80 a0 60 00 cmp %g1, 0 200d3f8: 02 80 00 04 be 200d408 <== NEVER TAKEN 200d3fc: 01 00 00 00 nop return 0; return (block_p *)&p2[ singly ]; 200d400: b1 2c 20 02 sll %l0, 2, %i0 200d404: b0 00 40 18 add %g1, %i0, %i0 /* * This means the requested block number is out of range. */ return 0; } 200d408: 81 c7 e0 08 ret 200d40c: 81 e8 00 00 restore } return (block_p *)&p1[ singly ]; } if ( !p ) 200d410: 80 a0 60 00 cmp %g1, 0 200d414: 02 bf ff fd be 200d408 <== NEVER TAKEN 200d418: b0 10 20 00 clr %i0 return 0; p = (block_p *)p[ doubly ]; 200d41c: bb 2a 20 02 sll %o0, 2, %i5 200d420: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p ) 200d424: 80 a0 60 00 cmp %g1, 0 200d428: 02 bf ff f8 be 200d408 <== NEVER TAKEN 200d42c: 01 00 00 00 nop return 0; return (block_p *)&p[ singly ]; 200d430: b1 2e e0 02 sll %i3, 2, %i0 200d434: 81 c7 e0 08 ret 200d438: 91 e8 40 18 restore %g1, %i0, %o0 info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200d43c: 7f ff ff 76 call 200d214 200d440: b0 10 20 00 clr %i0 if ( !p1 ) 200d444: 80 a2 20 00 cmp %o0, 0 200d448: 02 bf ff f0 be 200d408 <== NEVER TAKEN 200d44c: 01 00 00 00 nop return 0; p[ doubly ] = (block_p) p1; 200d450: 10 bf ff d4 b 200d3a0 200d454: d0 27 40 00 st %o0, [ %i5 ] p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; if ( !p2 ) { p2 = memfile_alloc_block(); 200d458: 7f ff ff 6f call 200d214 200d45c: b0 10 20 00 clr %i0 if ( !p2 ) 200d460: 80 a2 20 00 cmp %o0, 0 200d464: 02 bf ff e9 be 200d408 <== NEVER TAKEN 200d468: 01 00 00 00 nop return 0; p1[ doubly ] = (block_p) p2; 200d46c: 10 bf ff b6 b 200d344 200d470: d0 27 40 00 st %o0, [ %i5 ] p = info->doubly_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200d474: 7f ff ff 68 call 200d214 200d478: b0 10 20 00 clr %i0 if ( !p ) 200d47c: 80 a2 20 00 cmp %o0, 0 200d480: 02 bf ff e2 be 200d408 <== NEVER TAKEN 200d484: 82 10 00 08 mov %o0, %g1 return 0; info->doubly_indirect = p; 200d488: 10 bf ff c1 b 200d38c 200d48c: d0 27 20 5c st %o0, [ %i4 + 0x5c ] info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200d490: 7f ff ff 61 call 200d214 200d494: b0 10 20 00 clr %i0 if ( !p1 ) 200d498: 80 a2 20 00 cmp %o0, 0 200d49c: 02 bf ff db be 200d408 <== NEVER TAKEN 200d4a0: 84 10 00 08 mov %o0, %g2 return 0; p[ triply ] = (block_p) p1; 200d4a4: 10 bf ff a3 b 200d330 200d4a8: d0 26 40 00 st %o0, [ %i1 ] p = info->triply_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200d4ac: 7f ff ff 5a call 200d214 200d4b0: 01 00 00 00 nop if ( !p ) 200d4b4: 82 92 20 00 orcc %o0, 0, %g1 200d4b8: 02 bf ff d4 be 200d408 <== NEVER TAKEN 200d4bc: 01 00 00 00 nop return 0; info->triply_indirect = p; 200d4c0: 10 bf ff 97 b 200d31c 200d4c4: c2 27 20 60 st %g1, [ %i4 + 0x60 ] =============================================================================== 0200d4c8 : IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200d4c8: 9d e3 bf 98 save %sp, -104, %sp * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; if (the_jnode->type == IMFS_LINEAR_FILE) { 200d4cc: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200d4d0: ba 10 00 18 mov %i0, %i5 200d4d4: a0 10 00 19 mov %i1, %l0 * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; if (the_jnode->type == IMFS_LINEAR_FILE) { 200d4d8: 80 a0 60 06 cmp %g1, 6 200d4dc: 02 80 00 64 be 200d66c 200d4e0: a2 10 00 1a mov %i2, %l1 /* * If the last byte we are supposed to read is past the end of this * in memory file, then shorten the length to read. */ last_byte = start + length; if ( last_byte > the_jnode->info.file.size ) 200d4e4: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 /* * If the last byte we are supposed to read is past the end of this * in memory file, then shorten the length to read. */ last_byte = start + length; 200d4e8: 82 10 00 1a mov %i2, %g1 if ( last_byte > the_jnode->info.file.size ) 200d4ec: 86 10 20 00 clr %g3 200d4f0: c8 06 20 54 ld [ %i0 + 0x54 ], %g4 200d4f4: 80 a0 c0 02 cmp %g3, %g2 200d4f8: 04 80 00 41 ble 200d5fc <== ALWAYS TAKEN 200d4fc: b4 07 00 1a add %i4, %i2, %i2 my_length = the_jnode->info.file.size - start; 200d500: b8 21 00 01 sub %g4, %g1, %i4 <== NOT EXECUTED */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200d504: 33 00 80 6f sethi %hi(0x201bc00), %i1 <== NOT EXECUTED 200d508: f4 06 63 1c ld [ %i1 + 0x31c ], %i2 ! 201bf1c 200d50c: 90 10 00 10 mov %l0, %o0 200d510: b1 3e a0 1f sra %i2, 0x1f, %i0 200d514: 92 10 00 11 mov %l1, %o1 200d518: 94 10 00 18 mov %i0, %o2 200d51c: 40 00 2b 36 call 20181f4 <__moddi3> 200d520: 96 10 00 1a mov %i2, %o3 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200d524: 90 10 00 10 mov %l0, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200d528: a4 10 00 09 mov %o1, %l2 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200d52c: 94 10 00 18 mov %i0, %o2 200d530: 92 10 00 11 mov %l1, %o1 200d534: 40 00 2a 4a call 2017e5c <__divdi3> 200d538: 96 10 00 1a mov %i2, %o3 unsigned int last_byte; unsigned int copied; unsigned int start_offset; unsigned char *dest; dest = destination; 200d53c: a2 10 00 1b mov %i3, %l1 /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200d540: a0 10 00 09 mov %o1, %l0 if ( start_offset ) { 200d544: 80 a4 a0 00 cmp %l2, 0 200d548: 02 80 00 14 be 200d598 200d54c: b0 10 20 00 clr %i0 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; if ( to_copy > my_length ) to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200d550: 90 10 00 1d mov %i5, %o0 200d554: 7f ff ff 3d call 200d248 200d558: 94 10 20 00 clr %o2 if ( !block_ptr ) 200d55c: 80 a2 20 00 cmp %o0, 0 200d560: 02 80 00 25 be 200d5f4 <== NEVER TAKEN 200d564: b4 26 80 12 sub %i2, %l2, %i2 * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200d568: 80 a7 00 1a cmp %i4, %i2 200d56c: 18 80 00 53 bgu 200d6b8 200d570: b0 10 00 1c mov %i4, %i0 if ( to_copy > my_length ) to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ start_offset ], to_copy ); 200d574: d2 02 00 00 ld [ %o0 ], %o1 200d578: 94 10 00 18 mov %i0, %o2 200d57c: 90 10 00 1b mov %i3, %o0 200d580: 40 00 07 c1 call 200f484 200d584: 92 02 40 12 add %o1, %l2, %o1 dest += to_copy; block++; my_length -= to_copy; 200d588: f4 06 63 1c ld [ %i1 + 0x31c ], %i2 to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ start_offset ], to_copy ); dest += to_copy; 200d58c: a2 06 c0 18 add %i3, %i0, %l1 block++; 200d590: a0 04 20 01 inc %l0 my_length -= to_copy; 200d594: b8 27 00 18 sub %i4, %i0, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200d598: 80 a7 00 1a cmp %i4, %i2 200d59c: 1a 80 00 0e bcc 200d5d4 200d5a0: 94 10 20 00 clr %o2 /* * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); if ( my_length ) { 200d5a4: 10 80 00 1e b 200d61c 200d5a8: 80 a7 20 00 cmp %i4, 0 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); 200d5ac: d2 00 40 00 ld [ %g1 ], %o1 200d5b0: 40 00 07 b5 call 200f484 200d5b4: b8 27 00 1a sub %i4, %i2, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200d5b8: c2 06 63 1c ld [ %i1 + 0x31c ], %g1 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); dest += to_copy; 200d5bc: a2 04 40 1a add %l1, %i2, %l1 block++; 200d5c0: a0 04 20 01 inc %l0 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200d5c4: 80 a0 40 1c cmp %g1, %i4 200d5c8: 18 80 00 14 bgu 200d618 200d5cc: b0 06 00 1a add %i0, %i2, %i0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200d5d0: 94 10 20 00 clr %o2 200d5d4: 92 10 00 10 mov %l0, %o1 200d5d8: 7f ff ff 1c call 200d248 200d5dc: 90 10 00 1d mov %i5, %o0 if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); 200d5e0: 94 10 00 1a mov %i2, %o2 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200d5e4: 82 10 00 08 mov %o0, %g1 if ( !block_ptr ) 200d5e8: 80 a0 60 00 cmp %g1, 0 200d5ec: 12 bf ff f0 bne 200d5ac <== ALWAYS TAKEN 200d5f0: 90 10 00 11 mov %l1, %o0 } IMFS_update_atime( the_jnode ); return copied; } 200d5f4: 81 c7 e0 08 ret <== NOT EXECUTED 200d5f8: 81 e8 00 00 restore <== NOT EXECUTED /* * If the last byte we are supposed to read is past the end of this * in memory file, then shorten the length to read. */ last_byte = start + length; if ( last_byte > the_jnode->info.file.size ) 200d5fc: 12 bf ff c3 bne 200d508 <== NEVER TAKEN 200d600: 33 00 80 6f sethi %hi(0x201bc00), %i1 200d604: 80 a6 80 04 cmp %i2, %g4 200d608: 08 bf ff c1 bleu 200d50c 200d60c: f4 06 63 1c ld [ %i1 + 0x31c ], %i2 my_length = the_jnode->info.file.size - start; 200d610: 10 bf ff be b 200d508 200d614: b8 21 00 01 sub %g4, %g1, %i4 /* * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); if ( my_length ) { 200d618: 80 a7 20 00 cmp %i4, 0 200d61c: 02 80 00 0e be 200d654 200d620: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200d624: 90 10 00 1d mov %i5, %o0 200d628: 92 10 00 10 mov %l0, %o1 200d62c: 7f ff ff 07 call 200d248 200d630: 94 10 20 00 clr %o2 if ( !block_ptr ) 200d634: 80 a2 20 00 cmp %o0, 0 200d638: 02 bf ff ef be 200d5f4 <== NEVER TAKEN 200d63c: 94 10 00 1c mov %i4, %o2 return copied; memcpy( dest, &(*block_ptr)[ 0 ], my_length ); 200d640: d2 02 00 00 ld [ %o0 ], %o1 200d644: 90 10 00 11 mov %l1, %o0 200d648: 40 00 07 8f call 200f484 200d64c: b0 06 00 1c add %i0, %i4, %i0 copied += my_length; } IMFS_update_atime( the_jnode ); 200d650: 90 07 bf f8 add %fp, -8, %o0 200d654: 7f ff d6 5d call 2002fc8 200d658: 92 10 20 00 clr %o1 200d65c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d660: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return copied; } 200d664: 81 c7 e0 08 ret 200d668: 81 e8 00 00 restore if (the_jnode->type == IMFS_LINEAR_FILE) { unsigned char *file_ptr; file_ptr = (unsigned char *)the_jnode->info.linearfile.direct; if (my_length > (the_jnode->info.linearfile.size - start)) 200d66c: d8 1e 20 50 ldd [ %i0 + 0x50 ], %o4 200d670: 82 10 20 00 clr %g1 200d674: 86 a3 40 1a subcc %o5, %i2, %g3 200d678: 84 63 00 19 subx %o4, %i1, %g2 200d67c: 80 a0 40 02 cmp %g1, %g2 200d680: 04 80 00 10 ble 200d6c0 <== ALWAYS TAKEN 200d684: d2 06 20 58 ld [ %i0 + 0x58 ], %o1 my_length = the_jnode->info.linearfile.size - start; 200d688: b0 23 40 11 sub %o5, %l1, %i0 <== NOT EXECUTED memcpy(dest, &file_ptr[start], my_length); 200d68c: 92 02 40 11 add %o1, %l1, %o1 200d690: 94 10 00 18 mov %i0, %o2 200d694: 40 00 07 7c call 200f484 200d698: 90 10 00 1b mov %i3, %o0 IMFS_update_atime( the_jnode ); 200d69c: 90 07 bf f8 add %fp, -8, %o0 200d6a0: 7f ff d6 4a call 2002fc8 200d6a4: 92 10 20 00 clr %o1 200d6a8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d6ac: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return my_length; 200d6b0: 81 c7 e0 08 ret 200d6b4: 81 e8 00 00 restore * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200d6b8: 10 bf ff af b 200d574 200d6bc: b0 10 00 1a mov %i2, %i0 if (the_jnode->type == IMFS_LINEAR_FILE) { unsigned char *file_ptr; file_ptr = (unsigned char *)the_jnode->info.linearfile.direct; if (my_length > (the_jnode->info.linearfile.size - start)) 200d6c0: 12 80 00 04 bne 200d6d0 <== NEVER TAKEN 200d6c4: 80 a7 00 03 cmp %i4, %g3 200d6c8: 38 bf ff f1 bgu,a 200d68c <== ALWAYS TAKEN 200d6cc: b0 23 40 11 sub %o5, %l1, %i0 my_length = the_jnode->info.linearfile.size - start; memcpy(dest, &file_ptr[start], my_length); 200d6d0: 92 02 40 11 add %o1, %l1, %o1 <== NOT EXECUTED /* * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; 200d6d4: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED file_ptr = (unsigned char *)the_jnode->info.linearfile.direct; if (my_length > (the_jnode->info.linearfile.size - start)) my_length = the_jnode->info.linearfile.size - start; memcpy(dest, &file_ptr[start], my_length); 200d6d8: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 200d6dc: 40 00 07 6a call 200f484 <== NOT EXECUTED 200d6e0: 94 10 00 18 mov %i0, %o2 <== NOT EXECUTED IMFS_update_atime( the_jnode ); 200d6e4: 90 07 bf f8 add %fp, -8, %o0 <== NOT EXECUTED 200d6e8: 7f ff d6 38 call 2002fc8 <== NOT EXECUTED 200d6ec: 92 10 20 00 clr %o1 <== NOT EXECUTED 200d6f0: c2 07 bf f8 ld [ %fp + -8 ], %g1 <== NOT EXECUTED 200d6f4: c2 27 60 40 st %g1, [ %i5 + 0x40 ] <== NOT EXECUTED return my_length; 200d6f8: 81 c7 e0 08 ret <== NOT EXECUTED 200d6fc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200d7f0 : * is better to stick to simple, easy to understand algorithms. */ int IMFS_memfile_remove( IMFS_jnode_t *the_jnode ) { 200d7f0: 9d e3 bf a0 save %sp, -96, %sp /* * Eventually this could be set smarter at each call to * memfile_free_blocks_in_table to greatly speed this up. */ to_free = IMFS_MEMFILE_BLOCK_SLOTS; 200d7f4: 39 00 80 6f sethi %hi(0x201bc00), %i4 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200d7f8: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 /* * Eventually this could be set smarter at each call to * memfile_free_blocks_in_table to greatly speed this up. */ to_free = IMFS_MEMFILE_BLOCK_SLOTS; 200d7fc: f4 07 23 1c ld [ %i4 + 0x31c ], %i2 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200d800: 80 a0 60 00 cmp %g1, 0 200d804: 02 80 00 05 be 200d818 200d808: b5 36 a0 02 srl %i2, 2, %i2 memfile_free_blocks_in_table( &info->indirect, to_free ); 200d80c: 90 06 20 58 add %i0, 0x58, %o0 200d810: 7f ff ff e2 call 200d798 200d814: 92 10 00 1a mov %i2, %o1 } if ( info->doubly_indirect ) { 200d818: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200d81c: 80 a0 60 00 cmp %g1, 0 200d820: 02 80 00 1b be 200d88c 200d824: c4 07 23 1c ld [ %i4 + 0x31c ], %g2 for ( i=0 ; i <== NEVER TAKEN 200d834: 90 10 20 00 clr %o0 200d838: 37 00 80 6f sethi %hi(0x201bc00), %i3 200d83c: ba 10 20 00 clr %i5 200d840: 10 80 00 03 b 200d84c 200d844: b6 16 e3 1c or %i3, 0x31c, %i3 200d848: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( info->doubly_indirect[i] ) { 200d84c: 91 2a 20 02 sll %o0, 2, %o0 200d850: c4 00 40 08 ld [ %g1 + %o0 ], %g2 200d854: 80 a0 a0 00 cmp %g2, 0 200d858: 02 80 00 04 be 200d868 <== NEVER TAKEN 200d85c: 90 00 40 08 add %g1, %o0, %o0 memfile_free_blocks_in_table( 200d860: 7f ff ff ce call 200d798 200d864: 92 10 00 1a mov %i2, %o1 if ( info->indirect ) { memfile_free_blocks_in_table( &info->indirect, to_free ); } if ( info->doubly_indirect ) { for ( i=0 ; i 200d87c: 90 10 00 1d mov %i5, %o0 if ( info->doubly_indirect[i] ) { memfile_free_blocks_in_table( (block_p **)&info->doubly_indirect[i], to_free ); } } memfile_free_blocks_in_table( &info->doubly_indirect, to_free ); 200d880: 90 06 20 5c add %i0, 0x5c, %o0 200d884: 7f ff ff c5 call 200d798 200d888: 92 10 00 1a mov %i2, %o1 } if ( info->triply_indirect ) { 200d88c: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 200d890: 80 a2 20 00 cmp %o0, 0 200d894: 02 80 00 33 be 200d960 200d898: c2 07 23 1c ld [ %i4 + 0x31c ], %g1 for ( i=0 ; i <== NEVER TAKEN 200d8a8: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED p = (block_p *) info->triply_indirect[i]; 200d8ac: f8 02 00 00 ld [ %o0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200d8b0: 80 a7 20 00 cmp %i4, 0 200d8b4: 22 80 00 29 be,a 200d958 <== NEVER TAKEN 200d8b8: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200d8bc: 37 00 80 6f sethi %hi(0x201bc00), %i3 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200d8c0: a0 10 20 00 clr %l0 if ( !p ) /* ensure we have a valid pointer */ 200d8c4: b2 10 20 00 clr %i1 200d8c8: b6 16 e3 1c or %i3, 0x31c, %i3 break; for ( j=0 ; j <== NEVER TAKEN 200d8d4: 90 02 00 10 add %o0, %l0, %o0 <== NOT EXECUTED 200d8d8: 90 10 20 00 clr %o0 200d8dc: ba 10 20 00 clr %i5 if ( p[j] ) { 200d8e0: 91 2a 20 02 sll %o0, 2, %o0 200d8e4: c2 07 00 08 ld [ %i4 + %o0 ], %g1 200d8e8: 80 a0 60 00 cmp %g1, 0 200d8ec: 02 80 00 04 be 200d8fc <== NEVER TAKEN 200d8f0: 90 07 00 08 add %i4, %o0, %o0 memfile_free_blocks_in_table( (block_p **)&p[j], to_free); 200d8f4: 7f ff ff a9 call 200d798 200d8f8: 92 10 00 1a mov %i2, %o1 if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; if ( !p ) /* ensure we have a valid pointer */ break; for ( j=0 ; j 200d910: 90 10 00 1d mov %i5, %o0 200d914: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 if ( p[j] ) { memfile_free_blocks_in_table( (block_p **)&p[j], to_free); } } memfile_free_blocks_in_table( 200d918: 90 02 00 10 add %o0, %l0, %o0 200d91c: 7f ff ff 9f call 200d798 200d920: 92 10 00 1a mov %i2, %o1 memfile_free_blocks_in_table( &info->doubly_indirect, to_free ); } if ( info->triply_indirect ) { for ( i=0 ; i 200d938: 90 06 20 60 add %i0, 0x60, %o0 p = (block_p *) info->triply_indirect[i]; 200d93c: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 * a significant difference in the performance of this routine. * * Regardless until the IMFS implementation is proven, it * is better to stick to simple, easy to understand algorithms. */ int IMFS_memfile_remove( 200d940: a1 2e 60 02 sll %i1, 2, %l0 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200d944: f8 02 00 10 ld [ %o0 + %l0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200d948: 80 a7 20 00 cmp %i4, 0 200d94c: 12 bf ff e1 bne 200d8d0 <== ALWAYS TAKEN 200d950: 80 a0 60 00 cmp %g1, 0 } } memfile_free_blocks_in_table( (block_p **)&info->triply_indirect[i], to_free ); } memfile_free_blocks_in_table( 200d954: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200d958: 7f ff ff 90 call 200d798 200d95c: 92 10 00 1a mov %i2, %o1 (block_p **)&info->triply_indirect, to_free ); } return 0; } 200d960: 81 c7 e0 08 ret 200d964: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200db04 : IMFS_jnode_t *the_jnode, off_t start, const unsigned char *source, unsigned int length ) { 200db04: 9d e3 bf 98 save %sp, -104, %sp * If the last byte we are supposed to write is past the end of this * in memory file, then extend the length. */ last_byte = start + my_length; if ( last_byte > the_jnode->info.file.size ) { 200db08: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 IMFS_jnode_t *the_jnode, off_t start, const unsigned char *source, unsigned int length ) { 200db0c: ba 10 00 18 mov %i0, %i5 * If the last byte we are supposed to write is past the end of this * in memory file, then extend the length. */ last_byte = start + my_length; if ( last_byte > the_jnode->info.file.size ) { 200db10: 80 a0 60 00 cmp %g1, 0 200db14: 06 80 00 5c bl 200dc84 <== NEVER TAKEN 200db18: 94 07 00 1a add %i4, %i2, %o2 200db1c: 80 a0 60 00 cmp %g1, 0 200db20: 22 80 00 56 be,a 200dc78 <== ALWAYS TAKEN 200db24: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200db28: 23 00 80 6f sethi %hi(0x201bc00), %l1 <== NOT EXECUTED 200db2c: e0 04 63 1c ld [ %l1 + 0x31c ], %l0 ! 201bf1c 200db30: 92 10 00 1a mov %i2, %o1 200db34: b1 3c 20 1f sra %l0, 0x1f, %i0 200db38: 96 10 00 10 mov %l0, %o3 200db3c: 94 10 00 18 mov %i0, %o2 200db40: 40 00 29 ad call 20181f4 <__moddi3> 200db44: 90 10 00 19 mov %i1, %o0 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200db48: 94 10 00 18 mov %i0, %o2 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200db4c: a4 10 00 09 mov %o1, %l2 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200db50: 90 10 00 19 mov %i1, %o0 200db54: 92 10 00 1a mov %i2, %o1 200db58: 40 00 28 c1 call 2017e5c <__divdi3> 200db5c: 96 10 00 10 mov %l0, %o3 status = IMFS_memfile_extend( the_jnode, last_byte ); if ( status ) rtems_set_errno_and_return_minus_one( ENOSPC ); } copied = 0; 200db60: b0 10 20 00 clr %i0 /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { 200db64: 80 a4 a0 00 cmp %l2, 0 200db68: 12 80 00 1a bne 200dbd0 200db6c: b4 10 00 09 mov %o1, %i2 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200db70: 80 a7 00 10 cmp %i4, %l0 200db74: 1a 80 00 0e bcc 200dbac 200db78: 92 10 00 1a mov %i2, %o1 * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); to_copy = my_length; if ( my_length ) { 200db7c: 10 80 00 2a b 200dc24 200db80: 80 a7 20 00 cmp %i4, 0 if ( !block_ptr ) return copied; #if 0 fprintf(stdout, "write %d in %d: %*s\n", to_copy, block, to_copy, src ); #endif memcpy( &(*block_ptr)[ 0 ], src, to_copy ); 200db84: d0 02 00 00 ld [ %o0 ], %o0 200db88: 40 00 06 3f call 200f484 200db8c: b8 27 00 10 sub %i4, %l0, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200db90: c2 04 63 1c ld [ %l1 + 0x31c ], %g1 return copied; #if 0 fprintf(stdout, "write %d in %d: %*s\n", to_copy, block, to_copy, src ); #endif memcpy( &(*block_ptr)[ 0 ], src, to_copy ); src += to_copy; 200db94: b6 06 c0 10 add %i3, %l0, %i3 block++; 200db98: b4 06 a0 01 inc %i2 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200db9c: 80 a0 40 1c cmp %g1, %i4 200dba0: 18 80 00 20 bgu 200dc20 200dba4: b0 06 00 10 add %i0, %l0, %i0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200dba8: 92 10 00 1a mov %i2, %o1 200dbac: 94 10 20 00 clr %o2 200dbb0: 7f ff fd a6 call 200d248 200dbb4: 90 10 00 1d mov %i5, %o0 if ( !block_ptr ) return copied; #if 0 fprintf(stdout, "write %d in %d: %*s\n", to_copy, block, to_copy, src ); #endif memcpy( &(*block_ptr)[ 0 ], src, to_copy ); 200dbb8: 92 10 00 1b mov %i3, %o1 */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) 200dbbc: 80 a2 20 00 cmp %o0, 0 200dbc0: 12 bf ff f1 bne 200db84 <== ALWAYS TAKEN 200dbc4: 94 10 00 10 mov %l0, %o2 } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200dbc8: 81 c7 e0 08 ret <== NOT EXECUTED 200dbcc: 81 e8 00 00 restore <== NOT EXECUTED block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; if ( to_copy > my_length ) to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200dbd0: 90 10 00 1d mov %i5, %o0 200dbd4: 94 10 20 00 clr %o2 200dbd8: 7f ff fd 9c call 200d248 200dbdc: b0 10 20 00 clr %i0 if ( !block_ptr ) 200dbe0: 80 a2 20 00 cmp %o0, 0 200dbe4: 02 80 00 32 be 200dcac <== NEVER TAKEN 200dbe8: 01 00 00 00 nop * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200dbec: b0 24 00 12 sub %l0, %l2, %i0 200dbf0: 80 a6 00 1c cmp %i0, %i4 200dbf4: 18 80 00 30 bgu 200dcb4 200dbf8: d0 02 00 00 ld [ %o0 ], %o0 block, to_copy, src ); #endif memcpy( &(*block_ptr)[ start_offset ], src, to_copy ); 200dbfc: 92 10 00 1b mov %i3, %o1 200dc00: 90 02 00 12 add %o0, %l2, %o0 200dc04: 94 10 00 18 mov %i0, %o2 200dc08: 40 00 06 1f call 200f484 200dc0c: b6 06 c0 18 add %i3, %i0, %i3 src += to_copy; block++; 200dc10: b4 06 a0 01 inc %i2 my_length -= to_copy; 200dc14: b8 27 00 18 sub %i4, %i0, %i4 copied += to_copy; 200dc18: 10 bf ff d6 b 200db70 200dc1c: e0 04 63 1c ld [ %l1 + 0x31c ], %l0 * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); to_copy = my_length; if ( my_length ) { 200dc20: 80 a7 20 00 cmp %i4, 0 200dc24: 02 80 00 0e be 200dc5c 200dc28: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200dc2c: 90 10 00 1d mov %i5, %o0 200dc30: 92 10 00 1a mov %i2, %o1 200dc34: 7f ff fd 85 call 200d248 200dc38: 94 10 20 00 clr %o2 if ( !block_ptr ) 200dc3c: 80 a2 20 00 cmp %o0, 0 200dc40: 02 bf ff e2 be 200dbc8 <== NEVER TAKEN 200dc44: 92 10 00 1b mov %i3, %o1 return copied; #if 0 fprintf(stdout, "write %d in %d: %*s\n", to_copy, block, to_copy, src ); #endif memcpy( &(*block_ptr)[ 0 ], src, my_length ); 200dc48: d0 02 00 00 ld [ %o0 ], %o0 200dc4c: 94 10 00 1c mov %i4, %o2 200dc50: 40 00 06 0d call 200f484 200dc54: b0 06 00 1c add %i0, %i4, %i0 my_length = 0; copied += to_copy; } IMFS_mtime_ctime_update( the_jnode ); 200dc58: 90 07 bf f8 add %fp, -8, %o0 200dc5c: 7f ff d4 db call 2002fc8 200dc60: 92 10 20 00 clr %o1 200dc64: c2 07 bf f8 ld [ %fp + -8 ], %g1 200dc68: c2 27 60 44 st %g1, [ %i5 + 0x44 ] 200dc6c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] return copied; } 200dc70: 81 c7 e0 08 ret 200dc74: 81 e8 00 00 restore * If the last byte we are supposed to write is past the end of this * in memory file, then extend the length. */ last_byte = start + my_length; if ( last_byte > the_jnode->info.file.size ) { 200dc78: 80 a0 40 0a cmp %g1, %o2 200dc7c: 1a bf ff ac bcc 200db2c 200dc80: 23 00 80 6f sethi %hi(0x201bc00), %l1 status = IMFS_memfile_extend( the_jnode, last_byte ); 200dc84: 90 10 00 1d mov %i5, %o0 200dc88: 7f ff ff 44 call 200d998 200dc8c: 92 10 20 00 clr %o1 if ( status ) 200dc90: 80 a2 20 00 cmp %o0, 0 200dc94: 02 bf ff a6 be 200db2c 200dc98: 23 00 80 6f sethi %hi(0x201bc00), %l1 rtems_set_errno_and_return_minus_one( ENOSPC ); 200dc9c: 40 00 03 9e call 200eb14 <__errno> 200dca0: b0 10 3f ff mov -1, %i0 200dca4: 82 10 20 1c mov 0x1c, %g1 200dca8: c2 22 00 00 st %g1, [ %o0 ] 200dcac: 81 c7 e0 08 ret 200dcb0: 81 e8 00 00 restore * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; if ( start_offset ) { to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200dcb4: b0 10 00 1c mov %i4, %i0 block, to_copy, src ); #endif memcpy( &(*block_ptr)[ start_offset ], src, to_copy ); 200dcb8: 92 10 00 1b mov %i3, %o1 200dcbc: 90 02 00 12 add %o0, %l2, %o0 200dcc0: 94 10 00 18 mov %i0, %o2 200dcc4: 40 00 05 f0 call 200f484 200dcc8: b6 06 c0 18 add %i3, %i0, %i3 src += to_copy; block++; 200dccc: b4 06 a0 01 inc %i2 my_length -= to_copy; 200dcd0: b8 27 00 18 sub %i4, %i0, %i4 copied += to_copy; 200dcd4: 10 bf ff a7 b 200db70 200dcd8: e0 04 63 1c ld [ %l1 + 0x31c ], %l0 =============================================================================== 020025d4 : #include int IMFS_mount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 20025d4: 9d e3 bf a0 save %sp, -96, %sp IMFS_jnode_t *node; node = mt_entry->mt_point_node.node_access; 20025d8: c2 06 20 08 ld [ %i0 + 8 ], %g1 /* * Is the node that we are mounting onto a directory node ? */ if ( node->type != IMFS_DIRECTORY ) 20025dc: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 20025e0: 80 a0 a0 01 cmp %g2, 1 20025e4: 12 80 00 05 bne 20025f8 <== NEVER TAKEN 20025e8: 01 00 00 00 nop /* * Set mt_fs pointer to point to the mount table entry for * the mounted file system. */ node->info.directory.mt_fs = mt_entry; 20025ec: f0 20 60 5c st %i0, [ %g1 + 0x5c ] return 0; } 20025f0: 81 c7 e0 08 ret 20025f4: 91 e8 20 00 restore %g0, 0, %o0 /* * Is the node that we are mounting onto a directory node ? */ if ( node->type != IMFS_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 20025f8: 40 00 31 47 call 200eb14 <__errno> <== NOT EXECUTED 20025fc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2002600: 82 10 20 14 mov 0x14, %g1 <== NOT EXECUTED 2002604: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2002608: 81 c7 e0 08 ret <== NOT EXECUTED 200260c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02005048 : * This routine prints the contents of the specified jnode. */ void IMFS_print_jnode( IMFS_jnode_t *the_jnode ) { 2005048: 9d e3 bf a0 save %sp, -96, %sp IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); 200504c: 3b 00 80 8d sethi %hi(0x2023400), %i5 2005050: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 ! 2023590 <_impure_ptr> 2005054: 90 06 20 0c add %i0, 0xc, %o0 2005058: 40 00 39 75 call 201362c 200505c: d2 00 60 08 ld [ %g1 + 8 ], %o1 switch( the_jnode->type ) { 2005060: f4 06 20 4c ld [ %i0 + 0x4c ], %i2 2005064: 80 a6 a0 07 cmp %i2, 7 2005068: 08 80 00 07 bleu 2005084 <== ALWAYS TAKEN 200506c: 83 2e a0 02 sll %i2, 2, %g1 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", the_jnode->type ); 2005070: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 <== NOT EXECUTED 2005074: 33 00 80 86 sethi %hi(0x2021800), %i1 <== NOT EXECUTED 2005078: f0 00 60 08 ld [ %g1 + 8 ], %i0 <== NOT EXECUTED 200507c: 40 00 39 1b call 20134e8 <== NOT EXECUTED 2005080: 93 ee 60 08 restore %i1, 8, %o1 <== NOT EXECUTED ) { IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( the_jnode->type ) { 2005084: 05 00 80 14 sethi %hi(0x2005000), %g2 2005088: 84 10 a0 28 or %g2, 0x28, %g2 ! 2005028 200508c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2005090: 81 c0 40 00 jmp %g1 2005094: 01 00 00 00 nop case IMFS_HARD_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); 2005098: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 200509c: 31 00 80 85 sethi %hi(0x2021400), %i0 20050a0: f6 00 60 08 ld [ %g1 + 8 ], %i3 20050a4: b0 16 23 d8 or %i0, 0x3d8, %i0 20050a8: b2 10 20 01 mov 1, %i1 20050ac: 40 00 3c 82 call 20142b4 20050b0: 95 e8 20 13 restore %g0, 0x13, %o2 return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 20050b4: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 20050b8: 31 00 80 85 sethi %hi(0x2021400), %i0 20050bc: f6 00 60 08 ld [ %g1 + 8 ], %i3 20050c0: b0 16 23 f0 or %i0, 0x3f0, %i0 20050c4: b2 10 20 01 mov 1, %i1 20050c8: 40 00 3c 7b call 20142b4 20050cc: 95 e8 20 12 restore %g0, 0x12, %o2 the_jnode->info.file.indirect, the_jnode->info.file.doubly_indirect, the_jnode->info.file.triply_indirect ); #else fprintf(stdout, " (file %" PRId32 ")", 20050d0: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 20050d4: d4 06 20 54 ld [ %i0 + 0x54 ], %o2 20050d8: d0 00 60 08 ld [ %g1 + 8 ], %o0 20050dc: 13 00 80 85 sethi %hi(0x2021400), %o1 20050e0: 40 00 39 02 call 20134e8 20050e4: 92 12 63 c8 or %o1, 0x3c8, %o1 ! 20217c8 default: fprintf(stdout, " bad type %d\n", the_jnode->type ); return; } puts(""); 20050e8: 31 00 80 85 sethi %hi(0x2021400), %i0 20050ec: 40 00 40 74 call 20152bc 20050f0: 91 ee 23 50 restore %i0, 0x350, %o0 fprintf(stdout, " (device %" PRId32 ", %" PRId32 ")", the_jnode->info.device.major, the_jnode->info.device.minor ); break; case IMFS_LINEAR_FILE: fprintf(stdout, " (file %" PRId32 " %p)", 20050f4: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 20050f8: d4 06 20 54 ld [ %i0 + 0x54 ], %o2 20050fc: d6 06 20 58 ld [ %i0 + 0x58 ], %o3 2005100: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005104: 13 00 80 85 sethi %hi(0x2021400), %o1 2005108: 40 00 38 f8 call 20134e8 200510c: 92 12 63 b8 or %o1, 0x3b8, %o1 ! 20217b8 default: fprintf(stdout, " bad type %d\n", the_jnode->type ); return; } puts(""); 2005110: 31 00 80 85 sethi %hi(0x2021400), %i0 2005114: 40 00 40 6a call 20152bc 2005118: 91 ee 23 50 restore %i0, 0x350, %o0 IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( the_jnode->type ) { case IMFS_DIRECTORY: fprintf(stdout, "/" ); 200511c: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 2005120: 90 10 20 2f mov 0x2f, %o0 2005124: d2 00 60 08 ld [ %g1 + 8 ], %o1 2005128: 40 00 39 0c call 2013558 200512c: 31 00 80 85 sethi %hi(0x2021400), %i0 default: fprintf(stdout, " bad type %d\n", the_jnode->type ); return; } puts(""); 2005130: 40 00 40 63 call 20152bc 2005134: 91 ee 23 50 restore %i0, 0x350, %o0 case IMFS_DIRECTORY: fprintf(stdout, "/" ); break; case IMFS_DEVICE: fprintf(stdout, " (device %" PRId32 ", %" PRId32 ")", 2005138: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 200513c: d4 06 20 50 ld [ %i0 + 0x50 ], %o2 2005140: d6 06 20 54 ld [ %i0 + 0x54 ], %o3 2005144: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005148: 13 00 80 85 sethi %hi(0x2021400), %o1 200514c: 40 00 38 e7 call 20134e8 2005150: 92 12 63 a0 or %o1, 0x3a0, %o1 ! 20217a0 default: fprintf(stdout, " bad type %d\n", the_jnode->type ); return; } puts(""); 2005154: 31 00 80 85 sethi %hi(0x2021400), %i0 2005158: 40 00 40 59 call 20152bc 200515c: 91 ee 23 50 restore %i0, 0x350, %o0 =============================================================================== 0200261c : ) { IMFS_jnode_t *node; ssize_t i; node = loc->node_access; 200261c: c8 02 00 00 ld [ %o0 ], %g4 IMFS_assert( node->type == IMFS_SYM_LINK ); for( i=0; ((iinfo.sym_link.name[i] != '\0')); i++ ) 2002620: 80 a2 a0 00 cmp %o2, 0 2002624: 02 80 00 13 be 2002670 <== NEVER TAKEN 2002628: 90 10 20 00 clr %o0 200262c: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 2002630: c4 48 40 00 ldsb [ %g1 ], %g2 2002634: 80 a0 a0 00 cmp %g2, 0 2002638: 02 80 00 0e be 2002670 <== NEVER TAKEN 200263c: c2 08 40 00 ldub [ %g1 ], %g1 2002640: 10 80 00 07 b 200265c 2002644: 84 10 20 00 clr %g2 2002648: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 200264c: c6 48 40 08 ldsb [ %g1 + %o0 ], %g3 2002650: 80 a0 e0 00 cmp %g3, 0 2002654: 02 80 00 07 be 2002670 2002658: c2 08 40 08 ldub [ %g1 + %o0 ], %g1 buf[i] = node->info.sym_link.name[i]; 200265c: c2 2a 40 02 stb %g1, [ %o1 + %g2 ] node = loc->node_access; IMFS_assert( node->type == IMFS_SYM_LINK ); for( i=0; ((iinfo.sym_link.name[i] != '\0')); i++ ) 2002660: 90 02 20 01 inc %o0 2002664: 80 a2 00 0a cmp %o0, %o2 2002668: 12 bf ff f8 bne 2002648 200266c: 84 10 00 08 mov %o0, %g2 buf[i] = node->info.sym_link.name[i]; return i; } 2002670: 81 c3 e0 08 retl =============================================================================== 02002678 : rtems_filesystem_location_info_t *old_parent_loc, /* IN */ rtems_filesystem_location_info_t *old_loc, /* IN */ rtems_filesystem_location_info_t *new_parent_loc, /* IN */ const char *new_name /* IN */ ) { 2002678: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *the_jnode; IMFS_jnode_t *new_parent; the_jnode = old_loc->node_access; 200267c: fa 06 40 00 ld [ %i1 ], %i5 strncpy( the_jnode->name, new_name, IMFS_NAME_MAX ); 2002680: 92 10 00 1b mov %i3, %o1 2002684: 90 07 60 0c add %i5, 0xc, %o0 2002688: 40 00 36 ec call 2010238 200268c: 94 10 20 20 mov 0x20, %o2 if ( the_jnode->Parent != NULL ) 2002690: c2 07 60 08 ld [ %i5 + 8 ], %g1 2002694: 80 a0 60 00 cmp %g1, 0 2002698: 22 80 00 05 be,a 20026ac <== NEVER TAKEN 200269c: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20026a0: 40 00 13 4a call 20073c8 <_Chain_Extract> 20026a4: 90 10 00 1d mov %i5, %o0 rtems_chain_extract( (rtems_chain_node *) the_jnode ); new_parent = new_parent_loc->node_access; 20026a8: c2 06 80 00 ld [ %i2 ], %g1 RTEMS_INLINE_ROUTINE void rtems_chain_append( rtems_chain_control *the_chain, rtems_chain_node *the_node ) { _Chain_Append( the_chain, the_node ); 20026ac: 92 10 00 1d mov %i5, %o1 20026b0: 90 00 60 50 add %g1, 0x50, %o0 20026b4: 40 00 13 3a call 200739c <_Chain_Append> 20026b8: c2 27 60 08 st %g1, [ %i5 + 8 ] rtems_chain_append( &new_parent->info.directory.Entries, &the_jnode->Node ); /* * Update the time. */ IMFS_update_ctime( the_jnode ); 20026bc: 90 07 bf f8 add %fp, -8, %o0 20026c0: 40 00 02 42 call 2002fc8 20026c4: 92 10 20 00 clr %o1 20026c8: c2 07 bf f8 ld [ %fp + -8 ], %g1 20026cc: c2 27 60 48 st %g1, [ %i5 + 0x48 ] return 0; } 20026d0: 81 c7 e0 08 ret 20026d4: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200ac44 : static void IMFS_skip_separator ( const char *path, /* IN */ size_t *len, /* IN/OUT */ int *index /* IN/OUT */ ) { 200ac44: 9d e3 bf a0 save %sp, -96, %sp while ( IMFS_is_separator( path[*index] ) && path[*index] && *len ) { 200ac48: 10 80 00 0f b 200ac84 200ac4c: c2 06 80 00 ld [ %i2 ], %g1 200ac50: c4 4e 00 01 ldsb [ %i0 + %g1 ], %g2 200ac54: 80 a0 a0 00 cmp %g2, 0 200ac58: 02 80 00 10 be 200ac98 200ac5c: 82 00 60 01 inc %g1 200ac60: c4 06 40 00 ld [ %i1 ], %g2 200ac64: 80 a0 a0 00 cmp %g2, 0 200ac68: 02 80 00 0c be 200ac98 <== NEVER TAKEN 200ac6c: 01 00 00 00 nop ++(*index); 200ac70: c2 26 80 00 st %g1, [ %i2 ] --(*len); 200ac74: c2 06 40 00 ld [ %i1 ], %g1 200ac78: 82 00 7f ff add %g1, -1, %g1 200ac7c: c2 26 40 00 st %g1, [ %i1 ] const char *path, /* IN */ size_t *len, /* IN/OUT */ int *index /* IN/OUT */ ) { while ( IMFS_is_separator( path[*index] ) && path[*index] && *len ) { 200ac80: c2 06 80 00 ld [ %i2 ], %g1 200ac84: 7f ff e4 a4 call 2003f14 200ac88: d0 4e 00 01 ldsb [ %i0 + %g1 ], %o0 200ac8c: 80 a2 20 00 cmp %o0, 0 200ac90: 32 bf ff f0 bne,a 200ac50 200ac94: c2 06 80 00 ld [ %i2 ], %g1 200ac98: 81 c7 e0 08 ret 200ac9c: 81 e8 00 00 restore =============================================================================== 0200ba34 : int IMFS_stat( rtems_filesystem_location_info_t *loc, struct stat *buf ) { 200ba34: 9d e3 bf a0 save %sp, -96, %sp IMFS_fs_info_t *fs_info; IMFS_jnode_t *the_jnode; IMFS_device_t *io; the_jnode = loc->node_access; 200ba38: c2 06 00 00 ld [ %i0 ], %g1 switch ( the_jnode->type ) { 200ba3c: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 200ba40: 80 a0 a0 07 cmp %g2, 7 200ba44: 08 80 00 08 bleu 200ba64 <== ALWAYS TAKEN 200ba48: 85 28 a0 02 sll %g2, 2, %g2 case IMFS_FIFO: buf->st_size = 0; break; default: rtems_set_errno_and_return_minus_one( ENOTSUP ); 200ba4c: 40 00 0c 32 call 200eb14 <__errno> 200ba50: b0 10 3f ff mov -1, %i0 200ba54: 82 10 20 86 mov 0x86, %g1 200ba58: c2 22 00 00 st %g1, [ %o0 ] 200ba5c: 81 c7 e0 08 ret 200ba60: 81 e8 00 00 restore IMFS_device_t *io; the_jnode = loc->node_access; switch ( the_jnode->type ) { 200ba64: 07 00 80 2e sethi %hi(0x200b800), %g3 200ba68: 86 10 e2 14 or %g3, 0x214, %g3 ! 200ba14 200ba6c: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 200ba70: 81 c0 80 00 jmp %g2 200ba74: 01 00 00 00 nop case IMFS_SYM_LINK: buf->st_size = 0; break; case IMFS_FIFO: buf->st_size = 0; 200ba78: c0 26 60 20 clr [ %i1 + 0x20 ] 200ba7c: c0 26 60 24 clr [ %i1 + 0x24 ] /* * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; 200ba80: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 buf->st_dev = rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; 200ba84: d6 00 60 30 ld [ %g1 + 0x30 ], %o3 * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; buf->st_dev = rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); 200ba88: c4 00 a0 34 ld [ %g2 + 0x34 ], %g2 buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; buf->st_ino = the_jnode->st_ino; buf->st_uid = the_jnode->st_uid; buf->st_gid = the_jnode->st_gid; 200ba8c: f0 10 60 3e lduh [ %g1 + 0x3e ], %i0 fs_info = loc->mt_entry->fs_info; buf->st_dev = rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; 200ba90: d8 10 60 34 lduh [ %g1 + 0x34 ], %o4 * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; buf->st_dev = rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); 200ba94: d4 00 80 00 ld [ %g2 ], %o2 buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; buf->st_ino = the_jnode->st_ino; 200ba98: da 00 60 38 ld [ %g1 + 0x38 ], %o5 buf->st_uid = the_jnode->st_uid; 200ba9c: de 10 60 3c lduh [ %g1 + 0x3c ], %o7 buf->st_gid = the_jnode->st_gid; buf->st_atime = the_jnode->stat_atime; 200baa0: c8 00 60 40 ld [ %g1 + 0x40 ], %g4 buf->st_mtime = the_jnode->stat_mtime; 200baa4: c6 00 60 44 ld [ %g1 + 0x44 ], %g3 buf->st_ctime = the_jnode->stat_ctime; 200baa8: c4 00 60 48 ld [ %g1 + 0x48 ], %g2 buf->st_blksize = imfs_rq_memfile_bytes_per_block; 200baac: 03 00 80 6d sethi %hi(0x201b400), %g1 200bab0: c2 00 63 a4 ld [ %g1 + 0x3a4 ], %g1 ! 201b7a4 */ fs_info = loc->mt_entry->fs_info; buf->st_dev = rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; 200bab4: d6 26 60 0c st %o3, [ %i1 + 0xc ] buf->st_nlink = the_jnode->st_nlink; buf->st_ino = the_jnode->st_ino; buf->st_uid = the_jnode->st_uid; buf->st_gid = the_jnode->st_gid; 200bab8: f0 36 60 14 sth %i0, [ %i1 + 0x14 ] /* * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; buf->st_dev = 200babc: d4 26 60 04 st %o2, [ %i1 + 4 ] 200bac0: 17 00 00 3f sethi %hi(0xfc00), %o3 rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; 200bac4: d8 36 60 10 sth %o4, [ %i1 + 0x10 ] /* * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; buf->st_dev = 200bac8: 96 12 e3 fe or %o3, 0x3fe, %o3 rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; buf->st_ino = the_jnode->st_ino; 200bacc: da 26 60 08 st %o5, [ %i1 + 8 ] /* * The device number of the IMFS is the major number and the minor is the * instance. */ fs_info = loc->mt_entry->fs_info; buf->st_dev = 200bad0: d6 26 40 00 st %o3, [ %i1 ] rtems_filesystem_make_dev_t( IMFS_DEVICE_MAJOR_NUMBER, fs_info->instance ); buf->st_mode = the_jnode->st_mode; buf->st_nlink = the_jnode->st_nlink; buf->st_ino = the_jnode->st_ino; buf->st_uid = the_jnode->st_uid; 200bad4: de 36 60 12 sth %o7, [ %i1 + 0x12 ] buf->st_gid = the_jnode->st_gid; buf->st_atime = the_jnode->stat_atime; 200bad8: c8 26 60 28 st %g4, [ %i1 + 0x28 ] buf->st_mtime = the_jnode->stat_mtime; 200badc: c6 26 60 30 st %g3, [ %i1 + 0x30 ] buf->st_ctime = the_jnode->stat_ctime; 200bae0: c4 26 60 38 st %g2, [ %i1 + 0x38 ] buf->st_blksize = imfs_rq_memfile_bytes_per_block; 200bae4: c2 26 60 40 st %g1, [ %i1 + 0x40 ] return 0; } 200bae8: 81 c7 e0 08 ret 200baec: 91 e8 20 00 restore %g0, 0, %o0 switch ( the_jnode->type ) { case IMFS_DEVICE: io = &the_jnode->info.device; buf->st_rdev = rtems_filesystem_make_dev_t( io->major, io->minor ); 200baf0: c6 00 60 54 ld [ %g1 + 0x54 ], %g3 rtems_device_minor_number _minor ) { union __rtems_dev_t temp; temp.__overlay.major = _major; 200baf4: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 break; 200baf8: 10 bf ff e2 b 200ba80 200bafc: c4 3e 60 18 std %g2, [ %i1 + 0x18 ] case IMFS_LINEAR_FILE: case IMFS_MEMORY_FILE: buf->st_size = the_jnode->info.file.size; 200bb00: c4 18 60 50 ldd [ %g1 + 0x50 ], %g2 break; 200bb04: 10 bf ff df b 200ba80 200bb08: c4 3e 60 20 std %g2, [ %i1 + 0x20 ] =============================================================================== 02002770 : int IMFS_unlink( rtems_filesystem_location_info_t *parentloc, /* IN */ rtems_filesystem_location_info_t *loc /* IN */ ) { 2002770: 9d e3 bf 80 save %sp, -128, %sp IMFS_jnode_t *node; rtems_filesystem_location_info_t the_link; int result = 0; node = loc->node_access; 2002774: fa 06 40 00 ld [ %i1 ], %i5 /* * If this is the last last pointer to the node * free the node. */ if ( node->type == IMFS_HARD_LINK ) { 2002778: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200277c: 80 a0 60 03 cmp %g1, 3 2002780: 02 80 00 09 be 20027a4 2002784: b8 10 00 18 mov %i0, %i4 /* * Now actually free the node we were asked to free. */ result = (*loc->handlers->rmnod_h)( parentloc, loc ); 2002788: c2 06 60 08 ld [ %i1 + 8 ], %g1 200278c: 90 10 00 1c mov %i4, %o0 2002790: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2002794: 9f c0 40 00 call %g1 2002798: 92 10 00 19 mov %i1, %o1 return result; } 200279c: 81 c7 e0 08 ret 20027a0: 91 e8 00 08 restore %g0, %o0, %o0 * free the node. */ if ( node->type == IMFS_HARD_LINK ) { if ( !node->info.hard_link.link_node ) 20027a4: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 20027a8: 80 a0 60 00 cmp %g1, 0 20027ac: 02 80 00 2b be 2002858 <== NEVER TAKEN 20027b0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); the_link = *loc; 20027b4: c6 06 60 0c ld [ %i1 + 0xc ], %g3 20027b8: f0 06 60 04 ld [ %i1 + 4 ], %i0 20027bc: c8 06 60 08 ld [ %i1 + 8 ], %g4 20027c0: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 20027c4: c6 27 bf f0 st %g3, [ %fp + -16 ] the_link.node_access = node->info.hard_link.link_node; 20027c8: c2 27 bf e4 st %g1, [ %fp + -28 ] if ( node->type == IMFS_HARD_LINK ) { if ( !node->info.hard_link.link_node ) rtems_set_errno_and_return_minus_one( EINVAL ); the_link = *loc; 20027cc: f0 27 bf e8 st %i0, [ %fp + -24 ] 20027d0: c8 27 bf ec st %g4, [ %fp + -20 ] 20027d4: c4 27 bf f4 st %g2, [ %fp + -12 ] the_link.node_access = node->info.hard_link.link_node; IMFS_Set_handlers( &the_link ); 20027d8: 40 00 21 32 call 200aca0 20027dc: 90 07 bf e4 add %fp, -28, %o0 /* * If removing the last hard link to a node, then we need * to remove the node that is a link and the node itself. */ if ( node->info.hard_link.link_node->st_nlink == 1) 20027e0: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 20027e4: c6 10 60 34 lduh [ %g1 + 0x34 ], %g3 20027e8: 80 a0 e0 01 cmp %g3, 1 20027ec: 02 80 00 10 be 200282c 20027f0: 84 00 ff ff add %g3, -1, %g2 return -1; } else { node->info.hard_link.link_node->st_nlink --; IMFS_update_ctime( node->info.hard_link.link_node ); 20027f4: 90 07 bf f8 add %fp, -8, %o0 if ( result != 0 ) return -1; } else { node->info.hard_link.link_node->st_nlink --; 20027f8: c4 30 60 34 sth %g2, [ %g1 + 0x34 ] IMFS_update_ctime( node->info.hard_link.link_node ); 20027fc: 40 00 01 f3 call 2002fc8 2002800: 92 10 20 00 clr %o1 2002804: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 2002808: c4 07 bf f8 ld [ %fp + -8 ], %g2 /* * Now actually free the node we were asked to free. */ result = (*loc->handlers->rmnod_h)( parentloc, loc ); 200280c: 90 10 00 1c mov %i4, %o0 return -1; } else { node->info.hard_link.link_node->st_nlink --; IMFS_update_ctime( node->info.hard_link.link_node ); 2002810: c4 20 60 48 st %g2, [ %g1 + 0x48 ] /* * Now actually free the node we were asked to free. */ result = (*loc->handlers->rmnod_h)( parentloc, loc ); 2002814: c2 06 60 08 ld [ %i1 + 8 ], %g1 2002818: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200281c: 9f c0 40 00 call %g1 2002820: 92 10 00 19 mov %i1, %o1 return result; } 2002824: 81 c7 e0 08 ret 2002828: 91 e8 00 08 restore %g0, %o0, %o0 * to remove the node that is a link and the node itself. */ if ( node->info.hard_link.link_node->st_nlink == 1) { result = (*the_link.handlers->rmnod_h)( parentloc, &the_link ); 200282c: c2 07 bf ec ld [ %fp + -20 ], %g1 2002830: 90 10 00 1c mov %i4, %o0 2002834: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2002838: 92 07 bf e4 add %fp, -28, %o1 200283c: 9f c0 40 00 call %g1 2002840: b0 10 3f ff mov -1, %i0 if ( result != 0 ) 2002844: 80 a2 20 00 cmp %o0, 0 2002848: 22 bf ff d1 be,a 200278c 200284c: c2 06 60 08 ld [ %i1 + 8 ], %g1 2002850: 81 c7 e0 08 ret 2002854: 81 e8 00 00 restore */ if ( node->type == IMFS_HARD_LINK ) { if ( !node->info.hard_link.link_node ) rtems_set_errno_and_return_minus_one( EINVAL ); 2002858: 40 00 30 af call 200eb14 <__errno> <== NOT EXECUTED 200285c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2002860: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2002864: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2002868: 81 c7 e0 08 ret <== NOT EXECUTED 200286c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02002870 : #include int IMFS_unmount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 2002870: 9d e3 bf a0 save %sp, -96, %sp IMFS_jnode_t *node; node = mt_entry->mt_point_node.node_access; 2002874: c2 06 20 08 ld [ %i0 + 8 ], %g1 /* * Is the node that we are mounting onto a directory node ? */ if ( node->type != IMFS_DIRECTORY ) 2002878: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 200287c: 80 a0 a0 01 cmp %g2, 1 2002880: 12 80 00 09 bne 20028a4 <== NEVER TAKEN 2002884: 01 00 00 00 nop /* * Did the node indicate that there was a directory mounted here? */ if ( node->info.directory.mt_fs == NULL ) 2002888: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 200288c: 80 a0 a0 00 cmp %g2, 0 2002890: 02 80 00 0b be 20028bc <== NEVER TAKEN 2002894: 01 00 00 00 nop /* * Set the mt_fs pointer to indicate that there is no longer * a file system mounted to this point. */ node->info.directory.mt_fs = NULL; 2002898: c0 20 60 5c clr [ %g1 + 0x5c ] return 0; } 200289c: 81 c7 e0 08 ret 20028a0: 91 e8 20 00 restore %g0, 0, %o0 /* * Is the node that we are mounting onto a directory node ? */ if ( node->type != IMFS_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 20028a4: 40 00 30 9c call 200eb14 <__errno> <== NOT EXECUTED 20028a8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20028ac: 82 10 20 14 mov 0x14, %g1 <== NOT EXECUTED 20028b0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20028b4: 81 c7 e0 08 ret <== NOT EXECUTED 20028b8: 81 e8 00 00 restore <== NOT EXECUTED /* * Did the node indicate that there was a directory mounted here? */ if ( node->info.directory.mt_fs == NULL ) rtems_set_errno_and_return_minus_one( EINVAL ); /* XXX */ 20028bc: 40 00 30 96 call 200eb14 <__errno> <== NOT EXECUTED 20028c0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20028c4: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 20028c8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20028cc: 81 c7 e0 08 ret <== NOT EXECUTED 20028d0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020031b4 : void RTEMS_Malloc_Initialize( void *heap_begin, uintptr_t heap_size, size_t sbrk_amount ) { 20031b4: 9d e3 bf a0 save %sp, -96, %sp /* * If configured, initialize the statistics support */ if ( rtems_malloc_statistics_helpers != NULL ) { 20031b8: 03 00 80 6f sethi %hi(0x201bc00), %g1 20031bc: c2 00 63 08 ld [ %g1 + 0x308 ], %g1 ! 201bf08 20031c0: 80 a0 60 00 cmp %g1, 0 20031c4: 02 80 00 05 be 20031d8 20031c8: 01 00 00 00 nop (*rtems_malloc_statistics_helpers->initialize)(); 20031cc: c2 00 40 00 ld [ %g1 ], %g1 20031d0: 9f c0 40 00 call %g1 20031d4: 01 00 00 00 nop } /* * Initialize the garbage collection list to start with nothing on it. */ malloc_deferred_frees_initialize(); 20031d8: 7f ff ff dd call 200314c 20031dc: 01 00 00 00 nop /* * Initialize the optional sbrk support for extending the heap */ if ( rtems_malloc_sbrk_helpers != NULL ) { 20031e0: 03 00 80 6f sethi %hi(0x201bc00), %g1 20031e4: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201bf04 20031e8: 80 a0 60 00 cmp %g1, 0 20031ec: 02 80 00 08 be 200320c 20031f0: 90 10 00 18 mov %i0, %o0 void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( 20031f4: c2 00 40 00 ld [ %g1 ], %g1 heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; 20031f8: b2 06 00 19 add %i0, %i1, %i1 /* * Initialize the optional sbrk support for extending the heap */ if ( rtems_malloc_sbrk_helpers != NULL ) { void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( 20031fc: 9f c0 40 00 call %g1 2003200: 92 10 00 1a mov %i2, %o1 heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; heap_begin = new_heap_begin; 2003204: b0 10 00 08 mov %o0, %i0 void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; 2003208: b2 26 40 08 sub %i1, %o0, %i1 * of the time under UNIX because zero'ing memory when it is first * given to a process eliminates the chance of a process seeing data * left over from another process. This would be a security violation. */ if ( 200320c: 39 00 80 6f sethi %hi(0x201bc00), %i4 2003210: c2 0f 23 0c ldub [ %i4 + 0x30c ], %g1 ! 201bf0c 2003214: 80 a0 60 00 cmp %g1, 0 2003218: 12 80 00 10 bne 2003258 200321c: 3b 00 80 6d sethi %hi(0x201b400), %i5 !rtems_unified_work_area && rtems_configuration_get_do_zero_of_workspace() 2003220: 03 00 80 6d sethi %hi(0x201b400), %g1 2003224: c2 08 62 a4 ldub [ %g1 + 0x2a4 ], %g1 ! 201b6a4 2003228: 80 a0 60 00 cmp %g1, 0 200322c: 12 80 00 13 bne 2003278 2003230: 90 10 00 18 mov %i0, %o0 void *area_begin, uintptr_t area_size, uintptr_t page_size ) { return _Heap_Initialize( heap, area_begin, area_size, page_size ); 2003234: 3b 00 80 6d sethi %hi(0x201b400), %i5 2003238: d0 07 63 60 ld [ %i5 + 0x360 ], %o0 ! 201b760 200323c: 92 10 00 18 mov %i0, %o1 2003240: 94 10 00 19 mov %i1, %o2 2003244: 40 00 12 34 call 2007b14 <_Heap_Initialize> 2003248: 96 10 20 08 mov 8, %o3 RTEMS_Malloc_Heap, heap_begin, heap_size, CPU_HEAP_ALIGNMENT ); if ( status == 0 ) { 200324c: 80 a2 20 00 cmp %o0, 0 2003250: 02 80 00 13 be 200329c 2003254: 01 00 00 00 nop rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); } } MSBUMP( space_available, _Protected_heap_Get_size(RTEMS_Malloc_Heap) ); 2003258: 39 00 80 70 sethi %hi(0x201c000), %i4 200325c: d0 07 63 60 ld [ %i5 + 0x360 ], %o0 2003260: 40 00 15 24 call 20086f0 <_Protected_heap_Get_size> 2003264: fa 07 21 c0 ld [ %i4 + 0x1c0 ], %i5 2003268: ba 02 00 1d add %o0, %i5, %i5 200326c: fa 27 21 c0 st %i5, [ %i4 + 0x1c0 ] } 2003270: 81 c7 e0 08 ret 2003274: 81 e8 00 00 restore if ( !rtems_unified_work_area && rtems_configuration_get_do_zero_of_workspace() ) { memset( heap_begin, 0, heap_size ); 2003278: 92 10 20 00 clr %o1 200327c: 40 00 30 be call 200f574 2003280: 94 10 00 19 mov %i1, %o2 * Unfortunately we cannot use assert if this fails because if this * has failed we do not have a heap and if we do not have a heap * STDIO cannot work because there will be no buffers. */ if ( !rtems_unified_work_area ) { 2003284: c2 0f 23 0c ldub [ %i4 + 0x30c ], %g1 2003288: 80 a0 60 00 cmp %g1, 0 200328c: 22 bf ff eb be,a 2003238 <== ALWAYS TAKEN 2003290: 3b 00 80 6d sethi %hi(0x201b400), %i5 if ( status == 0 ) { rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); } } MSBUMP( space_available, _Protected_heap_Get_size(RTEMS_Malloc_Heap) ); 2003294: 10 bf ff f2 b 200325c <== NOT EXECUTED 2003298: 39 00 80 70 sethi %hi(0x201c000), %i4 <== NOT EXECUTED heap_begin, heap_size, CPU_HEAP_ALIGNMENT ); if ( status == 0 ) { rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); 200329c: 40 00 0f 6f call 2007058 20032a0: 90 10 20 1a mov 0x1a, %o0 =============================================================================== 02001f18 : static rtems_printk_plugin_t print_handler; void Stack_check_Dump_threads_usage( Thread_Control *the_thread ) { 2001f18: 9d e3 bf 98 save %sp, -104, %sp /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { 2001f1c: 80 a6 3f ff cmp %i0, -1 2001f20: 02 80 00 5d be 2002094 2001f24: b6 06 20 b4 add %i0, 0xb4, %i3 current = 0; } else #endif { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); 2001f28: e0 06 21 40 ld [ %i0 + 0x140 ], %l0 2001f2c: f4 06 20 b8 ld [ %i0 + 0xb8 ], %i2 } low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); 2001f30: f8 06 c0 00 ld [ %i3 ], %i4 /* * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; 2001f34: 82 06 a0 20 add %i2, 0x20, %g1 stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); } low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); 2001f38: b8 07 3f f0 add %i4, -16, %i4 * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) 2001f3c: 86 0f 3f fc and %i4, -4, %g3 2001f40: 86 00 40 03 add %g1, %g3, %g3 2001f44: 80 a0 40 03 cmp %g1, %g3 2001f48: 1a 80 00 12 bcc 2001f90 <== NEVER TAKEN 2001f4c: ba 10 20 00 clr %i5 if (*base != U32_PATTERN) 2001f50: c8 06 a0 20 ld [ %i2 + 0x20 ], %g4 2001f54: 05 29 69 69 sethi %hi(0xa5a5a400), %g2 2001f58: 84 10 a1 a5 or %g2, 0x1a5, %g2 ! a5a5a5a5 2001f5c: 80 a1 00 02 cmp %g4, %g2 2001f60: 22 80 00 08 be,a 2001f80 <== ALWAYS TAKEN 2001f64: 82 00 60 04 add %g1, 4, %g1 low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); high_water_mark = Stack_check_find_high_water_mark(low, size); if ( high_water_mark ) 2001f68: 10 80 00 36 b 2002040 <== NOT EXECUTED 2001f6c: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) if (*base != U32_PATTERN) 2001f70: 80 a0 80 04 cmp %g2, %g4 2001f74: 12 80 00 32 bne 200203c 2001f78: ba 10 20 00 clr %i5 * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) 2001f7c: 82 00 60 04 add %g1, 4, %g1 2001f80: 80 a0 c0 01 cmp %g3, %g1 2001f84: 38 bf ff fb bgu,a 2001f70 <== ALWAYS TAKEN 2001f88: c4 00 40 00 ld [ %g1 ], %g2 high_water_mark = Stack_check_find_high_water_mark(low, size); if ( high_water_mark ) used = Stack_check_Calculate_used( low, size, high_water_mark ); else used = 0; 2001f8c: ba 10 20 00 clr %i5 <== NOT EXECUTED #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2001f90: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED 2001f94: 02 80 00 32 be 200205c <== NOT EXECUTED 2001f98: 33 00 80 56 sethi %hi(0x2015800), %i1 <== NOT EXECUTED #endif { (*print_handler)( 2001f9c: e2 06 20 08 ld [ %i0 + 8 ], %l1 2001fa0: 35 00 80 56 sethi %hi(0x2015800), %i2 2001fa4: 33 00 80 56 sethi %hi(0x2015800), %i1 2001fa8: e4 06 a1 44 ld [ %i2 + 0x144 ], %l2 2001fac: f0 06 61 40 ld [ %i1 + 0x140 ], %i0 2001fb0: 94 07 bf f8 add %fp, -8, %o2 2001fb4: 92 10 20 05 mov 5, %o1 2001fb8: 40 00 11 1e call 2006430 2001fbc: 90 10 00 11 mov %l1, %o0 2001fc0: 13 00 80 51 sethi %hi(0x2014400), %o1 2001fc4: 96 10 00 08 mov %o0, %o3 2001fc8: 94 10 00 11 mov %l1, %o2 2001fcc: 90 10 00 12 mov %l2, %o0 2001fd0: 9f c6 00 00 call %i0 2001fd4: 92 12 60 f0 or %o1, 0xf0, %o1 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2001fd8: d4 06 e0 04 ld [ %i3 + 4 ], %o2 2001fdc: d6 06 c0 00 ld [ %i3 ], %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 2001fe0: c2 06 61 40 ld [ %i1 + 0x140 ], %g1 2001fe4: d0 06 a1 44 ld [ %i2 + 0x144 ], %o0 print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2001fe8: 96 02 ff ff add %o3, -1, %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 2001fec: 13 00 80 51 sethi %hi(0x2014400), %o1 2001ff0: 96 02 80 0b add %o2, %o3, %o3 2001ff4: 92 12 61 10 or %o1, 0x110, %o1 2001ff8: 98 10 00 10 mov %l0, %o4 2001ffc: 9f c0 40 00 call %g1 2002000: 9a 10 00 1c mov %i4, %o5 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2002004: 03 00 80 56 sethi %hi(0x2015800), %g1 2002008: c2 00 61 3c ld [ %g1 + 0x13c ], %g1 ! 201593c else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 200200c: 07 00 80 56 sethi %hi(0x2015800), %g3 2002010: 05 00 80 56 sethi %hi(0x2015800), %g2 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2002014: 80 a0 60 00 cmp %g1, 0 (*print_handler)( print_context, "Unavailable\n" ); 2002018: d0 00 a1 44 ld [ %g2 + 0x144 ], %o0 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 200201c: 02 80 00 19 be 2002080 <== NEVER TAKEN 2002020: c2 00 e1 40 ld [ %g3 + 0x140 ], %g1 (*print_handler)( print_context, "Unavailable\n" ); } else { (*print_handler)( print_context, "%8" PRId32 "\n", used ); 2002024: 94 10 00 1d mov %i5, %o2 2002028: 13 00 80 51 sethi %hi(0x2014400), %o1 200202c: 9f c0 40 00 call %g1 2002030: 92 12 61 40 or %o1, 0x140, %o1 ! 2014540 2002034: 81 c7 e0 08 ret 2002038: 81 e8 00 00 restore low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); high_water_mark = Stack_check_find_high_water_mark(low, size); if ( high_water_mark ) 200203c: 80 a0 60 00 cmp %g1, 0 2002040: 02 bf ff d4 be 2001f90 <== NEVER TAKEN 2002044: 80 a6 20 00 cmp %i0, 0 { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); } low = Stack_check_usable_stack_start(stack); 2002048: ba 06 a0 10 add %i2, 0x10, %i5 size = Stack_check_usable_stack_size(stack); high_water_mark = Stack_check_find_high_water_mark(low, size); if ( high_water_mark ) used = Stack_check_Calculate_used( low, size, high_water_mark ); 200204c: ba 07 40 1c add %i5, %i4, %i5 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2002050: 12 bf ff d3 bne 2001f9c 2002054: ba 27 40 01 sub %i5, %g1, %i5 rtems_object_get_name( the_thread->Object.id, sizeof(name), name ) ); } #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); 2002058: 33 00 80 56 sethi %hi(0x2015800), %i1 200205c: 35 00 80 56 sethi %hi(0x2015800), %i2 2002060: c2 06 61 40 ld [ %i1 + 0x140 ], %g1 2002064: d0 06 a1 44 ld [ %i2 + 0x144 ], %o0 2002068: 94 10 3f ff mov -1, %o2 200206c: 13 00 80 51 sethi %hi(0x2014400), %o1 2002070: 9f c0 40 00 call %g1 2002074: 92 12 61 00 or %o1, 0x100, %o1 ! 2014500 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2002078: 10 bf ff d9 b 2001fdc 200207c: d4 06 e0 04 ld [ %i3 + 4 ], %o2 current, size ); if (Stack_check_Initialized == 0) { (*print_handler)( print_context, "Unavailable\n" ); 2002080: 13 00 80 51 sethi %hi(0x2014400), %o1 <== NOT EXECUTED 2002084: 9f c0 40 00 call %g1 <== NOT EXECUTED 2002088: 92 12 61 30 or %o1, 0x130, %o1 ! 2014530 <== NOT EXECUTED 200208c: 81 c7 e0 08 ret <== NOT EXECUTED 2002090: 81 e8 00 00 restore <== NOT EXECUTED /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { if (!Stack_check_Interrupt_stack.area) 2002094: 37 00 80 56 sethi %hi(0x2015800), %i3 2002098: b6 16 e3 dc or %i3, 0x3dc, %i3 ! 2015bdc 200209c: f4 06 e0 04 ld [ %i3 + 4 ], %i2 return; stack = &Stack_check_Interrupt_stack; the_thread = 0; current = 0; 20020a0: a0 10 20 00 clr %l0 /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { if (!Stack_check_Interrupt_stack.area) 20020a4: 80 a6 a0 00 cmp %i2, 0 20020a8: 12 bf ff a2 bne 2001f30 <== ALWAYS TAKEN 20020ac: b0 10 20 00 clr %i0 20020b0: 81 c7 e0 08 ret <== NOT EXECUTED 20020b4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020020b8 : /* * Stack_check_Initialize */ void Stack_check_Initialize( void ) { 20020b8: 9d e3 bf a0 save %sp, -96, %sp static uint32_t pattern[ 4 ] = { 0xFEEDF00D, 0x0BAD0D06, /* FEED FOOD to BAD DOG */ 0xDEADF00D, 0x600D0D06 /* DEAD FOOD but GOOD DOG */ }; if ( Stack_check_Initialized ) 20020bc: 3b 00 80 56 sethi %hi(0x2015800), %i5 20020c0: c2 07 61 3c ld [ %i5 + 0x13c ], %g1 ! 201593c 20020c4: 80 a0 60 00 cmp %g1, 0 20020c8: 12 80 00 20 bne 2002148 20020cc: 07 00 80 56 sethi %hi(0x2015800), %g3 /* * Dope the pattern and fill areas */ p = Stack_check_Pattern.pattern; for ( i = 0; i < PATTERN_SIZE_WORDS; i++ ) { p[i] = pattern[ i%4 ]; 20020d0: 09 3f bb 7c sethi %hi(0xfeedf000), %g4 20020d4: 82 10 e3 cc or %g3, 0x3cc, %g1 20020d8: 88 11 20 0d or %g4, 0xd, %g4 20020dc: c8 20 e3 cc st %g4, [ %g3 + 0x3cc ] 20020e0: 07 02 eb 43 sethi %hi(0xbad0c00), %g3 20020e4: 86 10 e1 06 or %g3, 0x106, %g3 ! bad0d06 /* * If appropriate, setup the interrupt stack for high water testing * also. */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (_CPU_Interrupt_stack_low && _CPU_Interrupt_stack_high) { 20020e8: 05 00 80 57 sethi %hi(0x2015c00), %g2 20020ec: d0 00 a3 dc ld [ %g2 + 0x3dc ], %o0 ! 2015fdc <_Per_CPU_Information> /* * Dope the pattern and fill areas */ p = Stack_check_Pattern.pattern; for ( i = 0; i < PATTERN_SIZE_WORDS; i++ ) { p[i] = pattern[ i%4 ]; 20020f0: c6 20 60 04 st %g3, [ %g1 + 4 ] 20020f4: 07 37 ab 7c sethi %hi(0xdeadf000), %g3 20020f8: 86 10 e0 0d or %g3, 0xd, %g3 ! deadf00d 20020fc: c6 20 60 08 st %g3, [ %g1 + 8 ] 2002100: 07 18 03 43 sethi %hi(0x600d0c00), %g3 2002104: 86 10 e1 06 or %g3, 0x106, %g3 ! 600d0d06 2002108: c6 20 60 0c st %g3, [ %g1 + 0xc ] /* * If appropriate, setup the interrupt stack for high water testing * also. */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (_CPU_Interrupt_stack_low && _CPU_Interrupt_stack_high) { 200210c: 80 a2 20 00 cmp %o0, 0 2002110: 02 80 00 0c be 2002140 <== NEVER TAKEN 2002114: 84 10 a3 dc or %g2, 0x3dc, %g2 2002118: d4 00 a0 04 ld [ %g2 + 4 ], %o2 200211c: 80 a2 a0 00 cmp %o2, 0 2002120: 02 80 00 08 be 2002140 <== NEVER TAKEN 2002124: 03 00 80 56 sethi %hi(0x2015800), %g1 Stack_check_Interrupt_stack.area = _CPU_Interrupt_stack_low; 2002128: 84 10 63 dc or %g1, 0x3dc, %g2 ! 2015bdc Stack_check_Interrupt_stack.size = (char *) _CPU_Interrupt_stack_high - 200212c: 94 22 80 08 sub %o2, %o0, %o2 * If appropriate, setup the interrupt stack for high water testing * also. */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (_CPU_Interrupt_stack_low && _CPU_Interrupt_stack_high) { Stack_check_Interrupt_stack.area = _CPU_Interrupt_stack_low; 2002130: d0 20 a0 04 st %o0, [ %g2 + 4 ] Stack_check_Interrupt_stack.size = (char *) _CPU_Interrupt_stack_high - 2002134: d4 20 63 dc st %o2, [ %g1 + 0x3dc ] (char *) _CPU_Interrupt_stack_low; Stack_check_Dope_stack(&Stack_check_Interrupt_stack); 2002138: 40 00 34 30 call 200f1f8 200213c: 92 10 20 a5 mov 0xa5, %o1 } #endif Stack_check_Initialized = 1; 2002140: 82 10 20 01 mov 1, %g1 2002144: c2 27 61 3c st %g1, [ %i5 + 0x13c ] 2002148: 81 c7 e0 08 ret 200214c: 81 e8 00 00 restore =============================================================================== 020021c0 : Thread_Control *running, bool pattern_ok ) RTEMS_COMPILER_NO_RETURN_ATTRIBUTE; void Stack_check_report_blown_task(Thread_Control *running, bool pattern_ok) { 20021c0: 9d e3 bf 80 save %sp, -128, %sp Stack_Control *stack = &running->Start.Initial_stack; void *pattern_area = Stack_check_Get_pattern(stack); char name[32]; printk("BLOWN STACK!!!\n"); 20021c4: 11 00 80 51 sethi %hi(0x2014400), %o0 ) RTEMS_COMPILER_NO_RETURN_ATTRIBUTE; void Stack_check_report_blown_task(Thread_Control *running, bool pattern_ok) { Stack_Control *stack = &running->Start.Initial_stack; void *pattern_area = Stack_check_Get_pattern(stack); 20021c8: fa 06 20 b8 ld [ %i0 + 0xb8 ], %i5 char name[32]; printk("BLOWN STACK!!!\n"); 20021cc: 40 00 06 96 call 2003c24 20021d0: 90 12 21 48 or %o0, 0x148, %o0 printk("task control block: 0x%08" PRIxPTR "\n", running); 20021d4: 92 10 00 18 mov %i0, %o1 20021d8: 11 00 80 51 sethi %hi(0x2014400), %o0 20021dc: 40 00 06 92 call 2003c24 20021e0: 90 12 21 58 or %o0, 0x158, %o0 ! 2014558 printk("task ID: 0x%08lx\n", (unsigned long) running->Object.id); 20021e4: d2 06 20 08 ld [ %i0 + 8 ], %o1 20021e8: 11 00 80 51 sethi %hi(0x2014400), %o0 20021ec: 40 00 06 8e call 2003c24 20021f0: 90 12 21 78 or %o0, 0x178, %o0 ! 2014578 printk( 20021f4: d2 06 20 0c ld [ %i0 + 0xc ], %o1 20021f8: 11 00 80 51 sethi %hi(0x2014400), %o0 20021fc: 40 00 06 8a call 2003c24 2002200: 90 12 21 90 or %o0, 0x190, %o0 ! 2014590 "task name: 0x%08" PRIx32 "\n", running->Object.name.name_u32 ); printk( 2002204: d0 06 20 08 ld [ %i0 + 8 ], %o0 2002208: 94 07 bf e0 add %fp, -32, %o2 200220c: 40 00 10 89 call 2006430 2002210: 92 10 20 20 mov 0x20, %o1 2002214: 92 10 00 08 mov %o0, %o1 2002218: 11 00 80 51 sethi %hi(0x2014400), %o0 200221c: 40 00 06 82 call 2003c24 2002220: 90 12 21 a8 or %o0, 0x1a8, %o0 ! 20145a8 ); printk( "task stack area (%lu Bytes): 0x%08" PRIxPTR " .. 0x%08" PRIxPTR "\n", (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) 2002224: d4 06 20 b8 ld [ %i0 + 0xb8 ], %o2 2002228: d2 06 20 b4 ld [ %i0 + 0xb4 ], %o1 ); printk( "task name string: %s\n", rtems_object_get_name(running->Object.id, sizeof(name), name) ); printk( 200222c: 11 00 80 51 sethi %hi(0x2014400), %o0 2002230: 96 02 80 09 add %o2, %o1, %o3 2002234: 40 00 06 7c call 2003c24 2002238: 90 12 21 c0 or %o0, 0x1c0, %o0 "task stack area (%lu Bytes): 0x%08" PRIxPTR " .. 0x%08" PRIxPTR "\n", (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) ); if (!pattern_ok) { 200223c: 80 a6 60 00 cmp %i1, 0 2002240: 02 80 00 04 be 2002250 <== ALWAYS TAKEN 2002244: 92 10 20 10 mov 0x10, %o1 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal_error_occurred(0x81); 2002248: 40 00 12 bc call 2006d38 200224c: 90 10 20 81 mov 0x81, %o0 (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) ); if (!pattern_ok) { printk( 2002250: 11 00 80 51 sethi %hi(0x2014400), %o0 2002254: 94 07 60 08 add %i5, 8, %o2 2002258: 90 12 21 f8 or %o0, 0x1f8, %o0 200225c: 40 00 06 72 call 2003c24 2002260: 96 07 60 18 add %i5, 0x18, %o3 2002264: 30 bf ff f9 b,a 2002248 =============================================================================== 0200722c <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 200722c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2007230: 39 00 80 71 sethi %hi(0x201c400), %i4 2007234: fa 07 21 64 ld [ %i4 + 0x164 ], %i5 ! 201c564 <_API_extensions_List> 2007238: b8 17 21 64 or %i4, 0x164, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 200723c: b8 07 20 04 add %i4, 4, %i4 2007240: 80 a7 40 1c cmp %i5, %i4 2007244: 02 80 00 09 be 2007268 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2007248: 01 00 00 00 nop * Currently all APIs configure this hook so it is always non-NULL. */ #if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API) if ( the_extension->postdriver_hook ) #endif (*the_extension->postdriver_hook)(); 200724c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007250: 9f c0 40 00 call %g1 2007254: 01 00 00 00 nop Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 2007258: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 200725c: 80 a7 40 1c cmp %i5, %i4 2007260: 32 bf ff fc bne,a 2007250 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 2007264: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2007268: 81 c7 e0 08 ret 200726c: 81 e8 00 00 restore =============================================================================== 02007270 <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 2007270: 9d e3 bf a0 save %sp, -96, %sp 2007274: 39 00 80 71 sethi %hi(0x201c400), %i4 2007278: fa 07 21 64 ld [ %i4 + 0x164 ], %i5 ! 201c564 <_API_extensions_List> 200727c: b8 17 21 64 or %i4, 0x164, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2007280: b8 07 20 04 add %i4, 4, %i4 2007284: 80 a7 40 1c cmp %i5, %i4 2007288: 02 80 00 0a be 20072b0 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 200728c: 37 00 80 71 sethi %hi(0x201c400), %i3 2007290: b6 16 e1 9c or %i3, 0x19c, %i3 ! 201c59c <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 2007294: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2007298: 9f c0 40 00 call %g1 200729c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 20072a0: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20072a4: 80 a7 40 1c cmp %i5, %i4 20072a8: 32 bf ff fc bne,a 2007298 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 20072ac: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED 20072b0: 81 c7 e0 08 ret 20072b4: 81 e8 00 00 restore =============================================================================== 02010abc <_CORE_message_queue_Initialize>: CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 2010abc: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2010ac0: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2010ac4: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; the_message_queue->maximum_message_size = maximum_message_size; 2010ac8: f6 26 20 4c st %i3, [ %i0 + 0x4c ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2010acc: 80 8e e0 03 btst 3, %i3 2010ad0: 02 80 00 0a be 2010af8 <_CORE_message_queue_Initialize+0x3c> 2010ad4: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 2010ad8: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2010adc: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 2010ae0: 80 a6 c0 1c cmp %i3, %i4 2010ae4: 08 80 00 05 bleu 2010af8 <_CORE_message_queue_Initialize+0x3c><== ALWAYS TAKEN 2010ae8: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010aec: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 2010af0: 81 c7 e0 08 ret 2010af4: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2010af8: b8 07 20 10 add %i4, 0x10, %i4 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2010afc: 90 10 20 00 clr %o0 2010b00: 92 10 00 1a mov %i2, %o1 2010b04: 94 10 20 00 clr %o2 2010b08: 96 10 00 1c mov %i4, %o3 2010b0c: 40 00 41 35 call 2020fe0 <__muldi3> 2010b10: ba 10 20 00 clr %i5 if ( x > SIZE_MAX ) 2010b14: 80 a2 20 00 cmp %o0, 0 2010b18: 34 bf ff f6 bg,a 2010af0 <_CORE_message_queue_Initialize+0x34> 2010b1c: b0 0f 60 01 and %i5, 1, %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2010b20: 40 00 0c d6 call 2013e78 <_Workspace_Allocate> 2010b24: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2010b28: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2010b2c: 80 a2 20 00 cmp %o0, 0 2010b30: 02 bf ff ef be 2010aec <_CORE_message_queue_Initialize+0x30><== NEVER TAKEN 2010b34: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2010b38: 90 06 20 60 add %i0, 0x60, %o0 2010b3c: 94 10 00 1a mov %i2, %o2 2010b40: 40 00 15 71 call 2016104 <_Chain_Initialize> 2010b44: 96 10 00 1c mov %i4, %o3 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2010b48: c4 06 40 00 ld [ %i1 ], %g2 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2010b4c: 82 06 20 50 add %i0, 0x50, %g1 2010b50: 84 18 a0 01 xor %g2, 1, %g2 2010b54: 80 a0 00 02 cmp %g0, %g2 2010b58: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2010b5c: c2 26 20 58 st %g1, [ %i0 + 0x58 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2010b60: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2010b64: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2010b68: c0 26 20 54 clr [ %i0 + 0x54 ] 2010b6c: 92 60 3f ff subx %g0, -1, %o1 2010b70: 94 10 20 80 mov 0x80, %o2 2010b74: 96 10 20 06 mov 6, %o3 2010b78: 40 00 0a 33 call 2013444 <_Thread_queue_Initialize> 2010b7c: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2010b80: b0 0f 60 01 and %i5, 1, %i0 2010b84: 81 c7 e0 08 ret 2010b88: 81 e8 00 00 restore =============================================================================== 020077d0 <_CORE_semaphore_Surrender>: CORE_semaphore_Status _CORE_semaphore_Surrender( CORE_semaphore_Control *the_semaphore, Objects_Id id, CORE_semaphore_API_mp_support_callout api_semaphore_mp_support ) { 20077d0: 9d e3 bf a0 save %sp, -96, %sp 20077d4: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 20077d8: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 20077dc: 40 00 07 9e call 2009654 <_Thread_queue_Dequeue> 20077e0: 90 10 00 1d mov %i5, %o0 20077e4: 80 a2 20 00 cmp %o0, 0 20077e8: 02 80 00 04 be 20077f8 <_CORE_semaphore_Surrender+0x28> 20077ec: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 20077f0: 81 c7 e0 08 ret 20077f4: 81 e8 00 00 restore if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 20077f8: 7f ff ea 7b call 20021e4 20077fc: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2007800: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007804: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2007808: 80 a0 40 02 cmp %g1, %g2 200780c: 1a 80 00 05 bcc 2007820 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2007810: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007814: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007818: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 200781c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007820: 7f ff ea 75 call 20021f4 2007824: 01 00 00 00 nop } return status; } 2007828: 81 c7 e0 08 ret 200782c: 81 e8 00 00 restore =============================================================================== 0200c868 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 200c868: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; 200c86c: c0 26 20 04 clr [ %i0 + 4 ] size_t node_size ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 200c870: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c874: 80 a6 a0 00 cmp %i2, 0 200c878: 02 80 00 12 be 200c8c0 <_Chain_Initialize+0x58> <== NEVER TAKEN 200c87c: 90 10 00 18 mov %i0, %o0 200c880: b4 06 bf ff add %i2, -1, %i2 { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; 200c884: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 200c888: 92 10 00 1a mov %i2, %o1 ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 200c88c: 10 80 00 05 b 200c8a0 <_Chain_Initialize+0x38> 200c890: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c894: 84 10 00 01 mov %g1, %g2 200c898: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 200c89c: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 200c8a0: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200c8a4: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c8a8: 80 a6 a0 00 cmp %i2, 0 200c8ac: 12 bf ff fa bne 200c894 <_Chain_Initialize+0x2c> 200c8b0: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200c8b4: 40 00 2b d8 call 2017814 <.umul> 200c8b8: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200c8bc: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200c8c0: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 200c8c4: d0 26 20 08 st %o0, [ %i0 + 8 ] } 200c8c8: 81 c7 e0 08 ret 200c8cc: 81 e8 00 00 restore =============================================================================== 020064b0 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 20064b0: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20064b4: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 20064b8: 7f ff ef 4b call 20021e4 20064bc: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 20064c0: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 20064c4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 20064c8: 86 88 40 02 andcc %g1, %g2, %g3 20064cc: 02 80 00 39 be 20065b0 <_Event_Surrender+0x100> 20064d0: 09 00 80 71 sethi %hi(0x201c400), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 20064d4: 88 11 21 9c or %g4, 0x19c, %g4 ! 201c59c <_Per_CPU_Information> 20064d8: f2 01 20 08 ld [ %g4 + 8 ], %i1 20064dc: 80 a6 60 00 cmp %i1, 0 20064e0: 32 80 00 1c bne,a 2006550 <_Event_Surrender+0xa0> 20064e4: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 20064e8: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 20064ec: 80 89 21 00 btst 0x100, %g4 20064f0: 02 80 00 30 be 20065b0 <_Event_Surrender+0x100> 20064f4: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20064f8: 02 80 00 04 be 2006508 <_Event_Surrender+0x58> 20064fc: 80 8f 20 02 btst 2, %i4 2006500: 02 80 00 2c be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN 2006504: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006508: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear( rtems_event_set the_event_set, rtems_event_set the_mask ) { return ( the_event_set & ~(the_mask) ); 200650c: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2006510: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2006514: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006518: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 200651c: 7f ff ef 36 call 20021f4 2006520: 01 00 00 00 nop 2006524: 7f ff ef 30 call 20021e4 2006528: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 200652c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2006530: 80 a0 60 02 cmp %g1, 2 2006534: 02 80 00 21 be 20065b8 <_Event_Surrender+0x108> 2006538: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 200653c: 7f ff ef 2e call 20021f4 2006540: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006544: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2006548: 40 00 0a 74 call 2008f18 <_Thread_Clear_state> 200654c: 81 e8 00 00 restore /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 2006550: 80 a6 00 04 cmp %i0, %g4 2006554: 32 bf ff e6 bne,a 20064ec <_Event_Surrender+0x3c> 2006558: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200655c: 09 00 80 71 sethi %hi(0x201c400), %g4 2006560: f2 01 21 f0 ld [ %g4 + 0x1f0 ], %i1 ! 201c5f0 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 2006564: 80 a6 60 02 cmp %i1, 2 2006568: 02 80 00 07 be 2006584 <_Event_Surrender+0xd4> <== NEVER TAKEN 200656c: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006570: f2 01 21 f0 ld [ %g4 + 0x1f0 ], %i1 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006574: 80 a6 60 01 cmp %i1, 1 2006578: 32 bf ff dd bne,a 20064ec <_Event_Surrender+0x3c> 200657c: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2006580: 80 a0 40 03 cmp %g1, %g3 2006584: 02 80 00 04 be 2006594 <_Event_Surrender+0xe4> 2006588: 80 8f 20 02 btst 2, %i4 200658c: 02 80 00 09 be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN 2006590: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006594: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2006598: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 200659c: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 20065a0: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20065a4: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 20065a8: 82 10 20 03 mov 3, %g1 20065ac: c2 21 21 f0 st %g1, [ %g4 + 0x1f0 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 20065b0: 7f ff ef 11 call 20021f4 20065b4: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 20065b8: c2 26 20 50 st %g1, [ %i0 + 0x50 ] if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 20065bc: 7f ff ef 0e call 20021f4 20065c0: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 20065c4: 40 00 0f 5b call 200a330 <_Watchdog_Remove> 20065c8: 90 06 20 48 add %i0, 0x48, %o0 20065cc: b2 16 63 f8 or %i1, 0x3f8, %i1 20065d0: 40 00 0a 52 call 2008f18 <_Thread_Clear_state> 20065d4: 81 e8 00 00 restore =============================================================================== 020065d8 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 20065d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 20065dc: 90 10 00 18 mov %i0, %o0 20065e0: 40 00 0b 50 call 2009320 <_Thread_Get> 20065e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20065e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20065ec: 80 a0 60 00 cmp %g1, 0 20065f0: 12 80 00 16 bne 2006648 <_Event_Timeout+0x70> <== NEVER TAKEN 20065f4: ba 10 00 08 mov %o0, %i5 * * If it is not satisfied, then it is "nothing happened" and * this is the "timeout" transition. After a request is satisfied, * a timeout is not allowed to occur. */ _ISR_Disable( level ); 20065f8: 7f ff ee fb call 20021e4 20065fc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006600: 03 00 80 71 sethi %hi(0x201c400), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2006604: c2 00 61 a8 ld [ %g1 + 0x1a8 ], %g1 ! 201c5a8 <_Per_CPU_Information+0xc> 2006608: 80 a7 40 01 cmp %i5, %g1 200660c: 02 80 00 11 be 2006650 <_Event_Timeout+0x78> 2006610: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006614: 82 10 20 06 mov 6, %g1 2006618: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 200661c: 7f ff ee f6 call 20021f4 2006620: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006624: 90 10 00 1d mov %i5, %o0 2006628: 13 04 00 ff sethi %hi(0x1003fc00), %o1 200662c: 40 00 0a 3b call 2008f18 <_Thread_Clear_state> 2006630: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2006634: 03 00 80 70 sethi %hi(0x201c000), %g1 2006638: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201c370 <_Thread_Dispatch_disable_level> 200663c: 84 00 bf ff add %g2, -1, %g2 2006640: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2006644: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 2006648: 81 c7 e0 08 ret 200664c: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 2006650: 03 00 80 71 sethi %hi(0x201c400), %g1 2006654: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 201c5f0 <_Event_Sync_state> 2006658: 80 a0 a0 01 cmp %g2, 1 200665c: 32 bf ff ef bne,a 2006618 <_Event_Timeout+0x40> 2006660: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006664: 84 10 20 02 mov 2, %g2 2006668: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 200666c: 10 bf ff eb b 2006618 <_Event_Timeout+0x40> 2006670: 82 10 20 06 mov 6, %g1 =============================================================================== 0200ca90 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200ca90: 9d e3 bf 98 save %sp, -104, %sp 200ca94: ba 10 00 18 mov %i0, %i5 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200ca98: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200ca9c: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200caa0: 80 a6 40 10 cmp %i1, %l0 200caa4: 18 80 00 23 bgu 200cb30 <_Heap_Allocate_aligned_with_boundary+0xa0> 200caa8: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200caac: 80 a6 e0 00 cmp %i3, 0 200cab0: 12 80 00 7d bne 200cca4 <_Heap_Allocate_aligned_with_boundary+0x214> 200cab4: 80 a6 40 1b cmp %i1, %i3 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200cab8: e2 07 60 08 ld [ %i5 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200cabc: 80 a7 40 11 cmp %i5, %l1 200cac0: 02 80 00 18 be 200cb20 <_Heap_Allocate_aligned_with_boundary+0x90> 200cac4: b8 10 20 00 clr %i4 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200cac8: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200cacc: ae 10 20 04 mov 4, %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; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200cad0: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200cad4: 10 80 00 0b b 200cb00 <_Heap_Allocate_aligned_with_boundary+0x70> 200cad8: ae 25 c0 19 sub %l7, %i1, %l7 * 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 ) { if ( alignment == 0 ) { 200cadc: 12 80 00 17 bne 200cb38 <_Heap_Allocate_aligned_with_boundary+0xa8> 200cae0: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cae4: 80 a6 20 00 cmp %i0, 0 200cae8: 12 80 00 5b bne 200cc54 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200caec: b8 07 20 01 inc %i4 break; } block = block->next; 200caf0: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200caf4: 80 a7 40 11 cmp %i5, %l1 200caf8: 22 80 00 0b be,a 200cb24 <_Heap_Allocate_aligned_with_boundary+0x94> 200cafc: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 /* * 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 ) { 200cb00: e4 04 60 04 ld [ %l1 + 4 ], %l2 200cb04: 80 a4 00 12 cmp %l0, %l2 200cb08: 0a bf ff f5 bcs 200cadc <_Heap_Allocate_aligned_with_boundary+0x4c> 200cb0c: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200cb10: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200cb14: 80 a7 40 11 cmp %i5, %l1 200cb18: 12 bf ff fa bne 200cb00 <_Heap_Allocate_aligned_with_boundary+0x70> 200cb1c: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200cb20: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200cb24: 80 a0 40 1c cmp %g1, %i4 200cb28: 0a 80 00 5a bcs 200cc90 <_Heap_Allocate_aligned_with_boundary+0x200> 200cb2c: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200cb30: 81 c7 e0 08 ret 200cb34: 81 e8 00 00 restore 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; 200cb38: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 200cb3c: ea 07 60 14 ld [ %i5 + 0x14 ], %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; 200cb40: a4 0c bf fe and %l2, -2, %l2 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; 200cb44: 82 20 80 15 sub %g2, %l5, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200cb48: a4 04 40 12 add %l1, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200cb4c: 92 10 00 1a mov %i2, %o1 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; 200cb50: b0 05 c0 12 add %l7, %l2, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200cb54: a4 00 40 12 add %g1, %l2, %l2 200cb58: 40 00 2c 15 call 2017bac <.urem> 200cb5c: 90 10 00 18 mov %i0, %o0 200cb60: 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 ) { 200cb64: 80 a4 80 18 cmp %l2, %i0 200cb68: 1a 80 00 06 bcc 200cb80 <_Heap_Allocate_aligned_with_boundary+0xf0> 200cb6c: a8 04 60 08 add %l1, 8, %l4 200cb70: 90 10 00 12 mov %l2, %o0 200cb74: 40 00 2c 0e call 2017bac <.urem> 200cb78: 92 10 00 1a mov %i2, %o1 200cb7c: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200cb80: 80 a6 e0 00 cmp %i3, 0 200cb84: 02 80 00 24 be 200cc14 <_Heap_Allocate_aligned_with_boundary+0x184> 200cb88: 80 a5 00 18 cmp %l4, %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; 200cb8c: a4 06 00 19 add %i0, %i1, %l2 200cb90: 92 10 00 1b mov %i3, %o1 200cb94: 40 00 2c 06 call 2017bac <.urem> 200cb98: 90 10 00 12 mov %l2, %o0 200cb9c: 90 24 80 08 sub %l2, %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 ) { 200cba0: 80 a6 00 08 cmp %i0, %o0 200cba4: 1a 80 00 1b bcc 200cc10 <_Heap_Allocate_aligned_with_boundary+0x180> 200cba8: 80 a2 00 12 cmp %o0, %l2 200cbac: 1a 80 00 1a bcc 200cc14 <_Heap_Allocate_aligned_with_boundary+0x184> 200cbb0: 80 a5 00 18 cmp %l4, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200cbb4: a6 05 00 19 add %l4, %i1, %l3 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200cbb8: 80 a4 c0 08 cmp %l3, %o0 200cbbc: 08 80 00 08 bleu 200cbdc <_Heap_Allocate_aligned_with_boundary+0x14c> 200cbc0: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cbc4: 10 bf ff c9 b 200cae8 <_Heap_Allocate_aligned_with_boundary+0x58> 200cbc8: 80 a6 20 00 cmp %i0, 0 /* 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 ) { 200cbcc: 1a 80 00 11 bcc 200cc10 <_Heap_Allocate_aligned_with_boundary+0x180> 200cbd0: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200cbd4: 18 bf ff c4 bgu 200cae4 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200cbd8: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200cbdc: b0 22 00 19 sub %o0, %i1, %i0 200cbe0: 92 10 00 1a mov %i2, %o1 200cbe4: 40 00 2b f2 call 2017bac <.urem> 200cbe8: 90 10 00 18 mov %i0, %o0 200cbec: 92 10 00 1b mov %i3, %o1 200cbf0: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200cbf4: a4 06 00 19 add %i0, %i1, %l2 200cbf8: 40 00 2b ed call 2017bac <.urem> 200cbfc: 90 10 00 12 mov %l2, %o0 200cc00: 90 24 80 08 sub %l2, %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 ) { 200cc04: 80 a2 00 12 cmp %o0, %l2 200cc08: 0a bf ff f1 bcs 200cbcc <_Heap_Allocate_aligned_with_boundary+0x13c> 200cc0c: 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 ) { 200cc10: 80 a5 00 18 cmp %l4, %i0 200cc14: 18 80 00 22 bgu 200cc9c <_Heap_Allocate_aligned_with_boundary+0x20c> 200cc18: 82 10 3f f8 mov -8, %g1 200cc1c: 90 10 00 18 mov %i0, %o0 200cc20: a4 20 40 11 sub %g1, %l1, %l2 200cc24: 92 10 00 16 mov %l6, %o1 200cc28: 40 00 2b e1 call 2017bac <.urem> 200cc2c: a4 04 80 18 add %l2, %i0, %l2 uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; if ( free_size >= min_block_size || free_size == 0 ) { 200cc30: 90 a4 80 08 subcc %l2, %o0, %o0 200cc34: 02 bf ff ad be 200cae8 <_Heap_Allocate_aligned_with_boundary+0x58> 200cc38: 80 a6 20 00 cmp %i0, 0 200cc3c: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200cc40: 82 40 3f ff addx %g0, -1, %g1 200cc44: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200cc48: 80 a6 20 00 cmp %i0, 0 200cc4c: 02 bf ff a9 be 200caf0 <_Heap_Allocate_aligned_with_boundary+0x60> 200cc50: b8 07 20 01 inc %i4 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200cc54: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200cc58: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200cc5c: 84 00 a0 01 inc %g2 stats->searches += search_count; 200cc60: 82 00 40 1c add %g1, %i4, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200cc64: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200cc68: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200cc6c: 90 10 00 1d mov %i5, %o0 200cc70: 92 10 00 11 mov %l1, %o1 200cc74: 94 10 00 18 mov %i0, %o2 200cc78: 7f ff eb fb call 2007c64 <_Heap_Block_allocate> 200cc7c: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200cc80: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200cc84: 80 a0 40 1c cmp %g1, %i4 200cc88: 1a 80 00 03 bcc 200cc94 <_Heap_Allocate_aligned_with_boundary+0x204> 200cc8c: 01 00 00 00 nop stats->max_search = search_count; 200cc90: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200cc94: 81 c7 e0 08 ret 200cc98: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200cc9c: 10 bf ff 92 b 200cae4 <_Heap_Allocate_aligned_with_boundary+0x54> 200cca0: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200cca4: 18 bf ff a3 bgu 200cb30 <_Heap_Allocate_aligned_with_boundary+0xa0> 200cca8: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200ccac: 22 bf ff 83 be,a 200cab8 <_Heap_Allocate_aligned_with_boundary+0x28> 200ccb0: b4 10 00 16 mov %l6, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200ccb4: 10 bf ff 82 b 200cabc <_Heap_Allocate_aligned_with_boundary+0x2c> 200ccb8: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200c898 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200c898: 9d e3 bf 98 save %sp, -104, %sp Heap_Block *start_block = first_block; Heap_Block *merge_below_block = NULL; Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; 200c89c: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200c8a0: c0 27 bf fc clr [ %fp + -4 ] uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; 200c8a4: ba 06 40 1a add %i1, %i2, %i5 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200c8a8: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200c8ac: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200c8b0: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 200c8b4: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200c8b8: 80 a6 40 1d cmp %i1, %i5 200c8bc: 08 80 00 05 bleu 200c8d0 <_Heap_Extend+0x38> 200c8c0: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200c8c4: b0 0c 60 01 and %l1, 1, %i0 200c8c8: 81 c7 e0 08 ret 200c8cc: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200c8d0: 90 10 00 19 mov %i1, %o0 200c8d4: 92 10 00 1a mov %i2, %o1 200c8d8: 94 10 00 10 mov %l0, %o2 200c8dc: 98 07 bf f8 add %fp, -8, %o4 200c8e0: 7f ff eb a8 call 2007780 <_Heap_Get_first_and_last_block> 200c8e4: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200c8e8: 80 8a 20 ff btst 0xff, %o0 200c8ec: 02 bf ff f6 be 200c8c4 <_Heap_Extend+0x2c> 200c8f0: aa 10 20 00 clr %l5 200c8f4: a2 10 00 1c mov %i4, %l1 200c8f8: ac 10 20 00 clr %l6 200c8fc: a6 10 20 00 clr %l3 200c900: 10 80 00 14 b 200c950 <_Heap_Extend+0xb8> 200c904: a8 10 20 00 clr %l4 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200c908: 2a 80 00 02 bcs,a 200c910 <_Heap_Extend+0x78> 200c90c: ac 10 00 11 mov %l1, %l6 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200c910: 90 10 00 1a mov %i2, %o0 200c914: 40 00 16 bd call 2012408 <.urem> 200c918: 92 10 00 10 mov %l0, %o1 200c91c: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c920: 80 a6 80 19 cmp %i2, %i1 200c924: 02 80 00 1c be 200c994 <_Heap_Extend+0xfc> 200c928: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200c92c: 80 a6 40 1a cmp %i1, %i2 200c930: 38 80 00 02 bgu,a 200c938 <_Heap_Extend+0xa0> 200c934: aa 10 00 01 mov %g1, %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; 200c938: e2 00 60 04 ld [ %g1 + 4 ], %l1 200c93c: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c940: a2 04 40 01 add %l1, %g1, %l1 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200c944: 80 a7 00 11 cmp %i4, %l1 200c948: 22 80 00 1b be,a 200c9b4 <_Heap_Extend+0x11c> 200c94c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200c950: 80 a4 40 1c cmp %l1, %i4 200c954: 02 80 00 66 be 200caec <_Heap_Extend+0x254> 200c958: 82 10 00 11 mov %l1, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200c95c: 80 a0 40 1d cmp %g1, %i5 200c960: 0a 80 00 70 bcs 200cb20 <_Heap_Extend+0x288> 200c964: f4 04 40 00 ld [ %l1 ], %i2 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200c968: 80 a0 40 1d cmp %g1, %i5 200c96c: 12 bf ff e7 bne 200c908 <_Heap_Extend+0x70> 200c970: 80 a7 40 1a cmp %i5, %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200c974: 90 10 00 1a mov %i2, %o0 200c978: 40 00 16 a4 call 2012408 <.urem> 200c97c: 92 10 00 10 mov %l0, %o1 200c980: 82 06 bf f8 add %i2, -8, %g1 200c984: a8 10 00 11 mov %l1, %l4 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c988: 80 a6 80 19 cmp %i2, %i1 200c98c: 12 bf ff e8 bne 200c92c <_Heap_Extend+0x94> <== ALWAYS TAKEN 200c990: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200c994: fa 24 40 00 st %i5, [ %l1 ] - 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; 200c998: e2 00 60 04 ld [ %g1 + 4 ], %l1 200c99c: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c9a0: a2 04 40 01 add %l1, %g1, %l1 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200c9a4: 80 a7 00 11 cmp %i4, %l1 200c9a8: 12 bf ff ea bne 200c950 <_Heap_Extend+0xb8> <== NEVER TAKEN 200c9ac: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200c9b0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200c9b4: 80 a6 40 01 cmp %i1, %g1 200c9b8: 3a 80 00 55 bcc,a 200cb0c <_Heap_Extend+0x274> 200c9bc: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200c9c0: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200c9c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 200c9c8: c4 07 bf fc ld [ %fp + -4 ], %g2 extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200c9cc: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200c9d0: 86 20 80 01 sub %g2, %g1, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; 200c9d4: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200c9d8: b8 10 e0 01 or %g3, 1, %i4 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 200c9dc: f8 20 60 04 st %i4, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200c9e0: c6 20 80 00 st %g3, [ %g2 ] extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 200c9e4: 80 a1 00 01 cmp %g4, %g1 200c9e8: 08 80 00 43 bleu 200caf4 <_Heap_Extend+0x25c> 200c9ec: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200c9f0: c2 26 20 20 st %g1, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200c9f4: 80 a5 20 00 cmp %l4, 0 200c9f8: 02 80 00 63 be 200cb84 <_Heap_Extend+0x2ec> 200c9fc: b2 06 60 08 add %i1, 8, %i1 Heap_Control *heap, uintptr_t extend_area_begin, Heap_Block *first_block ) { uintptr_t const page_size = heap->page_size; 200ca00: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200ca04: 92 10 00 1c mov %i4, %o1 200ca08: 40 00 16 80 call 2012408 <.urem> 200ca0c: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200ca10: 80 a2 20 00 cmp %o0, 0 200ca14: 02 80 00 04 be 200ca24 <_Heap_Extend+0x18c> 200ca18: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200ca1c: b2 06 40 1c add %i1, %i4, %i1 200ca20: b2 26 40 08 sub %i1, %o0, %i1 uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = 200ca24: 82 06 7f f8 add %i1, -8, %g1 uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; 200ca28: c4 26 7f f8 st %g2, [ %i1 + -8 ] uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = new_first_block_alloc_begin - HEAP_BLOCK_HEADER_SIZE; uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = 200ca2c: 84 25 00 01 sub %l4, %g1, %g2 first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; new_first_block->size_and_flag = new_first_block_size | HEAP_PREV_BLOCK_USED; 200ca30: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200ca34: 90 10 00 18 mov %i0, %o0 200ca38: 92 10 00 01 mov %g1, %o1 200ca3c: 7f ff ff 8d call 200c870 <_Heap_Free_block> 200ca40: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200ca44: 80 a4 e0 00 cmp %l3, 0 200ca48: 02 80 00 3b be 200cb34 <_Heap_Extend+0x29c> 200ca4c: ba 07 7f f8 add %i5, -8, %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200ca50: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 uintptr_t extend_area_end ) { uintptr_t const page_size = heap->page_size; uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const last_block_new_size = _Heap_Align_down( 200ca54: ba 27 40 13 sub %i5, %l3, %i5 200ca58: 40 00 16 6c call 2012408 <.urem> 200ca5c: 90 10 00 1d mov %i5, %o0 ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = (last_block->size_and_flag - last_block_new_size) 200ca60: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200ca64: ba 27 40 08 sub %i5, %o0, %i5 200ca68: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200ca6c: 82 10 60 01 or %g1, 1, %g1 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200ca70: 84 07 40 13 add %i5, %l3, %g2 200ca74: c2 20 a0 04 st %g1, [ %g2 + 4 ] RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200ca78: c2 04 e0 04 ld [ %l3 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 200ca7c: 90 10 00 18 mov %i0, %o0 200ca80: 82 08 60 01 and %g1, 1, %g1 200ca84: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200ca88: ba 17 40 01 or %i5, %g1, %i5 200ca8c: 7f ff ff 79 call 200c870 <_Heap_Free_block> 200ca90: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200ca94: 80 a4 e0 00 cmp %l3, 0 200ca98: 02 80 00 34 be 200cb68 <_Heap_Extend+0x2d0> 200ca9c: 80 a5 20 00 cmp %l4, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200caa0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200caa4: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200caa8: c4 00 60 04 ld [ %g1 + 4 ], %g2 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200caac: 86 20 c0 01 sub %g3, %g1, %g3 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200cab0: 84 08 a0 01 and %g2, 1, %g2 block->size_and_flag = size | flag; 200cab4: 84 10 80 03 or %g2, %g3, %g2 200cab8: c4 20 60 04 st %g2, [ %g1 + 4 ] _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200cabc: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200cac0: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200cac4: a2 10 20 01 mov 1, %l1 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200cac8: a4 20 80 12 sub %g2, %l2, %l2 /* Statistics */ stats->size += extended_size; 200cacc: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200cad0: 80 a6 e0 00 cmp %i3, 0 200cad4: 02 bf ff 7c be 200c8c4 <_Heap_Extend+0x2c> <== NEVER TAKEN 200cad8: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200cadc: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200cae0: b0 0c 60 01 and %l1, 1, %i0 200cae4: 81 c7 e0 08 ret 200cae8: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200caec: 10 bf ff 9c b 200c95c <_Heap_Extend+0xc4> 200caf0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200caf4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200caf8: 80 a0 40 02 cmp %g1, %g2 200cafc: 2a bf ff be bcs,a 200c9f4 <_Heap_Extend+0x15c> 200cb00: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200cb04: 10 bf ff bd b 200c9f8 <_Heap_Extend+0x160> 200cb08: 80 a5 20 00 cmp %l4, 0 start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); if ( extend_area_begin < heap->area_begin ) { heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { 200cb0c: 80 a7 40 01 cmp %i5, %g1 200cb10: 38 bf ff ad bgu,a 200c9c4 <_Heap_Extend+0x12c> 200cb14: fa 26 20 1c st %i5, [ %i0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200cb18: 10 bf ff ac b 200c9c8 <_Heap_Extend+0x130> 200cb1c: c2 07 bf f8 ld [ %fp + -8 ], %g1 (uintptr_t) start_block : heap->area_begin; uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200cb20: 80 a6 40 1a cmp %i1, %i2 200cb24: 1a bf ff 92 bcc 200c96c <_Heap_Extend+0xd4> 200cb28: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200cb2c: 10 bf ff 66 b 200c8c4 <_Heap_Extend+0x2c> 200cb30: a2 10 20 00 clr %l1 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200cb34: 80 a5 60 00 cmp %l5, 0 200cb38: 02 bf ff d7 be 200ca94 <_Heap_Extend+0x1fc> 200cb3c: c4 07 bf f8 ld [ %fp + -8 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200cb40: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200cb44: c2 07 bf fc ld [ %fp + -4 ], %g1 200cb48: 86 08 e0 01 and %g3, 1, %g3 ) { uintptr_t const link_begin = (uintptr_t) link; uintptr_t const first_block_begin = (uintptr_t) first_block; _Heap_Block_set_size( link, first_block_begin - link_begin ); 200cb4c: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200cb50: 84 10 c0 02 or %g3, %g2, %g2 200cb54: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200cb58: c4 00 60 04 ld [ %g1 + 4 ], %g2 200cb5c: 84 10 a0 01 or %g2, 1, %g2 200cb60: 10 bf ff cd b 200ca94 <_Heap_Extend+0x1fc> 200cb64: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200cb68: 32 bf ff cf bne,a 200caa4 <_Heap_Extend+0x20c> 200cb6c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200cb70: d2 07 bf f8 ld [ %fp + -8 ], %o1 200cb74: 7f ff ff 3f call 200c870 <_Heap_Free_block> 200cb78: 90 10 00 18 mov %i0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200cb7c: 10 bf ff ca b 200caa4 <_Heap_Extend+0x20c> 200cb80: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200cb84: 80 a5 a0 00 cmp %l6, 0 200cb88: 02 bf ff b0 be 200ca48 <_Heap_Extend+0x1b0> 200cb8c: 80 a4 e0 00 cmp %l3, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 200cb90: ac 25 80 02 sub %l6, %g2, %l6 200cb94: ac 15 a0 01 or %l6, 1, %l6 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 200cb98: 10 bf ff ac b 200ca48 <_Heap_Extend+0x1b0> 200cb9c: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200ccbc <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200ccbc: 9d e3 bf a0 save %sp, -96, %sp /* * If NULL return true so a free on NULL is considered a valid release. This * is a special case that could be handled by the in heap check how-ever that * would result in false being returned which is wrong. */ if ( alloc_begin_ptr == NULL ) { 200ccc0: 80 a6 60 00 cmp %i1, 0 200ccc4: 02 80 00 56 be 200ce1c <_Heap_Free+0x160> 200ccc8: 84 10 20 01 mov 1, %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200cccc: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200ccd0: 40 00 2b b7 call 2017bac <.urem> 200ccd4: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 200ccd8: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200ccdc: ba 06 7f f8 add %i1, -8, %i5 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200cce0: ba 27 40 08 sub %i5, %o0, %i5 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; 200cce4: 80 a7 40 01 cmp %i5, %g1 200cce8: 0a 80 00 4d bcs 200ce1c <_Heap_Free+0x160> 200ccec: 84 10 20 00 clr %g2 200ccf0: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200ccf4: 80 a7 40 04 cmp %i5, %g4 200ccf8: 38 80 00 4a bgu,a 200ce20 <_Heap_Free+0x164> 200ccfc: b0 08 a0 01 and %g2, 1, %i0 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cd00: de 07 60 04 ld [ %i5 + 4 ], %o7 - 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; 200cd04: b2 0b ff fe and %o7, -2, %i1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200cd08: 86 06 40 1d add %i1, %i5, %g3 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; 200cd0c: 80 a0 40 03 cmp %g1, %g3 200cd10: 38 80 00 44 bgu,a 200ce20 <_Heap_Free+0x164> <== NEVER TAKEN 200cd14: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cd18: 80 a1 00 03 cmp %g4, %g3 200cd1c: 2a 80 00 41 bcs,a 200ce20 <_Heap_Free+0x164> <== NEVER TAKEN 200cd20: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200cd24: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200cd28: 80 8b 60 01 btst 1, %o5 200cd2c: 02 80 00 3c be 200ce1c <_Heap_Free+0x160> 200cd30: 98 0b 7f fe and %o5, -2, %o4 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200cd34: 80 a1 00 03 cmp %g4, %g3 200cd38: 02 80 00 06 be 200cd50 <_Heap_Free+0x94> 200cd3c: 9a 10 20 00 clr %o5 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cd40: 84 00 c0 0c add %g3, %o4, %g2 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; 200cd44: da 00 a0 04 ld [ %g2 + 4 ], %o5 200cd48: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200cd4c: 9a 1b 60 01 xor %o5, 1, %o5 next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200cd50: 80 8b e0 01 btst 1, %o7 200cd54: 12 80 00 1c bne 200cdc4 <_Heap_Free+0x108> 200cd58: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200cd5c: d6 07 40 00 ld [ %i5 ], %o3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200cd60: 9e 27 40 0b sub %i5, %o3, %o7 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; 200cd64: 80 a0 40 0f cmp %g1, %o7 200cd68: 18 80 00 2d bgu 200ce1c <_Heap_Free+0x160> <== NEVER TAKEN 200cd6c: 84 10 20 00 clr %g2 200cd70: 80 a1 00 0f cmp %g4, %o7 200cd74: 2a 80 00 2b bcs,a 200ce20 <_Heap_Free+0x164> <== NEVER TAKEN 200cd78: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 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; 200cd7c: c2 03 e0 04 ld [ %o7 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200cd80: 80 88 60 01 btst 1, %g1 200cd84: 02 80 00 26 be 200ce1c <_Heap_Free+0x160> <== NEVER TAKEN 200cd88: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200cd8c: 02 80 00 39 be 200ce70 <_Heap_Free+0x1b4> 200cd90: 96 06 40 0b add %i1, %o3, %o3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cd94: c2 00 e0 08 ld [ %g3 + 8 ], %g1 200cd98: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200cd9c: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 200cda0: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200cda4: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200cda8: 82 00 ff ff add %g3, -1, %g1 200cdac: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 200cdb0: 98 02 c0 0c add %o3, %o4, %o4 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cdb4: 82 13 20 01 or %o4, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200cdb8: d8 23 00 0f st %o4, [ %o4 + %o7 ] if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cdbc: 10 80 00 0e b 200cdf4 <_Heap_Free+0x138> 200cdc0: c2 23 e0 04 st %g1, [ %o7 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200cdc4: 22 80 00 19 be,a 200ce28 <_Heap_Free+0x16c> 200cdc8: c4 06 20 08 ld [ %i0 + 8 ], %g2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200cdcc: c4 00 e0 08 ld [ %g3 + 8 ], %g2 200cdd0: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 200cdd4: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200cdd8: c2 27 60 0c st %g1, [ %i5 + 0xc ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; 200cddc: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200cde0: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200cde4: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cde8: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200cdec: d8 23 00 1d st %o4, [ %o4 + %i5 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200cdf0: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cdf4: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200cdf8: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200cdfc: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ce00: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200ce04: 82 00 60 01 inc %g1 stats->free_size += block_size; 200ce08: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ce0c: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200ce10: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200ce14: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200ce18: 84 10 20 01 mov 1, %g2 } 200ce1c: b0 08 a0 01 and %g2, 1, %i0 200ce20: 81 c7 e0 08 ret 200ce24: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200ce28: 82 16 60 01 or %i1, 1, %g1 200ce2c: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ce30: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200ce34: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200ce38: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200ce3c: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200ce40: fa 20 a0 0c st %i5, [ %g2 + 0xc ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ce44: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200ce48: f2 26 40 1d st %i1, [ %i1 + %i5 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ce4c: c4 20 e0 04 st %g2, [ %g3 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { 200ce50: c4 06 20 3c ld [ %i0 + 0x3c ], %g2 block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200ce54: 82 00 60 01 inc %g1 { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; block_before->next = new_block; 200ce58: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200ce5c: 80 a0 40 02 cmp %g1, %g2 200ce60: 08 bf ff e5 bleu 200cdf4 <_Heap_Free+0x138> 200ce64: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200ce68: 10 bf ff e3 b 200cdf4 <_Heap_Free+0x138> 200ce6c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200ce70: 82 12 e0 01 or %o3, 1, %g1 200ce74: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ce78: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200ce7c: d6 26 40 1d st %o3, [ %i1 + %i5 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ce80: 82 08 7f fe and %g1, -2, %g1 200ce84: 10 bf ff dc b 200cdf4 <_Heap_Free+0x138> 200ce88: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0200d3a4 <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 200d3a4: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 200d3a8: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 Heap_Block *const end = the_heap->last_block; 200d3ac: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 memset(the_info, 0, sizeof(*the_info)); 200d3b0: 92 10 20 00 clr %o1 200d3b4: 90 10 00 19 mov %i1, %o0 200d3b8: 40 00 09 27 call 200f854 200d3bc: 94 10 20 18 mov 0x18, %o2 while ( the_block != end ) { 200d3c0: 80 a7 40 1c cmp %i5, %i4 200d3c4: 02 80 00 17 be 200d420 <_Heap_Get_information+0x7c> <== NEVER TAKEN 200d3c8: 01 00 00 00 nop 200d3cc: c6 07 60 04 ld [ %i5 + 4 ], %g3 - 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; 200d3d0: 84 08 ff fe and %g3, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d3d4: ba 07 40 02 add %i5, %g2, %i5 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 200d3d8: c6 07 60 04 ld [ %i5 + 4 ], %g3 while ( the_block != end ) { uintptr_t const the_size = _Heap_Block_size(the_block); Heap_Block *const next_block = _Heap_Block_at(the_block, the_size); Heap_Information *info; if ( _Heap_Is_prev_used(next_block) ) 200d3dc: 80 88 e0 01 btst 1, %g3 200d3e0: 02 80 00 03 be 200d3ec <_Heap_Get_information+0x48> 200d3e4: 82 10 00 19 mov %i1, %g1 info = &the_info->Used; 200d3e8: 82 06 60 0c add %i1, 0xc, %g1 else info = &the_info->Free; info->number++; 200d3ec: de 00 40 00 ld [ %g1 ], %o7 info->total += the_size; 200d3f0: f0 00 60 08 ld [ %g1 + 8 ], %i0 if ( info->largest < the_size ) 200d3f4: c8 00 60 04 ld [ %g1 + 4 ], %g4 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200d3f8: 9e 03 e0 01 inc %o7 info->total += the_size; 200d3fc: b0 06 00 02 add %i0, %g2, %i0 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 200d400: de 20 40 00 st %o7, [ %g1 ] info->total += the_size; if ( info->largest < the_size ) 200d404: 80 a1 00 02 cmp %g4, %g2 200d408: 1a 80 00 03 bcc 200d414 <_Heap_Get_information+0x70> 200d40c: f0 20 60 08 st %i0, [ %g1 + 8 ] info->largest = the_size; 200d410: c4 20 60 04 st %g2, [ %g1 + 4 ] Heap_Block *the_block = the_heap->first_block; Heap_Block *const end = the_heap->last_block; memset(the_info, 0, sizeof(*the_info)); while ( the_block != end ) { 200d414: 80 a7 00 1d cmp %i4, %i5 200d418: 12 bf ff ef bne 200d3d4 <_Heap_Get_information+0x30> 200d41c: 84 08 ff fe and %g3, -2, %g2 200d420: 81 c7 e0 08 ret 200d424: 81 e8 00 00 restore =============================================================================== 020196c4 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 20196c4: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 20196c8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 20196cc: 7f ff f9 38 call 2017bac <.urem> 20196d0: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 20196d4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 20196d8: 84 06 7f f8 add %i1, -8, %g2 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 20196dc: 84 20 80 08 sub %g2, %o0, %g2 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; 20196e0: 80 a0 80 01 cmp %g2, %g1 20196e4: 0a 80 00 16 bcs 201973c <_Heap_Size_of_alloc_area+0x78> 20196e8: 86 10 20 00 clr %g3 20196ec: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 20196f0: 80 a0 80 04 cmp %g2, %g4 20196f4: 18 80 00 13 bgu 2019740 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 20196f8: b0 08 e0 01 and %g3, 1, %i0 - 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; 20196fc: f0 00 a0 04 ld [ %g2 + 4 ], %i0 2019700: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2019704: 84 06 00 02 add %i0, %g2, %g2 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; 2019708: 80 a0 40 02 cmp %g1, %g2 201970c: 18 80 00 0d bgu 2019740 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 2019710: b0 08 e0 01 and %g3, 1, %i0 2019714: 80 a1 00 02 cmp %g4, %g2 2019718: 0a 80 00 0a bcs 2019740 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201971c: 01 00 00 00 nop block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2019720: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 2019724: 80 88 60 01 btst 1, %g1 2019728: 02 80 00 06 be 2019740 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 201972c: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2019730: 86 10 20 01 mov 1, %g3 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 2019734: 84 00 a0 04 add %g2, 4, %g2 2019738: c4 26 80 00 st %g2, [ %i2 ] return true; } 201973c: b0 08 e0 01 and %g3, 1, %i0 2019740: 81 c7 e0 08 ret 2019744: 81 e8 00 00 restore =============================================================================== 020086f8 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20086f8: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 20086fc: 3b 00 80 21 sethi %hi(0x2008400), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2008700: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 2008704: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 2008708: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 200870c: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2008710: 80 a6 a0 00 cmp %i2, 0 2008714: 02 80 00 04 be 2008724 <_Heap_Walk+0x2c> 2008718: ba 17 62 8c or %i5, 0x28c, %i5 200871c: 3b 00 80 21 sethi %hi(0x2008400), %i5 2008720: ba 17 62 94 or %i5, 0x294, %i5 ! 2008694 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008724: 03 00 80 60 sethi %hi(0x2018000), %g1 2008728: c4 00 63 b4 ld [ %g1 + 0x3b4 ], %g2 ! 20183b4 <_System_state_Current> 200872c: 80 a0 a0 03 cmp %g2, 3 2008730: 02 80 00 05 be 2008744 <_Heap_Walk+0x4c> 2008734: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 2008738: b0 08 60 01 and %g1, 1, %i0 200873c: 81 c7 e0 08 ret 2008740: 81 e8 00 00 restore 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)( 2008744: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008748: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 200874c: c4 06 20 08 ld [ %i0 + 8 ], %g2 2008750: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008754: 90 10 00 19 mov %i1, %o0 2008758: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 200875c: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2008760: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2008764: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2008768: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 200876c: 92 10 20 00 clr %o1 2008770: 96 10 00 10 mov %l0, %o3 2008774: 15 00 80 56 sethi %hi(0x2015800), %o2 2008778: 98 10 00 1b mov %i3, %o4 200877c: 9f c7 40 00 call %i5 2008780: 94 12 a1 68 or %o2, 0x168, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2008784: 80 a4 20 00 cmp %l0, 0 2008788: 02 80 00 28 be 2008828 <_Heap_Walk+0x130> 200878c: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2008790: 12 80 00 2d bne 2008844 <_Heap_Walk+0x14c> 2008794: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008798: 7f ff e4 cd call 2001acc <.urem> 200879c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20087a0: 80 a2 20 00 cmp %o0, 0 20087a4: 12 80 00 30 bne 2008864 <_Heap_Walk+0x16c> 20087a8: 90 07 20 08 add %i4, 8, %o0 20087ac: 7f ff e4 c8 call 2001acc <.urem> 20087b0: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 20087b4: 80 a2 20 00 cmp %o0, 0 20087b8: 32 80 00 33 bne,a 2008884 <_Heap_Walk+0x18c> 20087bc: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 20087c0: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20087c4: 80 8d 20 01 btst 1, %l4 20087c8: 22 80 00 36 be,a 20088a0 <_Heap_Walk+0x1a8> 20087cc: 90 10 00 19 mov %i1, %o0 - 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; 20087d0: c2 04 60 04 ld [ %l1 + 4 ], %g1 20087d4: 82 08 7f fe and %g1, -2, %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20087d8: 82 04 40 01 add %l1, %g1, %g1 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; 20087dc: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 20087e0: 80 88 a0 01 btst 1, %g2 20087e4: 02 80 00 0a be 200880c <_Heap_Walk+0x114> 20087e8: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 20087ec: 02 80 00 33 be 20088b8 <_Heap_Walk+0x1c0> 20087f0: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 20087f4: 92 10 20 01 mov 1, %o1 20087f8: 15 00 80 56 sethi %hi(0x2015800), %o2 20087fc: 9f c7 40 00 call %i5 2008800: 94 12 a2 e0 or %o2, 0x2e0, %o2 ! 2015ae0 <_Status_Object_name_errors_to_status+0x1f0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008804: 10 bf ff cd b 2008738 <_Heap_Walk+0x40> 2008808: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 200880c: 90 10 00 19 mov %i1, %o0 2008810: 92 10 20 01 mov 1, %o1 2008814: 15 00 80 56 sethi %hi(0x2015800), %o2 2008818: 9f c7 40 00 call %i5 200881c: 94 12 a2 c8 or %o2, 0x2c8, %o2 ! 2015ac8 <_Status_Object_name_errors_to_status+0x1d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008820: 10 bf ff c6 b 2008738 <_Heap_Walk+0x40> 2008824: 82 10 20 00 clr %g1 first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 2008828: 90 10 00 19 mov %i1, %o0 200882c: 92 10 20 01 mov 1, %o1 2008830: 15 00 80 56 sethi %hi(0x2015800), %o2 2008834: 9f c7 40 00 call %i5 2008838: 94 12 a2 00 or %o2, 0x200, %o2 ! 2015a00 <_Status_Object_name_errors_to_status+0x110> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200883c: 10 bf ff bf b 2008738 <_Heap_Walk+0x40> 2008840: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2008844: 90 10 00 19 mov %i1, %o0 2008848: 92 10 20 01 mov 1, %o1 200884c: 96 10 00 10 mov %l0, %o3 2008850: 15 00 80 56 sethi %hi(0x2015800), %o2 2008854: 9f c7 40 00 call %i5 2008858: 94 12 a2 18 or %o2, 0x218, %o2 ! 2015a18 <_Status_Object_name_errors_to_status+0x128> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200885c: 10 bf ff b7 b 2008738 <_Heap_Walk+0x40> 2008860: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2008864: 90 10 00 19 mov %i1, %o0 2008868: 92 10 20 01 mov 1, %o1 200886c: 96 10 00 1b mov %i3, %o3 2008870: 15 00 80 56 sethi %hi(0x2015800), %o2 2008874: 9f c7 40 00 call %i5 2008878: 94 12 a2 38 or %o2, 0x238, %o2 ! 2015a38 <_Status_Object_name_errors_to_status+0x148> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200887c: 10 bf ff af b 2008738 <_Heap_Walk+0x40> 2008880: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008884: 92 10 20 01 mov 1, %o1 2008888: 96 10 00 1c mov %i4, %o3 200888c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008890: 9f c7 40 00 call %i5 2008894: 94 12 a2 60 or %o2, 0x260, %o2 ! 2015a60 <_Status_Object_name_errors_to_status+0x170> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008898: 10 bf ff a8 b 2008738 <_Heap_Walk+0x40> 200889c: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 20088a0: 92 10 20 01 mov 1, %o1 20088a4: 15 00 80 56 sethi %hi(0x2015800), %o2 20088a8: 9f c7 40 00 call %i5 20088ac: 94 12 a2 98 or %o2, 0x298, %o2 ! 2015a98 <_Status_Object_name_errors_to_status+0x1a8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088b0: 10 bf ff a2 b 2008738 <_Heap_Walk+0x40> 20088b4: 82 10 20 00 clr %g1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20088b8: f4 06 20 08 ld [ %i0 + 8 ], %i2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 20088bc: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 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 ) { 20088c0: 80 a6 00 1a cmp %i0, %i2 20088c4: 02 80 00 0d be 20088f8 <_Heap_Walk+0x200> 20088c8: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 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; 20088cc: 80 a0 40 1a cmp %g1, %i2 20088d0: 28 80 00 bc bleu,a 2008bc0 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 20088d4: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 20088d8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20088dc: 92 10 20 01 mov 1, %o1 20088e0: 96 10 00 1a mov %i2, %o3 20088e4: 15 00 80 56 sethi %hi(0x2015800), %o2 20088e8: 9f c7 40 00 call %i5 20088ec: 94 12 a3 10 or %o2, 0x310, %o2 ! 2015b10 <_Status_Object_name_errors_to_status+0x220> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20088f0: 10 bf ff 92 b 2008738 <_Heap_Walk+0x40> 20088f4: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20088f8: 2d 00 80 57 sethi %hi(0x2015c00), %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 20088fc: 2f 00 80 57 sethi %hi(0x2015c00), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008900: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008904: ac 15 a1 40 or %l6, 0x140, %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2008908: ae 15 e1 28 or %l7, 0x128, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200890c: 2b 00 80 57 sethi %hi(0x2015c00), %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; 2008910: a6 0d 3f fe and %l4, -2, %l3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008914: b4 04 c0 12 add %l3, %l2, %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; 2008918: 80 a0 40 1a cmp %g1, %i2 200891c: 28 80 00 0b bleu,a 2008948 <_Heap_Walk+0x250> <== ALWAYS TAKEN 2008920: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 2008924: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2008928: 92 10 20 01 mov 1, %o1 200892c: 96 10 00 12 mov %l2, %o3 2008930: 15 00 80 56 sethi %hi(0x2015800), %o2 2008934: 98 10 00 1a mov %i2, %o4 2008938: 9f c7 40 00 call %i5 200893c: 94 12 a3 b8 or %o2, 0x3b8, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2008940: 10 bf ff 7e b 2008738 <_Heap_Walk+0x40> 2008944: 82 10 20 00 clr %g1 2008948: 80 a0 40 1a cmp %g1, %i2 200894c: 0a bf ff f7 bcs 2008928 <_Heap_Walk+0x230> 2008950: 90 10 00 19 mov %i1, %o0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; 2008954: 82 1c 80 11 xor %l2, %l1, %g1 2008958: 80 a0 00 01 cmp %g0, %g1 200895c: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008960: 90 10 00 13 mov %l3, %o0 2008964: c2 27 bf fc st %g1, [ %fp + -4 ] 2008968: 7f ff e4 59 call 2001acc <.urem> 200896c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2008970: 80 a2 20 00 cmp %o0, 0 2008974: 02 80 00 05 be 2008988 <_Heap_Walk+0x290> 2008978: c2 07 bf fc ld [ %fp + -4 ], %g1 200897c: 80 88 60 ff btst 0xff, %g1 2008980: 12 80 00 76 bne 2008b58 <_Heap_Walk+0x460> 2008984: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008988: 80 a6 c0 13 cmp %i3, %l3 200898c: 08 80 00 05 bleu 20089a0 <_Heap_Walk+0x2a8> 2008990: 80 a4 80 1a cmp %l2, %i2 2008994: 80 88 60 ff btst 0xff, %g1 2008998: 12 80 00 78 bne 2008b78 <_Heap_Walk+0x480> <== ALWAYS TAKEN 200899c: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 20089a0: 2a 80 00 06 bcs,a 20089b8 <_Heap_Walk+0x2c0> 20089a4: c2 06 a0 04 ld [ %i2 + 4 ], %g1 20089a8: 80 88 60 ff btst 0xff, %g1 20089ac: 12 80 00 7d bne 2008ba0 <_Heap_Walk+0x4a8> 20089b0: 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; 20089b4: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 20089b8: 80 88 60 01 btst 1, %g1 20089bc: 02 80 00 19 be 2008a20 <_Heap_Walk+0x328> 20089c0: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 20089c4: 80 a5 20 00 cmp %l4, 0 20089c8: 22 80 00 0e be,a 2008a00 <_Heap_Walk+0x308> 20089cc: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 20089d0: 90 10 00 19 mov %i1, %o0 20089d4: 92 10 20 00 clr %o1 20089d8: 94 10 00 17 mov %l7, %o2 20089dc: 96 10 00 12 mov %l2, %o3 20089e0: 9f c7 40 00 call %i5 20089e4: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20089e8: 80 a7 00 1a cmp %i4, %i2 20089ec: 02 80 00 42 be 2008af4 <_Heap_Walk+0x3fc> 20089f0: a4 10 00 1a mov %i2, %l2 20089f4: e8 06 a0 04 ld [ %i2 + 4 ], %l4 20089f8: 10 bf ff c6 b 2008910 <_Heap_Walk+0x218> 20089fc: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008a00: 96 10 00 12 mov %l2, %o3 2008a04: 90 10 00 19 mov %i1, %o0 2008a08: 92 10 20 00 clr %o1 2008a0c: 94 10 00 16 mov %l6, %o2 2008a10: 9f c7 40 00 call %i5 2008a14: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008a18: 10 bf ff f5 b 20089ec <_Heap_Walk+0x2f4> 2008a1c: 80 a7 00 1a cmp %i4, %i2 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 2008a20: da 04 a0 0c ld [ %l2 + 0xc ], %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)( 2008a24: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008a28: 05 00 80 56 sethi %hi(0x2015800), %g2 return _Heap_Free_list_head(heap)->next; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 2008a2c: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008a30: 80 a0 40 0d cmp %g1, %o5 2008a34: 02 80 00 05 be 2008a48 <_Heap_Walk+0x350> 2008a38: 86 10 a1 28 or %g2, 0x128, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008a3c: 80 a6 00 0d cmp %i0, %o5 2008a40: 02 80 00 3c be 2008b30 <_Heap_Walk+0x438> 2008a44: 86 15 60 f0 or %l5, 0xf0, %g3 block->next, block->next == last_free_block ? 2008a48: c2 04 a0 08 ld [ %l2 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 2008a4c: 1f 00 80 56 sethi %hi(0x2015800), %o7 2008a50: 80 a1 00 01 cmp %g4, %g1 2008a54: 02 80 00 05 be 2008a68 <_Heap_Walk+0x370> 2008a58: 84 13 e1 48 or %o7, 0x148, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008a5c: 80 a6 00 01 cmp %i0, %g1 2008a60: 02 80 00 31 be 2008b24 <_Heap_Walk+0x42c> 2008a64: 84 15 60 f0 or %l5, 0xf0, %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)( 2008a68: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2008a6c: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2008a70: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 2008a74: 90 10 00 19 mov %i1, %o0 2008a78: 92 10 20 00 clr %o1 2008a7c: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008a80: 96 10 00 12 mov %l2, %o3 2008a84: 94 12 a0 80 or %o2, 0x80, %o2 2008a88: 9f c7 40 00 call %i5 2008a8c: 98 10 00 13 mov %l3, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2008a90: da 06 80 00 ld [ %i2 ], %o5 2008a94: 80 a4 c0 0d cmp %l3, %o5 2008a98: 12 80 00 19 bne 2008afc <_Heap_Walk+0x404> 2008a9c: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 2008aa0: 02 80 00 27 be 2008b3c <_Heap_Walk+0x444> 2008aa4: 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; 2008aa8: 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 ) { 2008aac: 80 a6 00 01 cmp %i0, %g1 2008ab0: 02 80 00 0b be 2008adc <_Heap_Walk+0x3e4> <== NEVER TAKEN 2008ab4: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 2008ab8: 80 a4 80 01 cmp %l2, %g1 2008abc: 02 bf ff cc be 20089ec <_Heap_Walk+0x2f4> 2008ac0: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 2008ac4: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 2008ac8: 80 a6 00 01 cmp %i0, %g1 2008acc: 12 bf ff fc bne 2008abc <_Heap_Walk+0x3c4> 2008ad0: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008ad4: 90 10 00 19 mov %i1, %o0 2008ad8: 92 10 20 01 mov 1, %o1 2008adc: 96 10 00 12 mov %l2, %o3 2008ae0: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008ae4: 9f c7 40 00 call %i5 2008ae8: 94 12 a1 68 or %o2, 0x168, %o2 ! 2015d68 <_Status_Object_name_errors_to_status+0x478> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008aec: 10 bf ff 13 b 2008738 <_Heap_Walk+0x40> 2008af0: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 2008af4: 10 bf ff 11 b 2008738 <_Heap_Walk+0x40> 2008af8: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 2008afc: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 2008b00: 90 10 00 19 mov %i1, %o0 2008b04: 92 10 20 01 mov 1, %o1 2008b08: 96 10 00 12 mov %l2, %o3 2008b0c: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008b10: 98 10 00 13 mov %l3, %o4 2008b14: 9f c7 40 00 call %i5 2008b18: 94 12 a0 b8 or %o2, 0xb8, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b1c: 10 bf ff 07 b 2008738 <_Heap_Walk+0x40> 2008b20: 82 10 20 00 clr %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008b24: 05 00 80 56 sethi %hi(0x2015800), %g2 2008b28: 10 bf ff d0 b 2008a68 <_Heap_Walk+0x370> 2008b2c: 84 10 a1 58 or %g2, 0x158, %g2 ! 2015958 <_Status_Object_name_errors_to_status+0x68> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008b30: 07 00 80 56 sethi %hi(0x2015800), %g3 2008b34: 10 bf ff c5 b 2008a48 <_Heap_Walk+0x350> 2008b38: 86 10 e1 38 or %g3, 0x138, %g3 ! 2015938 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 2008b3c: 92 10 20 01 mov 1, %o1 2008b40: 96 10 00 12 mov %l2, %o3 2008b44: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008b48: 9f c7 40 00 call %i5 2008b4c: 94 12 a0 f8 or %o2, 0xf8, %o2 ! 2015cf8 <_Status_Object_name_errors_to_status+0x408> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 2008b50: 10 bf fe fa b 2008738 <_Heap_Walk+0x40> 2008b54: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 2008b58: 92 10 20 01 mov 1, %o1 2008b5c: 96 10 00 12 mov %l2, %o3 2008b60: 15 00 80 56 sethi %hi(0x2015800), %o2 2008b64: 98 10 00 13 mov %l3, %o4 2008b68: 9f c7 40 00 call %i5 2008b6c: 94 12 a3 e8 or %o2, 0x3e8, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 2008b70: 10 bf fe f2 b 2008738 <_Heap_Walk+0x40> 2008b74: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 2008b78: 90 10 00 19 mov %i1, %o0 2008b7c: 92 10 20 01 mov 1, %o1 2008b80: 96 10 00 12 mov %l2, %o3 2008b84: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008b88: 98 10 00 13 mov %l3, %o4 2008b8c: 94 12 a0 18 or %o2, 0x18, %o2 2008b90: 9f c7 40 00 call %i5 2008b94: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 2008b98: 10 bf fe e8 b 2008738 <_Heap_Walk+0x40> 2008b9c: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 2008ba0: 92 10 20 01 mov 1, %o1 2008ba4: 96 10 00 12 mov %l2, %o3 2008ba8: 15 00 80 57 sethi %hi(0x2015c00), %o2 2008bac: 98 10 00 1a mov %i2, %o4 2008bb0: 9f c7 40 00 call %i5 2008bb4: 94 12 a0 48 or %o2, 0x48, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 2008bb8: 10 bf fe e0 b 2008738 <_Heap_Walk+0x40> 2008bbc: 82 10 20 00 clr %g1 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; 2008bc0: 80 a6 80 13 cmp %i2, %l3 2008bc4: 18 bf ff 46 bgu 20088dc <_Heap_Walk+0x1e4> <== NEVER TAKEN 2008bc8: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008bcc: c2 27 bf fc st %g1, [ %fp + -4 ] 2008bd0: 90 06 a0 08 add %i2, 8, %o0 2008bd4: 7f ff e3 be call 2001acc <.urem> 2008bd8: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008bdc: 80 a2 20 00 cmp %o0, 0 2008be0: 12 80 00 36 bne 2008cb8 <_Heap_Walk+0x5c0> <== NEVER TAKEN 2008be4: c2 07 bf fc ld [ %fp + -4 ], %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; 2008be8: c4 06 a0 04 ld [ %i2 + 4 ], %g2 2008bec: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 2008bf0: 84 06 80 02 add %i2, %g2, %g2 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; 2008bf4: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008bf8: 80 88 a0 01 btst 1, %g2 2008bfc: 12 80 00 27 bne 2008c98 <_Heap_Walk+0x5a0> <== NEVER TAKEN 2008c00: 84 10 00 18 mov %i0, %g2 2008c04: 10 80 00 19 b 2008c68 <_Heap_Walk+0x570> 2008c08: a4 10 00 1a mov %i2, %l2 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 ) { 2008c0c: 80 a6 00 1a cmp %i0, %i2 2008c10: 02 bf ff 3a be 20088f8 <_Heap_Walk+0x200> 2008c14: 80 a6 80 01 cmp %i2, %g1 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; 2008c18: 0a bf ff 31 bcs 20088dc <_Heap_Walk+0x1e4> 2008c1c: 90 10 00 19 mov %i1, %o0 2008c20: 80 a6 80 13 cmp %i2, %l3 2008c24: 18 bf ff 2f bgu 20088e0 <_Heap_Walk+0x1e8> <== NEVER TAKEN 2008c28: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008c2c: c2 27 bf fc st %g1, [ %fp + -4 ] 2008c30: 90 06 a0 08 add %i2, 8, %o0 2008c34: 7f ff e3 a6 call 2001acc <.urem> 2008c38: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 2008c3c: 80 a2 20 00 cmp %o0, 0 2008c40: 12 80 00 1e bne 2008cb8 <_Heap_Walk+0x5c0> 2008c44: c2 07 bf fc ld [ %fp + -4 ], %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; 2008c48: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c4c: 84 10 00 12 mov %l2, %g2 2008c50: 86 08 ff fe and %g3, -2, %g3 block = next_block; } while ( block != first_block ); return true; } 2008c54: 86 06 80 03 add %i2, %g3, %g3 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; 2008c58: c6 00 e0 04 ld [ %g3 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008c5c: 80 88 e0 01 btst 1, %g3 2008c60: 12 80 00 0e bne 2008c98 <_Heap_Walk+0x5a0> 2008c64: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 2008c68: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 2008c6c: 80 a3 00 02 cmp %o4, %g2 2008c70: 22 bf ff e7 be,a 2008c0c <_Heap_Walk+0x514> 2008c74: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 2008c78: 90 10 00 19 mov %i1, %o0 2008c7c: 92 10 20 01 mov 1, %o1 2008c80: 96 10 00 1a mov %i2, %o3 2008c84: 15 00 80 56 sethi %hi(0x2015800), %o2 2008c88: 9f c7 40 00 call %i5 2008c8c: 94 12 a3 80 or %o2, 0x380, %o2 ! 2015b80 <_Status_Object_name_errors_to_status+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008c90: 10 bf fe aa b 2008738 <_Heap_Walk+0x40> 2008c94: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 2008c98: 90 10 00 19 mov %i1, %o0 2008c9c: 92 10 20 01 mov 1, %o1 2008ca0: 96 10 00 1a mov %i2, %o3 2008ca4: 15 00 80 56 sethi %hi(0x2015800), %o2 2008ca8: 9f c7 40 00 call %i5 2008cac: 94 12 a3 60 or %o2, 0x360, %o2 ! 2015b60 <_Status_Object_name_errors_to_status+0x270> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cb0: 10 bf fe a2 b 2008738 <_Heap_Walk+0x40> 2008cb4: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008cb8: 90 10 00 19 mov %i1, %o0 2008cbc: 92 10 20 01 mov 1, %o1 2008cc0: 96 10 00 1a mov %i2, %o3 2008cc4: 15 00 80 56 sethi %hi(0x2015800), %o2 2008cc8: 9f c7 40 00 call %i5 2008ccc: 94 12 a3 30 or %o2, 0x330, %o2 ! 2015b30 <_Status_Object_name_errors_to_status+0x240> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008cd0: 10 bf fe 9a b 2008738 <_Heap_Walk+0x40> 2008cd4: 82 10 20 00 clr %g1 =============================================================================== 02007148 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2007148: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 200714c: 39 00 80 71 sethi %hi(0x201c400), %i4 2007150: c2 07 22 34 ld [ %i4 + 0x234 ], %g1 ! 201c634 <_IO_Number_of_drivers> 2007154: 80 a0 60 00 cmp %g1, 0 2007158: 02 80 00 0c be 2007188 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 200715c: ba 10 20 00 clr %i5 2007160: b8 17 22 34 or %i4, 0x234, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2007164: 90 10 00 1d mov %i5, %o0 2007168: 92 10 20 00 clr %o1 200716c: 40 00 15 a7 call 200c808 2007170: 94 10 20 00 clr %o2 void _IO_Initialize_all_drivers( void ) { rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2007174: c2 07 00 00 ld [ %i4 ], %g1 2007178: ba 07 60 01 inc %i5 200717c: 80 a0 40 1d cmp %g1, %i5 2007180: 18 bf ff fa bgu 2007168 <_IO_Initialize_all_drivers+0x20> 2007184: 90 10 00 1d mov %i5, %o0 2007188: 81 c7 e0 08 ret 200718c: 81 e8 00 00 restore =============================================================================== 0200707c <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 200707c: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 2007080: 03 00 80 6d sethi %hi(0x201b400), %g1 2007084: 82 10 62 7c or %g1, 0x27c, %g1 ! 201b67c drivers_in_table = Configuration.number_of_device_drivers; 2007088: f8 00 60 30 ld [ %g1 + 0x30 ], %i4 number_of_drivers = Configuration.maximum_drivers; 200708c: f2 00 60 2c ld [ %g1 + 0x2c ], %i1 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 2007090: 80 a7 00 19 cmp %i4, %i1 2007094: 0a 80 00 08 bcs 20070b4 <_IO_Manager_initialization+0x38> 2007098: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 200709c: 03 00 80 71 sethi %hi(0x201c400), %g1 20070a0: fa 20 62 38 st %i5, [ %g1 + 0x238 ] ! 201c638 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 20070a4: 03 00 80 71 sethi %hi(0x201c400), %g1 20070a8: f8 20 62 34 st %i4, [ %g1 + 0x234 ] ! 201c634 <_IO_Number_of_drivers> return; 20070ac: 81 c7 e0 08 ret 20070b0: 81 e8 00 00 restore * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) 20070b4: 83 2e 60 03 sll %i1, 3, %g1 20070b8: b5 2e 60 05 sll %i1, 5, %i2 20070bc: b4 26 80 01 sub %i2, %g1, %i2 * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( 20070c0: 40 00 0d 26 call 200a558 <_Workspace_Allocate_or_fatal_error> 20070c4: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20070c8: 03 00 80 71 sethi %hi(0x201c400), %g1 /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 20070cc: 37 00 80 71 sethi %hi(0x201c400), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20070d0: f2 20 62 34 st %i1, [ %g1 + 0x234 ] /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 20070d4: d0 26 e2 38 st %o0, [ %i3 + 0x238 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 20070d8: 92 10 20 00 clr %o1 20070dc: 40 00 21 26 call 200f574 20070e0: 94 10 00 1a mov %i2, %o2 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20070e4: 80 a7 20 00 cmp %i4, 0 20070e8: 02 bf ff f1 be 20070ac <_IO_Manager_initialization+0x30> <== NEVER TAKEN 20070ec: f6 06 e2 38 ld [ %i3 + 0x238 ], %i3 20070f0: 82 10 20 00 clr %g1 20070f4: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 20070f8: c4 07 40 01 ld [ %i5 + %g1 ], %g2 20070fc: 86 07 40 01 add %i5, %g1, %g3 2007100: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 2007104: f4 00 e0 04 ld [ %g3 + 4 ], %i2 2007108: 84 06 c0 01 add %i3, %g1, %g2 200710c: f4 20 a0 04 st %i2, [ %g2 + 4 ] 2007110: f4 00 e0 08 ld [ %g3 + 8 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007114: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 2007118: f4 20 a0 08 st %i2, [ %g2 + 8 ] 200711c: f4 00 e0 0c ld [ %g3 + 0xc ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007120: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 2007124: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 2007128: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 200712c: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 2007130: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 2007134: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2007138: 12 bf ff f0 bne 20070f8 <_IO_Manager_initialization+0x7c> 200713c: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2007140: 81 c7 e0 08 ret 2007144: 81 e8 00 00 restore =============================================================================== 02007e58 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007e58: 9d e3 bf a0 save %sp, -96, %sp * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 2007e5c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007e60: ba 10 00 18 mov %i0, %i5 * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 2007e64: 80 a0 60 00 cmp %g1, 0 2007e68: 02 80 00 19 be 2007ecc <_Objects_Allocate+0x74> <== NEVER TAKEN 2007e6c: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007e70: b8 07 60 20 add %i5, 0x20, %i4 2007e74: 7f ff fd 5e call 20073ec <_Chain_Get> 2007e78: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007e7c: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2007e80: 80 a0 60 00 cmp %g1, 0 2007e84: 02 80 00 12 be 2007ecc <_Objects_Allocate+0x74> 2007e88: b0 10 00 08 mov %o0, %i0 /* * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { 2007e8c: 80 a2 20 00 cmp %o0, 0 2007e90: 02 80 00 11 be 2007ed4 <_Objects_Allocate+0x7c> 2007e94: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007e98: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007e9c: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007ea0: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2007ea4: 40 00 3e 96 call 20178fc <.udiv> 2007ea8: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007eac: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007eb0: 91 2a 20 02 sll %o0, 2, %o0 2007eb4: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2007eb8: c4 17 60 2c lduh [ %i5 + 0x2c ], %g2 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 2007ebc: 86 00 ff ff add %g3, -1, %g3 2007ec0: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2007ec4: 82 00 bf ff add %g2, -1, %g1 2007ec8: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007ecc: 81 c7 e0 08 ret 2007ed0: 81 e8 00 00 restore * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { _Objects_Extend_information( information ); 2007ed4: 40 00 00 10 call 2007f14 <_Objects_Extend_information> 2007ed8: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2007edc: 7f ff fd 44 call 20073ec <_Chain_Get> 2007ee0: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007ee4: b0 92 20 00 orcc %o0, 0, %i0 2007ee8: 32 bf ff ed bne,a 2007e9c <_Objects_Allocate+0x44> 2007eec: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2007ef0: 81 c7 e0 08 ret 2007ef4: 81 e8 00 00 restore =============================================================================== 02007f14 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2007f14: 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 ) 2007f18: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2007f1c: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2007f20: 80 a4 20 00 cmp %l0, 0 2007f24: 02 80 00 a6 be 20081bc <_Objects_Extend_information+0x2a8> 2007f28: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2007f2c: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 2007f30: b3 2e 60 10 sll %i1, 0x10, %i1 2007f34: 92 10 00 1a mov %i2, %o1 2007f38: 40 00 3e 71 call 20178fc <.udiv> 2007f3c: 91 36 60 10 srl %i1, 0x10, %o0 2007f40: a7 2a 20 10 sll %o0, 0x10, %l3 2007f44: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 2007f48: 80 a4 e0 00 cmp %l3, 0 2007f4c: 02 80 00 a3 be 20081d8 <_Objects_Extend_information+0x2c4><== NEVER TAKEN 2007f50: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 2007f54: c2 04 00 00 ld [ %l0 ], %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2007f58: ba 10 00 1c mov %i4, %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2007f5c: 80 a0 60 00 cmp %g1, 0 2007f60: 12 80 00 08 bne 2007f80 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 2007f64: b6 10 20 00 clr %i3 do_extend = false; 2007f68: 10 80 00 a0 b 20081e8 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 2007f6c: b4 10 20 00 clr %i2 <== NOT EXECUTED block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2007f70: c2 04 00 01 ld [ %l0 + %g1 ], %g1 2007f74: 80 a0 60 00 cmp %g1, 0 2007f78: 22 80 00 08 be,a 2007f98 <_Objects_Extend_information+0x84> 2007f7c: b4 10 20 00 clr %i2 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007f80: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2007f84: ba 07 40 1a add %i5, %i2, %i5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2007f88: 80 a4 c0 1b cmp %l3, %i3 2007f8c: 18 bf ff f9 bgu 2007f70 <_Objects_Extend_information+0x5c> 2007f90: 83 2e e0 02 sll %i3, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2007f94: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007f98: b3 36 60 10 srl %i1, 0x10, %i1 /* * 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 ) { 2007f9c: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2007fa0: b2 06 40 08 add %i1, %o0, %i1 /* * 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 ) { 2007fa4: 82 10 63 ff or %g1, 0x3ff, %g1 2007fa8: 80 a6 40 01 cmp %i1, %g1 2007fac: 18 80 00 93 bgu 20081f8 <_Objects_Extend_information+0x2e4> 2007fb0: 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; 2007fb4: 40 00 3e 18 call 2017814 <.umul> 2007fb8: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2007fbc: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2007fc0: 80 a0 60 00 cmp %g1, 0 2007fc4: 02 80 00 6a be 200816c <_Objects_Extend_information+0x258> 2007fc8: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2007fcc: 40 00 09 55 call 200a520 <_Workspace_Allocate> 2007fd0: 01 00 00 00 nop if ( !new_object_block ) 2007fd4: a0 92 20 00 orcc %o0, 0, %l0 2007fd8: 02 80 00 88 be 20081f8 <_Objects_Extend_information+0x2e4> 2007fdc: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2007fe0: 80 8e a0 ff btst 0xff, %i2 2007fe4: 22 80 00 3f be,a 20080e0 <_Objects_Extend_information+0x1cc> 2007fe8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2007fec: b4 04 e0 01 add %l3, 1, %i2 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007ff0: 91 2e a0 01 sll %i2, 1, %o0 2007ff4: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2007ff8: 90 06 40 08 add %i1, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2007ffc: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2008000: 40 00 09 48 call 200a520 <_Workspace_Allocate> 2008004: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2008008: a2 92 20 00 orcc %o0, 0, %l1 200800c: 02 80 00 79 be 20081f0 <_Objects_Extend_information+0x2dc> 2008010: b5 2e a0 02 sll %i2, 2, %i2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2008014: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2008018: 80 a7 00 01 cmp %i4, %g1 200801c: a4 04 40 1a add %l1, %i2, %l2 2008020: 0a 80 00 57 bcs 200817c <_Objects_Extend_information+0x268> 2008024: b4 04 80 1a add %l2, %i2, %i2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2008028: 80 a7 20 00 cmp %i4, 0 200802c: 02 80 00 07 be 2008048 <_Objects_Extend_information+0x134><== NEVER TAKEN 2008030: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2008034: 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++ ) { 2008038: 82 00 60 01 inc %g1 200803c: 80 a7 00 01 cmp %i4, %g1 2008040: 18 bf ff fd bgu 2008034 <_Objects_Extend_information+0x120><== NEVER TAKEN 2008044: c0 20 80 1a clr [ %g2 + %i2 ] 2008048: a7 2c e0 02 sll %l3, 2, %l3 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 200804c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2008050: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2008054: 86 07 40 03 add %i5, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008058: 80 a7 40 03 cmp %i5, %g3 200805c: 1a 80 00 0a bcc 2008084 <_Objects_Extend_information+0x170><== NEVER TAKEN 2008060: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2008064: 83 2f 60 02 sll %i5, 2, %g1 2008068: 84 10 00 1d mov %i5, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 200806c: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 2008070: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 2008074: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2008078: 80 a0 c0 02 cmp %g3, %g2 200807c: 18 bf ff fd bgu 2008070 <_Objects_Extend_information+0x15c> 2008080: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2008084: 7f ff e8 58 call 20021e4 2008088: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 200808c: c6 06 00 00 ld [ %i0 ], %g3 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( 2008090: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2008094: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2008098: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 200809c: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20080a0: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 20080a4: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 20080a8: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 20080ac: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 20080b0: b3 2e 60 10 sll %i1, 0x10, %i1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20080b4: 03 00 00 40 sethi %hi(0x10000), %g1 20080b8: b3 36 60 10 srl %i1, 0x10, %i1 20080bc: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20080c0: 82 10 40 02 or %g1, %g2, %g1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20080c4: 82 10 40 19 or %g1, %i1, %g1 20080c8: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 20080cc: 7f ff e8 4a call 20021f4 20080d0: 01 00 00 00 nop _Workspace_Free( old_tables ); 20080d4: 40 00 09 1b call 200a540 <_Workspace_Free> 20080d8: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20080dc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20080e0: b7 2e e0 02 sll %i3, 2, %i3 20080e4: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20080e8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20080ec: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 20080f0: d2 00 40 1b ld [ %g1 + %i3 ], %o1 20080f4: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 20080f8: 90 07 bf f4 add %fp, -12, %o0 20080fc: 40 00 11 db call 200c868 <_Chain_Initialize> 2008100: 39 00 00 40 sethi %hi(0x10000), %i4 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2008104: 10 80 00 0d b 2008138 <_Objects_Extend_information+0x224> 2008108: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 200810c: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2008110: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2008114: 87 28 e0 1b sll %g3, 0x1b, %g3 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008118: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200811c: 84 10 80 03 or %g2, %g3, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2008120: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008124: 90 10 00 1a mov %i2, %o0 2008128: 92 10 00 01 mov %g1, %o1 index++; 200812c: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2008130: 7f ff fc 9b call 200739c <_Chain_Append> 2008134: c4 20 60 08 st %g2, [ %g1 + 8 ] /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2008138: 7f ff fc ad call 20073ec <_Chain_Get> 200813c: 90 07 bf f4 add %fp, -12, %o0 2008140: 82 92 20 00 orcc %o0, 0, %g1 2008144: 32 bf ff f2 bne,a 200810c <_Objects_Extend_information+0x1f8> 2008148: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 200814c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2008150: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2008154: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2008158: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 200815c: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2008160: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2008164: 81 c7 e0 08 ret 2008168: 81 e8 00 00 restore if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 200816c: 40 00 08 fb call 200a558 <_Workspace_Allocate_or_fatal_error> 2008170: 01 00 00 00 nop 2008174: 10 bf ff 9b b 2007fe0 <_Objects_Extend_information+0xcc> 2008178: a0 10 00 08 mov %o0, %l0 /* * 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, 200817c: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2008180: a7 2c e0 02 sll %l3, 2, %l3 /* * 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, 2008184: 40 00 1c c0 call 200f484 2008188: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 200818c: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2008190: 94 10 00 13 mov %l3, %o2 2008194: 40 00 1c bc call 200f484 2008198: 90 10 00 12 mov %l2, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 200819c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20081a0: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 20081a4: b8 07 00 01 add %i4, %g1, %i4 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20081a8: 90 10 00 1a mov %i2, %o0 20081ac: 40 00 1c b6 call 200f484 20081b0: 95 2f 20 02 sll %i4, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20081b4: 10 bf ff a7 b 2008050 <_Objects_Extend_information+0x13c> 20081b8: 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 ) 20081bc: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20081c0: ba 10 00 1c mov %i4, %i5 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20081c4: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20081c8: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 20081cc: a6 10 20 00 clr %l3 20081d0: 10 bf ff 72 b 2007f98 <_Objects_Extend_information+0x84> 20081d4: b3 2e 60 10 sll %i1, 0x10, %i1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20081d8: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20081dc: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20081e0: 10 bf ff 6e b 2007f98 <_Objects_Extend_information+0x84> <== NOT EXECUTED 20081e4: b6 10 20 00 clr %i3 <== NOT EXECUTED 20081e8: 10 bf ff 6c b 2007f98 <_Objects_Extend_information+0x84> <== NOT EXECUTED 20081ec: b6 10 20 00 clr %i3 <== 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 ); 20081f0: 40 00 08 d4 call 200a540 <_Workspace_Free> 20081f4: 90 10 00 10 mov %l0, %o0 return; 20081f8: 81 c7 e0 08 ret 20081fc: 81 e8 00 00 restore =============================================================================== 020082a4 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 20082a4: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 20082a8: 80 a6 60 00 cmp %i1, 0 20082ac: 02 80 00 17 be 2008308 <_Objects_Get_information+0x64> 20082b0: ba 10 20 00 clr %i5 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 20082b4: 40 00 12 f6 call 200ce8c <_Objects_API_maximum_class> 20082b8: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 20082bc: 80 a2 20 00 cmp %o0, 0 20082c0: 02 80 00 12 be 2008308 <_Objects_Get_information+0x64> 20082c4: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 20082c8: 0a 80 00 10 bcs 2008308 <_Objects_Get_information+0x64> 20082cc: 03 00 80 70 sethi %hi(0x201c000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 20082d0: b1 2e 20 02 sll %i0, 2, %i0 20082d4: 82 10 62 d8 or %g1, 0x2d8, %g1 20082d8: c2 00 40 18 ld [ %g1 + %i0 ], %g1 20082dc: 80 a0 60 00 cmp %g1, 0 20082e0: 02 80 00 0a be 2008308 <_Objects_Get_information+0x64> <== NEVER TAKEN 20082e4: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 20082e8: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 20082ec: 80 a7 60 00 cmp %i5, 0 20082f0: 02 80 00 06 be 2008308 <_Objects_Get_information+0x64> <== NEVER TAKEN 20082f4: 01 00 00 00 nop * In a multprocessing configuration, we may access remote objects. * Thus we may have 0 local instances and still have a valid object * pointer. */ #if !defined(RTEMS_MULTIPROCESSING) if ( info->maximum == 0 ) 20082f8: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 20082fc: 80 a0 00 01 cmp %g0, %g1 2008300: 82 60 20 00 subx %g0, 0, %g1 2008304: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2008308: 81 c7 e0 08 ret 200830c: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02009b00 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2009b00: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2009b04: 80 a6 60 00 cmp %i1, 0 2009b08: 02 80 00 3c be 2009bf8 <_Objects_Get_name_as_string+0xf8> 2009b0c: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2009b10: 02 80 00 35 be 2009be4 <_Objects_Get_name_as_string+0xe4> 2009b14: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009b18: 02 80 00 35 be 2009bec <_Objects_Get_name_as_string+0xec> 2009b1c: 03 00 80 7c sethi %hi(0x201f000), %g1 information = _Objects_Get_information_id( tmpId ); 2009b20: 7f ff ff ba call 2009a08 <_Objects_Get_information_id> 2009b24: 90 10 00 18 mov %i0, %o0 if ( !information ) 2009b28: 80 a2 20 00 cmp %o0, 0 2009b2c: 02 80 00 33 be 2009bf8 <_Objects_Get_name_as_string+0xf8> 2009b30: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2009b34: 40 00 00 34 call 2009c04 <_Objects_Get> 2009b38: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 2009b3c: c2 07 bf fc ld [ %fp + -4 ], %g1 2009b40: 80 a0 60 00 cmp %g1, 0 2009b44: 32 80 00 2e bne,a 2009bfc <_Objects_Get_name_as_string+0xfc> 2009b48: b4 10 20 00 clr %i2 if ( information->is_string ) { s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 2009b4c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 2009b50: c0 2f bf f4 clrb [ %fp + -12 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009b54: 85 30 60 18 srl %g1, 0x18, %g2 lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 2009b58: 87 30 60 08 srl %g1, 8, %g3 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b5c: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 2009b60: c6 2f bf f2 stb %g3, [ %fp + -14 ] lname[ 3 ] = (u32_name >> 0) & 0xff; 2009b64: c2 2f bf f3 stb %g1, [ %fp + -13 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009b68: c4 2f bf f0 stb %g2, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2009b6c: c8 2f bf f1 stb %g4, [ %fp + -15 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2009b70: 86 10 00 02 mov %g2, %g3 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b74: b2 86 7f ff addcc %i1, -1, %i1 2009b78: 02 80 00 19 be 2009bdc <_Objects_Get_name_as_string+0xdc> <== NEVER TAKEN 2009b7c: 82 10 00 1a mov %i2, %g1 2009b80: 80 a0 a0 00 cmp %g2, 0 2009b84: 02 80 00 16 be 2009bdc <_Objects_Get_name_as_string+0xdc> 2009b88: 1f 00 80 78 sethi %hi(0x201e000), %o7 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; s = lname; 2009b8c: 84 07 bf f0 add %fp, -16, %g2 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 2009b90: b2 06 80 19 add %i2, %i1, %i1 2009b94: 10 80 00 05 b 2009ba8 <_Objects_Get_name_as_string+0xa8> 2009b98: 9e 13 e1 1c or %o7, 0x11c, %o7 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009b9c: 80 a1 20 00 cmp %g4, 0 2009ba0: 02 80 00 0f be 2009bdc <_Objects_Get_name_as_string+0xdc> 2009ba4: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2009ba8: f0 03 c0 00 ld [ %o7 ], %i0 2009bac: 88 08 e0 ff and %g3, 0xff, %g4 2009bb0: 88 06 00 04 add %i0, %g4, %g4 2009bb4: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2009bb8: 80 89 20 97 btst 0x97, %g4 2009bbc: 12 80 00 03 bne 2009bc8 <_Objects_Get_name_as_string+0xc8> 2009bc0: 84 00 a0 01 inc %g2 2009bc4: 86 10 20 2a mov 0x2a, %g3 2009bc8: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2009bcc: 82 00 60 01 inc %g1 2009bd0: 80 a0 40 19 cmp %g1, %i1 2009bd4: 32 bf ff f2 bne,a 2009b9c <_Objects_Get_name_as_string+0x9c> 2009bd8: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2009bdc: 40 00 03 b8 call 200aabc <_Thread_Enable_dispatch> 2009be0: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 2009be4: 81 c7 e0 08 ret 2009be8: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2009bec: c2 00 60 b8 ld [ %g1 + 0xb8 ], %g1 2009bf0: 10 bf ff cc b 2009b20 <_Objects_Get_name_as_string+0x20> 2009bf4: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2009bf8: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2009bfc: 81 c7 e0 08 ret 2009c00: 91 e8 00 1a restore %g0, %i2, %o0 =============================================================================== 02007f98 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2007f98: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2007f9c: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 2007fa0: 80 a6 20 00 cmp %i0, 0 2007fa4: 02 80 00 19 be 2008008 <_Objects_Get_next+0x70> 2007fa8: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 2007fac: 80 a6 a0 00 cmp %i2, 0 2007fb0: 02 80 00 16 be 2008008 <_Objects_Get_next+0x70> 2007fb4: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2007fb8: 02 80 00 14 be 2008008 <_Objects_Get_next+0x70> 2007fbc: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2007fc0: 80 a0 60 00 cmp %g1, 0 2007fc4: 22 80 00 13 be,a 2008010 <_Objects_Get_next+0x78> 2007fc8: f2 06 20 08 ld [ %i0 + 8 ], %i1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fcc: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2007fd0: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007fd4: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fd8: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007fdc: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2007fe0: 80 a0 80 01 cmp %g2, %g1 2007fe4: 0a 80 00 13 bcs 2008030 <_Objects_Get_next+0x98> 2007fe8: 94 10 00 1a mov %i2, %o2 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2007fec: 40 00 00 18 call 200804c <_Objects_Get> 2007ff0: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2007ff4: c2 06 80 00 ld [ %i2 ], %g1 2007ff8: 80 a0 60 00 cmp %g1, 0 2007ffc: 32 bf ff f5 bne,a 2007fd0 <_Objects_Get_next+0x38> 2008000: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 2008004: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2008008: 81 c7 e0 08 ret 200800c: 91 e8 00 08 restore %g0, %o0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008010: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 2008014: 83 2e 60 10 sll %i1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008018: 92 10 00 19 mov %i1, %o1 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 200801c: 83 30 60 10 srl %g1, 0x10, %g1 *location_p = OBJECTS_ERROR; goto final; } /* try to grab one */ object = _Objects_Get(information, next_id, location_p); 2008020: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2008024: 80 a0 80 01 cmp %g2, %g1 2008028: 1a bf ff f1 bcc 2007fec <_Objects_Get_next+0x54> <== ALWAYS TAKEN 200802c: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2008030: 82 10 20 01 mov 1, %g1 2008034: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2008038: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 200803c: 82 10 3f ff mov -1, %g1 2008040: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2008044: 81 c7 e0 08 ret 2008048: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02008d68 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2008d68: 9d e3 bf 98 save %sp, -104, %sp /* * Caller is trusted for name != NULL. */ tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2008d6c: 80 a6 20 00 cmp %i0, 0 2008d70: 12 80 00 06 bne 2008d88 <_Objects_Id_to_name+0x20> 2008d74: 83 36 20 18 srl %i0, 0x18, %g1 2008d78: 03 00 80 76 sethi %hi(0x201d800), %g1 2008d7c: c2 00 61 18 ld [ %g1 + 0x118 ], %g1 ! 201d918 <_Per_CPU_Information+0xc> 2008d80: f0 00 60 08 ld [ %g1 + 8 ], %i0 2008d84: 83 36 20 18 srl %i0, 0x18, %g1 2008d88: 82 08 60 07 and %g1, 7, %g1 */ RTEMS_INLINE_ROUTINE bool _Objects_Is_api_valid( uint32_t the_api ) { if ( !the_api || the_api > OBJECTS_APIS_LAST ) 2008d8c: 84 00 7f ff add %g1, -1, %g2 2008d90: 80 a0 a0 02 cmp %g2, 2 2008d94: 18 80 00 17 bgu 2008df0 <_Objects_Id_to_name+0x88> 2008d98: ba 10 20 03 mov 3, %i5 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 2008d9c: 83 28 60 02 sll %g1, 2, %g1 2008da0: 05 00 80 75 sethi %hi(0x201d400), %g2 2008da4: 84 10 a2 48 or %g2, 0x248, %g2 ! 201d648 <_Objects_Information_table> 2008da8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2008dac: 80 a0 60 00 cmp %g1, 0 2008db0: 02 80 00 10 be 2008df0 <_Objects_Id_to_name+0x88> 2008db4: 85 36 20 1b srl %i0, 0x1b, %g2 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 2008db8: 85 28 a0 02 sll %g2, 2, %g2 2008dbc: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2008dc0: 80 a2 20 00 cmp %o0, 0 2008dc4: 02 80 00 0b be 2008df0 <_Objects_Id_to_name+0x88> <== NEVER TAKEN 2008dc8: 92 10 00 18 mov %i0, %o1 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2008dcc: 7f ff ff c9 call 2008cf0 <_Objects_Get> 2008dd0: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2008dd4: 80 a2 20 00 cmp %o0, 0 2008dd8: 02 80 00 06 be 2008df0 <_Objects_Id_to_name+0x88> 2008ddc: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2008de0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2008de4: ba 10 20 00 clr %i5 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 2008de8: 40 00 03 94 call 2009c38 <_Thread_Enable_dispatch> 2008dec: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2008df0: 81 c7 e0 08 ret 2008df4: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 0200858c <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 200858c: 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 ); 2008590: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 2008594: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2008598: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 200859c: 92 10 00 1c mov %i4, %o1 20085a0: 40 00 3c d7 call 20178fc <.udiv> 20085a4: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 20085a8: 80 a2 20 00 cmp %o0, 0 20085ac: 02 80 00 34 be 200867c <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 20085b0: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 20085b4: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 20085b8: c2 01 00 00 ld [ %g4 ], %g1 20085bc: 80 a7 00 01 cmp %i4, %g1 20085c0: 02 80 00 0f be 20085fc <_Objects_Shrink_information+0x70> <== NEVER TAKEN 20085c4: 82 10 20 00 clr %g1 20085c8: 10 80 00 07 b 20085e4 <_Objects_Shrink_information+0x58> 20085cc: b6 10 20 04 mov 4, %i3 * the_block - the block to remove * * Output parameters: NONE */ void _Objects_Shrink_information( 20085d0: 86 06 e0 04 add %i3, 4, %g3 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 ] == 20085d4: 80 a7 00 02 cmp %i4, %g2 20085d8: 02 80 00 0a be 2008600 <_Objects_Shrink_information+0x74> 20085dc: ba 07 40 1c add %i5, %i4, %i5 20085e0: b6 10 00 03 mov %g3, %i3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 20085e4: 82 00 60 01 inc %g1 20085e8: 80 a0 40 08 cmp %g1, %o0 20085ec: 32 bf ff f9 bne,a 20085d0 <_Objects_Shrink_information+0x44> 20085f0: c4 01 00 1b ld [ %g4 + %i3 ], %g2 20085f4: 81 c7 e0 08 ret 20085f8: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 20085fc: b6 10 20 00 clr %i3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2008600: 10 80 00 06 b 2008618 <_Objects_Shrink_information+0x8c> 2008604: 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 ); 2008608: 80 a7 20 00 cmp %i4, 0 200860c: 22 80 00 12 be,a 2008654 <_Objects_Shrink_information+0xc8> 2008610: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 2008614: 90 10 00 1c mov %i4, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2008618: 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) && 200861c: 80 a0 40 1d cmp %g1, %i5 2008620: 0a bf ff fa bcs 2008608 <_Objects_Shrink_information+0x7c> 2008624: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 2008628: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 200862c: 84 07 40 02 add %i5, %g2, %g2 /* * 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) && 2008630: 80 a0 40 02 cmp %g1, %g2 2008634: 1a bf ff f6 bcc 200860c <_Objects_Shrink_information+0x80> 2008638: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 200863c: 7f ff fb 63 call 20073c8 <_Chain_Extract> 2008640: 01 00 00 00 nop } } while ( the_object ); 2008644: 80 a7 20 00 cmp %i4, 0 2008648: 12 bf ff f4 bne 2008618 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 200864c: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2008650: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2008654: 40 00 07 bb call 200a540 <_Workspace_Free> 2008658: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 200865c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2008660: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 2008664: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 2008668: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 200866c: c2 16 20 14 lduh [ %i0 + 0x14 ], %g1 * 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; 2008670: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 2008674: 82 20 80 01 sub %g2, %g1, %g1 2008678: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 200867c: 81 c7 e0 08 ret 2008680: 81 e8 00 00 restore =============================================================================== 0200dadc <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200dadc: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200dae0: 80 a6 60 00 cmp %i1, 0 200dae4: 02 80 00 4c be 200dc14 <_RBTree_Extract_unprotected+0x138> 200dae8: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200daec: c2 06 20 08 ld [ %i0 + 8 ], %g1 200daf0: 80 a0 40 19 cmp %g1, %i1 200daf4: 22 80 00 59 be,a 200dc58 <_RBTree_Extract_unprotected+0x17c> 200daf8: c2 06 60 08 ld [ %i1 + 8 ], %g1 the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200dafc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200db00: 80 a0 40 19 cmp %g1, %i1 200db04: 22 80 00 46 be,a 200dc1c <_RBTree_Extract_unprotected+0x140> 200db08: c2 06 60 04 ld [ %i1 + 4 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200db0c: fa 06 60 04 ld [ %i1 + 4 ], %i5 200db10: 80 a7 60 00 cmp %i5, 0 200db14: 22 80 00 4a be,a 200dc3c <_RBTree_Extract_unprotected+0x160> 200db18: f8 06 60 08 ld [ %i1 + 8 ], %i4 200db1c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200db20: 80 a0 60 00 cmp %g1, 0 200db24: 32 80 00 05 bne,a 200db38 <_RBTree_Extract_unprotected+0x5c> 200db28: c2 07 60 08 ld [ %i5 + 8 ], %g1 200db2c: 10 80 00 50 b 200dc6c <_RBTree_Extract_unprotected+0x190> 200db30: b8 10 00 1d mov %i5, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 200db34: c2 07 60 08 ld [ %i5 + 8 ], %g1 200db38: 80 a0 60 00 cmp %g1, 0 200db3c: 32 bf ff fe bne,a 200db34 <_RBTree_Extract_unprotected+0x58> 200db40: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 200db44: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200db48: 80 a7 20 00 cmp %i4, 0 200db4c: 02 80 00 54 be 200dc9c <_RBTree_Extract_unprotected+0x1c0> 200db50: 01 00 00 00 nop leaf->parent = target->parent; 200db54: c2 07 40 00 ld [ %i5 ], %g1 200db58: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200db5c: c4 07 40 00 ld [ %i5 ], %g2 target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200db60: c2 06 40 00 ld [ %i1 ], %g1 } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200db64: c8 00 a0 04 ld [ %g2 + 4 ], %g4 leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 200db68: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200db6c: 88 19 00 1d xor %g4, %i5, %g4 200db70: 80 a0 00 04 cmp %g0, %g4 200db74: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200db78: 89 29 20 02 sll %g4, 2, %g4 200db7c: 84 00 80 04 add %g2, %g4, %g2 200db80: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200db84: c4 00 60 04 ld [ %g1 + 4 ], %g2 200db88: 84 18 80 19 xor %g2, %i1, %g2 200db8c: 80 a0 00 02 cmp %g0, %g2 200db90: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200db94: 85 28 a0 02 sll %g2, 2, %g2 200db98: 82 00 40 02 add %g1, %g2, %g1 200db9c: fa 20 60 04 st %i5, [ %g1 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 200dba0: c2 06 60 08 ld [ %i1 + 8 ], %g1 200dba4: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200dba8: c2 06 60 08 ld [ %i1 + 8 ], %g1 200dbac: 80 a0 60 00 cmp %g1, 0 200dbb0: 32 80 00 02 bne,a 200dbb8 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200dbb4: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200dbb8: c2 06 60 04 ld [ %i1 + 4 ], %g1 200dbbc: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200dbc0: c2 06 60 04 ld [ %i1 + 4 ], %g1 200dbc4: 80 a0 60 00 cmp %g1, 0 200dbc8: 32 80 00 02 bne,a 200dbd0 <_RBTree_Extract_unprotected+0xf4> 200dbcc: fa 20 40 00 st %i5, [ %g1 ] /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200dbd0: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200dbd4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200dbd8: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200dbdc: c2 27 60 0c st %g1, [ %i5 + 0xc ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 200dbe0: 80 a0 e0 00 cmp %g3, 0 200dbe4: 32 80 00 06 bne,a 200dbfc <_RBTree_Extract_unprotected+0x120> 200dbe8: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200dbec: 80 a7 20 00 cmp %i4, 0 200dbf0: 32 80 00 02 bne,a 200dbf8 <_RBTree_Extract_unprotected+0x11c> 200dbf4: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 200dbf8: c2 06 20 04 ld [ %i0 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE void _RBTree_Set_off_rbtree( RBTree_Node *node ) { node->parent = node->child[RBT_LEFT] = node->child[RBT_RIGHT] = NULL; 200dbfc: c0 26 60 08 clr [ %i1 + 8 ] 200dc00: c0 26 60 04 clr [ %i1 + 4 ] 200dc04: 80 a0 60 00 cmp %g1, 0 200dc08: 02 80 00 03 be 200dc14 <_RBTree_Extract_unprotected+0x138> 200dc0c: c0 26 40 00 clr [ %i1 ] 200dc10: c0 20 60 0c clr [ %g1 + 0xc ] 200dc14: 81 c7 e0 08 ret 200dc18: 81 e8 00 00 restore the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 200dc1c: 80 a0 60 00 cmp %g1, 0 200dc20: 22 80 00 28 be,a 200dcc0 <_RBTree_Extract_unprotected+0x1e4> 200dc24: c2 06 40 00 ld [ %i1 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200dc28: fa 06 60 04 ld [ %i1 + 4 ], %i5 200dc2c: 80 a7 60 00 cmp %i5, 0 200dc30: 12 bf ff bb bne 200db1c <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN 200dc34: c2 26 20 0c st %g1, [ %i0 + 0xc ] * the_node's location in the tree. This may cause the coloring to be * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; 200dc38: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED if( leaf ) { 200dc3c: 80 a7 20 00 cmp %i4, 0 200dc40: 32 80 00 0c bne,a 200dc70 <_RBTree_Extract_unprotected+0x194> 200dc44: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); 200dc48: 7f ff fe e0 call 200d7c8 <_RBTree_Extract_validate_unprotected> 200dc4c: 90 10 00 19 mov %i1, %o0 } victim_color = the_node->color; /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200dc50: 10 80 00 0a b 200dc78 <_RBTree_Extract_unprotected+0x19c> 200dc54: c2 06 40 00 ld [ %i1 ], %g1 if (!the_node) return; /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) 200dc58: 80 a0 60 00 cmp %g1, 0 200dc5c: 22 80 00 14 be,a 200dcac <_RBTree_Extract_unprotected+0x1d0> 200dc60: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 200dc64: 10 bf ff a6 b 200dafc <_RBTree_Extract_unprotected+0x20> 200dc68: c2 26 20 08 st %g1, [ %i0 + 8 ] * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 200dc6c: c2 06 40 00 ld [ %i1 ], %g1 200dc70: c2 27 00 00 st %g1, [ %i4 ] _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200dc74: c2 06 40 00 ld [ %i1 ], %g1 leaf->parent = the_node->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); } victim_color = the_node->color; 200dc78: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200dc7c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200dc80: 84 18 80 19 xor %g2, %i1, %g2 200dc84: 80 a0 00 02 cmp %g0, %g2 200dc88: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200dc8c: 85 28 a0 02 sll %g2, 2, %g2 200dc90: 82 00 40 02 add %g1, %g2, %g1 200dc94: 10 bf ff d3 b 200dbe0 <_RBTree_Extract_unprotected+0x104> 200dc98: f8 20 60 04 st %i4, [ %g1 + 4 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 200dc9c: 7f ff fe cb call 200d7c8 <_RBTree_Extract_validate_unprotected> 200dca0: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200dca4: 10 bf ff af b 200db60 <_RBTree_Extract_unprotected+0x84> 200dca8: c4 07 40 00 ld [ %i5 ], %g2 if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200dcac: 80 a6 00 01 cmp %i0, %g1 200dcb0: 12 bf ff 93 bne 200dafc <_RBTree_Extract_unprotected+0x20> 200dcb4: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 200dcb8: 10 bf ff 91 b 200dafc <_RBTree_Extract_unprotected+0x20> 200dcbc: c0 26 20 08 clr [ %i0 + 8 ] if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200dcc0: 80 a6 00 01 cmp %i0, %g1 200dcc4: 12 bf ff 92 bne 200db0c <_RBTree_Extract_unprotected+0x30> 200dcc8: c2 26 20 0c st %g1, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 200dccc: 10 bf ff 90 b 200db0c <_RBTree_Extract_unprotected+0x30> 200dcd0: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 0200d7c8 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 200d7c8: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200d7cc: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; 200d7d0: c4 00 40 00 ld [ %g1 ], %g2 200d7d4: 80 a0 a0 00 cmp %g2, 0 200d7d8: 02 80 00 bf be 200dad4 <_RBTree_Extract_validate_unprotected+0x30c> 200d7dc: 01 00 00 00 nop { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200d7e0: c4 00 60 04 ld [ %g1 + 4 ], %g2 200d7e4: 80 a6 00 02 cmp %i0, %g2 200d7e8: 22 80 00 02 be,a 200d7f0 <_RBTree_Extract_validate_unprotected+0x28> 200d7ec: c4 00 60 08 ld [ %g1 + 8 ], %g2 } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 200d7f0: 98 10 20 01 mov 1, %o4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200d7f4: c6 06 20 0c ld [ %i0 + 0xc ], %g3 200d7f8: 80 a0 e0 01 cmp %g3, 1 200d7fc: 22 80 00 58 be,a 200d95c <_RBTree_Extract_validate_unprotected+0x194> 200d800: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 200d804: c6 00 40 00 ld [ %g1 ], %g3 200d808: 80 a0 e0 00 cmp %g3, 0 200d80c: 02 80 00 53 be 200d958 <_RBTree_Extract_validate_unprotected+0x190> 200d810: 80 a0 a0 00 cmp %g2, 0 200d814: 22 80 00 07 be,a 200d830 <_RBTree_Extract_validate_unprotected+0x68><== NEVER TAKEN 200d818: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200d81c: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200d820: 80 a1 20 01 cmp %g4, 1 200d824: 22 80 00 28 be,a 200d8c4 <_RBTree_Extract_validate_unprotected+0xfc> 200d828: de 00 60 04 ld [ %g1 + 4 ], %o7 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 200d82c: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200d830: 80 a0 e0 00 cmp %g3, 0 200d834: 22 80 00 07 be,a 200d850 <_RBTree_Extract_validate_unprotected+0x88> 200d838: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200d83c: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200d840: 80 a0 e0 01 cmp %g3, 1 200d844: 22 80 00 4c be,a 200d974 <_RBTree_Extract_validate_unprotected+0x1ac> 200d848: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200d84c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200d850: 80 a0 e0 00 cmp %g3, 0 200d854: 22 80 00 07 be,a 200d870 <_RBTree_Extract_validate_unprotected+0xa8> 200d858: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 200d85c: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200d860: 80 a0 e0 01 cmp %g3, 1 200d864: 22 80 00 44 be,a 200d974 <_RBTree_Extract_validate_unprotected+0x1ac> 200d868: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200d86c: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 200d870: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200d874: 80 a0 a0 01 cmp %g2, 1 200d878: 22 80 00 38 be,a 200d958 <_RBTree_Extract_validate_unprotected+0x190> 200d87c: c0 20 60 0c clr [ %g1 + 0xc ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 200d880: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200d884: 80 a0 e0 00 cmp %g3, 0 200d888: 02 80 00 0a be 200d8b0 <_RBTree_Extract_validate_unprotected+0xe8><== NEVER TAKEN 200d88c: 84 10 20 00 clr %g2 if(!(the_node->parent->parent)) return NULL; 200d890: c8 00 c0 00 ld [ %g3 ], %g4 200d894: 80 a1 20 00 cmp %g4, 0 200d898: 02 80 00 07 be 200d8b4 <_RBTree_Extract_validate_unprotected+0xec> 200d89c: b0 10 00 01 mov %g1, %i0 if(the_node == the_node->parent->child[RBT_LEFT]) 200d8a0: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200d8a4: 80 a0 40 02 cmp %g1, %g2 200d8a8: 22 80 00 05 be,a 200d8bc <_RBTree_Extract_validate_unprotected+0xf4> 200d8ac: c4 00 e0 08 ld [ %g3 + 8 ], %g2 c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; the_node->parent = c; 200d8b0: b0 10 00 01 mov %g1, %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200d8b4: 10 bf ff d0 b 200d7f4 <_RBTree_Extract_validate_unprotected+0x2c> 200d8b8: 82 10 00 03 mov %g3, %g1 200d8bc: 10 bf ff ce b 200d7f4 <_RBTree_Extract_validate_unprotected+0x2c> 200d8c0: 82 10 00 03 mov %g3, %g1 * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 200d8c4: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200d8c8: 9e 1b c0 18 xor %o7, %i0, %o7 200d8cc: 80 a0 00 0f cmp %g0, %o7 200d8d0: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200d8d4: 88 21 00 0d sub %g4, %o5, %g4 200d8d8: 89 29 20 02 sll %g4, 2, %g4 200d8dc: 88 00 40 04 add %g1, %g4, %g4 200d8e0: de 01 20 04 ld [ %g4 + 4 ], %o7 200d8e4: 80 a3 e0 00 cmp %o7, 0 200d8e8: 02 80 00 16 be 200d940 <_RBTree_Extract_validate_unprotected+0x178><== NEVER TAKEN 200d8ec: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200d8f0: 85 2b 60 02 sll %o5, 2, %g2 200d8f4: 96 03 c0 02 add %o7, %g2, %o3 200d8f8: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200d8fc: d4 21 20 04 st %o2, [ %g4 + 4 ] if (c->child[dir]) 200d900: c8 02 e0 04 ld [ %o3 + 4 ], %g4 200d904: 80 a1 20 00 cmp %g4, 0 200d908: 02 80 00 04 be 200d918 <_RBTree_Extract_validate_unprotected+0x150><== NEVER TAKEN 200d90c: 84 03 c0 02 add %o7, %g2, %g2 c->child[dir]->parent = the_node; 200d910: c2 21 00 00 st %g1, [ %g4 ] 200d914: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200d918: c2 20 a0 04 st %g1, [ %g2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200d91c: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200d920: c6 23 c0 00 st %g3, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200d924: 84 18 40 02 xor %g1, %g2, %g2 c->parent = the_node->parent; the_node->parent = c; 200d928: de 20 40 00 st %o7, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200d92c: 80 a0 00 02 cmp %g0, %g2 200d930: 84 40 20 00 addx %g0, 0, %g2 200d934: 85 28 a0 02 sll %g2, 2, %g2 200d938: 86 00 c0 02 add %g3, %g2, %g3 200d93c: de 20 e0 04 st %o7, [ %g3 + 4 ] _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; 200d940: 80 a0 00 0d cmp %g0, %o5 200d944: 84 60 3f ff subx %g0, -1, %g2 200d948: 85 28 a0 02 sll %g2, 2, %g2 200d94c: 84 00 40 02 add %g1, %g2, %g2 200d950: 10 bf ff b7 b 200d82c <_RBTree_Extract_validate_unprotected+0x64> 200d954: c4 00 a0 04 ld [ %g2 + 4 ], %g2 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200d958: c2 06 00 00 ld [ %i0 ], %g1 200d95c: c2 00 40 00 ld [ %g1 ], %g1 200d960: 80 a0 60 00 cmp %g1, 0 200d964: 22 80 00 02 be,a 200d96c <_RBTree_Extract_validate_unprotected+0x1a4> 200d968: c0 26 20 0c clr [ %i0 + 0xc ] 200d96c: 81 c7 e0 08 ret 200d970: 81 e8 00 00 restore * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 200d974: 86 18 c0 18 xor %g3, %i0, %g3 200d978: 80 a0 00 03 cmp %g0, %g3 200d97c: 86 40 20 00 addx %g0, 0, %g3 if (!_RBTree_Is_red(sibling->child[!dir])) { 200d980: 80 a0 00 03 cmp %g0, %g3 200d984: 9e 60 3f ff subx %g0, -1, %o7 200d988: 9f 2b e0 02 sll %o7, 2, %o7 200d98c: 88 00 80 0f add %g2, %o7, %g4 200d990: c8 01 20 04 ld [ %g4 + 4 ], %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200d994: 80 a1 20 00 cmp %g4, 0 200d998: 22 80 00 07 be,a 200d9b4 <_RBTree_Extract_validate_unprotected+0x1ec> 200d99c: 89 28 e0 02 sll %g3, 2, %g4 200d9a0: da 01 20 0c ld [ %g4 + 0xc ], %o5 200d9a4: 80 a3 60 01 cmp %o5, 1 200d9a8: 22 80 00 28 be,a 200da48 <_RBTree_Extract_validate_unprotected+0x280> 200d9ac: de 00 60 0c ld [ %g1 + 0xc ], %o7 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200d9b0: 89 28 e0 02 sll %g3, 2, %g4 200d9b4: 88 00 80 04 add %g2, %g4, %g4 200d9b8: d6 01 20 04 ld [ %g4 + 4 ], %o3 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 200d9bc: 88 10 20 01 mov 1, %g4 sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); 200d9c0: 98 18 e0 01 xor %g3, 1, %o4 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[!dir])) { sibling->color = RBT_RED; 200d9c4: c8 20 a0 0c st %g4, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200d9c8: 9a 21 00 0c sub %g4, %o4, %o5 200d9cc: 9b 2b 60 02 sll %o5, 2, %o5 200d9d0: 9a 00 80 0d add %g2, %o5, %o5 200d9d4: c8 03 60 04 ld [ %o5 + 4 ], %g4 200d9d8: 80 a1 20 00 cmp %g4, 0 200d9dc: 02 80 00 16 be 200da34 <_RBTree_Extract_validate_unprotected+0x26c><== NEVER TAKEN 200d9e0: c0 22 e0 0c clr [ %o3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200d9e4: 99 2b 20 02 sll %o4, 2, %o4 200d9e8: 96 01 00 0c add %g4, %o4, %o3 200d9ec: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200d9f0: d4 23 60 04 st %o2, [ %o5 + 4 ] if (c->child[dir]) 200d9f4: da 02 e0 04 ld [ %o3 + 4 ], %o5 200d9f8: 80 a3 60 00 cmp %o5, 0 200d9fc: 32 80 00 02 bne,a 200da04 <_RBTree_Extract_validate_unprotected+0x23c> 200da00: c4 23 40 00 st %g2, [ %o5 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da04: da 00 80 00 ld [ %g2 ], %o5 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200da08: 98 01 00 0c add %g4, %o4, %o4 200da0c: c4 23 20 04 st %g2, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da10: d8 03 60 04 ld [ %o5 + 4 ], %o4 c->parent = the_node->parent; 200da14: da 21 00 00 st %o5, [ %g4 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da18: 98 18 80 0c xor %g2, %o4, %o4 c->parent = the_node->parent; the_node->parent = c; 200da1c: c8 20 80 00 st %g4, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da20: 80 a0 00 0c cmp %g0, %o4 200da24: 84 40 20 00 addx %g0, 0, %g2 200da28: 85 28 a0 02 sll %g2, 2, %g2 200da2c: 9a 03 40 02 add %o5, %g2, %o5 200da30: c8 23 60 04 st %g4, [ %o5 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; 200da34: 84 00 40 0f add %g1, %o7, %g2 200da38: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200da3c: 9e 00 80 0f add %g2, %o7, %o7 200da40: c8 03 e0 04 ld [ %o7 + 4 ], %g4 } sibling->color = parent->color; 200da44: de 00 60 0c ld [ %g1 + 0xc ], %o7 200da48: de 20 a0 0c st %o7, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200da4c: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200da50: 9e 10 20 01 mov 1, %o7 200da54: 9e 23 c0 03 sub %o7, %g3, %o7 200da58: 9f 2b e0 02 sll %o7, 2, %o7 200da5c: 9e 00 40 0f add %g1, %o7, %o7 200da60: c4 03 e0 04 ld [ %o7 + 4 ], %g2 200da64: 80 a0 a0 00 cmp %g2, 0 200da68: 02 bf ff bc be 200d958 <_RBTree_Extract_validate_unprotected+0x190><== NEVER TAKEN 200da6c: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200da70: 87 28 e0 02 sll %g3, 2, %g3 200da74: 88 00 80 03 add %g2, %g3, %g4 200da78: da 01 20 04 ld [ %g4 + 4 ], %o5 200da7c: da 23 e0 04 st %o5, [ %o7 + 4 ] if (c->child[dir]) 200da80: c8 01 20 04 ld [ %g4 + 4 ], %g4 200da84: 80 a1 20 00 cmp %g4, 0 200da88: 32 80 00 02 bne,a 200da90 <_RBTree_Extract_validate_unprotected+0x2c8> 200da8c: c2 21 00 00 st %g1, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da90: c8 00 40 00 ld [ %g1 ], %g4 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200da94: 86 00 80 03 add %g2, %g3, %g3 200da98: c2 20 e0 04 st %g1, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200da9c: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; 200daa0: c8 20 80 00 st %g4, [ %g2 ] the_node->parent = c; 200daa4: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200daa8: 86 18 40 03 xor %g1, %g3, %g3 200daac: 80 a0 00 03 cmp %g0, %g3 200dab0: 82 40 20 00 addx %g0, 0, %g1 200dab4: 83 28 60 02 sll %g1, 2, %g1 200dab8: 88 01 00 01 add %g4, %g1, %g4 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200dabc: c2 06 00 00 ld [ %i0 ], %g1 200dac0: c4 21 20 04 st %g2, [ %g4 + 4 ] 200dac4: c2 00 40 00 ld [ %g1 ], %g1 200dac8: 80 a0 60 00 cmp %g1, 0 200dacc: 22 bf ff a8 be,a 200d96c <_RBTree_Extract_validate_unprotected+0x1a4><== NEVER TAKEN 200dad0: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 200dad4: 81 c7 e0 08 ret 200dad8: 81 e8 00 00 restore =============================================================================== 02009e98 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 2009e98: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 2009e9c: 7f ff e6 8a call 20038c4 2009ea0: b8 10 00 18 mov %i0, %i4 2009ea4: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 2009ea8: f6 06 20 04 ld [ %i0 + 4 ], %i3 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 2009eac: 80 a6 e0 00 cmp %i3, 0 2009eb0: 02 80 00 15 be 2009f04 <_RBTree_Find+0x6c> <== NEVER TAKEN 2009eb4: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 2009eb8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2009ebc: 92 10 00 1b mov %i3, %o1 2009ec0: 9f c0 40 00 call %g1 2009ec4: 90 10 00 19 mov %i1, %o0 if (compare_result == 0) { 2009ec8: 80 a2 20 00 cmp %o0, 0 2009ecc: 12 80 00 06 bne 2009ee4 <_RBTree_Find+0x4c> 2009ed0: 82 1a 20 01 xor %o0, 1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 2009ed4: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 2009ed8: 80 a0 a0 00 cmp %g2, 0 2009edc: 12 80 00 0e bne 2009f14 <_RBTree_Find+0x7c> 2009ee0: b0 10 00 1b mov %i3, %i0 break; } RBTree_Direction dir = (compare_result == 1); 2009ee4: 80 a0 00 01 cmp %g0, %g1 2009ee8: 82 60 3f ff subx %g0, -1, %g1 iter_node = iter_node->child[dir]; 2009eec: 83 28 60 02 sll %g1, 2, %g1 2009ef0: b6 06 c0 01 add %i3, %g1, %i3 2009ef4: f6 06 e0 04 ld [ %i3 + 4 ], %i3 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 2009ef8: 80 a6 e0 00 cmp %i3, 0 2009efc: 32 bf ff f0 bne,a 2009ebc <_RBTree_Find+0x24> 2009f00: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 2009f04: 7f ff e6 74 call 20038d4 2009f08: 90 10 00 1d mov %i5, %o0 return return_node; } 2009f0c: 81 c7 e0 08 ret 2009f10: 81 e8 00 00 restore RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 2009f14: 7f ff e6 70 call 20038d4 2009f18: 90 10 00 1d mov %i5, %o0 return return_node; } 2009f1c: 81 c7 e0 08 ret 2009f20: 81 e8 00 00 restore =============================================================================== 0200a20c <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200a20c: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200a210: 80 a6 20 00 cmp %i0, 0 200a214: 02 80 00 0f be 200a250 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200a218: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200a21c: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200a220: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200a224: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200a228: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200a22c: f2 26 20 10 st %i1, [ %i0 + 0x10 ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200a230: 02 80 00 08 be 200a250 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200a234: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert(the_rbtree, next); 200a238: 92 10 00 1a mov %i2, %o1 200a23c: 7f ff ff ef call 200a1f8 <_RBTree_Insert> 200a240: 90 10 00 18 mov %i0, %o0 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200a244: b6 86 ff ff addcc %i3, -1, %i3 200a248: 12 bf ff fc bne 200a238 <_RBTree_Initialize+0x2c> 200a24c: b4 06 80 1c add %i2, %i4, %i2 200a250: 81 c7 e0 08 ret 200a254: 81 e8 00 00 restore =============================================================================== 0200dcfc <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 200dcfc: 9d e3 bf a0 save %sp, -96, %sp } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200dd00: 96 10 20 01 mov 1, %o3 ISR_Level level; _ISR_Disable( level ); return _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 200dd04: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200dd08: c4 00 40 00 ld [ %g1 ], %g2 200dd0c: 86 90 a0 00 orcc %g2, 0, %g3 200dd10: 22 80 00 06 be,a 200dd28 <_RBTree_Validate_insert_unprotected+0x2c> 200dd14: c0 26 20 0c clr [ %i0 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200dd18: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200dd1c: 80 a1 20 01 cmp %g4, 1 200dd20: 22 80 00 04 be,a 200dd30 <_RBTree_Validate_insert_unprotected+0x34> 200dd24: c8 00 80 00 ld [ %g2 ], %g4 200dd28: 81 c7 e0 08 ret 200dd2c: 81 e8 00 00 restore ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(!(the_node->parent->parent->parent)) return NULL; 200dd30: 80 a1 20 00 cmp %g4, 0 200dd34: 02 80 00 0c be 200dd64 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN 200dd38: de 00 a0 04 ld [ %g2 + 4 ], %o7 { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200dd3c: 80 a0 40 0f cmp %g1, %o7 200dd40: 02 80 00 59 be 200dea4 <_RBTree_Validate_insert_unprotected+0x1a8> 200dd44: 88 10 00 0f mov %o7, %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200dd48: 80 a1 20 00 cmp %g4, 0 200dd4c: 22 80 00 07 be,a 200dd68 <_RBTree_Validate_insert_unprotected+0x6c> 200dd50: c8 00 60 04 ld [ %g1 + 4 ], %g4 200dd54: da 01 20 0c ld [ %g4 + 0xc ], %o5 200dd58: 80 a3 60 01 cmp %o5, 1 200dd5c: 22 80 00 4c be,a 200de8c <_RBTree_Validate_insert_unprotected+0x190> 200dd60: c0 20 60 0c clr [ %g1 + 0xc ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200dd64: c8 00 60 04 ld [ %g1 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 200dd68: 9e 18 40 0f xor %g1, %o7, %o7 the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200dd6c: 88 19 00 18 xor %g4, %i0, %g4 200dd70: 80 a0 00 04 cmp %g0, %g4 200dd74: 9a 40 20 00 addx %g0, 0, %o5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200dd78: 80 a0 00 0f cmp %g0, %o7 200dd7c: 88 40 20 00 addx %g0, 0, %g4 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200dd80: 80 a3 40 04 cmp %o5, %g4 200dd84: 02 80 00 46 be 200de9c <_RBTree_Validate_insert_unprotected+0x1a0> 200dd88: 98 22 c0 0d sub %o3, %o5, %o4 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200dd8c: 98 22 c0 04 sub %o3, %g4, %o4 200dd90: 9b 2b 20 02 sll %o4, 2, %o5 200dd94: 9a 00 40 0d add %g1, %o5, %o5 200dd98: de 03 60 04 ld [ %o5 + 4 ], %o7 200dd9c: 80 a3 e0 00 cmp %o7, 0 200dda0: 02 80 00 16 be 200ddf8 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN 200dda4: 89 29 20 02 sll %g4, 2, %g4 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200dda8: 94 03 c0 04 add %o7, %g4, %o2 200ddac: d2 02 a0 04 ld [ %o2 + 4 ], %o1 200ddb0: d2 23 60 04 st %o1, [ %o5 + 4 ] if (c->child[dir]) 200ddb4: da 02 a0 04 ld [ %o2 + 4 ], %o5 200ddb8: 80 a3 60 00 cmp %o5, 0 200ddbc: 22 80 00 05 be,a 200ddd0 <_RBTree_Validate_insert_unprotected+0xd4> 200ddc0: 9a 03 c0 04 add %o7, %g4, %o5 c->child[dir]->parent = the_node; 200ddc4: c2 23 40 00 st %g1, [ %o5 ] 200ddc8: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200ddcc: 9a 03 c0 04 add %o7, %g4, %o5 200ddd0: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ddd4: da 00 a0 04 ld [ %g2 + 4 ], %o5 c->parent = the_node->parent; 200ddd8: c4 23 c0 00 st %g2, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200dddc: 9a 18 40 0d xor %g1, %o5, %o5 c->parent = the_node->parent; the_node->parent = c; 200dde0: de 20 40 00 st %o7, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200dde4: 80 a0 00 0d cmp %g0, %o5 200dde8: 82 40 20 00 addx %g0, 0, %g1 200ddec: 83 28 60 02 sll %g1, 2, %g1 200ddf0: 84 00 80 01 add %g2, %g1, %g2 200ddf4: de 20 a0 04 st %o7, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200ddf8: b0 06 00 04 add %i0, %g4, %i0 200ddfc: f0 06 20 04 ld [ %i0 + 4 ], %i0 200de00: c2 06 00 00 ld [ %i0 ], %g1 } the_node->parent->color = RBT_BLACK; 200de04: c0 20 60 0c clr [ %g1 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[(1-dir)] == NULL) return; 200de08: 88 00 c0 04 add %g3, %g4, %g4 200de0c: c2 01 20 04 ld [ %g4 + 4 ], %g1 200de10: 80 a0 60 00 cmp %g1, 0 200de14: 02 bf ff bc be 200dd04 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN 200de18: d6 20 e0 0c st %o3, [ %g3 + 0xc ] c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200de1c: 99 2b 20 02 sll %o4, 2, %o4 200de20: 84 00 40 0c add %g1, %o4, %g2 200de24: de 00 a0 04 ld [ %g2 + 4 ], %o7 200de28: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 200de2c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200de30: 80 a0 a0 00 cmp %g2, 0 200de34: 32 80 00 02 bne,a 200de3c <_RBTree_Validate_insert_unprotected+0x140> 200de38: c6 20 80 00 st %g3, [ %g2 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200de3c: c4 00 c0 00 ld [ %g3 ], %g2 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200de40: 98 00 40 0c add %g1, %o4, %o4 200de44: c6 23 20 04 st %g3, [ %o4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200de48: c8 00 a0 04 ld [ %g2 + 4 ], %g4 c->parent = the_node->parent; 200de4c: c4 20 40 00 st %g2, [ %g1 ] the_node->parent = c; 200de50: c2 20 c0 00 st %g1, [ %g3 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200de54: 88 19 00 03 xor %g4, %g3, %g4 200de58: 80 a0 00 04 cmp %g0, %g4 200de5c: 86 40 20 00 addx %g0, 0, %g3 200de60: 87 28 e0 02 sll %g3, 2, %g3 200de64: 84 00 80 03 add %g2, %g3, %g2 200de68: c2 20 a0 04 st %g1, [ %g2 + 4 ] ISR_Level level; _ISR_Disable( level ); return _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 200de6c: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200de70: c4 00 40 00 ld [ %g1 ], %g2 200de74: 86 90 a0 00 orcc %g2, 0, %g3 200de78: 32 bf ff a9 bne,a 200dd1c <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN 200de7c: c8 00 60 0c ld [ %g1 + 0xc ], %g4 /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200de80: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 200de84: 81 c7 e0 08 ret <== NOT EXECUTED 200de88: 81 e8 00 00 restore <== NOT EXECUTED g = the_node->parent->parent; /* if uncle is red, repaint uncle/parent black and grandparent red */ if(_RBTree_Is_red(u)) { the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; 200de8c: c0 21 20 0c clr [ %g4 + 0xc ] g->color = RBT_RED; 200de90: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200de94: 10 bf ff 9c b 200dd04 <_RBTree_Validate_insert_unprotected+0x8> 200de98: b0 10 00 02 mov %g2, %i0 200de9c: 10 bf ff da b 200de04 <_RBTree_Validate_insert_unprotected+0x108> 200dea0: 89 2b 60 02 sll %o5, 2, %g4 if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 200dea4: 10 bf ff a9 b 200dd48 <_RBTree_Validate_insert_unprotected+0x4c> 200dea8: c8 00 a0 08 ld [ %g2 + 8 ], %g4 =============================================================================== 02006d28 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2006d28: 9d e3 bf 98 save %sp, -104, %sp rtems_initialization_tasks_table *user_tasks; /* * Move information into local variables */ user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table; 2006d2c: 03 00 80 6d sethi %hi(0x201b400), %g1 2006d30: 82 10 62 c4 or %g1, 0x2c4, %g1 ! 201b6c4 2006d34: fa 00 60 2c ld [ %g1 + 0x2c ], %i5 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 2006d38: 80 a7 60 00 cmp %i5, 0 2006d3c: 02 80 00 18 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 2006d40: f6 00 60 28 ld [ %g1 + 0x28 ], %i3 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006d44: 80 a6 e0 00 cmp %i3, 0 2006d48: 02 80 00 15 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2006d4c: b8 10 20 00 clr %i4 return_value = rtems_task_create( 2006d50: d4 07 60 04 ld [ %i5 + 4 ], %o2 2006d54: d0 07 40 00 ld [ %i5 ], %o0 2006d58: d2 07 60 08 ld [ %i5 + 8 ], %o1 2006d5c: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 2006d60: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2006d64: 7f ff ff 70 call 2006b24 2006d68: 9a 07 bf fc add %fp, -4, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 2006d6c: 94 92 20 00 orcc %o0, 0, %o2 2006d70: 12 80 00 0d bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d74: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2006d78: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2006d7c: 40 00 00 0e call 2006db4 2006d80: d2 07 60 10 ld [ %i5 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 2006d84: 94 92 20 00 orcc %o0, 0, %o2 2006d88: 12 80 00 07 bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2006d8c: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2006d90: 80 a7 00 1b cmp %i4, %i3 2006d94: 12 bf ff ef bne 2006d50 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2006d98: ba 07 60 1c add %i5, 0x1c, %i5 2006d9c: 81 c7 e0 08 ret 2006da0: 81 e8 00 00 restore id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); 2006da4: 90 10 20 01 mov 1, %o0 2006da8: 40 00 03 ff call 2007da4 <_Internal_error_Occurred> 2006dac: 92 10 20 01 mov 1, %o1 =============================================================================== 0200c5c8 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200c5c8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_API_Control *api; ASR_Information *asr; rtems_signal_set signal_set; Modes_Control prev_mode; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200c5cc: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 if ( !api ) 200c5d0: 80 a7 60 00 cmp %i5, 0 200c5d4: 02 80 00 1e be 200c64c <_RTEMS_tasks_Post_switch_extension+0x84><== NEVER TAKEN 200c5d8: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200c5dc: 7f ff d7 02 call 20021e4 200c5e0: 01 00 00 00 nop signal_set = asr->signals_posted; 200c5e4: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 asr->signals_posted = 0; 200c5e8: c0 27 60 14 clr [ %i5 + 0x14 ] _ISR_Enable( level ); 200c5ec: 7f ff d7 02 call 20021f4 200c5f0: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200c5f4: 80 a7 20 00 cmp %i4, 0 200c5f8: 32 80 00 04 bne,a 200c608 <_RTEMS_tasks_Post_switch_extension+0x40> 200c5fc: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200c600: 81 c7 e0 08 ret 200c604: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c608: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c60c: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c610: 94 07 bf fc add %fp, -4, %o2 200c614: 37 00 00 3f sethi %hi(0xfc00), %i3 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200c618: c2 27 60 1c st %g1, [ %i5 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c61c: 40 00 07 e0 call 200e59c 200c620: 92 16 e3 ff or %i3, 0x3ff, %o1 (*asr->handler)( signal_set ); 200c624: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200c628: 9f c0 40 00 call %g1 200c62c: 90 10 00 1c mov %i4, %o0 asr->nest_level -= 1; 200c630: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c634: d0 07 bf fc ld [ %fp + -4 ], %o0 asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); (*asr->handler)( signal_set ); asr->nest_level -= 1; 200c638: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200c63c: 92 16 e3 ff or %i3, 0x3ff, %o1 200c640: 94 07 bf fc add %fp, -4, %o2 200c644: 40 00 07 d6 call 200e59c 200c648: c2 27 60 1c st %g1, [ %i5 + 0x1c ] 200c64c: 81 c7 e0 08 ret 200c650: 81 e8 00 00 restore =============================================================================== 0200c530 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200c530: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200c534: 80 a0 60 00 cmp %g1, 0 200c538: 22 80 00 0c be,a 200c568 <_RTEMS_tasks_Switch_extension+0x38> 200c53c: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200c540: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200c544: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200c548: c8 00 80 00 ld [ %g2 ], %g4 200c54c: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200c550: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c554: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200c558: 80 a0 60 00 cmp %g1, 0 200c55c: 32 bf ff fa bne,a 200c544 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200c560: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED tvp->tval = *tvp->ptr; *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; 200c564: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200c568: 80 a0 60 00 cmp %g1, 0 200c56c: 02 80 00 0b be 200c598 <_RTEMS_tasks_Switch_extension+0x68> 200c570: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200c574: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200c578: c6 00 60 0c ld [ %g1 + 0xc ], %g3 tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { tvp->gval = *tvp->ptr; 200c57c: c8 00 80 00 ld [ %g2 ], %g4 200c580: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200c584: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200c588: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200c58c: 80 a0 60 00 cmp %g1, 0 200c590: 32 bf ff fa bne,a 200c578 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200c594: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200c598: 81 c3 e0 08 retl =============================================================================== 02007aec <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007aec: 9d e3 bf 98 save %sp, -104, %sp 2007af0: 11 00 80 78 sethi %hi(0x201e000), %o0 2007af4: 92 10 00 18 mov %i0, %o1 2007af8: 90 12 20 84 or %o0, 0x84, %o0 2007afc: 40 00 08 2c call 2009bac <_Objects_Get> 2007b00: 94 07 bf fc add %fp, -4, %o2 /* * When we get here, the Timer is already off the chain so we do not * have to worry about that -- hence no _Watchdog_Remove(). */ the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 2007b04: c2 07 bf fc ld [ %fp + -4 ], %g1 2007b08: 80 a0 60 00 cmp %g1, 0 2007b0c: 12 80 00 17 bne 2007b68 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2007b10: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2007b14: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007b18: 03 00 00 10 sethi %hi(0x4000), %g1 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_period ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_PERIOD); 2007b1c: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007b20: 80 88 80 01 btst %g2, %g1 2007b24: 22 80 00 08 be,a 2007b44 <_Rate_monotonic_Timeout+0x58> 2007b28: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007b2c: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007b30: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007b34: 80 a0 80 01 cmp %g2, %g1 2007b38: 02 80 00 1a be 2007ba0 <_Rate_monotonic_Timeout+0xb4> 2007b3c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 2007b40: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007b44: 80 a0 60 01 cmp %g1, 1 2007b48: 02 80 00 0a be 2007b70 <_Rate_monotonic_Timeout+0x84> 2007b4c: 82 10 20 04 mov 4, %g1 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007b50: c2 27 60 38 st %g1, [ %i5 + 0x38 ] * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2007b54: 03 00 80 78 sethi %hi(0x201e000), %g1 2007b58: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 201e1f0 <_Thread_Dispatch_disable_level> 2007b5c: 84 00 bf ff add %g2, -1, %g2 2007b60: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ] return _Thread_Dispatch_disable_level; 2007b64: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 2007b68: 81 c7 e0 08 ret 2007b6c: 81 e8 00 00 restore _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007b70: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2007b74: 90 10 00 1d mov %i5, %o0 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007b78: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007b7c: 7f ff fe 49 call 20074a0 <_Rate_monotonic_Initiate_statistics> 2007b80: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b84: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b88: 11 00 80 78 sethi %hi(0x201e000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b8c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b90: 90 12 22 ac or %o0, 0x2ac, %o0 2007b94: 40 00 0f f5 call 200bb68 <_Watchdog_Insert> 2007b98: 92 07 60 10 add %i5, 0x10, %o1 2007b9c: 30 bf ff ee b,a 2007b54 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007ba0: 40 00 0a e8 call 200a740 <_Thread_Clear_state> 2007ba4: 92 12 63 f8 or %o1, 0x3f8, %o1 the_thread = the_period->owner; if ( _States_Is_waiting_for_period( the_thread->current_state ) && the_thread->Wait.id == the_period->Object.id ) { _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 2007ba8: 10 bf ff f5 b 2007b7c <_Rate_monotonic_Timeout+0x90> 2007bac: 90 10 00 1d mov %i5, %o0 =============================================================================== 020090c4 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 20090c4: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 20090c8: 40 00 07 5b call 200ae34 <_Workspace_Allocate> 20090cc: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 20090d0: 80 a2 20 00 cmp %o0, 0 20090d4: 02 80 00 05 be 20090e8 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 20090d8: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 20090dc: d0 26 20 8c st %o0, [ %i0 + 0x8c ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 20090e0: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 20090e4: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 20090e8: 81 c7 e0 08 ret 20090ec: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020090f0 <_Scheduler_EDF_Block>: #include void _Scheduler_EDF_Block( Thread_Control *the_thread ) { 20090f0: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Extract( the_thread ); 20090f4: 40 00 00 20 call 2009174 <_Scheduler_EDF_Extract> 20090f8: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _Thread_Is_heir ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Heir ); 20090fc: 3b 00 80 78 sethi %hi(0x201e000), %i5 2009100: ba 17 60 6c or %i5, 0x6c, %i5 ! 201e06c <_Per_CPU_Information> /* TODO: flash critical section? */ if ( _Thread_Is_heir( the_thread ) ) 2009104: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2009108: 80 a6 00 01 cmp %i0, %g1 200910c: 02 80 00 09 be 2009130 <_Scheduler_EDF_Block+0x40> <== ALWAYS TAKEN 2009110: 01 00 00 00 nop _Scheduler_EDF_Schedule(); if ( _Thread_Is_executing( the_thread ) ) 2009114: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED 2009118: 80 a6 00 01 cmp %i0, %g1 200911c: 12 80 00 03 bne 2009128 <_Scheduler_EDF_Block+0x38> <== NEVER TAKEN 2009120: 82 10 20 01 mov 1, %g1 _Thread_Dispatch_necessary = true; 2009124: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 2009128: 81 c7 e0 08 ret 200912c: 81 e8 00 00 restore _Scheduler_EDF_Extract( the_thread ); /* TODO: flash critical section? */ if ( _Thread_Is_heir( the_thread ) ) _Scheduler_EDF_Schedule(); 2009130: 40 00 00 5c call 20092a0 <_Scheduler_EDF_Schedule> 2009134: 01 00 00 00 nop if ( _Thread_Is_executing( the_thread ) ) 2009138: 10 bf ff f8 b 2009118 <_Scheduler_EDF_Block+0x28> 200913c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 =============================================================================== 02009258 <_Scheduler_EDF_Release_job>: uint32_t deadline ) { Priority_Control new_priority; if (deadline) { 2009258: 80 a2 60 00 cmp %o1, 0 200925c: 12 80 00 07 bne 2009278 <_Scheduler_EDF_Release_job+0x20> <== ALWAYS TAKEN 2009260: 94 10 20 01 mov 1, %o2 new_priority = (_Watchdog_Ticks_since_boot + deadline) & ~SCHEDULER_EDF_PRIO_MSB; } else { /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; 2009264: d2 02 20 b0 ld [ %o0 + 0xb0 ], %o1 <== NOT EXECUTED } the_thread->real_priority = new_priority; 2009268: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED _Thread_Change_priority(the_thread, new_priority, true); 200926c: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2009270: 40 00 00 f5 call 2009644 <_Thread_Change_priority> <== NOT EXECUTED 2009274: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED { Priority_Control new_priority; if (deadline) { /* Initializing or shifting deadline. */ new_priority = (_Watchdog_Ticks_since_boot + deadline) 2009278: 03 00 80 77 sethi %hi(0x201dc00), %g1 200927c: c2 00 63 4c ld [ %g1 + 0x34c ], %g1 ! 201df4c <_Watchdog_Ticks_since_boot> /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } the_thread->real_priority = new_priority; _Thread_Change_priority(the_thread, new_priority, true); 2009280: 94 10 20 01 mov 1, %o2 { Priority_Control new_priority; if (deadline) { /* Initializing or shifting deadline. */ new_priority = (_Watchdog_Ticks_since_boot + deadline) 2009284: 92 02 40 01 add %o1, %g1, %o1 2009288: 03 20 00 00 sethi %hi(0x80000000), %g1 200928c: 92 2a 40 01 andn %o1, %g1, %o1 else { /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } the_thread->real_priority = new_priority; 2009290: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 2009294: 82 13 c0 00 mov %o7, %g1 2009298: 40 00 00 eb call 2009644 <_Thread_Change_priority> 200929c: 9e 10 40 00 mov %g1, %o7 =============================================================================== 020092c8 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 20092c8: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 20092cc: 7f ff ff a0 call 200914c <_Scheduler_EDF_Enqueue> 20092d0: 90 10 00 18 mov %i0, %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( 20092d4: 3b 00 80 78 sethi %hi(0x201e000), %i5 20092d8: ba 17 60 6c or %i5, 0x6c, %i5 ! 201e06c <_Per_CPU_Information> 20092dc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20092e0: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 20092e4: 03 00 80 74 sethi %hi(0x201d000), %g1 20092e8: c2 00 62 04 ld [ %g1 + 0x204 ], %g1 ! 201d204 <_Scheduler+0x30> 20092ec: 9f c0 40 00 call %g1 20092f0: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 20092f4: 80 a2 20 00 cmp %o0, 0 20092f8: 26 80 00 04 bl,a 2009308 <_Scheduler_EDF_Unblock+0x40> 20092fc: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2009300: 81 c7 e0 08 ret 2009304: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 2009308: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200930c: c2 08 60 74 ldub [ %g1 + 0x74 ], %g1 2009310: 80 a0 60 00 cmp %g1, 0 2009314: 22 80 00 06 be,a 200932c <_Scheduler_EDF_Unblock+0x64> <== NEVER TAKEN 2009318: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 <== NOT EXECUTED the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200931c: 82 10 20 01 mov 1, %g1 2009320: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 2009324: 81 c7 e0 08 ret 2009328: 81 e8 00 00 restore */ if ( _Scheduler_Is_priority_lower_than( _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200932c: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2009330: 12 bf ff f4 bne 2009300 <_Scheduler_EDF_Unblock+0x38> <== NOT EXECUTED 2009334: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 2009338: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200933c: 30 bf ff fa b,a 2009324 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 02009340 <_Scheduler_EDF_Update>: #include void _Scheduler_EDF_Update( Thread_Control *the_thread ) { 2009340: 9d e3 bf a0 save %sp, -96, %sp Scheduler_EDF_Per_thread *sched_info = 2009344: f8 06 20 8c ld [ %i0 + 0x8c ], %i4 (Scheduler_EDF_Per_thread*)the_thread->scheduler_info; RBTree_Node *the_node = &(sched_info->Node); if (sched_info->queue_state == SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN) { 2009348: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 200934c: 80 a0 60 02 cmp %g1, 2 2009350: 02 80 00 06 be 2009368 <_Scheduler_EDF_Update+0x28> 2009354: 80 a0 60 01 cmp %g1, 1 the_thread->real_priority = the_thread->Start.initial_priority; the_thread->current_priority = the_thread->Start.initial_priority; sched_info->queue_state = SCHEDULER_EDF_QUEUE_STATE_NOT_PRESENTLY; } if ( sched_info->queue_state == SCHEDULER_EDF_QUEUE_STATE_YES ) { 2009358: 02 80 00 0d be 200938c <_Scheduler_EDF_Update+0x4c> <== NEVER TAKEN 200935c: b8 07 20 04 add %i4, 4, %i4 2009360: 81 c7 e0 08 ret 2009364: 81 e8 00 00 restore (Scheduler_EDF_Per_thread*)the_thread->scheduler_info; RBTree_Node *the_node = &(sched_info->Node); if (sched_info->queue_state == SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN) { /* Shifts the priority to the region of background tasks. */ the_thread->Start.initial_priority |= (SCHEDULER_EDF_PRIO_MSB); 2009368: c4 06 20 b0 ld [ %i0 + 0xb0 ], %g2 200936c: 03 20 00 00 sethi %hi(0x80000000), %g1 2009370: 82 10 80 01 or %g2, %g1, %g1 2009374: c2 26 20 b0 st %g1, [ %i0 + 0xb0 ] the_thread->real_priority = the_thread->Start.initial_priority; 2009378: c2 26 20 18 st %g1, [ %i0 + 0x18 ] the_thread->current_priority = the_thread->Start.initial_priority; 200937c: c2 26 20 14 st %g1, [ %i0 + 0x14 ] sched_info->queue_state = SCHEDULER_EDF_QUEUE_STATE_NOT_PRESENTLY; 2009380: c0 27 20 14 clr [ %i4 + 0x14 ] 2009384: 81 c7 e0 08 ret 2009388: 81 e8 00 00 restore } if ( sched_info->queue_state == SCHEDULER_EDF_QUEUE_STATE_YES ) { _RBTree_Extract(&_Scheduler_EDF_Ready_queue, the_node); 200938c: 3b 00 80 78 sethi %hi(0x201e000), %i5 <== NOT EXECUTED 2009390: 92 10 00 1c mov %i4, %o1 <== NOT EXECUTED 2009394: 40 00 12 50 call 200dcd4 <_RBTree_Extract> <== NOT EXECUTED 2009398: 90 17 60 90 or %i5, 0x90, %o0 <== NOT EXECUTED _RBTree_Insert(&_Scheduler_EDF_Ready_queue, the_node); 200939c: 92 10 00 1c mov %i4, %o1 <== NOT EXECUTED 20093a0: 40 00 12 fd call 200df94 <_RBTree_Insert> <== NOT EXECUTED 20093a4: 90 17 60 90 or %i5, 0x90, %o0 <== NOT EXECUTED _Scheduler_EDF_Schedule(); 20093a8: 7f ff ff be call 20092a0 <_Scheduler_EDF_Schedule> <== NOT EXECUTED 20093ac: 01 00 00 00 nop <== NOT EXECUTED if ( _Thread_Executing != _Thread_Heir ) { 20093b0: 03 00 80 78 sethi %hi(0x201e000), %g1 <== NOT EXECUTED 20093b4: 82 10 60 6c or %g1, 0x6c, %g1 ! 201e06c <_Per_CPU_Information><== NOT EXECUTED 20093b8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 <== NOT EXECUTED 20093bc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 <== NOT EXECUTED 20093c0: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED 20093c4: 02 80 00 0b be 20093f0 <_Scheduler_EDF_Update+0xb0> <== NOT EXECUTED 20093c8: 01 00 00 00 nop <== NOT EXECUTED if ( _Thread_Executing->is_preemptible || 20093cc: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 <== NOT EXECUTED 20093d0: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 20093d4: 12 80 00 06 bne 20093ec <_Scheduler_EDF_Update+0xac> <== NOT EXECUTED 20093d8: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED 20093dc: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 <== NOT EXECUTED 20093e0: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 20093e4: 12 bf ff df bne 2009360 <_Scheduler_EDF_Update+0x20> <== NOT EXECUTED 20093e8: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 20093ec: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] <== NOT EXECUTED 20093f0: 81 c7 e0 08 ret <== NOT EXECUTED 20093f4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020093f8 <_Scheduler_EDF_Yield>: #include #include #include void _Scheduler_EDF_Yield(void) { 20093f8: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED Scheduler_EDF_Per_thread *first_info; RBTree_Node *first_node; ISR_Level level; Thread_Control *executing = _Thread_Executing; 20093fc: 3b 00 80 78 sethi %hi(0x201e000), %i5 <== NOT EXECUTED 2009400: ba 17 60 6c or %i5, 0x6c, %i5 ! 201e06c <_Per_CPU_Information><== NOT EXECUTED 2009404: f6 07 60 0c ld [ %i5 + 0xc ], %i3 <== NOT EXECUTED Scheduler_EDF_Per_thread *executing_info = (Scheduler_EDF_Per_thread *) executing->scheduler_info; RBTree_Node *executing_node = &(executing_info->Node); _ISR_Disable( level ); 2009408: 7f ff e4 ed call 20027bc <== NOT EXECUTED 200940c: f4 06 e0 8c ld [ %i3 + 0x8c ], %i2 <== NOT EXECUTED 2009410: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED RTEMS_INLINE_ROUTINE bool _RBTree_Has_only_one_node( const RBTree_Control *the_rbtree ) { if(!the_rbtree) return NULL; /* TODO: expected behavior? */ return (the_rbtree->root->child[RBT_LEFT] == NULL && the_rbtree->root->child[RBT_RIGHT] == NULL); 2009414: 39 00 80 78 sethi %hi(0x201e000), %i4 <== NOT EXECUTED 2009418: 82 17 20 90 or %i4, 0x90, %g1 ! 201e090 <_Scheduler_EDF_Ready_queue><== NOT EXECUTED 200941c: c2 00 60 04 ld [ %g1 + 4 ], %g1 <== NOT EXECUTED 2009420: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 2009424: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 2009428: 22 80 00 16 be,a 2009480 <_Scheduler_EDF_Yield+0x88> <== NOT EXECUTED 200942c: c2 00 60 08 ld [ %g1 + 8 ], %g1 <== NOT EXECUTED ISR_Level level; Thread_Control *executing = _Thread_Executing; Scheduler_EDF_Per_thread *executing_info = (Scheduler_EDF_Per_thread *) executing->scheduler_info; RBTree_Node *executing_node = &(executing_info->Node); 2009430: b4 06 a0 04 add %i2, 4, %i2 <== NOT EXECUTED if ( !_RBTree_Has_only_one_node(&_Scheduler_EDF_Ready_queue) ) { /* * The RBTree has more than one node, enqueue behind the tasks * with the same priority in case there are such ones. */ _RBTree_Extract( &_Scheduler_EDF_Ready_queue, executing_node ); 2009434: 90 17 20 90 or %i4, 0x90, %o0 <== NOT EXECUTED 2009438: 40 00 12 27 call 200dcd4 <_RBTree_Extract> <== NOT EXECUTED 200943c: 92 10 00 1a mov %i2, %o1 <== NOT EXECUTED _RBTree_Insert( &_Scheduler_EDF_Ready_queue, executing_node ); 2009440: 90 17 20 90 or %i4, 0x90, %o0 <== NOT EXECUTED 2009444: 40 00 12 d4 call 200df94 <_RBTree_Insert> <== NOT EXECUTED 2009448: 92 10 00 1a mov %i2, %o1 <== NOT EXECUTED _ISR_Flash( level ); 200944c: 7f ff e4 e0 call 20027cc <== NOT EXECUTED 2009450: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2009454: 7f ff e4 da call 20027bc <== NOT EXECUTED 2009458: 01 00 00 00 nop <== NOT EXECUTED 200945c: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED if ( _Thread_Is_heir( executing ) ) { 2009460: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 2009464: 80 a6 c0 01 cmp %i3, %g1 <== NOT EXECUTED 2009468: 02 80 00 10 be 20094a8 <_Scheduler_EDF_Yield+0xb0> <== NOT EXECUTED 200946c: 11 00 80 78 sethi %hi(0x201e000), %o0 <== NOT EXECUTED _Thread_Heir = first_info->thread; } _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 2009470: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2009474: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED _ISR_Enable( level ); 2009478: 7f ff e4 d5 call 20027cc <== NOT EXECUTED 200947c: 81 e8 00 00 restore <== NOT EXECUTED 2009480: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2009484: 32 bf ff ec bne,a 2009434 <_Scheduler_EDF_Yield+0x3c> <== NOT EXECUTED 2009488: b4 06 a0 04 add %i2, 4, %i2 <== NOT EXECUTED _RBTree_Container_of(first_node, Scheduler_EDF_Per_thread, Node); _Thread_Heir = first_info->thread; } _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 200948c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 2009490: 80 a6 c0 01 cmp %i3, %g1 <== NOT EXECUTED 2009494: 02 bf ff f9 be 2009478 <_Scheduler_EDF_Yield+0x80> <== NOT EXECUTED 2009498: 01 00 00 00 nop <== NOT EXECUTED _Thread_Dispatch_necessary = true; 200949c: 82 10 20 01 mov 1, %g1 ! 1 <== NOT EXECUTED 20094a0: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 20094a4: 30 bf ff f5 b,a 2009478 <_Scheduler_EDF_Yield+0x80> <== NOT EXECUTED _RBTree_Insert( &_Scheduler_EDF_Ready_queue, executing_node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) { first_node = _RBTree_Peek( &_Scheduler_EDF_Ready_queue, RBT_LEFT ); 20094a8: 92 10 20 00 clr %o1 <== NOT EXECUTED 20094ac: 40 00 12 bf call 200dfa8 <_RBTree_Peek> <== NOT EXECUTED 20094b0: 90 12 20 90 or %o0, 0x90, %o0 <== NOT EXECUTED first_info = _RBTree_Container_of(first_node, Scheduler_EDF_Per_thread, Node); _Thread_Heir = first_info->thread; 20094b4: c2 02 3f fc ld [ %o0 + -4 ], %g1 <== NOT EXECUTED 20094b8: c2 27 60 10 st %g1, [ %i5 + 0x10 ] <== NOT EXECUTED } _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 20094bc: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 20094c0: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 20094c4: 30 bf ff ed b,a 2009478 <_Scheduler_EDF_Yield+0x80> <== NOT EXECUTED =============================================================================== 02009284 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 2009284: 03 00 80 71 sethi %hi(0x201c400), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009288: c2 00 62 44 ld [ %g1 + 0x244 ], %g1 ! 201c644 <_Scheduler> */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 200928c: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 2009290: c2 00 40 00 ld [ %g1 ], %g1 2009294: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2009298: 80 a0 80 03 cmp %g2, %g3 200929c: 3a 80 00 08 bcc,a 20092bc <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 20092a0: c2 00 60 04 ld [ %g1 + 4 ], %g1 * Do NOT need to check for end of chain because there is always * at least one task on the ready chain -- the IDLE task. It can * never block, should never attempt to obtain a semaphore or mutex, * and thus will always be there. */ for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) { 20092a4: c2 00 40 00 ld [ %g1 ], %g1 current = (Thread_Control *) the_node; /* break when AT HEAD OF (or PAST) our priority */ if ( the_thread->current_priority <= current->current_priority ) { 20092a8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 20092ac: 80 a0 80 03 cmp %g2, %g3 20092b0: 2a bf ff fe bcs,a 20092a8 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 20092b4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 20092b8: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 20092bc: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 20092c0: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 20092c4: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 20092c8: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 20092cc: 81 c3 e0 08 retl 20092d0: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 020078d8 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 20078d8: 9d e3 bf 98 save %sp, -104, %sp /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 20078dc: 05 00 80 71 sethi %hi(0x201c400), %g2 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 20078e0: 03 00 80 6d sethi %hi(0x201b400), %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 20078e4: c6 00 a0 7c ld [ %g2 + 0x7c ], %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 20078e8: c2 00 62 88 ld [ %g1 + 0x288 ], %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 20078ec: 86 00 e0 01 inc %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 20078f0: bb 28 60 07 sll %g1, 7, %i5 20078f4: 89 28 60 02 sll %g1, 2, %g4 20078f8: 88 27 40 04 sub %i5, %g4, %g4 20078fc: 82 01 00 01 add %g4, %g1, %g1 2007900: 83 28 60 03 sll %g1, 3, %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 2007904: 92 07 bf f8 add %fp, -8, %o1 /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2007908: c6 20 a0 7c st %g3, [ %g2 + 0x7c ] { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 200790c: c2 27 bf fc st %g1, [ %fp + -4 ] 2007910: c0 27 bf f8 clr [ %fp + -8 ] /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 2007914: 11 00 80 70 sethi %hi(0x201c000), %o0 2007918: 40 00 09 35 call 2009dec <_Timespec_Add_to> 200791c: 90 12 23 ec or %o0, 0x3ec, %o0 ! 201c3ec <_TOD_Uptime> /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); 2007920: 92 07 bf f8 add %fp, -8, %o1 2007924: 11 00 80 70 sethi %hi(0x201c000), %o0 2007928: 40 00 09 31 call 2009dec <_Timespec_Add_to> 200792c: 90 12 23 fc or %o0, 0x3fc, %o0 ! 201c3fc <_TOD_Now> while ( seconds ) { 2007930: ba 92 20 00 orcc %o0, 0, %i5 2007934: 02 80 00 08 be 2007954 <_TOD_Tickle_ticks+0x7c> 2007938: 39 00 80 71 sethi %hi(0x201c400), %i4 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 200793c: b8 17 20 20 or %i4, 0x20, %i4 ! 201c420 <_Watchdog_Seconds_chain> 2007940: 40 00 0a b2 call 200a408 <_Watchdog_Tickle> 2007944: 90 10 00 1c mov %i4, %o0 2007948: ba 87 7f ff addcc %i5, -1, %i5 200794c: 12 bf ff fd bne 2007940 <_TOD_Tickle_ticks+0x68> <== NEVER TAKEN 2007950: 01 00 00 00 nop 2007954: 81 c7 e0 08 ret 2007958: 81 e8 00 00 restore =============================================================================== 020074f8 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 20074f8: 9d e3 bf a0 save %sp, -96, %sp uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 20074fc: 03 00 80 77 sethi %hi(0x201dc00), %g1 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) return false; 2007500: ba 10 20 00 clr %i5 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007504: 80 a6 20 00 cmp %i0, 0 2007508: 02 80 00 2c be 20075b8 <_TOD_Validate+0xc0> <== NEVER TAKEN 200750c: d2 00 61 98 ld [ %g1 + 0x198 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2007510: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007514: 40 00 49 09 call 2019938 <.udiv> 2007518: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 200751c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2007520: 80 a2 00 01 cmp %o0, %g1 2007524: 28 80 00 26 bleu,a 20075bc <_TOD_Validate+0xc4> 2007528: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 200752c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2007530: 80 a0 60 3b cmp %g1, 0x3b 2007534: 38 80 00 22 bgu,a 20075bc <_TOD_Validate+0xc4> 2007538: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 200753c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2007540: 80 a0 60 3b cmp %g1, 0x3b 2007544: 38 80 00 1e bgu,a 20075bc <_TOD_Validate+0xc4> 2007548: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 200754c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2007550: 80 a0 60 17 cmp %g1, 0x17 2007554: 38 80 00 1a bgu,a 20075bc <_TOD_Validate+0xc4> 2007558: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 200755c: c2 06 20 04 ld [ %i0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 2007560: 80 a0 60 00 cmp %g1, 0 2007564: 02 80 00 15 be 20075b8 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007568: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 200756c: 38 80 00 14 bgu,a 20075bc <_TOD_Validate+0xc4> 2007570: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007574: c4 06 00 00 ld [ %i0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 2007578: 80 a0 a7 c3 cmp %g2, 0x7c3 200757c: 28 80 00 10 bleu,a 20075bc <_TOD_Validate+0xc4> 2007580: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007584: c6 06 20 08 ld [ %i0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007588: 80 a0 e0 00 cmp %g3, 0 200758c: 02 80 00 0b be 20075b8 <_TOD_Validate+0xc0> <== NEVER TAKEN 2007590: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2007594: 32 80 00 0c bne,a 20075c4 <_TOD_Validate+0xcc> 2007598: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 200759c: 82 00 60 0d add %g1, 0xd, %g1 20075a0: 05 00 80 72 sethi %hi(0x201c800), %g2 20075a4: 83 28 60 02 sll %g1, 2, %g1 20075a8: 84 10 a2 a8 or %g2, 0x2a8, %g2 20075ac: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 20075b0: 80 a0 40 03 cmp %g1, %g3 20075b4: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 20075b8: b0 0f 60 01 and %i5, 1, %i0 20075bc: 81 c7 e0 08 ret 20075c0: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 20075c4: 05 00 80 72 sethi %hi(0x201c800), %g2 20075c8: 84 10 a2 a8 or %g2, 0x2a8, %g2 ! 201caa8 <_TOD_Days_per_month> 20075cc: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 20075d0: 80 a0 40 03 cmp %g1, %g3 20075d4: 10 bf ff f9 b 20075b8 <_TOD_Validate+0xc0> 20075d8: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 02008dec <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008dec: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008df0: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 /* * 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 ); 2008df4: 40 00 03 a2 call 2009c7c <_Thread_Set_transient> 2008df8: 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 ) 2008dfc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008e00: 80 a0 40 19 cmp %g1, %i1 2008e04: 02 80 00 05 be 2008e18 <_Thread_Change_priority+0x2c> 2008e08: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008e0c: 90 10 00 18 mov %i0, %o0 2008e10: 40 00 03 81 call 2009c14 <_Thread_Set_priority> 2008e14: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008e18: 7f ff e4 f3 call 20021e4 2008e1c: 01 00 00 00 nop 2008e20: b2 10 00 08 mov %o0, %i1 /* * 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; 2008e24: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 2008e28: 80 a6 e0 04 cmp %i3, 4 2008e2c: 02 80 00 18 be 2008e8c <_Thread_Change_priority+0xa0> 2008e30: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 2008e34: 02 80 00 0b be 2008e60 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 2008e38: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 2008e3c: 7f ff e4 ee call 20021f4 <== NOT EXECUTED 2008e40: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 2008e44: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 2008e48: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008e4c: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 2008e50: 32 80 00 0d bne,a 2008e84 <_Thread_Change_priority+0x98> <== NOT EXECUTED 2008e54: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 2008e58: 81 c7 e0 08 ret 2008e5c: 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 ); 2008e60: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008e64: 7f ff e4 e4 call 20021f4 2008e68: 90 10 00 19 mov %i1, %o0 2008e6c: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008e70: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 2008e74: 80 8e c0 01 btst %i3, %g1 2008e78: 02 bf ff f8 be 2008e58 <_Thread_Change_priority+0x6c> 2008e7c: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008e80: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2008e84: 40 00 03 33 call 2009b50 <_Thread_queue_Requeue> 2008e88: 93 e8 00 1d restore %g0, %i5, %o1 2008e8c: 39 00 80 6d sethi %hi(0x201b400), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 2008e90: 12 80 00 08 bne 2008eb0 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 2008e94: b8 17 23 64 or %i4, 0x364, %i4 ! 201b764 <_Scheduler> * 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 ); if ( prepend_it ) 2008e98: 80 a6 a0 00 cmp %i2, 0 2008e9c: 02 80 00 1b be 2008f08 <_Thread_Change_priority+0x11c> 2008ea0: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2008ea4: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 2008ea8: 9f c0 40 00 call %g1 2008eac: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2008eb0: 7f ff e4 d1 call 20021f4 2008eb4: 90 10 00 19 mov %i1, %o0 2008eb8: 7f ff e4 cb call 20021e4 2008ebc: 01 00 00 00 nop 2008ec0: b0 10 00 08 mov %o0, %i0 * This kernel routine implements the scheduling decision logic for * the scheduler. It does NOT dispatch. */ RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( void ) { _Scheduler.Operations.schedule(); 2008ec4: c2 07 20 08 ld [ %i4 + 8 ], %g1 2008ec8: 9f c0 40 00 call %g1 2008ecc: 01 00 00 00 nop * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 2008ed0: 03 00 80 71 sethi %hi(0x201c400), %g1 2008ed4: 82 10 61 9c or %g1, 0x19c, %g1 ! 201c59c <_Per_CPU_Information> 2008ed8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Scheduler_Schedule(); if ( !_Thread_Is_executing_also_the_heir() && 2008edc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008ee0: 80 a0 80 03 cmp %g2, %g3 2008ee4: 02 80 00 07 be 2008f00 <_Thread_Change_priority+0x114> 2008ee8: 01 00 00 00 nop 2008eec: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008ef0: 80 a0 a0 00 cmp %g2, 0 2008ef4: 02 80 00 03 be 2008f00 <_Thread_Change_priority+0x114> 2008ef8: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008efc: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008f00: 7f ff e4 bd call 20021f4 2008f04: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008f08: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 2008f0c: 9f c0 40 00 call %g1 2008f10: 90 10 00 1d mov %i5, %o0 2008f14: 30 bf ff e7 b,a 2008eb0 <_Thread_Change_priority+0xc4> =============================================================================== 02009130 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009130: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009134: 90 10 00 18 mov %i0, %o0 2009138: 40 00 00 7a call 2009320 <_Thread_Get> 200913c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009140: c2 07 bf fc ld [ %fp + -4 ], %g1 2009144: 80 a0 60 00 cmp %g1, 0 2009148: 12 80 00 09 bne 200916c <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 200914c: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2009150: 7f ff ff 72 call 2008f18 <_Thread_Clear_state> 2009154: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2009158: 03 00 80 70 sethi %hi(0x201c000), %g1 200915c: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201c370 <_Thread_Dispatch_disable_level> 2009160: 84 00 bf ff add %g2, -1, %g2 2009164: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2009168: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 200916c: 81 c7 e0 08 ret 2009170: 81 e8 00 00 restore =============================================================================== 02009174 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2009174: 9d e3 bf 90 save %sp, -112, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2009178: 21 00 80 70 sethi %hi(0x201c000), %l0 200917c: c2 04 23 70 ld [ %l0 + 0x370 ], %g1 ! 201c370 <_Thread_Dispatch_disable_level> 2009180: 82 00 60 01 inc %g1 2009184: c2 24 23 70 st %g1, [ %l0 + 0x370 ] return _Thread_Dispatch_disable_level; 2009188: c2 04 23 70 ld [ %l0 + 0x370 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200918c: 39 00 80 71 sethi %hi(0x201c400), %i4 2009190: b8 17 21 9c or %i4, 0x19c, %i4 ! 201c59c <_Per_CPU_Information> _ISR_Disable( level ); 2009194: 7f ff e4 14 call 20021e4 2009198: fa 07 20 0c ld [ %i4 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 200919c: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 20091a0: 80 a0 60 00 cmp %g1, 0 20091a4: 02 80 00 48 be 20092c4 <_Thread_Dispatch+0x150> 20091a8: 01 00 00 00 nop heir = _Thread_Heir; 20091ac: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 20091b0: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 20091b4: 80 a7 40 1b cmp %i5, %i3 20091b8: 02 80 00 43 be 20092c4 <_Thread_Dispatch+0x150> 20091bc: f6 27 20 0c st %i3, [ %i4 + 0xc ] 20091c0: 31 00 80 70 sethi %hi(0x201c000), %i0 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 20091c4: 23 00 80 70 sethi %hi(0x201c000), %l1 20091c8: b0 16 23 f8 or %i0, 0x3f8, %i0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 20091cc: b2 07 20 1c add %i4, 0x1c, %i1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 20091d0: 10 80 00 37 b 20092ac <_Thread_Dispatch+0x138> 20091d4: 35 00 80 70 sethi %hi(0x201c000), %i2 rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 20091d8: 7f ff e4 07 call 20021f4 20091dc: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 20091e0: 40 00 0e 11 call 200ca24 <_TOD_Get_uptime> 20091e4: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 20091e8: 90 10 00 19 mov %i1, %o0 20091ec: 92 07 bf f0 add %fp, -16, %o1 20091f0: 40 00 03 18 call 2009e50 <_Timespec_Subtract> 20091f4: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 20091f8: 90 07 60 84 add %i5, 0x84, %o0 20091fc: 40 00 02 fc call 2009dec <_Timespec_Add_to> 2009200: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2009204: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2009208: c2 06 00 00 ld [ %i0 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 200920c: c4 27 20 1c st %g2, [ %i4 + 0x1c ] 2009210: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2009214: 80 a0 60 00 cmp %g1, 0 2009218: 02 80 00 06 be 2009230 <_Thread_Dispatch+0xbc> <== NEVER TAKEN 200921c: c4 27 20 20 st %g2, [ %i4 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 2009220: c4 00 40 00 ld [ %g1 ], %g2 2009224: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2009228: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2 200922c: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2009230: 90 10 00 1d mov %i5, %o0 2009234: 40 00 03 cb call 200a160 <_User_extensions_Thread_switch> 2009238: 92 10 00 1b mov %i3, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200923c: 90 07 60 c8 add %i5, 0xc8, %o0 2009240: 40 00 05 0f call 200a67c <_CPU_Context_switch> 2009244: 92 06 e0 c8 add %i3, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2009248: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200924c: 80 a0 60 00 cmp %g1, 0 2009250: 02 80 00 0c be 2009280 <_Thread_Dispatch+0x10c> 2009254: d0 06 a3 f4 ld [ %i2 + 0x3f4 ], %o0 2009258: 80 a7 40 08 cmp %i5, %o0 200925c: 02 80 00 09 be 2009280 <_Thread_Dispatch+0x10c> 2009260: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2009264: 02 80 00 04 be 2009274 <_Thread_Dispatch+0x100> 2009268: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200926c: 40 00 04 ca call 200a594 <_CPU_Context_save_fp> 2009270: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2009274: 40 00 04 e5 call 200a608 <_CPU_Context_restore_fp> 2009278: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 200927c: fa 26 a3 f4 st %i5, [ %i2 + 0x3f4 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 2009280: 7f ff e3 d9 call 20021e4 2009284: fa 07 20 0c ld [ %i4 + 0xc ], %i5 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2009288: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 200928c: 80 a0 60 00 cmp %g1, 0 2009290: 02 80 00 0d be 20092c4 <_Thread_Dispatch+0x150> 2009294: 01 00 00 00 nop heir = _Thread_Heir; 2009298: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 200929c: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 20092a0: 80 a6 c0 1d cmp %i3, %i5 20092a4: 02 80 00 08 be 20092c4 <_Thread_Dispatch+0x150> <== NEVER TAKEN 20092a8: f6 27 20 0c st %i3, [ %i4 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 20092ac: c2 06 e0 7c ld [ %i3 + 0x7c ], %g1 20092b0: 80 a0 60 01 cmp %g1, 1 20092b4: 12 bf ff c9 bne 20091d8 <_Thread_Dispatch+0x64> 20092b8: c2 04 62 d4 ld [ %l1 + 0x2d4 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 20092bc: 10 bf ff c7 b 20091d8 <_Thread_Dispatch+0x64> 20092c0: c2 26 e0 78 st %g1, [ %i3 + 0x78 ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 20092c4: 7f ff e3 cc call 20021f4 20092c8: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 20092cc: c2 04 23 70 ld [ %l0 + 0x370 ], %g1 20092d0: 82 00 7f ff add %g1, -1, %g1 20092d4: c2 24 23 70 st %g1, [ %l0 + 0x370 ] return _Thread_Dispatch_disable_level; 20092d8: c2 04 23 70 ld [ %l0 + 0x370 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 20092dc: 7f ff f7 e5 call 2007270 <_API_extensions_Run_postswitch> 20092e0: 01 00 00 00 nop } 20092e4: 81 c7 e0 08 ret 20092e8: 81 e8 00 00 restore =============================================================================== 0200e940 <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e940: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 200e944: 03 00 80 71 sethi %hi(0x201c400), %g1 200e948: fa 00 61 a8 ld [ %g1 + 0x1a8 ], %i5 ! 201c5a8 <_Per_CPU_Information+0xc> /* * Some CPUs need to tinker with the call frame or registers when the * thread actually begins to execute for the first time. This is a * hook point where the port gets a shot at doing whatever it requires. */ _Context_Initialization_at_thread_begin(); 200e94c: 3f 00 80 3a sethi %hi(0x200e800), %i7 200e950: be 17 e1 40 or %i7, 0x140, %i7 ! 200e940 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e954: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200e958: 7f ff ce 27 call 20021f4 200e95c: 91 2a 20 08 sll %o0, 8, %o0 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e960: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200e964: 03 00 80 70 sethi %hi(0x201c000), %g1 doneConstructors = true; 200e968: 86 10 20 01 mov 1, %g3 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200e96c: f6 08 60 30 ldub [ %g1 + 0x30 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e970: 80 a0 a0 00 cmp %g2, 0 200e974: 02 80 00 0c be 200e9a4 <_Thread_Handler+0x64> 200e978: c6 28 60 30 stb %g3, [ %g1 + 0x30 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 200e97c: 39 00 80 70 sethi %hi(0x201c000), %i4 200e980: d0 07 23 f4 ld [ %i4 + 0x3f4 ], %o0 ! 201c3f4 <_Thread_Allocated_fp> 200e984: 80 a7 40 08 cmp %i5, %o0 200e988: 02 80 00 07 be 200e9a4 <_Thread_Handler+0x64> 200e98c: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e990: 22 80 00 05 be,a 200e9a4 <_Thread_Handler+0x64> 200e994: fa 27 23 f4 st %i5, [ %i4 + 0x3f4 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e998: 7f ff ee ff call 200a594 <_CPU_Context_save_fp> 200e99c: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e9a0: fa 27 23 f4 st %i5, [ %i4 + 0x3f4 ] /* * Take care that 'begin' extensions get to complete before * 'switch' extensions can run. This means must keep dispatch * disabled until all 'begin' extensions complete. */ _User_extensions_Thread_begin( executing ); 200e9a4: 7f ff ed 6d call 2009f58 <_User_extensions_Thread_begin> 200e9a8: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e9ac: 7f ff ea 50 call 20092ec <_Thread_Enable_dispatch> 200e9b0: 01 00 00 00 nop /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { 200e9b4: 80 8e e0 ff btst 0xff, %i3 200e9b8: 02 80 00 0c be 200e9e8 <_Thread_Handler+0xa8> 200e9bc: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e9c0: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200e9c4: 80 a0 60 00 cmp %g1, 0 200e9c8: 22 80 00 0c be,a 200e9f8 <_Thread_Handler+0xb8> <== ALWAYS TAKEN 200e9cc: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 200e9d0: 7f ff ed 76 call 2009fa8 <_User_extensions_Thread_exitted> 200e9d4: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e9d8: 90 10 20 00 clr %o0 200e9dc: 92 10 20 01 mov 1, %o1 200e9e0: 7f ff e4 f1 call 2007da4 <_Internal_error_Occurred> 200e9e4: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { INIT_NAME (); 200e9e8: 40 00 33 14 call 201b638 <_init> 200e9ec: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e9f0: 10 bf ff f5 b 200e9c4 <_Thread_Handler+0x84> 200e9f4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e9f8: 9f c0 40 00 call %g1 200e9fc: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200ea00: 10 bf ff f4 b 200e9d0 <_Thread_Handler+0x90> 200ea04: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 020093d0 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 20093d0: 9d e3 bf a0 save %sp, -96, %sp 20093d4: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 20093d8: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2 20093dc: e0 00 40 00 ld [ %g1 ], %l0 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 20093e0: c0 26 61 58 clr [ %i1 + 0x158 ] 20093e4: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 20093e8: c0 26 61 54 clr [ %i1 + 0x154 ] /* * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 20093ec: 90 10 00 19 mov %i1, %o0 20093f0: 40 00 02 32 call 2009cb8 <_Thread_Stack_Allocate> 20093f4: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 20093f8: 80 a2 00 1b cmp %o0, %i3 20093fc: 0a 80 00 4b bcs 2009528 <_Thread_Initialize+0x158> 2009400: 80 a2 20 00 cmp %o0, 0 2009404: 02 80 00 49 be 2009528 <_Thread_Initialize+0x158> <== NEVER TAKEN 2009408: 80 a7 20 00 cmp %i4, 0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200940c: c2 06 60 c0 ld [ %i1 + 0xc0 ], %g1 the_stack->size = size; 2009410: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2009414: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 2009418: 12 80 00 48 bne 2009538 <_Thread_Initialize+0x168> 200941c: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2009420: 23 00 80 71 sethi %hi(0x201c400), %l1 2009424: c2 04 60 04 ld [ %l1 + 4 ], %g1 ! 201c404 <_Thread_Maximum_extensions> fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); if ( !fp_area ) goto failed; fp_area = _Context_Fp_start( fp_area, 0 ); } the_thread->fp_context = fp_area; 2009428: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200942c: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2009430: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2009434: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2009438: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200943c: 80 a0 60 00 cmp %g1, 0 2009440: 12 80 00 46 bne 2009558 <_Thread_Initialize+0x188> 2009444: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 2009448: c0 26 61 60 clr [ %i1 + 0x160 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200944c: b8 10 20 00 clr %i4 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 2009450: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2009454: 03 00 80 6d sethi %hi(0x201b400), %g1 2009458: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; 200945c: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 2009460: c2 00 63 7c ld [ %g1 + 0x37c ], %g1 2009464: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009468: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200946c: f4 2e 60 a0 stb %i2, [ %i1 + 0xa0 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2009470: c4 26 60 ac st %g2, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2009474: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 2009478: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200947c: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2009480: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2009484: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2009488: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 200948c: 9f c0 40 00 call %g1 2009490: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2009494: b4 92 20 00 orcc %o0, 0, %i2 2009498: 22 80 00 13 be,a 20094e4 <_Thread_Initialize+0x114> 200949c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 20094a0: 90 10 00 19 mov %i1, %o0 20094a4: 40 00 01 dc call 2009c14 <_Thread_Set_priority> 20094a8: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20094ac: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 20094b0: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 20094b4: c0 26 60 84 clr [ %i1 + 0x84 ] 20094b8: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20094bc: 83 28 60 02 sll %g1, 2, %g1 20094c0: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 20094c4: e0 26 60 0c st %l0, [ %i1 + 0xc ] * 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 ); 20094c8: 90 10 00 19 mov %i1, %o0 20094cc: 40 00 02 de call 200a044 <_User_extensions_Thread_create> 20094d0: b0 10 20 01 mov 1, %i0 if ( extension_status ) 20094d4: 80 8a 20 ff btst 0xff, %o0 20094d8: 32 80 00 12 bne,a 2009520 <_Thread_Initialize+0x150> 20094dc: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 20094e0: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 20094e4: 40 00 04 17 call 200a540 <_Workspace_Free> 20094e8: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 20094ec: 40 00 04 15 call 200a540 <_Workspace_Free> 20094f0: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 20094f4: 40 00 04 13 call 200a540 <_Workspace_Free> 20094f8: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 20094fc: 40 00 04 11 call 200a540 <_Workspace_Free> 2009500: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2009504: 40 00 04 0f call 200a540 <_Workspace_Free> 2009508: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200950c: 40 00 04 0d call 200a540 <_Workspace_Free> 2009510: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 2009514: 40 00 02 04 call 2009d24 <_Thread_Stack_Free> 2009518: 90 10 00 19 mov %i1, %o0 return false; } 200951c: b0 0e 20 01 and %i0, 1, %i0 2009520: 81 c7 e0 08 ret 2009524: 81 e8 00 00 restore * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 2009528: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 200952c: b0 0e 20 01 and %i0, 1, %i0 2009530: 81 c7 e0 08 ret 2009534: 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 ); 2009538: 40 00 03 fa call 200a520 <_Workspace_Allocate> 200953c: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2009540: b6 92 20 00 orcc %o0, 0, %i3 2009544: 32 bf ff b8 bne,a 2009424 <_Thread_Initialize+0x54> 2009548: 23 00 80 71 sethi %hi(0x201c400), %l1 * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200954c: b8 10 20 00 clr %i4 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 2009550: 10 bf ff e4 b 20094e0 <_Thread_Initialize+0x110> 2009554: b4 10 20 00 clr %i2 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 2009558: 82 00 60 01 inc %g1 200955c: 40 00 03 f1 call 200a520 <_Workspace_Allocate> 2009560: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2009564: b8 92 20 00 orcc %o0, 0, %i4 2009568: 02 80 00 10 be 20095a8 <_Thread_Initialize+0x1d8> 200956c: 86 10 00 1c mov %i4, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 2009570: f8 26 61 60 st %i4, [ %i1 + 0x160 ] 2009574: c8 04 60 04 ld [ %l1 + 4 ], %g4 * 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++ ) 2009578: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200957c: 10 80 00 03 b 2009588 <_Thread_Initialize+0x1b8> 2009580: 82 10 20 00 clr %g1 2009584: c6 06 61 60 ld [ %i1 + 0x160 ], %g3 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 2009588: 85 28 a0 02 sll %g2, 2, %g2 200958c: 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++ ) 2009590: 82 00 60 01 inc %g1 2009594: 80 a0 40 04 cmp %g1, %g4 2009598: 08 bf ff fb bleu 2009584 <_Thread_Initialize+0x1b4> 200959c: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 20095a0: 10 bf ff ad b 2009454 <_Thread_Initialize+0x84> 20095a4: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 20095a8: 10 bf ff ce b 20094e0 <_Thread_Initialize+0x110> 20095ac: b4 10 20 00 clr %i2 =============================================================================== 02009b50 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009b50: 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 ) 2009b54: 80 a6 20 00 cmp %i0, 0 2009b58: 02 80 00 13 be 2009ba4 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 2009b5c: 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 ) { 2009b60: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 2009b64: 80 a7 20 01 cmp %i4, 1 2009b68: 02 80 00 04 be 2009b78 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 2009b6c: 01 00 00 00 nop 2009b70: 81 c7 e0 08 ret <== NOT EXECUTED 2009b74: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009b78: 7f ff e1 9b call 20021e4 2009b7c: 01 00 00 00 nop 2009b80: ba 10 00 08 mov %o0, %i5 2009b84: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2009b88: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009b8c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009b90: 80 88 80 01 btst %g2, %g1 2009b94: 12 80 00 06 bne 2009bac <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 2009b98: 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 ); 2009b9c: 7f ff e1 96 call 20021f4 2009ba0: 90 10 00 1d mov %i5, %o0 2009ba4: 81 c7 e0 08 ret 2009ba8: 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 ); 2009bac: 92 10 00 19 mov %i1, %o1 2009bb0: 94 10 20 01 mov 1, %o2 2009bb4: 40 00 0d 1f call 200d030 <_Thread_queue_Extract_priority_helper> 2009bb8: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009bbc: 90 10 00 18 mov %i0, %o0 2009bc0: 92 10 00 19 mov %i1, %o1 2009bc4: 7f ff ff 35 call 2009898 <_Thread_queue_Enqueue_priority> 2009bc8: 94 07 bf fc add %fp, -4, %o2 2009bcc: 30 bf ff f4 b,a 2009b9c <_Thread_queue_Requeue+0x4c> =============================================================================== 02009bd0 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009bd0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009bd4: 90 10 00 18 mov %i0, %o0 2009bd8: 7f ff fd d2 call 2009320 <_Thread_Get> 2009bdc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009be0: c2 07 bf fc ld [ %fp + -4 ], %g1 2009be4: 80 a0 60 00 cmp %g1, 0 2009be8: 12 80 00 09 bne 2009c0c <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009bec: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009bf0: 40 00 0d 49 call 200d114 <_Thread_queue_Process_timeout> 2009bf4: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2009bf8: 03 00 80 70 sethi %hi(0x201c000), %g1 2009bfc: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201c370 <_Thread_Dispatch_disable_level> 2009c00: 84 00 bf ff add %g2, -1, %g2 2009c04: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2009c08: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 2009c0c: 81 c7 e0 08 ret 2009c10: 81 e8 00 00 restore =============================================================================== 0201650c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 201650c: 9d e3 bf 88 save %sp, -120, %sp 2016510: 23 00 80 e7 sethi %hi(0x2039c00), %l1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016514: a6 07 bf e8 add %fp, -24, %l3 2016518: b2 07 bf ec add %fp, -20, %i1 201651c: b6 07 bf f4 add %fp, -12, %i3 2016520: a4 07 bf f8 add %fp, -8, %l2 2016524: 21 00 80 e7 sethi %hi(0x2039c00), %l0 2016528: 29 00 80 e7 sethi %hi(0x2039c00), %l4 201652c: f2 27 bf e8 st %i1, [ %fp + -24 ] head->previous = NULL; 2016530: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2016534: e6 27 bf f0 st %l3, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016538: e4 27 bf f4 st %l2, [ %fp + -12 ] head->previous = NULL; 201653c: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2016540: f6 27 bf fc st %i3, [ %fp + -4 ] 2016544: a2 14 63 cc or %l1, 0x3cc, %l1 2016548: b8 06 20 30 add %i0, 0x30, %i4 201654c: a0 14 23 4c or %l0, 0x34c, %l0 2016550: b4 06 20 68 add %i0, 0x68, %i2 2016554: a8 15 22 c0 or %l4, 0x2c0, %l4 2016558: ae 06 20 08 add %i0, 8, %l7 201655c: ac 06 20 40 add %i0, 0x40, %l6 _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; 2016560: aa 10 20 01 mov 1, %l5 { /* * 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; 2016564: e6 26 20 78 st %l3, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016568: c2 04 40 00 ld [ %l1 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 201656c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016570: 94 10 00 1b mov %i3, %o2 2016574: 90 10 00 1c mov %i4, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016578: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201657c: 40 00 12 cf call 201b0b8 <_Watchdog_Adjust_to_chain> 2016580: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2016584: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2016588: fa 04 00 00 ld [ %l0 ], %i5 /* * 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 ) { 201658c: 80 a7 40 0a cmp %i5, %o2 2016590: 18 80 00 2e bgu 2016648 <_Timer_server_Body+0x13c> 2016594: 92 27 40 0a sub %i5, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2016598: 80 a7 40 0a cmp %i5, %o2 201659c: 0a 80 00 2f bcs 2016658 <_Timer_server_Body+0x14c> 20165a0: 90 10 00 1a mov %i2, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 20165a4: fa 26 20 74 st %i5, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20165a8: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20165ac: 40 00 03 06 call 20171c4 <_Chain_Get> 20165b0: 01 00 00 00 nop if ( timer == NULL ) { 20165b4: 92 92 20 00 orcc %o0, 0, %o1 20165b8: 02 80 00 10 be 20165f8 <_Timer_server_Body+0xec> 20165bc: 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 ) { 20165c0: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 20165c4: 80 a0 60 01 cmp %g1, 1 20165c8: 02 80 00 28 be 2016668 <_Timer_server_Body+0x15c> 20165cc: 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 ) { 20165d0: 12 bf ff f6 bne 20165a8 <_Timer_server_Body+0x9c> <== NEVER TAKEN 20165d4: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20165d8: 40 00 12 e9 call 201b17c <_Watchdog_Insert> 20165dc: 90 10 00 1a mov %i2, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20165e0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20165e4: 40 00 02 f8 call 20171c4 <_Chain_Get> 20165e8: 01 00 00 00 nop if ( timer == NULL ) { 20165ec: 92 92 20 00 orcc %o0, 0, %o1 20165f0: 32 bf ff f5 bne,a 20165c4 <_Timer_server_Body+0xb8> <== NEVER TAKEN 20165f4: c2 02 60 38 ld [ %o1 + 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 ); 20165f8: 7f ff e2 35 call 200eecc 20165fc: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2016600: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016604: 80 a0 40 19 cmp %g1, %i1 2016608: 02 80 00 1c be 2016678 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 201660c: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2016610: 7f ff e2 33 call 200eedc <== NOT EXECUTED 2016614: 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; 2016618: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 201661c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016620: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED 2016624: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016628: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 201662c: 40 00 12 a3 call 201b0b8 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 2016630: 92 20 40 09 sub %g1, %o1, %o1 <== 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; 2016634: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== 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(); 2016638: fa 04 00 00 ld [ %l0 ], %i5 <== 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 ) { 201663c: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED 2016640: 08 bf ff d7 bleu 201659c <_Timer_server_Body+0x90> <== NOT EXECUTED 2016644: 92 27 40 0a sub %i5, %o2, %o1 <== 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 ); 2016648: 90 10 00 1a mov %i2, %o0 201664c: 40 00 12 9b call 201b0b8 <_Watchdog_Adjust_to_chain> 2016650: 94 10 00 1b mov %i3, %o2 2016654: 30 bf ff d4 b,a 20165a4 <_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 ); 2016658: 92 10 20 01 mov 1, %o1 201665c: 40 00 12 68 call 201affc <_Watchdog_Adjust> 2016660: 94 22 80 1d sub %o2, %i5, %o2 2016664: 30 bf ff d0 b,a 20165a4 <_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 ); 2016668: 90 10 00 1c mov %i4, %o0 201666c: 40 00 12 c4 call 201b17c <_Watchdog_Insert> 2016670: 92 02 60 10 add %o1, 0x10, %o1 2016674: 30 bf ff cd b,a 20165a8 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 2016678: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 201667c: 7f ff e2 18 call 200eedc 2016680: 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 ) ) { 2016684: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016688: 80 a0 40 12 cmp %g1, %l2 201668c: 12 80 00 0c bne 20166bc <_Timer_server_Body+0x1b0> 2016690: 01 00 00 00 nop 2016694: 30 80 00 13 b,a 20166e0 <_Timer_server_Body+0x1d4> Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; new_first->previous = head; 2016698: f6 20 60 04 st %i3, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 201669c: c2 27 bf f4 st %g1, [ %fp + -12 ] * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 20166a0: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 20166a4: 7f ff e2 0e call 200eedc 20166a8: 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 ); 20166ac: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 20166b0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20166b4: 9f c0 40 00 call %g1 20166b8: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 20166bc: 7f ff e2 04 call 200eecc 20166c0: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20166c4: fa 07 bf f4 ld [ %fp + -12 ], %i5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 20166c8: 80 a7 40 12 cmp %i5, %l2 20166cc: 32 bf ff f3 bne,a 2016698 <_Timer_server_Body+0x18c> 20166d0: c2 07 40 00 ld [ %i5 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 20166d4: 7f ff e2 02 call 200eedc 20166d8: 01 00 00 00 nop 20166dc: 30 bf ff a2 b,a 2016564 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20166e0: c0 2e 20 7c clrb [ %i0 + 0x7c ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20166e4: c2 05 00 00 ld [ %l4 ], %g1 20166e8: 82 00 60 01 inc %g1 20166ec: c2 25 00 00 st %g1, [ %l4 ] return _Thread_Dispatch_disable_level; 20166f0: c2 05 00 00 ld [ %l4 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 20166f4: d0 06 00 00 ld [ %i0 ], %o0 20166f8: 40 00 10 ab call 201a9a4 <_Thread_Set_state> 20166fc: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2016700: 7f ff ff 5b call 201646c <_Timer_server_Reset_interval_system_watchdog> 2016704: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016708: 7f ff ff 6d call 20164bc <_Timer_server_Reset_tod_system_watchdog> 201670c: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2016710: 40 00 0e 2f call 2019fcc <_Thread_Enable_dispatch> 2016714: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016718: 90 10 00 17 mov %l7, %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; 201671c: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2016720: 40 00 12 f9 call 201b304 <_Watchdog_Remove> 2016724: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016728: 40 00 12 f7 call 201b304 <_Watchdog_Remove> 201672c: 90 10 00 16 mov %l6, %o0 2016730: 30 bf ff 8d b,a 2016564 <_Timer_server_Body+0x58> =============================================================================== 02016734 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2016734: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2016738: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 201673c: 80 a0 60 00 cmp %g1, 0 2016740: 02 80 00 05 be 2016754 <_Timer_server_Schedule_operation_method+0x20> 2016744: ba 10 00 19 mov %i1, %i5 * server is not preemptible, so we must be in interrupt context here. No * thread dispatch will happen until the timer server finishes its * critical section. We have to use the protected chain methods because * we may be interrupted by a higher priority interrupt. */ _Chain_Append( ts->insert_chain, &timer->Object.Node ); 2016748: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 201674c: 40 00 02 8a call 2017174 <_Chain_Append> 2016750: 81 e8 00 00 restore * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2016754: 03 00 80 e7 sethi %hi(0x2039c00), %g1 2016758: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 2039ec0 <_Thread_Dispatch_disable_level> 201675c: 84 00 a0 01 inc %g2 2016760: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2016764: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2016768: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 201676c: 80 a0 60 01 cmp %g1, 1 2016770: 02 80 00 28 be 2016810 <_Timer_server_Schedule_operation_method+0xdc> 2016774: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); if ( !ts->active ) { _Timer_server_Reset_interval_system_watchdog( ts ); } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2016778: 02 80 00 04 be 2016788 <_Timer_server_Schedule_operation_method+0x54> 201677c: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016780: 40 00 0e 13 call 2019fcc <_Thread_Enable_dispatch> 2016784: 81 e8 00 00 restore } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2016788: 7f ff e1 d1 call 200eecc 201678c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2016790: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016794: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016798: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 201679c: 03 00 80 e7 sethi %hi(0x2039c00), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 20167a0: 80 a0 80 04 cmp %g2, %g4 20167a4: 02 80 00 0d be 20167d8 <_Timer_server_Schedule_operation_method+0xa4> 20167a8: c2 00 63 4c ld [ %g1 + 0x34c ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 20167ac: de 00 a0 10 ld [ %g2 + 0x10 ], %o7 if ( snapshot > last_snapshot ) { 20167b0: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 20167b4: 88 03 c0 03 add %o7, %g3, %g4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 20167b8: 08 80 00 07 bleu 20167d4 <_Timer_server_Schedule_operation_method+0xa0> 20167bc: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 20167c0: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 20167c4: 80 a3 c0 03 cmp %o7, %g3 20167c8: 08 80 00 03 bleu 20167d4 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN 20167cc: 88 10 20 00 clr %g4 delta_interval -= delta; 20167d0: 88 23 c0 03 sub %o7, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 20167d4: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 20167d8: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 20167dc: 7f ff e1 c0 call 200eedc 20167e0: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20167e4: 90 06 20 68 add %i0, 0x68, %o0 20167e8: 40 00 12 65 call 201b17c <_Watchdog_Insert> 20167ec: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20167f0: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20167f4: 80 a0 60 00 cmp %g1, 0 20167f8: 12 bf ff e2 bne 2016780 <_Timer_server_Schedule_operation_method+0x4c> 20167fc: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2016800: 7f ff ff 2f call 20164bc <_Timer_server_Reset_tod_system_watchdog> 2016804: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2016808: 40 00 0d f1 call 2019fcc <_Thread_Enable_dispatch> 201680c: 81 e8 00 00 restore if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 2016810: 7f ff e1 af call 200eecc 2016814: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016818: 05 00 80 e7 sethi %hi(0x2039c00), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201681c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2016820: c4 00 a3 cc ld [ %g2 + 0x3cc ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2016824: c8 06 20 3c ld [ %i0 + 0x3c ], %g4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016828: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 201682c: 80 a0 40 03 cmp %g1, %g3 2016830: 02 80 00 08 be 2016850 <_Timer_server_Schedule_operation_method+0x11c> 2016834: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2016838: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 201683c: 80 a1 00 0f cmp %g4, %o7 2016840: 1a 80 00 03 bcc 201684c <_Timer_server_Schedule_operation_method+0x118> 2016844: 86 10 20 00 clr %g3 delta_interval -= delta; 2016848: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 201684c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2016850: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2016854: 7f ff e1 a2 call 200eedc 2016858: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201685c: 90 06 20 30 add %i0, 0x30, %o0 2016860: 40 00 12 47 call 201b17c <_Watchdog_Insert> 2016864: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2016868: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 201686c: 80 a0 60 00 cmp %g1, 0 2016870: 12 bf ff c4 bne 2016780 <_Timer_server_Schedule_operation_method+0x4c> 2016874: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2016878: 7f ff fe fd call 201646c <_Timer_server_Reset_interval_system_watchdog> 201687c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2016880: 40 00 0d d3 call 2019fcc <_Thread_Enable_dispatch> 2016884: 81 e8 00 00 restore =============================================================================== 02009dec <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 2009dec: 9d e3 bf a0 save %sp, -96, %sp 2009df0: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009df4: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 2009df8: c8 00 60 04 ld [ %g1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 2009dfc: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 2009e00: c4 06 60 04 ld [ %i1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009e04: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 2009e08: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 2009e0c: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009e10: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 2009e14: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 2009e18: 80 a0 80 04 cmp %g2, %g4 2009e1c: 08 80 00 0b bleu 2009e48 <_Timespec_Add_to+0x5c> 2009e20: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2009e24: 1f 31 19 4d sethi %hi(0xc4653400), %o7 2009e28: 9e 13 e2 00 or %o7, 0x200, %o7 ! c4653600 2009e2c: 84 00 80 0f add %g2, %o7, %g2 time->tv_sec++; 2009e30: 86 00 e0 01 inc %g3 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2009e34: 80 a0 80 04 cmp %g2, %g4 2009e38: 18 bf ff fd bgu 2009e2c <_Timespec_Add_to+0x40> <== NEVER TAKEN 2009e3c: b0 06 20 01 inc %i0 2009e40: c4 20 60 04 st %g2, [ %g1 + 4 ] 2009e44: c6 20 40 00 st %g3, [ %g1 ] time->tv_sec++; seconds++; } return seconds; } 2009e48: 81 c7 e0 08 ret 2009e4c: 81 e8 00 00 restore =============================================================================== 02009ff4 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 2009ff4: 9d e3 bf a0 save %sp, -96, %sp 2009ff8: 39 00 80 71 sethi %hi(0x201c400), %i4 2009ffc: b8 17 21 58 or %i4, 0x158, %i4 ! 201c558 <_User_extensions_List> 200a000: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a004: 80 a7 40 1c cmp %i5, %i4 200a008: 02 80 00 0d be 200a03c <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200a00c: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 200a010: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a014: 80 a0 60 00 cmp %g1, 0 200a018: 02 80 00 05 be 200a02c <_User_extensions_Fatal+0x38> 200a01c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200a020: 92 10 00 19 mov %i1, %o1 200a024: 9f c0 40 00 call %g1 200a028: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200a02c: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a030: 80 a7 40 1c cmp %i5, %i4 200a034: 32 bf ff f8 bne,a 200a014 <_User_extensions_Fatal+0x20> 200a038: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200a03c: 81 c7 e0 08 ret 200a040: 81 e8 00 00 restore =============================================================================== 02009ea0 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009ea0: 9d e3 bf a0 save %sp, -96, %sp User_extensions_Control *extension; uint32_t i; uint32_t number_of_extensions; User_extensions_Table *initial_extensions; number_of_extensions = Configuration.number_of_initial_extensions; 2009ea4: 07 00 80 6d sethi %hi(0x201b400), %g3 2009ea8: 86 10 e2 7c or %g3, 0x27c, %g3 ! 201b67c initial_extensions = Configuration.User_extension_table; 2009eac: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3 2009eb0: 3b 00 80 71 sethi %hi(0x201c400), %i5 2009eb4: 09 00 80 70 sethi %hi(0x201c000), %g4 2009eb8: 84 17 61 58 or %i5, 0x158, %g2 2009ebc: 82 11 23 74 or %g4, 0x374, %g1 2009ec0: b4 00 a0 04 add %g2, 4, %i2 2009ec4: b8 00 60 04 add %g1, 4, %i4 2009ec8: f4 27 61 58 st %i2, [ %i5 + 0x158 ] head->previous = NULL; 2009ecc: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 2009ed0: c4 20 a0 08 st %g2, [ %g2 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009ed4: f8 21 23 74 st %i4, [ %g4 + 0x374 ] head->previous = NULL; 2009ed8: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009edc: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009ee0: 80 a6 e0 00 cmp %i3, 0 2009ee4: 02 80 00 1b be 2009f50 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009ee8: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009eec: 83 2e a0 02 sll %i2, 2, %g1 2009ef0: b9 2e a0 04 sll %i2, 4, %i4 2009ef4: b8 27 00 01 sub %i4, %g1, %i4 2009ef8: b8 07 00 1a add %i4, %i2, %i4 2009efc: b9 2f 20 02 sll %i4, 2, %i4 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009f00: 40 00 01 96 call 200a558 <_Workspace_Allocate_or_fatal_error> 2009f04: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009f08: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009f0c: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009f10: 40 00 15 99 call 200f574 2009f14: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009f18: 80 a6 a0 00 cmp %i2, 0 2009f1c: 02 80 00 0d be 2009f50 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009f20: b8 10 20 00 clr %i4 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 2009f24: 92 10 00 1b mov %i3, %o1 2009f28: 94 10 20 20 mov 0x20, %o2 2009f2c: 40 00 15 56 call 200f484 2009f30: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 2009f34: 40 00 0c 9b call 200d1a0 <_User_extensions_Add_set> 2009f38: 90 10 00 1d mov %i5, %o0 2009f3c: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009f40: ba 07 60 34 add %i5, 0x34, %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009f44: 80 a7 00 1a cmp %i4, %i2 2009f48: 12 bf ff f7 bne 2009f24 <_User_extensions_Handler_initialization+0x84> 2009f4c: b6 06 e0 20 add %i3, 0x20, %i3 2009f50: 81 c7 e0 08 ret 2009f54: 81 e8 00 00 restore =============================================================================== 02009f58 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 2009f58: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009f5c: 39 00 80 71 sethi %hi(0x201c400), %i4 2009f60: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 ! 201c558 <_User_extensions_List> 2009f64: b8 17 21 58 or %i4, 0x158, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009f68: b8 07 20 04 add %i4, 4, %i4 2009f6c: 80 a7 40 1c cmp %i5, %i4 2009f70: 02 80 00 0c be 2009fa0 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 2009f74: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 2009f78: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009f7c: 80 a0 60 00 cmp %g1, 0 2009f80: 02 80 00 04 be 2009f90 <_User_extensions_Thread_begin+0x38> 2009f84: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 2009f88: 9f c0 40 00 call %g1 2009f8c: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 2009f90: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 2009f94: 80 a7 40 1c cmp %i5, %i4 2009f98: 32 bf ff f9 bne,a 2009f7c <_User_extensions_Thread_begin+0x24> 2009f9c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009fa0: 81 c7 e0 08 ret 2009fa4: 81 e8 00 00 restore =============================================================================== 0200a044 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200a044: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a048: 39 00 80 71 sethi %hi(0x201c400), %i4 200a04c: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 ! 201c558 <_User_extensions_List> 200a050: b8 17 21 58 or %i4, 0x158, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200a054: b8 07 20 04 add %i4, 4, %i4 200a058: 80 a7 40 1c cmp %i5, %i4 200a05c: 02 80 00 12 be 200a0a4 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 200a060: 82 10 20 01 mov 1, %g1 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 200a064: 37 00 80 71 sethi %hi(0x201c400), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 200a068: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a06c: 80 a0 60 00 cmp %g1, 0 200a070: 02 80 00 08 be 200a090 <_User_extensions_Thread_create+0x4c> 200a074: 84 16 e1 9c or %i3, 0x19c, %g2 status = (*the_extension->Callouts.thread_create)( 200a078: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a07c: 9f c0 40 00 call %g1 200a080: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200a084: 80 8a 20 ff btst 0xff, %o0 200a088: 02 80 00 0a be 200a0b0 <_User_extensions_Thread_create+0x6c> 200a08c: 82 10 20 00 clr %g1 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a090: fa 07 40 00 ld [ %i5 ], %i5 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200a094: 80 a7 40 1c cmp %i5, %i4 200a098: 32 bf ff f5 bne,a 200a06c <_User_extensions_Thread_create+0x28> 200a09c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200a0a0: 82 10 20 01 mov 1, %g1 } 200a0a4: b0 08 60 01 and %g1, 1, %i0 200a0a8: 81 c7 e0 08 ret 200a0ac: 81 e8 00 00 restore 200a0b0: b0 08 60 01 and %g1, 1, %i0 200a0b4: 81 c7 e0 08 ret 200a0b8: 81 e8 00 00 restore =============================================================================== 0200a0bc <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200a0bc: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200a0c0: 39 00 80 71 sethi %hi(0x201c400), %i4 200a0c4: b8 17 21 58 or %i4, 0x158, %i4 ! 201c558 <_User_extensions_List> 200a0c8: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a0cc: 80 a7 40 1c cmp %i5, %i4 200a0d0: 02 80 00 0d be 200a104 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200a0d4: 37 00 80 71 sethi %hi(0x201c400), %i3 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 200a0d8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a0dc: 80 a0 60 00 cmp %g1, 0 200a0e0: 02 80 00 05 be 200a0f4 <_User_extensions_Thread_delete+0x38> 200a0e4: 84 16 e1 9c or %i3, 0x19c, %g2 (*the_extension->Callouts.thread_delete)( 200a0e8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a0ec: 9f c0 40 00 call %g1 200a0f0: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200a0f4: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200a0f8: 80 a7 40 1c cmp %i5, %i4 200a0fc: 32 bf ff f8 bne,a 200a0dc <_User_extensions_Thread_delete+0x20> 200a100: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200a104: 81 c7 e0 08 ret 200a108: 81 e8 00 00 restore =============================================================================== 02009fa8 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 2009fa8: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 2009fac: 39 00 80 71 sethi %hi(0x201c400), %i4 2009fb0: b8 17 21 58 or %i4, 0x158, %i4 ! 201c558 <_User_extensions_List> 2009fb4: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009fb8: 80 a7 40 1c cmp %i5, %i4 2009fbc: 02 80 00 0c be 2009fec <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 2009fc0: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 2009fc4: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009fc8: 80 a0 60 00 cmp %g1, 0 2009fcc: 02 80 00 04 be 2009fdc <_User_extensions_Thread_exitted+0x34> 2009fd0: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 2009fd4: 9f c0 40 00 call %g1 2009fd8: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 2009fdc: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 2009fe0: 80 a7 40 1c cmp %i5, %i4 2009fe4: 32 bf ff f9 bne,a 2009fc8 <_User_extensions_Thread_exitted+0x20> 2009fe8: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 2009fec: 81 c7 e0 08 ret 2009ff0: 81 e8 00 00 restore =============================================================================== 0200a94c <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200a94c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a950: 39 00 80 74 sethi %hi(0x201d000), %i4 200a954: fa 07 20 78 ld [ %i4 + 0x78 ], %i5 ! 201d078 <_User_extensions_List> 200a958: b8 17 20 78 or %i4, 0x78, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a95c: b8 07 20 04 add %i4, 4, %i4 200a960: 80 a7 40 1c cmp %i5, %i4 200a964: 02 80 00 0d be 200a998 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200a968: 37 00 80 74 sethi %hi(0x201d000), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 200a96c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a970: 80 a0 60 00 cmp %g1, 0 200a974: 02 80 00 05 be 200a988 <_User_extensions_Thread_restart+0x3c> 200a978: 84 16 e0 bc or %i3, 0xbc, %g2 (*the_extension->Callouts.thread_restart)( 200a97c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a980: 9f c0 40 00 call %g1 200a984: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a988: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a98c: 80 a7 40 1c cmp %i5, %i4 200a990: 32 bf ff f8 bne,a 200a970 <_User_extensions_Thread_restart+0x24> 200a994: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200a998: 81 c7 e0 08 ret 200a99c: 81 e8 00 00 restore =============================================================================== 0200a10c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200a10c: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a110: 39 00 80 71 sethi %hi(0x201c400), %i4 200a114: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 ! 201c558 <_User_extensions_List> 200a118: b8 17 21 58 or %i4, 0x158, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a11c: b8 07 20 04 add %i4, 4, %i4 200a120: 80 a7 40 1c cmp %i5, %i4 200a124: 02 80 00 0d be 200a158 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200a128: 37 00 80 71 sethi %hi(0x201c400), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 200a12c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a130: 80 a0 60 00 cmp %g1, 0 200a134: 02 80 00 05 be 200a148 <_User_extensions_Thread_start+0x3c> 200a138: 84 16 e1 9c or %i3, 0x19c, %g2 (*the_extension->Callouts.thread_start)( 200a13c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200a140: 9f c0 40 00 call %g1 200a144: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200a148: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200a14c: 80 a7 40 1c cmp %i5, %i4 200a150: 32 bf ff f8 bne,a 200a130 <_User_extensions_Thread_start+0x24> 200a154: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200a158: 81 c7 e0 08 ret 200a15c: 81 e8 00 00 restore =============================================================================== 0200a160 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200a160: 9d e3 bf a0 save %sp, -96, %sp 200a164: 39 00 80 70 sethi %hi(0x201c000), %i4 200a168: fa 07 23 74 ld [ %i4 + 0x374 ], %i5 ! 201c374 <_User_extensions_Switches_list> 200a16c: b8 17 23 74 or %i4, 0x374, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a170: b8 07 20 04 add %i4, 4, %i4 200a174: 80 a7 40 1c cmp %i5, %i4 200a178: 02 80 00 0a be 200a1a0 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200a17c: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 200a180: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a184: 90 10 00 18 mov %i0, %o0 200a188: 9f c0 40 00 call %g1 200a18c: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 200a190: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200a194: 80 a7 40 1c cmp %i5, %i4 200a198: 32 bf ff fb bne,a 200a184 <_User_extensions_Thread_switch+0x24> 200a19c: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a1a0: 81 c7 e0 08 ret 200a1a4: 81 e8 00 00 restore =============================================================================== 0200bc1c <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200bc1c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200bc20: 7f ff dc c4 call 2002f30 200bc24: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200bc28: c2 06 00 00 ld [ %i0 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200bc2c: b6 06 20 04 add %i0, 4, %i3 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200bc30: 80 a0 40 1b cmp %g1, %i3 200bc34: 02 80 00 1e be 200bcac <_Watchdog_Adjust+0x90> 200bc38: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200bc3c: 12 80 00 1e bne 200bcb4 <_Watchdog_Adjust+0x98> 200bc40: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bc44: 80 a6 a0 00 cmp %i2, 0 200bc48: 02 80 00 19 be 200bcac <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bc4c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bc50: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bc54: 80 a6 80 1c cmp %i2, %i4 200bc58: 1a 80 00 0a bcc 200bc80 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200bc5c: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200bc60: 10 80 00 1c b 200bcd0 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200bc64: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200bc68: 02 80 00 11 be 200bcac <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bc6c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200bc70: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200bc74: 80 a7 00 1a cmp %i4, %i2 200bc78: 38 80 00 16 bgu,a 200bcd0 <_Watchdog_Adjust+0xb4> 200bc7c: b8 27 00 1a sub %i4, %i2, %i4 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200bc80: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200bc84: 7f ff dc af call 2002f40 200bc88: 01 00 00 00 nop _Watchdog_Tickle( header ); 200bc8c: 40 00 00 ab call 200bf38 <_Watchdog_Tickle> 200bc90: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200bc94: 7f ff dc a7 call 2002f30 200bc98: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200bc9c: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200bca0: 80 a6 c0 01 cmp %i3, %g1 200bca4: 32 bf ff f1 bne,a 200bc68 <_Watchdog_Adjust+0x4c> 200bca8: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200bcac: 7f ff dc a5 call 2002f40 200bcb0: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200bcb4: 12 bf ff fe bne 200bcac <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200bcb8: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200bcbc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200bcc0: b4 00 80 1a add %g2, %i2, %i2 200bcc4: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200bcc8: 7f ff dc 9e call 2002f40 200bccc: 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; 200bcd0: 10 bf ff f7 b 200bcac <_Watchdog_Adjust+0x90> 200bcd4: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200a330 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200a330: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200a334: 7f ff df ac call 20021e4 200a338: 01 00 00 00 nop previous_state = the_watchdog->state; 200a33c: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200a340: 80 a7 60 01 cmp %i5, 1 200a344: 02 80 00 2a be 200a3ec <_Watchdog_Remove+0xbc> 200a348: 03 00 80 71 sethi %hi(0x201c400), %g1 200a34c: 1a 80 00 09 bcc 200a370 <_Watchdog_Remove+0x40> 200a350: 80 a7 60 03 cmp %i5, 3 _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a354: 03 00 80 71 sethi %hi(0x201c400), %g1 200a358: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 ! 201c47c <_Watchdog_Ticks_since_boot> 200a35c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a360: 7f ff df a5 call 20021f4 200a364: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a368: 81 c7 e0 08 ret 200a36c: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200a370: 18 bf ff fa bgu 200a358 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200a374: 03 00 80 71 sethi %hi(0x201c400), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 200a378: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200a37c: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200a380: c4 00 40 00 ld [ %g1 ], %g2 200a384: 80 a0 a0 00 cmp %g2, 0 200a388: 02 80 00 07 be 200a3a4 <_Watchdog_Remove+0x74> 200a38c: 05 00 80 71 sethi %hi(0x201c400), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200a390: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a394: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200a398: 84 00 c0 02 add %g3, %g2, %g2 200a39c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200a3a0: 05 00 80 71 sethi %hi(0x201c400), %g2 200a3a4: c4 00 a0 78 ld [ %g2 + 0x78 ], %g2 ! 201c478 <_Watchdog_Sync_count> 200a3a8: 80 a0 a0 00 cmp %g2, 0 200a3ac: 22 80 00 07 be,a 200a3c8 <_Watchdog_Remove+0x98> 200a3b0: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200a3b4: 05 00 80 71 sethi %hi(0x201c400), %g2 200a3b8: c6 00 a1 a4 ld [ %g2 + 0x1a4 ], %g3 ! 201c5a4 <_Per_CPU_Information+0x8> 200a3bc: 05 00 80 71 sethi %hi(0x201c400), %g2 200a3c0: c6 20 a0 18 st %g3, [ %g2 + 0x18 ] ! 201c418 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200a3c4: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200a3c8: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200a3cc: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a3d0: 03 00 80 71 sethi %hi(0x201c400), %g1 200a3d4: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 ! 201c47c <_Watchdog_Ticks_since_boot> 200a3d8: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a3dc: 7f ff df 86 call 20021f4 200a3e0: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a3e4: 81 c7 e0 08 ret 200a3e8: 81 e8 00 00 restore _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a3ec: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 /* * It is not actually on the chain so just change the state and * the Insert operation we interrupted will be aborted. */ the_watchdog->state = WATCHDOG_INACTIVE; 200a3f0: c0 26 20 08 clr [ %i0 + 8 ] _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200a3f4: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200a3f8: 7f ff df 7f call 20021f4 200a3fc: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200a400: 81 c7 e0 08 ret 200a404: 81 e8 00 00 restore =============================================================================== 0200b44c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200b44c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200b450: 7f ff dd 99 call 2002ab4 200b454: 01 00 00 00 nop 200b458: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200b45c: 11 00 80 70 sethi %hi(0x201c000), %o0 200b460: 94 10 00 19 mov %i1, %o2 200b464: 92 10 00 18 mov %i0, %o1 200b468: 7f ff e4 b1 call 200472c 200b46c: 90 12 23 90 or %o0, 0x390, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b470: f8 06 40 00 ld [ %i1 ], %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b474: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200b478: 80 a7 00 19 cmp %i4, %i1 200b47c: 02 80 00 0f be 200b4b8 <_Watchdog_Report_chain+0x6c> 200b480: 11 00 80 70 sethi %hi(0x201c000), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200b484: 92 10 00 1c mov %i4, %o1 200b488: 40 00 00 0f call 200b4c4 <_Watchdog_Report> 200b48c: 90 10 20 00 clr %o0 _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; node != _Chain_Tail(header) ; node = node->next ) 200b490: f8 07 00 00 ld [ %i4 ], %i4 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200b494: 80 a7 00 19 cmp %i4, %i1 200b498: 12 bf ff fc bne 200b488 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200b49c: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200b4a0: 11 00 80 70 sethi %hi(0x201c000), %o0 200b4a4: 92 10 00 18 mov %i0, %o1 200b4a8: 7f ff e4 a1 call 200472c 200b4ac: 90 12 23 a8 or %o0, 0x3a8, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200b4b0: 7f ff dd 85 call 2002ac4 200b4b4: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200b4b8: 7f ff e4 9d call 200472c 200b4bc: 90 12 23 b8 or %o0, 0x3b8, %o0 200b4c0: 30 bf ff fc b,a 200b4b0 <_Watchdog_Report_chain+0x64> =============================================================================== 020190e8 <__kill>: #endif int __kill( pid_t pid, int sig ) { return 0; } 20190e8: 81 c3 e0 08 retl <== NOT EXECUTED 20190ec: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 02013ac0 <_fat_block_read>: uint32_t start, uint32_t offset, uint32_t count, void *buff ) { 2013ac0: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; register fat_fs_info_t *fs_info = mt_entry->fs_info; ssize_t cmpltd = 0; uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; 2013ac4: c0 27 bf fc clr [ %fp + -4 ] uint32_t count, void *buff ) { int rc = RC_OK; register fat_fs_info_t *fs_info = mt_entry->fs_info; 2013ac8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while (count > 0) 2013acc: 80 a6 e0 00 cmp %i3, 0 2013ad0: 12 80 00 12 bne 2013b18 <_fat_block_read+0x58> <== ALWAYS TAKEN 2013ad4: b0 10 20 00 clr %i0 2013ad8: 30 80 00 1a b,a 2013b40 <_fat_block_read+0x80> <== NOT EXECUTED { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2013adc: e0 17 40 00 lduh [ %i5 ], %l0 memcpy((buff + cmpltd), (block->buffer + ofs), c); 2013ae0: c2 07 bf fc ld [ %fp + -4 ], %g1 { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2013ae4: a0 24 00 1a sub %l0, %i2, %l0 2013ae8: 80 a4 00 1b cmp %l0, %i3 2013aec: 08 80 00 03 bleu 2013af8 <_fat_block_read+0x38> 2013af0: b2 06 60 01 inc %i1 2013af4: a0 10 00 1b mov %i3, %l0 memcpy((buff + cmpltd), (block->buffer + ofs), c); 2013af8: d2 00 60 24 ld [ %g1 + 0x24 ], %o1 2013afc: 94 10 00 10 mov %l0, %o2 2013b00: 40 00 27 da call 201da68 2013b04: 92 02 40 1a add %o1, %i2, %o1 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while (count > 0) 2013b08: b6 a6 c0 10 subcc %i3, %l0, %i3 2013b0c: 02 80 00 0d be 2013b40 <_fat_block_read+0x80> 2013b10: b0 04 00 18 add %l0, %i0, %i0 memcpy((buff + cmpltd), (block->buffer + ofs), c); count -= c; cmpltd += c; blk++; ofs = 0; 2013b14: b4 10 20 00 clr %i2 rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while (count > 0) { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); 2013b18: 92 10 00 19 mov %i1, %o1 2013b1c: 94 10 20 01 mov 1, %o2 2013b20: 96 07 bf fc add %fp, -4, %o3 2013b24: 7f ff ff 04 call 2013734 2013b28: 90 10 00 1d mov %i5, %o0 if (rc != RC_OK) 2013b2c: 80 a2 20 00 cmp %o0, 0 2013b30: 02 bf ff eb be 2013adc <_fat_block_read+0x1c> <== ALWAYS TAKEN 2013b34: 90 07 00 18 add %i4, %i0, %o0 cmpltd += c; blk++; ofs = 0; } return cmpltd; } 2013b38: 81 c7 e0 08 ret <== NOT EXECUTED 2013b3c: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2013b40: 81 c7 e0 08 ret 2013b44: 81 e8 00 00 restore =============================================================================== 02013c04 <_fat_block_release>: int _fat_block_release( rtems_filesystem_mount_table_entry_t *mt_entry) { fat_fs_info_t *fs_info = mt_entry->fs_info; return fat_buf_release(fs_info); 2013c04: d0 02 20 34 ld [ %o0 + 0x34 ], %o0 <== NOT EXECUTED 2013c08: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2013c0c: 7f ff ff 51 call 2013950 <== NOT EXECUTED 2013c10: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02013b48 <_fat_block_write>: rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t start, uint32_t offset, uint32_t count, const void *buff) { 2013b48: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; ssize_t cmpltd = 0; uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; 2013b4c: c0 27 bf fc clr [ %fp + -4 ] uint32_t offset, uint32_t count, const void *buff) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 2013b50: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 2013b54: a2 10 20 01 mov 1, %l1 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) 2013b58: 80 a6 e0 00 cmp %i3, 0 2013b5c: 12 80 00 14 bne 2013bac <_fat_block_write+0x64> <== ALWAYS TAKEN 2013b60: b0 10 20 00 clr %i0 2013b64: 30 80 00 26 b,a 2013bfc <_fat_block_write+0xb4> <== NOT EXECUTED c = MIN(count, (fs_info->vol.bps - ofs)); if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); 2013b68: 96 07 bf fc add %fp, -4, %o3 2013b6c: 7f ff fe f2 call 2013734 2013b70: 90 10 00 10 mov %l0, %o0 if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2013b74: 92 07 00 18 add %i4, %i0, %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2013b78: 80 a2 20 00 cmp %o0, 0 2013b7c: 12 80 00 1e bne 2013bf4 <_fat_block_write+0xac> <== NEVER TAKEN 2013b80: 94 10 00 1d mov %i5, %o2 return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2013b84: c2 07 bf fc ld [ %fp + -4 ], %g1 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; 2013b88: b0 07 40 18 add %i5, %i0, %i0 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2013b8c: d0 00 60 24 ld [ %g1 + 0x24 ], %o0 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; blk++; 2013b90: b2 06 60 01 inc %i1 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2013b94: 40 00 27 b5 call 201da68 2013b98: 90 02 00 1a add %o0, %i2, %o0 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) 2013b9c: b6 a6 c0 1d subcc %i3, %i5, %i3 2013ba0: 02 80 00 17 be 2013bfc <_fat_block_write+0xb4> 2013ba4: e2 2c 20 84 stb %l1, [ %l0 + 0x84 ] fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; blk++; ofs = 0; 2013ba8: b4 10 20 00 clr %i2 rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) { c = MIN(count, (fs_info->vol.bps - ofs)); 2013bac: c2 14 00 00 lduh [ %l0 ], %g1 2013bb0: ba 20 40 1a sub %g1, %i2, %i5 2013bb4: 80 a7 40 1b cmp %i5, %i3 2013bb8: 08 80 00 03 bleu 2013bc4 <_fat_block_write+0x7c> 2013bbc: 92 10 00 19 mov %i1, %o1 2013bc0: ba 10 00 1b mov %i3, %i5 if (c == fs_info->vol.bps) 2013bc4: 80 a0 40 1d cmp %g1, %i5 2013bc8: 32 bf ff e8 bne,a 2013b68 <_fat_block_write+0x20> 2013bcc: 94 10 20 01 mov 1, %o2 rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); 2013bd0: 92 10 00 19 mov %i1, %o1 2013bd4: 94 10 20 02 mov 2, %o2 2013bd8: 90 10 00 10 mov %l0, %o0 2013bdc: 7f ff fe d6 call 2013734 2013be0: 96 07 bf fc add %fp, -4, %o3 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2013be4: 92 07 00 18 add %i4, %i0, %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2013be8: 80 a2 20 00 cmp %o0, 0 2013bec: 02 bf ff e6 be 2013b84 <_fat_block_write+0x3c> <== ALWAYS TAKEN 2013bf0: 94 10 00 1d mov %i5, %o2 cmpltd +=c; blk++; ofs = 0; } return cmpltd; } 2013bf4: 81 c7 e0 08 ret <== NOT EXECUTED 2013bf8: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2013bfc: 81 c7 e0 08 ret 2013c00: 81 e8 00 00 restore =============================================================================== 02003044 <_gettimeofday>: int _gettimeofday( struct timeval *tp, struct timezone *tzp ) { return gettimeofday( tp, tzp ); 2003044: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2003048: 7f ff ff e0 call 2002fc8 <== NOT EXECUTED 200304c: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 0201f304 <_rename_r>: int _rename_r( struct _reent *ptr __attribute__((unused)), const char *old, const char *new ) { 201f304: 9d e3 bf 58 save %sp, -168, %sp /* * Get the parent node of the old path to be renamed. Find the parent path. */ old_parent_pathlen = rtems_filesystem_dirname ( old ); 201f308: 7f ff 96 ac call 2004db8 201f30c: 90 10 00 19 mov %i1, %o0 if ( old_parent_pathlen == 0 ) 201f310: 80 a2 20 00 cmp %o0, 0 201f314: 12 80 00 2b bne 201f3c0 <_rename_r+0xbc> 201f318: b8 10 00 08 mov %o0, %i4 rtems_filesystem_get_start_loc( old, &i, &old_parent_loc ); 201f31c: ba 07 bf d0 add %fp, -48, %i5 201f320: 90 10 00 19 mov %i1, %o0 201f324: 92 07 bf f8 add %fp, -8, %o1 201f328: 94 10 00 1d mov %i5, %o2 201f32c: 7f ff 9d 0f call 2006768 201f330: b8 10 20 00 clr %i4 rtems_filesystem_location_info_t old_parent_loc; rtems_filesystem_location_info_t new_parent_loc; int i; int result; const char *name; bool free_old_parentloc = false; 201f334: b6 10 20 00 clr %i3 /* * Start from the parent to find the node that should be under it. */ old_loc = old_parent_loc; 201f338: c2 07 bf d0 ld [ %fp + -48 ], %g1 name = old + old_parent_pathlen; 201f33c: b2 06 40 1c add %i1, %i4, %i1 /* * Start from the parent to find the node that should be under it. */ old_loc = old_parent_loc; 201f340: c2 27 bf bc st %g1, [ %fp + -68 ] 201f344: c2 07 bf d4 ld [ %fp + -44 ], %g1 name = old + old_parent_pathlen; 201f348: f2 27 bf fc st %i1, [ %fp + -4 ] /* * Start from the parent to find the node that should be under it. */ old_loc = old_parent_loc; 201f34c: c2 27 bf c0 st %g1, [ %fp + -64 ] 201f350: c2 07 bf d8 ld [ %fp + -40 ], %g1 name = old + old_parent_pathlen; name += rtems_filesystem_prefix_separators( name, strlen( name ) ); 201f354: 90 10 00 19 mov %i1, %o0 /* * Start from the parent to find the node that should be under it. */ old_loc = old_parent_loc; 201f358: c2 27 bf c4 st %g1, [ %fp + -60 ] 201f35c: c2 07 bf dc ld [ %fp + -36 ], %g1 201f360: c2 27 bf c8 st %g1, [ %fp + -56 ] 201f364: c2 07 bf e0 ld [ %fp + -32 ], %g1 name = old + old_parent_pathlen; name += rtems_filesystem_prefix_separators( name, strlen( name ) ); 201f368: 7f ff cd 3d call 201285c 201f36c: c2 27 bf cc st %g1, [ %fp + -52 ] 201f370: 92 10 00 08 mov %o0, %o1 201f374: 7f ff 96 a0 call 2004df4 201f378: 90 10 00 19 mov %i1, %o0 201f37c: b2 06 40 08 add %i1, %o0, %i1 201f380: f2 27 bf fc st %i1, [ %fp + -4 ] result = rtems_filesystem_evaluate_relative_path( name , strlen( name ), 201f384: 7f ff cd 36 call 201285c 201f388: 90 10 00 19 mov %i1, %o0 201f38c: 94 10 20 00 clr %o2 201f390: 92 10 00 08 mov %o0, %o1 201f394: 96 07 bf bc add %fp, -68, %o3 201f398: 90 10 00 19 mov %i1, %o0 201f39c: 7f ff 96 5b call 2004d08 201f3a0: 98 10 20 00 clr %o4 0, &old_loc, false ); if ( result != 0 ) { 201f3a4: 80 a2 20 00 cmp %o0, 0 201f3a8: 02 80 00 17 be 201f404 <_rename_r+0x100> 201f3ac: 80 8e e0 ff btst 0xff, %i3 if ( free_old_parentloc ) 201f3b0: 12 80 00 11 bne 201f3f4 <_rename_r+0xf0> 201f3b4: b0 10 3f ff mov -1, %i0 if ( free_old_parentloc ) rtems_filesystem_freenode( &old_parent_loc ); rtems_filesystem_freenode( &old_loc ); return result; } 201f3b8: 81 c7 e0 08 ret 201f3bc: 81 e8 00 00 restore old_parent_pathlen = rtems_filesystem_dirname ( old ); if ( old_parent_pathlen == 0 ) rtems_filesystem_get_start_loc( old, &i, &old_parent_loc ); else { result = rtems_filesystem_evaluate_path( old, old_parent_pathlen, 201f3c0: ba 07 bf d0 add %fp, -48, %i5 201f3c4: 90 10 00 19 mov %i1, %o0 201f3c8: 92 10 00 1c mov %i4, %o1 201f3cc: 94 10 20 02 mov 2, %o2 201f3d0: 96 10 00 1d mov %i5, %o3 201f3d4: 98 10 20 00 clr %o4 201f3d8: 7f ff 96 69 call 2004d7c 201f3dc: b0 10 3f ff mov -1, %i0 RTEMS_LIBIO_PERMS_WRITE, &old_parent_loc, false ); if ( result != 0 ) 201f3e0: 80 a2 20 00 cmp %o0, 0 201f3e4: 12 bf ff f5 bne 201f3b8 <_rename_r+0xb4> <== NEVER TAKEN 201f3e8: b6 10 20 01 mov 1, %i3 /* * Start from the parent to find the node that should be under it. */ old_loc = old_parent_loc; 201f3ec: 10 bf ff d4 b 201f33c <_rename_r+0x38> 201f3f0: c2 07 bf d0 ld [ %fp + -48 ], %g1 result = rtems_filesystem_evaluate_relative_path( name , strlen( name ), 0, &old_loc, false ); if ( result != 0 ) { if ( free_old_parentloc ) rtems_filesystem_freenode( &old_parent_loc ); 201f3f4: 7f ff 96 f6 call 2004fcc 201f3f8: 90 10 00 1d mov %i5, %o0 201f3fc: 81 c7 e0 08 ret 201f400: 81 e8 00 00 restore /* * Get the parent of the new node we are renaming to. */ rtems_filesystem_get_start_loc( new, &i, &new_parent_loc ); 201f404: 90 10 00 1a mov %i2, %o0 201f408: 92 07 bf f8 add %fp, -8, %o1 201f40c: 7f ff 9c d7 call 2006768 201f410: 94 07 bf e4 add %fp, -28, %o2 result = (*new_parent_loc.ops->evalformake_h)( &new[i], &new_parent_loc, &name ); 201f414: c2 07 bf f0 ld [ %fp + -16 ], %g1 201f418: d0 07 bf f8 ld [ %fp + -8 ], %o0 201f41c: c2 00 60 04 ld [ %g1 + 4 ], %g1 201f420: 90 06 80 08 add %i2, %o0, %o0 201f424: 92 07 bf e4 add %fp, -28, %o1 201f428: 9f c0 40 00 call %g1 201f42c: 94 07 bf fc add %fp, -4, %o2 if ( result != 0 ) { 201f430: 80 a2 20 00 cmp %o0, 0 201f434: 12 80 00 29 bne 201f4d8 <_rename_r+0x1d4> 201f438: c2 07 bf f4 ld [ %fp + -12 ], %g1 /* * Check to see if the caller is trying to rename across file system * boundaries. */ if ( old_parent_loc.mt_entry != new_parent_loc.mt_entry ) { 201f43c: c4 07 bf e0 ld [ %fp + -32 ], %g2 201f440: 80 a0 80 01 cmp %g2, %g1 201f444: 12 80 00 15 bne 201f498 <_rename_r+0x194> 201f448: c2 07 bf f0 ld [ %fp + -16 ], %g1 rtems_filesystem_freenode( &old_parent_loc ); rtems_filesystem_freenode( &old_loc ); rtems_set_errno_and_return_minus_one( EXDEV ); } result = (*new_parent_loc.ops->rename_h)( &old_parent_loc, &old_loc, &new_parent_loc, name ); 201f44c: d6 07 bf fc ld [ %fp + -4 ], %o3 201f450: c2 00 60 40 ld [ %g1 + 0x40 ], %g1 201f454: 92 07 bf bc add %fp, -68, %o1 201f458: 94 07 bf e4 add %fp, -28, %o2 201f45c: 9f c0 40 00 call %g1 201f460: 90 10 00 1d mov %i5, %o0 201f464: b0 10 00 08 mov %o0, %i0 rtems_filesystem_freenode( &new_parent_loc ); 201f468: 7f ff 96 d9 call 2004fcc 201f46c: 90 07 bf e4 add %fp, -28, %o0 if ( free_old_parentloc ) 201f470: 80 8e e0 ff btst 0xff, %i3 201f474: 12 80 00 06 bne 201f48c <_rename_r+0x188> 201f478: 01 00 00 00 nop rtems_filesystem_freenode( &old_parent_loc ); rtems_filesystem_freenode( &old_loc ); 201f47c: 7f ff 96 d4 call 2004fcc 201f480: 90 07 bf bc add %fp, -68, %o0 return result; } 201f484: 81 c7 e0 08 ret 201f488: 81 e8 00 00 restore result = (*new_parent_loc.ops->rename_h)( &old_parent_loc, &old_loc, &new_parent_loc, name ); rtems_filesystem_freenode( &new_parent_loc ); if ( free_old_parentloc ) rtems_filesystem_freenode( &old_parent_loc ); 201f48c: 7f ff 96 d0 call 2004fcc 201f490: 90 10 00 1d mov %i5, %o0 201f494: 30 bf ff fa b,a 201f47c <_rename_r+0x178> * Check to see if the caller is trying to rename across file system * boundaries. */ if ( old_parent_loc.mt_entry != new_parent_loc.mt_entry ) { rtems_filesystem_freenode( &new_parent_loc ); 201f498: 7f ff 96 cd call 2004fcc 201f49c: 90 07 bf e4 add %fp, -28, %o0 if ( free_old_parentloc ) 201f4a0: 80 8e e0 ff btst 0xff, %i3 201f4a4: 12 80 00 0a bne 201f4cc <_rename_r+0x1c8> 201f4a8: 01 00 00 00 nop rtems_filesystem_freenode( &old_parent_loc ); rtems_filesystem_freenode( &old_loc ); 201f4ac: 7f ff 96 c8 call 2004fcc 201f4b0: 90 07 bf bc add %fp, -68, %o0 rtems_set_errno_and_return_minus_one( EXDEV ); 201f4b4: 7f ff c7 9b call 2011320 <__errno> 201f4b8: b0 10 3f ff mov -1, %i0 201f4bc: 82 10 20 12 mov 0x12, %g1 201f4c0: c2 22 00 00 st %g1, [ %o0 ] 201f4c4: 81 c7 e0 08 ret 201f4c8: 81 e8 00 00 restore */ if ( old_parent_loc.mt_entry != new_parent_loc.mt_entry ) { rtems_filesystem_freenode( &new_parent_loc ); if ( free_old_parentloc ) rtems_filesystem_freenode( &old_parent_loc ); 201f4cc: 7f ff 96 c0 call 2004fcc 201f4d0: 90 10 00 1d mov %i5, %o0 201f4d4: 30 bf ff f6 b,a 201f4ac <_rename_r+0x1a8> rtems_filesystem_get_start_loc( new, &i, &new_parent_loc ); result = (*new_parent_loc.ops->evalformake_h)( &new[i], &new_parent_loc, &name ); if ( result != 0 ) { rtems_filesystem_freenode( &new_parent_loc ); 201f4d8: 7f ff 96 bd call 2004fcc 201f4dc: 90 07 bf e4 add %fp, -28, %o0 if ( free_old_parentloc ) 201f4e0: 80 8e e0 ff btst 0xff, %i3 201f4e4: 02 80 00 05 be 201f4f8 <_rename_r+0x1f4> 201f4e8: 90 07 bf bc add %fp, -68, %o0 rtems_filesystem_freenode( &old_parent_loc ); 201f4ec: 7f ff 96 b8 call 2004fcc 201f4f0: 90 10 00 1d mov %i5, %o0 rtems_filesystem_freenode( &old_loc ); 201f4f4: 90 07 bf bc add %fp, -68, %o0 201f4f8: 7f ff 96 b5 call 2004fcc 201f4fc: b0 10 3f ff mov -1, %i0 return -1; 201f500: 81 c7 e0 08 ret 201f504: 81 e8 00 00 restore =============================================================================== 02004b98 : #include int chroot( const char *pathname ) { 2004b98: 9d e3 bf 88 save %sp, -120, %sp int result; rtems_filesystem_location_info_t loc; /* an automatic call to new private env the first time */ if (rtems_current_user_env == &rtems_global_user_env) { 2004b9c: 3b 00 80 87 sethi %hi(0x2021c00), %i5 2004ba0: f8 07 60 ec ld [ %i5 + 0xec ], %i4 ! 2021cec 2004ba4: 03 00 80 89 sethi %hi(0x2022400), %g1 2004ba8: 82 10 62 2c or %g1, 0x22c, %g1 ! 202262c 2004bac: 80 a7 00 01 cmp %i4, %g1 2004bb0: 02 80 00 20 be 2004c30 2004bb4: 01 00 00 00 nop rtems_libio_set_private_env(); /* try to set a new private env*/ if (rtems_current_user_env == &rtems_global_user_env) /* not ok */ rtems_set_errno_and_return_minus_one( ENOTSUP ); } result = chdir(pathname); 2004bb8: 7f ff ff c3 call 2004ac4 2004bbc: 90 10 00 18 mov %i0, %o0 if (result) { 2004bc0: 80 a2 20 00 cmp %o0, 0 2004bc4: 12 80 00 27 bne 2004c60 2004bc8: 92 10 20 01 mov 1, %o1 rtems_set_errno_and_return_minus_one( errno ); } /* clone the new root location */ if (rtems_filesystem_evaluate_path(".", 1, 0, &loc, 0)) { 2004bcc: 11 00 80 7f sethi %hi(0x201fc00), %o0 2004bd0: 94 10 20 00 clr %o2 2004bd4: 90 12 23 a8 or %o0, 0x3a8, %o0 2004bd8: 96 07 bf ec add %fp, -20, %o3 2004bdc: 40 00 00 68 call 2004d7c 2004be0: 98 10 20 00 clr %o4 2004be4: 80 a2 20 00 cmp %o0, 0 2004be8: 12 80 00 1e bne 2004c60 <== NEVER TAKEN 2004bec: d0 07 60 ec ld [ %i5 + 0xec ], %o0 rtems_set_errno_and_return_minus_one( errno ); } rtems_filesystem_freenode(&rtems_filesystem_root); rtems_filesystem_root = loc; return 0; 2004bf0: b0 10 20 00 clr %i0 /* clone the new root location */ if (rtems_filesystem_evaluate_path(".", 1, 0, &loc, 0)) { /* our cwd has changed, though - but there is no easy way of return :-( */ rtems_set_errno_and_return_minus_one( errno ); } rtems_filesystem_freenode(&rtems_filesystem_root); 2004bf4: 40 00 00 f6 call 2004fcc 2004bf8: 90 02 20 18 add %o0, 0x18, %o0 rtems_filesystem_root = loc; 2004bfc: c2 07 60 ec ld [ %i5 + 0xec ], %g1 2004c00: c4 07 bf ec ld [ %fp + -20 ], %g2 2004c04: c4 20 60 18 st %g2, [ %g1 + 0x18 ] 2004c08: c4 07 bf f0 ld [ %fp + -16 ], %g2 2004c0c: c4 20 60 1c st %g2, [ %g1 + 0x1c ] 2004c10: c4 07 bf f4 ld [ %fp + -12 ], %g2 2004c14: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 2004c18: c4 07 bf f8 ld [ %fp + -8 ], %g2 2004c1c: c4 20 60 24 st %g2, [ %g1 + 0x24 ] 2004c20: c4 07 bf fc ld [ %fp + -4 ], %g2 2004c24: c4 20 60 28 st %g2, [ %g1 + 0x28 ] return 0; } 2004c28: 81 c7 e0 08 ret 2004c2c: 81 e8 00 00 restore int result; rtems_filesystem_location_info_t loc; /* an automatic call to new private env the first time */ if (rtems_current_user_env == &rtems_global_user_env) { rtems_libio_set_private_env(); /* try to set a new private env*/ 2004c30: 40 00 05 a3 call 20062bc 2004c34: 01 00 00 00 nop if (rtems_current_user_env == &rtems_global_user_env) /* not ok */ 2004c38: c2 07 60 ec ld [ %i5 + 0xec ], %g1 2004c3c: 80 a0 40 1c cmp %g1, %i4 2004c40: 12 bf ff de bne 2004bb8 2004c44: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOTSUP ); 2004c48: 40 00 31 b6 call 2011320 <__errno> 2004c4c: b0 10 3f ff mov -1, %i0 ! ffffffff 2004c50: 82 10 20 86 mov 0x86, %g1 2004c54: c2 22 00 00 st %g1, [ %o0 ] 2004c58: 81 c7 e0 08 ret 2004c5c: 81 e8 00 00 restore } /* clone the new root location */ if (rtems_filesystem_evaluate_path(".", 1, 0, &loc, 0)) { /* our cwd has changed, though - but there is no easy way of return :-( */ rtems_set_errno_and_return_minus_one( errno ); 2004c60: 40 00 31 b0 call 2011320 <__errno> 2004c64: b0 10 3f ff mov -1, %i0 2004c68: 40 00 31 ae call 2011320 <__errno> 2004c6c: ba 10 00 08 mov %o0, %i5 2004c70: c2 02 00 00 ld [ %o0 ], %g1 2004c74: c2 27 40 00 st %g1, [ %i5 ] 2004c78: 81 c7 e0 08 ret 2004c7c: 81 e8 00 00 restore =============================================================================== 02002834 : return disktab [major].minor + minor; } static rtems_status_code create_disk(dev_t dev, const char *name, rtems_disk_device **dd_ptr) { 2002834: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major = 0; rtems_device_minor_number minor = 0; rtems_filesystem_split_dev_t(dev, major, minor); if (major >= disktab_size) { 2002838: 39 00 80 65 sethi %hi(0x2019400), %i4 200283c: e0 07 23 b4 ld [ %i4 + 0x3b4 ], %l0 ! 20197b4 2002840: 03 00 80 65 sethi %hi(0x2019400), %g1 return disktab [major].minor + minor; } static rtems_status_code create_disk(dev_t dev, const char *name, rtems_disk_device **dd_ptr) { 2002844: ba 10 00 18 mov %i0, %i5 rtems_device_major_number major = 0; rtems_device_minor_number minor = 0; rtems_filesystem_split_dev_t(dev, major, minor); if (major >= disktab_size) { 2002848: 80 a6 00 10 cmp %i0, %l0 200284c: 0a 80 00 16 bcs 20028a4 2002850: e2 00 63 b8 ld [ %g1 + 0x3b8 ], %l1 rtems_disk_device_table *table = disktab; 2002854: 27 00 80 65 sethi %hi(0x2019400), %l3 rtems_device_major_number old_size = disktab_size; rtems_device_major_number new_size = 2 * old_size; 2002858: a5 2c 20 01 sll %l0, 1, %l2 if (major >= new_size) { 200285c: 80 a6 00 12 cmp %i0, %l2 2002860: 0a 80 00 03 bcs 200286c <== NEVER TAKEN 2002864: d0 04 e3 b8 ld [ %l3 + 0x3b8 ], %o0 new_size = major + 1; 2002868: a4 06 20 01 add %i0, 1, %l2 } table = realloc(table, new_size * sizeof(*table)); 200286c: 93 2c a0 03 sll %l2, 3, %o1 2002870: 40 00 08 31 call 2004934 2002874: b0 10 20 1a mov 0x1a, %i0 if (table == NULL) { 2002878: 80 a2 20 00 cmp %o0, 0 200287c: 02 80 00 1b be 20028e8 <== ALWAYS TAKEN 2002880: a2 10 00 08 mov %o0, %l1 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 2002884: 94 24 80 10 sub %l2, %l0, %o2 <== NOT EXECUTED 2002888: 91 2c 20 03 sll %l0, 3, %o0 <== NOT EXECUTED 200288c: 92 10 20 00 clr %o1 <== NOT EXECUTED 2002890: 90 04 40 08 add %l1, %o0, %o0 <== NOT EXECUTED 2002894: 40 00 42 b4 call 2013364 <== NOT EXECUTED 2002898: 95 2a a0 03 sll %o2, 3, %o2 <== NOT EXECUTED disktab = table; 200289c: e2 24 e3 b8 st %l1, [ %l3 + 0x3b8 ] <== NOT EXECUTED disktab_size = new_size; 20028a0: e4 27 23 b4 st %l2, [ %i4 + 0x3b4 ] <== NOT EXECUTED } if (disktab [major].minor == NULL || minor >= disktab[major].size) { 20028a4: 83 2f 60 03 sll %i5, 3, %g1 20028a8: e0 04 40 01 ld [ %l1 + %g1 ], %l0 20028ac: a2 04 40 01 add %l1, %g1, %l1 20028b0: 80 a4 20 00 cmp %l0, 0 20028b4: 02 80 00 0f be 20028f0 20028b8: e4 04 60 04 ld [ %l1 + 4 ], %l2 20028bc: 80 a6 40 12 cmp %i1, %l2 20028c0: 1a 80 00 0d bcc 20028f4 <== NEVER TAKEN 20028c4: 80 a4 a0 00 cmp %l2, 0 memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); disktab [major].minor = table; disktab [major].size = new_size; } return disktab [major].minor + minor; 20028c8: 83 2e 60 02 sll %i1, 2, %g1 { rtems_disk_device **dd_entry = create_disk_table_entry(dev); rtems_disk_device *dd = NULL; char *alloc_name = NULL; if (dd_entry == NULL) { 20028cc: b8 84 00 01 addcc %l0, %g1, %i4 20028d0: 02 80 00 06 be 20028e8 <== NEVER TAKEN 20028d4: b0 10 20 1a mov 0x1a, %i0 return RTEMS_NO_MEMORY; } if (*dd_entry != NULL) { 20028d8: c2 04 00 01 ld [ %l0 + %g1 ], %g1 20028dc: 80 a0 60 00 cmp %g1, 0 20028e0: 02 80 00 20 be 2002960 20028e4: b0 10 20 0c mov 0xc, %i0 *dd_entry = dd; *dd_ptr = dd; return RTEMS_SUCCESSFUL; } 20028e8: 81 c7 e0 08 ret 20028ec: 81 e8 00 00 restore if (disktab [major].minor == NULL || minor >= disktab[major].size) { rtems_disk_device **table = disktab [major].minor; rtems_device_minor_number old_size = disktab [major].size; rtems_device_minor_number new_size = 0; if (old_size == 0) { 20028f0: 80 a4 a0 00 cmp %l2, 0 20028f4: 12 80 00 15 bne 2002948 <== NEVER TAKEN 20028f8: b8 10 20 08 mov 8, %i4 new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; } if (minor >= new_size) { 20028fc: 80 a6 40 1c cmp %i1, %i4 2002900: 3a 80 00 02 bcc,a 2002908 2002904: b8 06 60 01 add %i1, 1, %i4 new_size = minor + 1; } table = realloc(table, new_size * sizeof(*table)); 2002908: 90 10 00 10 mov %l0, %o0 200290c: 93 2f 20 02 sll %i4, 2, %o1 2002910: 40 00 08 09 call 2004934 2002914: b0 10 20 1a mov 0x1a, %i0 if (table == NULL) { 2002918: 80 a2 20 00 cmp %o0, 0 200291c: 02 bf ff f3 be 20028e8 2002920: a0 10 00 08 mov %o0, %l0 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 2002924: 94 27 00 12 sub %i4, %l2, %o2 2002928: 91 2c a0 02 sll %l2, 2, %o0 200292c: 92 10 20 00 clr %o1 2002930: 90 04 00 08 add %l0, %o0, %o0 2002934: 40 00 42 8c call 2013364 2002938: 95 2a a0 02 sll %o2, 2, %o2 disktab [major].minor = table; 200293c: e0 24 40 00 st %l0, [ %l1 ] disktab [major].size = new_size; 2002940: 10 bf ff e2 b 20028c8 2002944: f8 24 60 04 st %i4, [ %l1 + 4 ] rtems_device_minor_number new_size = 0; if (old_size == 0) { new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; 2002948: b9 2c a0 01 sll %l2, 1, %i4 <== NOT EXECUTED } if (minor >= new_size) { 200294c: 80 a6 40 1c cmp %i1, %i4 <== NOT EXECUTED 2002950: 0a bf ff ef bcs 200290c <== NOT EXECUTED 2002954: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED 2002958: 10 bf ff ed b 200290c <== NOT EXECUTED 200295c: b8 06 60 01 add %i1, 1, %i4 <== NOT EXECUTED if (*dd_entry != NULL) { return RTEMS_RESOURCE_IN_USE; } dd = malloc(sizeof(*dd)); 2002960: 90 10 20 38 mov 0x38, %o0 2002964: 40 00 05 1d call 2003dd8 2002968: b0 10 20 1a mov 0x1a, %i0 if (dd == NULL) { 200296c: 80 a2 20 00 cmp %o0, 0 2002970: 02 bf ff de be 20028e8 <== NEVER TAKEN 2002974: a0 10 00 08 mov %o0, %l0 return RTEMS_NO_MEMORY; } if (name != NULL) { 2002978: 80 a6 a0 00 cmp %i2, 0 200297c: 02 80 00 0f be 20029b8 2002980: a2 10 20 00 clr %l1 alloc_name = strdup(name); 2002984: 40 00 43 56 call 20136dc 2002988: 90 10 00 1a mov %i2, %o0 if (alloc_name == NULL) { 200298c: a2 92 20 00 orcc %o0, 0, %l1 2002990: 02 80 00 15 be 20029e4 <== NEVER TAKEN 2002994: b4 10 00 08 mov %o0, %i2 return RTEMS_NO_MEMORY; } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { 2002998: 94 10 00 1d mov %i5, %o2 200299c: 13 00 00 18 sethi %hi(0x6000), %o1 20029a0: 96 10 00 19 mov %i1, %o3 20029a4: 40 00 05 5d call 2003f18 20029a8: 92 12 61 ff or %o1, 0x1ff, %o1 20029ac: 80 a2 20 00 cmp %o0, 0 20029b0: 06 80 00 0b bl 20029dc <== NEVER TAKEN 20029b4: 90 10 00 1a mov %i2, %o0 free(dd); return RTEMS_UNSATISFIED; } } dd->dev = dev; 20029b8: fa 24 00 00 st %i5, [ %l0 ] 20029bc: f2 24 20 04 st %i1, [ %l0 + 4 ] dd->name = alloc_name; 20029c0: e2 24 20 10 st %l1, [ %l0 + 0x10 ] dd->uses = 0; 20029c4: c0 24 20 14 clr [ %l0 + 0x14 ] dd->deleted = false; 20029c8: c0 2c 20 30 clrb [ %l0 + 0x30 ] *dd_entry = dd; 20029cc: e0 27 00 00 st %l0, [ %i4 ] *dd_ptr = dd; 20029d0: e0 26 c0 00 st %l0, [ %i3 ] return RTEMS_SUCCESSFUL; } 20029d4: 81 c7 e0 08 ret 20029d8: 91 e8 20 00 restore %g0, 0, %o0 } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { free(alloc_name); 20029dc: 40 00 04 1d call 2003a50 <== NOT EXECUTED 20029e0: b0 10 20 0d mov 0xd, %i0 <== NOT EXECUTED free(dd); 20029e4: 40 00 04 1b call 2003a50 <== NOT EXECUTED 20029e8: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED return RTEMS_UNSATISFIED; 20029ec: 81 c7 e0 08 ret <== NOT EXECUTED 20029f0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200a794 : const char *pathname, size_t pathnamelen, int flags, rtems_filesystem_location_info_t *pathloc ) { 200a794: 9d e3 bf a0 save %sp, -96, %sp int i; rtems_device_name_t *device_name_table; /* see if 'flags' is valid */ if ( !rtems_libio_is_valid_perms( flags ) ) 200a798: 80 8e bf f8 btst -8, %i2 200a79c: 12 80 00 33 bne 200a868 <== NEVER TAKEN 200a7a0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EPERM ); /* get the device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; 200a7a4: f4 06 c0 00 ld [ %i3 ], %i2 if (!device_name_table) 200a7a8: 80 a6 a0 00 cmp %i2, 0 200a7ac: 02 80 00 35 be 200a880 200a7b0: 03 00 80 5f sethi %hi(0x2017c00), %g1 rtems_set_errno_and_return_minus_one( EFAULT ); for (i = 0; i < rtems_device_table_size; i++) { 200a7b4: e0 00 62 ac ld [ %g1 + 0x2ac ], %l0 ! 2017eac * handlers. */ extern rtems_filesystem_file_handlers_r devFS_file_handlers; int devFS_evaluate_path( 200a7b8: ba 10 20 00 clr %i5 /* get the device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); for (i = 0; i < rtems_device_table_size; i++) { 200a7bc: 80 a4 20 00 cmp %l0, 0 200a7c0: 02 80 00 18 be 200a820 <== NEVER TAKEN 200a7c4: 82 10 20 00 clr %g1 if (!device_name_table[i].device_name) 200a7c8: a3 28 60 02 sll %g1, 2, %l1 200a7cc: 83 28 60 04 sll %g1, 4, %g1 200a7d0: a2 04 40 01 add %l1, %g1, %l1 200a7d4: f8 06 80 11 ld [ %i2 + %l1 ], %i4 200a7d8: 80 a7 20 00 cmp %i4, 0 200a7dc: 02 80 00 0d be 200a810 200a7e0: a2 06 80 11 add %i2, %l1, %l1 continue; if (strncmp(pathname, device_name_table[i].device_name, pathnamelen) != 0) 200a7e4: 90 10 00 18 mov %i0, %o0 200a7e8: 92 10 00 1c mov %i4, %o1 200a7ec: 40 00 0c 1d call 200d860 200a7f0: 94 10 00 19 mov %i1, %o2 200a7f4: 80 a2 20 00 cmp %o0, 0 200a7f8: 32 80 00 07 bne,a 200a814 200a7fc: ba 07 60 01 inc %i5 continue; if (device_name_table[i].device_name[pathnamelen] != '\0') 200a800: c2 4f 00 19 ldsb [ %i4 + %i1 ], %g1 200a804: 80 a0 60 00 cmp %g1, 0 200a808: 02 80 00 0c be 200a838 200a80c: 03 00 80 60 sethi %hi(0x2018000), %g1 /* get the device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); for (i = 0; i < rtems_device_table_size; i++) { 200a810: ba 07 60 01 inc %i5 200a814: 80 a7 40 10 cmp %i5, %l0 200a818: 12 bf ff ec bne 200a7c8 200a81c: 82 10 00 1d mov %i5, %g1 pathloc->mt_entry = rtems_filesystem_root.mt_entry; return 0; } /* no such file or directory */ rtems_set_errno_and_return_minus_one( ENOENT ); 200a820: 40 00 08 6e call 200c9d8 <__errno> 200a824: b0 10 3f ff mov -1, %i0 200a828: 82 10 20 02 mov 2, %g1 200a82c: c2 22 00 00 st %g1, [ %o0 ] } 200a830: 81 c7 e0 08 ret 200a834: 81 e8 00 00 restore /* find the device, set proper values */ pathloc->node_access = (void *)&device_name_table[i]; pathloc->handlers = &devFS_file_handlers; pathloc->ops = &devFS_ops; pathloc->mt_entry = rtems_filesystem_root.mt_entry; 200a838: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 if (device_name_table[i].device_name[pathnamelen] != '\0') continue; /* find the device, set proper values */ pathloc->node_access = (void *)&device_name_table[i]; pathloc->handlers = &devFS_file_handlers; 200a83c: 05 00 80 5f sethi %hi(0x2017c00), %g2 pathloc->ops = &devFS_ops; pathloc->mt_entry = rtems_filesystem_root.mt_entry; 200a840: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 if (device_name_table[i].device_name[pathnamelen] != '\0') continue; /* find the device, set proper values */ pathloc->node_access = (void *)&device_name_table[i]; pathloc->handlers = &devFS_file_handlers; 200a844: 84 10 a3 74 or %g2, 0x374, %g2 if (device_name_table[i].device_name[pathnamelen] != '\0') continue; /* find the device, set proper values */ pathloc->node_access = (void *)&device_name_table[i]; 200a848: e2 26 c0 00 st %l1, [ %i3 ] pathloc->handlers = &devFS_file_handlers; 200a84c: c4 26 e0 08 st %g2, [ %i3 + 8 ] pathloc->ops = &devFS_ops; pathloc->mt_entry = rtems_filesystem_root.mt_entry; 200a850: c2 26 e0 10 st %g1, [ %i3 + 0x10 ] continue; /* find the device, set proper values */ pathloc->node_access = (void *)&device_name_table[i]; pathloc->handlers = &devFS_file_handlers; pathloc->ops = &devFS_ops; 200a854: 05 00 80 5f sethi %hi(0x2017c00), %g2 200a858: 84 10 a3 ac or %g2, 0x3ac, %g2 ! 2017fac 200a85c: c4 26 e0 0c st %g2, [ %i3 + 0xc ] pathloc->mt_entry = rtems_filesystem_root.mt_entry; return 0; 200a860: 81 c7 e0 08 ret 200a864: 91 e8 20 00 restore %g0, 0, %o0 int i; rtems_device_name_t *device_name_table; /* see if 'flags' is valid */ if ( !rtems_libio_is_valid_perms( flags ) ) rtems_set_errno_and_return_minus_one( EPERM ); 200a868: 40 00 08 5c call 200c9d8 <__errno> <== NOT EXECUTED 200a86c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200a870: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 200a874: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200a878: 81 c7 e0 08 ret <== NOT EXECUTED 200a87c: 81 e8 00 00 restore <== NOT EXECUTED /* get the device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); 200a880: 40 00 08 56 call 200c9d8 <__errno> 200a884: b0 10 3f ff mov -1, %i0 200a888: 82 10 20 0e mov 0xe, %g1 200a88c: c2 22 00 00 st %g1, [ %o0 ] 200a890: 81 c7 e0 08 ret 200a894: 81 e8 00 00 restore =============================================================================== 02002d68 : const char *path, mode_t mode, dev_t dev, rtems_filesystem_location_info_t *pathloc ) { 2002d68: 9d e3 bf a0 save %sp, -96, %sp * condition and do not create the '/dev' and the 'path' * actually passed in is 'dev', not '/dev'. Just return 0 to * indicate we are OK. */ if ((path[0] == 'd') && (path[1] == 'e') && 2002d6c: c2 4e 00 00 ldsb [ %i0 ], %g1 2002d70: 80 a0 60 64 cmp %g1, 0x64 2002d74: 02 80 00 43 be 2002e80 2002d78: ba 10 00 18 mov %i0, %i5 (path[2] == 'v') && (path[3] == '\0')) return 0; /* must be a character device or a block device */ if (!S_ISBLK(mode) && !S_ISCHR(mode)) 2002d7c: 03 00 00 3c sethi %hi(0xf000), %g1 2002d80: 05 00 00 08 sethi %hi(0x2000), %g2 2002d84: 82 0e 40 01 and %i1, %g1, %g1 2002d88: 80 a0 40 02 cmp %g1, %g2 2002d8c: 12 80 00 4b bne 2002eb8 2002d90: 05 00 00 18 sethi %hi(0x6000), %g2 rtems_set_errno_and_return_minus_one( EINVAL ); else rtems_filesystem_split_dev_t(dev, major, minor); /* Find an empty slot in device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; 2002d94: f0 07 00 00 ld [ %i4 ], %i0 if (!device_name_table) 2002d98: 80 a6 20 00 cmp %i0, 0 2002d9c: 02 80 00 56 be 2002ef4 2002da0: 03 00 80 5f sethi %hi(0x2017c00), %g1 rtems_set_errno_and_return_minus_one( EFAULT ); for (slot = -1, i = 0; i < rtems_device_table_size; i++){ 2002da4: e0 00 62 ac ld [ %g1 + 0x2ac ], %l0 ! 2017eac 2002da8: 80 a4 20 00 cmp %l0, 0 2002dac: 02 80 00 4c be 2002edc 2002db0: 82 10 20 00 clr %g1 #include #include #include "devfs.h" int devFS_mknod( 2002db4: a2 10 3f ff mov -1, %l1 2002db8: 10 80 00 0a b 2002de0 2002dbc: b8 10 20 00 clr %i4 for (slot = -1, i = 0; i < rtems_device_table_size; i++){ if (device_name_table[i].device_name == NULL) slot = i; else if (strcmp(path, device_name_table[i].device_name) == 0) 2002dc0: 40 00 2a 4a call 200d6e8 2002dc4: 01 00 00 00 nop 2002dc8: 80 a2 20 00 cmp %o0, 0 2002dcc: 02 80 00 27 be 2002e68 2002dd0: b8 07 20 01 inc %i4 /* Find an empty slot in device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); for (slot = -1, i = 0; i < rtems_device_table_size; i++){ 2002dd4: 80 a7 00 10 cmp %i4, %l0 2002dd8: 02 80 00 0e be 2002e10 2002ddc: 82 10 00 1c mov %i4, %g1 if (device_name_table[i].device_name == NULL) 2002de0: 85 28 60 02 sll %g1, 2, %g2 2002de4: 83 28 60 04 sll %g1, 4, %g1 2002de8: 82 00 80 01 add %g2, %g1, %g1 2002dec: d2 06 00 01 ld [ %i0 + %g1 ], %o1 2002df0: 80 a2 60 00 cmp %o1, 0 2002df4: 12 bf ff f3 bne 2002dc0 2002df8: 90 10 00 1d mov %i5, %o0 2002dfc: a2 10 00 1c mov %i4, %l1 /* Find an empty slot in device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); for (slot = -1, i = 0; i < rtems_device_table_size; i++){ 2002e00: b8 07 20 01 inc %i4 2002e04: 80 a7 00 10 cmp %i4, %l0 2002e08: 12 bf ff f6 bne 2002de0 2002e0c: 82 10 00 1c mov %i4, %g1 else if (strcmp(path, device_name_table[i].device_name) == 0) rtems_set_errno_and_return_minus_one( EEXIST ); } if (slot == -1) 2002e10: 80 a4 7f ff cmp %l1, -1 2002e14: 02 80 00 32 be 2002edc <== NEVER TAKEN 2002e18: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOMEM ); _ISR_Disable(level); 2002e1c: 7f ff ff 44 call 2002b2c 2002e20: 01 00 00 00 nop 2002e24: a0 10 00 08 mov %o0, %l0 device_name_table[slot].device_name = (char *)path; 2002e28: 83 2c 60 02 sll %l1, 2, %g1 device_name_table[slot].device_name_length = strlen(path); 2002e2c: 90 10 00 1d mov %i5, %o0 if (slot == -1) rtems_set_errno_and_return_minus_one( ENOMEM ); _ISR_Disable(level); device_name_table[slot].device_name = (char *)path; 2002e30: a3 2c 60 04 sll %l1, 4, %l1 2002e34: a2 00 40 11 add %g1, %l1, %l1 2002e38: b8 06 00 11 add %i0, %l1, %i4 device_name_table[slot].device_name_length = strlen(path); 2002e3c: 40 00 2a 58 call 200d79c 2002e40: fa 26 00 11 st %i5, [ %i0 + %l1 ] device_name_table[slot].major = major; 2002e44: f4 27 20 08 st %i2, [ %i4 + 8 ] if (slot == -1) rtems_set_errno_and_return_minus_one( ENOMEM ); _ISR_Disable(level); device_name_table[slot].device_name = (char *)path; device_name_table[slot].device_name_length = strlen(path); 2002e48: d0 27 20 04 st %o0, [ %i4 + 4 ] device_name_table[slot].major = major; device_name_table[slot].minor = minor; 2002e4c: f6 27 20 0c st %i3, [ %i4 + 0xc ] device_name_table[slot].mode = mode; 2002e50: f2 27 20 10 st %i1, [ %i4 + 0x10 ] _ISR_Enable(level); return 0; 2002e54: b0 10 20 00 clr %i0 device_name_table[slot].device_name = (char *)path; device_name_table[slot].device_name_length = strlen(path); device_name_table[slot].major = major; device_name_table[slot].minor = minor; device_name_table[slot].mode = mode; _ISR_Enable(level); 2002e58: 7f ff ff 39 call 2002b3c 2002e5c: 90 10 00 10 mov %l0, %o0 return 0; } 2002e60: 81 c7 e0 08 ret 2002e64: 81 e8 00 00 restore for (slot = -1, i = 0; i < rtems_device_table_size; i++){ if (device_name_table[i].device_name == NULL) slot = i; else if (strcmp(path, device_name_table[i].device_name) == 0) rtems_set_errno_and_return_minus_one( EEXIST ); 2002e68: 40 00 26 dc call 200c9d8 <__errno> 2002e6c: b0 10 3f ff mov -1, %i0 2002e70: 82 10 20 11 mov 0x11, %g1 2002e74: c2 22 00 00 st %g1, [ %o0 ] 2002e78: 81 c7 e0 08 ret 2002e7c: 81 e8 00 00 restore * condition and do not create the '/dev' and the 'path' * actually passed in is 'dev', not '/dev'. Just return 0 to * indicate we are OK. */ if ((path[0] == 'd') && (path[1] == 'e') && 2002e80: c2 4e 20 01 ldsb [ %i0 + 1 ], %g1 2002e84: 80 a0 60 65 cmp %g1, 0x65 2002e88: 12 bf ff be bne 2002d80 <== NEVER TAKEN 2002e8c: 03 00 00 3c sethi %hi(0xf000), %g1 2002e90: c2 4e 20 02 ldsb [ %i0 + 2 ], %g1 2002e94: 80 a0 60 76 cmp %g1, 0x76 2002e98: 12 bf ff ba bne 2002d80 <== NEVER TAKEN 2002e9c: 03 00 00 3c sethi %hi(0xf000), %g1 (path[2] == 'v') && (path[3] == '\0')) 2002ea0: c2 4e 20 03 ldsb [ %i0 + 3 ], %g1 2002ea4: 80 a0 60 00 cmp %g1, 0 2002ea8: 12 bf ff b5 bne 2002d7c 2002eac: b0 10 20 00 clr %i0 device_name_table[slot].minor = minor; device_name_table[slot].mode = mode; _ISR_Enable(level); return 0; } 2002eb0: 81 c7 e0 08 ret 2002eb4: 81 e8 00 00 restore if ((path[0] == 'd') && (path[1] == 'e') && (path[2] == 'v') && (path[3] == '\0')) return 0; /* must be a character device or a block device */ if (!S_ISBLK(mode) && !S_ISCHR(mode)) 2002eb8: 80 a0 40 02 cmp %g1, %g2 2002ebc: 22 bf ff b7 be,a 2002d98 2002ec0: f0 07 00 00 ld [ %i4 ], %i0 rtems_set_errno_and_return_minus_one( EINVAL ); 2002ec4: 40 00 26 c5 call 200c9d8 <__errno> 2002ec8: b0 10 3f ff mov -1, %i0 2002ecc: 82 10 20 16 mov 0x16, %g1 2002ed0: c2 22 00 00 st %g1, [ %o0 ] 2002ed4: 81 c7 e0 08 ret 2002ed8: 81 e8 00 00 restore if (strcmp(path, device_name_table[i].device_name) == 0) rtems_set_errno_and_return_minus_one( EEXIST ); } if (slot == -1) rtems_set_errno_and_return_minus_one( ENOMEM ); 2002edc: 40 00 26 bf call 200c9d8 <__errno> 2002ee0: b0 10 3f ff mov -1, %i0 2002ee4: 82 10 20 0c mov 0xc, %g1 2002ee8: c2 22 00 00 st %g1, [ %o0 ] 2002eec: 81 c7 e0 08 ret 2002ef0: 81 e8 00 00 restore rtems_filesystem_split_dev_t(dev, major, minor); /* Find an empty slot in device name table */ device_name_table = (rtems_device_name_t *)pathloc->node_access; if (!device_name_table) rtems_set_errno_and_return_minus_one( EFAULT ); 2002ef4: 40 00 26 b9 call 200c9d8 <__errno> 2002ef8: b0 10 3f ff mov -1, %i0 2002efc: 82 10 20 0e mov 0xe, %g1 2002f00: c2 22 00 00 st %g1, [ %o0 ] 2002f04: 81 c7 e0 08 ret 2002f08: 81 e8 00 00 restore =============================================================================== 020027bc : */ static volatile bool diskdevs_protected; static rtems_status_code disk_lock(void) { 20027bc: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; sc = rtems_semaphore_obtain(diskdevs_mutex, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 20027c0: 03 00 80 65 sethi %hi(0x2019400), %g1 20027c4: d0 00 63 b0 ld [ %g1 + 0x3b0 ], %o0 ! 20197b0 20027c8: 92 10 20 00 clr %o1 20027cc: 94 10 20 00 clr %o2 20027d0: 40 00 13 a8 call 2007670 20027d4: b0 10 20 16 mov 0x16, %i0 if (sc == RTEMS_SUCCESSFUL) { 20027d8: 80 a2 20 00 cmp %o0, 0 20027dc: 12 80 00 05 bne 20027f0 <== NEVER TAKEN 20027e0: 84 10 20 01 mov 1, %g2 diskdevs_protected = true; 20027e4: 03 00 80 65 sethi %hi(0x2019400), %g1 return RTEMS_SUCCESSFUL; 20027e8: b0 10 20 00 clr %i0 { rtems_status_code sc = RTEMS_SUCCESSFUL; sc = rtems_semaphore_obtain(diskdevs_mutex, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc == RTEMS_SUCCESSFUL) { diskdevs_protected = true; 20027ec: c4 28 63 ac stb %g2, [ %g1 + 0x3ac ] return RTEMS_SUCCESSFUL; } else { return RTEMS_NOT_CONFIGURED; } } 20027f0: 81 c7 e0 08 ret 20027f4: 81 e8 00 00 restore =============================================================================== 020027f8 : static void disk_unlock(void) { 20027f8: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; sc = rtems_semaphore_release(diskdevs_mutex); 20027fc: 03 00 80 65 sethi %hi(0x2019400), %g1 2002800: d0 00 63 b0 ld [ %g1 + 0x3b0 ], %o0 ! 20197b0 static void disk_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; 2002804: 03 00 80 65 sethi %hi(0x2019400), %g1 2002808: c0 28 63 ac clrb [ %g1 + 0x3ac ] ! 20197ac sc = rtems_semaphore_release(diskdevs_mutex); 200280c: 40 00 13 e3 call 2007798 2002810: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) { 2002814: 80 a2 20 00 cmp %o0, 0 2002818: 12 80 00 04 bne 2002828 <== NEVER TAKEN 200281c: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 2002820: 81 c7 e0 08 ret 2002824: 81 e8 00 00 restore /* FIXME: Error number */ rtems_fatal_error_occurred(0xdeadbeef); 2002828: 40 00 15 2a call 2007cd0 <== NOT EXECUTED 200282c: 90 12 22 ef or %o0, 0x2ef, %o0 <== NOT EXECUTED =============================================================================== 02003f88 : /* * Drain output queue */ static void drainOutput (struct rtems_termios_tty *tty) 2003f88: 9d e3 bf a0 save %sp, -96, %sp { rtems_interrupt_level level; rtems_status_code sc; if (tty->device.outputUsesInterrupts != TERMIOS_POLLED) { rtems_interrupt_disable (level); 2003f8c: 7f ff f8 96 call 20021e4 2003f90: ba 10 00 18 mov %i0, %i5 while (tty->rawOutBuf.Tail != tty->rawOutBuf.Head) { 2003f94: c4 06 20 84 ld [ %i0 + 0x84 ], %g2 2003f98: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2003f9c: 80 a0 80 01 cmp %g2, %g1 2003fa0: 02 80 00 14 be 2003ff0 <== ALWAYS TAKEN 2003fa4: 01 00 00 00 nop tty->rawOutBufState = rob_wait; 2003fa8: b8 10 20 02 mov 2, %i4 ! 2 <== NOT EXECUTED 2003fac: f8 27 60 94 st %i4, [ %i5 + 0x94 ] <== NOT EXECUTED rtems_interrupt_enable (level); 2003fb0: 7f ff f8 91 call 20021f4 <== NOT EXECUTED 2003fb4: 01 00 00 00 nop <== NOT EXECUTED sc = rtems_semaphore_obtain( 2003fb8: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 <== NOT EXECUTED 2003fbc: 92 10 20 00 clr %o1 <== NOT EXECUTED 2003fc0: 40 00 0a 64 call 2006950 <== NOT EXECUTED 2003fc4: 94 10 20 00 clr %o2 <== NOT EXECUTED tty->rawOutBuf.Semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc != RTEMS_SUCCESSFUL) 2003fc8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2003fcc: 12 80 00 0b bne 2003ff8 <== NOT EXECUTED 2003fd0: 01 00 00 00 nop <== NOT EXECUTED rtems_fatal_error_occurred (sc); rtems_interrupt_disable (level); 2003fd4: 7f ff f8 84 call 20021e4 <== NOT EXECUTED 2003fd8: 01 00 00 00 nop <== NOT EXECUTED rtems_interrupt_level level; rtems_status_code sc; if (tty->device.outputUsesInterrupts != TERMIOS_POLLED) { rtems_interrupt_disable (level); while (tty->rawOutBuf.Tail != tty->rawOutBuf.Head) { 2003fdc: c4 07 60 84 ld [ %i5 + 0x84 ], %g2 <== NOT EXECUTED 2003fe0: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 <== NOT EXECUTED 2003fe4: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 2003fe8: 32 bf ff f2 bne,a 2003fb0 <== NOT EXECUTED 2003fec: f8 27 60 94 st %i4, [ %i5 + 0x94 ] <== NOT EXECUTED tty->rawOutBuf.Semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc != RTEMS_SUCCESSFUL) rtems_fatal_error_occurred (sc); rtems_interrupt_disable (level); } rtems_interrupt_enable (level); 2003ff0: 7f ff f8 81 call 20021f4 2003ff4: 91 e8 00 08 restore %g0, %o0, %o0 tty->rawOutBufState = rob_wait; rtems_interrupt_enable (level); sc = rtems_semaphore_obtain( tty->rawOutBuf.Semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc != RTEMS_SUCCESSFUL) rtems_fatal_error_occurred (sc); 2003ff8: 40 00 0c 18 call 2007058 <== NOT EXECUTED =============================================================================== 02004d2c : /* * Echo a typed character */ static void echo (unsigned char c, struct rtems_termios_tty *tty) { 2004d2c: 9d e3 bf 98 save %sp, -104, %sp if ((tty->termios.c_lflag & ECHOCTL) && 2004d30: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 2004d34: 80 88 62 00 btst 0x200, %g1 2004d38: 02 80 00 08 be 2004d58 <== NEVER TAKEN 2004d3c: 03 00 80 6e sethi %hi(0x201b800), %g1 iscntrl(c) && (c != '\t') && (c != '\n')) { 2004d40: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201ba0c <__ctype_ptr__> 2004d44: 82 00 40 18 add %g1, %i0, %g1 2004d48: c2 08 60 01 ldub [ %g1 + 1 ], %g1 2004d4c: 80 88 60 20 btst 0x20, %g1 2004d50: 12 80 00 07 bne 2004d6c 2004d54: 80 a6 20 09 cmp %i0, 9 echobuf[0] = '^'; echobuf[1] = c ^ 0x40; rtems_termios_puts (echobuf, 2, tty); tty->column += 2; } else { oproc (c, tty); 2004d58: 90 10 00 18 mov %i0, %o0 2004d5c: 7f ff ff 8d call 2004b90 2004d60: 92 10 00 19 mov %i1, %o1 2004d64: 81 c7 e0 08 ret 2004d68: 81 e8 00 00 restore */ static void echo (unsigned char c, struct rtems_termios_tty *tty) { if ((tty->termios.c_lflag & ECHOCTL) && iscntrl(c) && (c != '\t') && (c != '\n')) { 2004d6c: 02 bf ff fc be 2004d5c 2004d70: 90 10 00 18 mov %i0, %o0 2004d74: 80 a6 20 0a cmp %i0, 0xa 2004d78: 02 bf ff f9 be 2004d5c 2004d7c: 82 10 20 5e mov 0x5e, %g1 char echobuf[2]; echobuf[0] = '^'; echobuf[1] = c ^ 0x40; 2004d80: b0 1e 20 40 xor %i0, 0x40, %i0 { if ((tty->termios.c_lflag & ECHOCTL) && iscntrl(c) && (c != '\t') && (c != '\n')) { char echobuf[2]; echobuf[0] = '^'; 2004d84: c2 2f bf f8 stb %g1, [ %fp + -8 ] echobuf[1] = c ^ 0x40; 2004d88: f0 2f bf f9 stb %i0, [ %fp + -7 ] rtems_termios_puts (echobuf, 2, tty); 2004d8c: 90 07 bf f8 add %fp, -8, %o0 2004d90: 92 10 20 02 mov 2, %o1 2004d94: 7f ff ff 2f call 2004a50 2004d98: 94 10 00 19 mov %i1, %o2 tty->column += 2; 2004d9c: c2 06 60 28 ld [ %i1 + 0x28 ], %g1 2004da0: 82 00 60 02 add %g1, 2, %g1 2004da4: c2 26 60 28 st %g1, [ %i1 + 0x28 ] 2004da8: 81 c7 e0 08 ret 2004dac: 81 e8 00 00 restore =============================================================================== 02003c20 : void endgrent(void) { if (group_fp != NULL) 2003c20: 03 00 80 5d sethi %hi(0x2017400), %g1 2003c24: d0 00 61 80 ld [ %g1 + 0x180 ], %o0 ! 2017580 2003c28: 80 a2 20 00 cmp %o0, 0 2003c2c: 02 80 00 05 be 2003c40 <== NEVER TAKEN 2003c30: 01 00 00 00 nop fclose(group_fp); 2003c34: 82 13 c0 00 mov %o7, %g1 2003c38: 40 00 2e ba call 200f720 2003c3c: 9e 10 40 00 mov %g1, %o7 2003c40: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02003a94 : void endpwent(void) { if (passwd_fp != NULL) 2003a94: 03 00 80 5d sethi %hi(0x2017400), %g1 2003a98: d0 00 60 a0 ld [ %g1 + 0xa0 ], %o0 ! 20174a0 2003a9c: 80 a2 20 00 cmp %o0, 0 2003aa0: 02 80 00 05 be 2003ab4 <== NEVER TAKEN 2003aa4: 01 00 00 00 nop fclose(passwd_fp); 2003aa8: 82 13 c0 00 mov %o7, %g1 2003aac: 40 00 2f 1d call 200f720 2003ab0: 9e 10 40 00 mov %g1, %o7 2003ab4: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02004db0 : * FIXME: Needs support for WERASE and ECHOPRT. * FIXME: Some of the tests should check for IEXTEN, too. */ static void erase (struct rtems_termios_tty *tty, int lineFlag) { 2004db0: 9d e3 bf a0 save %sp, -96, %sp if (tty->ccount == 0) 2004db4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2004db8: 80 a0 60 00 cmp %g1, 0 2004dbc: 02 80 00 37 be 2004e98 2004dc0: ba 10 00 18 mov %i0, %i5 return; if (lineFlag) { if (!(tty->termios.c_lflag & ECHO)) { 2004dc4: c6 06 20 3c ld [ %i0 + 0x3c ], %g3 static void erase (struct rtems_termios_tty *tty, int lineFlag) { if (tty->ccount == 0) return; if (lineFlag) { 2004dc8: 80 a6 60 00 cmp %i1, 0 2004dcc: 12 80 00 35 bne 2004ea0 2004dd0: 84 08 e0 08 and %g3, 8, %g2 tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2004dd4: 31 00 80 69 sethi %hi(0x201a400), %i0 /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2004dd8: 37 00 80 69 sethi %hi(0x201a400), %i3 tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 2004ddc: 35 00 80 6e sethi %hi(0x201b800), %i2 rtems_termios_puts ("\b \b", 3, tty); 2004de0: b0 16 20 78 or %i0, 0x78, %i0 /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2004de4: 10 80 00 0d b 2004e18 2004de8: b6 16 e0 70 or %i3, 0x70, %i3 tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 2004dec: 12 80 00 6b bne 2004f98 <== NOT EXECUTED 2004df0: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if (tty->column) tty->column--; } } } if (!lineFlag) 2004df4: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED 2004df8: 02 80 00 66 be 2004f90 <== NEVER TAKEN 2004dfc: 01 00 00 00 nop echo ('\n', tty); return; } } while (tty->ccount) { 2004e00: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 2004e04: 80 a0 60 00 cmp %g1, 0 2004e08: 02 80 00 62 be 2004f90 2004e0c: 01 00 00 00 nop } if (!(tty->termios.c_lflag & ECHOE)) { tty->ccount = 0; echo (tty->termios.c_cc[VKILL], tty); if (tty->termios.c_lflag & ECHOK) echo ('\n', tty); 2004e10: c6 07 60 3c ld [ %i5 + 0x3c ], %g3 2004e14: 84 08 e0 08 and %g3, 8, %g2 return; } } while (tty->ccount) { unsigned char c = tty->cbuf[--tty->ccount]; 2004e18: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 2004e1c: 82 00 7f ff add %g1, -1, %g1 2004e20: c2 27 60 20 st %g1, [ %i5 + 0x20 ] if (tty->termios.c_lflag & ECHO) { 2004e24: 80 a0 a0 00 cmp %g2, 0 2004e28: 02 bf ff f3 be 2004df4 <== NEVER TAKEN 2004e2c: f8 09 00 01 ldub [ %g4 + %g1 ], %i4 if (!lineFlag && !(tty->termios.c_lflag & ECHOE)) { 2004e30: 80 a6 60 00 cmp %i1, 0 2004e34: 12 80 00 05 bne 2004e48 2004e38: b8 0f 20 ff and %i4, 0xff, %i4 2004e3c: 80 88 e0 10 btst 0x10, %g3 2004e40: 22 80 00 52 be,a 2004f88 <== NEVER TAKEN 2004e44: f0 0f 60 43 ldub [ %i5 + 0x43 ], %i0 <== NOT EXECUTED echo (tty->termios.c_cc[VERASE], tty); } else if (c == '\t') { 2004e48: 80 a7 20 09 cmp %i4, 9 2004e4c: 02 80 00 25 be 2004ee0 2004e50: b8 07 20 01 inc %i4 rtems_termios_puts ("\b", 1, tty); tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 2004e54: c2 06 a2 0c ld [ %i2 + 0x20c ], %g1 2004e58: c2 08 40 1c ldub [ %g1 + %i4 ], %g1 2004e5c: 80 88 60 20 btst 0x20, %g1 2004e60: 12 bf ff e3 bne 2004dec <== NEVER TAKEN 2004e64: 80 88 e2 00 btst 0x200, %g3 rtems_termios_puts ("\b \b", 3, tty); if (tty->column) tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2004e68: 11 00 80 69 sethi %hi(0x201a400), %o0 2004e6c: 92 10 20 03 mov 3, %o1 2004e70: 90 12 20 78 or %o0, 0x78, %o0 2004e74: 7f ff fe f7 call 2004a50 2004e78: 94 10 00 1d mov %i5, %o2 if (tty->column) 2004e7c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2004e80: 80 a0 60 00 cmp %g1, 0 2004e84: 02 bf ff dd be 2004df8 <== NEVER TAKEN 2004e88: 80 a6 60 00 cmp %i1, 0 tty->column--; 2004e8c: 82 00 7f ff add %g1, -1, %g1 } } } if (!lineFlag) 2004e90: 12 bf ff dc bne 2004e00 2004e94: c2 27 60 28 st %g1, [ %i5 + 0x28 ] 2004e98: 81 c7 e0 08 ret 2004e9c: 81 e8 00 00 restore erase (struct rtems_termios_tty *tty, int lineFlag) { if (tty->ccount == 0) return; if (lineFlag) { if (!(tty->termios.c_lflag & ECHO)) { 2004ea0: 84 88 e0 08 andcc %g3, 8, %g2 2004ea4: 22 bf ff fd be,a 2004e98 <== NEVER TAKEN 2004ea8: c0 26 20 20 clr [ %i0 + 0x20 ] <== NOT EXECUTED tty->ccount = 0; return; } if (!(tty->termios.c_lflag & ECHOE)) { 2004eac: 80 88 e0 10 btst 0x10, %g3 2004eb0: 32 bf ff ca bne,a 2004dd8 <== ALWAYS TAKEN 2004eb4: 31 00 80 69 sethi %hi(0x201a400), %i0 tty->ccount = 0; echo (tty->termios.c_cc[VKILL], tty); 2004eb8: d0 0e 20 44 ldub [ %i0 + 0x44 ], %o0 ! 201a444 <== NOT EXECUTED if (!(tty->termios.c_lflag & ECHO)) { tty->ccount = 0; return; } if (!(tty->termios.c_lflag & ECHOE)) { tty->ccount = 0; 2004ebc: c0 26 20 20 clr [ %i0 + 0x20 ] <== NOT EXECUTED echo (tty->termios.c_cc[VKILL], tty); 2004ec0: 7f ff ff 9b call 2004d2c <== NOT EXECUTED 2004ec4: 92 10 00 18 mov %i0, %o1 <== NOT EXECUTED if (tty->termios.c_lflag & ECHOK) 2004ec8: c2 06 20 3c ld [ %i0 + 0x3c ], %g1 <== NOT EXECUTED 2004ecc: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 2004ed0: 02 bf ff f2 be 2004e98 <== NOT EXECUTED 2004ed4: b0 10 20 0a mov 0xa, %i0 <== NOT EXECUTED echo ('\n', tty); 2004ed8: 7f ff ff 95 call 2004d2c <== NOT EXECUTED 2004edc: 93 e8 00 1d restore %g0, %i5, %o1 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2004ee0: 80 a0 60 00 cmp %g1, 0 2004ee4: 02 80 00 17 be 2004f40 2004ee8: f8 07 60 2c ld [ %i5 + 0x2c ], %i4 c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; } else if (iscntrl (c)) { 2004eec: da 06 a2 0c ld [ %i2 + 0x20c ], %o5 if (tty->termios.c_lflag & ECHO) { if (!lineFlag && !(tty->termios.c_lflag & ECHOE)) { echo (tty->termios.c_cc[VERASE], tty); } else if (c == '\t') { int col = tty->read_start_column; int i = 0; 2004ef0: 84 10 20 00 clr %g2 while (i != tty->ccount) { c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; } else if (iscntrl (c)) { if (tty->termios.c_lflag & ECHOCTL) 2004ef4: 10 80 00 07 b 2004f10 2004ef8: 98 08 e2 00 and %g3, 0x200, %o4 2004efc: 32 80 00 02 bne,a 2004f04 <== NOT EXECUTED 2004f00: b8 07 20 02 add %i4, 2, %i4 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2004f04: 80 a0 40 02 cmp %g1, %g2 2004f08: 22 80 00 0f be,a 2004f44 <== NEVER TAKEN 2004f0c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED c = tty->cbuf[i++]; 2004f10: c6 09 00 02 ldub [ %g4 + %g2 ], %g3 2004f14: 84 00 a0 01 inc %g2 if (c == '\t') { 2004f18: 80 a0 e0 09 cmp %g3, 9 2004f1c: 02 80 00 18 be 2004f7c 2004f20: 9e 03 40 03 add %o5, %g3, %o7 col = (col | 7) + 1; } else if (iscntrl (c)) { 2004f24: de 0b e0 01 ldub [ %o7 + 1 ], %o7 2004f28: 80 8b e0 20 btst 0x20, %o7 2004f2c: 12 bf ff f4 bne 2004efc <== NEVER TAKEN 2004f30: 80 a3 20 00 cmp %o4, 0 int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2004f34: 80 a0 40 02 cmp %g1, %g2 2004f38: 12 bf ff f6 bne 2004f10 2004f3c: b8 07 20 01 inc %i4 } /* * Back up over the tab */ while (tty->column > col) { 2004f40: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2004f44: 80 a7 00 01 cmp %i4, %g1 2004f48: 16 bf ff ac bge 2004df8 <== NEVER TAKEN 2004f4c: 80 a6 60 00 cmp %i1, 0 rtems_termios_puts ("\b", 1, tty); 2004f50: 90 10 00 1b mov %i3, %o0 2004f54: 92 10 20 01 mov 1, %o1 2004f58: 7f ff fe be call 2004a50 2004f5c: 94 10 00 1d mov %i5, %o2 tty->column--; 2004f60: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2004f64: 82 00 7f ff add %g1, -1, %g1 } /* * Back up over the tab */ while (tty->column > col) { 2004f68: 80 a0 40 1c cmp %g1, %i4 2004f6c: 14 bf ff f9 bg 2004f50 2004f70: c2 27 60 28 st %g1, [ %i5 + 0x28 ] if (tty->column) tty->column--; } } } if (!lineFlag) 2004f74: 10 bf ff a1 b 2004df8 2004f78: 80 a6 60 00 cmp %i1, 0 * Find the character before the tab */ while (i != tty->ccount) { c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; 2004f7c: b8 17 20 07 or %i4, 7, %i4 2004f80: 10 bf ff e1 b 2004f04 2004f84: b8 07 20 01 inc %i4 while (tty->ccount) { unsigned char c = tty->cbuf[--tty->ccount]; if (tty->termios.c_lflag & ECHO) { if (!lineFlag && !(tty->termios.c_lflag & ECHOE)) { echo (tty->termios.c_cc[VERASE], tty); 2004f88: 7f ff ff 69 call 2004d2c <== NOT EXECUTED 2004f8c: 93 e8 00 1d restore %g0, %i5, %o1 <== NOT EXECUTED 2004f90: 81 c7 e0 08 ret 2004f94: 81 e8 00 00 restore tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2004f98: 92 10 20 03 mov 3, %o1 <== NOT EXECUTED 2004f9c: 7f ff fe ad call 2004a50 <== NOT EXECUTED 2004fa0: 94 10 00 1d mov %i5, %o2 <== NOT EXECUTED if (tty->column) 2004fa4: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED 2004fa8: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2004fac: 22 80 00 05 be,a 2004fc0 <== NOT EXECUTED 2004fb0: c2 06 a2 0c ld [ %i2 + 0x20c ], %g1 <== NOT EXECUTED tty->column--; 2004fb4: 82 00 7f ff add %g1, -1, %g1 <== NOT EXECUTED 2004fb8: c2 27 60 28 st %g1, [ %i5 + 0x28 ] <== NOT EXECUTED } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { 2004fbc: c2 06 a2 0c ld [ %i2 + 0x20c ], %g1 <== NOT EXECUTED 2004fc0: c2 08 40 1c ldub [ %g1 + %i4 ], %g1 <== NOT EXECUTED 2004fc4: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 2004fc8: 02 bf ff a9 be 2004e6c <== NOT EXECUTED 2004fcc: 11 00 80 69 sethi %hi(0x201a400), %o0 <== NOT EXECUTED 2004fd0: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 <== NOT EXECUTED 2004fd4: 80 88 62 00 btst 0x200, %g1 <== NOT EXECUTED 2004fd8: 12 bf ff a6 bne 2004e70 <== NOT EXECUTED 2004fdc: 92 10 20 03 mov 3, %o1 <== NOT EXECUTED if (tty->column) tty->column--; } } } if (!lineFlag) 2004fe0: 10 bf ff 86 b 2004df8 <== NOT EXECUTED 2004fe4: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED =============================================================================== 02013734 : #include "fat_fat_operations.h" int fat_buf_access(fat_fs_info_t *fs_info, uint32_t blk, int op_type, rtems_bdbuf_buffer **buf) { 2013734: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013738: c2 0e 20 85 ldub [ %i0 + 0x85 ], %g1 201373c: 80 a0 60 00 cmp %g1, 0 2013740: 22 80 00 5c be,a 20138b0 2013744: d0 1e 20 58 ldd [ %i0 + 0x58 ], %o0 2013748: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 fs_info->c.blk_num = blk; fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 201374c: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2013750: 80 a0 80 01 cmp %g2, %g1 2013754: 08 80 00 68 bleu 20138f4 <== ALWAYS TAKEN 2013758: b8 10 20 00 clr %i4 (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.blk_num != blk) 201375c: 80 a6 40 01 cmp %i1, %g1 2013760: 22 80 00 51 be,a 20138a4 2013764: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 { if (fs_info->c.modified) 2013768: c2 0e 20 84 ldub [ %i0 + 0x84 ], %g1 201376c: 80 a0 60 00 cmp %g1, 0 2013770: 02 80 00 3b be 201385c 2013774: b8 8f 20 ff andcc %i4, 0xff, %i4 { if (sec_of_fat && !fs_info->vol.mirror) 2013778: 02 80 00 06 be 2013790 <== ALWAYS TAKEN 201377c: 01 00 00 00 nop 2013780: c2 0e 20 48 ldub [ %i0 + 0x48 ], %g1 <== NOT EXECUTED 2013784: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2013788: 22 80 00 63 be,a 2013914 <== NOT EXECUTED 201378c: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 <== NOT EXECUTED memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 2013790: 7f ff fa 08 call 2011fb0 2013794: d0 06 20 88 ld [ %i0 + 0x88 ], %o0 fs_info->c.state = FAT_CACHE_EMPTY; 2013798: c0 2e 20 85 clrb [ %i0 + 0x85 ] fs_info->c.modified = 0; if (sc != RTEMS_SUCCESSFUL) 201379c: 80 a2 20 00 cmp %o0, 0 20137a0: 12 80 00 66 bne 2013938 <== NEVER TAKEN 20137a4: c0 2e 20 84 clrb [ %i0 + 0x84 ] rtems_set_errno_and_return_minus_one(EIO); if (sec_of_fat && !fs_info->vol.mirror) 20137a8: 80 a7 20 00 cmp %i4, 0 20137ac: 22 80 00 32 be,a 2013874 <== ALWAYS TAKEN 20137b0: d0 1e 20 58 ldd [ %i0 + 0x58 ], %o0 20137b4: c2 0e 20 48 ldub [ %i0 + 0x48 ], %g1 <== NOT EXECUTED 20137b8: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20137bc: 32 80 00 2e bne,a 2013874 <== NOT EXECUTED 20137c0: d0 1e 20 58 ldd [ %i0 + 0x58 ], %o0 <== NOT EXECUTED { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 20137c4: c2 0e 20 09 ldub [ %i0 + 9 ], %g1 <== NOT EXECUTED 20137c8: 80 a0 60 01 cmp %g1, 1 <== NOT EXECUTED 20137cc: 08 80 00 29 bleu 2013870 <== NOT EXECUTED 20137d0: a0 10 20 01 mov 1, %l0 <== NOT EXECUTED 20137d4: 10 80 00 10 b 2013814 <== NOT EXECUTED 20137d8: 90 10 20 01 mov 1, %o0 <== NOT EXECUTED fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); 20137dc: d2 06 20 8c ld [ %i0 + 0x8c ], %o1 <== NOT EXECUTED 20137e0: d4 16 00 00 lduh [ %i0 ], %o2 <== NOT EXECUTED 20137e4: d0 00 60 24 ld [ %g1 + 0x24 ], %o0 <== NOT EXECUTED 20137e8: 40 00 28 a0 call 201da68 <== NOT EXECUTED 20137ec: a0 04 20 01 inc %l0 <== NOT EXECUTED sc = rtems_bdbuf_release_modified(b); 20137f0: 7f ff f9 f0 call 2011fb0 <== NOT EXECUTED 20137f4: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED if ( sc != RTEMS_SUCCESSFUL) 20137f8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20137fc: 12 80 00 12 bne 2013844 <== NOT EXECUTED 2013800: 90 0c 20 ff and %l0, 0xff, %o0 <== NOT EXECUTED if (sec_of_fat && !fs_info->vol.mirror) { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2013804: c2 0e 20 09 ldub [ %i0 + 9 ], %g1 <== NOT EXECUTED 2013808: 80 a0 40 08 cmp %g1, %o0 <== NOT EXECUTED 201380c: 28 80 00 1a bleu,a 2013874 <== NOT EXECUTED 2013810: d0 1e 20 58 ldd [ %i0 + 0x58 ], %o0 <== NOT EXECUTED { sc = rtems_bdbuf_get(fs_info->vol.dev, fs_info->c.blk_num + fs_info->vol.fat_length * i, 2013814: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 <== NOT EXECUTED 2013818: 40 00 58 71 call 20299dc <.umul> <== NOT EXECUTED 201381c: f8 1e 20 58 ldd [ %i0 + 0x58 ], %i4 <== NOT EXECUTED { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) { sc = rtems_bdbuf_get(fs_info->vol.dev, 2013820: d4 06 20 80 ld [ %i0 + 0x80 ], %o2 <== NOT EXECUTED 2013824: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED 2013828: 94 02 00 0a add %o0, %o2, %o2 <== NOT EXECUTED 201382c: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED 2013830: 7f ff f8 b9 call 2011b14 <== NOT EXECUTED 2013834: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) 2013838: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 201383c: 02 bf ff e8 be 20137dc <== NOT EXECUTED 2013840: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); 2013844: 40 00 25 ba call 201cf2c <__errno> <== NOT EXECUTED 2013848: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201384c: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2013850: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013854: 81 c7 e0 08 ret <== NOT EXECUTED 2013858: 81 e8 00 00 restore <== NOT EXECUTED } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 201385c: 7f ff f9 9b call 2011ec8 2013860: d0 06 20 88 ld [ %i0 + 0x88 ], %o0 fs_info->c.state = FAT_CACHE_EMPTY; if (sc != RTEMS_SUCCESSFUL) 2013864: 80 a2 20 00 cmp %o0, 0 2013868: 12 80 00 34 bne 2013938 <== NEVER TAKEN 201386c: c0 2e 20 85 clrb [ %i0 + 0x85 ] rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); 2013870: d0 1e 20 58 ldd [ %i0 + 0x58 ], %o0 2013874: 94 10 00 19 mov %i1, %o2 fs_info->c.state = FAT_CACHE_EMPTY; if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) 2013878: 80 a6 a0 01 cmp %i2, 1 201387c: 02 80 00 2b be 2013928 2013880: 96 06 20 88 add %i0, 0x88, %o3 sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); 2013884: 7f ff f8 a4 call 2011b14 2013888: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 201388c: 80 a2 20 00 cmp %o0, 0 2013890: 12 80 00 2a bne 2013938 <== NEVER TAKEN 2013894: 82 10 20 01 mov 1, %g1 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; 2013898: f2 26 20 80 st %i1, [ %i0 + 0x80 ] fs_info->c.state = FAT_CACHE_ACTUAL; 201389c: c2 2e 20 85 stb %g1, [ %i0 + 0x85 ] } *buf = fs_info->c.buf; 20138a0: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 20138a4: c2 26 c0 00 st %g1, [ %i3 ] return RC_OK; } 20138a8: 81 c7 e0 08 ret 20138ac: 91 e8 20 00 restore %g0, 0, %o0 if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); 20138b0: 94 10 00 19 mov %i1, %o2 bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) 20138b4: 80 a6 a0 01 cmp %i2, 1 20138b8: 02 80 00 13 be 2013904 20138bc: 96 06 20 88 add %i0, 0x88, %o3 sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); 20138c0: 7f ff f8 95 call 2011b14 20138c4: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 20138c8: 80 a2 20 00 cmp %o0, 0 20138cc: 12 80 00 1b bne 2013938 <== NEVER TAKEN 20138d0: 82 10 20 01 mov 1, %g1 fs_info->c.blk_num = blk; fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 20138d4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; 20138d8: f2 26 20 80 st %i1, [ %i0 + 0x80 ] fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; 20138dc: c2 2e 20 85 stb %g1, [ %i0 + 0x85 ] else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; fs_info->c.modified = 0; 20138e0: c0 2e 20 84 clrb [ %i0 + 0x84 ] fs_info->c.state = FAT_CACHE_ACTUAL; 20138e4: 82 10 00 19 mov %i1, %g1 } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 20138e8: 80 a0 80 01 cmp %g2, %g1 20138ec: 18 bf ff 9c bgu 201375c <== NEVER TAKEN 20138f0: b8 10 20 00 clr %i4 20138f4: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 20138f8: 80 a0 40 02 cmp %g1, %g2 20138fc: 10 bf ff 98 b 201375c 2013900: b8 40 20 00 addx %g0, 0, %i4 if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); 2013904: 7f ff f8 b9 call 2011be8 2013908: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 201390c: 10 bf ff f0 b 20138cc 2013910: 80 a2 20 00 cmp %o0, 0 if (fs_info->c.blk_num != blk) { if (fs_info->c.modified) { if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, 2013914: d0 06 20 8c ld [ %i0 + 0x8c ], %o0 <== NOT EXECUTED 2013918: d2 00 60 24 ld [ %g1 + 0x24 ], %o1 <== NOT EXECUTED 201391c: 40 00 28 53 call 201da68 <== NOT EXECUTED 2013920: d4 16 00 00 lduh [ %i0 ], %o2 <== NOT EXECUTED 2013924: 30 bf ff 9b b,a 2013790 <== NOT EXECUTED if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dev, blk, &fs_info->c.buf); 2013928: 7f ff f8 b0 call 2011be8 201392c: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dev, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 2013930: 10 bf ff d8 b 2013890 2013934: 80 a2 20 00 cmp %o0, 0 rtems_set_errno_and_return_minus_one(EIO); 2013938: 40 00 25 7d call 201cf2c <__errno> <== NOT EXECUTED 201393c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013940: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013944: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013948: 81 c7 e0 08 ret <== NOT EXECUTED 201394c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013950 : return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013950: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013954: c2 0e 20 85 ldub [ %i0 + 0x85 ], %g1 return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013958: b6 10 00 18 mov %i0, %i3 rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 201395c: 80 a0 60 00 cmp %g1, 0 2013960: 02 80 00 43 be 2013a6c 2013964: b0 10 20 00 clr %i0 return RC_OK; sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 2013968: c2 06 e0 80 ld [ %i3 + 0x80 ], %g1 201396c: c4 16 e0 14 lduh [ %i3 + 0x14 ], %g2 2013970: 80 a0 40 02 cmp %g1, %g2 2013974: 0a 80 00 05 bcs 2013988 <== NEVER TAKEN 2013978: b8 10 20 00 clr %i4 *buf = fs_info->c.buf; return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) 201397c: c4 06 e0 1c ld [ %i3 + 0x1c ], %g2 2013980: 80 a0 40 02 cmp %g1, %g2 2013984: b8 40 20 00 addx %g0, 0, %i4 return RC_OK; sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.modified) 2013988: c2 0e e0 84 ldub [ %i3 + 0x84 ], %g1 201398c: 80 a0 60 00 cmp %g1, 0 2013990: 02 80 00 39 be 2013a74 2013994: b8 8f 20 ff andcc %i4, 0xff, %i4 { if (sec_of_fat && !fs_info->vol.mirror) 2013998: 02 80 00 06 be 20139b0 201399c: 01 00 00 00 nop 20139a0: c2 0e e0 48 ldub [ %i3 + 0x48 ], %g1 20139a4: 80 a0 60 00 cmp %g1, 0 20139a8: 22 80 00 3b be,a 2013a94 <== ALWAYS TAKEN 20139ac: c2 06 e0 88 ld [ %i3 + 0x88 ], %g1 memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 20139b0: 7f ff f9 80 call 2011fb0 20139b4: d0 06 e0 88 ld [ %i3 + 0x88 ], %o0 if (sc != RTEMS_SUCCESSFUL) 20139b8: 80 a2 20 00 cmp %o0, 0 20139bc: 12 80 00 3b bne 2013aa8 <== NEVER TAKEN 20139c0: 80 a7 20 00 cmp %i4, 0 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.modified = 0; if (sec_of_fat && !fs_info->vol.mirror) 20139c4: 02 80 00 31 be 2013a88 20139c8: c0 2e e0 84 clrb [ %i3 + 0x84 ] 20139cc: c2 0e e0 48 ldub [ %i3 + 0x48 ], %g1 20139d0: 80 a0 60 00 cmp %g1, 0 20139d4: 32 80 00 2e bne,a 2013a8c <== NEVER TAKEN 20139d8: c0 2e e0 85 clrb [ %i3 + 0x85 ] <== NOT EXECUTED { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 20139dc: c2 0e e0 09 ldub [ %i3 + 9 ], %g1 20139e0: 80 a0 60 01 cmp %g1, 1 20139e4: 08 80 00 29 bleu 2013a88 <== NEVER TAKEN 20139e8: b4 10 20 01 mov 1, %i2 20139ec: 10 80 00 10 b 2013a2c 20139f0: 90 10 20 01 mov 1, %o0 fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); 20139f4: d2 06 e0 8c ld [ %i3 + 0x8c ], %o1 20139f8: d4 16 c0 00 lduh [ %i3 ], %o2 20139fc: d0 00 60 24 ld [ %g1 + 0x24 ], %o0 2013a00: 40 00 28 1a call 201da68 2013a04: b4 06 a0 01 inc %i2 sc = rtems_bdbuf_release_modified(b); 2013a08: 7f ff f9 6a call 2011fb0 2013a0c: d0 07 bf fc ld [ %fp + -4 ], %o0 if ( sc != RTEMS_SUCCESSFUL) 2013a10: 80 a2 20 00 cmp %o0, 0 2013a14: 12 80 00 12 bne 2013a5c <== NEVER TAKEN 2013a18: 90 0e a0 ff and %i2, 0xff, %o0 if (sec_of_fat && !fs_info->vol.mirror) { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2013a1c: c2 0e e0 09 ldub [ %i3 + 9 ], %g1 2013a20: 80 a2 00 01 cmp %o0, %g1 2013a24: 3a 80 00 1a bcc,a 2013a8c <== ALWAYS TAKEN 2013a28: c0 2e e0 85 clrb [ %i3 + 0x85 ] { sc = rtems_bdbuf_get(fs_info->vol.dev, fs_info->c.blk_num + fs_info->vol.fat_length * i, 2013a2c: d2 06 e0 18 ld [ %i3 + 0x18 ], %o1 2013a30: 40 00 57 eb call 20299dc <.umul> 2013a34: f8 1e e0 58 ldd [ %i3 + 0x58 ], %i4 { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) { sc = rtems_bdbuf_get(fs_info->vol.dev, 2013a38: d4 06 e0 80 ld [ %i3 + 0x80 ], %o2 2013a3c: 96 07 bf fc add %fp, -4, %o3 2013a40: 94 02 00 0a add %o0, %o2, %o2 2013a44: 92 10 00 1d mov %i5, %o1 2013a48: 7f ff f8 33 call 2011b14 2013a4c: 90 10 00 1c mov %i4, %o0 fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) 2013a50: 80 a2 20 00 cmp %o0, 0 2013a54: 02 bf ff e8 be 20139f4 <== ALWAYS TAKEN 2013a58: c2 07 bf fc ld [ %fp + -4 ], %g1 rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); 2013a5c: 40 00 25 34 call 201cf2c <__errno> <== NOT EXECUTED 2013a60: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013a64: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2013a68: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013a6c: 81 c7 e0 08 ret 2013a70: 81 e8 00 00 restore } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 2013a74: 7f ff f9 15 call 2011ec8 2013a78: d0 06 e0 88 ld [ %i3 + 0x88 ], %o0 if (sc != RTEMS_SUCCESSFUL) 2013a7c: 80 a2 20 00 cmp %o0, 0 2013a80: 12 80 00 0a bne 2013aa8 <== NEVER TAKEN 2013a84: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EIO); } fs_info->c.state = FAT_CACHE_EMPTY; 2013a88: c0 2e e0 85 clrb [ %i3 + 0x85 ] return RC_OK; } 2013a8c: 81 c7 e0 08 ret 2013a90: 91 e8 20 00 restore %g0, 0, %o0 (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.modified) { if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); 2013a94: d0 06 e0 8c ld [ %i3 + 0x8c ], %o0 2013a98: d2 00 60 24 ld [ %g1 + 0x24 ], %o1 2013a9c: 40 00 27 f3 call 201da68 2013aa0: d4 16 c0 00 lduh [ %i3 ], %o2 2013aa4: 30 bf ff c3 b,a 20139b0 } else { sc = rtems_bdbuf_release(fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); 2013aa8: 40 00 25 21 call 201cf2c <__errno> <== NOT EXECUTED 2013aac: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013ab0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013ab4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013ab8: 81 c7 e0 08 ret <== NOT EXECUTED 2013abc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013c14 : fat_cluster_read( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t cln, void *buff ) { 2013c14: 98 10 00 0a mov %o2, %o4 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013c18: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2013c1c: 12 80 00 06 bne 2013c34 <== NOT EXECUTED 2013c20: c2 02 20 34 ld [ %o0 + 0x34 ], %g1 <== NOT EXECUTED 2013c24: c4 08 60 0a ldub [ %g1 + 0xa ], %g2 <== NOT EXECUTED 2013c28: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 2013c2c: 32 80 00 0e bne,a 2013c64 <== NOT EXECUTED 2013c30: d6 08 60 04 ldub [ %g1 + 4 ], %o3 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013c34: c6 08 60 05 ldub [ %g1 + 5 ], %g3 <== NOT EXECUTED 2013c38: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 <== NOT EXECUTED uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_read(mt_entry, fsec, 0, fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2013c3c: d6 08 60 04 ldub [ %g1 + 4 ], %o3 <== NOT EXECUTED 2013c40: c2 08 60 02 ldub [ %g1 + 2 ], %g1 <== NOT EXECUTED 2013c44: 92 02 7f fe add %o1, -2, %o1 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_read(mt_entry, fsec, 0, 2013c48: 94 10 20 00 clr %o2 <== NOT EXECUTED 2013c4c: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 2013c50: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2013c54: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED 2013c58: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2013c5c: 7f ff ff 99 call 2013ac0 <_fat_block_read> <== NOT EXECUTED 2013c60: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; 2013c64: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 <== NOT EXECUTED fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2013c68: c2 08 60 02 ldub [ %g1 + 2 ], %g1 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_read(mt_entry, fsec, 0, 2013c6c: 94 10 20 00 clr %o2 <== NOT EXECUTED 2013c70: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2013c74: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2013c78: 7f ff ff 92 call 2013ac0 <_fat_block_read> <== NOT EXECUTED 2013c7c: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02013c80 : fat_cluster_write( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t cln, const void *buff ) { 2013c80: 98 10 00 0a mov %o2, %o4 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013c84: 80 a2 60 00 cmp %o1, 0 2013c88: 12 80 00 06 bne 2013ca0 <== ALWAYS TAKEN 2013c8c: c2 02 20 34 ld [ %o0 + 0x34 ], %g1 2013c90: c4 08 60 0a ldub [ %g1 + 0xa ], %g2 <== NOT EXECUTED 2013c94: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 2013c98: 32 80 00 0e bne,a 2013cd0 <== NOT EXECUTED 2013c9c: d6 08 60 04 ldub [ %g1 + 4 ], %o3 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013ca0: c6 08 60 05 ldub [ %g1 + 5 ], %g3 2013ca4: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_write(mt_entry, fsec, 0, fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2013ca8: d6 08 60 04 ldub [ %g1 + 4 ], %o3 2013cac: c2 08 60 02 ldub [ %g1 + 2 ], %g1 2013cb0: 92 02 7f fe add %o1, -2, %o1 fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_write(mt_entry, fsec, 0, 2013cb4: 94 10 20 00 clr %o2 2013cb8: 93 2a 40 03 sll %o1, %g3, %o1 2013cbc: 97 2a c0 01 sll %o3, %g1, %o3 2013cc0: 92 02 40 02 add %o1, %g2, %o1 2013cc4: 82 13 c0 00 mov %o7, %g1 2013cc8: 7f ff ff a0 call 2013b48 <_fat_block_write> 2013ccc: 9e 10 40 00 mov %g1, %o7 ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; 2013cd0: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 <== NOT EXECUTED fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2013cd4: c2 08 60 02 ldub [ %g1 + 2 ], %g1 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(mt_entry, cln); return _fat_block_write(mt_entry, fsec, 0, 2013cd8: 94 10 20 00 clr %o2 <== NOT EXECUTED 2013cdc: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2013ce0: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2013ce4: 7f ff ff 99 call 2013b48 <_fat_block_write> <== NOT EXECUTED 2013ce8: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02013efc : fat_fat32_update_fsinfo_sector( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t free_count, uint32_t next_free ) { 2013efc: 9d e3 bf 98 save %sp, -104, %sp <== NOT EXECUTED ssize_t ret1 = 0, ret2 = 0; register fat_fs_info_t *fs_info = mt_entry->fs_info; 2013f00: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 <== NOT EXECUTED byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f04: 87 2e 60 18 sll %i1, 0x18, %g3 <== NOT EXECUTED uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); le_next_free = CT_LE_L(next_free); ret1 = _fat_block_write(mt_entry, 2013f08: d2 17 60 3c lduh [ %i5 + 0x3c ], %o1 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2013f0c: 85 36 60 18 srl %i1, 0x18, %g2 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2013f10: 83 36 60 08 srl %i1, 8, %g1 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f14: 84 10 c0 02 or %g3, %g2, %g2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2013f18: 82 08 60 ff and %g1, 0xff, %g1 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f1c: 87 2e a0 18 sll %i2, 0x18, %g3 <== NOT EXECUTED 2013f20: 83 28 60 10 sll %g1, 0x10, %g1 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2013f24: b3 36 60 10 srl %i1, 0x10, %i1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f28: 84 10 80 01 or %g2, %g1, %g2 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2013f2c: b2 0e 60 ff and %i1, 0xff, %i1 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2013f30: 83 36 a0 18 srl %i2, 0x18, %g1 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f34: b3 2e 60 08 sll %i1, 8, %i1 <== NOT EXECUTED 2013f38: 82 10 c0 01 or %g3, %g1, %g1 <== NOT EXECUTED 2013f3c: 84 10 80 19 or %g2, %i1, %g2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2013f40: 89 36 a0 08 srl %i2, 8, %g4 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2013f44: 87 36 a0 10 srl %i2, 0x10, %g3 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; 2013f48: 88 09 20 ff and %g4, 0xff, %g4 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2013f4c: 86 08 e0 ff and %g3, 0xff, %g3 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2013f50: 89 29 20 10 sll %g4, 0x10, %g4 <== NOT EXECUTED 2013f54: 87 28 e0 08 sll %g3, 8, %g3 <== NOT EXECUTED 2013f58: 82 10 40 04 or %g1, %g4, %g1 <== NOT EXECUTED 2013f5c: 82 10 40 03 or %g1, %g3, %g1 <== NOT EXECUTED 2013f60: 94 10 21 e8 mov 0x1e8, %o2 <== NOT EXECUTED 2013f64: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2013f68: 98 07 bf f8 add %fp, -8, %o4 <== NOT EXECUTED ssize_t ret1 = 0, ret2 = 0; register fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t le_free_count = 0; uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); 2013f6c: c4 27 bf f8 st %g2, [ %fp + -8 ] <== NOT EXECUTED le_next_free = CT_LE_L(next_free); 2013f70: c2 27 bf fc st %g1, [ %fp + -4 ] <== NOT EXECUTED ret1 = _fat_block_write(mt_entry, 2013f74: 7f ff fe f5 call 2013b48 <_fat_block_write> <== NOT EXECUTED 2013f78: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, 4, (char *)(&le_free_count)); ret2 = _fat_block_write(mt_entry, 2013f7c: d2 17 60 3c lduh [ %i5 + 0x3c ], %o1 <== NOT EXECUTED uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); le_next_free = CT_LE_L(next_free); ret1 = _fat_block_write(mt_entry, 2013f80: b8 10 00 08 mov %o0, %i4 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, 4, (char *)(&le_free_count)); ret2 = _fat_block_write(mt_entry, 2013f84: 94 10 21 ec mov 0x1ec, %o2 <== NOT EXECUTED 2013f88: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2013f8c: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2013f90: 7f ff fe ee call 2013b48 <_fat_block_write> <== NOT EXECUTED 2013f94: 98 07 bf fc add %fp, -4, %o4 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_NEXT_FREE_CLUSTER_OFFSET, 4, (char *)(&le_next_free)); if ( (ret1 < 0) || (ret2 < 0) ) 2013f98: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013f9c: 06 80 00 06 bl 2013fb4 <== NOT EXECUTED 2013fa0: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 2013fa4: 06 80 00 04 bl 2013fb4 <== NOT EXECUTED 2013fa8: b0 10 20 00 clr %i0 <== NOT EXECUTED return -1; return RC_OK; } 2013fac: 81 c7 e0 08 ret <== NOT EXECUTED 2013fb0: 81 e8 00 00 restore <== NOT EXECUTED 2013fb4: 81 c7 e0 08 ret <== NOT EXECUTED 2013fb8: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED =============================================================================== 02012eb0 : int fat_file_close( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd ) { 2012eb0: 9d e3 bf a0 save %sp, -96, %sp /* * if links_num field of fat-file descriptor is greater than 1 * decrement the count of links and return */ if (fat_fd->links_num > 1) 2012eb4: c2 06 60 08 ld [ %i1 + 8 ], %g1 2012eb8: 80 a0 60 01 cmp %g1, 1 2012ebc: 08 80 00 07 bleu 2012ed8 2012ec0: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 { fat_fd->links_num--; 2012ec4: 82 00 7f ff add %g1, -1, %g1 return rc; 2012ec8: 90 10 20 00 clr %o0 * if links_num field of fat-file descriptor is greater than 1 * decrement the count of links and return */ if (fat_fd->links_num > 1) { fat_fd->links_num--; 2012ecc: c2 26 60 08 st %g1, [ %i1 + 8 ] * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); return rc; } 2012ed0: 81 c7 e0 08 ret 2012ed4: 91 e8 00 08 restore %g0, %o0, %o0 return rc; } key = fat_construct_key(mt_entry, &fat_fd->dir_pos.sname); if (fat_fd->flags & FAT_FILE_REMOVED) 2012ed8: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 2012edc: 80 88 60 01 btst 1, %g1 2012ee0: 22 80 00 16 be,a 2012f38 <== ALWAYS TAKEN 2012ee4: d2 06 60 0c ld [ %i1 + 0xc ], %o1 { rc = fat_file_truncate(mt_entry, fat_fd, 0); 2012ee8: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2012eec: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2012ef0: 7f ff ff ac call 2012da0 <== NOT EXECUTED 2012ef4: 94 10 20 00 clr %o2 <== NOT EXECUTED if ( rc != RC_OK ) 2012ef8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2012efc: 12 bf ff f5 bne 2012ed0 <== NOT EXECUTED 2012f00: 01 00 00 00 nop <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2012f04: 7f ff e0 11 call 200af48 <_Chain_Extract> <== NOT EXECUTED 2012f08: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED return rc; _hash_delete(fs_info->rhash, key, fat_fd->ino, fat_fd); if ( fat_ino_is_unique(mt_entry, fat_fd->ino) ) 2012f0c: d2 06 60 0c ld [ %i1 + 0xc ], %o1 <== NOT EXECUTED 2012f10: 40 00 03 f6 call 2013ee8 <== NOT EXECUTED 2012f14: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2012f18: 80 8a 20 ff btst 0xff, %o0 <== NOT EXECUTED 2012f1c: 32 80 00 13 bne,a 2012f68 <== NOT EXECUTED 2012f20: d2 06 60 0c ld [ %i1 + 0xc ], %o1 <== NOT EXECUTED fat_fd->links_num = 0; } else { _hash_delete(fs_info->vhash, key, fat_fd->ino, fat_fd); free(fat_fd); 2012f24: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2012f28: 7f ff cb 2c call 2005bd8 2012f2c: b0 10 00 1d mov %i5, %i0 } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 2012f30: 40 00 02 88 call 2013950 2012f34: 81 e8 00 00 restore free(fat_fd); } else { if (fat_ino_is_unique(mt_entry, fat_fd->ino)) 2012f38: 40 00 03 ec call 2013ee8 2012f3c: 90 10 00 18 mov %i0, %o0 2012f40: 80 8a 20 ff btst 0xff, %o0 2012f44: 02 80 00 05 be 2012f58 <== ALWAYS TAKEN 2012f48: 01 00 00 00 nop { fat_fd->links_num = 0; 2012f4c: c0 26 60 08 clr [ %i1 + 8 ] <== NOT EXECUTED } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 2012f50: 40 00 02 80 call 2013950 <== NOT EXECUTED 2012f54: 91 e8 00 1d restore %g0, %i5, %o0 <== NOT EXECUTED 2012f58: 7f ff df fc call 200af48 <_Chain_Extract> 2012f5c: 90 10 00 19 mov %i1, %o0 fat_fd->links_num = 0; } else { _hash_delete(fs_info->vhash, key, fat_fd->ino, fat_fd); free(fat_fd); 2012f60: 10 bf ff f2 b 2012f28 2012f64: 90 10 00 19 mov %i1, %o0 return rc; _hash_delete(fs_info->rhash, key, fat_fd->ino, fat_fd); if ( fat_ino_is_unique(mt_entry, fat_fd->ino) ) fat_free_unique_ino(mt_entry, fat_fd->ino); 2012f68: 40 00 03 d2 call 2013eb0 <== NOT EXECUTED 2012f6c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED fat_fd->links_num = 0; } else { _hash_delete(fs_info->vhash, key, fat_fd->ino, fat_fd); free(fat_fd); 2012f70: 10 bf ff ee b 2012f28 <== NOT EXECUTED 2012f74: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED =============================================================================== 0201354c : int fat_file_datasync( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd ) { 201354c: 9d e3 bf 98 save %sp, -104, %sp <== NOT EXECUTED int rc = RC_OK; rtems_status_code sc = RTEMS_SUCCESSFUL; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; 2013550: c4 06 60 1c ld [ %i1 + 0x1c ], %g2 <== NOT EXECUTED rtems_bdbuf_buffer *block = NULL; uint32_t sec = 0; uint32_t i = 0; if (fat_fd->fat_file_size == 0) 2013554: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 <== NOT EXECUTED ) { int rc = RC_OK; rtems_status_code sc = RTEMS_SUCCESSFUL; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; 2013558: c4 27 bf f8 st %g2, [ %fp + -8 ] <== NOT EXECUTED rtems_bdbuf_buffer *block = NULL; 201355c: c0 27 bf fc clr [ %fp + -4 ] <== NOT EXECUTED uint32_t sec = 0; uint32_t i = 0; if (fat_fd->fat_file_size == 0) return RC_OK; 2013560: b4 10 20 00 clr %i2 <== NOT EXECUTED uint32_t cur_cln = fat_fd->cln; rtems_bdbuf_buffer *block = NULL; uint32_t sec = 0; uint32_t i = 0; if (fat_fd->fat_file_size == 0) 2013564: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 2013568: 12 80 00 04 bne 2013578 <== NOT EXECUTED 201356c: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 <== NOT EXECUTED rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; } return rc; } 2013570: 81 c7 e0 08 ret <== NOT EXECUTED 2013574: 91 e8 00 1a restore %g0, %i2, %o0 <== NOT EXECUTED /* * we can use only one bdbuf :( and we also know that cache is useless * for sync operation, so don't use it */ rc = fat_buf_release(fs_info); 2013578: 40 00 00 f6 call 2013950 <== NOT EXECUTED 201357c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED if (rc != RC_OK) 2013580: b4 92 20 00 orcc %o0, 0, %i2 <== NOT EXECUTED 2013584: 12 bf ff fb bne 2013570 <== NOT EXECUTED 2013588: d2 07 bf f8 ld [ %fp + -8 ], %o1 <== NOT EXECUTED return rc; /* for each cluster of the file ... */ while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 201358c: c4 07 20 0c ld [ %i4 + 0xc ], %g2 <== NOT EXECUTED 2013590: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 <== NOT EXECUTED 2013594: 84 0a 40 02 and %o1, %g2, %g2 <== NOT EXECUTED 2013598: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 201359c: 1a bf ff f5 bcc 2013570 <== NOT EXECUTED 20135a0: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20135a4: 02 80 00 23 be 2013630 <== NOT EXECUTED 20135a8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 20135ac: c4 08 60 05 ldub [ %g1 + 5 ], %g2 <== NOT EXECUTED 20135b0: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 <== NOT EXECUTED 20135b4: b6 02 7f fe add %o1, -2, %i3 <== NOT EXECUTED 20135b8: b7 2e c0 02 sll %i3, %g2, %i3 <== NOT EXECUTED 20135bc: b6 06 c0 01 add %i3, %g1, %i3 <== NOT EXECUTED { sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); /* for each sector in cluster ... */ for ( i = 0; i < fs_info->vol.spc; i++ ) 20135c0: c2 0f 20 04 ldub [ %i4 + 4 ], %g1 <== NOT EXECUTED 20135c4: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20135c8: 02 80 00 20 be 2013648 <== NOT EXECUTED 20135cc: ba 10 20 00 clr %i5 <== NOT EXECUTED { /* ... sync it */ sc = rtems_bdbuf_read(fs_info->vol.dev, (sec + i), &block); 20135d0: 10 80 00 0c b 2013600 <== NOT EXECUTED 20135d4: d0 1f 20 58 ldd [ %i4 + 0x58 ], %o0 <== NOT EXECUTED if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one( EIO ); sc = rtems_bdbuf_sync(block); 20135d8: 7f ff fa 99 call 201203c <== NOT EXECUTED 20135dc: ba 07 60 01 inc %i5 <== NOT EXECUTED if ( sc != RTEMS_SUCCESSFUL ) 20135e0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20135e4: 12 80 00 0d bne 2013618 <== NOT EXECUTED 20135e8: 01 00 00 00 nop <== NOT EXECUTED /* for each cluster of the file ... */ while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); /* for each sector in cluster ... */ for ( i = 0; i < fs_info->vol.spc; i++ ) 20135ec: c2 0f 20 04 ldub [ %i4 + 4 ], %g1 <== NOT EXECUTED 20135f0: 80 a0 40 1d cmp %g1, %i5 <== NOT EXECUTED 20135f4: 08 80 00 15 bleu 2013648 <== NOT EXECUTED 20135f8: d2 07 bf f8 ld [ %fp + -8 ], %o1 <== NOT EXECUTED { /* ... sync it */ sc = rtems_bdbuf_read(fs_info->vol.dev, (sec + i), &block); 20135fc: d0 1f 20 58 ldd [ %i4 + 0x58 ], %o0 <== NOT EXECUTED 2013600: 94 07 40 1b add %i5, %i3, %o2 <== NOT EXECUTED 2013604: 7f ff f9 79 call 2011be8 <== NOT EXECUTED 2013608: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED if (sc != RTEMS_SUCCESSFUL) 201360c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013610: 02 bf ff f2 be 20135d8 <== NOT EXECUTED 2013614: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); sc = rtems_bdbuf_sync(block); if ( sc != RTEMS_SUCCESSFUL ) rtems_set_errno_and_return_minus_one( EIO ); 2013618: 40 00 26 45 call 201cf2c <__errno> <== NOT EXECUTED 201361c: b4 10 3f ff mov -1, %i2 <== NOT EXECUTED 2013620: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013624: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; } return rc; } 2013628: 81 c7 e0 08 ret <== NOT EXECUTED 201362c: 91 e8 00 1a restore %g0, %i2, %o0 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013630: c4 08 60 0a ldub [ %g1 + 0xa ], %g2 <== NOT EXECUTED 2013634: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 2013638: 22 bf ff de be,a 20135b0 <== NOT EXECUTED 201363c: c4 08 60 05 ldub [ %g1 + 5 ], %g2 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013640: 10 bf ff e0 b 20135c0 <== NOT EXECUTED 2013644: f6 00 60 1c ld [ %g1 + 0x1c ], %i3 <== NOT EXECUTED sc = rtems_bdbuf_sync(block); if ( sc != RTEMS_SUCCESSFUL ) rtems_set_errno_and_return_minus_one( EIO ); } rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2013648: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201364c: 40 00 1e d7 call 201b1a8 <== NOT EXECUTED 2013650: 94 07 bf f8 add %fp, -8, %o2 <== NOT EXECUTED if ( rc != RC_OK ) 2013654: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013658: 02 bf ff cd be 201358c <== NOT EXECUTED 201365c: d2 07 bf f8 ld [ %fp + -8 ], %o1 <== NOT EXECUTED sc = rtems_bdbuf_sync(block); if ( sc != RTEMS_SUCCESSFUL ) rtems_set_errno_and_return_minus_one( EIO ); } rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2013660: 10 bf ff c4 b 2013570 <== NOT EXECUTED 2013664: b4 10 00 08 mov %o0, %i2 <== NOT EXECUTED =============================================================================== 02013054 : rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd, uint32_t new_length, uint32_t *a_length ) { 2013054: 9d e3 bf 90 save %sp, -112, %sp int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 2013058: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 uint32_t old_last_cl; uint32_t last_cl = 0; uint32_t bytes_remain = 0; uint32_t cls_added; *a_length = new_length; 201305c: f4 26 c0 00 st %i2, [ %i3 ] if (new_length <= fat_fd->fat_file_size) 2013060: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t *a_length ) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t chain = 0; 2013064: c0 27 bf f0 clr [ %fp + -16 ] uint32_t bytes2add = 0; uint32_t cls2add = 0; uint32_t old_last_cl; uint32_t last_cl = 0; 2013068: c0 27 bf f8 clr [ %fp + -8 ] rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd, uint32_t new_length, uint32_t *a_length ) { 201306c: ba 10 00 18 mov %i0, %i5 uint32_t bytes_remain = 0; uint32_t cls_added; *a_length = new_length; if (new_length <= fat_fd->fat_file_size) 2013070: 80 a6 80 01 cmp %i2, %g1 2013074: 08 80 00 3d bleu 2013168 2013078: b0 10 20 00 clr %i0 return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 201307c: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 2013080: 80 a0 a0 01 cmp %g2, 1 2013084: 22 80 00 3b be,a 2013170 <== NEVER TAKEN 2013088: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) rtems_set_errno_and_return_minus_one( ENOSPC ); bytes_remain = (fs_info->vol.bpc - (fat_fd->fat_file_size & (fs_info->vol.bpc - 1))) & 201308c: c6 17 20 06 lduh [ %i4 + 6 ], %g3 (fs_info->vol.bpc - 1); bytes2add = new_length - fat_fd->fat_file_size; 2013090: a4 26 80 01 sub %i2, %g1, %l2 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) rtems_set_errno_and_return_minus_one( ENOSPC ); bytes_remain = (fs_info->vol.bpc - (fat_fd->fat_file_size & (fs_info->vol.bpc - 1))) & 2013094: 84 00 ff ff add %g3, -1, %g2 2013098: a0 08 80 01 and %g2, %g1, %l0 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) rtems_set_errno_and_return_minus_one( ENOSPC ); bytes_remain = (fs_info->vol.bpc - 201309c: a0 20 c0 10 sub %g3, %l0, %l0 20130a0: a0 0c 00 02 and %l0, %g2, %l0 (fat_fd->fat_file_size & (fs_info->vol.bpc - 1))) & (fs_info->vol.bpc - 1); bytes2add = new_length - fat_fd->fat_file_size; if (bytes2add > bytes_remain) 20130a4: 80 a4 00 12 cmp %l0, %l2 20130a8: 1a 80 00 30 bcc 2013168 20130ac: b0 10 20 00 clr %i0 /* * if in last cluster allocated for the file there is enough room to * handle extention (hence we don't need to add even one cluster to the * file ) - return */ if (bytes2add == 0) 20130b0: a4 a4 80 10 subcc %l2, %l0, %l2 20130b4: 02 80 00 2d be 2013168 <== NEVER TAKEN 20130b8: a2 04 bf ff add %l2, -1, %l1 return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 20130bc: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 rc = fat_scan_fat_for_free_clusters(mt_entry, &chain, cls2add, 20130c0: 90 10 00 1d mov %i5, %o0 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 20130c4: a3 34 40 01 srl %l1, %g1, %l1 rc = fat_scan_fat_for_free_clusters(mt_entry, &chain, cls2add, 20130c8: 92 07 bf f0 add %fp, -16, %o1 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 20130cc: a2 04 60 01 inc %l1 rc = fat_scan_fat_for_free_clusters(mt_entry, &chain, cls2add, 20130d0: 96 07 bf fc add %fp, -4, %o3 20130d4: 94 10 00 11 mov %l1, %o2 20130d8: 40 00 21 b7 call 201b7b4 20130dc: 98 07 bf f8 add %fp, -8, %o4 &cls_added, &last_cl); /* this means that low level I/O error occured */ if (rc != RC_OK) 20130e0: b0 92 20 00 orcc %o0, 0, %i0 20130e4: 12 80 00 21 bne 2013168 <== NEVER TAKEN 20130e8: c2 07 bf fc ld [ %fp + -4 ], %g1 return rc; /* this means that no space left on device */ if ((cls_added == 0) && (bytes_remain == 0)) 20130ec: 80 94 00 01 orcc %l0, %g1, %g0 20130f0: 02 80 00 27 be 201318c <== NEVER TAKEN 20130f4: 80 a4 40 01 cmp %l1, %g1 rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) 20130f8: 02 80 00 0b be 2013124 <== ALWAYS TAKEN 20130fc: 88 38 00 01 xnor %g0, %g1, %g4 *a_length = new_length - ((cls2add - cls_added - 1) << fs_info->vol.bpc_log2) - 2013100: c4 0f 20 08 ldub [ %i4 + 8 ], %g2 <== NOT EXECUTED (bytes2add & (fs_info->vol.bpc - 1)); 2013104: c6 17 20 06 lduh [ %i4 + 6 ], %g3 <== NOT EXECUTED 2013108: 86 00 ff ff add %g3, -1, %g3 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) *a_length = new_length - ((cls2add - cls_added - 1) << fs_info->vol.bpc_log2) - 201310c: a2 01 00 11 add %g4, %l1, %l1 <== NOT EXECUTED (bytes2add & (fs_info->vol.bpc - 1)); 2013110: a4 0c 80 03 and %l2, %g3, %l2 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) *a_length = new_length - ((cls2add - cls_added - 1) << fs_info->vol.bpc_log2) - 2013114: a3 2c 40 02 sll %l1, %g2, %l1 <== NOT EXECUTED if ((cls_added == 0) && (bytes_remain == 0)) rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) *a_length = new_length - 2013118: a2 26 80 11 sub %i2, %l1, %l1 <== NOT EXECUTED ((cls2add - cls_added - 1) << fs_info->vol.bpc_log2) - 201311c: a4 24 40 12 sub %l1, %l2, %l2 <== NOT EXECUTED if ((cls_added == 0) && (bytes_remain == 0)) rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) *a_length = new_length - 2013120: e4 26 c0 00 st %l2, [ %i3 ] <== NOT EXECUTED ((cls2add - cls_added - 1) << fs_info->vol.bpc_log2) - (bytes2add & (fs_info->vol.bpc - 1)); /* add new chain to the end of existed */ if ( fat_fd->fat_file_size == 0 ) 2013124: d6 06 60 18 ld [ %i1 + 0x18 ], %o3 2013128: 80 a2 e0 00 cmp %o3, 0 201312c: 32 80 00 1e bne,a 20131a4 2013130: d2 06 60 3c ld [ %i1 + 0x3c ], %o1 { fat_fd->map.disk_cln = fat_fd->cln = chain; 2013134: c4 07 bf f0 ld [ %fp + -16 ], %g2 fat_fd->map.file_cln = 0; 2013138: c0 26 60 34 clr [ %i1 + 0x34 ] (bytes2add & (fs_info->vol.bpc - 1)); /* add new chain to the end of existed */ if ( fat_fd->fat_file_size == 0 ) { fat_fd->map.disk_cln = fat_fd->cln = chain; 201313c: c4 26 60 1c st %g2, [ %i1 + 0x1c ] 2013140: c4 26 60 38 st %g2, [ %i1 + 0x38 ] } fat_buf_release(fs_info); } /* update number of the last cluster of the file if it changed */ if (cls_added != 0) 2013144: 80 a0 60 00 cmp %g1, 0 2013148: 22 80 00 08 be,a 2013168 <== NEVER TAKEN 201314c: f4 26 60 18 st %i2, [ %i1 + 0x18 ] <== NOT EXECUTED { fat_fd->map.last_cln = last_cl; 2013150: c4 07 bf f8 ld [ %fp + -8 ], %g2 if (fat_fd->fat_file_type == FAT_DIRECTORY) 2013154: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2013158: 80 a0 60 01 cmp %g1, 1 201315c: 02 80 00 20 be 20131dc 2013160: c4 26 60 3c st %g2, [ %i1 + 0x3c ] return rc; } } } fat_fd->fat_file_size = new_length; 2013164: f4 26 60 18 st %i2, [ %i1 + 0x18 ] return RC_OK; } 2013168: 81 c7 e0 08 ret 201316c: 81 e8 00 00 restore *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013170: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 2013174: 32 bf ff c7 bne,a 2013090 <== NOT EXECUTED 2013178: c6 17 20 06 lduh [ %i4 + 6 ], %g3 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 201317c: c4 0f 20 0a ldub [ %i4 + 0xa ], %g2 <== NOT EXECUTED *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013180: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 2013184: 22 bf ff c3 be,a 2013090 <== NOT EXECUTED 2013188: c6 17 20 06 lduh [ %i4 + 6 ], %g3 <== NOT EXECUTED if (rc != RC_OK) return rc; /* this means that no space left on device */ if ((cls_added == 0) && (bytes_remain == 0)) rtems_set_errno_and_return_minus_one(ENOSPC); 201318c: 40 00 27 68 call 201cf2c <__errno> <== NOT EXECUTED 2013190: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013194: 82 10 20 1c mov 0x1c, %g1 <== NOT EXECUTED 2013198: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201319c: 81 c7 e0 08 ret <== NOT EXECUTED 20131a0: 81 e8 00 00 restore <== NOT EXECUTED fat_fd->map.disk_cln = fat_fd->cln = chain; fat_fd->map.file_cln = 0; } else { if (fat_fd->map.last_cln != FAT_UNDEFINED_VALUE) 20131a4: 80 a2 7f ff cmp %o1, -1 20131a8: 22 80 00 19 be,a 201320c <== NEVER TAKEN 20131ac: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED { old_last_cl = fat_fd->map.last_cln; 20131b0: d2 27 bf f4 st %o1, [ %fp + -12 ] fat_free_fat_clusters_chain(mt_entry, chain); return rc; } } rc = fat_set_fat_cluster(mt_entry, old_last_cl, chain); 20131b4: d4 07 bf f0 ld [ %fp + -16 ], %o2 20131b8: 40 00 20 84 call 201b3c8 20131bc: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20131c0: 82 92 20 00 orcc %o0, 0, %g1 20131c4: 12 80 00 0d bne 20131f8 <== NEVER TAKEN 20131c8: d2 07 bf f0 ld [ %fp + -16 ], %o1 { fat_free_fat_clusters_chain(mt_entry, chain); return rc; } fat_buf_release(fs_info); 20131cc: 40 00 01 e1 call 2013950 20131d0: 90 10 00 1c mov %i4, %o0 20131d4: 10 bf ff dc b 2013144 20131d8: c2 07 bf fc ld [ %fp + -4 ], %g1 if (cls_added != 0) { fat_fd->map.last_cln = last_cl; if (fat_fd->fat_file_type == FAT_DIRECTORY) { rc = fat_init_clusters_chain(mt_entry, chain); 20131dc: d2 07 bf f0 ld [ %fp + -16 ], %o1 20131e0: 40 00 02 c3 call 2013cec 20131e4: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20131e8: 82 92 20 00 orcc %o0, 0, %g1 20131ec: 22 bf ff df be,a 2013168 <== ALWAYS TAKEN 20131f0: f4 26 60 18 st %i2, [ %i1 + 0x18 ] { fat_free_fat_clusters_chain(mt_entry, chain); 20131f4: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED 20131f8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20131fc: 40 00 21 35 call 201b6d0 <== NOT EXECUTED 2013200: b0 10 00 01 mov %g1, %i0 <== NOT EXECUTED return rc; 2013204: 81 c7 e0 08 ret <== NOT EXECUTED 2013208: 81 e8 00 00 restore <== NOT EXECUTED { old_last_cl = fat_fd->map.last_cln; } else { rc = fat_file_ioctl(mt_entry, fat_fd, F_CLU_NUM, 201320c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2013210: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 2013214: 96 02 ff ff add %o3, -1, %o3 <== NOT EXECUTED 2013218: 7f ff ff 58 call 2012f78 <== NOT EXECUTED 201321c: 98 07 bf f4 add %fp, -12, %o4 <== NOT EXECUTED (fat_fd->fat_file_size - 1), &old_last_cl); if ( rc != RC_OK ) { fat_free_fat_clusters_chain(mt_entry, chain); return rc; 2013220: d2 07 bf f4 ld [ %fp + -12 ], %o1 <== NOT EXECUTED } else { rc = fat_file_ioctl(mt_entry, fat_fd, F_CLU_NUM, (fat_fd->fat_file_size - 1), &old_last_cl); if ( rc != RC_OK ) 2013224: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013228: 02 bf ff e3 be 20131b4 <== NOT EXECUTED 201322c: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED if (fat_fd->fat_file_type == FAT_DIRECTORY) { rc = fat_init_clusters_chain(mt_entry, chain); if ( rc != RC_OK ) { fat_free_fat_clusters_chain(mt_entry, chain); 2013230: 10 bf ff f2 b 20131f8 <== NOT EXECUTED 2013234: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED =============================================================================== 02012f78 : fat_file_ioctl( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd, int cmd, ...) { 2012f78: 9d e3 bf 98 save %sp, -104, %sp uint32_t cl_start = 0; uint32_t pos = 0; uint32_t *ret; va_list ap; va_start(ap, cmd); 2012f7c: 82 07 a0 50 add %fp, 0x50, %g1 2012f80: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2012f84: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2012f88: fa 27 a0 58 st %i5, [ %fp + 0x58 ] int cmd, ...) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = 0; 2012f8c: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cl_start = 0; uint32_t pos = 0; uint32_t *ret; va_list ap; va_start(ap, cmd); 2012f90: c2 27 bf fc st %g1, [ %fp + -4 ] switch (cmd) 2012f94: 80 a6 a0 01 cmp %i2, 1 2012f98: 02 80 00 08 be 2012fb8 <== ALWAYS TAKEN 2012f9c: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 *ret = cur_cln; break; default: errno = EINVAL; 2012fa0: 40 00 27 e3 call 201cf2c <__errno> <== NOT EXECUTED 2012fa4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012fa8: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2012fac: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rc = -1; break; } va_end(ap); return rc; } 2012fb0: 81 c7 e0 08 ret <== NOT EXECUTED 2012fb4: 81 e8 00 00 restore <== NOT EXECUTED case F_CLU_NUM: pos = va_arg(ap, uint32_t); ret = va_arg(ap, uint32_t *); /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { 2012fb8: c8 06 60 18 ld [ %i1 + 0x18 ], %g4 switch (cmd) { case F_CLU_NUM: pos = va_arg(ap, uint32_t); ret = va_arg(ap, uint32_t *); 2012fbc: ba 07 a0 58 add %fp, 0x58, %i5 2012fc0: fa 27 bf fc st %i5, [ %fp + -4 ] va_start(ap, cmd); switch (cmd) { case F_CLU_NUM: pos = va_arg(ap, uint32_t); 2012fc4: 84 10 00 1b mov %i3, %g2 ret = va_arg(ap, uint32_t *); /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { 2012fc8: 80 a6 c0 04 cmp %i3, %g4 2012fcc: 1a 80 00 1c bcc 201303c <== NEVER TAKEN 2012fd0: ba 10 00 1c mov %i4, %i5 va_end(ap); rtems_set_errno_and_return_minus_one( EIO ); } if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2012fd4: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2012fd8: 80 a0 60 01 cmp %g1, 1 2012fdc: 22 80 00 0e be,a 2013014 2012fe0: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 *ret = 0; rc = RC_OK; break; } cl_start = pos >> fs_info->vol.bpc_log2; 2012fe4: d4 08 e0 08 ldub [ %g3 + 8 ], %o2 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); 2012fe8: 90 10 00 18 mov %i0, %o0 2012fec: 92 10 00 19 mov %i1, %o1 2012ff0: 95 30 80 0a srl %g2, %o2, %o2 2012ff4: 7f ff fe 0b call 2012820 2012ff8: 96 07 bf f8 add %fp, -8, %o3 if ( rc != RC_OK ) 2012ffc: b0 92 60 00 orcc %o1, 0, %i0 2013000: 12 bf ff ec bne 2012fb0 <== NEVER TAKEN 2013004: c2 07 bf f8 ld [ %fp + -8 ], %g1 break; *ret = cur_cln; 2013008: c2 27 40 00 st %g1, [ %i5 ] break; 201300c: 81 c7 e0 08 ret 2013010: 81 e8 00 00 restore if ( pos >= fat_fd->fat_file_size ) { va_end(ap); rtems_set_errno_and_return_minus_one( EIO ); } if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013014: 80 a0 60 00 cmp %g1, 0 2013018: 32 bf ff f4 bne,a 2012fe8 <== NEVER TAKEN 201301c: d4 08 e0 08 ldub [ %g3 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2013020: c2 08 e0 0a ldub [ %g3 + 0xa ], %g1 if ( pos >= fat_fd->fat_file_size ) { va_end(ap); rtems_set_errno_and_return_minus_one( EIO ); } if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013024: 80 88 60 03 btst 3, %g1 2013028: 22 bf ff f0 be,a 2012fe8 <== NEVER TAKEN 201302c: d4 08 e0 08 ldub [ %g3 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { /* cluster 0 (zero) reserved for root dir */ *ret = 0; 2013030: c0 27 00 00 clr [ %i4 ] rc = RC_OK; break; 2013034: 81 c7 e0 08 ret 2013038: 91 e8 20 00 restore %g0, 0, %o0 ret = va_arg(ap, uint32_t *); /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { va_end(ap); rtems_set_errno_and_return_minus_one( EIO ); 201303c: 40 00 27 bc call 201cf2c <__errno> <== NOT EXECUTED 2013040: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013044: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013048: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201304c: 81 c7 e0 08 ret <== NOT EXECUTED 2013050: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02012820 : rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd, uint32_t file_cln, uint32_t *disk_cln ) { 2012820: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) 2012824: f8 06 60 34 ld [ %i1 + 0x34 ], %i4 2012828: 80 a7 00 1a cmp %i4, %i2 201282c: 22 80 00 21 be,a 20128b0 <== ALWAYS TAKEN 2012830: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 { uint32_t cur_cln; uint32_t count; uint32_t i; if (file_cln > fat_fd->map.file_cln) 2012834: 2a 80 00 16 bcs,a 201288c <== NOT EXECUTED 2012838: d2 06 60 38 ld [ %i1 + 0x38 ], %o1 <== NOT EXECUTED cur_cln = fat_fd->map.disk_cln; count = file_cln - fat_fd->map.file_cln; } else { cur_cln = fat_fd->cln; 201283c: d2 06 60 1c ld [ %i1 + 0x1c ], %o1 <== NOT EXECUTED 2012840: b8 10 00 1a mov %i2, %i4 <== NOT EXECUTED 2012844: d2 27 bf fc st %o1, [ %fp + -4 ] <== NOT EXECUTED count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 2012848: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 201284c: 02 80 00 13 be 2012898 <== NOT EXECUTED 2012850: ba 10 20 00 clr %i5 <== NOT EXECUTED { rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2012854: 10 80 00 06 b 201286c <== NOT EXECUTED 2012858: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED cur_cln = fat_fd->cln; count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 201285c: 80 a7 40 1c cmp %i5, %i4 <== NOT EXECUTED 2012860: 02 80 00 0e be 2012898 <== NOT EXECUTED 2012864: d2 07 bf fc ld [ %fp + -4 ], %o1 <== NOT EXECUTED { rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2012868: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201286c: 40 00 22 4f call 201b1a8 <== NOT EXECUTED 2012870: 94 07 bf fc add %fp, -4, %o2 <== NOT EXECUTED if ( rc != RC_OK ) 2012874: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2012878: 22 bf ff f9 be,a 201285c <== NOT EXECUTED 201287c: ba 07 60 01 inc %i5 <== NOT EXECUTED return rc; 2012880: b1 3a 20 1f sra %o0, 0x1f, %i0 <== NOT EXECUTED 2012884: 81 c7 e0 08 ret <== NOT EXECUTED 2012888: 93 e8 00 08 restore %g0, %o0, %o1 <== NOT EXECUTED uint32_t i; if (file_cln > fat_fd->map.file_cln) { cur_cln = fat_fd->map.disk_cln; count = file_cln - fat_fd->map.file_cln; 201288c: b8 26 80 1c sub %i2, %i4, %i4 <== NOT EXECUTED uint32_t count; uint32_t i; if (file_cln > fat_fd->map.file_cln) { cur_cln = fat_fd->map.disk_cln; 2012890: 10 bf ff ee b 2012848 <== NOT EXECUTED 2012894: d2 27 bf fc st %o1, [ %fp + -4 ] <== NOT EXECUTED if ( rc != RC_OK ) return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; 2012898: f4 26 60 34 st %i2, [ %i1 + 0x34 ] <== NOT EXECUTED fat_fd->map.disk_cln = cur_cln; 201289c: d2 26 60 38 st %o1, [ %i1 + 0x38 ] <== NOT EXECUTED *disk_cln = cur_cln; 20128a0: d2 26 c0 00 st %o1, [ %i3 ] <== NOT EXECUTED } return RC_OK; 20128a4: b0 10 20 00 clr %i0 <== NOT EXECUTED } 20128a8: 81 c7 e0 08 ret <== NOT EXECUTED 20128ac: 93 e8 20 00 restore %g0, 0, %o1 <== NOT EXECUTED fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; 20128b0: b0 10 20 00 clr %i0 ) { int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) *disk_cln = fat_fd->map.disk_cln; 20128b4: c2 26 c0 00 st %g1, [ %i3 ] fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; 20128b8: 81 c7 e0 08 ret 20128bc: 93 e8 20 00 restore %g0, 0, %o1 =============================================================================== 020134a0 : void fat_file_mark_removed( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd ) { 20134a0: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED 20134a4: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; 20134a8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 <== NOT EXECUTED uint32_t cln ) { fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) 20134ac: 80 a0 60 01 cmp %g1, 1 <== NOT EXECUTED 20134b0: 02 80 00 0c be 20134e0 <== NOT EXECUTED 20134b4: 86 10 20 01 mov 1, %g3 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20134b8: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20134bc: 32 80 00 1f bne,a 2013538 <== NOT EXECUTED 20134c0: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED 20134c4: c4 0f 60 0a ldub [ %i5 + 0xa ], %g2 <== NOT EXECUTED 20134c8: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 20134cc: 22 80 00 1b be,a 2013538 <== NOT EXECUTED 20134d0: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20134d4: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(mt_entry, cln) << 20134d8: c4 0f 60 03 ldub [ %i5 + 3 ], %g2 <== NOT EXECUTED 20134dc: 87 28 c0 02 sll %g3, %g2, %g3 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20134e0: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 <== NOT EXECUTED 20134e4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 20134e8: b9 30 a0 09 srl %g2, 9, %i4 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 20134ec: 85 30 a0 05 srl %g2, 5, %g2 <== NOT EXECUTED static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 20134f0: 86 00 c0 1c add %g3, %i4, %g3 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 20134f4: 84 08 a0 0f and %g2, 0xf, %g2 <== NOT EXECUTED fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20134f8: b9 28 e0 04 sll %g3, 4, %i4 <== NOT EXECUTED 20134fc: 7f ff de 93 call 200af48 <_Chain_Extract> <== NOT EXECUTED 2013500: b8 07 00 02 add %i4, %g2, %i4 <== NOT EXECUTED */ static inline void _hash_insert(rtems_chain_control *hash, uint32_t key1, uint32_t key2, fat_file_fd_t *el) { rtems_chain_append((hash) + ((key1) % FAT_HASH_MODULE), &(el)->link); 2013504: d0 07 60 6c ld [ %i5 + 0x6c ], %o0 <== NOT EXECUTED 2013508: b8 0f 20 01 and %i4, 1, %i4 <== NOT EXECUTED 201350c: 83 2f 20 02 sll %i4, 2, %g1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void rtems_chain_append( rtems_chain_control *the_chain, rtems_chain_node *the_node ) { _Chain_Append( the_chain, the_node ); 2013510: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2013514: b9 2f 20 04 sll %i4, 4, %i4 <== NOT EXECUTED 2013518: b8 27 00 01 sub %i4, %g1, %i4 <== NOT EXECUTED 201351c: 7f ff de 80 call 200af1c <_Chain_Append> <== NOT EXECUTED 2013520: 90 02 00 1c add %o0, %i4, %o0 <== NOT EXECUTED _hash_delete(fs_info->vhash, key, fat_fd->ino, fat_fd); _hash_insert(fs_info->rhash, key, fat_fd->ino, fat_fd); fat_fd->flags |= FAT_FILE_REMOVED; 2013524: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 <== NOT EXECUTED 2013528: 82 10 60 01 or %g1, 1, %g1 <== NOT EXECUTED 201352c: c2 2e 60 30 stb %g1, [ %i1 + 0x30 ] <== NOT EXECUTED } 2013530: 81 c7 e0 08 ret <== NOT EXECUTED 2013534: 81 e8 00 00 restore <== NOT EXECUTED register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013538: c4 07 60 30 ld [ %i5 + 0x30 ], %g2 <== NOT EXECUTED 201353c: 82 00 7f fe add %g1, -2, %g1 <== NOT EXECUTED 2013540: 87 28 40 03 sll %g1, %g3, %g3 <== NOT EXECUTED 2013544: 10 bf ff e5 b 20134d8 <== NOT EXECUTED 2013548: 86 00 c0 02 add %g3, %g2, %g3 <== NOT EXECUTED =============================================================================== 020128c0 : fat_file_open( rtems_filesystem_mount_table_entry_t *mt_entry, fat_dir_pos_t *dir_pos, fat_file_fd_t **fat_fd ) { 20128c0: 9d e3 bf a0 save %sp, -96, %sp static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 20128c4: c2 06 40 00 ld [ %i1 ], %g1 int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 20128c8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 uint32_t cln ) { fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) 20128cc: 80 a0 60 01 cmp %g1, 1 20128d0: 02 80 00 0c be 2012900 20128d4: 84 10 20 01 mov 1, %g2 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20128d8: 80 a0 60 00 cmp %g1, 0 20128dc: 32 80 00 7d bne,a 2012ad0 20128e0: c4 0f 60 05 ldub [ %i5 + 5 ], %g2 20128e4: c4 0f 60 0a ldub [ %i5 + 0xa ], %g2 20128e8: 80 88 a0 03 btst 3, %g2 20128ec: 22 80 00 79 be,a 2012ad0 <== NEVER TAKEN 20128f0: c4 0f 60 05 ldub [ %i5 + 5 ], %g2 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20128f4: c4 07 60 1c ld [ %i5 + 0x1c ], %g2 fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(mt_entry, cln) << 20128f8: c6 0f 60 03 ldub [ %i5 + 3 ], %g3 20128fc: 85 28 80 03 sll %g2, %g3, %g2 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012900: c2 06 60 04 ld [ %i1 + 4 ], %g1 uint32_t key2, fat_file_fd_t **ret ) { uint32_t mod = (key1) % FAT_HASH_MODULE; rtems_chain_node *the_node = rtems_chain_first(hash + mod); 2012904: de 07 60 68 ld [ %i5 + 0x68 ], %o7 2012908: b9 30 60 09 srl %g1, 9, %i4 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 201290c: 83 30 60 05 srl %g1, 5, %g1 2012910: 82 08 60 0f and %g1, 0xf, %g1 static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 2012914: 84 00 80 1c add %g2, %i4, %g2 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012918: b9 28 a0 04 sll %g2, 4, %i4 static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 201291c: b8 07 00 01 add %i4, %g1, %i4 uint32_t key1, uint32_t key2, fat_file_fd_t **ret ) { uint32_t mod = (key1) % FAT_HASH_MODULE; 2012920: 82 0f 20 01 and %i4, 1, %g1 rtems_chain_node *the_node = rtems_chain_first(hash + mod); 2012924: 85 28 60 02 sll %g1, 2, %g2 2012928: a1 28 60 04 sll %g1, 4, %l0 201292c: a0 24 00 02 sub %l0, %g2, %l0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2012930: c2 03 c0 10 ld [ %o7 + %l0 ], %g1 2012934: 9e 03 c0 10 add %o7, %l0, %o7 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 2012938: 9e 03 e0 04 add %o7, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 201293c: 80 a0 40 0f cmp %g1, %o7 2012940: 22 80 00 1f be,a 20129bc 2012944: c4 07 60 6c ld [ %i5 + 0x6c ], %g2 2012948: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 uint32_t cln ) { fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) 201294c: 80 a0 a0 01 cmp %g2, 1 2012950: 02 80 00 0c be 2012980 2012954: 88 10 20 01 mov 1, %g4 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012958: 80 a0 a0 00 cmp %g2, 0 201295c: 32 80 00 62 bne,a 2012ae4 2012960: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 2012964: c6 0f 60 0a ldub [ %i5 + 0xa ], %g3 2012968: 80 88 e0 03 btst 3, %g3 201296c: 22 80 00 5e be,a 2012ae4 <== NEVER TAKEN 2012970: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012974: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(mt_entry, cln) << 2012978: c6 0f 60 03 ldub [ %i5 + 3 ], %g3 201297c: 89 29 00 03 sll %g4, %g3, %g4 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012980: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 2012984: b7 30 e0 09 srl %g3, 9, %i3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012988: 85 30 e0 05 srl %g3, 5, %g2 static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 201298c: 88 01 00 1b add %g4, %i3, %g4 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012990: 84 08 a0 0f and %g2, 0xf, %g2 fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012994: 87 29 20 04 sll %g4, 4, %g3 static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 2012998: 86 00 c0 02 add %g3, %g2, %g3 { fat_file_fd_t *ffd = (fat_file_fd_t *)the_node; uint32_t ck = fat_construct_key(mt_entry, &ffd->dir_pos.sname); if ( (key1) == ck) 201299c: 80 a7 00 03 cmp %i4, %g3 20129a0: 22 80 00 56 be,a 2012af8 20129a4: c4 00 60 08 ld [ %g1 + 8 ], %g2 { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 20129a8: c2 00 40 00 ld [ %g1 ], %g1 ) { uint32_t mod = (key1) % FAT_HASH_MODULE; rtems_chain_node *the_node = rtems_chain_first(hash + mod); for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 20129ac: 80 a0 40 0f cmp %g1, %o7 20129b0: 32 bf ff e7 bne,a 201294c 20129b4: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 uint32_t key2, fat_file_fd_t **ret ) { uint32_t mod = (key1) % FAT_HASH_MODULE; rtems_chain_node *the_node = rtems_chain_first(hash + mod); 20129b8: c4 07 60 6c ld [ %i5 + 0x6c ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 20129bc: c2 00 80 10 ld [ %g2 + %l0 ], %g1 20129c0: 84 00 80 10 add %g2, %l0, %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 20129c4: 9e 00 a0 04 add %g2, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 20129c8: 80 a0 40 0f cmp %g1, %o7 20129cc: 02 80 00 1f be 2012a48 <== ALWAYS TAKEN 20129d0: a2 10 3f ff mov -1, %l1 20129d4: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED uint32_t cln ) { fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) 20129d8: 80 a0 a0 01 cmp %g2, 1 <== NOT EXECUTED 20129dc: 02 80 00 0c be 2012a0c <== NOT EXECUTED 20129e0: 88 10 20 01 mov 1, %g4 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20129e4: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 20129e8: 32 80 00 49 bne,a 2012b0c <== NOT EXECUTED 20129ec: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 <== NOT EXECUTED 20129f0: c6 0f 60 0a ldub [ %i5 + 0xa ], %g3 <== NOT EXECUTED 20129f4: 80 88 e0 03 btst 3, %g3 <== NOT EXECUTED 20129f8: 22 80 00 45 be,a 2012b0c <== NOT EXECUTED 20129fc: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012a00: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(mt_entry, cln) << 2012a04: c6 0f 60 03 ldub [ %i5 + 3 ], %g3 <== NOT EXECUTED 2012a08: 89 29 00 03 sll %g4, %g3, %g4 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012a0c: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 <== NOT EXECUTED 2012a10: b7 30 e0 09 srl %g3, 9, %i3 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012a14: 85 30 e0 05 srl %g3, 5, %g2 <== NOT EXECUTED static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 2012a18: 88 01 00 1b add %g4, %i3, %g4 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012a1c: 84 08 a0 0f and %g2, 0xf, %g2 <== NOT EXECUTED fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012a20: 87 29 20 04 sll %g4, 4, %g3 <== NOT EXECUTED static inline uint32_t fat_construct_key( rtems_filesystem_mount_table_entry_t *mt_entry, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(mt_entry, pos->cln) + 2012a24: 86 00 c0 02 add %g3, %g2, %g3 <== NOT EXECUTED { fat_file_fd_t *ffd = (fat_file_fd_t *)the_node; uint32_t ck = fat_construct_key(mt_entry, &ffd->dir_pos.sname); if ( (key1) == ck) 2012a28: 80 a7 00 03 cmp %i4, %g3 <== NOT EXECUTED 2012a2c: 02 80 00 3d be 2012b20 <== NOT EXECUTED 2012a30: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2012a34: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED ) { uint32_t mod = (key1) % FAT_HASH_MODULE; rtems_chain_node *the_node = rtems_chain_first(hash + mod); for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2012a38: 80 a0 40 0f cmp %g1, %o7 <== NOT EXECUTED 2012a3c: 32 bf ff e7 bne,a 20129d8 <== NOT EXECUTED 2012a40: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED return 0; } } the_node = the_node->next; } return -1; 2012a44: a2 10 3f ff mov -1, %l1 <== NOT EXECUTED } /* access "removed-but-still-open" hash table */ rc = _hash_search(mt_entry, fs_info->rhash, key, key, &lfat_fd); lfat_fd = (*fat_fd) = (fat_file_fd_t*)malloc(sizeof(fat_file_fd_t)); 2012a48: 7f ff ce 34 call 2006318 2012a4c: 90 10 20 44 mov 0x44, %o0 2012a50: d0 26 80 00 st %o0, [ %i2 ] if ( lfat_fd == NULL ) 2012a54: 80 a2 20 00 cmp %o0, 0 2012a58: 02 80 00 40 be 2012b58 <== NEVER TAKEN 2012a5c: b6 10 00 08 mov %o0, %i3 rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); 2012a60: 92 10 20 00 clr %o1 2012a64: 40 00 2c 3d call 201db58 2012a68: 94 10 20 44 mov 0x44, %o2 lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; 2012a6c: de 0e e0 30 ldub [ %i3 + 0x30 ], %o7 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 2012a70: c8 06 40 00 ld [ %i1 ], %g4 2012a74: c6 06 60 04 ld [ %i1 + 4 ], %g3 2012a78: c4 06 60 08 ld [ %i1 + 8 ], %g2 2012a7c: c2 06 60 0c ld [ %i1 + 0xc ], %g1 rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; 2012a80: b2 0b ff fe and %o7, -2, %i1 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 2012a84: c8 26 e0 20 st %g4, [ %i3 + 0x20 ] if ( lfat_fd == NULL ) rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); lfat_fd->links_num = 1; 2012a88: 9e 10 20 01 mov 1, %o7 lfat_fd->flags &= ~FAT_FILE_REMOVED; 2012a8c: f2 2e e0 30 stb %i1, [ %i3 + 0x30 ] if ( lfat_fd == NULL ) rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); lfat_fd->links_num = 1; 2012a90: de 26 e0 08 st %o7, [ %i3 + 8 ] lfat_fd->flags &= ~FAT_FILE_REMOVED; lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; 2012a94: b2 10 3f ff mov -1, %i1 lfat_fd->dir_pos = *dir_pos; 2012a98: c6 26 e0 24 st %g3, [ %i3 + 0x24 ] memset(lfat_fd, 0, sizeof(fat_file_fd_t)); lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; 2012a9c: f2 26 e0 3c st %i1, [ %i3 + 0x3c ] lfat_fd->dir_pos = *dir_pos; 2012aa0: c4 26 e0 28 st %g2, [ %i3 + 0x28 ] if ( rc != RC_OK ) 2012aa4: 80 a4 60 00 cmp %l1, 0 2012aa8: 02 80 00 25 be 2012b3c <== NEVER TAKEN 2012aac: c2 26 e0 2c st %g1, [ %i3 + 0x2c ] lfat_fd->ino = key; 2012ab0: f8 26 e0 0c st %i4, [ %i3 + 0xc ] */ static inline void _hash_insert(rtems_chain_control *hash, uint32_t key1, uint32_t key2, fat_file_fd_t *el) { rtems_chain_append((hash) + ((key1) % FAT_HASH_MODULE), &(el)->link); 2012ab4: d0 07 60 68 ld [ %i5 + 0x68 ], %o0 2012ab8: 92 10 00 1b mov %i3, %o1 2012abc: 90 02 00 10 add %o0, %l0, %o0 2012ac0: 7f ff e1 17 call 200af1c <_Chain_Append> 2012ac4: b0 10 20 00 clr %i0 * other fields of fat-file descriptor will be initialized on upper * level */ return RC_OK; } 2012ac8: 81 c7 e0 08 ret 2012acc: 81 e8 00 00 restore register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012ad0: c6 07 60 30 ld [ %i5 + 0x30 ], %g3 2012ad4: 82 00 7f fe add %g1, -2, %g1 2012ad8: 85 28 40 02 sll %g1, %g2, %g2 2012adc: 10 bf ff 87 b 20128f8 2012ae0: 84 00 80 03 add %g2, %g3, %g2 2012ae4: c6 07 60 30 ld [ %i5 + 0x30 ], %g3 2012ae8: 84 00 bf fe add %g2, -2, %g2 2012aec: 89 28 80 04 sll %g2, %g4, %g4 2012af0: 10 bf ff a2 b 2012978 2012af4: 88 01 00 03 add %g4, %g3, %g4 /* access "valid" hash table */ rc = _hash_search(mt_entry, fs_info->vhash, key, 0, &lfat_fd); if ( rc == RC_OK ) { /* return pointer to fat_file_descriptor allocated before */ (*fat_fd) = lfat_fd; 2012af8: c2 26 80 00 st %g1, [ %i2 ] lfat_fd->links_num++; 2012afc: 84 00 a0 01 inc %g2 2012b00: c4 20 60 08 st %g2, [ %g1 + 8 ] return rc; 2012b04: 81 c7 e0 08 ret 2012b08: 91 e8 20 00 restore %g0, 0, %o0 2012b0c: c6 07 60 30 ld [ %i5 + 0x30 ], %g3 <== NOT EXECUTED 2012b10: 84 00 bf fe add %g2, -2, %g2 <== NOT EXECUTED 2012b14: 89 28 80 04 sll %g2, %g4, %g4 <== NOT EXECUTED 2012b18: 10 bf ff bb b 2012a04 <== NOT EXECUTED 2012b1c: 88 01 00 03 add %g4, %g3, %g4 <== NOT EXECUTED fat_file_fd_t *ffd = (fat_file_fd_t *)the_node; uint32_t ck = fat_construct_key(mt_entry, &ffd->dir_pos.sname); if ( (key1) == ck) { if ( ((key2) == 0) || ((key2) == ffd->ino) ) 2012b20: 02 bf ff ca be 2012a48 <== NOT EXECUTED 2012b24: a2 10 20 00 clr %l1 <== NOT EXECUTED 2012b28: c4 00 60 0c ld [ %g1 + 0xc ], %g2 <== NOT EXECUTED 2012b2c: 80 a7 00 02 cmp %i4, %g2 <== NOT EXECUTED 2012b30: 32 bf ff c2 bne,a 2012a38 <== NOT EXECUTED 2012b34: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2012b38: 30 bf ff c4 b,a 2012a48 <== NOT EXECUTED if ( rc != RC_OK ) lfat_fd->ino = key; else { lfat_fd->ino = fat_get_unique_ino(mt_entry); 2012b3c: 40 00 04 9d call 2013db0 <== NOT EXECUTED 2012b40: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( lfat_fd->ino == 0 ) 2012b44: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2012b48: 12 bf ff db bne 2012ab4 <== NOT EXECUTED 2012b4c: d0 26 e0 0c st %o0, [ %i3 + 0xc ] <== NOT EXECUTED { free((*fat_fd)); 2012b50: 7f ff cc 22 call 2005bd8 <== NOT EXECUTED 2012b54: d0 06 80 00 ld [ %i2 ], %o0 <== NOT EXECUTED /* * XXX: kernel resource is unsufficient, but not the memory, * but there is no suitable errno :( */ rtems_set_errno_and_return_minus_one( ENOMEM ); 2012b58: 40 00 28 f5 call 201cf2c <__errno> <== NOT EXECUTED 2012b5c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012b60: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2012b64: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2012b68: 81 c7 e0 08 ret <== NOT EXECUTED 2012b6c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02012b88 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2012b88: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t ret = 0; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cmpltd = 0; uint32_t cur_cln = 0; 2012b8c: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2012b90: ba 10 00 18 mov %i0, %i5 int rc = RC_OK; ssize_t ret = 0; fat_fs_info_t *fs_info = mt_entry->fs_info; 2012b94: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; /* it couldn't be removed - otherwise cache update will be broken */ if (count == 0) 2012b98: 80 a6 e0 00 cmp %i3, 0 2012b9c: 02 80 00 7f be 2012d98 <== NEVER TAKEN 2012ba0: b0 10 20 00 clr %i0 /* * >= because start is offset and computed from 0 and file_size * computed from 1 */ if ( start >= fat_fd->fat_file_size ) 2012ba4: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 2012ba8: 80 a0 40 1a cmp %g1, %i2 2012bac: 08 80 00 7b bleu 2012d98 <== NEVER TAKEN 2012bb0: 80 a6 c0 01 cmp %i3, %g1 return FAT_EOF; if ((count > fat_fd->fat_file_size) || 2012bb4: 08 80 00 4c bleu 2012ce4 <== ALWAYS TAKEN 2012bb8: 84 20 40 1b sub %g1, %i3, %g2 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2012bbc: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2012bc0: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2012bc4: 80 a0 60 01 cmp %g1, 1 2012bc8: 22 80 00 4c be,a 2012cf8 2012bcc: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2012bd0: e6 0c 60 08 ldub [ %l1 + 8 ], %l3 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012bd4: e0 14 60 06 lduh [ %l1 + 6 ], %l0 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2012bd8: a7 36 80 13 srl %i2, %l3, %l3 save_ofs = ofs = start & (fs_info->vol.bpc - 1); rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); 2012bdc: 90 10 00 1d mov %i5, %o0 2012be0: 92 10 00 19 mov %i1, %o1 2012be4: 94 10 00 13 mov %l3, %o2 2012be8: 7f ff ff 0e call 2012820 2012bec: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2012bf0: b0 92 60 00 orcc %o1, 0, %i0 2012bf4: 12 80 00 69 bne 2012d98 <== NEVER TAKEN 2012bf8: a1 2c 20 10 sll %l0, 0x10, %l0 return rc; while (count > 0) 2012bfc: a8 10 20 00 clr %l4 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012c00: a1 34 20 10 srl %l0, 0x10, %l0 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012c04: a4 10 20 00 clr %l2 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012c08: a0 04 3f ff add %l0, -1, %l0 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012c0c: 80 a6 e0 00 cmp %i3, 0 2012c10: 02 80 00 5b be 2012d7c <== NEVER TAKEN 2012c14: b4 0e 80 10 and %i2, %l0, %i2 cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) 2012c18: c4 0c 60 02 ldub [ %l1 + 2 ], %g2 2012c1c: d4 14 40 00 lduh [ %l1 ], %o2 return rc; while (count > 0) 2012c20: 10 80 00 20 b 2012ca0 2012c24: 82 10 00 1a mov %i2, %g1 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012c28: f0 08 e0 0a ldub [ %g3 + 0xa ], %i0 <== NOT EXECUTED 2012c2c: 80 8e 20 03 btst 3, %i0 <== NOT EXECUTED 2012c30: 22 80 00 26 be,a 2012cc8 <== NOT EXECUTED 2012c34: f0 08 e0 05 ldub [ %g3 + 5 ], %i0 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012c38: d2 00 e0 1c ld [ %g3 + 0x1c ], %o1 <== NOT EXECUTED { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); 2012c3c: 85 30 40 02 srl %g1, %g2, %g2 byte = ofs & (fs_info->vol.bps - 1); 2012c40: 95 2a a0 10 sll %o2, 0x10, %o2 ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); 2012c44: 98 07 00 12 add %i4, %l2, %o4 { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); 2012c48: 95 32 a0 10 srl %o2, 0x10, %o2 ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); 2012c4c: 92 02 40 02 add %o1, %g2, %o1 { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); 2012c50: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); 2012c54: 96 10 00 10 mov %l0, %o3 2012c58: 94 0a 80 01 and %o2, %g1, %o2 2012c5c: 40 00 03 99 call 2013ac0 <_fat_block_read> 2012c60: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2012c64: 94 07 bf fc add %fp, -4, %o2 sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); if ( ret < 0 ) 2012c68: 80 a2 20 00 cmp %o0, 0 2012c6c: 06 80 00 3c bl 2012d5c <== NEVER TAKEN 2012c70: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; 2012c74: e8 07 bf fc ld [ %fp + -4 ], %l4 ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; count -= c; cmpltd += c; 2012c78: a4 04 80 10 add %l2, %l0, %l2 save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2012c7c: 40 00 21 4b call 201b1a8 2012c80: 92 10 00 14 mov %l4, %o1 if ( rc != RC_OK ) 2012c84: 80 a2 20 00 cmp %o0, 0 2012c88: 12 80 00 15 bne 2012cdc <== NEVER TAKEN 2012c8c: b6 a6 c0 10 subcc %i3, %l0, %i3 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012c90: 02 80 00 3a be 2012d78 <== ALWAYS TAKEN 2012c94: 82 10 20 00 clr %g1 2012c98: c4 0c 60 02 ldub [ %l1 + 2 ], %g2 <== NOT EXECUTED 2012c9c: d4 14 40 00 lduh [ %l1 ], %o2 <== NOT EXECUTED { c = MIN(count, (fs_info->vol.bpc - ofs)); 2012ca0: e0 14 60 06 lduh [ %l1 + 6 ], %l0 2012ca4: a0 24 00 01 sub %l0, %g1, %l0 2012ca8: 80 a4 00 1b cmp %l0, %i3 2012cac: 08 80 00 03 bleu 2012cb8 2012cb0: c8 07 bf fc ld [ %fp + -4 ], %g4 2012cb4: a0 10 00 1b mov %i3, %l0 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012cb8: 80 a1 20 00 cmp %g4, 0 2012cbc: 02 bf ff db be 2012c28 <== NEVER TAKEN 2012cc0: c6 07 60 34 ld [ %i5 + 0x34 ], %g3 return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012cc4: f0 08 e0 05 ldub [ %g3 + 5 ], %i0 2012cc8: c6 00 e0 30 ld [ %g3 + 0x30 ], %g3 2012ccc: 92 01 3f fe add %g4, -2, %o1 2012cd0: 93 2a 40 18 sll %o1, %i0, %o1 2012cd4: 10 bf ff da b 2012c3c 2012cd8: 92 02 40 03 add %o1, %g3, %o1 fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); fat_fd->map.disk_cln = save_cln; return cmpltd; } 2012cdc: 81 c7 e0 08 ret <== NOT EXECUTED 2012ce0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED * computed from 1 */ if ( start >= fat_fd->fat_file_size ) return FAT_EOF; if ((count > fat_fd->fat_file_size) || 2012ce4: 80 a6 80 02 cmp %i2, %g2 2012ce8: 28 bf ff b7 bleu,a 2012bc4 <== ALWAYS TAKEN 2012cec: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2012cf0: 10 bf ff b4 b 2012bc0 <== NOT EXECUTED 2012cf4: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2012cf8: 80 a0 60 00 cmp %g1, 0 2012cfc: 32 bf ff b6 bne,a 2012bd4 <== NEVER TAKEN 2012d00: e6 0c 60 08 ldub [ %l1 + 8 ], %l3 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2012d04: c2 0c 60 0a ldub [ %l1 + 0xa ], %g1 if ((count > fat_fd->fat_file_size) || (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2012d08: 80 88 60 03 btst 3, %g1 2012d0c: 22 bf ff b2 be,a 2012bd4 <== NEVER TAKEN 2012d10: e6 0c 60 08 ldub [ %l1 + 8 ], %l3 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(mt_entry, fat_fd->cln); 2012d14: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012d18: 80 a0 60 00 cmp %g1, 0 2012d1c: 32 80 00 12 bne,a 2012d64 <== NEVER TAKEN 2012d20: c6 0c 60 05 ldub [ %l1 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012d24: d2 04 60 1c ld [ %l1 + 0x1c ], %o1 sec += (start >> fs_info->vol.sec_log2); 2012d28: c2 0c 60 02 ldub [ %l1 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 2012d2c: d4 14 40 00 lduh [ %l1 ], %o2 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(mt_entry, fat_fd->cln); sec += (start >> fs_info->vol.sec_log2); 2012d30: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 2012d34: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_read(mt_entry, sec, byte, count, buf); 2012d38: 90 10 00 1d mov %i5, %o0 2012d3c: 92 02 40 01 add %o1, %g1, %o1 2012d40: 94 0e 80 0a and %i2, %o2, %o2 2012d44: 96 10 00 1b mov %i3, %o3 2012d48: 40 00 03 5e call 2013ac0 <_fat_block_read> 2012d4c: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 2012d50: b0 92 20 00 orcc %o0, 0, %i0 2012d54: 16 80 00 11 bge 2012d98 <== ALWAYS TAKEN 2012d58: 01 00 00 00 nop sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_read(mt_entry, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; 2012d5c: 81 c7 e0 08 ret <== NOT EXECUTED 2012d60: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012d64: c4 04 60 30 ld [ %l1 + 0x30 ], %g2 <== NOT EXECUTED 2012d68: 92 00 7f fe add %g1, -2, %o1 <== NOT EXECUTED 2012d6c: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 2012d70: 10 bf ff ee b 2012d28 <== NOT EXECUTED 2012d74: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; ofs = 0; 2012d78: b0 10 00 12 mov %l2, %i0 } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); 2012d7c: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 2012d80: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2012d84: e8 26 60 38 st %l4, [ %i1 + 0x38 ] } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); 2012d88: a4 06 80 12 add %i2, %l2, %l2 2012d8c: a5 34 80 01 srl %l2, %g1, %l2 ofs = 0; } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + 2012d90: a6 04 80 13 add %l2, %l3, %l3 2012d94: e6 26 60 34 st %l3, [ %i1 + 0x34 ] ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); fat_fd->map.disk_cln = save_cln; return cmpltd; 2012d98: 81 c7 e0 08 ret 2012d9c: 81 e8 00 00 restore =============================================================================== 02013668 : int fat_file_size( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd ) { 2013668: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; 201366c: fa 06 60 1c ld [ %i1 + 0x1c ], %i5 uint32_t save_cln = 0; /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013670: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 fat_file_fd_t *fat_fd ) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; 2013674: fa 27 bf fc st %i5, [ %fp + -4 ] int fat_file_size( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd ) { 2013678: b6 10 00 18 mov %i0, %i3 fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; uint32_t save_cln = 0; /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 201367c: 80 a0 60 01 cmp %g1, 1 2013680: 02 80 00 21 be 2013704 <== NEVER TAKEN 2013684: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2013688: c4 07 20 0c ld [ %i4 + 0xc ], %g2 201368c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2013690: 84 0f 40 02 and %i5, %g2, %g2 2013694: 80 a0 80 01 cmp %g2, %g1 2013698: 0a 80 00 0e bcs 20136d0 <== ALWAYS TAKEN 201369c: c0 26 60 18 clr [ %i1 + 0x18 ] ) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; uint32_t save_cln = 0; 20136a0: 10 80 00 15 b 20136f4 <== NOT EXECUTED 20136a4: ba 10 20 00 clr %i5 <== NOT EXECUTED save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; 20136a8: de 06 60 18 ld [ %i1 + 0x18 ], %o7 return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 20136ac: c6 07 20 0c ld [ %i4 + 0xc ], %g3 20136b0: c4 07 20 10 ld [ %i4 + 0x10 ], %g2 20136b4: c2 07 bf fc ld [ %fp + -4 ], %g1 save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; 20136b8: 88 03 c0 04 add %o7, %g4, %g4 return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 20136bc: 86 08 40 03 and %g1, %g3, %g3 20136c0: 80 a0 c0 02 cmp %g3, %g2 20136c4: 1a 80 00 0c bcc 20136f4 <== ALWAYS TAKEN 20136c8: c8 26 60 18 st %g4, [ %i1 + 0x18 ] 20136cc: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED { save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 20136d0: 92 10 00 1d mov %i5, %o1 20136d4: 90 10 00 1b mov %i3, %o0 20136d8: 40 00 1e b4 call 201b1a8 20136dc: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 20136e0: 80 a2 20 00 cmp %o0, 0 20136e4: 22 bf ff f1 be,a 20136a8 <== ALWAYS TAKEN 20136e8: c8 17 20 06 lduh [ %i4 + 6 ], %g4 fat_fd->fat_file_size += fs_info->vol.bpc; } fat_fd->map.last_cln = save_cln; return rc; } 20136ec: 81 c7 e0 08 ret <== NOT EXECUTED 20136f0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED return rc; fat_fd->fat_file_size += fs_info->vol.bpc; } fat_fd->map.last_cln = save_cln; return rc; 20136f4: 90 10 20 00 clr %o0 if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; } fat_fd->map.last_cln = save_cln; 20136f8: fa 26 60 3c st %i5, [ %i1 + 0x3c ] return rc; } 20136fc: 81 c7 e0 08 ret 2013700: 91 e8 00 08 restore %g0, %o0, %o0 fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; uint32_t save_cln = 0; /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013704: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 <== NOT EXECUTED 2013708: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 201370c: 32 bf ff e0 bne,a 201368c <== NOT EXECUTED 2013710: c4 07 20 0c ld [ %i4 + 0xc ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2013714: c2 0f 20 0a ldub [ %i4 + 0xa ], %g1 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = fat_fd->cln; uint32_t save_cln = 0; /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013718: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 201371c: 22 bf ff dc be,a 201368c <== NOT EXECUTED 2013720: c4 07 20 0c ld [ %i4 + 0xc ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { fat_fd->fat_file_size = fs_info->vol.rdir_size; 2013724: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 <== NOT EXECUTED return rc; 2013728: 90 10 20 00 clr %o0 <== NOT EXECUTED 201372c: 10 bf ff f0 b 20136ec <== NOT EXECUTED 2013730: c2 26 60 18 st %g1, [ %i1 + 0x18 ] <== NOT EXECUTED =============================================================================== 02012da0 : fat_file_truncate( rtems_filesystem_mount_table_entry_t *mt_entry, fat_file_fd_t *fat_fd, uint32_t new_length ) { 2012da0: 9d e3 bf 98 save %sp, -104, %sp uint32_t cur_cln = 0; uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; if ( new_length >= fat_fd->fat_file_size ) 2012da4: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = 0; uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; 2012da8: 84 10 3f ff mov -1, %g2 uint32_t new_length ) { int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = 0; 2012dac: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; 2012db0: c4 27 bf fc st %g2, [ %fp + -4 ] if ( new_length >= fat_fd->fat_file_size ) 2012db4: 80 a0 40 1a cmp %g1, %i2 2012db8: 08 80 00 21 bleu 2012e3c <== NEVER TAKEN 2012dbc: c4 06 20 34 ld [ %i0 + 0x34 ], %g2 return rc; assert(fat_fd->fat_file_size); 2012dc0: 80 a0 60 00 cmp %g1, 0 2012dc4: 02 80 00 33 be 2012e90 <== NEVER TAKEN 2012dc8: 11 00 80 b2 sethi %hi(0x202c800), %o0 cl_start = (new_length + fs_info->vol.bpc - 1) >> fs_info->vol.bpc_log2; 2012dcc: c6 08 a0 08 ldub [ %g2 + 8 ], %g3 2012dd0: c4 10 a0 06 lduh [ %g2 + 6 ], %g2 2012dd4: 84 00 bf ff add %g2, -1, %g2 2012dd8: b4 00 80 1a add %g2, %i2, %i2 2012ddc: b5 36 80 03 srl %i2, %g3, %i2 if ((cl_start << fs_info->vol.bpc_log2) >= fat_fd->fat_file_size) 2012de0: 87 2e 80 03 sll %i2, %g3, %g3 2012de4: 80 a0 40 03 cmp %g1, %g3 2012de8: 08 80 00 13 bleu 2012e34 <== NEVER TAKEN 2012dec: 92 10 20 00 clr %o1 return RC_OK; if (cl_start != 0) 2012df0: 80 a6 a0 00 cmp %i2, 0 2012df4: 02 80 00 09 be 2012e18 <== ALWAYS TAKEN 2012df8: 90 10 00 18 mov %i0, %o0 { rc = fat_file_lseek(mt_entry, fat_fd, cl_start - 1, &new_last_cln); 2012dfc: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2012e00: 94 06 bf ff add %i2, -1, %o2 <== NOT EXECUTED 2012e04: 7f ff fe 87 call 2012820 <== NOT EXECUTED 2012e08: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED if (rc != RC_OK) 2012e0c: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2012e10: 12 80 00 09 bne 2012e34 <== NOT EXECUTED 2012e14: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return rc; } rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); 2012e18: 92 10 00 19 mov %i1, %o1 2012e1c: 94 10 00 1a mov %i2, %o2 2012e20: 7f ff fe 80 call 2012820 2012e24: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 2012e28: 80 a2 60 00 cmp %o1, 0 2012e2c: 22 80 00 07 be,a 2012e48 <== ALWAYS TAKEN 2012e30: d2 07 bf f8 ld [ %fp + -8 ], %o1 fat_fd->map.file_cln = cl_start - 1; fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; } return RC_OK; } 2012e34: 81 c7 e0 08 ret 2012e38: 91 e8 00 09 restore %g0, %o1, %o0 uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; if ( new_length >= fat_fd->fat_file_size ) return rc; 2012e3c: 92 10 20 00 clr %o1 <== NOT EXECUTED fat_fd->map.file_cln = cl_start - 1; fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; } return RC_OK; } 2012e40: 81 c7 e0 08 ret <== NOT EXECUTED 2012e44: 91 e8 00 09 restore %g0, %o1, %o0 <== NOT EXECUTED rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; rc = fat_free_fat_clusters_chain(mt_entry, cur_cln); 2012e48: 40 00 22 22 call 201b6d0 2012e4c: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) 2012e50: 92 92 20 00 orcc %o0, 0, %o1 2012e54: 12 bf ff f8 bne 2012e34 <== NEVER TAKEN 2012e58: 80 a6 a0 00 cmp %i2, 0 return rc; if (cl_start != 0) 2012e5c: 02 bf ff f6 be 2012e34 <== ALWAYS TAKEN 2012e60: 90 10 00 18 mov %i0, %o0 { rc = fat_set_fat_cluster(mt_entry, new_last_cln, FAT_GENFAT_EOC); 2012e64: d2 07 bf fc ld [ %fp + -4 ], %o1 <== NOT EXECUTED 2012e68: 40 00 21 58 call 201b3c8 <== NOT EXECUTED 2012e6c: 94 10 3f ff mov -1, %o2 <== NOT EXECUTED if ( rc != RC_OK ) 2012e70: 92 92 20 00 orcc %o0, 0, %o1 <== NOT EXECUTED 2012e74: 12 bf ff f0 bne 2012e34 <== NOT EXECUTED 2012e78: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED return rc; fat_fd->map.file_cln = cl_start - 1; 2012e7c: b4 06 bf ff add %i2, -1, %i2 <== NOT EXECUTED fat_fd->map.disk_cln = new_last_cln; 2012e80: c2 26 60 38 st %g1, [ %i1 + 0x38 ] <== NOT EXECUTED if (cl_start != 0) { rc = fat_set_fat_cluster(mt_entry, new_last_cln, FAT_GENFAT_EOC); if ( rc != RC_OK ) return rc; fat_fd->map.file_cln = cl_start - 1; 2012e84: f4 26 60 34 st %i2, [ %i1 + 0x34 ] <== NOT EXECUTED fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; 2012e88: 10 bf ff eb b 2012e34 <== NOT EXECUTED 2012e8c: c2 26 60 3c st %g1, [ %i1 + 0x3c ] <== NOT EXECUTED if ( new_length >= fat_fd->fat_file_size ) return rc; assert(fat_fd->fat_file_size); 2012e90: 15 00 80 b2 sethi %hi(0x202c800), %o2 <== NOT EXECUTED 2012e94: 17 00 80 b2 sethi %hi(0x202c800), %o3 <== NOT EXECUTED 2012e98: 90 12 22 c8 or %o0, 0x2c8, %o0 <== NOT EXECUTED 2012e9c: 92 10 22 6d mov 0x26d, %o1 <== NOT EXECUTED 2012ea0: 94 12 a3 28 or %o2, 0x328, %o2 <== NOT EXECUTED 2012ea4: 40 00 0a d7 call 2015a00 <__assert_func> <== NOT EXECUTED 2012ea8: 96 12 e3 10 or %o3, 0x310, %o3 <== NOT EXECUTED =============================================================================== 02013238 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 2013238: 9d e3 bf 98 save %sp, -104, %sp int rc = 0; ssize_t ret = 0; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cmpltd = 0; uint32_t cur_cln = 0; 201323c: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cl_start = 0; uint32_t ofs = 0; uint32_t save_ofs; uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; 2013240: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 2013244: ba 10 00 18 mov %i0, %i5 int rc = 0; ssize_t ret = 0; fat_fs_info_t *fs_info = mt_entry->fs_info; 2013248: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 uint32_t save_ofs; uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; if ( count == 0 ) 201324c: 80 a6 e0 00 cmp %i3, 0 2013250: 02 80 00 82 be 2013458 <== NEVER TAKEN 2013254: b0 10 20 00 clr %i0 return cmpltd; if ( start > fat_fd->fat_file_size ) 2013258: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 201325c: 80 a0 40 1a cmp %g1, %i2 2013260: 0a 80 00 7a bcs 2013448 <== NEVER TAKEN 2013264: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EIO ); if ((count > fat_fd->size_limit) || 2013268: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 201326c: 80 a6 c0 01 cmp %i3, %g1 2013270: 18 80 00 76 bgu 2013448 <== NEVER TAKEN 2013274: 82 20 40 1b sub %g1, %i3, %g1 2013278: 80 a6 80 01 cmp %i2, %g1 201327c: 18 80 00 73 bgu 2013448 <== NEVER TAKEN 2013280: a2 06 c0 1a add %i3, %i2, %l1 (start > fat_fd->size_limit - count)) rtems_set_errno_and_return_minus_one( EIO ); rc = fat_file_extend(mt_entry, fat_fd, start + count, &c); 2013284: 90 10 00 1d mov %i5, %o0 2013288: 92 10 00 19 mov %i1, %o1 201328c: 94 10 00 11 mov %l1, %o2 2013290: 7f ff ff 71 call 2013054 2013294: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2013298: b0 92 20 00 orcc %o0, 0, %i0 201329c: 12 80 00 6f bne 2013458 <== NEVER TAKEN 20132a0: c2 07 bf fc ld [ %fp + -4 ], %g1 /* * check whether there was enough room on device to locate * file of 'start + count' bytes */ if (c != (start + count)) 20132a4: 80 a4 40 01 cmp %l1, %g1 20132a8: 32 80 00 02 bne,a 20132b0 <== NEVER TAKEN 20132ac: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20132b0: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 20132b4: 80 a0 60 01 cmp %g1, 1 20132b8: 22 80 00 45 be,a 20133cc 20132bc: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 20132c0: e4 0c 20 08 ldub [ %l0 + 8 ], %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 20132c4: e2 14 20 06 lduh [ %l0 + 6 ], %l1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 20132c8: a5 36 80 12 srl %i2, %l2, %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); 20132cc: 90 10 00 1d mov %i5, %o0 20132d0: 92 10 00 19 mov %i1, %o1 20132d4: 94 10 00 12 mov %l2, %o2 20132d8: 7f ff fd 52 call 2012820 20132dc: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 20132e0: b0 92 60 00 orcc %o1, 0, %i0 20132e4: 12 80 00 5d bne 2013458 <== NEVER TAKEN 20132e8: 83 2c 60 10 sll %l1, 0x10, %g1 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 20132ec: 83 30 60 10 srl %g1, 0x10, %g1 20132f0: 82 00 7f ff add %g1, -1, %g1 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 20132f4: a2 10 20 00 clr %l1 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 20132f8: b4 0e 80 01 and %i2, %g1, %i2 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 20132fc: a8 10 20 00 clr %l4 2013300: 80 a6 e0 00 cmp %i3, 0 2013304: 12 80 00 20 bne 2013384 <== ALWAYS TAKEN 2013308: 82 10 00 1a mov %i2, %g1 } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); 201330c: 10 80 00 5d b 2013480 <== NOT EXECUTED 2013310: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 <== NOT EXECUTED uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013314: c8 08 a0 0a ldub [ %g2 + 0xa ], %g4 <== NOT EXECUTED 2013318: 80 89 20 03 btst 3, %g4 <== NOT EXECUTED 201331c: 22 80 00 25 be,a 20133b0 <== NOT EXECUTED 2013320: c8 08 a0 05 ldub [ %g2 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013324: d2 00 a0 1c ld [ %g2 + 0x1c ], %o1 <== NOT EXECUTED while (count > 0) { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); 2013328: c4 0c 20 02 ldub [ %l0 + 2 ], %g2 byte = ofs & (fs_info->vol.bps - 1); 201332c: d4 14 00 00 lduh [ %l0 ], %o2 while (count > 0) { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); 2013330: 85 30 40 02 srl %g1, %g2, %g2 byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_write(mt_entry, sec, byte, c, buf + cmpltd); 2013334: 98 07 00 11 add %i4, %l1, %o4 { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); 2013338: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_write(mt_entry, sec, byte, c, buf + cmpltd); 201333c: 92 02 40 02 add %o1, %g2, %o1 2013340: 94 08 40 0a and %g1, %o2, %o2 2013344: 40 00 02 01 call 2013b48 <_fat_block_write> 2013348: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 201334c: 94 07 bf f8 add %fp, -8, %o2 sec = fat_cluster_num_to_sector_num(mt_entry, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_write(mt_entry, sec, byte, c, buf + cmpltd); if ( ret < 0 ) 2013350: 80 a2 20 00 cmp %o0, 0 2013354: 06 80 00 1c bl 20133c4 <== NEVER TAKEN 2013358: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; 201335c: e8 07 bf f8 ld [ %fp + -8 ], %l4 ret = _fat_block_write(mt_entry, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; count -= c; 2013360: e6 07 bf fc ld [ %fp + -4 ], %l3 cmpltd += c; save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2013364: 40 00 1f 91 call 201b1a8 2013368: 92 10 00 14 mov %l4, %o1 if ( rc != RC_OK ) 201336c: b0 92 20 00 orcc %o0, 0, %i0 2013370: 12 80 00 3a bne 2013458 <== NEVER TAKEN 2013374: b6 a6 c0 13 subcc %i3, %l3, %i3 rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2013378: 02 80 00 40 be 2013478 201337c: a2 04 40 13 add %l1, %l3, %l1 save_cln = cur_cln; rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; ofs = 0; 2013380: 82 10 20 00 clr %g1 if (rc != RC_OK) return rc; while (count > 0) { c = MIN(count, (fs_info->vol.bpc - ofs)); 2013384: d6 14 20 06 lduh [ %l0 + 6 ], %o3 2013388: 96 22 c0 01 sub %o3, %g1, %o3 201338c: 80 a2 c0 1b cmp %o3, %i3 2013390: 08 80 00 03 bleu 201339c 2013394: c6 07 bf f8 ld [ %fp + -8 ], %g3 2013398: 96 10 00 1b mov %i3, %o3 201339c: d6 27 bf fc st %o3, [ %fp + -4 ] uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20133a0: 80 a0 e0 00 cmp %g3, 0 20133a4: 02 bf ff dc be 2013314 <== NEVER TAKEN 20133a8: c4 07 60 34 ld [ %i5 + 0x34 ], %g2 return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 20133ac: c8 08 a0 05 ldub [ %g2 + 5 ], %g4 20133b0: c4 00 a0 30 ld [ %g2 + 0x30 ], %g2 20133b4: 92 00 ff fe add %g3, -2, %o1 20133b8: 93 2a 40 04 sll %o1, %g4, %o1 20133bc: 10 bf ff db b 2013328 20133c0: 92 02 40 02 add %o1, %g2, %o1 fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); fat_fd->map.disk_cln = save_cln; return cmpltd; } 20133c4: 81 c7 e0 08 ret <== NOT EXECUTED 20133c8: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED * file of 'start + count' bytes */ if (c != (start + count)) count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20133cc: 80 a0 60 00 cmp %g1, 0 20133d0: 32 bf ff bd bne,a 20132c4 <== NEVER TAKEN 20133d4: e4 0c 20 08 ldub [ %l0 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 20133d8: c2 0c 20 0a ldub [ %l0 + 0xa ], %g1 * file of 'start + count' bytes */ if (c != (start + count)) count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20133dc: 80 88 60 03 btst 3, %g1 20133e0: 22 bf ff b9 be,a 20132c4 <== NEVER TAKEN 20133e4: e4 0c 20 08 ldub [ %l0 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(mt_entry, fat_fd->cln); 20133e8: c4 06 60 1c ld [ %i1 + 0x1c ], %g2 uint32_t cln ) { register fat_fs_info_t *fs_info = mt_entry->fs_info; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20133ec: 80 a0 a0 00 cmp %g2, 0 20133f0: 12 80 00 1c bne 2013460 <== NEVER TAKEN 20133f4: c2 07 60 34 ld [ %i5 + 0x34 ], %g1 20133f8: c6 08 60 0a ldub [ %g1 + 0xa ], %g3 20133fc: 80 88 e0 03 btst 3, %g3 2013400: 22 80 00 19 be,a 2013464 <== NEVER TAKEN 2013404: c6 08 60 05 ldub [ %g1 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013408: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 sec += (start >> fs_info->vol.sec_log2); 201340c: c2 0c 20 02 ldub [ %l0 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 2013410: d4 14 00 00 lduh [ %l0 ], %o2 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(mt_entry, fat_fd->cln); sec += (start >> fs_info->vol.sec_log2); 2013414: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 2013418: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_write(mt_entry, sec, byte, count, buf); 201341c: 90 10 00 1d mov %i5, %o0 2013420: 92 02 40 01 add %o1, %g1, %o1 2013424: 94 0e 80 0a and %i2, %o2, %o2 2013428: 96 10 00 1b mov %i3, %o3 201342c: 40 00 01 c7 call 2013b48 <_fat_block_write> 2013430: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 2013434: b0 92 20 00 orcc %o0, 0, %i0 2013438: 16 80 00 18 bge 2013498 <== ALWAYS TAKEN 201343c: 01 00 00 00 nop return -1; 2013440: 81 c7 e0 08 ret <== NOT EXECUTED 2013444: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED if ( start > fat_fd->fat_file_size ) rtems_set_errno_and_return_minus_one( EIO ); if ((count > fat_fd->size_limit) || (start > fat_fd->size_limit - count)) rtems_set_errno_and_return_minus_one( EIO ); 2013448: 40 00 26 b9 call 201cf2c <__errno> <== NOT EXECUTED 201344c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013450: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013454: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013458: 81 c7 e0 08 ret <== NOT EXECUTED 201345c: 81 e8 00 00 restore <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013460: c6 08 60 05 ldub [ %g1 + 5 ], %g3 <== NOT EXECUTED 2013464: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 <== NOT EXECUTED 2013468: 92 00 bf fe add %g2, -2, %o1 <== NOT EXECUTED 201346c: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 2013470: 10 bf ff e7 b 201340c <== NOT EXECUTED 2013474: 92 02 40 01 add %o1, %g1, %o1 <== NOT EXECUTED rc = fat_file_lseek(mt_entry, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2013478: b0 10 00 11 mov %l1, %i0 } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); 201347c: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 2013480: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2013484: e8 26 60 38 st %l4, [ %i1 + 0x38 ] } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); 2013488: a2 06 80 11 add %i2, %l1, %l1 201348c: a3 34 40 01 srl %l1, %g1, %l1 ofs = 0; } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + 2013490: a4 04 40 12 add %l1, %l2, %l2 2013494: e4 26 60 34 st %l2, [ %i1 + 0x34 ] ((save_ofs + cmpltd - 1) >> fs_info->vol.bpc_log2); fat_fd->map.disk_cln = save_cln; return cmpltd; 2013498: 81 c7 e0 08 ret 201349c: 81 e8 00 00 restore =============================================================================== 0201b6d0 : int fat_free_fat_clusters_chain( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t chain ) { 201b6d0: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK, rc1 = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 201b6d4: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 uint32_t cur_cln = chain; uint32_t next_cln = 0; 201b6d8: c0 27 bf fc clr [ %fp + -4 ] uint32_t freed_cls_cnt = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 201b6dc: c4 07 60 0c ld [ %i5 + 0xc ], %g2 201b6e0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 201b6e4: 84 0e 40 02 and %i1, %g2, %g2 201b6e8: 80 a0 80 01 cmp %g2, %g1 201b6ec: 1a 80 00 25 bcc 201b780 <== NEVER TAKEN 201b6f0: b8 10 00 18 mov %i0, %i4 201b6f4: b6 10 00 19 mov %i1, %i3 201b6f8: b4 10 20 00 clr %i2 201b6fc: 10 80 00 0e b 201b734 201b700: a0 10 20 00 clr %l0 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(mt_entry, cur_cln, FAT_GENFAT_FREE); 201b704: 7f ff ff 31 call 201b3c8 201b708: 01 00 00 00 nop if ( rc != RC_OK ) 201b70c: 80 a2 20 00 cmp %o0, 0 201b710: 02 80 00 03 be 201b71c <== ALWAYS TAKEN 201b714: f6 07 bf fc ld [ %fp + -4 ], %i3 201b718: a0 10 00 08 mov %o0, %l0 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = chain; uint32_t next_cln = 0; uint32_t freed_cls_cnt = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 201b71c: c4 07 60 0c ld [ %i5 + 0xc ], %g2 201b720: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 201b724: 84 0e c0 02 and %i3, %g2, %g2 201b728: 80 a0 80 01 cmp %g2, %g1 201b72c: 1a 80 00 17 bcc 201b788 <== ALWAYS TAKEN 201b730: b4 06 a0 01 inc %i2 { rc = fat_get_fat_cluster(mt_entry, cur_cln, &next_cln); 201b734: 92 10 00 1b mov %i3, %o1 201b738: 94 07 bf fc add %fp, -4, %o2 201b73c: 7f ff fe 9b call 201b1a8 201b740: 90 10 00 1c mov %i4, %o0 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(mt_entry, cur_cln, FAT_GENFAT_FREE); 201b744: 92 10 00 1b mov %i3, %o1 uint32_t next_cln = 0; uint32_t freed_cls_cnt = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { rc = fat_get_fat_cluster(mt_entry, cur_cln, &next_cln); 201b748: b0 10 00 08 mov %o0, %i0 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(mt_entry, cur_cln, FAT_GENFAT_FREE); 201b74c: 94 10 20 00 clr %o2 uint32_t freed_cls_cnt = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { rc = fat_get_fat_cluster(mt_entry, cur_cln, &next_cln); if ( rc != RC_OK ) 201b750: 80 a6 20 00 cmp %i0, 0 201b754: 02 bf ff ec be 201b704 <== ALWAYS TAKEN 201b758: 90 10 00 1c mov %i4, %o0 { if(fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201b75c: c2 07 60 40 ld [ %i5 + 0x40 ], %g1 <== NOT EXECUTED 201b760: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201b764: 02 80 00 03 be 201b770 <== NOT EXECUTED 201b768: 82 06 80 01 add %i2, %g1, %g1 <== NOT EXECUTED fs_info->vol.free_cls += freed_cls_cnt; 201b76c: c2 27 60 40 st %g1, [ %i5 + 0x40 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b770: 7f ff e0 78 call 2013950 <== NOT EXECUTED 201b774: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED return rc; 201b778: 81 c7 e0 08 ret <== NOT EXECUTED 201b77c: 81 e8 00 00 restore <== NOT EXECUTED { int rc = RC_OK, rc1 = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cur_cln = chain; uint32_t next_cln = 0; uint32_t freed_cls_cnt = 0; 201b780: b4 10 20 00 clr %i2 <== NOT EXECUTED fat_free_fat_clusters_chain( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t chain ) { int rc = RC_OK, rc1 = RC_OK; 201b784: a0 10 20 00 clr %l0 <== NOT EXECUTED freed_cls_cnt++; cur_cln = next_cln; } fs_info->vol.next_cl = chain; if (fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201b788: c2 07 60 40 ld [ %i5 + 0x40 ], %g1 201b78c: 80 a0 7f ff cmp %g1, -1 201b790: 02 80 00 04 be 201b7a0 <== ALWAYS TAKEN 201b794: f2 27 60 44 st %i1, [ %i5 + 0x44 ] fs_info->vol.free_cls += freed_cls_cnt; 201b798: 82 06 80 01 add %i2, %g1, %g1 <== NOT EXECUTED 201b79c: c2 27 60 40 st %g1, [ %i5 + 0x40 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b7a0: b0 10 00 10 mov %l0, %i0 201b7a4: 7f ff e0 6b call 2013950 201b7a8: 90 10 00 1d mov %i5, %o0 if (rc1 != RC_OK) return rc1; return RC_OK; } 201b7ac: 81 c7 e0 08 ret 201b7b0: 81 e8 00 00 restore =============================================================================== 02013eb0 : void fat_free_unique_ino( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t ino ) { 2013eb0: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; 2013eb4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED FAT_SET_UNIQ_INO_FREE((ino - fs_info->uino_base), fs_info->uino); 2013eb8: 9e 10 20 01 mov 1, %o7 <== NOT EXECUTED 2013ebc: c4 00 60 7c ld [ %g1 + 0x7c ], %g2 <== NOT EXECUTED 2013ec0: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 <== NOT EXECUTED 2013ec4: 84 26 40 02 sub %i1, %g2, %g2 <== NOT EXECUTED 2013ec8: 87 30 a0 03 srl %g2, 3, %g3 <== NOT EXECUTED 2013ecc: c8 08 40 03 ldub [ %g1 + %g3 ], %g4 <== NOT EXECUTED 2013ed0: 84 08 a0 07 and %g2, 7, %g2 <== NOT EXECUTED 2013ed4: 85 2b c0 02 sll %o7, %g2, %g2 <== NOT EXECUTED 2013ed8: 84 29 00 02 andn %g4, %g2, %g2 <== NOT EXECUTED 2013edc: c4 28 40 03 stb %g2, [ %g1 + %g3 ] <== NOT EXECUTED } 2013ee0: 81 c7 e0 08 ret <== NOT EXECUTED 2013ee4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201b1a8 : fat_get_fat_cluster( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t cln, uint32_t *ret_val ) { 201b1a8: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; register fat_fs_info_t *fs_info = mt_entry->fs_info; rtems_bdbuf_buffer *block0 = NULL; 201b1ac: c0 27 bf fc clr [ %fp + -4 ] uint32_t sec = 0; uint32_t ofs = 0; /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201b1b0: 80 a6 60 01 cmp %i1, 1 201b1b4: 08 80 00 26 bleu 201b24c <== NEVER TAKEN 201b1b8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 201b1bc: c2 07 60 34 ld [ %i5 + 0x34 ], %g1 201b1c0: 82 00 60 01 inc %g1 201b1c4: 80 a6 40 01 cmp %i1, %g1 201b1c8: 18 80 00 21 bgu 201b24c <== NEVER TAKEN 201b1cc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b1d0: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 201b1d4: 80 88 60 01 btst 1, %g1 201b1d8: 12 80 00 23 bne 201b264 <== ALWAYS TAKEN 201b1dc: f6 0f 60 02 ldub [ %i5 + 2 ], %i3 201b1e0: 80 88 60 02 btst 2, %g1 <== NOT EXECUTED 201b1e4: 02 80 00 30 be 201b2a4 <== NOT EXECUTED 201b1e8: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 <== NOT EXECUTED 201b1ec: b9 2e 60 01 sll %i1, 1, %i4 <== NOT EXECUTED 201b1f0: b7 37 00 1b srl %i4, %i3, %i3 <== NOT EXECUTED 201b1f4: b6 06 c0 01 add %i3, %g1, %i3 <== NOT EXECUTED fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b1f8: e0 17 40 00 lduh [ %i5 ], %l0 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201b1fc: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b200: 92 10 00 1b mov %i3, %o1 <== NOT EXECUTED 201b204: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b208: 7f ff e1 4b call 2013734 <== NOT EXECUTED 201b20c: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED if (rc != RC_OK) 201b210: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201b214: 12 80 00 5a bne 201b37c <== NOT EXECUTED 201b218: 01 00 00 00 nop <== NOT EXECUTED return rc; switch ( fs_info->vol.type ) 201b21c: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 <== NOT EXECUTED if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b220: a1 2c 20 10 sll %l0, 0x10, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201b224: 80 a0 60 02 cmp %g1, 2 if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b228: a1 34 20 10 srl %l0, 0x10, %l0 201b22c: a0 04 3f ff add %l0, -1, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201b230: 02 80 00 21 be 201b2b4 <== NEVER TAKEN 201b234: b8 0f 00 10 and %i4, %l0, %i4 201b238: 80 a0 60 04 cmp %g1, 4 201b23c: 02 80 00 3e be 201b334 <== NEVER TAKEN 201b240: 80 a0 60 01 cmp %g1, 1 201b244: 02 80 00 29 be 201b2e8 <== ALWAYS TAKEN 201b248: c2 07 bf fc ld [ %fp + -4 ], %g1 *ret_val = *((uint32_t *)(block0->buffer + ofs)); *ret_val = CF_LE_L(*ret_val); break; default: rtems_set_errno_and_return_minus_one(EIO); 201b24c: 40 00 07 38 call 201cf2c <__errno> <== NOT EXECUTED 201b250: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b254: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201b258: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201b25c: 81 c7 e0 08 ret <== NOT EXECUTED 201b260: 81 e8 00 00 restore <== NOT EXECUTED /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b264: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 201b268: b9 36 60 01 srl %i1, 1, %i4 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b26c: e0 17 40 00 lduh [ %i5 ], %l0 /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b270: b8 07 00 19 add %i4, %i1, %i4 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201b274: 90 10 00 1d mov %i5, %o0 /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b278: b7 37 00 1b srl %i4, %i3, %i3 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201b27c: 94 10 20 01 mov 1, %o2 /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b280: b6 06 c0 01 add %i3, %g1, %i3 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201b284: 96 07 bf fc add %fp, -4, %o3 201b288: 7f ff e1 2b call 2013734 201b28c: 92 10 00 1b mov %i3, %o1 if (rc != RC_OK) 201b290: b0 92 20 00 orcc %o0, 0, %i0 201b294: 22 bf ff e3 be,a 201b220 <== ALWAYS TAKEN 201b298: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201b29c: 81 c7 e0 08 ret <== NOT EXECUTED 201b2a0: 81 e8 00 00 restore <== NOT EXECUTED /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b2a4: b9 2e 60 02 sll %i1, 2, %i4 <== NOT EXECUTED 201b2a8: b7 37 00 1b srl %i4, %i3, %i3 <== NOT EXECUTED 201b2ac: 10 bf ff d3 b 201b1f8 <== NOT EXECUTED 201b2b0: b6 06 c0 01 add %i3, %g1, %i3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 201b2b4: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 201b2b8: 07 00 00 3f sethi %hi(0xfc00), %g3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 201b2bc: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 201b2c0: 86 10 e3 ff or %g3, 0x3ff, %g3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 201b2c4: c2 10 40 1c lduh [ %g1 + %i4 ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 201b2c8: 83 28 60 10 sll %g1, 0x10, %g1 <== NOT EXECUTED 201b2cc: 85 30 60 18 srl %g1, 0x18, %g2 <== NOT EXECUTED 201b2d0: 83 30 60 08 srl %g1, 8, %g1 <== NOT EXECUTED 201b2d4: 82 08 40 03 and %g1, %g3, %g1 <== NOT EXECUTED 201b2d8: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 201b2dc: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED break; 201b2e0: 81 c7 e0 08 ret <== NOT EXECUTED 201b2e4: 81 e8 00 00 restore <== NOT EXECUTED /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); if ( ofs == (fs_info->vol.bps - 1) ) 201b2e8: c6 17 40 00 lduh [ %i5 ], %g3 case FAT_FAT12: /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); 201b2ec: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 if ( ofs == (fs_info->vol.bps - 1) ) 201b2f0: 86 00 ff ff add %g3, -1, %g3 case FAT_FAT12: /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); 201b2f4: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 if ( ofs == (fs_info->vol.bps - 1) ) 201b2f8: 80 a0 c0 1c cmp %g3, %i4 201b2fc: 02 80 00 22 be 201b384 <== NEVER TAKEN 201b300: c2 26 80 00 st %g1, [ %i2 ] *ret_val |= (*((uint8_t *)(block0->buffer)))<<8; } else { *ret_val |= (*((uint8_t *)(block0->buffer + ofs + 1)))<<8; 201b304: b8 00 80 1c add %g2, %i4, %i4 201b308: c4 0f 20 01 ldub [ %i4 + 1 ], %g2 201b30c: 85 28 a0 08 sll %g2, 8, %g2 201b310: 82 10 80 01 or %g2, %g1, %g1 201b314: c2 26 80 00 st %g1, [ %i2 ] } if ( FAT_CLUSTER_IS_ODD(cln) ) 201b318: 80 8e 60 01 btst 1, %i1 201b31c: 22 80 00 17 be,a 201b378 201b320: 82 08 6f ff and %g1, 0xfff, %g1 *ret_val = (*ret_val) >> FAT12_SHIFT; 201b324: 83 30 60 04 srl %g1, 4, %g1 201b328: c2 26 80 00 st %g1, [ %i2 ] 201b32c: 81 c7 e0 08 ret 201b330: 81 e8 00 00 restore *ret_val = *((uint16_t *)(block0->buffer + ofs)); *ret_val = CF_LE_W(*ret_val); break; case FAT_FAT32: *ret_val = *((uint32_t *)(block0->buffer + ofs)); 201b334: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b338: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED 201b33c: c2 00 40 1c ld [ %g1 + %i4 ], %g1 <== NOT EXECUTED 201b340: 89 28 60 18 sll %g1, 0x18, %g4 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201b344: 85 30 60 18 srl %g1, 0x18, %g2 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201b348: 87 30 60 08 srl %g1, 8, %g3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b34c: 84 11 00 02 or %g4, %g2, %g2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201b350: 86 08 e0 ff and %g3, 0xff, %g3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201b354: 83 30 60 10 srl %g1, 0x10, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b358: 87 28 e0 10 sll %g3, 0x10, %g3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201b35c: 82 08 60 ff and %g1, 0xff, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b360: 84 10 80 03 or %g2, %g3, %g2 <== NOT EXECUTED 201b364: 83 28 60 08 sll %g1, 8, %g1 <== NOT EXECUTED 201b368: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED *ret_val = CF_LE_L(*ret_val); 201b36c: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED break; 201b370: 81 c7 e0 08 ret <== NOT EXECUTED 201b374: 81 e8 00 00 restore <== NOT EXECUTED } if ( FAT_CLUSTER_IS_ODD(cln) ) *ret_val = (*ret_val) >> FAT12_SHIFT; else *ret_val = (*ret_val) & FAT_FAT12_MASK; 201b378: c2 26 80 00 st %g1, [ %i2 ] 201b37c: 81 c7 e0 08 ret 201b380: 81 e8 00 00 restore * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); if ( ofs == (fs_info->vol.bps - 1) ) { rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, 201b384: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b388: 92 06 e0 01 add %i3, 1, %o1 <== NOT EXECUTED 201b38c: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b390: 7f ff e0 e9 call 2013734 <== NOT EXECUTED 201b394: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 201b398: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 201b39c: 12 80 00 09 bne 201b3c0 <== NOT EXECUTED 201b3a0: c4 07 bf fc ld [ %fp + -4 ], %g2 <== NOT EXECUTED return rc; *ret_val |= (*((uint8_t *)(block0->buffer)))<<8; 201b3a4: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED 201b3a8: c4 00 a0 24 ld [ %g2 + 0x24 ], %g2 <== NOT EXECUTED 201b3ac: c4 08 80 00 ldub [ %g2 ], %g2 <== NOT EXECUTED 201b3b0: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 201b3b4: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 201b3b8: 10 bf ff d8 b 201b318 <== NOT EXECUTED 201b3bc: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201b3c0: 81 c7 e0 08 ret <== NOT EXECUTED 201b3c4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02013db0 : * 0 means FAILED !!! * */ uint32_t fat_get_unique_ino(rtems_filesystem_mount_table_entry_t *mt_entry) { 2013db0: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED register fat_fs_info_t *fs_info = mt_entry->fs_info; 2013db4: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 <== NOT EXECUTED fs_info->index++; if (fs_info->index >= fs_info->uino_pool_size) fs_info->index = 0; } if ((fs_info->uino_pool_size << 1) < (0x0FFFFFFF - fs_info->uino_base)) 2013db8: 39 03 ff ff sethi %hi(0xffffc00), %i4 <== NOT EXECUTED * */ uint32_t fat_get_unique_ino(rtems_filesystem_mount_table_entry_t *mt_entry) { register fat_fs_info_t *fs_info = mt_entry->fs_info; 2013dbc: d2 07 60 78 ld [ %i5 + 0x78 ], %o1 <== NOT EXECUTED fs_info->index++; if (fs_info->index >= fs_info->uino_pool_size) fs_info->index = 0; } if ((fs_info->uino_pool_size << 1) < (0x0FFFFFFF - fs_info->uino_base)) 2013dc0: b8 17 23 ff or %i4, 0x3ff, %i4 <== NOT EXECUTED uint32_t j = 0; bool resrc_unsuff = false; while (!resrc_unsuff) { for (j = 0; j < fs_info->uino_pool_size; j++) 2013dc4: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2013dc8: 22 80 00 20 be,a 2013e48 <== NOT EXECUTED 2013dcc: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 <== NOT EXECUTED { if (!FAT_UNIQ_INO_IS_BUSY(fs_info->index, fs_info->uino)) 2013dd0: c6 07 60 70 ld [ %i5 + 0x70 ], %g3 <== NOT EXECUTED 2013dd4: c2 07 60 74 ld [ %i5 + 0x74 ], %g1 <== NOT EXECUTED 2013dd8: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2013ddc: c8 48 c0 02 ldsb [ %g3 + %g2 ], %g4 <== NOT EXECUTED 2013de0: 9e 08 60 07 and %g1, 7, %o7 <== NOT EXECUTED 2013de4: 98 00 c0 02 add %g3, %g2, %o4 <== NOT EXECUTED 2013de8: 89 39 00 0f sra %g4, %o7, %g4 <== NOT EXECUTED 2013dec: 80 89 20 01 btst 1, %g4 <== NOT EXECUTED 2013df0: 02 80 00 1d be 2013e64 <== NOT EXECUTED 2013df4: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 <== NOT EXECUTED 2013df8: 10 80 00 0a b 2013e20 <== NOT EXECUTED 2013dfc: 88 10 20 00 clr %g4 <== NOT EXECUTED 2013e00: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2013e04: da 48 c0 02 ldsb [ %g3 + %g2 ], %o5 <== NOT EXECUTED 2013e08: 9e 08 60 07 and %g1, 7, %o7 <== NOT EXECUTED 2013e0c: 98 00 c0 02 add %g3, %g2, %o4 <== NOT EXECUTED 2013e10: 9b 3b 40 0f sra %o5, %o7, %o5 <== NOT EXECUTED 2013e14: 80 8b 60 01 btst 1, %o5 <== NOT EXECUTED 2013e18: 02 80 00 13 be 2013e64 <== NOT EXECUTED 2013e1c: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 <== NOT EXECUTED { FAT_SET_UNIQ_INO_BUSY(fs_info->index, fs_info->uino); return (fs_info->uino_base + fs_info->index); } fs_info->index++; 2013e20: 82 00 60 01 inc %g1 <== NOT EXECUTED if (fs_info->index >= fs_info->uino_pool_size) 2013e24: 80 a0 40 09 cmp %g1, %o1 <== NOT EXECUTED 2013e28: 0a 80 00 03 bcs 2013e34 <== NOT EXECUTED 2013e2c: c2 27 60 74 st %g1, [ %i5 + 0x74 ] <== NOT EXECUTED fs_info->index = 0; 2013e30: c0 27 60 74 clr [ %i5 + 0x74 ] <== NOT EXECUTED uint32_t j = 0; bool resrc_unsuff = false; while (!resrc_unsuff) { for (j = 0; j < fs_info->uino_pool_size; j++) 2013e34: 88 01 20 01 inc %g4 <== NOT EXECUTED 2013e38: 80 a1 00 09 cmp %g4, %o1 <== NOT EXECUTED 2013e3c: 32 bf ff f1 bne,a 2013e00 <== NOT EXECUTED 2013e40: c2 07 60 74 ld [ %i5 + 0x74 ], %g1 <== NOT EXECUTED fs_info->index++; if (fs_info->index >= fs_info->uino_pool_size) fs_info->index = 0; } if ((fs_info->uino_pool_size << 1) < (0x0FFFFFFF - fs_info->uino_base)) 2013e44: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 <== NOT EXECUTED 2013e48: 93 2a 60 01 sll %o1, 1, %o1 <== NOT EXECUTED 2013e4c: 82 27 00 01 sub %i4, %g1, %g1 <== NOT EXECUTED 2013e50: 80 a2 40 01 cmp %o1, %g1 <== NOT EXECUTED 2013e54: 0a 80 00 0c bcs 2013e84 <== NOT EXECUTED 2013e58: b0 10 20 00 clr %i0 <== NOT EXECUTED 2013e5c: 81 c7 e0 08 ret <== NOT EXECUTED 2013e60: 81 e8 00 00 restore <== NOT EXECUTED { for (j = 0; j < fs_info->uino_pool_size; j++) { if (!FAT_UNIQ_INO_IS_BUSY(fs_info->index, fs_info->uino)) { FAT_SET_UNIQ_INO_BUSY(fs_info->index, fs_info->uino); 2013e64: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2013e68: 9f 28 40 0f sll %g1, %o7, %o7 <== NOT EXECUTED 2013e6c: 84 13 c0 02 or %o7, %g2, %g2 <== NOT EXECUTED 2013e70: c4 2b 00 00 stb %g2, [ %o4 ] <== NOT EXECUTED return (fs_info->uino_base + fs_info->index); 2013e74: f0 07 60 74 ld [ %i5 + 0x74 ], %i0 <== NOT EXECUTED 2013e78: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 <== NOT EXECUTED 2013e7c: 81 c7 e0 08 ret <== NOT EXECUTED 2013e80: 91 ee 00 01 restore %i0, %g1, %o0 <== NOT EXECUTED } if ((fs_info->uino_pool_size << 1) < (0x0FFFFFFF - fs_info->uino_base)) { fs_info->uino_pool_size <<= 1; fs_info->uino = realloc(fs_info->uino, fs_info->uino_pool_size); 2013e84: d0 07 60 70 ld [ %i5 + 0x70 ], %o0 <== NOT EXECUTED 2013e88: 7f ff cc ab call 2007134 <== NOT EXECUTED 2013e8c: d2 27 60 78 st %o1, [ %i5 + 0x78 ] <== NOT EXECUTED if (fs_info->uino != NULL) 2013e90: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013e94: 12 80 00 04 bne 2013ea4 <== NOT EXECUTED 2013e98: d0 27 60 70 st %o0, [ %i5 + 0x70 ] <== NOT EXECUTED } else resrc_unsuff = true; } return 0; } 2013e9c: 81 c7 e0 08 ret <== NOT EXECUTED 2013ea0: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED if ((fs_info->uino_pool_size << 1) < (0x0FFFFFFF - fs_info->uino_base)) { fs_info->uino_pool_size <<= 1; fs_info->uino = realloc(fs_info->uino, fs_info->uino_pool_size); if (fs_info->uino != NULL) fs_info->index = fs_info->uino_pool_size; 2013ea4: d2 07 60 78 ld [ %i5 + 0x78 ], %o1 <== NOT EXECUTED 2013ea8: 10 bf ff c7 b 2013dc4 <== NOT EXECUTED 2013eac: d2 27 60 74 st %o1, [ %i5 + 0x74 ] <== NOT EXECUTED =============================================================================== 02013cec : int fat_init_clusters_chain( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t start_cln ) { 2013cec: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t ret = 0; register fat_fs_info_t *fs_info = mt_entry->fs_info; 2013cf0: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 uint32_t cur_cln = start_cln; 2013cf4: f2 27 bf fc st %i1, [ %fp + -4 ] char *buf; buf = calloc(fs_info->vol.bpc, sizeof(char)); 2013cf8: d0 17 60 06 lduh [ %i5 + 6 ], %o0 2013cfc: 92 10 20 01 mov 1, %o1 2013d00: 7f ff c6 58 call 2005660 2013d04: b8 10 00 18 mov %i0, %i4 if ( buf == NULL ) 2013d08: b6 92 20 00 orcc %o0, 0, %i3 2013d0c: 32 80 00 04 bne,a 2013d1c <== ALWAYS TAKEN 2013d10: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2013d14: 30 80 00 21 b,a 2013d98 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2013d18: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2013d1c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2013d20: 84 0e 40 02 and %i1, %g2, %g2 2013d24: 80 a0 80 01 cmp %g2, %g1 2013d28: 1a 80 00 12 bcc 2013d70 2013d2c: 94 10 00 1b mov %i3, %o2 { ret = fat_cluster_write(mt_entry, cur_cln, buf); 2013d30: 92 10 00 19 mov %i1, %o1 2013d34: 7f ff ff d3 call 2013c80 2013d38: 90 10 00 1c mov %i4, %o0 { free(buf); return -1; } rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2013d3c: 94 07 bf fc add %fp, -4, %o2 rtems_set_errno_and_return_minus_one( EIO ); while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_write(mt_entry, cur_cln, buf); if ( ret == -1 ) 2013d40: 80 a2 3f ff cmp %o0, -1 2013d44: 02 80 00 10 be 2013d84 <== NEVER TAKEN 2013d48: 90 10 00 1c mov %i4, %o0 { free(buf); return -1; } rc = fat_get_fat_cluster(mt_entry, cur_cln, &cur_cln); 2013d4c: 40 00 1d 17 call 201b1a8 2013d50: d2 07 bf fc ld [ %fp + -4 ], %o1 if ( rc != RC_OK ) 2013d54: b0 92 20 00 orcc %o0, 0, %i0 2013d58: 22 bf ff f0 be,a 2013d18 <== ALWAYS TAKEN 2013d5c: f2 07 bf fc ld [ %fp + -4 ], %i1 { free(buf); 2013d60: 7f ff c7 9e call 2005bd8 <== NOT EXECUTED 2013d64: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED return rc; 2013d68: 81 c7 e0 08 ret <== NOT EXECUTED 2013d6c: 81 e8 00 00 restore <== NOT EXECUTED } } free(buf); return rc; 2013d70: b0 10 20 00 clr %i0 free(buf); return rc; } } free(buf); 2013d74: 7f ff c7 99 call 2005bd8 2013d78: 90 10 00 1b mov %i3, %o0 return rc; } 2013d7c: 81 c7 e0 08 ret 2013d80: 81 e8 00 00 restore while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_write(mt_entry, cur_cln, buf); if ( ret == -1 ) { free(buf); 2013d84: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 2013d88: 7f ff c7 94 call 2005bd8 <== NOT EXECUTED 2013d8c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED return -1; 2013d90: 81 c7 e0 08 ret <== NOT EXECUTED 2013d94: 81 e8 00 00 restore <== NOT EXECUTED uint32_t cur_cln = start_cln; char *buf; buf = calloc(fs_info->vol.bpc, sizeof(char)); if ( buf == NULL ) rtems_set_errno_and_return_minus_one( EIO ); 2013d98: 40 00 24 65 call 201cf2c <__errno> <== NOT EXECUTED 2013d9c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013da0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013da4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013da8: 81 c7 e0 08 ret <== NOT EXECUTED 2013dac: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020140dc : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_init_volume_info(rtems_filesystem_mount_table_entry_t *mt_entry) { 20140dc: 9d e3 bf 18 save %sp, -232, %sp ssize_t ret = 0; struct stat stat_buf; int i = 0; rtems_bdbuf_buffer *block = NULL; rc = stat(mt_entry->dev, &stat_buf); 20140e0: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 int fat_init_volume_info(rtems_filesystem_mount_table_entry_t *mt_entry) { rtems_status_code sc = RTEMS_SUCCESSFUL; int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 20140e4: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_init_volume_info(rtems_filesystem_mount_table_entry_t *mt_entry) { 20140e8: b8 10 00 18 mov %i0, %i4 char boot_rec[FAT_MAX_BPB_SIZE]; char fs_info_sector[FAT_USEFUL_INFO_SIZE]; ssize_t ret = 0; struct stat stat_buf; int i = 0; rtems_bdbuf_buffer *block = NULL; 20140ec: c0 27 bf fc clr [ %fp + -4 ] rc = stat(mt_entry->dev, &stat_buf); 20140f0: 7f ff cc ca call 2007418 20140f4: 92 07 bf a8 add %fp, -88, %o1 if (rc == -1) 20140f8: 80 a2 3f ff cmp %o0, -1 20140fc: 02 80 01 0d be 2014530 <== NEVER TAKEN 2014100: b0 10 00 08 mov %o0, %i0 return rc; /* Must be a block device. */ if (!S_ISBLK(stat_buf.st_mode)) 2014104: c4 07 bf b4 ld [ %fp + -76 ], %g2 2014108: 03 00 00 3c sethi %hi(0xf000), %g1 201410c: 84 08 80 01 and %g2, %g1, %g2 2014110: 03 00 00 18 sethi %hi(0x6000), %g1 2014114: 80 a0 80 01 cmp %g2, %g1 2014118: 12 80 01 9a bne 2014780 <== NEVER TAKEN 201411c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(ENOTTY); /* check that device is registred as block device and lock it */ vol->dd = rtems_disk_obtain(stat_buf.st_rdev); 2014120: 7f ff c2 8b call 2004b4c 2014124: d0 1f bf c0 ldd [ %fp + -64 ], %o0 if (vol->dd == NULL) 2014128: 80 a2 20 00 cmp %o0, 0 201412c: 02 80 01 c7 be 2014848 <== NEVER TAKEN 2014130: d0 27 60 60 st %o0, [ %i5 + 0x60 ] rtems_set_errno_and_return_minus_one(EIO); vol->dev = stat_buf.st_rdev; 2014134: d0 1f bf c0 ldd [ %fp + -64 ], %o0 /* Read boot record */ /* FIXME: Asserts FAT_MAX_BPB_SIZE < bdbuf block size */ sc = rtems_bdbuf_read( vol->dev, 0, &block); 2014138: 94 10 20 00 clr %o2 /* check that device is registred as block device and lock it */ vol->dd = rtems_disk_obtain(stat_buf.st_rdev); if (vol->dd == NULL) rtems_set_errno_and_return_minus_one(EIO); vol->dev = stat_buf.st_rdev; 201413c: d0 3f 60 58 std %o0, [ %i5 + 0x58 ] /* Read boot record */ /* FIXME: Asserts FAT_MAX_BPB_SIZE < bdbuf block size */ sc = rtems_bdbuf_read( vol->dev, 0, &block); 2014140: 7f ff f6 aa call 2011be8 2014144: 96 07 bf fc add %fp, -4, %o3 if (sc != RTEMS_SUCCESSFUL) 2014148: 80 a2 20 00 cmp %o0, 0 201414c: 12 80 01 ab bne 20147f8 <== NEVER TAKEN 2014150: d0 07 bf fc ld [ %fp + -4 ], %o0 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EIO); } memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); 2014154: c2 02 20 24 ld [ %o0 + 0x24 ], %g1 2014158: c4 08 60 0b ldub [ %g1 + 0xb ], %g2 201415c: c6 08 60 0c ldub [ %g1 + 0xc ], %g3 2014160: c4 2f bf a3 stb %g2, [ %fp + -93 ] 2014164: c4 08 60 11 ldub [ %g1 + 0x11 ], %g2 2014168: c6 2f bf a4 stb %g3, [ %fp + -92 ] 201416c: c6 08 60 12 ldub [ %g1 + 0x12 ], %g3 2014170: c4 2f bf a1 stb %g2, [ %fp + -95 ] 2014174: c4 08 60 23 ldub [ %g1 + 0x23 ], %g2 2014178: c6 2f bf a0 stb %g3, [ %fp + -96 ] 201417c: c6 08 60 26 ldub [ %g1 + 0x26 ], %g3 2014180: c4 2f bf 97 stb %g2, [ %fp + -105 ] 2014184: c4 08 60 28 ldub [ %g1 + 0x28 ], %g2 2014188: f2 08 60 0e ldub [ %g1 + 0xe ], %i1 201418c: c6 2f bf 9f stb %g3, [ %fp + -97 ] 2014190: c6 08 60 2c ldub [ %g1 + 0x2c ], %g3 2014194: c4 2f bf 8f stb %g2, [ %fp + -113 ] 2014198: c4 08 60 2d ldub [ %g1 + 0x2d ], %g2 201419c: f2 2f bf a2 stb %i1, [ %fp + -94 ] 20141a0: c6 2f bf 9c stb %g3, [ %fp + -100 ] 20141a4: c8 08 60 0f ldub [ %g1 + 0xf ], %g4 20141a8: f6 08 60 0d ldub [ %g1 + 0xd ], %i3 20141ac: f4 08 60 10 ldub [ %g1 + 0x10 ], %i2 20141b0: f2 08 60 13 ldub [ %g1 + 0x13 ], %i1 20141b4: f0 08 60 14 ldub [ %g1 + 0x14 ], %i0 20141b8: e0 08 60 16 ldub [ %g1 + 0x16 ], %l0 20141bc: e2 08 60 17 ldub [ %g1 + 0x17 ], %l1 20141c0: ea 08 60 20 ldub [ %g1 + 0x20 ], %l5 20141c4: ec 08 60 21 ldub [ %g1 + 0x21 ], %l6 20141c8: ee 08 60 22 ldub [ %g1 + 0x22 ], %l7 20141cc: e6 08 60 24 ldub [ %g1 + 0x24 ], %l3 20141d0: e8 08 60 25 ldub [ %g1 + 0x25 ], %l4 20141d4: e4 08 60 27 ldub [ %g1 + 0x27 ], %l2 20141d8: c4 2f bf 9b stb %g2, [ %fp + -101 ] 20141dc: c6 08 60 2e ldub [ %g1 + 0x2e ], %g3 20141e0: c4 08 60 2f ldub [ %g1 + 0x2f ], %g2 20141e4: c6 2f bf 9a stb %g3, [ %fp + -102 ] 20141e8: c6 08 60 30 ldub [ %g1 + 0x30 ], %g3 20141ec: c2 08 60 31 ldub [ %g1 + 0x31 ], %g1 20141f0: c4 2f bf 87 stb %g2, [ %fp + -121 ] sc = rtems_bdbuf_release( block); 20141f4: c8 27 bf 78 st %g4, [ %fp + -136 ] { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EIO); } memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); 20141f8: c6 2f bf 9e stb %g3, [ %fp + -98 ] sc = rtems_bdbuf_release( block); 20141fc: 7f ff f7 33 call 2011ec8 2014200: c2 2f bf 9d stb %g1, [ %fp + -99 ] if (sc != RTEMS_SUCCESSFUL) 2014204: 80 a2 20 00 cmp %o0, 0 2014208: 12 80 01 7c bne 20147f8 <== NEVER TAKEN 201420c: c8 07 bf 78 ld [ %fp + -136 ], %g4 rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EIO ); } /* Evaluate boot record */ vol->bps = FAT_GET_BR_BYTES_PER_SECTOR(boot_rec); 2014210: c2 0f bf a4 ldub [ %fp + -92 ], %g1 2014214: c4 0f bf a3 ldub [ %fp + -93 ], %g2 2014218: 83 28 60 08 sll %g1, 8, %g1 201421c: 92 10 40 02 or %g1, %g2, %o1 2014220: d2 37 40 00 sth %o1, [ %i5 ] if ( (vol->bps != 512) && 2014224: 93 2a 60 10 sll %o1, 0x10, %o1 2014228: 83 32 60 10 srl %o1, 0x10, %g1 201422c: 80 a0 64 00 cmp %g1, 0x400 2014230: 12 80 00 c2 bne 2014538 <== ALWAYS TAKEN 2014234: 80 a0 62 00 cmp %g1, 0x200 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014238: 83 32 60 19 srl %o1, 0x19, %g1 <== NOT EXECUTED 201423c: 80 88 60 01 btst 1, %g1 2014240: 12 80 00 0a bne 2014268 <== ALWAYS TAKEN 2014244: c0 2f 60 03 clrb [ %i5 + 3 ] * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_init_volume_info(rtems_filesystem_mount_table_entry_t *mt_entry) { 2014248: 10 80 00 03 b 2014254 <== NOT EXECUTED 201424c: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014250: 84 10 00 03 mov %g3, %g2 <== NOT EXECUTED i >>= 1, vol->sec_mul++); 2014254: 83 38 60 01 sra %g1, 1, %g1 <== NOT EXECUTED { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014258: 80 88 60 01 btst 1, %g1 <== NOT EXECUTED 201425c: 02 bf ff fd be 2014250 <== NOT EXECUTED 2014260: 86 00 a0 01 add %g2, 1, %g3 <== NOT EXECUTED 2014264: c4 2f 60 03 stb %g2, [ %i5 + 3 ] <== NOT EXECUTED i >>= 1, vol->sec_mul++); for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; 2014268: c0 2f 60 02 clrb [ %i5 + 2 ] 201426c: 93 32 60 10 srl %o1, 0x10, %o1 2014270: 84 10 20 01 mov 1, %g2 2014274: 80 8a 60 01 btst 1, %o1 2014278: 02 80 00 05 be 201428c <== ALWAYS TAKEN 201427c: 82 10 00 09 mov %o1, %g1 i >>= 1, vol->sec_log2++); vol->spc = FAT_GET_BR_SECTORS_PER_CLUSTER(boot_rec); 2014280: 10 80 00 09 b 20142a4 <== NOT EXECUTED 2014284: f6 2f 60 04 stb %i3, [ %i5 + 4 ] <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; i >>= 1, vol->sec_mul++); for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; 2014288: 84 10 00 03 mov %g3, %g2 i >>= 1, vol->sec_log2++); 201428c: 83 38 60 01 sra %g1, 1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; i >>= 1, vol->sec_mul++); for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; 2014290: 80 88 60 01 btst 1, %g1 2014294: 02 bf ff fd be 2014288 2014298: 86 00 a0 01 add %g2, 1, %g3 201429c: c4 2f 60 02 stb %g2, [ %i5 + 2 ] i >>= 1, vol->sec_log2++); vol->spc = FAT_GET_BR_SECTORS_PER_CLUSTER(boot_rec); 20142a0: f6 2f 60 04 stb %i3, [ %i5 + 4 ] /* * "sectors per cluster" of zero is invalid * (and would hang the following loop) */ if (vol->spc == 0) 20142a4: b6 8e e0 ff andcc %i3, 0xff, %i3 20142a8: 02 80 01 3c be 2014798 <== NEVER TAKEN 20142ac: 82 10 00 1b mov %i3, %g1 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 20142b0: c0 2f 60 05 clrb [ %i5 + 5 ] 20142b4: 80 8e e0 01 btst 1, %i3 20142b8: 12 80 00 0b bne 20142e4 <== NEVER TAKEN 20142bc: 84 10 20 00 clr %g2 20142c0: 10 80 00 03 b 20142cc 20142c4: 84 10 20 01 mov 1, %g2 20142c8: 84 10 00 03 mov %g3, %g2 <== NOT EXECUTED i >>= 1, vol->spc_log2++); 20142cc: 83 38 60 01 sra %g1, 1, %g1 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 20142d0: 80 88 60 01 btst 1, %g1 20142d4: 02 bf ff fd be 20142c8 <== NEVER TAKEN 20142d8: 86 00 a0 01 add %g2, 1, %g3 20142dc: c4 2f 60 05 stb %g2, [ %i5 + 5 ] 20142e0: 84 08 a0 ff and %g2, 0xff, %g2 i >>= 1, vol->spc_log2++); /* * "bytes per cluster" value greater than 32K is invalid */ if ((vol->bpc = vol->bps << vol->spc_log2) > MS_BYTES_PER_CLUSTER_LIMIT) 20142e4: 85 2a 40 02 sll %o1, %g2, %g2 20142e8: c4 37 60 06 sth %g2, [ %i5 + 6 ] 20142ec: 83 28 a0 10 sll %g2, 0x10, %g1 20142f0: 05 00 00 20 sethi %hi(0x8000), %g2 20142f4: 83 30 60 10 srl %g1, 0x10, %g1 20142f8: 80 a0 40 02 cmp %g1, %g2 20142fc: 18 80 01 27 bgu 2014798 <== NEVER TAKEN 2014300: 80 88 60 01 btst 1, %g1 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 2014304: c0 2f 60 08 clrb [ %i5 + 8 ] 2014308: 02 80 00 05 be 201431c <== ALWAYS TAKEN 201430c: 84 10 20 01 mov 1, %g2 i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 2014310: 10 80 00 09 b 2014334 <== NOT EXECUTED 2014314: c6 0f bf a2 ldub [ %fp + -94 ], %g3 <== NOT EXECUTED { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 2014318: 84 10 00 03 mov %g3, %g2 i >>= 1, vol->bpc_log2++); 201431c: 83 38 60 01 sra %g1, 1, %g1 { rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 2014320: 80 88 60 01 btst 1, %g1 2014324: 02 bf ff fd be 2014318 2014328: 86 00 a0 01 add %g2, 1, %g3 201432c: c4 2f 60 08 stb %g2, [ %i5 + 8 ] i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 2014330: c6 0f bf a2 ldub [ %fp + -94 ], %g3 2014334: 88 09 20 ff and %g4, 0xff, %g4 2014338: 89 29 20 08 sll %g4, 8, %g4 201433c: 86 11 00 03 or %g4, %g3, %g3 vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 2014340: c4 0f bf a0 ldub [ %fp + -96 ], %g2 for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 2014344: c6 27 bf a4 st %g3, [ %fp + -92 ] 2014348: c6 37 60 14 sth %g3, [ %i5 + 0x14 ] vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 201434c: c6 0f bf a1 ldub [ %fp + -95 ], %g3 /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2014350: 82 02 7f ff add %o1, -1, %g1 i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 2014354: 85 28 a0 08 sll %g2, 8, %g2 2014358: 84 10 80 03 or %g2, %g3, %g2 /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 201435c: 87 28 a0 10 sll %g2, 0x10, %g3 2014360: 87 30 e0 0b srl %g3, 0xb, %g3 i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 2014364: c4 37 60 20 sth %g2, [ %i5 + 0x20 ] /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2014368: 90 00 c0 01 add %g3, %g1, %o0 201436c: 40 00 55 d8 call 2029acc <.div> 2014370: f4 2f 60 09 stb %i2, [ %i5 + 9 ] vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 2014374: c4 0f 60 02 ldub [ %i5 + 2 ], %g2 vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2014378: d0 27 60 24 st %o0, [ %i5 + 0x24 ] vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 201437c: 85 2a 00 02 sll %o0, %g2, %g2 vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2014380: 82 10 00 08 mov %o0, %g1 vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) 2014384: a2 0c 60 ff and %l1, 0xff, %l1 2014388: a0 0c 20 ff and %l0, 0xff, %l0 201438c: 91 2c 60 08 sll %l1, 8, %o0 2014390: 90 12 00 10 or %o0, %l0, %o0 2014394: 91 2a 20 10 sll %o0, 0x10, %o0 2014398: 80 a2 20 00 cmp %o0, 0 201439c: 02 80 00 e6 be 2014734 <== NEVER TAKEN 20143a0: c4 27 60 28 st %g2, [ %i5 + 0x28 ] vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); 20143a4: 91 32 20 10 srl %o0, 0x10, %o0 20143a8: d0 27 60 18 st %o0, [ %i5 + 0x18 ] else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); vol->data_fsec = vol->fat_loc + vol->fats * vol->fat_length + 20143ac: c2 27 bf 7c st %g1, [ %fp + -132 ] 20143b0: 40 00 55 8b call 20299dc <.umul> 20143b4: 92 0e a0 ff and %i2, 0xff, %o1 20143b8: c2 07 bf 7c ld [ %fp + -132 ], %g1 20143bc: c6 07 bf a4 ld [ %fp + -92 ], %g3 vol->rdir_secs; /* for FAT12/16 root dir starts at(sector) */ vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) 20143c0: b2 0e 60 ff and %i1, 0xff, %i1 if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); vol->data_fsec = vol->fat_loc + vol->fats * vol->fat_length + 20143c4: 85 28 e0 10 sll %g3, 0x10, %g2 20143c8: 85 30 a0 10 srl %g2, 0x10, %g2 20143cc: 84 02 00 02 add %o0, %g2, %g2 20143d0: 82 00 80 01 add %g2, %g1, %g1 vol->rdir_secs; /* for FAT12/16 root dir starts at(sector) */ vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; 20143d4: c4 27 60 1c st %g2, [ %i5 + 0x1c ] if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) 20143d8: 90 0e 20 ff and %i0, 0xff, %o0 20143dc: 91 2a 20 08 sll %o0, 8, %o0 20143e0: 90 12 00 19 or %o0, %i1, %o0 20143e4: 91 2a 20 10 sll %o0, 0x10, %o0 20143e8: 80 a2 20 00 cmp %o0, 0 20143ec: 02 80 00 c6 be 2014704 <== NEVER TAKEN 20143f0: c2 27 60 30 st %g1, [ %i5 + 0x30 ] vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); 20143f4: 91 32 20 10 srl %o0, 0x10, %o0 20143f8: d0 27 60 2c st %o0, [ %i5 + 0x2c ] else vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM32(boot_rec); data_secs = vol->tot_secs - vol->data_fsec; vol->data_cls = data_secs / vol->spc; 20143fc: 90 22 00 01 sub %o0, %g1, %o0 2014400: 40 00 55 b1 call 2029ac4 <.udiv> 2014404: 92 10 00 1b mov %i3, %o1 /* determine FAT type at least */ if ( vol->data_cls < FAT_FAT12_MAX_CLN) 2014408: 80 a2 2f f4 cmp %o0, 0xff4 201440c: 18 80 00 56 bgu 2014564 <== NEVER TAKEN 2014410: d0 27 60 34 st %o0, [ %i5 + 0x34 ] { vol->type = FAT_FAT12; 2014414: 82 10 20 01 mov 1, %g1 2014418: c2 2f 60 0a stb %g1, [ %i5 + 0xa ] vol->mask = FAT_FAT12_MASK; 201441c: 82 10 2f ff mov 0xfff, %g1 2014420: c2 27 60 0c st %g1, [ %i5 + 0xc ] vol->eoc_val = FAT_FAT12_EOC; 2014424: 82 10 2f f8 mov 0xff8, %g1 2014428: c2 27 60 10 st %g1, [ %i5 + 0x10 ] else { vol->rdir_cl = 0; vol->mirror = 0; vol->afat = 0; vol->free_cls = 0xFFFFFFFF; 201442c: 82 10 3f ff mov -1, %g1 } } } else { vol->rdir_cl = 0; 2014430: c0 27 60 38 clr [ %i5 + 0x38 ] vol->mirror = 0; 2014434: c0 2f 60 48 clrb [ %i5 + 0x48 ] vol->afat = 0; 2014438: c0 2f 60 50 clrb [ %i5 + 0x50 ] vol->free_cls = 0xFFFFFFFF; 201443c: c2 27 60 40 st %g1, [ %i5 + 0x40 ] vol->next_cl = 0xFFFFFFFF; 2014440: c2 27 60 44 st %g1, [ %i5 + 0x44 ] int _fat_block_release( rtems_filesystem_mount_table_entry_t *mt_entry) { fat_fs_info_t *fs_info = mt_entry->fs_info; return fat_buf_release(fs_info); 2014444: 7f ff fd 43 call 2013950 2014448: d0 07 20 34 ld [ %i4 + 0x34 ], %o0 vol->next_cl = 0xFFFFFFFF; } _fat_block_release(mt_entry); vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 201444c: d2 07 60 18 ld [ %i5 + 0x18 ], %o1 2014450: 40 00 55 63 call 20299dc <.umul> 2014454: d0 0f 60 50 ldub [ %i5 + 0x50 ], %o0 2014458: c2 17 60 14 lduh [ %i5 + 0x14 ], %g1 /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 201445c: 92 10 20 0c mov 0xc, %o1 vol->next_cl = 0xFFFFFFFF; } _fat_block_release(mt_entry); vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 2014460: 82 02 00 01 add %o0, %g1, %g1 /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 2014464: 90 10 20 02 mov 2, %o0 2014468: 7f ff c4 7e call 2005660 201446c: c2 27 60 4c st %g1, [ %i5 + 0x4c ] if ( fs_info->vhash == NULL ) 2014470: 80 a2 20 00 cmp %o0, 0 2014474: 02 80 01 1a be 20148dc <== NEVER TAKEN 2014478: d0 27 60 68 st %o0, [ %i5 + 0x68 ] RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 201447c: 86 02 20 04 add %o0, 4, %g3 2014480: 82 02 20 0c add %o0, 0xc, %g1 2014484: 84 02 20 10 add %o0, 0x10, %g2 head->next = tail; 2014488: c6 22 00 00 st %g3, [ %o0 ] head->previous = NULL; 201448c: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2014490: d0 22 20 08 st %o0, [ %o0 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2014494: c4 22 20 0c st %g2, [ %o0 + 0xc ] head->previous = NULL; 2014498: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 201449c: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } for (i = 0; i < FAT_HASH_SIZE; i++) rtems_chain_initialize_empty(fs_info->vhash + i); fs_info->rhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 20144a0: 92 10 20 0c mov 0xc, %o1 20144a4: 7f ff c4 6f call 2005660 20144a8: 90 10 20 02 mov 2, %o0 if ( fs_info->rhash == NULL ) 20144ac: 80 a2 20 00 cmp %o0, 0 20144b0: 02 80 01 00 be 20148b0 <== NEVER TAKEN 20144b4: d0 27 60 6c st %o0, [ %i5 + 0x6c ] RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 20144b8: 82 02 20 0c add %o0, 0xc, %g1 20144bc: 84 02 20 04 add %o0, 4, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 20144c0: c2 22 20 14 st %g1, [ %o0 + 0x14 ] RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 20144c4: 82 02 20 10 add %o0, 0x10, %g1 head->next = tail; 20144c8: c4 22 00 00 st %g2, [ %o0 ] head->previous = NULL; 20144cc: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 20144d0: d0 22 20 08 st %o0, [ %o0 + 8 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 20144d4: c0 22 20 10 clr [ %o0 + 0x10 ] } for (i = 0; i < FAT_HASH_SIZE; i++) rtems_chain_initialize_empty(fs_info->rhash + i); fs_info->uino_pool_size = FAT_UINO_POOL_INIT_SIZE; fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; 20144d8: c4 07 60 2c ld [ %i5 + 0x2c ], %g2 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20144dc: c2 22 20 0c st %g1, [ %o0 + 0xc ] 20144e0: c2 0f 60 03 ldub [ %i5 + 3 ], %g1 fs_info->index = 0; 20144e4: c0 27 60 74 clr [ %i5 + 0x74 ] } for (i = 0; i < FAT_HASH_SIZE; i++) rtems_chain_initialize_empty(fs_info->rhash + i); fs_info->uino_pool_size = FAT_UINO_POOL_INIT_SIZE; fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; 20144e8: 83 28 80 01 sll %g2, %g1, %g1 rtems_set_errno_and_return_minus_one( ENOMEM ); } for (i = 0; i < FAT_HASH_SIZE; i++) rtems_chain_initialize_empty(fs_info->rhash + i); fs_info->uino_pool_size = FAT_UINO_POOL_INIT_SIZE; 20144ec: 84 10 21 00 mov 0x100, %g2 fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; 20144f0: 83 28 60 04 sll %g1, 4, %g1 rtems_set_errno_and_return_minus_one( ENOMEM ); } for (i = 0; i < FAT_HASH_SIZE; i++) rtems_chain_initialize_empty(fs_info->rhash + i); fs_info->uino_pool_size = FAT_UINO_POOL_INIT_SIZE; 20144f4: c4 27 60 78 st %g2, [ %i5 + 0x78 ] fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; 20144f8: c2 27 60 7c st %g1, [ %i5 + 0x7c ] fs_info->index = 0; fs_info->uino = (char *)calloc(fs_info->uino_pool_size, sizeof(char)); 20144fc: 90 10 21 00 mov 0x100, %o0 2014500: 7f ff c4 58 call 2005660 2014504: 92 10 20 01 mov 1, %o1 if ( fs_info->uino == NULL ) 2014508: 80 a2 20 00 cmp %o0, 0 201450c: 02 80 00 d5 be 2014860 <== NEVER TAKEN 2014510: d0 27 60 70 st %o0, [ %i5 + 0x70 ] rtems_disk_release(vol->dd); free(fs_info->vhash); free(fs_info->rhash); rtems_set_errno_and_return_minus_one( ENOMEM ); } fs_info->sec_buf = (uint8_t *)calloc(vol->bps, sizeof(uint8_t)); 2014514: d0 17 40 00 lduh [ %i5 ], %o0 2014518: 7f ff c4 52 call 2005660 201451c: 92 10 20 01 mov 1, %o1 2014520: d0 27 60 8c st %o0, [ %i5 + 0x8c ] if (fs_info->sec_buf == NULL) 2014524: 80 a2 20 00 cmp %o0, 0 2014528: 02 80 00 a5 be 20147bc <== NEVER TAKEN 201452c: b0 10 20 00 clr %i0 free(fs_info->uino); rtems_set_errno_and_return_minus_one( ENOMEM ); } return RC_OK; } 2014530: 81 c7 e0 08 ret 2014534: 81 e8 00 00 restore } /* Evaluate boot record */ vol->bps = FAT_GET_BR_BYTES_PER_SECTOR(boot_rec); if ( (vol->bps != 512) && 2014538: 22 bf ff 41 be,a 201423c <== ALWAYS TAKEN 201453c: 83 32 60 19 srl %o1, 0x19, %g1 (vol->bps != 1024) && 2014540: 80 a0 68 00 cmp %g1, 0x800 <== NOT EXECUTED 2014544: 22 bf ff 41 be,a 2014248 <== NOT EXECUTED 2014548: 83 32 60 19 srl %o1, 0x19, %g1 <== NOT EXECUTED (vol->bps != 2048) && 201454c: 05 00 00 04 sethi %hi(0x1000), %g2 <== NOT EXECUTED 2014550: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2014554: 12 80 00 91 bne 2014798 <== NOT EXECUTED 2014558: 83 32 60 19 srl %o1, 0x19, %g1 <== NOT EXECUTED 201455c: 10 bf ff 3e b 2014254 <== NOT EXECUTED 2014560: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED vol->mask = FAT_FAT12_MASK; vol->eoc_val = FAT_FAT12_EOC; } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) 2014564: 03 00 00 3f sethi %hi(0xfc00), %g1 <== NOT EXECUTED 2014568: 84 10 63 f4 or %g1, 0x3f4, %g2 ! fff4 <== NOT EXECUTED 201456c: 80 a2 00 02 cmp %o0, %g2 <== NOT EXECUTED 2014570: 08 80 00 7c bleu 2014760 <== NOT EXECUTED 2014574: 84 10 63 ff or %g1, 0x3ff, %g2 <== NOT EXECUTED if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 2014578: c6 0f bf 8f ldub [ %fp + -113 ], %g3 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 201457c: f6 0f bf 9b ldub [ %fp + -101 ], %i3 <== NOT EXECUTED vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 2014580: 82 08 ff 80 and %g3, -128, %g1 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014584: f4 0f bf 9c ldub [ %fp + -100 ], %i2 <== NOT EXECUTED 2014588: c6 0f bf 9a ldub [ %fp + -102 ], %g3 <== NOT EXECUTED 201458c: f2 0f bf 87 ldub [ %fp + -121 ], %i1 <== NOT EXECUTED 2014590: b7 2e e0 08 sll %i3, 8, %i3 <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 2014594: 05 03 ff ff sethi %hi(0xffffc00), %g2 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014598: 87 28 e0 10 sll %g3, 0x10, %g3 <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 201459c: 88 10 a3 ff or %g2, 0x3ff, %g4 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20145a0: 86 16 c0 03 or %i3, %g3, %g3 <== NOT EXECUTED } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; vol->eoc_val = FAT_FAT32_EOC; 20145a4: 84 10 a3 f8 or %g2, 0x3f8, %g2 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20145a8: 86 10 c0 1a or %g3, %i2, %g3 <== NOT EXECUTED 20145ac: b7 2e 60 18 sll %i1, 0x18, %i3 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 20145b0: b4 10 20 04 mov 4, %i2 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20145b4: 86 10 c0 1b or %g3, %i3, %g3 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 20145b8: f4 2f 60 0a stb %i2, [ %i5 + 0xa ] <== NOT EXECUTED vol->mask = FAT_FAT32_MASK; 20145bc: c8 27 60 0c st %g4, [ %i5 + 0xc ] <== NOT EXECUTED vol->eoc_val = FAT_FAT32_EOC; 20145c0: c4 27 60 10 st %g2, [ %i5 + 0x10 ] <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20145c4: c6 27 60 38 st %g3, [ %i5 + 0x38 ] <== NOT EXECUTED vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; if (vol->mirror) 20145c8: 80 88 60 80 btst 0x80, %g1 <== NOT EXECUTED 20145cc: 02 80 00 6b be 2014778 <== NOT EXECUTED 20145d0: c2 2f 60 48 stb %g1, [ %i5 + 0x48 ] <== NOT EXECUTED vol->afat = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_FAT_NUM; 20145d4: c4 0f bf 8f ldub [ %fp + -113 ], %g2 <== NOT EXECUTED 20145d8: 82 08 a0 0f and %g2, 0xf, %g1 <== NOT EXECUTED 20145dc: c2 2f 60 50 stb %g1, [ %i5 + 0x50 ] <== NOT EXECUTED else vol->afat = 0; vol->info_sec = FAT_GET_BR_FAT32_FS_INFO_SECTOR(boot_rec); 20145e0: d2 0f bf 9d ldub [ %fp + -99 ], %o1 <== NOT EXECUTED 20145e4: c2 0f bf 9e ldub [ %fp + -98 ], %g1 <== NOT EXECUTED 20145e8: 93 2a 60 08 sll %o1, 8, %o1 <== NOT EXECUTED 20145ec: 92 12 40 01 or %o1, %g1, %o1 <== NOT EXECUTED 20145f0: d2 37 60 3c sth %o1, [ %i5 + 0x3c ] <== NOT EXECUTED if( vol->info_sec == 0 ) 20145f4: 93 2a 60 10 sll %o1, 0x10, %o1 <== NOT EXECUTED 20145f8: 93 32 60 10 srl %o1, 0x10, %o1 <== NOT EXECUTED 20145fc: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2014600: 02 80 00 66 be 2014798 <== NOT EXECUTED 2014604: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(mt_entry, vol->info_sec , 0, 2014608: 94 10 20 00 clr %o2 <== NOT EXECUTED 201460c: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2014610: 7f ff fd 2c call 2013ac0 <_fat_block_read> <== NOT EXECUTED 2014614: 98 07 bf f0 add %fp, -16, %o4 <== NOT EXECUTED FAT_FSI_LEADSIG_SIZE, fs_info_sector); if ( ret < 0 ) 2014618: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 201461c: 06 80 00 b9 bl 2014900 <== NOT EXECUTED 2014620: c2 0f bf f3 ldub [ %fp + -13 ], %g1 <== NOT EXECUTED { rtems_disk_release(vol->dd); return -1; } if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != 2014624: c4 0f bf f1 ldub [ %fp + -15 ], %g2 <== NOT EXECUTED 2014628: c8 0f bf f2 ldub [ %fp + -14 ], %g4 <== NOT EXECUTED 201462c: c6 0f bf f0 ldub [ %fp + -16 ], %g3 <== NOT EXECUTED 2014630: 83 28 60 18 sll %g1, 0x18, %g1 <== NOT EXECUTED 2014634: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 2014638: 89 29 20 10 sll %g4, 0x10, %g4 <== NOT EXECUTED 201463c: 84 10 80 04 or %g2, %g4, %g2 <== NOT EXECUTED 2014640: 84 10 80 03 or %g2, %g3, %g2 <== NOT EXECUTED 2014644: 84 10 80 01 or %g2, %g1, %g2 <== NOT EXECUTED 2014648: 03 10 58 54 sethi %hi(0x41615000), %g1 <== NOT EXECUTED 201464c: 82 10 62 52 or %g1, 0x252, %g1 ! 41615252 <== NOT EXECUTED 2014650: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 2014654: 12 80 00 72 bne 201481c <== NOT EXECUTED 2014658: 94 10 21 e4 mov 0x1e4, %o2 <== NOT EXECUTED rtems_disk_release(vol->dd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(mt_entry, vol->info_sec , FAT_FSI_INFO, 201465c: d2 17 60 3c lduh [ %i5 + 0x3c ], %o1 <== NOT EXECUTED 2014660: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 2014664: 96 10 20 0c mov 0xc, %o3 <== NOT EXECUTED 2014668: 7f ff fd 16 call 2013ac0 <_fat_block_read> <== NOT EXECUTED 201466c: 98 07 bf f0 add %fp, -16, %o4 <== NOT EXECUTED FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) 2014670: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2014674: 06 80 00 88 bl 2014894 <== NOT EXECUTED 2014678: c6 0f bf f5 ldub [ %fp + -11 ], %g3 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 201467c: f0 0f bf f6 ldub [ %fp + -10 ], %i0 <== NOT EXECUTED 2014680: f2 0f bf f4 ldub [ %fp + -12 ], %i1 <== NOT EXECUTED 2014684: f4 0f bf f7 ldub [ %fp + -9 ], %i2 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014688: f6 0f bf f9 ldub [ %fp + -7 ], %i3 <== NOT EXECUTED 201468c: c2 0f bf fa ldub [ %fp + -6 ], %g1 <== NOT EXECUTED 2014690: c8 0f bf f8 ldub [ %fp + -8 ], %g4 <== NOT EXECUTED 2014694: c4 0f bf fb ldub [ %fp + -5 ], %g2 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2014698: b1 2e 20 10 sll %i0, 0x10, %i0 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 201469c: 85 28 a0 18 sll %g2, 0x18, %g2 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 20146a0: 87 28 e0 08 sll %g3, 8, %g3 <== NOT EXECUTED 20146a4: b5 2e a0 18 sll %i2, 0x18, %i2 <== NOT EXECUTED 20146a8: 86 10 c0 18 or %g3, %i0, %g3 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 20146ac: b7 2e e0 08 sll %i3, 8, %i3 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 20146b0: 86 10 c0 19 or %g3, %i1, %g3 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 20146b4: 83 28 60 10 sll %g1, 0x10, %g1 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 20146b8: 86 10 c0 1a or %g3, %i2, %g3 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 20146bc: 82 16 c0 01 or %i3, %g1, %g1 <== NOT EXECUTED 20146c0: 82 10 40 04 or %g1, %g4, %g1 <== NOT EXECUTED 20146c4: 82 10 40 02 or %g1, %g2, %g1 <== NOT EXECUTED _fat_block_release(mt_entry); rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 20146c8: c6 27 60 40 st %g3, [ %i5 + 0x40 ] <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); rc = fat_fat32_update_fsinfo_sector(mt_entry, 0xFFFFFFFF, 20146cc: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED rtems_disk_release(vol->dd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 20146d0: c2 27 60 44 st %g1, [ %i5 + 0x44 ] <== NOT EXECUTED rc = fat_fat32_update_fsinfo_sector(mt_entry, 0xFFFFFFFF, 20146d4: 92 10 3f ff mov -1, %o1 <== NOT EXECUTED 20146d8: 7f ff fe 09 call 2013efc <== NOT EXECUTED 20146dc: 94 10 3f ff mov -1, %o2 <== NOT EXECUTED 0xFFFFFFFF); if ( rc != RC_OK ) 20146e0: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 20146e4: 02 bf ff 58 be 2014444 <== NOT EXECUTED 20146e8: 01 00 00 00 nop <== NOT EXECUTED int _fat_block_release( rtems_filesystem_mount_table_entry_t *mt_entry) { fat_fs_info_t *fs_info = mt_entry->fs_info; return fat_buf_release(fs_info); 20146ec: 7f ff fc 99 call 2013950 <== NOT EXECUTED 20146f0: d0 07 20 34 ld [ %i4 + 0x34 ], %o0 <== NOT EXECUTED rc = fat_fat32_update_fsinfo_sector(mt_entry, 0xFFFFFFFF, 0xFFFFFFFF); if ( rc != RC_OK ) { _fat_block_release(mt_entry); rtems_disk_release(vol->dd); 20146f4: 7f ff c1 35 call 2004bc8 <== NOT EXECUTED 20146f8: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED return rc; 20146fc: 81 c7 e0 08 ret <== NOT EXECUTED 2014700: 81 e8 00 00 restore <== NOT EXECUTED vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); else vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM32(boot_rec); 2014704: f2 0f bf 97 ldub [ %fp + -105 ], %i1 <== NOT EXECUTED 2014708: 90 0d a0 ff and %l6, 0xff, %o0 <== NOT EXECUTED 201470c: ae 0d e0 ff and %l7, 0xff, %l7 <== NOT EXECUTED 2014710: 91 2a 20 08 sll %o0, 8, %o0 <== NOT EXECUTED 2014714: af 2d e0 10 sll %l7, 0x10, %l7 <== NOT EXECUTED 2014718: aa 0d 60 ff and %l5, 0xff, %l5 <== NOT EXECUTED 201471c: 90 12 00 17 or %o0, %l7, %o0 <== NOT EXECUTED 2014720: 85 2e 60 18 sll %i1, 0x18, %g2 <== NOT EXECUTED 2014724: 90 12 00 15 or %o0, %l5, %o0 <== NOT EXECUTED 2014728: 90 12 00 02 or %o0, %g2, %o0 <== NOT EXECUTED 201472c: 10 bf ff 34 b 20143fc <== NOT EXECUTED 2014730: d0 27 60 2c st %o0, [ %i5 + 0x2c ] <== NOT EXECUTED vol->rdir_size = vol->rdir_secs << vol->sec_log2; if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); 2014734: c4 0f bf 9f ldub [ %fp + -97 ], %g2 <== NOT EXECUTED 2014738: 90 0d 20 ff and %l4, 0xff, %o0 <== NOT EXECUTED 201473c: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED 2014740: 91 2a 20 08 sll %o0, 8, %o0 <== NOT EXECUTED 2014744: a6 0c e0 ff and %l3, 0xff, %l3 <== NOT EXECUTED 2014748: 90 12 00 02 or %o0, %g2, %o0 <== NOT EXECUTED 201474c: a5 2c a0 18 sll %l2, 0x18, %l2 <== NOT EXECUTED 2014750: 90 12 00 13 or %o0, %l3, %o0 <== NOT EXECUTED 2014754: 90 12 00 12 or %o0, %l2, %o0 <== NOT EXECUTED 2014758: 10 bf ff 15 b 20143ac <== NOT EXECUTED 201475c: d0 27 60 18 st %o0, [ %i5 + 0x18 ] <== NOT EXECUTED } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014760: 86 10 20 02 mov 2, %g3 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; 2014764: 82 10 63 f8 or %g1, 0x3f8, %g1 <== NOT EXECUTED } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014768: c6 2f 60 0a stb %g3, [ %i5 + 0xa ] <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; 201476c: c4 27 60 0c st %g2, [ %i5 + 0xc ] <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; 2014770: 10 bf ff 2f b 201442c <== NOT EXECUTED 2014774: c2 27 60 10 st %g1, [ %i5 + 0x10 ] <== NOT EXECUTED vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; if (vol->mirror) vol->afat = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_FAT_NUM; else vol->afat = 0; 2014778: 10 bf ff 9a b 20145e0 <== NOT EXECUTED 201477c: c0 2f 60 50 clrb [ %i5 + 0x50 ] <== NOT EXECUTED if (rc == -1) return rc; /* Must be a block device. */ if (!S_ISBLK(stat_buf.st_mode)) rtems_set_errno_and_return_minus_one(ENOTTY); 2014780: 40 00 21 eb call 201cf2c <__errno> <== NOT EXECUTED 2014784: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2014788: 82 10 20 19 mov 0x19, %g1 <== NOT EXECUTED 201478c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014790: 81 c7 e0 08 ret <== NOT EXECUTED 2014794: 81 e8 00 00 restore <== NOT EXECUTED vol->afat = 0; vol->info_sec = FAT_GET_BR_FAT32_FS_INFO_SECTOR(boot_rec); if( vol->info_sec == 0 ) { rtems_disk_release(vol->dd); 2014798: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 201479c: 7f ff c1 0b call 2004bc8 <== NOT EXECUTED 20147a0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); 20147a4: 40 00 21 e2 call 201cf2c <__errno> <== NOT EXECUTED 20147a8: 01 00 00 00 nop <== NOT EXECUTED 20147ac: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 20147b0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20147b4: 81 c7 e0 08 ret <== NOT EXECUTED 20147b8: 81 e8 00 00 restore <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); } fs_info->sec_buf = (uint8_t *)calloc(vol->bps, sizeof(uint8_t)); if (fs_info->sec_buf == NULL) { rtems_disk_release(vol->dd); 20147bc: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 20147c0: 7f ff c1 02 call 2004bc8 <== NOT EXECUTED 20147c4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 20147c8: 7f ff c5 04 call 2005bd8 <== NOT EXECUTED 20147cc: d0 07 60 68 ld [ %i5 + 0x68 ], %o0 <== NOT EXECUTED free(fs_info->rhash); 20147d0: 7f ff c5 02 call 2005bd8 <== NOT EXECUTED 20147d4: d0 07 60 6c ld [ %i5 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->uino); 20147d8: 7f ff c5 00 call 2005bd8 <== NOT EXECUTED 20147dc: d0 07 60 70 ld [ %i5 + 0x70 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 20147e0: 40 00 21 d3 call 201cf2c <__errno> <== NOT EXECUTED 20147e4: 01 00 00 00 nop <== NOT EXECUTED 20147e8: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 20147ec: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } return RC_OK; } 20147f0: 81 c7 e0 08 ret <== NOT EXECUTED 20147f4: 81 e8 00 00 restore <== NOT EXECUTED memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); sc = rtems_bdbuf_release( block); if (sc != RTEMS_SUCCESSFUL) { rtems_disk_release(vol->dd); 20147f8: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 20147fc: 7f ff c0 f3 call 2004bc8 <== NOT EXECUTED 2014800: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); 2014804: 40 00 21 ca call 201cf2c <__errno> <== NOT EXECUTED 2014808: 01 00 00 00 nop <== NOT EXECUTED 201480c: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2014810: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014814: 81 c7 e0 08 ret <== NOT EXECUTED 2014818: 81 e8 00 00 restore <== NOT EXECUTED int _fat_block_release( rtems_filesystem_mount_table_entry_t *mt_entry) { fat_fs_info_t *fs_info = mt_entry->fs_info; return fat_buf_release(fs_info); 201481c: d0 07 20 34 ld [ %i4 + 0x34 ], %o0 <== NOT EXECUTED 2014820: 7f ff fc 4c call 2013950 <== NOT EXECUTED 2014824: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != FAT_FSINFO_LEAD_SIGNATURE_VALUE) { _fat_block_release(mt_entry); rtems_disk_release(vol->dd); 2014828: 7f ff c0 e8 call 2004bc8 <== NOT EXECUTED 201482c: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); 2014830: 40 00 21 bf call 201cf2c <__errno> <== NOT EXECUTED 2014834: 01 00 00 00 nop <== NOT EXECUTED 2014838: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 201483c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014840: 81 c7 e0 08 ret <== NOT EXECUTED 2014844: 81 e8 00 00 restore <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOTTY); /* check that device is registred as block device and lock it */ vol->dd = rtems_disk_obtain(stat_buf.st_rdev); if (vol->dd == NULL) rtems_set_errno_and_return_minus_one(EIO); 2014848: 40 00 21 b9 call 201cf2c <__errno> <== NOT EXECUTED 201484c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2014850: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2014854: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014858: 81 c7 e0 08 ret <== NOT EXECUTED 201485c: 81 e8 00 00 restore <== NOT EXECUTED fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; fs_info->index = 0; fs_info->uino = (char *)calloc(fs_info->uino_pool_size, sizeof(char)); if ( fs_info->uino == NULL ) { rtems_disk_release(vol->dd); 2014860: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 2014864: 7f ff c0 d9 call 2004bc8 <== NOT EXECUTED 2014868: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 201486c: 7f ff c4 db call 2005bd8 <== NOT EXECUTED 2014870: d0 07 60 68 ld [ %i5 + 0x68 ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014874: 7f ff c4 d9 call 2005bd8 <== NOT EXECUTED 2014878: d0 07 60 6c ld [ %i5 + 0x6c ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 201487c: 40 00 21 ac call 201cf2c <__errno> <== NOT EXECUTED 2014880: 01 00 00 00 nop <== NOT EXECUTED 2014884: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2014888: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201488c: 81 c7 e0 08 ret <== NOT EXECUTED 2014890: 81 e8 00 00 restore <== NOT EXECUTED int _fat_block_release( rtems_filesystem_mount_table_entry_t *mt_entry) { fat_fs_info_t *fs_info = mt_entry->fs_info; return fat_buf_release(fs_info); 2014894: d0 07 20 34 ld [ %i4 + 0x34 ], %o0 <== NOT EXECUTED 2014898: 7f ff fc 2e call 2013950 <== NOT EXECUTED 201489c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED ret = _fat_block_read(mt_entry, vol->info_sec , FAT_FSI_INFO, FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) { _fat_block_release(mt_entry); rtems_disk_release(vol->dd); 20148a0: 7f ff c0 ca call 2004bc8 <== NOT EXECUTED 20148a4: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED return -1; 20148a8: 81 c7 e0 08 ret <== NOT EXECUTED 20148ac: 81 e8 00 00 restore <== NOT EXECUTED rtems_chain_initialize_empty(fs_info->vhash + i); fs_info->rhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); if ( fs_info->rhash == NULL ) { rtems_disk_release(vol->dd); 20148b0: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 20148b4: 7f ff c0 c5 call 2004bc8 <== NOT EXECUTED 20148b8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 20148bc: 7f ff c4 c7 call 2005bd8 <== NOT EXECUTED 20148c0: d0 07 60 68 ld [ %i5 + 0x68 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 20148c4: 40 00 21 9a call 201cf2c <__errno> <== NOT EXECUTED 20148c8: 01 00 00 00 nop <== NOT EXECUTED 20148cc: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 20148d0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20148d4: 81 c7 e0 08 ret <== NOT EXECUTED 20148d8: 81 e8 00 00 restore <== NOT EXECUTED /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); if ( fs_info->vhash == NULL ) { rtems_disk_release(vol->dd); 20148dc: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 20148e0: 7f ff c0 ba call 2004bc8 <== NOT EXECUTED 20148e4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 20148e8: 40 00 21 91 call 201cf2c <__errno> <== NOT EXECUTED 20148ec: 01 00 00 00 nop <== NOT EXECUTED 20148f0: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 20148f4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20148f8: 81 c7 e0 08 ret <== NOT EXECUTED 20148fc: 81 e8 00 00 restore <== NOT EXECUTED { ret = _fat_block_read(mt_entry, vol->info_sec , 0, FAT_FSI_LEADSIG_SIZE, fs_info_sector); if ( ret < 0 ) { rtems_disk_release(vol->dd); 2014900: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED 2014904: 7f ff c0 b1 call 2004bc8 <== NOT EXECUTED 2014908: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED return -1; 201490c: 81 c7 e0 08 ret <== NOT EXECUTED 2014910: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201b7b4 : uint32_t *chain, uint32_t count, uint32_t *cls_added, uint32_t *last_cl ) { 201b7b4: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 201b7b8: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 uint32_t cl4find = 2; uint32_t next_cln = 0; 201b7bc: c0 27 bf fc clr [ %fp + -4 ] uint32_t save_cln = 0; uint32_t data_cls_val = fs_info->vol.data_cls + 2; 201b7c0: e6 04 20 34 ld [ %l0 + 0x34 ], %l3 uint32_t i = 2; *cls_added = 0; 201b7c4: c0 26 c0 00 clr [ %i3 ] uint32_t *chain, uint32_t count, uint32_t *cls_added, uint32_t *last_cl ) { 201b7c8: ba 10 00 18 mov %i0, %i5 uint32_t data_cls_val = fs_info->vol.data_cls + 2; uint32_t i = 2; *cls_added = 0; if (count == 0) 201b7cc: 80 a6 a0 00 cmp %i2, 0 201b7d0: 02 80 00 46 be 201b8e8 <== NEVER TAKEN 201b7d4: b0 10 20 00 clr %i0 return rc; if (fs_info->vol.next_cl != FAT_UNDEFINED_VALUE) 201b7d8: e2 04 20 44 ld [ %l0 + 0x44 ], %l1 201b7dc: 80 a4 7f ff cmp %l1, -1 201b7e0: 22 80 00 02 be,a 201b7e8 201b7e4: a2 10 20 02 mov 2, %l1 int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t cl4find = 2; uint32_t next_cln = 0; uint32_t save_cln = 0; uint32_t data_cls_val = fs_info->vol.data_cls + 2; 201b7e8: a6 04 e0 02 add %l3, 2, %l3 /* * fs_info->vol.data_cls is exactly the count of data clusters * starting at cluster 2, so the maximum valid cluster number is * (fs_info->vol.data_cls + 1) */ while (i < data_cls_val) 201b7ec: 80 a4 e0 02 cmp %l3, 2 201b7f0: 08 80 00 40 bleu 201b8f0 <== NEVER TAKEN 201b7f4: a4 10 20 02 mov 2, %l2 201b7f8: 10 80 00 17 b 201b854 201b7fc: a8 10 20 00 clr %l4 * wouldn't work properly */ if (*cls_added == 0) { *chain = cl4find; rc = fat_set_fat_cluster(mt_entry, cl4find, FAT_GENFAT_EOC); 201b800: 90 10 00 1d mov %i5, %o0 201b804: 92 10 00 11 mov %l1, %o1 201b808: 7f ff fe f0 call 201b3c8 201b80c: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201b810: 80 a2 20 00 cmp %o0, 0 201b814: 32 80 00 35 bne,a 201b8e8 <== NEVER TAKEN 201b818: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED return rc; } } save_cln = cl4find; (*cls_added)++; 201b81c: c2 06 c0 00 ld [ %i3 ], %g1 201b820: 82 00 60 01 inc %g1 /* have we satisfied request ? */ if (*cls_added == count) 201b824: 80 a6 80 01 cmp %i2, %g1 201b828: 02 80 00 49 be 201b94c <== ALWAYS TAKEN 201b82c: c2 26 c0 00 st %g1, [ %i3 ] 201b830: a8 10 00 11 mov %l1, %l4 <== NOT EXECUTED fat_buf_release(fs_info); return rc; } } i++; cl4find++; 201b834: a2 04 60 01 inc %l1 <== NOT EXECUTED if (cl4find >= data_cls_val) 201b838: 80 a4 c0 11 cmp %l3, %l1 201b83c: 18 80 00 03 bgu 201b848 <== ALWAYS TAKEN 201b840: a4 04 a0 01 inc %l2 cl4find = 2; 201b844: a2 10 20 02 mov 2, %l1 <== NOT EXECUTED /* * fs_info->vol.data_cls is exactly the count of data clusters * starting at cluster 2, so the maximum valid cluster number is * (fs_info->vol.data_cls + 1) */ while (i < data_cls_val) 201b848: 80 a4 c0 12 cmp %l3, %l2 201b84c: 28 80 00 2b bleu,a 201b8f8 <== NEVER TAKEN 201b850: c2 04 20 40 ld [ %l0 + 0x40 ], %g1 <== NOT EXECUTED { rc = fat_get_fat_cluster(mt_entry, cl4find, &next_cln); 201b854: 90 10 00 1d mov %i5, %o0 201b858: 92 10 00 11 mov %l1, %o1 201b85c: 7f ff fe 53 call 201b1a8 201b860: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 201b864: b0 92 20 00 orcc %o0, 0, %i0 201b868: 12 80 00 30 bne 201b928 <== NEVER TAKEN 201b86c: c2 07 bf fc ld [ %fp + -4 ], %g1 if (*cls_added != 0) fat_free_fat_clusters_chain(mt_entry, (*chain)); return rc; } if (next_cln == FAT_GENFAT_FREE) 201b870: 80 a0 60 00 cmp %g1, 0 201b874: 32 bf ff f1 bne,a 201b838 201b878: a2 04 60 01 inc %l1 /* * We are enforced to process allocation of the first free cluster * by separate 'if' statement because otherwise undo function * wouldn't work properly */ if (*cls_added == 0) 201b87c: c2 06 c0 00 ld [ %i3 ], %g1 201b880: 80 a0 60 00 cmp %g1, 0 201b884: 22 bf ff df be,a 201b800 <== ALWAYS TAKEN 201b888: e2 26 40 00 st %l1, [ %i1 ] } } else { /* set EOC value to new allocated cluster */ rc = fat_set_fat_cluster(mt_entry, cl4find, FAT_GENFAT_EOC); 201b88c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b890: 92 10 00 11 mov %l1, %o1 <== NOT EXECUTED 201b894: 7f ff fe cd call 201b3c8 <== NOT EXECUTED 201b898: 94 10 3f ff mov -1, %o2 <== NOT EXECUTED if ( rc != RC_OK ) 201b89c: 82 92 20 00 orcc %o0, 0, %g1 <== NOT EXECUTED 201b8a0: 12 80 00 37 bne 201b97c <== NOT EXECUTED 201b8a4: 92 10 00 14 mov %l4, %o1 <== NOT EXECUTED /* cleanup activity */ fat_free_fat_clusters_chain(mt_entry, (*chain)); return rc; } rc = fat_set_fat_cluster(mt_entry, save_cln, cl4find); 201b8a8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b8ac: 7f ff fe c7 call 201b3c8 <== NOT EXECUTED 201b8b0: 94 10 00 11 mov %l1, %o2 <== NOT EXECUTED if ( rc != RC_OK ) 201b8b4: a8 92 20 00 orcc %o0, 0, %l4 <== NOT EXECUTED 201b8b8: 22 bf ff da be,a 201b820 <== NOT EXECUTED 201b8bc: c2 06 c0 00 ld [ %i3 ], %g1 <== NOT EXECUTED { /* cleanup activity */ fat_free_fat_clusters_chain(mt_entry, (*chain)); 201b8c0: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b8c4: 7f ff ff 83 call 201b6d0 <== NOT EXECUTED 201b8c8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED /* trying to save last allocated cluster for future use */ fat_set_fat_cluster(mt_entry, cl4find, FAT_GENFAT_FREE); 201b8cc: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b8d0: 92 10 00 11 mov %l1, %o1 <== NOT EXECUTED 201b8d4: 7f ff fe bd call 201b3c8 <== NOT EXECUTED 201b8d8: 94 10 20 00 clr %o2 <== NOT EXECUTED /* cleanup activity */ fat_free_fat_clusters_chain(mt_entry, (*chain)); return rc; } rc = fat_set_fat_cluster(mt_entry, save_cln, cl4find); 201b8dc: b0 10 00 14 mov %l4, %i0 <== NOT EXECUTED { /* cleanup activity */ fat_free_fat_clusters_chain(mt_entry, (*chain)); /* trying to save last allocated cluster for future use */ fat_set_fat_cluster(mt_entry, cl4find, FAT_GENFAT_FREE); fat_buf_release(fs_info); 201b8e0: 7f ff e0 1c call 2013950 <== NOT EXECUTED 201b8e4: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED return rc; 201b8e8: 81 c7 e0 08 ret <== NOT EXECUTED 201b8ec: 81 e8 00 00 restore <== NOT EXECUTED /* * fs_info->vol.data_cls is exactly the count of data clusters * starting at cluster 2, so the maximum valid cluster number is * (fs_info->vol.data_cls + 1) */ while (i < data_cls_val) 201b8f0: a8 10 20 00 clr %l4 <== NOT EXECUTED if (cl4find >= data_cls_val) cl4find = 2; } fs_info->vol.next_cl = save_cln; if (fs_info->vol.free_cls != 0xFFFFFFFF) 201b8f4: c2 04 20 40 ld [ %l0 + 0x40 ], %g1 <== NOT EXECUTED 201b8f8: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201b8fc: 02 80 00 05 be 201b910 <== NOT EXECUTED 201b900: e8 24 20 44 st %l4, [ %l0 + 0x44 ] <== NOT EXECUTED fs_info->vol.free_cls -= (*cls_added); 201b904: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201b908: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201b90c: c2 24 20 40 st %g1, [ %l0 + 0x40 ] <== NOT EXECUTED *last_cl = save_cln; 201b910: e8 27 00 00 st %l4, [ %i4 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b914: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED 201b918: 7f ff e0 0e call 2013950 <== NOT EXECUTED 201b91c: b0 10 20 00 clr %i0 <== NOT EXECUTED return RC_OK; 201b920: 81 c7 e0 08 ret <== NOT EXECUTED 201b924: 81 e8 00 00 restore <== NOT EXECUTED while (i < data_cls_val) { rc = fat_get_fat_cluster(mt_entry, cl4find, &next_cln); if ( rc != RC_OK ) { if (*cls_added != 0) 201b928: c2 06 c0 00 ld [ %i3 ], %g1 <== NOT EXECUTED 201b92c: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 201b930: 02 80 00 17 be 201b98c <== NOT EXECUTED 201b934: 01 00 00 00 nop <== NOT EXECUTED fat_free_fat_clusters_chain(mt_entry, (*chain)); 201b938: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b93c: 7f ff ff 65 call 201b6d0 <== NOT EXECUTED 201b940: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b944: 81 c7 e0 08 ret <== NOT EXECUTED 201b948: 81 e8 00 00 restore <== NOT EXECUTED /* have we satisfied request ? */ if (*cls_added == count) { fs_info->vol.next_cl = save_cln; if (fs_info->vol.free_cls != 0xFFFFFFFF) 201b94c: c2 04 20 40 ld [ %l0 + 0x40 ], %g1 201b950: 80 a0 7f ff cmp %g1, -1 201b954: 02 80 00 05 be 201b968 <== ALWAYS TAKEN 201b958: e2 24 20 44 st %l1, [ %l0 + 0x44 ] fs_info->vol.free_cls -= (*cls_added); 201b95c: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201b960: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201b964: c2 24 20 40 st %g1, [ %l0 + 0x40 ] <== NOT EXECUTED *last_cl = save_cln; 201b968: e2 27 00 00 st %l1, [ %i4 ] fat_buf_release(fs_info); 201b96c: 7f ff df f9 call 2013950 201b970: 90 10 00 10 mov %l0, %o0 return rc; 201b974: 81 c7 e0 08 ret 201b978: 81 e8 00 00 restore /* set EOC value to new allocated cluster */ rc = fat_set_fat_cluster(mt_entry, cl4find, FAT_GENFAT_EOC); if ( rc != RC_OK ) { /* cleanup activity */ fat_free_fat_clusters_chain(mt_entry, (*chain)); 201b97c: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b980: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b984: 7f ff ff 53 call 201b6d0 <== NOT EXECUTED 201b988: b0 10 00 01 mov %g1, %i0 <== NOT EXECUTED return rc; 201b98c: 81 c7 e0 08 ret <== NOT EXECUTED 201b990: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201b3c8 : fat_set_fat_cluster( rtems_filesystem_mount_table_entry_t *mt_entry, uint32_t cln, uint32_t in_val ) { 201b3c8: 9d e3 bf 98 save %sp, -104, %sp fat_fs_info_t *fs_info = mt_entry->fs_info; uint32_t sec = 0; uint32_t ofs = 0; uint16_t fat16_clv = 0; uint32_t fat32_clv = 0; rtems_bdbuf_buffer *block0 = NULL; 201b3cc: c0 27 bf fc clr [ %fp + -4 ] /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201b3d0: 80 a6 60 01 cmp %i1, 1 201b3d4: 08 80 00 90 bleu 201b614 <== NEVER TAKEN 201b3d8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 201b3dc: c2 07 60 34 ld [ %i5 + 0x34 ], %g1 201b3e0: 82 00 60 01 inc %g1 201b3e4: 80 a6 40 01 cmp %i1, %g1 201b3e8: 18 80 00 8b bgu 201b614 <== NEVER TAKEN 201b3ec: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b3f0: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 201b3f4: 80 88 60 01 btst 1, %g1 201b3f8: 12 80 00 22 bne 201b480 <== ALWAYS TAKEN 201b3fc: e0 0f 60 02 ldub [ %i5 + 2 ], %l0 201b400: 80 88 60 02 btst 2, %g1 <== NOT EXECUTED 201b404: 02 80 00 25 be 201b498 <== NOT EXECUTED 201b408: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 <== NOT EXECUTED 201b40c: b9 2e 60 01 sll %i1, 1, %i4 <== NOT EXECUTED 201b410: a1 37 00 10 srl %i4, %l0, %l0 <== NOT EXECUTED 201b414: a0 04 00 01 add %l0, %g1, %l0 <== NOT EXECUTED fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b418: e2 17 40 00 lduh [ %i5 ], %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201b41c: 90 10 00 1d mov %i5, %o0 201b420: 92 10 00 10 mov %l0, %o1 201b424: 94 10 20 01 mov 1, %o2 201b428: 7f ff e0 c3 call 2013734 201b42c: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201b430: b0 92 20 00 orcc %o0, 0, %i0 201b434: 12 80 00 11 bne 201b478 <== NEVER TAKEN 201b438: a3 2c 60 10 sll %l1, 0x10, %l1 return rc; switch ( fs_info->vol.type ) 201b43c: f6 0f 60 0a ldub [ %i5 + 0xa ], %i3 201b440: 80 a6 e0 02 cmp %i3, 2 if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201b444: a3 34 60 10 srl %l1, 0x10, %l1 201b448: a2 04 7f ff add %l1, -1, %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201b44c: 02 80 00 17 be 201b4a8 <== NEVER TAKEN 201b450: b8 0f 00 11 and %i4, %l1, %i4 201b454: 80 a6 e0 04 cmp %i3, 4 201b458: 02 80 00 3d be 201b54c <== NEVER TAKEN 201b45c: 80 a6 e0 01 cmp %i3, 1 201b460: 02 80 00 1d be 201b4d4 <== ALWAYS TAKEN 201b464: 80 8e 60 01 btst 1, %i1 fat_buf_mark_modified(fs_info); break; default: rtems_set_errno_and_return_minus_one(EIO); 201b468: 40 00 06 b1 call 201cf2c <__errno> <== NOT EXECUTED 201b46c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b470: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201b474: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED break; } return RC_OK; } 201b478: 81 c7 e0 08 ret <== NOT EXECUTED 201b47c: 81 e8 00 00 restore <== NOT EXECUTED /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + 201b480: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 201b484: b9 36 60 01 srl %i1, 1, %i4 201b488: b8 07 00 19 add %i4, %i1, %i4 201b48c: a1 37 00 10 srl %i4, %l0, %l0 201b490: 10 bf ff e2 b 201b418 201b494: a0 04 00 01 add %l0, %g1, %l0 201b498: b9 2e 60 02 sll %i1, 2, %i4 <== NOT EXECUTED 201b49c: a1 37 00 10 srl %i4, %l0, %l0 <== NOT EXECUTED 201b4a0: 10 bf ff de b 201b418 <== NOT EXECUTED 201b4a4: a0 04 00 01 add %l0, %g1, %l0 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 201b4a8: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); 201b4ac: b5 2e a0 10 sll %i2, 0x10, %i2 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 201b4b0: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); 201b4b4: 85 36 a0 08 srl %i2, 8, %g2 <== NOT EXECUTED 201b4b8: b5 36 a0 18 srl %i2, 0x18, %i2 <== NOT EXECUTED 201b4bc: b4 10 80 1a or %g2, %i2, %i2 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 201b4c0: f4 30 40 1c sth %i2, [ %g1 + %i4 ] <== NOT EXECUTED } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 201b4c4: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 201b4c8: c2 2f 60 84 stb %g1, [ %i5 + 0x84 ] <== NOT EXECUTED 201b4cc: 81 c7 e0 08 ret <== NOT EXECUTED 201b4d0: 81 e8 00 00 restore <== NOT EXECUTED return rc; switch ( fs_info->vol.type ) { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) 201b4d4: 02 80 00 35 be 201b5a8 201b4d8: c2 07 bf fc ld [ %fp + -4 ], %g1 { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = 201b4dc: 85 2e a0 04 sll %i2, 4, %g2 case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; 201b4e0: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = 201b4e4: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201b4e8: 86 08 e0 0f and %g3, 0xf, %g3 201b4ec: c6 28 40 1c stb %g3, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) | 201b4f0: c2 07 bf fc ld [ %fp + -4 ], %g1 201b4f4: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = 201b4f8: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201b4fc: 84 10 c0 02 or %g3, %g2, %g2 201b500: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) | (uint8_t )(fat16_clv & 0x00FF); fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201b504: c2 17 40 00 lduh [ %i5 ], %g1 201b508: 82 00 7f ff add %g1, -1, %g1 201b50c: 80 a0 40 1c cmp %g1, %i4 201b510: 02 80 00 5c be 201b680 <== NEVER TAKEN 201b514: f6 2f 60 84 stb %i3, [ %i5 + 0x84 ] fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; 201b518: c2 07 bf fc ld [ %fp + -4 ], %g1 201b51c: b8 07 20 01 inc %i4 201b520: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 201b524: b5 2e a0 14 sll %i2, 0x14, %i2 fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; 201b528: c0 28 40 1c clrb [ %g1 + %i4 ] *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | 201b52c: c2 07 bf fc ld [ %fp + -4 ], %g1 (uint8_t )((fat16_clv & 0xFF00)>>8); 201b530: b5 36 a0 18 srl %i2, 0x18, %i2 else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | 201b534: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; *((uint8_t *)(block0->buffer + ofs + 1)) = 201b538: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b53c: 84 10 80 1a or %g2, %i2, %g2 201b540: c4 28 40 1c stb %g2, [ %g1 + %i4 ] 201b544: 81 c7 e0 08 ret 201b548: 81 e8 00 00 restore case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 201b54c: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b550: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); fat_buf_mark_modified(fs_info); break; case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); 201b554: 03 3c 00 00 sethi %hi(0xf0000000), %g1 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 201b558: c6 00 80 1c ld [ %g2 + %i4 ], %g3 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); fat_buf_mark_modified(fs_info); break; case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); 201b55c: 82 2e 80 01 andn %i2, %g1, %g1 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201b560: 89 30 60 18 srl %g1, 0x18, %g4 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201b564: b7 30 60 08 srl %g1, 8, %i3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b568: b5 2e a0 18 sll %i2, 0x18, %i2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201b56c: b6 0e e0 ff and %i3, 0xff, %i3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b570: b4 16 80 04 or %i2, %g4, %i2 <== NOT EXECUTED 201b574: b7 2e e0 10 sll %i3, 0x10, %i3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201b578: 89 30 60 10 srl %g1, 0x10, %g4 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 201b57c: 86 08 e0 f0 and %g3, 0xf0, %g3 <== NOT EXECUTED 201b580: 88 09 20 ff and %g4, 0xff, %g4 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b584: 82 16 80 1b or %i2, %i3, %g1 <== NOT EXECUTED 201b588: 89 29 20 08 sll %g4, 8, %g4 <== NOT EXECUTED 201b58c: 82 10 40 04 or %g1, %g4, %g1 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = fat32_clv | (*((uint32_t *)(block0->buffer + ofs))); 201b590: 82 10 40 03 or %g1, %g3, %g1 <== NOT EXECUTED fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); *((uint32_t *)(block0->buffer + ofs)) = 201b594: c2 20 80 1c st %g1, [ %g2 + %i4 ] <== NOT EXECUTED 201b598: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 201b59c: c2 2f 60 84 stb %g1, [ %i5 + 0x84 ] <== NOT EXECUTED 201b5a0: 81 c7 e0 08 ret <== NOT EXECUTED 201b5a4: 81 e8 00 00 restore <== NOT EXECUTED (uint8_t )((fat16_clv & 0xFF00)>>8); } } else { fat16_clv = ((uint16_t )in_val) & FAT_FAT12_MASK; 201b5a8: b4 0e af ff and %i2, 0xfff, %i2 *((uint8_t *)(block0->buffer + ofs)) &= 0x00; 201b5ac: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 201b5b0: c0 28 40 1c clrb [ %g1 + %i4 ] *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) | 201b5b4: c2 07 bf fc ld [ %fp + -4 ], %g1 201b5b8: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 else { fat16_clv = ((uint16_t )in_val) & FAT_FAT12_MASK; *((uint8_t *)(block0->buffer + ofs)) &= 0x00; *((uint8_t *)(block0->buffer + ofs)) = 201b5bc: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b5c0: 84 16 80 02 or %i2, %g2, %g2 201b5c4: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) | (uint8_t )(fat16_clv & 0x00FF); fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201b5c8: c2 17 40 00 lduh [ %i5 ], %g1 201b5cc: 82 00 7f ff add %g1, -1, %g1 201b5d0: 80 a0 40 1c cmp %g1, %i4 201b5d4: 02 80 00 16 be 201b62c <== NEVER TAKEN 201b5d8: f6 2f 60 84 stb %i3, [ %i5 + 0x84 ] fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; 201b5dc: c2 07 bf fc ld [ %fp + -4 ], %g1 201b5e0: b8 07 20 01 inc %i4 201b5e4: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 *((uint8_t *)(block0->buffer + ofs+1)) = (*((uint8_t *)(block0->buffer + ofs+1))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 201b5e8: b5 36 a0 08 srl %i2, 8, %i2 fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) = 201b5ec: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b5f0: 84 08 bf f0 and %g2, -16, %g2 201b5f4: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; *((uint8_t *)(block0->buffer + ofs+1)) = (*((uint8_t *)(block0->buffer + ofs+1))) | 201b5f8: c2 07 bf fc ld [ %fp + -4 ], %g1 201b5fc: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 else { *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; *((uint8_t *)(block0->buffer + ofs+1)) = 201b600: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b604: b4 10 80 1a or %g2, %i2, %i2 201b608: f4 28 40 1c stb %i2, [ %g1 + %i4 ] 201b60c: 81 c7 e0 08 ret 201b610: 81 e8 00 00 restore uint32_t fat32_clv = 0; rtems_bdbuf_buffer *block0 = NULL; /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); 201b614: 40 00 06 46 call 201cf2c <__errno> <== NOT EXECUTED 201b618: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b61c: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201b620: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201b624: 81 c7 e0 08 ret <== NOT EXECUTED 201b628: 81 e8 00 00 restore <== NOT EXECUTED fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) { rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, 201b62c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b630: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201b634: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b638: 7f ff e0 3f call 2013734 <== NOT EXECUTED 201b63c: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 201b640: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201b644: 12 bf ff 8d bne 201b478 <== NOT EXECUTED 201b648: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 201b64c: b5 36 a0 08 srl %i2, 8, %i2 <== NOT EXECUTED &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; 201b650: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) = 201b654: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b658: 84 08 bf f0 and %g2, -16, %g2 <== NOT EXECUTED 201b65c: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | 201b660: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b664: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED return rc; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = 201b668: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b66c: 84 16 80 02 or %i2, %g2, %g2 <== NOT EXECUTED 201b670: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201b674: f6 2f 60 84 stb %i3, [ %i5 + 0x84 ] <== NOT EXECUTED 201b678: 81 c7 e0 08 ret <== NOT EXECUTED 201b67c: 81 e8 00 00 restore <== NOT EXECUTED fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) { rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, 201b680: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b684: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201b688: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b68c: 7f ff e0 2a call 2013734 <== NOT EXECUTED 201b690: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 201b694: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201b698: 12 bf ff 78 bne 201b478 <== NOT EXECUTED 201b69c: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) &= 0x00; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 201b6a0: 87 2e a0 14 sll %i2, 0x14, %g3 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; 201b6a4: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 201b6a8: 87 30 e0 18 srl %g3, 0x18, %g3 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; 201b6ac: c0 28 40 00 clrb [ %g1 ] <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | 201b6b0: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b6b4: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 <== NOT EXECUTED if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; *((uint8_t *)(block0->buffer)) = 201b6b8: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b6bc: 84 10 c0 02 or %g3, %g2, %g2 <== NOT EXECUTED 201b6c0: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201b6c4: f6 2f 60 84 stb %i3, [ %i5 + 0x84 ] <== NOT EXECUTED 201b6c8: 81 c7 e0 08 ret <== NOT EXECUTED 201b6cc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013fbc : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_shutdown_drive(rtems_filesystem_mount_table_entry_t *mt_entry) { 2013fbc: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED int rc = RC_OK; fat_fs_info_t *fs_info = mt_entry->fs_info; 2013fc0: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 <== NOT EXECUTED int i = 0; if (fs_info->vol.type & FAT_FAT32) 2013fc4: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 <== NOT EXECUTED 2013fc8: 80 88 60 04 btst 4, %g1 <== NOT EXECUTED 2013fcc: 12 80 00 3a bne 20140b4 <== NOT EXECUTED 2013fd0: b8 10 20 00 clr %i4 <== NOT EXECUTED fs_info->vol.next_cl); if ( rc != RC_OK ) rc = -1; } fat_buf_release(fs_info); 2013fd4: 7f ff fe 5f call 2013950 <== NOT EXECUTED 2013fd8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED if (rtems_bdbuf_syncdev(fs_info->vol.dev) != RTEMS_SUCCESSFUL) 2013fdc: 7f ff f8 74 call 20121ac <== NOT EXECUTED 2013fe0: d0 1f 60 58 ldd [ %i5 + 0x58 ], %o0 <== NOT EXECUTED 2013fe4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013fe8: 32 80 00 3b bne,a 20140d4 <== NOT EXECUTED 2013fec: b8 10 3f ff mov -1, %i4 <== NOT EXECUTED rc = -1; 2013ff0: b4 10 20 00 clr %i2 <== NOT EXECUTED for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->vhash + i; 2013ff4: f6 07 60 68 ld [ %i5 + 0x68 ], %i3 <== NOT EXECUTED while ( (node = rtems_chain_get(the_chain)) != NULL ) 2013ff8: 10 80 00 04 b 2014008 <== NOT EXECUTED 2013ffc: b6 06 c0 1a add %i3, %i2, %i3 <== NOT EXECUTED free(node); 2014000: 7f ff c6 f6 call 2005bd8 <== NOT EXECUTED 2014004: 01 00 00 00 nop <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2014008: 7f ff db d9 call 200af6c <_Chain_Get> <== NOT EXECUTED 201400c: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->vhash + i; while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014010: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2014014: 12 bf ff fb bne 2014000 <== NOT EXECUTED 2014018: 01 00 00 00 nop <== NOT EXECUTED 201401c: b4 06 a0 0c add %i2, 0xc, %i2 <== NOT EXECUTED fat_buf_release(fs_info); if (rtems_bdbuf_syncdev(fs_info->vol.dev) != RTEMS_SUCCESSFUL) rc = -1; for (i = 0; i < FAT_HASH_SIZE; i++) 2014020: 80 a6 a0 18 cmp %i2, 0x18 <== NOT EXECUTED 2014024: 32 bf ff f5 bne,a 2013ff8 <== NOT EXECUTED 2014028: f6 07 60 68 ld [ %i5 + 0x68 ], %i3 <== NOT EXECUTED 201402c: b4 10 20 00 clr %i2 <== NOT EXECUTED } for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->rhash + i; 2014030: f6 07 60 6c ld [ %i5 + 0x6c ], %i3 <== NOT EXECUTED while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014034: 10 80 00 04 b 2014044 <== NOT EXECUTED 2014038: b6 06 c0 1a add %i3, %i2, %i3 <== NOT EXECUTED free(node); 201403c: 7f ff c6 e7 call 2005bd8 <== NOT EXECUTED 2014040: 01 00 00 00 nop <== NOT EXECUTED 2014044: 7f ff db ca call 200af6c <_Chain_Get> <== NOT EXECUTED 2014048: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->rhash + i; while ( (node = rtems_chain_get(the_chain)) != NULL ) 201404c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2014050: 12 bf ff fb bne 201403c <== NOT EXECUTED 2014054: 01 00 00 00 nop <== NOT EXECUTED 2014058: b4 06 a0 0c add %i2, 0xc, %i2 <== NOT EXECUTED while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } for (i = 0; i < FAT_HASH_SIZE; i++) 201405c: 80 a6 a0 18 cmp %i2, 0x18 <== NOT EXECUTED 2014060: 32 bf ff f5 bne,a 2014034 <== NOT EXECUTED 2014064: f6 07 60 6c ld [ %i5 + 0x6c ], %i3 <== NOT EXECUTED while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } free(fs_info->vhash); 2014068: 7f ff c6 dc call 2005bd8 <== NOT EXECUTED 201406c: d0 07 60 68 ld [ %i5 + 0x68 ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014070: 7f ff c6 da call 2005bd8 <== NOT EXECUTED 2014074: d0 07 60 6c ld [ %i5 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->uino); 2014078: 7f ff c6 d8 call 2005bd8 <== NOT EXECUTED 201407c: d0 07 60 70 ld [ %i5 + 0x70 ], %o0 <== NOT EXECUTED free(fs_info->sec_buf); 2014080: 7f ff c6 d6 call 2005bd8 <== NOT EXECUTED 2014084: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 <== NOT EXECUTED rtems_disk_release(fs_info->vol.dd); 2014088: 7f ff c2 d0 call 2004bc8 <== NOT EXECUTED 201408c: d0 07 60 60 ld [ %i5 + 0x60 ], %o0 <== NOT EXECUTED if (rc) 2014090: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 2014094: 02 80 00 06 be 20140ac <== NOT EXECUTED 2014098: 01 00 00 00 nop <== NOT EXECUTED errno = EIO; 201409c: 40 00 23 a4 call 201cf2c <__errno> <== NOT EXECUTED 20140a0: 01 00 00 00 nop <== NOT EXECUTED 20140a4: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 20140a8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED return rc; } 20140ac: 81 c7 e0 08 ret <== NOT EXECUTED 20140b0: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED fat_fs_info_t *fs_info = mt_entry->fs_info; int i = 0; if (fs_info->vol.type & FAT_FAT32) { rc = fat_fat32_update_fsinfo_sector(mt_entry, fs_info->vol.free_cls, 20140b4: d2 07 60 40 ld [ %i5 + 0x40 ], %o1 <== NOT EXECUTED 20140b8: d4 07 60 44 ld [ %i5 + 0x44 ], %o2 <== NOT EXECUTED 20140bc: 7f ff ff 90 call 2013efc <== NOT EXECUTED 20140c0: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED fs_info->vol.next_cl); if ( rc != RC_OK ) 20140c4: b8 92 20 00 orcc %o0, 0, %i4 <== NOT EXECUTED 20140c8: 32 bf ff c3 bne,a 2013fd4 <== NOT EXECUTED 20140cc: b8 10 3f ff mov -1, %i4 <== NOT EXECUTED 20140d0: 30 bf ff c1 b,a 2013fd4 <== NOT EXECUTED } fat_buf_release(fs_info); if (rtems_bdbuf_syncdev(fs_info->vol.dev) != RTEMS_SUCCESSFUL) rc = -1; 20140d4: 10 bf ff c8 b 2013ff4 <== NOT EXECUTED 20140d8: b4 10 20 00 clr %i2 <== NOT EXECUTED =============================================================================== 0201a230 : int fcntl( int fd, int cmd, ... ) { 201a230: 9d e3 bf 90 save %sp, -112, %sp int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 201a234: 03 00 80 73 sethi %hi(0x201cc00), %g1 201a238: c4 00 61 c8 ld [ %g1 + 0x1c8 ], %g2 ! 201cdc8 ... ) { int ret; va_list ap; va_start( ap, cmd ); 201a23c: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 201a240: 82 07 a0 4c add %fp, 0x4c, %g1 201a244: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 201a248: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 201a24c: fa 27 a0 58 st %i5, [ %fp + 0x58 ] int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 201a250: 80 a6 00 02 cmp %i0, %g2 201a254: 1a 80 00 65 bcc 201a3e8 201a258: c2 27 bf fc st %g1, [ %fp + -4 ] iop = rtems_libio_iop( fd ); 201a25c: 3b 00 80 76 sethi %hi(0x201d800), %i5 201a260: c6 07 60 24 ld [ %i5 + 0x24 ], %g3 ! 201d824 201a264: 93 2e 20 06 sll %i0, 6, %o1 201a268: 92 00 c0 09 add %g3, %o1, %o1 rtems_libio_check_is_open(iop); 201a26c: d0 02 60 18 ld [ %o1 + 0x18 ], %o0 201a270: 80 8a 21 00 btst 0x100, %o0 201a274: 02 80 00 5d be 201a3e8 201a278: 80 a6 60 09 cmp %i1, 9 /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 201a27c: 08 80 00 08 bleu 201a29c 201a280: 89 2e 60 02 sll %i1, 2, %g4 errno = ENOTSUP; ret = -1; break; default: errno = EINVAL; 201a284: 7f ff d5 16 call 200f6dc <__errno> 201a288: b0 10 3f ff mov -1, %i0 201a28c: 82 10 20 16 mov 0x16, %g1 201a290: c2 22 00 00 st %g1, [ %o0 ] 201a294: 81 c7 e0 08 ret 201a298: 81 e8 00 00 restore /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 201a29c: 31 00 80 68 sethi %hi(0x201a000), %i0 201a2a0: b0 16 22 08 or %i0, 0x208, %i0 ! 201a208 <_calloc_r+0x14> 201a2a4: c8 06 00 04 ld [ %i0 + %g4 ], %g4 201a2a8: 81 c1 00 00 jmp %g4 201a2ac: 01 00 00 00 nop errno = ENOTSUP; ret = -1; break; case F_GETOWN: /* for sockets. */ errno = ENOTSUP; 201a2b0: 7f ff d5 0b call 200f6dc <__errno> 201a2b4: 01 00 00 00 nop 201a2b8: 82 10 20 86 mov 0x86, %g1 ! 86 201a2bc: c2 22 00 00 st %g1, [ %o0 ] int mask; int ret = 0; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open(iop); 201a2c0: 81 c7 e0 08 ret 201a2c4: 91 e8 3f ff restore %g0, -1, %o0 case F_GETFL: /* more flags (cloexec) */ ret = rtems_libio_to_fcntl_flags( iop->flags ); break; case F_SETFL: flags = rtems_libio_fcntl_flags( va_arg( ap, int ) ); 201a2c8: d0 00 40 00 ld [ %g1 ], %o0 201a2cc: 7f ff a5 6e call 2003884 201a2d0: d2 27 bf f4 st %o1, [ %fp + -12 ] /* * XXX If we are turning on append, should we seek to the end? */ iop->flags = (iop->flags & ~mask) | (flags & mask); 201a2d4: d2 07 bf f4 ld [ %fp + -12 ], %o1 201a2d8: 90 0a 22 01 and %o0, 0x201, %o0 201a2dc: c2 02 60 18 ld [ %o1 + 0x18 ], %g1 rtems_libio_t *iop; rtems_libio_t *diop; int fd2; int flags; int mask; int ret = 0; 201a2e0: b0 10 20 00 clr %i0 /* * XXX If we are turning on append, should we seek to the end? */ iop->flags = (iop->flags & ~mask) | (flags & mask); 201a2e4: 82 08 7d fe and %g1, -514, %g1 201a2e8: 82 12 00 01 or %o0, %g1, %g1 201a2ec: c2 22 60 18 st %g1, [ %o1 + 0x18 ] * If we got this far successfully, then we give the optional * filesystem specific handler a chance to process this. */ if (ret >= 0) { int err = (*iop->pathinfo.handlers->fcntl_h)( cmd, iop ); 201a2f0: c2 02 60 24 ld [ %o1 + 0x24 ], %g1 201a2f4: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 201a2f8: 9f c0 40 00 call %g1 201a2fc: 90 10 00 19 mov %i1, %o0 if (err) { 201a300: b2 92 20 00 orcc %o0, 0, %i1 201a304: 12 80 00 04 bne 201a314 <== NEVER TAKEN 201a308: 01 00 00 00 nop va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 201a30c: 81 c7 e0 08 ret 201a310: 81 e8 00 00 restore */ if (ret >= 0) { int err = (*iop->pathinfo.handlers->fcntl_h)( cmd, iop ); if (err) { errno = err; 201a314: 7f ff d4 f2 call 200f6dc <__errno> <== NOT EXECUTED 201a318: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201a31c: f2 22 00 00 st %i1, [ %o0 ] <== NOT EXECUTED va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 201a320: 81 c7 e0 08 ret <== NOT EXECUTED 201a324: 81 e8 00 00 restore <== NOT EXECUTED else iop->flags &= ~LIBIO_FLAGS_CLOSE_ON_EXEC; break; case F_GETFL: /* more flags (cloexec) */ ret = rtems_libio_to_fcntl_flags( iop->flags ); 201a328: 7f ff a5 64 call 20038b8 201a32c: d2 27 bf f4 st %o1, [ %fp + -12 ] 201a330: d2 07 bf f4 ld [ %fp + -12 ], %o1 201a334: b0 10 00 08 mov %o0, %i0 /* * If we got this far successfully, then we give the optional * filesystem specific handler a chance to process this. */ if (ret >= 0) { 201a338: 80 a6 20 00 cmp %i0, 0 201a33c: 36 bf ff ee bge,a 201a2f4 <== ALWAYS TAKEN 201a340: c2 02 60 24 ld [ %o1 + 0x24 ], %g1 va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 201a344: 81 c7 e0 08 ret <== NOT EXECUTED 201a348: 81 e8 00 00 restore <== NOT EXECUTED * if a new process is exec()'ed. Since RTEMS does not support * processes, then we can ignore this one except to make * F_GETFD work. */ if ( va_arg( ap, int ) ) 201a34c: c2 00 40 00 ld [ %g1 ], %g1 201a350: 80 a0 60 00 cmp %g1, 0 201a354: 22 80 00 22 be,a 201a3dc 201a358: 90 0a 37 ff and %o0, -2049, %o0 iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; 201a35c: 90 12 28 00 or %o0, 0x800, %o0 rtems_libio_t *iop; rtems_libio_t *diop; int fd2; int flags; int mask; int ret = 0; 201a360: b0 10 20 00 clr %i0 * processes, then we can ignore this one except to make * F_GETFD work. */ if ( va_arg( ap, int ) ) iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; 201a364: 10 bf ff e3 b 201a2f0 201a368: d0 22 60 18 st %o0, [ %o1 + 0x18 ] diop->pathinfo = iop->pathinfo; ret = (int) (diop - rtems_libio_iops); break; case F_GETFD: /* get f_flags */ ret = ((iop->flags & LIBIO_FLAGS_CLOSE_ON_EXEC) != 0); 201a36c: 90 0a 28 00 and %o0, 0x800, %o0 201a370: 80 a0 00 08 cmp %g0, %o0 201a374: 10 bf ff df b 201a2f0 201a378: b0 40 20 00 addx %g0, 0, %i0 * This switch should contain all the cases from POSIX. */ switch ( cmd ) { case F_DUPFD: /* dup */ fd2 = va_arg( ap, int ); 201a37c: c8 00 40 00 ld [ %g1 ], %g4 if ( fd2 ) 201a380: 80 a1 20 00 cmp %g4, 0 201a384: 02 80 00 1f be 201a400 201a388: b0 10 20 00 clr %i0 diop = rtems_libio_iop( fd2 ); 201a38c: 80 a0 80 04 cmp %g2, %g4 201a390: 08 80 00 05 bleu 201a3a4 <== NEVER TAKEN 201a394: 82 10 20 00 clr %g1 201a398: 83 29 20 06 sll %g4, 6, %g1 201a39c: 82 00 c0 01 add %g3, %g1, %g1 201a3a0: b0 10 00 01 mov %g1, %i0 break; } } diop->flags = iop->flags; diop->pathinfo = iop->pathinfo; 201a3a4: c4 02 60 1c ld [ %o1 + 0x1c ], %g2 ret = (int) (diop - rtems_libio_iops); 201a3a8: b0 26 00 03 sub %i0, %g3, %i0 break; } } diop->flags = iop->flags; diop->pathinfo = iop->pathinfo; 201a3ac: c4 20 60 1c st %g2, [ %g1 + 0x1c ] 201a3b0: c4 02 60 20 ld [ %o1 + 0x20 ], %g2 ret = -1; break; } } diop->flags = iop->flags; 201a3b4: d0 20 60 18 st %o0, [ %g1 + 0x18 ] diop->pathinfo = iop->pathinfo; 201a3b8: c4 20 60 20 st %g2, [ %g1 + 0x20 ] 201a3bc: c4 02 60 24 ld [ %o1 + 0x24 ], %g2 ret = (int) (diop - rtems_libio_iops); 201a3c0: b1 3e 20 06 sra %i0, 6, %i0 break; } } diop->flags = iop->flags; diop->pathinfo = iop->pathinfo; 201a3c4: c4 20 60 24 st %g2, [ %g1 + 0x24 ] 201a3c8: c4 02 60 28 ld [ %o1 + 0x28 ], %g2 201a3cc: c4 20 60 28 st %g2, [ %g1 + 0x28 ] 201a3d0: c4 02 60 2c ld [ %o1 + 0x2c ], %g2 201a3d4: 10 bf ff d9 b 201a338 201a3d8: c4 20 60 2c st %g2, [ %g1 + 0x2c ] rtems_libio_t *iop; rtems_libio_t *diop; int fd2; int flags; int mask; int ret = 0; 201a3dc: b0 10 20 00 clr %i0 */ if ( va_arg( ap, int ) ) iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; else iop->flags &= ~LIBIO_FLAGS_CLOSE_ON_EXEC; 201a3e0: 10 bf ff c4 b 201a2f0 201a3e4: d0 22 60 18 st %o0, [ %o1 + 0x18 ] int mask; int ret = 0; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open(iop); 201a3e8: 7f ff d4 bd call 200f6dc <__errno> 201a3ec: b0 10 3f ff mov -1, %i0 201a3f0: 82 10 20 09 mov 9, %g1 201a3f4: c2 22 00 00 st %g1, [ %o0 ] 201a3f8: 81 c7 e0 08 ret 201a3fc: 81 e8 00 00 restore fd2 = va_arg( ap, int ); if ( fd2 ) diop = rtems_libio_iop( fd2 ); else { /* allocate a file control block */ diop = rtems_libio_allocate(); 201a400: 7f ff a5 45 call 2003914 201a404: d2 27 bf f4 st %o1, [ %fp + -12 ] if ( diop == 0 ) { 201a408: 82 92 20 00 orcc %o0, 0, %g1 201a40c: 02 bf ff ad be 201a2c0 <== NEVER TAKEN 201a410: d2 07 bf f4 ld [ %fp + -12 ], %o1 201a414: d0 02 60 18 ld [ %o1 + 0x18 ], %o0 201a418: c6 07 60 24 ld [ %i5 + 0x24 ], %g3 201a41c: 10 bf ff e2 b 201a3a4 201a420: b0 10 00 01 mov %g1, %i0 =============================================================================== 0200d740 : */ int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200d740: 9d e3 bf 98 save %sp, -104, %sp static int pipe_lock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { 200d744: 3b 00 80 82 sethi %hi(0x2020800), %i5 200d748: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 ! 2020a90 */ int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200d74c: b8 10 00 18 mov %i0, %i4 static int pipe_lock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { 200d750: 80 a2 20 00 cmp %o0, 0 200d754: 02 80 00 54 be 200d8a4 200d758: b4 17 62 90 or %i5, 0x290, %i2 rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { sc = rtems_semaphore_obtain(pipe_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 200d75c: 92 10 20 00 clr %o1 200d760: 94 10 20 00 clr %o2 200d764: 7f ff ec 0b call 2008790 200d768: b0 10 3f f4 mov -12, %i0 } if (sc == RTEMS_SUCCESSFUL) { 200d76c: 80 a2 20 00 cmp %o0, 0 200d770: 12 80 01 06 bne 200db88 <== NEVER TAKEN 200d774: 01 00 00 00 nop err = pipe_lock(); if (err) return err; pipe = *pipep; 200d778: f6 07 00 00 ld [ %i4 ], %i3 if (pipe == NULL) { 200d77c: 80 a6 e0 00 cmp %i3, 0 200d780: 02 80 00 91 be 200d9c4 200d784: 01 00 00 00 nop err = pipe_alloc(&pipe); if (err) goto out; } if (! PIPE_LOCK(pipe)) 200d788: d0 06 e0 28 ld [ %i3 + 0x28 ], %o0 200d78c: 92 10 20 00 clr %o1 200d790: 7f ff ec 00 call 2008790 200d794: 94 10 20 00 clr %o2 err = -EINTR; if (*pipep == NULL) { 200d798: c2 07 00 00 ld [ %i4 ], %g1 err = pipe_alloc(&pipe); if (err) goto out; } if (! PIPE_LOCK(pipe)) 200d79c: 80 a0 00 08 cmp %g0, %o0 200d7a0: b0 60 20 00 subx %g0, 0, %i0 err = -EINTR; if (*pipep == NULL) { 200d7a4: 80 a0 60 00 cmp %g1, 0 200d7a8: 02 80 00 c7 be 200dac4 200d7ac: b0 0e 3f fc and %i0, -4, %i0 static void pipe_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; sc = rtems_semaphore_release(pipe_semaphore); 200d7b0: 7f ff ec 42 call 20088b8 200d7b4: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 pipe_control_t *pipe; unsigned int prevCounter; int err; err = pipe_new(pipep); if (err) 200d7b8: 80 a6 20 00 cmp %i0, 0 200d7bc: 12 80 00 f3 bne 200db88 <== NEVER TAKEN 200d7c0: 01 00 00 00 nop return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { 200d7c4: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 200d7c8: 82 08 60 06 and %g1, 6, %g1 200d7cc: 80 a0 60 04 cmp %g1, 4 200d7d0: 02 80 00 42 be 200d8d8 200d7d4: fa 07 00 00 ld [ %i4 ], %i5 200d7d8: 80 a0 60 06 cmp %g1, 6 200d7dc: 02 80 00 65 be 200d970 200d7e0: 80 a0 60 02 cmp %g1, 2 200d7e4: 22 80 00 07 be,a 200d800 <== ALWAYS TAKEN 200d7e8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); break; } PIPE_UNLOCK(pipe); 200d7ec: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED 200d7f0: 7f ff ec 32 call 20088b8 200d7f4: b0 10 20 00 clr %i0 return 0; 200d7f8: 81 c7 e0 08 ret 200d7fc: 81 e8 00 00 restore return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200d800: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200d804: 86 00 60 01 add %g1, 1, %g3 return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200d808: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200d80c: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200d810: 80 a0 60 00 cmp %g1, 0 200d814: 02 80 00 c2 be 200db1c <== ALWAYS TAKEN 200d818: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); if (pipe->Writers == 0) { 200d81c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 <== NOT EXECUTED 200d820: 80 a0 60 00 cmp %g1, 0 200d824: 32 bf ff f3 bne,a 200d7f0 200d828: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) 200d82c: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 200d830: 80 88 60 01 btst 1, %g1 200d834: 32 bf ff ef bne,a 200d7f0 200d838: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 break; prevCounter = pipe->writerCounter; 200d83c: 10 80 00 0c b 200d86c 200d840: f6 07 60 24 ld [ %i5 + 0x24 ], %i3 /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); if (! PIPE_READWAIT(pipe)) goto out_error; if (! PIPE_LOCK(pipe)) 200d844: 92 10 20 00 clr %o1 200d848: 7f ff eb d2 call 2008790 200d84c: 94 10 20 00 clr %o2 200d850: 80 a2 20 00 cmp %o0, 0 200d854: 12 80 00 0f bne 200d890 <== NEVER TAKEN 200d858: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->writerCounter); 200d85c: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 200d860: 80 a0 40 1b cmp %g1, %i3 200d864: 32 bf ff e3 bne,a 200d7f0 <== ALWAYS TAKEN 200d868: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 prevCounter = pipe->writerCounter; err = -EINTR; /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); 200d86c: 7f ff ec 13 call 20088b8 200d870: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_READWAIT(pipe)) 200d874: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200d878: 40 00 04 ec call 200ec28 200d87c: 92 10 20 00 clr %o1 200d880: 80 a2 20 00 cmp %o0, 0 200d884: 22 bf ff f0 be,a 200d844 <== ALWAYS TAKEN 200d888: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; 200d88c: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED PIPE_UNLOCK(pipe); return 0; out_error: pipe_release(pipep, iop); 200d890: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 200d894: 7f ff ff 68 call 200d634 200d898: 92 10 00 19 mov %i1, %o1 return err; } 200d89c: 81 c7 e0 08 ret 200d8a0: 81 e8 00 00 restore rtems_status_code rtems_libio_set_private_env(void); rtems_status_code rtems_libio_share_private_env(rtems_id task_id) ; static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 200d8a4: 37 00 80 83 sethi %hi(0x2020c00), %i3 200d8a8: d0 06 e0 10 ld [ %i3 + 0x10 ], %o0 ! 2020c10 200d8ac: 92 10 20 00 clr %o1 200d8b0: 7f ff eb b8 call 2008790 200d8b4: 94 10 20 00 clr %o2 rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { rtems_libio_lock(); if (pipe_semaphore == RTEMS_ID_NONE) { 200d8b8: c2 07 62 90 ld [ %i5 + 0x290 ], %g1 200d8bc: 80 a0 60 00 cmp %g1, 0 200d8c0: 02 80 00 88 be 200dae0 <== ALWAYS TAKEN 200d8c4: 98 10 00 1a mov %i2, %o4 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 200d8c8: 7f ff eb fc call 20088b8 <== NOT EXECUTED 200d8cc: d0 06 e0 10 ld [ %i3 + 0x10 ], %o0 <== NOT EXECUTED 200d8d0: 10 bf ff a3 b 200d75c <== NOT EXECUTED 200d8d4: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 <== NOT EXECUTED break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200d8d8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200d8dc: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200d8e0: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200d8e4: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200d8e8: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200d8ec: 80 a0 60 00 cmp %g1, 0 200d8f0: 02 80 00 95 be 200db44 <== ALWAYS TAKEN 200d8f4: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200d8f8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200d8fc: 80 a0 60 00 cmp %g1, 0 200d900: 32 bf ff bc bne,a 200d7f0 200d904: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 200d908: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 200d90c: 80 88 60 01 btst 1, %g1 200d910: 32 80 00 a0 bne,a 200db90 200d914: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 err = -ENXIO; goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; 200d918: 10 80 00 0c b 200d948 200d91c: f6 07 60 20 ld [ %i5 + 0x20 ], %i3 err = -EINTR; do { PIPE_UNLOCK(pipe); if (! PIPE_WRITEWAIT(pipe)) goto out_error; if (! PIPE_LOCK(pipe)) 200d920: 92 10 20 00 clr %o1 200d924: 7f ff eb 9b call 2008790 200d928: 94 10 20 00 clr %o2 200d92c: 80 a2 20 00 cmp %o0, 0 200d930: 12 bf ff d8 bne 200d890 <== NEVER TAKEN 200d934: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->readerCounter); 200d938: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200d93c: 80 a0 40 1b cmp %g1, %i3 200d940: 32 bf ff ac bne,a 200d7f0 <== ALWAYS TAKEN 200d944: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; do { PIPE_UNLOCK(pipe); 200d948: 7f ff eb dc call 20088b8 200d94c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_WRITEWAIT(pipe)) 200d950: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200d954: 40 00 04 b5 call 200ec28 200d958: 92 10 20 00 clr %o1 200d95c: 80 a2 20 00 cmp %o0, 0 200d960: 22 bf ff f0 be,a 200d920 <== ALWAYS TAKEN 200d964: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; 200d968: 10 bf ff ca b 200d890 <== NOT EXECUTED 200d96c: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) 200d970: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200d974: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200d978: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200d97c: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200d980: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200d984: 80 a0 60 00 cmp %g1, 0 200d988: 02 80 00 6a be 200db30 <== ALWAYS TAKEN 200d98c: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200d990: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 <== NOT EXECUTED case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; 200d994: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200d998: 86 00 60 01 add %g1, 1, %g3 case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; 200d99c: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200d9a0: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200d9a4: 80 a0 60 00 cmp %g1, 0 200d9a8: 12 bf ff 91 bne 200d7ec <== NEVER TAKEN 200d9ac: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); 200d9b0: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200d9b4: 40 00 04 86 call 200ebcc 200d9b8: 92 07 bf fc add %fp, -4, %o1 break; } PIPE_UNLOCK(pipe); 200d9bc: 10 bf ff 8d b 200d7f0 200d9c0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 { static char c = 'a'; pipe_control_t *pipe; int err = -ENOMEM; pipe = malloc(sizeof(pipe_control_t)); 200d9c4: 7f ff dd ac call 2005074 200d9c8: 90 10 20 34 mov 0x34, %o0 if (pipe == NULL) 200d9cc: b6 92 20 00 orcc %o0, 0, %i3 200d9d0: 02 80 00 7c be 200dbc0 200d9d4: 82 10 22 00 mov 0x200, %g1 return err; memset(pipe, 0, sizeof(pipe_control_t)); 200d9d8: c0 26 c0 00 clr [ %i3 ] 200d9dc: c0 26 e0 08 clr [ %i3 + 8 ] 200d9e0: c0 26 e0 0c clr [ %i3 + 0xc ] 200d9e4: c0 26 e0 10 clr [ %i3 + 0x10 ] 200d9e8: c0 26 e0 14 clr [ %i3 + 0x14 ] 200d9ec: c0 26 e0 18 clr [ %i3 + 0x18 ] 200d9f0: c0 26 e0 1c clr [ %i3 + 0x1c ] 200d9f4: c0 26 e0 20 clr [ %i3 + 0x20 ] 200d9f8: c0 26 e0 24 clr [ %i3 + 0x24 ] 200d9fc: c0 26 e0 28 clr [ %i3 + 0x28 ] 200da00: c0 26 e0 2c clr [ %i3 + 0x2c ] 200da04: c0 26 e0 30 clr [ %i3 + 0x30 ] pipe->Size = PIPE_BUF; pipe->Buffer = malloc(pipe->Size); 200da08: 90 10 22 00 mov 0x200, %o0 200da0c: 7f ff dd 9a call 2005074 200da10: c2 26 e0 04 st %g1, [ %i3 + 4 ] if (! pipe->Buffer) 200da14: 80 a2 20 00 cmp %o0, 0 200da18: 02 80 00 68 be 200dbb8 <== NEVER TAKEN 200da1c: d0 26 c0 00 st %o0, [ %i3 ] goto err_buf; err = -ENOMEM; if (rtems_barrier_create( rtems_build_name ('P', 'I', 'r', c), 200da20: 35 00 80 80 sethi %hi(0x2020000), %i2 200da24: d0 4e a3 14 ldsb [ %i2 + 0x314 ], %o0 ! 2020314 if (! pipe->Buffer) goto err_buf; err = -ENOMEM; if (rtems_barrier_create( 200da28: 31 14 12 5c sethi %hi(0x50497000), %i0 200da2c: 82 16 22 00 or %i0, 0x200, %g1 ! 50497200 200da30: 92 10 20 00 clr %o1 200da34: 94 10 20 00 clr %o2 200da38: 90 12 00 01 or %o0, %g1, %o0 200da3c: 40 00 04 0a call 200ea64 200da40: 96 06 e0 2c add %i3, 0x2c, %o3 200da44: 80 a2 20 00 cmp %o0, 0 200da48: 12 80 00 5a bne 200dbb0 200da4c: d0 4e a3 14 ldsb [ %i2 + 0x314 ], %o0 rtems_build_name ('P', 'I', 'r', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->readBarrier) != RTEMS_SUCCESSFUL) goto err_rbar; if (rtems_barrier_create( 200da50: 03 14 12 5d sethi %hi(0x50497400), %g1 200da54: 82 10 63 00 or %g1, 0x300, %g1 ! 50497700 200da58: 92 10 20 00 clr %o1 200da5c: 94 10 20 00 clr %o2 200da60: 90 12 00 01 or %o0, %g1, %o0 200da64: 40 00 04 00 call 200ea64 200da68: 96 06 e0 30 add %i3, 0x30, %o3 200da6c: 80 a2 20 00 cmp %o0, 0 200da70: 12 80 00 4e bne 200dba8 200da74: d0 4e a3 14 ldsb [ %i2 + 0x314 ], %o0 rtems_build_name ('P', 'I', 'w', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->writeBarrier) != RTEMS_SUCCESSFUL) goto err_wbar; if (rtems_semaphore_create( 200da78: b0 16 23 00 or %i0, 0x300, %i0 200da7c: 92 10 20 01 mov 1, %o1 200da80: 90 12 00 18 or %o0, %i0, %o0 200da84: 94 10 20 10 mov 0x10, %o2 200da88: 96 10 20 00 clr %o3 200da8c: 7f ff ea 9a call 20084f4 200da90: 98 06 e0 28 add %i3, 0x28, %o4 200da94: 80 a2 20 00 cmp %o0, 0 200da98: 12 80 00 42 bne 200dba0 200da9c: c2 0e a3 14 ldub [ %i2 + 0x314 ], %g1 #ifdef RTEMS_POSIX_API pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') 200daa0: 84 00 60 01 add %g1, 1, %g2 200daa4: 83 28 60 18 sll %g1, 0x18, %g1 200daa8: 83 38 60 18 sra %g1, 0x18, %g1 200daac: 80 a0 60 7a cmp %g1, 0x7a 200dab0: 12 bf ff 36 bne 200d788 200dab4: c4 2e a3 14 stb %g2, [ %i2 + 0x314 ] c = 'a'; 200dab8: 82 10 20 61 mov 0x61, %g1 200dabc: 10 bf ff 33 b 200d788 200dac0: c2 2e a3 14 stb %g1, [ %i2 + 0x314 ] if (! PIPE_LOCK(pipe)) err = -EINTR; if (*pipep == NULL) { if (err) 200dac4: 80 a6 20 00 cmp %i0, 0 200dac8: 12 80 00 24 bne 200db58 <== NEVER TAKEN 200dacc: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 static void pipe_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; sc = rtems_semaphore_release(pipe_semaphore); 200dad0: 7f ff eb 7a call 20088b8 200dad4: f6 27 00 00 st %i3, [ %i4 ] err = pipe_new(pipep); if (err) return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { 200dad8: 10 bf ff 3c b 200d7c8 200dadc: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 if (pipe_semaphore == RTEMS_ID_NONE) { rtems_libio_lock(); if (pipe_semaphore == RTEMS_ID_NONE) { sc = rtems_semaphore_create( 200dae0: 92 10 20 01 mov 1, %o1 200dae4: 94 10 20 54 mov 0x54, %o2 200dae8: 96 10 20 00 clr %o3 200daec: 11 14 12 54 sethi %hi(0x50495000), %o0 200daf0: 7f ff ea 81 call 20084f4 200daf4: 90 12 20 45 or %o0, 0x45, %o0 ! 50495045 200daf8: b4 10 00 08 mov %o0, %i2 200dafc: d0 06 e0 10 ld [ %i3 + 0x10 ], %o0 200db00: 7f ff eb 6e call 20088b8 200db04: b0 10 3f f4 mov -12, %i0 } rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { 200db08: 80 a6 a0 00 cmp %i2, 0 200db0c: 12 bf ff 3b bne 200d7f8 200db10: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 sc = rtems_semaphore_obtain(pipe_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 200db14: 10 bf ff 13 b 200d760 200db18: 92 10 20 00 clr %o1 switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200db1c: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200db20: 40 00 04 2b call 200ebcc 200db24: 92 07 bf fc add %fp, -4, %o1 if (pipe->Writers == 0) { 200db28: 10 bf ff 3e b 200d820 200db2c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200db30: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200db34: 40 00 04 26 call 200ebcc 200db38: 92 07 bf fc add %fp, -4, %o1 pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200db3c: 10 bf ff 96 b 200d994 200db40: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); 200db44: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200db48: 40 00 04 21 call 200ebcc 200db4c: 92 07 bf fc add %fp, -4, %o1 if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200db50: 10 bf ff 6b b 200d8fc 200db54: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 /* Called with pipe_semaphore held. */ static inline void pipe_free( pipe_control_t *pipe ) { rtems_barrier_delete(pipe->readBarrier); 200db58: 40 00 03 f4 call 200eb28 <== NOT EXECUTED 200db5c: d0 06 e0 2c ld [ %i3 + 0x2c ], %o0 <== NOT EXECUTED rtems_barrier_delete(pipe->writeBarrier); 200db60: 40 00 03 f2 call 200eb28 <== NOT EXECUTED 200db64: d0 06 e0 30 ld [ %i3 + 0x30 ], %o0 <== NOT EXECUTED rtems_semaphore_delete(pipe->Semaphore); 200db68: 7f ff ea d3 call 20086b4 <== NOT EXECUTED 200db6c: d0 06 e0 28 ld [ %i3 + 0x28 ], %o0 <== NOT EXECUTED free(pipe->Buffer); 200db70: 7f ff db 4a call 2004898 <== NOT EXECUTED 200db74: d0 06 c0 00 ld [ %i3 ], %o0 <== NOT EXECUTED free(pipe); 200db78: 7f ff db 48 call 2004898 <== NOT EXECUTED 200db7c: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED static void pipe_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; sc = rtems_semaphore_release(pipe_semaphore); 200db80: 7f ff eb 4e call 20088b8 200db84: d0 07 62 90 ld [ %i5 + 0x290 ], %o0 200db88: 81 c7 e0 08 ret 200db8c: 81 e8 00 00 restore if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { PIPE_UNLOCK(pipe); 200db90: 7f ff eb 4a call 20088b8 200db94: b0 10 3f fa mov -6, %i0 err = -ENXIO; goto out_error; 200db98: 10 bf ff 3f b 200d894 200db9c: 90 10 00 1c mov %i4, %o0 if (c ++ == 'z') c = 'a'; return 0; err_sem: rtems_barrier_delete(pipe->writeBarrier); 200dba0: 40 00 03 e2 call 200eb28 200dba4: d0 06 e0 30 ld [ %i3 + 0x30 ], %o0 err_wbar: rtems_barrier_delete(pipe->readBarrier); 200dba8: 40 00 03 e0 call 200eb28 200dbac: d0 06 e0 2c ld [ %i3 + 0x2c ], %o0 err_rbar: free(pipe->Buffer); 200dbb0: 7f ff db 3a call 2004898 200dbb4: d0 06 c0 00 ld [ %i3 ], %o0 err_buf: free(pipe); 200dbb8: 7f ff db 38 call 2004898 200dbbc: 90 10 00 1b mov %i3, %o0 } rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { 200dbc0: 10 bf ff f0 b 200db80 200dbc4: b0 10 3f f4 mov -12, %i0 =============================================================================== 02003748 : long fpathconf( int fd, int name ) { 2003748: 9d e3 bf a0 save %sp, -96, %sp long return_value; rtems_libio_t *iop; rtems_filesystem_limits_and_options_t *the_limits; rtems_libio_check_fd(fd); 200374c: 03 00 80 5a sethi %hi(0x2016800), %g1 2003750: c2 00 63 f8 ld [ %g1 + 0x3f8 ], %g1 ! 2016bf8 2003754: 80 a6 00 01 cmp %i0, %g1 2003758: 1a 80 00 3b bcc 2003844 200375c: 03 00 80 5d sethi %hi(0x2017400), %g1 iop = rtems_libio_iop(fd); 2003760: c2 00 61 c4 ld [ %g1 + 0x1c4 ], %g1 ! 20175c4 2003764: b1 2e 20 06 sll %i0, 6, %i0 2003768: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_is_open(iop); 200376c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2003770: 80 88 61 00 btst 0x100, %g1 2003774: 02 80 00 34 be 2003844 <== NEVER TAKEN 2003778: 80 a6 60 0b cmp %i1, 0xb * Now process the information request. */ the_limits = &iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { 200377c: 08 80 00 08 bleu 200379c 2003780: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 break; case _PC_SYNC_IO: return_value = the_limits->posix_sync_io; break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2003784: 40 00 2f c8 call 200f6a4 <__errno> 2003788: b0 10 3f ff mov -1, %i0 200378c: 82 10 20 16 mov 0x16, %g1 2003790: c2 22 00 00 st %g1, [ %o0 ] break; } return return_value; } 2003794: 81 c7 e0 08 ret 2003798: 81 e8 00 00 restore * Now process the information request. */ the_limits = &iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { 200379c: b3 2e 60 02 sll %i1, 2, %i1 20037a0: 05 00 80 0d sethi %hi(0x2003400), %g2 20037a4: 84 10 a3 18 or %g2, 0x318, %g2 ! 2003718 20037a8: c4 00 80 19 ld [ %g2 + %i1 ], %g2 20037ac: 81 c0 80 00 jmp %g2 20037b0: 01 00 00 00 nop break; case _PC_ASYNC_IO: return_value = the_limits->posix_async_io; break; case _PC_PRIO_IO: return_value = the_limits->posix_prio_io; 20037b4: f0 00 60 5c ld [ %g1 + 0x5c ], %i0 break; 20037b8: 81 c7 e0 08 ret 20037bc: 81 e8 00 00 restore break; case _PC_VDISABLE: return_value = the_limits->posix_vdisable; break; case _PC_ASYNC_IO: return_value = the_limits->posix_async_io; 20037c0: f0 00 60 50 ld [ %g1 + 0x50 ], %i0 break; 20037c4: 81 c7 e0 08 ret 20037c8: 81 e8 00 00 restore break; case _PC_NO_TRUNC: return_value = the_limits->posix_no_trunc; break; case _PC_VDISABLE: return_value = the_limits->posix_vdisable; 20037cc: f0 00 60 64 ld [ %g1 + 0x64 ], %i0 break; 20037d0: 81 c7 e0 08 ret 20037d4: 81 e8 00 00 restore break; case _PC_CHOWN_RESTRICTED: return_value = the_limits->posix_chown_restrictions; break; case _PC_NO_TRUNC: return_value = the_limits->posix_no_trunc; 20037d8: f0 00 60 58 ld [ %g1 + 0x58 ], %i0 break; 20037dc: 81 c7 e0 08 ret 20037e0: 81 e8 00 00 restore break; case _PC_PIPE_BUF: return_value = the_limits->pipe_buf; break; case _PC_CHOWN_RESTRICTED: return_value = the_limits->posix_chown_restrictions; 20037e4: f0 00 60 54 ld [ %g1 + 0x54 ], %i0 break; 20037e8: 81 c7 e0 08 ret 20037ec: 81 e8 00 00 restore break; case _PC_PATH_MAX: return_value = the_limits->path_max; break; case _PC_PIPE_BUF: return_value = the_limits->pipe_buf; 20037f0: f0 00 60 4c ld [ %g1 + 0x4c ], %i0 break; 20037f4: 81 c7 e0 08 ret 20037f8: 81 e8 00 00 restore break; case _PC_NAME_MAX: return_value = the_limits->name_max; break; case _PC_PATH_MAX: return_value = the_limits->path_max; 20037fc: f0 00 60 48 ld [ %g1 + 0x48 ], %i0 break; 2003800: 81 c7 e0 08 ret 2003804: 81 e8 00 00 restore break; case _PC_MAX_INPUT: return_value = the_limits->max_input; break; case _PC_NAME_MAX: return_value = the_limits->name_max; 2003808: f0 00 60 44 ld [ %g1 + 0x44 ], %i0 break; 200380c: 81 c7 e0 08 ret 2003810: 81 e8 00 00 restore break; case _PC_MAX_CANON: return_value = the_limits->max_canon; break; case _PC_MAX_INPUT: return_value = the_limits->max_input; 2003814: f0 00 60 40 ld [ %g1 + 0x40 ], %i0 break; 2003818: 81 c7 e0 08 ret 200381c: 81 e8 00 00 restore switch ( name ) { case _PC_LINK_MAX: return_value = the_limits->link_max; break; case _PC_MAX_CANON: return_value = the_limits->max_canon; 2003820: f0 00 60 3c ld [ %g1 + 0x3c ], %i0 break; 2003824: 81 c7 e0 08 ret 2003828: 81 e8 00 00 restore the_limits = &iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { case _PC_LINK_MAX: return_value = the_limits->link_max; 200382c: f0 00 60 38 ld [ %g1 + 0x38 ], %i0 break; 2003830: 81 c7 e0 08 ret 2003834: 81 e8 00 00 restore break; case _PC_PRIO_IO: return_value = the_limits->posix_prio_io; break; case _PC_SYNC_IO: return_value = the_limits->posix_sync_io; 2003838: f0 00 60 60 ld [ %g1 + 0x60 ], %i0 break; 200383c: 81 c7 e0 08 ret 2003840: 81 e8 00 00 restore rtems_libio_t *iop; rtems_filesystem_limits_and_options_t *the_limits; rtems_libio_check_fd(fd); iop = rtems_libio_iop(fd); rtems_libio_check_is_open(iop); 2003844: 40 00 2f 98 call 200f6a4 <__errno> 2003848: b0 10 3f ff mov -1, %i0 200384c: 82 10 20 09 mov 9, %g1 2003850: c2 22 00 00 st %g1, [ %o0 ] 2003854: 81 c7 e0 08 ret 2003858: 81 e8 00 00 restore =============================================================================== 02002f20 : #include void free( void *ptr ) { 2002f20: 9d e3 bf a0 save %sp, -96, %sp MSBUMP(free_calls, 1); 2002f24: 03 00 80 70 sethi %hi(0x201c000), %g1 2002f28: 82 10 61 c0 or %g1, 0x1c0, %g1 ! 201c1c0 2002f2c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 #include void free( void *ptr ) { 2002f30: b2 10 00 18 mov %i0, %i1 MSBUMP(free_calls, 1); 2002f34: 84 00 a0 01 inc %g2 if ( !ptr ) 2002f38: 80 a6 20 00 cmp %i0, 0 2002f3c: 02 80 00 15 be 2002f90 2002f40: c4 20 60 0c st %g2, [ %g1 + 0xc ] return; /* * Do not attempt to free memory if in a critical section or ISR. */ if ( _System_state_Is_up(_System_state_Get()) && 2002f44: 03 00 80 71 sethi %hi(0x201c400), %g1 2002f48: c2 00 60 c4 ld [ %g1 + 0xc4 ], %g1 ! 201c4c4 <_System_state_Current> 2002f4c: 80 a0 60 03 cmp %g1, 3 2002f50: 02 80 00 17 be 2002fac <== ALWAYS TAKEN 2002f54: 03 00 80 6f sethi %hi(0x201bc00), %g1 } /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 2002f58: c2 00 63 08 ld [ %g1 + 0x308 ], %g1 ! 201bf08 2002f5c: 80 a0 60 00 cmp %g1, 0 2002f60: 02 80 00 06 be 2002f78 2002f64: 3b 00 80 6d sethi %hi(0x201b400), %i5 (*rtems_malloc_statistics_helpers->at_free)(ptr); 2002f68: c2 00 60 08 ld [ %g1 + 8 ], %g1 2002f6c: 9f c0 40 00 call %g1 2002f70: 90 10 00 19 mov %i1, %o0 if ( !_Protected_heap_Free( RTEMS_Malloc_Heap, ptr ) ) { 2002f74: 3b 00 80 6d sethi %hi(0x201b400), %i5 2002f78: d0 07 63 60 ld [ %i5 + 0x360 ], %o0 ! 201b760 2002f7c: 40 00 15 d0 call 20086bc <_Protected_heap_Free> 2002f80: 92 10 00 19 mov %i1, %o1 2002f84: 80 8a 20 ff btst 0xff, %o0 2002f88: 22 80 00 04 be,a 2002f98 2002f8c: c2 07 63 60 ld [ %i5 + 0x360 ], %g1 2002f90: 81 c7 e0 08 ret 2002f94: 81 e8 00 00 restore printk( "Program heap: free of bad pointer %p -- range %p - %p \n", 2002f98: 31 00 80 68 sethi %hi(0x201a000), %i0 2002f9c: f4 00 60 18 ld [ %g1 + 0x18 ], %i2 2002fa0: f6 00 60 1c ld [ %g1 + 0x1c ], %i3 2002fa4: 40 00 03 ae call 2003e5c 2002fa8: 91 ee 23 e8 restore %i0, 0x3e8, %o0 /* * Do not attempt to free memory if in a critical section or ISR. */ if ( _System_state_Is_up(_System_state_Get()) && !malloc_is_system_state_OK() ) { 2002fac: 40 00 00 5d call 2003120 2002fb0: 01 00 00 00 nop return; /* * Do not attempt to free memory if in a critical section or ISR. */ if ( _System_state_Is_up(_System_state_Get()) && 2002fb4: 80 8a 20 ff btst 0xff, %o0 2002fb8: 12 bf ff e8 bne 2002f58 2002fbc: 03 00 80 6f sethi %hi(0x201bc00), %g1 !malloc_is_system_state_OK() ) { malloc_deferred_free(ptr); 2002fc0: 40 00 00 77 call 200319c 2002fc4: 81 e8 00 00 restore =============================================================================== 02006284 : * NOTE: this must be called with * thread dispatching disabled! */ static void free_user_env(void *venv) { 2006284: 9d e3 bf a0 save %sp, -96, %sp rtems_user_env_t *env = (rtems_user_env_t*) venv ; if (env != &rtems_global_user_env 2006288: 03 00 80 89 sethi %hi(0x2022400), %g1 200628c: 82 10 62 2c or %g1, 0x22c, %g1 ! 202262c 2006290: 80 a6 00 01 cmp %i0, %g1 2006294: 02 80 00 08 be 20062b4 <== NEVER TAKEN 2006298: 01 00 00 00 nop #ifdef HAVE_USERENV_REFCNT && --env->refcnt <= 0 #endif ) { rtems_filesystem_freenode( &env->current_directory); 200629c: 7f ff fb 4c call 2004fcc 20062a0: 90 06 20 04 add %i0, 4, %o0 rtems_filesystem_freenode( &env->root_directory); 20062a4: 7f ff fb 4a call 2004fcc 20062a8: 90 06 20 18 add %i0, 0x18, %o0 free(env); 20062ac: 7f ff fb 4f call 2004fe8 20062b0: 81 e8 00 00 restore 20062b4: 81 c7 e0 08 ret <== NOT EXECUTED 20062b8: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020026d0 : rtems_device_major_number major = 0; rtems_device_minor_number minor = 0; rtems_filesystem_split_dev_t(dev, major, minor); if (major < disktab_size && disktab != NULL) { 20026d0: 03 00 80 65 sethi %hi(0x2019400), %g1 20026d4: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 20197b4 20026d8: 80 a0 40 08 cmp %g1, %o0 20026dc: 08 80 00 1e bleu 2002754 <== NEVER TAKEN 20026e0: 84 10 20 00 clr %g2 20026e4: 03 00 80 65 sethi %hi(0x2019400), %g1 20026e8: c2 00 63 b8 ld [ %g1 + 0x3b8 ], %g1 ! 20197b8 20026ec: 80 a0 60 00 cmp %g1, 0 20026f0: 02 80 00 19 be 2002754 <== NEVER TAKEN 20026f4: 01 00 00 00 nop rtems_disk_device_table *dtab = disktab + major; 20026f8: 91 2a 20 03 sll %o0, 3, %o0 20026fc: 86 00 40 08 add %g1, %o0, %g3 if (minor < dtab->size && dtab->minor != NULL) { 2002700: c6 00 e0 04 ld [ %g3 + 4 ], %g3 2002704: 80 a0 c0 09 cmp %g3, %o1 2002708: 08 80 00 13 bleu 2002754 <== NEVER TAKEN 200270c: 01 00 00 00 nop 2002710: c2 00 40 08 ld [ %g1 + %o0 ], %g1 2002714: 80 a0 60 00 cmp %g1, 0 2002718: 02 80 00 0f be 2002754 <== NEVER TAKEN 200271c: 93 2a 60 02 sll %o1, 2, %o1 rtems_disk_device *dd = dtab->minor [minor]; 2002720: c4 00 40 09 ld [ %g1 + %o1 ], %g2 if (dd != NULL && !lookup_only) { 2002724: 80 a0 a0 00 cmp %g2, 0 2002728: 02 80 00 0b be 2002754 200272c: 80 a2 a0 00 cmp %o2, 0 2002730: 12 80 00 09 bne 2002754 2002734: 01 00 00 00 nop if (!dd->deleted) { 2002738: c2 08 a0 30 ldub [ %g2 + 0x30 ], %g1 200273c: 80 a0 60 00 cmp %g1, 0 2002740: 32 80 00 07 bne,a 200275c 2002744: 84 10 20 00 clr %g2 ++dd->uses; 2002748: c2 00 a0 14 ld [ %g2 + 0x14 ], %g1 200274c: 82 00 60 01 inc %g1 2002750: c2 20 a0 14 st %g1, [ %g2 + 0x14 ] return dd; } } return NULL; } 2002754: 81 c3 e0 08 retl 2002758: 90 10 00 02 mov %g2, %o0 200275c: 81 c3 e0 08 retl 2002760: 90 10 00 02 mov %g2, %o0 =============================================================================== 0201a4f4 : int getdents( int dd_fd, char *dd_buf, int dd_len ) { 201a4f4: 9d e3 bf 88 save %sp, -120, %sp rtems_filesystem_location_info_t loc; /* * Get the file control block structure associated with the file descriptor */ iop = rtems_libio_iop( dd_fd ); 201a4f8: 03 00 80 73 sethi %hi(0x201cc00), %g1 201a4fc: c2 00 61 c8 ld [ %g1 + 0x1c8 ], %g1 ! 201cdc8 201a500: 80 a6 00 01 cmp %i0, %g1 201a504: 1a 80 00 06 bcc 201a51c <== NEVER TAKEN 201a508: ba 10 20 00 clr %i5 201a50c: 03 00 80 76 sethi %hi(0x201d800), %g1 201a510: fa 00 60 24 ld [ %g1 + 0x24 ], %i5 ! 201d824 201a514: b1 2e 20 06 sll %i0, 6, %i0 201a518: ba 07 40 18 add %i5, %i0, %i5 /* * Make sure we are working on a directory */ loc = iop->pathinfo; 201a51c: c4 07 60 28 ld [ %i5 + 0x28 ], %g2 201a520: de 07 60 1c ld [ %i5 + 0x1c ], %o7 if ( (*loc.ops->node_type_h)( &loc ) != RTEMS_FILESYSTEM_DIRECTORY ) 201a524: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 iop = rtems_libio_iop( dd_fd ); /* * Make sure we are working on a directory */ loc = iop->pathinfo; 201a528: f0 07 60 20 ld [ %i5 + 0x20 ], %i0 201a52c: c8 07 60 24 ld [ %i5 + 0x24 ], %g4 201a530: c6 07 60 2c ld [ %i5 + 0x2c ], %g3 201a534: de 27 bf ec st %o7, [ %fp + -20 ] 201a538: f0 27 bf f0 st %i0, [ %fp + -16 ] 201a53c: c8 27 bf f4 st %g4, [ %fp + -12 ] 201a540: c4 27 bf f8 st %g2, [ %fp + -8 ] 201a544: c6 27 bf fc st %g3, [ %fp + -4 ] if ( (*loc.ops->node_type_h)( &loc ) != RTEMS_FILESYSTEM_DIRECTORY ) 201a548: 9f c0 40 00 call %g1 201a54c: 90 07 bf ec add %fp, -20, %o0 201a550: 80 a2 20 01 cmp %o0, 1 201a554: 12 80 00 09 bne 201a578 201a558: 90 10 00 1d mov %i5, %o0 /* * Return the number of bytes that were actually transfered as a result * of the read attempt. */ return (*iop->pathinfo.handlers->read_h)( iop, dd_buf, dd_len ); 201a55c: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 201a560: c2 00 60 08 ld [ %g1 + 8 ], %g1 201a564: 92 10 00 19 mov %i1, %o1 201a568: 9f c0 40 00 call %g1 201a56c: 94 10 00 1a mov %i2, %o2 } 201a570: 81 c7 e0 08 ret 201a574: 91 e8 00 08 restore %g0, %o0, %o0 /* * Make sure we are working on a directory */ loc = iop->pathinfo; if ( (*loc.ops->node_type_h)( &loc ) != RTEMS_FILESYSTEM_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 201a578: 7f ff d4 59 call 200f6dc <__errno> 201a57c: b0 10 3f ff mov -1, %i0 201a580: 82 10 20 14 mov 0x14, %g1 201a584: c2 22 00 00 st %g1, [ %o0 ] 201a588: 81 c7 e0 08 ret 201a58c: 81 e8 00 00 restore =============================================================================== 02002fc8 : */ int gettimeofday( struct timeval *tp, void * __tz __attribute__((unused)) ) { 2002fc8: 9d e3 bf 98 save %sp, -104, %sp /* struct timezone* tzp = (struct timezone*) __tz; */ if ( !tp ) 2002fcc: ba 96 20 00 orcc %i0, 0, %i5 2002fd0: 02 80 00 12 be 2003018 <== NEVER TAKEN 2002fd4: 01 00 00 00 nop { ISR_Level level; struct timespec now; suseconds_t useconds; _ISR_Disable(level); 2002fd8: 7f ff fc 83 call 20021e4 2002fdc: 01 00 00 00 nop 2002fe0: b8 10 00 08 mov %o0, %i4 _TOD_Get( &now ); 2002fe4: 40 00 12 13 call 2007830 <_TOD_Get> 2002fe8: 90 07 bf f8 add %fp, -8, %o0 _ISR_Enable(level); 2002fec: 7f ff fc 82 call 20021f4 2002ff0: 90 10 00 1c mov %i4, %o0 useconds = (suseconds_t)now.tv_nsec; useconds /= (suseconds_t)TOD_NANOSECONDS_PER_MICROSECOND; time->tv_sec = now.tv_sec; 2002ff4: c2 07 bf f8 ld [ %fp + -8 ], %g1 _ISR_Disable(level); _TOD_Get( &now ); _ISR_Enable(level); useconds = (suseconds_t)now.tv_nsec; useconds /= (suseconds_t)TOD_NANOSECONDS_PER_MICROSECOND; 2002ff8: d0 07 bf fc ld [ %fp + -4 ], %o0 time->tv_sec = now.tv_sec; 2002ffc: c2 27 40 00 st %g1, [ %i5 ] _ISR_Disable(level); _TOD_Get( &now ); _ISR_Enable(level); useconds = (suseconds_t)now.tv_nsec; useconds /= (suseconds_t)TOD_NANOSECONDS_PER_MICROSECOND; 2003000: 92 10 23 e8 mov 0x3e8, %o1 2003004: 40 00 52 40 call 2017904 <.div> 2003008: b0 10 20 00 clr %i0 time->tv_sec = now.tv_sec; time->tv_usec = useconds; 200300c: d0 27 60 04 st %o0, [ %i5 + 4 ] * with Eric Norum, this is how GNU/Linux, Solaris, and MacOS X * do it. This puts us in good company. */ return 0; } 2003010: 81 c7 e0 08 ret 2003014: 81 e8 00 00 restore void * __tz __attribute__((unused)) ) { /* struct timezone* tzp = (struct timezone*) __tz; */ if ( !tp ) rtems_set_errno_and_return_minus_one( EFAULT ); 2003018: 40 00 2e bf call 200eb14 <__errno> <== NOT EXECUTED 200301c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003020: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 2003024: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003028: 81 c7 e0 08 ret <== NOT EXECUTED 200302c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200e114 : IMFS_jnode_t *the_jnode; /* Is the node a directory ? */ the_jnode = (IMFS_jnode_t *) iop->pathinfo.node_access; if ( the_jnode->type != IMFS_DIRECTORY ) 200e114: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200e118: c4 00 a0 4c ld [ %g2 + 0x4c ], %g2 200e11c: 80 a0 a0 01 cmp %g2, 1 200e120: 12 80 00 05 bne 200e134 <== NEVER TAKEN 200e124: 82 10 3f ff mov -1, %g1 return -1; /* It wasn't a directory --> return error */ iop->offset = 0; 200e128: c0 22 20 10 clr [ %o0 + 0x10 ] 200e12c: c0 22 20 14 clr [ %o0 + 0x14 ] return 0; 200e130: 82 10 20 00 clr %g1 } 200e134: 81 c3 e0 08 retl 200e138: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200e13c : ssize_t imfs_dir_read( rtems_libio_t *iop, void *buffer, size_t count ) { 200e13c: 9d e3 be 88 save %sp, -376, %sp int current_entry; int first_entry; int last_entry; struct dirent tmp_dirent; the_jnode = (IMFS_jnode_t *)iop->pathinfo.node_access; 200e140: f6 06 20 1c ld [ %i0 + 0x1c ], %i3 ssize_t imfs_dir_read( rtems_libio_t *iop, void *buffer, size_t count ) { 200e144: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200e148: f8 06 e0 50 ld [ %i3 + 0x50 ], %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200e14c: b6 06 e0 54 add %i3, 0x54, %i3 struct dirent tmp_dirent; the_jnode = (IMFS_jnode_t *)iop->pathinfo.node_access; the_chain = &the_jnode->info.directory.Entries; if ( rtems_chain_is_empty( the_chain ) ) 200e150: 80 a7 00 1b cmp %i4, %i3 200e154: 02 80 00 34 be 200e224 200e158: b0 10 20 00 clr %i0 /* Move to the first of the desired directory entries */ the_node = rtems_chain_first( the_chain ); bytes_transferred = 0; first_entry = iop->offset; 200e15c: e0 07 60 14 ld [ %i5 + 0x14 ], %l0 /* protect against using sizes that are not exact multiples of the */ /* -dirent- size. These could result in unexpected results */ last_entry = first_entry + (count/sizeof(struct dirent)) * sizeof(struct dirent); 200e160: 90 10 00 1a mov %i2, %o0 200e164: 40 00 25 e6 call 20178fc <.udiv> 200e168: 92 10 21 18 mov 0x118, %o1 for ( current_entry = 0; current_entry < last_entry; current_entry = current_entry + sizeof(struct dirent) ){ if ( rtems_chain_is_tail( the_chain, the_node ) ){ 200e16c: b4 10 20 00 clr %i2 bytes_transferred = 0; first_entry = iop->offset; /* protect against using sizes that are not exact multiples of the */ /* -dirent- size. These could result in unexpected results */ last_entry = first_entry + (count/sizeof(struct dirent)) * sizeof(struct dirent); 200e170: 83 2a 20 03 sll %o0, 3, %g1 200e174: 91 2a 20 05 sll %o0, 5, %o0 200e178: 82 00 40 08 add %g1, %o0, %g1 200e17c: a3 28 60 03 sll %g1, 3, %l1 200e180: a2 24 40 01 sub %l1, %g1, %l1 200e184: a2 04 40 10 add %l1, %l0, %l1 /* The directory was not empty so try to move to the desired entry in chain*/ for ( 200e188: 80 a4 60 00 cmp %l1, 0 200e18c: 14 80 00 09 bg 200e1b0 <== ALWAYS TAKEN 200e190: a4 10 21 18 mov 0x118, %l2 200e194: 30 80 00 24 b,a 200e224 <== NOT EXECUTED 200e198: 80 a4 40 1a cmp %l1, %i2 200e19c: 04 80 00 22 ble 200e224 <== NEVER TAKEN 200e1a0: f8 07 00 00 ld [ %i4 ], %i4 current_entry = 0; current_entry < last_entry; current_entry = current_entry + sizeof(struct dirent) ){ if ( rtems_chain_is_tail( the_chain, the_node ) ){ 200e1a4: 80 a7 00 1b cmp %i4, %i3 200e1a8: 02 80 00 1f be 200e224 200e1ac: 01 00 00 00 nop /* entry in the read */ return bytes_transferred; /* Indicate that there are no more */ /* entries to return */ } if( current_entry >= first_entry ) { 200e1b0: 80 a4 00 1a cmp %l0, %i2 200e1b4: 34 bf ff f9 bg,a 200e198 200e1b8: b4 06 a1 18 add %i2, 0x118, %i2 /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; tmp_dirent.d_reclen = sizeof( struct dirent ); the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; 200e1bc: c2 07 20 38 ld [ %i4 + 0x38 ], %g1 /* entries to return */ } if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200e1c0: 85 3e a0 1f sra %i2, 0x1f, %g2 tmp_dirent.d_reclen = sizeof( struct dirent ); the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; tmp_dirent.d_namlen = strlen( the_jnode->name ); 200e1c4: a6 07 20 0c add %i4, 0xc, %l3 /* entries to return */ } if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200e1c8: c4 27 be f0 st %g2, [ %fp + -272 ] tmp_dirent.d_reclen = sizeof( struct dirent ); the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; 200e1cc: c2 27 be e8 st %g1, [ %fp + -280 ] /* entries to return */ } if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200e1d0: f4 27 be f4 st %i2, [ %fp + -268 ] tmp_dirent.d_reclen = sizeof( struct dirent ); 200e1d4: e4 37 be f8 sth %l2, [ %fp + -264 ] the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; tmp_dirent.d_namlen = strlen( the_jnode->name ); 200e1d8: 40 00 07 e7 call 2010174 200e1dc: 90 10 00 13 mov %l3, %o0 strcpy( tmp_dirent.d_name, the_jnode->name ); 200e1e0: 92 10 00 13 mov %l3, %o1 /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; tmp_dirent.d_reclen = sizeof( struct dirent ); the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; tmp_dirent.d_namlen = strlen( the_jnode->name ); 200e1e4: d0 37 be fa sth %o0, [ %fp + -262 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200e1e8: 40 00 06 1f call 200fa64 200e1ec: 90 07 be fc add %fp, -260, %o0 memcpy( 200e1f0: 90 06 40 18 add %i1, %i0, %o0 200e1f4: 92 07 be e8 add %fp, -280, %o1 200e1f8: 40 00 04 a3 call 200f484 200e1fc: 94 10 21 18 mov 0x118, %o2 buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset = iop->offset + sizeof(struct dirent); 200e200: c4 1f 60 10 ldd [ %i5 + 0x10 ], %g2 * to the end of the exisiting file, the remaining entries will be placed in * the buffer and the returned value will be equal to -m actual- times the * size of a directory entry. */ ssize_t imfs_dir_read( 200e204: b4 06 a1 18 add %i2, 0x118, %i2 memcpy( buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset = iop->offset + sizeof(struct dirent); 200e208: 86 80 e1 18 addcc %g3, 0x118, %g3 200e20c: 84 40 a0 00 addx %g2, 0, %g2 200e210: c4 3f 60 10 std %g2, [ %i5 + 0x10 ] bytes_transferred = bytes_transferred + sizeof( struct dirent ); 200e214: b0 06 21 18 add %i0, 0x118, %i0 /* protect against using sizes that are not exact multiples of the */ /* -dirent- size. These could result in unexpected results */ last_entry = first_entry + (count/sizeof(struct dirent)) * sizeof(struct dirent); /* The directory was not empty so try to move to the desired entry in chain*/ for ( 200e218: 80 a4 40 1a cmp %l1, %i2 200e21c: 14 bf ff e2 bg 200e1a4 <== NEVER TAKEN 200e220: f8 07 00 00 ld [ %i4 ], %i4 the_node = the_node->next; } /* Success */ return bytes_transferred; } 200e224: 81 c7 e0 08 ret 200e228: 81 e8 00 00 restore =============================================================================== 0200e384 : int imfs_dir_rmnod( rtems_filesystem_location_info_t *parent_pathloc, /* IN */ rtems_filesystem_location_info_t *pathloc /* IN */ ) { 200e384: 9d e3 bf a0 save %sp, -96, %sp IMFS_jnode_t *the_jnode; the_jnode = (IMFS_jnode_t *) pathloc->node_access; 200e388: fa 06 40 00 ld [ %i1 ], %i5 /* * You cannot remove a node that still has children */ if ( ! rtems_chain_is_empty( &the_jnode->info.directory.Entries ) ) 200e38c: c4 07 60 50 ld [ %i5 + 0x50 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200e390: 82 07 60 54 add %i5, 0x54, %g1 200e394: 80 a0 80 01 cmp %g2, %g1 200e398: 12 80 00 18 bne 200e3f8 200e39c: 01 00 00 00 nop static inline bool rtems_filesystem_is_root_location( const rtems_filesystem_location_info_t *loc ) { return loc->mt_entry->mt_fs_root.node_access == loc->node_access; 200e3a0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 /* * You cannot remove the file system root node. */ if ( rtems_filesystem_is_root_location(pathloc) ) 200e3a4: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 200e3a8: 80 a7 40 01 cmp %i5, %g1 200e3ac: 02 80 00 0d be 200e3e0 200e3b0: 01 00 00 00 nop /* * You cannot remove a mountpoint. */ if ( the_jnode->info.directory.mt_fs != NULL ) 200e3b4: c2 07 60 5c ld [ %i5 + 0x5c ], %g1 200e3b8: 80 a0 60 00 cmp %g1, 0 200e3bc: 12 80 00 09 bne 200e3e0 <== NEVER TAKEN 200e3c0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EBUSY ); IMFS_create_orphan( the_jnode ); 200e3c4: 7f ff f5 57 call 200b920 200e3c8: 90 10 00 1d mov %i5, %o0 IMFS_check_node_remove( the_jnode ); 200e3cc: 90 10 00 1d mov %i5, %o0 200e3d0: 7f ff f5 66 call 200b968 200e3d4: b0 10 20 00 clr %i0 return 0; } 200e3d8: 81 c7 e0 08 ret 200e3dc: 81 e8 00 00 restore /* * You cannot remove a mountpoint. */ if ( the_jnode->info.directory.mt_fs != NULL ) rtems_set_errno_and_return_minus_one( EBUSY ); 200e3e0: 40 00 01 cd call 200eb14 <__errno> 200e3e4: b0 10 3f ff mov -1, %i0 200e3e8: 82 10 20 10 mov 0x10, %g1 200e3ec: c2 22 00 00 st %g1, [ %o0 ] 200e3f0: 81 c7 e0 08 ret 200e3f4: 81 e8 00 00 restore /* * You cannot remove a node that still has children */ if ( ! rtems_chain_is_empty( &the_jnode->info.directory.Entries ) ) rtems_set_errno_and_return_minus_one( ENOTEMPTY ); 200e3f8: 40 00 01 c7 call 200eb14 <__errno> 200e3fc: b0 10 3f ff mov -1, %i0 200e400: 82 10 20 5a mov 0x5a, %g1 200e404: c2 22 00 00 st %g1, [ %o0 ] 200e408: 81 c7 e0 08 ret 200e40c: 81 e8 00 00 restore =============================================================================== 02003684 : /* * Initialize useable but dummy databases */ void init_etc_passwd_group(void) { 2003684: 9d e3 bf a0 save %sp, -96, %sp FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) 2003688: 03 00 80 5c sethi %hi(0x2017000), %g1 200368c: c4 48 63 b8 ldsb [ %g1 + 0x3b8 ], %g2 ! 20173b8 2003690: 80 a0 a0 00 cmp %g2, 0 2003694: 22 80 00 04 be,a 20036a4 2003698: 84 10 20 01 mov 1, %g2 200369c: 81 c7 e0 08 ret 20036a0: 81 e8 00 00 restore return; etc_passwd_initted = 1; mkdir("/etc", 0777); 20036a4: 92 10 21 ff mov 0x1ff, %o1 FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) return; etc_passwd_initted = 1; 20036a8: c4 28 63 b8 stb %g2, [ %g1 + 0x3b8 ] mkdir("/etc", 0777); 20036ac: 11 00 80 58 sethi %hi(0x2016000), %o0 20036b0: 40 00 02 6d call 2004064 20036b4: 90 12 20 e0 or %o0, 0xe0, %o0 ! 20160e0 /* * Initialize /etc/passwd */ if ((fp = fopen("/etc/passwd", "r")) != NULL) { 20036b8: 39 00 80 58 sethi %hi(0x2016000), %i4 20036bc: 3b 00 80 58 sethi %hi(0x2016000), %i5 20036c0: 90 17 20 e8 or %i4, 0xe8, %o0 20036c4: 40 00 31 f6 call 200fe9c 20036c8: 92 17 60 f8 or %i5, 0xf8, %o1 20036cc: 80 a2 20 00 cmp %o0, 0 20036d0: 22 80 00 0d be,a 2003704 20036d4: 90 17 20 e8 or %i4, 0xe8, %o0 } else if ((fp = fopen("/etc/passwd", "w")) != NULL) { fprintf(fp, "root:*:0:0:root::/:/bin/sh\n" "rtems:*:1:1:RTEMS Application::/:/bin/sh\n" "tty:!:2:2:tty owner::/:/bin/false\n" ); fclose(fp); 20036d8: 40 00 30 12 call 200f720 20036dc: 01 00 00 00 nop } /* * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { 20036e0: 39 00 80 58 sethi %hi(0x2016000), %i4 20036e4: 92 17 60 f8 or %i5, 0xf8, %o1 20036e8: 40 00 31 ed call 200fe9c 20036ec: 90 17 21 70 or %i4, 0x170, %o0 20036f0: 80 a2 20 00 cmp %o0, 0 20036f4: 22 80 00 11 be,a 2003738 20036f8: 90 17 21 70 or %i4, 0x170, %o0 fclose(fp); 20036fc: 40 00 30 09 call 200f720 2003700: 91 e8 00 08 restore %g0, %o0, %o0 * Initialize /etc/passwd */ if ((fp = fopen("/etc/passwd", "r")) != NULL) { fclose(fp); } else if ((fp = fopen("/etc/passwd", "w")) != NULL) { 2003704: 13 00 80 58 sethi %hi(0x2016000), %o1 2003708: 40 00 31 e5 call 200fe9c 200370c: 92 12 61 00 or %o1, 0x100, %o1 ! 2016100 2003710: b0 92 20 00 orcc %o0, 0, %i0 2003714: 02 bf ff f3 be 20036e0 <== NEVER TAKEN 2003718: 92 10 20 01 mov 1, %o1 fprintf(fp, "root:*:0:0:root::/:/bin/sh\n" 200371c: 94 10 20 66 mov 0x66, %o2 2003720: 96 10 00 18 mov %i0, %o3 2003724: 11 00 80 58 sethi %hi(0x2016000), %o0 2003728: 40 00 33 c7 call 2010644 200372c: 90 12 21 08 or %o0, 0x108, %o0 ! 2016108 "rtems:*:1:1:RTEMS Application::/:/bin/sh\n" "tty:!:2:2:tty owner::/:/bin/false\n" ); fclose(fp); 2003730: 10 bf ff ea b 20036d8 2003734: 90 10 00 18 mov %i0, %o0 * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { fclose(fp); } else if ((fp = fopen("/etc/group", "w")) != NULL) { 2003738: 13 00 80 58 sethi %hi(0x2016000), %o1 200373c: 40 00 31 d8 call 200fe9c 2003740: 92 12 61 00 or %o1, 0x100, %o1 ! 2016100 2003744: b0 92 20 00 orcc %o0, 0, %i0 2003748: 02 bf ff d5 be 200369c <== NEVER TAKEN 200374c: 01 00 00 00 nop fprintf( fp, "root:x:0:root\n" 2003750: 92 10 20 01 mov 1, %o1 ! 1 2003754: 11 00 80 58 sethi %hi(0x2016000), %o0 2003758: 94 10 20 2a mov 0x2a, %o2 200375c: 96 10 00 18 mov %i0, %o3 2003760: 40 00 33 b9 call 2010644 2003764: 90 12 21 80 or %o0, 0x180, %o0 "rtems:x:1:rtems\n" "tty:x:2:tty\n" ); fclose(fp); 2003768: 40 00 2f ee call 200f720 200376c: 81 e8 00 00 restore =============================================================================== 02004fe8 : /* * Process a single input character */ static int iproc (unsigned char c, struct rtems_termios_tty *tty) { 2004fe8: 9d e3 bf a0 save %sp, -96, %sp if (tty->termios.c_iflag & ISTRIP) 2004fec: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 2004ff0: 80 88 60 20 btst 0x20, %g1 2004ff4: 02 80 00 03 be 2005000 <== ALWAYS TAKEN 2004ff8: ba 10 00 18 mov %i0, %i5 c &= 0x7f; 2004ffc: ba 0e 20 7f and %i0, 0x7f, %i5 <== NOT EXECUTED if (tty->termios.c_iflag & IUCLC) 2005000: 80 88 62 00 btst 0x200, %g1 2005004: 02 80 00 0d be 2005038 2005008: 80 a7 60 0d cmp %i5, 0xd c = tolower (c); 200500c: 05 00 80 6e sethi %hi(0x201b800), %g2 2005010: c6 00 a2 0c ld [ %g2 + 0x20c ], %g3 ! 201ba0c <__ctype_ptr__> 2005014: 84 10 00 1d mov %i5, %g2 2005018: ba 00 c0 1d add %g3, %i5, %i5 200501c: c6 0f 60 01 ldub [ %i5 + 1 ], %g3 2005020: 86 08 e0 03 and %g3, 3, %g3 2005024: 80 a0 e0 01 cmp %g3, 1 2005028: 22 80 00 02 be,a 2005030 200502c: 84 00 a0 20 add %g2, 0x20, %g2 2005030: ba 08 a0 ff and %g2, 0xff, %i5 if (c == '\r') { 2005034: 80 a7 60 0d cmp %i5, 0xd 2005038: 02 80 00 17 be 2005094 200503c: 80 a7 60 0a cmp %i5, 0xa if (tty->termios.c_iflag & IGNCR) return 0; if (tty->termios.c_iflag & ICRNL) c = '\n'; } else if ((c == '\n') && (tty->termios.c_iflag & INLCR)) { 2005040: 02 80 00 40 be 2005140 2005044: 80 a7 60 00 cmp %i5, 0 c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 2005048: 32 80 00 1a bne,a 20050b0 <== ALWAYS TAKEN 200504c: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 } /* * FIXME: Should do IMAXBEL handling somehow */ if (tty->ccount < (CBUFSIZE-1)) { 2005050: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2005054: 05 00 80 6e sethi %hi(0x201b800), %g2 2005058: c4 00 a0 84 ld [ %g2 + 0x84 ], %g2 ! 201b884 200505c: 84 00 bf ff add %g2, -1, %g2 2005060: 80 a0 40 02 cmp %g1, %g2 2005064: 16 80 00 46 bge 200517c <== NEVER TAKEN 2005068: b0 10 20 00 clr %i0 if (tty->termios.c_lflag & ECHO) 200506c: c4 06 60 3c ld [ %i1 + 0x3c ], %g2 2005070: 80 88 a0 08 btst 8, %g2 2005074: 12 80 00 38 bne 2005154 <== ALWAYS TAKEN 2005078: 90 10 00 1d mov %i5, %o0 echo (c, tty); tty->cbuf[tty->ccount++] = c; 200507c: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 2005080: 84 00 60 01 add %g1, 1, %g2 2005084: fa 28 c0 01 stb %i5, [ %g3 + %g1 ] 2005088: c4 26 60 20 st %g2, [ %i1 + 0x20 ] } return 0; } 200508c: 81 c7 e0 08 ret 2005090: 91 e8 20 00 restore %g0, 0, %o0 if (tty->termios.c_iflag & IUCLC) c = tolower (c); if (c == '\r') { if (tty->termios.c_iflag & IGNCR) 2005094: 80 88 60 80 btst 0x80, %g1 2005098: 12 80 00 39 bne 200517c <== NEVER TAKEN 200509c: b0 10 20 00 clr %i0 return 0; if (tty->termios.c_iflag & ICRNL) 20050a0: 80 88 61 00 btst 0x100, %g1 20050a4: 32 80 00 02 bne,a 20050ac <== ALWAYS TAKEN 20050a8: ba 10 20 0a mov 0xa, %i5 c = '\n'; } else if ((c == '\n') && (tty->termios.c_iflag & INLCR)) { c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 20050ac: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 20050b0: 80 88 60 02 btst 2, %g1 20050b4: 22 bf ff e8 be,a 2005054 20050b8: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 if (c == tty->termios.c_cc[VERASE]) { 20050bc: c4 0e 60 43 ldub [ %i1 + 0x43 ], %g2 20050c0: 80 a0 80 1d cmp %g2, %i5 20050c4: 02 80 00 3d be 20051b8 20050c8: 90 10 00 19 mov %i1, %o0 erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { 20050cc: c4 0e 60 44 ldub [ %i1 + 0x44 ], %g2 20050d0: 80 a0 80 1d cmp %g2, %i5 20050d4: 02 80 00 28 be 2005174 20050d8: 92 10 20 01 mov 1, %o1 erase (tty, 1); return 0; } else if (c == tty->termios.c_cc[VEOF]) { 20050dc: c4 0e 60 45 ldub [ %i1 + 0x45 ], %g2 20050e0: 80 a0 80 1d cmp %g2, %i5 20050e4: 02 80 00 26 be 200517c <== NEVER TAKEN 20050e8: b0 10 20 01 mov 1, %i0 return 1; } else if (c == '\n') { 20050ec: 80 a7 60 0a cmp %i5, 0xa 20050f0: 02 80 00 25 be 2005184 20050f4: 80 88 60 48 btst 0x48, %g1 if (tty->termios.c_lflag & (ECHO | ECHONL)) echo (c, tty); tty->cbuf[tty->ccount++] = c; return 1; } else if ((c == tty->termios.c_cc[VEOL]) || 20050f8: c4 0e 60 4c ldub [ %i1 + 0x4c ], %g2 20050fc: 80 a0 80 1d cmp %g2, %i5 2005100: 02 80 00 07 be 200511c <== NEVER TAKEN 2005104: 80 88 60 08 btst 8, %g1 2005108: c4 0e 60 51 ldub [ %i1 + 0x51 ], %g2 200510c: 80 a0 80 1d cmp %g2, %i5 2005110: 32 bf ff d1 bne,a 2005054 <== ALWAYS TAKEN 2005114: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (c == tty->termios.c_cc[VEOL2])) { if (tty->termios.c_lflag & ECHO) 2005118: 80 88 60 08 btst 8, %g1 <== NOT EXECUTED 200511c: 32 80 00 12 bne,a 2005164 <== NOT EXECUTED 2005120: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED echo (c, tty); tty->cbuf[tty->ccount++] = c; 2005124: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2005128: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 <== NOT EXECUTED 200512c: 84 00 60 01 add %g1, 1, %g2 <== NOT EXECUTED 2005130: fa 28 c0 01 stb %i5, [ %g3 + %g1 ] <== NOT EXECUTED 2005134: c4 26 60 20 st %g2, [ %i1 + 0x20 ] <== NOT EXECUTED return 1; 2005138: 81 c7 e0 08 ret <== NOT EXECUTED 200513c: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED if (c == '\r') { if (tty->termios.c_iflag & IGNCR) return 0; if (tty->termios.c_iflag & ICRNL) c = '\n'; } else if ((c == '\n') && (tty->termios.c_iflag & INLCR)) { 2005140: 80 88 60 40 btst 0x40, %g1 2005144: 32 bf ff da bne,a 20050ac <== NEVER TAKEN 2005148: ba 10 20 0d mov 0xd, %i5 <== NOT EXECUTED c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 200514c: 10 bf ff d9 b 20050b0 2005150: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 /* * FIXME: Should do IMAXBEL handling somehow */ if (tty->ccount < (CBUFSIZE-1)) { if (tty->termios.c_lflag & ECHO) echo (c, tty); 2005154: 7f ff fe f6 call 2004d2c 2005158: 92 10 00 19 mov %i1, %o1 200515c: 10 bf ff c8 b 200507c 2005160: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 tty->cbuf[tty->ccount++] = c; return 1; } else if ((c == tty->termios.c_cc[VEOL]) || (c == tty->termios.c_cc[VEOL2])) { if (tty->termios.c_lflag & ECHO) echo (c, tty); 2005164: 7f ff fe f2 call 2004d2c <== NOT EXECUTED 2005168: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED tty->cbuf[tty->ccount++] = c; 200516c: 10 bf ff ef b 2005128 <== NOT EXECUTED 2005170: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED if (c == tty->termios.c_cc[VERASE]) { erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { erase (tty, 1); 2005174: 7f ff ff 0f call 2004db0 2005178: b0 10 20 00 clr %i0 return 0; 200517c: 81 c7 e0 08 ret 2005180: 81 e8 00 00 restore } else if (c == tty->termios.c_cc[VEOF]) { return 1; } else if (c == '\n') { if (tty->termios.c_lflag & (ECHO | ECHONL)) 2005184: 22 80 00 06 be,a 200519c <== NEVER TAKEN 2005188: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED echo (c, tty); 200518c: 90 10 20 0a mov 0xa, %o0 2005190: 7f ff fe e7 call 2004d2c 2005194: 92 10 00 19 mov %i1, %o1 tty->cbuf[tty->ccount++] = c; 2005198: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 200519c: c4 06 60 1c ld [ %i1 + 0x1c ], %g2 20051a0: 86 10 20 0a mov 0xa, %g3 20051a4: c6 28 80 01 stb %g3, [ %g2 + %g1 ] 20051a8: 82 00 60 01 inc %g1 20051ac: c2 26 60 20 st %g1, [ %i1 + 0x20 ] return 1; 20051b0: 81 c7 e0 08 ret 20051b4: 91 e8 20 01 restore %g0, 1, %o0 c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { if (c == tty->termios.c_cc[VERASE]) { erase (tty, 0); 20051b8: 92 10 20 00 clr %o1 20051bc: 7f ff fe fd call 2004db0 20051c0: b0 10 20 00 clr %i0 return 0; 20051c4: 81 c7 e0 08 ret 20051c8: 81 e8 00 00 restore =============================================================================== 020190d8 : #if !defined(RTEMS_POSIX_API) int kill( pid_t pid, int sig ) { return 0; } 20190d8: 81 c3 e0 08 retl <== NOT EXECUTED 20190dc: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 02003854 : extern void _wrapup_reent(struct _reent *); extern void _reclaim_reent(struct _reent *); void libc_wrapup(void) { 2003854: 9d e3 bf a0 save %sp, -96, %sp /* * In case RTEMS is already down, don't do this. It could be * dangerous. */ if (!_System_state_Is_up(_System_state_Get())) 2003858: 03 00 80 71 sethi %hi(0x201c400), %g1 200385c: c2 00 60 c4 ld [ %g1 + 0xc4 ], %g1 ! 201c4c4 <_System_state_Current> 2003860: 80 a0 60 03 cmp %g1, 3 2003864: 02 80 00 04 be 2003874 <== ALWAYS TAKEN 2003868: 3b 00 80 6e sethi %hi(0x201b800), %i5 200386c: 81 c7 e0 08 ret <== NOT EXECUTED 2003870: 81 e8 00 00 restore <== NOT EXECUTED /* * This was already done if the user called exit() directly . _wrapup_reent(0); */ if (_REENT != _global_impure_ptr) { 2003874: 05 00 80 6a sethi %hi(0x201a800), %g2 2003878: c2 07 62 10 ld [ %i5 + 0x210 ], %g1 200387c: f8 00 a3 f8 ld [ %g2 + 0x3f8 ], %i4 2003880: 80 a0 40 1c cmp %g1, %i4 2003884: 02 80 00 05 be 2003898 2003888: 01 00 00 00 nop _wrapup_reent(_global_impure_ptr); 200388c: 40 00 2f de call 200f804 <_wrapup_reent> 2003890: 90 10 00 1c mov %i4, %o0 /* Don't reclaim this one, just in case we do printfs * on the way out to ROM. */ _reclaim_reent(&libc_global_reent); #endif _REENT = _global_impure_ptr; 2003894: f8 27 62 10 st %i4, [ %i5 + 0x210 ] * * Should this be changed to do *all* file streams? * _fwalk (_REENT, fclose); */ fclose (stdin); 2003898: 40 00 2c f1 call 200ec5c 200389c: d0 07 20 04 ld [ %i4 + 4 ], %o0 fclose (stdout); 20038a0: c2 07 62 10 ld [ %i5 + 0x210 ], %g1 20038a4: 40 00 2c ee call 200ec5c 20038a8: d0 00 60 08 ld [ %g1 + 8 ], %o0 fclose (stderr); 20038ac: c2 07 62 10 ld [ %i5 + 0x210 ], %g1 20038b0: f0 00 60 0c ld [ %g1 + 0xc ], %i0 20038b4: 40 00 2c ea call 200ec5c 20038b8: 81 e8 00 00 restore =============================================================================== 020032a8 : #include "malloc_p.h" void *malloc( size_t size ) { 20032a8: 9d e3 bf a0 save %sp, -96, %sp void *return_this; MSBUMP(malloc_calls, 1); 20032ac: 03 00 80 70 sethi %hi(0x201c000), %g1 20032b0: 82 10 61 c0 or %g1, 0x1c0, %g1 ! 201c1c0 20032b4: c4 00 60 04 ld [ %g1 + 4 ], %g2 #include "malloc_p.h" void *malloc( size_t size ) { 20032b8: ba 10 00 18 mov %i0, %i5 void *return_this; MSBUMP(malloc_calls, 1); 20032bc: 84 00 a0 01 inc %g2 /* * If some free's have been deferred, then do them now. */ malloc_deferred_frees_process(); 20032c0: 7f ff ff aa call 2003168 20032c4: c4 20 60 04 st %g2, [ %g1 + 4 ] /* * Validate the parameters */ if ( !size ) 20032c8: 80 a7 60 00 cmp %i5, 0 20032cc: 02 80 00 1e be 2003344 20032d0: b0 10 20 00 clr %i0 return (void *) 0; /* * Do not attempt to allocate memory if not in correct system state. */ if ( _System_state_Is_up(_System_state_Get()) && 20032d4: 03 00 80 71 sethi %hi(0x201c400), %g1 20032d8: c2 00 60 c4 ld [ %g1 + 0xc4 ], %g1 ! 201c4c4 <_System_state_Current> 20032dc: 80 a0 60 03 cmp %g1, 3 20032e0: 02 80 00 1b be 200334c 20032e4: 03 00 80 6d sethi %hi(0x201b400), %g1 RTEMS_INLINE_ROUTINE void *_Protected_heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Protected_heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 20032e8: d0 00 63 60 ld [ %g1 + 0x360 ], %o0 ! 201b760 20032ec: 92 10 00 1d mov %i5, %o1 20032f0: 94 10 20 00 clr %o2 20032f4: 40 00 14 e4 call 2008684 <_Protected_heap_Allocate_aligned_with_boundary> 20032f8: 96 10 20 00 clr %o3 * If this fails then return a NULL pointer. */ return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); if ( !return_this ) { 20032fc: b0 92 20 00 orcc %o0, 0, %i0 2003300: 02 80 00 21 be 2003384 <== NEVER TAKEN 2003304: 03 00 80 6f sethi %hi(0x201bc00), %g1 } /* * If the user wants us to dirty the allocated memory, then do it. */ if ( rtems_malloc_dirty_helper ) 2003308: 03 00 80 6f sethi %hi(0x201bc00), %g1 200330c: c2 00 63 00 ld [ %g1 + 0x300 ], %g1 ! 201bf00 2003310: 80 a0 60 00 cmp %g1, 0 2003314: 02 80 00 04 be 2003324 2003318: 90 10 00 18 mov %i0, %o0 (*rtems_malloc_dirty_helper)( return_this, size ); 200331c: 9f c0 40 00 call %g1 2003320: 92 10 00 1d mov %i5, %o1 /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 2003324: 03 00 80 6f sethi %hi(0x201bc00), %g1 2003328: c2 00 63 08 ld [ %g1 + 0x308 ], %g1 ! 201bf08 200332c: 80 a0 60 00 cmp %g1, 0 2003330: 02 80 00 25 be 20033c4 2003334: 01 00 00 00 nop (*rtems_malloc_statistics_helpers->at_malloc)(return_this); 2003338: c2 00 60 04 ld [ %g1 + 4 ], %g1 200333c: 9f c0 40 00 call %g1 2003340: 90 10 00 18 mov %i0, %o0 return return_this; } 2003344: 81 c7 e0 08 ret 2003348: 81 e8 00 00 restore /* * Do not attempt to allocate memory if not in correct system state. */ if ( _System_state_Is_up(_System_state_Get()) && !malloc_is_system_state_OK() ) 200334c: 7f ff ff 75 call 2003120 2003350: 01 00 00 00 nop return (void *) 0; /* * Do not attempt to allocate memory if not in correct system state. */ if ( _System_state_Is_up(_System_state_Get()) && 2003354: 80 8a 20 ff btst 0xff, %o0 2003358: 02 bf ff fb be 2003344 <== NEVER TAKEN 200335c: 03 00 80 6d sethi %hi(0x201b400), %g1 2003360: d0 00 63 60 ld [ %g1 + 0x360 ], %o0 ! 201b760 2003364: 92 10 00 1d mov %i5, %o1 2003368: 94 10 20 00 clr %o2 200336c: 40 00 14 c6 call 2008684 <_Protected_heap_Allocate_aligned_with_boundary> 2003370: 96 10 20 00 clr %o3 * If this fails then return a NULL pointer. */ return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); if ( !return_this ) { 2003374: b0 92 20 00 orcc %o0, 0, %i0 2003378: 12 bf ff e5 bne 200330c 200337c: 03 00 80 6f sethi %hi(0x201bc00), %g1 if (rtems_malloc_sbrk_helpers) 2003380: 03 00 80 6f sethi %hi(0x201bc00), %g1 2003384: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201bf04 2003388: 80 a0 60 00 cmp %g1, 0 200338c: 02 80 00 0a be 20033b4 2003390: 01 00 00 00 nop return_this = (*rtems_malloc_sbrk_helpers->extend)( size ); 2003394: c2 00 60 04 ld [ %g1 + 4 ], %g1 2003398: 9f c0 40 00 call %g1 200339c: 90 10 00 1d mov %i5, %o0 if ( !return_this ) { 20033a0: 80 a2 20 00 cmp %o0, 0 20033a4: 02 80 00 04 be 20033b4 20033a8: 01 00 00 00 nop 20033ac: 10 bf ff d7 b 2003308 20033b0: b0 10 00 08 mov %o0, %i0 errno = ENOMEM; 20033b4: 40 00 2d d8 call 200eb14 <__errno> 20033b8: 01 00 00 00 nop 20033bc: 82 10 20 0c mov 0xc, %g1 ! c 20033c0: c2 22 00 00 st %g1, [ %o0 ] return (void *) 0; 20033c4: 81 c7 e0 08 ret 20033c8: 81 e8 00 00 restore =============================================================================== 020030fc : } void *malloc_sbrk_extend_and_allocate( size_t size ) { 20030fc: 9d e3 bf a0 save %sp, -96, %sp * Round to the "requested sbrk amount" so hopefully we won't have * to grow again for a while. This effectively does sbrk() calls * in "page" amounts. */ sbrk_amount = RTEMS_Malloc_Sbrk_amount; 2003100: 03 00 80 57 sethi %hi(0x2015c00), %g1 2003104: fa 00 63 98 ld [ %g1 + 0x398 ], %i5 ! 2015f98 if ( sbrk_amount == 0 ) 2003108: 80 a7 60 00 cmp %i5, 0 200310c: 02 80 00 20 be 200318c <== NEVER TAKEN 2003110: b2 10 00 18 mov %i0, %i1 return (void *) 0; the_size = ((size + sbrk_amount) / sbrk_amount * sbrk_amount); 2003114: 92 10 00 1d mov %i5, %o1 2003118: 40 00 3c 10 call 2012158 <.udiv> 200311c: 90 06 00 1d add %i0, %i5, %o0 2003120: 40 00 3b d4 call 2012070 <.umul> 2003124: 92 10 00 1d mov %i5, %o1 starting_address = (void *) sbrk(the_size); 2003128: 7f ff f8 b3 call 20013f4 200312c: ba 10 00 08 mov %o0, %i5 if ( starting_address == (void*) -1 ) 2003130: 80 a2 3f ff cmp %o0, -1 2003134: 02 80 00 16 be 200318c 2003138: 92 10 00 08 mov %o0, %o1 return (void *) 0; if ( !_Protected_heap_Extend( 200313c: 39 00 80 54 sethi %hi(0x2015000), %i4 2003140: d0 07 23 f0 ld [ %i4 + 0x3f0 ], %o0 ! 20153f0 2003144: 40 00 14 70 call 2008304 <_Protected_heap_Extend> 2003148: 94 10 00 1d mov %i5, %o2 200314c: 80 8a 20 ff btst 0xff, %o0 2003150: 02 80 00 09 be 2003174 2003154: 03 00 80 57 sethi %hi(0x2015c00), %g1 2003158: f0 07 23 f0 ld [ %i4 + 0x3f0 ], %i0 sbrk(-the_size); errno = ENOMEM; return (void *) 0; } MSBUMP(space_available, the_size); 200315c: c4 00 63 68 ld [ %g1 + 0x368 ], %g2 2003160: b4 10 20 00 clr %i2 2003164: ba 07 40 02 add %i5, %g2, %i5 2003168: fa 20 63 68 st %i5, [ %g1 + 0x368 ] 200316c: 40 00 14 58 call 20082cc <_Protected_heap_Allocate_aligned_with_boundary> 2003170: 97 e8 20 00 restore %g0, 0, %o3 if ( starting_address == (void*) -1 ) return (void *) 0; if ( !_Protected_heap_Extend( RTEMS_Malloc_Heap, starting_address, the_size) ) { sbrk(-the_size); 2003174: 7f ff f8 a0 call 20013f4 2003178: 90 20 00 1d neg %i5, %o0 errno = ENOMEM; 200317c: 40 00 2e 3e call 200ea74 <__errno> 2003180: 01 00 00 00 nop 2003184: 82 10 20 0c mov 0xc, %g1 ! c 2003188: c2 22 00 00 st %g1, [ %o0 ] MSBUMP(space_available, the_size); return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); return return_this; } 200318c: 81 c7 e0 08 ret 2003190: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02003194 : void *malloc_sbrk_initialize( void *starting_address, size_t length ) { 2003194: 9d e3 bf a0 save %sp, -96, %sp uintptr_t old_address; uintptr_t uaddress; RTEMS_Malloc_Sbrk_amount = length; 2003198: 03 00 80 57 sethi %hi(0x2015c00), %g1 * If the starting address is 0 then we are to attempt to * get length worth of memory using sbrk. Make sure we * align the address that we get back. */ if (!starting_address) { 200319c: 80 a6 20 00 cmp %i0, 0 20031a0: 02 80 00 04 be 20031b0 20031a4: f2 20 63 98 st %i1, [ %g1 + 0x398 ] } starting_address = (void *)uaddress; } return starting_address; } 20031a8: 81 c7 e0 08 ret 20031ac: 81 e8 00 00 restore * get length worth of memory using sbrk. Make sure we * align the address that we get back. */ if (!starting_address) { uaddress = (uintptr_t)sbrk(length); 20031b0: 7f ff f8 91 call 20013f4 20031b4: 90 10 00 19 mov %i1, %o0 if (uaddress == (uintptr_t) -1) { 20031b8: 80 a2 3f ff cmp %o0, -1 20031bc: 02 80 00 08 be 20031dc <== ALWAYS TAKEN 20031c0: 80 8a 20 07 btst 7, %o0 rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); /* DOES NOT RETURN!!! */ } if (uaddress & (CPU_HEAP_ALIGNMENT-1)) { 20031c4: 02 80 00 04 be 20031d4 <== NOT EXECUTED 20031c8: 01 00 00 00 nop <== NOT EXECUTED old_address = uaddress; uaddress = (uaddress + CPU_HEAP_ALIGNMENT) & ~(CPU_HEAP_ALIGNMENT-1); 20031cc: 90 02 20 08 add %o0, 8, %o0 <== NOT EXECUTED 20031d0: 90 0a 3f f8 and %o0, -8, %o0 <== NOT EXECUTED } starting_address = (void *)uaddress; } return starting_address; } 20031d4: 81 c7 e0 08 ret <== NOT EXECUTED 20031d8: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED if (!starting_address) { uaddress = (uintptr_t)sbrk(length); if (uaddress == (uintptr_t) -1) { rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); 20031dc: 40 00 0e dd call 2006d50 20031e0: 90 10 20 1a mov 0x1a, %o0 =============================================================================== 0200d798 : */ void memfile_free_blocks_in_table( block_p **block_table, int entries ) { 200d798: 9d e3 bf a0 save %sp, -96, %sp /* * Now go through all the slots in the table and free the memory. */ b = *block_table; for ( i=0 ; i<== NEVER TAKEN 200d7a4: d0 06 00 00 ld [ %i0 ], %o0 200d7a8: ba 10 00 08 mov %o0, %i5 200d7ac: b8 10 20 00 clr %i4 if ( b[i] ) { 200d7b0: d0 07 40 00 ld [ %i5 ], %o0 200d7b4: 80 a2 20 00 cmp %o0, 0 200d7b8: 02 80 00 05 be 200d7cc 200d7bc: b8 07 20 01 inc %i4 memfile_free_block( b[i] ); 200d7c0: 7f ff ff ed call 200d774 200d7c4: 01 00 00 00 nop b[i] = 0; 200d7c8: c0 27 40 00 clr [ %i5 ] /* * Now go through all the slots in the table and free the memory. */ b = *block_table; for ( i=0 ; i 200d7d4: ba 07 60 04 add %i5, 4, %i5 200d7d8: d0 06 00 00 ld [ %i0 ], %o0 /* * Now that all the blocks in the block table are free, we can * free the block table itself. */ memfile_free_block( *block_table ); 200d7dc: 7f ff ff e6 call 200d774 200d7e0: 01 00 00 00 nop *block_table = 0; 200d7e4: c0 26 00 00 clr [ %i0 ] } 200d7e8: 81 c7 e0 08 ret 200d7ec: 81 e8 00 00 restore =============================================================================== 0200ddc4 : */ int memfile_ftruncate( rtems_libio_t *iop, rtems_off64_t length ) { 200ddc4: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; 200ddc8: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 * POSIX 1003.1b does not specify what happens if you truncate a file * and the new length is greater than the current size. We treat this * as an extend operation. */ if ( length > the_jnode->info.file.size ) 200ddcc: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200ddd0: 80 a0 40 19 cmp %g1, %i1 200ddd4: 06 80 00 13 bl 200de20 <== NEVER TAKEN 200ddd8: 90 10 00 1d mov %i5, %o0 200dddc: 22 80 00 0d be,a 200de10 200dde0: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 /* * The in-memory files do not currently reclaim memory until the file is * deleted. So we leave the previously allocated blocks in place for * future use and just set the length. */ the_jnode->info.file.size = length; 200dde4: f2 27 60 50 st %i1, [ %i5 + 0x50 ] 200dde8: f4 27 60 54 st %i2, [ %i5 + 0x54 ] iop->size = the_jnode->info.file.size; 200ddec: f2 26 20 08 st %i1, [ %i0 + 8 ] 200ddf0: f4 26 20 0c st %i2, [ %i0 + 0xc ] IMFS_update_atime( the_jnode ); 200ddf4: 90 07 bf f8 add %fp, -8, %o0 200ddf8: 7f ff d4 74 call 2002fc8 200ddfc: 92 10 20 00 clr %o1 200de00: c2 07 bf f8 ld [ %fp + -8 ], %g1 200de04: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return 0; } 200de08: 81 c7 e0 08 ret 200de0c: 91 e8 20 00 restore %g0, 0, %o0 * POSIX 1003.1b does not specify what happens if you truncate a file * and the new length is greater than the current size. We treat this * as an extend operation. */ if ( length > the_jnode->info.file.size ) 200de10: 80 a0 40 1a cmp %g1, %i2 200de14: 3a bf ff f5 bcc,a 200dde8 200de18: f2 27 60 50 st %i1, [ %i5 + 0x50 ] return IMFS_memfile_extend( the_jnode, length ); 200de1c: 90 10 00 1d mov %i5, %o0 200de20: 92 10 00 19 mov %i1, %o1 200de24: 7f ff fe dd call 200d998 200de28: 94 10 00 1a mov %i2, %o2 200de2c: 81 c7 e0 08 ret 200de30: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200de34 : rtems_off64_t memfile_lseek( rtems_libio_t *iop, rtems_off64_t offset, int whence ) { 200de34: 9d e3 bf a0 save %sp, -96, %sp IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; 200de38: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 if (the_jnode->type == IMFS_LINEAR_FILE) { 200de3c: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200de40: 80 a0 60 06 cmp %g1, 6 200de44: 02 80 00 0f be 200de80 200de48: c4 1e 20 10 ldd [ %i0 + 0x10 ], %g2 if (iop->offset > the_jnode->info.linearfile.size) iop->offset = the_jnode->info.linearfile.size; } else { /* Must be a block file (IMFS_MEMORY_FILE). */ if (IMFS_memfile_extend( the_jnode, iop->offset )) 200de4c: 90 10 00 1d mov %i5, %o0 200de50: 92 10 00 02 mov %g2, %o1 200de54: 7f ff fe d1 call 200d998 200de58: 94 10 00 03 mov %g3, %o2 200de5c: 80 a2 20 00 cmp %o0, 0 200de60: 12 80 00 19 bne 200dec4 200de64: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSPC ); iop->size = the_jnode->info.file.size; 200de68: d8 1f 60 50 ldd [ %i5 + 0x50 ], %o4 200de6c: c4 1e 20 10 ldd [ %i0 + 0x10 ], %g2 200de70: d8 3e 20 08 std %o4, [ %i0 + 8 ] } return iop->offset; } 200de74: b0 10 00 02 mov %g2, %i0 200de78: 81 c7 e0 08 ret 200de7c: 93 e8 00 03 restore %g0, %g3, %o1 IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; if (the_jnode->type == IMFS_LINEAR_FILE) { if (iop->offset > the_jnode->info.linearfile.size) 200de80: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200de84: 80 a0 80 01 cmp %g2, %g1 200de88: 14 80 00 08 bg 200dea8 <== NEVER TAKEN 200de8c: c8 07 60 54 ld [ %i5 + 0x54 ], %g4 200de90: 80 a0 80 01 cmp %g2, %g1 200de94: 32 bf ff f9 bne,a 200de78 <== NEVER TAKEN 200de98: b0 10 00 02 mov %g2, %i0 <== NOT EXECUTED 200de9c: 80 a0 c0 04 cmp %g3, %g4 200dea0: 28 bf ff f6 bleu,a 200de78 <== ALWAYS TAKEN 200dea4: b0 10 00 02 mov %g2, %i0 iop->offset = the_jnode->info.linearfile.size; 200dea8: c2 26 20 10 st %g1, [ %i0 + 0x10 ] <== NOT EXECUTED 200deac: 84 10 00 01 mov %g1, %g2 <== NOT EXECUTED 200deb0: c8 26 20 14 st %g4, [ %i0 + 0x14 ] <== NOT EXECUTED 200deb4: 86 10 00 04 mov %g4, %g3 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOSPC ); iop->size = the_jnode->info.file.size; } return iop->offset; } 200deb8: b0 10 00 02 mov %g2, %i0 <== NOT EXECUTED 200debc: 81 c7 e0 08 ret <== NOT EXECUTED 200dec0: 93 e8 00 03 restore %g0, %g3, %o1 <== NOT EXECUTED if (iop->offset > the_jnode->info.linearfile.size) iop->offset = the_jnode->info.linearfile.size; } else { /* Must be a block file (IMFS_MEMORY_FILE). */ if (IMFS_memfile_extend( the_jnode, iop->offset )) rtems_set_errno_and_return_minus_one( ENOSPC ); 200dec4: 40 00 03 14 call 200eb14 <__errno> 200dec8: 01 00 00 00 nop 200decc: 05 3f ff ff sethi %hi(0xfffffc00), %g2 200ded0: 82 10 20 1c mov 0x1c, %g1 200ded4: 84 10 a3 ff or %g2, 0x3ff, %g2 200ded8: c2 22 00 00 st %g1, [ %o0 ] 200dedc: 10 bf ff e6 b 200de74 200dee0: 86 10 00 02 mov %g2, %g3 =============================================================================== 0200dd14 : rtems_libio_t *iop, const char *pathname, uint32_t flag, uint32_t mode ) { 200dd14: 9d e3 bf a0 save %sp, -96, %sp the_jnode = iop->pathinfo.node_access; /* * Perform 'copy on write' for linear files */ if ((iop->flags & (LIBIO_FLAGS_WRITE | LIBIO_FLAGS_APPEND)) 200dd18: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 rtems_libio_t *iop, const char *pathname, uint32_t flag, uint32_t mode ) { 200dd1c: ba 10 00 18 mov %i0, %i5 the_jnode = iop->pathinfo.node_access; /* * Perform 'copy on write' for linear files */ if ((iop->flags & (LIBIO_FLAGS_WRITE | LIBIO_FLAGS_APPEND)) 200dd20: 80 88 62 04 btst 0x204, %g1 200dd24: 02 80 00 06 be 200dd3c 200dd28: f8 06 20 1c ld [ %i0 + 0x1c ], %i4 && (the_jnode->type == IMFS_LINEAR_FILE)) { 200dd2c: c4 07 20 4c ld [ %i4 + 0x4c ], %g2 200dd30: 80 a0 a0 06 cmp %g2, 6 200dd34: 22 80 00 0c be,a 200dd64 <== NEVER TAKEN 200dd38: d8 07 20 54 ld [ %i4 + 0x54 ], %o4 <== NOT EXECUTED the_jnode->info.file.size = 0; the_jnode->info.file.indirect = 0; the_jnode->info.file.doubly_indirect = 0; the_jnode->info.file.triply_indirect = 0; if ((count != 0) && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) 200dd3c: c4 1f 20 50 ldd [ %i4 + 0x50 ], %g2 return -1; } if (iop->flags & LIBIO_FLAGS_APPEND) 200dd40: 80 88 62 00 btst 0x200, %g1 200dd44: 22 80 00 05 be,a 200dd58 200dd48: c4 3f 60 08 std %g2, [ %i5 + 8 ] iop->offset = the_jnode->info.file.size; 200dd4c: c4 3f 60 10 std %g2, [ %i5 + 0x10 ] 200dd50: c4 1f 20 50 ldd [ %i4 + 0x50 ], %g2 iop->size = the_jnode->info.file.size; 200dd54: c4 3f 60 08 std %g2, [ %i5 + 8 ] return 0; 200dd58: b0 10 20 00 clr %i0 } 200dd5c: 81 c7 e0 08 ret 200dd60: 81 e8 00 00 restore * Perform 'copy on write' for linear files */ if ((iop->flags & (LIBIO_FLAGS_WRITE | LIBIO_FLAGS_APPEND)) && (the_jnode->type == IMFS_LINEAR_FILE)) { uint32_t count = the_jnode->info.linearfile.size; const unsigned char *buffer = the_jnode->info.linearfile.direct; 200dd64: d6 07 20 58 ld [ %i4 + 0x58 ], %o3 <== NOT EXECUTED the_jnode->type = IMFS_MEMORY_FILE; 200dd68: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200dd6c: c0 27 20 50 clr [ %i4 + 0x50 ] <== NOT EXECUTED 200dd70: c0 27 20 54 clr [ %i4 + 0x54 ] <== NOT EXECUTED if ((iop->flags & (LIBIO_FLAGS_WRITE | LIBIO_FLAGS_APPEND)) && (the_jnode->type == IMFS_LINEAR_FILE)) { uint32_t count = the_jnode->info.linearfile.size; const unsigned char *buffer = the_jnode->info.linearfile.direct; the_jnode->type = IMFS_MEMORY_FILE; 200dd74: c2 27 20 4c st %g1, [ %i4 + 0x4c ] <== NOT EXECUTED the_jnode->info.file.size = 0; the_jnode->info.file.indirect = 0; 200dd78: c0 27 20 58 clr [ %i4 + 0x58 ] <== NOT EXECUTED the_jnode->info.file.doubly_indirect = 0; 200dd7c: c0 27 20 5c clr [ %i4 + 0x5c ] <== NOT EXECUTED the_jnode->info.file.triply_indirect = 0; if ((count != 0) 200dd80: 80 a3 20 00 cmp %o4, 0 <== NOT EXECUTED 200dd84: 12 80 00 06 bne 200dd9c <== NOT EXECUTED 200dd88: c0 27 20 60 clr [ %i4 + 0x60 ] <== NOT EXECUTED 200dd8c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 <== NOT EXECUTED 200dd90: 84 10 20 00 clr %g2 <== NOT EXECUTED 200dd94: 10 bf ff eb b 200dd40 <== NOT EXECUTED 200dd98: 86 10 20 00 clr %g3 <== NOT EXECUTED && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) 200dd9c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 200dda0: 92 10 20 00 clr %o1 <== NOT EXECUTED 200dda4: 94 10 20 00 clr %o2 <== NOT EXECUTED 200dda8: 7f ff ff 57 call 200db04 <== NOT EXECUTED 200ddac: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200ddb0: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 200ddb4: 02 bf ff ea be 200dd5c <== NOT EXECUTED 200ddb8: 01 00 00 00 nop <== NOT EXECUTED 200ddbc: 10 bf ff e0 b 200dd3c <== NOT EXECUTED 200ddc0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 <== NOT EXECUTED =============================================================================== 020033e8 : int mknod( const char *pathname, mode_t mode, dev_t dev ) { 20033e8: 9d e3 bf 80 save %sp, -128, %sp int result; /* * The file type is field within the mode. Check we have a sane mode set. */ switch (mode & S_IFMT) 20033ec: 05 00 00 10 sethi %hi(0x4000), %g2 20033f0: 03 00 00 3c sethi %hi(0xf000), %g1 20033f4: 82 0e 40 01 and %i1, %g1, %g1 20033f8: 80 a0 40 02 cmp %g1, %g2 20033fc: 02 80 00 18 be 200345c 2003400: 90 10 00 18 mov %i0, %o0 2003404: 08 80 00 0f bleu 2003440 2003408: 05 00 00 04 sethi %hi(0x1000), %g2 200340c: 05 00 00 18 sethi %hi(0x6000), %g2 2003410: 80 a0 40 02 cmp %g1, %g2 2003414: 02 80 00 12 be 200345c 2003418: 05 00 00 20 sethi %hi(0x8000), %g2 200341c: 80 a0 40 02 cmp %g1, %g2 2003420: 02 80 00 10 be 2003460 <== ALWAYS TAKEN 2003424: 92 07 bf f8 add %fp, -8, %o1 case S_IFBLK: case S_IFREG: case S_IFIFO: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2003428: 40 00 2d bb call 200eb14 <__errno> 200342c: b0 10 3f ff mov -1, %i0 2003430: 82 10 20 16 mov 0x16, %g1 2003434: c2 22 00 00 st %g1, [ %o0 ] 2003438: 81 c7 e0 08 ret 200343c: 81 e8 00 00 restore int result; /* * The file type is field within the mode. Check we have a sane mode set. */ switch (mode & S_IFMT) 2003440: 80 a0 40 02 cmp %g1, %g2 2003444: 02 80 00 05 be 2003458 2003448: 05 00 00 08 sethi %hi(0x2000), %g2 200344c: 80 a0 40 02 cmp %g1, %g2 2003450: 12 bf ff f6 bne 2003428 2003454: 01 00 00 00 nop break; default: rtems_set_errno_and_return_minus_one( EINVAL ); } rtems_filesystem_get_start_loc( pathname, &i, &temp_loc ); 2003458: 90 10 00 18 mov %i0, %o0 200345c: 92 07 bf f8 add %fp, -8, %o1 2003460: 40 00 02 8b call 2003e8c 2003464: 94 07 bf e4 add %fp, -28, %o2 result = (*temp_loc.ops->evalformake_h)( 2003468: c2 07 bf f0 ld [ %fp + -16 ], %g1 200346c: d0 07 bf f8 ld [ %fp + -8 ], %o0 2003470: c2 00 60 04 ld [ %g1 + 4 ], %g1 2003474: 90 06 00 08 add %i0, %o0, %o0 2003478: 92 07 bf e4 add %fp, -28, %o1 200347c: 94 07 bf fc add %fp, -4, %o2 2003480: 9f c0 40 00 call %g1 2003484: b0 10 3f ff mov -1, %i0 &pathname[i], &temp_loc, &name_start ); if ( result != 0 ) 2003488: 80 a2 20 00 cmp %o0, 0 200348c: 12 bf ff eb bne 2003438 2003490: c2 07 bf f0 ld [ %fp + -16 ], %g1 return -1; result = (*temp_loc.ops->mknod_h)( name_start, mode, dev, &temp_loc ); 2003494: d0 07 bf fc ld [ %fp + -4 ], %o0 2003498: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 200349c: 92 10 00 19 mov %i1, %o1 20034a0: 94 10 00 1a mov %i2, %o2 20034a4: 96 10 00 1b mov %i3, %o3 20034a8: 9f c0 40 00 call %g1 20034ac: 98 07 bf e4 add %fp, -28, %o4 20034b0: b0 10 00 08 mov %o0, %i0 rtems_filesystem_freenode( &temp_loc ); 20034b4: 7f ff fe 94 call 2002f04 20034b8: 90 07 bf e4 add %fp, -28, %o0 return result; } 20034bc: 81 c7 e0 08 ret 20034c0: 81 e8 00 00 restore =============================================================================== 0200354c : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 200354c: 9d e3 bf 88 save %sp, -120, %sp /* * Are the file system options valid? */ if ( options != RTEMS_FILESYSTEM_READ_ONLY && 2003550: 80 a6 e0 01 cmp %i3, 1 2003554: 18 80 00 85 bgu 2003768 2003558: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); /* * Get mount handler */ mount_h = rtems_filesystem_get_mount_handler( filesystemtype ); 200355c: 40 00 22 e4 call 200c0ec 2003560: 90 10 00 1a mov %i2, %o0 if ( !mount_h ) 2003564: a2 92 20 00 orcc %o0, 0, %l1 2003568: 02 80 00 80 be 2003768 200356c: 80 a0 00 19 cmp %g0, %i1 const char *target_or_null, const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; 2003570: a0 40 20 00 addx %g0, 0, %l0 2003574: 80 a4 20 00 cmp %l0, 0 2003578: 02 80 00 77 be 2003754 200357c: 90 10 00 19 mov %i1, %o0 * 4) The mount point exists with the proper permissions to allow mounting * 5) The selected mount point already has a file system mounted to it * */ int mount( 2003580: 40 00 32 fd call 2010174 2003584: ae 10 00 19 mov %i1, %l7 2003588: ac 10 00 08 mov %o0, %l6 200358c: a8 02 20 01 add %o0, 1, %l4 const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; size_t filesystemtype_size = strlen( filesystemtype ) + 1; 2003590: 40 00 32 f9 call 2010174 2003594: 90 10 00 1a mov %i2, %o0 size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003598: a4 10 20 00 clr %l2 200359c: 80 a6 20 00 cmp %i0, 0 20035a0: 02 80 00 05 be 20035b4 20035a4: aa 10 00 08 mov %o0, %l5 20035a8: 40 00 32 f3 call 2010174 20035ac: 90 10 00 18 mov %i0, %o0 20035b0: a4 02 20 01 add %o0, 1, %l2 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size; 20035b4: 92 05 40 14 add %l5, %l4, %o1 rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); 20035b8: 90 10 20 01 mov 1, %o0 size_t filesystemtype_size = strlen( filesystemtype ) + 1; size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size; 20035bc: 92 02 60 75 add %o1, 0x75, %o1 rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); 20035c0: 7f ff fd 4b call 2002aec 20035c4: 92 02 40 12 add %o1, %l2, %o1 if ( mt_entry != NULL ) { 20035c8: ba 92 20 00 orcc %o0, 0, %i5 20035cc: 02 80 00 5c be 200373c <== NEVER TAKEN 20035d0: a6 07 60 74 add %i5, 0x74, %l3 char *str = (char *) mt_entry + sizeof( *mt_entry ); memcpy( str, filesystemtype, filesystemtype_size ); 20035d4: 92 10 00 1a mov %i2, %o1 const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; size_t filesystemtype_size = strlen( filesystemtype ) + 1; 20035d8: aa 05 60 01 inc %l5 rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); if ( mt_entry != NULL ) { char *str = (char *) mt_entry + sizeof( *mt_entry ); memcpy( str, filesystemtype, filesystemtype_size ); 20035dc: 90 10 00 13 mov %l3, %o0 20035e0: 40 00 2f a9 call 200f484 20035e4: 94 10 00 15 mov %l5, %o2 mt_entry->type = str; str += filesystemtype_size; 20035e8: b4 04 c0 15 add %l3, %l5, %i2 memcpy( str, source_or_null, source_size ); 20035ec: 94 10 00 12 mov %l2, %o2 20035f0: 92 10 00 18 mov %i0, %o1 if ( mt_entry != NULL ) { char *str = (char *) mt_entry + sizeof( *mt_entry ); memcpy( str, filesystemtype, filesystemtype_size ); mt_entry->type = str; 20035f4: e6 27 60 6c st %l3, [ %i5 + 0x6c ] str += filesystemtype_size; memcpy( str, source_or_null, source_size ); 20035f8: 40 00 2f a3 call 200f484 20035fc: 90 10 00 1a mov %i2, %o0 mt_entry->dev = str; str += source_size; 2003600: a4 06 80 12 add %i2, %l2, %l2 memcpy( str, target, target_size ); 2003604: 92 10 00 17 mov %l7, %o1 2003608: 94 10 00 14 mov %l4, %o2 memcpy( str, filesystemtype, filesystemtype_size ); mt_entry->type = str; str += filesystemtype_size; memcpy( str, source_or_null, source_size ); mt_entry->dev = str; 200360c: f4 27 60 70 st %i2, [ %i5 + 0x70 ] str += source_size; memcpy( str, target, target_size ); 2003610: 40 00 2f 9d call 200f484 2003614: 90 10 00 12 mov %l2, %o0 if ( !mt_entry ) rtems_set_errno_and_return_minus_one( ENOMEM ); mt_entry->mt_fs_root.mt_entry = mt_entry; mt_entry->options = options; mt_entry->pathconf_limits_and_options = rtems_filesystem_default_pathconf; 2003618: 90 07 60 38 add %i5, 0x38, %o0 memcpy( str, source_or_null, source_size ); mt_entry->dev = str; str += source_size; memcpy( str, target, target_size ); mt_entry->target = str; 200361c: e4 27 60 68 st %l2, [ %i5 + 0x68 ] &target_length ); if ( !mt_entry ) rtems_set_errno_and_return_minus_one( ENOMEM ); mt_entry->mt_fs_root.mt_entry = mt_entry; 2003620: fa 27 60 2c st %i5, [ %i5 + 0x2c ] mt_entry->options = options; 2003624: f6 27 60 30 st %i3, [ %i5 + 0x30 ] mt_entry->pathconf_limits_and_options = rtems_filesystem_default_pathconf; 2003628: 94 10 20 30 mov 0x30, %o2 200362c: 13 00 80 69 sethi %hi(0x201a400), %o1 2003630: 40 00 2f 95 call 200f484 2003634: 92 12 60 20 or %o1, 0x20, %o1 ! 201a420 /* * The mount_point should be a directory with read/write/execute * permissions in the existing tree. */ if ( has_target ) { 2003638: 80 a4 20 00 cmp %l0, 0 200363c: 12 80 00 11 bne 2003680 2003640: 03 00 80 6e sethi %hi(0x201b800), %g1 } } else { /* * Do we already have a base file system ? */ if ( !rtems_chain_is_empty( &mount_chain ) ) { 2003644: c4 00 60 6c ld [ %g1 + 0x6c ], %g2 ! 201b86c */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2003648: 82 10 60 6c or %g1, 0x6c, %g1 200364c: 82 00 60 04 add %g1, 4, %g1 2003650: 80 a0 80 01 cmp %g2, %g1 2003654: 02 80 00 26 be 20036ec <== ALWAYS TAKEN 2003658: b6 10 20 00 clr %i3 errno = EINVAL; 200365c: 40 00 2d 2e call 200eb14 <__errno> <== NOT EXECUTED 2003660: 01 00 00 00 nop <== NOT EXECUTED 2003664: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 2003668: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED return 0; cleanup_and_bail: free( mt_entry ); 200366c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2003670: 7f ff fe 2c call 2002f20 <== NOT EXECUTED 2003674: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003678: 81 c7 e0 08 ret 200367c: 81 e8 00 00 restore * The mount_point should be a directory with read/write/execute * permissions in the existing tree. */ if ( has_target ) { if ( rtems_filesystem_evaluate_path( 2003680: 90 10 00 19 mov %i1, %o0 2003684: 92 10 00 16 mov %l6, %o1 2003688: 94 10 20 07 mov 7, %o2 200368c: 96 07 bf ec add %fp, -20, %o3 2003690: 7f ff fd e3 call 2002e1c 2003694: 98 10 20 01 mov 1, %o4 2003698: 80 a2 3f ff cmp %o0, -1 200369c: 02 bf ff f4 be 200366c <== NEVER TAKEN 20036a0: c2 07 bf f8 ld [ %fp + -8 ], %g1 /* * Test to see if it is a directory */ if ( loc.ops->node_type_h( &loc ) != RTEMS_FILESYSTEM_DIRECTORY ) { 20036a4: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 20036a8: 9f c0 40 00 call %g1 20036ac: 90 07 bf ec add %fp, -20, %o0 20036b0: 80 a2 20 01 cmp %o0, 1 20036b4: 02 80 00 4e be 20037ec 20036b8: d2 07 bf ec ld [ %fp + -20 ], %o1 errno = ENOTDIR; 20036bc: 40 00 2d 16 call 200eb14 <__errno> 20036c0: 01 00 00 00 nop 20036c4: 82 10 20 14 mov 0x14, %g1 ! 14 20036c8: c2 22 00 00 st %g1, [ %o0 ] return 0; cleanup_and_bail: free( mt_entry ); 20036cc: 7f ff fe 15 call 2002f20 20036d0: 90 10 00 1d mov %i5, %o0 if ( has_target ) { if ( rtems_filesystem_evaluate_path( target, target_length, RTEMS_LIBIO_PERMS_RWX, &loc, true ) == -1 ) goto cleanup_and_bail; loc_to_free = &loc; 20036d4: b6 07 bf ec add %fp, -20, %i3 free( mt_entry ); if ( loc_to_free ) rtems_filesystem_freenode( loc_to_free ); return -1; 20036d8: b0 10 3f ff mov -1, %i0 cleanup_and_bail: free( mt_entry ); if ( loc_to_free ) rtems_filesystem_freenode( loc_to_free ); 20036dc: 7f ff fe 0a call 2002f04 20036e0: 90 10 00 1b mov %i3, %o0 return -1; } 20036e4: 81 c7 e0 08 ret 20036e8: 81 e8 00 00 restore * mt_point_node.node_access will be left to null to indicate that this * is the root of the entire file system. */ } if ( (*mount_h)( mt_entry, data ) ) { 20036ec: 90 10 00 1d mov %i5, %o0 20036f0: 9f c4 40 00 call %l1 20036f4: 92 10 00 1c mov %i4, %o1 20036f8: 80 a2 20 00 cmp %o0, 0 20036fc: 22 80 00 21 be,a 2003780 2003700: 39 00 80 70 sethi %hi(0x201c000), %i4 /* * Try to undo the mount operation */ loc.ops->unmount_h( mt_entry ); 2003704: c2 07 bf f8 ld [ %fp + -8 ], %g1 2003708: 90 10 00 1d mov %i5, %o0 200370c: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 2003710: 9f c0 40 00 call %g1 2003714: b0 10 3f ff mov -1, %i0 return 0; cleanup_and_bail: free( mt_entry ); 2003718: 7f ff fe 02 call 2002f20 200371c: 90 10 00 1d mov %i5, %o0 if ( loc_to_free ) 2003720: 80 a6 e0 00 cmp %i3, 0 2003724: 02 bf ff d5 be 2003678 <== NEVER TAKEN 2003728: 90 10 00 1b mov %i3, %o0 rtems_filesystem_freenode( loc_to_free ); 200372c: 7f ff fd f6 call 2002f04 2003730: b0 10 3f ff mov -1, %i0 return -1; } 2003734: 81 c7 e0 08 ret 2003738: 81 e8 00 00 restore target, filesystemtype, &target_length ); if ( !mt_entry ) rtems_set_errno_and_return_minus_one( ENOMEM ); 200373c: 40 00 2c f6 call 200eb14 <__errno> <== NOT EXECUTED 2003740: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003744: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2003748: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200374c: 81 c7 e0 08 ret <== NOT EXECUTED 2003750: 81 e8 00 00 restore <== NOT EXECUTED const char *target_or_null, const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; 2003754: 2f 00 80 67 sethi %hi(0x2019c00), %l7 2003758: a8 10 20 02 mov 2, %l4 200375c: ac 10 20 01 mov 1, %l6 2003760: 10 bf ff 8c b 2003590 2003764: ae 15 e2 f0 or %l7, 0x2f0, %l7 /* * Get mount handler */ mount_h = rtems_filesystem_get_mount_handler( filesystemtype ); if ( !mount_h ) rtems_set_errno_and_return_minus_one( EINVAL ); 2003768: 40 00 2c eb call 200eb14 <__errno> 200376c: b0 10 3f ff mov -1, %i0 2003770: 82 10 20 16 mov 0x16, %g1 2003774: c2 22 00 00 st %g1, [ %o0 ] 2003778: 81 c7 e0 08 ret 200377c: 81 e8 00 00 restore rtems_status_code rtems_libio_set_private_env(void); rtems_status_code rtems_libio_share_private_env(rtems_id task_id) ; static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 2003780: d0 07 21 b0 ld [ %i4 + 0x1b0 ], %o0 2003784: 94 10 20 00 clr %o2 2003788: 40 00 0c 72 call 2006950 200378c: 92 10 20 00 clr %o1 2003790: 92 10 00 1d mov %i5, %o1 2003794: 11 00 80 6e sethi %hi(0x201b800), %o0 2003798: 40 00 0f 01 call 200739c <_Chain_Append> 200379c: 90 12 20 6c or %o0, 0x6c, %o0 ! 201b86c } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 20037a0: d0 07 21 b0 ld [ %i4 + 0x1b0 ], %o0 20037a4: 40 00 0c b5 call 2006a78 20037a8: b0 10 20 00 clr %i0 */ rtems_libio_lock(); rtems_chain_append( &mount_chain, &mt_entry->Node ); rtems_libio_unlock(); if ( !has_target ) 20037ac: 80 a4 20 00 cmp %l0, 0 20037b0: 12 bf ff b2 bne 2003678 20037b4: 03 00 80 6e sethi %hi(0x201b800), %g1 rtems_filesystem_root = mt_entry->mt_fs_root; 20037b8: f6 07 60 1c ld [ %i5 + 0x1c ], %i3 20037bc: f8 07 60 20 ld [ %i5 + 0x20 ], %i4 20037c0: c8 07 60 24 ld [ %i5 + 0x24 ], %g4 20037c4: c6 07 60 28 ld [ %i5 + 0x28 ], %g3 20037c8: c4 07 60 2c ld [ %i5 + 0x2c ], %g2 20037cc: c2 00 60 8c ld [ %g1 + 0x8c ], %g1 20037d0: f6 20 60 18 st %i3, [ %g1 + 0x18 ] 20037d4: f8 20 60 1c st %i4, [ %g1 + 0x1c ] 20037d8: c8 20 60 20 st %g4, [ %g1 + 0x20 ] 20037dc: c6 20 60 24 st %g3, [ %g1 + 0x24 ] 20037e0: c4 20 60 28 st %g2, [ %g1 + 0x28 ] 20037e4: 81 c7 e0 08 ret 20037e8: 81 e8 00 00 restore /* * You can only mount one file system onto a single mount point. */ if ( rtems_filesystem_mount_iterate( is_node_fs_root, loc.node_access ) ) { 20037ec: 11 00 80 0d sethi %hi(0x2003400), %o0 20037f0: 7f ff ff 3a call 20034d8 20037f4: 90 12 20 c4 or %o0, 0xc4, %o0 ! 20034c4 20037f8: 80 8a 20 ff btst 0xff, %o0 20037fc: 02 80 00 07 be 2003818 2003800: c4 07 bf f8 ld [ %fp + -8 ], %g2 errno = EBUSY; 2003804: 40 00 2c c4 call 200eb14 <__errno> 2003808: 01 00 00 00 nop 200380c: 82 10 20 10 mov 0x10, %g1 ! 10 goto cleanup_and_bail; 2003810: 10 bf ff af b 20036cc 2003814: c2 22 00 00 st %g1, [ %o0 ] * may have been allocated in loc should not be sent to freenode * until the system is unmounted. It may be needed to correctly * traverse the tree. */ mt_entry->mt_point_node.node_access = loc.node_access; 2003818: c6 07 bf ec ld [ %fp + -20 ], %g3 /* * This link to the parent is only done when we are dealing with system * below the base file system */ if ( loc.ops->mount_h( mt_entry ) ) { 200381c: c2 00 a0 20 ld [ %g2 + 0x20 ], %g1 * may have been allocated in loc should not be sent to freenode * until the system is unmounted. It may be needed to correctly * traverse the tree. */ mt_entry->mt_point_node.node_access = loc.node_access; 2003820: c6 27 60 08 st %g3, [ %i5 + 8 ] mt_entry->mt_point_node.handlers = loc.handlers; mt_entry->mt_point_node.ops = loc.ops; 2003824: c4 27 60 14 st %g2, [ %i5 + 0x14 ] * until the system is unmounted. It may be needed to correctly * traverse the tree. */ mt_entry->mt_point_node.node_access = loc.node_access; mt_entry->mt_point_node.handlers = loc.handlers; 2003828: c6 07 bf f4 ld [ %fp + -12 ], %g3 mt_entry->mt_point_node.ops = loc.ops; mt_entry->mt_point_node.mt_entry = loc.mt_entry; 200382c: c4 07 bf fc ld [ %fp + -4 ], %g2 * until the system is unmounted. It may be needed to correctly * traverse the tree. */ mt_entry->mt_point_node.node_access = loc.node_access; mt_entry->mt_point_node.handlers = loc.handlers; 2003830: c6 27 60 10 st %g3, [ %i5 + 0x10 ] mt_entry->mt_point_node.ops = loc.ops; mt_entry->mt_point_node.mt_entry = loc.mt_entry; 2003834: c4 27 60 18 st %g2, [ %i5 + 0x18 ] /* * This link to the parent is only done when we are dealing with system * below the base file system */ if ( loc.ops->mount_h( mt_entry ) ) { 2003838: 90 10 00 1d mov %i5, %o0 200383c: 9f c0 40 00 call %g1 2003840: b6 07 bf ec add %fp, -20, %i3 2003844: 80 a2 20 00 cmp %o0, 0 2003848: 02 bf ff aa be 20036f0 <== ALWAYS TAKEN 200384c: 90 10 00 1d mov %i5, %o0 2003850: 30 bf ff 9f b,a 20036cc <== NOT EXECUTED =============================================================================== 02003670 : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 2003670: 9d e3 bf a0 save %sp, -96, %sp int rv = -1; if (target != NULL) { 2003674: 90 96 60 00 orcc %i1, 0, %o0 2003678: 02 80 00 0b be 20036a4 200367c: 01 00 00 00 nop rv = rtems_mkdir(target, S_IRWXU | S_IRWXG | S_IRWXO); 2003680: 40 00 02 5f call 2003ffc 2003684: 92 10 21 ff mov 0x1ff, %o1 ! 1ff if (rv == 0) { 2003688: 82 92 20 00 orcc %o0, 0, %g1 200368c: 02 80 00 04 be 200369c <== ALWAYS TAKEN 2003690: 01 00 00 00 nop } else { errno = EINVAL; } return rv; } 2003694: 81 c7 e0 08 ret 2003698: 91 e8 00 01 restore %g0, %g1, %o0 int rv = -1; if (target != NULL) { rv = rtems_mkdir(target, S_IRWXU | S_IRWXG | S_IRWXO); if (rv == 0) { rv = mount( 200369c: 40 00 00 2a call 2003744 20036a0: 81 e8 00 00 restore options, data ); } } else { errno = EINVAL; 20036a4: 40 00 2c bd call 200e998 <__errno> 20036a8: 01 00 00 00 nop 20036ac: 84 10 20 16 mov 0x16, %g2 ! 16 const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { int rv = -1; 20036b0: 82 10 3f ff mov -1, %g1 options, data ); } } else { errno = EINVAL; 20036b4: 10 bf ff f8 b 2003694 20036b8: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02018278 : msdos_node_type_t type, const char *name, int name_len, mode_t mode, const fat_file_fd_t *link_fd) { 2018278: 9d e3 bf 00 save %sp, -256, %sp int rc = RC_OK; ssize_t ret = 0; msdos_fs_info_t *fs_info = parent_loc->mt_entry->fs_info; 201827c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 fat_file_fd_t *parent_fat_fd = parent_loc->node_access; fat_file_fd_t *fat_fd = NULL; 2018280: c0 27 bf f8 clr [ %fp + -8 ] mode_t mode, const fat_file_fd_t *link_fd) { int rc = RC_OK; ssize_t ret = 0; msdos_fs_info_t *fs_info = parent_loc->mt_entry->fs_info; 2018284: e0 00 60 34 ld [ %g1 + 0x34 ], %l0 fat_file_fd_t *parent_fat_fd = parent_loc->node_access; fat_file_fd_t *fat_fd = NULL; time_t time_ret = 0; uint16_t time_val = 0; 2018288: c0 37 bf fc clrh [ %fp + -4 ] fat_dir_pos_t *dir_pos ) { dir_pos->sname.cln = 0; dir_pos->sname.ofs = 0; dir_pos->lname.cln = FAT_FILE_SHORT_NAME; 201828c: 82 10 3f ff mov -1, %g1 uint16_t date = 0; 2018290: c0 37 bf fe clrh [ %fp + -2 ] 2018294: c2 27 bf f0 st %g1, [ %fp + -16 ] dir_pos->lname.ofs = FAT_FILE_SHORT_NAME; 2018298: c2 27 bf f4 st %g1, [ %fp + -12 ] static inline void fat_dir_pos_init( fat_dir_pos_t *dir_pos ) { dir_pos->sname.cln = 0; 201829c: c0 27 bf e8 clr [ %fp + -24 ] dir_pos->sname.ofs = 0; 20182a0: c0 27 bf ec clr [ %fp + -20 ] uint32_t sec = 0; uint32_t byte = 0; fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); 20182a4: c0 27 bf a8 clr [ %fp + -88 ] 20182a8: c0 27 bf ac clr [ %fp + -84 ] 20182ac: c0 27 bf b0 clr [ %fp + -80 ] 20182b0: c0 27 bf b4 clr [ %fp + -76 ] 20182b4: c0 27 bf b8 clr [ %fp + -72 ] 20182b8: c0 27 bf bc clr [ %fp + -68 ] 20182bc: c0 27 bf c0 clr [ %fp + -64 ] 20182c0: c0 27 bf c4 clr [ %fp + -60 ] memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); 20182c4: c0 27 bf 68 clr [ %fp + -152 ] 20182c8: c0 27 bf 6c clr [ %fp + -148 ] 20182cc: c0 27 bf 70 clr [ %fp + -144 ] 20182d0: c0 27 bf 74 clr [ %fp + -140 ] 20182d4: c0 27 bf 78 clr [ %fp + -136 ] 20182d8: c0 27 bf 7c clr [ %fp + -132 ] 20182dc: c0 27 bf 80 clr [ %fp + -128 ] 20182e0: c0 27 bf 84 clr [ %fp + -124 ] 20182e4: c0 27 bf 88 clr [ %fp + -120 ] 20182e8: c0 27 bf 8c clr [ %fp + -116 ] 20182ec: c0 27 bf 90 clr [ %fp + -112 ] 20182f0: c0 27 bf 94 clr [ %fp + -108 ] 20182f4: c0 27 bf 98 clr [ %fp + -104 ] 20182f8: c0 27 bf 9c clr [ %fp + -100 ] 20182fc: c0 27 bf a0 clr [ %fp + -96 ] name_type = msdos_long_to_short (name, name_len, 2018300: 94 07 bf a8 add %fp, -88, %o2 2018304: 96 10 20 0b mov 0xb, %o3 const fat_file_fd_t *link_fd) { int rc = RC_OK; ssize_t ret = 0; msdos_fs_info_t *fs_info = parent_loc->mt_entry->fs_info; fat_file_fd_t *parent_fat_fd = parent_loc->node_access; 2018308: e2 06 00 00 ld [ %i0 ], %l1 fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); name_type = msdos_long_to_short (name, name_len, 201830c: 92 10 00 1b mov %i3, %o1 uint32_t byte = 0; fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); 2018310: c0 27 bf a4 clr [ %fp + -92 ] name_type = msdos_long_to_short (name, name_len, 2018314: 40 00 04 2b call 20193c0 2018318: 90 10 00 1a mov %i2, %o0 msdos_node_type_t type, const char *name, int name_len, mode_t mode, const fat_file_fd_t *link_fd) { 201831c: b8 10 00 18 mov %i0, %i4 fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); name_type = msdos_long_to_short (name, name_len, 2018320: a4 10 00 08 mov %o0, %l2 MSDOS_DIR_NAME(short_node), MSDOS_NAME_MAX); /* fill reserved field */ *MSDOS_DIR_NT_RES(short_node) = MSDOS_RES_NT_VALUE; 2018324: c0 2f bf b4 clrb [ %fp + -76 ] /* set up last write date and time */ time_ret = time(NULL); 2018328: 90 10 20 00 clr %o0 201832c: 40 00 23 c9 call 2021250