=============================================================================== 02005884 : */ static void IMFS_dump_directory( IMFS_jnode_t *the_directory, int level ) { 2005884: 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; 2005888: f4 06 20 50 ld [ %i0 + 0x50 ], %i2 200588c: 39 00 80 8e sethi %hi(0x2023800), %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( const Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Immutable_tail( the_chain )); 2005890: b0 06 20 54 add %i0, 0x54, %i0 IMFS_assert( level >= 0 ); IMFS_assert( IMFS_is_directory( the_directory ) ); the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); 2005894: 80 a6 80 18 cmp %i2, %i0 2005898: 02 80 00 30 be 2005958 200589c: b8 17 22 28 or %i4, 0x228, %i4 20058a0: 37 00 80 86 sethi %hi(0x2021800), %i3 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); 20058a4: 29 00 80 86 sethi %hi(0x2021800), %l4 return; } puts(""); 20058a8: 21 00 80 86 sethi %hi(0x2021800), %l0 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 20058ac: 27 00 80 86 sethi %hi(0x2021800), %l3 case IMFS_HARD_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); 20058b0: 25 00 80 86 sethi %hi(0x2021800), %l2 the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); 20058b4: b6 16 e3 00 or %i3, 0x300, %i3 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); 20058b8: a8 15 23 70 or %l4, 0x370, %l4 return; } puts(""); 20058bc: a0 14 22 98 or %l0, 0x298, %l0 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 20058c0: a6 14 e3 58 or %l3, 0x358, %l3 case IMFS_HARD_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); 20058c4: a4 14 a3 40 or %l2, 0x340, %l2 for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); IMFS_print_jnode( the_jnode ); if ( IMFS_is_directory( the_jnode ) ) IMFS_dump_directory( the_jnode, level + 1 ); 20058c8: 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++ ) 20058cc: 80 a6 60 00 cmp %i1, 0 20058d0: 06 80 00 0c bl 2005900 <== NEVER TAKEN 20058d4: ba 10 20 00 clr %i5 fprintf(stdout, "...." ); 20058d8: c2 07 00 00 ld [ %i4 ], %g1 20058dc: 90 10 00 1b mov %i3, %o0 20058e0: d6 00 60 08 ld [ %g1 + 8 ], %o3 20058e4: 92 10 20 01 mov 1, %o1 20058e8: 40 00 3b e1 call 201486c 20058ec: 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++ ) 20058f0: ba 07 60 01 inc %i5 20058f4: 80 a6 40 1d cmp %i1, %i5 20058f8: 36 bf ff f9 bge,a 20058dc 20058fc: c2 07 00 00 ld [ %i4 ], %g1 IMFS_jnode_t *the_jnode ) { IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); 2005900: c2 07 00 00 ld [ %i4 ], %g1 2005904: 90 06 a0 0c add %i2, 0xc, %o0 2005908: 40 00 38 bb call 2013bf4 200590c: d2 00 60 08 ld [ %g1 + 8 ], %o1 rtems_chain_extract_unprotected( &node->Node ); } static inline IMFS_jnode_types_t IMFS_type( const IMFS_jnode_t *node ) { return node->control->imfs_type; 2005910: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 2005914: d4 00 40 00 ld [ %g1 ], %o2 switch( IMFS_type( the_jnode ) ) { 2005918: 80 a2 a0 06 cmp %o2, 6 200591c: 28 80 00 11 bleu,a 2005960 <== ALWAYS TAKEN 2005920: 95 2a a0 02 sll %o2, 2, %o2 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); 2005924: c2 07 00 00 ld [ %i4 ], %g1 <== NOT EXECUTED 2005928: 92 10 00 14 mov %l4, %o1 <== NOT EXECUTED 200592c: 40 00 38 62 call 2013ab4 <== NOT EXECUTED 2005930: d0 00 60 08 ld [ %g1 + 8 ], %o0 <== NOT EXECUTED } static inline bool IMFS_is_directory( const IMFS_jnode_t *node ) { return node->control->imfs_type == IMFS_DIRECTORY; 2005934: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 <== NOT EXECUTED the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); IMFS_print_jnode( the_jnode ); if ( IMFS_is_directory( the_jnode ) ) 2005938: c2 00 40 00 ld [ %g1 ], %g1 200593c: 80 a0 60 00 cmp %g1, 0 2005940: 22 80 00 19 be,a 20059a4 2005944: 90 10 00 1a mov %i2, %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 ) { 2005948: f4 06 80 00 ld [ %i2 ], %i2 IMFS_assert( level >= 0 ); IMFS_assert( IMFS_is_directory( the_directory ) ); the_chain = &the_directory->info.directory.Entries; for ( the_node = rtems_chain_first( the_chain ); 200594c: 80 a6 80 18 cmp %i2, %i0 2005950: 12 bf ff e0 bne 20058d0 2005954: 80 a6 60 00 cmp %i1, 0 2005958: 81 c7 e0 08 ret 200595c: 81 e8 00 00 restore ) { IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( IMFS_type( the_jnode ) ) { 2005960: 03 00 80 16 sethi %hi(0x2005800), %g1 2005964: 82 10 60 68 or %g1, 0x68, %g1 ! 2005868 2005968: c2 00 40 0a ld [ %g1 + %o2 ], %g1 200596c: 81 c0 40 00 jmp %g1 2005970: 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" ); 2005974: c2 07 00 00 ld [ %i4 ], %g1 2005978: 90 10 00 12 mov %l2, %o0 200597c: d6 00 60 08 ld [ %g1 + 8 ], %o3 2005980: 92 10 20 01 mov 1, %o1 2005984: 40 00 3b ba call 201486c 2005988: 94 10 20 13 mov 0x13, %o2 200598c: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); IMFS_print_jnode( the_jnode ); if ( IMFS_is_directory( the_jnode ) ) 2005990: c2 00 40 00 ld [ %g1 ], %g1 2005994: 80 a0 60 00 cmp %g1, 0 2005998: 32 bf ff ed bne,a 200594c <== ALWAYS TAKEN 200599c: f4 06 80 00 ld [ %i2 ], %i2 IMFS_dump_directory( the_jnode, level + 1 ); 20059a0: 90 10 00 1a mov %i2, %o0 <== NOT EXECUTED 20059a4: 7f ff ff b8 call 2005884 20059a8: 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 ) { 20059ac: 10 bf ff e8 b 200594c 20059b0: f4 06 80 00 ld [ %i2 ], %i2 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)", 20059b4: c2 07 00 00 ld [ %i4 ], %g1 20059b8: d4 06 a0 54 ld [ %i2 + 0x54 ], %o2 20059bc: d0 00 60 08 ld [ %g1 + 8 ], %o0 20059c0: d6 06 a0 58 ld [ %i2 + 0x58 ], %o3 20059c4: 13 00 80 86 sethi %hi(0x2021800), %o1 20059c8: 40 00 38 3b call 2013ab4 20059cc: 92 12 63 20 or %o1, 0x320, %o1 ! 2021b20 default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); return; } puts(""); 20059d0: 40 00 3f a8 call 2015870 20059d4: 90 10 00 10 mov %l0, %o0 20059d8: 10 bf ff d8 b 2005938 20059dc: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 case IMFS_DIRECTORY: fprintf(stdout, "/" ); break; case IMFS_DEVICE: fprintf(stdout, " (device %" PRId32 ", %" PRId32 ")", 20059e0: c2 07 00 00 ld [ %i4 ], %g1 20059e4: d4 06 a0 50 ld [ %i2 + 0x50 ], %o2 20059e8: d0 00 60 08 ld [ %g1 + 8 ], %o0 20059ec: d6 06 a0 54 ld [ %i2 + 0x54 ], %o3 20059f0: 13 00 80 86 sethi %hi(0x2021800), %o1 20059f4: 40 00 38 30 call 2013ab4 20059f8: 92 12 63 08 or %o1, 0x308, %o1 ! 2021b08 20059fc: 30 bf ff f5 b,a 20059d0 IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( IMFS_type( the_jnode ) ) { case IMFS_DIRECTORY: fprintf(stdout, "/" ); 2005a00: c2 07 00 00 ld [ %i4 ], %g1 2005a04: 90 10 20 2f mov 0x2f, %o0 2005a08: 40 00 38 47 call 2013b24 2005a0c: d2 00 60 08 ld [ %g1 + 8 ], %o1 2005a10: 30 bf ff f0 b,a 20059d0 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 2005a14: c2 07 00 00 ld [ %i4 ], %g1 2005a18: 90 10 00 13 mov %l3, %o0 2005a1c: d6 00 60 08 ld [ %g1 + 8 ], %o3 2005a20: 92 10 20 01 mov 1, %o1 2005a24: 40 00 3b 92 call 201486c 2005a28: 94 10 20 12 mov 0x12, %o2 2005a2c: 10 bf ff c3 b 2005938 2005a30: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 the_jnode->info.file.indirect, the_jnode->info.file.doubly_indirect, the_jnode->info.file.triply_indirect ); #else fprintf(stdout, " (file %" PRId32 ")", 2005a34: c2 07 00 00 ld [ %i4 ], %g1 2005a38: d4 06 a0 54 ld [ %i2 + 0x54 ], %o2 2005a3c: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005a40: 13 00 80 86 sethi %hi(0x2021800), %o1 2005a44: 40 00 38 1c call 2013ab4 2005a48: 92 12 63 30 or %o1, 0x330, %o1 ! 2021b30 2005a4c: 30 bf ff e1 b,a 20059d0 =============================================================================== 0200bf28 : rtems_filesystem_eval_path_context_t *ctx, void *arg, const char *token, size_t tokenlen ) { 200bf28: 9d e3 bf a0 save %sp, -96, %sp rtems_filesystem_eval_path_generic_status status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_DONE; rtems_filesystem_location_info_t *currentloc = rtems_filesystem_eval_path_get_currentloc( ctx ); IMFS_jnode_t *dir = currentloc->node_access; 200bf2c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 bool access_ok = rtems_filesystem_eval_path_check_access( 200bf30: 90 10 00 18 mov %i0, %o0 200bf34: d4 07 20 30 ld [ %i4 + 0x30 ], %o2 200bf38: d6 17 20 3c lduh [ %i4 + 0x3c ], %o3 200bf3c: d8 17 20 3e lduh [ %i4 + 0x3e ], %o4 200bf40: 40 00 03 0d call 200cb74 200bf44: 92 10 20 01 mov 1, %o1 dir->st_mode, dir->st_uid, dir->st_gid ); if ( access_ok ) { 200bf48: 80 8a 20 ff btst 0xff, %o0 200bf4c: 12 80 00 04 bne 200bf5c 200bf50: 80 a6 e0 01 cmp %i3, 1 if ( type == IMFS_HARD_LINK && (follow_hard_link || !terminal)) { entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { 200bf54: 81 c7 e0 08 ret 200bf58: 91 e8 20 01 restore %g0, 1, %o0 static inline bool rtems_filesystem_is_current_directory( const char *token, size_t tokenlen ) { return tokenlen == 1 && token [0] == '.'; 200bf5c: 02 80 00 58 be 200c0bc 200bf60: 80 a6 e0 02 cmp %i3, 2 static inline bool rtems_filesystem_is_parent_directory( const char *token, size_t tokenlen ) { return tokenlen == 2 && token [0] == '.' && token [1] == '.'; 200bf64: 22 80 00 37 be,a 200c040 200bf68: c2 4e 80 00 ldsb [ %i2 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200bf6c: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 if ( rtems_filesystem_is_parent_directory( token, tokenlen ) ) { return dir->Parent; } else { rtems_chain_control *entries = &dir->info.directory.Entries; rtems_chain_node *current = rtems_chain_first( entries ); rtems_chain_node *tail = rtems_chain_tail( entries ); 200bf70: b2 07 20 54 add %i4, 0x54, %i1 while ( current != tail ) { 200bf74: 80 a7 40 19 cmp %i5, %i1 200bf78: 02 80 00 30 be 200c038 200bf7c: 90 07 60 0c add %i5, 0xc, %o0 IMFS_jnode_t *entry = (IMFS_jnode_t *) current; bool match = strncmp( entry->name, token, tokenlen ) == 0 200bf80: 92 10 00 1a mov %i2, %o1 200bf84: 40 00 13 00 call 2010b84 200bf88: 94 10 00 1b mov %i3, %o2 && entry->name [tokenlen] == '\0'; 200bf8c: 80 a2 20 00 cmp %o0, 0 200bf90: 12 80 00 26 bne 200c028 200bf94: 82 07 40 1b add %i5, %i3, %g1 200bf98: c2 48 60 0c ldsb [ %g1 + 0xc ], %g1 200bf9c: 80 a0 60 00 cmp %g1, 0 200bfa0: 32 80 00 23 bne,a 200c02c 200bfa4: fa 07 40 00 ld [ %i5 ], %i5 rtems_chain_extract_unprotected( &node->Node ); } static inline IMFS_jnode_types_t IMFS_type( const IMFS_jnode_t *node ) { return node->control->imfs_type; 200bfa8: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 if ( access_ok ) { IMFS_jnode_t *entry = IMFS_search_in_directory( dir, token, tokenlen ); if ( entry != NULL ) { bool terminal = !rtems_filesystem_eval_path_has_path( ctx ); 200bfac: c4 06 20 04 ld [ %i0 + 4 ], %g2 200bfb0: c2 00 40 00 ld [ %g1 ], %g1 200bfb4: 80 a0 00 02 cmp %g0, %g2 static inline void rtems_filesystem_eval_path_clear_token( rtems_filesystem_eval_path_context_t *ctx ) { ctx->tokenlen = 0; 200bfb8: c0 26 20 0c clr [ %i0 + 0xc ] 200bfbc: 84 60 3f ff subx %g0, -1, %g2 static inline int rtems_filesystem_eval_path_get_flags( const rtems_filesystem_eval_path_context_t *ctx ) { return ctx->flags; 200bfc0: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 bool follow_sym_link = (eval_flags & RTEMS_FS_FOLLOW_SYM_LINK) != 0; IMFS_jnode_types_t type = IMFS_type( entry ); rtems_filesystem_eval_path_clear_token( ctx ); if ( type == IMFS_HARD_LINK && (follow_hard_link || !terminal)) { 200bfc4: 80 a0 60 02 cmp %g1, 2 200bfc8: 02 80 00 43 be 200c0d4 200bfcc: 86 10 00 02 mov %g2, %g3 entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { 200bfd0: 80 a0 60 03 cmp %g1, 3 200bfd4: 02 80 00 28 be 200c074 200bfd8: 80 a0 60 00 cmp %g1, 0 IMFS_jnode_types_t type ) { rtems_filesystem_global_location_t **fs_root_ptr = NULL; if ( type == IMFS_DIRECTORY ) { 200bfdc: 32 80 00 2c bne,a 200c08c 200bfe0: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 if ( node->info.directory.mt_fs != NULL ) { 200bfe4: f6 07 60 5c ld [ %i5 + 0x5c ], %i3 200bfe8: 80 a6 e0 00 cmp %i3, 0 200bfec: 02 80 00 27 be 200c088 200bff0: 90 10 00 18 mov %i0, %o0 if ( !terminal ) { status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_CONTINUE; } } else { access_ok = rtems_filesystem_eval_path_check_access( 200bff4: d4 07 60 30 ld [ %i5 + 0x30 ], %o2 200bff8: d6 17 60 3c lduh [ %i5 + 0x3c ], %o3 200bffc: d8 17 60 3e lduh [ %i5 + 0x3e ], %o4 200c000: 40 00 02 dd call 200cb74 200c004: 92 10 20 01 mov 1, %o1 RTEMS_FS_PERMS_EXEC, entry->st_mode, entry->st_uid, entry->st_gid ); if ( access_ok ) { 200c008: 80 8a 20 ff btst 0xff, %o0 200c00c: 02 bf ff d2 be 200bf54 <== NEVER TAKEN 200c010: 90 10 00 18 mov %i0, %o0 rtems_filesystem_eval_path_restart( ctx, fs_root_ptr ); 200c014: 92 06 e0 24 add %i3, 0x24, %o1 200c018: 7f ff e2 d1 call 2004b5c 200c01c: b0 10 20 01 mov 1, %i0 200c020: 81 c7 e0 08 ret 200c024: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 200c028: fa 07 40 00 ld [ %i5 ], %i5 } else { rtems_chain_control *entries = &dir->info.directory.Entries; rtems_chain_node *current = rtems_chain_first( entries ); rtems_chain_node *tail = rtems_chain_tail( entries ); while ( current != tail ) { 200c02c: 80 a6 40 1d cmp %i1, %i5 200c030: 12 bf ff d4 bne 200bf80 200c034: 90 07 60 0c add %i5, 0xc, %o0 rtems_filesystem_eval_path_restart( ctx, fs_root_ptr ); } } } } else { status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_NO_ENTRY; 200c038: 81 c7 e0 08 ret 200c03c: 91 e8 20 02 restore %g0, 2, %o0 static inline bool rtems_filesystem_is_parent_directory( const char *token, size_t tokenlen ) { return tokenlen == 2 && token [0] == '.' && token [1] == '.'; 200c040: 80 a0 60 2e cmp %g1, 0x2e 200c044: 32 bf ff cb bne,a 200bf70 200c048: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c04c: c2 4e a0 01 ldsb [ %i2 + 1 ], %g1 200c050: 80 a0 60 2e cmp %g1, 0x2e 200c054: 32 bf ff c7 bne,a 200bf70 <== NEVER TAKEN 200c058: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 <== NOT EXECUTED { if ( rtems_filesystem_is_current_directory( token, tokenlen ) ) { return dir; } else { if ( rtems_filesystem_is_parent_directory( token, tokenlen ) ) { return dir->Parent; 200c05c: fa 07 20 08 ld [ %i4 + 8 ], %i5 ); if ( access_ok ) { IMFS_jnode_t *entry = IMFS_search_in_directory( dir, token, tokenlen ); if ( entry != NULL ) { 200c060: 80 a7 60 00 cmp %i5, 0 200c064: 02 bf ff f5 be 200c038 200c068: 01 00 00 00 nop 200c06c: 10 bf ff d0 b 200bfac 200c070: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 if ( type == IMFS_HARD_LINK && (follow_hard_link || !terminal)) { entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { 200c074: 80 a0 a0 00 cmp %g2, 0 200c078: 02 80 00 20 be 200c0f8 200c07c: 80 89 20 10 btst 0x10, %g4 200c080: 32 80 00 1f bne,a 200c0fc 200c084: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 } else { rtems_filesystem_global_location_t **fs_root_ptr = IMFS_is_mount_point( entry, type ); if ( fs_root_ptr == NULL ) { --dir->reference_count; 200c088: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 static inline void IMFS_Set_handlers( rtems_filesystem_location_info_t *loc ) { IMFS_jnode_t *node = (IMFS_jnode_t *) loc->node_access; loc->handlers = node->control->handlers; 200c08c: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200c090: 84 00 bf ff add %g2, -1, %g2 200c094: c4 37 20 34 sth %g2, [ %i4 + 0x34 ] ++entry->reference_count; 200c098: c4 17 60 34 lduh [ %i5 + 0x34 ], %g2 200c09c: c2 00 60 04 ld [ %g1 + 4 ], %g1 200c0a0: 84 00 a0 01 inc %g2 200c0a4: c4 37 60 34 sth %g2, [ %i5 + 0x34 ] currentloc->node_access = entry; 200c0a8: fa 26 20 20 st %i5, [ %i0 + 0x20 ] 200c0ac: c2 26 20 28 st %g1, [ %i0 + 0x28 ] void *arg, const char *token, size_t tokenlen ) { rtems_filesystem_eval_path_generic_status status = 200c0b0: b0 08 e0 ff and %g3, 0xff, %i0 status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_NO_ENTRY; } } return status; } 200c0b4: 81 c7 e0 08 ret 200c0b8: 81 e8 00 00 restore static inline bool rtems_filesystem_is_current_directory( const char *token, size_t tokenlen ) { return tokenlen == 1 && token [0] == '.'; 200c0bc: c2 4e 80 00 ldsb [ %i2 ], %g1 200c0c0: 80 a0 60 2e cmp %g1, 0x2e 200c0c4: 32 bf ff ab bne,a 200bf70 200c0c8: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c0cc: 10 bf ff b7 b 200bfa8 200c0d0: ba 10 00 1c mov %i4, %i5 bool follow_sym_link = (eval_flags & RTEMS_FS_FOLLOW_SYM_LINK) != 0; IMFS_jnode_types_t type = IMFS_type( entry ); rtems_filesystem_eval_path_clear_token( ctx ); if ( type == IMFS_HARD_LINK && (follow_hard_link || !terminal)) { 200c0d4: 80 a0 a0 00 cmp %g2, 0 200c0d8: 12 80 00 04 bne 200c0e8 200c0dc: 80 89 20 08 btst 8, %g4 entry = entry->info.hard_link.link_node; 200c0e0: 10 bf ff ea b 200c088 200c0e4: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 bool follow_sym_link = (eval_flags & RTEMS_FS_FOLLOW_SYM_LINK) != 0; IMFS_jnode_types_t type = IMFS_type( entry ); rtems_filesystem_eval_path_clear_token( ctx ); if ( type == IMFS_HARD_LINK && (follow_hard_link || !terminal)) { 200c0e8: 22 bf ff e9 be,a 200c08c 200c0ec: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 200c0f0: 10 bf ff e6 b 200c088 200c0f4: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { const char *target = entry->info.sym_link.name; 200c0f8: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 rtems_filesystem_eval_path_recursive( ctx, target, strlen( target ) ); 200c0fc: 40 00 12 70 call 2010abc 200c100: 90 10 00 1d mov %i5, %o0 200c104: 92 10 00 1d mov %i5, %o1 200c108: 94 10 00 08 mov %o0, %o2 200c10c: 7f ff e2 ad call 2004bc0 200c110: 90 10 00 18 mov %i0, %o0 200c114: 30 bf ff 90 b,a 200bf54 =============================================================================== 020037d4 : static ssize_t IMFS_fifo_write( rtems_libio_t *iop, const void *buffer, size_t count ) { 20037d4: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *jnode = iop->pathinfo.node_access; 20037d8: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 int err = pipe_write(JNODE2PIPE(jnode), buffer, count, iop); 20037dc: 96 10 00 18 mov %i0, %o3 20037e0: d0 07 60 50 ld [ %i5 + 0x50 ], %o0 20037e4: 92 10 00 19 mov %i1, %o1 20037e8: 40 00 2d 1a call 200ec50 20037ec: 94 10 00 1a mov %i2, %o2 if (err > 0) { 20037f0: b0 92 20 00 orcc %o0, 0, %i0 20037f4: 04 80 00 09 ble 2003818 20037f8: 90 07 bf f8 add %fp, -8, %o0 IMFS_mtime_ctime_update(jnode); 20037fc: 40 00 04 48 call 200491c 2003800: 92 10 20 00 clr %o1 2003804: c2 07 bf f8 ld [ %fp + -8 ], %g1 2003808: c2 27 60 44 st %g1, [ %i5 + 0x44 ] 200380c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] 2003810: 81 c7 e0 08 ret 2003814: 81 e8 00 00 restore } IMFS_FIFO_RETURN(err); 2003818: 80 a6 20 00 cmp %i0, 0 200381c: 12 80 00 04 bne 200382c <== ALWAYS TAKEN 2003820: 01 00 00 00 nop } 2003824: 81 c7 e0 08 ret <== NOT EXECUTED 2003828: 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); 200382c: 40 00 35 ed call 2010fe0 <__errno> 2003830: 01 00 00 00 nop 2003834: 82 20 00 18 neg %i0, %g1 2003838: c2 22 00 00 st %g1, [ %o0 ] } 200383c: 81 c7 e0 08 ret 2003840: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200c168 : ((IMFS_jnode_t *)( rtems_chain_head( jnode_get_control( jnode ) )->next)) void IMFS_fsunmount( rtems_filesystem_mount_table_entry_t *temp_mt_entry ) { 200c168: 9d e3 bf 88 save %sp, -120, %sp /* * Traverse tree that starts at the mt_fs_root and deallocate memory * associated memory space */ loc = temp_mt_entry->mt_fs_root->location; 200c16c: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c170: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200c174: f2 00 80 00 ld [ %g2 ], %i1 200c178: f4 00 a0 04 ld [ %g2 + 4 ], %i2 200c17c: f6 00 a0 0c ld [ %g2 + 0xc ], %i3 200c180: f8 00 a0 10 ld [ %g2 + 0x10 ], %i4 200c184: c8 00 a0 14 ld [ %g2 + 0x14 ], %g4 200c188: c2 00 e0 4c ld [ %g3 + 0x4c ], %g1 200c18c: f2 27 bf e8 st %i1, [ %fp + -24 ] 200c190: f4 27 bf ec st %i2, [ %fp + -20 ] 200c194: c6 27 bf f0 st %g3, [ %fp + -16 ] 200c198: f6 27 bf f4 st %i3, [ %fp + -12 ] 200c19c: f8 27 bf f8 st %i4, [ %fp + -8 ] 200c1a0: c8 27 bf fc st %g4, [ %fp + -4 ] /* * Set this to null to indicate that it is being unmounted. */ temp_mt_entry->mt_fs_root->location.node_access = NULL; 200c1a4: c0 20 a0 08 clr [ %g2 + 8 ] 200c1a8: c4 00 40 00 ld [ %g1 ], %g2 * Traverse tree that starts at the mt_fs_root and deallocate memory * associated memory space */ loc = temp_mt_entry->mt_fs_root->location; jnode = (IMFS_jnode_t *)loc.node_access; 200c1ac: ba 10 00 03 mov %g3, %i5 200c1b0: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c1b4: f8 07 60 08 ld [ %i5 + 8 ], %i4 loc.node_access = (void *)jnode; 200c1b8: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c1bc: 80 a0 a0 00 cmp %g2, 0 200c1c0: 12 80 00 13 bne 200c20c <== NEVER TAKEN 200c1c4: c2 27 bf f8 st %g1, [ %fp + -8 ] 200c1c8: c2 07 60 50 ld [ %i5 + 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 ); 200c1cc: 84 07 60 54 add %i5, 0x54, %g2 200c1d0: 80 a0 40 02 cmp %g1, %g2 200c1d4: 02 80 00 0f be 200c210 200c1d8: 90 10 20 00 clr %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c1dc: ba 10 00 01 mov %g1, %i5 if ( IMFS_is_directory( jnode ) ) { if ( jnode_has_children( jnode ) ) jnode = jnode_get_first_child( jnode ); } } } while (jnode != NULL); 200c1e0: 80 a7 60 00 cmp %i5, 0 200c1e4: 02 80 00 21 be 200c268 <== NEVER TAKEN 200c1e8: 01 00 00 00 nop 200c1ec: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c1f0: f8 07 60 08 ld [ %i5 + 8 ], %i4 200c1f4: c4 00 40 00 ld [ %g1 ], %g2 200c1f8: c2 00 60 04 ld [ %g1 + 4 ], %g1 loc.node_access = (void *)jnode; 200c1fc: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c200: 80 a0 a0 00 cmp %g2, 0 200c204: 02 bf ff f1 be 200c1c8 200c208: c2 27 bf f8 st %g1, [ %fp + -8 ] result = IMFS_rmnod( NULL, &loc ); 200c20c: 90 10 20 00 clr %o0 200c210: 7f ff db c8 call 2003130 200c214: 92 07 bf e8 add %fp, -24, %o1 if ( result != 0 ) 200c218: 80 a2 20 00 cmp %o0, 0 200c21c: 12 80 00 15 bne 200c270 <== NEVER TAKEN 200c220: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 rtems_fatal_error_occurred( 0xdeadbeef ); IMFS_node_destroy( jnode ); 200c224: 7f ff da e1 call 2002da8 200c228: 90 10 00 1d mov %i5, %o0 jnode = next; } if ( jnode != NULL ) { 200c22c: 80 a7 20 00 cmp %i4, 0 200c230: 02 80 00 0e be 200c268 200c234: 01 00 00 00 nop 200c238: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200c23c: c4 00 40 00 ld [ %g1 ], %g2 if ( IMFS_is_directory( jnode ) ) { 200c240: 80 a0 a0 00 cmp %g2, 0 200c244: 12 bf ff db bne 200c1b0 <== NEVER TAKEN 200c248: ba 10 00 1c mov %i4, %i5 200c24c: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200c250: 86 07 20 54 add %i4, 0x54, %g3 if ( jnode_has_children( jnode ) ) 200c254: 80 a7 40 03 cmp %i5, %g3 200c258: 12 bf ff e3 bne 200c1e4 200c25c: 80 a7 60 00 cmp %i5, 0 200c260: 10 bf ff d4 b 200c1b0 200c264: ba 10 00 1c mov %i4, %i5 200c268: 81 c7 e0 08 ret 200c26c: 81 e8 00 00 restore IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { result = IMFS_rmnod( NULL, &loc ); if ( result != 0 ) rtems_fatal_error_occurred( 0xdeadbeef ); 200c270: 7f ff f0 1f call 20082ec <== NOT EXECUTED 200c274: 90 12 22 ef or %o0, 0x2ef, %o0 <== NOT EXECUTED =============================================================================== 02002c94 : int IMFS_initialize_support( rtems_filesystem_mount_table_entry_t *mt_entry, const rtems_filesystem_operations_table *op_table, const IMFS_node_control *const node_controls [IMFS_TYPE_COUNT] ) { 2002c94: 9d e3 bf a0 save %sp, -96, %sp static int imfs_instance; int rv = 0; IMFS_fs_info_t *fs_info = calloc( 1, sizeof( *fs_info ) ); 2002c98: 90 10 20 01 mov 1, %o0 2002c9c: 40 00 01 c6 call 20033b4 2002ca0: 92 10 20 24 mov 0x24, %o1 if ( fs_info != NULL ) { 2002ca4: ba 92 20 00 orcc %o0, 0, %i5 2002ca8: 02 80 00 34 be 2002d78 2002cac: 03 00 80 72 sethi %hi(0x201c800), %g1 IMFS_jnode_t *root_node; fs_info->instance = imfs_instance++; 2002cb0: c4 00 60 64 ld [ %g1 + 0x64 ], %g2 ! 201c864 memcpy( 2002cb4: 92 10 00 1a mov %i2, %o1 IMFS_fs_info_t *fs_info = calloc( 1, sizeof( *fs_info ) ); if ( fs_info != NULL ) { IMFS_jnode_t *root_node; fs_info->instance = imfs_instance++; 2002cb8: 86 00 a0 01 add %g2, 1, %g3 memcpy( 2002cbc: 94 10 20 1c mov 0x1c, %o2 IMFS_fs_info_t *fs_info = calloc( 1, sizeof( *fs_info ) ); if ( fs_info != NULL ) { IMFS_jnode_t *root_node; fs_info->instance = imfs_instance++; 2002cc0: c4 27 40 00 st %g2, [ %i5 ] 2002cc4: c6 20 60 64 st %g3, [ %g1 + 0x64 ] memcpy( 2002cc8: 40 00 34 69 call 200fe6c 2002ccc: 90 07 60 08 add %i5, 8, %o0 fs_info->node_controls, node_controls, sizeof( fs_info->node_controls ) ); root_node = IMFS_allocate_node( 2002cd0: d2 07 60 08 ld [ %i5 + 8 ], %o1 2002cd4: 90 10 00 1d mov %i5, %o0 2002cd8: 96 10 20 00 clr %o3 2002cdc: 15 00 80 69 sethi %hi(0x201a400), %o2 2002ce0: 9a 10 20 00 clr %o5 2002ce4: 94 12 a2 18 or %o2, 0x218, %o2 2002ce8: 19 00 00 10 sethi %hi(0x4000), %o4 2002cec: 40 00 24 41 call 200bdf0 2002cf0: 98 13 21 ed or %o4, 0x1ed, %o4 ! 41ed "", 0, (S_IFDIR | 0755), NULL ); if ( root_node != NULL ) { 2002cf4: 80 a2 20 00 cmp %o0, 0 2002cf8: 02 80 00 20 be 2002d78 <== NEVER TAKEN 2002cfc: 09 00 80 6b sethi %hi(0x201ac00), %g4 static inline void IMFS_Set_handlers( rtems_filesystem_location_info_t *loc ) { IMFS_jnode_t *node = (IMFS_jnode_t *) loc->node_access; loc->handlers = node->control->handlers; 2002d00: c4 02 20 4c ld [ %o0 + 0x4c ], %g2 mt_entry->fs_info = fs_info; mt_entry->ops = op_table; mt_entry->pathconf_limits_and_options = &IMFS_LIMITS_AND_OPTIONS; mt_entry->mt_fs_root->location.node_access = root_node; 2002d04: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2002d08: c6 00 a0 04 ld [ %g2 + 4 ], %g3 0, (S_IFDIR | 0755), NULL ); if ( root_node != NULL ) { mt_entry->fs_info = fs_info; 2002d0c: fa 26 20 08 st %i5, [ %i0 + 8 ] mt_entry->ops = op_table; 2002d10: f2 26 20 0c st %i1, [ %i0 + 0xc ] errno = ENOMEM; rv = -1; } if ( rv == 0 ) { IMFS_determine_bytes_per_block( 2002d14: 05 00 80 70 sethi %hi(0x201c000), %g2 NULL ); if ( root_node != NULL ) { mt_entry->fs_info = fs_info; mt_entry->ops = op_table; mt_entry->pathconf_limits_and_options = &IMFS_LIMITS_AND_OPTIONS; 2002d18: 88 11 22 fc or %g4, 0x2fc, %g4 errno = ENOMEM; rv = -1; } if ( rv == 0 ) { IMFS_determine_bytes_per_block( 2002d1c: c4 00 a1 20 ld [ %g2 + 0x120 ], %g2 NULL ); if ( root_node != NULL ) { mt_entry->fs_info = fs_info; mt_entry->ops = op_table; mt_entry->pathconf_limits_and_options = &IMFS_LIMITS_AND_OPTIONS; 2002d20: c8 26 20 2c st %g4, [ %i0 + 0x2c ] mt_entry->mt_fs_root->location.node_access = root_node; 2002d24: d0 20 60 08 st %o0, [ %g1 + 8 ] /* * 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) { 2002d28: 80 a0 a0 10 cmp %g2, 0x10 2002d2c: 02 80 00 0f be 2002d68 2002d30: c6 20 60 10 st %g3, [ %g1 + 0x10 ] is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 2002d34: 80 a0 a0 0f cmp %g2, 0xf 2002d38: 04 80 00 0b ble 2002d64 2002d3c: 82 10 20 20 mov 0x20, %g1 2002d40: 86 10 20 05 mov 5, %g3 /* * 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) { 2002d44: 80 a0 80 01 cmp %g2, %g1 2002d48: 22 80 00 09 be,a 2002d6c 2002d4c: 03 00 80 72 sethi %hi(0x201c800), %g1 is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 2002d50: 26 80 00 06 bl,a 2002d68 <== NEVER TAKEN 2002d54: 84 10 20 80 mov 0x80, %g2 <== NOT EXECUTED int bit_mask; /* * check, whether requested bytes per block is valid */ for (bit_mask = 16; !is_valid && (bit_mask <= 512); bit_mask <<= 1) { 2002d58: 86 80 ff ff addcc %g3, -1, %g3 2002d5c: 12 bf ff fa bne 2002d44 <== ALWAYS TAKEN 2002d60: 83 28 60 01 sll %g1, 1, %g1 if(bit_mask > requested_bytes_per_block) break; } *dest_bytes_per_block = ((is_valid) ? requested_bytes_per_block : default_bytes_per_block); 2002d64: 84 10 20 80 mov 0x80, %g2 break; } if(bit_mask > requested_bytes_per_block) break; } *dest_bytes_per_block = ((is_valid) 2002d68: 03 00 80 72 sethi %hi(0x201c800), %g1 2002d6c: c4 20 60 60 st %g2, [ %g1 + 0x60 ] ! 201c860 const IMFS_node_control *const node_controls [IMFS_TYPE_COUNT] ) { static int imfs_instance; int rv = 0; 2002d70: 81 c7 e0 08 ret 2002d74: 91 e8 20 00 restore %g0, 0, %o0 } else { errno = ENOMEM; rv = -1; } } else { errno = ENOMEM; 2002d78: 40 00 31 ec call 200f528 <__errno> 2002d7c: b0 10 3f ff mov -1, %i0 2002d80: 82 10 20 0c mov 0xc, %g1 2002d84: c2 22 00 00 st %g1, [ %o0 ] IMFS_MEMFILE_DEFAULT_BYTES_PER_BLOCK ); } return rv; } 2002d88: 81 c7 e0 08 ret 2002d8c: 81 e8 00 00 restore =============================================================================== 0200490c : const char *path, mode_t mode, const IMFS_node_control *node_control, void *context ) { 200490c: 9d e3 bf 48 save %sp, -184, %sp int rv = 0; mode &= ~rtems_filesystem_umask; 2004910: 03 00 80 83 sethi %hi(0x2020c00), %g1 2004914: c2 00 63 84 ld [ %g1 + 0x384 ], %g1 ! 2020f84 switch (mode & S_IFMT) { 2004918: 05 00 00 08 sethi %hi(0x2000), %g2 void *context ) { int rv = 0; mode &= ~rtems_filesystem_umask; 200491c: c2 00 60 08 ld [ %g1 + 8 ], %g1 2004920: b2 2e 40 01 andn %i1, %g1, %i1 switch (mode & S_IFMT) { 2004924: 03 00 00 3c sethi %hi(0xf000), %g1 2004928: 82 0e 40 01 and %i1, %g1, %g1 200492c: 80 a0 40 02 cmp %g1, %g2 2004930: 22 80 00 0c be,a 2004960 2004934: c2 06 80 00 ld [ %i2 ], %g1 2004938: 08 80 00 1d bleu 20049ac <== NEVER TAKEN 200493c: 05 00 00 04 sethi %hi(0x1000), %g2 2004940: 05 00 00 18 sethi %hi(0x6000), %g2 2004944: 80 a0 40 02 cmp %g1, %g2 2004948: 02 80 00 05 be 200495c 200494c: 05 00 00 20 sethi %hi(0x8000), %g2 2004950: 80 a0 40 02 cmp %g1, %g2 2004954: 12 80 00 19 bne 20049b8 <== ALWAYS TAKEN 2004958: 01 00 00 00 nop rv = -1; break; } if ( rv == 0 ) { if ( node_control->imfs_type == IMFS_GENERIC ) { 200495c: c2 06 80 00 ld [ %i2 ], %g1 2004960: 80 a0 60 07 cmp %g1, 7 2004964: 12 80 00 15 bne 20049b8 2004968: 92 10 00 18 mov %i0, %o1 rtems_filesystem_eval_path_context_t ctx; int eval_flags = RTEMS_FS_FOLLOW_LINK | RTEMS_FS_MAKE | RTEMS_FS_EXCLUSIVE; const rtems_filesystem_location_info_t *currentloc = 200496c: 94 10 20 78 mov 0x78, %o2 2004970: 40 00 08 55 call 2006ac4 2004974: 90 07 bf c8 add %fp, -56, %o0 rtems_filesystem_eval_path_start( &ctx, path, eval_flags ); if ( IMFS_is_imfs_instance( currentloc ) ) { 2004978: 7f ff ff d2 call 20048c0 200497c: ba 10 00 08 mov %o0, %i5 2004980: 80 8a 20 ff btst 0xff, %o0 2004984: 12 80 00 13 bne 20049d0 2004988: d4 1f bf d0 ldd [ %fp + -48 ], %o2 IMFS_update_mtime( parent ); } else { rv = -1; } } else { rtems_filesystem_eval_path_error( &ctx, ENOTSUP ); 200498c: 90 07 bf c8 add %fp, -56, %o0 2004990: 92 10 20 86 mov 0x86, %o1 2004994: 40 00 07 90 call 20067d4 2004998: b0 10 3f ff mov -1, %i0 rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 200499c: 40 00 08 8a call 2006bc4 20049a0: 90 07 bf c8 add %fp, -56, %o0 20049a4: 81 c7 e0 08 ret 20049a8: 81 e8 00 00 restore { int rv = 0; mode &= ~rtems_filesystem_umask; switch (mode & S_IFMT) { 20049ac: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 20049b0: 22 bf ff ec be,a 2004960 <== NOT EXECUTED 20049b4: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); } else { errno = EINVAL; 20049b8: 40 00 3e 35 call 201428c <__errno> 20049bc: b0 10 3f ff mov -1, %i0 20049c0: 82 10 20 16 mov 0x16, %g1 20049c4: c2 22 00 00 st %g1, [ %o0 ] 20049c8: 81 c7 e0 08 ret 20049cc: 81 e8 00 00 restore if ( IMFS_is_imfs_instance( currentloc ) ) { IMFS_types_union info; IMFS_jnode_t *new_node; info.generic.context = context; 20049d0: f6 27 bf b0 st %i3, [ %fp + -80 ] new_node = IMFS_create_node_with_control( 20049d4: 90 10 00 1d mov %i5, %o0 20049d8: 92 10 00 1a mov %i2, %o1 20049dc: 98 10 00 19 mov %i1, %o4 20049e0: 9a 07 bf b0 add %fp, -80, %o5 20049e4: 40 00 30 0d call 2010a18 20049e8: b0 10 3f ff mov -1, %i0 rtems_filesystem_eval_path_get_tokenlen( &ctx ), mode, &info ); if ( new_node != NULL ) { 20049ec: 80 a2 20 00 cmp %o0, 0 20049f0: 02 bf ff eb be 200499c 20049f4: 92 10 20 00 clr %o1 IMFS_jnode_t *parent = currentloc->node_access; 20049f8: fa 07 60 08 ld [ %i5 + 8 ], %i5 IMFS_update_ctime( parent ); 20049fc: 40 00 02 96 call 2005454 2004a00: 90 07 bf a8 add %fp, -88, %o0 2004a04: c2 07 bf a8 ld [ %fp + -88 ], %g1 IMFS_update_mtime( parent ); 2004a08: 90 07 bf a8 add %fp, -88, %o0 ); if ( new_node != NULL ) { IMFS_jnode_t *parent = currentloc->node_access; IMFS_update_ctime( parent ); 2004a0c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] IMFS_update_mtime( parent ); 2004a10: 40 00 02 91 call 2005454 2004a14: 92 10 20 00 clr %o1 2004a18: c2 07 bf a8 ld [ %fp + -88 ], %g1 2004a1c: b0 10 20 00 clr %i0 2004a20: c2 27 60 44 st %g1, [ %i5 + 0x44 ] } else { rtems_filesystem_eval_path_error( &ctx, ENOTSUP ); rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2004a24: 40 00 08 68 call 2006bc4 2004a28: 90 07 bf c8 add %fp, -56, %o0 2004a2c: 81 c7 e0 08 ret 2004a30: 81 e8 00 00 restore =============================================================================== 0200e384 : */ MEMFILE_STATIC int IMFS_memfile_addblock( IMFS_jnode_t *the_jnode, unsigned int block ) { 200e384: 9d e3 bf a0 save %sp, -96, %sp IMFS_assert( IMFS_type( the_jnode ) == IMFS_MEMORY_FILE ); /* * Obtain the pointer for the specified block number */ block_entry_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 1 ); 200e388: 94 10 20 01 mov 1, %o2 200e38c: 90 10 00 18 mov %i0, %o0 200e390: 7f ff fe c9 call 200deb4 200e394: 92 10 00 19 mov %i1, %o1 if ( *block_entry_ptr ) 200e398: c2 02 00 00 ld [ %o0 ], %g1 IMFS_assert( IMFS_type( the_jnode ) == IMFS_MEMORY_FILE ); /* * Obtain the pointer for the specified block number */ block_entry_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 1 ); 200e39c: ba 10 00 08 mov %o0, %i5 if ( *block_entry_ptr ) 200e3a0: 80 a0 60 00 cmp %g1, 0 200e3a4: 12 80 00 08 bne 200e3c4 200e3a8: b0 10 20 00 clr %i0 return 0; /* * There is no memory for this block number so allocate it. */ memory = memfile_alloc_block(); 200e3ac: 7f ff fe b5 call 200de80 200e3b0: 01 00 00 00 nop if ( !memory ) 200e3b4: 80 a2 20 00 cmp %o0, 0 200e3b8: 02 80 00 05 be 200e3cc <== NEVER TAKEN 200e3bc: 01 00 00 00 nop return 1; *block_entry_ptr = memory; 200e3c0: d0 27 40 00 st %o0, [ %i5 ] return 0; 200e3c4: 81 c7 e0 08 ret 200e3c8: 81 e8 00 00 restore } 200e3cc: 81 c7 e0 08 ret <== NOT EXECUTED 200e3d0: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 0200e5f8 : MEMFILE_STATIC int IMFS_memfile_extend( IMFS_jnode_t *the_jnode, bool zero_fill, off_t new_length ) { 200e5f8: 9d e3 bf 98 save %sp, -104, %sp IMFS_assert( IMFS_type( the_jnode ) == IMFS_MEMORY_FILE ); /* * Verify new file size is supported */ if ( new_length >= IMFS_MEMFILE_MAXIMUM_SIZE ) 200e5fc: 25 00 80 72 sethi %hi(0x201c800), %l2 200e600: fa 04 a0 60 ld [ %l2 + 0x60 ], %i5 ! 201c860 200e604: b9 37 60 02 srl %i5, 2, %i4 200e608: 92 10 00 1c mov %i4, %o1 200e60c: 40 00 27 0a call 2018234 <.umul> 200e610: 90 07 20 01 add %i4, 1, %o0 200e614: 92 10 00 1c mov %i4, %o1 200e618: 40 00 27 07 call 2018234 <.umul> 200e61c: 90 02 20 01 inc %o0 200e620: 92 10 00 1d mov %i5, %o1 200e624: 40 00 27 04 call 2018234 <.umul> 200e628: 90 02 3f ff add %o0, -1, %o0 200e62c: 82 10 20 00 clr %g1 200e630: 80 a0 40 1a cmp %g1, %i2 200e634: 04 80 00 58 ble 200e794 <== ALWAYS TAKEN 200e638: b8 10 00 18 mov %i0, %i4 rtems_set_errno_and_return_minus_one( EFBIG ); /* * Verify new file size is actually larger than current size */ if ( new_length <= the_jnode->info.file.size ) 200e63c: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 <== NOT EXECUTED 200e640: 80 a6 80 11 cmp %i2, %l1 200e644: 04 80 00 3f ble 200e740 <== ALWAYS TAKEN 200e648: 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; 200e64c: a7 3f 60 1f sra %i5, 0x1f, %l3 <== NOT EXECUTED 200e650: 96 10 00 1d mov %i5, %o3 200e654: 94 10 00 13 mov %l3, %o2 200e658: 90 10 00 1a mov %i2, %o0 200e65c: 40 00 28 88 call 201887c <__divdi3> 200e660: 92 10 00 1b mov %i3, %o1 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e664: 96 10 00 1d mov %i5, %o3 return 0; /* * Calculate the number of range of blocks to allocate */ new_blocks = new_length / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e668: b0 10 00 09 mov %o1, %i0 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e66c: 90 10 00 11 mov %l1, %o0 200e670: 92 10 00 10 mov %l0, %o1 200e674: 40 00 28 82 call 201887c <__divdi3> 200e678: 94 10 00 13 mov %l3, %o2 200e67c: a2 10 00 09 mov %o1, %l1 offset = the_jnode->info.file.size - old_blocks * IMFS_MEMFILE_BYTES_PER_BLOCK; 200e680: 90 10 00 09 mov %o1, %o0 200e684: 40 00 26 ec call 2018234 <.umul> 200e688: 92 10 00 1d mov %i5, %o1 /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200e68c: ba 10 00 11 mov %l1, %i5 200e690: 80 a6 00 11 cmp %i0, %l1 200e694: 1a 80 00 07 bcc 200e6b0 <== ALWAYS TAKEN 200e698: a0 24 00 08 sub %l0, %o0, %l0 /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); 200e69c: 10 80 00 1d b 200e710 <== NOT EXECUTED 200e6a0: 92 10 20 00 clr %o1 <== NOT EXECUTED offset = the_jnode->info.file.size - old_blocks * IMFS_MEMFILE_BYTES_PER_BLOCK; /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200e6a4: 80 a6 00 1d cmp %i0, %i5 200e6a8: 0a 80 00 1a bcs 200e710 200e6ac: 92 10 20 00 clr %o1 if ( !IMFS_memfile_addblock( the_jnode, block ) ) { 200e6b0: 92 10 00 1d mov %i5, %o1 200e6b4: 7f ff ff 34 call 200e384 200e6b8: 90 10 00 1c mov %i4, %o0 200e6bc: 80 a2 20 00 cmp %o0, 0 200e6c0: 12 80 00 26 bne 200e758 <== NEVER TAKEN 200e6c4: 80 a6 60 00 cmp %i1, 0 if ( zero_fill ) { 200e6c8: 22 bf ff f7 be,a 200e6a4 200e6cc: ba 07 60 01 inc %i5 size_t count = IMFS_MEMFILE_BYTES_PER_BLOCK - offset; block_p *block_ptr = 200e6d0: 92 10 00 1d mov %i5, %o1 * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { if ( !IMFS_memfile_addblock( the_jnode, block ) ) { if ( zero_fill ) { size_t count = IMFS_MEMFILE_BYTES_PER_BLOCK - offset; 200e6d4: e6 04 a0 60 ld [ %l2 + 0x60 ], %l3 block_p *block_ptr = 200e6d8: 94 10 20 00 clr %o2 200e6dc: 7f ff fd f6 call 200deb4 200e6e0: 90 10 00 1c mov %i4, %o0 IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); memset( &(*block_ptr) [offset], 0, count); 200e6e4: d0 02 00 00 ld [ %o0 ], %o0 * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { if ( !IMFS_memfile_addblock( the_jnode, block ) ) { if ( zero_fill ) { size_t count = IMFS_MEMFILE_BYTES_PER_BLOCK - offset; 200e6e8: a6 24 c0 10 sub %l3, %l0, %l3 block_p *block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); memset( &(*block_ptr) [offset], 0, count); 200e6ec: 90 02 00 10 add %o0, %l0, %o0 200e6f0: 92 10 20 00 clr %o1 200e6f4: 40 00 06 1b call 200ff60 200e6f8: 94 10 00 13 mov %l3, %o2 offset = the_jnode->info.file.size - old_blocks * IMFS_MEMFILE_BYTES_PER_BLOCK; /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200e6fc: ba 07 60 01 inc %i5 200e700: 80 a6 00 1d cmp %i0, %i5 200e704: 1a bf ff eb bcc 200e6b0 200e708: a0 10 20 00 clr %l0 /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); 200e70c: 92 10 20 00 clr %o1 } /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; 200e710: f4 3f 20 50 std %i2, [ %i4 + 0x50 ] IMFS_update_ctime(the_jnode); 200e714: 7f ff d4 01 call 2003718 200e718: 90 07 bf f8 add %fp, -8, %o0 200e71c: c2 07 bf f8 ld [ %fp + -8 ], %g1 IMFS_update_mtime(the_jnode); 200e720: 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); 200e724: c2 27 20 48 st %g1, [ %i4 + 0x48 ] IMFS_update_mtime(the_jnode); 200e728: 7f ff d3 fc call 2003718 200e72c: 92 10 20 00 clr %o1 200e730: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e734: c2 27 20 44 st %g1, [ %i4 + 0x44 ] return 0; 200e738: 81 c7 e0 08 ret 200e73c: 91 e8 20 00 restore %g0, 0, %o0 rtems_set_errno_and_return_minus_one( EFBIG ); /* * Verify new file size is actually larger than current size */ if ( new_length <= the_jnode->info.file.size ) 200e740: 12 80 00 04 bne 200e750 <== NEVER TAKEN 200e744: 80 a6 c0 10 cmp %i3, %l0 200e748: 18 bf ff c2 bgu 200e650 <== ALWAYS TAKEN 200e74c: a7 3f 60 1f sra %i5, 0x1f, %l3 the_jnode->info.file.size = new_length; IMFS_update_ctime(the_jnode); IMFS_update_mtime(the_jnode); return 0; } 200e750: 81 c7 e0 08 ret <== NOT EXECUTED 200e754: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200e758: 80 a7 40 11 cmp %i5, %l1 <== NOT EXECUTED 200e75c: 0a 80 00 08 bcs 200e77c <== NOT EXECUTED 200e760: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); 200e764: 7f ff ff 99 call 200e5c8 <== NOT EXECUTED 200e768: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200e76c: ba 07 7f ff add %i5, -1, %i5 <== NOT EXECUTED 200e770: 80 a4 40 1d cmp %l1, %i5 <== NOT EXECUTED 200e774: 08 bf ff fc bleu 200e764 <== NOT EXECUTED 200e778: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); } rtems_set_errno_and_return_minus_one( ENOSPC ); 200e77c: 40 00 03 6b call 200f528 <__errno> <== NOT EXECUTED 200e780: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200e784: 82 10 20 1c mov 0x1c, %g1 <== NOT EXECUTED 200e788: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200e78c: 81 c7 e0 08 ret <== NOT EXECUTED 200e790: 81 e8 00 00 restore <== NOT EXECUTED IMFS_assert( IMFS_type( the_jnode ) == IMFS_MEMORY_FILE ); /* * Verify new file size is supported */ if ( new_length >= IMFS_MEMFILE_MAXIMUM_SIZE ) 200e794: 12 80 00 04 bne 200e7a4 <== NEVER TAKEN 200e798: 80 a2 00 1b cmp %o0, %i3 200e79c: 38 bf ff a9 bgu,a 200e640 200e7a0: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 rtems_set_errno_and_return_minus_one( EFBIG ); 200e7a4: 40 00 03 61 call 200f528 <__errno> 200e7a8: b0 10 3f ff mov -1, %i0 200e7ac: 82 10 20 1b mov 0x1b, %g1 200e7b0: c2 22 00 00 st %g1, [ %o0 ] 200e7b4: 81 c7 e0 08 ret 200e7b8: 81 e8 00 00 restore =============================================================================== 0200deb4 : #endif IMFS_jnode_t *the_jnode, unsigned int block, int malloc_it ) { 200deb4: 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 ) { 200deb8: 03 00 80 72 sethi %hi(0x201c800), %g1 200debc: fa 00 60 60 ld [ %g1 + 0x60 ], %i5 ! 201c860 200dec0: bb 37 60 02 srl %i5, 2, %i5 200dec4: 82 07 7f ff add %i5, -1, %g1 200dec8: 80 a6 40 01 cmp %i1, %g1 200decc: 38 80 00 0b bgu,a 200def8 200ded0: 90 07 60 01 add %i5, 1, %o0 p = info->indirect; if ( malloc_it ) { 200ded4: 80 a6 a0 00 cmp %i2, 0 200ded8: 12 80 00 4e bne 200e010 200dedc: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 info->indirect = p; } return &info->indirect[ my_block ]; } if ( !p ) 200dee0: 80 a2 20 00 cmp %o0, 0 200dee4: 02 80 00 6d be 200e098 <== NEVER TAKEN 200dee8: 01 00 00 00 nop return 0; return &info->indirect[ my_block ]; 200deec: b3 2e 60 02 sll %i1, 2, %i1 200def0: 81 c7 e0 08 ret 200def4: 91 ea 00 19 restore %o0, %i1, %o0 /* * Is the block number in the doubly indirect portion? */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { 200def8: 40 00 28 cf call 2018234 <.umul> 200defc: 92 10 00 1d mov %i5, %o1 200df00: 82 02 3f ff add %o0, -1, %g1 200df04: 80 a6 40 01 cmp %i1, %g1 200df08: 08 80 00 2b bleu 200dfb4 200df0c: b8 10 00 08 mov %o0, %i4 } /* * Is the block number in the triply indirect portion? */ if ( my_block <= LAST_TRIPLY_INDIRECT ) { 200df10: 90 02 20 01 inc %o0 200df14: 40 00 28 c8 call 2018234 <.umul> 200df18: 92 10 00 1d mov %i5, %o1 200df1c: 90 02 3f ff add %o0, -1, %o0 200df20: 80 a6 40 08 cmp %i1, %o0 200df24: 18 80 00 5d bgu 200e098 <== NEVER TAKEN 200df28: b2 26 40 1c sub %i1, %i4, %i1 my_block -= FIRST_TRIPLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200df2c: 92 10 00 1d mov %i5, %o1 200df30: 40 00 29 a7 call 20185cc <.urem> 200df34: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200df38: 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; 200df3c: a0 10 00 08 mov %o0, %l0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200df40: 40 00 28 f7 call 201831c <.udiv> 200df44: 90 10 00 19 mov %i1, %o0 triply = doubly / IMFS_MEMFILE_BLOCK_SLOTS; 200df48: 92 10 00 1d mov %i5, %o1 200df4c: 40 00 28 f4 call 201831c <.udiv> 200df50: b8 10 00 08 mov %o0, %i4 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200df54: 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; 200df58: b6 10 00 08 mov %o0, %i3 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200df5c: 40 00 29 9c call 20185cc <.urem> 200df60: 90 10 00 1c mov %i4, %o0 p = info->triply_indirect; if ( malloc_it ) { 200df64: 80 a6 a0 00 cmp %i2, 0 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; doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200df68: ba 10 00 08 mov %o0, %i5 p = info->triply_indirect; if ( malloc_it ) { 200df6c: 02 80 00 3d be 200e060 200df70: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 if ( !p ) { 200df74: 80 a2 20 00 cmp %o0, 0 200df78: 02 80 00 66 be 200e110 200df7c: 01 00 00 00 nop if ( !p ) return 0; info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; 200df80: b7 2e e0 02 sll %i3, 2, %i3 200df84: c4 02 00 1b ld [ %o0 + %i3 ], %g2 if ( !p1 ) { 200df88: 80 a0 a0 00 cmp %g2, 0 200df8c: 02 80 00 5a be 200e0f4 200df90: b6 02 00 1b add %o0, %i3, %i3 if ( !p1 ) return 0; p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; 200df94: bb 2f 60 02 sll %i5, 2, %i5 200df98: d0 00 80 1d ld [ %g2 + %i5 ], %o0 if ( !p2 ) { 200df9c: 80 a2 20 00 cmp %o0, 0 200dfa0: 02 80 00 47 be 200e0bc 200dfa4: 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 ]; 200dfa8: b1 2c 20 02 sll %l0, 2, %i0 200dfac: 81 c7 e0 08 ret 200dfb0: 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; 200dfb4: b2 26 40 1d sub %i1, %i5, %i1 singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200dfb8: 92 10 00 1d mov %i5, %o1 200dfbc: 40 00 29 84 call 20185cc <.urem> 200dfc0: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200dfc4: 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; 200dfc8: b8 10 00 08 mov %o0, %i4 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200dfcc: 40 00 28 d4 call 201831c <.udiv> 200dfd0: 90 10 00 19 mov %i1, %o0 p = info->doubly_indirect; 200dfd4: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( malloc_it ) { 200dfd8: 80 a6 a0 00 cmp %i2, 0 200dfdc: 02 80 00 17 be 200e038 200dfe0: ba 10 00 08 mov %o0, %i5 if ( !p ) { 200dfe4: 80 a0 60 00 cmp %g1, 0 200dfe8: 02 80 00 3c be 200e0d8 200dfec: 01 00 00 00 nop if ( !p ) return 0; info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; 200dff0: bb 2f 60 02 sll %i5, 2, %i5 200dff4: d0 00 40 1d ld [ %g1 + %i5 ], %o0 if ( !p1 ) { 200dff8: 80 a2 20 00 cmp %o0, 0 200dffc: 02 80 00 29 be 200e0a0 200e000: ba 00 40 1d add %g1, %i5, %i5 if ( !p1 ) return 0; p[ doubly ] = (block_p) p1; } return (block_p *)&p1[ singly ]; 200e004: b1 2f 20 02 sll %i4, 2, %i0 200e008: 81 c7 e0 08 ret 200e00c: 91 ea 00 18 restore %o0, %i0, %o0 if ( my_block <= LAST_INDIRECT ) { p = info->indirect; if ( malloc_it ) { if ( !p ) { 200e010: 80 a2 20 00 cmp %o0, 0 200e014: 32 bf ff b7 bne,a 200def0 200e018: b3 2e 60 02 sll %i1, 2, %i1 p = memfile_alloc_block(); 200e01c: 7f ff ff 99 call 200de80 200e020: 01 00 00 00 nop if ( !p ) 200e024: 80 a2 20 00 cmp %o0, 0 200e028: 02 80 00 1c be 200e098 <== NEVER TAKEN 200e02c: 01 00 00 00 nop return 0; info->indirect = p; 200e030: 10 bf ff af b 200deec 200e034: d0 26 20 58 st %o0, [ %i0 + 0x58 ] } return (block_p *)&p1[ singly ]; } if ( !p ) 200e038: 80 a0 60 00 cmp %g1, 0 200e03c: 02 80 00 17 be 200e098 <== NEVER TAKEN 200e040: bb 2a 20 02 sll %o0, 2, %i5 return 0; p = (block_p *)p[ doubly ]; 200e044: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p ) 200e048: 80 a0 60 00 cmp %g1, 0 200e04c: 02 80 00 13 be 200e098 <== NEVER TAKEN 200e050: 01 00 00 00 nop return 0; return (block_p *)&p[ singly ]; 200e054: b1 2f 20 02 sll %i4, 2, %i0 200e058: 81 c7 e0 08 ret 200e05c: 91 e8 40 18 restore %g1, %i0, %o0 p1[ doubly ] = (block_p) p2; } return (block_p *)&p2[ singly ]; } if ( !p ) 200e060: 80 a2 20 00 cmp %o0, 0 200e064: 02 80 00 0d be 200e098 <== NEVER TAKEN 200e068: b7 2e e0 02 sll %i3, 2, %i3 return 0; p1 = (block_p *) p[ triply ]; 200e06c: c2 02 00 1b ld [ %o0 + %i3 ], %g1 if ( !p1 ) 200e070: 80 a0 60 00 cmp %g1, 0 200e074: 02 80 00 09 be 200e098 <== NEVER TAKEN 200e078: bb 2f 60 02 sll %i5, 2, %i5 return 0; p2 = (block_p *)p1[ doubly ]; 200e07c: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p2 ) 200e080: 80 a0 60 00 cmp %g1, 0 200e084: 02 80 00 05 be 200e098 <== NEVER TAKEN 200e088: 01 00 00 00 nop return 0; return (block_p *)&p2[ singly ]; 200e08c: b1 2c 20 02 sll %l0, 2, %i0 /* * This means the requested block number is out of range. */ return 0; } 200e090: 81 c7 e0 08 ret 200e094: 91 e8 40 18 restore %g1, %i0, %o0 if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); if ( !p ) return 0; 200e098: 81 c7 e0 08 ret <== NOT EXECUTED 200e09c: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200e0a0: 7f ff ff 78 call 200de80 200e0a4: 01 00 00 00 nop if ( !p1 ) 200e0a8: 80 a2 20 00 cmp %o0, 0 200e0ac: 02 bf ff fb be 200e098 <== NEVER TAKEN 200e0b0: 01 00 00 00 nop return 0; p[ doubly ] = (block_p) p1; 200e0b4: 10 bf ff d4 b 200e004 200e0b8: d0 27 40 00 st %o0, [ %i5 ] p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; if ( !p2 ) { p2 = memfile_alloc_block(); 200e0bc: 7f ff ff 71 call 200de80 200e0c0: 01 00 00 00 nop if ( !p2 ) 200e0c4: 80 a2 20 00 cmp %o0, 0 200e0c8: 02 bf ff f4 be 200e098 <== NEVER TAKEN 200e0cc: 01 00 00 00 nop return 0; p1[ doubly ] = (block_p) p2; 200e0d0: 10 bf ff b6 b 200dfa8 200e0d4: d0 27 40 00 st %o0, [ %i5 ] p = info->doubly_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200e0d8: 7f ff ff 6a call 200de80 200e0dc: 01 00 00 00 nop if ( !p ) 200e0e0: 82 92 20 00 orcc %o0, 0, %g1 200e0e4: 02 bf ff ed be 200e098 <== NEVER TAKEN 200e0e8: 01 00 00 00 nop return 0; info->doubly_indirect = p; 200e0ec: 10 bf ff c1 b 200dff0 200e0f0: c2 26 20 5c st %g1, [ %i0 + 0x5c ] info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200e0f4: 7f ff ff 63 call 200de80 200e0f8: 01 00 00 00 nop if ( !p1 ) 200e0fc: 84 92 20 00 orcc %o0, 0, %g2 200e100: 02 bf ff e6 be 200e098 <== NEVER TAKEN 200e104: 01 00 00 00 nop return 0; p[ triply ] = (block_p) p1; 200e108: 10 bf ff a3 b 200df94 200e10c: c4 26 c0 00 st %g2, [ %i3 ] p = info->triply_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200e110: 7f ff ff 5c call 200de80 200e114: 01 00 00 00 nop if ( !p ) 200e118: 80 a2 20 00 cmp %o0, 0 200e11c: 02 bf ff df be 200e098 <== NEVER TAKEN 200e120: 01 00 00 00 nop return 0; info->triply_indirect = p; 200e124: 10 bf ff 97 b 200df80 200e128: d0 26 20 60 st %o0, [ %i0 + 0x60 ] =============================================================================== 0200e12c : IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200e12c: 9d e3 bf 98 save %sp, -104, %sp rtems_chain_extract_unprotected( &node->Node ); } static inline IMFS_jnode_types_t IMFS_type( const IMFS_jnode_t *node ) { return node->control->imfs_type; 200e130: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 200e134: a4 10 00 18 mov %i0, %l2 * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; if ( IMFS_type( the_jnode ) == IMFS_LINEAR_FILE ) { 200e138: c2 00 40 00 ld [ %g1 ], %g1 IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200e13c: a0 10 00 19 mov %i1, %l0 200e140: a2 10 00 1a mov %i2, %l1 * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; if ( IMFS_type( the_jnode ) == IMFS_LINEAR_FILE ) { 200e144: 80 a0 60 05 cmp %g1, 5 200e148: 02 80 00 68 be 200e2e8 200e14c: a6 10 00 1b mov %i3, %l3 /* * 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 ) 200e150: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 200e154: 86 10 20 00 clr %g3 /* * 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; 200e158: 82 10 00 1a mov %i2, %g1 if ( last_byte > the_jnode->info.file.size ) 200e15c: c8 06 20 54 ld [ %i0 + 0x54 ], %g4 200e160: 80 a0 c0 02 cmp %g3, %g2 200e164: 04 80 00 42 ble 200e26c <== ALWAYS TAKEN 200e168: ba 07 00 1a add %i4, %i2, %i5 my_length = the_jnode->info.file.size - start; 200e16c: 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; 200e170: 33 00 80 72 sethi %hi(0x201c800), %i1 <== NOT EXECUTED 200e174: fa 06 60 60 ld [ %i1 + 0x60 ], %i5 ! 201c860 200e178: 90 10 00 10 mov %l0, %o0 200e17c: b7 3f 60 1f sra %i5, 0x1f, %i3 200e180: 96 10 00 1d mov %i5, %o3 200e184: 94 10 00 1b mov %i3, %o2 200e188: 40 00 2a a8 call 2018c28 <__moddi3> 200e18c: 92 10 00 11 mov %l1, %o1 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e190: 90 10 00 10 mov %l0, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200e194: a8 10 00 09 mov %o1, %l4 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e198: 94 10 00 1b mov %i3, %o2 200e19c: 92 10 00 11 mov %l1, %o1 200e1a0: 40 00 29 b7 call 201887c <__divdi3> 200e1a4: 96 10 00 1d mov %i5, %o3 if ( start_offset ) { 200e1a8: 80 a5 20 00 cmp %l4, 0 200e1ac: 02 80 00 37 be 200e288 200e1b0: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200e1b4: ba 27 40 14 sub %i5, %l4, %i5 200e1b8: 80 a7 00 1d cmp %i4, %i5 200e1bc: 18 80 00 59 bgu 200e320 200e1c0: a0 10 00 1c mov %i4, %l0 if ( to_copy > my_length ) to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e1c4: 90 10 00 12 mov %l2, %o0 200e1c8: 92 10 00 1a mov %i2, %o1 200e1cc: 94 10 20 00 clr %o2 200e1d0: 7f ff ff 39 call 200deb4 200e1d4: b0 10 20 00 clr %i0 if ( !block_ptr ) 200e1d8: 80 a2 20 00 cmp %o0, 0 200e1dc: 02 80 00 22 be 200e264 <== NEVER TAKEN 200e1e0: 94 10 00 10 mov %l0, %o2 return copied; memcpy( dest, &(*block_ptr)[ start_offset ], to_copy ); 200e1e4: d2 02 00 00 ld [ %o0 ], %o1 200e1e8: 90 10 00 13 mov %l3, %o0 200e1ec: 40 00 07 20 call 200fe6c 200e1f0: 92 02 40 14 add %o1, %l4, %o1 200e1f4: fa 06 60 60 ld [ %i1 + 0x60 ], %i5 dest += to_copy; 200e1f8: b6 04 c0 10 add %l3, %l0, %i3 block++; 200e1fc: b4 06 a0 01 inc %i2 my_length -= to_copy; 200e200: b8 27 00 10 sub %i4, %l0, %i4 copied += to_copy; 200e204: b0 10 00 10 mov %l0, %i0 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200e208: 80 a7 00 1d cmp %i4, %i5 200e20c: 1a 80 00 0e bcc 200e244 200e210: 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 ) { 200e214: 10 80 00 21 b 200e298 200e218: 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 ); 200e21c: d2 00 40 00 ld [ %g1 ], %o1 200e220: 40 00 07 13 call 200fe6c 200e224: b8 27 00 1d sub %i4, %i5, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200e228: c2 06 60 60 ld [ %i1 + 0x60 ], %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; 200e22c: b6 06 c0 1d add %i3, %i5, %i3 block++; 200e230: 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 ) { 200e234: 80 a0 40 1c cmp %g1, %i4 200e238: 18 80 00 17 bgu 200e294 200e23c: b0 06 00 1d add %i0, %i5, %i0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e240: 94 10 20 00 clr %o2 200e244: 92 10 00 1a mov %i2, %o1 200e248: 7f ff ff 1b call 200deb4 200e24c: 90 10 00 12 mov %l2, %o0 if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); 200e250: 94 10 00 1d mov %i5, %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 ); 200e254: 82 10 00 08 mov %o0, %g1 if ( !block_ptr ) 200e258: 80 a0 60 00 cmp %g1, 0 200e25c: 12 bf ff f0 bne 200e21c <== ALWAYS TAKEN 200e260: 90 10 00 1b mov %i3, %o0 } IMFS_update_atime( the_jnode ); return copied; } 200e264: 81 c7 e0 08 ret <== NOT EXECUTED 200e268: 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 ) 200e26c: 12 bf ff c2 bne 200e174 <== NEVER TAKEN 200e270: 33 00 80 72 sethi %hi(0x201c800), %i1 200e274: 80 a7 40 04 cmp %i5, %g4 200e278: 08 bf ff c0 bleu 200e178 200e27c: fa 06 60 60 ld [ %i1 + 0x60 ], %i5 my_length = the_jnode->info.file.size - start; 200e280: 10 bf ff bd b 200e174 200e284: b8 21 00 01 sub %g4, %g1, %i4 unsigned int last_byte; unsigned int copied; unsigned int start_offset; unsigned char *dest; dest = destination; 200e288: b6 10 00 13 mov %l3, %i3 */ last_byte = start + length; if ( last_byte > the_jnode->info.file.size ) my_length = the_jnode->info.file.size - start; copied = 0; 200e28c: 10 bf ff df b 200e208 200e290: b0 10 20 00 clr %i0 /* * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); if ( my_length ) { 200e294: 80 a7 20 00 cmp %i4, 0 200e298: 02 80 00 0e be 200e2d0 200e29c: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e2a0: 90 10 00 12 mov %l2, %o0 200e2a4: 92 10 00 1a mov %i2, %o1 200e2a8: 7f ff ff 03 call 200deb4 200e2ac: 94 10 20 00 clr %o2 if ( !block_ptr ) 200e2b0: 80 a2 20 00 cmp %o0, 0 200e2b4: 02 bf ff ec be 200e264 <== NEVER TAKEN 200e2b8: 94 10 00 1c mov %i4, %o2 return copied; memcpy( dest, &(*block_ptr)[ 0 ], my_length ); 200e2bc: d2 02 00 00 ld [ %o0 ], %o1 200e2c0: 90 10 00 1b mov %i3, %o0 200e2c4: 40 00 06 ea call 200fe6c 200e2c8: b0 06 00 1c add %i0, %i4, %i0 copied += my_length; } IMFS_update_atime( the_jnode ); 200e2cc: 90 07 bf f8 add %fp, -8, %o0 200e2d0: 7f ff d5 12 call 2003718 200e2d4: 92 10 20 00 clr %o1 200e2d8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e2dc: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] return copied; } 200e2e0: 81 c7 e0 08 ret 200e2e4: 81 e8 00 00 restore if ( IMFS_type( the_jnode ) == 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)) 200e2e8: f4 1e 20 50 ldd [ %i0 + 0x50 ], %i2 200e2ec: 82 10 20 00 clr %g1 200e2f0: 86 a6 c0 11 subcc %i3, %l1, %g3 200e2f4: 84 66 80 19 subx %i2, %i1, %g2 200e2f8: 80 a0 40 02 cmp %g1, %g2 200e2fc: 04 80 00 0b ble 200e328 <== ALWAYS TAKEN 200e300: d2 06 20 58 ld [ %i0 + 0x58 ], %o1 my_length = the_jnode->info.linearfile.size - start; 200e304: b0 26 c0 11 sub %i3, %l1, %i0 <== NOT EXECUTED memcpy(dest, &file_ptr[start], my_length); 200e308: 92 02 40 11 add %o1, %l1, %o1 200e30c: 94 10 00 18 mov %i0, %o2 if ( my_length ) { block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], my_length ); 200e310: 40 00 06 d7 call 200fe6c 200e314: 90 10 00 13 mov %l3, %o0 copied += my_length; } IMFS_update_atime( the_jnode ); 200e318: 10 bf ff ee b 200e2d0 200e31c: 90 07 bf f8 add %fp, -8, %o0 200e320: 10 bf ff a9 b 200e1c4 200e324: a0 10 00 1d mov %i5, %l0 if ( IMFS_type( the_jnode ) == 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)) 200e328: 12 80 00 04 bne 200e338 <== NEVER TAKEN 200e32c: 80 a7 00 03 cmp %i4, %g3 200e330: 38 bf ff f6 bgu,a 200e308 <== ALWAYS TAKEN 200e334: b0 26 c0 11 sub %i3, %l1, %i0 /* * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; 200e338: 10 bf ff f4 b 200e308 <== NOT EXECUTED 200e33c: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED =============================================================================== 0200e450 : * is better to stick to simple, easy to understand algorithms. */ IMFS_jnode_t *IMFS_memfile_remove( IMFS_jnode_t *the_jnode ) { 200e450: 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; 200e454: 39 00 80 72 sethi %hi(0x201c800), %i4 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200e458: 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; 200e45c: f4 07 20 60 ld [ %i4 + 0x60 ], %i2 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200e460: 80 a0 60 00 cmp %g1, 0 200e464: 02 80 00 05 be 200e478 200e468: b5 36 a0 02 srl %i2, 2, %i2 memfile_free_blocks_in_table( &info->indirect, to_free ); 200e46c: 90 06 20 58 add %i0, 0x58, %o0 200e470: 7f ff ff e2 call 200e3f8 200e474: 92 10 00 1a mov %i2, %o1 } if ( info->doubly_indirect ) { 200e478: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200e47c: 80 a0 60 00 cmp %g1, 0 200e480: 02 80 00 1b be 200e4ec 200e484: c4 07 20 60 ld [ %i4 + 0x60 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200e494: 90 10 20 00 clr %o0 200e498: 37 00 80 72 sethi %hi(0x201c800), %i3 200e49c: ba 10 20 00 clr %i5 200e4a0: 10 80 00 03 b 200e4ac 200e4a4: b6 16 e0 60 or %i3, 0x60, %i3 200e4a8: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( info->doubly_indirect[i] ) { 200e4ac: 91 2a 20 02 sll %o0, 2, %o0 200e4b0: c4 00 40 08 ld [ %g1 + %o0 ], %g2 200e4b4: 80 a0 a0 00 cmp %g2, 0 200e4b8: 02 80 00 04 be 200e4c8 <== NEVER TAKEN 200e4bc: 90 00 40 08 add %g1, %o0, %o0 memfile_free_blocks_in_table( 200e4c0: 7f ff ff ce call 200e3f8 200e4c4: 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 200e4dc: 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 ); 200e4e0: 90 06 20 5c add %i0, 0x5c, %o0 200e4e4: 7f ff ff c5 call 200e3f8 200e4e8: 92 10 00 1a mov %i2, %o1 } if ( info->triply_indirect ) { 200e4ec: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 200e4f0: 80 a2 20 00 cmp %o0, 0 200e4f4: 02 80 00 33 be 200e5c0 200e4f8: c4 07 20 60 ld [ %i4 + 0x60 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200e508: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED p = (block_p *) info->triply_indirect[i]; 200e50c: f8 02 00 00 ld [ %o0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200e510: 80 a7 20 00 cmp %i4, 0 200e514: 22 80 00 29 be,a 200e5b8 <== NEVER TAKEN 200e518: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200e51c: 37 00 80 72 sethi %hi(0x201c800), %i3 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200e520: a0 10 20 00 clr %l0 if ( !p ) /* ensure we have a valid pointer */ 200e524: b2 10 20 00 clr %i1 200e528: b6 16 e0 60 or %i3, 0x60, %i3 break; for ( j=0 ; j <== NEVER TAKEN 200e534: 90 02 00 10 add %o0, %l0, %o0 <== NOT EXECUTED 200e538: 90 10 20 00 clr %o0 200e53c: ba 10 20 00 clr %i5 if ( p[j] ) { 200e540: 91 2a 20 02 sll %o0, 2, %o0 200e544: c2 07 00 08 ld [ %i4 + %o0 ], %g1 200e548: 80 a0 60 00 cmp %g1, 0 200e54c: 02 80 00 04 be 200e55c <== NEVER TAKEN 200e550: 90 07 00 08 add %i4, %o0, %o0 memfile_free_blocks_in_table( (block_p **)&p[j], to_free); 200e554: 7f ff ff a9 call 200e3f8 200e558: 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 200e570: 90 10 00 1d mov %i5, %o0 200e574: 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( 200e578: 90 02 00 10 add %o0, %l0, %o0 200e57c: 7f ff ff 9f call 200e3f8 200e580: 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 200e598: 90 06 20 60 add %i0, 0x60, %o0 p = (block_p *) info->triply_indirect[i]; 200e59c: 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. */ IMFS_jnode_t *IMFS_memfile_remove( 200e5a0: a1 2e 60 02 sll %i1, 2, %l0 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200e5a4: f8 02 00 10 ld [ %o0 + %l0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200e5a8: 80 a7 20 00 cmp %i4, 0 200e5ac: 12 bf ff e1 bne 200e530 <== ALWAYS TAKEN 200e5b0: 80 a0 a0 00 cmp %g2, 0 } } memfile_free_blocks_in_table( (block_p **)&info->triply_indirect[i], to_free ); } memfile_free_blocks_in_table( 200e5b4: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200e5b8: 7f ff ff 90 call 200e3f8 200e5bc: 92 10 00 1a mov %i2, %o1 (block_p **)&info->triply_indirect, to_free ); } return the_jnode; } 200e5c0: 81 c7 e0 08 ret 200e5c4: 81 e8 00 00 restore =============================================================================== 0200e5c8 : */ MEMFILE_STATIC int IMFS_memfile_remove_block( IMFS_jnode_t *the_jnode, unsigned int block ) { 200e5c8: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED block_p *block_ptr; block_p ptr; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e5cc: 94 10 20 00 clr %o2 <== NOT EXECUTED 200e5d0: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200e5d4: 7f ff fe 38 call 200deb4 <== NOT EXECUTED 200e5d8: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 200e5dc: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED IMFS_assert( block_ptr ); ptr = *block_ptr; 200e5e0: d0 02 00 00 ld [ %o0 ], %o0 <== NOT EXECUTED *block_ptr = 0; memfile_free_block( ptr ); return 1; } 200e5e4: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); IMFS_assert( block_ptr ); ptr = *block_ptr; *block_ptr = 0; memfile_free_block( ptr ); 200e5e8: 7f ff ff 7b call 200e3d4 <== NOT EXECUTED 200e5ec: c0 20 40 00 clr [ %g1 ] <== NOT EXECUTED return 1; } 200e5f0: 81 c7 e0 08 ret <== NOT EXECUTED 200e5f4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200e7bc : IMFS_jnode_t *the_jnode, off_t start, const unsigned char *source, unsigned int length ) { 200e7bc: 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 ) { 200e7c0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200e7c4: 84 10 20 00 clr %g2 /* * 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; 200e7c8: 96 07 00 1a add %i4, %i2, %o3 if ( last_byte > the_jnode->info.file.size ) { 200e7cc: 80 a0 80 01 cmp %g2, %g1 200e7d0: 14 80 00 5e bg 200e948 <== NEVER TAKEN 200e7d4: c6 06 20 54 ld [ %i0 + 0x54 ], %g3 200e7d8: 80 a0 80 01 cmp %g2, %g1 200e7dc: 02 80 00 59 be 200e940 <== ALWAYS TAKEN 200e7e0: 80 a2 c0 03 cmp %o3, %g3 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200e7e4: 21 00 80 72 sethi %hi(0x201c800), %l0 <== NOT EXECUTED 200e7e8: fa 04 20 60 ld [ %l0 + 0x60 ], %i5 ! 201c860 200e7ec: 90 10 00 19 mov %i1, %o0 200e7f0: a3 3f 60 1f sra %i5, 0x1f, %l1 200e7f4: 92 10 00 1a mov %i2, %o1 200e7f8: 94 10 00 11 mov %l1, %o2 200e7fc: 40 00 29 0b call 2018c28 <__moddi3> 200e800: 96 10 00 1d mov %i5, %o3 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e804: 90 10 00 19 mov %i1, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200e808: a4 10 00 09 mov %o1, %l2 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e80c: 94 10 00 11 mov %l1, %o2 200e810: 92 10 00 1a mov %i2, %o1 200e814: 40 00 28 1a call 201887c <__divdi3> 200e818: 96 10 00 1d mov %i5, %o3 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); if ( status ) return status; } copied = 0; 200e81c: b2 10 20 00 clr %i1 /* * 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 ) { 200e820: 80 a4 a0 00 cmp %l2, 0 200e824: 02 80 00 16 be 200e87c 200e828: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200e82c: b2 27 40 12 sub %i5, %l2, %i1 200e830: 80 a6 40 1c cmp %i1, %i4 200e834: 38 80 00 02 bgu,a 200e83c 200e838: b2 10 00 1c mov %i4, %i1 if ( to_copy > my_length ) to_copy = my_length; block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e83c: 90 10 00 18 mov %i0, %o0 200e840: 92 10 00 1a mov %i2, %o1 200e844: 7f ff fd 9c call 200deb4 200e848: 94 10 20 00 clr %o2 if ( !block_ptr ) 200e84c: 80 a2 20 00 cmp %o0, 0 200e850: 02 80 00 22 be 200e8d8 <== NEVER TAKEN 200e854: 82 10 20 00 clr %g1 block, to_copy, src ); #endif memcpy( &(*block_ptr)[ start_offset ], src, to_copy ); 200e858: d0 02 00 00 ld [ %o0 ], %o0 200e85c: 92 10 00 1b mov %i3, %o1 200e860: 90 02 00 12 add %o0, %l2, %o0 200e864: 40 00 05 82 call 200fe6c 200e868: 94 10 00 19 mov %i1, %o2 200e86c: fa 04 20 60 ld [ %l0 + 0x60 ], %i5 src += to_copy; 200e870: b6 06 c0 19 add %i3, %i1, %i3 block++; 200e874: b4 06 a0 01 inc %i2 my_length -= to_copy; 200e878: b8 27 00 19 sub %i4, %i1, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200e87c: 80 a7 00 1d cmp %i4, %i5 200e880: 1a 80 00 0e bcc 200e8b8 200e884: 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 ) { 200e888: 10 80 00 17 b 200e8e4 200e88c: 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 ); 200e890: d0 02 00 00 ld [ %o0 ], %o0 200e894: 40 00 05 76 call 200fe6c 200e898: b8 27 00 1d sub %i4, %i5, %i4 /* * Phase 2: all of zero of more blocks */ to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK; while ( my_length >= IMFS_MEMFILE_BYTES_PER_BLOCK ) { 200e89c: c2 04 20 60 ld [ %l0 + 0x60 ], %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; 200e8a0: b6 06 c0 1d add %i3, %i5, %i3 block++; 200e8a4: 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 ) { 200e8a8: 80 a0 40 1c cmp %g1, %i4 200e8ac: 18 80 00 0d bgu 200e8e0 200e8b0: b2 06 40 1d add %i1, %i5, %i1 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e8b4: 92 10 00 1a mov %i2, %o1 200e8b8: 94 10 20 00 clr %o2 200e8bc: 7f ff fd 7e call 200deb4 200e8c0: 90 10 00 18 mov %i0, %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 ); 200e8c4: 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 ) 200e8c8: 80 a2 20 00 cmp %o0, 0 200e8cc: 12 bf ff f1 bne 200e890 <== ALWAYS TAKEN 200e8d0: 94 10 00 1d mov %i5, %o2 200e8d4: 82 10 00 19 mov %i1, %g1 <== NOT EXECUTED } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200e8d8: 81 c7 e0 08 ret <== NOT EXECUTED 200e8dc: 91 e8 00 01 restore %g0, %g1, %o0 <== NOT EXECUTED * 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 ) { 200e8e0: 80 a7 20 00 cmp %i4, 0 200e8e4: 02 80 00 0f be 200e920 200e8e8: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e8ec: 90 10 00 18 mov %i0, %o0 200e8f0: 92 10 00 1a mov %i2, %o1 200e8f4: 7f ff fd 70 call 200deb4 200e8f8: 94 10 20 00 clr %o2 if ( !block_ptr ) 200e8fc: 80 a2 20 00 cmp %o0, 0 200e900: 02 bf ff f6 be 200e8d8 <== NEVER TAKEN 200e904: 82 10 00 19 mov %i1, %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, my_length ); 200e908: d0 02 00 00 ld [ %o0 ], %o0 200e90c: 92 10 00 1b mov %i3, %o1 200e910: 94 10 00 1c mov %i4, %o2 200e914: 40 00 05 56 call 200fe6c 200e918: b2 06 40 1c add %i1, %i4, %i1 my_length = 0; copied += to_copy; } IMFS_mtime_ctime_update( the_jnode ); 200e91c: 90 07 bf f8 add %fp, -8, %o0 200e920: 7f ff d3 7e call 2003718 200e924: 92 10 20 00 clr %o1 200e928: c4 07 bf f8 ld [ %fp + -8 ], %g2 return copied; 200e92c: 82 10 00 19 mov %i1, %g1 memcpy( &(*block_ptr)[ 0 ], src, my_length ); my_length = 0; copied += to_copy; } IMFS_mtime_ctime_update( the_jnode ); 200e930: c4 26 20 44 st %g2, [ %i0 + 0x44 ] 200e934: c4 26 20 48 st %g2, [ %i0 + 0x48 ] return copied; } 200e938: 81 c7 e0 08 ret 200e93c: 91 e8 00 01 restore %g0, %g1, %o0 * 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 ) { 200e940: 08 bf ff aa bleu 200e7e8 200e944: 21 00 80 72 sethi %hi(0x201c800), %l0 bool zero_fill = start > the_jnode->info.file.size; 200e948: 80 a6 40 01 cmp %i1, %g1 200e94c: 04 80 00 0b ble 200e978 <== ALWAYS TAKEN 200e950: 92 10 20 01 mov 1, %o1 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200e954: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200e958: 92 0a 60 01 and %o1, 1, %o1 200e95c: 7f ff ff 27 call 200e5f8 200e960: 94 10 20 00 clr %o2 if ( status ) 200e964: 82 92 20 00 orcc %o0, 0, %g1 200e968: 02 bf ff a0 be 200e7e8 200e96c: 21 00 80 72 sethi %hi(0x201c800), %l0 } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200e970: 81 c7 e0 08 ret 200e974: 91 e8 00 01 restore %g0, %g1, %o0 * in memory file, then extend the length. */ last_byte = start + my_length; if ( last_byte > the_jnode->info.file.size ) { bool zero_fill = start > the_jnode->info.file.size; 200e978: 02 80 00 0b be 200e9a4 <== ALWAYS TAKEN 200e97c: 80 a6 80 03 cmp %i2, %g3 200e980: 92 10 20 00 clr %o1 <== NOT EXECUTED status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200e984: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200e988: 92 0a 60 01 and %o1, 1, %o1 200e98c: 7f ff ff 1b call 200e5f8 200e990: 94 10 20 00 clr %o2 if ( status ) 200e994: 82 92 20 00 orcc %o0, 0, %g1 200e998: 02 bf ff 94 be 200e7e8 200e99c: 21 00 80 72 sethi %hi(0x201c800), %l0 200e9a0: 30 bf ff f4 b,a 200e970 * in memory file, then extend the length. */ last_byte = start + my_length; if ( last_byte > the_jnode->info.file.size ) { bool zero_fill = start > the_jnode->info.file.size; 200e9a4: 18 bf ff ed bgu 200e958 200e9a8: 90 10 00 18 mov %i0, %o0 200e9ac: 10 bf ff f7 b 200e988 200e9b0: 92 10 20 00 clr %o1 =============================================================================== 02002e98 : const char *name, size_t namelen, mode_t mode, dev_t dev ) { 2002e98: 9d e3 bf 80 save %sp, -128, %sp dev_t dev, IMFS_jnode_types_t *type, IMFS_types_union *info ) { if ( S_ISDIR( mode ) ) { 2002e9c: 03 00 00 3c sethi %hi(0xf000), %g1 2002ea0: 05 00 00 10 sethi %hi(0x4000), %g2 2002ea4: 82 0e c0 01 and %i3, %g1, %g1 2002ea8: 80 a0 40 02 cmp %g1, %g2 2002eac: 02 80 00 2b be 2002f58 2002eb0: 05 00 00 20 sethi %hi(0x8000), %g2 *type = IMFS_DIRECTORY; } else if ( S_ISREG( mode ) ) { 2002eb4: 80 a0 40 02 cmp %g1, %g2 2002eb8: 02 80 00 2a be 2002f60 2002ebc: 09 00 00 2c sethi %hi(0xb000), %g4 *type = IMFS_MEMORY_FILE; } else if ( S_ISBLK( mode ) || S_ISCHR( mode ) ) { 2002ec0: 05 00 00 08 sethi %hi(0x2000), %g2 2002ec4: 88 0e c0 04 and %i3, %g4, %g4 2002ec8: 80 a1 00 02 cmp %g4, %g2 2002ecc: 02 80 00 07 be 2002ee8 2002ed0: 05 00 00 04 sethi %hi(0x1000), %g2 rtems_filesystem_split_dev_t( dev, info->device.major, info->device.minor ); } else if (S_ISFIFO( mode )) { 2002ed4: 80 a0 40 02 cmp %g1, %g2 2002ed8: 22 80 00 06 be,a 2002ef0 <== ALWAYS TAKEN 2002edc: 86 10 20 06 mov 6, %g3 size_t namelen, mode_t mode, const IMFS_types_union *info ) { const IMFS_fs_info_t *fs_info = 2002ee0: 10 80 00 05 b 2002ef4 <== NOT EXECUTED 2002ee4: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 <== NOT EXECUTED *type = IMFS_DIRECTORY; } else if ( S_ISREG( mode ) ) { *type = IMFS_MEMORY_FILE; } else if ( S_ISBLK( mode ) || S_ISCHR( mode ) ) { *type = IMFS_DEVICE; rtems_filesystem_split_dev_t( 2002ee8: f8 3f bf e8 std %i4, [ %fp + -24 ] if ( S_ISDIR( mode ) ) { *type = IMFS_DIRECTORY; } else if ( S_ISREG( mode ) ) { *type = IMFS_MEMORY_FILE; } else if ( S_ISBLK( mode ) || S_ISCHR( mode ) ) { *type = IMFS_DEVICE; 2002eec: 86 10 20 01 mov 1, %g3 2002ef0: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 (const IMFS_fs_info_t *) parentloc->mt_entry->fs_info; return IMFS_create_node_with_control( 2002ef4: 82 00 e0 02 add %g3, 2, %g1 2002ef8: c4 00 a0 08 ld [ %g2 + 8 ], %g2 2002efc: 83 28 60 02 sll %g1, 2, %g1 2002f00: d2 00 80 01 ld [ %g2 + %g1 ], %o1 2002f04: 90 10 00 18 mov %i0, %o0 2002f08: 94 10 00 19 mov %i1, %o2 2002f0c: 96 10 00 1a mov %i2, %o3 2002f10: 98 10 00 1b mov %i3, %o4 2002f14: 40 00 23 e9 call 200beb8 2002f18: 9a 07 bf e8 add %fp, -24, %o5 IMFS_jnode_t *new_node; get_type_and_info_by_mode_and_dev( mode, dev, &type, &info ); new_node = IMFS_create_node( parentloc, type, name, namelen, mode, &info ); if ( new_node != NULL ) { 2002f1c: 80 a2 20 00 cmp %o0, 0 2002f20: 02 80 00 12 be 2002f68 2002f24: 92 10 20 00 clr %o1 IMFS_jnode_t *parent = parentloc->node_access; 2002f28: fa 06 20 08 ld [ %i0 + 8 ], %i5 IMFS_update_ctime( parent ); 2002f2c: 40 00 01 fb call 2003718 2002f30: 90 07 bf e0 add %fp, -32, %o0 2002f34: c2 07 bf e0 ld [ %fp + -32 ], %g1 IMFS_update_mtime( parent ); 2002f38: 90 07 bf e0 add %fp, -32, %o0 new_node = IMFS_create_node( parentloc, type, name, namelen, mode, &info ); if ( new_node != NULL ) { IMFS_jnode_t *parent = parentloc->node_access; IMFS_update_ctime( parent ); 2002f3c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] IMFS_update_mtime( parent ); 2002f40: 40 00 01 f6 call 2003718 2002f44: 92 10 20 00 clr %o1 2002f48: c2 07 bf e0 ld [ %fp + -32 ], %g1 2002f4c: c2 27 60 44 st %g1, [ %i5 + 0x44 ] size_t namelen, mode_t mode, dev_t dev ) { int rv = 0; 2002f50: 81 c7 e0 08 ret 2002f54: 91 e8 20 00 restore %g0, 0, %o0 IMFS_jnode_types_t *type, IMFS_types_union *info ) { if ( S_ISDIR( mode ) ) { *type = IMFS_DIRECTORY; 2002f58: 10 bf ff e6 b 2002ef0 2002f5c: 86 10 20 00 clr %g3 } else if ( S_ISREG( mode ) ) { *type = IMFS_MEMORY_FILE; 2002f60: 10 bf ff e4 b 2002ef0 2002f64: 86 10 20 04 mov 4, %g3 } else { rv = -1; } return rv; } 2002f68: 81 c7 e0 08 ret 2002f6c: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 02002f70 : #endif #include "imfs.h" int IMFS_mount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 2002f70: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; IMFS_jnode_t *node = mt_entry->mt_point_node->location.node_access; 2002f74: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2002f78: c2 00 60 08 ld [ %g1 + 8 ], %g1 return node->control->imfs_type; } static inline bool IMFS_is_directory( const IMFS_jnode_t *node ) { return node->control->imfs_type == IMFS_DIRECTORY; 2002f7c: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 if ( IMFS_is_directory( node ) ) { 2002f80: c4 00 80 00 ld [ %g2 ], %g2 2002f84: 80 a0 a0 00 cmp %g2, 0 2002f88: 12 80 00 0f bne 2002fc4 2002f8c: 01 00 00 00 nop if ( node->info.directory.mt_fs == NULL ) { 2002f90: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 2002f94: 80 a0 a0 00 cmp %g2, 0 2002f98: 12 80 00 05 bne 2002fac <== NEVER TAKEN 2002f9c: 01 00 00 00 nop node->info.directory.mt_fs = mt_entry; 2002fa0: f0 20 60 5c st %i0, [ %g1 + 0x5c ] #include "imfs.h" int IMFS_mount( rtems_filesystem_mount_table_entry_t *mt_entry ) { int rv = 0; 2002fa4: 81 c7 e0 08 ret 2002fa8: 91 e8 20 00 restore %g0, 0, %o0 if ( IMFS_is_directory( node ) ) { if ( node->info.directory.mt_fs == NULL ) { node->info.directory.mt_fs = mt_entry; } else { errno = EBUSY; 2002fac: 40 00 31 5f call 200f528 <__errno> <== NOT EXECUTED 2002fb0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2002fb4: 82 10 20 10 mov 0x10, %g1 <== NOT EXECUTED 2002fb8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2002fbc: 81 c7 e0 08 ret <== NOT EXECUTED 2002fc0: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = ENOTDIR; 2002fc4: 40 00 31 59 call 200f528 <__errno> 2002fc8: b0 10 3f ff mov -1, %i0 2002fcc: 82 10 20 14 mov 0x14, %g1 2002fd0: c2 22 00 00 st %g1, [ %o0 ] rv = -1; } return rv; } 2002fd4: 81 c7 e0 08 ret 2002fd8: 81 e8 00 00 restore =============================================================================== 0200c30c : } static IMFS_jnode_t *IMFS_node_remove_directory( IMFS_jnode_t *node ) { 200c30c: 9d e3 bf a0 save %sp, -96, %sp if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { 200c310: c4 06 20 50 ld [ %i0 + 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 ); 200c314: 82 06 20 54 add %i0, 0x54, %g1 200c318: 80 a0 80 01 cmp %g2, %g1 200c31c: 12 80 00 08 bne 200c33c 200c320: 01 00 00 00 nop errno = ENOTEMPTY; node = NULL; } else if ( IMFS_is_mount_point( node ) ) { 200c324: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200c328: 80 a0 60 00 cmp %g1, 0 200c32c: 12 80 00 0a bne 200c354 <== NEVER TAKEN 200c330: 01 00 00 00 nop errno = EBUSY; node = NULL; } return node; } 200c334: 81 c7 e0 08 ret 200c338: 81 e8 00 00 restore static IMFS_jnode_t *IMFS_node_remove_directory( IMFS_jnode_t *node ) { if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { errno = ENOTEMPTY; 200c33c: 40 00 0c 7b call 200f528 <__errno> 200c340: b0 10 20 00 clr %i0 200c344: 82 10 20 5a mov 0x5a, %g1 200c348: c2 22 00 00 st %g1, [ %o0 ] 200c34c: 81 c7 e0 08 ret 200c350: 81 e8 00 00 restore node = NULL; } else if ( IMFS_is_mount_point( node ) ) { errno = EBUSY; 200c354: 40 00 0c 75 call 200f528 <__errno> <== NOT EXECUTED 200c358: b0 10 20 00 clr %i0 <== NOT EXECUTED 200c35c: 82 10 20 10 mov 0x10, %g1 <== NOT EXECUTED 200c360: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED node = NULL; } return node; } 200c364: 81 c7 e0 08 ret <== NOT EXECUTED 200c368: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02002fdc : rtems_filesystem_node_types_t IMFS_node_type( const rtems_filesystem_location_info_t *loc ) { const IMFS_jnode_t *node = loc->node_access; 2002fdc: c4 02 20 08 ld [ %o0 + 8 ], %g2 rtems_chain_extract_unprotected( &node->Node ); } static inline IMFS_jnode_types_t IMFS_type( const IMFS_jnode_t *node ) { return node->control->imfs_type; 2002fe0: c2 00 a0 4c ld [ %g2 + 0x4c ], %g1 2002fe4: c2 00 40 00 ld [ %g1 ], %g1 IMFS_jnode_types_t imfs_type = IMFS_type( node ); rtems_filesystem_node_types_t type; switch ( imfs_type ) { 2002fe8: 80 a0 60 02 cmp %g1, 2 2002fec: 02 80 00 06 be 2003004 2002ff0: 80 a0 60 05 cmp %g1, 5 2002ff4: 02 80 00 08 be 2003014 <== NEVER TAKEN 2002ff8: 90 10 20 04 mov 4, %o0 type = imfs_type; break; } return type; } 2002ffc: 81 c3 e0 08 retl 2003000: 90 10 00 01 mov %g1, %o0 2003004: c2 00 a0 50 ld [ %g2 + 0x50 ], %g1 2003008: c2 00 60 4c ld [ %g1 + 0x4c ], %g1 rtems_filesystem_node_types_t type; switch ( imfs_type ) { case IMFS_HARD_LINK: type = IMFS_type( node->info.hard_link.link_node ); break; 200300c: 81 c3 e0 08 retl 2003010: d0 00 40 00 ld [ %g1 ], %o0 2003014: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 0200301c : node = loc->node_access; IMFS_assert( node->control->imfs_type == IMFS_SYM_LINK ); for( i=0; ((iinfo.sym_link.name[i] != '\0')); i++ ) 200301c: 80 a2 a0 00 cmp %o2, 0 2003020: 02 80 00 16 be 2003078 <== NEVER TAKEN 2003024: c8 02 20 08 ld [ %o0 + 8 ], %g4 2003028: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 200302c: c4 48 40 00 ldsb [ %g1 ], %g2 2003030: 80 a0 a0 00 cmp %g2, 0 2003034: 02 80 00 11 be 2003078 <== NEVER TAKEN 2003038: c2 08 40 00 ldub [ %g1 ], %g1 200303c: 84 10 20 00 clr %g2 2003040: 10 80 00 07 b 200305c 2003044: 90 10 20 00 clr %o0 2003048: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 200304c: c6 48 40 08 ldsb [ %g1 + %o0 ], %g3 2003050: 80 a0 e0 00 cmp %g3, 0 2003054: 02 80 00 07 be 2003070 2003058: c2 08 40 08 ldub [ %g1 + %o0 ], %g1 buf[i] = node->info.sym_link.name[i]; 200305c: c2 2a 40 02 stb %g1, [ %o1 + %g2 ] node = loc->node_access; IMFS_assert( node->control->imfs_type == IMFS_SYM_LINK ); for( i=0; ((iinfo.sym_link.name[i] != '\0')); i++ ) 2003060: 90 02 20 01 inc %o0 2003064: 80 a2 00 0a cmp %o0, %o2 2003068: 12 bf ff f8 bne 2003048 200306c: 84 10 00 08 mov %o0, %g2 buf[i] = node->info.sym_link.name[i]; return i; } 2003070: 81 c3 e0 08 retl 2003074: 01 00 00 00 nop 2003078: 81 c3 e0 08 retl <== NOT EXECUTED 200307c: 90 10 20 00 clr %o0 ! 0 <== NOT EXECUTED =============================================================================== 02003080 : const rtems_filesystem_location_info_t *oldloc, const rtems_filesystem_location_info_t *newparentloc, const char *name, size_t namelen ) { 2003080: 9d e3 bf 98 save %sp, -104, %sp int rv = 0; IMFS_jnode_t *node = oldloc->node_access; 2003084: fa 06 60 08 ld [ %i1 + 8 ], %i5 /* * FIXME: Due to insufficient checks we can create inaccessible nodes with * this operation. */ if ( node->Parent != NULL ) { 2003088: c2 07 60 08 ld [ %i5 + 8 ], %g1 200308c: 80 a0 60 00 cmp %g1, 0 2003090: 02 80 00 22 be 2003118 <== NEVER TAKEN 2003094: f4 06 a0 08 ld [ %i2 + 8 ], %i2 if ( namelen < IMFS_NAME_MAX ) { 2003098: 80 a7 20 1f cmp %i4, 0x1f 200309c: 18 80 00 19 bgu 2003100 <== NEVER TAKEN 20030a0: 94 10 00 1c mov %i4, %o2 memcpy( node->name, name, namelen ); 20030a4: 92 10 00 1b mov %i3, %o1 20030a8: 40 00 33 71 call 200fe6c 20030ac: 90 07 60 0c add %i5, 0xc, %o0 node->name [namelen] = '\0'; 20030b0: b8 07 40 1c add %i5, %i4, %i4 20030b4: c0 2f 20 0c clrb [ %i4 + 0xc ] { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 20030b8: c2 07 60 04 ld [ %i5 + 4 ], %g1 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 20030bc: c4 07 40 00 ld [ %i5 ], %g2 RTEMS_INLINE_ROUTINE void _Chain_Append_unprotected( Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); 20030c0: 86 06 a0 54 add %i2, 0x54, %g3 Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 20030c4: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 20030c8: c4 20 40 00 st %g2, [ %g1 ] Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 20030cc: c2 06 a0 58 ld [ %i2 + 0x58 ], %g1 static inline void IMFS_add_to_directory( IMFS_jnode_t *dir, IMFS_jnode_t *node ) { node->Parent = dir; 20030d0: f4 27 60 08 st %i2, [ %i5 + 8 ] the_node->next = tail; 20030d4: c6 27 40 00 st %g3, [ %i5 ] tail->previous = the_node; 20030d8: fa 26 a0 58 st %i5, [ %i2 + 0x58 ] old_last->next = the_node; 20030dc: fa 20 40 00 st %i5, [ %g1 ] the_node->previous = old_last; 20030e0: c2 27 60 04 st %g1, [ %i5 + 4 ] IMFS_remove_from_directory( node ); IMFS_add_to_directory( new_parent, node ); IMFS_update_ctime( node ); 20030e4: 90 07 bf f8 add %fp, -8, %o0 20030e8: 40 00 01 8c call 2003718 20030ec: 92 10 20 00 clr %o1 20030f0: c2 07 bf f8 ld [ %fp + -8 ], %g1 20030f4: c2 27 60 48 st %g1, [ %i5 + 0x48 ] const rtems_filesystem_location_info_t *newparentloc, const char *name, size_t namelen ) { int rv = 0; 20030f8: 81 c7 e0 08 ret 20030fc: 91 e8 20 00 restore %g0, 0, %o0 IMFS_remove_from_directory( node ); IMFS_add_to_directory( new_parent, node ); IMFS_update_ctime( node ); } else { errno = ENAMETOOLONG; 2003100: 40 00 31 0a call 200f528 <__errno> <== NOT EXECUTED 2003104: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003108: 82 10 20 5b mov 0x5b, %g1 <== NOT EXECUTED 200310c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003110: 81 c7 e0 08 ret <== NOT EXECUTED 2003114: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = EINVAL; 2003118: 40 00 31 04 call 200f528 <__errno> <== NOT EXECUTED 200311c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003120: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2003124: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2003128: 81 c7 e0 08 ret <== NOT EXECUTED 200312c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200321c : #endif #include "imfs.h" int IMFS_unmount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 200321c: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; IMFS_jnode_t *node = mt_entry->mt_point_node->location.node_access; 2003220: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2003224: c2 00 60 08 ld [ %g1 + 8 ], %g1 return node->control->imfs_type; } static inline bool IMFS_is_directory( const IMFS_jnode_t *node ) { return node->control->imfs_type == IMFS_DIRECTORY; 2003228: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 if ( IMFS_is_directory( node ) ) { 200322c: c4 00 80 00 ld [ %g2 ], %g2 2003230: 80 a0 a0 00 cmp %g2, 0 2003234: 12 80 00 0f bne 2003270 <== NEVER TAKEN 2003238: 01 00 00 00 nop if ( node->info.directory.mt_fs == mt_entry ) { 200323c: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 2003240: 80 a0 80 18 cmp %g2, %i0 2003244: 12 80 00 05 bne 2003258 <== NEVER TAKEN 2003248: 01 00 00 00 nop node->info.directory.mt_fs = NULL; 200324c: c0 20 60 5c clr [ %g1 + 0x5c ] #include "imfs.h" int IMFS_unmount( rtems_filesystem_mount_table_entry_t *mt_entry ) { int rv = 0; 2003250: 81 c7 e0 08 ret 2003254: 91 e8 20 00 restore %g0, 0, %o0 if ( IMFS_is_directory( node ) ) { if ( node->info.directory.mt_fs == mt_entry ) { node->info.directory.mt_fs = NULL; } else { errno = EINVAL; 2003258: 40 00 30 b4 call 200f528 <__errno> <== NOT EXECUTED 200325c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003260: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2003264: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003268: 81 c7 e0 08 ret <== NOT EXECUTED 200326c: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = ENOTDIR; 2003270: 40 00 30 ae call 200f528 <__errno> <== NOT EXECUTED 2003274: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003278: 82 10 20 14 mov 0x14, %g1 <== NOT EXECUTED 200327c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2003280: 81 c7 e0 08 ret <== NOT EXECUTED 2003284: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003918 : void RTEMS_Malloc_Initialize( const Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { 2003918: 9d e3 bf a0 save %sp, -96, %sp Heap_Control *heap = RTEMS_Malloc_Heap; if ( !rtems_configuration_get_unified_work_area() ) { 200391c: 03 00 80 68 sethi %hi(0x201a000), %g1 2003920: c2 08 60 99 ldub [ %g1 + 0x99 ], %g1 ! 201a099 const Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Control *heap = RTEMS_Malloc_Heap; 2003924: 05 00 80 70 sethi %hi(0x201c000), %g2 if ( !rtems_configuration_get_unified_work_area() ) { 2003928: 80 a0 60 00 cmp %g1, 0 200392c: 12 80 00 17 bne 2003988 2003930: f6 00 a0 e0 ld [ %g2 + 0xe0 ], %i3 Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t page_size = CPU_HEAP_ALIGNMENT; size_t i; for (i = 0; i < area_count; ++i) { 2003934: 80 a6 60 00 cmp %i1, 0 2003938: 02 80 00 23 be 20039c4 200393c: 21 00 80 23 sethi %hi(0x2008c00), %l0 2003940: ba 10 20 00 clr %i5 2003944: a0 14 21 fc or %l0, 0x1fc, %l0 2003948: b8 10 00 10 mov %l0, %i4 const Heap_Area *area = &areas [i]; uintptr_t space_available = (*init_or_extend)( 200394c: d2 06 00 00 ld [ %i0 ], %o1 2003950: d4 06 20 04 ld [ %i0 + 4 ], %o2 2003954: 90 10 00 1b mov %i3, %o0 2003958: 9f c7 00 00 call %i4 200395c: 96 10 20 08 mov 8, %o3 area->begin, area->size, page_size ); if ( space_available > 0 ) { 2003960: 80 a2 20 00 cmp %o0, 0 2003964: 32 80 00 02 bne,a 200396c <== ALWAYS TAKEN 2003968: b8 10 00 1a mov %i2, %i4 if ( !rtems_configuration_get_unified_work_area() ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t page_size = CPU_HEAP_ALIGNMENT; size_t i; for (i = 0; i < area_count; ++i) { 200396c: ba 07 60 01 inc %i5 2003970: 80 a7 40 19 cmp %i5, %i1 2003974: 12 bf ff f6 bne 200394c <== NEVER TAKEN 2003978: b0 06 20 08 add %i0, 8, %i0 if ( space_available > 0 ) { init_or_extend = extend; } } if ( init_or_extend == _Heap_Initialize ) { 200397c: 80 a7 00 10 cmp %i4, %l0 2003980: 02 80 00 12 be 20039c8 <== NEVER TAKEN 2003984: 90 10 20 00 clr %o0 } /* * If configured, initialize the statistics support */ if ( rtems_malloc_statistics_helpers != NULL ) { 2003988: 03 00 80 72 sethi %hi(0x201c800), %g1 200398c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 ! 201c834 2003990: 80 a0 60 00 cmp %g1, 0 2003994: 02 80 00 05 be 20039a8 2003998: 3b 00 80 72 sethi %hi(0x201c800), %i5 (*rtems_malloc_statistics_helpers->initialize)(); 200399c: c2 00 40 00 ld [ %g1 ], %g1 20039a0: 9f c0 40 00 call %g1 20039a4: 01 00 00 00 nop } MSBUMP( space_available, _Protected_heap_Get_size( heap ) ); 20039a8: f8 07 62 f8 ld [ %i5 + 0x2f8 ], %i4 20039ac: 40 00 18 27 call 2009a48 <_Protected_heap_Get_size> 20039b0: 90 10 00 1b mov %i3, %o0 20039b4: 90 02 00 1c add %o0, %i4, %o0 20039b8: d0 27 62 f8 st %o0, [ %i5 + 0x2f8 ] 20039bc: 81 c7 e0 08 ret 20039c0: 81 e8 00 00 restore init_or_extend = extend; } } if ( init_or_extend == _Heap_Initialize ) { _Internal_error_Occurred( 20039c4: 90 10 20 00 clr %o0 20039c8: 92 10 20 01 mov 1, %o1 20039cc: 40 00 15 a9 call 2009070 <_Internal_error_Occurred> 20039d0: 94 10 20 17 mov 0x17, %o2 =============================================================================== 02025304 : static rtems_printk_plugin_t print_handler; static void Stack_check_Dump_threads_usage( Thread_Control *the_thread ) { 2025304: 9d e3 bf 98 save %sp, -104, %sp /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { 2025308: 80 a6 3f ff cmp %i0, -1 202530c: 02 80 00 56 be 2025464 2025310: ba 06 20 b0 add %i0, 0xb0, %i5 current = 0; } else #endif { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); 2025314: e2 06 21 38 ld [ %i0 + 0x138 ], %l1 2025318: f8 06 20 b4 ld [ %i0 + 0xb4 ], %i4 } low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); 202531c: f4 07 40 00 ld [ %i5 ], %i2 /* * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; 2025320: 82 07 20 20 add %i4, 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); 2025324: b4 06 bf f0 add %i2, -16, %i2 * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) 2025328: 86 0e bf fc and %i2, -4, %g3 202532c: 86 00 40 03 add %g1, %g3, %g3 2025330: 80 a0 40 03 cmp %g1, %g3 2025334: 1a 80 00 10 bcc 2025374 <== NEVER TAKEN 2025338: 05 29 69 69 sethi %hi(0xa5a5a400), %g2 if (*base != U32_PATTERN) 202533c: c8 07 20 20 ld [ %i4 + 0x20 ], %g4 2025340: 84 10 a1 a5 or %g2, 0x1a5, %g2 2025344: 80 a1 00 02 cmp %g4, %g2 2025348: 22 80 00 08 be,a 2025368 <== ALWAYS TAKEN 202534c: 82 00 60 04 add %g1, 4, %g1 { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); } low = Stack_check_usable_stack_start(stack); 2025350: 10 80 00 37 b 202542c <== NOT EXECUTED 2025354: a0 07 20 10 add %i4, 0x10, %l0 <== NOT EXECUTED * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) if (*base != U32_PATTERN) 2025358: 80 a0 80 04 cmp %g2, %g4 202535c: 12 80 00 34 bne 202542c 2025360: a0 07 20 10 add %i4, 0x10, %l0 * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; for (ebase = base + length; base < ebase; base++) 2025364: 82 00 60 04 add %g1, 4, %g1 2025368: 80 a0 c0 01 cmp %g3, %g1 202536c: 38 bf ff fb bgu,a 2025358 <== ALWAYS TAKEN 2025370: c4 00 40 00 ld [ %g1 ], %g2 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025374: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED 2025378: 02 80 00 31 be 202543c <== NOT EXECUTED 202537c: a0 10 20 00 clr %l0 <== NOT EXECUTED #endif { (*print_handler)( 2025380: f2 06 20 08 ld [ %i0 + 8 ], %i1 2025384: 39 00 81 95 sethi %hi(0x2065400), %i4 2025388: 37 00 81 95 sethi %hi(0x2065400), %i3 202538c: e4 07 20 9c ld [ %i4 + 0x9c ], %l2 2025390: f0 06 e0 a0 ld [ %i3 + 0xa0 ], %i0 2025394: 94 07 bf f8 add %fp, -8, %o2 2025398: 92 10 20 05 mov 5, %o1 202539c: 7f ff a8 56 call 200f4f4 20253a0: 90 10 00 19 mov %i1, %o0 20253a4: 13 00 81 71 sethi %hi(0x205c400), %o1 20253a8: 96 10 00 08 mov %o0, %o3 20253ac: 94 10 00 19 mov %i1, %o2 20253b0: 90 10 00 12 mov %l2, %o0 20253b4: 9f c6 00 00 call %i0 20253b8: 92 12 60 e8 or %o1, 0xe8, %o1 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 20253bc: d4 07 60 04 ld [ %i5 + 4 ], %o2 20253c0: d6 07 40 00 ld [ %i5 ], %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 20253c4: c4 06 e0 a0 ld [ %i3 + 0xa0 ], %g2 20253c8: d0 07 20 9c ld [ %i4 + 0x9c ], %o0 print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 20253cc: 96 02 ff ff add %o3, -1, %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 20253d0: 13 00 81 71 sethi %hi(0x205c400), %o1 20253d4: 96 02 80 0b add %o2, %o3, %o3 20253d8: 92 12 61 08 or %o1, 0x108, %o1 20253dc: 98 10 00 11 mov %l1, %o4 20253e0: 9f c0 80 00 call %g2 20253e4: 9a 10 00 1a mov %i2, %o5 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 20253e8: 05 00 81 95 sethi %hi(0x2065400), %g2 20253ec: c4 00 a0 98 ld [ %g2 + 0x98 ], %g2 ! 2065498 (*print_handler)( print_context, "Unavailable\n" ); 20253f0: c2 06 e0 a0 ld [ %i3 + 0xa0 ], %g1 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 20253f4: 80 a0 a0 00 cmp %g2, 0 20253f8: 12 80 00 07 bne 2025414 <== ALWAYS TAKEN 20253fc: d0 07 20 9c ld [ %i4 + 0x9c ], %o0 (*print_handler)( print_context, "Unavailable\n" ); 2025400: 13 00 81 71 sethi %hi(0x205c400), %o1 <== NOT EXECUTED 2025404: 9f c0 40 00 call %g1 <== NOT EXECUTED 2025408: 92 12 61 28 or %o1, 0x128, %o1 ! 205c528 <== NOT EXECUTED 202540c: 81 c7 e0 08 ret <== NOT EXECUTED 2025410: 81 e8 00 00 restore <== NOT EXECUTED } else { (*print_handler)( print_context, "%8" PRId32 "\n", used ); 2025414: 94 10 00 10 mov %l0, %o2 2025418: 13 00 81 71 sethi %hi(0x205c400), %o1 202541c: 9f c0 40 00 call %g1 2025420: 92 12 61 38 or %o1, 0x138, %o1 ! 205c538 2025424: 81 c7 e0 08 ret 2025428: 81 e8 00 00 restore else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 202542c: 80 a6 20 00 cmp %i0, 0 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 ); 2025430: a0 04 00 1a add %l0, %i2, %l0 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025434: 12 bf ff d3 bne 2025380 2025438: a0 24 00 01 sub %l0, %g1, %l0 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 ); 202543c: 37 00 81 95 sethi %hi(0x2065400), %i3 2025440: 39 00 81 95 sethi %hi(0x2065400), %i4 2025444: c2 06 e0 a0 ld [ %i3 + 0xa0 ], %g1 2025448: d0 07 20 9c ld [ %i4 + 0x9c ], %o0 202544c: 94 10 3f ff mov -1, %o2 2025450: 13 00 81 71 sethi %hi(0x205c400), %o1 2025454: 9f c0 40 00 call %g1 2025458: 92 12 60 f8 or %o1, 0xf8, %o1 ! 205c4f8 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 202545c: 10 bf ff d9 b 20253c0 2025460: d4 07 60 04 ld [ %i5 + 4 ], %o2 /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { if (!Stack_check_Interrupt_stack.area) 2025464: 3b 00 81 97 sethi %hi(0x2065c00), %i5 2025468: ba 17 63 ec or %i5, 0x3ec, %i5 ! 2065fec 202546c: f8 07 60 04 ld [ %i5 + 4 ], %i4 2025470: 80 a7 20 00 cmp %i4, 0 2025474: 02 bf ff e6 be 202540c <== NEVER TAKEN 2025478: a2 10 20 00 clr %l1 return; stack = &Stack_check_Interrupt_stack; the_thread = 0; 202547c: 10 bf ff a8 b 202531c 2025480: b0 10 20 00 clr %i0 =============================================================================== 02025578 : Thread_Control *running, bool pattern_ok ) RTEMS_COMPILER_NO_RETURN_ATTRIBUTE; void Stack_check_report_blown_task(Thread_Control *running, bool pattern_ok) { 2025578: 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"); 202557c: 11 00 81 71 sethi %hi(0x205c400), %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); 2025580: fa 06 20 b4 ld [ %i0 + 0xb4 ], %i5 char name[32]; printk("BLOWN STACK!!!\n"); 2025584: 7f ff 7b 51 call 20042c8 2025588: 90 12 21 40 or %o0, 0x140, %o0 printk("task control block: 0x%08" PRIxPTR "\n", running); 202558c: 92 10 00 18 mov %i0, %o1 2025590: 11 00 81 71 sethi %hi(0x205c400), %o0 2025594: 7f ff 7b 4d call 20042c8 2025598: 90 12 21 50 or %o0, 0x150, %o0 ! 205c550 printk("task ID: 0x%08lx\n", (unsigned long) running->Object.id); 202559c: d2 06 20 08 ld [ %i0 + 8 ], %o1 20255a0: 11 00 81 71 sethi %hi(0x205c400), %o0 20255a4: 7f ff 7b 49 call 20042c8 20255a8: 90 12 21 70 or %o0, 0x170, %o0 ! 205c570 printk( 20255ac: d2 06 20 0c ld [ %i0 + 0xc ], %o1 20255b0: 11 00 81 71 sethi %hi(0x205c400), %o0 20255b4: 7f ff 7b 45 call 20042c8 20255b8: 90 12 21 88 or %o0, 0x188, %o0 ! 205c588 "task name: 0x%08" PRIx32 "\n", running->Object.name.name_u32 ); printk( 20255bc: d0 06 20 08 ld [ %i0 + 8 ], %o0 20255c0: 94 07 bf e0 add %fp, -32, %o2 20255c4: 7f ff a7 cc call 200f4f4 20255c8: 92 10 20 20 mov 0x20, %o1 20255cc: 92 10 00 08 mov %o0, %o1 20255d0: 11 00 81 71 sethi %hi(0x205c400), %o0 20255d4: 7f ff 7b 3d call 20042c8 20255d8: 90 12 21 a0 or %o0, 0x1a0, %o0 ! 205c5a0 ); printk( "task stack area (%lu Bytes): 0x%08" PRIxPTR " .. 0x%08" PRIxPTR "\n", (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) 20255dc: d4 06 20 b4 ld [ %i0 + 0xb4 ], %o2 20255e0: d2 06 20 b0 ld [ %i0 + 0xb0 ], %o1 ); printk( "task name string: %s\n", rtems_object_get_name(running->Object.id, sizeof(name), name) ); printk( 20255e4: 11 00 81 71 sethi %hi(0x205c400), %o0 20255e8: 96 02 80 09 add %o2, %o1, %o3 20255ec: 7f ff 7b 37 call 20042c8 20255f0: 90 12 21 b8 or %o0, 0x1b8, %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) { 20255f4: 80 a6 60 00 cmp %i1, 0 20255f8: 02 80 00 05 be 202560c <== ALWAYS TAKEN 20255fc: 92 10 20 10 mov 0x10, %o1 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal( 2025600: d2 06 20 0c ld [ %i0 + 0xc ], %o1 <== NOT EXECUTED 2025604: 7f ff 8a 8f call 2008040 2025608: 90 10 20 09 mov 9, %o0 (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) ); if (!pattern_ok) { printk( 202560c: 11 00 81 71 sethi %hi(0x205c400), %o0 2025610: 94 07 60 08 add %i5, 8, %o2 2025614: 90 12 21 e8 or %o0, 0x1e8, %o0 2025618: 7f ff 7b 2c call 20042c8 202561c: 96 07 60 18 add %i5, 0x18, %o3 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal( 2025620: 10 bf ff f9 b 2025604 2025624: d2 06 20 0c ld [ %i0 + 0xc ], %o1 =============================================================================== 020084dc <_API_extensions_Add_post_switch>: */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 20084dc: c2 02 00 00 ld [ %o0 ], %g1 20084e0: 80 a0 60 00 cmp %g1, 0 20084e4: 22 80 00 04 be,a 20084f4 <_API_extensions_Add_post_switch+0x18> 20084e8: c2 02 20 04 ld [ %o0 + 4 ], %g1 20084ec: 81 c3 e0 08 retl 20084f0: 01 00 00 00 nop 20084f4: 80 a0 60 00 cmp %g1, 0 20084f8: 12 bf ff fd bne 20084ec <_API_extensions_Add_post_switch+0x10><== NEVER TAKEN 20084fc: 03 00 80 73 sethi %hi(0x201cc00), %g1 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 2008500: 82 10 60 f4 or %g1, 0xf4, %g1 ! 201ccf4 <_API_extensions_Post_switch_list> 2008504: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_node->next = tail; 2008508: 86 00 60 04 add %g1, 4, %g3 tail->previous = the_node; 200850c: d0 20 60 08 st %o0, [ %g1 + 8 ] ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; the_node->next = tail; 2008510: c6 22 00 00 st %g3, [ %o0 ] tail->previous = the_node; old_last->next = the_node; 2008514: d0 20 80 00 st %o0, [ %g2 ] the_node->previous = old_last; 2008518: 81 c3 e0 08 retl 200851c: c4 22 20 04 st %g2, [ %o0 + 4 ] =============================================================================== 02008520 <_API_extensions_Run_postdriver>: } } #endif void _API_extensions_Run_postdriver( void ) { 2008520: 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; 2008524: 39 00 80 73 sethi %hi(0x201cc00), %i4 2008528: fa 07 22 48 ld [ %i4 + 0x248 ], %i5 ! 201ce48 <_API_extensions_List> 200852c: b8 17 22 48 or %i4, 0x248, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2008530: b8 07 20 04 add %i4, 4, %i4 2008534: 80 a7 40 1c cmp %i5, %i4 2008538: 02 80 00 09 be 200855c <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 200853c: 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)(); 2008540: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008544: 9f c0 40 00 call %g1 2008548: 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 ) { 200854c: 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 ); 2008550: 80 a7 40 1c cmp %i5, %i4 2008554: 32 bf ff fc bne,a 2008544 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 2008558: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 200855c: 81 c7 e0 08 ret 2008560: 81 e8 00 00 restore =============================================================================== 02011b84 <_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 ) { 2011b84: 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; 2011b88: 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; 2011b8c: f4 26 20 44 st %i2, [ %i0 + 0x44 ] /* * Check if allocated_message_size is aligned to uintptr-size boundary. * If not, it will increase allocated_message_size to multiplicity of pointer * size. */ if (allocated_message_size & (sizeof(uintptr_t) - 1)) { 2011b90: 80 8e e0 03 btst 3, %i3 2011b94: 02 80 00 0b be 2011bc0 <_CORE_message_queue_Initialize+0x3c> 2011b98: f6 26 20 4c st %i3, [ %i0 + 0x4c ] allocated_message_size += sizeof(uintptr_t); 2011b9c: 96 06 e0 04 add %i3, 4, %o3 allocated_message_size &= ~(sizeof(uintptr_t) - 1); 2011ba0: 96 0a ff fc and %o3, -4, %o3 /* * Check for an overflow. It can occur while increasing allocated_message_size * to multiplicity of uintptr_t above. */ if (allocated_message_size < maximum_message_size) 2011ba4: 80 a6 c0 0b cmp %i3, %o3 2011ba8: 08 80 00 08 bleu 2011bc8 <_CORE_message_queue_Initialize+0x44> 2011bac: ba 02 e0 10 add %o3, 0x10, %i5 return false; 2011bb0: b0 10 20 00 clr %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011bb4: b0 0e 20 01 and %i0, 1, %i0 2011bb8: 81 c7 e0 08 ret 2011bbc: 81 e8 00 00 restore /* * Check if allocated_message_size is aligned to uintptr-size boundary. * If not, it will increase allocated_message_size to multiplicity of pointer * size. */ if (allocated_message_size & (sizeof(uintptr_t) - 1)) { 2011bc0: 96 10 00 1b mov %i3, %o3 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2011bc4: ba 02 e0 10 add %o3, 0x10, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2011bc8: 90 10 20 00 clr %o0 2011bcc: 92 10 00 1a mov %i2, %o1 2011bd0: 94 10 20 00 clr %o2 2011bd4: 40 00 41 5f call 2022150 <__muldi3> 2011bd8: 96 10 00 1d mov %i5, %o3 if ( x > SIZE_MAX ) 2011bdc: 80 a2 20 00 cmp %o0, 0 2011be0: 34 bf ff f5 bg,a 2011bb4 <_CORE_message_queue_Initialize+0x30> 2011be4: b0 10 20 00 clr %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2011be8: 40 00 0c c0 call 2014ee8 <_Workspace_Allocate> 2011bec: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2011bf0: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2011bf4: 80 a2 20 00 cmp %o0, 0 2011bf8: 02 bf ff ee be 2011bb0 <_CORE_message_queue_Initialize+0x2c><== NEVER TAKEN 2011bfc: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2011c00: 90 06 20 60 add %i0, 0x60, %o0 2011c04: 94 10 00 1a mov %i2, %o2 2011c08: 7f ff ff c6 call 2011b20 <_Chain_Initialize> 2011c0c: 96 10 00 1d mov %i5, %o3 */ RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority( CORE_message_queue_Attributes *the_attribute ) { return 2011c10: 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 ); 2011c14: 82 06 20 50 add %i0, 0x50, %g1 2011c18: 84 18 a0 01 xor %g2, 1, %g2 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2011c1c: 80 a0 00 02 cmp %g0, %g2 2011c20: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2011c24: 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; 2011c28: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2011c2c: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2011c30: c0 26 20 54 clr [ %i0 + 0x54 ] 2011c34: 92 60 3f ff subx %g0, -1, %o1 2011c38: 94 10 20 80 mov 0x80, %o2 2011c3c: 96 10 20 06 mov 6, %o3 2011c40: 40 00 0a 56 call 2014598 <_Thread_queue_Initialize> 2011c44: b0 10 20 01 mov 1, %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011c48: b0 0e 20 01 and %i0, 1, %i0 2011c4c: 81 c7 e0 08 ret 2011c50: 81 e8 00 00 restore =============================================================================== 02008880 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2008880: 9d e3 bf a0 save %sp, -96, %sp * This routine returns true if thread dispatch indicates * that we are in a critical section. */ RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void) { if ( _Thread_Dispatch_disable_level == 0 ) 2008884: 3b 00 80 73 sethi %hi(0x201cc00), %i5 2008888: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 ! 201cc80 <_Thread_Dispatch_disable_level> 200888c: 80 a0 60 00 cmp %g1, 0 2008890: 02 80 00 1f be 200890c <_CORE_mutex_Seize+0x8c> 2008894: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2008898: 80 a6 a0 00 cmp %i2, 0 200889c: 02 80 00 2c be 200894c <_CORE_mutex_Seize+0xcc> 20088a0: 90 10 00 18 mov %i0, %o0 20088a4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20088a8: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ce8c <_System_state_Current> 20088ac: 80 a0 60 01 cmp %g1, 1 20088b0: 38 80 00 2e bgu,a 2008968 <_CORE_mutex_Seize+0xe8> 20088b4: 90 10 20 00 clr %o0 20088b8: 40 00 12 d0 call 200d3f8 <_CORE_mutex_Seize_interrupt_trylock> 20088bc: 92 07 a0 54 add %fp, 0x54, %o1 20088c0: 80 a2 20 00 cmp %o0, 0 20088c4: 02 80 00 27 be 2008960 <_CORE_mutex_Seize+0xe0> <== ALWAYS TAKEN 20088c8: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 20088cc: c4 07 60 80 ld [ %i5 + 0x80 ], %g2 20088d0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20088d4: c2 00 62 a0 ld [ %g1 + 0x2a0 ], %g1 ! 201cea0 <_Per_CPU_Information+0x10> RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 20088d8: 86 10 20 01 mov 1, %g3 20088dc: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 20088e0: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 20088e4: f2 20 60 20 st %i1, [ %g1 + 0x20 ] ++level; 20088e8: 82 00 a0 01 add %g2, 1, %g1 _Thread_Dispatch_disable_level = level; 20088ec: c2 27 60 80 st %g1, [ %i5 + 0x80 ] 20088f0: 7f ff e7 4b call 200261c 20088f4: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20088f8: 90 10 00 18 mov %i0, %o0 20088fc: 7f ff ff ba call 20087e4 <_CORE_mutex_Seize_interrupt_blocking> 2008900: 92 10 00 1b mov %i3, %o1 2008904: 81 c7 e0 08 ret 2008908: 81 e8 00 00 restore 200890c: 90 10 00 18 mov %i0, %o0 2008910: 40 00 12 ba call 200d3f8 <_CORE_mutex_Seize_interrupt_trylock> 2008914: 92 07 a0 54 add %fp, 0x54, %o1 2008918: 80 a2 20 00 cmp %o0, 0 200891c: 02 bf ff fa be 2008904 <_CORE_mutex_Seize+0x84> 2008920: 80 a6 a0 00 cmp %i2, 0 2008924: 12 bf ff ea bne 20088cc <_CORE_mutex_Seize+0x4c> 2008928: 01 00 00 00 nop 200892c: 7f ff e7 3c call 200261c 2008930: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008934: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008938: c2 00 62 a0 ld [ %g1 + 0x2a0 ], %g1 ! 201cea0 <_Per_CPU_Information+0x10> 200893c: 84 10 20 01 mov 1, %g2 2008940: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2008944: 81 c7 e0 08 ret 2008948: 81 e8 00 00 restore 200894c: 40 00 12 ab call 200d3f8 <_CORE_mutex_Seize_interrupt_trylock> 2008950: 92 07 a0 54 add %fp, 0x54, %o1 2008954: 80 a2 20 00 cmp %o0, 0 2008958: 12 bf ff f5 bne 200892c <_CORE_mutex_Seize+0xac> <== NEVER TAKEN 200895c: 01 00 00 00 nop 2008960: 81 c7 e0 08 ret 2008964: 81 e8 00 00 restore 2008968: 92 10 20 00 clr %o1 200896c: 40 00 01 c1 call 2009070 <_Internal_error_Occurred> 2008970: 94 10 20 12 mov 0x12, %o2 =============================================================================== 02008af0 <_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 ) { 2008af0: 9d e3 bf a0 save %sp, -96, %sp 2008af4: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008af8: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008afc: 40 00 07 d8 call 200aa5c <_Thread_queue_Dequeue> 2008b00: 90 10 00 1d mov %i5, %o0 2008b04: 80 a2 20 00 cmp %o0, 0 2008b08: 02 80 00 04 be 2008b18 <_CORE_semaphore_Surrender+0x28> 2008b0c: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2008b10: 81 c7 e0 08 ret 2008b14: 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 ); 2008b18: 7f ff e6 bd call 200260c 2008b1c: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2008b20: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008b24: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008b28: 80 a0 40 02 cmp %g1, %g2 2008b2c: 1a 80 00 05 bcc 2008b40 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2008b30: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008b34: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008b38: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008b3c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2008b40: 7f ff e6 b7 call 200261c 2008b44: 01 00 00 00 nop } return status; } 2008b48: 81 c7 e0 08 ret 2008b4c: 81 e8 00 00 restore =============================================================================== 020086b0 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 20086b0: 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; 20086b4: 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 ); 20086b8: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 20086bc: 80 a6 a0 00 cmp %i2, 0 20086c0: 02 80 00 13 be 200870c <_Chain_Initialize+0x5c> <== NEVER TAKEN 20086c4: 92 06 bf ff add %i2, -1, %o1 20086c8: 86 10 00 09 mov %o1, %g3 20086cc: 82 10 00 19 mov %i1, %g1 20086d0: 84 10 00 18 mov %i0, %g2 current->next = next; 20086d4: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 20086d8: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 20086dc: 86 00 ff ff add %g3, -1, %g3 20086e0: 84 10 00 01 mov %g1, %g2 20086e4: 80 a0 ff ff cmp %g3, -1 20086e8: 12 bf ff fb bne 20086d4 <_Chain_Initialize+0x24> 20086ec: 82 00 40 1b add %g1, %i3, %g1 #include #include #include #include void _Chain_Initialize( 20086f0: 40 00 3e d1 call 2018234 <.umul> 20086f4: 90 10 00 1b mov %i3, %o0 20086f8: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 20086fc: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 2008700: d0 26 20 08 st %o0, [ %i0 + 8 ] 2008704: 81 c7 e0 08 ret 2008708: 81 e8 00 00 restore ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 200870c: 10 bf ff fc b 20086fc <_Chain_Initialize+0x4c> <== NOT EXECUTED 2008710: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED =============================================================================== 020076cc <_Event_Surrender>: rtems_event_set event_in, Event_Control *event, Thread_blocking_operation_States *sync_state, States_Control wait_state ) { 20076cc: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set seized_events; rtems_option option_set; option_set = the_thread->Wait.option; _ISR_Disable( level ); 20076d0: 7f ff eb cf call 200260c 20076d4: fa 06 20 30 ld [ %i0 + 0x30 ], %i5 RTEMS_INLINE_ROUTINE void _Event_sets_Post( rtems_event_set the_new_events, rtems_event_set *the_event_set ) { *the_event_set |= the_new_events; 20076d8: c2 06 80 00 ld [ %i2 ], %g1 20076dc: b2 16 40 01 or %i1, %g1, %i1 20076e0: f2 26 80 00 st %i1, [ %i2 ] _Event_sets_Post( event_in, &event->pending_events ); pending_events = event->pending_events; event_condition = the_thread->Wait.count; 20076e4: 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 ) ) { 20076e8: 84 8e 40 01 andcc %i1, %g1, %g2 20076ec: 02 80 00 35 be 20077c0 <_Event_Surrender+0xf4> 20076f0: 07 00 80 73 sethi %hi(0x201cc00), %g3 /* * 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() && 20076f4: 86 10 e2 90 or %g3, 0x290, %g3 ! 201ce90 <_Per_CPU_Information> 20076f8: c8 00 e0 08 ld [ %g3 + 8 ], %g4 20076fc: 80 a1 20 00 cmp %g4, 0 2007700: 32 80 00 1c bne,a 2007770 <_Event_Surrender+0xa4> 2007704: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 RTEMS_INLINE_ROUTINE bool _States_Are_set ( States_Control the_states, States_Control mask ) { return ( (the_states & mask) != STATES_READY); 2007708: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Are_set( the_thread->current_state, wait_state ) ) { 200770c: 80 8f 00 03 btst %i4, %g3 2007710: 02 80 00 2c be 20077c0 <_Event_Surrender+0xf4> 2007714: 80 a0 40 02 cmp %g1, %g2 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 2007718: 02 80 00 04 be 2007728 <_Event_Surrender+0x5c> 200771c: 80 8f 60 02 btst 2, %i5 2007720: 02 80 00 28 be 20077c0 <_Event_Surrender+0xf4> <== NEVER TAKEN 2007724: 01 00 00 00 nop event->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007728: 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) ); 200772c: b2 2e 40 02 andn %i1, %g2, %i1 /* * Otherwise, this is a normal send to another thread */ if ( _States_Are_set( the_thread->current_state, wait_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { event->pending_events = _Event_sets_Clear( 2007730: f2 26 80 00 st %i1, [ %i2 ] pending_events, seized_events ); the_thread->Wait.count = 0; 2007734: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007738: c4 20 40 00 st %g2, [ %g1 ] _ISR_Flash( level ); 200773c: 7f ff eb b8 call 200261c 2007740: 01 00 00 00 nop 2007744: 7f ff eb b2 call 200260c 2007748: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 200774c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 2007750: 80 a0 60 02 cmp %g1, 2 2007754: 02 80 00 1d be 20077c8 <_Event_Surrender+0xfc> 2007758: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 200775c: 7f ff eb b0 call 200261c 2007760: 33 04 01 ff sethi %hi(0x1007fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007764: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 2007768: 40 00 0a d8 call 200a2c8 <_Thread_Clear_state> 200776c: 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() && 2007770: 80 a6 00 03 cmp %i0, %g3 2007774: 32 bf ff e6 bne,a 200770c <_Event_Surrender+0x40> 2007778: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 _Thread_Is_executing( the_thread ) && ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200777c: c6 06 c0 00 ld [ %i3 ], %g3 2007780: 86 00 ff ff add %g3, -1, %g3 /* * 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 ) && 2007784: 80 a0 e0 01 cmp %g3, 1 2007788: 38 bf ff e1 bgu,a 200770c <_Event_Surrender+0x40> 200778c: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2007790: 80 a0 40 02 cmp %g1, %g2 2007794: 02 80 00 04 be 20077a4 <_Event_Surrender+0xd8> 2007798: 80 8f 60 02 btst 2, %i5 200779c: 02 80 00 09 be 20077c0 <_Event_Surrender+0xf4> <== NEVER TAKEN 20077a0: 01 00 00 00 nop event->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20077a4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 20077a8: b2 2e 40 02 andn %i1, %g2, %i1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { event->pending_events = _Event_sets_Clear( 20077ac: f2 26 80 00 st %i1, [ %i2 ] pending_events, seized_events ); the_thread->Wait.count = 0; 20077b0: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20077b4: c4 20 40 00 st %g2, [ %g1 ] *sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 20077b8: 82 10 20 03 mov 3, %g1 20077bc: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 20077c0: 7f ff eb 97 call 200261c 20077c4: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 20077c8: 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 ); 20077cc: 7f ff eb 94 call 200261c 20077d0: 33 04 01 ff sethi %hi(0x1007fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 20077d4: 40 00 0f 66 call 200b56c <_Watchdog_Remove> 20077d8: 90 06 20 48 add %i0, 0x48, %o0 20077dc: b2 16 63 f8 or %i1, 0x3f8, %i1 20077e0: 40 00 0a ba call 200a2c8 <_Thread_Clear_state> 20077e4: 81 e8 00 00 restore =============================================================================== 020077e8 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *arg ) { 20077e8: 9d e3 bf 98 save %sp, -104, %sp ISR_Level level; Thread_blocking_operation_States *sync_state; sync_state = arg; the_thread = _Thread_Get( id, &location ); 20077ec: 90 10 00 18 mov %i0, %o0 20077f0: 40 00 0b c7 call 200a70c <_Thread_Get> 20077f4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20077f8: c2 07 bf fc ld [ %fp + -4 ], %g1 20077fc: 80 a0 60 00 cmp %g1, 0 2007800: 12 80 00 15 bne 2007854 <_Event_Timeout+0x6c> <== NEVER TAKEN 2007804: 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 ); 2007808: 7f ff eb 81 call 200260c 200780c: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007810: 03 00 80 73 sethi %hi(0x201cc00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2007814: c2 00 62 a0 ld [ %g1 + 0x2a0 ], %g1 ! 201cea0 <_Per_CPU_Information+0x10> 2007818: 80 a7 40 01 cmp %i5, %g1 200781c: 02 80 00 10 be 200785c <_Event_Timeout+0x74> 2007820: c0 27 60 24 clr [ %i5 + 0x24 ] if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) *sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2007824: 82 10 20 06 mov 6, %g1 2007828: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 200782c: 7f ff eb 7c call 200261c 2007830: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007834: 90 10 00 1d mov %i5, %o0 2007838: 13 04 01 ff sethi %hi(0x1007fc00), %o1 200783c: 40 00 0a a3 call 200a2c8 <_Thread_Clear_state> 2007840: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1007fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 2007844: 03 00 80 73 sethi %hi(0x201cc00), %g1 2007848: c4 00 60 80 ld [ %g1 + 0x80 ], %g2 ! 201cc80 <_Thread_Dispatch_disable_level> --level; 200784c: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 2007850: c4 20 60 80 st %g2, [ %g1 + 0x80 ] 2007854: 81 c7 e0 08 ret 2007858: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 200785c: c2 06 40 00 ld [ %i1 ], %g1 2007860: 80 a0 60 01 cmp %g1, 1 2007864: 12 bf ff f1 bne 2007828 <_Event_Timeout+0x40> 2007868: 82 10 20 06 mov 6, %g1 *sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 200786c: 82 10 20 02 mov 2, %g1 2007870: 10 bf ff ed b 2007824 <_Event_Timeout+0x3c> 2007874: c2 26 40 00 st %g1, [ %i1 ] =============================================================================== 0200d538 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d538: 9d e3 bf 98 save %sp, -104, %sp Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200d53c: a2 06 60 04 add %i1, 4, %l1 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d540: a0 10 00 18 mov %i0, %l0 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200d544: 80 a6 40 11 cmp %i1, %l1 200d548: 18 80 00 85 bgu 200d75c <_Heap_Allocate_aligned_with_boundary+0x224> 200d54c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200d550: 80 a6 e0 00 cmp %i3, 0 200d554: 12 80 00 7c bne 200d744 <_Heap_Allocate_aligned_with_boundary+0x20c> 200d558: 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; 200d55c: fa 04 20 08 ld [ %l0 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d560: 80 a4 00 1d cmp %l0, %i5 200d564: 02 80 00 18 be 200d5c4 <_Heap_Allocate_aligned_with_boundary+0x8c> 200d568: b8 10 20 00 clr %i4 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; 200d56c: ac 10 20 04 mov 4, %l6 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 200d570: ae 05 60 07 add %l5, 7, %l7 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d574: ac 25 80 19 sub %l6, %i1, %l6 200d578: 10 80 00 0b b 200d5a4 <_Heap_Allocate_aligned_with_boundary+0x6c> 200d57c: ec 27 bf fc st %l6, [ %fp + -4 ] * 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 ) { 200d580: 12 80 00 18 bne 200d5e0 <_Heap_Allocate_aligned_with_boundary+0xa8> 200d584: b0 07 60 08 add %i5, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d588: 80 a6 20 00 cmp %i0, 0 200d58c: 12 80 00 4d bne 200d6c0 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN 200d590: b8 07 20 01 inc %i4 break; } block = block->next; 200d594: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d598: 80 a4 00 1d cmp %l0, %i5 200d59c: 22 80 00 0b be,a 200d5c8 <_Heap_Allocate_aligned_with_boundary+0x90> 200d5a0: c2 04 20 44 ld [ %l0 + 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 ) { 200d5a4: c2 07 60 04 ld [ %i5 + 4 ], %g1 200d5a8: 80 a4 40 01 cmp %l1, %g1 200d5ac: 0a bf ff f5 bcs 200d580 <_Heap_Allocate_aligned_with_boundary+0x48> 200d5b0: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200d5b4: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200d5b8: 80 a4 00 1d cmp %l0, %i5 200d5bc: 12 bf ff fa bne 200d5a4 <_Heap_Allocate_aligned_with_boundary+0x6c> 200d5c0: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d5c4: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200d5c8: 80 a0 40 1c cmp %g1, %i4 200d5cc: 1a 80 00 03 bcc 200d5d8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d5d0: b0 10 20 00 clr %i0 stats->max_search = search_count; 200d5d4: f8 24 20 44 st %i4, [ %l0 + 0x44 ] } return (void *) alloc_begin; 200d5d8: 81 c7 e0 08 ret 200d5dc: 81 e8 00 00 restore uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200d5e0: e8 04 20 14 ld [ %l0 + 0x14 ], %l4 - 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; 200d5e4: a4 08 7f fe and %g1, -2, %l2 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; 200d5e8: c2 07 bf fc ld [ %fp + -4 ], %g1 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200d5ec: 84 25 c0 14 sub %l7, %l4, %g2 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; 200d5f0: a4 07 40 12 add %i5, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d5f4: 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; 200d5f8: b0 00 40 12 add %g1, %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 200d5fc: a4 00 80 12 add %g2, %l2, %l2 200d600: 40 00 2b f3 call 20185cc <.urem> 200d604: 90 10 00 18 mov %i0, %o0 200d608: 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 ) { 200d60c: 80 a4 80 18 cmp %l2, %i0 200d610: 1a 80 00 06 bcc 200d628 <_Heap_Allocate_aligned_with_boundary+0xf0> 200d614: a6 07 60 08 add %i5, 8, %l3 200d618: 90 10 00 12 mov %l2, %o0 200d61c: 40 00 2b ec call 20185cc <.urem> 200d620: 92 10 00 1a mov %i2, %o1 200d624: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200d628: 80 a6 e0 00 cmp %i3, 0 200d62c: 02 80 00 37 be 200d708 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200d630: 80 a4 c0 18 cmp %l3, %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; 200d634: 86 06 00 19 add %i0, %i1, %g3 200d638: 92 10 00 1b mov %i3, %o1 200d63c: 90 10 00 03 mov %g3, %o0 200d640: 40 00 2b e3 call 20185cc <.urem> 200d644: c6 27 bf f8 st %g3, [ %fp + -8 ] 200d648: c6 07 bf f8 ld [ %fp + -8 ], %g3 200d64c: 90 20 c0 08 sub %g3, %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 ) { 200d650: 80 a6 00 08 cmp %i0, %o0 200d654: 1a 80 00 2c bcc 200d704 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d658: a4 04 c0 19 add %l3, %i1, %l2 200d65c: 80 a2 00 03 cmp %o0, %g3 200d660: 2a 80 00 12 bcs,a 200d6a8 <_Heap_Allocate_aligned_with_boundary+0x170> 200d664: 80 a4 80 08 cmp %l2, %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 ) { 200d668: 10 80 00 28 b 200d708 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200d66c: 80 a4 c0 18 cmp %l3, %i0 200d670: 92 10 00 1a mov %i2, %o1 200d674: 40 00 2b d6 call 20185cc <.urem> 200d678: 90 10 00 18 mov %i0, %o0 200d67c: 92 10 00 1b mov %i3, %o1 200d680: b0 26 00 08 sub %i0, %o0, %i0 if ( boundary_line < boundary_floor ) { return 0; } alloc_begin = boundary_line - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200d684: ac 06 00 19 add %i0, %i1, %l6 200d688: 40 00 2b d1 call 20185cc <.urem> 200d68c: 90 10 00 16 mov %l6, %o0 200d690: 90 25 80 08 sub %l6, %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 ) { 200d694: 80 a2 00 16 cmp %o0, %l6 200d698: 1a 80 00 1b bcc 200d704 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d69c: 80 a6 00 08 cmp %i0, %o0 200d6a0: 1a 80 00 19 bcc 200d704 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d6a4: 80 a4 80 08 cmp %l2, %o0 if ( boundary_line < boundary_floor ) { 200d6a8: 08 bf ff f2 bleu 200d670 <_Heap_Allocate_aligned_with_boundary+0x138> 200d6ac: b0 22 00 19 sub %o0, %i1, %i0 return 0; 200d6b0: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d6b4: 80 a6 20 00 cmp %i0, 0 200d6b8: 02 bf ff b7 be 200d594 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN 200d6bc: 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; 200d6c0: c6 04 20 48 ld [ %l0 + 0x48 ], %g3 stats->searches += search_count; 200d6c4: c4 04 20 4c ld [ %l0 + 0x4c ], %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200d6c8: 86 00 e0 01 inc %g3 stats->searches += search_count; 200d6cc: 84 00 80 1c add %g2, %i4, %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200d6d0: c6 24 20 48 st %g3, [ %l0 + 0x48 ] stats->searches += search_count; 200d6d4: c4 24 20 4c st %g2, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200d6d8: 90 10 00 10 mov %l0, %o0 200d6dc: 92 10 00 1d mov %i5, %o1 200d6e0: 94 10 00 18 mov %i0, %o2 200d6e4: 7f ff ee 17 call 2008f40 <_Heap_Block_allocate> 200d6e8: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d6ec: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200d6f0: 80 a0 40 1c cmp %g1, %i4 200d6f4: 2a bf ff b9 bcs,a 200d5d8 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d6f8: f8 24 20 44 st %i4, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 200d6fc: 81 c7 e0 08 ret 200d700: 81 e8 00 00 restore 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 ) { 200d704: 80 a4 c0 18 cmp %l3, %i0 200d708: 18 bf ff ea bgu 200d6b0 <_Heap_Allocate_aligned_with_boundary+0x178> 200d70c: 82 10 3f f8 mov -8, %g1 200d710: 90 10 00 18 mov %i0, %o0 200d714: a4 20 40 1d sub %g1, %i5, %l2 200d718: 92 10 00 15 mov %l5, %o1 200d71c: 40 00 2b ac call 20185cc <.urem> 200d720: 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 ) { 200d724: 90 a4 80 08 subcc %l2, %o0, %o0 200d728: 02 bf ff 99 be 200d58c <_Heap_Allocate_aligned_with_boundary+0x54> 200d72c: 80 a6 20 00 cmp %i0, 0 200d730: 80 a2 00 14 cmp %o0, %l4 200d734: 1a bf ff 96 bcc 200d58c <_Heap_Allocate_aligned_with_boundary+0x54> 200d738: 80 a6 20 00 cmp %i0, 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 ) { if ( boundary_line < boundary_floor ) { return 0; 200d73c: 10 bf ff de b 200d6b4 <_Heap_Allocate_aligned_with_boundary+0x17c> 200d740: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200d744: 18 80 00 06 bgu 200d75c <_Heap_Allocate_aligned_with_boundary+0x224> 200d748: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200d74c: 22 bf ff 84 be,a 200d55c <_Heap_Allocate_aligned_with_boundary+0x24> 200d750: b4 10 00 15 mov %l5, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200d754: 10 bf ff 83 b 200d560 <_Heap_Allocate_aligned_with_boundary+0x28> 200d758: fa 04 20 08 ld [ %l0 + 8 ], %i5 uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { /* Integer overflow occured */ return NULL; 200d75c: 81 c7 e0 08 ret 200d760: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200d770 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t unused __attribute__((unused)) ) { 200d770: 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; 200d774: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d778: c0 27 bf fc clr [ %fp + -4 ] Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t unused __attribute__((unused)) ) { 200d77c: b8 10 00 18 mov %i0, %i4 Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200d780: e2 06 20 20 ld [ %i0 + 0x20 ], %l1 Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; 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; 200d784: a0 06 40 1a add %i1, %i2, %l0 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; 200d788: e4 06 20 10 ld [ %i0 + 0x10 ], %l2 uintptr_t const min_block_size = heap->min_block_size; 200d78c: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const free_size = stats->free_size; uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200d790: 80 a6 40 10 cmp %i1, %l0 200d794: 08 80 00 04 bleu 200d7a4 <_Heap_Extend+0x34> 200d798: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 return 0; 200d79c: 81 c7 e0 08 ret 200d7a0: 91 e8 20 00 restore %g0, 0, %o0 } extend_area_ok = _Heap_Get_first_and_last_block( 200d7a4: 90 10 00 19 mov %i1, %o0 200d7a8: 92 10 00 1a mov %i2, %o1 200d7ac: 94 10 00 12 mov %l2, %o2 200d7b0: 98 07 bf f8 add %fp, -8, %o4 200d7b4: 7f ff ed 78 call 2008d94 <_Heap_Get_first_and_last_block> 200d7b8: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200d7bc: 80 8a 20 ff btst 0xff, %o0 200d7c0: 02 bf ff f7 be 200d79c <_Heap_Extend+0x2c> 200d7c4: ba 10 00 11 mov %l1, %i5 200d7c8: aa 10 20 00 clr %l5 200d7cc: ac 10 20 00 clr %l6 200d7d0: a6 10 20 00 clr %l3 200d7d4: 10 80 00 10 b 200d814 <_Heap_Extend+0xa4> 200d7d8: a8 10 20 00 clr %l4 return 0; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200d7dc: 2a 80 00 02 bcs,a 200d7e4 <_Heap_Extend+0x74> 200d7e0: ac 10 00 1d mov %i5, %l6 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200d7e4: 80 a6 c0 19 cmp %i3, %i1 200d7e8: 22 80 00 1e be,a 200d860 <_Heap_Extend+0xf0> 200d7ec: e0 27 40 00 st %l0, [ %i5 ] start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200d7f0: 80 a6 40 1b cmp %i1, %i3 200d7f4: 38 80 00 02 bgu,a 200d7fc <_Heap_Extend+0x8c> 200d7f8: aa 10 00 08 mov %o0, %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; 200d7fc: fa 02 20 04 ld [ %o0 + 4 ], %i5 200d800: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d804: ba 02 00 1d add %o0, %i5, %i5 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200d808: 80 a4 40 1d cmp %l1, %i5 200d80c: 22 80 00 1c be,a 200d87c <_Heap_Extend+0x10c> 200d810: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 return 0; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200d814: 80 a7 40 11 cmp %i5, %l1 200d818: 22 80 00 03 be,a 200d824 <_Heap_Extend+0xb4> 200d81c: f4 07 20 18 ld [ %i4 + 0x18 ], %i2 200d820: b4 10 00 1d mov %i5, %i2 uintptr_t const sub_area_end = start_block->prev_size; 200d824: f6 07 40 00 ld [ %i5 ], %i3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d828: 92 10 00 12 mov %l2, %o1 200d82c: 40 00 2c 21 call 20188b0 <.urem> 200d830: 90 10 00 1b mov %i3, %o0 200d834: 82 06 ff f8 add %i3, -8, %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200d838: 80 a6 80 10 cmp %i2, %l0 200d83c: 0a 80 00 64 bcs 200d9cc <_Heap_Extend+0x25c> 200d840: 90 20 40 08 sub %g1, %o0, %o0 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return 0; } if ( extend_area_end == sub_area_begin ) { 200d844: 80 a6 80 10 cmp %i2, %l0 200d848: 12 bf ff e5 bne 200d7dc <_Heap_Extend+0x6c> 200d84c: 80 a4 00 1b cmp %l0, %i3 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 ) { 200d850: 80 a6 c0 19 cmp %i3, %i1 200d854: 12 bf ff e7 bne 200d7f0 <_Heap_Extend+0x80> <== ALWAYS TAKEN 200d858: a8 10 00 1d mov %i5, %l4 start_block->prev_size = extend_area_end; 200d85c: e0 27 40 00 st %l0, [ %i5 ] <== NOT EXECUTED - 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; 200d860: fa 02 20 04 ld [ %o0 + 4 ], %i5 200d864: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d868: ba 02 00 1d add %o0, %i5, %i5 } 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 ); 200d86c: 80 a4 40 1d cmp %l1, %i5 200d870: 12 bf ff e9 bne 200d814 <_Heap_Extend+0xa4> <== NEVER TAKEN 200d874: a6 10 00 08 mov %o0, %l3 if ( extend_area_begin < heap->area_begin ) { 200d878: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 200d87c: 80 a6 40 01 cmp %i1, %g1 200d880: 3a 80 00 4e bcc,a 200d9b8 <_Heap_Extend+0x248> 200d884: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200d888: f2 27 20 18 st %i1, [ %i4 + 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; 200d88c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200d890: 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 ) { 200d894: c8 07 20 20 ld [ %i4 + 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 = 200d898: 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; 200d89c: e0 20 40 00 st %l0, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200d8a0: ba 10 e0 01 or %g3, 1, %i5 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 = 200d8a4: fa 20 60 04 st %i5, [ %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; 200d8a8: 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 ) { 200d8ac: 80 a1 00 01 cmp %g4, %g1 200d8b0: 08 80 00 3c bleu 200d9a0 <_Heap_Extend+0x230> 200d8b4: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200d8b8: c2 27 20 20 st %g1, [ %i4 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d8bc: 80 a5 20 00 cmp %l4, 0 200d8c0: 02 80 00 47 be 200d9dc <_Heap_Extend+0x26c> 200d8c4: 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; 200d8c8: fa 07 20 10 ld [ %i4 + 0x10 ], %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200d8cc: 92 10 00 1d mov %i5, %o1 200d8d0: 40 00 2b f8 call 20188b0 <.urem> 200d8d4: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200d8d8: 80 a2 20 00 cmp %o0, 0 200d8dc: 02 80 00 04 be 200d8ec <_Heap_Extend+0x17c> 200d8e0: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200d8e4: b2 06 40 1d add %i1, %i5, %i1 200d8e8: 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 = 200d8ec: 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; 200d8f0: 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 = 200d8f4: 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; 200d8f8: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200d8fc: 90 10 00 1c mov %i4, %o0 200d900: 92 10 00 01 mov %g1, %o1 200d904: 7f ff ff 85 call 200d718 <_Heap_Free_block> 200d908: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200d90c: 80 a4 e0 00 cmp %l3, 0 200d910: 02 80 00 3a be 200d9f8 <_Heap_Extend+0x288> 200d914: a0 04 3f f8 add %l0, -8, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d918: d2 07 20 10 ld [ %i4 + 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( 200d91c: a0 24 00 13 sub %l0, %l3, %l0 200d920: 40 00 2b e4 call 20188b0 <.urem> 200d924: 90 10 00 10 mov %l0, %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) 200d928: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200d92c: a0 24 00 08 sub %l0, %o0, %l0 200d930: 82 20 40 10 sub %g1, %l0, %g1 | HEAP_PREV_BLOCK_USED; 200d934: 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 = 200d938: 84 04 00 13 add %l0, %l3, %g2 200d93c: 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; 200d940: 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 ); 200d944: 90 10 00 1c mov %i4, %o0 200d948: 82 08 60 01 and %g1, 1, %g1 200d94c: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200d950: a0 14 00 01 or %l0, %g1, %l0 200d954: 7f ff ff 71 call 200d718 <_Heap_Free_block> 200d958: e0 24 e0 04 st %l0, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200d95c: 80 a4 e0 00 cmp %l3, 0 200d960: 02 80 00 33 be 200da2c <_Heap_Extend+0x2bc> 200d964: 80 a5 20 00 cmp %l4, 0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200d968: c2 07 20 24 ld [ %i4 + 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( 200d96c: fa 07 20 20 ld [ %i4 + 0x20 ], %i5 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; 200d970: c8 00 60 04 ld [ %g1 + 4 ], %g4 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200d974: c4 07 20 2c ld [ %i4 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200d978: c6 07 20 30 ld [ %i4 + 0x30 ], %g3 * 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( 200d97c: ba 27 40 01 sub %i5, %g1, %i5 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; 200d980: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200d984: 88 17 40 04 or %i5, %g4, %g4 200d988: c8 20 60 04 st %g4, [ %g1 + 4 ] 200d98c: b0 20 c0 18 sub %g3, %i0, %i0 /* Statistics */ stats->size += extended_size; 200d990: 82 00 80 18 add %g2, %i0, %g1 200d994: c2 27 20 2c st %g1, [ %i4 + 0x2c ] return extended_size; } 200d998: 81 c7 e0 08 ret 200d99c: 81 e8 00 00 restore 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 ) { 200d9a0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200d9a4: 80 a0 40 02 cmp %g1, %g2 200d9a8: 2a bf ff c5 bcs,a 200d8bc <_Heap_Extend+0x14c> 200d9ac: c4 27 20 24 st %g2, [ %i4 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200d9b0: 10 bf ff c4 b 200d8c0 <_Heap_Extend+0x150> 200d9b4: 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 ) { 200d9b8: 80 a4 00 01 cmp %l0, %g1 200d9bc: 38 bf ff b4 bgu,a 200d88c <_Heap_Extend+0x11c> 200d9c0: e0 27 20 1c st %l0, [ %i4 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200d9c4: 10 bf ff b3 b 200d890 <_Heap_Extend+0x120> 200d9c8: 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 ( 200d9cc: 80 a6 40 1b cmp %i1, %i3 200d9d0: 1a bf ff 9e bcc 200d848 <_Heap_Extend+0xd8> 200d9d4: 80 a6 80 10 cmp %i2, %l0 200d9d8: 30 bf ff 71 b,a 200d79c <_Heap_Extend+0x2c> 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 ) { 200d9dc: 80 a5 a0 00 cmp %l6, 0 200d9e0: 02 bf ff cc be 200d910 <_Heap_Extend+0x1a0> 200d9e4: 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; 200d9e8: ac 25 80 02 sub %l6, %g2, %l6 200d9ec: 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 = 200d9f0: 10 bf ff c8 b 200d910 <_Heap_Extend+0x1a0> 200d9f4: ec 20 a0 04 st %l6, [ %g2 + 4 ] ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200d9f8: 80 a5 60 00 cmp %l5, 0 200d9fc: 02 bf ff d8 be 200d95c <_Heap_Extend+0x1ec> 200da00: 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; 200da04: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200da08: c2 07 bf fc ld [ %fp + -4 ], %g1 200da0c: 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 ); 200da10: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200da14: 84 10 80 03 or %g2, %g3, %g2 200da18: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200da1c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200da20: 84 10 a0 01 or %g2, 1, %g2 200da24: 10 bf ff ce b 200d95c <_Heap_Extend+0x1ec> 200da28: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200da2c: 32 bf ff d0 bne,a 200d96c <_Heap_Extend+0x1fc> 200da30: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200da34: d2 07 bf f8 ld [ %fp + -8 ], %o1 200da38: 7f ff ff 38 call 200d718 <_Heap_Free_block> 200da3c: 90 10 00 1c mov %i4, %o0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200da40: 10 bf ff cb b 200d96c <_Heap_Extend+0x1fc> 200da44: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 =============================================================================== 0200d764 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200d764: 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 ) { 200d768: 80 a6 60 00 cmp %i1, 0 200d76c: 02 80 00 3c be 200d85c <_Heap_Free+0xf8> 200d770: 82 10 20 01 mov 1, %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d774: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200d778: 40 00 2b 95 call 20185cc <.urem> 200d77c: 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 200d780: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200d784: 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); 200d788: 90 27 40 08 sub %i5, %o0, %o0 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; 200d78c: 80 a2 00 02 cmp %o0, %g2 200d790: 0a 80 00 30 bcs 200d850 <_Heap_Free+0xec> 200d794: 82 10 20 00 clr %g1 200d798: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200d79c: 80 a2 00 04 cmp %o0, %g4 200d7a0: 38 80 00 2d bgu,a 200d854 <_Heap_Free+0xf0> <== NEVER TAKEN 200d7a4: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED - 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; 200d7a8: f6 02 20 04 ld [ %o0 + 4 ], %i3 200d7ac: ba 0e ff fe and %i3, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d7b0: 86 02 00 1d add %o0, %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; 200d7b4: 80 a0 80 03 cmp %g2, %g3 200d7b8: 38 80 00 27 bgu,a 200d854 <_Heap_Free+0xf0> <== NEVER TAKEN 200d7bc: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED 200d7c0: 80 a1 00 03 cmp %g4, %g3 200d7c4: 2a 80 00 24 bcs,a 200d854 <_Heap_Free+0xf0> <== NEVER TAKEN 200d7c8: b0 08 60 ff and %g1, 0xff, %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; 200d7cc: f8 00 e0 04 ld [ %g3 + 4 ], %i4 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200d7d0: 80 8f 20 01 btst 1, %i4 200d7d4: 02 80 00 1f be 200d850 <_Heap_Free+0xec> <== NEVER TAKEN 200d7d8: 80 a1 00 03 cmp %g4, %g3 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 )); 200d7dc: 02 80 00 23 be 200d868 <_Heap_Free+0x104> 200d7e0: b8 0f 3f fe and %i4, -2, %i4 200d7e4: 82 00 c0 1c add %g3, %i4, %g1 200d7e8: c2 00 60 04 ld [ %g1 + 4 ], %g1 200d7ec: 80 88 60 01 btst 1, %g1 200d7f0: 12 80 00 1f bne 200d86c <_Heap_Free+0x108> 200d7f4: 80 8e e0 01 btst 1, %i3 if ( !_Heap_Is_prev_used( block ) ) { 200d7f8: 02 80 00 20 be 200d878 <_Heap_Free+0x114> 200d7fc: b2 10 20 01 mov 1, %i1 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200d800: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200d804: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200d808: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; 200d80c: c2 22 20 0c st %g1, [ %o0 + 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; 200d810: b8 07 00 1d add %i4, %i5, %i4 next->prev = new_block; 200d814: d0 20 a0 0c st %o0, [ %g2 + 0xc ] prev->next = new_block; 200d818: d0 20 60 08 st %o0, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d81c: 84 17 20 01 or %i4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200d820: f8 22 00 1c st %i4, [ %o0 + %i4 ] 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; 200d824: c4 22 20 04 st %g2, [ %o0 + 4 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200d828: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d82c: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; stats->free_size += block_size; 200d830: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200d834: 82 00 60 01 inc %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d838: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 200d83c: ba 00 c0 1d add %g3, %i5, %i5 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200d840: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200d844: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 200d848: fa 26 20 30 st %i5, [ %i0 + 0x30 ] return( true ); 200d84c: 82 10 20 01 mov 1, %g1 200d850: b0 08 60 ff and %g1, 0xff, %i0 200d854: 81 c7 e0 08 ret 200d858: 81 e8 00 00 restore 200d85c: b0 08 60 ff and %g1, 0xff, %i0 200d860: 81 c7 e0 08 ret 200d864: 81 e8 00 00 restore 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 ) ) { 200d868: 80 8e e0 01 btst 1, %i3 200d86c: 32 80 00 1e bne,a 200d8e4 <_Heap_Free+0x180> 200d870: c4 06 20 08 ld [ %i0 + 8 ], %g2 if ( !_Heap_Protection_determine_block_free( heap, block ) ) { return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 200d874: b2 10 20 00 clr %i1 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { uintptr_t const prev_size = block->prev_size; 200d878: f4 02 00 00 ld [ %o0 ], %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200d87c: b6 22 00 1a sub %o0, %i2, %i3 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; 200d880: 80 a0 80 1b cmp %g2, %i3 200d884: 18 bf ff f3 bgu 200d850 <_Heap_Free+0xec> <== NEVER TAKEN 200d888: 82 10 20 00 clr %g1 200d88c: 80 a1 00 1b cmp %g4, %i3 200d890: 2a bf ff f1 bcs,a 200d854 <_Heap_Free+0xf0> <== NEVER TAKEN 200d894: b0 08 60 ff and %g1, 0xff, %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; 200d898: c4 06 e0 04 ld [ %i3 + 4 ], %g2 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) ) { 200d89c: 80 88 a0 01 btst 1, %g2 200d8a0: 02 bf ff ec be 200d850 <_Heap_Free+0xec> <== NEVER TAKEN 200d8a4: 80 8e 60 ff btst 0xff, %i1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200d8a8: 22 80 00 21 be,a 200d92c <_Heap_Free+0x1c8> 200d8ac: b4 07 40 1a add %i5, %i2, %i2 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200d8b0: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200d8b4: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200d8b8: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200d8bc: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200d8c0: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200d8c4: 82 00 ff ff add %g3, -1, %g1 200d8c8: 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; 200d8cc: b8 07 40 1c add %i5, %i4, %i4 200d8d0: b4 07 00 1a add %i4, %i2, %i2 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200d8d4: 82 16 a0 01 or %i2, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200d8d8: f4 26 c0 1a st %i2, [ %i3 + %i2 ] 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; 200d8dc: 10 bf ff d3 b 200d828 <_Heap_Free+0xc4> 200d8e0: c2 26 e0 04 st %g1, [ %i3 + 4 ] 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; 200d8e4: 82 17 60 01 or %i5, 1, %g1 200d8e8: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d8ec: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200d8f0: f0 22 20 0c st %i0, [ %o0 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200d8f4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200d8f8: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200d8fc: d0 20 a0 0c st %o0, [ %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; 200d900: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200d904: fa 22 00 1d st %i5, [ %o0 + %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; 200d908: 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 ) { 200d90c: 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; 200d910: 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; 200d914: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200d918: 80 a0 40 02 cmp %g1, %g2 200d91c: 08 bf ff c3 bleu 200d828 <_Heap_Free+0xc4> 200d920: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200d924: 10 bf ff c1 b 200d828 <_Heap_Free+0xc4> 200d928: 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; 200d92c: 82 16 a0 01 or %i2, 1, %g1 200d930: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200d934: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200d938: f4 22 00 1d st %i2, [ %o0 + %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; 200d93c: 82 08 7f fe and %g1, -2, %g1 200d940: 10 bf ff ba b 200d828 <_Heap_Free+0xc4> 200d944: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 02012594 <_Heap_Get_free_information>: return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2012594: c2 02 20 08 ld [ %o0 + 8 ], %g1 ) { Heap_Block *the_block; Heap_Block *const tail = _Heap_Free_list_tail(the_heap); info->number = 0; 2012598: c0 22 40 00 clr [ %o1 ] info->largest = 0; 201259c: c0 22 60 04 clr [ %o1 + 4 ] info->total = 0; 20125a0: c0 22 60 08 clr [ %o1 + 8 ] for(the_block = _Heap_Free_list_first(the_heap); 20125a4: 88 10 20 01 mov 1, %g4 20125a8: 9a 10 20 00 clr %o5 20125ac: 80 a2 00 01 cmp %o0, %g1 20125b0: 12 80 00 04 bne 20125c0 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN 20125b4: 86 10 20 00 clr %g3 20125b8: 30 80 00 10 b,a 20125f8 <_Heap_Get_free_information+0x64><== NOT EXECUTED 20125bc: 88 10 00 0c mov %o4, %g4 - 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; 20125c0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20125c4: 98 01 20 01 add %g4, 1, %o4 20125c8: 84 08 bf fe and %g2, -2, %g2 /* As we always coalesce free blocks, prev block must have been used. */ _HAssert(_Heap_Is_prev_used(the_block)); info->number++; info->total += the_size; if ( info->largest < the_size ) 20125cc: 80 a0 80 0d cmp %g2, %o5 20125d0: 08 80 00 03 bleu 20125dc <_Heap_Get_free_information+0x48> 20125d4: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 20125d8: c4 22 60 04 st %g2, [ %o1 + 4 ] info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); the_block != tail; the_block = the_block->next) 20125dc: c2 00 60 08 ld [ %g1 + 8 ], %g1 info->number = 0; info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); 20125e0: 80 a2 00 01 cmp %o0, %g1 20125e4: 32 bf ff f6 bne,a 20125bc <_Heap_Get_free_information+0x28> 20125e8: da 02 60 04 ld [ %o1 + 4 ], %o5 20125ec: c8 22 40 00 st %g4, [ %o1 ] 20125f0: 81 c3 e0 08 retl 20125f4: c6 22 60 08 st %g3, [ %o1 + 8 ] 20125f8: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 0200acc4 <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, const uintptr_t *block_sizes, size_t block_count ) { 200acc4: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 200acc8: 80 a6 a0 00 cmp %i2, 0 200accc: 02 80 00 35 be 200ada0 <_Heap_Greedy_allocate+0xdc> 200acd0: b8 10 00 18 mov %i0, %i4 200acd4: ba 10 20 00 clr %i5 200acd8: b6 10 20 00 clr %i3 #include "config.h" #endif #include Heap_Block *_Heap_Greedy_allocate( 200acdc: 83 2f 60 02 sll %i5, 2, %g1 * @brief See _Heap_Allocate_aligned_with_boundary() with alignment and * boundary equals zero. */ RTEMS_INLINE_ROUTINE void *_Heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 200ace0: d2 06 40 01 ld [ %i1 + %g1 ], %o1 200ace4: 94 10 20 00 clr %o2 200ace8: 96 10 20 00 clr %o3 200acec: 40 00 1d 9e call 2012364 <_Heap_Allocate_aligned_with_boundary> 200acf0: 90 10 00 1c mov %i4, %o0 size_t i; for (i = 0; i < block_count; ++i) { void *next = _Heap_Allocate( heap, block_sizes [i] ); if ( next != NULL ) { 200acf4: 82 92 20 00 orcc %o0, 0, %g1 200acf8: 22 80 00 09 be,a 200ad1c <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN 200acfc: ba 07 60 01 inc %i5 <== NOT EXECUTED RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200ad00: d2 07 20 10 ld [ %i4 + 0x10 ], %o1 200ad04: 40 00 49 b2 call 201d3cc <.urem> 200ad08: b0 00 7f f8 add %g1, -8, %i0 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200ad0c: 90 26 00 08 sub %i0, %o0, %o0 Heap_Block *next_block = _Heap_Block_of_alloc_area( (uintptr_t) next, heap->page_size ); next_block->next = allocated_blocks; 200ad10: f6 22 20 08 st %i3, [ %o0 + 8 ] 200ad14: b6 10 00 08 mov %o0, %i3 Heap_Block *allocated_blocks = NULL; Heap_Block *blocks = NULL; Heap_Block *current; size_t i; for (i = 0; i < block_count; ++i) { 200ad18: ba 07 60 01 inc %i5 200ad1c: 80 a7 40 1a cmp %i5, %i2 200ad20: 12 bf ff f0 bne 200ace0 <_Heap_Greedy_allocate+0x1c> 200ad24: 83 2f 60 02 sll %i5, 2, %g1 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200ad28: fa 07 20 08 ld [ %i4 + 8 ], %i5 next_block->next = allocated_blocks; allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { 200ad2c: 80 a7 00 1d cmp %i4, %i5 200ad30: 02 80 00 17 be 200ad8c <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN 200ad34: b0 10 20 00 clr %i0 200ad38: 10 80 00 03 b 200ad44 <_Heap_Greedy_allocate+0x80> 200ad3c: b4 10 20 00 clr %i2 200ad40: ba 10 00 01 mov %g1, %i5 - 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; 200ad44: d6 07 60 04 ld [ %i5 + 4 ], %o3 _Heap_Block_allocate( 200ad48: 92 10 00 1d mov %i5, %o1 200ad4c: 96 0a ff fe and %o3, -2, %o3 200ad50: 94 07 60 08 add %i5, 8, %o2 200ad54: 90 10 00 1c mov %i4, %o0 200ad58: 40 00 00 e0 call 200b0d8 <_Heap_Block_allocate> 200ad5c: 96 02 ff f8 add %o3, -8, %o3 current, _Heap_Alloc_area_of_block( current ), _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; 200ad60: f4 27 60 08 st %i2, [ %i5 + 8 ] return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200ad64: c2 07 20 08 ld [ %i4 + 8 ], %g1 next_block->next = allocated_blocks; allocated_blocks = next_block; } } while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) { 200ad68: 80 a7 00 01 cmp %i4, %g1 200ad6c: 12 bf ff f5 bne 200ad40 <_Heap_Greedy_allocate+0x7c> 200ad70: b4 10 00 1d mov %i5, %i2 200ad74: 10 80 00 06 b 200ad8c <_Heap_Greedy_allocate+0xc8> 200ad78: b0 10 00 1d mov %i5, %i0 } while ( allocated_blocks != NULL ) { current = allocated_blocks; allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200ad7c: 92 06 e0 08 add %i3, 8, %o1 200ad80: 90 10 00 1c mov %i4, %o0 200ad84: 40 00 1e 03 call 2012590 <_Heap_Free> 200ad88: b6 10 00 1a mov %i2, %i3 current->next = blocks; blocks = current; } while ( allocated_blocks != NULL ) { 200ad8c: 80 a6 e0 00 cmp %i3, 0 200ad90: 32 bf ff fb bne,a 200ad7c <_Heap_Greedy_allocate+0xb8> 200ad94: f4 06 e0 08 ld [ %i3 + 8 ], %i2 allocated_blocks = allocated_blocks->next; _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); } return blocks; } 200ad98: 81 c7 e0 08 ret 200ad9c: 81 e8 00 00 restore const uintptr_t *block_sizes, size_t block_count ) { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *allocated_blocks = NULL; 200ada0: 10 bf ff e2 b 200ad28 <_Heap_Greedy_allocate+0x64> 200ada4: b6 10 20 00 clr %i3 =============================================================================== 0200ada8 <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 200ada8: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 200adac: 80 a6 60 00 cmp %i1, 0 200adb0: 02 80 00 09 be 200add4 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN 200adb4: 01 00 00 00 nop Heap_Block *current = blocks; blocks = blocks->next; 200adb8: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200adbc: 92 06 60 08 add %i1, 8, %o1 200adc0: 40 00 1d f4 call 2012590 <_Heap_Free> 200adc4: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 200adc8: b2 97 60 00 orcc %i5, 0, %i1 200adcc: 32 bf ff fc bne,a 200adbc <_Heap_Greedy_free+0x14> 200add0: fa 06 60 08 ld [ %i1 + 8 ], %i5 200add4: 81 c7 e0 08 ret 200add8: 81 e8 00 00 restore =============================================================================== 02012660 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 2012660: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; 2012664: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *end = heap->last_block; 2012668: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 bool stop = false; while ( !stop && current != end ) { 201266c: 80 a0 40 1c cmp %g1, %i4 2012670: 32 80 00 08 bne,a 2012690 <_Heap_Iterate+0x30> <== ALWAYS TAKEN 2012674: d2 00 60 04 ld [ %g1 + 4 ], %o1 2012678: 30 80 00 10 b,a 20126b8 <_Heap_Iterate+0x58> <== NOT EXECUTED 201267c: 90 1a 20 01 xor %o0, 1, %o0 2012680: 80 8a 20 ff btst 0xff, %o0 2012684: 02 80 00 0d be 20126b8 <_Heap_Iterate+0x58> <== NEVER TAKEN 2012688: 01 00 00 00 nop 201268c: d2 00 60 04 ld [ %g1 + 4 ], %o1 uintptr_t size = _Heap_Block_size( current ); Heap_Block *next = _Heap_Block_at( current, size ); bool used = _Heap_Is_prev_used( next ); stop = (*visitor)( current, size, used, visitor_arg ); 2012690: 90 10 00 01 mov %g1, %o0 2012694: 92 0a 7f fe and %o1, -2, %o1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2012698: ba 00 40 09 add %g1, %o1, %i5 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; 201269c: d4 07 60 04 ld [ %i5 + 4 ], %o2 20126a0: 96 10 00 1a mov %i2, %o3 20126a4: 9f c6 40 00 call %i1 20126a8: 94 0a a0 01 and %o2, 1, %o2 { Heap_Block *current = heap->first_block; Heap_Block *end = heap->last_block; bool stop = false; while ( !stop && current != end ) { 20126ac: 80 a7 00 1d cmp %i4, %i5 20126b0: 12 bf ff f3 bne 201267c <_Heap_Iterate+0x1c> 20126b4: 82 10 00 1d mov %i5, %g1 20126b8: 81 c7 e0 08 ret 20126bc: 81 e8 00 00 restore =============================================================================== 0200da70 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200da70: 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); 200da74: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200da78: 40 00 2a d5 call 20185cc <.urem> 200da7c: 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 200da80: 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); 200da84: 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); 200da88: 90 20 80 08 sub %g2, %o0, %o0 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; 200da8c: 80 a2 00 01 cmp %o0, %g1 200da90: 0a 80 00 16 bcs 200dae8 <_Heap_Size_of_alloc_area+0x78> 200da94: 84 10 20 00 clr %g2 200da98: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200da9c: 80 a2 00 03 cmp %o0, %g3 200daa0: 18 80 00 13 bgu 200daec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200daa4: b0 08 a0 ff and %g2, 0xff, %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; 200daa8: c8 02 20 04 ld [ %o0 + 4 ], %g4 200daac: 88 09 3f fe and %g4, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200dab0: 90 02 00 04 add %o0, %g4, %o0 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; 200dab4: 80 a0 40 08 cmp %g1, %o0 200dab8: 18 80 00 0d bgu 200daec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dabc: 01 00 00 00 nop 200dac0: 80 a0 c0 08 cmp %g3, %o0 200dac4: 0a 80 00 0a bcs 200daec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dac8: 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; 200dacc: c2 02 20 04 ld [ %o0 + 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 ) 200dad0: 80 88 60 01 btst 1, %g1 200dad4: 02 80 00 06 be 200daec <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dad8: 90 22 00 19 sub %o0, %i1, %o0 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200dadc: 84 10 20 01 mov 1, %g2 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 200dae0: 90 02 20 04 add %o0, 4, %o0 200dae4: d0 26 80 00 st %o0, [ %i2 ] 200dae8: b0 08 a0 ff and %g2, 0xff, %i0 200daec: 81 c7 e0 08 ret 200daf0: 81 e8 00 00 restore =============================================================================== 02009d10 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2009d10: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const page_size = heap->page_size; 2009d14: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 uintptr_t const min_block_size = heap->min_block_size; 2009d18: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2009d1c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 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; 2009d20: 80 a6 a0 00 cmp %i2, 0 2009d24: 02 80 00 0c be 2009d54 <_Heap_Walk+0x44> 2009d28: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009d2c: 03 00 80 7c sethi %hi(0x201f000), %g1 2009d30: c4 00 63 8c ld [ %g1 + 0x38c ], %g2 ! 201f38c <_System_state_Current> 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; 2009d34: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009d38: 82 10 20 01 mov 1, %g1 Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009d3c: 80 a0 a0 03 cmp %g2, 3 2009d40: 02 80 00 0c be 2009d70 <_Heap_Walk+0x60> <== ALWAYS TAKEN 2009d44: ae 10 e0 ac or %g3, 0xac, %l7 2009d48: b0 08 60 ff and %g1, 0xff, %i0 2009d4c: 81 c7 e0 08 ret 2009d50: 81 e8 00 00 restore 2009d54: 03 00 80 7c sethi %hi(0x201f000), %g1 2009d58: c4 00 63 8c ld [ %g1 + 0x38c ], %g2 ! 201f38c <_System_state_Current> 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; 2009d5c: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009d60: 82 10 20 01 mov 1, %g1 Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009d64: 80 a0 a0 03 cmp %g2, 3 2009d68: 12 bf ff f8 bne 2009d48 <_Heap_Walk+0x38> 2009d6c: ae 10 e0 a4 or %g3, 0xa4, %l7 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)( 2009d70: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2009d74: c8 06 20 1c ld [ %i0 + 0x1c ], %g4 2009d78: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009d7c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009d80: 90 10 00 19 mov %i1, %o0 2009d84: c8 23 a0 5c st %g4, [ %sp + 0x5c ] 2009d88: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2009d8c: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2009d90: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2009d94: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2009d98: 92 10 20 00 clr %o1 2009d9c: 96 10 00 1b mov %i3, %o3 2009da0: 15 00 80 6f sethi %hi(0x201bc00), %o2 2009da4: 98 10 00 10 mov %l0, %o4 2009da8: 9f c5 c0 00 call %l7 2009dac: 94 12 a3 38 or %o2, 0x338, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009db0: 80 a6 e0 00 cmp %i3, 0 2009db4: 02 80 00 2a be 2009e5c <_Heap_Walk+0x14c> 2009db8: 80 8e e0 07 btst 7, %i3 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009dbc: 12 80 00 2f bne 2009e78 <_Heap_Walk+0x168> 2009dc0: 90 10 00 10 mov %l0, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009dc4: 7f ff df 6b call 2001b70 <.urem> 2009dc8: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009dcc: 80 a2 20 00 cmp %o0, 0 2009dd0: 12 80 00 32 bne 2009e98 <_Heap_Walk+0x188> 2009dd4: 90 07 20 08 add %i4, 8, %o0 2009dd8: 7f ff df 66 call 2001b70 <.urem> 2009ddc: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 2009de0: 80 a2 20 00 cmp %o0, 0 2009de4: 32 80 00 35 bne,a 2009eb8 <_Heap_Walk+0x1a8> 2009de8: 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; 2009dec: ec 07 20 04 ld [ %i4 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2009df0: b4 8d a0 01 andcc %l6, 1, %i2 2009df4: 22 80 00 38 be,a 2009ed4 <_Heap_Walk+0x1c4> 2009df8: 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; 2009dfc: c2 04 60 04 ld [ %l1 + 4 ], %g1 2009e00: 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); 2009e04: 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; 2009e08: fa 00 60 04 ld [ %g1 + 4 ], %i5 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2009e0c: 80 8f 60 01 btst 1, %i5 2009e10: 02 80 00 0c be 2009e40 <_Heap_Walk+0x130> 2009e14: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 2009e18: 02 80 00 35 be 2009eec <_Heap_Walk+0x1dc> 2009e1c: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2009e20: 92 10 20 01 mov 1, %o1 2009e24: 15 00 80 70 sethi %hi(0x201c000), %o2 2009e28: 9f c5 c0 00 call %l7 2009e2c: 94 12 a0 b0 or %o2, 0xb0, %o2 ! 201c0b0 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009e30: 82 10 20 00 clr %g1 2009e34: b0 08 60 ff and %g1, 0xff, %i0 2009e38: 81 c7 e0 08 ret 2009e3c: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2009e40: 90 10 00 19 mov %i1, %o0 2009e44: 92 10 20 01 mov 1, %o1 2009e48: 15 00 80 70 sethi %hi(0x201c000), %o2 2009e4c: 9f c5 c0 00 call %l7 2009e50: 94 12 a0 98 or %o2, 0x98, %o2 ! 201c098 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009e54: 10 bf ff f8 b 2009e34 <_Heap_Walk+0x124> 2009e58: 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" ); 2009e5c: 90 10 00 19 mov %i1, %o0 2009e60: 92 10 20 01 mov 1, %o1 2009e64: 15 00 80 6f sethi %hi(0x201bc00), %o2 2009e68: 9f c5 c0 00 call %l7 2009e6c: 94 12 a3 d0 or %o2, 0x3d0, %o2 ! 201bfd0 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009e70: 10 bf ff f1 b 2009e34 <_Heap_Walk+0x124> 2009e74: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2009e78: 90 10 00 19 mov %i1, %o0 2009e7c: 92 10 20 01 mov 1, %o1 2009e80: 15 00 80 6f sethi %hi(0x201bc00), %o2 2009e84: 96 10 00 1b mov %i3, %o3 2009e88: 9f c5 c0 00 call %l7 2009e8c: 94 12 a3 e8 or %o2, 0x3e8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009e90: 10 bf ff e9 b 2009e34 <_Heap_Walk+0x124> 2009e94: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2009e98: 90 10 00 19 mov %i1, %o0 2009e9c: 92 10 20 01 mov 1, %o1 2009ea0: 15 00 80 70 sethi %hi(0x201c000), %o2 2009ea4: 96 10 00 10 mov %l0, %o3 2009ea8: 9f c5 c0 00 call %l7 2009eac: 94 12 a0 08 or %o2, 8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009eb0: 10 bf ff e1 b 2009e34 <_Heap_Walk+0x124> 2009eb4: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2009eb8: 92 10 20 01 mov 1, %o1 2009ebc: 15 00 80 70 sethi %hi(0x201c000), %o2 2009ec0: 96 10 00 1c mov %i4, %o3 2009ec4: 9f c5 c0 00 call %l7 2009ec8: 94 12 a0 30 or %o2, 0x30, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ecc: 10 bf ff da b 2009e34 <_Heap_Walk+0x124> 2009ed0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2009ed4: 92 10 20 01 mov 1, %o1 2009ed8: 15 00 80 70 sethi %hi(0x201c000), %o2 2009edc: 9f c5 c0 00 call %l7 2009ee0: 94 12 a0 68 or %o2, 0x68, %o2 ! 201c068 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ee4: 10 bf ff d4 b 2009e34 <_Heap_Walk+0x124> 2009ee8: 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; 2009eec: fa 06 20 08 ld [ %i0 + 8 ], %i5 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 2009ef0: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 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 ) { 2009ef4: 80 a6 00 1d cmp %i0, %i5 2009ef8: 02 80 00 0d be 2009f2c <_Heap_Walk+0x21c> 2009efc: da 06 20 20 ld [ %i0 + 0x20 ], %o5 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; 2009f00: 80 a3 40 1d cmp %o5, %i5 2009f04: 28 80 00 bf bleu,a 200a200 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN 2009f08: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2009f0c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2009f10: 92 10 20 01 mov 1, %o1 2009f14: 15 00 80 70 sethi %hi(0x201c000), %o2 2009f18: 96 10 00 1d mov %i5, %o3 2009f1c: 9f c5 c0 00 call %l7 2009f20: 94 12 a0 e0 or %o2, 0xe0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f24: 10 bf ff c4 b 2009e34 <_Heap_Walk+0x124> 2009f28: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2009f2c: 27 00 80 70 sethi %hi(0x201c000), %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2009f30: 25 00 80 70 sethi %hi(0x201c000), %l2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2009f34: aa 10 00 1c mov %i4, %l5 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2009f38: a6 14 e3 10 or %l3, 0x310, %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 2009f3c: a4 14 a2 f8 or %l2, 0x2f8, %l2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2009f40: 29 00 80 70 sethi %hi(0x201c000), %l4 - 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; 2009f44: ac 0d bf fe and %l6, -2, %l6 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2009f48: ba 05 80 15 add %l6, %l5, %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; 2009f4c: 80 a3 40 1d cmp %o5, %i5 2009f50: 28 80 00 0b bleu,a 2009f7c <_Heap_Walk+0x26c> <== ALWAYS TAKEN 2009f54: de 06 20 24 ld [ %i0 + 0x24 ], %o7 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)( 2009f58: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2009f5c: 92 10 20 01 mov 1, %o1 2009f60: 96 10 00 15 mov %l5, %o3 2009f64: 15 00 80 70 sethi %hi(0x201c000), %o2 2009f68: 98 10 00 1d mov %i5, %o4 2009f6c: 9f c5 c0 00 call %l7 2009f70: 94 12 a1 88 or %o2, 0x188, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2009f74: 10 bf ff 75 b 2009d48 <_Heap_Walk+0x38> 2009f78: 82 10 20 00 clr %g1 2009f7c: 80 a3 c0 1d cmp %o7, %i5 2009f80: 0a bf ff f7 bcs 2009f5c <_Heap_Walk+0x24c> 2009f84: 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; 2009f88: 9e 1d 40 11 xor %l5, %l1, %o7 2009f8c: 80 a0 00 0f cmp %g0, %o7 2009f90: 9a 40 20 00 addx %g0, 0, %o5 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009f94: 90 10 00 16 mov %l6, %o0 2009f98: da 27 bf fc st %o5, [ %fp + -4 ] 2009f9c: 7f ff de f5 call 2001b70 <.urem> 2009fa0: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2009fa4: 80 a2 20 00 cmp %o0, 0 2009fa8: 02 80 00 18 be 200a008 <_Heap_Walk+0x2f8> 2009fac: da 07 bf fc ld [ %fp + -4 ], %o5 2009fb0: 80 8b 60 ff btst 0xff, %o5 2009fb4: 12 80 00 8b bne 200a1e0 <_Heap_Walk+0x4d0> 2009fb8: 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; 2009fbc: de 07 60 04 ld [ %i5 + 4 ], %o7 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2009fc0: 80 8b e0 01 btst 1, %o7 2009fc4: 02 80 00 2b be 200a070 <_Heap_Walk+0x360> 2009fc8: 80 a6 a0 00 cmp %i2, 0 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2009fcc: 22 80 00 21 be,a 200a050 <_Heap_Walk+0x340> 2009fd0: da 05 40 00 ld [ %l5 ], %o5 (*printer)( 2009fd4: 90 10 00 19 mov %i1, %o0 2009fd8: 92 10 20 00 clr %o1 2009fdc: 94 10 00 12 mov %l2, %o2 2009fe0: 96 10 00 15 mov %l5, %o3 2009fe4: 9f c5 c0 00 call %l7 2009fe8: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2009fec: 80 a7 00 1d cmp %i4, %i5 2009ff0: 02 80 00 51 be 200a134 <_Heap_Walk+0x424> 2009ff4: aa 10 00 1d mov %i5, %l5 2009ff8: ec 07 60 04 ld [ %i5 + 4 ], %l6 2009ffc: da 06 20 20 ld [ %i0 + 0x20 ], %o5 200a000: 10 bf ff d1 b 2009f44 <_Heap_Walk+0x234> 200a004: b4 0d a0 01 and %l6, 1, %i2 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a008: 80 a5 80 10 cmp %l6, %l0 200a00c: 0a 80 00 69 bcs 200a1b0 <_Heap_Walk+0x4a0> 200a010: 80 8b 60 ff btst 0xff, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200a014: 80 a5 40 1d cmp %l5, %i5 200a018: 2a bf ff ea bcs,a 2009fc0 <_Heap_Walk+0x2b0> 200a01c: de 07 60 04 ld [ %i5 + 4 ], %o7 200a020: 80 8b 60 ff btst 0xff, %o5 200a024: 22 bf ff e7 be,a 2009fc0 <_Heap_Walk+0x2b0> 200a028: de 07 60 04 ld [ %i5 + 4 ], %o7 (*printer)( 200a02c: 90 10 00 19 mov %i1, %o0 200a030: 92 10 20 01 mov 1, %o1 200a034: 96 10 00 15 mov %l5, %o3 200a038: 15 00 80 70 sethi %hi(0x201c000), %o2 200a03c: 98 10 00 1d mov %i5, %o4 200a040: 9f c5 c0 00 call %l7 200a044: 94 12 a2 18 or %o2, 0x218, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200a048: 10 bf ff 40 b 2009d48 <_Heap_Walk+0x38> 200a04c: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a050: 96 10 00 15 mov %l5, %o3 200a054: 90 10 00 19 mov %i1, %o0 200a058: 92 10 20 00 clr %o1 200a05c: 94 10 00 13 mov %l3, %o2 200a060: 9f c5 c0 00 call %l7 200a064: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a068: 10 bf ff e2 b 2009ff0 <_Heap_Walk+0x2e0> 200a06c: 80 a7 00 1d cmp %i4, %i5 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 ? 200a070: da 05 60 0c ld [ %l5 + 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)( 200a074: de 06 20 08 ld [ %i0 + 8 ], %o7 200a078: 80 a3 c0 0d cmp %o7, %o5 200a07c: 02 80 00 3d be 200a170 <_Heap_Walk+0x460> 200a080: d8 06 20 0c ld [ %i0 + 0xc ], %o4 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a084: 80 a6 00 0d cmp %i0, %o5 200a088: 02 80 00 40 be 200a188 <_Heap_Walk+0x478> 200a08c: 96 15 22 c0 or %l4, 0x2c0, %o3 block->next, block->next == last_free_block ? 200a090: de 05 60 08 ld [ %l5 + 8 ], %o7 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)( 200a094: 80 a3 00 0f cmp %o4, %o7 200a098: 02 80 00 33 be 200a164 <_Heap_Walk+0x454> 200a09c: 80 a6 00 0f cmp %i0, %o7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a0a0: 02 80 00 37 be 200a17c <_Heap_Walk+0x46c> 200a0a4: 98 15 22 c0 or %l4, 0x2c0, %o4 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)( 200a0a8: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 200a0ac: d8 23 a0 64 st %o4, [ %sp + 0x64 ] 200a0b0: de 23 a0 60 st %o7, [ %sp + 0x60 ] 200a0b4: 90 10 00 19 mov %i1, %o0 200a0b8: 92 10 20 00 clr %o1 200a0bc: 15 00 80 70 sethi %hi(0x201c000), %o2 200a0c0: 96 10 00 15 mov %l5, %o3 200a0c4: 94 12 a2 50 or %o2, 0x250, %o2 200a0c8: 9f c5 c0 00 call %l7 200a0cc: 98 10 00 16 mov %l6, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 200a0d0: da 07 40 00 ld [ %i5 ], %o5 200a0d4: 80 a5 80 0d cmp %l6, %o5 200a0d8: 12 80 00 19 bne 200a13c <_Heap_Walk+0x42c> 200a0dc: 80 a6 a0 00 cmp %i2, 0 ); return false; } if ( !prev_used ) { 200a0e0: 02 80 00 2d be 200a194 <_Heap_Walk+0x484> 200a0e4: 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; 200a0e8: c4 06 20 08 ld [ %i0 + 8 ], %g2 ) { 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 ) { 200a0ec: 80 a6 00 02 cmp %i0, %g2 200a0f0: 02 80 00 0b be 200a11c <_Heap_Walk+0x40c> <== NEVER TAKEN 200a0f4: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200a0f8: 80 a5 40 02 cmp %l5, %g2 200a0fc: 02 bf ff bd be 2009ff0 <_Heap_Walk+0x2e0> 200a100: 80 a7 00 1d cmp %i4, %i5 return true; } free_block = free_block->next; 200a104: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ) { 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 ) { 200a108: 80 a6 00 02 cmp %i0, %g2 200a10c: 12 bf ff fc bne 200a0fc <_Heap_Walk+0x3ec> 200a110: 80 a5 40 02 cmp %l5, %g2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200a114: 90 10 00 19 mov %i1, %o0 200a118: 92 10 20 01 mov 1, %o1 200a11c: 15 00 80 70 sethi %hi(0x201c000), %o2 200a120: 96 10 00 15 mov %l5, %o3 200a124: 9f c5 c0 00 call %l7 200a128: 94 12 a3 38 or %o2, 0x338, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a12c: 10 bf ff 42 b 2009e34 <_Heap_Walk+0x124> 200a130: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 200a134: 10 bf ff 05 b 2009d48 <_Heap_Walk+0x38> 200a138: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 200a13c: fa 23 a0 5c st %i5, [ %sp + 0x5c ] 200a140: 90 10 00 19 mov %i1, %o0 200a144: 92 10 20 01 mov 1, %o1 200a148: 15 00 80 70 sethi %hi(0x201c000), %o2 200a14c: 96 10 00 15 mov %l5, %o3 200a150: 94 12 a2 88 or %o2, 0x288, %o2 200a154: 9f c5 c0 00 call %l7 200a158: 98 10 00 16 mov %l6, %o4 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a15c: 10 bf ff 36 b 2009e34 <_Heap_Walk+0x124> 200a160: 82 10 20 00 clr %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)( 200a164: 03 00 80 6f sethi %hi(0x201bc00), %g1 200a168: 10 bf ff d0 b 200a0a8 <_Heap_Walk+0x398> 200a16c: 98 10 63 18 or %g1, 0x318, %o4 ! 201bf18 <__log2table+0x140> 200a170: 03 00 80 6f sethi %hi(0x201bc00), %g1 200a174: 10 bf ff c7 b 200a090 <_Heap_Walk+0x380> 200a178: 96 10 62 f8 or %g1, 0x2f8, %o3 ! 201bef8 <__log2table+0x120> " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a17c: 03 00 80 6f sethi %hi(0x201bc00), %g1 200a180: 10 bf ff ca b 200a0a8 <_Heap_Walk+0x398> 200a184: 98 10 63 28 or %g1, 0x328, %o4 ! 201bf28 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a188: 17 00 80 6f sethi %hi(0x201bc00), %o3 200a18c: 10 bf ff c1 b 200a090 <_Heap_Walk+0x380> 200a190: 96 12 e3 08 or %o3, 0x308, %o3 ! 201bf08 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 200a194: 92 10 20 01 mov 1, %o1 200a198: 15 00 80 70 sethi %hi(0x201c000), %o2 200a19c: 96 10 00 15 mov %l5, %o3 200a1a0: 9f c5 c0 00 call %l7 200a1a4: 94 12 a2 c8 or %o2, 0x2c8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a1a8: 10 bf ff 23 b 2009e34 <_Heap_Walk+0x124> 200a1ac: 82 10 20 00 clr %g1 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a1b0: 02 bf ff 9a be 200a018 <_Heap_Walk+0x308> <== NEVER TAKEN 200a1b4: 80 a5 40 1d cmp %l5, %i5 (*printer)( 200a1b8: 90 10 00 19 mov %i1, %o0 200a1bc: 92 10 20 01 mov 1, %o1 200a1c0: 96 10 00 15 mov %l5, %o3 200a1c4: 15 00 80 70 sethi %hi(0x201c000), %o2 200a1c8: 98 10 00 16 mov %l6, %o4 200a1cc: 94 12 a1 e8 or %o2, 0x1e8, %o2 200a1d0: 9f c5 c0 00 call %l7 200a1d4: 9a 10 00 10 mov %l0, %o5 block, block_size, min_block_size ); return false; 200a1d8: 10 bf fe dc b 2009d48 <_Heap_Walk+0x38> 200a1dc: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200a1e0: 92 10 20 01 mov 1, %o1 200a1e4: 96 10 00 15 mov %l5, %o3 200a1e8: 15 00 80 70 sethi %hi(0x201c000), %o2 200a1ec: 98 10 00 16 mov %l6, %o4 200a1f0: 9f c5 c0 00 call %l7 200a1f4: 94 12 a1 b8 or %o2, 0x1b8, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 200a1f8: 10 bf fe d4 b 2009d48 <_Heap_Walk+0x38> 200a1fc: 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; 200a200: 80 a4 c0 1d cmp %l3, %i5 200a204: 0a bf ff 43 bcs 2009f10 <_Heap_Walk+0x200> <== NEVER TAKEN 200a208: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a20c: da 27 bf fc st %o5, [ %fp + -4 ] 200a210: 90 07 60 08 add %i5, 8, %o0 200a214: 7f ff de 57 call 2001b70 <.urem> 200a218: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a21c: 80 a2 20 00 cmp %o0, 0 200a220: 12 80 00 36 bne 200a2f8 <_Heap_Walk+0x5e8> <== NEVER TAKEN 200a224: da 07 bf fc ld [ %fp + -4 ], %o5 - 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; 200a228: c2 07 60 04 ld [ %i5 + 4 ], %g1 200a22c: 82 08 7f fe and %g1, -2, %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; 200a230: 82 07 40 01 add %i5, %g1, %g1 200a234: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a238: 80 88 60 01 btst 1, %g1 200a23c: 12 80 00 27 bne 200a2d8 <_Heap_Walk+0x5c8> <== NEVER TAKEN 200a240: a4 10 00 1d mov %i5, %l2 200a244: 10 80 00 19 b 200a2a8 <_Heap_Walk+0x598> 200a248: 82 10 00 18 mov %i0, %g1 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 ) { 200a24c: 80 a6 00 1d cmp %i0, %i5 200a250: 02 bf ff 37 be 2009f2c <_Heap_Walk+0x21c> 200a254: 80 a7 40 0d cmp %i5, %o5 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; 200a258: 0a bf ff 2e bcs 2009f10 <_Heap_Walk+0x200> 200a25c: 90 10 00 19 mov %i1, %o0 200a260: 80 a7 40 13 cmp %i5, %l3 200a264: 18 bf ff 2c bgu 2009f14 <_Heap_Walk+0x204> <== NEVER TAKEN 200a268: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a26c: da 27 bf fc st %o5, [ %fp + -4 ] 200a270: 90 07 60 08 add %i5, 8, %o0 200a274: 7f ff de 3f call 2001b70 <.urem> 200a278: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a27c: 80 a2 20 00 cmp %o0, 0 200a280: 12 80 00 1e bne 200a2f8 <_Heap_Walk+0x5e8> 200a284: da 07 bf fc ld [ %fp + -4 ], %o5 - 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; 200a288: de 07 60 04 ld [ %i5 + 4 ], %o7 200a28c: 82 10 00 12 mov %l2, %g1 200a290: 9e 0b ff fe and %o7, -2, %o7 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; 200a294: 9e 03 c0 1d add %o7, %i5, %o7 200a298: de 03 e0 04 ld [ %o7 + 4 ], %o7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a29c: 80 8b e0 01 btst 1, %o7 200a2a0: 12 80 00 0e bne 200a2d8 <_Heap_Walk+0x5c8> 200a2a4: a4 10 00 1d mov %i5, %l2 ); return false; } if ( free_block->prev != prev_block ) { 200a2a8: d8 07 60 0c ld [ %i5 + 0xc ], %o4 200a2ac: 80 a3 00 01 cmp %o4, %g1 200a2b0: 22 bf ff e7 be,a 200a24c <_Heap_Walk+0x53c> 200a2b4: fa 07 60 08 ld [ %i5 + 8 ], %i5 (*printer)( 200a2b8: 90 10 00 19 mov %i1, %o0 200a2bc: 92 10 20 01 mov 1, %o1 200a2c0: 15 00 80 70 sethi %hi(0x201c000), %o2 200a2c4: 96 10 00 1d mov %i5, %o3 200a2c8: 9f c5 c0 00 call %l7 200a2cc: 94 12 a1 50 or %o2, 0x150, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a2d0: 10 bf fe d9 b 2009e34 <_Heap_Walk+0x124> 200a2d4: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200a2d8: 90 10 00 19 mov %i1, %o0 200a2dc: 92 10 20 01 mov 1, %o1 200a2e0: 15 00 80 70 sethi %hi(0x201c000), %o2 200a2e4: 96 10 00 1d mov %i5, %o3 200a2e8: 9f c5 c0 00 call %l7 200a2ec: 94 12 a1 30 or %o2, 0x130, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a2f0: 10 bf fe d1 b 2009e34 <_Heap_Walk+0x124> 200a2f4: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 200a2f8: 90 10 00 19 mov %i1, %o0 200a2fc: 92 10 20 01 mov 1, %o1 200a300: 15 00 80 70 sethi %hi(0x201c000), %o2 200a304: 96 10 00 1d mov %i5, %o3 200a308: 9f c5 c0 00 call %l7 200a30c: 94 12 a1 00 or %o2, 0x100, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a310: 10 bf fe c9 b 2009e34 <_Heap_Walk+0x124> 200a314: 82 10 20 00 clr %g1 =============================================================================== 020083e0 <_IO_Initialize_all_drivers>: _IO_Driver_address_table[index] = driver_table[index]; } void _IO_Initialize_all_drivers( void ) { 20083e0: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 20083e4: 39 00 80 73 sethi %hi(0x201cc00), %i4 20083e8: c2 07 23 38 ld [ %i4 + 0x338 ], %g1 ! 201cf38 <_IO_Number_of_drivers> 20083ec: ba 10 20 00 clr %i5 20083f0: 80 a0 60 00 cmp %g1, 0 20083f4: 02 80 00 0b be 2008420 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 20083f8: b8 17 23 38 or %i4, 0x338, %i4 (void) rtems_io_initialize( major, 0, NULL ); 20083fc: 90 10 00 1d mov %i5, %o0 2008400: 92 10 20 00 clr %o1 2008404: 40 00 13 dd call 200d378 2008408: 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 ++ ) 200840c: c2 07 00 00 ld [ %i4 ], %g1 2008410: ba 07 60 01 inc %i5 2008414: 80 a0 40 1d cmp %g1, %i5 2008418: 18 bf ff fa bgu 2008400 <_IO_Initialize_all_drivers+0x20> 200841c: 90 10 00 1d mov %i5, %o0 2008420: 81 c7 e0 08 ret 2008424: 81 e8 00 00 restore =============================================================================== 02008310 <_IO_Manager_initialization>: #include #include void _IO_Manager_initialization(void) { 2008310: 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 = rtems_configuration_get_device_driver_table(); 2008314: 03 00 80 68 sethi %hi(0x201a000), %g1 2008318: 82 10 60 68 or %g1, 0x68, %g1 ! 201a068 drivers_in_table = rtems_configuration_get_number_of_device_drivers(); 200831c: f8 00 60 38 ld [ %g1 + 0x38 ], %i4 number_of_drivers = rtems_configuration_get_maximum_drivers(); 2008320: f6 00 60 34 ld [ %g1 + 0x34 ], %i3 /* * 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 ) 2008324: 80 a7 00 1b cmp %i4, %i3 2008328: 0a 80 00 08 bcs 2008348 <_IO_Manager_initialization+0x38> 200832c: fa 00 60 3c ld [ %g1 + 0x3c ], %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; 2008330: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008334: fa 20 63 3c st %i5, [ %g1 + 0x33c ] ! 201cf3c <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2008338: 03 00 80 73 sethi %hi(0x201cc00), %g1 200833c: f8 20 63 38 st %i4, [ %g1 + 0x338 ] ! 201cf38 <_IO_Number_of_drivers> return; 2008340: 81 c7 e0 08 ret 2008344: 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 ) 2008348: 83 2e e0 03 sll %i3, 3, %g1 200834c: b5 2e e0 05 sll %i3, 5, %i2 2008350: 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( 2008354: 40 00 0d 4a call 200b87c <_Workspace_Allocate_or_fatal_error> 2008358: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 200835c: 03 00 80 73 sethi %hi(0x201cc00), %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 *) 2008360: 33 00 80 73 sethi %hi(0x201cc00), %i1 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008364: f6 20 63 38 st %i3, [ %g1 + 0x338 ] /* * 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 *) 2008368: d0 26 63 3c st %o0, [ %i1 + 0x33c ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 200836c: 92 10 20 00 clr %o1 2008370: 40 00 1e fc call 200ff60 2008374: 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++ ) 2008378: 80 a7 20 00 cmp %i4, 0 200837c: 02 bf ff f1 be 2008340 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2008380: c8 06 63 3c ld [ %i1 + 0x33c ], %g4 #include #include #include void _IO_Manager_initialization(void) 2008384: 85 2f 20 03 sll %i4, 3, %g2 2008388: b7 2f 20 05 sll %i4, 5, %i3 200838c: 82 10 20 00 clr %g1 2008390: b6 26 c0 02 sub %i3, %g2, %i3 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) _IO_Driver_address_table[index] = driver_table[index]; 2008394: c4 07 40 01 ld [ %i5 + %g1 ], %g2 2008398: 86 07 40 01 add %i5, %g1, %g3 200839c: c4 21 00 01 st %g2, [ %g4 + %g1 ] 20083a0: f8 00 e0 04 ld [ %g3 + 4 ], %i4 20083a4: 84 01 00 01 add %g4, %g1, %g2 20083a8: f8 20 a0 04 st %i4, [ %g2 + 4 ] 20083ac: f8 00 e0 08 ld [ %g3 + 8 ], %i4 20083b0: 82 00 60 18 add %g1, 0x18, %g1 20083b4: f8 20 a0 08 st %i4, [ %g2 + 8 ] 20083b8: f8 00 e0 0c ld [ %g3 + 0xc ], %i4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20083bc: 80 a0 40 1b cmp %g1, %i3 _IO_Driver_address_table[index] = driver_table[index]; 20083c0: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 20083c4: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4 20083c8: f8 20 a0 10 st %i4, [ %g2 + 0x10 ] 20083cc: 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++ ) 20083d0: 12 bf ff f1 bne 2008394 <_IO_Manager_initialization+0x84> 20083d4: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 20083d8: 81 c7 e0 08 ret 20083dc: 81 e8 00 00 restore =============================================================================== 02009070 <_Internal_error_Occurred>: void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 2009070: 9d e3 bf 90 save %sp, -112, %sp Internal_errors_t error ) { User_extensions_Fatal_context ctx = { source, is_internal, error }; _User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor ); 2009074: 13 00 80 2c sethi %hi(0x200b000), %o1 2009078: 90 07 bf f4 add %fp, -12, %o0 200907c: 92 12 62 b4 or %o1, 0x2b4, %o1 Internal_errors_Source source, bool is_internal, Internal_errors_t error ) { User_extensions_Fatal_context ctx = { source, is_internal, error }; 2009080: f0 27 bf f4 st %i0, [ %fp + -12 ] 2009084: f2 2f bf f8 stb %i1, [ %fp + -8 ] _User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor ); 2009088: 40 00 08 96 call 200b2e0 <_User_extensions_Iterate> 200908c: f4 27 bf fc st %i2, [ %fp + -4 ] _User_extensions_Fatal( the_source, is_internal, the_error ); _Internal_errors_What_happened.the_source = the_source; 2009090: 05 00 80 73 sethi %hi(0x201cc00), %g2 <== NOT EXECUTED 2009094: 82 10 a2 80 or %g2, 0x280, %g1 ! 201ce80 <_Internal_errors_What_happened><== NOT EXECUTED 2009098: f0 20 a2 80 st %i0, [ %g2 + 0x280 ] <== NOT EXECUTED _Internal_errors_What_happened.is_internal = is_internal; 200909c: f2 28 60 04 stb %i1, [ %g1 + 4 ] <== NOT EXECUTED _Internal_errors_What_happened.the_error = the_error; 20090a0: f4 20 60 08 st %i2, [ %g1 + 8 ] <== NOT EXECUTED RTEMS_INLINE_ROUTINE void _System_state_Set ( System_state_Codes state ) { _System_state_Current = state; 20090a4: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED 20090a8: 03 00 80 73 sethi %hi(0x201cc00), %g1 <== NOT EXECUTED _System_state_Set( SYSTEM_STATE_FAILED ); _CPU_Fatal_halt( the_error ); 20090ac: 7f ff e5 58 call 200260c <== NOT EXECUTED 20090b0: c4 20 62 8c st %g2, [ %g1 + 0x28c ] ! 201ce8c <_System_state_Current><== NOT EXECUTED 20090b4: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED 20090b8: 30 80 00 00 b,a 20090b8 <_Internal_error_Occurred+0x48> <== NOT EXECUTED =============================================================================== 02009128 <_Objects_Allocate>: #endif Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2009128: 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 ) 200912c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2009130: 80 a0 60 00 cmp %g1, 0 2009134: 02 80 00 26 be 20091cc <_Objects_Allocate+0xa4> <== NEVER TAKEN 2009138: ba 10 00 18 mov %i0, %i5 /* * 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 ); 200913c: b8 06 20 20 add %i0, 0x20, %i4 2009140: 7f ff fd 4c call 2008670 <_Chain_Get> 2009144: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2009148: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 200914c: 80 a0 60 00 cmp %g1, 0 2009150: 02 80 00 16 be 20091a8 <_Objects_Allocate+0x80> 2009154: 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 ) { 2009158: 80 a2 20 00 cmp %o0, 0 200915c: 02 80 00 15 be 20091b0 <_Objects_Allocate+0x88> 2009160: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2009164: c4 07 60 08 ld [ %i5 + 8 ], %g2 2009168: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 200916c: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2009170: 03 00 00 3f sethi %hi(0xfc00), %g1 2009174: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 2009178: 90 0a 00 01 and %o0, %g1, %o0 200917c: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2009180: 40 00 3c 67 call 201831c <.udiv> 2009184: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2009188: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200918c: 91 2a 20 02 sll %o0, 2, %o0 2009190: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2009194: 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 ]--; 2009198: 86 00 ff ff add %g3, -1, %g3 200919c: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 20091a0: 82 00 bf ff add %g2, -1, %g1 20091a4: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 20091a8: 81 c7 e0 08 ret 20091ac: 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 ); 20091b0: 40 00 00 10 call 20091f0 <_Objects_Extend_information> 20091b4: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20091b8: 7f ff fd 2e call 2008670 <_Chain_Get> 20091bc: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 20091c0: b0 92 20 00 orcc %o0, 0, %i0 20091c4: 32 bf ff e9 bne,a 2009168 <_Objects_Allocate+0x40> 20091c8: c4 07 60 08 ld [ %i5 + 8 ], %g2 * 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 ) return NULL; 20091cc: 81 c7 e0 08 ret 20091d0: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020091f0 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 20091f0: 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 ) 20091f4: f2 06 20 34 ld [ %i0 + 0x34 ], %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 ); 20091f8: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 20091fc: 80 a6 60 00 cmp %i1, 0 2009200: 02 80 00 a1 be 2009484 <_Objects_Extend_information+0x294> 2009204: e2 16 20 10 lduh [ %i0 + 0x10 ], %l1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2009208: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 200920c: a3 2c 60 10 sll %l1, 0x10, %l1 2009210: 92 10 00 1b mov %i3, %o1 2009214: 40 00 3c 42 call 201831c <.udiv> 2009218: 91 34 60 10 srl %l1, 0x10, %o0 200921c: 91 2a 20 10 sll %o0, 0x10, %o0 2009220: b5 32 20 10 srl %o0, 0x10, %i2 for ( ; block < block_count; block++ ) { 2009224: 80 a6 a0 00 cmp %i2, 0 2009228: 02 80 00 af be 20094e4 <_Objects_Extend_information+0x2f4><== NEVER TAKEN 200922c: 90 10 00 1b mov %i3, %o0 if ( information->object_blocks[ block ] == NULL ) { 2009230: c2 06 40 00 ld [ %i1 ], %g1 2009234: 80 a0 60 00 cmp %g1, 0 2009238: 02 80 00 b1 be 20094fc <_Objects_Extend_information+0x30c><== NEVER TAKEN 200923c: b8 10 00 10 mov %l0, %i4 * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009240: 10 80 00 06 b 2009258 <_Objects_Extend_information+0x68> 2009244: ba 10 20 00 clr %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 2009248: c2 06 40 01 ld [ %i1 + %g1 ], %g1 200924c: 80 a0 60 00 cmp %g1, 0 2009250: 22 80 00 08 be,a 2009270 <_Objects_Extend_information+0x80> 2009254: b6 10 20 00 clr %i3 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2009258: ba 07 60 01 inc %i5 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 200925c: b8 07 00 1b add %i4, %i3, %i4 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2009260: 80 a6 80 1d cmp %i2, %i5 2009264: 18 bf ff f9 bgu 2009248 <_Objects_Extend_information+0x58> 2009268: 83 2f 60 02 sll %i5, 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; 200926c: b6 10 20 01 mov 1, %i3 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009270: b3 34 60 10 srl %l1, 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 ) { 2009274: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009278: 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 ) { 200927c: 82 10 63 ff or %g1, 0x3ff, %g1 2009280: 80 a6 40 01 cmp %i1, %g1 2009284: 18 80 00 9c bgu 20094f4 <_Objects_Extend_information+0x304> 2009288: 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; 200928c: 40 00 3b ea call 2018234 <.umul> 2009290: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2009294: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2009298: 80 a0 60 00 cmp %g1, 0 200929c: 02 80 00 6d be 2009450 <_Objects_Extend_information+0x260> 20092a0: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 20092a4: 40 00 09 68 call 200b844 <_Workspace_Allocate> 20092a8: 01 00 00 00 nop if ( !new_object_block ) 20092ac: a2 92 20 00 orcc %o0, 0, %l1 20092b0: 02 80 00 91 be 20094f4 <_Objects_Extend_information+0x304> 20092b4: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 20092b8: 80 8e e0 ff btst 0xff, %i3 20092bc: 22 80 00 42 be,a 20093c4 <_Objects_Extend_information+0x1d4> 20092c0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 20092c4: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 */ /* * Up the block count and maximum */ block_count++; 20092c8: b6 06 a0 01 add %i2, 1, %i3 * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 20092cc: 80 a0 60 00 cmp %g1, 0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 20092d0: 91 2e e0 01 sll %i3, 1, %o0 20092d4: 90 02 00 1b add %o0, %i3, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 20092d8: 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 *)) + 20092dc: 90 02 00 10 add %o0, %l0, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 20092e0: 12 80 00 60 bne 2009460 <_Objects_Extend_information+0x270> 20092e4: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { _Workspace_Free( new_object_block ); return; } } else { object_blocks = _Workspace_Allocate_or_fatal_error( block_size ); 20092e8: 40 00 09 65 call 200b87c <_Workspace_Allocate_or_fatal_error> 20092ec: 01 00 00 00 nop 20092f0: a4 10 00 08 mov %o0, %l2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 20092f4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 /* * Break the block into the various sections. */ inactive_per_block = (uint32_t *) _Addresses_Add_offset( object_blocks, block_count * sizeof(void*) ); 20092f8: b7 2e e0 02 sll %i3, 2, %i3 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 20092fc: 80 a4 00 01 cmp %l0, %g1 2009300: a6 04 80 1b add %l2, %i3, %l3 2009304: 0a 80 00 67 bcs 20094a0 <_Objects_Extend_information+0x2b0> 2009308: b6 04 c0 1b add %l3, %i3, %i3 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 200930c: 85 2c 20 02 sll %l0, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2009310: 80 a4 20 00 cmp %l0, 0 2009314: 02 80 00 07 be 2009330 <_Objects_Extend_information+0x140><== NEVER TAKEN 2009318: 82 10 20 00 clr %g1 local_table[ index ] = NULL; 200931c: c0 20 40 1b clr [ %g1 + %i3 ] 2009320: 82 00 60 04 add %g1, 4, %g1 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 2009324: 80 a0 40 02 cmp %g1, %g2 2009328: 32 bf ff fe bne,a 2009320 <_Objects_Extend_information+0x130><== NEVER TAKEN 200932c: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED 2009330: b5 2e a0 02 sll %i2, 2, %i2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2009334: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2009338: c0 24 80 1a clr [ %l2 + %i2 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 200933c: 82 07 00 03 add %i4, %g3, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2009340: 80 a7 00 01 cmp %i4, %g1 2009344: 1a 80 00 0b bcc 2009370 <_Objects_Extend_information+0x180><== NEVER TAKEN 2009348: c0 24 c0 1a clr [ %l3 + %i2 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 200934c: 85 2f 20 02 sll %i4, 2, %g2 2009350: 87 28 e0 02 sll %g3, 2, %g3 2009354: 84 06 c0 02 add %i3, %g2, %g2 2009358: 82 10 20 00 clr %g1 inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 200935c: c0 20 80 01 clr [ %g2 + %g1 ] 2009360: 82 00 60 04 add %g1, 4, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 2009364: 80 a0 40 03 cmp %g1, %g3 2009368: 32 bf ff fe bne,a 2009360 <_Objects_Extend_information+0x170> 200936c: c0 20 80 01 clr [ %g2 + %g1 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2009370: 7f ff e4 a7 call 200260c 2009374: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2009378: 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( 200937c: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2009380: f4 06 20 34 ld [ %i0 + 0x34 ], %i2 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2009384: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2009388: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200938c: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2009390: e4 26 20 34 st %l2, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2009394: e6 26 20 30 st %l3, [ %i0 + 0x30 ] information->local_table = local_table; 2009398: f6 26 20 1c st %i3, [ %i0 + 0x1c ] uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 200939c: 03 00 00 40 sethi %hi(0x10000), %g1 20093a0: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20093a4: 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) | 20093a8: b2 10 40 19 or %g1, %i1, %i1 information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 20093ac: f2 26 20 0c st %i1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 20093b0: 7f ff e4 9b call 200261c 20093b4: 01 00 00 00 nop _Workspace_Free( old_tables ); 20093b8: 40 00 09 2b call 200b864 <_Workspace_Free> 20093bc: 90 10 00 1a mov %i2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20093c0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20093c4: bb 2f 60 02 sll %i5, 2, %i5 20093c8: e2 20 40 1d st %l1, [ %g1 + %i5 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20093cc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20093d0: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 20093d4: d2 00 40 1d ld [ %g1 + %i5 ], %o1 20093d8: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 20093dc: 90 07 bf f4 add %fp, -12, %o0 20093e0: 7f ff fc b4 call 20086b0 <_Chain_Initialize> 20093e4: 35 00 00 40 sethi %hi(0x10000), %i2 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 20093e8: 10 80 00 0d b 200941c <_Objects_Extend_information+0x22c> 20093ec: b6 06 20 20 add %i0, 0x20, %i3 the_object->id = _Objects_Build_id( 20093f0: c6 16 20 04 lduh [ %i0 + 4 ], %g3 20093f4: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20093f8: 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) | 20093fc: 84 10 80 1a or %g2, %i2, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009400: 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) | 2009404: 84 10 80 1c or %g2, %i4, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009408: 90 10 00 1b mov %i3, %o0 200940c: 92 10 00 01 mov %g1, %o1 index++; 2009410: b8 07 20 01 inc %i4 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009414: 7f ff fc 8c call 2008644 <_Chain_Append> 2009418: 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 ) { 200941c: 7f ff fc 95 call 2008670 <_Chain_Get> 2009420: 90 07 bf f4 add %fp, -12, %o0 2009424: 82 92 20 00 orcc %o0, 0, %g1 2009428: 32 bf ff f2 bne,a 20093f0 <_Objects_Extend_information+0x200> 200942c: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2009430: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2009434: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2009438: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 200943c: c8 20 c0 1d st %g4, [ %g3 + %i5 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2009440: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2009444: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2009448: 81 c7 e0 08 ret 200944c: 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 ); 2009450: 40 00 09 0b call 200b87c <_Workspace_Allocate_or_fatal_error> 2009454: 01 00 00 00 nop 2009458: 10 bf ff 98 b 20092b8 <_Objects_Extend_information+0xc8> 200945c: a2 10 00 08 mov %o0, %l1 */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { object_blocks = _Workspace_Allocate( block_size ); 2009460: 40 00 08 f9 call 200b844 <_Workspace_Allocate> 2009464: 01 00 00 00 nop if ( !object_blocks ) { 2009468: a4 92 20 00 orcc %o0, 0, %l2 200946c: 32 bf ff a3 bne,a 20092f8 <_Objects_Extend_information+0x108> 2009470: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 _Workspace_Free( new_object_block ); 2009474: 40 00 08 fc call 200b864 <_Workspace_Free> 2009478: 90 10 00 11 mov %l1, %o0 200947c: 81 c7 e0 08 ret 2009480: 81 e8 00 00 restore 2009484: 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 ); 2009488: b8 10 00 10 mov %l0, %i4 /* * 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; 200948c: b6 10 20 01 mov 1, %i3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009490: ba 10 20 00 clr %i5 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2009494: b4 10 20 00 clr %i2 2009498: 10 bf ff 76 b 2009270 <_Objects_Extend_information+0x80> 200949c: a3 2c 60 10 sll %l1, 0x10, %l1 /* * 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, 20094a0: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 20094a4: b5 2e a0 02 sll %i2, 2, %i2 /* * 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, 20094a8: 90 10 00 12 mov %l2, %o0 20094ac: 40 00 1a 70 call 200fe6c 20094b0: 94 10 00 1a mov %i2, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 20094b4: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 20094b8: 94 10 00 1a mov %i2, %o2 20094bc: 40 00 1a 6c call 200fe6c 20094c0: 90 10 00 13 mov %l3, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 20094c4: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20094c8: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 20094cc: 94 02 80 10 add %o2, %l0, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 20094d0: 90 10 00 1b mov %i3, %o0 20094d4: 40 00 1a 66 call 200fe6c 20094d8: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20094dc: 10 bf ff 97 b 2009338 <_Objects_Extend_information+0x148> 20094e0: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 /* * 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 ); 20094e4: b8 10 00 10 mov %l0, %i4 <== 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; 20094e8: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20094ec: 10 bf ff 61 b 2009270 <_Objects_Extend_information+0x80> <== NOT EXECUTED 20094f0: ba 10 20 00 clr %i5 <== NOT EXECUTED 20094f4: 81 c7 e0 08 ret 20094f8: 81 e8 00 00 restore else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 20094fc: b6 10 20 00 clr %i3 <== NOT EXECUTED * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009500: 10 bf ff 5c b 2009270 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2009504: ba 10 20 00 clr %i5 <== NOT EXECUTED =============================================================================== 020095b8 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 20095b8: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 20095bc: 80 a6 60 00 cmp %i1, 0 20095c0: 02 80 00 19 be 2009624 <_Objects_Get_information+0x6c> 20095c4: 01 00 00 00 nop /* * 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 ); 20095c8: 40 00 11 4b call 200daf4 <_Objects_API_maximum_class> 20095cc: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 20095d0: 80 a2 20 00 cmp %o0, 0 20095d4: 02 80 00 14 be 2009624 <_Objects_Get_information+0x6c> 20095d8: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 20095dc: 0a 80 00 12 bcs 2009624 <_Objects_Get_information+0x6c> 20095e0: 03 00 80 72 sethi %hi(0x201c800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 20095e4: b1 2e 20 02 sll %i0, 2, %i0 20095e8: 82 10 63 e4 or %g1, 0x3e4, %g1 20095ec: c2 00 40 18 ld [ %g1 + %i0 ], %g1 20095f0: 80 a0 60 00 cmp %g1, 0 20095f4: 02 80 00 0c be 2009624 <_Objects_Get_information+0x6c> <== NEVER TAKEN 20095f8: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 20095fc: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 2009600: 80 a6 20 00 cmp %i0, 0 2009604: 02 80 00 08 be 2009624 <_Objects_Get_information+0x6c> <== NEVER TAKEN 2009608: 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 ) 200960c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2009610: 80 a0 60 00 cmp %g1, 0 2009614: 02 80 00 04 be 2009624 <_Objects_Get_information+0x6c> 2009618: 01 00 00 00 nop return NULL; #endif return info; } 200961c: 81 c7 e0 08 ret 2009620: 81 e8 00 00 restore { Objects_Information *info; int the_class_api_maximum; if ( !the_class ) return NULL; 2009624: 81 c7 e0 08 ret 2009628: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0201737c <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 201737c: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2017380: 80 a6 60 00 cmp %i1, 0 2017384: 02 80 00 3d be 2017478 <_Objects_Get_name_as_string+0xfc> 2017388: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 201738c: 02 80 00 3b be 2017478 <_Objects_Get_name_as_string+0xfc> 2017390: ba 96 20 00 orcc %i0, 0, %i5 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2017394: 02 80 00 36 be 201746c <_Objects_Get_name_as_string+0xf0> 2017398: 03 00 80 bf sethi %hi(0x202fc00), %g1 information = _Objects_Get_information_id( tmpId ); 201739c: 7f ff e2 4b call 200fcc8 <_Objects_Get_information_id> 20173a0: 90 10 00 1d mov %i5, %o0 if ( !information ) 20173a4: 80 a2 20 00 cmp %o0, 0 20173a8: 02 80 00 34 be 2017478 <_Objects_Get_name_as_string+0xfc> 20173ac: 92 10 00 1d mov %i5, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 20173b0: 7f ff e2 86 call 200fdc8 <_Objects_Get> 20173b4: 94 07 bf f4 add %fp, -12, %o2 switch ( location ) { 20173b8: c2 07 bf f4 ld [ %fp + -12 ], %g1 20173bc: 80 a0 60 00 cmp %g1, 0 20173c0: 32 80 00 2f bne,a 201747c <_Objects_Get_name_as_string+0x100> 20173c4: 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; 20173c8: 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'; 20173cc: c0 2f bf fc clrb [ %fp + -4 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 20173d0: 87 30 60 18 srl %g1, 0x18, %g3 lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 20173d4: 85 30 60 08 srl %g1, 8, %g2 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 20173d8: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 20173dc: c4 2f bf fa stb %g2, [ %fp + -6 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 20173e0: c6 2f bf f8 stb %g3, [ %fp + -8 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 20173e4: c8 2f bf f9 stb %g4, [ %fp + -7 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 20173e8: c2 2f bf fb stb %g1, [ %fp + -5 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 20173ec: b2 86 7f ff addcc %i1, -1, %i1 20173f0: 02 80 00 25 be 2017484 <_Objects_Get_name_as_string+0x108><== NEVER TAKEN 20173f4: 84 10 00 03 mov %g3, %g2 20173f8: 80 a0 e0 00 cmp %g3, 0 20173fc: 02 80 00 17 be 2017458 <_Objects_Get_name_as_string+0xdc> 2017400: 86 10 00 1a mov %i2, %g3 2017404: 39 00 80 bb sethi %hi(0x202ec00), %i4 2017408: 82 10 20 00 clr %g1 201740c: 10 80 00 06 b 2017424 <_Objects_Get_name_as_string+0xa8> 2017410: b8 17 21 08 or %i4, 0x108, %i4 2017414: fa 49 00 01 ldsb [ %g4 + %g1 ], %i5 2017418: 80 a7 60 00 cmp %i5, 0 201741c: 02 80 00 0f be 2017458 <_Objects_Get_name_as_string+0xdc> 2017420: c4 08 40 04 ldub [ %g1 + %g4 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2017424: fa 07 00 00 ld [ %i4 ], %i5 2017428: 88 08 a0 ff and %g2, 0xff, %g4 201742c: 88 07 40 04 add %i5, %g4, %g4 2017430: fa 49 20 01 ldsb [ %g4 + 1 ], %i5 2017434: 80 8f 60 97 btst 0x97, %i5 2017438: 12 80 00 03 bne 2017444 <_Objects_Get_name_as_string+0xc8> 201743c: 88 07 bf f8 add %fp, -8, %g4 2017440: 84 10 20 2a mov 0x2a, %g2 2017444: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017448: 82 00 60 01 inc %g1 201744c: 80 a0 40 19 cmp %g1, %i1 2017450: 12 bf ff f1 bne 2017414 <_Objects_Get_name_as_string+0x98> 2017454: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; 2017458: c0 28 c0 00 clrb [ %g3 ] _Thread_Enable_dispatch(); 201745c: 7f ff e6 8f call 2010e98 <_Thread_Enable_dispatch> 2017460: b0 10 00 1a mov %i2, %i0 return name; } return NULL; /* unreachable path */ } 2017464: 81 c7 e0 08 ret 2017468: 81 e8 00 00 restore return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 201746c: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1 2017470: 10 bf ff cb b 201739c <_Objects_Get_name_as_string+0x20> 2017474: fa 00 60 08 ld [ %g1 + 8 ], %i5 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2017478: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 201747c: 81 c7 e0 08 ret 2017480: 91 e8 00 1a restore %g0, %i2, %o0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017484: 10 bf ff f5 b 2017458 <_Objects_Get_name_as_string+0xdc> <== NOT EXECUTED 2017488: 86 10 00 1a mov %i2, %g3 <== NOT EXECUTED =============================================================================== 02019ac8 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2019ac8: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) 2019acc: 80 a6 20 00 cmp %i0, 0 2019ad0: 02 80 00 29 be 2019b74 <_Objects_Get_next+0xac> 2019ad4: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( !location_p ) 2019ad8: 02 80 00 27 be 2019b74 <_Objects_Get_next+0xac> 2019adc: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2019ae0: 02 80 00 25 be 2019b74 <_Objects_Get_next+0xac> 2019ae4: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2019ae8: 80 a0 60 00 cmp %g1, 0 2019aec: 22 80 00 13 be,a 2019b38 <_Objects_Get_next+0x70> 2019af0: 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) 2019af4: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 2019af8: 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); 2019afc: 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) 2019b00: 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); 2019b04: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2019b08: 80 a0 80 01 cmp %g2, %g1 2019b0c: 0a 80 00 13 bcs 2019b58 <_Objects_Get_next+0x90> 2019b10: 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); 2019b14: 7f ff d8 ad call 200fdc8 <_Objects_Get> 2019b18: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2019b1c: c2 06 80 00 ld [ %i2 ], %g1 2019b20: 80 a0 60 00 cmp %g1, 0 2019b24: 32 bf ff f5 bne,a 2019af8 <_Objects_Get_next+0x30> 2019b28: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 *next_id_p = next_id; 2019b2c: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2019b30: 81 c7 e0 08 ret 2019b34: 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) 2019b38: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 2019b3c: 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); 2019b40: 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) 2019b44: 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); 2019b48: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 2019b4c: 80 a0 80 01 cmp %g2, %g1 2019b50: 1a bf ff f1 bcc 2019b14 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN 2019b54: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2019b58: 82 10 20 01 mov 1, %g1 2019b5c: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2019b60: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2019b64: 82 10 3f ff mov -1, %g1 2019b68: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2019b6c: 81 c7 e0 08 ret 2019b70: 91 e8 00 08 restore %g0, %o0, %o0 { Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2019b74: 10 bf ff ef b 2019b30 <_Objects_Get_next+0x68> 2019b78: 90 10 20 00 clr %o0 =============================================================================== 0201aaec <_Objects_Get_no_protection>: /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201aaec: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 201aaf0: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1 /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201aaf4: 92 22 40 02 sub %o1, %g2, %o1 201aaf8: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 201aafc: 80 a2 40 01 cmp %o1, %g1 201ab00: 18 80 00 09 bgu 201ab24 <_Objects_Get_no_protection+0x38> 201ab04: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 201ab08: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 201ab0c: d0 00 40 09 ld [ %g1 + %o1 ], %o0 201ab10: 80 a2 20 00 cmp %o0, 0 201ab14: 02 80 00 05 be 201ab28 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 201ab18: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 201ab1c: 81 c3 e0 08 retl 201ab20: c0 22 80 00 clr [ %o2 ] /* * This isn't supported or required yet for Global objects so * if it isn't local, we don't find it. */ *location = OBJECTS_ERROR; 201ab24: 82 10 20 01 mov 1, %g1 return NULL; 201ab28: 90 10 20 00 clr %o0 } 201ab2c: 81 c3 e0 08 retl 201ab30: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 0200fe3c <_Objects_Id_to_name>: Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200fe3c: 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; 200fe40: 80 a6 20 00 cmp %i0, 0 200fe44: 12 80 00 06 bne 200fe5c <_Objects_Id_to_name+0x20> 200fe48: 83 36 20 18 srl %i0, 0x18, %g1 200fe4c: 03 00 80 bf sethi %hi(0x202fc00), %g1 200fe50: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1 ! 202ffa0 <_Per_CPU_Information+0x10> 200fe54: f0 00 60 08 ld [ %g1 + 8 ], %i0 200fe58: 83 36 20 18 srl %i0, 0x18, %g1 200fe5c: 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 ) 200fe60: 84 00 7f ff add %g1, -1, %g2 200fe64: 80 a0 a0 02 cmp %g2, 2 200fe68: 18 80 00 18 bgu 200fec8 <_Objects_Id_to_name+0x8c> 200fe6c: 83 28 60 02 sll %g1, 2, %g1 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 200fe70: 05 00 80 bf sethi %hi(0x202fc00), %g2 200fe74: 84 10 a0 a4 or %g2, 0xa4, %g2 ! 202fca4 <_Objects_Information_table> 200fe78: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200fe7c: 80 a0 60 00 cmp %g1, 0 200fe80: 02 80 00 12 be 200fec8 <_Objects_Id_to_name+0x8c> 200fe84: 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 ]; 200fe88: 85 28 a0 02 sll %g2, 2, %g2 200fe8c: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 200fe90: 80 a2 20 00 cmp %o0, 0 200fe94: 02 80 00 0d be 200fec8 <_Objects_Id_to_name+0x8c> <== NEVER TAKEN 200fe98: 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 ); 200fe9c: 7f ff ff cb call 200fdc8 <_Objects_Get> 200fea0: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 200fea4: 80 a2 20 00 cmp %o0, 0 200fea8: 02 80 00 08 be 200fec8 <_Objects_Id_to_name+0x8c> 200feac: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200feb0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 200feb4: b0 10 20 00 clr %i0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 200feb8: 40 00 03 f8 call 2010e98 <_Thread_Enable_dispatch> 200febc: c2 26 40 00 st %g1, [ %i1 ] 200fec0: 81 c7 e0 08 ret 200fec4: 81 e8 00 00 restore tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; 200fec8: 81 c7 e0 08 ret 200fecc: 91 e8 20 03 restore %g0, 3, %o0 =============================================================================== 020098a4 <_Objects_Shrink_information>: #include void _Objects_Shrink_information( Objects_Information *information ) { 20098a4: 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 ); 20098a8: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 block_count = (information->maximum - index_base) / 20098ac: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 20098b0: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 20098b4: 92 10 00 1b mov %i3, %o1 20098b8: 40 00 3a 99 call 201831c <.udiv> 20098bc: 90 22 00 1c sub %o0, %i4, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 20098c0: 80 a2 20 00 cmp %o0, 0 20098c4: 02 80 00 36 be 200999c <_Objects_Shrink_information+0xf8> <== NEVER TAKEN 20098c8: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 20098cc: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 20098d0: c2 01 00 00 ld [ %g4 ], %g1 20098d4: 80 a6 c0 01 cmp %i3, %g1 20098d8: 02 80 00 0f be 2009914 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 20098dc: 82 10 20 00 clr %g1 20098e0: 10 80 00 07 b 20098fc <_Objects_Shrink_information+0x58> 20098e4: ba 10 20 04 mov 4, %i5 20098e8: c4 01 00 1d ld [ %g4 + %i5 ], %g2 20098ec: 80 a6 c0 02 cmp %i3, %g2 20098f0: 02 80 00 0a be 2009918 <_Objects_Shrink_information+0x74> 20098f4: 86 07 60 04 add %i5, 4, %g3 20098f8: ba 10 00 03 mov %g3, %i5 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 20098fc: 82 00 60 01 inc %g1 2009900: 80 a0 40 08 cmp %g1, %o0 2009904: 12 bf ff f9 bne 20098e8 <_Objects_Shrink_information+0x44> 2009908: b8 07 00 1b add %i4, %i3, %i4 200990c: 81 c7 e0 08 ret 2009910: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2009914: ba 10 20 00 clr %i5 <== NOT EXECUTED * 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 ); 2009918: 35 00 00 3f sethi %hi(0xfc00), %i2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200991c: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 2009920: 10 80 00 05 b 2009934 <_Objects_Shrink_information+0x90> 2009924: b4 16 a3 ff or %i2, 0x3ff, %i2 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2009928: 90 96 e0 00 orcc %i3, 0, %o0 200992c: 22 80 00 12 be,a 2009974 <_Objects_Shrink_information+0xd0> 2009930: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * 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 ); 2009934: c2 02 20 08 ld [ %o0 + 8 ], %g1 2009938: 82 08 40 1a and %g1, %i2, %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) && 200993c: 80 a0 40 1c cmp %g1, %i4 2009940: 0a bf ff fa bcs 2009928 <_Objects_Shrink_information+0x84> 2009944: f6 02 00 00 ld [ %o0 ], %i3 (index < (index_base + information->allocation_size))) { 2009948: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 200994c: 84 07 00 02 add %i4, %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) && 2009950: 80 a0 40 02 cmp %g1, %g2 2009954: 3a bf ff f6 bcc,a 200992c <_Objects_Shrink_information+0x88> 2009958: 90 96 e0 00 orcc %i3, 0, %o0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 200995c: 40 00 0e 9e call 200d3d4 <_Chain_Extract> 2009960: 01 00 00 00 nop } } while ( the_object ); 2009964: 90 96 e0 00 orcc %i3, 0, %o0 2009968: 32 bf ff f4 bne,a 2009938 <_Objects_Shrink_information+0x94><== ALWAYS TAKEN 200996c: c2 02 20 08 ld [ %o0 + 8 ], %g1 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2009970: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2009974: 40 00 07 bc call 200b864 <_Workspace_Free> 2009978: d0 00 40 1d ld [ %g1 + %i5 ], %o0 information->object_blocks[ block ] = NULL; 200997c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2009980: 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; 2009984: c0 20 40 1d clr [ %g1 + %i5 ] information->inactive_per_block[ block ] = 0; 2009988: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 200998c: 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; 2009990: c0 20 c0 1d clr [ %g3 + %i5 ] information->inactive -= information->allocation_size; 2009994: 82 20 80 01 sub %g2, %g1, %g1 2009998: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 200999c: 81 c7 e0 08 ret 20099a0: 81 e8 00 00 restore =============================================================================== 0200a8e8 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200a8e8: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200a8ec: 80 a6 60 00 cmp %i1, 0 200a8f0: 02 80 00 4c be 200aa20 <_RBTree_Extract_unprotected+0x138> 200a8f4: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200a8f8: c2 06 20 08 ld [ %i0 + 8 ], %g1 200a8fc: 80 a0 40 19 cmp %g1, %i1 200a900: 02 80 00 56 be 200aa58 <_RBTree_Extract_unprotected+0x170> 200a904: 90 10 00 19 mov %i1, %o0 the_rbtree->first[RBT_LEFT] = next; } /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200a908: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200a90c: 80 a0 40 19 cmp %g1, %i1 200a910: 02 80 00 56 be 200aa68 <_RBTree_Extract_unprotected+0x180> 200a914: 90 10 00 19 mov %i1, %o0 * 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]) { 200a918: fa 06 60 04 ld [ %i1 + 4 ], %i5 200a91c: 80 a7 60 00 cmp %i5, 0 200a920: 22 80 00 5a be,a 200aa88 <_RBTree_Extract_unprotected+0x1a0> 200a924: f8 06 60 08 ld [ %i1 + 8 ], %i4 200a928: c2 06 60 08 ld [ %i1 + 8 ], %g1 200a92c: 80 a0 60 00 cmp %g1, 0 200a930: 32 80 00 05 bne,a 200a944 <_RBTree_Extract_unprotected+0x5c> 200a934: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a938: 10 80 00 3c b 200aa28 <_RBTree_Extract_unprotected+0x140> 200a93c: 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]; 200a940: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a944: 80 a0 60 00 cmp %g1, 0 200a948: 32 bf ff fe bne,a 200a940 <_RBTree_Extract_unprotected+0x58> 200a94c: 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]; 200a950: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200a954: 80 a7 20 00 cmp %i4, 0 200a958: 02 80 00 48 be 200aa78 <_RBTree_Extract_unprotected+0x190> 200a95c: 01 00 00 00 nop leaf->parent = target->parent; 200a960: c2 07 40 00 ld [ %i5 ], %g1 200a964: 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]; 200a968: 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]; 200a96c: 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]; 200a970: 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; 200a974: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200a978: 88 1f 40 04 xor %i5, %g4, %g4 200a97c: 80 a0 00 04 cmp %g0, %g4 200a980: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200a984: 89 29 20 02 sll %g4, 2, %g4 200a988: 84 00 80 04 add %g2, %g4, %g2 200a98c: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200a990: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a994: 84 18 80 19 xor %g2, %i1, %g2 200a998: 80 a0 00 02 cmp %g0, %g2 200a99c: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200a9a0: 85 28 a0 02 sll %g2, 2, %g2 200a9a4: 82 00 40 02 add %g1, %g2, %g1 200a9a8: 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]; 200a9ac: c2 06 60 08 ld [ %i1 + 8 ], %g1 200a9b0: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200a9b4: c2 06 60 08 ld [ %i1 + 8 ], %g1 200a9b8: 80 a0 60 00 cmp %g1, 0 200a9bc: 32 80 00 02 bne,a 200a9c4 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200a9c0: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200a9c4: c2 06 60 04 ld [ %i1 + 4 ], %g1 200a9c8: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200a9cc: c2 06 60 04 ld [ %i1 + 4 ], %g1 200a9d0: 80 a0 60 00 cmp %g1, 0 200a9d4: 32 80 00 02 bne,a 200a9dc <_RBTree_Extract_unprotected+0xf4> 200a9d8: 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; 200a9dc: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200a9e0: 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; 200a9e4: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200a9e8: 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 */ 200a9ec: 80 a0 e0 00 cmp %g3, 0 200a9f0: 32 80 00 06 bne,a 200aa08 <_RBTree_Extract_unprotected+0x120> 200a9f4: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200a9f8: 80 a7 20 00 cmp %i4, 0 200a9fc: 32 80 00 02 bne,a 200aa04 <_RBTree_Extract_unprotected+0x11c> 200aa00: 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; 200aa04: 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; 200aa08: c0 26 60 08 clr [ %i1 + 8 ] 200aa0c: c0 26 60 04 clr [ %i1 + 4 ] 200aa10: 80 a0 60 00 cmp %g1, 0 200aa14: 02 80 00 03 be 200aa20 <_RBTree_Extract_unprotected+0x138> 200aa18: c0 26 40 00 clr [ %i1 ] 200aa1c: c0 20 60 0c clr [ %g1 + 0xc ] 200aa20: 81 c7 e0 08 ret 200aa24: 81 e8 00 00 restore * 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; 200aa28: c2 06 40 00 ld [ %i1 ], %g1 200aa2c: 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]; 200aa30: 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; 200aa34: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200aa38: c4 00 60 04 ld [ %g1 + 4 ], %g2 200aa3c: 84 18 80 19 xor %g2, %i1, %g2 200aa40: 80 a0 00 02 cmp %g0, %g2 200aa44: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200aa48: 85 28 a0 02 sll %g2, 2, %g2 200aa4c: 82 00 40 02 add %g1, %g2, %g1 200aa50: 10 bf ff e7 b 200a9ec <_RBTree_Extract_unprotected+0x104> 200aa54: f8 20 60 04 st %i4, [ %g1 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_RIGHT ); 200aa58: 40 00 00 eb call 200ae04 <_RBTree_Next_unprotected> 200aa5c: 92 10 20 01 mov 1, %o1 /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { RBTree_Node *next; next = _RBTree_Successor_unprotected(the_node); the_rbtree->first[RBT_LEFT] = next; 200aa60: 10 bf ff aa b 200a908 <_RBTree_Extract_unprotected+0x20> 200aa64: d0 26 20 08 st %o0, [ %i0 + 8 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_LEFT ); 200aa68: 40 00 00 e7 call 200ae04 <_RBTree_Next_unprotected> 200aa6c: 92 10 20 00 clr %o1 /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { RBTree_Node *previous; previous = _RBTree_Predecessor_unprotected(the_node); the_rbtree->first[RBT_RIGHT] = previous; 200aa70: 10 bf ff aa b 200a918 <_RBTree_Extract_unprotected+0x30> 200aa74: d0 26 20 0c st %o0, [ %i0 + 0xc ] 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); 200aa78: 7f ff fe d3 call 200a5c4 <_RBTree_Extract_validate_unprotected> 200aa7c: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200aa80: 10 bf ff bb b 200a96c <_RBTree_Extract_unprotected+0x84> 200aa84: c4 07 40 00 ld [ %i5 ], %g2 * 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]; if( leaf ) { 200aa88: 80 a7 20 00 cmp %i4, 0 200aa8c: 32 bf ff e8 bne,a 200aa2c <_RBTree_Extract_unprotected+0x144> 200aa90: 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); 200aa94: 7f ff fe cc call 200a5c4 <_RBTree_Extract_validate_unprotected> 200aa98: 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]; 200aa9c: 10 bf ff e6 b 200aa34 <_RBTree_Extract_unprotected+0x14c> 200aaa0: c2 06 40 00 ld [ %i1 ], %g1 =============================================================================== 0200a5c4 <_RBTree_Extract_validate_unprotected>: ) { RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200a5c4: c2 02 00 00 ld [ %o0 ], %g1 if(!parent->parent) return; 200a5c8: c4 00 40 00 ld [ %g1 ], %g2 200a5cc: 80 a0 a0 00 cmp %g2, 0 200a5d0: 02 80 00 3f be 200a6cc <_RBTree_Extract_validate_unprotected+0x108> 200a5d4: 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]) 200a5d8: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a5dc: 80 a2 00 02 cmp %o0, %g2 200a5e0: 22 80 00 02 be,a 200a5e8 <_RBTree_Extract_validate_unprotected+0x24> 200a5e4: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200a5e8: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a5ec: 80 a0 e0 01 cmp %g3, 1 200a5f0: 02 80 00 32 be 200a6b8 <_RBTree_Extract_validate_unprotected+0xf4> 200a5f4: 9a 10 20 01 mov 1, %o5 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) { 200a5f8: c6 00 40 00 ld [ %g1 ], %g3 200a5fc: 80 a0 e0 00 cmp %g3, 0 200a600: 02 80 00 2e be 200a6b8 <_RBTree_Extract_validate_unprotected+0xf4> 200a604: 80 a0 a0 00 cmp %g2, 0 200a608: 22 80 00 07 be,a 200a624 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 200a60c: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200a610: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200a614: 80 a1 20 01 cmp %g4, 1 200a618: 22 80 00 63 be,a 200a7a4 <_RBTree_Extract_validate_unprotected+0x1e0> 200a61c: d8 00 60 04 ld [ %g1 + 4 ], %o4 _RBTree_Rotate(parent, dir); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 200a620: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200a624: 80 a0 e0 00 cmp %g3, 0 200a628: 22 80 00 07 be,a 200a644 <_RBTree_Extract_validate_unprotected+0x80> 200a62c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a630: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a634: 80 a0 e0 01 cmp %g3, 1 200a638: 22 80 00 29 be,a 200a6dc <_RBTree_Extract_validate_unprotected+0x118> 200a63c: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200a640: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a644: 80 a0 e0 00 cmp %g3, 0 200a648: 22 80 00 07 be,a 200a664 <_RBTree_Extract_validate_unprotected+0xa0> 200a64c: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a650: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a654: 80 a0 e0 01 cmp %g3, 1 200a658: 22 80 00 21 be,a 200a6dc <_RBTree_Extract_validate_unprotected+0x118> 200a65c: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200a660: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a664: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a668: 80 a0 a0 01 cmp %g2, 1 200a66c: 22 80 00 99 be,a 200a8d0 <_RBTree_Extract_validate_unprotected+0x30c> 200a670: 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; 200a674: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a678: 80 a0 e0 00 cmp %g3, 0 200a67c: 02 80 00 6c be 200a82c <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN 200a680: 90 10 00 01 mov %g1, %o0 if(!(the_node->parent->parent)) return NULL; 200a684: c4 00 c0 00 ld [ %g3 ], %g2 200a688: 80 a0 a0 00 cmp %g2, 0 200a68c: 02 80 00 69 be 200a830 <_RBTree_Extract_validate_unprotected+0x26c> 200a690: 84 10 20 00 clr %g2 if(the_node == the_node->parent->child[RBT_LEFT]) 200a694: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200a698: 80 a0 40 02 cmp %g1, %g2 200a69c: 22 80 00 0e be,a 200a6d4 <_RBTree_Extract_validate_unprotected+0x110> 200a6a0: c4 00 e0 08 ld [ %g3 + 8 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a6a4: 82 10 00 03 mov %g3, %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200a6a8: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a6ac: 80 a0 e0 01 cmp %g3, 1 200a6b0: 32 bf ff d3 bne,a 200a5fc <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 200a6b4: c6 00 40 00 ld [ %g1 ], %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200a6b8: c2 02 00 00 ld [ %o0 ], %g1 200a6bc: c2 00 40 00 ld [ %g1 ], %g1 200a6c0: 80 a0 60 00 cmp %g1, 0 200a6c4: 02 80 00 5f be 200a840 <_RBTree_Extract_validate_unprotected+0x27c> 200a6c8: 01 00 00 00 nop 200a6cc: 81 c3 e0 08 retl 200a6d0: 01 00 00 00 nop RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a6d4: 10 bf ff f5 b 200a6a8 <_RBTree_Extract_validate_unprotected+0xe4> 200a6d8: 82 10 00 03 mov %g3, %g1 * 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]; 200a6dc: 86 1a 00 03 xor %o0, %g3, %g3 200a6e0: 80 a0 00 03 cmp %g0, %g3 200a6e4: 9a 40 20 00 addx %g0, 0, %o5 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a6e8: 86 1b 60 01 xor %o5, 1, %g3 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 200a6ec: 87 28 e0 02 sll %g3, 2, %g3 200a6f0: 88 00 80 03 add %g2, %g3, %g4 200a6f4: 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); 200a6f8: 80 a1 20 00 cmp %g4, 0 200a6fc: 22 80 00 07 be,a 200a718 <_RBTree_Extract_validate_unprotected+0x154> 200a700: 9b 2b 60 02 sll %o5, 2, %o5 200a704: d8 01 20 0c ld [ %g4 + 0xc ], %o4 200a708: 80 a3 20 01 cmp %o4, 1 200a70c: 22 80 00 4f be,a 200a848 <_RBTree_Extract_validate_unprotected+0x284> 200a710: d6 00 60 0c ld [ %g1 + 0xc ], %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200a714: 9b 2b 60 02 sll %o5, 2, %o5 200a718: 98 00 80 0d add %g2, %o5, %o4 200a71c: c8 03 20 04 ld [ %o4 + 4 ], %g4 * 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[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; 200a720: 96 10 20 01 mov 1, %o3 200a724: d6 20 a0 0c st %o3, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a728: 80 a1 20 00 cmp %g4, 0 200a72c: 02 80 00 15 be 200a780 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 200a730: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a734: 96 01 00 03 add %g4, %g3, %o3 200a738: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200a73c: d4 23 20 04 st %o2, [ %o4 + 4 ] if (c->child[dir]) 200a740: d8 02 e0 04 ld [ %o3 + 4 ], %o4 200a744: 80 a3 20 00 cmp %o4, 0 200a748: 32 80 00 02 bne,a 200a750 <_RBTree_Extract_validate_unprotected+0x18c> 200a74c: c4 23 00 00 st %g2, [ %o4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a750: d8 00 80 00 ld [ %g2 ], %o4 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200a754: 96 01 00 03 add %g4, %g3, %o3 200a758: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a75c: d6 03 20 04 ld [ %o4 + 4 ], %o3 c->parent = the_node->parent; 200a760: d8 21 00 00 st %o4, [ %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; 200a764: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 200a768: 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; 200a76c: 80 a0 00 0b cmp %g0, %o3 200a770: 84 40 20 00 addx %g0, 0, %g2 200a774: 85 28 a0 02 sll %g2, 2, %g2 200a778: 98 03 00 02 add %o4, %g2, %o4 200a77c: c8 23 20 04 st %g4, [ %o4 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 200a780: c8 00 60 0c ld [ %g1 + 0xc ], %g4 dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; 200a784: 84 00 40 03 add %g1, %g3, %g2 200a788: c4 00 a0 04 ld [ %g2 + 4 ], %g2 } sibling->color = parent->color; 200a78c: c8 20 a0 0c st %g4, [ %g2 + 0xc ] 200a790: 88 00 80 03 add %g2, %g3, %g4 200a794: c8 01 20 04 ld [ %g4 + 4 ], %g4 parent->color = RBT_BLACK; 200a798: c0 20 60 0c clr [ %g1 + 0xc ] sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; 200a79c: 10 80 00 33 b 200a868 <_RBTree_Extract_validate_unprotected+0x2a4> 200a7a0: c0 21 20 0c clr [ %g4 + 0xc ] * 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; 200a7a4: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200a7a8: 88 1b 00 08 xor %o4, %o0, %g4 200a7ac: 80 a0 00 04 cmp %g0, %g4 200a7b0: 94 40 20 00 addx %g0, 0, %o2 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a7b4: 96 1a a0 01 xor %o2, 1, %o3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a7b8: 97 2a e0 02 sll %o3, 2, %o3 200a7bc: 98 00 40 0b add %g1, %o3, %o4 200a7c0: c8 03 20 04 ld [ %o4 + 4 ], %g4 200a7c4: 80 a1 20 00 cmp %g4, 0 200a7c8: 02 80 00 1c be 200a838 <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN 200a7cc: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a7d0: 95 2a a0 02 sll %o2, 2, %o2 200a7d4: 84 01 00 0a add %g4, %o2, %g2 200a7d8: d2 00 a0 04 ld [ %g2 + 4 ], %o1 200a7dc: d2 23 20 04 st %o1, [ %o4 + 4 ] if (c->child[dir]) 200a7e0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a7e4: 80 a0 a0 00 cmp %g2, 0 200a7e8: 02 80 00 04 be 200a7f8 <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN 200a7ec: 94 01 00 0a add %g4, %o2, %o2 c->child[dir]->parent = the_node; 200a7f0: c2 20 80 00 st %g1, [ %g2 ] 200a7f4: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200a7f8: c2 22 a0 04 st %g1, [ %o2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a7fc: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200a800: c6 21 00 00 st %g3, [ %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; 200a804: 84 18 40 02 xor %g1, %g2, %g2 200a808: 80 a0 00 02 cmp %g0, %g2 200a80c: 84 40 20 00 addx %g0, 0, %g2 200a810: 85 28 a0 02 sll %g2, 2, %g2 200a814: 96 00 40 0b add %g1, %o3, %o3 200a818: 86 00 c0 02 add %g3, %g2, %g3 c->parent = the_node->parent; the_node->parent = c; 200a81c: c8 20 40 00 st %g4, [ %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; 200a820: c8 20 e0 04 st %g4, [ %g3 + 4 ] 200a824: 10 bf ff 7f b 200a620 <_RBTree_Extract_validate_unprotected+0x5c> 200a828: c4 02 e0 04 ld [ %o3 + 4 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a82c: 84 10 20 00 clr %g2 <== NOT EXECUTED 200a830: 10 bf ff 9e b 200a6a8 <_RBTree_Extract_validate_unprotected+0xe4> 200a834: 82 10 00 03 mov %g3, %g1 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a838: 10 bf ff 7a b 200a620 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED 200a83c: 84 10 20 00 clr %g2 <== NOT EXECUTED sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200a840: 81 c3 e0 08 retl 200a844: c0 22 20 0c clr [ %o0 + 0xc ] 200a848: 98 00 40 03 add %g1, %g3, %o4 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 200a84c: d6 20 a0 0c st %o3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200a850: c0 20 60 0c clr [ %g1 + 0xc ] 200a854: c4 03 20 04 ld [ %o4 + 4 ], %g2 200a858: 80 a0 a0 00 cmp %g2, 0 200a85c: 02 bf ff 97 be 200a6b8 <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN 200a860: c0 21 20 0c clr [ %g4 + 0xc ] 200a864: 9b 2b 60 02 sll %o5, 2, %o5 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a868: 88 00 80 0d add %g2, %o5, %g4 200a86c: d8 01 20 04 ld [ %g4 + 4 ], %o4 200a870: 86 00 40 03 add %g1, %g3, %g3 200a874: d8 20 e0 04 st %o4, [ %g3 + 4 ] if (c->child[dir]) 200a878: c6 01 20 04 ld [ %g4 + 4 ], %g3 200a87c: 80 a0 e0 00 cmp %g3, 0 200a880: 32 80 00 02 bne,a 200a888 <_RBTree_Extract_validate_unprotected+0x2c4> 200a884: c2 20 c0 00 st %g1, [ %g3 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a888: c6 00 40 00 ld [ %g1 ], %g3 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200a88c: 9a 00 80 0d add %g2, %o5, %o5 200a890: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a894: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 200a898: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 200a89c: 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; 200a8a0: 88 18 40 04 xor %g1, %g4, %g4 200a8a4: 80 a0 00 04 cmp %g0, %g4 200a8a8: 82 40 20 00 addx %g0, 0, %g1 200a8ac: 83 28 60 02 sll %g1, 2, %g1 200a8b0: 86 00 c0 01 add %g3, %g1, %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200a8b4: c2 02 00 00 ld [ %o0 ], %g1 200a8b8: c4 20 e0 04 st %g2, [ %g3 + 4 ] 200a8bc: c2 00 40 00 ld [ %g1 ], %g1 200a8c0: 80 a0 60 00 cmp %g1, 0 200a8c4: 12 bf ff 82 bne 200a6cc <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200a8c8: 01 00 00 00 nop 200a8cc: 30 bf ff dd b,a 200a840 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED 200a8d0: c2 02 00 00 ld [ %o0 ], %g1 200a8d4: c2 00 40 00 ld [ %g1 ], %g1 200a8d8: 80 a0 60 00 cmp %g1, 0 200a8dc: 12 bf ff 7c bne 200a6cc <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200a8e0: 01 00 00 00 nop 200a8e4: 30 bf ff d7 b,a 200a840 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED =============================================================================== 0200b4dc <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200b4dc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200b4e0: 7f ff e1 ed call 2003c94 200b4e4: b8 10 00 18 mov %i0, %i4 200b4e8: b6 10 00 08 mov %o0, %i3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 200b4ec: fa 06 20 04 ld [ %i0 + 4 ], %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b4f0: 80 a7 60 00 cmp %i5, 0 200b4f4: 02 80 00 15 be 200b548 <_RBTree_Find+0x6c> <== NEVER TAKEN 200b4f8: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200b4fc: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200b500: 92 10 00 1d mov %i5, %o1 200b504: 9f c0 40 00 call %g1 200b508: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b50c: 83 3a 20 1f sra %o0, 0x1f, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 200b510: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b514: 82 20 40 08 sub %g1, %o0, %g1 200b518: 83 30 60 1f srl %g1, 0x1f, %g1 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b51c: 83 28 60 02 sll %g1, 2, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 200b520: 12 80 00 06 bne 200b538 <_RBTree_Find+0x5c> 200b524: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200b528: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200b52c: 80 a0 a0 00 cmp %g2, 0 200b530: 12 80 00 0a bne 200b558 <_RBTree_Find+0x7c> 200b534: b0 10 00 1d mov %i5, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b538: fa 00 60 04 ld [ %g1 + 4 ], %i5 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b53c: 80 a7 60 00 cmp %i5, 0 200b540: 32 bf ff f0 bne,a 200b500 <_RBTree_Find+0x24> 200b544: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b548: 7f ff e1 d7 call 2003ca4 200b54c: 90 10 00 1b mov %i3, %o0 return return_node; } 200b550: 81 c7 e0 08 ret 200b554: 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 ); 200b558: 7f ff e1 d3 call 2003ca4 200b55c: 90 10 00 1b mov %i3, %o0 return return_node; } 200b560: 81 c7 e0 08 ret 200b564: 81 e8 00 00 restore =============================================================================== 0200b948 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200b948: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200b94c: 80 a6 20 00 cmp %i0, 0 200b950: 02 80 00 0f be 200b98c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200b954: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200b958: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200b95c: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200b960: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200b964: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200b968: 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-- ) { 200b96c: 02 80 00 08 be 200b98c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200b970: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 200b974: 92 10 00 1a mov %i2, %o1 200b978: 7f ff ff 0b call 200b5a4 <_RBTree_Insert_unprotected> 200b97c: 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-- ) { 200b980: b6 86 ff ff addcc %i3, -1, %i3 200b984: 12 bf ff fc bne 200b974 <_RBTree_Initialize+0x2c> 200b988: b4 06 80 1c add %i2, %i4, %i2 200b98c: 81 c7 e0 08 ret 200b990: 81 e8 00 00 restore =============================================================================== 0200aac8 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200aac8: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200aacc: 80 a6 60 00 cmp %i1, 0 200aad0: 02 80 00 9c be 200ad40 <_RBTree_Insert_unprotected+0x278> 200aad4: b8 10 00 18 mov %i0, %i4 RBTree_Node *iter_node = the_rbtree->root; 200aad8: fa 06 20 04 ld [ %i0 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200aadc: 80 a7 60 00 cmp %i5, 0 200aae0: 32 80 00 05 bne,a 200aaf4 <_RBTree_Insert_unprotected+0x2c> 200aae4: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200aae8: 10 80 00 9a b 200ad50 <_RBTree_Insert_unprotected+0x288> 200aaec: c0 26 60 0c clr [ %i1 + 0xc ] the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); 200aaf0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200aaf4: 92 10 00 1d mov %i5, %o1 200aaf8: 9f c0 40 00 call %g1 200aafc: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ab00: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200ab04: b6 38 00 08 xnor %g0, %o0, %i3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ab08: 80 a0 a0 00 cmp %g2, 0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200ab0c: b7 36 e0 1f srl %i3, 0x1f, %i3 if (!iter_node->child[dir]) { 200ab10: 83 2e e0 02 sll %i3, 2, %g1 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ab14: 02 80 00 05 be 200ab28 <_RBTree_Insert_unprotected+0x60> 200ab18: 82 07 40 01 add %i5, %g1, %g1 200ab1c: 80 a2 20 00 cmp %o0, 0 200ab20: 02 80 00 8a be 200ad48 <_RBTree_Insert_unprotected+0x280> 200ab24: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { 200ab28: f0 00 60 04 ld [ %g1 + 4 ], %i0 200ab2c: 80 a6 20 00 cmp %i0, 0 200ab30: 32 bf ff f0 bne,a 200aaf0 <_RBTree_Insert_unprotected+0x28> 200ab34: ba 10 00 18 mov %i0, %i5 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 200ab38: c4 07 20 10 ld [ %i4 + 0x10 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200ab3c: b4 06 e0 02 add %i3, 2, %i2 200ab40: 87 2e a0 02 sll %i2, 2, %g3 200ab44: d2 07 00 03 ld [ %i4 + %g3 ], %o1 compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200ab48: c0 26 60 08 clr [ %i1 + 8 ] 200ab4c: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; 200ab50: f2 20 60 04 st %i1, [ %g1 + 4 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200ab54: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; 200ab58: fa 26 40 00 st %i5, [ %i1 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200ab5c: c2 26 60 0c st %g1, [ %i1 + 0xc ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 200ab60: 9f c0 80 00 call %g2 200ab64: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 200ab68: 80 a6 e0 00 cmp %i3, 0 200ab6c: 12 80 00 10 bne 200abac <_RBTree_Insert_unprotected+0xe4> 200ab70: 80 a2 20 00 cmp %o0, 0 200ab74: 06 80 00 10 bl 200abb4 <_RBTree_Insert_unprotected+0xec> 200ab78: b5 2e a0 02 sll %i2, 2, %i2 200ab7c: c2 06 40 00 ld [ %i1 ], %g1 if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; g->color = RBT_RED; 200ab80: b4 10 20 01 mov 1, %i2 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200ab84: c4 00 40 00 ld [ %g1 ], %g2 200ab88: 86 90 a0 00 orcc %g2, 0, %g3 200ab8c: 22 80 00 06 be,a 200aba4 <_RBTree_Insert_unprotected+0xdc> 200ab90: c0 26 60 0c clr [ %i1 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200ab94: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200ab98: 80 a1 20 01 cmp %g4, 1 200ab9c: 22 80 00 08 be,a 200abbc <_RBTree_Insert_unprotected+0xf4> 200aba0: f6 00 80 00 ld [ %g2 ], %i3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200aba4: 81 c7 e0 08 ret 200aba8: 81 e8 00 00 restore compare_result = the_rbtree->compare_function( the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || (dir && _RBTree_Is_greater(compare_result)) ) { 200abac: 04 bf ff f4 ble 200ab7c <_RBTree_Insert_unprotected+0xb4> 200abb0: b5 2e a0 02 sll %i2, 2, %i2 the_rbtree->first[dir] = the_node; 200abb4: 10 bf ff f2 b 200ab7c <_RBTree_Insert_unprotected+0xb4> 200abb8: f2 27 00 1a st %i1, [ %i4 + %i2 ] ) { 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; 200abbc: 80 a6 e0 00 cmp %i3, 0 200abc0: 02 80 00 0c be 200abf0 <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN 200abc4: c8 00 a0 04 ld [ %g2 + 4 ], %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]) 200abc8: 80 a1 00 01 cmp %g4, %g1 200abcc: 02 80 00 5b be 200ad38 <_RBTree_Insert_unprotected+0x270> 200abd0: ba 10 00 04 mov %g4, %i5 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200abd4: 80 a7 60 00 cmp %i5, 0 200abd8: 22 80 00 07 be,a 200abf4 <_RBTree_Insert_unprotected+0x12c> 200abdc: fa 00 60 04 ld [ %g1 + 4 ], %i5 200abe0: f8 07 60 0c ld [ %i5 + 0xc ], %i4 200abe4: 80 a7 20 01 cmp %i4, 1 200abe8: 22 80 00 4f be,a 200ad24 <_RBTree_Insert_unprotected+0x25c> 200abec: 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]; 200abf0: fa 00 60 04 ld [ %g1 + 4 ], %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200abf4: 88 18 40 04 xor %g1, %g4, %g4 200abf8: 80 a0 00 04 cmp %g0, %g4 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]; 200abfc: ba 1e 40 1d xor %i1, %i5, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ac00: 88 40 20 00 addx %g0, 0, %g4 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]; 200ac04: 80 a0 00 1d cmp %g0, %i5 200ac08: ba 40 20 00 addx %g0, 0, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200ac0c: 80 a7 40 04 cmp %i5, %g4 200ac10: 02 80 00 20 be 200ac90 <_RBTree_Insert_unprotected+0x1c8> 200ac14: 80 a0 00 04 cmp %g0, %g4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ac18: b6 60 3f ff subx %g0, -1, %i3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200ac1c: b7 2e e0 02 sll %i3, 2, %i3 200ac20: b6 00 40 1b add %g1, %i3, %i3 200ac24: fa 06 e0 04 ld [ %i3 + 4 ], %i5 200ac28: 80 a7 60 00 cmp %i5, 0 200ac2c: 02 80 00 16 be 200ac84 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN 200ac30: b9 29 20 02 sll %g4, 2, %i4 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200ac34: 9e 07 40 1c add %i5, %i4, %o7 200ac38: da 03 e0 04 ld [ %o7 + 4 ], %o5 200ac3c: da 26 e0 04 st %o5, [ %i3 + 4 ] if (c->child[dir]) 200ac40: f6 03 e0 04 ld [ %o7 + 4 ], %i3 200ac44: 80 a6 e0 00 cmp %i3, 0 200ac48: 22 80 00 05 be,a 200ac5c <_RBTree_Insert_unprotected+0x194> 200ac4c: b6 07 40 1c add %i5, %i4, %i3 c->child[dir]->parent = the_node; 200ac50: c2 26 c0 00 st %g1, [ %i3 ] 200ac54: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200ac58: b6 07 40 1c add %i5, %i4, %i3 200ac5c: c2 26 e0 04 st %g1, [ %i3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ac60: f6 00 a0 04 ld [ %g2 + 4 ], %i3 c->parent = the_node->parent; 200ac64: c4 27 40 00 st %g2, [ %i5 ] 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; 200ac68: b6 1e c0 01 xor %i3, %g1, %i3 c->parent = the_node->parent; the_node->parent = c; 200ac6c: fa 20 40 00 st %i5, [ %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; 200ac70: 80 a0 00 1b cmp %g0, %i3 200ac74: 82 40 20 00 addx %g0, 0, %g1 200ac78: 83 28 60 02 sll %g1, 2, %g1 200ac7c: 84 00 80 01 add %g2, %g1, %g2 200ac80: fa 20 a0 04 st %i5, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200ac84: b2 06 40 1c add %i1, %i4, %i1 200ac88: f2 06 60 04 ld [ %i1 + 4 ], %i1 200ac8c: c2 06 40 00 ld [ %i1 ], %g1 } the_node->parent->color = RBT_BLACK; 200ac90: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 200ac94: 88 26 80 04 sub %i2, %g4, %g4 200ac98: ba 19 20 01 xor %g4, 1, %i5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200ac9c: bb 2f 60 02 sll %i5, 2, %i5 200aca0: ba 00 c0 1d add %g3, %i5, %i5 200aca4: c4 07 60 04 ld [ %i5 + 4 ], %g2 200aca8: 80 a0 a0 00 cmp %g2, 0 200acac: 02 bf ff b6 be 200ab84 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN 200acb0: f4 20 e0 0c st %i2, [ %g3 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200acb4: 89 29 20 02 sll %g4, 2, %g4 200acb8: 82 00 80 04 add %g2, %g4, %g1 200acbc: f8 00 60 04 ld [ %g1 + 4 ], %i4 200acc0: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 200acc4: c2 00 60 04 ld [ %g1 + 4 ], %g1 200acc8: 80 a0 60 00 cmp %g1, 0 200accc: 32 80 00 02 bne,a 200acd4 <_RBTree_Insert_unprotected+0x20c> 200acd0: c6 20 40 00 st %g3, [ %g1 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200acd4: fa 00 c0 00 ld [ %g3 ], %i5 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200acd8: 88 00 80 04 add %g2, %g4, %g4 the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; 200acdc: fa 20 80 00 st %i5, [ %g2 ] the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200ace0: c6 21 20 04 st %g3, [ %g4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ace4: c8 07 60 04 ld [ %i5 + 4 ], %g4 c->parent = the_node->parent; the_node->parent = c; 200ace8: c4 20 c0 00 st %g2, [ %g3 ] 200acec: c2 06 40 00 ld [ %i1 ], %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; 200acf0: 86 18 c0 04 xor %g3, %g4, %g3 200acf4: 80 a0 00 03 cmp %g0, %g3 200acf8: 86 40 20 00 addx %g0, 0, %g3 200acfc: 87 28 e0 02 sll %g3, 2, %g3 200ad00: ba 07 40 03 add %i5, %g3, %i5 200ad04: c4 27 60 04 st %g2, [ %i5 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200ad08: c4 00 40 00 ld [ %g1 ], %g2 200ad0c: 86 90 a0 00 orcc %g2, 0, %g3 200ad10: 32 bf ff a2 bne,a 200ab98 <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN 200ad14: c8 00 60 0c ld [ %g1 + 0xc ], %g4 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200ad18: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200ad1c: 81 c7 e0 08 ret <== NOT EXECUTED 200ad20: 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; 200ad24: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; 200ad28: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 200ad2c: 82 10 00 1b mov %i3, %g1 200ad30: 10 bf ff 95 b 200ab84 <_RBTree_Insert_unprotected+0xbc> 200ad34: b2 10 00 02 mov %g2, %i1 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]; 200ad38: 10 bf ff a7 b 200abd4 <_RBTree_Insert_unprotected+0x10c> 200ad3c: fa 00 a0 08 ld [ %g2 + 8 ], %i5 RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { if(!the_node) return (RBTree_Node*)-1; 200ad40: 81 c7 e0 08 ret 200ad44: 91 e8 3f ff restore %g0, -1, %o0 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ad48: 81 c7 e0 08 ret 200ad4c: 91 e8 00 1d restore %g0, %i5, %o0 RBTree_Node *iter_node = the_rbtree->root; int compare_result; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 200ad50: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200ad54: f2 26 20 0c st %i1, [ %i0 + 0xc ] 200ad58: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200ad5c: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200ad60: c0 26 60 08 clr [ %i1 + 8 ] 200ad64: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 200ad68: 81 c7 e0 08 ret 200ad6c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200ada0 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200ada0: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ada4: 80 a0 00 19 cmp %g0, %i1 200ada8: 82 60 3f ff subx %g0, -1, %g1 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200adac: 82 00 60 02 add %g1, 2, %g1 200adb0: 83 28 60 02 sll %g1, 2, %g1 200adb4: fa 06 00 01 ld [ %i0 + %g1 ], %i5 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 200adb8: 80 a7 60 00 cmp %i5, 0 200adbc: 12 80 00 06 bne 200add4 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN 200adc0: 94 10 00 1b mov %i3, %o2 200adc4: 30 80 00 0e b,a 200adfc <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED 200adc8: 80 8f 20 ff btst 0xff, %i4 200adcc: 02 80 00 0c be 200adfc <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN 200add0: 94 10 00 1b mov %i3, %o2 stop = (*visitor)( current, dir, visitor_arg ); 200add4: 90 10 00 1d mov %i5, %o0 200add8: 9f c6 80 00 call %i2 200addc: 92 10 00 19 mov %i1, %o1 current = _RBTree_Next_unprotected( current, dir ); 200ade0: 92 10 00 19 mov %i1, %o1 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { stop = (*visitor)( current, dir, visitor_arg ); 200ade4: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 200ade8: 40 00 00 07 call 200ae04 <_RBTree_Next_unprotected> 200adec: 90 10 00 1d mov %i5, %o0 { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 200adf0: ba 92 20 00 orcc %o0, 0, %i5 200adf4: 12 bf ff f5 bne 200adc8 <_RBTree_Iterate_unprotected+0x28> 200adf8: b8 1f 20 01 xor %i4, 1, %i4 200adfc: 81 c7 e0 08 ret 200ae00: 81 e8 00 00 restore =============================================================================== 02008bec <_RTEMS_signal_Post_switch_hook>: #include #include #include static void _RTEMS_signal_Post_switch_hook( Thread_Control *executing ) { 2008bec: 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 ]; 2008bf0: fa 06 21 50 ld [ %i0 + 0x150 ], %i5 if ( !api ) 2008bf4: 80 a7 60 00 cmp %i5, 0 2008bf8: 02 80 00 1e be 2008c70 <_RTEMS_signal_Post_switch_hook+0x84><== NEVER TAKEN 2008bfc: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 2008c00: 7f ff ea 2c call 20034b0 2008c04: 01 00 00 00 nop signal_set = asr->signals_posted; 2008c08: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 asr->signals_posted = 0; 2008c0c: c0 27 60 14 clr [ %i5 + 0x14 ] _ISR_Enable( level ); 2008c10: 7f ff ea 2c call 20034c0 2008c14: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 2008c18: 80 a7 20 00 cmp %i4, 0 2008c1c: 32 80 00 04 bne,a 2008c2c <_RTEMS_signal_Post_switch_hook+0x40> 2008c20: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2008c24: 81 c7 e0 08 ret 2008c28: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 2008c2c: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 2008c30: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 2008c34: 94 07 bf fc add %fp, -4, %o2 2008c38: 37 00 00 3f sethi %hi(0xfc00), %i3 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 2008c3c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 2008c40: 40 00 01 07 call 200905c 2008c44: 92 16 e3 ff or %i3, 0x3ff, %o1 (*asr->handler)( signal_set ); 2008c48: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2008c4c: 9f c0 40 00 call %g1 2008c50: 90 10 00 1c mov %i4, %o0 asr->nest_level -= 1; 2008c54: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 2008c58: 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; 2008c5c: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 2008c60: 92 16 e3 ff or %i3, 0x3ff, %o1 2008c64: 94 07 bf fc add %fp, -4, %o2 2008c68: 40 00 00 fd call 200905c 2008c6c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] 2008c70: 81 c7 e0 08 ret 2008c74: 81 e8 00 00 restore =============================================================================== 02007fa0 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2007fa0: 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; 2007fa4: 03 00 80 70 sethi %hi(0x201c000), %g1 2007fa8: 82 10 60 64 or %g1, 0x64, %g1 ! 201c064 2007fac: 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 ) 2007fb0: 80 a7 60 00 cmp %i5, 0 2007fb4: 02 80 00 18 be 2008014 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 2007fb8: 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++ ) { 2007fbc: 80 a6 e0 00 cmp %i3, 0 2007fc0: 02 80 00 15 be 2008014 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2007fc4: b8 10 20 00 clr %i4 return_value = rtems_task_create( 2007fc8: d4 07 60 04 ld [ %i5 + 4 ], %o2 2007fcc: d0 07 40 00 ld [ %i5 ], %o0 2007fd0: d2 07 60 08 ld [ %i5 + 8 ], %o1 2007fd4: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 2007fd8: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2007fdc: 7f ff ff 70 call 2007d9c 2007fe0: 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 ) ) 2007fe4: 94 92 20 00 orcc %o0, 0, %o2 2007fe8: 12 80 00 0d bne 200801c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2007fec: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2007ff0: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2007ff4: 40 00 00 0e call 200802c 2007ff8: 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 ) ) 2007ffc: 94 92 20 00 orcc %o0, 0, %o2 2008000: 12 80 00 07 bne 200801c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008004: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 2008008: 80 a7 00 1b cmp %i4, %i3 200800c: 12 bf ff ef bne 2007fc8 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2008010: ba 07 60 1c add %i5, 0x1c, %i5 2008014: 81 c7 e0 08 ret 2008018: 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 ); 200801c: 90 10 20 01 mov 1, %o0 2008020: 40 00 04 14 call 2009070 <_Internal_error_Occurred> 2008024: 92 10 20 01 mov 1, %o1 =============================================================================== 0200d11c <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200d11c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 while (tvp) { 200d120: 80 a0 60 00 cmp %g1, 0 200d124: 22 80 00 0c be,a 200d154 <_RTEMS_tasks_Switch_extension+0x38> 200d128: c2 02 61 5c ld [ %o1 + 0x15c ], %g1 tvp->tval = *tvp->ptr; 200d12c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200d130: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200d134: c8 00 80 00 ld [ %g2 ], %g4 200d138: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200d13c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200d140: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200d144: 80 a0 60 00 cmp %g1, 0 200d148: 32 bf ff fa bne,a 200d130 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200d14c: 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; 200d150: c2 02 61 5c ld [ %o1 + 0x15c ], %g1 while (tvp) { 200d154: 80 a0 60 00 cmp %g1, 0 200d158: 02 80 00 0d be 200d18c <_RTEMS_tasks_Switch_extension+0x70> 200d15c: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200d160: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200d164: 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; 200d168: c8 00 80 00 ld [ %g2 ], %g4 200d16c: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200d170: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200d174: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200d178: 80 a0 60 00 cmp %g1, 0 200d17c: 32 bf ff fa bne,a 200d164 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200d180: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200d184: 81 c3 e0 08 retl 200d188: 01 00 00 00 nop 200d18c: 81 c3 e0 08 retl =============================================================================== 020370cc <_Rate_monotonic_Get_status>: bool _Rate_monotonic_Get_status( Rate_monotonic_Control *the_period, Rate_monotonic_Period_time_t *wall_since_last_period, Thread_CPU_usage_t *cpu_since_last_period ) { 20370cc: 9d e3 bf 98 save %sp, -104, %sp */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 20370d0: 13 00 81 96 sethi %hi(0x2065800), %o1 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 20370d4: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 20370d8: 90 07 bf f8 add %fp, -8, %o0 20370dc: 7f ff 45 f8 call 20088bc <_TOD_Get_with_nanoseconds> 20370e0: 92 12 63 90 or %o1, 0x390, %o1 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 20370e4: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 20370e8: f8 1e 20 50 ldd [ %i0 + 0x50 ], %i4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 20370ec: 03 00 81 97 sethi %hi(0x2065c00), %g1 20370f0: 82 10 62 50 or %g1, 0x250, %g1 ! 2065e50 <_Per_CPU_Information> 20370f4: de 00 60 10 ld [ %g1 + 0x10 ], %o7 20370f8: ba a0 c0 1d subcc %g3, %i5, %i5 20370fc: b8 60 80 1c subx %g2, %i4, %i4 2037100: f8 3e 40 00 std %i4, [ %i1 ] if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2037104: 88 10 20 01 mov 1, %g4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2037108: 80 a3 c0 1b cmp %o7, %i3 203710c: 02 80 00 05 be 2037120 <_Rate_monotonic_Get_status+0x54> 2037110: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 2037114: b0 09 20 01 and %g4, 1, %i0 2037118: 81 c7 e0 08 ret 203711c: 81 e8 00 00 restore 2037120: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2037124: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 2037128: 86 a0 c0 0d subcc %g3, %o5, %g3 203712c: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2037130: 9a 87 40 03 addcc %i5, %g3, %o5 2037134: 98 47 00 02 addx %i4, %g2, %o4 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2037138: 80 a6 00 0c cmp %i0, %o4 203713c: 14 bf ff f6 bg 2037114 <_Rate_monotonic_Get_status+0x48> <== NEVER TAKEN 2037140: 88 10 20 00 clr %g4 2037144: 02 80 00 09 be 2037168 <_Rate_monotonic_Get_status+0x9c> 2037148: 80 a6 40 0d cmp %i1, %o5 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 203714c: 9a a3 40 19 subcc %o5, %i1, %o5 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2037150: 88 10 20 01 mov 1, %g4 2037154: 98 63 00 18 subx %o4, %i0, %o4 } 2037158: b0 09 20 01 and %g4, 1, %i0 203715c: d8 3e 80 00 std %o4, [ %i2 ] 2037160: 81 c7 e0 08 ret 2037164: 81 e8 00 00 restore /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2037168: 28 bf ff fa bleu,a 2037150 <_Rate_monotonic_Get_status+0x84> 203716c: 9a a3 40 19 subcc %o5, %i1, %o5 return false; 2037170: 10 bf ff e9 b 2037114 <_Rate_monotonic_Get_status+0x48> 2037174: 88 10 20 00 clr %g4 =============================================================================== 0203751c <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 203751c: 9d e3 bf 98 save %sp, -104, %sp 2037520: 11 00 81 98 sethi %hi(0x2066000), %o0 2037524: 92 10 00 18 mov %i0, %o1 2037528: 90 12 20 74 or %o0, 0x74, %o0 203752c: 7f ff 47 b8 call 200940c <_Objects_Get> 2037530: 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 ) { 2037534: c2 07 bf fc ld [ %fp + -4 ], %g1 2037538: 80 a0 60 00 cmp %g1, 0 203753c: 12 80 00 16 bne 2037594 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 2037540: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2037544: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2037548: 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); 203754c: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2037550: 80 88 80 01 btst %g2, %g1 2037554: 22 80 00 08 be,a 2037574 <_Rate_monotonic_Timeout+0x58> 2037558: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 203755c: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2037560: c2 07 60 08 ld [ %i5 + 8 ], %g1 2037564: 80 a0 80 01 cmp %g2, %g1 2037568: 02 80 00 19 be 20375cc <_Rate_monotonic_Timeout+0xb0> 203756c: 13 04 01 ff sethi %hi(0x1007fc00), %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 ) { 2037570: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2037574: 80 a0 60 01 cmp %g1, 1 2037578: 02 80 00 09 be 203759c <_Rate_monotonic_Timeout+0x80> 203757c: 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; 2037580: 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) { uint32_t level = _Thread_Dispatch_disable_level; 2037584: 03 00 81 97 sethi %hi(0x2065c00), %g1 2037588: c4 00 60 40 ld [ %g1 + 0x40 ], %g2 ! 2065c40 <_Thread_Dispatch_disable_level> --level; 203758c: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 2037590: c4 20 60 40 st %g2, [ %g1 + 0x40 ] 2037594: 81 c7 e0 08 ret 2037598: 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; 203759c: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 20375a0: 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; 20375a4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 20375a8: 7f ff ff 43 call 20372b4 <_Rate_monotonic_Initiate_statistics> 20375ac: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20375b0: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20375b4: 11 00 81 97 sethi %hi(0x2065c00), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20375b8: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20375bc: 90 12 20 dc or %o0, 0xdc, %o0 20375c0: 7f ff 4e bb call 200b0ac <_Watchdog_Insert> 20375c4: 92 07 60 10 add %i5, 0x10, %o1 20375c8: 30 bf ff ef b,a 2037584 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20375cc: 7f ff 4a 6e call 2009f84 <_Thread_Clear_state> 20375d0: 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 ); 20375d4: 10 bf ff f5 b 20375a8 <_Rate_monotonic_Timeout+0x8c> 20375d8: 90 10 00 1d mov %i5, %o0 =============================================================================== 02037178 <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 2037178: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 203717c: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037180: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2037184: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037188: 80 a0 60 04 cmp %g1, 4 203718c: 02 80 00 32 be 2037254 <_Rate_monotonic_Update_statistics+0xdc> 2037190: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 2037194: 90 10 00 18 mov %i0, %o0 2037198: 92 07 bf f8 add %fp, -8, %o1 203719c: 7f ff ff cc call 20370cc <_Rate_monotonic_Get_status> 20371a0: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 20371a4: 80 8a 20 ff btst 0xff, %o0 20371a8: 02 80 00 21 be 203722c <_Rate_monotonic_Update_statistics+0xb4> 20371ac: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 20371b0: f8 1e 20 70 ldd [ %i0 + 0x70 ], %i4 * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 20371b4: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 20371b8: b6 87 40 03 addcc %i5, %g3, %i3 20371bc: b4 47 00 02 addx %i4, %g2, %i2 20371c0: 80 a0 40 02 cmp %g1, %g2 20371c4: 04 80 00 1c ble 2037234 <_Rate_monotonic_Update_statistics+0xbc> 20371c8: f4 3e 20 70 std %i2, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 20371cc: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 20371d0: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 20371d4: 80 a0 40 02 cmp %g1, %g2 20371d8: 26 80 00 05 bl,a 20371ec <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 20371dc: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 20371e0: 80 a0 40 02 cmp %g1, %g2 20371e4: 22 80 00 28 be,a 2037284 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 20371e8: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 /* * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); 20371ec: c4 1f bf f8 ldd [ %fp + -8 ], %g2 20371f0: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 20371f4: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20371f8: b6 87 40 03 addcc %i5, %g3, %i3 20371fc: b4 47 00 02 addx %i4, %g2, %i2 2037200: 80 a0 40 02 cmp %g1, %g2 2037204: 14 80 00 1b bg 2037270 <_Rate_monotonic_Update_statistics+0xf8> 2037208: f4 3e 20 88 std %i2, [ %i0 + 0x88 ] 203720c: 80 a0 40 02 cmp %g1, %g2 2037210: 22 80 00 15 be,a 2037264 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN 2037214: c2 06 20 7c ld [ %i0 + 0x7c ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037218: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 203721c: 80 a0 40 02 cmp %g1, %g2 2037220: 16 80 00 1e bge 2037298 <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN 2037224: 01 00 00 00 nop stats->max_wall_time = since_last_period; 2037228: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 203722c: 81 c7 e0 08 ret 2037230: 81 e8 00 00 restore * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 2037234: 32 bf ff e8 bne,a 20371d4 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 2037238: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 203723c: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 2037240: 80 a0 40 03 cmp %g1, %g3 2037244: 28 bf ff e4 bleu,a 20371d4 <_Rate_monotonic_Update_statistics+0x5c> 2037248: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 203724c: 10 bf ff e1 b 20371d0 <_Rate_monotonic_Update_statistics+0x58> 2037250: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2037254: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2037258: 82 00 60 01 inc %g1 203725c: 10 bf ff ce b 2037194 <_Rate_monotonic_Update_statistics+0x1c> 2037260: c2 26 20 5c st %g1, [ %i0 + 0x5c ] * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2037264: 80 a0 40 03 cmp %g1, %g3 2037268: 28 bf ff ed bleu,a 203721c <_Rate_monotonic_Update_statistics+0xa4> 203726c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037270: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2037274: 80 a0 40 02 cmp %g1, %g2 2037278: 06 bf ff ec bl 2037228 <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 203727c: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 2037280: 30 80 00 06 b,a 2037298 <_Rate_monotonic_Update_statistics+0x120> _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) stats->min_cpu_time = executed; if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2037284: 80 a0 40 03 cmp %g1, %g3 2037288: 3a bf ff da bcc,a 20371f0 <_Rate_monotonic_Update_statistics+0x78> 203728c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 2037290: 10 bf ff d7 b 20371ec <_Rate_monotonic_Update_statistics+0x74> 2037294: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037298: 12 bf ff e5 bne 203722c <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 203729c: 01 00 00 00 nop 20372a0: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 20372a4: 80 a0 40 03 cmp %g1, %g3 20372a8: 2a bf ff e1 bcs,a 203722c <_Rate_monotonic_Update_statistics+0xb4> 20372ac: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 20372b0: 30 bf ff df b,a 203722c <_Rate_monotonic_Update_statistics+0xb4> =============================================================================== 0200a578 <_Scheduler_CBS_Allocate>: #include void *_Scheduler_CBS_Allocate( Thread_Control *the_thread ) { 200a578: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_CBS_Per_thread *schinfo; sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread)); 200a57c: 40 00 07 30 call 200c23c <_Workspace_Allocate> 200a580: 90 10 20 1c mov 0x1c, %o0 if ( sched ) { 200a584: 80 a2 20 00 cmp %o0, 0 200a588: 02 80 00 06 be 200a5a0 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN 200a58c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a590: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info); schinfo->edf_per_thread.thread = the_thread; 200a594: f0 22 00 00 st %i0, [ %o0 ] schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a598: c2 22 20 14 st %g1, [ %o0 + 0x14 ] schinfo->cbs_server = NULL; 200a59c: c0 22 20 18 clr [ %o0 + 0x18 ] } return sched; } 200a5a0: 81 c7 e0 08 ret 200a5a4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b94c <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200b94c: 9d e3 bf 98 save %sp, -104, %sp Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server_id server_id; /* Put violating task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200b950: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200b954: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b958: 80 a0 40 09 cmp %g1, %o1 200b95c: 32 80 00 02 bne,a 200b964 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200b960: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200b964: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200b968: 80 a0 40 09 cmp %g1, %o1 200b96c: 02 80 00 04 be 200b97c <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200b970: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200b974: 40 00 01 90 call 200bfb4 <_Thread_Change_priority> 200b978: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200b97c: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200b980: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b984: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200b988: 80 a0 a0 00 cmp %g2, 0 200b98c: 02 80 00 09 be 200b9b0 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200b990: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200b994: d0 00 40 00 ld [ %g1 ], %o0 200b998: 7f ff ff d5 call 200b8ec <_Scheduler_CBS_Get_server_id> 200b99c: 92 07 bf fc add %fp, -4, %o1 sched_info->cbs_server->task_id, &server_id ); sched_info->cbs_server->cbs_budget_overrun( server_id ); 200b9a0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b9a4: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200b9a8: 9f c0 40 00 call %g1 200b9ac: d0 07 bf fc ld [ %fp + -4 ], %o0 200b9b0: 81 c7 e0 08 ret 200b9b4: 81 e8 00 00 restore =============================================================================== 0200b4a4 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200b4a4: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b4a8: 39 00 80 7e sethi %hi(0x201f800), %i4 200b4ac: c2 07 20 a0 ld [ %i4 + 0xa0 ], %g1 ! 201f8a0 <_Scheduler_CBS_Maximum_servers> 200b4b0: 80 a0 60 00 cmp %g1, 0 200b4b4: 02 80 00 18 be 200b514 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200b4b8: 03 00 80 81 sethi %hi(0x2020400), %g1 200b4bc: 37 00 80 81 sethi %hi(0x2020400), %i3 200b4c0: c4 06 e2 e8 ld [ %i3 + 0x2e8 ], %g2 ! 20206e8 <_Scheduler_CBS_Server_list> 200b4c4: ba 10 20 00 clr %i5 200b4c8: b8 17 20 a0 or %i4, 0xa0, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200b4cc: 83 2f 60 02 sll %i5, 2, %g1 200b4d0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200b4d4: 80 a0 60 00 cmp %g1, 0 200b4d8: 02 80 00 05 be 200b4ec <_Scheduler_CBS_Cleanup+0x48> 200b4dc: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200b4e0: 40 00 00 46 call 200b5f8 <_Scheduler_CBS_Destroy_server> 200b4e4: 01 00 00 00 nop 200b4e8: c4 06 e2 e8 ld [ %i3 + 0x2e8 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b4ec: c2 07 00 00 ld [ %i4 ], %g1 200b4f0: ba 07 60 01 inc %i5 200b4f4: 80 a0 40 1d cmp %g1, %i5 200b4f8: 18 bf ff f6 bgu 200b4d0 <_Scheduler_CBS_Cleanup+0x2c> 200b4fc: 83 2f 60 02 sll %i5, 2, %g1 if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); return SCHEDULER_CBS_OK; } 200b500: b0 10 20 00 clr %i0 for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); 200b504: 40 00 08 60 call 200d684 <_Workspace_Free> 200b508: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200b50c: 81 c7 e0 08 ret 200b510: 81 e8 00 00 restore 200b514: 10 bf ff fb b 200b500 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200b518: c4 00 62 e8 ld [ %g1 + 0x2e8 ], %g2 <== NOT EXECUTED =============================================================================== 0200b51c <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b51c: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b520: c2 06 20 04 ld [ %i0 + 4 ], %g1 200b524: 80 a0 60 00 cmp %g1, 0 200b528: 04 80 00 30 ble 200b5e8 <_Scheduler_CBS_Create_server+0xcc> 200b52c: b8 10 00 18 mov %i0, %i4 200b530: c2 06 00 00 ld [ %i0 ], %g1 200b534: 80 a0 60 00 cmp %g1, 0 200b538: 04 80 00 2c ble 200b5e8 <_Scheduler_CBS_Create_server+0xcc> 200b53c: 03 00 80 7e sethi %hi(0x201f800), %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b540: c8 00 60 a0 ld [ %g1 + 0xa0 ], %g4 ! 201f8a0 <_Scheduler_CBS_Maximum_servers> 200b544: 80 a1 20 00 cmp %g4, 0 200b548: 02 80 00 11 be 200b58c <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN 200b54c: 37 00 80 81 sethi %hi(0x2020400), %i3 if ( !_Scheduler_CBS_Server_list[i] ) 200b550: fa 06 e2 e8 ld [ %i3 + 0x2e8 ], %i5 ! 20206e8 <_Scheduler_CBS_Server_list> 200b554: c2 07 40 00 ld [ %i5 ], %g1 200b558: 80 a0 60 00 cmp %g1, 0 200b55c: 02 80 00 21 be 200b5e0 <_Scheduler_CBS_Create_server+0xc4> 200b560: b0 10 20 00 clr %i0 200b564: 10 80 00 06 b 200b57c <_Scheduler_CBS_Create_server+0x60> 200b568: 82 10 20 00 clr %g1 200b56c: c6 07 40 02 ld [ %i5 + %g2 ], %g3 200b570: 80 a0 e0 00 cmp %g3, 0 200b574: 02 80 00 08 be 200b594 <_Scheduler_CBS_Create_server+0x78> 200b578: b0 10 00 02 mov %g2, %i0 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b57c: 82 00 60 01 inc %g1 200b580: 80 a0 40 04 cmp %g1, %g4 200b584: 12 bf ff fa bne 200b56c <_Scheduler_CBS_Create_server+0x50> 200b588: 85 28 60 02 sll %g1, 2, %g2 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 200b58c: 81 c7 e0 08 ret 200b590: 91 e8 3f e6 restore %g0, -26, %o0 *server_id = i; 200b594: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b598: 40 00 08 33 call 200d664 <_Workspace_Allocate> 200b59c: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b5a0: c2 06 80 00 ld [ %i2 ], %g1 if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 200b5a4: d0 27 40 18 st %o0, [ %i5 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b5a8: c4 06 e2 e8 ld [ %i3 + 0x2e8 ], %g2 200b5ac: 83 28 60 02 sll %g1, 2, %g1 200b5b0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b5b4: 80 a0 60 00 cmp %g1, 0 200b5b8: 02 80 00 0e be 200b5f0 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN 200b5bc: 86 10 3f ff mov -1, %g3 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b5c0: c4 07 00 00 ld [ %i4 ], %g2 200b5c4: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b5c8: c4 07 20 04 ld [ %i4 + 4 ], %g2 the_server->task_id = -1; 200b5cc: c6 20 40 00 st %g3, [ %g1 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b5d0: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b5d4: f2 20 60 0c st %i1, [ %g1 + 0xc ] return SCHEDULER_CBS_OK; 200b5d8: 81 c7 e0 08 ret 200b5dc: 91 e8 20 00 restore %g0, 0, %o0 params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( !_Scheduler_CBS_Server_list[i] ) 200b5e0: 10 bf ff ed b 200b594 <_Scheduler_CBS_Create_server+0x78> 200b5e4: 82 10 20 00 clr %g1 if ( params->budget <= 0 || params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 200b5e8: 81 c7 e0 08 ret 200b5ec: 91 e8 3f ee restore %g0, -18, %o0 the_server->parameters = *params; the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; } 200b5f0: 81 c7 e0 08 ret <== NOT EXECUTED 200b5f4: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 0200b678 <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b678: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Thread_Control *the_thread; Scheduler_CBS_Per_thread *sched_info; the_thread = _Thread_Get(task_id, &location); 200b67c: 92 07 bf fc add %fp, -4, %o1 200b680: 40 00 03 ab call 200c52c <_Thread_Get> 200b684: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b688: ba 92 20 00 orcc %o0, 0, %i5 200b68c: 02 80 00 1e be 200b704 <_Scheduler_CBS_Detach_thread+0x8c> 200b690: 01 00 00 00 nop _Thread_Enable_dispatch(); 200b694: 40 00 03 9a call 200c4fc <_Thread_Enable_dispatch> 200b698: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b69c: 03 00 80 7e sethi %hi(0x201f800), %g1 200b6a0: c2 00 60 a0 ld [ %g1 + 0xa0 ], %g1 ! 201f8a0 <_Scheduler_CBS_Maximum_servers> 200b6a4: 80 a6 00 01 cmp %i0, %g1 200b6a8: 1a 80 00 17 bcc 200b704 <_Scheduler_CBS_Detach_thread+0x8c> 200b6ac: 03 00 80 81 sethi %hi(0x2020400), %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 200b6b0: c2 00 62 e8 ld [ %g1 + 0x2e8 ], %g1 ! 20206e8 <_Scheduler_CBS_Server_list> 200b6b4: b1 2e 20 02 sll %i0, 2, %i0 200b6b8: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200b6bc: 80 a0 60 00 cmp %g1, 0 200b6c0: 02 80 00 13 be 200b70c <_Scheduler_CBS_Detach_thread+0x94> 200b6c4: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 200b6c8: c4 00 40 00 ld [ %g1 ], %g2 200b6cc: 80 a0 80 19 cmp %g2, %i1 200b6d0: 12 80 00 0d bne 200b704 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN 200b6d4: 84 10 3f ff mov -1, %g2 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200b6d8: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b6dc: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 200b6e0: c4 20 40 00 st %g2, [ %g1 ] sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; 200b6e4: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b6e8: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200b6ec: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b6f0: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b6f4: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b6f8: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 200b6fc: 81 c7 e0 08 ret 200b700: 91 e8 20 00 restore %g0, 0, %o0 if ( the_thread ) { _Thread_Enable_dispatch(); } if ( server_id >= _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 200b704: 81 c7 e0 08 ret 200b708: 91 e8 3f ee restore %g0, -18, %o0 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; } 200b70c: 81 c7 e0 08 ret 200b710: 91 e8 3f e7 restore %g0, -25, %o0 =============================================================================== 0200b8ec <_Scheduler_CBS_Get_server_id>: rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b8ec: 03 00 80 7e sethi %hi(0x201f800), %g1 200b8f0: c6 00 60 a0 ld [ %g1 + 0xa0 ], %g3 ! 201f8a0 <_Scheduler_CBS_Maximum_servers> 200b8f4: 80 a0 e0 00 cmp %g3, 0 200b8f8: 02 80 00 11 be 200b93c <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN 200b8fc: 03 00 80 81 sethi %hi(0x2020400), %g1 200b900: c8 00 62 e8 ld [ %g1 + 0x2e8 ], %g4 ! 20206e8 <_Scheduler_CBS_Server_list> 200b904: 82 10 20 00 clr %g1 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200b908: 85 28 60 02 sll %g1, 2, %g2 Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && 200b90c: c4 01 00 02 ld [ %g4 + %g2 ], %g2 200b910: 80 a0 a0 00 cmp %g2, 0 200b914: 22 80 00 07 be,a 200b930 <_Scheduler_CBS_Get_server_id+0x44> 200b918: 82 00 60 01 inc %g1 200b91c: c4 00 80 00 ld [ %g2 ], %g2 200b920: 80 a0 80 08 cmp %g2, %o0 200b924: 22 80 00 08 be,a 200b944 <_Scheduler_CBS_Get_server_id+0x58> 200b928: c2 22 40 00 st %g1, [ %o1 ] rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b92c: 82 00 60 01 inc %g1 200b930: 80 a0 40 03 cmp %g1, %g3 200b934: 12 bf ff f6 bne 200b90c <_Scheduler_CBS_Get_server_id+0x20> 200b938: 85 28 60 02 sll %g1, 2, %g2 *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; } 200b93c: 81 c3 e0 08 retl 200b940: 90 10 3f e7 mov -25, %o0 unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; 200b944: 81 c3 e0 08 retl 200b948: 90 10 20 00 clr %o0 =============================================================================== 0200b9b8 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200b9b8: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); 200b9bc: 3b 00 80 7e sethi %hi(0x201f800), %i5 200b9c0: d0 07 60 a0 ld [ %i5 + 0xa0 ], %o0 ! 201f8a0 <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200b9c4: 40 00 07 28 call 200d664 <_Workspace_Allocate> 200b9c8: 91 2a 20 02 sll %o0, 2, %o0 200b9cc: 09 00 80 81 sethi %hi(0x2020400), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200b9d0: 80 a2 20 00 cmp %o0, 0 200b9d4: 02 80 00 10 be 200ba14 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200b9d8: d0 21 22 e8 st %o0, [ %g4 + 0x2e8 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b9dc: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3 200b9e0: 80 a0 e0 00 cmp %g3, 0 200b9e4: 12 80 00 05 bne 200b9f8 <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN 200b9e8: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200b9ec: 81 c7 e0 08 ret <== NOT EXECUTED 200b9f0: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED 200b9f4: d0 01 22 e8 ld [ %g4 + 0x2e8 ], %o0 _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; 200b9f8: 85 28 60 02 sll %g1, 2, %g2 unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200b9fc: 82 00 60 01 inc %g1 200ba00: 80 a0 40 03 cmp %g1, %g3 200ba04: 12 bf ff fc bne 200b9f4 <_Scheduler_CBS_Initialize+0x3c> 200ba08: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200ba0c: 81 c7 e0 08 ret 200ba10: 91 e8 20 00 restore %g0, 0, %o0 { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 200ba14: b0 10 3f ef mov -17, %i0 <== NOT EXECUTED for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; } 200ba18: 81 c7 e0 08 ret <== NOT EXECUTED 200ba1c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200a5a8 <_Scheduler_CBS_Release_job>: { Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; Scheduler_CBS_Server *serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a5a8: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a5ac: 80 a2 60 00 cmp %o1, 0 200a5b0: 02 80 00 11 be 200a5f4 <_Scheduler_CBS_Release_job+0x4c> 200a5b4: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a5b8: 80 a0 60 00 cmp %g1, 0 200a5bc: 02 80 00 13 be 200a608 <_Scheduler_CBS_Release_job+0x60> 200a5c0: 07 00 80 7a sethi %hi(0x201e800), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a5c4: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a5c8: d2 00 e1 cc ld [ %g3 + 0x1cc ], %o1 200a5cc: 92 02 40 02 add %o1, %g2, %o1 200a5d0: 05 20 00 00 sethi %hi(0x80000000), %g2 200a5d4: 92 2a 40 02 andn %o1, %g2, %o1 new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) the_thread->cpu_time_budget = serv_info->parameters.budget; 200a5d8: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a5dc: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a5e0: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a5e4: 94 10 20 01 mov 1, %o2 200a5e8: 82 13 c0 00 mov %o7, %g1 200a5ec: 40 00 01 38 call 200aacc <_Thread_Change_priority> 200a5f0: 9e 10 40 00 mov %g1, %o7 /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) 200a5f4: 80 a0 60 00 cmp %g1, 0 200a5f8: 12 bf ff f8 bne 200a5d8 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 200a5fc: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 200a600: 10 bf ff f9 b 200a5e4 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 200a604: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED /* Initializing or shifting deadline. */ if (serv_info) new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) & ~SCHEDULER_EDF_PRIO_MSB; else new_priority = (_Watchdog_Ticks_since_boot + deadline) 200a608: 03 00 80 7a sethi %hi(0x201e800), %g1 200a60c: c2 00 61 cc ld [ %g1 + 0x1cc ], %g1 ! 201e9cc <_Watchdog_Ticks_since_boot> 200a610: 92 02 40 01 add %o1, %g1, %o1 200a614: 03 20 00 00 sethi %hi(0x80000000), %g1 200a618: 10 bf ff f2 b 200a5e0 <_Scheduler_CBS_Release_job+0x38> 200a61c: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 0200a620 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a620: 9d e3 bf a0 save %sp, -96, %sp Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server *serv_info; Priority_Control new_priority; _Scheduler_EDF_Enqueue(the_thread); 200a624: 40 00 00 50 call 200a764 <_Scheduler_EDF_Enqueue> 200a628: 90 10 00 18 mov %i0, %o0 /* TODO: flash critical section? */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a62c: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a630: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 * Late unblock rule for deadline-driven tasks. The remaining time to * deadline must be sufficient to serve the remaining computation time * without increased utilization of this task. It might cause a deadline * miss of another task. */ if (serv_info) { 200a634: 80 a7 60 00 cmp %i5, 0 200a638: 02 80 00 19 be 200a69c <_Scheduler_CBS_Unblock+0x7c> 200a63c: 03 00 80 7a sethi %hi(0x201e800), %g1 time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a640: d2 07 60 04 ld [ %i5 + 4 ], %o1 */ if (serv_info) { time_t deadline = serv_info->parameters.deadline; time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - 200a644: d0 00 61 cc ld [ %g1 + 0x1cc ], %o0 200a648: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a64c: 40 00 3d 7c call 2019c3c <.umul> 200a650: 90 27 00 08 sub %i4, %o0, %o0 200a654: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a658: b6 10 00 08 mov %o0, %i3 200a65c: 40 00 3d 78 call 2019c3c <.umul> 200a660: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a664: 80 a6 c0 08 cmp %i3, %o0 200a668: 24 80 00 0e ble,a 200a6a0 <_Scheduler_CBS_Unblock+0x80> 200a66c: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 /* Put late unblocked task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200a670: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a674: 80 a7 00 09 cmp %i4, %o1 200a678: 32 80 00 02 bne,a 200a680 <_Scheduler_CBS_Unblock+0x60> 200a67c: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a680: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a684: 80 a2 00 09 cmp %o0, %o1 200a688: 02 80 00 07 be 200a6a4 <_Scheduler_CBS_Unblock+0x84> 200a68c: 3b 00 80 7a sethi %hi(0x201e800), %i5 _Thread_Change_priority(the_thread, new_priority, true); 200a690: 90 10 00 18 mov %i0, %o0 200a694: 40 00 01 0e call 200aacc <_Thread_Change_priority> 200a698: 94 10 20 01 mov 1, %o2 200a69c: d0 06 20 14 ld [ %i0 + 0x14 ], %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_higher_than( the_thread->current_priority, 200a6a0: 3b 00 80 7a sethi %hi(0x201e800), %i5 200a6a4: ba 17 62 f0 or %i5, 0x2f0, %i5 ! 201eaf0 <_Per_CPU_Information> 200a6a8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a6ac: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 200a6b0: 03 00 80 77 sethi %hi(0x201dc00), %g1 200a6b4: c2 00 61 04 ld [ %g1 + 0x104 ], %g1 ! 201dd04 <_Scheduler+0x30> 200a6b8: 9f c0 40 00 call %g1 200a6bc: 01 00 00 00 nop 200a6c0: 80 a2 20 00 cmp %o0, 0 200a6c4: 04 80 00 0a ble 200a6ec <_Scheduler_CBS_Unblock+0xcc> 200a6c8: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a6cc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 * 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_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; 200a6d0: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 200a6d4: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a6d8: 80 a0 60 00 cmp %g1, 0 200a6dc: 22 80 00 06 be,a 200a6f4 <_Scheduler_CBS_Unblock+0xd4> 200a6e0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a6e4: 82 10 20 01 mov 1, %g1 200a6e8: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 200a6ec: 81 c7 e0 08 ret 200a6f0: 81 e8 00 00 restore * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a6f4: 80 a0 60 00 cmp %g1, 0 200a6f8: 12 bf ff fd bne 200a6ec <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 200a6fc: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a700: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 200a704: 30 bf ff fa b,a 200a6ec <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 0200a578 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a578: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a57c: 40 00 07 07 call 200c198 <_Workspace_Allocate> 200a580: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a584: 80 a2 20 00 cmp %o0, 0 200a588: 02 80 00 05 be 200a59c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a58c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a590: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a594: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a598: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a59c: 81 c7 e0 08 ret 200a5a0: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a75c <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a75c: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a760: 7f ff ff a8 call 200a600 <_Scheduler_EDF_Enqueue> 200a764: 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( 200a768: 3b 00 80 7a sethi %hi(0x201e800), %i5 200a76c: ba 17 62 40 or %i5, 0x240, %i5 ! 201ea40 <_Per_CPU_Information> 200a770: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a774: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 200a778: 03 00 80 77 sethi %hi(0x201dc00), %g1 200a77c: c2 00 60 54 ld [ %g1 + 0x54 ], %g1 ! 201dc54 <_Scheduler+0x30> 200a780: 9f c0 40 00 call %g1 200a784: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200a788: 80 a2 20 00 cmp %o0, 0 200a78c: 26 80 00 04 bl,a 200a79c <_Scheduler_EDF_Unblock+0x40> 200a790: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a794: 81 c7 e0 08 ret 200a798: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200a79c: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 200a7a0: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a7a4: 80 a0 60 00 cmp %g1, 0 200a7a8: 22 80 00 06 be,a 200a7c0 <_Scheduler_EDF_Unblock+0x64> 200a7ac: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a7b0: 82 10 20 01 mov 1, %g1 200a7b4: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 200a7b8: 81 c7 e0 08 ret 200a7bc: 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 || 200a7c0: 80 a0 60 00 cmp %g1, 0 200a7c4: 12 bf ff f4 bne 200a794 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 200a7c8: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a7cc: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 200a7d0: 30 bf ff fa b,a 200a7b8 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 0200a76c <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 200a76c: 03 00 80 74 sethi %hi(0x201d000), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a770: c2 00 60 e4 ld [ %g1 + 0xe4 ], %g1 ! 201d0e4 <_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 ) { 200a774: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200a778: c2 00 40 00 ld [ %g1 ], %g1 200a77c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a780: 80 a0 80 03 cmp %g2, %g3 200a784: 3a 80 00 08 bcc,a 200a7a4 <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200a788: 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 ) { 200a78c: 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 ) { 200a790: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a794: 80 a0 80 03 cmp %g2, %g3 200a798: 2a bf ff fe bcs,a 200a790 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 200a79c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 200a7a0: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200a7a4: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200a7a8: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200a7ac: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 200a7b0: c4 22 00 00 st %g2, [ %o0 ] before_node->previous = the_node; 200a7b4: 81 c3 e0 08 retl 200a7b8: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02008814 <_TOD_Validate>: }; bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2008814: 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(); 2008818: 03 00 80 70 sethi %hi(0x201c000), %g1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 200881c: d2 00 62 bc ld [ %g1 + 0x2bc ], %o1 ! 201c2bc 2008820: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008824: 40 00 47 26 call 201a4bc <.udiv> 2008828: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 200882c: 80 a6 20 00 cmp %i0, 0 2008830: 02 80 00 2c be 20088e0 <_TOD_Validate+0xcc> <== NEVER TAKEN 2008834: 82 10 20 00 clr %g1 2008838: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 200883c: 80 a2 00 02 cmp %o0, %g2 2008840: 28 80 00 26 bleu,a 20088d8 <_TOD_Validate+0xc4> 2008844: b0 08 60 01 and %g1, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2008848: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 200884c: 80 a0 a0 3b cmp %g2, 0x3b 2008850: 38 80 00 22 bgu,a 20088d8 <_TOD_Validate+0xc4> 2008854: b0 08 60 01 and %g1, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2008858: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200885c: 80 a0 a0 3b cmp %g2, 0x3b 2008860: 38 80 00 1e bgu,a 20088d8 <_TOD_Validate+0xc4> 2008864: b0 08 60 01 and %g1, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2008868: c4 06 20 0c ld [ %i0 + 0xc ], %g2 200886c: 80 a0 a0 17 cmp %g2, 0x17 2008870: 38 80 00 1a bgu,a 20088d8 <_TOD_Validate+0xc4> 2008874: b0 08 60 01 and %g1, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2008878: c4 06 20 04 ld [ %i0 + 4 ], %g2 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) || 200887c: 80 a0 a0 00 cmp %g2, 0 2008880: 02 80 00 15 be 20088d4 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008884: 80 a0 a0 0c cmp %g2, 0xc (the_tod->month == 0) || 2008888: 38 80 00 14 bgu,a 20088d8 <_TOD_Validate+0xc4> 200888c: b0 08 60 01 and %g1, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008890: c6 06 00 00 ld [ %i0 ], %g3 (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) || 2008894: 80 a0 e7 c3 cmp %g3, 0x7c3 2008898: 28 80 00 10 bleu,a 20088d8 <_TOD_Validate+0xc4> 200889c: b0 08 60 01 and %g1, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 20088a0: c8 06 20 08 ld [ %i0 + 8 ], %g4 (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) || 20088a4: 80 a1 20 00 cmp %g4, 0 20088a8: 02 80 00 0b be 20088d4 <_TOD_Validate+0xc0> <== NEVER TAKEN 20088ac: 80 88 e0 03 btst 3, %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20088b0: 32 80 00 0f bne,a 20088ec <_TOD_Validate+0xd8> 20088b4: 85 28 a0 02 sll %g2, 2, %g2 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20088b8: 82 00 a0 0d add %g2, 0xd, %g1 20088bc: 05 00 80 75 sethi %hi(0x201d400), %g2 20088c0: 83 28 60 02 sll %g1, 2, %g1 20088c4: 84 10 a0 b0 or %g2, 0xb0, %g2 20088c8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; if ( the_tod->day > days_in_month ) 20088cc: 80 a0 40 04 cmp %g1, %g4 20088d0: 82 60 3f ff subx %g0, -1, %g1 return false; return true; } 20088d4: b0 08 60 01 and %g1, 1, %i0 20088d8: 81 c7 e0 08 ret 20088dc: 81 e8 00 00 restore 20088e0: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED 20088e4: 81 c7 e0 08 ret <== NOT EXECUTED 20088e8: 81 e8 00 00 restore <== NOT EXECUTED 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 ]; 20088ec: 03 00 80 75 sethi %hi(0x201d400), %g1 20088f0: 82 10 60 b0 or %g1, 0xb0, %g1 ! 201d4b0 <_TOD_Days_per_month> 20088f4: c2 00 40 02 ld [ %g1 + %g2 ], %g1 if ( the_tod->day > days_in_month ) 20088f8: 80 a0 40 04 cmp %g1, %g4 20088fc: 10 bf ff f6 b 20088d4 <_TOD_Validate+0xc0> 2008900: 82 60 3f ff subx %g0, -1, %g1 =============================================================================== 0200a194 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200a194: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 200a198: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 /* * 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 ); 200a19c: 40 00 03 b9 call 200b080 <_Thread_Set_transient> 200a1a0: 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 ) 200a1a4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a1a8: 80 a0 40 19 cmp %g1, %i1 200a1ac: 02 80 00 05 be 200a1c0 <_Thread_Change_priority+0x2c> 200a1b0: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200a1b4: 90 10 00 18 mov %i0, %o0 200a1b8: 40 00 03 98 call 200b018 <_Thread_Set_priority> 200a1bc: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200a1c0: 7f ff e1 13 call 200260c 200a1c4: 01 00 00 00 nop 200a1c8: 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; 200a1cc: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 200a1d0: 80 a7 20 04 cmp %i4, 4 200a1d4: 02 80 00 18 be 200a234 <_Thread_Change_priority+0xa0> 200a1d8: 80 8e e0 04 btst 4, %i3 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 200a1dc: 02 80 00 0b be 200a208 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200a1e0: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 200a1e4: 7f ff e1 0e call 200261c <== NOT EXECUTED 200a1e8: 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); 200a1ec: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200a1f0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a1f4: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED 200a1f8: 32 80 00 0d bne,a 200a22c <_Thread_Change_priority+0x98> <== NOT EXECUTED 200a1fc: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200a200: 81 c7 e0 08 ret 200a204: 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 ); 200a208: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 200a20c: 7f ff e1 04 call 200261c 200a210: 90 10 00 19 mov %i1, %o0 200a214: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a218: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a21c: 80 8f 00 01 btst %i4, %g1 200a220: 02 bf ff f8 be 200a200 <_Thread_Change_priority+0x6c> 200a224: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 200a228: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 200a22c: 40 00 03 4b call 200af58 <_Thread_queue_Requeue> 200a230: 93 e8 00 1d restore %g0, %i5, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 200a234: 22 80 00 19 be,a 200a298 <_Thread_Change_priority+0x104> <== ALWAYS TAKEN 200a238: c0 27 60 10 clr [ %i5 + 0x10 ] 200a23c: 39 00 80 70 sethi %hi(0x201c000), %i4 <== NOT EXECUTED 200a240: b8 17 20 e4 or %i4, 0xe4, %i4 ! 201c0e4 <_Scheduler> <== NOT EXECUTED _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200a244: 7f ff e0 f6 call 200261c 200a248: 90 10 00 19 mov %i1, %o0 200a24c: 7f ff e0 f0 call 200260c 200a250: 01 00 00 00 nop 200a254: 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(); 200a258: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a25c: 9f c0 40 00 call %g1 200a260: 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 ); 200a264: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a268: 82 10 62 90 or %g1, 0x290, %g1 ! 201ce90 <_Per_CPU_Information> * 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() && 200a26c: c4 18 60 10 ldd [ %g1 + 0x10 ], %g2 200a270: 80 a0 80 03 cmp %g2, %g3 200a274: 02 80 00 07 be 200a290 <_Thread_Change_priority+0xfc> 200a278: 01 00 00 00 nop 200a27c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200a280: 80 a0 a0 00 cmp %g2, 0 200a284: 02 80 00 03 be 200a290 <_Thread_Change_priority+0xfc> 200a288: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200a28c: c4 28 60 0c stb %g2, [ %g1 + 0xc ] _ISR_Enable( level ); 200a290: 7f ff e0 e3 call 200261c 200a294: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200a298: 39 00 80 70 sethi %hi(0x201c000), %i4 * 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 ) 200a29c: 80 a6 a0 00 cmp %i2, 0 200a2a0: 02 80 00 06 be 200a2b8 <_Thread_Change_priority+0x124> 200a2a4: b8 17 20 e4 or %i4, 0xe4, %i4 200a2a8: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 200a2ac: 9f c0 40 00 call %g1 200a2b0: 90 10 00 1d mov %i5, %o0 200a2b4: 30 bf ff e4 b,a 200a244 <_Thread_Change_priority+0xb0> */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 200a2b8: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200a2bc: 9f c0 40 00 call %g1 200a2c0: 90 10 00 1d mov %i5, %o0 200a2c4: 30 bf ff e0 b,a 200a244 <_Thread_Change_priority+0xb0> =============================================================================== 0200a4d8 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a4d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a4dc: 90 10 00 18 mov %i0, %o0 200a4e0: 40 00 00 8b call 200a70c <_Thread_Get> 200a4e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a4e8: c2 07 bf fc ld [ %fp + -4 ], %g1 200a4ec: 80 a0 60 00 cmp %g1, 0 200a4f0: 12 80 00 08 bne 200a510 <_Thread_Delay_ended+0x38> <== NEVER TAKEN 200a4f4: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a4f8: 7f ff ff 74 call 200a2c8 <_Thread_Clear_state> 200a4fc: 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) { uint32_t level = _Thread_Dispatch_disable_level; 200a500: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a504: c4 00 60 80 ld [ %g1 + 0x80 ], %g2 ! 201cc80 <_Thread_Dispatch_disable_level> --level; 200a508: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200a50c: c4 20 60 80 st %g2, [ %g1 + 0x80 ] 200a510: 81 c7 e0 08 ret 200a514: 81 e8 00 00 restore =============================================================================== 0200a518 <_Thread_Dispatch>: #if defined(RTEMS_SMP) #include #endif void _Thread_Dispatch( void ) { 200a518: 9d e3 bf 98 save %sp, -104, %sp #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200a51c: 35 00 80 73 sethi %hi(0x201cc00), %i2 200a520: b4 16 a2 90 or %i2, 0x290, %i2 ! 201ce90 <_Per_CPU_Information> _ISR_Disable( level ); 200a524: 7f ff e0 3a call 200260c 200a528: fa 06 a0 10 ld [ %i2 + 0x10 ], %i5 while ( _Thread_Dispatch_necessary == true ) { 200a52c: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1 200a530: 80 a0 60 00 cmp %g1, 0 200a534: 02 80 00 55 be 200a688 <_Thread_Dispatch+0x170> 200a538: 31 00 80 73 sethi %hi(0x201cc00), %i0 heir = _Thread_Heir; 200a53c: f8 06 a0 14 ld [ %i2 + 0x14 ], %i4 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 200a540: 82 10 20 01 mov 1, %g1 200a544: c2 26 20 80 st %g1, [ %i0 + 0x80 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 200a548: c0 2e a0 0c clrb [ %i2 + 0xc ] /* * 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 ) 200a54c: 80 a7 40 1c cmp %i5, %i4 200a550: 02 80 00 4e be 200a688 <_Thread_Dispatch+0x170> 200a554: f8 26 a0 10 st %i4, [ %i2 + 0x10 ] 200a558: 21 00 80 70 sethi %hi(0x201c000), %l0 200a55c: 25 00 80 73 sethi %hi(0x201cc00), %l2 200a560: a0 14 22 b8 or %l0, 0x2b8, %l0 */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 200a564: 23 00 80 72 sethi %hi(0x201c800), %l1 200a568: a4 14 a0 f0 or %l2, 0xf0, %l2 200a56c: b6 04 20 04 add %l0, 4, %i3 #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; 200a570: 29 00 80 72 sethi %hi(0x201c800), %l4 200a574: a2 14 63 d0 or %l1, 0x3d0, %l1 #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 ); 200a578: 33 00 80 73 sethi %hi(0x201cc00), %i1 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 200a57c: a6 10 20 01 mov 1, %l3 */ #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 ) 200a580: c2 07 20 78 ld [ %i4 + 0x78 ], %g1 200a584: 80 a0 60 01 cmp %g1, 1 200a588: 02 80 00 53 be 200a6d4 <_Thread_Dispatch+0x1bc> 200a58c: c2 05 23 e0 ld [ %l4 + 0x3e0 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 200a590: 7f ff e0 23 call 200261c 200a594: 01 00 00 00 nop 200a598: 92 10 00 11 mov %l1, %o1 200a59c: 7f ff f9 6d call 2008b50 <_TOD_Get_with_nanoseconds> 200a5a0: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a5a4: d8 1e a0 20 ldd [ %i2 + 0x20 ], %o4 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a5a8: c4 1f 60 80 ldd [ %i5 + 0x80 ], %g2 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 200a5ac: d4 1f bf f8 ldd [ %fp + -8 ], %o2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a5b0: c2 04 80 00 ld [ %l2 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a5b4: 9a a2 c0 0d subcc %o3, %o5, %o5 200a5b8: 98 62 80 0c subx %o2, %o4, %o4 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a5bc: 92 80 c0 0d addcc %g3, %o5, %o1 200a5c0: 90 40 80 0c addx %g2, %o4, %o0 200a5c4: d0 3f 60 80 std %o0, [ %i5 + 0x80 ] 200a5c8: 80 a0 60 00 cmp %g1, 0 200a5cc: 02 80 00 06 be 200a5e4 <_Thread_Dispatch+0xcc> <== NEVER TAKEN 200a5d0: d4 3e a0 20 std %o2, [ %i2 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 200a5d4: c4 00 40 00 ld [ %g1 ], %g2 200a5d8: c4 27 61 4c st %g2, [ %i5 + 0x14c ] *_Thread_libc_reent = heir->libc_reent; 200a5dc: c4 07 21 4c ld [ %i4 + 0x14c ], %g2 200a5e0: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200a5e4: ea 04 00 00 ld [ %l0 ], %l5 { const Chain_Control *chain = &_User_extensions_Switches_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 200a5e8: 80 a5 40 1b cmp %l5, %i3 200a5ec: 02 80 00 0b be 200a618 <_Thread_Dispatch+0x100> <== NEVER TAKEN 200a5f0: 90 07 60 c0 add %i5, 0xc0, %o0 const User_extensions_Switch_control *extension = (const User_extensions_Switch_control *) node; (*extension->thread_switch)( executing, heir ); 200a5f4: c2 05 60 08 ld [ %l5 + 8 ], %g1 200a5f8: 90 10 00 1d mov %i5, %o0 200a5fc: 9f c0 40 00 call %g1 200a600: 92 10 00 1c mov %i4, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 200a604: ea 05 40 00 ld [ %l5 ], %l5 { const Chain_Control *chain = &_User_extensions_Switches_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 200a608: 80 a5 40 1b cmp %l5, %i3 200a60c: 32 bf ff fb bne,a 200a5f8 <_Thread_Dispatch+0xe0> 200a610: c2 05 60 08 ld [ %l5 + 8 ], %g1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200a614: 90 07 60 c0 add %i5, 0xc0, %o0 200a618: 40 00 04 e2 call 200b9a0 <_CPU_Context_switch> 200a61c: 92 07 20 c0 add %i4, 0xc0, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a620: c2 07 61 48 ld [ %i5 + 0x148 ], %g1 200a624: 80 a0 60 00 cmp %g1, 0 200a628: 02 80 00 0c be 200a658 <_Thread_Dispatch+0x140> 200a62c: d0 06 60 ec ld [ %i1 + 0xec ], %o0 200a630: 80 a7 40 08 cmp %i5, %o0 200a634: 02 80 00 09 be 200a658 <_Thread_Dispatch+0x140> 200a638: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a63c: 02 80 00 04 be 200a64c <_Thread_Dispatch+0x134> 200a640: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a644: 40 00 04 9d call 200b8b8 <_CPU_Context_save_fp> 200a648: 90 02 21 48 add %o0, 0x148, %o0 _Context_Restore_fp( &executing->fp_context ); 200a64c: 40 00 04 b8 call 200b92c <_CPU_Context_restore_fp> 200a650: 90 07 61 48 add %i5, 0x148, %o0 _Thread_Allocated_fp = executing; 200a654: fa 26 60 ec st %i5, [ %i1 + 0xec ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200a658: 7f ff df ed call 200260c 200a65c: fa 06 a0 10 ld [ %i2 + 0x10 ], %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 ) { 200a660: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1 200a664: 80 a0 60 00 cmp %g1, 0 200a668: 02 80 00 08 be 200a688 <_Thread_Dispatch+0x170> 200a66c: 01 00 00 00 nop heir = _Thread_Heir; 200a670: f8 06 a0 14 ld [ %i2 + 0x14 ], %i4 200a674: e6 26 20 80 st %l3, [ %i0 + 0x80 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 200a678: c0 2e a0 0c clrb [ %i2 + 0xc ] /* * 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 ) 200a67c: 80 a7 00 1d cmp %i4, %i5 200a680: 12 bf ff c0 bne 200a580 <_Thread_Dispatch+0x68> <== ALWAYS TAKEN 200a684: f8 26 a0 10 st %i4, [ %i2 + 0x10 ] 200a688: c0 26 20 80 clr [ %i0 + 0x80 ] post_switch: #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 0 ); #endif _ISR_Enable( level ); 200a68c: 7f ff df e4 call 200261c 200a690: 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; 200a694: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a698: f8 00 60 f4 ld [ %g1 + 0xf4 ], %i4 ! 201ccf4 <_API_extensions_Post_switch_list> 200a69c: 82 10 60 f4 or %g1, 0xf4, %g1 { const Chain_Control *chain = &_API_extensions_Post_switch_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 200a6a0: b6 00 60 04 add %g1, 4, %i3 200a6a4: 80 a7 00 1b cmp %i4, %i3 200a6a8: 02 80 00 09 be 200a6cc <_Thread_Dispatch+0x1b4> 200a6ac: 01 00 00 00 nop const API_extensions_Post_switch_control *post_switch = (const API_extensions_Post_switch_control *) node; (*post_switch->hook)( executing ); 200a6b0: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a6b4: 9f c0 40 00 call %g1 200a6b8: 90 10 00 1d mov %i5, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 200a6bc: f8 07 00 00 ld [ %i4 ], %i4 { const Chain_Control *chain = &_API_extensions_Post_switch_list; const Chain_Node *tail = _Chain_Immutable_tail( chain ); const Chain_Node *node = _Chain_Immutable_first( chain ); while ( node != tail ) { 200a6c0: 80 a7 00 1b cmp %i4, %i3 200a6c4: 32 bf ff fc bne,a 200a6b4 <_Thread_Dispatch+0x19c> <== NEVER TAKEN 200a6c8: c2 07 20 08 ld [ %i4 + 8 ], %g1 <== NOT EXECUTED 200a6cc: 81 c7 e0 08 ret 200a6d0: 81 e8 00 00 restore #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; 200a6d4: 10 bf ff af b 200a590 <_Thread_Dispatch+0x78> 200a6d8: c2 27 20 74 st %g1, [ %i4 + 0x74 ] =============================================================================== 0200f348 <_Thread_Handler>: #define INIT_NAME __main #define EXECUTE_GLOBAL_CONSTRUCTORS #endif void _Thread_Handler( void ) { 200f348: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 200f34c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200f350: fa 00 62 a0 ld [ %g1 + 0x2a0 ], %i5 ! 201cea0 <_Per_CPU_Information+0x10> /* * 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(); 200f354: 3f 00 80 3c sethi %hi(0x200f000), %i7 200f358: be 17 e3 48 or %i7, 0x348, %i7 ! 200f348 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f35c: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 200f360: 7f ff cc af call 200261c 200f364: 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) && 200f368: c4 07 61 48 ld [ %i5 + 0x148 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200f36c: 03 00 80 72 sethi %hi(0x201c800), %g1 doneConstructors = true; 200f370: 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; 200f374: f6 08 61 78 ldub [ %g1 + 0x178 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f378: 80 a0 a0 00 cmp %g2, 0 200f37c: 02 80 00 0c be 200f3ac <_Thread_Handler+0x64> 200f380: c6 28 61 78 stb %g3, [ %g1 + 0x178 ] #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 ); 200f384: 39 00 80 73 sethi %hi(0x201cc00), %i4 200f388: d0 07 20 ec ld [ %i4 + 0xec ], %o0 ! 201ccec <_Thread_Allocated_fp> 200f38c: 80 a7 40 08 cmp %i5, %o0 200f390: 02 80 00 07 be 200f3ac <_Thread_Handler+0x64> 200f394: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f398: 22 80 00 05 be,a 200f3ac <_Thread_Handler+0x64> 200f39c: fa 27 20 ec st %i5, [ %i4 + 0xec ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f3a0: 7f ff f1 46 call 200b8b8 <_CPU_Context_save_fp> 200f3a4: 90 02 21 48 add %o0, 0x148, %o0 _Thread_Allocated_fp = executing; 200f3a8: fa 27 20 ec st %i5, [ %i4 + 0xec ] ); } static inline void _User_extensions_Thread_begin( Thread_Control *executing ) { _User_extensions_Iterate( 200f3ac: 90 10 00 1d mov %i5, %o0 200f3b0: 13 00 80 2c sethi %hi(0x200b000), %o1 200f3b4: 7f ff ef cb call 200b2e0 <_User_extensions_Iterate> 200f3b8: 92 12 62 6c or %o1, 0x26c, %o1 ! 200b26c <_User_extensions_Thread_begin_visitor> _User_extensions_Thread_begin( executing ); /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f3bc: 7f ff ec c8 call 200a6dc <_Thread_Enable_dispatch> 200f3c0: 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) */ { 200f3c4: 80 8e e0 ff btst 0xff, %i3 200f3c8: 02 80 00 0e be 200f400 <_Thread_Handler+0xb8> 200f3cc: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f3d0: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200f3d4: 80 a0 60 00 cmp %g1, 0 200f3d8: 22 80 00 0e be,a 200f410 <_Thread_Handler+0xc8> <== ALWAYS TAKEN 200f3dc: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 } } static inline void _User_extensions_Thread_exitted( Thread_Control *executing ) { _User_extensions_Iterate( 200f3e0: 90 10 00 1d mov %i5, %o0 200f3e4: 13 00 80 2c sethi %hi(0x200b000), %o1 200f3e8: 7f ff ef be call 200b2e0 <_User_extensions_Iterate> 200f3ec: 92 12 62 90 or %o1, 0x290, %o1 ! 200b290 <_User_extensions_Thread_exitted_visitor> * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); _Internal_error_Occurred( 200f3f0: 90 10 20 00 clr %o0 200f3f4: 92 10 20 01 mov 1, %o1 200f3f8: 7f ff e7 1e call 2009070 <_Internal_error_Occurred> 200f3fc: 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 (); 200f400: 40 00 33 04 call 201c010 <_init> 200f404: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f408: 10 bf ff f3 b 200f3d4 <_Thread_Handler+0x8c> 200f40c: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f410: 9f c0 40 00 call %g1 200f414: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200f418: 10 bf ff f2 b 200f3e0 <_Thread_Handler+0x98> 200f41c: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200a9a8 <_Thread_Handler_initialization>: #if defined(RTEMS_SMP) #include #endif void _Thread_Handler_initialization(void) { 200a9a8: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200a9ac: 03 00 80 68 sethi %hi(0x201a000), %g1 200a9b0: 82 10 60 68 or %g1, 0x68, %g1 ! 201a068 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200a9b4: c6 00 60 28 ld [ %g1 + 0x28 ], %g3 #include #endif void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200a9b8: fa 00 60 14 ld [ %g1 + 0x14 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200a9bc: f8 00 60 08 ld [ %g1 + 8 ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200a9c0: 80 a0 e0 00 cmp %g3, 0 200a9c4: 02 80 00 21 be 200aa48 <_Thread_Handler_initialization+0xa0><== NEVER TAKEN 200a9c8: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 200a9cc: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 200a9d0: 80 a0 e0 00 cmp %g3, 0 200a9d4: 02 80 00 1d be 200aa48 <_Thread_Handler_initialization+0xa0> 200a9d8: 80 a0 a0 00 cmp %g2, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200a9dc: 22 80 00 05 be,a 200a9f0 <_Thread_Handler_initialization+0x48> 200a9e0: 03 00 80 73 sethi %hi(0x201cc00), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200a9e4: 9f c0 80 00 call %g2 200a9e8: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 201cc04 <_Thread_BSP_context+0xc> _Thread_Dispatch_necessary = false; 200a9ec: 03 00 80 73 sethi %hi(0x201cc00), %g1 200a9f0: 82 10 62 90 or %g1, 0x290, %g1 ! 201ce90 <_Per_CPU_Information> 200a9f4: c0 28 60 0c clrb [ %g1 + 0xc ] _Thread_Executing = NULL; 200a9f8: c0 20 60 10 clr [ %g1 + 0x10 ] _Thread_Heir = NULL; 200a9fc: c0 20 60 14 clr [ %g1 + 0x14 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200aa00: 03 00 80 73 sethi %hi(0x201cc00), %g1 200aa04: c0 20 60 ec clr [ %g1 + 0xec ] ! 201ccec <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200aa08: 03 00 80 73 sethi %hi(0x201cc00), %g1 200aa0c: f8 20 61 00 st %i4, [ %g1 + 0x100 ] ! 201cd00 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200aa10: 03 00 80 72 sethi %hi(0x201c800), %g1 200aa14: fa 20 63 e0 st %i5, [ %g1 + 0x3e0 ] ! 201cbe0 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200aa18: 82 10 20 08 mov 8, %g1 200aa1c: 11 00 80 73 sethi %hi(0x201cc00), %o0 200aa20: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200aa24: 90 12 21 74 or %o0, 0x174, %o0 200aa28: 92 10 20 01 mov 1, %o1 200aa2c: 94 10 20 01 mov 1, %o2 200aa30: 96 10 20 01 mov 1, %o3 200aa34: 98 10 21 60 mov 0x160, %o4 200aa38: 7f ff fb 37 call 2009714 <_Objects_Initialize_information> 200aa3c: 9a 10 20 00 clr %o5 200aa40: 81 c7 e0 08 ret 200aa44: 81 e8 00 00 restore _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || rtems_configuration_get_stack_free_hook() == NULL) _Internal_error_Occurred( 200aa48: 90 10 20 00 clr %o0 200aa4c: 92 10 20 01 mov 1, %o1 200aa50: 7f ff f9 88 call 2009070 <_Internal_error_Occurred> 200aa54: 94 10 20 0e mov 0xe, %o2 =============================================================================== 0200a7b8 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a7b8: 9d e3 bf 98 save %sp, -104, %sp 200a7bc: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 200a7c0: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2 200a7c4: 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; 200a7c8: c0 26 61 50 clr [ %i1 + 0x150 ] 200a7cc: c0 26 61 54 clr [ %i1 + 0x154 ] extensions_area = NULL; the_thread->libc_reent = NULL; 200a7d0: c0 26 61 4c clr [ %i1 + 0x14c ] /* * 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 ); 200a7d4: 90 10 00 19 mov %i1, %o0 200a7d8: 40 00 02 39 call 200b0bc <_Thread_Stack_Allocate> 200a7dc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200a7e0: 80 a2 00 1b cmp %o0, %i3 200a7e4: 0a 80 00 4f bcs 200a920 <_Thread_Initialize+0x168> 200a7e8: 80 a2 20 00 cmp %o0, 0 200a7ec: 02 80 00 4d be 200a920 <_Thread_Initialize+0x168> <== NEVER TAKEN 200a7f0: 80 a7 20 00 cmp %i4, 0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a7f4: c2 06 60 bc ld [ %i1 + 0xbc ], %g1 the_stack->size = size; 200a7f8: d0 26 60 b0 st %o0, [ %i1 + 0xb0 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a7fc: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 200a800: 12 80 00 4c bne 200a930 <_Thread_Initialize+0x178> 200a804: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a808: 39 00 80 73 sethi %hi(0x201cc00), %i4 200a80c: c2 07 21 00 ld [ %i4 + 0x100 ], %g1 ! 201cd00 <_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; 200a810: f6 26 61 48 st %i3, [ %i1 + 0x148 ] the_thread->Start.fp_context = fp_area; 200a814: f6 26 60 b8 st %i3, [ %i1 + 0xb8 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200a818: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200a81c: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200a820: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a824: 80 a0 60 00 cmp %g1, 0 200a828: 12 80 00 4a bne 200a950 <_Thread_Initialize+0x198> 200a82c: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a830: c0 26 61 58 clr [ %i1 + 0x158 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200a834: a2 10 20 00 clr %l1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 200a838: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200a83c: 03 00 80 70 sethi %hi(0x201c000), %g1 200a840: c4 26 60 a0 st %g2, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; 200a844: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 200a848: c2 00 60 fc ld [ %g1 + 0xfc ], %g1 200a84c: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a850: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200a854: f4 2e 60 9c stb %i2, [ %i1 + 0x9c ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a858: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200a85c: b4 10 20 01 mov 1, %i2 the_thread->Wait.queue = NULL; 200a860: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200a864: f4 26 60 10 st %i2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200a868: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200a86c: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200a870: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200a874: 9f c0 40 00 call %g1 200a878: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200a87c: b8 92 20 00 orcc %o0, 0, %i4 200a880: 22 80 00 17 be,a 200a8dc <_Thread_Initialize+0x124> 200a884: d0 06 61 4c ld [ %i1 + 0x14c ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200a888: 90 10 00 19 mov %i1, %o0 200a88c: 40 00 01 e3 call 200b018 <_Thread_Set_priority> 200a890: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a894: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200a898: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200a89c: c0 26 60 80 clr [ %i1 + 0x80 ] 200a8a0: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a8a4: 83 28 60 02 sll %g1, 2, %g1 200a8a8: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200a8ac: e0 26 60 0c st %l0, [ %i1 + 0xc ] * @{ */ static inline bool _User_extensions_Thread_create( Thread_Control *created ) { User_extensions_Thread_create_context ctx = { created, true }; 200a8b0: f2 27 bf f8 st %i1, [ %fp + -8 ] 200a8b4: f4 2f bf fc stb %i2, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Thread_create_visitor ); 200a8b8: 90 07 bf f8 add %fp, -8, %o0 200a8bc: 13 00 80 2c sethi %hi(0x200b000), %o1 200a8c0: 40 00 02 88 call 200b2e0 <_User_extensions_Iterate> 200a8c4: 92 12 61 b8 or %o1, 0x1b8, %o1 ! 200b1b8 <_User_extensions_Thread_create_visitor> * 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 ); if ( extension_status ) 200a8c8: c2 0f bf fc ldub [ %fp + -4 ], %g1 200a8cc: 80 a0 60 00 cmp %g1, 0 200a8d0: 12 80 00 11 bne 200a914 <_Thread_Initialize+0x15c> 200a8d4: b0 10 20 01 mov 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200a8d8: d0 06 61 4c ld [ %i1 + 0x14c ], %o0 200a8dc: 40 00 03 e2 call 200b864 <_Workspace_Free> 200a8e0: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200a8e4: 40 00 03 e0 call 200b864 <_Workspace_Free> 200a8e8: d0 06 61 50 ld [ %i1 + 0x150 ], %o0 200a8ec: 40 00 03 de call 200b864 <_Workspace_Free> 200a8f0: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 _Workspace_Free( extensions_area ); 200a8f4: 40 00 03 dc call 200b864 <_Workspace_Free> 200a8f8: 90 10 00 11 mov %l1, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200a8fc: 40 00 03 da call 200b864 <_Workspace_Free> 200a900: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200a904: 40 00 03 d8 call 200b864 <_Workspace_Free> 200a908: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200a90c: 40 00 01 fc call 200b0fc <_Thread_Stack_Free> 200a910: 90 10 00 19 mov %i1, %o0 200a914: b0 0e 20 ff and %i0, 0xff, %i0 200a918: 81 c7 e0 08 ret 200a91c: 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 */ 200a920: b0 10 20 00 clr %i0 200a924: b0 0e 20 ff and %i0, 0xff, %i0 200a928: 81 c7 e0 08 ret 200a92c: 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 ); 200a930: 40 00 03 c5 call 200b844 <_Workspace_Allocate> 200a934: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200a938: b6 92 20 00 orcc %o0, 0, %i3 200a93c: 32 bf ff b4 bne,a 200a80c <_Thread_Initialize+0x54> 200a940: 39 00 80 73 sethi %hi(0x201cc00), %i4 * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200a944: a2 10 20 00 clr %l1 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; 200a948: 10 bf ff e4 b 200a8d8 <_Thread_Initialize+0x120> 200a94c: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200a950: 90 00 60 01 add %g1, 1, %o0 200a954: 40 00 03 bc call 200b844 <_Workspace_Allocate> 200a958: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200a95c: a2 92 20 00 orcc %o0, 0, %l1 200a960: 02 80 00 10 be 200a9a0 <_Thread_Initialize+0x1e8> 200a964: 86 10 00 11 mov %l1, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200a968: e2 26 61 58 st %l1, [ %i1 + 0x158 ] 200a96c: c8 07 21 00 ld [ %i4 + 0x100 ], %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++ ) 200a970: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a974: 10 80 00 03 b 200a980 <_Thread_Initialize+0x1c8> 200a978: 82 10 20 00 clr %g1 200a97c: c6 06 61 58 ld [ %i1 + 0x158 ], %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; 200a980: 85 28 a0 02 sll %g2, 2, %g2 200a984: 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++ ) 200a988: 82 00 60 01 inc %g1 200a98c: 80 a0 40 04 cmp %g1, %g4 200a990: 08 bf ff fb bleu 200a97c <_Thread_Initialize+0x1c4> 200a994: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 200a998: 10 bf ff a9 b 200a83c <_Thread_Initialize+0x84> 200a99c: 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; 200a9a0: 10 bf ff ce b 200a8d8 <_Thread_Initialize+0x120> 200a9a4: b8 10 20 00 clr %i4 =============================================================================== 0200af58 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200af58: 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 ) 200af5c: 80 a6 20 00 cmp %i0, 0 200af60: 02 80 00 13 be 200afac <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200af64: 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 ) { 200af68: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 200af6c: 80 a7 60 01 cmp %i5, 1 200af70: 02 80 00 04 be 200af80 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200af74: 01 00 00 00 nop 200af78: 81 c7 e0 08 ret <== NOT EXECUTED 200af7c: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200af80: 7f ff dd a3 call 200260c 200af84: 01 00 00 00 nop 200af88: b8 10 00 08 mov %o0, %i4 200af8c: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200af90: 03 00 00 ef sethi %hi(0x3bc00), %g1 200af94: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200af98: 80 88 80 01 btst %g2, %g1 200af9c: 12 80 00 06 bne 200afb4 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200afa0: 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 ); 200afa4: 7f ff dd 9e call 200261c 200afa8: 90 10 00 1c mov %i4, %o0 200afac: 81 c7 e0 08 ret 200afb0: 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 ); 200afb4: 92 10 00 19 mov %i1, %o1 200afb8: 94 10 20 01 mov 1, %o2 200afbc: 40 00 0b 45 call 200dcd0 <_Thread_queue_Extract_priority_helper> 200afc0: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200afc4: 90 10 00 18 mov %i0, %o0 200afc8: 92 10 00 19 mov %i1, %o1 200afcc: 7f ff ff 35 call 200aca0 <_Thread_queue_Enqueue_priority> 200afd0: 94 07 bf fc add %fp, -4, %o2 200afd4: 30 bf ff f4 b,a 200afa4 <_Thread_queue_Requeue+0x4c> =============================================================================== 0200afd8 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200afd8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200afdc: 90 10 00 18 mov %i0, %o0 200afe0: 7f ff fd cb call 200a70c <_Thread_Get> 200afe4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200afe8: c2 07 bf fc ld [ %fp + -4 ], %g1 200afec: 80 a0 60 00 cmp %g1, 0 200aff0: 12 80 00 08 bne 200b010 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 200aff4: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200aff8: 40 00 0b 6f call 200ddb4 <_Thread_queue_Process_timeout> 200affc: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 200b000: 03 00 80 73 sethi %hi(0x201cc00), %g1 200b004: c4 00 60 80 ld [ %g1 + 0x80 ], %g2 ! 201cc80 <_Thread_Dispatch_disable_level> --level; 200b008: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200b00c: c4 20 60 80 st %g2, [ %g1 + 0x80 ] 200b010: 81 c7 e0 08 ret 200b014: 81 e8 00 00 restore =============================================================================== 020180c4 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 20180c4: 9d e3 bf 88 save %sp, -120, %sp 20180c8: 21 00 80 ec sethi %hi(0x203b000), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20180cc: a4 07 bf e8 add %fp, -24, %l2 20180d0: b4 07 bf ec add %fp, -20, %i2 20180d4: b8 07 bf f4 add %fp, -12, %i4 20180d8: a2 07 bf f8 add %fp, -8, %l1 20180dc: 33 00 80 ec sethi %hi(0x203b000), %i1 20180e0: 27 00 80 ec sethi %hi(0x203b000), %l3 20180e4: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 20180e8: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20180ec: e4 27 bf f0 st %l2, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20180f0: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 20180f4: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20180f8: f8 27 bf fc st %i4, [ %fp + -4 ] 20180fc: a0 14 21 dc or %l0, 0x1dc, %l0 2018100: b6 06 20 30 add %i0, 0x30, %i3 2018104: b2 16 60 38 or %i1, 0x38, %i1 2018108: ba 06 20 68 add %i0, 0x68, %i5 201810c: a6 14 e0 f0 or %l3, 0xf0, %l3 2018110: ac 06 20 08 add %i0, 8, %l6 2018114: aa 06 20 40 add %i0, 0x40, %l5 _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; 2018118: a8 10 20 01 mov 1, %l4 { /* * 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; 201811c: e4 26 20 78 st %l2, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2018120: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2018124: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018128: 90 10 00 1b mov %i3, %o0 201812c: 92 20 40 09 sub %g1, %o1, %o1 2018130: 94 10 00 1c mov %i4, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2018134: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018138: 40 00 12 29 call 201c9dc <_Watchdog_Adjust_to_chain> 201813c: 01 00 00 00 nop 2018140: d0 1e 40 00 ldd [ %i1 ], %o0 2018144: 94 10 20 00 clr %o2 2018148: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 201814c: 40 00 4d 36 call 202b624 <__divdi3> 2018150: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 2018154: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 /* * 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 ) { 2018158: 80 a2 40 0a cmp %o1, %o2 201815c: 18 80 00 2b bgu 2018208 <_Timer_server_Body+0x144> 2018160: ae 10 00 09 mov %o1, %l7 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 2018164: 80 a2 40 0a cmp %o1, %o2 2018168: 0a 80 00 20 bcs 20181e8 <_Timer_server_Body+0x124> 201816c: 90 10 00 1d mov %i5, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2018170: ee 26 20 74 st %l7, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2018174: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018178: 40 00 02 a6 call 2018c10 <_Chain_Get> 201817c: 01 00 00 00 nop if ( timer == NULL ) { 2018180: 92 92 20 00 orcc %o0, 0, %o1 2018184: 02 80 00 10 be 20181c4 <_Timer_server_Body+0x100> 2018188: 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 ) { 201818c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2018190: 80 a0 60 01 cmp %g1, 1 2018194: 02 80 00 19 be 20181f8 <_Timer_server_Body+0x134> 2018198: 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 ) { 201819c: 12 bf ff f6 bne 2018174 <_Timer_server_Body+0xb0> <== NEVER TAKEN 20181a0: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20181a4: 40 00 12 3a call 201ca8c <_Watchdog_Insert> 20181a8: 90 10 00 1d mov %i5, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 20181ac: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 20181b0: 40 00 02 98 call 2018c10 <_Chain_Get> 20181b4: 01 00 00 00 nop if ( timer == NULL ) { 20181b8: 92 92 20 00 orcc %o0, 0, %o1 20181bc: 32 bf ff f5 bne,a 2018190 <_Timer_server_Body+0xcc> <== NEVER TAKEN 20181c0: 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 ); 20181c4: 7f ff dd 4d call 200f6f8 20181c8: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 20181cc: c2 07 bf e8 ld [ %fp + -24 ], %g1 20181d0: 80 a0 40 1a cmp %g1, %i2 20181d4: 02 80 00 12 be 201821c <_Timer_server_Body+0x158> <== ALWAYS TAKEN 20181d8: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 20181dc: 7f ff dd 4b call 200f708 <== NOT EXECUTED 20181e0: 01 00 00 00 nop <== NOT EXECUTED 20181e4: 30 bf ff cf b,a 2018120 <_Timer_server_Body+0x5c> <== NOT EXECUTED /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 20181e8: 92 10 20 01 mov 1, %o1 ! 1 20181ec: 40 00 11 cc call 201c91c <_Watchdog_Adjust> 20181f0: 94 22 80 17 sub %o2, %l7, %o2 20181f4: 30 bf ff df b,a 2018170 <_Timer_server_Body+0xac> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20181f8: 90 10 00 1b mov %i3, %o0 20181fc: 40 00 12 24 call 201ca8c <_Watchdog_Insert> 2018200: 92 02 60 10 add %o1, 0x10, %o1 2018204: 30 bf ff dc b,a 2018174 <_Timer_server_Body+0xb0> /* * 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 ); 2018208: 92 22 40 0a sub %o1, %o2, %o1 201820c: 90 10 00 1d mov %i5, %o0 2018210: 40 00 11 f3 call 201c9dc <_Watchdog_Adjust_to_chain> 2018214: 94 10 00 1c mov %i4, %o2 2018218: 30 bf ff d6 b,a 2018170 <_Timer_server_Body+0xac> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 201821c: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2018220: 7f ff dd 3a call 200f708 2018224: 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 ) ) { 2018228: c2 07 bf f4 ld [ %fp + -12 ], %g1 201822c: 80 a0 40 11 cmp %g1, %l1 2018230: 12 80 00 0c bne 2018260 <_Timer_server_Body+0x19c> 2018234: 01 00 00 00 nop 2018238: 30 80 00 13 b,a 2018284 <_Timer_server_Body+0x1c0> 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; 201823c: f8 20 60 04 st %i4, [ %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; 2018240: 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; 2018244: c0 25 e0 08 clr [ %l7 + 8 ] _ISR_Enable( level ); 2018248: 7f ff dd 30 call 200f708 201824c: 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 ); 2018250: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0 2018254: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1 2018258: 9f c0 40 00 call %g1 201825c: d2 05 e0 24 ld [ %l7 + 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 ); 2018260: 7f ff dd 26 call 200f6f8 2018264: 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; 2018268: ee 07 bf f4 ld [ %fp + -12 ], %l7 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 201826c: 80 a5 c0 11 cmp %l7, %l1 2018270: 32 bf ff f3 bne,a 201823c <_Timer_server_Body+0x178> 2018274: c2 05 c0 00 ld [ %l7 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2018278: 7f ff dd 24 call 200f708 201827c: 01 00 00 00 nop 2018280: 30 bf ff a7 b,a 201811c <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2018284: 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) { uint32_t level = _Thread_Dispatch_disable_level; 2018288: c2 04 c0 00 ld [ %l3 ], %g1 ++level; 201828c: 82 00 60 01 inc %g1 _Thread_Dispatch_disable_level = level; 2018290: c2 24 c0 00 st %g1, [ %l3 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2018294: d0 06 00 00 ld [ %i0 ], %o0 2018298: 40 00 10 b3 call 201c564 <_Thread_Set_state> 201829c: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 20182a0: 7f ff ff 07 call 2017ebc <_Timer_server_Reset_interval_system_watchdog> 20182a4: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 20182a8: 7f ff ff 19 call 2017f0c <_Timer_server_Reset_tod_system_watchdog> 20182ac: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 20182b0: 40 00 0e 30 call 201bb70 <_Thread_Enable_dispatch> 20182b4: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20182b8: 90 10 00 16 mov %l6, %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; 20182bc: e8 2e 20 7c stb %l4, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20182c0: 40 00 12 52 call 201cc08 <_Watchdog_Remove> 20182c4: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20182c8: 40 00 12 50 call 201cc08 <_Watchdog_Remove> 20182cc: 90 10 00 15 mov %l5, %o0 20182d0: 30 bf ff 93 b,a 201811c <_Timer_server_Body+0x58> =============================================================================== 02017f5c <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2017f5c: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2017f60: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2017f64: 80 a0 60 00 cmp %g1, 0 2017f68: 02 80 00 05 be 2017f7c <_Timer_server_Schedule_operation_method+0x20> 2017f6c: 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 ); 2017f70: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2017f74: 40 00 03 1c call 2018be4 <_Chain_Append> 2017f78: 81 e8 00 00 restore * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { uint32_t level = _Thread_Dispatch_disable_level; 2017f7c: 03 00 80 ec sethi %hi(0x203b000), %g1 2017f80: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 203b0f0 <_Thread_Dispatch_disable_level> ++level; 2017f84: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 2017f88: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2017f8c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2017f90: 80 a0 60 01 cmp %g1, 1 2017f94: 02 80 00 2b be 2018040 <_Timer_server_Schedule_operation_method+0xe4> 2017f98: 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 ) { 2017f9c: 02 80 00 04 be 2017fac <_Timer_server_Schedule_operation_method+0x50> 2017fa0: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2017fa4: 40 00 0e f3 call 201bb70 <_Thread_Enable_dispatch> 2017fa8: 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 ); 2017fac: 7f ff dd d3 call 200f6f8 2017fb0: 01 00 00 00 nop 2017fb4: b8 10 00 08 mov %o0, %i4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2017fb8: 03 00 80 ec sethi %hi(0x203b000), %g1 2017fbc: d0 18 60 38 ldd [ %g1 + 0x38 ], %o0 ! 203b038 <_TOD> 2017fc0: 94 10 20 00 clr %o2 2017fc4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017fc8: 40 00 4d 97 call 202b624 <__divdi3> 2017fcc: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2017fd0: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; 2017fd4: c4 06 20 74 ld [ %i0 + 0x74 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2017fd8: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017fdc: 80 a0 40 03 cmp %g1, %g3 2017fe0: 02 80 00 0a be 2018008 <_Timer_server_Schedule_operation_method+0xac> 2017fe4: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2017fe8: 08 80 00 34 bleu 20180b8 <_Timer_server_Schedule_operation_method+0x15c> 2017fec: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2017ff0: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 2017ff4: 80 a1 00 02 cmp %g4, %g2 2017ff8: 08 80 00 03 bleu 2018004 <_Timer_server_Schedule_operation_method+0xa8><== NEVER TAKEN 2017ffc: 86 10 20 00 clr %g3 delta_interval -= delta; 2018000: 86 21 00 02 sub %g4, %g2, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2018004: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2018008: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201800c: 7f ff dd bf call 200f708 2018010: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2018014: 90 06 20 68 add %i0, 0x68, %o0 2018018: 40 00 12 9d call 201ca8c <_Watchdog_Insert> 201801c: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018020: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2018024: 80 a0 60 00 cmp %g1, 0 2018028: 12 bf ff df bne 2017fa4 <_Timer_server_Schedule_operation_method+0x48> 201802c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2018030: 7f ff ff b7 call 2017f0c <_Timer_server_Reset_tod_system_watchdog> 2018034: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2018038: 40 00 0e ce call 201bb70 <_Thread_Enable_dispatch> 201803c: 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 ); 2018040: 7f ff dd ae call 200f6f8 2018044: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2018048: 05 00 80 ec sethi %hi(0x203b000), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201804c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2018050: c4 00 a1 dc ld [ %g2 + 0x1dc ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2018054: 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 ); 2018058: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 201805c: 80 a0 40 03 cmp %g1, %g3 2018060: 02 80 00 08 be 2018080 <_Timer_server_Schedule_operation_method+0x124> 2018064: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2018068: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 201806c: 80 a1 00 1c cmp %g4, %i4 2018070: 1a 80 00 03 bcc 201807c <_Timer_server_Schedule_operation_method+0x120> 2018074: 86 10 20 00 clr %g3 delta_interval -= delta; 2018078: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 201807c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2018080: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2018084: 7f ff dd a1 call 200f708 2018088: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201808c: 90 06 20 30 add %i0, 0x30, %o0 2018090: 40 00 12 7f call 201ca8c <_Watchdog_Insert> 2018094: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018098: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 201809c: 80 a0 60 00 cmp %g1, 0 20180a0: 12 bf ff c1 bne 2017fa4 <_Timer_server_Schedule_operation_method+0x48> 20180a4: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20180a8: 7f ff ff 85 call 2017ebc <_Timer_server_Reset_interval_system_watchdog> 20180ac: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 20180b0: 40 00 0e b0 call 201bb70 <_Thread_Enable_dispatch> 20180b4: 81 e8 00 00 restore } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 20180b8: 84 01 00 02 add %g4, %g2, %g2 delta_interval += delta; 20180bc: 10 bf ff d2 b 2018004 <_Timer_server_Schedule_operation_method+0xa8> 20180c0: 86 20 80 09 sub %g2, %o1, %g3 =============================================================================== 0200ba10 <_Timespec_Add_to>: ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200ba10: d8 02 00 00 ld [ %o0 ], %o4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 200ba14: c4 02 40 00 ld [ %o1 ], %g2 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 200ba18: c6 02 20 04 ld [ %o0 + 4 ], %g3 200ba1c: c2 02 60 04 ld [ %o1 + 4 ], %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200ba20: 98 03 00 02 add %o4, %g2, %o4 time->tv_nsec += add->tv_nsec; 200ba24: 82 00 c0 01 add %g3, %g1, %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200ba28: d8 22 00 00 st %o4, [ %o0 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200ba2c: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 200ba30: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 200ba34: 80 a0 40 04 cmp %g1, %g4 200ba38: 08 80 00 0d bleu 200ba6c <_Timespec_Add_to+0x5c> 200ba3c: c2 22 20 04 st %g1, [ %o0 + 4 ] 200ba40: 98 03 20 01 inc %o4 time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200ba44: 1b 31 19 4d sethi %hi(0xc4653400), %o5 #include #include #include #include uint32_t _Timespec_Add_to( 200ba48: 98 23 00 02 sub %o4, %g2, %o4 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 ) { time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200ba4c: 9a 13 62 00 or %o5, 0x200, %o5 200ba50: 82 00 40 0d add %g1, %o5, %g1 #include #include #include #include uint32_t _Timespec_Add_to( 200ba54: 86 03 00 02 add %o4, %g2, %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 ) { 200ba58: 80 a0 40 04 cmp %g1, %g4 200ba5c: 18 bf ff fd bgu 200ba50 <_Timespec_Add_to+0x40> <== NEVER TAKEN 200ba60: 84 00 a0 01 inc %g2 200ba64: c2 22 20 04 st %g1, [ %o0 + 4 ] 200ba68: c6 22 00 00 st %g3, [ %o0 ] time->tv_sec++; seconds++; } return seconds; } 200ba6c: 81 c3 e0 08 retl 200ba70: 90 10 00 02 mov %g2, %o0 =============================================================================== 0200ca5c <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200ca5c: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200ca60: d4 1e 40 00 ldd [ %i1 ], %o2 200ca64: 80 92 80 0b orcc %o2, %o3, %g0 200ca68: 22 80 00 2f be,a 200cb24 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200ca6c: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200ca70: e0 1e 00 00 ldd [ %i0 ], %l0 200ca74: 83 2c 20 02 sll %l0, 2, %g1 200ca78: 89 34 60 1e srl %l1, 0x1e, %g4 200ca7c: 87 2c 60 02 sll %l1, 2, %g3 200ca80: 84 11 00 01 or %g4, %g1, %g2 200ca84: 83 30 e0 1b srl %g3, 0x1b, %g1 200ca88: 9b 28 e0 05 sll %g3, 5, %o5 200ca8c: 99 28 a0 05 sll %g2, 5, %o4 200ca90: 86 a3 40 03 subcc %o5, %g3, %g3 200ca94: 98 10 40 0c or %g1, %o4, %o4 200ca98: 84 63 00 02 subx %o4, %g2, %g2 200ca9c: 92 80 c0 11 addcc %g3, %l1, %o1 200caa0: 83 32 60 1e srl %o1, 0x1e, %g1 200caa4: 90 40 80 10 addx %g2, %l0, %o0 200caa8: b3 2a 60 02 sll %o1, 2, %i1 200caac: b1 2a 20 02 sll %o0, 2, %i0 200cab0: 86 82 40 19 addcc %o1, %i1, %g3 200cab4: b0 10 40 18 or %g1, %i0, %i0 200cab8: 83 30 e0 1e srl %g3, 0x1e, %g1 200cabc: 84 42 00 18 addx %o0, %i0, %g2 200cac0: bb 28 e0 02 sll %g3, 2, %i5 200cac4: b9 28 a0 02 sll %g2, 2, %i4 200cac8: 92 80 c0 1d addcc %g3, %i5, %o1 200cacc: b8 10 40 1c or %g1, %i4, %i4 200cad0: 87 32 60 1b srl %o1, 0x1b, %g3 200cad4: 90 40 80 1c addx %g2, %i4, %o0 200cad8: 83 2a 60 05 sll %o1, 5, %g1 200cadc: 85 2a 20 05 sll %o0, 5, %g2 200cae0: 92 10 00 01 mov %g1, %o1 200cae4: 40 00 37 ce call 201aa1c <__divdi3> 200cae8: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200caec: 94 10 20 00 clr %o2 * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200caf0: b8 10 00 08 mov %o0, %i4 200caf4: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 200caf8: 40 00 37 c9 call 201aa1c <__divdi3> 200cafc: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200cb00: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200cb04: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200cb08: 94 10 20 00 clr %o2 200cb0c: 96 10 23 e8 mov 0x3e8, %o3 200cb10: 40 00 38 ae call 201adc8 <__moddi3> 200cb14: 92 10 00 1d mov %i5, %o1 200cb18: d2 26 c0 00 st %o1, [ %i3 ] 200cb1c: 81 c7 e0 08 ret 200cb20: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200cb24: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200cb28: 81 c7 e0 08 ret <== NOT EXECUTED 200cb2c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200b3b0 <_User_extensions_Handler_initialization>: } } void _User_extensions_Handler_initialization(void) { 200b3b0: 9d e3 bf 98 save %sp, -104, %sp uint32_t number_of_initial_extensions = 200b3b4: 03 00 80 68 sethi %hi(0x201a000), %g1 200b3b8: c2 00 60 a8 ld [ %g1 + 0xa8 ], %g1 ! 201a0a8 rtems_configuration_get_number_of_initial_extensions(); if ( number_of_initial_extensions > 0 ) { 200b3bc: 80 a0 60 00 cmp %g1, 0 200b3c0: 02 80 00 0a be 200b3e8 <_User_extensions_Handler_initialization+0x38><== NEVER TAKEN 200b3c4: 91 28 60 02 sll %g1, 2, %o0 User_extensions_Switch_control *initial_extension_switch_controls = _Workspace_Allocate_or_fatal_error( number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) 200b3c8: 83 28 60 04 sll %g1, 4, %g1 { uint32_t number_of_initial_extensions = rtems_configuration_get_number_of_initial_extensions(); if ( number_of_initial_extensions > 0 ) { User_extensions_Switch_control *initial_extension_switch_controls = 200b3cc: 40 00 01 2c call 200b87c <_Workspace_Allocate_or_fatal_error> 200b3d0: 90 20 40 08 sub %g1, %o0, %o0 number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) ); User_extensions_Switch_context ctx = { initial_extension_switch_controls }; _User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor ); 200b3d4: 13 00 80 2c sethi %hi(0x200b000), %o1 User_extensions_Switch_control *initial_extension_switch_controls = _Workspace_Allocate_or_fatal_error( number_of_initial_extensions * sizeof( *initial_extension_switch_controls ) ); User_extensions_Switch_context ctx = { initial_extension_switch_controls }; 200b3d8: d0 27 bf fc st %o0, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor ); 200b3dc: 92 12 63 6c or %o1, 0x36c, %o1 200b3e0: 7f ff ff c0 call 200b2e0 <_User_extensions_Iterate> 200b3e4: 90 07 bf fc add %fp, -4, %o0 200b3e8: 81 c7 e0 08 ret 200b3ec: 81 e8 00 00 restore =============================================================================== 0200b2e0 <_User_extensions_Iterate>: void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { 200b2e0: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing = _Thread_Executing; const User_extensions_Table *callouts_current = 200b2e4: 03 00 80 68 sethi %hi(0x201a000), %g1 200b2e8: 82 10 60 68 or %g1, 0x68, %g1 ! 201a068 200b2ec: fa 00 60 44 ld [ %g1 + 0x44 ], %i5 rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); 200b2f0: f6 00 60 40 ld [ %g1 + 0x40 ], %i3 void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { Thread_Control *executing = _Thread_Executing; 200b2f4: 03 00 80 73 sethi %hi(0x201cc00), %g1 const User_extensions_Table *callouts_current = rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); 200b2f8: b7 2e e0 05 sll %i3, 5, %i3 ) { Thread_Control *executing = _Thread_Executing; const User_extensions_Table *callouts_current = rtems_configuration_get_user_extension_table(); const User_extensions_Table *callouts_end = 200b2fc: b6 07 40 1b add %i5, %i3, %i3 callouts_current + rtems_configuration_get_number_of_initial_extensions(); const Chain_Node *node; const Chain_Node *tail; while ( callouts_current != callouts_end ) { 200b300: 80 a7 40 1b cmp %i5, %i3 200b304: 02 80 00 0a be 200b32c <_User_extensions_Iterate+0x4c> <== NEVER TAKEN 200b308: f8 00 62 a0 ld [ %g1 + 0x2a0 ], %i4 (*visitor)( executing, arg, callouts_current ); 200b30c: 94 10 00 1d mov %i5, %o2 200b310: 90 10 00 1c mov %i4, %o0 200b314: 9f c6 40 00 call %i1 200b318: 92 10 00 18 mov %i0, %o1 ++callouts_current; 200b31c: ba 07 60 20 add %i5, 0x20, %i5 const User_extensions_Table *callouts_end = callouts_current + rtems_configuration_get_number_of_initial_extensions(); const Chain_Node *node; const Chain_Node *tail; while ( callouts_current != callouts_end ) { 200b320: 80 a6 c0 1d cmp %i3, %i5 200b324: 12 bf ff fb bne 200b310 <_User_extensions_Iterate+0x30> 200b328: 94 10 00 1d mov %i5, %o2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b32c: 37 00 80 70 sethi %hi(0x201c000), %i3 200b330: fa 06 e2 ac ld [ %i3 + 0x2ac ], %i5 ! 201c2ac <_User_extensions_List> 200b334: b6 16 e2 ac or %i3, 0x2ac, %i3 ++callouts_current; } node = _Chain_Immutable_first( &_User_extensions_List ); tail = _Chain_Immutable_tail( &_User_extensions_List ); while ( node != tail ) { 200b338: b6 06 e0 04 add %i3, 4, %i3 200b33c: 80 a7 40 1b cmp %i5, %i3 200b340: 02 80 00 09 be 200b364 <_User_extensions_Iterate+0x84> 200b344: 94 07 60 14 add %i5, 0x14, %o2 const User_extensions_Control *extension = (const User_extensions_Control *) node; (*visitor)( executing, arg, &extension->Callouts ); 200b348: 90 10 00 1c mov %i4, %o0 200b34c: 9f c6 40 00 call %i1 200b350: 92 10 00 18 mov %i0, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next( const Chain_Node *the_node ) { return the_node->next; 200b354: fa 07 40 00 ld [ %i5 ], %i5 ++callouts_current; } node = _Chain_Immutable_first( &_User_extensions_List ); tail = _Chain_Immutable_tail( &_User_extensions_List ); while ( node != tail ) { 200b358: 80 a7 40 1b cmp %i5, %i3 200b35c: 12 bf ff fb bne 200b348 <_User_extensions_Iterate+0x68> 200b360: 94 07 60 14 add %i5, 0x14, %o2 200b364: 81 c7 e0 08 ret 200b368: 81 e8 00 00 restore =============================================================================== 0200cda8 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200cda8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200cdac: 7f ff d9 66 call 2003344 200cdb0: 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; 200cdb4: 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 ); 200cdb8: b8 06 20 04 add %i0, 4, %i4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200cdbc: 80 a0 40 1c cmp %g1, %i4 200cdc0: 02 80 00 1f be 200ce3c <_Watchdog_Adjust+0x94> 200cdc4: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200cdc8: 12 80 00 1f bne 200ce44 <_Watchdog_Adjust+0x9c> 200cdcc: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200cdd0: 80 a6 a0 00 cmp %i2, 0 200cdd4: 02 80 00 1a be 200ce3c <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200cdd8: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200cddc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200cde0: 80 a6 80 02 cmp %i2, %g2 200cde4: 1a 80 00 0a bcc 200ce0c <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200cde8: b6 10 20 01 mov 1, %i3 _Watchdog_First( header )->delta_interval -= units; 200cdec: 10 80 00 1d b 200ce60 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200cdf0: 84 20 80 1a sub %g2, %i2, %g2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200cdf4: 02 80 00 12 be 200ce3c <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200cdf8: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200cdfc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200ce00: 80 a0 80 1a cmp %g2, %i2 200ce04: 38 80 00 17 bgu,a 200ce60 <_Watchdog_Adjust+0xb8> 200ce08: 84 20 80 1a sub %g2, %i2, %g2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200ce0c: f6 20 60 10 st %i3, [ %g1 + 0x10 ] while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; 200ce10: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200ce14: 7f ff d9 50 call 2003354 200ce18: 01 00 00 00 nop _Watchdog_Tickle( header ); 200ce1c: 40 00 00 a8 call 200d0bc <_Watchdog_Tickle> 200ce20: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 200ce24: 7f ff d9 48 call 2003344 200ce28: 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; 200ce2c: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 200ce30: 80 a7 00 01 cmp %i4, %g1 200ce34: 12 bf ff f0 bne 200cdf4 <_Watchdog_Adjust+0x4c> 200ce38: 80 a6 a0 00 cmp %i2, 0 } break; } } _ISR_Enable( level ); 200ce3c: 7f ff d9 46 call 2003354 200ce40: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200ce44: 12 bf ff fe bne 200ce3c <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200ce48: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200ce4c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200ce50: b4 00 80 1a add %g2, %i2, %i2 200ce54: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200ce58: 7f ff d9 3f call 2003354 200ce5c: 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; 200ce60: 10 bf ff f7 b 200ce3c <_Watchdog_Adjust+0x94> 200ce64: c4 20 60 10 st %g2, [ %g1 + 0x10 ] =============================================================================== 0201c9dc <_Watchdog_Adjust_to_chain>: Chain_Control *header, Watchdog_Interval units_arg, Chain_Control *to_fire ) { 201c9dc: 9d e3 bf a0 save %sp, -96, %sp Watchdog_Interval units = units_arg; ISR_Level level; Watchdog_Control *first; _ISR_Disable( level ); 201c9e0: 7f ff cb 46 call 200f6f8 201c9e4: 01 00 00 00 nop 201c9e8: c2 06 00 00 ld [ %i0 ], %g1 201c9ec: ba 06 20 04 add %i0, 4, %i5 201c9f0: b8 06 a0 04 add %i2, 4, %i4 while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 201c9f4: 80 a7 40 01 cmp %i5, %g1 201c9f8: 02 80 00 20 be 201ca78 <_Watchdog_Adjust_to_chain+0x9c> 201c9fc: 01 00 00 00 nop /* * If it is longer than "units" until the first element on the chain * fires, then bump it and quit. */ if ( units < first->delta_interval ) { 201ca00: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 201ca04: 80 a6 40 02 cmp %i1, %g2 201ca08: 2a 80 00 1e bcs,a 201ca80 <_Watchdog_Adjust_to_chain+0xa4> 201ca0c: 84 20 80 19 sub %g2, %i1, %g2 /* * The first set happens in less than units, so take all of them * off the chain and adjust units to reflect this. */ units -= first->delta_interval; 201ca10: b2 26 40 02 sub %i1, %g2, %i1 first->delta_interval = 0; 201ca14: c0 20 60 10 clr [ %g1 + 0x10 ] { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 201ca18: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 201ca1c: c6 00 40 00 ld [ %g1 ], %g3 previous = the_node->previous; next->previous = previous; 201ca20: c4 20 e0 04 st %g2, [ %g3 + 4 ] previous->next = next; 201ca24: c6 20 80 00 st %g3, [ %g2 ] Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 201ca28: c4 06 a0 08 ld [ %i2 + 8 ], %g2 the_node->next = tail; 201ca2c: f8 20 40 00 st %i4, [ %g1 ] tail->previous = the_node; 201ca30: c2 26 a0 08 st %g1, [ %i2 + 8 ] old_last->next = the_node; 201ca34: c2 20 80 00 st %g1, [ %g2 ] the_node->previous = old_last; 201ca38: c4 20 60 04 st %g2, [ %g1 + 4 ] while ( 1 ) { _Chain_Extract_unprotected( &first->Node ); _Chain_Append_unprotected( to_fire, &first->Node ); _ISR_Flash( level ); 201ca3c: 7f ff cb 33 call 200f708 201ca40: 01 00 00 00 nop 201ca44: 7f ff cb 2d call 200f6f8 201ca48: 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; 201ca4c: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 201ca50: 80 a7 40 01 cmp %i5, %g1 201ca54: 02 bf ff e9 be 201c9f8 <_Watchdog_Adjust_to_chain+0x1c> 201ca58: 01 00 00 00 nop break; first = _Watchdog_First( header ); if ( first->delta_interval != 0 ) 201ca5c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 201ca60: 80 a0 a0 00 cmp %g2, 0 201ca64: 22 bf ff ee be,a 201ca1c <_Watchdog_Adjust_to_chain+0x40> 201ca68: c4 00 60 04 ld [ %g1 + 4 ], %g2 Watchdog_Control *first; _ISR_Disable( level ); while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 201ca6c: 80 a7 40 01 cmp %i5, %g1 201ca70: 12 bf ff e6 bne 201ca08 <_Watchdog_Adjust_to_chain+0x2c> <== ALWAYS TAKEN 201ca74: 80 a6 40 02 cmp %i1, %g2 if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 201ca78: 7f ff cb 24 call 200f708 201ca7c: 91 e8 00 08 restore %g0, %o0, %o0 /* * If it is longer than "units" until the first element on the chain * fires, then bump it and quit. */ if ( units < first->delta_interval ) { first->delta_interval -= units; 201ca80: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 201ca84: 7f ff cb 21 call 200f708 201ca88: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b56c <_Watchdog_Remove>: #include Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b56c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b570: 7f ff dc 27 call 200260c 200b574: 01 00 00 00 nop previous_state = the_watchdog->state; 200b578: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200b57c: 80 a7 60 01 cmp %i5, 1 200b580: 02 80 00 2a be 200b628 <_Watchdog_Remove+0xbc> 200b584: 03 00 80 73 sethi %hi(0x201cc00), %g1 200b588: 1a 80 00 09 bcc 200b5ac <_Watchdog_Remove+0x40> 200b58c: 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; 200b590: 03 00 80 73 sethi %hi(0x201cc00), %g1 200b594: c2 00 61 6c ld [ %g1 + 0x16c ], %g1 ! 201cd6c <_Watchdog_Ticks_since_boot> 200b598: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b59c: 7f ff dc 20 call 200261c 200b5a0: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b5a4: 81 c7 e0 08 ret 200b5a8: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200b5ac: 18 bf ff fa bgu 200b594 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200b5b0: 03 00 80 73 sethi %hi(0x201cc00), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200b5b4: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b5b8: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b5bc: c4 00 40 00 ld [ %g1 ], %g2 200b5c0: 80 a0 a0 00 cmp %g2, 0 200b5c4: 02 80 00 07 be 200b5e0 <_Watchdog_Remove+0x74> 200b5c8: 05 00 80 73 sethi %hi(0x201cc00), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b5cc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b5d0: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200b5d4: 84 00 c0 02 add %g3, %g2, %g2 200b5d8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b5dc: 05 00 80 73 sethi %hi(0x201cc00), %g2 200b5e0: c4 00 a1 68 ld [ %g2 + 0x168 ], %g2 ! 201cd68 <_Watchdog_Sync_count> 200b5e4: 80 a0 a0 00 cmp %g2, 0 200b5e8: 22 80 00 07 be,a 200b604 <_Watchdog_Remove+0x98> 200b5ec: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b5f0: 05 00 80 73 sethi %hi(0x201cc00), %g2 200b5f4: c6 00 a2 98 ld [ %g2 + 0x298 ], %g3 ! 201ce98 <_Per_CPU_Information+0x8> 200b5f8: 05 00 80 73 sethi %hi(0x201cc00), %g2 200b5fc: c6 20 a1 08 st %g3, [ %g2 + 0x108 ] ! 201cd08 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b600: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200b604: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b608: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b60c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200b610: c2 00 61 6c ld [ %g1 + 0x16c ], %g1 ! 201cd6c <_Watchdog_Ticks_since_boot> 200b614: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b618: 7f ff dc 01 call 200261c 200b61c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b620: 81 c7 e0 08 ret 200b624: 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; 200b628: c2 00 61 6c ld [ %g1 + 0x16c ], %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; 200b62c: 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; 200b630: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b634: 7f ff db fa call 200261c 200b638: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b63c: 81 c7 e0 08 ret 200b640: 81 e8 00 00 restore =============================================================================== 0200c7f4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200c7f4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200c7f8: 7f ff d9 d1 call 2002f3c 200c7fc: 01 00 00 00 nop 200c800: b6 10 00 08 mov %o0, %i3 printk( "Watchdog Chain: %s %p\n", name, header ); 200c804: 11 00 80 73 sethi %hi(0x201cc00), %o0 200c808: 94 10 00 19 mov %i1, %o2 200c80c: 92 10 00 18 mov %i0, %o1 200c810: 7f ff e1 86 call 2004e28 200c814: 90 12 21 98 or %o0, 0x198, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c818: fa 06 40 00 ld [ %i1 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200c81c: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200c820: 80 a7 40 19 cmp %i5, %i1 200c824: 02 80 00 0f be 200c860 <_Watchdog_Report_chain+0x6c> 200c828: 11 00 80 73 sethi %hi(0x201cc00), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200c82c: 92 10 00 1d mov %i5, %o1 200c830: 40 00 00 0f call 200c86c <_Watchdog_Report> 200c834: 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 ) 200c838: fa 07 40 00 ld [ %i5 ], %i5 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200c83c: 80 a7 40 19 cmp %i5, %i1 200c840: 12 bf ff fc bne 200c830 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200c844: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200c848: 11 00 80 73 sethi %hi(0x201cc00), %o0 200c84c: 92 10 00 18 mov %i0, %o1 200c850: 7f ff e1 76 call 2004e28 200c854: 90 12 21 b0 or %o0, 0x1b0, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200c858: 7f ff d9 bd call 2002f4c 200c85c: 91 e8 00 1b restore %g0, %i3, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200c860: 7f ff e1 72 call 2004e28 200c864: 90 12 21 c0 or %o0, 0x1c0, %o0 200c868: 30 bf ff fc b,a 200c858 <_Watchdog_Report_chain+0x64> =============================================================================== 0200b644 <_Watchdog_Tickle>: #include void _Watchdog_Tickle( Chain_Control *header ) { 200b644: 9d e3 bf a0 save %sp, -96, %sp * See the comment in watchdoginsert.c and watchdogadjust.c * about why it's safe not to declare header a pointer to * volatile data - till, 2003/7 */ _ISR_Disable( level ); 200b648: 7f ff db f1 call 200260c 200b64c: 01 00 00 00 nop 200b650: b8 10 00 08 mov %o0, %i4 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200b654: fa 06 00 00 ld [ %i0 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200b658: b4 06 20 04 add %i0, 4, %i2 if ( _Chain_Is_empty( header ) ) 200b65c: 80 a7 40 1a cmp %i5, %i2 200b660: 02 80 00 09 be 200b684 <_Watchdog_Tickle+0x40> 200b664: 01 00 00 00 nop * to be inserted has already had its delta_interval adjusted to 0, and * so is added to the head of the chain with a delta_interval of 0. * * Steven Johnson - 12/2005 (gcc-3.2.3 -O3 on powerpc) */ if (the_watchdog->delta_interval != 0) { 200b668: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200b66c: 80 a0 60 00 cmp %g1, 0 200b670: 02 80 00 15 be 200b6c4 <_Watchdog_Tickle+0x80> <== NEVER TAKEN 200b674: 82 00 7f ff add %g1, -1, %g1 the_watchdog->delta_interval--; if ( the_watchdog->delta_interval != 0 ) 200b678: 80 a0 60 00 cmp %g1, 0 200b67c: 02 80 00 12 be 200b6c4 <_Watchdog_Tickle+0x80> 200b680: c2 27 60 10 st %g1, [ %i5 + 0x10 ] the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && (the_watchdog->delta_interval == 0) ); leave: _ISR_Enable(level); 200b684: 7f ff db e6 call 200261c 200b688: 91 e8 00 1c restore %g0, %i4, %o0 _ISR_Enable( level ); switch( watchdog_state ) { case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 200b68c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200b690: 9f c0 40 00 call %g1 200b694: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 case WATCHDOG_REMOVE_IT: break; } _ISR_Disable( level ); 200b698: 7f ff db dd call 200260c 200b69c: 01 00 00 00 nop 200b6a0: b8 10 00 08 mov %o0, %i4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200b6a4: fa 06 00 00 ld [ %i0 ], %i5 the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && (the_watchdog->delta_interval == 0) ); 200b6a8: 80 a6 80 1d cmp %i2, %i5 200b6ac: 02 bf ff f6 be 200b684 <_Watchdog_Tickle+0x40> 200b6b0: 01 00 00 00 nop } _ISR_Disable( level ); the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && 200b6b4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200b6b8: 80 a0 60 00 cmp %g1, 0 200b6bc: 12 bf ff f2 bne 200b684 <_Watchdog_Tickle+0x40> 200b6c0: 01 00 00 00 nop if ( the_watchdog->delta_interval != 0 ) goto leave; } do { watchdog_state = _Watchdog_Remove( the_watchdog ); 200b6c4: 7f ff ff aa call 200b56c <_Watchdog_Remove> 200b6c8: 90 10 00 1d mov %i5, %o0 200b6cc: b6 10 00 08 mov %o0, %i3 _ISR_Enable( level ); 200b6d0: 7f ff db d3 call 200261c 200b6d4: 90 10 00 1c mov %i4, %o0 switch( watchdog_state ) { 200b6d8: 80 a6 e0 02 cmp %i3, 2 200b6dc: 12 bf ff ef bne 200b698 <_Watchdog_Tickle+0x54> 200b6e0: 01 00 00 00 nop case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 200b6e4: 10 bf ff ea b 200b68c <_Watchdog_Tickle+0x48> 200b6e8: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 =============================================================================== 0200b6ec <_Workspace_Handler_initialization>: void _Workspace_Handler_initialization( Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { 200b6ec: 9d e3 bf 98 save %sp, -104, %sp Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t remaining = rtems_configuration_get_work_space_size(); 200b6f0: 05 00 80 68 sethi %hi(0x201a000), %g2 200b6f4: 82 10 a0 68 or %g2, 0x68, %g1 ! 201a068 200b6f8: c6 08 60 32 ldub [ %g1 + 0x32 ], %g3 200b6fc: f6 00 a0 68 ld [ %g2 + 0x68 ], %i3 200b700: 80 a0 e0 00 cmp %g3, 0 200b704: 12 80 00 03 bne 200b710 <_Workspace_Handler_initialization+0x24> 200b708: 84 10 20 00 clr %g2 200b70c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200b710: b6 00 80 1b add %g2, %i3, %i3 bool do_zero = rtems_configuration_get_do_zero_of_workspace(); 200b714: c4 08 60 30 ldub [ %g1 + 0x30 ], %g2 bool unified = rtems_configuration_get_unified_work_area(); 200b718: c2 08 60 31 ldub [ %g1 + 0x31 ], %g1 Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; uintptr_t remaining = rtems_configuration_get_work_space_size(); bool do_zero = rtems_configuration_get_do_zero_of_workspace(); 200b71c: c4 2f bf ff stb %g2, [ %fp + -1 ] bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 200b720: 80 a6 60 00 cmp %i1, 0 200b724: 02 80 00 3c be 200b814 <_Workspace_Handler_initialization+0x128><== NEVER TAKEN 200b728: c2 2f bf fe stb %g1, [ %fp + -2 ] Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; 200b72c: 23 00 80 23 sethi %hi(0x2008c00), %l1 } else { size = 0; } } space_available = (*init_or_extend)( 200b730: 27 00 80 73 sethi %hi(0x201cc00), %l3 bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 200b734: b8 10 20 00 clr %i4 Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize; 200b738: a2 14 61 fc or %l1, 0x1fc, %l1 200b73c: a0 08 a0 ff and %g2, 0xff, %l0 if ( area->size > overhead ) { uintptr_t space_available; uintptr_t size; if ( unified ) { 200b740: a4 08 60 ff and %g1, 0xff, %l2 } else { size = 0; } } space_available = (*init_or_extend)( 200b744: 10 80 00 22 b 200b7cc <_Workspace_Handler_initialization+0xe0> 200b748: a6 14 e0 90 or %l3, 0x90, %l3 if ( do_zero ) { memset( area->begin, 0, area->size ); } if ( area->size > overhead ) { 200b74c: 80 a7 60 16 cmp %i5, 0x16 200b750: 28 80 00 1c bleu,a 200b7c0 <_Workspace_Handler_initialization+0xd4> 200b754: b8 07 20 01 inc %i4 uintptr_t space_available; uintptr_t size; if ( unified ) { 200b758: 80 a4 a0 00 cmp %l2, 0 200b75c: 32 80 00 0a bne,a 200b784 <_Workspace_Handler_initialization+0x98> 200b760: d2 06 00 00 ld [ %i0 ], %o1 size = area->size; } else { if ( remaining > 0 ) { 200b764: 80 a6 e0 00 cmp %i3, 0 200b768: 22 80 00 22 be,a 200b7f0 <_Workspace_Handler_initialization+0x104><== NEVER TAKEN 200b76c: d2 06 00 00 ld [ %i0 ], %o1 <== NOT EXECUTED size = remaining < area->size - overhead ? 200b770: 82 07 7f ea add %i5, -22, %g1 remaining + overhead : area->size; 200b774: 80 a0 40 1b cmp %g1, %i3 200b778: 38 80 00 02 bgu,a 200b780 <_Workspace_Handler_initialization+0x94><== ALWAYS TAKEN 200b77c: ba 06 e0 16 add %i3, 0x16, %i5 } else { size = 0; } } space_available = (*init_or_extend)( 200b780: d2 06 00 00 ld [ %i0 ], %o1 200b784: 94 10 00 1d mov %i5, %o2 200b788: 90 10 00 13 mov %l3, %o0 200b78c: 9f c4 40 00 call %l1 200b790: 96 10 20 08 mov 8, %o3 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b794: c2 06 00 00 ld [ %i0 ], %g1 area->size -= size; 200b798: c4 06 20 04 ld [ %i0 + 4 ], %g2 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b79c: 82 00 40 1d add %g1, %i5, %g1 area->size -= size; 200b7a0: ba 20 80 1d sub %g2, %i5, %i5 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b7a4: c2 26 00 00 st %g1, [ %i0 ] area->size -= size; if ( space_available < remaining ) { 200b7a8: 80 a2 00 1b cmp %o0, %i3 200b7ac: 1a 80 00 1f bcc 200b828 <_Workspace_Handler_initialization+0x13c><== ALWAYS TAKEN 200b7b0: fa 26 20 04 st %i5, [ %i0 + 4 ] remaining -= space_available; 200b7b4: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED } else { remaining = 0; } init_or_extend = extend; 200b7b8: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 200b7bc: b8 07 20 01 inc %i4 200b7c0: 80 a7 00 19 cmp %i4, %i1 200b7c4: 02 80 00 14 be 200b814 <_Workspace_Handler_initialization+0x128><== ALWAYS TAKEN 200b7c8: b0 06 20 08 add %i0, 8, %i0 Heap_Area *area = &areas [i]; if ( do_zero ) { 200b7cc: 80 a4 20 00 cmp %l0, 0 200b7d0: 22 bf ff df be,a 200b74c <_Workspace_Handler_initialization+0x60> 200b7d4: fa 06 20 04 ld [ %i0 + 4 ], %i5 memset( area->begin, 0, area->size ); 200b7d8: d0 06 00 00 ld [ %i0 ], %o0 200b7dc: d4 06 20 04 ld [ %i0 + 4 ], %o2 200b7e0: 40 00 11 e0 call 200ff60 200b7e4: 92 10 20 00 clr %o1 } if ( area->size > overhead ) { 200b7e8: 10 bf ff d9 b 200b74c <_Workspace_Handler_initialization+0x60> 200b7ec: fa 06 20 04 ld [ %i0 + 4 ], %i5 } else { size = 0; } } space_available = (*init_or_extend)( 200b7f0: 90 10 00 13 mov %l3, %o0 <== NOT EXECUTED 200b7f4: 94 10 20 00 clr %o2 <== NOT EXECUTED 200b7f8: 9f c4 40 00 call %l1 <== NOT EXECUTED 200b7fc: 96 10 20 08 mov 8, %o3 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 200b800: b8 07 20 01 inc %i4 <== NOT EXECUTED remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 200b804: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED bool unified = rtems_configuration_get_unified_work_area(); uintptr_t page_size = CPU_HEAP_ALIGNMENT; uintptr_t overhead = _Heap_Area_overhead( page_size ); size_t i; for (i = 0; i < area_count; ++i) { 200b808: 80 a7 00 19 cmp %i4, %i1 <== NOT EXECUTED 200b80c: 12 bf ff f0 bne 200b7cc <_Workspace_Handler_initialization+0xe0><== NOT EXECUTED 200b810: b0 06 20 08 add %i0, 8, %i0 <== NOT EXECUTED init_or_extend = extend; } } if ( remaining > 0 ) { 200b814: 80 a6 e0 00 cmp %i3, 0 200b818: 12 80 00 07 bne 200b834 <_Workspace_Handler_initialization+0x148> 200b81c: 90 10 20 00 clr %o0 200b820: 81 c7 e0 08 ret 200b824: 81 e8 00 00 restore remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 200b828: a2 10 00 1a mov %i2, %l1 area->size -= size; if ( space_available < remaining ) { remaining -= space_available; } else { remaining = 0; 200b82c: 10 bf ff e4 b 200b7bc <_Workspace_Handler_initialization+0xd0> 200b830: b6 10 20 00 clr %i3 init_or_extend = extend; } } if ( remaining > 0 ) { _Internal_error_Occurred( 200b834: 92 10 20 01 mov 1, %o1 200b838: 7f ff f6 0e call 2009070 <_Internal_error_Occurred> 200b83c: 94 10 20 02 mov 2, %o2 =============================================================================== 0200b650 <_Workspace_String_duplicate>: char *_Workspace_String_duplicate( const char *string, size_t len ) { 200b650: 9d e3 bf a0 save %sp, -96, %sp char *dup = _Workspace_Allocate(len + 1); 200b654: 7f ff ff e2 call 200b5dc <_Workspace_Allocate> 200b658: 90 06 60 01 add %i1, 1, %o0 if (dup != NULL) { 200b65c: ba 92 20 00 orcc %o0, 0, %i5 200b660: 02 80 00 05 be 200b674 <_Workspace_String_duplicate+0x24> <== NEVER TAKEN 200b664: 92 10 00 18 mov %i0, %o1 dup [len] = '\0'; 200b668: c0 2f 40 19 clrb [ %i5 + %i1 ] memcpy(dup, string, len); 200b66c: 40 00 12 0b call 200fe98 200b670: 94 10 00 19 mov %i1, %o2 } return dup; } 200b674: 81 c7 e0 08 ret 200b678: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02019ba4 <__kill>: #endif int __kill( pid_t pid, int sig ) { return 0; } 2019ba4: 81 c3 e0 08 retl <== NOT EXECUTED 2019ba8: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 02013f8c <_fat_block_read>: uint32_t start, uint32_t offset, uint32_t count, void *buff ) { 2013f8c: 9d e3 bf 98 save %sp, -104, %sp 2013f90: a0 10 00 18 mov %i0, %l0 uint32_t sec_num = start; uint32_t ofs = offset; uint8_t *sec_buf; uint32_t c = 0; while (count > 0) 2013f94: 80 a6 e0 00 cmp %i3, 0 2013f98: 12 80 00 11 bne 2013fdc <_fat_block_read+0x50> <== ALWAYS TAKEN 2013f9c: b0 10 20 00 clr %i0 2013fa0: 30 80 00 19 b,a 2014004 <_fat_block_read+0x78> <== NOT EXECUTED { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2013fa4: fa 14 00 00 lduh [ %l0 ], %i5 memcpy((buff + cmpltd), (sec_buf + ofs), c); 2013fa8: d2 07 bf fc ld [ %fp + -4 ], %o1 { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2013fac: ba 27 40 1a sub %i5, %i2, %i5 2013fb0: 80 a7 40 1b cmp %i5, %i3 2013fb4: 08 80 00 03 bleu 2013fc0 <_fat_block_read+0x34> 2013fb8: 92 02 40 1a add %o1, %i2, %o1 2013fbc: ba 10 00 1b mov %i3, %i5 memcpy((buff + cmpltd), (sec_buf + ofs), c); 2013fc0: 40 00 23 56 call 201cd18 2013fc4: 94 10 00 1d mov %i5, %o2 count -= c; cmpltd += c; 2013fc8: b0 07 40 18 add %i5, %i0, %i0 sec_num++; 2013fcc: b2 06 60 01 inc %i1 uint32_t sec_num = start; uint32_t ofs = offset; uint8_t *sec_buf; uint32_t c = 0; while (count > 0) 2013fd0: b6 a6 c0 1d subcc %i3, %i5, %i3 2013fd4: 02 80 00 0c be 2014004 <_fat_block_read+0x78> 2013fd8: b4 10 20 00 clr %i2 { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); 2013fdc: 92 10 00 19 mov %i1, %o1 2013fe0: 94 10 20 01 mov 1, %o2 2013fe4: 96 07 bf fc add %fp, -4, %o3 2013fe8: 7f ff ff bb call 2013ed4 2013fec: 90 10 00 10 mov %l0, %o0 if (rc != RC_OK) 2013ff0: 80 a2 20 00 cmp %o0, 0 2013ff4: 02 bf ff ec be 2013fa4 <_fat_block_read+0x18> <== ALWAYS TAKEN 2013ff8: 90 07 00 18 add %i4, %i0, %o0 cmpltd += c; sec_num++; ofs = 0; } return cmpltd; } 2013ffc: 81 c7 e0 08 ret <== NOT EXECUTED 2014000: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2014004: 81 c7 e0 08 ret 2014008: 81 e8 00 00 restore =============================================================================== 020037b4 <_gettimeofday>: int _gettimeofday( struct timeval *tp, struct timezone *tzp ) { return gettimeofday( tp, tzp ); 20037b4: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 20037b8: 7f ff ff d8 call 2003718 <== NOT EXECUTED 20037bc: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02003dd4 <_lstat_r>: struct _reent *ptr __attribute__((unused)), const char *path, struct stat *buf ) { return _STAT_NAME( path, buf ); 2003dd4: 90 10 00 09 mov %o1, %o0 <== NOT EXECUTED 2003dd8: 92 10 00 0a mov %o2, %o1 <== NOT EXECUTED 2003ddc: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2003de0: 7f ff ff e9 call 2003d84 <== NOT EXECUTED 2003de4: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 020046cc <_stat_r>: struct _reent *ptr __attribute__((unused)), const char *path, struct stat *buf ) { return _STAT_NAME( path, buf ); 20046cc: 90 10 00 09 mov %o1, %o0 <== NOT EXECUTED 20046d0: 92 10 00 0a mov %o2, %o1 <== NOT EXECUTED 20046d4: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 20046d8: 7f ff ff e9 call 200467c <== NOT EXECUTED 20046dc: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02008bc8 : rtems_rbtree_control *chunk_tree, rtems_rbheap_chunk *a, rtems_rbheap_chunk *b ) { if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) { 2008bc8: 80 a2 ff f8 cmp %o3, -8 2008bcc: 02 80 00 23 be 2008c58 2008bd0: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2008bd4: c2 02 c0 00 ld [ %o3 ], %g1 2008bd8: 80 a0 60 00 cmp %g1, 0 2008bdc: 22 80 00 1c be,a 2008c4c 2008be0: c4 02 e0 04 ld [ %o3 + 4 ], %g2 if (b->begin < a->begin) { 2008be4: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 2008be8: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2 2008bec: 80 a0 c0 02 cmp %g3, %g2 2008bf0: 3a 80 00 07 bcc,a 2008c0c 2008bf4: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008bf8: 84 10 00 0a mov %o2, %g2 2008bfc: c2 02 80 00 ld [ %o2 ], %g1 2008c00: 94 10 00 0b mov %o3, %o2 2008c04: 96 10 00 02 mov %g2, %o3 a = b; b = t; } a->size += b->size; 2008c08: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008c0c: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008c10: c4 02 e0 04 ld [ %o3 + 4 ], %g2 2008c14: 86 01 00 03 add %g4, %g3, %g3 2008c18: c6 22 a0 1c st %g3, [ %o2 + 0x1c ] next->previous = previous; previous->next = next; 2008c1c: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2008c20: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008c24: c2 02 00 00 ld [ %o0 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008c28: d0 22 e0 04 st %o0, [ %o3 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008c2c: d6 22 00 00 st %o3, [ %o0 ] the_node->next = before_node; 2008c30: c2 22 c0 00 st %g1, [ %o3 ] rtems_chain_extract_unprotected(&b->chain_node); add_to_chain(free_chain, b); _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); 2008c34: 90 10 00 09 mov %o1, %o0 before_node->previous = the_node; 2008c38: d6 20 60 04 st %o3, [ %g1 + 4 ] 2008c3c: 92 02 e0 08 add %o3, 8, %o1 2008c40: 82 13 c0 00 mov %o7, %g1 2008c44: 40 00 07 29 call 200a8e8 <_RBTree_Extract_unprotected> 2008c48: 9e 10 40 00 mov %g1, %o7 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2008c4c: 80 a0 a0 00 cmp %g2, 0 2008c50: 32 bf ff e6 bne,a 2008be8 <== NEVER TAKEN 2008c54: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED 2008c58: 81 c3 e0 08 retl =============================================================================== 02003a00 : #include #include int chroot( const char *path ) { 2003a00: 9d e3 bf 48 save %sp, -184, %sp /* * We use the global environment for path evaluation. This makes it possible * to escape from a chroot environment referencing an unmounted file system. */ rtems_filesystem_eval_path_start_with_root_and_current( 2003a04: 94 10 20 19 mov 0x19, %o2 2003a08: 92 10 00 18 mov %i0, %o1 2003a0c: 90 07 bf c8 add %fp, -56, %o0 2003a10: 17 00 80 46 sethi %hi(0x2011800), %o3 2003a14: 96 12 e2 24 or %o3, 0x224, %o3 ! 2011a24 2003a18: 40 00 04 f3 call 2004de4 2003a1c: 98 02 ff fc add %o3, -4, %o4 2003a20: 92 07 bf e0 add %fp, -32, %o1 2003a24: 40 00 06 0b call 2005250 2003a28: 90 07 bf b0 add %fp, -80, %o0 &rtems_global_user_env.root_directory, &rtems_global_user_env.current_directory ); rtems_filesystem_eval_path_extract_currentloc( &ctx, &loc ); new_current_loc = rtems_filesystem_location_transform_to_global( &loc ); 2003a2c: 40 00 06 98 call 200548c 2003a30: 90 07 bf b0 add %fp, -80, %o0 if ( !rtems_filesystem_global_location_is_null( new_current_loc ) ) { 2003a34: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2003a38: 39 00 80 45 sethi %hi(0x2011400), %i4 2003a3c: b8 17 20 c4 or %i4, 0xc4, %i4 ! 20114c4 2003a40: 80 a0 40 1c cmp %g1, %i4 2003a44: 02 80 00 16 be 2003a9c 2003a48: d0 27 bf ac st %o0, [ %fp + -84 ] rtems_filesystem_global_location_t *new_root_loc = 2003a4c: 40 00 06 56 call 20053a4 2003a50: 90 07 bf ac add %fp, -84, %o0 rtems_filesystem_global_location_obtain( &new_current_loc ); rtems_filesystem_node_types_t type = (*new_root_loc->location.mt_entry->ops->node_type_h)( 2003a54: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 2003a58: c2 00 60 0c ld [ %g1 + 0xc ], %g1 rtems_filesystem_eval_path_extract_currentloc( &ctx, &loc ); new_current_loc = rtems_filesystem_location_transform_to_global( &loc ); if ( !rtems_filesystem_global_location_is_null( new_current_loc ) ) { rtems_filesystem_global_location_t *new_root_loc = rtems_filesystem_global_location_obtain( &new_current_loc ); rtems_filesystem_node_types_t type = 2003a5c: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 2003a60: 9f c0 40 00 call %g1 2003a64: ba 10 00 08 mov %o0, %i5 (*new_root_loc->location.mt_entry->ops->node_type_h)( &new_root_loc->location ); if ( type == RTEMS_FILESYSTEM_DIRECTORY ) { 2003a68: 80 a2 20 00 cmp %o0, 0 2003a6c: 02 80 00 13 be 2003ab8 2003a70: 01 00 00 00 nop static inline void rtems_filesystem_location_error( const rtems_filesystem_location_info_t *loc, int eno ) { if ( !rtems_filesystem_location_is_null( loc ) ) { 2003a74: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2003a78: 80 a0 40 1c cmp %g1, %i4 2003a7c: 02 80 00 06 be 2003a94 <== NEVER TAKEN 2003a80: 01 00 00 00 nop errno = eno; 2003a84: 40 00 1e 5e call 200b3fc <__errno> 2003a88: 01 00 00 00 nop 2003a8c: 82 10 20 14 mov 0x14, %g1 ! 14 2003a90: c2 22 00 00 st %g1, [ %o0 ] rtems_filesystem_location_error( &new_root_loc->location, ENOTDIR ); rv = -1; } if ( rv != 0 ) { rtems_filesystem_global_location_release( new_root_loc ); 2003a94: 40 00 06 24 call 2005324 2003a98: 90 10 00 1d mov %i5, %o0 } } else { rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2003a9c: 40 00 05 1c call 2004f0c 2003aa0: 90 07 bf c8 add %fp, -56, %o0 if ( rv != 0 ) { rtems_filesystem_global_location_release( new_current_loc ); 2003aa4: d0 07 bf ac ld [ %fp + -84 ], %o0 2003aa8: 40 00 06 1f call 2005324 2003aac: b0 10 3f ff mov -1, %i0 } return rv; } 2003ab0: 81 c7 e0 08 ret 2003ab4: 81 e8 00 00 restore (*new_root_loc->location.mt_entry->ops->node_type_h)( &new_root_loc->location ); if ( type == RTEMS_FILESYSTEM_DIRECTORY ) { sc = rtems_libio_set_private_env(); 2003ab8: 40 00 03 11 call 20046fc 2003abc: 01 00 00 00 nop if (sc == RTEMS_SUCCESSFUL) { 2003ac0: 80 a2 20 00 cmp %o0, 0 2003ac4: 02 80 00 09 be 2003ae8 2003ac8: 80 a2 20 0d cmp %o0, 0xd rtems_filesystem_global_location_assign( &rtems_filesystem_current, new_current_loc ); } else { if (sc != RTEMS_UNSATISFIED) { 2003acc: 02 bf ff f2 be 2003a94 <== NEVER TAKEN 2003ad0: 01 00 00 00 nop errno = ENOMEM; 2003ad4: 40 00 1e 4a call 200b3fc <__errno> 2003ad8: 01 00 00 00 nop 2003adc: 82 10 20 0c mov 0xc, %g1 ! c 2003ae0: 10 bf ff ed b 2003a94 2003ae4: c2 22 00 00 st %g1, [ %o0 ] ); if ( type == RTEMS_FILESYSTEM_DIRECTORY ) { sc = rtems_libio_set_private_env(); if (sc == RTEMS_SUCCESSFUL) { rtems_filesystem_global_location_assign( 2003ae8: 39 00 80 46 sethi %hi(0x2011800), %i4 2003aec: d0 07 22 1c ld [ %i4 + 0x21c ], %o0 ! 2011a1c 2003af0: 92 10 00 1d mov %i5, %o1 2003af4: 40 00 06 22 call 200537c 2003af8: 90 02 20 04 add %o0, 4, %o0 &rtems_filesystem_root, new_root_loc ); rtems_filesystem_global_location_assign( 2003afc: d2 07 bf ac ld [ %fp + -84 ], %o1 2003b00: d0 07 22 1c ld [ %i4 + 0x21c ], %o0 2003b04: 40 00 06 1e call 200537c 2003b08: b0 10 20 00 clr %i0 } } else { rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2003b0c: 40 00 05 00 call 2004f0c 2003b10: 90 07 bf c8 add %fp, -56, %o0 2003b14: 81 c7 e0 08 ret 2003b18: 81 e8 00 00 restore =============================================================================== 02003578 : dev_t dev, const char *name, rtems_disk_device **dd_ptr, char **alloc_name_ptr ) { 2003578: 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) { 200357c: 25 00 80 83 sethi %hi(0x2020c00), %l2 2003580: fa 04 a3 58 ld [ %l2 + 0x358 ], %i5 ! 2020f58 2003584: 80 a6 00 1d cmp %i0, %i5 2003588: 1a 80 00 30 bcc 2003648 200358c: a2 10 00 18 mov %i0, %l1 2003590: 03 00 80 83 sethi %hi(0x2020c00), %g1 2003594: e0 00 63 5c ld [ %g1 + 0x35c ], %l0 ! 2020f5c memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); disktab = table; disktab_size = new_size; } if (disktab [major].minor == NULL || minor >= disktab[major].size) { 2003598: 83 2c 60 03 sll %l1, 3, %g1 200359c: fa 04 00 01 ld [ %l0 + %g1 ], %i5 20035a0: a0 04 00 01 add %l0, %g1, %l0 20035a4: 80 a7 60 00 cmp %i5, 0 20035a8: 02 80 00 0f be 20035e4 20035ac: f0 04 20 04 ld [ %l0 + 4 ], %i0 20035b0: 80 a6 40 18 cmp %i1, %i0 20035b4: 1a 80 00 0d bcc 20035e8 20035b8: 80 a6 20 00 cmp %i0, 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; 20035bc: 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) { 20035c0: a0 87 40 01 addcc %i5, %g1, %l0 20035c4: 02 80 00 1f be 2003640 <== NEVER TAKEN 20035c8: 01 00 00 00 nop return RTEMS_NO_MEMORY; } if (*dd_entry != NULL) { 20035cc: c2 07 40 01 ld [ %i5 + %g1 ], %g1 20035d0: 80 a0 60 00 cmp %g1, 0 20035d4: 02 80 00 36 be 20036ac 20035d8: b0 10 20 0c mov 0xc, %i0 *dd_entry = dd; *dd_ptr = dd; *alloc_name_ptr = alloc_name; return RTEMS_SUCCESSFUL; } 20035dc: 81 c7 e0 08 ret 20035e0: 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) { 20035e4: 80 a6 20 00 cmp %i0, 0 20035e8: 12 80 00 2b bne 2003694 20035ec: a4 10 20 08 mov 8, %l2 new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; } if (minor >= new_size) { 20035f0: 80 a6 40 12 cmp %i1, %l2 20035f4: 3a 80 00 02 bcc,a 20035fc 20035f8: a4 06 60 01 add %i1, 1, %l2 new_size = minor + 1; } table = realloc(table, new_size * sizeof(*table)); 20035fc: 90 10 00 1d mov %i5, %o0 2003600: 40 00 08 bb call 20058ec 2003604: 93 2c a0 02 sll %l2, 2, %o1 if (table == NULL) { 2003608: ba 92 20 00 orcc %o0, 0, %i5 200360c: 02 80 00 0d be 2003640 2003610: 94 24 80 18 sub %l2, %i0, %o2 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 2003614: 91 2e 20 02 sll %i0, 2, %o0 2003618: 92 10 20 00 clr %o1 200361c: 90 07 40 08 add %i5, %o0, %o0 2003620: 40 00 44 0e call 2014658 2003624: 95 2a a0 02 sll %o2, 2, %o2 disktab [major].minor = table; 2003628: fa 24 00 00 st %i5, [ %l0 ] disktab [major].size = new_size; 200362c: e4 24 20 04 st %l2, [ %l0 + 4 ] } return disktab [major].minor + minor; 2003630: 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) { 2003634: a0 87 40 01 addcc %i5, %g1, %l0 2003638: 32 bf ff e6 bne,a 20035d0 <== ALWAYS TAKEN 200363c: c2 07 40 01 ld [ %i5 + %g1 ], %g1 alloc_name = strdup(name); if (alloc_name == NULL) { free(dd); return RTEMS_NO_MEMORY; 2003640: 81 c7 e0 08 ret 2003644: 91 e8 20 1a restore %g0, 0x1a, %o0 rtems_device_minor_number minor = 0; rtems_filesystem_split_dev_t(dev, major, minor); if (major >= disktab_size) { rtems_disk_device_table *table = disktab; 2003648: 27 00 80 83 sethi %hi(0x2020c00), %l3 rtems_device_major_number old_size = disktab_size; rtems_device_major_number new_size = 2 * old_size; 200364c: b1 2f 60 01 sll %i5, 1, %i0 if (major >= new_size) { 2003650: 80 a4 40 18 cmp %l1, %i0 2003654: 0a 80 00 03 bcs 2003660 <== NEVER TAKEN 2003658: d0 04 e3 5c ld [ %l3 + 0x35c ], %o0 new_size = major + 1; 200365c: b0 04 60 01 add %l1, 1, %i0 } table = realloc(table, new_size * sizeof(*table)); 2003660: 40 00 08 a3 call 20058ec 2003664: 93 2e 20 03 sll %i0, 3, %o1 if (table == NULL) { 2003668: a0 92 20 00 orcc %o0, 0, %l0 200366c: 02 bf ff f5 be 2003640 <== ALWAYS TAKEN 2003670: 94 26 00 1d sub %i0, %i5, %o2 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 2003674: 91 2f 60 03 sll %i5, 3, %o0 <== NOT EXECUTED 2003678: 92 10 20 00 clr %o1 <== NOT EXECUTED 200367c: 90 04 00 08 add %l0, %o0, %o0 <== NOT EXECUTED 2003680: 40 00 43 f6 call 2014658 <== NOT EXECUTED 2003684: 95 2a a0 03 sll %o2, 3, %o2 <== NOT EXECUTED disktab = table; 2003688: e0 24 e3 5c st %l0, [ %l3 + 0x35c ] <== NOT EXECUTED disktab_size = new_size; 200368c: 10 bf ff c3 b 2003598 <== NOT EXECUTED 2003690: f0 24 a3 58 st %i0, [ %l2 + 0x358 ] <== NOT EXECUTED rtems_device_minor_number new_size = 0; if (old_size == 0) { new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; 2003694: a5 2e 20 01 sll %i0, 1, %l2 } if (minor >= new_size) { 2003698: 80 a6 40 12 cmp %i1, %l2 200369c: 0a bf ff d9 bcs 2003600 <== ALWAYS TAKEN 20036a0: 90 10 00 1d mov %i5, %o0 20036a4: 10 bf ff d7 b 2003600 <== NOT EXECUTED 20036a8: a4 06 60 01 add %i1, 1, %l2 <== NOT EXECUTED if (*dd_entry != NULL) { return RTEMS_RESOURCE_IN_USE; } dd = malloc(sizeof(*dd)); 20036ac: 40 00 05 bc call 2004d9c 20036b0: 90 10 20 78 mov 0x78, %o0 if (dd == NULL) { 20036b4: ba 92 20 00 orcc %o0, 0, %i5 20036b8: 02 bf ff e2 be 2003640 <== NEVER TAKEN 20036bc: 80 a6 a0 00 cmp %i2, 0 return RTEMS_NO_MEMORY; } if (name != NULL) { 20036c0: 02 80 00 0f be 20036fc 20036c4: b0 10 20 00 clr %i0 alloc_name = strdup(name); 20036c8: 40 00 45 1b call 2014b34 20036cc: 90 10 00 1a mov %i2, %o0 if (alloc_name == NULL) { 20036d0: b0 92 20 00 orcc %o0, 0, %i0 20036d4: 02 80 00 16 be 200372c <== NEVER TAKEN 20036d8: b4 10 00 08 mov %o0, %i2 return RTEMS_NO_MEMORY; } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { 20036dc: 94 10 00 11 mov %l1, %o2 20036e0: 13 00 00 18 sethi %hi(0x6000), %o1 20036e4: 96 10 00 19 mov %i1, %o3 20036e8: 40 00 06 1c call 2004f58 20036ec: 92 12 61 ff or %o1, 0x1ff, %o1 20036f0: 80 a2 20 00 cmp %o0, 0 20036f4: 06 80 00 07 bl 2003710 <== NEVER TAKEN 20036f8: 01 00 00 00 nop free(dd); return RTEMS_UNSATISFIED; } } *dd_entry = dd; 20036fc: fa 24 00 00 st %i5, [ %l0 ] *dd_ptr = dd; 2003700: fa 26 c0 00 st %i5, [ %i3 ] *alloc_name_ptr = alloc_name; 2003704: f0 27 00 00 st %i0, [ %i4 ] return RTEMS_SUCCESSFUL; 2003708: 81 c7 e0 08 ret 200370c: 91 e8 20 00 restore %g0, 0, %o0 } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { free(alloc_name); 2003710: 40 00 04 5b call 200487c <== NOT EXECUTED 2003714: 90 10 00 1a mov %i2, %o0 <== NOT EXECUTED free(dd); 2003718: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 200371c: 40 00 04 58 call 200487c <== NOT EXECUTED 2003720: b0 10 20 0d mov 0xd, %i0 <== NOT EXECUTED return RTEMS_UNSATISFIED; 2003724: 81 c7 e0 08 ret <== NOT EXECUTED 2003728: 81 e8 00 00 restore <== NOT EXECUTED if (name != NULL) { alloc_name = strdup(name); if (alloc_name == NULL) { free(dd); 200372c: 40 00 04 54 call 200487c <== NOT EXECUTED 2003730: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2003734: 30 bf ff c3 b,a 2003640 <== NOT EXECUTED =============================================================================== 02004bd4 : * RTEMS_SUCCESSFUL, if success; * RTEMS_NO_MEMOTY, if cannot allocate memory for part_desc_t strucure; * RTEMS_INTERNAL_ERROR, if other error occurs. */ static rtems_status_code data_to_part_desc(uint8_t *data, rtems_part_desc_t **new_part_desc) 2004bd4: 9d e3 bf 98 save %sp, -104, %sp return RTEMS_INTERNAL_ERROR; } *new_part_desc = NULL; if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) 2004bd8: 90 10 20 01 mov 1, %o0 if (new_part_desc == NULL) { return RTEMS_INTERNAL_ERROR; } *new_part_desc = NULL; 2004bdc: c0 26 40 00 clr [ %i1 ] if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) 2004be0: 40 00 03 41 call 20058e4 2004be4: 92 10 20 28 mov 0x28, %o1 * RTEMS_SUCCESSFUL, if success; * RTEMS_NO_MEMOTY, if cannot allocate memory for part_desc_t strucure; * RTEMS_INTERNAL_ERROR, if other error occurs. */ static rtems_status_code data_to_part_desc(uint8_t *data, rtems_part_desc_t **new_part_desc) 2004be8: 82 10 00 18 mov %i0, %g1 return RTEMS_INTERNAL_ERROR; } *new_part_desc = NULL; if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) 2004bec: ba 10 00 08 mov %o0, %i5 2004bf0: 80 a2 20 00 cmp %o0, 0 2004bf4: 02 80 00 40 be 2004cf4 <== NEVER TAKEN 2004bf8: b0 10 20 1a mov 0x1a, %i0 part_desc->sys_type = *(data + RTEMS_IDE_PARTITION_SYS_TYPE_OFFSET); /* read the offset start position and partition size in sectors */ /* due to incorrect data alignment one have to align data first */ memcpy(&temp, data + RTEMS_IDE_PARTITION_START_OFFSET, sizeof(uint32_t)); 2004bfc: c6 08 60 0b ldub [ %g1 + 0xb ], %g3 2004c00: da 08 60 08 ldub [ %g1 + 8 ], %o5 2004c04: de 08 60 09 ldub [ %g1 + 9 ], %o7 2004c08: f0 08 60 0a ldub [ %g1 + 0xa ], %i0 part_desc->start = LE_TO_CPU_U32(temp); memcpy(&temp, data + RTEMS_IDE_PARTITION_SIZE_OFFSET, sizeof(uint32_t)); 2004c0c: f6 08 60 0d ldub [ %g1 + 0xd ], %i3 2004c10: f8 08 60 0e ldub [ %g1 + 0xe ], %i4 2004c14: c8 08 60 0f ldub [ %g1 + 0xf ], %g4 2004c18: f4 08 60 0c ldub [ %g1 + 0xc ], %i2 part_desc->sys_type = *(data + RTEMS_IDE_PARTITION_SYS_TYPE_OFFSET); /* read the offset start position and partition size in sectors */ /* due to incorrect data alignment one have to align data first */ memcpy(&temp, data + RTEMS_IDE_PARTITION_START_OFFSET, sizeof(uint32_t)); 2004c1c: c6 2f bf ff stb %g3, [ %fp + -1 ] 2004c20: da 2f bf fc stb %o5, [ %fp + -4 ] 2004c24: de 2f bf fd stb %o7, [ %fp + -3 ] 2004c28: f0 2f bf fe stb %i0, [ %fp + -2 ] part_desc->start = LE_TO_CPU_U32(temp); 2004c2c: c4 07 bf fc ld [ %fp + -4 ], %g2 { return RTEMS_NO_MEMORY; } part_desc->bootable = *(data + RTEMS_IDE_PARTITION_BOOTABLE_OFFSET); part_desc->sys_type = *(data + RTEMS_IDE_PARTITION_SYS_TYPE_OFFSET); 2004c30: d2 08 60 04 ldub [ %g1 + 4 ], %o1 if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) { return RTEMS_NO_MEMORY; } part_desc->bootable = *(data + RTEMS_IDE_PARTITION_BOOTABLE_OFFSET); 2004c34: c6 08 40 00 ldub [ %g1 ], %g3 /* due to incorrect data alignment one have to align data first */ memcpy(&temp, data + RTEMS_IDE_PARTITION_START_OFFSET, sizeof(uint32_t)); part_desc->start = LE_TO_CPU_U32(temp); memcpy(&temp, data + RTEMS_IDE_PARTITION_SIZE_OFFSET, sizeof(uint32_t)); 2004c38: f6 2f bf fd stb %i3, [ %fp + -3 ] 2004c3c: f8 2f bf fe stb %i4, [ %fp + -2 ] 2004c40: c8 2f bf ff stb %g4, [ %fp + -1 ] 2004c44: f4 2f bf fc stb %i2, [ %fp + -4 ] part_desc->size = LE_TO_CPU_U32(temp); 2004c48: c2 07 bf fc ld [ %fp + -4 ], %g1 byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c4c: b7 28 a0 18 sll %g2, 0x18, %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2004c50: 89 30 a0 18 srl %g2, 0x18, %g4 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2004c54: b9 30 a0 08 srl %g2, 8, %i4 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c58: 88 16 c0 04 or %i3, %g4, %g4 { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2004c5c: b8 0f 20 ff and %i4, 0xff, %i4 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c60: b9 2f 20 10 sll %i4, 0x10, %i4 2004c64: 88 11 00 1c or %g4, %i4, %g4 2004c68: b7 28 60 18 sll %g1, 0x18, %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2004c6c: b9 30 60 18 srl %g1, 0x18, %i4 byte3 = (value >> 16) & 0xff; 2004c70: 85 30 a0 10 srl %g2, 0x10, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c74: b8 16 c0 1c or %i3, %i4, %i4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004c78: 84 08 a0 ff and %g2, 0xff, %g2 if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) { return RTEMS_NO_MEMORY; } part_desc->bootable = *(data + RTEMS_IDE_PARTITION_BOOTABLE_OFFSET); 2004c7c: c6 2a 00 00 stb %g3, [ %o0 ] byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c80: 85 28 a0 08 sll %g2, 8, %g2 part_desc->sys_type = *(data + RTEMS_IDE_PARTITION_SYS_TYPE_OFFSET); 2004c84: d2 2a 20 01 stb %o1, [ %o0 + 1 ] 2004c88: 84 11 00 02 or %g4, %g2, %g2 { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2004c8c: 89 30 60 08 srl %g1, 8, %g4 /* read the offset start position and partition size in sectors */ /* due to incorrect data alignment one have to align data first */ memcpy(&temp, data + RTEMS_IDE_PARTITION_START_OFFSET, sizeof(uint32_t)); part_desc->start = LE_TO_CPU_U32(temp); 2004c90: c4 22 20 04 st %g2, [ %o0 + 4 ] 2004c94: 88 09 20 ff and %g4, 0xff, %g4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004c98: 83 30 60 10 srl %g1, 0x10, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004c9c: 89 29 20 10 sll %g4, 0x10, %g4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004ca0: 82 08 60 ff and %g1, 0xff, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004ca4: b8 17 00 04 or %i4, %g4, %i4 2004ca8: 83 28 60 08 sll %g1, 8, %g1 2004cac: b8 17 00 01 or %i4, %g1, %i4 * use partitions that are * - extended * or * - FAT type and non-zero */ if (is_extended(part_desc->sys_type) || 2004cb0: 82 0a 60 7f and %o1, 0x7f, %g1 2004cb4: 80 a0 60 05 cmp %g1, 5 2004cb8: 02 80 00 11 be 2004cfc 2004cbc: f8 22 20 08 st %i4, [ %o0 + 8 ] DOS_P32MB_PARTITION, FAT32_PARTITION ,FAT32_LBA_PARTITION, FAT16_LBA_PARTITION }; return (NULL != memchr(fat_part_types,type,sizeof(fat_part_types))); 2004cc0: 92 0a 60 ff and %o1, 0xff, %o1 2004cc4: 11 00 80 90 sethi %hi(0x2024000), %o0 2004cc8: 94 10 20 06 mov 6, %o2 2004ccc: 40 00 43 57 call 2015a28 2004cd0: 90 12 22 b8 or %o0, 0x2b8, %o0 * use partitions that are * - extended * or * - FAT type and non-zero */ if (is_extended(part_desc->sys_type) || 2004cd4: 80 a2 20 00 cmp %o0, 0 2004cd8: 02 80 00 04 be 2004ce8 2004cdc: 80 a7 20 00 cmp %i4, 0 ((is_fat_partition(part_desc->sys_type)) && (part_desc->size != 0))) { 2004ce0: 32 80 00 08 bne,a 2004d00 <== ALWAYS TAKEN 2004ce4: fa 26 40 00 st %i5, [ %i1 ] *new_part_desc = part_desc; } else { /* empty partition */ free(part_desc); 2004ce8: 90 10 00 1d mov %i5, %o0 2004cec: 40 00 03 cf call 2005c28 2004cf0: b0 10 20 00 clr %i0 } return RTEMS_SUCCESSFUL; } 2004cf4: 81 c7 e0 08 ret 2004cf8: 81 e8 00 00 restore * or * - FAT type and non-zero */ if (is_extended(part_desc->sys_type) || ((is_fat_partition(part_desc->sys_type)) && (part_desc->size != 0))) { *new_part_desc = part_desc; 2004cfc: fa 26 40 00 st %i5, [ %i1 ] } else { /* empty partition */ free(part_desc); } return RTEMS_SUCCESSFUL; 2004d00: 81 c7 e0 08 ret 2004d04: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02002af4 : #endif #include "devfs.h" void devFS_Show(void) { 2002af4: 9d e3 bf a0 save %sp, -96, %sp rtems_filesystem_location_info_t *rootloc = &rtems_filesystem_root->location; 2002af8: 03 00 80 65 sethi %hi(0x2019400), %g1 2002afc: c2 00 62 d4 ld [ %g1 + 0x2d4 ], %g1 ! 20196d4 if (rootloc->mt_entry->ops == &devFS_ops) { 2002b00: 05 00 80 5f sethi %hi(0x2017c00), %g2 2002b04: c2 00 60 04 ld [ %g1 + 4 ], %g1 2002b08: 84 10 a1 0c or %g2, 0x10c, %g2 2002b0c: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 2002b10: c6 00 60 0c ld [ %g1 + 0xc ], %g3 2002b14: 80 a0 c0 02 cmp %g3, %g2 2002b18: 22 80 00 04 be,a 2002b28 <== ALWAYS TAKEN 2002b1c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 2002b20: 81 c7 e0 08 ret <== NOT EXECUTED 2002b24: 81 e8 00 00 restore <== NOT EXECUTED const devFS_data *data = devFS_get_data(rootloc); size_t i = 0; size_t n = data->count; 2002b28: f0 00 60 04 ld [ %g1 + 4 ], %i0 devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { 2002b2c: 80 a6 20 00 cmp %i0, 0 2002b30: 02 bf ff fc be 2002b20 <== NEVER TAKEN 2002b34: f8 00 40 00 ld [ %g1 ], %i4 if (current->name != NULL) { size_t j = 0; size_t m = current->namelen; printk("/"); 2002b38: 23 00 80 5f sethi %hi(0x2017c00), %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002b3c: 35 00 80 5f sethi %hi(0x2017c00), %i2 } printk( 2002b40: 21 00 80 5f sethi %hi(0x2017c00), %l0 const devFS_data *data = devFS_get_data(rootloc); size_t i = 0; size_t n = data->count; devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { 2002b44: b2 10 20 00 clr %i1 if (current->name != NULL) { size_t j = 0; size_t m = current->namelen; printk("/"); 2002b48: a2 14 61 60 or %l1, 0x160, %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002b4c: b4 16 a1 78 or %i2, 0x178, %i2 } printk( 2002b50: a0 14 21 68 or %l0, 0x168, %l0 devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { devFS_node *current = nodes + i; if (current->name != NULL) { 2002b54: c2 07 00 00 ld [ %i4 ], %g1 2002b58: 80 a0 60 00 cmp %g1, 0 2002b5c: 22 80 00 15 be,a 2002bb0 2002b60: b2 06 60 01 inc %i1 size_t j = 0; size_t m = current->namelen; 2002b64: f6 07 20 04 ld [ %i4 + 4 ], %i3 printk("/"); 2002b68: 40 00 04 a6 call 2003e00 2002b6c: 90 10 00 11 mov %l1, %o0 for (j = 0; j < m; ++j) { 2002b70: 80 a6 e0 00 cmp %i3, 0 2002b74: 02 80 00 0a be 2002b9c <== NEVER TAKEN 2002b78: ba 10 20 00 clr %i5 printk("%c", current->name [j]); 2002b7c: c2 07 00 00 ld [ %i4 ], %g1 2002b80: 90 10 00 1a mov %i2, %o0 2002b84: d2 48 40 1d ldsb [ %g1 + %i5 ], %o1 2002b88: 40 00 04 9e call 2003e00 2002b8c: ba 07 60 01 inc %i5 if (current->name != NULL) { size_t j = 0; size_t m = current->namelen; printk("/"); for (j = 0; j < m; ++j) { 2002b90: 80 a7 40 1b cmp %i5, %i3 2002b94: 32 bf ff fb bne,a 2002b80 2002b98: c2 07 00 00 ld [ %i4 ], %g1 printk("%c", current->name [j]); } printk( 2002b9c: d2 07 20 08 ld [ %i4 + 8 ], %o1 2002ba0: d4 07 20 0c ld [ %i4 + 0xc ], %o2 2002ba4: 40 00 04 97 call 2003e00 2002ba8: 90 10 00 10 mov %l0, %o0 const devFS_data *data = devFS_get_data(rootloc); size_t i = 0; size_t n = data->count; devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { 2002bac: b2 06 60 01 inc %i1 2002bb0: 80 a6 40 18 cmp %i1, %i0 2002bb4: 12 bf ff e8 bne 2002b54 2002bb8: b8 07 20 14 add %i4, 0x14, %i4 2002bbc: 81 c7 e0 08 ret 2002bc0: 81 e8 00 00 restore =============================================================================== 0200c3a8 : } void devFS_eval_path( rtems_filesystem_eval_path_context_t *ctx ) { 200c3a8: 9d e3 bf a0 save %sp, -96, %sp static inline const devFS_data *devFS_get_data( const rtems_filesystem_location_info_t *loc ) { return (const devFS_data *) loc->mt_entry->immutable_fs_info; 200c3ac: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 static inline const char *rtems_filesystem_eval_path_get_path( rtems_filesystem_eval_path_context_t *ctx ) { return ctx->path; 200c3b0: e2 06 00 00 ld [ %i0 ], %l1 200c3b4: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 static inline size_t rtems_filesystem_eval_path_get_pathlen( rtems_filesystem_eval_path_context_t *ctx ) { return ctx->pathlen; 200c3b8: f2 06 20 04 ld [ %i0 + 4 ], %i1 size_t pathlen, devFS_node **free_node_ptr ) { size_t i = 0; size_t n = data->count; 200c3bc: e0 00 60 04 ld [ %g1 + 4 ], %l0 devFS_node *nodes = data->nodes; devFS_node *node = NULL; devFS_node *free_node = NULL; for (i = 0; (free_node == NULL || node == NULL) && i < n; ++i) { 200c3c0: 80 a4 20 00 cmp %l0, 0 200c3c4: 02 80 00 3d be 200c4b8 200c3c8: fa 00 40 00 ld [ %g1 ], %i5 ) { size_t i = 0; size_t n = data->count; devFS_node *nodes = data->nodes; devFS_node *node = NULL; 200c3cc: b4 10 20 00 clr %i2 devFS_node *free_node = NULL; 200c3d0: 82 10 20 00 clr %g1 for (i = 0; (free_node == NULL || node == NULL) && i < n; ++i) { 200c3d4: 10 80 00 09 b 200c3f8 200c3d8: b8 10 20 00 clr %i4 200c3dc: 80 a6 a0 00 cmp %i2, 0 200c3e0: 12 80 00 18 bne 200c440 200c3e4: b8 07 20 01 inc %i4 200c3e8: ba 07 60 14 add %i5, 0x14, %i5 200c3ec: 80 a7 00 10 cmp %i4, %l0 200c3f0: 02 80 00 1f be 200c46c 200c3f4: 82 10 00 1b mov %i3, %g1 devFS_node *current = nodes + i; if (current->name != NULL) { 200c3f8: d0 07 40 00 ld [ %i5 ], %o0 200c3fc: 80 a2 20 00 cmp %o0, 0 200c400: 02 bf ff f7 be 200c3dc 200c404: b6 10 00 1d mov %i5, %i3 if ( 200c408: c4 07 60 04 ld [ %i5 + 4 ], %g2 200c40c: 80 a6 40 02 cmp %i1, %g2 200c410: 12 bf ff f3 bne 200c3dc 200c414: b6 10 00 01 mov %g1, %i3 current->namelen == pathlen && memcmp(current->name, path, pathlen) == 0 200c418: 92 10 00 11 mov %l1, %o1 200c41c: 40 00 09 6f call 200e9d8 200c420: 94 10 00 19 mov %i1, %o2 200c424: 80 a2 20 00 cmp %o0, 0 200c428: 12 bf ff ee bne 200c3e0 200c42c: 80 a6 a0 00 cmp %i2, 0 200c430: b4 10 00 1d mov %i5, %i2 size_t n = data->count; devFS_node *nodes = data->nodes; devFS_node *node = NULL; devFS_node *free_node = NULL; for (i = 0; (free_node == NULL || node == NULL) && i < n; ++i) { 200c434: 80 a6 a0 00 cmp %i2, 0 200c438: 02 bf ff ec be 200c3e8 <== NEVER TAKEN 200c43c: b8 07 20 01 inc %i4 200c440: 80 a6 e0 00 cmp %i3, 0 200c444: 22 bf ff ea be,a 200c3ec 200c448: ba 07 60 14 add %i5, 0x14, %i5 static inline int rtems_filesystem_eval_path_get_flags( const rtems_filesystem_eval_path_context_t *ctx ) { return ctx->flags; 200c44c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 &free_node ); int eval_flags = rtems_filesystem_eval_path_get_flags(ctx); if (node != NULL) { if ((eval_flags & RTEMS_FS_EXCLUSIVE) == 0) { 200c450: 80 88 60 40 btst 0x40, %g1 200c454: 12 80 00 15 bne 200c4a8 200c458: 01 00 00 00 nop currentloc->node_access = node; 200c45c: f4 26 20 20 st %i2, [ %i0 + 0x20 ] static inline void rtems_filesystem_eval_path_clear_path( rtems_filesystem_eval_path_context_t *ctx ) { ctx->pathlen = 0; 200c460: c0 26 20 04 clr [ %i0 + 4 ] 200c464: 81 c7 e0 08 ret 200c468: 81 e8 00 00 restore rtems_filesystem_eval_path_get_pathlen(ctx), &free_node ); int eval_flags = rtems_filesystem_eval_path_get_flags(ctx); if (node != NULL) { 200c46c: 80 a6 a0 00 cmp %i2, 0 200c470: 12 bf ff f8 bne 200c450 200c474: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 rtems_filesystem_eval_path_clear_path(ctx); } else { rtems_filesystem_eval_path_error(ctx, EEXIST); } } else { if ((eval_flags & RTEMS_FS_MAKE) != 0) { 200c478: 80 88 60 20 btst 0x20, %g1 200c47c: 02 80 00 0d be 200c4b0 <== NEVER TAKEN 200c480: 80 a6 e0 00 cmp %i3, 0 if (free_node != NULL) { 200c484: 02 80 00 11 be 200c4c8 <== NEVER TAKEN 200c488: 82 10 21 ff mov 0x1ff, %g1 free_node->mode = S_IRWXU | S_IRWXG | S_IRWXO; 200c48c: c2 26 e0 10 st %g1, [ %i3 + 0x10 ] currentloc->node_access = free_node; 200c490: f6 26 20 20 st %i3, [ %i0 + 0x20 ] rtems_filesystem_eval_path_context_t *ctx, const char *token, size_t tokenlen ) { ctx->token = token; 200c494: e2 26 20 08 st %l1, [ %i0 + 8 ] ctx->tokenlen = tokenlen; 200c498: f2 26 20 0c st %i1, [ %i0 + 0xc ] static inline void rtems_filesystem_eval_path_clear_path( rtems_filesystem_eval_path_context_t *ctx ) { ctx->pathlen = 0; 200c49c: c0 26 20 04 clr [ %i0 + 4 ] 200c4a0: 81 c7 e0 08 ret 200c4a4: 81 e8 00 00 restore if (node != NULL) { if ((eval_flags & RTEMS_FS_EXCLUSIVE) == 0) { currentloc->node_access = node; rtems_filesystem_eval_path_clear_path(ctx); } else { rtems_filesystem_eval_path_error(ctx, EEXIST); 200c4a8: 7f ff e2 32 call 2004d70 200c4ac: 93 e8 20 11 restore %g0, 0x11, %o1 rtems_filesystem_eval_path_clear_path(ctx); } else { rtems_filesystem_eval_path_error(ctx, ENOSPC); } } else { rtems_filesystem_eval_path_error(ctx, ENOENT); 200c4b0: 7f ff e2 30 call 2004d70 <== NOT EXECUTED 200c4b4: 93 e8 20 02 restore %g0, 2, %o1 <== NOT EXECUTED rtems_filesystem_eval_path_clear_path(ctx); } else { rtems_filesystem_eval_path_error(ctx, EEXIST); } } else { if ((eval_flags & RTEMS_FS_MAKE) != 0) { 200c4b8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200c4bc: 80 88 60 20 btst 0x20, %g1 200c4c0: 02 bf ff fc be 200c4b0 <== NEVER TAKEN 200c4c4: 01 00 00 00 nop rtems_filesystem_eval_path_get_path(ctx), rtems_filesystem_eval_path_get_pathlen(ctx) ); rtems_filesystem_eval_path_clear_path(ctx); } else { rtems_filesystem_eval_path_error(ctx, ENOSPC); 200c4c8: 7f ff e2 2a call 2004d70 200c4cc: 93 e8 20 1c restore %g0, 0x1c, %o1 =============================================================================== 020036a8 : const char *name, size_t namelen, mode_t mode, dev_t dev ) { 20036a8: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; if (namelen != 3 || name [0] != 'd' || name [1] != 'e' || name [2] != 'v') { 20036ac: 80 a6 a0 03 cmp %i2, 3 20036b0: 22 80 00 18 be,a 2003710 20036b4: c2 4e 40 00 ldsb [ %i1 ], %g1 if (S_ISBLK(mode) || S_ISCHR(mode)) { 20036b8: 05 00 00 2c sethi %hi(0xb000), %g2 20036bc: 03 00 00 08 sethi %hi(0x2000), %g1 20036c0: 84 0e c0 02 and %i3, %g2, %g2 20036c4: 80 a0 80 01 cmp %g2, %g1 20036c8: 12 80 00 23 bne 2003754 20036cc: 01 00 00 00 nop char *dupname = malloc(namelen); 20036d0: 40 00 01 f6 call 2003ea8 20036d4: 90 10 00 1a mov %i2, %o0 if (dupname != NULL) { 20036d8: 84 92 20 00 orcc %o0, 0, %g2 20036dc: 02 80 00 24 be 200376c 20036e0: 92 10 00 19 mov %i1, %o1 devFS_node *node = parentloc->node_access; 20036e4: c2 06 20 08 ld [ %i0 + 8 ], %g1 node->name = dupname; 20036e8: c4 20 40 00 st %g2, [ %g1 ] node->namelen = namelen; 20036ec: f4 20 60 04 st %i2, [ %g1 + 4 ] node->major = rtems_filesystem_dev_major_t(dev); 20036f0: f8 20 60 08 st %i4, [ %g1 + 8 ] node->minor = rtems_filesystem_dev_minor_t(dev); 20036f4: fa 20 60 0c st %i5, [ %g1 + 0xc ] node->mode = mode; 20036f8: f6 20 60 10 st %i3, [ %g1 + 0x10 ] memcpy(dupname, name, namelen); 20036fc: 94 10 00 1a mov %i2, %o2 2003700: 40 00 2c e0 call 200ea80 2003704: b0 10 20 00 clr %i0 2003708: 81 c7 e0 08 ret 200370c: 81 e8 00 00 restore dev_t dev ) { int rv = 0; if (namelen != 3 || name [0] != 'd' || name [1] != 'e' || name [2] != 'v') { 2003710: 80 a0 60 64 cmp %g1, 0x64 2003714: 12 bf ff ea bne 20036bc <== NEVER TAKEN 2003718: 05 00 00 2c sethi %hi(0xb000), %g2 200371c: c2 4e 60 01 ldsb [ %i1 + 1 ], %g1 2003720: 80 a0 60 65 cmp %g1, 0x65 2003724: 12 bf ff e7 bne 20036c0 <== NEVER TAKEN 2003728: 03 00 00 08 sethi %hi(0x2000), %g1 200372c: c2 4e 60 02 ldsb [ %i1 + 2 ], %g1 2003730: 80 a0 60 76 cmp %g1, 0x76 2003734: 12 bf ff e3 bne 20036c0 <== NEVER TAKEN 2003738: 03 00 00 08 sethi %hi(0x2000), %g1 } else { errno = ENOTSUP; rv = -1; } } else { if (!S_ISDIR(mode)) { 200373c: 03 00 00 3c sethi %hi(0xf000), %g1 2003740: b6 0e c0 01 and %i3, %g1, %i3 2003744: 03 00 00 10 sethi %hi(0x4000), %g1 2003748: 80 a6 c0 01 cmp %i3, %g1 200374c: 02 bf ff ef be 2003708 <== ALWAYS TAKEN 2003750: b0 10 20 00 clr %i0 errno = ENOTSUP; 2003754: 40 00 2a 32 call 200e01c <__errno> 2003758: b0 10 3f ff mov -1, %i0 200375c: 82 10 20 86 mov 0x86, %g1 2003760: c2 22 00 00 st %g1, [ %o0 ] rv = -1; } } return rv; } 2003764: 81 c7 e0 08 ret 2003768: 81 e8 00 00 restore node->major = rtems_filesystem_dev_major_t(dev); node->minor = rtems_filesystem_dev_minor_t(dev); node->mode = mode; memcpy(dupname, name, namelen); } else { errno = ENOMEM; 200376c: 40 00 2a 2c call 200e01c <__errno> 2003770: b0 10 3f ff mov -1, %i0 2003774: 82 10 20 0c mov 0xc, %g1 2003778: c2 22 00 00 st %g1, [ %o0 ] 200377c: 81 c7 e0 08 ret 2003780: 81 e8 00 00 restore =============================================================================== 02003500 : */ static volatile bool diskdevs_protected; static rtems_status_code disk_lock(void) { 2003500: 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); 2003504: 03 00 80 83 sethi %hi(0x2020c00), %g1 2003508: d0 00 63 54 ld [ %g1 + 0x354 ], %o0 ! 2020f54 200350c: 92 10 20 00 clr %o1 2003510: 94 10 20 00 clr %o2 2003514: 40 00 16 8a call 2008f3c 2003518: b0 10 20 16 mov 0x16, %i0 if (sc == RTEMS_SUCCESSFUL) { 200351c: 80 a2 20 00 cmp %o0, 0 2003520: 12 80 00 05 bne 2003534 <== NEVER TAKEN 2003524: 84 10 20 01 mov 1, %g2 diskdevs_protected = true; 2003528: 03 00 80 83 sethi %hi(0x2020c00), %g1 return RTEMS_SUCCESSFUL; 200352c: 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; 2003530: c4 28 63 50 stb %g2, [ %g1 + 0x350 ] return RTEMS_SUCCESSFUL; } else { return RTEMS_NOT_CONFIGURED; } } 2003534: 81 c7 e0 08 ret 2003538: 81 e8 00 00 restore =============================================================================== 0200353c : static void disk_unlock(void) { 200353c: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; sc = rtems_semaphore_release(diskdevs_mutex); 2003540: 03 00 80 83 sethi %hi(0x2020c00), %g1 2003544: d0 00 63 54 ld [ %g1 + 0x354 ], %o0 ! 2020f54 static void disk_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; 2003548: 03 00 80 83 sethi %hi(0x2020c00), %g1 200354c: c0 28 63 50 clrb [ %g1 + 0x350 ] ! 2020f50 sc = rtems_semaphore_release(diskdevs_mutex); 2003550: 40 00 16 ca call 2009078 2003554: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) { 2003558: 80 a2 20 00 cmp %o0, 0 200355c: 12 80 00 04 bne 200356c <== NEVER TAKEN 2003560: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 2003564: 81 c7 e0 08 ret 2003568: 81 e8 00 00 restore /* FIXME: Error number */ rtems_fatal_error_occurred(0xdeadbeef); 200356c: 40 00 18 3e call 2009664 <== NOT EXECUTED 2003570: 90 12 22 ef or %o0, 0x2ef, %o0 <== NOT EXECUTED =============================================================================== 0200535c : /* * Drain output queue */ static void drainOutput (struct rtems_termios_tty *tty) 200535c: 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); 2005360: 7f ff f4 ab call 200260c 2005364: 01 00 00 00 nop while (tty->rawOutBuf.Tail != tty->rawOutBuf.Head) { 2005368: c4 06 20 84 ld [ %i0 + 0x84 ], %g2 200536c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2005370: 80 a0 80 01 cmp %g2, %g1 2005374: 02 80 00 14 be 20053c4 <== ALWAYS TAKEN 2005378: 01 00 00 00 nop tty->rawOutBufState = rob_wait; 200537c: b8 10 20 02 mov 2, %i4 ! 2 <== NOT EXECUTED 2005380: f8 26 20 94 st %i4, [ %i0 + 0x94 ] <== NOT EXECUTED rtems_interrupt_enable (level); 2005384: 7f ff f4 a6 call 200261c <== NOT EXECUTED 2005388: 01 00 00 00 nop <== NOT EXECUTED sc = rtems_semaphore_obtain( 200538c: d0 06 20 8c ld [ %i0 + 0x8c ], %o0 <== NOT EXECUTED 2005390: 92 10 20 00 clr %o1 <== NOT EXECUTED 2005394: 40 00 09 f3 call 2007b60 <== NOT EXECUTED 2005398: 94 10 20 00 clr %o2 <== NOT EXECUTED tty->rawOutBuf.Semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc != RTEMS_SUCCESSFUL) 200539c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20053a0: 12 80 00 0b bne 20053cc <== NOT EXECUTED 20053a4: 01 00 00 00 nop <== NOT EXECUTED rtems_fatal_error_occurred (sc); rtems_interrupt_disable (level); 20053a8: 7f ff f4 99 call 200260c <== NOT EXECUTED 20053ac: 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) { 20053b0: c4 06 20 84 ld [ %i0 + 0x84 ], %g2 <== NOT EXECUTED 20053b4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 20053b8: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 20053bc: 32 bf ff f2 bne,a 2005384 <== NOT EXECUTED 20053c0: f8 26 20 94 st %i4, [ %i0 + 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); 20053c4: 7f ff f4 96 call 200261c 20053c8: 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); 20053cc: 40 00 0b c8 call 20082ec <== NOT EXECUTED =============================================================================== 02003b90 : */ int dup2( int fildes, int fildes2 ) { 2003b90: 9d e3 bf 58 save %sp, -168, %sp /* * If fildes is not valid, then fildes2 should not be closed. */ status = fstat( fildes, &buf ); 2003b94: 90 10 00 18 mov %i0, %o0 2003b98: 40 00 01 ea call 2004340 2003b9c: 92 07 bf b8 add %fp, -72, %o1 if ( status == -1 ) 2003ba0: 80 a2 3f ff cmp %o0, -1 2003ba4: 02 80 00 0c be 2003bd4 2003ba8: 90 10 00 19 mov %i1, %o0 /* * If fildes2 is not valid, then we should not do anything either. */ status = fstat( fildes2, &buf ); 2003bac: 40 00 01 e5 call 2004340 2003bb0: 92 07 bf b8 add %fp, -72, %o1 if ( status == -1 ) 2003bb4: 80 a2 3f ff cmp %o0, -1 2003bb8: 02 80 00 07 be 2003bd4 <== NEVER TAKEN 2003bbc: 90 10 00 18 mov %i0, %o0 /* * This fcntl handles everything else. */ return fcntl( fildes, F_DUPFD, fildes2 ); 2003bc0: 92 10 20 00 clr %o1 2003bc4: 40 00 00 af call 2003e80 2003bc8: 94 10 00 19 mov %i1, %o2 } 2003bcc: 81 c7 e0 08 ret 2003bd0: 91 e8 00 08 restore %g0, %o0, %o0 * If fildes is not valid, then fildes2 should not be closed. */ status = fstat( fildes, &buf ); if ( status == -1 ) return -1; 2003bd4: 81 c7 e0 08 ret 2003bd8: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 02006180 : /* * Echo a typed character */ static void echo (unsigned char c, struct rtems_termios_tty *tty) { 2006180: 9d e3 bf 98 save %sp, -104, %sp if ((tty->termios.c_lflag & ECHOCTL) && 2006184: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 2006188: 80 88 62 00 btst 0x200, %g1 200618c: 02 80 00 0d be 20061c0 <== NEVER TAKEN 2006190: 03 00 80 70 sethi %hi(0x201c000), %g1 iscntrl(c) && (c != '\t') && (c != '\n')) { 2006194: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 ! 201c340 <__ctype_ptr__> 2006198: 82 00 40 18 add %g1, %i0, %g1 200619c: c2 08 60 01 ldub [ %g1 + 1 ], %g1 * Echo a typed character */ static void echo (unsigned char c, struct rtems_termios_tty *tty) { if ((tty->termios.c_lflag & ECHOCTL) && 20061a0: 80 88 60 20 btst 0x20, %g1 20061a4: 02 80 00 08 be 20061c4 20061a8: 90 10 00 18 mov %i0, %o0 iscntrl(c) && (c != '\t') && (c != '\n')) { 20061ac: 82 06 3f f7 add %i0, -9, %g1 20061b0: 82 08 60 ff and %g1, 0xff, %g1 20061b4: 80 a0 60 01 cmp %g1, 1 20061b8: 18 80 00 07 bgu 20061d4 20061bc: 82 10 20 5e mov 0x5e, %g1 echobuf[0] = '^'; echobuf[1] = c ^ 0x40; rtems_termios_puts (echobuf, 2, tty); tty->column += 2; } else { oproc (c, tty); 20061c0: 90 10 00 18 mov %i0, %o0 20061c4: 7f ff ff 8f call 2006000 20061c8: 92 10 00 19 mov %i1, %o1 20061cc: 81 c7 e0 08 ret 20061d0: 81 e8 00 00 restore if ((tty->termios.c_lflag & ECHOCTL) && iscntrl(c) && (c != '\t') && (c != '\n')) { char echobuf[2]; echobuf[0] = '^'; echobuf[1] = c ^ 0x40; 20061d4: 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] = '^'; 20061d8: c2 2f bf f8 stb %g1, [ %fp + -8 ] echobuf[1] = c ^ 0x40; 20061dc: f0 2f bf f9 stb %i0, [ %fp + -7 ] rtems_termios_puts (echobuf, 2, tty); 20061e0: 90 07 bf f8 add %fp, -8, %o0 20061e4: 92 10 20 02 mov 2, %o1 20061e8: 7f ff ff 36 call 2005ec0 20061ec: 94 10 00 19 mov %i1, %o2 tty->column += 2; 20061f0: c2 06 60 28 ld [ %i1 + 0x28 ], %g1 20061f4: 82 00 60 02 add %g1, 2, %g1 20061f8: c2 26 60 28 st %g1, [ %i1 + 0x28 ] 20061fc: 81 c7 e0 08 ret 2006200: 81 e8 00 00 restore =============================================================================== 020278c4 : } void endgrent(void) { if (group_fp != NULL) 20278c4: 03 00 81 95 sethi %hi(0x2065400), %g1 20278c8: d0 00 62 80 ld [ %g1 + 0x280 ], %o0 ! 2065680 20278cc: 80 a2 20 00 cmp %o0, 0 20278d0: 02 80 00 05 be 20278e4 <== NEVER TAKEN 20278d4: 01 00 00 00 nop fclose(group_fp); 20278d8: 82 13 c0 00 mov %o7, %g1 20278dc: 40 00 4e 20 call 203b15c 20278e0: 9e 10 40 00 mov %g1, %o7 20278e4: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02027728 : } void endpwent(void) { if (passwd_fp != NULL) 2027728: 03 00 81 95 sethi %hi(0x2065400), %g1 202772c: d0 00 61 a0 ld [ %g1 + 0x1a0 ], %o0 ! 20655a0 2027730: 80 a2 20 00 cmp %o0, 0 2027734: 02 80 00 05 be 2027748 <== NEVER TAKEN 2027738: 01 00 00 00 nop fclose(passwd_fp); 202773c: 82 13 c0 00 mov %o7, %g1 2027740: 40 00 4e 87 call 203b15c 2027744: 9e 10 40 00 mov %g1, %o7 2027748: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02006204 : * Erase a character or line * 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) 2006204: 9d e3 bf a0 save %sp, -96, %sp /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2006208: 37 00 80 6b sethi %hi(0x201ac00), %i3 * Erase a character or line * 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) 200620c: ba 10 00 18 mov %i0, %i5 rtems_termios_puts ("\b", 1, tty); tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 2006210: 35 00 80 70 sethi %hi(0x201c000), %i2 rtems_termios_puts ("\b \b", 3, tty); 2006214: 31 00 80 6b sethi %hi(0x201ac00), %i0 /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2006218: b6 16 e0 a0 or %i3, 0xa0, %i3 tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 200621c: 10 80 00 0f b 2006258 2006220: b0 16 20 a8 or %i0, 0xa8, %i0 if (tty->column) tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2006224: 90 12 20 a8 or %o0, 0xa8, %o0 2006228: 92 10 20 03 mov 3, %o1 200622c: 7f ff ff 25 call 2005ec0 2006230: 94 10 00 1d mov %i5, %o2 if (tty->column) 2006234: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2006238: 80 a0 60 00 cmp %g1, 0 200623c: 02 80 00 05 be 2006250 <== NEVER TAKEN 2006240: 80 a6 60 00 cmp %i1, 0 tty->column--; 2006244: 82 00 7f ff add %g1, -1, %g1 2006248: c2 27 60 28 st %g1, [ %i5 + 0x28 ] } } } if (!lineFlag) 200624c: 80 a6 60 00 cmp %i1, 0 2006250: 02 80 00 58 be 20063b0 2006254: 01 00 00 00 nop echo ('\n', tty); return; } } while (tty->ccount) { 2006258: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 200625c: 80 a0 a0 00 cmp %g2, 0 2006260: 02 80 00 54 be 20063b0 2006264: 84 00 bf ff add %g2, -1, %g2 unsigned char c = tty->cbuf[--tty->ccount]; 2006268: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 if (tty->termios.c_lflag & ECHO) { 200626c: c6 07 60 3c ld [ %i5 + 0x3c ], %g3 return; } } while (tty->ccount) { unsigned char c = tty->cbuf[--tty->ccount]; 2006270: c4 27 60 20 st %g2, [ %i5 + 0x20 ] if (tty->termios.c_lflag & ECHO) { 2006274: 80 88 e0 08 btst 8, %g3 2006278: 02 bf ff f5 be 200624c <== NEVER TAKEN 200627c: c2 09 00 02 ldub [ %g4 + %g2 ], %g1 if (!lineFlag && !(tty->termios.c_lflag & ECHOE)) { 2006280: 80 a6 60 00 cmp %i1, 0 2006284: 12 80 00 05 bne 2006298 2006288: 82 08 60 ff and %g1, 0xff, %g1 200628c: 80 88 e0 10 btst 0x10, %g3 2006290: 22 80 00 4d be,a 20063c4 <== NEVER TAKEN 2006294: f0 0f 60 43 ldub [ %i5 + 0x43 ], %i0 <== NOT EXECUTED echo (tty->termios.c_cc[VERASE], tty); } else if (c == '\t') { 2006298: 80 a0 60 09 cmp %g1, 9 200629c: 02 80 00 1e be 2006314 20062a0: 80 a0 a0 00 cmp %g2, 0 rtems_termios_puts ("\b", 1, tty); tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 20062a4: c4 06 a3 40 ld [ %i2 + 0x340 ], %g2 20062a8: b8 00 60 01 add %g1, 1, %i4 20062ac: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 20062b0: 80 88 60 20 btst 0x20, %g1 20062b4: 02 bf ff dc be 2006224 <== ALWAYS TAKEN 20062b8: 11 00 80 6b sethi %hi(0x201ac00), %o0 20062bc: 80 88 e2 00 btst 0x200, %g3 <== NOT EXECUTED 20062c0: 02 bf ff e4 be 2006250 <== NOT EXECUTED 20062c4: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED rtems_termios_puts ("\b \b", 3, tty); 20062c8: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20062cc: 92 10 20 03 mov 3, %o1 <== NOT EXECUTED 20062d0: 7f ff fe fc call 2005ec0 <== NOT EXECUTED 20062d4: 94 10 00 1d mov %i5, %o2 <== NOT EXECUTED if (tty->column) 20062d8: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED 20062dc: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20062e0: 12 80 00 3b bne 20063cc <== NOT EXECUTED 20062e4: 11 00 80 6b sethi %hi(0x201ac00), %o0 <== NOT EXECUTED tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { 20062e8: c2 06 a3 40 ld [ %i2 + 0x340 ], %g1 <== NOT EXECUTED 20062ec: c2 08 40 1c ldub [ %g1 + %i4 ], %g1 <== NOT EXECUTED 20062f0: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 20062f4: 22 bf ff cd be,a 2006228 <== NOT EXECUTED 20062f8: 90 12 20 a8 or %o0, 0xa8, %o0 <== NOT EXECUTED 20062fc: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 <== NOT EXECUTED 2006300: 80 88 62 00 btst 0x200, %g1 <== NOT EXECUTED 2006304: 32 bf ff c9 bne,a 2006228 <== NOT EXECUTED 2006308: 90 12 20 a8 or %o0, 0xa8, %o0 <== NOT EXECUTED if (tty->column) tty->column--; } } } if (!lineFlag) 200630c: 10 bf ff d1 b 2006250 <== NOT EXECUTED 2006310: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006314: 02 80 00 17 be 2006370 2006318: f8 07 60 2c ld [ %i5 + 0x2c ], %i4 c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; } else if (iscntrl (c)) { 200631c: da 06 a3 40 ld [ %i2 + 0x340 ], %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; 2006320: 82 10 20 00 clr %g1 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) 2006324: 10 80 00 07 b 2006340 2006328: 98 08 e2 00 and %g3, 0x200, %o4 200632c: 32 80 00 02 bne,a 2006334 <== NOT EXECUTED 2006330: b8 07 20 02 add %i4, 2, %i4 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006334: 80 a0 80 01 cmp %g2, %g1 2006338: 22 80 00 0f be,a 2006374 <== NEVER TAKEN 200633c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED c = tty->cbuf[i++]; 2006340: c6 09 00 01 ldub [ %g4 + %g1 ], %g3 2006344: 82 00 60 01 inc %g1 if (c == '\t') { 2006348: 80 a0 e0 09 cmp %g3, 9 200634c: 02 80 00 1b be 20063b8 2006350: 9e 03 40 03 add %o5, %g3, %o7 col = (col | 7) + 1; } else if (iscntrl (c)) { 2006354: de 0b e0 01 ldub [ %o7 + 1 ], %o7 2006358: 80 8b e0 20 btst 0x20, %o7 200635c: 12 bf ff f4 bne 200632c <== NEVER TAKEN 2006360: 80 a3 20 00 cmp %o4, 0 int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006364: 80 a0 80 01 cmp %g2, %g1 2006368: 12 bf ff f6 bne 2006340 200636c: b8 07 20 01 inc %i4 } /* * Back up over the tab */ while (tty->column > col) { 2006370: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2006374: 80 a0 40 1c cmp %g1, %i4 2006378: 04 bf ff b6 ble 2006250 <== NEVER TAKEN 200637c: 80 a6 60 00 cmp %i1, 0 rtems_termios_puts ("\b", 1, tty); 2006380: 90 10 00 1b mov %i3, %o0 2006384: 92 10 20 01 mov 1, %o1 2006388: 7f ff fe ce call 2005ec0 200638c: 94 10 00 1d mov %i5, %o2 tty->column--; 2006390: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2006394: 82 00 7f ff add %g1, -1, %g1 } /* * Back up over the tab */ while (tty->column > col) { 2006398: 80 a0 40 1c cmp %g1, %i4 200639c: 14 bf ff f9 bg 2006380 20063a0: c2 27 60 28 st %g1, [ %i5 + 0x28 ] if (tty->column) tty->column--; } } } if (!lineFlag) 20063a4: 80 a6 60 00 cmp %i1, 0 20063a8: 32 bf ff ad bne,a 200625c <== ALWAYS TAKEN 20063ac: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 20063b0: 81 c7 e0 08 ret 20063b4: 81 e8 00 00 restore * Find the character before the tab */ while (i != tty->ccount) { c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; 20063b8: b8 17 20 07 or %i4, 7, %i4 20063bc: 10 bf ff de b 2006334 20063c0: 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); 20063c4: 7f ff ff 6f call 2006180 <== NOT EXECUTED 20063c8: 93 e8 00 1d restore %g0, %i5, %o1 <== NOT EXECUTED } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); if (tty->column) tty->column--; 20063cc: 82 00 7f ff add %g1, -1, %g1 <== NOT EXECUTED 20063d0: 10 bf ff c6 b 20062e8 <== NOT EXECUTED 20063d4: c2 27 60 28 st %g1, [ %i5 + 0x28 ] <== NOT EXECUTED =============================================================================== 02004890 : size_t pathlen, int eval_flags, rtems_filesystem_global_location_t *const *global_root_ptr, rtems_filesystem_global_location_t *const *global_current_ptr ) { 2004890: 9d e3 bf 98 save %sp, -104, %sp memset(ctx, 0, sizeof(*ctx)); 2004894: 92 10 20 00 clr %o1 2004898: 90 10 00 18 mov %i0, %o0 200489c: 40 00 2d b1 call 200ff60 20048a0: 94 10 20 38 mov 0x38, %o2 ctx->path = path; 20048a4: f2 26 00 00 st %i1, [ %i0 ] ctx->pathlen = pathlen; 20048a8: f4 26 20 04 st %i2, [ %i0 + 4 ] rtems_filesystem_eval_path_context_t *ctx, rtems_filesystem_global_location_t *const *global_root_ptr, rtems_filesystem_global_location_t *const *global_current_ptr ) { if (ctx->pathlen > 0) { 20048ac: 80 a6 a0 00 cmp %i2, 0 20048b0: 02 80 00 21 be 2004934 20048b4: f6 26 20 10 st %i3, [ %i0 + 0x10 ] char c = ctx->path [0]; 20048b8: f6 0e 40 00 ldub [ %i1 ], %i3 ctx->rootloc = rtems_filesystem_global_location_obtain(global_root_ptr); 20048bc: 40 00 01 a3 call 2004f48 20048c0: 90 10 00 1c mov %i4, %o0 gid_t node_gid ); static inline bool rtems_filesystem_is_delimiter(char c) { return c == '/' || c == '\\'; 20048c4: 83 2e e0 18 sll %i3, 0x18, %g1 20048c8: 83 38 60 18 sra %g1, 0x18, %g1 if (rtems_filesystem_is_delimiter(c)) { 20048cc: 80 a0 60 5c cmp %g1, 0x5c 20048d0: 12 80 00 32 bne 2004998 <== ALWAYS TAKEN 20048d4: d0 26 20 30 st %o0, [ %i0 + 0x30 ] ++ctx->path; 20048d8: c4 06 00 00 ld [ %i0 ], %g2 <== NOT EXECUTED --ctx->pathlen; 20048dc: c2 06 20 04 ld [ %i0 + 4 ], %g1 char c = ctx->path [0]; ctx->rootloc = rtems_filesystem_global_location_obtain(global_root_ptr); if (rtems_filesystem_is_delimiter(c)) { ++ctx->path; 20048e0: 84 00 a0 01 inc %g2 --ctx->pathlen; 20048e4: 82 00 7f ff add %g1, -1, %g1 char c = ctx->path [0]; ctx->rootloc = rtems_filesystem_global_location_obtain(global_root_ptr); if (rtems_filesystem_is_delimiter(c)) { ++ctx->path; 20048e8: c4 26 00 00 st %g2, [ %i0 ] --ctx->pathlen; 20048ec: c2 26 20 04 st %g1, [ %i0 + 4 ] ctx->startloc = rtems_filesystem_global_location_obtain( 20048f0: 40 00 01 96 call 2004f48 20048f4: 90 06 20 30 add %i0, 0x30, %o0 20048f8: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 20048fc: 82 10 00 08 mov %o0, %g1 static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2004900: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 2004904: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2004908: c2 00 40 00 ld [ %g1 ], %g1 200490c: 9f c0 40 00 call %g1 2004910: ba 06 20 18 add %i0, 0x18, %i5 set_startloc(ctx, global_root_ptr, global_current_ptr); rtems_filesystem_instance_lock(&ctx->startloc->location); rtems_filesystem_location_clone( 2004914: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 2004918: 40 00 1f 2c call 200c5c8 200491c: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 2004920: 90 10 00 18 mov %i0, %o0 2004924: 7f ff ff be call 200481c 2004928: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 200492c: 81 c7 e0 08 ret 2004930: 81 e8 00 00 restore ); static inline rtems_filesystem_global_location_t * rtems_filesystem_global_location_obtain_null(void) { rtems_filesystem_global_location_t *global_loc = NULL; 2004934: c0 27 bf fc clr [ %fp + -4 ] return rtems_filesystem_global_location_obtain( &global_loc ); 2004938: 40 00 01 84 call 2004f48 200493c: 90 07 bf fc add %fp, -4, %o0 ); static inline rtems_filesystem_global_location_t * rtems_filesystem_global_location_obtain_null(void) { rtems_filesystem_global_location_t *global_loc = NULL; 2004940: c0 27 bf fc clr [ %fp + -4 ] ctx->startloc = rtems_filesystem_global_location_obtain( global_current_ptr ); } } else { ctx->rootloc = rtems_filesystem_global_location_obtain_null(); 2004944: d0 26 20 30 st %o0, [ %i0 + 0x30 ] return rtems_filesystem_global_location_obtain( &global_loc ); 2004948: 40 00 01 80 call 2004f48 200494c: 90 07 bf fc add %fp, -4, %o0 ctx->startloc = rtems_filesystem_global_location_obtain_null(); errno = ENOENT; 2004950: 40 00 2a f6 call 200f528 <__errno> 2004954: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 2004958: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 200495c: 84 10 20 02 mov 2, %g2 2004960: c4 22 00 00 st %g2, [ %o0 ] static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2004964: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 2004968: c2 02 20 0c ld [ %o0 + 0xc ], %g1 200496c: c2 00 40 00 ld [ %g1 ], %g1 2004970: 9f c0 40 00 call %g1 2004974: ba 06 20 18 add %i0, 0x18, %i5 set_startloc(ctx, global_root_ptr, global_current_ptr); rtems_filesystem_instance_lock(&ctx->startloc->location); rtems_filesystem_location_clone( 2004978: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 200497c: 40 00 1f 13 call 200c5c8 2004980: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 2004984: 90 10 00 18 mov %i0, %o0 2004988: 7f ff ff a5 call 200481c 200498c: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 2004990: 81 c7 e0 08 ret 2004994: 81 e8 00 00 restore if (ctx->pathlen > 0) { char c = ctx->path [0]; ctx->rootloc = rtems_filesystem_global_location_obtain(global_root_ptr); if (rtems_filesystem_is_delimiter(c)) { 2004998: 80 a0 60 2f cmp %g1, 0x2f 200499c: 22 bf ff d0 be,a 20048dc 20049a0: c4 06 00 00 ld [ %i0 ], %g2 --ctx->pathlen; ctx->startloc = rtems_filesystem_global_location_obtain( &ctx->rootloc ); } else { ctx->startloc = rtems_filesystem_global_location_obtain( 20049a4: 40 00 01 69 call 2004f48 20049a8: 90 10 00 1d mov %i5, %o0 20049ac: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 20049b0: 82 10 00 08 mov %o0, %g1 static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 20049b4: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 20049b8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20049bc: c2 00 40 00 ld [ %g1 ], %g1 20049c0: 9f c0 40 00 call %g1 20049c4: ba 06 20 18 add %i0, 0x18, %i5 set_startloc(ctx, global_root_ptr, global_current_ptr); rtems_filesystem_instance_lock(&ctx->startloc->location); rtems_filesystem_location_clone( 20049c8: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 20049cc: 40 00 1e ff call 200c5c8 20049d0: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 20049d4: 90 10 00 18 mov %i0, %o0 20049d8: 7f ff ff 91 call 200481c 20049dc: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 20049e0: 81 c7 e0 08 ret 20049e4: 81 e8 00 00 restore =============================================================================== 02013ed4 : int fat_buf_access(fat_fs_info_t *fs_info, const uint32_t sec_num, const int op_type, uint8_t **sec_buf) { 2013ed4: 9d e3 bf a0 save %sp, -96, %sp static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013ed8: c2 0e 20 02 ldub [ %i0 + 2 ], %g1 2013edc: c4 0e 20 0c ldub [ %i0 + 0xc ], %g2 sec_num); uint32_t blk_ofs = fat_sector_offset_to_block_offset (fs_info, sec_num, 0); if (fs_info->c.state == FAT_CACHE_EMPTY || fs_info->c.blk_num != sec_num) 2013ee0: c6 0e 20 89 ldub [ %i0 + 0x89 ], %g3 2013ee4: 84 20 80 01 sub %g2, %g1, %g2 2013ee8: 80 a0 e0 00 cmp %g3, 0 2013eec: bb 36 40 02 srl %i1, %g2, %i5 static inline uint32_t fat_block_num_to_sector_num (const fat_fs_info_t *fs_info, const uint32_t block_number) { return block_number << (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013ef0: 85 2f 40 02 sll %i5, %g2, %g2 fat_sector_offset_to_block_offset (const fat_fs_info_t *fs_info, const uint32_t sector, const uint32_t sector_offset) { return sector_offset + ((sector - 2013ef4: 84 26 40 02 sub %i1, %g2, %g2 2013ef8: 02 80 00 06 be 2013f10 2013efc: b9 28 80 01 sll %g2, %g1, %i4 2013f00: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2013f04: 80 a0 40 19 cmp %g1, %i1 2013f08: 22 80 00 12 be,a 2013f50 2013f0c: c2 06 20 8c ld [ %i0 + 0x8c ], %g1 { fat_buf_release(fs_info); 2013f10: 7f ff ff 7a call 2013cf8 2013f14: 90 10 00 18 mov %i0, %o0 if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2013f18: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2013f1c: 92 10 00 1d mov %i5, %o1 if (fs_info->c.state == FAT_CACHE_EMPTY || fs_info->c.blk_num != sec_num) { fat_buf_release(fs_info); if (op_type == FAT_OP_TYPE_READ) 2013f20: 80 a6 a0 01 cmp %i2, 1 2013f24: 02 80 00 10 be 2013f64 2013f28: 94 06 20 8c add %i0, 0x8c, %o2 sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); 2013f2c: 7f ff f6 c9 call 2011a50 2013f30: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 2013f34: 80 a2 20 00 cmp %o0, 0 2013f38: 12 80 00 0f bne 2013f74 <== NEVER TAKEN 2013f3c: 82 10 20 01 mov 1, %g1 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = sec_num; 2013f40: f2 26 20 84 st %i1, [ %i0 + 0x84 ] fs_info->c.modified = 0; 2013f44: c0 2e 20 88 clrb [ %i0 + 0x88 ] fs_info->c.state = FAT_CACHE_ACTUAL; 2013f48: c2 2e 20 89 stb %g1, [ %i0 + 0x89 ] } *sec_buf = &fs_info->c.buf->buffer[blk_ofs]; 2013f4c: c2 06 20 8c ld [ %i0 + 0x8c ], %g1 2013f50: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 2013f54: b8 00 40 1c add %g1, %i4, %i4 2013f58: f8 26 c0 00 st %i4, [ %i3 ] return RC_OK; } 2013f5c: 81 c7 e0 08 ret 2013f60: 91 e8 20 00 restore %g0, 0, %o0 if (fs_info->c.state == FAT_CACHE_EMPTY || fs_info->c.blk_num != sec_num) { fat_buf_release(fs_info); if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2013f64: 7f ff f6 fb call 2011b50 2013f68: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 2013f6c: 10 bf ff f3 b 2013f38 2013f70: 80 a2 20 00 cmp %o0, 0 rtems_set_errno_and_return_minus_one(EIO); 2013f74: 40 00 20 aa call 201c21c <__errno> <== NOT EXECUTED 2013f78: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013f7c: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013f80: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013f84: 81 c7 e0 08 ret <== NOT EXECUTED 2013f88: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013cf8 : return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013cf8: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013cfc: c2 0e 20 89 ldub [ %i0 + 0x89 ], %g1 return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013d00: ba 10 00 18 mov %i0, %i5 rtems_status_code sc = RTEMS_SUCCESSFUL; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013d04: 80 a0 60 00 cmp %g1, 0 2013d08: 02 80 00 6b be 2013eb4 2013d0c: b0 10 20 00 clr %i0 return RC_OK; if (fs_info->c.modified) 2013d10: c2 0f 60 88 ldub [ %i5 + 0x88 ], %g1 2013d14: 80 a0 60 00 cmp %g1, 0 2013d18: 02 80 00 47 be 2013e34 2013d1c: 01 00 00 00 nop { uint32_t sec_num = fs_info->c.blk_num; 2013d20: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 bool sec_of_fat = ((sec_num >= fs_info->vol.fat_loc) && 2013d24: c4 17 60 18 lduh [ %i5 + 0x18 ], %g2 2013d28: 80 a0 40 02 cmp %g1, %g2 2013d2c: 0a 80 00 06 bcs 2013d44 2013d30: b8 10 20 00 clr %i4 2013d34: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 2013d38: 80 a0 40 02 cmp %g1, %g2 2013d3c: 2a 80 00 46 bcs,a 2013e54 2013d40: c4 0f 60 54 ldub [ %i5 + 0x54 ], %g2 if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, fs_info->c.buf->buffer + blk_ofs, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 2013d44: 7f ff f8 40 call 2011e44 2013d48: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 if (sc != RTEMS_SUCCESSFUL) 2013d4c: 80 a2 20 00 cmp %o0, 0 2013d50: 12 80 00 5b bne 2013ebc <== NEVER TAKEN 2013d54: 80 8f 20 ff btst 0xff, %i4 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.modified = 0; if (sec_of_fat && !fs_info->vol.mirror) 2013d58: 02 80 00 3c be 2013e48 2013d5c: c0 2f 60 88 clrb [ %i5 + 0x88 ] 2013d60: c2 0f 60 54 ldub [ %i5 + 0x54 ], %g1 2013d64: 80 a0 60 00 cmp %g1, 0 2013d68: 32 80 00 39 bne,a 2013e4c <== NEVER TAKEN 2013d6c: c0 2f 60 89 clrb [ %i5 + 0x89 ] <== NOT EXECUTED { uint8_t i; for (i = 1; i < fs_info->vol.fats; i++) 2013d70: c2 0f 60 0d ldub [ %i5 + 0xd ], %g1 2013d74: 80 a0 60 01 cmp %g1, 1 2013d78: 08 80 00 34 bleu 2013e48 <== NEVER TAKEN 2013d7c: b6 10 20 01 mov 1, %i3 2013d80: 10 80 00 16 b 2013dd8 2013d84: 90 10 20 01 mov 1, %o0 { sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &bd); } else { sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &bd); 2013d88: 7f ff f7 72 call 2011b50 2013d8c: 94 07 bf fc add %fp, -4, %o2 } if ( sc != RTEMS_SUCCESSFUL) 2013d90: 80 a2 20 00 cmp %o0, 0 2013d94: 12 80 00 44 bne 2013ea4 <== NEVER TAKEN 2013d98: c2 07 bf fc ld [ %fp + -4 ], %g1 rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(bd->buffer + blk_ofs, fs_info->sec_buf, fs_info->vol.bps); 2013d9c: d2 07 60 90 ld [ %i5 + 0x90 ], %o1 2013da0: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 2013da4: d4 17 40 00 lduh [ %i5 ], %o2 2013da8: 40 00 23 dc call 201cd18 2013dac: 90 02 00 1c add %o0, %i4, %o0 sc = rtems_bdbuf_release_modified(bd); 2013db0: d0 07 bf fc ld [ %fp + -4 ], %o0 2013db4: 7f ff f8 24 call 2011e44 2013db8: b6 06 e0 01 inc %i3 if ( sc != RTEMS_SUCCESSFUL) 2013dbc: 80 a2 20 00 cmp %o0, 0 2013dc0: 12 80 00 39 bne 2013ea4 <== NEVER TAKEN 2013dc4: 90 0e e0 ff and %i3, 0xff, %o0 if (sec_of_fat && !fs_info->vol.mirror) { uint8_t i; for (i = 1; i < fs_info->vol.fats; i++) 2013dc8: c2 0f 60 0d ldub [ %i5 + 0xd ], %g1 2013dcc: 80 a2 00 01 cmp %o0, %g1 2013dd0: 3a 80 00 1f bcc,a 2013e4c <== ALWAYS TAKEN 2013dd4: c0 2f 60 89 clrb [ %i5 + 0x89 ] { rtems_bdbuf_buffer *bd; sec_num = fs_info->c.blk_num + fs_info->vol.fat_length * i, 2013dd8: 7f ff b9 ed call 200258c <.umul> 2013ddc: d2 07 60 1c ld [ %i5 + 0x1c ], %o1 static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013de0: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 2013de4: c6 07 60 84 ld [ %i5 + 0x84 ], %g3 2013de8: c4 0f 60 0c ldub [ %i5 + 0xc ], %g2 2013dec: 90 02 00 03 add %o0, %g3, %o0 2013df0: 84 20 80 01 sub %g2, %g1, %g2 2013df4: 93 32 00 02 srl %o0, %g2, %o1 static inline uint32_t fat_block_num_to_sector_num (const fat_fs_info_t *fs_info, const uint32_t block_number) { return block_number << (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013df8: 85 2a 40 02 sll %o1, %g2, %g2 fat_sector_offset_to_block_offset (const fat_fs_info_t *fs_info, const uint32_t sector, const uint32_t sector_offset) { return sector_offset + ((sector - 2013dfc: 90 22 00 02 sub %o0, %g2, %o0 fat_block_num_to_sector_num (fs_info, fat_sector_num_to_block_num (fs_info, sector))) << fs_info->vol.sec_log2); 2013e00: b9 2a 00 01 sll %o0, %g1, %i4 blk = fat_sector_num_to_block_num(fs_info, sec_num); blk_ofs = fat_sector_offset_to_block_offset(fs_info, sec_num, 0); if (blk_ofs == 0 2013e04: 80 a7 20 00 cmp %i4, 0 2013e08: 12 bf ff e0 bne 2013d88 2013e0c: d0 07 60 64 ld [ %i5 + 0x64 ], %o0 && fs_info->vol.bps == fs_info->vol.bytes_per_block) 2013e10: c4 17 40 00 lduh [ %i5 ], %g2 2013e14: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2013e18: 80 a0 80 01 cmp %g2, %g1 2013e1c: 12 bf ff db bne 2013d88 2013e20: 01 00 00 00 nop { sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &bd); 2013e24: 7f ff f7 0b call 2011a50 2013e28: 94 07 bf fc add %fp, -4, %o2 } else { sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &bd); } if ( sc != RTEMS_SUCCESSFUL) 2013e2c: 10 bf ff da b 2013d94 2013e30: 80 a2 20 00 cmp %o0, 0 } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 2013e34: 7f ff f7 cc call 2011d64 2013e38: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 if (sc != RTEMS_SUCCESSFUL) 2013e3c: 80 a2 20 00 cmp %o0, 0 2013e40: 12 80 00 1f bne 2013ebc <== NEVER TAKEN 2013e44: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EIO); } fs_info->c.state = FAT_CACHE_EMPTY; 2013e48: c0 2f 60 89 clrb [ %i5 + 0x89 ] return RC_OK; 2013e4c: 81 c7 e0 08 ret 2013e50: 91 e8 20 00 restore %g0, 0, %o0 uint32_t ino ) { return (ino >= fs_info->uino_base); } 2013e54: c8 0f 60 02 ldub [ %i5 + 2 ], %g4 2013e58: c6 0f 60 0c ldub [ %i5 + 0xc ], %g3 uint32_t blk = fat_sector_num_to_block_num(fs_info, sec_num); uint32_t blk_ofs = fat_sector_offset_to_block_offset(fs_info, sec_num, 0); if (sec_of_fat && !fs_info->vol.mirror) 2013e5c: 80 a0 a0 00 cmp %g2, 0 2013e60: 12 bf ff b9 bne 2013d44 <== NEVER TAKEN 2013e64: b8 10 20 01 mov 1, %i4 memcpy(fs_info->sec_buf, fs_info->c.buf->buffer + blk_ofs, 2013e68: c4 07 60 8c ld [ %i5 + 0x8c ], %g2 uint32_t blk_ofs = fat_sector_offset_to_block_offset(fs_info, sec_num, 0); if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, 2013e6c: d0 07 60 90 ld [ %i5 + 0x90 ], %o0 2013e70: d2 00 a0 1c ld [ %g2 + 0x1c ], %o1 2013e74: d4 17 40 00 lduh [ %i5 ], %o2 static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013e78: 84 09 20 ff and %g4, 0xff, %g2 2013e7c: 86 08 e0 ff and %g3, 0xff, %g3 2013e80: 86 20 c0 02 sub %g3, %g2, %g3 2013e84: 89 30 40 03 srl %g1, %g3, %g4 static inline uint32_t fat_block_num_to_sector_num (const fat_fs_info_t *fs_info, const uint32_t block_number) { return block_number << (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2013e88: 87 29 00 03 sll %g4, %g3, %g3 fat_sector_offset_to_block_offset (const fat_fs_info_t *fs_info, const uint32_t sector, const uint32_t sector_offset) { return sector_offset + ((sector - 2013e8c: 82 20 40 03 sub %g1, %g3, %g1 fat_block_num_to_sector_num (fs_info, fat_sector_num_to_block_num (fs_info, sector))) << fs_info->vol.sec_log2); 2013e90: 85 28 40 02 sll %g1, %g2, %g2 return RC_OK; if (fs_info->c.modified) { uint32_t sec_num = fs_info->c.blk_num; bool sec_of_fat = ((sec_num >= fs_info->vol.fat_loc) && 2013e94: b8 10 20 01 mov 1, %i4 uint32_t blk_ofs = fat_sector_offset_to_block_offset(fs_info, sec_num, 0); if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, 2013e98: 40 00 23 a0 call 201cd18 2013e9c: 92 02 40 02 add %o1, %g2, %o1 2013ea0: 30 bf ff a9 b,a 2013d44 if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(bd->buffer + blk_ofs, fs_info->sec_buf, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(bd); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); 2013ea4: 40 00 20 de call 201c21c <__errno> <== NOT EXECUTED 2013ea8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013eac: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2013eb0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013eb4: 81 c7 e0 08 ret 2013eb8: 81 e8 00 00 restore } else { sc = rtems_bdbuf_release(fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); 2013ebc: 40 00 20 d8 call 201c21c <__errno> <== NOT EXECUTED 2013ec0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013ec4: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013ec8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013ecc: 81 c7 e0 08 ret <== NOT EXECUTED 2013ed0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020140bc : fat_fs_info_t *fs_info, const uint32_t start_cln, const uint32_t offset, const uint32_t count, const uint8_t pattern) { 20140bc: 9d e3 bf 98 save %sp, -104, %sp ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); 20140c0: c2 16 20 06 lduh [ %i0 + 6 ], %g1 20140c4: 82 20 40 1a sub %g1, %i2, %g1 20140c8: 80 a6 c0 01 cmp %i3, %g1 20140cc: 38 80 00 02 bgu,a 20140d4 <== NEVER TAKEN 20140d0: b6 10 00 01 mov %g1, %i3 <== NOT EXECUTED fat_cluster_num_to_block_num (const fat_fs_info_t *fs_info, uint32_t cln) { uint32_t blk; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20140d4: 80 a6 60 00 cmp %i1, 0 20140d8: 32 80 00 06 bne,a 20140f0 <== ALWAYS TAKEN 20140dc: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 20140e0: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 <== NOT EXECUTED 20140e4: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 20140e8: 12 80 00 50 bne 2014228 <== NOT EXECUTED 20140ec: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 <== NOT EXECUTED static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 20140f0: e0 0e 20 02 ldub [ %i0 + 2 ], %l0 20140f4: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 blk = fat_sector_num_to_block_num(fs_info, fs_info->vol.rdir_loc); else { cln -= FAT_RSRVD_CLN; blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 20140f8: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 20140fc: a0 20 40 10 sub %g1, %l0, %l0 if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) blk = fat_sector_num_to_block_num(fs_info, fs_info->vol.rdir_loc); else { cln -= FAT_RSRVD_CLN; 2014100: b2 06 7f fe add %i1, -2, %i1 2014104: a1 30 c0 10 srl %g3, %l0, %l0 blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 2014108: 84 20 80 01 sub %g2, %g1, %g2 201410c: b3 2e 40 02 sll %i1, %g2, %i1 blk += fat_sector_num_to_block_num(fs_info, fs_info->vol.data_fsec); 2014110: a0 04 00 19 add %l0, %i1, %l0 const uint8_t pattern) { ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); uint32_t cur_blk = fat_cluster_num_to_block_num(fs_info, start_cln); uint32_t blocks_in_offset = offset >> fs_info->vol.bytes_per_block_log2; 2014114: 85 36 80 01 srl %i2, %g1, %g2 uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 2014118: 83 28 80 01 sll %g2, %g1, %g1 ssize_t bytes_written = 0; 201411c: a2 10 20 00 clr %l1 { ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); uint32_t cur_blk = fat_cluster_num_to_block_num(fs_info, start_cln); uint32_t blocks_in_offset = offset >> fs_info->vol.bytes_per_block_log2; uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 2014120: b4 26 80 01 sub %i2, %g1, %i2 ssize_t bytes_written = 0; ssize_t ret; cur_blk += blocks_in_offset; 2014124: a0 00 80 10 add %g2, %l0, %l0 const uint32_t start_cln, const uint32_t offset, const uint32_t count, const uint8_t pattern) { ssize_t rc = RC_OK; 2014128: 82 10 20 00 clr %g1 ssize_t bytes_written = 0; ssize_t ret; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 201412c: 80 a6 e0 00 cmp %i3, 0 2014130: 02 80 00 25 be 20141c4 <== NEVER TAKEN 2014134: a4 10 20 01 mov 1, %l2 2014138: 80 a0 60 00 cmp %g1, 0 201413c: 32 80 00 39 bne,a 2014220 <== NEVER TAKEN 2014140: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED && (0 < bytes_to_write)) { uint32_t c = MIN(bytes_to_write, (fs_info->vol.bytes_per_block - ofs_blk)); 2014144: c4 16 20 0a lduh [ %i0 + 0xa ], %g2 2014148: 82 20 80 1a sub %g2, %i2, %g1 201414c: 80 a0 40 1b cmp %g1, %i3 2014150: 08 80 00 03 bleu 201415c <== ALWAYS TAKEN 2014154: ba 10 00 01 mov %g1, %i5 2014158: ba 10 00 1b mov %i3, %i5 <== NOT EXECUTED const uint32_t offset, const uint32_t count, const uint8_t pattern) { int rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bytes_per_block - offset)); 201415c: 80 a7 40 01 cmp %i5, %g1 2014160: 08 80 00 03 bleu 201416c <== ALWAYS TAKEN 2014164: b2 10 00 1d mov %i5, %i1 2014168: b2 10 00 01 mov %g1, %i1 <== NOT EXECUTED uint32_t ino ) { return (ino >= fs_info->uino_base); } 201416c: c2 0e 20 02 ldub [ %i0 + 2 ], %g1 int rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bytes_per_block - offset)); uint8_t *blk_buf; uint32_t sec_num = fat_block_num_to_sector_num(fs_info, start_blk); if (0 < bytes_to_write) 2014170: 80 a6 60 00 cmp %i1, 0 2014174: 02 80 00 24 be 2014204 <== NEVER TAKEN 2014178: d2 0e 20 0c ldub [ %i0 + 0xc ], %o1 static inline uint32_t fat_block_num_to_sector_num (const fat_fs_info_t *fs_info, const uint32_t block_number) { return block_number << (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 201417c: 92 22 40 01 sub %o1, %g1, %o1 { if (bytes_to_write == fs_info->vol.bytes_per_block) { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); 2014180: 90 10 00 18 mov %i0, %o0 uint8_t *blk_buf; uint32_t sec_num = fat_block_num_to_sector_num(fs_info, start_blk); if (0 < bytes_to_write) { if (bytes_to_write == fs_info->vol.bytes_per_block) 2014184: 80 a0 80 19 cmp %g2, %i1 2014188: 02 80 00 21 be 201420c 201418c: 93 2c 00 09 sll %l0, %o1, %o1 { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); } else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); 2014190: 94 10 20 01 mov 1, %o2 2014194: 7f ff ff 50 call 2013ed4 2014198: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 201419c: 80 a2 20 00 cmp %o0, 0 20141a0: 22 80 00 14 be,a 20141f0 <== ALWAYS TAKEN 20141a4: d0 07 bf fc ld [ %fp + -4 ], %o0 fs_info, cur_blk, ofs_blk, c, pattern); if (c != ret) 20141a8: 80 a2 00 1d cmp %o0, %i5 20141ac: 02 80 00 0b be 20141d8 <== ALWAYS TAKEN 20141b0: 82 10 3f ff mov -1, %g1 20141b4: b4 10 20 00 clr %i2 <== NOT EXECUTED ssize_t bytes_written = 0; ssize_t ret; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 20141b8: 80 a6 e0 00 cmp %i3, 0 20141bc: 12 bf ff e0 bne 201413c <== NEVER TAKEN 20141c0: 80 a0 60 00 cmp %g1, 0 bytes_written += ret; ++cur_blk; } ofs_blk = 0; } if (RC_OK != rc) 20141c4: 80 a0 60 00 cmp %g1, 0 20141c8: 12 80 00 16 bne 2014220 <== NEVER TAKEN 20141cc: b0 10 3f ff mov -1, %i0 20141d0: 81 c7 e0 08 ret 20141d4: 91 e8 00 11 restore %g0, %l1, %o0 pattern); if (c != ret) rc = -1; else { bytes_to_write -= ret; 20141d8: b6 26 c0 08 sub %i3, %o0, %i3 bytes_written += ret; 20141dc: a2 04 40 08 add %l1, %o0, %l1 ++cur_blk; 20141e0: a0 04 20 01 inc %l0 20141e4: 82 10 20 00 clr %g1 20141e8: 10 bf ff f4 b 20141b8 20141ec: b4 10 20 00 clr %i2 else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); if (RC_OK == rc) { memset(blk_buf + offset, pattern, bytes_to_write); 20141f0: 92 10 00 1c mov %i4, %o1 20141f4: 90 02 00 1a add %o0, %i2, %o0 20141f8: 40 00 23 05 call 201ce0c 20141fc: 94 10 00 19 mov %i1, %o2 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 2014200: e4 2e 20 88 stb %l2, [ %i0 + 0x88 ] } } if (RC_OK != rc) return rc; else return bytes_to_write; 2014204: 10 bf ff e9 b 20141a8 2014208: 90 10 00 19 mov %i1, %o0 if (0 < bytes_to_write) { if (bytes_to_write == fs_info->vol.bytes_per_block) { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); 201420c: 94 10 20 02 mov 2, %o2 2014210: 7f ff ff 31 call 2013ed4 2014214: 96 07 bf fc add %fp, -4, %o3 } else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); if (RC_OK == rc) 2014218: 10 bf ff e2 b 20141a0 201421c: 80 a2 20 00 cmp %o0, 0 } if (RC_OK != rc) return rc; else return bytes_written; } 2014220: 81 c7 e0 08 ret <== NOT EXECUTED 2014224: 81 e8 00 00 restore <== NOT EXECUTED static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 2014228: c4 0e 20 02 ldub [ %i0 + 2 ], %g2 <== NOT EXECUTED 201422c: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 <== NOT EXECUTED 2014230: 84 20 40 02 sub %g1, %g2, %g2 <== NOT EXECUTED 2014234: 10 bf ff b8 b 2014114 <== NOT EXECUTED 2014238: a1 34 00 02 srl %l0, %g2, %l0 <== NOT EXECUTED =============================================================================== 0201423c : const uint32_t start_cln, const uint32_t offset, const uint32_t count, const void *buff, const bool overwrite_cluster) { 201423c: 9d e3 bf 98 save %sp, -104, %sp ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); 2014240: c2 16 20 06 lduh [ %i0 + 6 ], %g1 2014244: 82 20 40 1a sub %g1, %i2, %g1 2014248: 80 a6 c0 01 cmp %i3, %g1 201424c: 38 80 00 02 bgu,a 2014254 <== NEVER TAKEN 2014250: b6 10 00 01 mov %g1, %i3 <== NOT EXECUTED fat_cluster_num_to_block_num (const fat_fs_info_t *fs_info, uint32_t cln) { uint32_t blk; if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2014254: 80 a6 60 00 cmp %i1, 0 2014258: 32 80 00 06 bne,a 2014270 201425c: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 2014260: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 2014264: 80 88 60 03 btst 3, %g1 2014268: 12 80 00 52 bne 20143b0 <== ALWAYS TAKEN 201426c: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 2014270: e2 0e 20 02 ldub [ %i0 + 2 ], %l1 2014274: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 blk = fat_sector_num_to_block_num(fs_info, fs_info->vol.rdir_loc); else { cln -= FAT_RSRVD_CLN; blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 2014278: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 201427c: a2 20 40 11 sub %g1, %l1, %l1 if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) blk = fat_sector_num_to_block_num(fs_info, fs_info->vol.rdir_loc); else { cln -= FAT_RSRVD_CLN; 2014280: b2 06 7f fe add %i1, -2, %i1 2014284: a3 30 c0 11 srl %g3, %l1, %l1 blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 2014288: 84 20 80 01 sub %g2, %g1, %g2 201428c: b3 2e 40 02 sll %i1, %g2, %i1 blk += fat_sector_num_to_block_num(fs_info, fs_info->vol.data_fsec); 2014290: a2 04 40 19 add %l1, %i1, %l1 const bool overwrite_cluster) { ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); uint32_t cur_blk = fat_cluster_num_to_block_num(fs_info, start_cln); uint32_t blocks_in_offset = (offset >> fs_info->vol.bytes_per_block_log2); 2014294: 85 36 80 01 srl %i2, %g1, %g2 uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 2014298: 83 28 80 01 sll %g2, %g1, %g1 ssize_t bytes_written = 0; 201429c: a4 10 20 00 clr %l2 { ssize_t rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bpc - offset)); uint32_t cur_blk = fat_cluster_num_to_block_num(fs_info, start_cln); uint32_t blocks_in_offset = (offset >> fs_info->vol.bytes_per_block_log2); uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 20142a0: b4 26 80 01 sub %i2, %g1, %i2 ssize_t bytes_written = 0; uint8_t *buffer = (uint8_t*)buff; ssize_t ret; uint32_t c; cur_blk += blocks_in_offset; 20142a4: a2 00 80 11 add %g2, %l1, %l1 const uint32_t offset, const uint32_t count, const void *buff, const bool overwrite_cluster) { ssize_t rc = RC_OK; 20142a8: 82 10 20 00 clr %g1 ssize_t ret; uint32_t c; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 20142ac: 80 a6 e0 00 cmp %i3, 0 20142b0: 02 80 00 27 be 201434c <== NEVER TAKEN 20142b4: a6 10 20 01 mov 1, %l3 20142b8: 80 a0 60 00 cmp %g1, 0 20142bc: 32 80 00 3b bne,a 20143a8 <== NEVER TAKEN 20142c0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED && (0 < bytes_to_write)) { c = MIN(bytes_to_write, (fs_info->vol.bytes_per_block - ofs_blk)); 20142c4: c4 16 20 0a lduh [ %i0 + 0xa ], %g2 20142c8: 82 20 80 1a sub %g2, %i2, %g1 20142cc: 80 a0 40 1b cmp %g1, %i3 20142d0: 08 80 00 03 bleu 20142dc 20142d4: b2 10 00 01 mov %g1, %i1 20142d8: b2 10 00 1b mov %i3, %i1 const uint32_t count, const void *buf, const bool overwrite_block) { int rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bytes_per_block - offset)); 20142dc: 80 a6 40 01 cmp %i1, %g1 20142e0: 08 80 00 03 bleu 20142ec <== ALWAYS TAKEN 20142e4: a0 10 00 19 mov %i1, %l0 20142e8: a0 10 00 01 mov %g1, %l0 <== NOT EXECUTED uint32_t ino ) { return (ino >= fs_info->uino_base); } 20142ec: c2 0e 20 02 ldub [ %i0 + 2 ], %g1 int rc = RC_OK; uint32_t bytes_to_write = MIN(count, (fs_info->vol.bytes_per_block - offset)); uint8_t *blk_buf; uint32_t sec_num = fat_block_num_to_sector_num(fs_info, start_blk); if (0 < bytes_to_write) 20142f0: 80 a4 20 00 cmp %l0, 0 20142f4: 02 80 00 26 be 201438c <== NEVER TAKEN 20142f8: d2 0e 20 0c ldub [ %i0 + 0xc ], %o1 static inline uint32_t fat_block_num_to_sector_num (const fat_fs_info_t *fs_info, const uint32_t block_number) { return block_number << (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 20142fc: 92 22 40 01 sub %o1, %g1, %o1 { if ( overwrite_block || (bytes_to_write == fs_info->vol.bytes_per_block)) { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); 2014300: 90 10 00 18 mov %i0, %o0 uint8_t *blk_buf; uint32_t sec_num = fat_block_num_to_sector_num(fs_info, start_blk); if (0 < bytes_to_write) { if ( overwrite_block 2014304: 80 a7 60 00 cmp %i5, 0 2014308: 12 80 00 23 bne 2014394 201430c: 93 2c 40 09 sll %l1, %o1, %o1 || (bytes_to_write == fs_info->vol.bytes_per_block)) 2014310: 80 a0 80 10 cmp %g2, %l0 2014314: 02 80 00 20 be 2014394 2014318: 94 10 20 01 mov 1, %o2 { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); } else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); 201431c: 7f ff fe ee call 2013ed4 2014320: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 2014324: 80 a2 20 00 cmp %o0, 0 2014328: 22 80 00 14 be,a 2014378 <== ALWAYS TAKEN 201432c: d0 07 bf fc ld [ %fp + -4 ], %o0 cur_blk, ofs_blk, c, &buffer[bytes_written], overwrite_cluster); if (c != ret) 2014330: 80 a2 00 19 cmp %o0, %i1 2014334: 02 80 00 0b be 2014360 <== ALWAYS TAKEN 2014338: 82 10 3f ff mov -1, %g1 201433c: b4 10 20 00 clr %i2 <== NOT EXECUTED ssize_t ret; uint32_t c; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 2014340: 80 a6 e0 00 cmp %i3, 0 2014344: 12 bf ff de bne 20142bc <== NEVER TAKEN 2014348: 80 a0 60 00 cmp %g1, 0 bytes_written += ret; ++cur_blk; } ofs_blk = 0; } if (RC_OK != rc) 201434c: 80 a0 60 00 cmp %g1, 0 2014350: 12 80 00 16 bne 20143a8 <== NEVER TAKEN 2014354: b0 10 3f ff mov -1, %i0 2014358: 81 c7 e0 08 ret 201435c: 91 e8 00 12 restore %g0, %l2, %o0 overwrite_cluster); if (c != ret) rc = -1; else { bytes_to_write -= ret; 2014360: b6 26 c0 08 sub %i3, %o0, %i3 bytes_written += ret; 2014364: a4 04 80 08 add %l2, %o0, %l2 ++cur_blk; 2014368: a2 04 60 01 inc %l1 201436c: 82 10 20 00 clr %g1 2014370: 10 bf ff f4 b 2014340 2014374: b4 10 20 00 clr %i2 else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); if (RC_OK == rc) { memcpy(blk_buf + offset, buf, bytes_to_write); 2014378: 92 07 00 12 add %i4, %l2, %o1 201437c: 90 02 00 1a add %o0, %i2, %o0 2014380: 40 00 22 66 call 201cd18 2014384: 94 10 00 10 mov %l0, %o2 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 2014388: e6 2e 20 88 stb %l3, [ %i0 + 0x88 ] } } if (RC_OK != rc) return rc; else return bytes_to_write; 201438c: 10 bf ff e9 b 2014330 2014390: 90 10 00 10 mov %l0, %o0 if (0 < bytes_to_write) { if ( overwrite_block || (bytes_to_write == fs_info->vol.bytes_per_block)) { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &blk_buf); 2014394: 94 10 20 02 mov 2, %o2 2014398: 7f ff fe cf call 2013ed4 201439c: 96 07 bf fc add %fp, -4, %o3 } else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &blk_buf); if (RC_OK == rc) 20143a0: 10 bf ff e2 b 2014328 20143a4: 80 a2 20 00 cmp %o0, 0 } if (RC_OK != rc) return rc; else return bytes_written; } 20143a8: 81 c7 e0 08 ret <== NOT EXECUTED 20143ac: 81 e8 00 00 restore <== NOT EXECUTED static inline uint32_t fat_sector_num_to_block_num (const fat_fs_info_t *fs_info, const uint32_t sector_number) { return sector_number >> (fs_info->vol.bytes_per_block_log2 - fs_info->vol.sec_log2); 20143b0: c4 0e 20 02 ldub [ %i0 + 2 ], %g2 20143b4: e2 06 20 20 ld [ %i0 + 0x20 ], %l1 20143b8: 84 20 40 02 sub %g1, %g2, %g2 20143bc: 10 bf ff b6 b 2014294 20143c0: a3 34 40 02 srl %l1, %g2, %l1 =============================================================================== 02013544 : int fat_file_close( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013544: 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) 2013548: c2 06 60 08 ld [ %i1 + 8 ], %g1 201354c: 80 a0 60 01 cmp %g1, 1 2013550: 08 80 00 06 bleu 2013568 2013554: 82 00 7f ff add %g1, -1, %g1 { fat_fd->links_num--; return rc; 2013558: 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--; 201355c: c2 26 60 08 st %g1, [ %i1 + 8 ] * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); return rc; } 2013560: 81 c7 e0 08 ret 2013564: 91 e8 00 08 restore %g0, %o0, %o0 return rc; } key = fat_construct_key(fs_info, &fat_fd->dir_pos.sname); if (fat_fd->flags & FAT_FILE_REMOVED) 2013568: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 201356c: 80 88 60 01 btst 1, %g1 2013570: 22 80 00 15 be,a 20135c4 2013574: d2 06 60 0c ld [ %i1 + 0xc ], %o1 { rc = fat_file_truncate(fs_info, fat_fd, 0); 2013578: 90 10 00 18 mov %i0, %o0 201357c: 92 10 00 19 mov %i1, %o1 2013580: 7f ff ff b0 call 2013440 2013584: 94 10 20 00 clr %o2 if ( rc != RC_OK ) 2013588: 80 a2 20 00 cmp %o0, 0 201358c: 12 bf ff f5 bne 2013560 <== NEVER TAKEN 2013590: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2013594: 40 00 0d b9 call 2016c78 <_Chain_Extract> 2013598: 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(fs_info, fat_fd->ino) ) 201359c: d2 06 60 0c ld [ %i1 + 0xc ], %o1 20135a0: 40 00 06 7a call 2014f88 20135a4: 90 10 00 18 mov %i0, %o0 20135a8: 80 8a 20 ff btst 0xff, %o0 20135ac: 32 80 00 11 bne,a 20135f0 <== NEVER TAKEN 20135b0: 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); 20135b4: 7f ff c7 aa call 200545c 20135b8: 90 10 00 19 mov %i1, %o0 } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 20135bc: 40 00 01 cf call 2013cf8 20135c0: 81 e8 00 00 restore free(fat_fd); } else { if (fat_ino_is_unique(fs_info, fat_fd->ino)) 20135c4: 40 00 06 71 call 2014f88 20135c8: 90 10 00 18 mov %i0, %o0 20135cc: 80 8a 20 ff btst 0xff, %o0 20135d0: 02 80 00 05 be 20135e4 <== ALWAYS TAKEN 20135d4: 01 00 00 00 nop { fat_fd->links_num = 0; 20135d8: c0 26 60 08 clr [ %i1 + 8 ] <== NOT EXECUTED } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 20135dc: 40 00 01 c7 call 2013cf8 <== NOT EXECUTED 20135e0: 81 e8 00 00 restore <== NOT EXECUTED 20135e4: 40 00 0d a5 call 2016c78 <_Chain_Extract> 20135e8: 90 10 00 19 mov %i1, %o0 20135ec: 30 bf ff f2 b,a 20135b4 return rc; _hash_delete(fs_info->rhash, key, fat_fd->ino, fat_fd); if ( fat_ino_is_unique(fs_info, fat_fd->ino) ) fat_free_unique_ino(fs_info, fat_fd->ino); 20135f0: 40 00 06 5b call 2014f5c <== NOT EXECUTED 20135f4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20135f8: 30 bf ff ef b,a 20135b4 <== NOT EXECUTED =============================================================================== 020136d0 : fat_file_fd_t *fat_fd, bool zero_fill, uint32_t new_length, uint32_t *a_length ) { 20136d0: 9d e3 bf 90 save %sp, -112, %sp uint32_t last_cl = 0; uint32_t bytes_remain = 0; uint32_t cls_added; ssize_t bytes_written; *a_length = new_length; 20136d4: f6 27 00 00 st %i3, [ %i4 ] if (new_length <= fat_fd->fat_file_size) 20136d8: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t new_length, uint32_t *a_length ) { int rc = RC_OK; uint32_t chain = 0; 20136dc: 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; 20136e0: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cls_added; ssize_t bytes_written; *a_length = new_length; if (new_length <= fat_fd->fat_file_size) 20136e4: 80 a6 c0 01 cmp %i3, %g1 20136e8: 08 80 00 16 bleu 2013740 20136ec: ba 10 00 18 mov %i0, %i5 return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20136f0: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 20136f4: 80 a0 a0 01 cmp %g2, 1 20136f8: 22 80 00 56 be,a 2013850 20136fc: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 (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))) & 2013700: e0 17 60 06 lduh [ %i5 + 6 ], %l0 (fs_info->vol.bpc - 1); bytes2add = new_length - fat_fd->fat_file_size; 2013704: 86 26 c0 01 sub %i3, %g1, %g3 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))) & 2013708: 84 04 3f ff add %l0, -1, %g2 201370c: a4 08 80 01 and %g2, %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 - 2013710: a0 24 00 12 sub %l0, %l2, %l0 2013714: 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) 2013718: 80 a4 00 03 cmp %l0, %g3 201371c: 1a 80 00 03 bcc 2013728 2013720: a2 10 20 00 clr %l1 bytes2add -= bytes_remain; 2013724: a2 20 c0 10 sub %g3, %l0, %l1 else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 2013728: 80 a4 20 00 cmp %l0, 0 201372c: 12 80 00 3c bne 201381c 2013730: 80 a6 a0 00 cmp %i2, 0 /* * 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) 2013734: 80 a4 60 00 cmp %l1, 0 2013738: 32 80 00 04 bne,a 2013748 201373c: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 ssize_t bytes_written; *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; 2013740: 81 c7 e0 08 ret 2013744: 91 e8 20 00 restore %g0, 0, %o0 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 2013748: a4 04 7f ff add %l1, -1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 201374c: 90 10 00 1d mov %i5, %o0 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 2013750: a5 34 80 01 srl %l2, %g1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 2013754: 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; 2013758: a4 04 a0 01 inc %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 201375c: 96 07 bf fc add %fp, -4, %o3 2013760: 94 10 00 12 mov %l2, %o2 2013764: 98 07 bf f8 add %fp, -8, %o4 2013768: 40 00 1c a0 call 201a9e8 201376c: 9a 10 00 1a mov %i2, %o5 &cls_added, &last_cl, zero_fill); /* this means that low level I/O error occured */ if (rc != RC_OK) 2013770: b0 92 20 00 orcc %o0, 0, %i0 2013774: 12 80 00 28 bne 2013814 <== NEVER TAKEN 2013778: 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)) 201377c: 80 94 00 01 orcc %l0, %g1, %g0 2013780: 02 80 00 3b be 201386c <== NEVER TAKEN 2013784: 80 a4 80 01 cmp %l2, %g1 rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) 2013788: 02 80 00 09 be 20137ac <== ALWAYS TAKEN 201378c: a4 24 80 01 sub %l2, %g1, %l2 { new_length -= bytes2add & (fs_info->vol.bpc - 1); 2013790: c6 17 60 06 lduh [ %i5 + 6 ], %g3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 2013794: c4 0f 60 08 ldub [ %i5 + 8 ], %g2 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) { new_length -= bytes2add & (fs_info->vol.bpc - 1); 2013798: 86 00 ff ff add %g3, -1, %g3 <== NOT EXECUTED 201379c: a2 0c 40 03 and %l1, %g3, %l1 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 20137a0: a5 2c 80 02 sll %l2, %g2, %l2 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENOSPC); /* check wether we satisfied request for 'cls2add' clusters */ if (cls2add != cls_added) { new_length -= bytes2add & (fs_info->vol.bpc - 1); 20137a4: b6 26 c0 11 sub %i3, %l1, %i3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 20137a8: b6 26 c0 12 sub %i3, %l2, %i3 <== NOT EXECUTED } /* add new chain to the end of existed */ if ( fat_fd->fat_file_size == 0 ) 20137ac: d6 06 60 18 ld [ %i1 + 0x18 ], %o3 20137b0: 80 a2 e0 00 cmp %o3, 0 20137b4: 32 80 00 43 bne,a 20138c0 20137b8: d2 06 60 3c ld [ %i1 + 0x3c ], %o1 { fat_fd->map.disk_cln = fat_fd->cln = chain; 20137bc: c4 07 bf f0 ld [ %fp + -16 ], %g2 fat_fd->map.file_cln = 0; 20137c0: c0 26 60 34 clr [ %i1 + 0x34 ] } /* add new chain to the end of existed */ if ( fat_fd->fat_file_size == 0 ) { fat_fd->map.disk_cln = fat_fd->cln = chain; 20137c4: c4 26 60 1c st %g2, [ %i1 + 0x1c ] 20137c8: 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) 20137cc: 80 a0 60 00 cmp %g1, 0 20137d0: 22 80 00 39 be,a 20138b4 <== NEVER TAKEN 20137d4: f6 27 00 00 st %i3, [ %i4 ] <== NOT EXECUTED { fat_fd->map.last_cln = last_cl; 20137d8: c4 07 bf f8 ld [ %fp + -8 ], %g2 if (fat_fd->fat_file_type == FAT_DIRECTORY) 20137dc: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20137e0: 80 a0 60 00 cmp %g1, 0 20137e4: 12 80 00 33 bne 20138b0 20137e8: c4 26 60 3c st %g2, [ %i1 + 0x3c ] { rc = fat_init_clusters_chain(fs_info, chain); 20137ec: d2 07 bf f0 ld [ %fp + -16 ], %o1 20137f0: 40 00 05 80 call 2014df0 20137f4: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20137f8: 82 92 20 00 orcc %o0, 0, %g1 20137fc: 22 80 00 2e be,a 20138b4 <== ALWAYS TAKEN 2013800: f6 27 00 00 st %i3, [ %i4 ] { fat_free_fat_clusters_chain(fs_info, chain); 2013804: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED 2013808: b0 10 00 01 mov %g1, %i0 <== NOT EXECUTED 201380c: 40 00 1c 3f call 201a908 <== NOT EXECUTED 2013810: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2013814: 81 c7 e0 08 ret <== NOT EXECUTED 2013818: 81 e8 00 00 restore <== NOT EXECUTED if (bytes2add > bytes_remain) bytes2add -= bytes_remain; else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 201381c: 02 bf ff c7 be 2013738 2013820: 80 a4 60 00 cmp %l1, 0 uint32_t start = fat_fd->fat_file_size; uint32_t cl_start = start >> fs_info->vol.bpc_log2; 2013824: d4 0f 60 08 ldub [ %i5 + 8 ], %o2 uint32_t ofs = start & (fs_info->vol.bpc - 1); uint32_t cur_cln; rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 2013828: 90 10 00 1d mov %i5, %o0 201382c: 92 10 00 19 mov %i1, %o1 2013830: 95 30 40 0a srl %g1, %o2, %o2 2013834: 7f ff fd 9b call 2012ea0 2013838: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201383c: b0 92 60 00 orcc %o1, 0, %i0 2013840: 02 80 00 11 be 2013884 <== ALWAYS TAKEN 2013844: d2 07 bf fc ld [ %fp + -4 ], %o1 *a_length = new_length; fat_fd->fat_file_size = new_length; return RC_OK; } 2013848: 81 c7 e0 08 ret <== NOT EXECUTED 201384c: 81 e8 00 00 restore <== 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)) && 2013850: 80 a0 a0 00 cmp %g2, 0 2013854: 32 bf ff ac bne,a 2013704 <== NEVER TAKEN 2013858: e0 17 60 06 lduh [ %i5 + 6 ], %l0 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 201385c: c4 0e 20 0e ldub [ %i0 + 0xe ], %g2 *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013860: 80 88 a0 03 btst 3, %g2 2013864: 22 bf ff a8 be,a 2013704 <== NEVER TAKEN 2013868: e0 17 60 06 lduh [ %i5 + 6 ], %l0 <== 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); 201386c: 40 00 22 6c call 201c21c <__errno> 2013870: b0 10 3f ff mov -1, %i0 2013874: 82 10 20 1c mov 0x1c, %g1 2013878: c2 22 00 00 st %g1, [ %o0 ] 201387c: 81 c7 e0 08 ret 2013880: 81 e8 00 00 restore rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; bytes_written = fat_cluster_set (fs_info, cur_cln, ofs, bytes_remain, 0); 2013884: 90 10 00 1d mov %i5, %o0 2013888: 94 10 00 12 mov %l2, %o2 201388c: 96 10 00 10 mov %l0, %o3 2013890: 98 10 20 00 clr %o4 2013894: 40 00 02 0a call 20140bc 2013898: b0 10 3f ff mov -1, %i0 if (bytes_remain != bytes_written) 201389c: 80 a2 00 10 cmp %o0, %l0 20138a0: 02 bf ff a6 be 2013738 <== ALWAYS TAKEN 20138a4: 80 a4 60 00 cmp %l1, 0 *a_length = new_length; fat_fd->fat_file_size = new_length; return RC_OK; } 20138a8: 81 c7 e0 08 ret <== NOT EXECUTED 20138ac: 81 e8 00 00 restore <== NOT EXECUTED return rc; } } } *a_length = new_length; 20138b0: f6 27 00 00 st %i3, [ %i4 ] fat_fd->fat_file_size = new_length; 20138b4: f6 26 60 18 st %i3, [ %i1 + 0x18 ] return RC_OK; } 20138b8: 81 c7 e0 08 ret 20138bc: 81 e8 00 00 restore 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) 20138c0: 80 a2 7f ff cmp %o1, -1 20138c4: 22 80 00 0d be,a 20138f8 <== NEVER TAKEN 20138c8: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED { old_last_cl = fat_fd->map.last_cln; 20138cc: d2 27 bf f4 st %o1, [ %fp + -12 ] fat_free_fat_clusters_chain(fs_info, chain); return rc; } } rc = fat_set_fat_cluster(fs_info, old_last_cl, chain); 20138d0: d4 07 bf f0 ld [ %fp + -16 ], %o2 20138d4: 40 00 1b 5b call 201a640 20138d8: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20138dc: 82 92 20 00 orcc %o0, 0, %g1 20138e0: 12 bf ff ca bne 2013808 <== NEVER TAKEN 20138e4: d2 07 bf f0 ld [ %fp + -16 ], %o1 { fat_free_fat_clusters_chain(fs_info, chain); return rc; } fat_buf_release(fs_info); 20138e8: 40 00 01 04 call 2013cf8 20138ec: 90 10 00 1d mov %i5, %o0 20138f0: 10 bf ff b7 b 20137cc 20138f4: c2 07 bf fc ld [ %fp + -4 ], %g1 { old_last_cl = fat_fd->map.last_cln; } else { rc = fat_file_ioctl(fs_info, fat_fd, F_CLU_NUM, 20138f8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20138fc: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 2013900: 96 02 ff ff add %o3, -1, %o3 <== NOT EXECUTED 2013904: 7f ff ff 3e call 20135fc <== NOT EXECUTED 2013908: 98 07 bf f4 add %fp, -12, %o4 <== NOT EXECUTED 201390c: d2 07 bf f4 ld [ %fp + -12 ], %o1 <== NOT EXECUTED (fat_fd->fat_file_size - 1), &old_last_cl); if ( rc != RC_OK ) 2013910: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013914: 02 bf ff ef be 20138d0 <== NOT EXECUTED 2013918: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED if (fat_fd->fat_file_type == FAT_DIRECTORY) { rc = fat_init_clusters_chain(fs_info, chain); if ( rc != RC_OK ) { fat_free_fat_clusters_chain(fs_info, chain); 201391c: 10 bf ff bb b 2013808 <== NOT EXECUTED 2013920: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED =============================================================================== 020135fc : fat_file_ioctl( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, int cmd, ...) { 20135fc: 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); 2013600: 82 07 a0 50 add %fp, 0x50, %g1 2013604: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2013608: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 201360c: fa 27 a0 58 st %i5, [ %fp + 0x58 ] fat_file_fd_t *fat_fd, int cmd, ...) { int rc = RC_OK; uint32_t cur_cln = 0; 2013610: c0 27 bf f8 clr [ %fp + -8 ] uint32_t *ret; va_list ap; va_start(ap, cmd); switch (cmd) 2013614: 80 a6 a0 01 cmp %i2, 1 2013618: 02 80 00 08 be 2013638 <== ALWAYS TAKEN 201361c: c2 27 bf fc st %g1, [ %fp + -4 ] *ret = cur_cln; break; default: errno = EINVAL; 2013620: 40 00 22 ff call 201c21c <__errno> <== NOT EXECUTED 2013624: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013628: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 201362c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rc = -1; break; } va_end(ap); return rc; } 2013630: 81 c7 e0 08 ret <== NOT EXECUTED 2013634: 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 ) { 2013638: c4 06 60 18 ld [ %i1 + 0x18 ], %g2 switch (cmd) { case F_CLU_NUM: pos = va_arg(ap, uint32_t); ret = va_arg(ap, uint32_t *); 201363c: 86 07 a0 58 add %fp, 0x58, %g3 2013640: c6 27 bf fc st %g3, [ %fp + -4 ] /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { 2013644: 80 a6 c0 02 cmp %i3, %g2 2013648: 1a 80 00 1c bcc 20136b8 <== NEVER TAKEN 201364c: 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)) && 2013650: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013654: 80 a0 60 01 cmp %g1, 1 2013658: 22 80 00 0e be,a 2013690 201365c: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 *ret = 0; rc = RC_OK; break; } cl_start = pos >> fs_info->vol.bpc_log2; 2013660: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 2013664: 90 10 00 18 mov %i0, %o0 2013668: 92 10 00 19 mov %i1, %o1 201366c: 95 36 c0 0a srl %i3, %o2, %o2 2013670: 7f ff fe 0c call 2012ea0 2013674: 96 07 bf f8 add %fp, -8, %o3 if ( rc != RC_OK ) 2013678: b0 92 60 00 orcc %o1, 0, %i0 201367c: 12 bf ff ed bne 2013630 <== NEVER TAKEN 2013680: c2 07 bf f8 ld [ %fp + -8 ], %g1 break; *ret = cur_cln; 2013684: c2 27 40 00 st %g1, [ %i5 ] break; 2013688: 81 c7 e0 08 ret 201368c: 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)) && 2013690: 80 a0 60 00 cmp %g1, 0 2013694: 32 bf ff f4 bne,a 2013664 <== NEVER TAKEN 2013698: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 201369c: c2 0e 20 0e ldub [ %i0 + 0xe ], %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)) && 20136a0: 80 88 60 03 btst 3, %g1 20136a4: 22 bf ff f0 be,a 2013664 20136a8: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { /* cluster 0 (zero) reserved for root dir */ *ret = 0; 20136ac: c0 27 00 00 clr [ %i4 ] rc = RC_OK; break; 20136b0: 81 c7 e0 08 ret 20136b4: 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 ); 20136b8: 40 00 22 d9 call 201c21c <__errno> <== NOT EXECUTED 20136bc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20136c0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 20136c4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20136c8: 81 c7 e0 08 ret <== NOT EXECUTED 20136cc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02012ea0 : fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t file_cln, uint32_t *disk_cln ) { 2012ea0: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) 2012ea4: f8 06 60 34 ld [ %i1 + 0x34 ], %i4 2012ea8: 80 a7 00 1a cmp %i4, %i2 2012eac: 22 80 00 26 be,a 2012f44 2012eb0: 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) 2012eb4: 2a 80 00 19 bcs,a 2012f18 2012eb8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 cur_cln = fat_fd->map.disk_cln; count = file_cln - fat_fd->map.file_cln; } else { cur_cln = fat_fd->cln; 2012ebc: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 2012ec0: b8 10 00 1a mov %i2, %i4 2012ec4: c2 27 bf fc st %g1, [ %fp + -4 ] count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 2012ec8: 80 a7 20 00 cmp %i4, 0 2012ecc: 12 80 00 07 bne 2012ee8 2012ed0: ba 10 20 00 clr %i5 return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; 2012ed4: 10 80 00 14 b 2012f24 2012ed8: c2 07 bf fc ld [ %fp + -4 ], %g1 cur_cln = fat_fd->cln; count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 2012edc: 80 a7 40 1c cmp %i5, %i4 2012ee0: 02 80 00 11 be 2012f24 2012ee4: c2 07 bf fc ld [ %fp + -4 ], %g1 { rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2012ee8: d2 07 bf fc ld [ %fp + -4 ], %o1 2012eec: 90 10 00 18 mov %i0, %o0 2012ef0: 40 00 1d 50 call 201a430 2012ef4: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 2012ef8: 80 a2 20 00 cmp %o0, 0 2012efc: 22 bf ff f8 be,a 2012edc <== ALWAYS TAKEN 2012f00: ba 07 60 01 inc %i5 return rc; 2012f04: 86 10 00 08 mov %o0, %g3 <== NOT EXECUTED 2012f08: 85 3a 20 1f sra %o0, 0x1f, %g2 <== NOT EXECUTED fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2012f0c: b2 10 00 03 mov %g3, %i1 <== NOT EXECUTED 2012f10: 81 c7 e0 08 ret <== NOT EXECUTED 2012f14: 91 e8 00 02 restore %g0, %g2, %o0 <== 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; 2012f18: b8 26 80 1c sub %i2, %i4, %i4 uint32_t count; uint32_t i; if (file_cln > fat_fd->map.file_cln) { cur_cln = fat_fd->map.disk_cln; 2012f1c: 10 bf ff eb b 2012ec8 2012f20: c2 27 bf fc st %g1, [ %fp + -4 ] if ( rc != RC_OK ) return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; 2012f24: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = cur_cln; 2012f28: c2 26 60 38 st %g1, [ %i1 + 0x38 ] *disk_cln = cur_cln; } return RC_OK; 2012f2c: 84 10 20 00 clr %g2 2012f30: 86 10 20 00 clr %g3 /* update cache */ fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; 2012f34: c2 26 c0 00 st %g1, [ %i3 ] } return RC_OK; } 2012f38: b0 10 00 02 mov %g2, %i0 2012f3c: 81 c7 e0 08 ret 2012f40: 93 e8 00 03 restore %g0, %g3, %o1 fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; 2012f44: 84 10 20 00 clr %g2 2012f48: 86 10 20 00 clr %g3 ) { int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) *disk_cln = fat_fd->map.disk_cln; 2012f4c: c2 26 c0 00 st %g1, [ %i3 ] fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2012f50: b0 10 00 02 mov %g2, %i0 2012f54: 81 c7 e0 08 ret 2012f58: 93 e8 00 03 restore %g0, %g3, %o1 =============================================================================== 02013b88 : void fat_file_mark_removed( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013b88: 9d e3 bf a0 save %sp, -96, %sp 2013b8c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 fat_cluster_num_to_sector512_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) 2013b90: 80 a0 60 01 cmp %g1, 1 2013b94: 02 80 00 26 be 2013c2c <== NEVER TAKEN 2013b98: 80 a0 60 00 cmp %g1, 0 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013b9c: 32 80 00 1f bne,a 2013c18 <== NEVER TAKEN 2013ba0: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 2013ba4: c4 0e 20 0e ldub [ %i0 + 0xe ], %g2 2013ba8: 80 88 a0 03 btst 3, %g2 2013bac: 22 80 00 1b be,a 2013c18 <== NEVER TAKEN 2013bb0: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013bb4: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2013bb8: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2013bbc: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013bc0: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 2013bc4: 90 10 00 19 mov %i1, %o0 2013bc8: 87 30 a0 09 srl %g2, 9, %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2013bcc: 85 30 a0 05 srl %g2, 5, %g2 2013bd0: 84 08 a0 0f and %g2, 0xf, %g2 static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2013bd4: ba 07 40 03 add %i5, %g3, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013bd8: bb 2f 60 04 sll %i5, 4, %i5 2013bdc: 40 00 0c 27 call 2016c78 <_Chain_Extract> 2013be0: ba 07 40 02 add %i5, %g2, %i5 */ 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); 2013be4: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 2013be8: 82 0f 60 01 and %i5, 1, %g1 2013bec: 85 28 60 02 sll %g1, 2, %g2 2013bf0: 83 28 60 04 sll %g1, 4, %g1 2013bf4: 82 20 40 02 sub %g1, %g2, %g1 RTEMS_INLINE_ROUTINE void rtems_chain_append( rtems_chain_control *the_chain, rtems_chain_node *the_node ) { _Chain_Append( the_chain, the_node ); 2013bf8: 92 10 00 19 mov %i1, %o1 2013bfc: 7f ff db 24 call 200a88c <_Chain_Append> 2013c00: 90 02 00 01 add %o0, %g1, %o0 _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; 2013c04: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 2013c08: 82 10 60 01 or %g1, 1, %g1 2013c0c: c2 2e 60 30 stb %g1, [ %i1 + 0x30 ] 2013c10: 81 c7 e0 08 ret 2013c14: 81 e8 00 00 restore ) { 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) + 2013c18: c4 06 20 34 ld [ %i0 + 0x34 ], %g2 <== NOT EXECUTED 2013c1c: ba 00 7f fe add %g1, -2, %i5 <== NOT EXECUTED 2013c20: bb 2f 40 03 sll %i5, %g3, %i5 <== NOT EXECUTED 2013c24: 10 bf ff e5 b 2013bb8 <== NOT EXECUTED 2013c28: ba 07 40 02 add %i5, %g2, %i5 <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 2013c2c: 10 bf ff e5 b 2013bc0 <== NOT EXECUTED 2013c30: ba 10 20 01 mov 1, %i5 <== NOT EXECUTED =============================================================================== 02012f5c : fat_file_open( fat_fs_info_t *fs_info, fat_dir_pos_t *dir_pos, fat_file_fd_t **fat_fd ) { 2012f5c: 9d e3 bf a0 save %sp, -96, %sp static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2012f60: c2 06 40 00 ld [ %i1 ], %g1 fat_cluster_num_to_sector512_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) 2012f64: 80 a0 60 01 cmp %g1, 1 2012f68: 02 80 00 9c be 20131d8 2012f6c: 80 a0 60 00 cmp %g1, 0 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012f70: 32 80 00 7b bne,a 201315c 2012f74: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 2012f78: c4 0e 20 0e ldub [ %i0 + 0xe ], %g2 2012f7c: 80 88 a0 03 btst 3, %g2 2012f80: 22 80 00 77 be,a 201315c <== NEVER TAKEN 2012f84: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012f88: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2012f8c: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2012f90: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012f94: 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); 2012f98: de 06 20 6c ld [ %i0 + 0x6c ], %o7 2012f9c: 85 30 60 09 srl %g1, 9, %g2 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012fa0: 83 30 60 05 srl %g1, 5, %g1 2012fa4: 82 08 60 0f and %g1, 0xf, %g1 static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2012fa8: ba 07 40 02 add %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012fac: bb 2f 60 04 sll %i5, 4, %i5 static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2012fb0: ba 07 40 01 add %i5, %g1, %i5 uint32_t key1, uint32_t key2, fat_file_fd_t **ret ) { uint32_t mod = (key1) % FAT_HASH_MODULE; 2012fb4: 82 0f 60 01 and %i5, 1, %g1 rtems_chain_node *the_node = rtems_chain_first(hash + mod); 2012fb8: 85 28 60 02 sll %g1, 2, %g2 2012fbc: b7 28 60 04 sll %g1, 4, %i3 2012fc0: b6 26 c0 02 sub %i3, %g2, %i3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2012fc4: c2 03 c0 1b ld [ %o7 + %i3 ], %g1 2012fc8: 9e 03 c0 1b add %o7, %i3, %o7 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( const Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Immutable_tail( the_chain )); 2012fcc: 9e 03 e0 04 add %o7, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2012fd0: 80 a0 40 0f cmp %g1, %o7 2012fd4: 22 80 00 1e be,a 201304c 2012fd8: c4 06 20 70 ld [ %i0 + 0x70 ], %g2 2012fdc: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 fat_cluster_num_to_sector512_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) 2012fe0: 80 a0 a0 01 cmp %g2, 1 2012fe4: 02 80 00 6d be 2013198 2012fe8: 80 a0 a0 00 cmp %g2, 0 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2012fec: 32 80 00 61 bne,a 2013170 2012ff0: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 2012ff4: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 2012ff8: 80 88 e0 03 btst 3, %g3 2012ffc: 22 80 00 5d be,a 2013170 <== NEVER TAKEN 2013000: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013004: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2013008: c6 0e 20 03 ldub [ %i0 + 3 ], %g3 201300c: b9 2f 00 03 sll %i4, %g3, %i4 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013010: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2013014: 85 30 e0 05 srl %g3, 5, %g2 fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013018: 89 30 e0 09 srl %g3, 9, %g4 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 201301c: 84 08 a0 0f and %g2, 0xf, %g2 static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2013020: 86 07 00 04 add %i4, %g4, %g3 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013024: 87 28 e0 04 sll %g3, 4, %g3 static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 2013028: 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(fs_info, &ffd->dir_pos.sname); if ( (key1) == ck) 201302c: 80 a7 40 03 cmp %i5, %g3 2013030: 22 80 00 55 be,a 2013184 2013034: c4 00 60 08 ld [ %g1 + 8 ], %g2 { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2013038: 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) ; ) 201303c: 80 a3 c0 01 cmp %o7, %g1 2013040: 32 bf ff e8 bne,a 2012fe0 2013044: 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); 2013048: c4 06 20 70 ld [ %i0 + 0x70 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201304c: c2 00 80 1b ld [ %g2 + %i3 ], %g1 2013050: 84 00 80 1b add %g2, %i3, %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( const Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Immutable_tail( the_chain )); 2013054: 9e 00 a0 04 add %g2, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2013058: 80 a0 40 0f cmp %g1, %o7 201305c: 02 80 00 1e be 20130d4 <== ALWAYS TAKEN 2013060: a0 10 3f ff mov -1, %l0 2013064: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED fat_cluster_num_to_sector512_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) 2013068: 80 a0 a0 01 cmp %g2, 1 <== NOT EXECUTED 201306c: 02 80 00 59 be 20131d0 <== NOT EXECUTED 2013070: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013074: 32 80 00 4b bne,a 20131a0 <== NOT EXECUTED 2013078: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 201307c: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 <== NOT EXECUTED 2013080: 80 88 e0 03 btst 3, %g3 <== NOT EXECUTED 2013084: 22 80 00 47 be,a 20131a0 <== NOT EXECUTED 2013088: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 201308c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 <== NOT EXECUTED ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2013090: c8 0e 20 03 ldub [ %i0 + 3 ], %g4 <== NOT EXECUTED 2013094: b9 2f 00 04 sll %i4, %g4, %i4 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013098: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 201309c: 85 30 e0 05 srl %g3, 5, %g2 <== NOT EXECUTED fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20130a0: 89 30 e0 09 srl %g3, 9, %g4 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 20130a4: 84 08 a0 0f and %g2, 0xf, %g2 <== NOT EXECUTED static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 20130a8: 86 07 00 04 add %i4, %g4, %g3 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20130ac: 87 28 e0 04 sll %g3, 4, %g3 <== NOT EXECUTED static inline uint32_t fat_construct_key( const fat_fs_info_t *fs_info, fat_pos_t *pos) { return ( ((fat_cluster_num_to_sector512_num(fs_info, pos->cln) + 20130b0: 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(fs_info, &ffd->dir_pos.sname); if ( (key1) == ck) 20130b4: 80 a7 40 03 cmp %i5, %g3 <== NOT EXECUTED 20130b8: 02 80 00 3f be 20131b4 <== NOT EXECUTED 20130bc: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 20130c0: 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) ; ) 20130c4: 80 a0 40 0f cmp %g1, %o7 <== NOT EXECUTED 20130c8: 32 bf ff e8 bne,a 2013068 <== NOT EXECUTED 20130cc: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED return 0; } } the_node = the_node->next; } return -1; 20130d0: a0 10 3f ff mov -1, %l0 <== NOT EXECUTED } /* access "removed-but-still-open" hash table */ rc = _hash_search(fs_info, fs_info->rhash, key, key, &lfat_fd); lfat_fd = (*fat_fd) = (fat_file_fd_t*)malloc(sizeof(fat_file_fd_t)); 20130d4: 7f ff ca 35 call 20059a8 20130d8: 90 10 20 44 mov 0x44, %o0 20130dc: d0 26 80 00 st %o0, [ %i2 ] if ( lfat_fd == NULL ) 20130e0: 80 a2 20 00 cmp %o0, 0 20130e4: 02 80 00 46 be 20131fc <== NEVER TAKEN 20130e8: b8 10 00 08 mov %o0, %i4 rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); 20130ec: 92 10 20 00 clr %o1 20130f0: 40 00 27 47 call 201ce0c 20130f4: 94 10 20 44 mov 0x44, %o2 lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; 20130f8: de 0f 20 30 ldub [ %i4 + 0x30 ], %o7 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 20130fc: c8 06 40 00 ld [ %i1 ], %g4 2013100: c6 06 60 04 ld [ %i1 + 4 ], %g3 2013104: c4 06 60 08 ld [ %i1 + 8 ], %g2 2013108: 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; 201310c: b2 0b ff fe and %o7, -2, %i1 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 2013110: c8 27 20 20 st %g4, [ %i4 + 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; 2013114: 9e 10 20 01 mov 1, %o7 lfat_fd->flags &= ~FAT_FILE_REMOVED; 2013118: f2 2f 20 30 stb %i1, [ %i4 + 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; 201311c: de 27 20 08 st %o7, [ %i4 + 8 ] lfat_fd->flags &= ~FAT_FILE_REMOVED; lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; 2013120: b2 10 3f ff mov -1, %i1 lfat_fd->dir_pos = *dir_pos; 2013124: c6 27 20 24 st %g3, [ %i4 + 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; 2013128: f2 27 20 3c st %i1, [ %i4 + 0x3c ] lfat_fd->dir_pos = *dir_pos; 201312c: c4 27 20 28 st %g2, [ %i4 + 0x28 ] if ( rc != RC_OK ) 2013130: 80 a4 20 00 cmp %l0, 0 2013134: 02 80 00 2b be 20131e0 <== NEVER TAKEN 2013138: c2 27 20 2c st %g1, [ %i4 + 0x2c ] lfat_fd->ino = key; 201313c: fa 27 20 0c st %i5, [ %i4 + 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); 2013140: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 RTEMS_INLINE_ROUTINE void rtems_chain_append( rtems_chain_control *the_chain, rtems_chain_node *the_node ) { _Chain_Append( the_chain, the_node ); 2013144: 92 10 00 1c mov %i4, %o1 2013148: 90 02 00 1b add %o0, %i3, %o0 201314c: 7f ff dd d0 call 200a88c <_Chain_Append> 2013150: b0 10 20 00 clr %i0 2013154: 81 c7 e0 08 ret 2013158: 81 e8 00 00 restore ) { 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) + 201315c: c4 06 20 34 ld [ %i0 + 0x34 ], %g2 2013160: ba 00 7f fe add %g1, -2, %i5 2013164: bb 2f 40 03 sll %i5, %g3, %i5 2013168: 10 bf ff 89 b 2012f8c 201316c: ba 07 40 02 add %i5, %g2, %i5 2013170: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 2013174: b8 00 bf fe add %g2, -2, %i4 2013178: b9 2f 00 04 sll %i4, %g4, %i4 201317c: 10 bf ff a3 b 2013008 2013180: b8 07 00 03 add %i4, %g3, %i4 /* access "valid" hash table */ rc = _hash_search(fs_info, fs_info->vhash, key, 0, &lfat_fd); if ( rc == RC_OK ) { /* return pointer to fat_file_descriptor allocated before */ (*fat_fd) = lfat_fd; 2013184: c2 26 80 00 st %g1, [ %i2 ] lfat_fd->links_num++; 2013188: 84 00 a0 01 inc %g2 201318c: c4 20 60 08 st %g2, [ %g1 + 8 ] 2013190: 81 c7 e0 08 ret 2013194: 91 e8 20 00 restore %g0, 0, %o0 const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 2013198: 10 bf ff 9e b 2013010 201319c: b8 10 20 01 mov 1, %i4 ) { 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) + 20131a0: c8 06 20 34 ld [ %i0 + 0x34 ], %g4 <== NOT EXECUTED 20131a4: b8 00 bf fe add %g2, -2, %i4 <== NOT EXECUTED 20131a8: b9 2f 00 03 sll %i4, %g3, %i4 <== NOT EXECUTED 20131ac: 10 bf ff b9 b 2013090 <== NOT EXECUTED 20131b0: b8 07 00 04 add %i4, %g4, %i4 <== NOT EXECUTED fat_file_fd_t *ffd = (fat_file_fd_t *)the_node; uint32_t ck = fat_construct_key(fs_info, &ffd->dir_pos.sname); if ( (key1) == ck) { if ( ((key2) == 0) || ((key2) == ffd->ino) ) 20131b4: 02 bf ff c8 be 20130d4 <== NOT EXECUTED 20131b8: a0 10 20 00 clr %l0 <== NOT EXECUTED 20131bc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 <== NOT EXECUTED 20131c0: 80 a7 40 02 cmp %i5, %g2 <== NOT EXECUTED 20131c4: 32 bf ff c0 bne,a 20130c4 <== NOT EXECUTED 20131c8: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 20131cc: 30 bf ff c2 b,a 20130d4 <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 20131d0: 10 bf ff b2 b 2013098 <== NOT EXECUTED 20131d4: b8 10 20 01 mov 1, %i4 <== NOT EXECUTED 20131d8: 10 bf ff 6f b 2012f94 20131dc: ba 10 20 01 mov 1, %i5 if ( rc != RC_OK ) lfat_fd->ino = key; else { lfat_fd->ino = fat_get_unique_ino(fs_info); 20131e0: 40 00 07 23 call 2014e6c <== NOT EXECUTED 20131e4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( lfat_fd->ino == 0 ) 20131e8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20131ec: 12 bf ff d5 bne 2013140 <== NOT EXECUTED 20131f0: d0 27 20 0c st %o0, [ %i4 + 0xc ] <== NOT EXECUTED { free((*fat_fd)); 20131f4: 7f ff c8 9a call 200545c <== NOT EXECUTED 20131f8: 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 ); 20131fc: 40 00 24 08 call 201c21c <__errno> <== NOT EXECUTED 2013200: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013204: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2013208: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201320c: 81 c7 e0 08 ret <== NOT EXECUTED 2013210: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201322c : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 201322c: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t ret = 0; uint32_t cmpltd = 0; uint32_t cur_cln = 0; 2013230: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2013234: ba 10 00 18 mov %i0, %i5 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) 2013238: 80 a6 e0 00 cmp %i3, 0 201323c: 02 80 00 7f be 2013438 <== NEVER TAKEN 2013240: 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 ) 2013244: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 2013248: 80 a0 40 1a cmp %g1, %i2 201324c: 08 80 00 7b bleu 2013438 2013250: 80 a6 c0 01 cmp %i3, %g1 return FAT_EOF; if ((count > fat_fd->fat_file_size) || 2013254: 08 80 00 4c bleu 2013384 <== ALWAYS TAKEN 2013258: 84 20 40 1b sub %g1, %i3, %g2 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 201325c: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013260: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013264: 80 a0 60 01 cmp %g1, 1 2013268: 22 80 00 4c be,a 2013398 201326c: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2013270: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2013274: e0 17 60 06 lduh [ %i5 + 6 ], %l0 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2013278: a5 36 80 12 srl %i2, %l2, %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 201327c: 90 10 00 1d mov %i5, %o0 2013280: 92 10 00 19 mov %i1, %o1 2013284: 94 10 00 12 mov %l2, %o2 2013288: 7f ff ff 06 call 2012ea0 201328c: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2013290: b0 92 60 00 orcc %o1, 0, %i0 2013294: 12 80 00 69 bne 2013438 <== NEVER TAKEN 2013298: a1 2c 20 10 sll %l0, 0x10, %l0 return rc; while (count > 0) 201329c: a6 10 20 00 clr %l3 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 20132a0: a1 34 20 10 srl %l0, 0x10, %l0 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 20132a4: 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); 20132a8: a0 04 3f ff add %l0, -1, %l0 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 20132ac: 80 a6 e0 00 cmp %i3, 0 20132b0: 02 80 00 5b be 201341c <== NEVER TAKEN 20132b4: b4 0e 80 10 and %i2, %l0, %i2 20132b8: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 20132bc: c8 17 40 00 lduh [ %i5 ], %g4 20132c0: 10 80 00 20 b 2013340 20132c4: 94 10 00 1a mov %i2, %o2 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20132c8: 80 8e 20 03 btst 3, %i0 <== NOT EXECUTED 20132cc: 22 80 00 27 be,a 2013368 <== NOT EXECUTED 20132d0: de 0f 60 05 ldub [ %i5 + 5 ], %o7 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20132d4: d2 07 60 20 ld [ %i5 + 0x20 ], %o1 <== NOT EXECUTED { c = MIN(count, (fs_info->vol.bpc - ofs)); sec = fat_cluster_num_to_sector_num(fs_info, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); 20132d8: 87 32 80 03 srl %o2, %g3, %g3 byte = ofs & (fs_info->vol.bps - 1); 20132dc: 85 29 20 10 sll %g4, 0x10, %g2 20132e0: 85 30 a0 10 srl %g2, 0x10, %g2 20132e4: 84 00 bf ff add %g2, -1, %g2 ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); 20132e8: 98 07 00 11 add %i4, %l1, %o4 20132ec: 94 0a 80 02 and %o2, %g2, %o2 20132f0: 92 02 40 03 add %o1, %g3, %o1 20132f4: 96 10 00 10 mov %l0, %o3 20132f8: 40 00 03 25 call 2013f8c <_fat_block_read> 20132fc: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013300: 94 07 bf fc add %fp, -4, %o2 sec = fat_cluster_num_to_sector_num(fs_info, cur_cln); sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); if ( ret < 0 ) 2013304: 80 a2 20 00 cmp %o0, 0 2013308: 06 80 00 3d bl 20133fc <== NEVER TAKEN 201330c: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; 2013310: e6 07 bf fc ld [ %fp + -4 ], %l3 ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; count -= c; 2013314: b6 26 c0 10 sub %i3, %l0, %i3 cmpltd += c; save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013318: 92 10 00 13 mov %l3, %o1 201331c: 40 00 1c 45 call 201a430 2013320: a2 04 40 10 add %l1, %l0, %l1 if ( rc != RC_OK ) 2013324: 80 a2 20 00 cmp %o0, 0 2013328: 12 80 00 15 bne 201337c <== NEVER TAKEN 201332c: 80 a6 e0 00 cmp %i3, 0 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2013330: 02 80 00 3a be 2013418 2013334: 94 10 20 00 clr %o2 2013338: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 201333c: c8 17 40 00 lduh [ %i5 ], %g4 { c = MIN(count, (fs_info->vol.bpc - ofs)); 2013340: e0 17 60 06 lduh [ %i5 + 6 ], %l0 2013344: a0 24 00 0a sub %l0, %o2, %l0 2013348: 80 a4 00 1b cmp %l0, %i3 201334c: 08 80 00 03 bleu 2013358 2013350: c4 07 bf fc ld [ %fp + -4 ], %g2 2013354: a0 10 00 1b mov %i3, %l0 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 2013358: 80 a0 a0 00 cmp %g2, 0 201335c: 22 bf ff db be,a 20132c8 <== NEVER TAKEN 2013360: f0 0f 60 0e ldub [ %i5 + 0xe ], %i0 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013364: de 0f 60 05 ldub [ %i5 + 5 ], %o7 2013368: f0 07 60 34 ld [ %i5 + 0x34 ], %i0 201336c: 92 00 bf fe add %g2, -2, %o1 2013370: 93 2a 40 0f sll %o1, %o7, %o1 2013374: 10 bf ff d9 b 20132d8 2013378: 92 02 40 18 add %o1, %i0, %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; } 201337c: 81 c7 e0 08 ret <== NOT EXECUTED 2013380: 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) || 2013384: 80 a6 80 02 cmp %i2, %g2 2013388: 28 bf ff b7 bleu,a 2013264 201338c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2013390: 10 bf ff b4 b 2013260 2013394: b6 20 40 1a sub %g1, %i2, %i3 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013398: 80 a0 60 00 cmp %g1, 0 201339c: 32 bf ff b6 bne,a 2013274 <== NEVER TAKEN 20133a0: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 20133a4: c2 0f 60 0e ldub [ %i5 + 0xe ], %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)) && 20133a8: 80 88 60 03 btst 3, %g1 20133ac: 22 bf ff b2 be,a 2013274 20133b0: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(fs_info, fat_fd->cln); 20133b4: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 fat_cluster_num_to_sector_num( const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) 20133b8: 80 a0 60 00 cmp %g1, 0 20133bc: 32 80 00 12 bne,a 2013404 <== NEVER TAKEN 20133c0: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20133c4: d2 07 60 20 ld [ %i5 + 0x20 ], %o1 sec += (start >> fs_info->vol.sec_log2); 20133c8: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 20133cc: d4 17 40 00 lduh [ %i5 ], %o2 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(fs_info, fat_fd->cln); sec += (start >> fs_info->vol.sec_log2); 20133d0: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 20133d4: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_read(fs_info, sec, byte, count, buf); 20133d8: 90 10 00 1d mov %i5, %o0 20133dc: 92 02 40 01 add %o1, %g1, %o1 20133e0: 94 0e 80 0a and %i2, %o2, %o2 20133e4: 96 10 00 1b mov %i3, %o3 20133e8: 40 00 02 e9 call 2013f8c <_fat_block_read> 20133ec: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 20133f0: b0 92 20 00 orcc %o0, 0, %i0 20133f4: 16 80 00 11 bge 2013438 <== ALWAYS TAKEN 20133f8: 01 00 00 00 nop sec += (ofs >> fs_info->vol.sec_log2); byte = ofs & (fs_info->vol.bps - 1); ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; 20133fc: 81 c7 e0 08 ret <== NOT EXECUTED 2013400: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2013404: c4 07 60 34 ld [ %i5 + 0x34 ], %g2 <== NOT EXECUTED 2013408: 92 00 7f fe add %g1, -2, %o1 <== NOT EXECUTED 201340c: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 2013410: 10 bf ff ee b 20133c8 <== NOT EXECUTED 2013414: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED 2013418: 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); 201341c: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2013420: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2013424: e6 26 60 38 st %l3, [ %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); 2013428: a2 06 80 11 add %i2, %l1, %l1 201342c: 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 + 2013430: a4 04 40 12 add %l1, %l2, %l2 2013434: e4 26 60 34 st %l2, [ %i1 + 0x34 ] 2013438: 81 c7 e0 08 ret 201343c: 81 e8 00 00 restore =============================================================================== 02013c34 : int fat_file_size( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013c34: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; uint32_t cur_cln = fat_fd->cln; 2013c38: f8 06 60 1c ld [ %i1 + 0x1c ], %i4 uint32_t save_cln = 0; /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013c3c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013c40: 80 a0 60 01 cmp %g1, 1 2013c44: 02 80 00 21 be 2013cc8 2013c48: f8 27 bf fc st %i4, [ %fp + -4 ] return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2013c4c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2013c50: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2013c54: 84 0f 00 02 and %i4, %g2, %g2 2013c58: 80 a0 80 01 cmp %g2, %g1 2013c5c: 0a 80 00 0e bcs 2013c94 <== ALWAYS TAKEN 2013c60: c0 26 60 18 clr [ %i1 + 0x18 ] fat_file_fd_t *fat_fd ) { int rc = RC_OK; uint32_t cur_cln = fat_fd->cln; uint32_t save_cln = 0; 2013c64: 10 80 00 15 b 2013cb8 <== NOT EXECUTED 2013c68: b8 10 20 00 clr %i4 <== NOT EXECUTED save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; 2013c6c: f6 06 60 18 ld [ %i1 + 0x18 ], %i3 return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2013c70: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 2013c74: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 2013c78: c2 07 bf fc ld [ %fp + -4 ], %g1 save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; 2013c7c: 88 06 c0 04 add %i3, %g4, %g4 return rc; } fat_fd->fat_file_size = 0; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2013c80: 86 08 40 03 and %g1, %g3, %g3 2013c84: 80 a0 c0 02 cmp %g3, %g2 2013c88: 1a 80 00 0c bcc 2013cb8 <== ALWAYS TAKEN 2013c8c: c8 26 60 18 st %g4, [ %i1 + 0x18 ] 2013c90: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED { save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013c94: 92 10 00 1c mov %i4, %o1 2013c98: 90 10 00 18 mov %i0, %o0 2013c9c: 40 00 19 e5 call 201a430 2013ca0: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 2013ca4: 80 a2 20 00 cmp %o0, 0 2013ca8: 22 bf ff f1 be,a 2013c6c <== ALWAYS TAKEN 2013cac: c8 16 20 06 lduh [ %i0 + 6 ], %g4 fat_fd->fat_file_size += fs_info->vol.bpc; } fat_fd->map.last_cln = save_cln; return rc; } 2013cb0: 81 c7 e0 08 ret <== NOT EXECUTED 2013cb4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED if ( rc != RC_OK ) return rc; fat_fd->fat_file_size += fs_info->vol.bpc; } fat_fd->map.last_cln = save_cln; 2013cb8: 90 10 20 00 clr %o0 2013cbc: f8 26 60 3c st %i4, [ %i1 + 0x3c ] return rc; } 2013cc0: 81 c7 e0 08 ret 2013cc4: 91 e8 00 08 restore %g0, %o0, %o0 int rc = RC_OK; 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)) && 2013cc8: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 2013ccc: 80 a0 60 00 cmp %g1, 0 2013cd0: 32 bf ff e0 bne,a 2013c50 <== NEVER TAKEN 2013cd4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2013cd8: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 int rc = RC_OK; 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)) && 2013cdc: 80 88 60 03 btst 3, %g1 2013ce0: 22 bf ff dc be,a 2013c50 <== ALWAYS TAKEN 2013ce4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { fat_fd->fat_file_size = fs_info->vol.rdir_size; 2013ce8: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 <== NOT EXECUTED return rc; 2013cec: 90 10 20 00 clr %o0 <== NOT EXECUTED /* Have we requested root dir size for FAT12/16? */ if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { fat_fd->fat_file_size = fs_info->vol.rdir_size; 2013cf0: 10 bf ff f0 b 2013cb0 <== NOT EXECUTED 2013cf4: c2 26 60 18 st %g1, [ %i1 + 0x18 ] <== NOT EXECUTED =============================================================================== 02013440 : fat_file_truncate( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t new_length ) { 2013440: 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 ) 2013444: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 ) { int rc = RC_OK; uint32_t cur_cln = 0; uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; 2013448: 84 10 3f ff mov -1, %g2 fat_file_fd_t *fat_fd, uint32_t new_length ) { int rc = RC_OK; uint32_t cur_cln = 0; 201344c: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; if ( new_length >= fat_fd->fat_file_size ) 2013450: 80 a0 40 1a cmp %g1, %i2 2013454: 08 80 00 26 bleu 20134ec 2013458: c4 27 bf fc st %g2, [ %fp + -4 ] return rc; assert(fat_fd->fat_file_size); 201345c: 80 a0 60 00 cmp %g1, 0 2013460: 02 80 00 31 be 2013524 <== NEVER TAKEN 2013464: 11 00 80 af sethi %hi(0x202bc00), %o0 cl_start = (new_length + fs_info->vol.bpc - 1) >> fs_info->vol.bpc_log2; 2013468: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 201346c: c6 16 20 06 lduh [ %i0 + 6 ], %g3 2013470: 86 00 ff ff add %g3, -1, %g3 2013474: b4 00 c0 1a add %g3, %i2, %i2 2013478: b5 36 80 02 srl %i2, %g2, %i2 if ((cl_start << fs_info->vol.bpc_log2) >= fat_fd->fat_file_size) 201347c: 85 2e 80 02 sll %i2, %g2, %g2 2013480: 80 a0 40 02 cmp %g1, %g2 2013484: 08 80 00 1a bleu 20134ec 2013488: 80 a6 a0 00 cmp %i2, 0 return RC_OK; if (cl_start != 0) 201348c: 02 80 00 09 be 20134b0 2013490: 90 10 00 18 mov %i0, %o0 { rc = fat_file_lseek(fs_info, fat_fd, cl_start - 1, &new_last_cln); 2013494: 92 10 00 19 mov %i1, %o1 2013498: 94 06 bf ff add %i2, -1, %o2 201349c: 7f ff fe 81 call 2012ea0 20134a0: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 20134a4: 80 a2 60 00 cmp %o1, 0 20134a8: 12 80 00 12 bne 20134f0 <== NEVER TAKEN 20134ac: 90 10 00 18 mov %i0, %o0 return rc; } rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 20134b0: 92 10 00 19 mov %i1, %o1 20134b4: 94 10 00 1a mov %i2, %o2 20134b8: 7f ff fe 7a call 2012ea0 20134bc: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 20134c0: 80 a2 60 00 cmp %o1, 0 20134c4: 12 80 00 0b bne 20134f0 <== NEVER TAKEN 20134c8: 01 00 00 00 nop return rc; rc = fat_free_fat_clusters_chain(fs_info, cur_cln); 20134cc: d2 07 bf f8 ld [ %fp + -8 ], %o1 20134d0: 40 00 1d 0e call 201a908 20134d4: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) 20134d8: 92 92 20 00 orcc %o0, 0, %o1 20134dc: 12 80 00 05 bne 20134f0 <== NEVER TAKEN 20134e0: 80 a6 a0 00 cmp %i2, 0 return rc; if (cl_start != 0) 20134e4: 12 80 00 05 bne 20134f8 20134e8: d2 07 bf fc ld [ %fp + -4 ], %o1 uint32_t cl_start = 0; uint32_t new_last_cln = FAT_UNDEFINED_VALUE; if ( new_length >= fat_fd->fat_file_size ) return rc; 20134ec: 92 10 20 00 clr %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; } 20134f0: 81 c7 e0 08 ret 20134f4: 91 e8 00 09 restore %g0, %o1, %o0 if (rc != RC_OK) return rc; if (cl_start != 0) { rc = fat_set_fat_cluster(fs_info, new_last_cln, FAT_GENFAT_EOC); 20134f8: 90 10 00 18 mov %i0, %o0 20134fc: 40 00 1c 51 call 201a640 2013500: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 2013504: 92 92 20 00 orcc %o0, 0, %o1 2013508: 12 bf ff fa bne 20134f0 <== NEVER TAKEN 201350c: c2 07 bf fc ld [ %fp + -4 ], %g1 return rc; fat_fd->map.file_cln = cl_start - 1; 2013510: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = new_last_cln; 2013514: c2 26 60 38 st %g1, [ %i1 + 0x38 ] if (cl_start != 0) { rc = fat_set_fat_cluster(fs_info, new_last_cln, FAT_GENFAT_EOC); if ( rc != RC_OK ) return rc; fat_fd->map.file_cln = cl_start - 1; 2013518: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; 201351c: 10 bf ff f5 b 20134f0 2013520: c2 26 60 3c st %g1, [ %i1 + 0x3c ] if ( new_length >= fat_fd->fat_file_size ) return rc; assert(fat_fd->fat_file_size); 2013524: 15 00 80 af sethi %hi(0x202bc00), %o2 <== NOT EXECUTED 2013528: 17 00 80 af sethi %hi(0x202bc00), %o3 <== NOT EXECUTED 201352c: 90 12 22 10 or %o0, 0x210, %o0 <== NOT EXECUTED 2013530: 92 10 22 d1 mov 0x2d1, %o1 <== NOT EXECUTED 2013534: 94 12 a2 70 or %o2, 0x270, %o2 <== NOT EXECUTED 2013538: 40 00 08 c9 call 201585c <__assert_func> <== NOT EXECUTED 201353c: 96 12 e2 58 or %o3, 0x258, %o3 <== NOT EXECUTED =============================================================================== 02013924 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 2013924: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t ret; uint32_t cmpltd = 0; uint32_t byte; uint32_t c = 0; 2013928: c0 27 bf f8 clr [ %fp + -8 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 201392c: a0 10 00 18 mov %i0, %l0 int rc = RC_OK; ssize_t ret; uint32_t cmpltd = 0; uint32_t byte; uint32_t c = 0; bool zero_fill = start > fat_fd->fat_file_size; 2013930: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t file_cln_initial = fat_fd->map.file_cln; 2013934: e4 06 60 34 ld [ %i1 + 0x34 ], %l2 uint32_t cln; if ( count == 0 ) 2013938: 80 a6 e0 00 cmp %i3, 0 201393c: 02 80 00 5d be 2013ab0 <== NEVER TAKEN 2013940: b0 10 20 00 clr %i0 return cmpltd; if (start >= fat_fd->size_limit) 2013944: fa 06 60 14 ld [ %i1 + 0x14 ], %i5 2013948: 80 a6 80 1d cmp %i2, %i5 201394c: 1a 80 00 89 bcc 2013b70 <== NEVER TAKEN 2013950: ba 27 40 1a sub %i5, %i2, %i5 2013954: 80 a7 40 1b cmp %i5, %i3 int rc = RC_OK; ssize_t ret; uint32_t cmpltd = 0; uint32_t byte; uint32_t c = 0; bool zero_fill = start > fat_fd->fat_file_size; 2013958: 18 80 00 58 bgu 2013ab8 <== ALWAYS TAKEN 201395c: 80 a0 40 1a cmp %g1, %i2 rtems_set_errno_and_return_minus_one(EFBIG); if (count > fat_fd->size_limit - start) count = fat_fd->size_limit - start; rc = fat_file_extend(fs_info, fat_fd, zero_fill, start + count, &c); 2013960: b6 07 40 1a add %i5, %i2, %i3 <== NOT EXECUTED 2013964: 94 40 20 00 addx %g0, 0, %o2 <== NOT EXECUTED 2013968: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED 201396c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2013970: 96 10 00 1b mov %i3, %o3 <== NOT EXECUTED 2013974: 7f ff ff 57 call 20136d0 <== NOT EXECUTED 2013978: 98 07 bf f8 add %fp, -8, %o4 <== NOT EXECUTED if (RC_OK == rc) 201397c: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2013980: 12 80 00 4c bne 2013ab0 <== NOT EXECUTED 2013984: c2 07 bf f8 ld [ %fp + -8 ], %g1 <== NOT EXECUTED { /* * check whether there was enough room on device to locate * file of 'start + count' bytes */ if (c != (start + count)) 2013988: 80 a6 c0 01 cmp %i3, %g1 <== NOT EXECUTED 201398c: 32 80 00 02 bne,a 2013994 <== NEVER TAKEN 2013990: ba 20 40 1a sub %g1, %i2, %i5 <== NOT EXECUTED */ static bool fat_is_fat12_or_fat16_root_dir (const fat_file_fd_t *fat_fd, const uint8_t volume_type) { return (FAT_FD_OF_ROOT_DIR(fat_fd)) && (volume_type & (FAT_FAT12 | FAT_FAT16)); 2013994: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013998: 80 a0 60 01 cmp %g1, 1 201399c: 02 80 00 5b be 2013b08 20139a0: c4 0c 20 0e ldub [ %l0 + 0xe ], %g2 { int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ uint32_t start_cln = start >> fs_info->vol.bpc_log2; 20139a4: f6 0c 20 08 ldub [ %l0 + 8 ], %i3 const uint8_t *buf, const uint32_t file_cln_initial) { int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; 20139a8: c0 27 bf fc clr [ %fp + -4 ] uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ uint32_t start_cln = start >> fs_info->vol.bpc_log2; 20139ac: ab 36 80 1b srl %i2, %i3, %l5 uint32_t file_cln_cnt; ssize_t ret; uint32_t c; bool overwrite_cluster = false; rc = fat_file_lseek(fs_info, fat_fd, start_cln, &cur_cln); 20139b0: 90 10 00 10 mov %l0, %o0 20139b4: 92 10 00 19 mov %i1, %o1 20139b8: 94 10 00 15 mov %l5, %o2 20139bc: 7f ff fd 39 call 2012ea0 20139c0: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 20139c4: 80 a2 60 00 cmp %o1, 0 20139c8: 12 80 00 38 bne 2013aa8 <== NEVER TAKEN 20139cc: b0 92 60 00 orcc %o1, 0, %i0 { file_cln_cnt = cur_cln - fat_fd->cln; 20139d0: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 20139d4: ec 07 bf fc ld [ %fp + -4 ], %l6 int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ uint32_t start_cln = start >> fs_info->vol.bpc_log2; uint32_t ofs_cln = start - (start_cln << fs_info->vol.bpc_log2); 20139d8: b7 2d 40 1b sll %l5, %i3, %i3 bool overwrite_cluster = false; rc = fat_file_lseek(fs_info, fat_fd, start_cln, &cur_cln); if (RC_OK == rc) { file_cln_cnt = cur_cln - fat_fd->cln; 20139dc: ac 25 80 01 sub %l6, %g1, %l6 int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ uint32_t start_cln = start >> fs_info->vol.bpc_log2; uint32_t ofs_cln = start - (start_cln << fs_info->vol.bpc_log2); 20139e0: b4 26 80 1b sub %i2, %i3, %i2 bool overwrite_cluster = false; rc = fat_file_lseek(fs_info, fat_fd, start_cln, &cur_cln); if (RC_OK == rc) { file_cln_cnt = cur_cln - fat_fd->cln; 20139e4: b0 10 20 00 clr %i0 int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ uint32_t start_cln = start >> fs_info->vol.bpc_log2; uint32_t ofs_cln = start - (start_cln << fs_info->vol.bpc_log2); 20139e8: a2 10 00 1a mov %i2, %l1 uint32_t ofs_cln_save = ofs_cln; uint32_t bytes_to_write = count; uint32_t file_cln_cnt; ssize_t ret; uint32_t c; bool overwrite_cluster = false; 20139ec: a6 10 20 00 clr %l3 const uint32_t file_cln_initial) { int rc = RC_OK; uint32_t cmpltd = 0; uint32_t cur_cln = 0; uint32_t save_cln = 0; /* FIXME: This might be incorrect, cf. below */ 20139f0: a8 10 20 00 clr %l4 const uint32_t count, const uint8_t *buf, const uint32_t file_cln_initial) { int rc = RC_OK; uint32_t cmpltd = 0; 20139f4: b6 10 20 00 clr %i3 rc = fat_file_lseek(fs_info, fat_fd, start_cln, &cur_cln); if (RC_OK == rc) { file_cln_cnt = cur_cln - fat_fd->cln; while ( (RC_OK == rc) 20139f8: 80 a7 60 00 cmp %i5, 0 20139fc: 22 80 00 21 be,a 2013a80 <== NEVER TAKEN 2013a00: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 <== NOT EXECUTED 2013a04: 80 a6 20 00 cmp %i0, 0 2013a08: 32 80 00 1e bne,a 2013a80 <== NEVER TAKEN 2013a0c: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 <== NOT EXECUTED && (bytes_to_write > 0)) { c = MIN(bytes_to_write, (fs_info->vol.bpc - ofs_cln)); 2013a10: d6 14 20 06 lduh [ %l0 + 6 ], %o3 2013a14: 96 22 c0 11 sub %o3, %l1, %o3 2013a18: 80 a2 c0 1d cmp %o3, %i5 2013a1c: 38 80 00 02 bgu,a 2013a24 2013a20: 96 10 00 1d mov %i5, %o3 if (file_cln_initial < file_cln_cnt) 2013a24: 80 a4 80 16 cmp %l2, %l6 2013a28: 2a 80 00 02 bcs,a 2013a30 2013a2c: a6 10 20 01 mov 1, %l3 overwrite_cluster = true; ret = fat_cluster_write(fs_info, 2013a30: d2 07 bf fc ld [ %fp + -4 ], %o1 2013a34: 90 10 00 10 mov %l0, %o0 2013a38: 94 10 00 11 mov %l1, %o2 2013a3c: 98 07 00 1b add %i4, %i3, %o4 2013a40: 9a 0c e0 01 and %l3, 1, %o5 2013a44: 40 00 01 fe call 201423c 2013a48: b0 10 3f ff mov -1, %i0 cur_cln, ofs_cln, c, &buf[cmpltd], overwrite_cluster); if (0 > ret) 2013a4c: 80 a2 20 00 cmp %o0, 0 2013a50: 06 bf ff eb bl 20139fc <== NEVER TAKEN 2013a54: 80 a7 60 00 cmp %i5, 0 rc = -1; if (RC_OK == rc) { ++file_cln_cnt; 2013a58: ac 05 a0 01 inc %l6 bytes_to_write -= ret; cmpltd += ret; 2013a5c: b6 06 c0 08 add %i3, %o0, %i3 save_cln = cur_cln; if (0 < bytes_to_write) 2013a60: ba a7 40 08 subcc %i5, %o0, %i5 2013a64: 12 80 00 22 bne 2013aec 2013a68: e8 07 bf fc ld [ %fp + -4 ], %l4 2013a6c: b0 10 20 00 clr %i0 rc = fat_file_lseek(fs_info, fat_fd, start_cln, &cur_cln); if (RC_OK == rc) { file_cln_cnt = cur_cln - fat_fd->cln; while ( (RC_OK == rc) 2013a70: 80 a7 60 00 cmp %i5, 0 2013a74: 12 bf ff e4 bne 2013a04 <== NEVER TAKEN 2013a78: a2 10 20 00 clr %l1 } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = start_cln + ((ofs_cln_save + cmpltd - 1) >> fs_info->vol.bpc_log2); 2013a7c: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 2013a80: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2013a84: e8 26 60 38 st %l4, [ %i1 + 0x38 ] } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = start_cln + ((ofs_cln_save + cmpltd - 1) >> fs_info->vol.bpc_log2); 2013a88: b4 06 80 1b add %i2, %i3, %i2 2013a8c: b5 36 80 01 srl %i2, %g1, %i2 } } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = start_cln + 2013a90: aa 06 80 15 add %i2, %l5, %l5 ((ofs_cln_save + cmpltd - 1) >> fs_info->vol.bpc_log2); fat_fd->map.disk_cln = save_cln; } if (RC_OK != rc) 2013a94: 92 96 20 00 orcc %i0, 0, %o1 2013a98: 12 80 00 03 bne 2013aa4 <== NEVER TAKEN 2013a9c: ea 26 60 34 st %l5, [ %i1 + 0x34 ] return rc; else return cmpltd; 2013aa0: 92 10 00 1b mov %i3, %o1 fat_fd, start, count, buf, file_cln_initial); if (0 > ret) 2013aa4: b0 92 60 00 orcc %o1, 0, %i0 2013aa8: 06 80 00 30 bl 2013b68 <== NEVER TAKEN 2013aac: 01 00 00 00 nop } if (RC_OK != rc) return rc; else return cmpltd; } 2013ab0: 81 c7 e0 08 ret 2013ab4: 81 e8 00 00 restore 2013ab8: ba 10 00 1b mov %i3, %i5 rtems_set_errno_and_return_minus_one(EFBIG); if (count > fat_fd->size_limit - start) count = fat_fd->size_limit - start; rc = fat_file_extend(fs_info, fat_fd, zero_fill, start + count, &c); 2013abc: 94 40 20 00 addx %g0, 0, %o2 2013ac0: b6 07 40 1a add %i5, %i2, %i3 2013ac4: 90 10 00 10 mov %l0, %o0 2013ac8: 92 10 00 19 mov %i1, %o1 2013acc: 96 10 00 1b mov %i3, %o3 2013ad0: 7f ff ff 00 call 20136d0 2013ad4: 98 07 bf f8 add %fp, -8, %o4 if (RC_OK == rc) 2013ad8: b0 92 20 00 orcc %o0, 0, %i0 2013adc: 12 bf ff f5 bne 2013ab0 2013ae0: c2 07 bf f8 ld [ %fp + -8 ], %g1 { /* * check whether there was enough room on device to locate * file of 'start + count' bytes */ if (c != (start + count)) 2013ae4: 10 bf ff aa b 201398c 2013ae8: 80 a6 c0 01 cmp %i3, %g1 ++file_cln_cnt; bytes_to_write -= ret; cmpltd += ret; save_cln = cur_cln; if (0 < bytes_to_write) rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013aec: 90 10 00 10 mov %l0, %o0 2013af0: 92 10 00 14 mov %l4, %o1 2013af4: 94 07 bf fc add %fp, -4, %o2 2013af8: 40 00 1a 4e call 201a430 2013afc: a2 10 20 00 clr %l1 2013b00: 10 bf ff be b 20139f8 2013b04: b0 10 00 08 mov %o0, %i0 */ static bool fat_is_fat12_or_fat16_root_dir (const fat_file_fd_t *fat_fd, const uint8_t volume_type) { return (FAT_FD_OF_ROOT_DIR(fat_fd)) && (volume_type & (FAT_FAT12 | FAT_FAT16)); 2013b08: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 2013b0c: 80 a0 60 00 cmp %g1, 0 2013b10: 32 bf ff a6 bne,a 20139a8 <== NEVER TAKEN 2013b14: f6 0c 20 08 ldub [ %l0 + 8 ], %i3 <== NOT EXECUTED 2013b18: 80 88 a0 03 btst 3, %g2 2013b1c: 22 bf ff a3 be,a 20139a8 2013b20: f6 0c 20 08 ldub [ %l0 + 8 ], %i3 count = c - start; /* for the root directory of FAT12 and FAT16 we need this special handling */ if (fat_is_fat12_or_fat16_root_dir(fat_fd, fs_info->vol.type)) { cln = fat_fd->cln; 2013b24: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 cln += (start >> fs_info->vol.bpc_log2); 2013b28: d2 0c 20 08 ldub [ %l0 + 8 ], %o1 byte = start & (fs_info->vol.bpc -1); 2013b2c: d4 14 20 06 lduh [ %l0 + 6 ], %o2 /* for the root directory of FAT12 and FAT16 we need this special handling */ if (fat_is_fat12_or_fat16_root_dir(fat_fd, fs_info->vol.type)) { cln = fat_fd->cln; cln += (start >> fs_info->vol.bpc_log2); 2013b30: 93 36 80 09 srl %i2, %o1, %o1 byte = start & (fs_info->vol.bpc -1); 2013b34: 94 02 bf ff add %o2, -1, %o2 ret = fat_cluster_write(fs_info, 2013b38: 90 10 00 10 mov %l0, %o0 2013b3c: 92 02 40 01 add %o1, %g1, %o1 2013b40: 94 0e 80 0a and %i2, %o2, %o2 2013b44: 96 10 00 1d mov %i5, %o3 2013b48: 98 10 00 1c mov %i4, %o4 2013b4c: 40 00 01 bc call 201423c 2013b50: 9a 10 20 00 clr %o5 cln, byte, count, buf, false); if (0 > ret) 2013b54: 80 a2 20 00 cmp %o0, 0 2013b58: 06 80 00 04 bl 2013b68 <== NEVER TAKEN 2013b5c: 01 00 00 00 nop rc = -1; else cmpltd = ret; 2013b60: 81 c7 e0 08 ret 2013b64: 91 e8 00 08 restore %g0, %o0, %o0 start, count, buf, file_cln_initial); if (0 > ret) rc = -1; 2013b68: 81 c7 e0 08 ret <== NOT EXECUTED 2013b6c: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED if ( count == 0 ) return cmpltd; if (start >= fat_fd->size_limit) rtems_set_errno_and_return_minus_one(EFBIG); 2013b70: 40 00 21 ab call 201c21c <__errno> <== NOT EXECUTED 2013b74: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013b78: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED 2013b7c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013b80: 81 c7 e0 08 ret <== NOT EXECUTED 2013b84: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201a908 : int fat_free_fat_clusters_chain( fat_fs_info_t *fs_info, uint32_t chain ) { 201a908: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK, rc1 = RC_OK; 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) 201a90c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 201a910: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 uint32_t chain ) { int rc = RC_OK, rc1 = RC_OK; uint32_t cur_cln = chain; uint32_t next_cln = 0; 201a914: 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) 201a918: 84 0e 40 02 and %i1, %g2, %g2 201a91c: 80 a0 80 01 cmp %g2, %g1 201a920: 1a 80 00 25 bcc 201a9b4 <== NEVER TAKEN 201a924: ba 10 00 18 mov %i0, %i5 201a928: b8 10 00 19 mov %i1, %i4 201a92c: b6 10 20 00 clr %i3 201a930: 10 80 00 0e b 201a968 201a934: b4 10 20 00 clr %i2 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(fs_info, cur_cln, FAT_GENFAT_FREE); 201a938: 7f ff ff 42 call 201a640 201a93c: 01 00 00 00 nop if ( rc != RC_OK ) 201a940: 80 a2 20 00 cmp %o0, 0 201a944: 02 80 00 03 be 201a950 <== ALWAYS TAKEN 201a948: f8 07 bf fc ld [ %fp + -4 ], %i4 201a94c: b4 10 00 08 mov %o0, %i2 <== NOT EXECUTED int rc = RC_OK, rc1 = RC_OK; 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) 201a950: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 201a954: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 201a958: 84 0f 00 02 and %i4, %g2, %g2 201a95c: 80 a0 80 01 cmp %g2, %g1 201a960: 1a 80 00 17 bcc 201a9bc 201a964: b6 06 e0 01 inc %i3 { rc = fat_get_fat_cluster(fs_info, cur_cln, &next_cln); 201a968: 92 10 00 1c mov %i4, %o1 201a96c: 94 07 bf fc add %fp, -4, %o2 201a970: 7f ff fe b0 call 201a430 201a974: 90 10 00 1d mov %i5, %o0 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(fs_info, cur_cln, FAT_GENFAT_FREE); 201a978: 92 10 00 1c mov %i4, %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(fs_info, cur_cln, &next_cln); 201a97c: b0 10 00 08 mov %o0, %i0 fat_buf_release(fs_info); return rc; } rc = fat_set_fat_cluster(fs_info, cur_cln, FAT_GENFAT_FREE); 201a980: 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(fs_info, cur_cln, &next_cln); if ( rc != RC_OK ) 201a984: 80 a6 20 00 cmp %i0, 0 201a988: 02 bf ff ec be 201a938 <== ALWAYS TAKEN 201a98c: 90 10 00 1d mov %i5, %o0 { if(fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201a990: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 <== NOT EXECUTED 201a994: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201a998: 02 80 00 03 be 201a9a4 <== NOT EXECUTED 201a99c: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED fs_info->vol.free_cls += freed_cls_cnt; 201a9a0: c2 27 60 44 st %g1, [ %i5 + 0x44 ] <== NOT EXECUTED fat_buf_release(fs_info); 201a9a4: 7f ff e4 d5 call 2013cf8 <== NOT EXECUTED 201a9a8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201a9ac: 81 c7 e0 08 ret <== NOT EXECUTED 201a9b0: 81 e8 00 00 restore <== NOT EXECUTED ) { int rc = RC_OK, rc1 = RC_OK; uint32_t cur_cln = chain; uint32_t next_cln = 0; uint32_t freed_cls_cnt = 0; 201a9b4: b6 10 20 00 clr %i3 <== NOT EXECUTED fat_free_fat_clusters_chain( fat_fs_info_t *fs_info, uint32_t chain ) { int rc = RC_OK, rc1 = RC_OK; 201a9b8: b4 10 20 00 clr %i2 <== NOT EXECUTED freed_cls_cnt++; cur_cln = next_cln; } fs_info->vol.next_cl = chain; if (fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201a9bc: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 201a9c0: 80 a0 7f ff cmp %g1, -1 201a9c4: 02 80 00 04 be 201a9d4 <== ALWAYS TAKEN 201a9c8: f2 27 60 4c st %i1, [ %i5 + 0x4c ] fs_info->vol.free_cls += freed_cls_cnt; 201a9cc: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED 201a9d0: c2 27 60 44 st %g1, [ %i5 + 0x44 ] <== NOT EXECUTED fat_buf_release(fs_info); 201a9d4: b0 10 00 1a mov %i2, %i0 201a9d8: 7f ff e4 c8 call 2013cf8 201a9dc: 90 10 00 1d mov %i5, %o0 if (rc1 != RC_OK) return rc1; return RC_OK; } 201a9e0: 81 c7 e0 08 ret 201a9e4: 81 e8 00 00 restore =============================================================================== 02014f5c : fat_free_unique_ino( fat_fs_info_t *fs_info, uint32_t ino ) { FAT_SET_UNIQ_INO_FREE((ino - fs_info->uino_base), fs_info->uino); 2014f5c: c4 02 20 80 ld [ %o0 + 0x80 ], %g2 <== NOT EXECUTED 2014f60: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 <== NOT EXECUTED 2014f64: 92 22 40 02 sub %o1, %g2, %o1 <== NOT EXECUTED 2014f68: 85 32 60 03 srl %o1, 3, %g2 <== NOT EXECUTED 2014f6c: c6 08 40 02 ldub [ %g1 + %g2 ], %g3 <== NOT EXECUTED 2014f70: 92 0a 60 07 and %o1, 7, %o1 <== NOT EXECUTED 2014f74: 88 10 20 01 mov 1, %g4 <== NOT EXECUTED 2014f78: 93 29 00 09 sll %g4, %o1, %o1 <== NOT EXECUTED 2014f7c: 92 28 c0 09 andn %g3, %o1, %o1 <== NOT EXECUTED 2014f80: 81 c3 e0 08 retl <== NOT EXECUTED 2014f84: d2 28 40 02 stb %o1, [ %g1 + %g2 ] <== NOT EXECUTED =============================================================================== 0201a430 : fat_get_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t *ret_val ) { 201a430: 9d e3 bf 98 save %sp, -104, %sp uint8_t *sec_buf; uint32_t sec = 0; uint32_t ofs = 0; /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201a434: 80 a6 60 01 cmp %i1, 1 201a438: 08 80 00 27 bleu 201a4d4 <== NEVER TAKEN 201a43c: ba 10 00 18 mov %i0, %i5 201a440: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 201a444: 82 00 60 01 inc %g1 201a448: 80 a6 40 01 cmp %i1, %g1 201a44c: 18 80 00 22 bgu 201a4d4 <== NEVER TAKEN 201a450: 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) + 201a454: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 201a458: 80 88 60 01 btst 1, %g1 201a45c: 12 80 00 24 bne 201a4ec 201a460: f6 0e 20 02 ldub [ %i0 + 2 ], %i3 201a464: 82 08 60 02 and %g1, 2, %g1 201a468: 80 88 60 ff btst 0xff, %g1 201a46c: 02 80 00 30 be 201a52c 201a470: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201a474: b9 2e 60 01 sll %i1, 1, %i4 201a478: b7 37 00 1b srl %i4, %i3, %i3 201a47c: 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); 201a480: e0 17 40 00 lduh [ %i5 ], %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); 201a484: 90 10 00 1d mov %i5, %o0 201a488: 92 10 00 1b mov %i3, %o1 201a48c: 94 10 20 01 mov 1, %o2 201a490: 7f ff e6 91 call 2013ed4 201a494: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201a498: b0 92 20 00 orcc %o0, 0, %i0 201a49c: 12 80 00 57 bne 201a5f8 <== NEVER TAKEN 201a4a0: 01 00 00 00 nop return rc; switch ( fs_info->vol.type ) 201a4a4: c2 0f 60 0e ldub [ %i5 + 0xe ], %g1 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); 201a4a8: a1 2c 20 10 sll %l0, 0x10, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201a4ac: 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); 201a4b0: a1 34 20 10 srl %l0, 0x10, %l0 201a4b4: a0 04 3f ff add %l0, -1, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201a4b8: 02 80 00 21 be 201a53c 201a4bc: b8 0f 00 10 and %i4, %l0, %i4 201a4c0: 80 a0 60 04 cmp %g1, 4 201a4c4: 02 80 00 3c be 201a5b4 201a4c8: 80 a0 60 01 cmp %g1, 1 201a4cc: 02 80 00 28 be 201a56c <== ALWAYS TAKEN 201a4d0: c4 07 bf fc ld [ %fp + -4 ], %g2 *ret_val = *((uint32_t *)(sec_buf + ofs)); *ret_val = CF_LE_L(*ret_val); break; default: rtems_set_errno_and_return_minus_one(EIO); 201a4d4: 40 00 07 52 call 201c21c <__errno> <== NOT EXECUTED 201a4d8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201a4dc: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201a4e0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201a4e4: 81 c7 e0 08 ret <== NOT EXECUTED 201a4e8: 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) + 201a4ec: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201a4f0: 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); 201a4f4: 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) + 201a4f8: 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, &sec_buf); 201a4fc: 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) + 201a500: 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, &sec_buf); 201a504: 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) + 201a508: 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, &sec_buf); 201a50c: 96 07 bf fc add %fp, -4, %o3 201a510: 7f ff e6 71 call 2013ed4 201a514: 92 10 00 1b mov %i3, %o1 if (rc != RC_OK) 201a518: b0 92 20 00 orcc %o0, 0, %i0 201a51c: 22 bf ff e3 be,a 201a4a8 <== ALWAYS TAKEN 201a520: c2 0f 60 0e ldub [ %i5 + 0xe ], %g1 rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201a524: 81 c7 e0 08 ret <== NOT EXECUTED 201a528: 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) + 201a52c: b9 2e 60 02 sll %i1, 2, %i4 201a530: b7 37 00 1b srl %i4, %i3, %i3 201a534: 10 bf ff d3 b 201a480 201a538: b6 06 c0 01 add %i3, %g1, %i3 else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(sec_buf + ofs)); 201a53c: c2 07 bf fc ld [ %fp + -4 ], %g1 *ret_val = CF_LE_W(*ret_val); 201a540: 07 00 00 3f sethi %hi(0xfc00), %g3 else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(sec_buf + ofs)); 201a544: c2 10 40 1c lduh [ %g1 + %i4 ], %g1 *ret_val = CF_LE_W(*ret_val); 201a548: 86 10 e3 ff or %g3, 0x3ff, %g3 201a54c: 83 28 60 10 sll %g1, 0x10, %g1 201a550: 85 30 60 18 srl %g1, 0x18, %g2 201a554: 83 30 60 08 srl %g1, 8, %g1 201a558: 82 08 40 03 and %g1, %g3, %g1 201a55c: 82 10 80 01 or %g2, %g1, %g1 201a560: c2 26 80 00 st %g1, [ %i2 ] break; 201a564: 81 c7 e0 08 ret 201a568: 81 e8 00 00 restore /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*(sec_buf + ofs)); if ( ofs == (fs_info->vol.bps - 1) ) 201a56c: 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 = (*(sec_buf + ofs)); 201a570: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 if ( ofs == (fs_info->vol.bps - 1) ) 201a574: 86 00 ff ff add %g3, -1, %g3 201a578: 80 a0 c0 1c cmp %g3, %i4 201a57c: 02 80 00 21 be 201a600 <== NEVER TAKEN 201a580: c2 26 80 00 st %g1, [ %i2 ] *ret_val |= *sec_buf << 8; } else { *ret_val |= *(sec_buf + ofs + 1) << 8; 201a584: b8 00 80 1c add %g2, %i4, %i4 201a588: c4 0f 20 01 ldub [ %i4 + 1 ], %g2 201a58c: 85 28 a0 08 sll %g2, 8, %g2 201a590: 82 10 80 01 or %g2, %g1, %g1 201a594: c2 26 80 00 st %g1, [ %i2 ] } if ( FAT_CLUSTER_IS_ODD(cln) ) 201a598: 80 8e 60 01 btst 1, %i1 201a59c: 22 80 00 16 be,a 201a5f4 201a5a0: 82 08 6f ff and %g1, 0xfff, %g1 *ret_val = (*ret_val) >> FAT12_SHIFT; 201a5a4: 83 30 60 04 srl %g1, 4, %g1 201a5a8: c2 26 80 00 st %g1, [ %i2 ] 201a5ac: 81 c7 e0 08 ret 201a5b0: 81 e8 00 00 restore *ret_val = *((uint16_t *)(sec_buf + ofs)); *ret_val = CF_LE_W(*ret_val); break; case FAT_FAT32: *ret_val = *((uint32_t *)(sec_buf + ofs)); 201a5b4: c2 07 bf fc ld [ %fp + -4 ], %g1 201a5b8: c2 00 40 1c ld [ %g1 + %i4 ], %g1 201a5bc: 89 28 60 18 sll %g1, 0x18, %g4 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201a5c0: 85 30 60 18 srl %g1, 0x18, %g2 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201a5c4: 87 30 60 08 srl %g1, 8, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a5c8: 84 11 00 02 or %g4, %g2, %g2 { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201a5cc: 86 08 e0 ff and %g3, 0xff, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201a5d0: 83 30 60 10 srl %g1, 0x10, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a5d4: 87 28 e0 10 sll %g3, 0x10, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201a5d8: 82 08 60 ff and %g1, 0xff, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a5dc: 84 10 80 03 or %g2, %g3, %g2 201a5e0: 83 28 60 08 sll %g1, 8, %g1 201a5e4: 82 10 80 01 or %g2, %g1, %g1 *ret_val = CF_LE_L(*ret_val); 201a5e8: c2 26 80 00 st %g1, [ %i2 ] break; 201a5ec: 81 c7 e0 08 ret 201a5f0: 81 e8 00 00 restore } if ( FAT_CLUSTER_IS_ODD(cln) ) *ret_val = (*ret_val) >> FAT12_SHIFT; else *ret_val = (*ret_val) & FAT_FAT12_MASK; 201a5f4: c2 26 80 00 st %g1, [ %i2 ] 201a5f8: 81 c7 e0 08 ret 201a5fc: 81 e8 00 00 restore * align problems for some architectures */ *ret_val = (*(sec_buf + ofs)); if ( ofs == (fs_info->vol.bps - 1) ) { rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, 201a600: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201a604: 92 06 e0 01 add %i3, 1, %o1 <== NOT EXECUTED 201a608: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201a60c: 7f ff e6 32 call 2013ed4 <== NOT EXECUTED 201a610: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201a614: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 201a618: 12 80 00 08 bne 201a638 <== NOT EXECUTED 201a61c: c4 07 bf fc ld [ %fp + -4 ], %g2 <== NOT EXECUTED return rc; *ret_val |= *sec_buf << 8; 201a620: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED 201a624: c4 08 80 00 ldub [ %g2 ], %g2 <== NOT EXECUTED 201a628: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 201a62c: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 201a630: 10 bf ff da b 201a598 <== NOT EXECUTED 201a634: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201a638: 81 c7 e0 08 ret <== NOT EXECUTED 201a63c: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02014e6c : * 0 means FAILED !!! * */ uint32_t fat_get_unique_ino(fat_fs_info_t *fs_info) { 2014e6c: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED 2014e70: fa 06 20 7c ld [ %i0 + 0x7c ], %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)) 2014e74: 33 03 ff ff sethi %hi(0xffffc00), %i1 <== NOT EXECUTED 2014e78: b2 16 63 ff or %i1, 0x3ff, %i1 ! fffffff <== NOT EXECUTED uint32_t j = 0; bool resrc_unsuff = false; while (!resrc_unsuff) { for (j = 0; j < fs_info->uino_pool_size; j++) 2014e7c: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED 2014e80: 22 80 00 20 be,a 2014f00 <== NOT EXECUTED 2014e84: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED { if (!FAT_UNIQ_INO_IS_BUSY(fs_info->index, fs_info->uino)) 2014e88: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 <== NOT EXECUTED 2014e8c: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 <== NOT EXECUTED 2014e90: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2014e94: c8 48 c0 02 ldsb [ %g3 + %g2 ], %g4 <== NOT EXECUTED 2014e98: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 2014e9c: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 2014ea0: 89 39 00 1c sra %g4, %i4, %g4 <== NOT EXECUTED 2014ea4: 80 89 20 01 btst 1, %g4 <== NOT EXECUTED 2014ea8: 02 80 00 1d be 2014f1c <== NOT EXECUTED 2014eac: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 <== NOT EXECUTED 2014eb0: 10 80 00 0a b 2014ed8 <== NOT EXECUTED 2014eb4: 88 10 20 00 clr %g4 <== NOT EXECUTED 2014eb8: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2014ebc: f6 48 c0 02 ldsb [ %g3 + %g2 ], %i3 <== NOT EXECUTED 2014ec0: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 2014ec4: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 2014ec8: b7 3e c0 1c sra %i3, %i4, %i3 <== NOT EXECUTED 2014ecc: 80 8e e0 01 btst 1, %i3 <== NOT EXECUTED 2014ed0: 02 80 00 13 be 2014f1c <== NOT EXECUTED 2014ed4: 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++; 2014ed8: 82 00 60 01 inc %g1 <== NOT EXECUTED if (fs_info->index >= fs_info->uino_pool_size) 2014edc: 80 a0 40 1d cmp %g1, %i5 <== NOT EXECUTED 2014ee0: 0a 80 00 03 bcs 2014eec <== NOT EXECUTED 2014ee4: c2 26 20 78 st %g1, [ %i0 + 0x78 ] <== NOT EXECUTED fs_info->index = 0; 2014ee8: c0 26 20 78 clr [ %i0 + 0x78 ] <== NOT EXECUTED uint32_t j = 0; bool resrc_unsuff = false; while (!resrc_unsuff) { for (j = 0; j < fs_info->uino_pool_size; j++) 2014eec: 88 01 20 01 inc %g4 <== NOT EXECUTED 2014ef0: 80 a1 00 1d cmp %g4, %i5 <== NOT EXECUTED 2014ef4: 32 bf ff f1 bne,a 2014eb8 <== NOT EXECUTED 2014ef8: c2 06 20 78 ld [ %i0 + 0x78 ], %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)) 2014efc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2014f00: 93 2f 60 01 sll %i5, 1, %o1 <== NOT EXECUTED 2014f04: 82 26 40 01 sub %i1, %g1, %g1 <== NOT EXECUTED 2014f08: 80 a2 40 01 cmp %o1, %g1 <== NOT EXECUTED 2014f0c: 2a 80 00 0c bcs,a 2014f3c <== NOT EXECUTED 2014f10: d0 06 20 74 ld [ %i0 + 0x74 ], %o0 <== NOT EXECUTED } else resrc_unsuff = true; } return 0; } 2014f14: 81 c7 e0 08 ret <== NOT EXECUTED 2014f18: 91 e8 20 00 restore %g0, 0, %o0 <== 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); 2014f1c: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2014f20: b9 28 40 1c sll %g1, %i4, %i4 <== NOT EXECUTED 2014f24: 84 17 00 02 or %i4, %g2, %g2 <== NOT EXECUTED 2014f28: c4 2e 80 00 stb %g2, [ %i2 ] <== NOT EXECUTED return (fs_info->uino_base + fs_info->index); 2014f2c: c4 06 20 78 ld [ %i0 + 0x78 ], %g2 <== NOT EXECUTED 2014f30: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2014f34: 81 c7 e0 08 ret <== NOT EXECUTED 2014f38: 91 e8 80 01 restore %g2, %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); 2014f3c: 7f ff c5 6f call 20064f8 <== NOT EXECUTED 2014f40: d2 26 20 7c st %o1, [ %i0 + 0x7c ] <== NOT EXECUTED if (fs_info->uino != NULL) 2014f44: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2014f48: 02 bf ff f3 be 2014f14 <== NOT EXECUTED 2014f4c: d0 26 20 74 st %o0, [ %i0 + 0x74 ] <== NOT EXECUTED fs_info->index = fs_info->uino_pool_size; 2014f50: fa 06 20 7c ld [ %i0 + 0x7c ], %i5 <== NOT EXECUTED 2014f54: 10 bf ff ca b 2014e7c <== NOT EXECUTED 2014f58: fa 26 20 78 st %i5, [ %i0 + 0x78 ] <== NOT EXECUTED =============================================================================== 02014df0 : int fat_init_clusters_chain( fat_fs_info_t *fs_info, uint32_t start_cln ) { 2014df0: 9d e3 bf 98 save %sp, -104, %sp 2014df4: f2 27 bf fc st %i1, [ %fp + -4 ] int rc = RC_OK; ssize_t ret = 0; uint32_t cur_cln = start_cln; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2014df8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2014dfc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014e00: 92 10 00 19 mov %i1, %o1 2014e04: 94 10 20 00 clr %o2 { int rc = RC_OK; ssize_t ret = 0; uint32_t cur_cln = start_cln; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2014e08: b2 0e 40 02 and %i1, %g2, %i1 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014e0c: 98 10 20 00 clr %o4 { int rc = RC_OK; ssize_t ret = 0; uint32_t cur_cln = start_cln; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2014e10: 80 a6 40 01 cmp %i1, %g1 2014e14: 1a 80 00 10 bcc 2014e54 2014e18: 90 10 00 18 mov %i0, %o0 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014e1c: 7f ff fc a8 call 20140bc 2014e20: d6 16 20 06 lduh [ %i0 + 6 ], %o3 if ( ret != fs_info->vol.bpc ) 2014e24: c2 16 20 06 lduh [ %i0 + 6 ], %g1 { return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2014e28: 94 07 bf fc add %fp, -4, %o2 uint32_t cur_cln = start_cln; while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); if ( ret != fs_info->vol.bpc ) 2014e2c: 80 a0 40 08 cmp %g1, %o0 2014e30: 12 80 00 0c bne 2014e60 <== NEVER TAKEN 2014e34: 90 10 00 18 mov %i0, %o0 { return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2014e38: 40 00 15 7e call 201a430 2014e3c: d2 07 bf fc ld [ %fp + -4 ], %o1 if ( rc != RC_OK ) 2014e40: 80 a2 20 00 cmp %o0, 0 2014e44: 02 bf ff ed be 2014df8 <== ALWAYS TAKEN 2014e48: f2 07 bf fc ld [ %fp + -4 ], %i1 } } return rc; } 2014e4c: 81 c7 e0 08 ret <== NOT EXECUTED 2014e50: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED return rc; } } return rc; 2014e54: 90 10 20 00 clr %o0 } 2014e58: 81 c7 e0 08 ret 2014e5c: 91 e8 00 08 restore %g0, %o0, %o0 while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); if ( ret != fs_info->vol.bpc ) { return -1; 2014e60: 90 10 3f ff mov -1, %o0 <== NOT EXECUTED } } return rc; } 2014e64: 81 c7 e0 08 ret <== NOT EXECUTED 2014e68: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 020143c4 : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_init_volume_info(fat_fs_info_t *fs_info, const char *device) { 20143c4: 9d e3 bf 10 save %sp, -240, %sp ssize_t ret = 0; struct stat stat_buf; int i = 0; rtems_bdbuf_buffer *block = NULL; vol->fd = open(device, O_RDWR); 20143c8: 92 10 20 02 mov 2, %o1 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; 20143cc: c0 27 bf a4 clr [ %fp + -92 ] vol->fd = open(device, O_RDWR); 20143d0: 7f ff c7 ad call 2006284 20143d4: 90 10 00 19 mov %i1, %o0 if (vol->fd < 0) 20143d8: 80 a2 20 00 cmp %o0, 0 20143dc: 06 80 01 c1 bl 2014ae0 <== NEVER TAKEN 20143e0: d0 26 20 60 st %o0, [ %i0 + 0x60 ] { rtems_set_errno_and_return_minus_one(ENXIO); } rc = fstat(vol->fd, &stat_buf); 20143e4: 7f ff c4 48 call 2005504 20143e8: 92 07 bf b8 add %fp, -72, %o1 if (rc != 0) 20143ec: 80 a2 20 00 cmp %o0, 0 20143f0: 12 80 01 b9 bne 2014ad4 <== NEVER TAKEN 20143f4: c6 07 bf c4 ld [ %fp + -60 ], %g3 close(vol->fd); rtems_set_errno_and_return_minus_one(ENXIO); } /* Must be a block device. */ if (!S_ISBLK(stat_buf.st_mode)) 20143f8: 05 00 00 3c sethi %hi(0xf000), %g2 20143fc: 86 08 c0 02 and %g3, %g2, %g3 2014400: 05 00 00 18 sethi %hi(0x6000), %g2 2014404: 80 a0 c0 02 cmp %g3, %g2 2014408: 12 80 01 b4 bne 2014ad8 <== NEVER TAKEN 201440c: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 static inline int rtems_disk_fd_get_disk_device( int fd, rtems_disk_device **dd_ptr ) { return ioctl(fd, RTEMS_BLKIO_GETDISKDEV, dd_ptr); 2014410: 94 06 20 64 add %i0, 0x64, %o2 2014414: 13 10 01 10 sethi %hi(0x40044000), %o1 2014418: 40 00 05 e0 call 2015b98 201441c: 92 12 62 09 or %o1, 0x209, %o1 ! 40044209 rtems_set_errno_and_return_minus_one(ENXIO); } /* check that device is registred as block device and lock it */ rc = rtems_disk_fd_get_disk_device(vol->fd, &vol->dd); if (rc != 0) { 2014420: 80 a2 20 00 cmp %o0, 0 2014424: 12 80 01 ac bne 2014ad4 <== NEVER TAKEN 2014428: 92 10 20 00 clr %o1 rtems_set_errno_and_return_minus_one(ENXIO); } /* Read boot record */ /* FIXME: Asserts FAT_MAX_BPB_SIZE < bdbuf block size */ sc = rtems_bdbuf_read( vol->dd, 0, &block); 201442c: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2014430: 7f ff f5 c8 call 2011b50 2014434: 94 07 bf a4 add %fp, -92, %o2 if (sc != RTEMS_SUCCESSFUL) 2014438: 80 a2 20 00 cmp %o0, 0 201443c: 12 80 01 b5 bne 2014b10 <== NEVER TAKEN 2014440: d0 07 bf a4 ld [ %fp + -92 ], %o0 { close(vol->fd); rtems_set_errno_and_return_minus_one( EIO); } memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); 2014444: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 2014448: c2 08 a0 20 ldub [ %g2 + 0x20 ], %g1 201444c: f8 08 a0 0b ldub [ %g2 + 0xb ], %i4 2014450: c2 2f bf 93 stb %g1, [ %fp + -109 ] 2014454: c2 08 a0 21 ldub [ %g2 + 0x21 ], %g1 2014458: f6 08 a0 0c ldub [ %g2 + 0xc ], %i3 201445c: c2 2f bf 95 stb %g1, [ %fp + -107 ] 2014460: c2 08 a0 22 ldub [ %g2 + 0x22 ], %g1 2014464: ec 08 a0 0d ldub [ %g2 + 0xd ], %l6 2014468: c2 2f bf 94 stb %g1, [ %fp + -108 ] 201446c: c2 08 a0 23 ldub [ %g2 + 0x23 ], %g1 2014470: e8 08 a0 0e ldub [ %g2 + 0xe ], %l4 2014474: c2 2f bf 8f stb %g1, [ %fp + -113 ] 2014478: c2 08 a0 25 ldub [ %g2 + 0x25 ], %g1 201447c: ea 08 a0 0f ldub [ %g2 + 0xf ], %l5 2014480: c2 2f bf 97 stb %g1, [ %fp + -105 ] 2014484: c2 08 a0 26 ldub [ %g2 + 0x26 ], %g1 2014488: fa 08 a0 10 ldub [ %g2 + 0x10 ], %i5 201448c: c2 2f bf 96 stb %g1, [ %fp + -106 ] 2014490: c2 08 a0 27 ldub [ %g2 + 0x27 ], %g1 2014494: f4 08 a0 11 ldub [ %g2 + 0x11 ], %i2 2014498: c2 2f bf 9f stb %g1, [ %fp + -97 ] 201449c: c2 08 a0 28 ldub [ %g2 + 0x28 ], %g1 20144a0: f2 08 a0 12 ldub [ %g2 + 0x12 ], %i1 20144a4: c2 2f bf 87 stb %g1, [ %fp + -121 ] 20144a8: c2 08 a0 2c ldub [ %g2 + 0x2c ], %g1 20144ac: e0 08 a0 13 ldub [ %g2 + 0x13 ], %l0 20144b0: c2 2f bf 90 stb %g1, [ %fp + -112 ] 20144b4: c2 08 a0 2d ldub [ %g2 + 0x2d ], %g1 20144b8: e2 08 a0 14 ldub [ %g2 + 0x14 ], %l1 20144bc: e4 08 a0 16 ldub [ %g2 + 0x16 ], %l2 20144c0: e6 08 a0 17 ldub [ %g2 + 0x17 ], %l3 20144c4: ee 08 a0 24 ldub [ %g2 + 0x24 ], %l7 20144c8: c2 2f bf 7f stb %g1, [ %fp + -129 ] 20144cc: c2 08 a0 2e ldub [ %g2 + 0x2e ], %g1 20144d0: c2 2f bf 7e stb %g1, [ %fp + -130 ] 20144d4: c2 08 a0 2f ldub [ %g2 + 0x2f ], %g1 20144d8: c2 2f bf 77 stb %g1, [ %fp + -137 ] 20144dc: c2 08 a0 30 ldub [ %g2 + 0x30 ], %g1 20144e0: c4 08 a0 31 ldub [ %g2 + 0x31 ], %g2 20144e4: c2 2f bf 92 stb %g1, [ %fp + -110 ] sc = rtems_bdbuf_release( block); 20144e8: 7f ff f6 1f call 2011d64 20144ec: c4 2f bf 91 stb %g2, [ %fp + -111 ] if (sc != RTEMS_SUCCESSFUL) 20144f0: 80 a2 20 00 cmp %o0, 0 20144f4: 12 80 01 87 bne 2014b10 <== NEVER TAKEN 20144f8: b6 0e e0 ff and %i3, 0xff, %i3 close(vol->fd); rtems_set_errno_and_return_minus_one( EIO ); } /* Evaluate boot record */ vol->bps = FAT_GET_BR_BYTES_PER_SECTOR(boot_rec); 20144fc: b8 0f 20 ff and %i4, 0xff, %i4 2014500: b7 2e e0 08 sll %i3, 8, %i3 2014504: b8 16 c0 1c or %i3, %i4, %i4 2014508: f8 36 00 00 sth %i4, [ %i0 ] if ( (vol->bps != 512) && 201450c: 93 2f 20 10 sll %i4, 0x10, %o1 2014510: 85 32 60 10 srl %o1, 0x10, %g2 2014514: 80 a0 a4 00 cmp %g2, 0x400 2014518: 12 80 00 dc bne 2014888 <== ALWAYS TAKEN 201451c: 9a 10 00 1c mov %i4, %o5 (vol->bps != 4096)) { close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014520: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 2014524: 80 88 a0 01 btst 1, %g2 2014528: 12 80 00 0a bne 2014550 <== ALWAYS TAKEN 201452c: c0 2e 20 03 clrb [ %i0 + 3 ] * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_init_volume_info(fat_fs_info_t *fs_info, const char *device) { 2014530: 10 80 00 03 b 201453c <== NOT EXECUTED 2014534: 88 10 20 01 mov 1, %g4 <== NOT EXECUTED (vol->bps != 4096)) { close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014538: 88 10 00 0f mov %o7, %g4 <== NOT EXECUTED i >>= 1, vol->sec_mul++); 201453c: 85 38 a0 01 sra %g2, 1, %g2 <== NOT EXECUTED (vol->bps != 4096)) { close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } for (vol->sec_mul = 0, i = (vol->bps >> FAT_SECTOR512_BITS); (i & 1) == 0; 2014540: 80 88 a0 01 btst 1, %g2 <== NOT EXECUTED 2014544: 02 bf ff fd be 2014538 <== NOT EXECUTED 2014548: 9e 01 20 01 add %g4, 1, %o7 <== NOT EXECUTED 201454c: c8 2e 20 03 stb %g4, [ %i0 + 3 ] <== NOT EXECUTED i >>= 1, vol->sec_mul++); for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; 2014550: c0 2e 20 02 clrb [ %i0 + 2 ] 2014554: 93 32 60 10 srl %o1, 0x10, %o1 2014558: b6 10 20 01 mov 1, %i3 201455c: 80 8f 20 01 btst 1, %i4 2014560: 02 80 00 05 be 2014574 <== ALWAYS TAKEN 2014564: 84 10 00 09 mov %o1, %g2 2014568: 10 80 01 66 b 2014b00 <== NOT EXECUTED 201456c: b6 10 20 00 clr %i3 <== NOT EXECUTED 2014570: b6 10 00 04 mov %g4, %i3 i >>= 1, vol->sec_log2++); 2014574: 85 38 a0 01 sra %g2, 1, %g2 close(vol->fd); 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; 2014578: 80 88 a0 01 btst 1, %g2 201457c: 02 bf ff fd be 2014570 2014580: 88 06 e0 01 add %i3, 1, %g4 2014584: f6 2e 20 02 stb %i3, [ %i0 + 2 ] i >>= 1, vol->sec_log2++); vol->bytes_per_block = vol->bps; vol->bytes_per_block_log2 = vol->sec_log2; vol->sectors_per_block = 1; 2014588: 84 10 20 01 mov 1, %g2 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; i >>= 1, vol->sec_log2++); vol->bytes_per_block = vol->bps; 201458c: da 36 20 0a sth %o5, [ %i0 + 0xa ] vol->bytes_per_block_log2 = vol->sec_log2; 2014590: f6 2e 20 0c stb %i3, [ %i0 + 0xc ] vol->sectors_per_block = 1; 2014594: c4 2e 20 09 stb %g2, [ %i0 + 9 ] vol->spc = FAT_GET_BR_SECTORS_PER_CLUSTER(boot_rec); /* * "sectors per cluster" of zero is invalid * (and would hang the following loop) */ if (vol->spc == 0) 2014598: b8 8d a0 ff andcc %l6, 0xff, %i4 201459c: 02 80 01 45 be 2014ab0 <== NEVER TAKEN 20145a0: ec 2e 20 04 stb %l6, [ %i0 + 4 ] { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 20145a4: c0 2e 20 05 clrb [ %i0 + 5 ] 20145a8: 80 8d a0 01 btst 1, %l6 20145ac: 12 80 01 57 bne 2014b08 20145b0: 84 10 00 1c mov %i4, %g2 20145b4: 10 80 00 03 b 20145c0 20145b8: 86 10 20 01 mov 1, %g3 20145bc: 86 10 00 04 mov %g4, %g3 i >>= 1, vol->spc_log2++); 20145c0: 85 38 a0 01 sra %g2, 1, %g2 { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 20145c4: 80 88 a0 01 btst 1, %g2 20145c8: 02 bf ff fd be 20145bc 20145cc: 88 00 e0 01 add %g3, 1, %g4 20145d0: c6 2e 20 05 stb %g3, [ %i0 + 5 ] 20145d4: 86 08 e0 ff and %g3, 0xff, %g3 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) 20145d8: 87 2a 40 03 sll %o1, %g3, %g3 20145dc: 89 28 e0 10 sll %g3, 0x10, %g4 20145e0: 05 20 00 00 sethi %hi(0x80000000), %g2 20145e4: 80 a1 00 02 cmp %g4, %g2 20145e8: 18 80 01 32 bgu 2014ab0 <== NEVER TAKEN 20145ec: c6 36 20 06 sth %g3, [ %i0 + 6 ] { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 20145f0: c0 2e 20 08 clrb [ %i0 + 8 ] 20145f4: 05 00 00 3f sethi %hi(0xfc00), %g2 20145f8: 88 10 20 01 mov 1, %g4 20145fc: 84 10 a3 ff or %g2, 0x3ff, %g2 2014600: 80 88 e0 01 btst 1, %g3 2014604: 02 80 00 05 be 2014618 <== ALWAYS TAKEN 2014608: 84 08 c0 02 and %g3, %g2, %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); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 201460c: 10 80 00 09 b 2014630 <== NOT EXECUTED 2014610: b4 0e a0 ff and %i2, 0xff, %i2 <== NOT EXECUTED { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 2014614: 88 10 00 03 mov %g3, %g4 i >>= 1, vol->bpc_log2++); 2014618: 85 38 a0 01 sra %g2, 1, %g2 { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 201461c: 80 88 a0 01 btst 1, %g2 2014620: 02 bf ff fd be 2014614 2014624: 86 01 20 01 add %g4, 1, %g3 2014628: c8 2e 20 08 stb %g4, [ %i0 + 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); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 201462c: b4 0e a0 ff and %i2, 0xff, %i2 2014630: b2 0e 60 ff and %i1, 0xff, %i1 2014634: b3 2e 60 08 sll %i1, 8, %i1 2014638: b2 16 40 1a or %i1, %i2, %i1 /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 201463c: 87 2e 60 10 sll %i1, 0x10, %g3 2014640: 87 30 e0 0b srl %g3, 0xb, %g3 2014644: 90 02 7f ff add %o1, -1, %o0 } 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); 2014648: fa 2e 20 0d stb %i5, [ %i0 + 0xd ] vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 201464c: aa 0d 60 ff and %l5, 0xff, %l5 2014650: a8 0d 20 ff and %l4, 0xff, %l4 2014654: ab 2d 60 08 sll %l5, 8, %l5 vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 2014658: f2 36 20 24 sth %i1, [ %i0 + 0x24 ] 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); 201465c: a8 15 40 14 or %l5, %l4, %l4 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)) / 2014660: 90 00 c0 08 add %g3, %o0, %o0 2014664: 7f ff b8 06 call 200267c <.div> 2014668: e8 36 20 18 sth %l4, [ %i0 + 0x18 ] vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 201466c: b7 2a 00 1b sll %o0, %i3, %i3 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)) / 2014670: d0 26 20 28 st %o0, [ %i0 + 0x28 ] 2014674: b4 10 00 08 mov %o0, %i2 vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) 2014678: a4 0c a0 ff and %l2, 0xff, %l2 201467c: 90 0c e0 ff and %l3, 0xff, %o0 2014680: 91 2a 20 08 sll %o0, 8, %o0 2014684: 90 12 00 12 or %o0, %l2, %o0 2014688: 91 2a 20 10 sll %o0, 0x10, %o0 201468c: 80 a2 20 00 cmp %o0, 0 2014690: 02 80 00 8a be 20148b8 2014694: f6 26 20 2c st %i3, [ %i0 + 0x2c ] vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); 2014698: 91 32 20 10 srl %o0, 0x10, %o0 201469c: d0 26 20 1c st %o0, [ %i0 + 0x1c ] else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); vol->data_fsec = vol->fat_loc + vol->fats * vol->fat_length + 20146a0: 92 0f 60 ff and %i5, 0xff, %o1 20146a4: 7f ff b7 ba call 200258c <.umul> 20146a8: a9 2d 20 10 sll %l4, 0x10, %l4 20146ac: a9 35 20 10 srl %l4, 0x10, %l4 20146b0: 90 02 00 14 add %o0, %l4, %o0 20146b4: b4 02 00 1a add %o0, %i2, %i2 vol->rdir_secs; /* for FAT12/16 root dir starts at(sector) */ vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; 20146b8: d0 26 20 20 st %o0, [ %i0 + 0x20 ] if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) 20146bc: 90 0c 60 ff and %l1, 0xff, %o0 20146c0: a0 0c 20 ff and %l0, 0xff, %l0 20146c4: 91 2a 20 08 sll %o0, 8, %o0 20146c8: 90 12 00 10 or %o0, %l0, %o0 20146cc: 91 2a 20 10 sll %o0, 0x10, %o0 20146d0: 80 a2 20 00 cmp %o0, 0 20146d4: 02 80 00 e3 be 2014a60 20146d8: f4 26 20 34 st %i2, [ %i0 + 0x34 ] vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); 20146dc: 91 32 20 10 srl %o0, 0x10, %o0 20146e0: d0 26 20 30 st %o0, [ %i0 + 0x30 ] 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; 20146e4: 90 22 00 1a sub %o0, %i2, %o0 20146e8: 7f ff b7 e3 call 2002674 <.udiv> 20146ec: 92 10 00 1c mov %i4, %o1 /* determine FAT type at least */ if ( vol->data_cls < FAT_FAT12_MAX_CLN) 20146f0: 80 a2 2f f4 cmp %o0, 0xff4 20146f4: 18 80 00 7d bgu 20148e8 20146f8: d0 26 20 38 st %o0, [ %i0 + 0x38 ] { vol->type = FAT_FAT12; 20146fc: 84 10 20 01 mov 1, %g2 2014700: c4 2e 20 0e stb %g2, [ %i0 + 0xe ] vol->mask = FAT_FAT12_MASK; 2014704: 84 10 2f ff mov 0xfff, %g2 2014708: c4 26 20 10 st %g2, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT12_EOC; 201470c: 84 10 2f f8 mov 0xff8, %g2 2014710: c4 26 20 14 st %g2, [ %i0 + 0x14 ] else { vol->rdir_cl = 0; vol->mirror = 0; vol->afat = 0; vol->free_cls = FAT_UNDEFINED_VALUE; 2014714: 84 10 3f ff mov -1, %g2 } } } else { vol->rdir_cl = 0; 2014718: c0 26 20 3c clr [ %i0 + 0x3c ] vol->mirror = 0; 201471c: c0 2e 20 54 clrb [ %i0 + 0x54 ] vol->afat = 0; 2014720: c0 2e 20 5c clrb [ %i0 + 0x5c ] vol->free_cls = FAT_UNDEFINED_VALUE; 2014724: c4 26 20 44 st %g2, [ %i0 + 0x44 ] vol->next_cl = FAT_UNDEFINED_VALUE; 2014728: c4 26 20 4c st %g2, [ %i0 + 0x4c ] * 0 on success, or -1 if error occured and errno set appropriately */ int _fat_block_release(fat_fs_info_t *fs_info) { return fat_buf_release(fs_info); 201472c: 7f ff fd 73 call 2013cf8 2014730: 90 10 00 18 mov %i0, %o0 vol->next_cl = FAT_UNDEFINED_VALUE; } _fat_block_release(fs_info); vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 2014734: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 2014738: 7f ff b7 95 call 200258c <.umul> 201473c: d0 0e 20 5c ldub [ %i0 + 0x5c ], %o0 2014740: c4 16 20 18 lduh [ %i0 + 0x18 ], %g2 /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 2014744: 92 10 20 0c mov 0xc, %o1 vol->next_cl = FAT_UNDEFINED_VALUE; } _fat_block_release(fs_info); vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 2014748: 84 02 00 02 add %o0, %g2, %g2 /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 201474c: 90 10 20 02 mov 2, %o0 2014750: 7f ff c2 72 call 2005118 2014754: c4 26 20 58 st %g2, [ %i0 + 0x58 ] if ( fs_info->vhash == NULL ) 2014758: 80 a2 20 00 cmp %o0, 0 201475c: 02 80 01 03 be 2014b68 <== NEVER TAKEN 2014760: d0 26 20 6c st %o0, [ %i0 + 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 ); 2014764: 88 02 20 04 add %o0, 4, %g4 2014768: 84 02 20 0c add %o0, 0xc, %g2 201476c: 86 02 20 10 add %o0, 0x10, %g3 head->next = tail; 2014770: c8 22 00 00 st %g4, [ %o0 ] head->previous = NULL; 2014774: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2014778: 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; 201477c: c6 22 20 0c st %g3, [ %o0 + 0xc ] head->previous = NULL; 2014780: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 2014784: c4 22 20 14 st %g2, [ %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)); 2014788: 92 10 20 0c mov 0xc, %o1 201478c: 7f ff c2 63 call 2005118 2014790: 90 10 20 02 mov 2, %o0 if ( fs_info->rhash == NULL ) 2014794: 80 a2 20 00 cmp %o0, 0 2014798: 02 80 01 0c be 2014bc8 <== NEVER TAKEN 201479c: d0 26 20 70 st %o0, [ %i0 + 0x70 ] } 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; 20147a0: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 20147a4: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 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 ); 20147a8: 86 02 20 0c add %o0, 0xc, %g3 head->next = tail; head->previous = NULL; 20147ac: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 20147b0: 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; 20147b4: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 20147b8: c6 22 20 14 st %g3, [ %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 ); 20147bc: 88 02 20 10 add %o0, 0x10, %g4 20147c0: ba 02 20 04 add %o0, 4, %i5 head->next = tail; 20147c4: c8 22 20 0c st %g4, [ %o0 + 0xc ] 20147c8: fa 22 00 00 st %i5, [ %o0 ] 20147cc: 85 2f 00 02 sll %i4, %g2, %g2 20147d0: 85 28 a0 04 sll %g2, 4, %g2 20147d4: c4 26 20 80 st %g2, [ %i0 + 0x80 ] 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; 20147d8: 84 10 21 00 mov 0x100, %g2 fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; fs_info->index = 0; 20147dc: c0 26 20 78 clr [ %i0 + 0x78 ] 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; 20147e0: c4 26 20 7c st %g2, [ %i0 + 0x7c ] 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)); 20147e4: 90 10 21 00 mov 0x100, %o0 20147e8: 7f ff c2 4c call 2005118 20147ec: 92 10 20 01 mov 1, %o1 if ( fs_info->uino == NULL ) 20147f0: 80 a2 20 00 cmp %o0, 0 20147f4: 02 80 00 d0 be 2014b34 <== NEVER TAKEN 20147f8: d0 26 20 74 st %o0, [ %i0 + 0x74 ] close(vol->fd); 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)); 20147fc: d0 16 00 00 lduh [ %i0 ], %o0 2014800: 7f ff c2 46 call 2005118 2014804: 92 10 20 01 mov 1, %o1 if (fs_info->sec_buf == NULL) 2014808: 80 a2 20 00 cmp %o0, 0 201480c: 02 80 00 e7 be 2014ba8 <== NEVER TAKEN 2014810: d0 26 20 90 st %o0, [ %i0 + 0x90 ] return bytes_written; } static bool is_cluster_aligned(const fat_vol_t *vol, uint32_t sec_num) { return (sec_num & (vol->spc - 1)) == 0; 2014814: c4 0e 20 04 ldub [ %i0 + 4 ], %g2 2014818: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 201481c: 84 00 bf ff add %g2, -1, %g2 /* * If possible we will use the cluster size as bdbuf block size for faster * file access. This requires that certain sectors are aligned to cluster * borders. */ if (is_cluster_aligned(vol, vol->data_fsec) 2014820: 80 88 80 03 btst %g2, %g3 2014824: 12 80 00 17 bne 2014880 <== NEVER TAKEN 2014828: 01 00 00 00 nop && (FAT_FAT32 == vol->type || is_cluster_aligned(vol, vol->rdir_loc))) 201482c: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 2014830: 80 a0 e0 04 cmp %g3, 4 2014834: 22 80 00 07 be,a 2014850 2014838: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 return bytes_written; } static bool is_cluster_aligned(const fat_vol_t *vol, uint32_t sec_num) { return (sec_num & (vol->spc - 1)) == 0; 201483c: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 * If possible we will use the cluster size as bdbuf block size for faster * file access. This requires that certain sectors are aligned to cluster * borders. */ if (is_cluster_aligned(vol, vol->data_fsec) && (FAT_FAT32 == vol->type || is_cluster_aligned(vol, vol->rdir_loc))) 2014840: 80 88 80 03 btst %g2, %g3 2014844: 12 80 00 0f bne 2014880 <== NEVER TAKEN 2014848: 01 00 00 00 nop { sc = rtems_bdbuf_set_block_size (vol->dd, vol->bpc, true); 201484c: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2014850: d2 16 20 06 lduh [ %i0 + 6 ], %o1 2014854: 7f ff f6 83 call 2012260 2014858: 94 10 20 01 mov 1, %o2 if (sc == RTEMS_SUCCESSFUL) 201485c: 80 a2 20 00 cmp %o0, 0 2014860: 12 80 00 08 bne 2014880 <== NEVER TAKEN 2014864: 01 00 00 00 nop { vol->bytes_per_block = vol->bpc; 2014868: c8 16 20 06 lduh [ %i0 + 6 ], %g4 vol->bytes_per_block_log2 = vol->bpc_log2; 201486c: c6 0e 20 08 ldub [ %i0 + 8 ], %g3 vol->sectors_per_block = vol->spc; 2014870: c4 0e 20 04 ldub [ %i0 + 4 ], %g2 && (FAT_FAT32 == vol->type || is_cluster_aligned(vol, vol->rdir_loc))) { sc = rtems_bdbuf_set_block_size (vol->dd, vol->bpc, true); if (sc == RTEMS_SUCCESSFUL) { vol->bytes_per_block = vol->bpc; 2014874: c8 36 20 0a sth %g4, [ %i0 + 0xa ] vol->bytes_per_block_log2 = vol->bpc_log2; 2014878: c6 2e 20 0c stb %g3, [ %i0 + 0xc ] vol->sectors_per_block = vol->spc; 201487c: c4 2e 20 09 stb %g2, [ %i0 + 9 ] } } return RC_OK; 2014880: 81 c7 e0 08 ret 2014884: 91 e8 20 00 restore %g0, 0, %o0 } /* Evaluate boot record */ vol->bps = FAT_GET_BR_BYTES_PER_SECTOR(boot_rec); if ( (vol->bps != 512) && 2014888: 80 a0 a2 00 cmp %g2, 0x200 201488c: 22 bf ff 26 be,a 2014524 <== ALWAYS TAKEN 2014890: 85 32 60 19 srl %o1, 0x19, %g2 (vol->bps != 1024) && 2014894: 80 a0 a8 00 cmp %g2, 0x800 <== NOT EXECUTED 2014898: 22 bf ff 26 be,a 2014530 <== NOT EXECUTED 201489c: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED (vol->bps != 2048) && 20148a0: 09 00 00 04 sethi %hi(0x1000), %g4 <== NOT EXECUTED 20148a4: 80 a0 80 04 cmp %g2, %g4 <== NOT EXECUTED 20148a8: 12 80 00 82 bne 2014ab0 <== NOT EXECUTED 20148ac: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 20148b0: 10 bf ff 23 b 201453c <== NOT EXECUTED 20148b4: 88 10 20 01 mov 1, %g4 <== 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); 20148b8: c4 0f bf 96 ldub [ %fp + -106 ], %g2 20148bc: d0 0f bf 97 ldub [ %fp + -105 ], %o0 20148c0: c2 0f bf 9f ldub [ %fp + -97 ], %g1 20148c4: 85 28 a0 10 sll %g2, 0x10, %g2 20148c8: 91 2a 20 08 sll %o0, 8, %o0 20148cc: ae 0d e0 ff and %l7, 0xff, %l7 20148d0: 90 12 00 02 or %o0, %g2, %o0 20148d4: 85 28 60 18 sll %g1, 0x18, %g2 20148d8: 90 12 00 17 or %o0, %l7, %o0 20148dc: 90 12 00 02 or %o0, %g2, %o0 20148e0: 10 bf ff 70 b 20146a0 20148e4: d0 26 20 1c st %o0, [ %i0 + 0x1c ] vol->mask = FAT_FAT12_MASK; vol->eoc_val = FAT_FAT12_EOC; } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) 20148e8: 05 00 00 3f sethi %hi(0xfc00), %g2 20148ec: 86 10 a3 f4 or %g2, 0x3f4, %g3 ! fff4 20148f0: 80 a2 00 03 cmp %o0, %g3 20148f4: 08 80 00 67 bleu 2014a90 20148f8: 86 10 a3 ff or %g2, 0x3ff, %g3 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; 20148fc: c2 0f bf 87 ldub [ %fp + -121 ], %g1 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014900: f8 0f bf 7f ldub [ %fp + -129 ], %i4 vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 2014904: 84 08 7f 80 and %g1, -128, %g2 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014908: f6 0f bf 90 ldub [ %fp + -112 ], %i3 201490c: c8 0f bf 7e ldub [ %fp + -130 ], %g4 2014910: c2 0f bf 77 ldub [ %fp + -137 ], %g1 2014914: b9 2f 20 08 sll %i4, 8, %i4 vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 2014918: 07 03 ff ff sethi %hi(0xffffc00), %g3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 201491c: 89 29 20 10 sll %g4, 0x10, %g4 vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 2014920: ba 10 e3 ff or %g3, 0x3ff, %i5 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014924: 88 17 00 04 or %i4, %g4, %g4 } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; vol->eoc_val = FAT_FAT32_EOC; 2014928: 86 10 e3 f8 or %g3, 0x3f8, %g3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 201492c: 88 11 00 1b or %g4, %i3, %g4 2014930: b9 28 60 18 sll %g1, 0x18, %i4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 2014934: b6 10 20 04 mov 4, %i3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014938: 88 11 00 1c or %g4, %i4, %g4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 201493c: f6 2e 20 0e stb %i3, [ %i0 + 0xe ] vol->mask = FAT_FAT32_MASK; 2014940: fa 26 20 10 st %i5, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT32_EOC; 2014944: c6 26 20 14 st %g3, [ %i0 + 0x14 ] } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014948: c8 26 20 3c st %g4, [ %i0 + 0x3c ] vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; if (vol->mirror) 201494c: 80 88 a0 80 btst 0x80, %g2 2014950: 02 80 00 6a be 2014af8 <== ALWAYS TAKEN 2014954: c4 2e 20 54 stb %g2, [ %i0 + 0x54 ] vol->afat = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_FAT_NUM; 2014958: c2 0f bf 87 ldub [ %fp + -121 ], %g1 <== NOT EXECUTED 201495c: 84 08 60 0f and %g1, 0xf, %g2 <== NOT EXECUTED 2014960: c4 2e 20 5c stb %g2, [ %i0 + 0x5c ] <== NOT EXECUTED else vol->afat = 0; vol->info_sec = FAT_GET_BR_FAT32_FS_INFO_SECTOR(boot_rec); 2014964: c4 0f bf 91 ldub [ %fp + -111 ], %g2 2014968: c6 0f bf 92 ldub [ %fp + -110 ], %g3 201496c: 85 28 a0 08 sll %g2, 8, %g2 2014970: 84 10 80 03 or %g2, %g3, %g2 2014974: c4 36 20 40 sth %g2, [ %i0 + 0x40 ] if( vol->info_sec == 0 ) 2014978: 85 28 a0 10 sll %g2, 0x10, %g2 201497c: 93 30 a0 10 srl %g2, 0x10, %o1 2014980: 80 a2 60 00 cmp %o1, 0 2014984: 02 80 00 4b be 2014ab0 <== NEVER TAKEN 2014988: 90 10 00 18 mov %i0, %o0 close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(fs_info, vol->info_sec , 0, 201498c: 94 10 20 00 clr %o2 2014990: 96 10 20 04 mov 4, %o3 2014994: 7f ff fd 7e call 2013f8c <_fat_block_read> 2014998: 98 07 bf a8 add %fp, -88, %o4 FAT_FSI_LEADSIG_SIZE, fs_info_sector); if ( ret < 0 ) 201499c: 80 a2 20 00 cmp %o0, 0 20149a0: 06 80 00 7d bl 2014b94 <== NEVER TAKEN 20149a4: c4 0f bf ab ldub [ %fp + -85 ], %g2 { close(vol->fd); return -1; } if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != 20149a8: c6 0f bf a9 ldub [ %fp + -87 ], %g3 20149ac: fa 0f bf aa ldub [ %fp + -86 ], %i5 20149b0: c8 0f bf a8 ldub [ %fp + -88 ], %g4 20149b4: 85 28 a0 18 sll %g2, 0x18, %g2 20149b8: 87 28 e0 08 sll %g3, 8, %g3 20149bc: bb 2f 60 10 sll %i5, 0x10, %i5 20149c0: 86 10 c0 1d or %g3, %i5, %g3 20149c4: 86 10 c0 04 or %g3, %g4, %g3 20149c8: 86 10 c0 02 or %g3, %g2, %g3 20149cc: 05 10 58 54 sethi %hi(0x41615000), %g2 20149d0: 84 10 a2 52 or %g2, 0x252, %g2 ! 41615252 20149d4: 80 a0 c0 02 cmp %g3, %g2 20149d8: 12 80 00 34 bne 2014aa8 <== NEVER TAKEN 20149dc: 90 10 00 18 mov %i0, %o0 close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(fs_info, vol->info_sec , FAT_FSI_INFO, 20149e0: d2 16 20 40 lduh [ %i0 + 0x40 ], %o1 20149e4: 94 10 21 e4 mov 0x1e4, %o2 20149e8: 96 10 20 0c mov 0xc, %o3 20149ec: 7f ff fd 68 call 2013f8c <_fat_block_read> 20149f0: 98 07 bf a8 add %fp, -88, %o4 FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) 20149f4: 80 a2 20 00 cmp %o0, 0 20149f8: 06 80 00 65 bl 2014b8c <== NEVER TAKEN 20149fc: c6 0f bf ad ldub [ %fp + -83 ], %g3 close(vol->fd); return -1; } vol->free_cls_in_fs_info = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2014a00: f2 0f bf ae ldub [ %fp + -82 ], %i1 2014a04: f4 0f bf ac ldub [ %fp + -84 ], %i2 2014a08: f6 0f bf af ldub [ %fp + -81 ], %i3 vol->free_cls = vol->free_cls_in_fs_info; vol->next_cl_in_fs_info = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014a0c: f8 0f bf b1 ldub [ %fp + -79 ], %i4 2014a10: c4 0f bf b2 ldub [ %fp + -78 ], %g2 2014a14: fa 0f bf b0 ldub [ %fp + -80 ], %i5 2014a18: c8 0f bf b3 ldub [ %fp + -77 ], %g4 close(vol->fd); return -1; } vol->free_cls_in_fs_info = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2014a1c: 87 28 e0 08 sll %g3, 8, %g3 2014a20: b3 2e 60 10 sll %i1, 0x10, %i1 2014a24: b7 2e e0 18 sll %i3, 0x18, %i3 2014a28: 86 10 c0 19 or %g3, %i1, %g3 vol->free_cls = vol->free_cls_in_fs_info; vol->next_cl_in_fs_info = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014a2c: b9 2f 20 08 sll %i4, 8, %i4 close(vol->fd); return -1; } vol->free_cls_in_fs_info = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2014a30: 86 10 c0 1a or %g3, %i2, %g3 vol->free_cls = vol->free_cls_in_fs_info; vol->next_cl_in_fs_info = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014a34: 85 28 a0 10 sll %g2, 0x10, %g2 close(vol->fd); return -1; } vol->free_cls_in_fs_info = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2014a38: 86 10 c0 1b or %g3, %i3, %g3 vol->free_cls = vol->free_cls_in_fs_info; vol->next_cl_in_fs_info = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014a3c: 84 17 00 02 or %i4, %g2, %g2 2014a40: 89 29 20 18 sll %g4, 0x18, %g4 2014a44: 84 10 80 1d or %g2, %i5, %g2 _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls_in_fs_info = 2014a48: c6 26 20 48 st %g3, [ %i0 + 0x48 ] FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); vol->free_cls = vol->free_cls_in_fs_info; vol->next_cl_in_fs_info = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2014a4c: 84 10 80 04 or %g2, %g4, %g2 return -1; } vol->free_cls_in_fs_info = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); vol->free_cls = vol->free_cls_in_fs_info; 2014a50: c6 26 20 44 st %g3, [ %i0 + 0x44 ] vol->next_cl_in_fs_info = 2014a54: c4 26 20 50 st %g2, [ %i0 + 0x50 ] FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); vol->next_cl = vol->next_cl_in_fs_info; 2014a58: 10 bf ff 35 b 201472c 2014a5c: c4 26 20 4c st %g2, [ %i0 + 0x4c ] 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); 2014a60: c4 0f bf 94 ldub [ %fp + -108 ], %g2 2014a64: d0 0f bf 95 ldub [ %fp + -107 ], %o0 2014a68: 85 28 a0 10 sll %g2, 0x10, %g2 2014a6c: 91 2a 20 08 sll %o0, 8, %o0 2014a70: c2 0f bf 93 ldub [ %fp + -109 ], %g1 2014a74: 90 12 00 02 or %o0, %g2, %o0 2014a78: c4 0f bf 8f ldub [ %fp + -113 ], %g2 2014a7c: 90 12 00 01 or %o0, %g1, %o0 2014a80: ad 28 a0 18 sll %g2, 0x18, %l6 2014a84: 90 12 00 16 or %o0, %l6, %o0 2014a88: 10 bf ff 17 b 20146e4 2014a8c: d0 26 20 30 st %o0, [ %i0 + 0x30 ] } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014a90: 88 10 20 02 mov 2, %g4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; 2014a94: 84 10 a3 f8 or %g2, 0x3f8, %g2 } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014a98: c8 2e 20 0e stb %g4, [ %i0 + 0xe ] vol->mask = FAT_FAT16_MASK; 2014a9c: c6 26 20 10 st %g3, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT16_EOC; 2014aa0: 10 bf ff 1d b 2014714 2014aa4: c4 26 20 14 st %g2, [ %i0 + 0x14 ] * 0 on success, or -1 if error occured and errno set appropriately */ int _fat_block_release(fat_fs_info_t *fs_info) { return fat_buf_release(fs_info); 2014aa8: 7f ff fc 94 call 2013cf8 <== NOT EXECUTED 2014aac: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != FAT_FSINFO_LEAD_SIGNATURE_VALUE) { _fat_block_release(fs_info); close(vol->fd); 2014ab0: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014ab4: 7f ff c1 ae call 200516c <== NOT EXECUTED 2014ab8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); 2014abc: 40 00 1d d8 call 201c21c <__errno> <== NOT EXECUTED 2014ac0: 01 00 00 00 nop <== NOT EXECUTED 2014ac4: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 2014ac8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014acc: 81 c7 e0 08 ret <== NOT EXECUTED 2014ad0: 81 e8 00 00 restore <== NOT EXECUTED } rc = fstat(vol->fd, &stat_buf); if (rc != 0) { close(vol->fd); 2014ad4: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014ad8: 7f ff c1 a5 call 200516c <== NOT EXECUTED 2014adc: 01 00 00 00 nop <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENXIO); 2014ae0: 40 00 1d cf call 201c21c <__errno> <== NOT EXECUTED 2014ae4: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 2014ae8: 82 10 20 06 mov 6, %g1 <== NOT EXECUTED 2014aec: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014af0: 81 c7 e0 08 ret <== NOT EXECUTED 2014af4: 81 e8 00 00 restore <== 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; 2014af8: 10 bf ff 9b b 2014964 2014afc: c0 2e 20 5c clrb [ %i0 + 0x5c ] for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; i >>= 1, vol->sec_log2++); vol->bytes_per_block = vol->bps; vol->bytes_per_block_log2 = vol->sec_log2; vol->sectors_per_block = 1; 2014b00: 10 bf fe a3 b 201458c <== NOT EXECUTED 2014b04: 84 10 20 01 mov 1, %g2 <== NOT EXECUTED { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 2014b08: 10 bf fe b4 b 20145d8 2014b0c: 86 10 20 00 clr %g3 memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); sc = rtems_bdbuf_release( block); if (sc != RTEMS_SUCCESSFUL) { close(vol->fd); 2014b10: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014b14: 7f ff c1 96 call 200516c <== NOT EXECUTED 2014b18: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); 2014b1c: 40 00 1d c0 call 201c21c <__errno> <== NOT EXECUTED 2014b20: 01 00 00 00 nop <== NOT EXECUTED 2014b24: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2014b28: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014b2c: 81 c7 e0 08 ret <== NOT EXECUTED 2014b30: 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 ) { close(vol->fd); 2014b34: 7f ff c1 8e call 200516c <== NOT EXECUTED 2014b38: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014b3c: 7f ff c2 48 call 200545c <== NOT EXECUTED 2014b40: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014b44: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 <== NOT EXECUTED if (fs_info->sec_buf == NULL) { close(vol->fd); free(fs_info->vhash); free(fs_info->rhash); free(fs_info->uino); 2014b48: 7f ff c2 45 call 200545c <== NOT EXECUTED 2014b4c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2014b50: 40 00 1d b3 call 201c21c <__errno> <== NOT EXECUTED 2014b54: 01 00 00 00 nop <== NOT EXECUTED 2014b58: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2014b5c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014b60: 81 c7 e0 08 ret <== NOT EXECUTED 2014b64: 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 ) { close(vol->fd); 2014b68: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014b6c: 7f ff c1 80 call 200516c <== NOT EXECUTED 2014b70: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2014b74: 40 00 1d aa call 201c21c <__errno> <== NOT EXECUTED 2014b78: 01 00 00 00 nop <== NOT EXECUTED 2014b7c: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2014b80: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014b84: 81 c7 e0 08 ret <== NOT EXECUTED 2014b88: 81 e8 00 00 restore <== NOT EXECUTED * 0 on success, or -1 if error occured and errno set appropriately */ int _fat_block_release(fat_fs_info_t *fs_info) { return fat_buf_release(fs_info); 2014b8c: 7f ff fc 5b call 2013cf8 <== NOT EXECUTED 2014b90: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED ret = _fat_block_read(fs_info, vol->info_sec , FAT_FSI_INFO, FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) { _fat_block_release(fs_info); close(vol->fd); 2014b94: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014b98: 7f ff c1 75 call 200516c <== NOT EXECUTED 2014b9c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2014ba0: 81 c7 e0 08 ret <== NOT EXECUTED 2014ba4: 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) { close(vol->fd); 2014ba8: 7f ff c1 71 call 200516c <== NOT EXECUTED 2014bac: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014bb0: 7f ff c2 2b call 200545c <== NOT EXECUTED 2014bb4: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014bb8: 7f ff c2 29 call 200545c <== NOT EXECUTED 2014bbc: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 <== NOT EXECUTED free(fs_info->uino); 2014bc0: 10 bf ff e2 b 2014b48 <== NOT EXECUTED 2014bc4: d0 06 20 74 ld [ %i0 + 0x74 ], %o0 <== 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 ) { close(vol->fd); 2014bc8: 7f ff c1 69 call 200516c <== NOT EXECUTED 2014bcc: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014bd0: 10 bf ff de b 2014b48 <== NOT EXECUTED 2014bd4: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED =============================================================================== 0201a9e8 : uint32_t count, uint32_t *cls_added, uint32_t *last_cl, bool zero_fill ) { 201a9e8: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; 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; 201a9ec: e6 06 20 38 ld [ %i0 + 0x38 ], %l3 bool zero_fill ) { int rc = RC_OK; uint32_t cl4find = 2; uint32_t next_cln = 0; 201a9f0: c0 27 bf fc clr [ %fp + -4 ] uint32_t save_cln = 0; uint32_t data_cls_val = fs_info->vol.data_cls + 2; uint32_t i = 2; ssize_t bytes_written; *cls_added = 0; 201a9f4: c0 26 c0 00 clr [ %i3 ] if (count == 0) 201a9f8: 80 a6 a0 00 cmp %i2, 0 201a9fc: 02 80 00 49 be 201ab20 <== NEVER TAKEN 201aa00: a4 10 20 00 clr %l2 return rc; if (fs_info->vol.next_cl != FAT_UNDEFINED_VALUE) 201aa04: e0 06 20 4c ld [ %i0 + 0x4c ], %l0 201aa08: 80 a4 3f ff cmp %l0, -1 201aa0c: 22 80 00 02 be,a 201aa14 201aa10: a0 10 20 02 mov 2, %l0 { int rc = RC_OK; 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; 201aa14: 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) 201aa18: 80 a4 e0 02 cmp %l3, 2 201aa1c: 08 80 00 4e bleu 201ab54 <== NEVER TAKEN 201aa20: a2 10 20 02 mov 2, %l1 201aa24: 10 80 00 1a b 201aa8c 201aa28: a8 10 20 00 clr %l4 * wouldn't work properly */ if (*cls_added == 0) { *chain = cl4find; rc = fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_EOC); 201aa2c: 90 10 00 18 mov %i0, %o0 201aa30: 92 10 00 10 mov %l0, %o1 201aa34: 7f ff ff 03 call 201a640 201aa38: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201aa3c: 80 a2 20 00 cmp %o0, 0 201aa40: 32 80 00 38 bne,a 201ab20 <== NEVER TAKEN 201aa44: a4 10 00 08 mov %o0, %l2 <== NOT EXECUTED rc = fat_set_fat_cluster(fs_info, save_cln, cl4find); if ( rc != RC_OK ) goto cleanup; } if (zero_fill) 201aa48: 80 a7 60 00 cmp %i5, 0 201aa4c: 32 80 00 37 bne,a 201ab28 201aa50: d6 16 20 06 lduh [ %i0 + 6 ], %o3 goto cleanup; } } save_cln = cl4find; (*cls_added)++; 201aa54: c2 06 c0 00 ld [ %i3 ], %g1 201aa58: 82 00 60 01 inc %g1 /* have we satisfied request ? */ if (*cls_added == count) 201aa5c: 80 a6 80 01 cmp %i2, %g1 201aa60: 02 80 00 53 be 201abac 201aa64: c2 26 c0 00 st %g1, [ %i3 ] 201aa68: a8 10 00 10 mov %l0, %l4 fat_buf_release(fs_info); return rc; } } i++; cl4find++; 201aa6c: a0 04 20 01 inc %l0 if (cl4find >= data_cls_val) 201aa70: 80 a4 c0 10 cmp %l3, %l0 201aa74: 18 80 00 03 bgu 201aa80 <== ALWAYS TAKEN 201aa78: a2 04 60 01 inc %l1 cl4find = 2; 201aa7c: a0 10 20 02 mov 2, %l0 <== 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) 201aa80: 80 a4 c0 11 cmp %l3, %l1 201aa84: 22 80 00 36 be,a 201ab5c <== NEVER TAKEN 201aa88: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 <== NOT EXECUTED { rc = fat_get_fat_cluster(fs_info, cl4find, &next_cln); 201aa8c: 90 10 00 18 mov %i0, %o0 201aa90: 92 10 00 10 mov %l0, %o1 201aa94: 7f ff fe 67 call 201a430 201aa98: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 201aa9c: a4 92 20 00 orcc %o0, 0, %l2 201aaa0: 12 80 00 3b bne 201ab8c <== NEVER TAKEN 201aaa4: c2 07 bf fc ld [ %fp + -4 ], %g1 if (*cls_added != 0) fat_free_fat_clusters_chain(fs_info, (*chain)); return rc; } if (next_cln == FAT_GENFAT_FREE) 201aaa8: 80 a0 60 00 cmp %g1, 0 201aaac: 32 bf ff f1 bne,a 201aa70 201aab0: a0 04 20 01 inc %l0 /* * 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) 201aab4: c2 06 c0 00 ld [ %i3 ], %g1 201aab8: 80 a0 60 00 cmp %g1, 0 201aabc: 22 bf ff dc be,a 201aa2c 201aac0: e0 26 40 00 st %l0, [ %i1 ] } } else { /* set EOC value to new allocated cluster */ rc = fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_EOC); 201aac4: 90 10 00 18 mov %i0, %o0 201aac8: 92 10 00 10 mov %l0, %o1 201aacc: 7f ff fe dd call 201a640 201aad0: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201aad4: 82 92 20 00 orcc %o0, 0, %g1 201aad8: 12 80 00 40 bne 201abd8 <== NEVER TAKEN 201aadc: 92 10 00 14 mov %l4, %o1 /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); return rc; } rc = fat_set_fat_cluster(fs_info, save_cln, cl4find); 201aae0: 90 10 00 18 mov %i0, %o0 201aae4: 7f ff fe d7 call 201a640 201aae8: 94 10 00 10 mov %l0, %o2 if ( rc != RC_OK ) 201aaec: a8 92 20 00 orcc %o0, 0, %l4 201aaf0: 02 bf ff d7 be 201aa4c <== ALWAYS TAKEN 201aaf4: 80 a7 60 00 cmp %i5, 0 return RC_OK; cleanup: /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); 201aaf8: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201aafc: 7f ff ff 83 call 201a908 <== NOT EXECUTED 201ab00: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED /* trying to save last allocated cluster for future use */ fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_FREE); 201ab04: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201ab08: 92 10 00 10 mov %l0, %o1 <== NOT EXECUTED 201ab0c: 7f ff fe cd call 201a640 <== NOT EXECUTED 201ab10: 94 10 20 00 clr %o2 <== NOT EXECUTED fat_buf_release(fs_info); return rc; 201ab14: a4 10 00 14 mov %l4, %l2 <== NOT EXECUTED /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); /* trying to save last allocated cluster for future use */ fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_FREE); fat_buf_release(fs_info); 201ab18: 7f ff e4 78 call 2013cf8 <== NOT EXECUTED 201ab1c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return rc; } 201ab20: 81 c7 e0 08 ret 201ab24: 91 e8 00 12 restore %g0, %l2, %o0 goto cleanup; } if (zero_fill) { bytes_written = fat_cluster_set (fs_info, cl4find, 0, fs_info->vol.bpc, 0); 201ab28: 90 10 00 18 mov %i0, %o0 201ab2c: 92 10 00 10 mov %l0, %o1 201ab30: 94 10 20 00 clr %o2 201ab34: 7f ff e5 62 call 20140bc 201ab38: 98 10 20 00 clr %o4 if (fs_info->vol.bpc != bytes_written) 201ab3c: c2 16 20 06 lduh [ %i0 + 6 ], %g1 201ab40: 80 a0 40 08 cmp %g1, %o0 201ab44: 22 bf ff c5 be,a 201aa58 <== ALWAYS TAKEN 201ab48: c2 06 c0 00 ld [ %i3 ], %g1 { rc = -1; 201ab4c: 10 bf ff eb b 201aaf8 <== NOT EXECUTED 201ab50: a8 10 3f ff mov -1, %l4 <== 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) 201ab54: 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 != FAT_UNDEFINED_VALUE) 201ab58: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 <== NOT EXECUTED 201ab5c: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201ab60: 02 80 00 05 be 201ab74 <== NOT EXECUTED 201ab64: e8 26 20 4c st %l4, [ %i0 + 0x4c ] <== NOT EXECUTED fs_info->vol.free_cls -= (*cls_added); 201ab68: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201ab6c: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201ab70: c2 26 20 44 st %g1, [ %i0 + 0x44 ] <== NOT EXECUTED *last_cl = save_cln; 201ab74: e8 27 00 00 st %l4, [ %i4 ] <== NOT EXECUTED fat_buf_release(fs_info); 201ab78: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201ab7c: 7f ff e4 5f call 2013cf8 <== NOT EXECUTED 201ab80: a4 10 20 00 clr %l2 <== NOT EXECUTED fat_free_fat_clusters_chain(fs_info, (*chain)); /* trying to save last allocated cluster for future use */ fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_FREE); fat_buf_release(fs_info); return rc; } 201ab84: 81 c7 e0 08 ret <== NOT EXECUTED 201ab88: 91 e8 00 12 restore %g0, %l2, %o0 <== NOT EXECUTED while (i < data_cls_val) { rc = fat_get_fat_cluster(fs_info, cl4find, &next_cln); if ( rc != RC_OK ) { if (*cls_added != 0) 201ab8c: c2 06 c0 00 ld [ %i3 ], %g1 <== NOT EXECUTED 201ab90: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 201ab94: 02 bf ff e3 be 201ab20 <== NOT EXECUTED 201ab98: 01 00 00 00 nop <== NOT EXECUTED fat_free_fat_clusters_chain(fs_info, (*chain)); 201ab9c: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201aba0: 7f ff ff 5a call 201a908 <== NOT EXECUTED 201aba4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201aba8: 30 bf ff de b,a 201ab20 <== NOT EXECUTED /* have we satisfied request ? */ if (*cls_added == count) { fs_info->vol.next_cl = save_cln; if (fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201abac: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 201abb0: 80 a0 7f ff cmp %g1, -1 201abb4: 02 80 00 05 be 201abc8 <== ALWAYS TAKEN 201abb8: e0 26 20 4c st %l0, [ %i0 + 0x4c ] fs_info->vol.free_cls -= (*cls_added); 201abbc: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201abc0: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201abc4: c2 26 20 44 st %g1, [ %i0 + 0x44 ] <== NOT EXECUTED *last_cl = save_cln; 201abc8: e0 27 00 00 st %l0, [ %i4 ] fat_buf_release(fs_info); 201abcc: 7f ff e4 4b call 2013cf8 201abd0: 90 10 00 18 mov %i0, %o0 201abd4: 30 bf ff d3 b,a 201ab20 /* set EOC value to new allocated cluster */ rc = fat_set_fat_cluster(fs_info, cl4find, FAT_GENFAT_EOC); if ( rc != RC_OK ) { /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); 201abd8: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201abdc: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201abe0: 7f ff ff 4a call 201a908 <== NOT EXECUTED 201abe4: a4 10 00 01 mov %g1, %l2 <== NOT EXECUTED 201abe8: 30 bf ff ce b,a 201ab20 <== NOT EXECUTED =============================================================================== 0201400c : fat_fs_info_t *fs_info, uint32_t start, uint32_t offset, uint32_t count, const void *buff) { 201400c: 9d e3 bf 98 save %sp, -104, %sp uint32_t sec_num = start; uint32_t ofs = offset; uint8_t *sec_buf; uint32_t c = 0; while(count > 0) 2014010: 80 a6 e0 00 cmp %i3, 0 2014014: 02 80 00 28 be 20140b4 <== NEVER TAKEN 2014018: a0 10 20 00 clr %l0 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 201401c: 10 80 00 12 b 2014064 2014020: a2 10 20 01 mov 1, %l1 c = MIN(count, (fs_info->vol.bps - ofs)); if (c == fs_info->vol.bytes_per_block) rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &sec_buf); else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); 2014024: 96 07 bf fc add %fp, -4, %o3 2014028: 7f ff ff ab call 2013ed4 201402c: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 2014030: 92 07 00 10 add %i4, %l0, %o1 if (c == fs_info->vol.bytes_per_block) rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &sec_buf); else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) 2014034: 80 a2 20 00 cmp %o0, 0 2014038: 12 80 00 1e bne 20140b0 <== NEVER TAKEN 201403c: 94 10 00 1d mov %i5, %o2 return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 2014040: d0 07 bf fc ld [ %fp + -4 ], %o0 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; 2014044: a0 07 40 10 add %i5, %l0, %l0 else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 2014048: 40 00 23 34 call 201cd18 201404c: 90 02 00 1a add %o0, %i2, %o0 2014050: e2 2e 20 88 stb %l1, [ %i0 + 0x88 ] fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; sec_num++; 2014054: b2 06 60 01 inc %i1 uint32_t sec_num = start; uint32_t ofs = offset; uint8_t *sec_buf; uint32_t c = 0; while(count > 0) 2014058: b6 a6 c0 1d subcc %i3, %i5, %i3 201405c: 02 80 00 16 be 20140b4 <== ALWAYS TAKEN 2014060: b4 10 20 00 clr %i2 { c = MIN(count, (fs_info->vol.bps - ofs)); 2014064: fa 16 00 00 lduh [ %i0 ], %i5 2014068: ba 27 40 1a sub %i5, %i2, %i5 201406c: 80 a7 40 1b cmp %i5, %i3 2014070: 08 80 00 03 bleu 201407c 2014074: 92 10 00 19 mov %i1, %o1 2014078: ba 10 00 1b mov %i3, %i5 if (c == fs_info->vol.bytes_per_block) 201407c: c2 16 20 0a lduh [ %i0 + 0xa ], %g1 2014080: 80 a0 40 1d cmp %g1, %i5 2014084: 12 bf ff e8 bne 2014024 <== ALWAYS TAKEN 2014088: 94 10 20 01 mov 1, %o2 rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &sec_buf); 201408c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2014090: 94 10 20 02 mov 2, %o2 <== NOT EXECUTED 2014094: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2014098: 7f ff ff 8f call 2013ed4 <== NOT EXECUTED 201409c: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 20140a0: 92 07 00 10 add %i4, %l0, %o1 <== NOT EXECUTED if (c == fs_info->vol.bytes_per_block) rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &sec_buf); else rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) 20140a4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20140a8: 02 bf ff e6 be 2014040 <== NOT EXECUTED 20140ac: 94 10 00 1d mov %i5, %o2 <== NOT EXECUTED return -1; 20140b0: a0 10 3f ff mov -1, %l0 <== NOT EXECUTED cmpltd +=c; sec_num++; ofs = 0; } return cmpltd; } 20140b4: 81 c7 e0 08 ret 20140b8: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 0201a640 : fat_set_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t in_val ) { 201a640: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; uint32_t sec = 0; uint32_t ofs = 0; uint16_t fat16_clv = 0; uint32_t fat32_clv = 0; uint8_t *sec_buf = NULL; 201a644: c0 27 bf fc clr [ %fp + -4 ] /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201a648: 80 a6 60 01 cmp %i1, 1 201a64c: 08 80 00 26 bleu 201a6e4 <== NEVER TAKEN 201a650: ba 10 00 18 mov %i0, %i5 201a654: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 201a658: 82 00 60 01 inc %g1 201a65c: 80 a6 40 01 cmp %i1, %g1 201a660: 18 80 00 21 bgu 201a6e4 <== NEVER TAKEN 201a664: 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) + 201a668: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 201a66c: 80 88 60 01 btst 1, %g1 201a670: 12 80 00 23 bne 201a6fc 201a674: e0 0e 20 02 ldub [ %i0 + 2 ], %l0 201a678: 82 08 60 02 and %g1, 2, %g1 201a67c: 80 88 60 ff btst 0xff, %g1 201a680: 02 80 00 25 be 201a714 201a684: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201a688: b9 2e 60 01 sll %i1, 1, %i4 201a68c: a1 37 00 10 srl %i4, %l0, %l0 201a690: a0 04 00 01 add %l0, %g1, %l0 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201a694: e2 17 40 00 lduh [ %i5 ], %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); 201a698: 90 10 00 1d mov %i5, %o0 201a69c: 92 10 00 10 mov %l0, %o1 201a6a0: 94 10 20 01 mov 1, %o2 201a6a4: 7f ff e6 0c call 2013ed4 201a6a8: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201a6ac: b0 92 20 00 orcc %o0, 0, %i0 201a6b0: 12 80 00 11 bne 201a6f4 <== NEVER TAKEN 201a6b4: a3 2c 60 10 sll %l1, 0x10, %l1 return rc; switch ( fs_info->vol.type ) 201a6b8: f6 0f 60 0e ldub [ %i5 + 0xe ], %i3 201a6bc: 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); 201a6c0: a3 34 60 10 srl %l1, 0x10, %l1 201a6c4: a2 04 7f ff add %l1, -1, %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201a6c8: 02 80 00 17 be 201a724 201a6cc: b8 0f 00 11 and %i4, %l1, %i4 201a6d0: 80 a6 e0 04 cmp %i3, 4 201a6d4: 02 80 00 3b be 201a7c0 201a6d8: 80 a6 e0 01 cmp %i3, 1 201a6dc: 02 80 00 1f be 201a758 <== ALWAYS TAKEN 201a6e0: 80 8e 60 01 btst 1, %i1 fat_buf_mark_modified(fs_info); break; default: rtems_set_errno_and_return_minus_one(EIO); 201a6e4: 40 00 06 ce call 201c21c <__errno> <== NOT EXECUTED 201a6e8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201a6ec: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201a6f0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED break; } return RC_OK; } 201a6f4: 81 c7 e0 08 ret <== NOT EXECUTED 201a6f8: 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) + 201a6fc: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201a700: b9 36 60 01 srl %i1, 1, %i4 201a704: b8 07 00 19 add %i4, %i1, %i4 201a708: a1 37 00 10 srl %i4, %l0, %l0 201a70c: 10 bf ff e2 b 201a694 201a710: a0 04 00 01 add %l0, %g1, %l0 201a714: b9 2e 60 02 sll %i1, 2, %i4 201a718: a1 37 00 10 srl %i4, %l0, %l0 201a71c: 10 bf ff de b 201a694 201a720: a0 04 00 01 add %l0, %g1, %l0 } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = (uint16_t )(CT_LE_W(in_val)); 201a724: 83 2e a0 10 sll %i2, 0x10, %g1 201a728: 83 30 60 18 srl %g1, 0x18, %g1 break; } return RC_OK; } 201a72c: 05 00 00 3f sethi %hi(0xfc00), %g2 201a730: 84 10 a3 ff or %g2, 0x3ff, %g2 ! ffff 201a734: b4 0e 80 02 and %i2, %g2, %i2 } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = (uint16_t )(CT_LE_W(in_val)); 201a738: b5 2e a0 08 sll %i2, 8, %i2 201a73c: b4 16 80 01 or %i2, %g1, %i2 } } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = 201a740: c2 07 bf fc ld [ %fp + -4 ], %g1 201a744: f4 30 40 1c sth %i2, [ %g1 + %i4 ] } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 201a748: 82 10 20 01 mov 1, %g1 201a74c: c2 2f 60 88 stb %g1, [ %i5 + 0x88 ] 201a750: 81 c7 e0 08 ret 201a754: 81 e8 00 00 restore return rc; switch ( fs_info->vol.type ) { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) 201a758: 02 80 00 30 be 201a818 201a75c: c2 07 bf fc ld [ %fp + -4 ], %g1 { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *(sec_buf + ofs) &= 0x0F; *(sec_buf + ofs) |= (uint8_t)(fat16_clv & 0x00F0); 201a760: 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; *(sec_buf + ofs) &= 0x0F; 201a764: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201a768: 86 08 e0 0f and %g3, 0xf, %g3 201a76c: c6 28 40 1c stb %g3, [ %g1 + %i4 ] *(sec_buf + ofs) |= (uint8_t)(fat16_clv & 0x00F0); 201a770: c2 07 bf fc ld [ %fp + -4 ], %g1 201a774: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201a778: 84 10 c0 02 or %g3, %g2, %g2 201a77c: c4 28 40 1c stb %g2, [ %g1 + %i4 ] fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201a780: c2 17 40 00 lduh [ %i5 ], %g1 201a784: 82 00 7f ff add %g1, -1, %g1 201a788: 80 a0 40 1c cmp %g1, %i4 201a78c: 02 80 00 3a be 201a874 <== NEVER TAKEN 201a790: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0x00; 201a794: c2 07 bf fc ld [ %fp + -4 ], %g1 201a798: b8 07 20 01 inc %i4 201a79c: c0 28 40 1c clrb [ %g1 + %i4 ] *(sec_buf + ofs + 1) |= (uint8_t )((fat16_clv & 0xFF00)>>8); 201a7a0: c2 07 bf fc ld [ %fp + -4 ], %g1 201a7a4: b5 2e a0 14 sll %i2, 0x14, %i2 201a7a8: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201a7ac: b5 36 a0 18 srl %i2, 0x18, %i2 201a7b0: 84 10 80 1a or %g2, %i2, %g2 201a7b4: c4 28 40 1c stb %g2, [ %g1 + %i4 ] 201a7b8: 81 c7 e0 08 ret 201a7bc: 81 e8 00 00 restore break; case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); *((uint32_t *)(sec_buf + ofs)) &= CT_LE_L(0xF0000000); 201a7c0: c4 07 bf fc ld [ %fp + -4 ], %g2 (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)); 201a7c4: 03 3c 00 00 sethi %hi(0xf0000000), %g1 *((uint32_t *)(sec_buf + ofs)) &= CT_LE_L(0xF0000000); 201a7c8: c6 00 80 1c ld [ %g2 + %i4 ], %g3 (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)); 201a7cc: 82 2e 80 01 andn %i2, %g1, %g1 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201a7d0: 89 30 60 18 srl %g1, 0x18, %g4 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201a7d4: b7 30 60 08 srl %g1, 8, %i3 *((uint32_t *)(sec_buf + ofs)) &= CT_LE_L(0xF0000000); 201a7d8: 86 08 e0 f0 and %g3, 0xf0, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a7dc: b5 2e a0 18 sll %i2, 0x18, %i2 { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201a7e0: b6 0e e0 ff and %i3, 0xff, %i3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a7e4: b4 16 80 04 or %i2, %g4, %i2 201a7e8: b7 2e e0 10 sll %i3, 0x10, %i3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201a7ec: 89 30 60 10 srl %g1, 0x10, %g4 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a7f0: 82 16 80 1b or %i2, %i3, %g1 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201a7f4: 88 09 20 ff and %g4, 0xff, %g4 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201a7f8: 89 29 20 08 sll %g4, 8, %g4 201a7fc: 82 10 40 04 or %g1, %g4, %g1 *((uint32_t *)(sec_buf + ofs)) |= fat32_clv; 201a800: 82 10 40 03 or %g1, %g3, %g1 201a804: c2 20 80 1c st %g1, [ %g2 + %i4 ] 201a808: 82 10 20 01 mov 1, %g1 201a80c: c2 2f 60 88 stb %g1, [ %i5 + 0x88 ] 201a810: 81 c7 e0 08 ret 201a814: 81 e8 00 00 restore *(sec_buf + ofs + 1) |= (uint8_t )((fat16_clv & 0xFF00)>>8); } } else { fat16_clv = ((uint16_t )in_val) & FAT_FAT12_MASK; 201a818: b4 0e af ff and %i2, 0xfff, %i2 *(sec_buf + ofs) &= 0x00; 201a81c: c0 28 40 1c clrb [ %g1 + %i4 ] *(sec_buf + ofs) |= (uint8_t)(fat16_clv & 0x00FF); 201a820: c2 07 bf fc ld [ %fp + -4 ], %g1 201a824: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201a828: 84 10 80 1a or %g2, %i2, %g2 201a82c: c4 28 40 1c stb %g2, [ %g1 + %i4 ] fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201a830: c2 17 40 00 lduh [ %i5 ], %g1 201a834: 82 00 7f ff add %g1, -1, %g1 201a838: 80 a0 40 1c cmp %g1, %i4 201a83c: 02 80 00 20 be 201a8bc <== NEVER TAKEN 201a840: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0xF0; 201a844: c2 07 bf fc ld [ %fp + -4 ], %g1 201a848: b8 07 20 01 inc %i4 201a84c: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 *(sec_buf + ofs+1) |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a850: b5 36 a0 08 srl %i2, 8, %i2 fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0xF0; 201a854: 84 08 bf f0 and %g2, -16, %g2 201a858: c4 28 40 1c stb %g2, [ %g1 + %i4 ] *(sec_buf + ofs+1) |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a85c: c2 07 bf fc ld [ %fp + -4 ], %g1 201a860: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201a864: b4 10 80 1a or %g2, %i2, %i2 201a868: f4 28 40 1c stb %i2, [ %g1 + %i4 ] 201a86c: 81 c7 e0 08 ret 201a870: 81 e8 00 00 restore 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, 201a874: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201a878: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201a87c: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201a880: 7f ff e5 95 call 2013ed4 <== NOT EXECUTED 201a884: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201a888: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201a88c: 12 bf ff 9a bne 201a6f4 <== NOT EXECUTED 201a890: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED return rc; *sec_buf &= 0x00; *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a894: 87 2e a0 14 sll %i2, 0x14, %g3 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return rc; *sec_buf &= 0x00; 201a898: c0 28 40 00 clrb [ %g1 ] <== NOT EXECUTED *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a89c: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201a8a0: 87 30 e0 18 srl %g3, 0x18, %g3 <== NOT EXECUTED 201a8a4: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201a8a8: 84 10 c0 02 or %g3, %g2, %g2 <== NOT EXECUTED 201a8ac: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201a8b0: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] <== NOT EXECUTED 201a8b4: 81 c7 e0 08 ret <== NOT EXECUTED 201a8b8: 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, 201a8bc: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201a8c0: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201a8c4: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201a8c8: 7f ff e5 83 call 2013ed4 <== NOT EXECUTED 201a8cc: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201a8d0: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201a8d4: 12 bf ff 88 bne 201a6f4 <== NOT EXECUTED 201a8d8: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED return rc; *sec_buf &= 0xF0; *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a8dc: b5 36 a0 08 srl %i2, 8, %i2 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &sec_buf); if (rc != RC_OK) return rc; *sec_buf &= 0xF0; 201a8e0: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201a8e4: 84 08 bf f0 and %g2, -16, %g2 <== NOT EXECUTED 201a8e8: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201a8ec: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201a8f0: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201a8f4: 84 16 80 02 or %i2, %g2, %g2 <== NOT EXECUTED 201a8f8: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201a8fc: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] <== NOT EXECUTED 201a900: 81 c7 e0 08 ret <== NOT EXECUTED 201a904: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02014d00 : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_shutdown_drive(fat_fs_info_t *fs_info) { 2014d00: 9d e3 bf a0 save %sp, -96, %sp int rc = RC_OK; int i = 0; rc = fat_sync(fs_info); 2014d04: 90 10 00 18 mov %i0, %o0 2014d08: 7f ff ff b4 call 2014bd8 2014d0c: b8 10 00 18 mov %i0, %i4 if ( rc != RC_OK ) 2014d10: b0 92 20 00 orcc %o0, 0, %i0 2014d14: 32 80 00 35 bne,a 2014de8 <== NEVER TAKEN 2014d18: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rc = -1; 2014d1c: b6 10 20 00 clr %i3 for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->vhash + i; 2014d20: fa 07 20 6c ld [ %i4 + 0x6c ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014d24: 10 80 00 04 b 2014d34 2014d28: ba 07 40 1b add %i5, %i3, %i5 free(node); 2014d2c: 7f ff c1 cc call 200545c <== NOT EXECUTED 2014d30: 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 ); 2014d34: 7f ff d6 e1 call 200a8b8 <_Chain_Get> 2014d38: 90 10 00 1d mov %i5, %o0 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 ) 2014d3c: 80 a2 20 00 cmp %o0, 0 2014d40: 12 bf ff fb bne 2014d2c <== NEVER TAKEN 2014d44: 01 00 00 00 nop 2014d48: b6 06 e0 0c add %i3, 0xc, %i3 rc = fat_sync(fs_info); if ( rc != RC_OK ) rc = -1; for (i = 0; i < FAT_HASH_SIZE; i++) 2014d4c: 80 a6 e0 18 cmp %i3, 0x18 2014d50: 32 bf ff f5 bne,a 2014d24 2014d54: fa 07 20 6c ld [ %i4 + 0x6c ], %i5 2014d58: b6 10 20 00 clr %i3 } for (i = 0; i < FAT_HASH_SIZE; i++) { rtems_chain_node *node = NULL; rtems_chain_control *the_chain = fs_info->rhash + i; 2014d5c: fa 07 20 70 ld [ %i4 + 0x70 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014d60: 10 80 00 04 b 2014d70 2014d64: ba 07 40 1b add %i5, %i3, %i5 free(node); 2014d68: 7f ff c1 bd call 200545c <== NOT EXECUTED 2014d6c: 01 00 00 00 nop <== NOT EXECUTED 2014d70: 7f ff d6 d2 call 200a8b8 <_Chain_Get> 2014d74: 90 10 00 1d mov %i5, %o0 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 ) 2014d78: 80 a2 20 00 cmp %o0, 0 2014d7c: 12 bf ff fb bne 2014d68 <== NEVER TAKEN 2014d80: 01 00 00 00 nop 2014d84: b6 06 e0 0c add %i3, 0xc, %i3 while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } for (i = 0; i < FAT_HASH_SIZE; i++) 2014d88: 80 a6 e0 18 cmp %i3, 0x18 2014d8c: 32 bf ff f5 bne,a 2014d60 2014d90: fa 07 20 70 ld [ %i4 + 0x70 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } free(fs_info->vhash); 2014d94: 7f ff c1 b2 call 200545c 2014d98: d0 07 20 6c ld [ %i4 + 0x6c ], %o0 free(fs_info->rhash); 2014d9c: 7f ff c1 b0 call 200545c 2014da0: d0 07 20 70 ld [ %i4 + 0x70 ], %o0 free(fs_info->uino); 2014da4: 7f ff c1 ae call 200545c 2014da8: d0 07 20 74 ld [ %i4 + 0x74 ], %o0 free(fs_info->sec_buf); 2014dac: 7f ff c1 ac call 200545c 2014db0: d0 07 20 90 ld [ %i4 + 0x90 ], %o0 close(fs_info->vol.fd); 2014db4: 7f ff c0 ee call 200516c 2014db8: d0 07 20 60 ld [ %i4 + 0x60 ], %o0 if (rc) 2014dbc: 80 a6 20 00 cmp %i0, 0 2014dc0: 12 80 00 04 bne 2014dd0 <== NEVER TAKEN 2014dc4: 01 00 00 00 nop errno = EIO; return rc; } 2014dc8: 81 c7 e0 08 ret 2014dcc: 81 e8 00 00 restore free(fs_info->uino); free(fs_info->sec_buf); close(fs_info->vol.fd); if (rc) errno = EIO; 2014dd0: 40 00 1d 13 call 201c21c <__errno> <== NOT EXECUTED 2014dd4: 01 00 00 00 nop <== NOT EXECUTED 2014dd8: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2014ddc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED return rc; } 2014de0: 81 c7 e0 08 ret <== NOT EXECUTED 2014de4: 81 e8 00 00 restore <== NOT EXECUTED int rc = RC_OK; int i = 0; rc = fat_sync(fs_info); if ( rc != RC_OK ) rc = -1; 2014de8: 10 bf ff ce b 2014d20 <== NOT EXECUTED 2014dec: b6 10 20 00 clr %i3 <== NOT EXECUTED =============================================================================== 02014bd8 : return RC_OK; } int fat_sync(fat_fs_info_t *fs_info) { 2014bd8: 9d e3 bf 98 save %sp, -104, %sp static int fat_fat32_update_fsinfo_sector(fat_fs_info_t *fs_info) { ssize_t ret1 = 0, ret2 = 0; if (fs_info->vol.type == FAT_FAT32) 2014bdc: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 2014be0: 80 a0 60 04 cmp %g1, 4 2014be4: 02 80 00 0c be 2014c14 2014be8: ba 10 00 18 mov %i0, %i5 FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, sizeof(le_free_count), &le_free_count); } if (next_free != fs_info->vol.next_cl_in_fs_info) 2014bec: b0 10 20 00 clr %i0 rc = fat_fat32_update_fsinfo_sector(fs_info); if ( rc != RC_OK ) rc = -1; fat_buf_release(fs_info); 2014bf0: 7f ff fc 42 call 2013cf8 2014bf4: 90 10 00 1d mov %i5, %o0 if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) 2014bf8: 7f ff f5 05 call 201200c 2014bfc: d0 07 60 64 ld [ %i5 + 0x64 ], %o0 2014c00: 80 a2 20 00 cmp %o0, 0 2014c04: 12 80 00 3d bne 2014cf8 <== NEVER TAKEN 2014c08: 01 00 00 00 nop rc = -1; return rc; } 2014c0c: 81 c7 e0 08 ret 2014c10: 81 e8 00 00 restore { ssize_t ret1 = 0, ret2 = 0; if (fs_info->vol.type == FAT_FAT32) { uint32_t free_count = fs_info->vol.free_cls; 2014c14: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 uint32_t next_free = fs_info->vol.next_cl; if (free_count != fs_info->vol.free_cls_in_fs_info) 2014c18: c4 06 20 48 ld [ %i0 + 0x48 ], %g2 ssize_t ret1 = 0, ret2 = 0; if (fs_info->vol.type == FAT_FAT32) { uint32_t free_count = fs_info->vol.free_cls; uint32_t next_free = fs_info->vol.next_cl; 2014c1c: f8 06 20 4c ld [ %i0 + 0x4c ], %i4 if (free_count != fs_info->vol.free_cls_in_fs_info) 2014c20: 80 a0 40 02 cmp %g1, %g2 2014c24: 02 80 00 16 be 2014c7c <== ALWAYS TAKEN 2014c28: b6 10 20 00 clr %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2014c2c: 85 30 60 18 srl %g1, 0x18, %g2 <== NOT EXECUTED { uint32_t le_free_count = CT_LE_L(free_count); fs_info->vol.free_cls_in_fs_info = free_count; ret1 = fat_sector_write(fs_info, 2014c30: d2 16 20 40 lduh [ %i0 + 0x40 ], %o1 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014c34: 87 28 60 18 sll %g1, 0x18, %g3 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2014c38: 89 30 60 08 srl %g1, 8, %g4 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014c3c: 86 10 c0 02 or %g3, %g2, %g3 <== NOT EXECUTED if (free_count != fs_info->vol.free_cls_in_fs_info) { uint32_t le_free_count = CT_LE_L(free_count); fs_info->vol.free_cls_in_fs_info = free_count; 2014c40: c2 26 20 48 st %g1, [ %i0 + 0x48 ] <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2014c44: 85 30 60 10 srl %g1, 0x10, %g2 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; 2014c48: 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; 2014c4c: 84 08 a0 ff and %g2, 0xff, %g2 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014c50: 89 29 20 10 sll %g4, 0x10, %g4 <== NOT EXECUTED 2014c54: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 2014c58: 86 10 c0 04 or %g3, %g4, %g3 <== NOT EXECUTED 2014c5c: 82 10 c0 02 or %g3, %g2, %g1 <== NOT EXECUTED ret1 = fat_sector_write(fs_info, 2014c60: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED uint32_t free_count = fs_info->vol.free_cls; uint32_t next_free = fs_info->vol.next_cl; if (free_count != fs_info->vol.free_cls_in_fs_info) { uint32_t le_free_count = CT_LE_L(free_count); 2014c64: c2 27 bf fc st %g1, [ %fp + -4 ] <== NOT EXECUTED fs_info->vol.free_cls_in_fs_info = free_count; ret1 = fat_sector_write(fs_info, 2014c68: 94 10 21 e8 mov 0x1e8, %o2 <== NOT EXECUTED 2014c6c: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2014c70: 7f ff fc e7 call 201400c <== NOT EXECUTED 2014c74: 98 07 bf fc add %fp, -4, %o4 <== NOT EXECUTED 2014c78: b7 32 20 1f srl %o0, 0x1f, %i3 <== NOT EXECUTED FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, sizeof(le_free_count), &le_free_count); } if (next_free != fs_info->vol.next_cl_in_fs_info) 2014c7c: c4 07 60 50 ld [ %i5 + 0x50 ], %g2 2014c80: 80 a7 00 02 cmp %i4, %g2 2014c84: 02 80 00 16 be 2014cdc <== NEVER TAKEN 2014c88: 90 10 20 00 clr %o0 2014c8c: 85 2f 20 18 sll %i4, 0x18, %g2 { uint32_t le_next_free = CT_LE_L(next_free); fs_info->vol.next_cl_in_fs_info = next_free; ret2 = fat_sector_write(fs_info, 2014c90: d2 17 60 40 lduh [ %i5 + 0x40 ], %o1 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2014c94: 83 37 20 18 srl %i4, 0x18, %g1 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2014c98: 87 37 20 08 srl %i4, 8, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014c9c: 82 10 80 01 or %g2, %g1, %g1 { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2014ca0: 86 08 e0 ff and %g3, 0xff, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2014ca4: 85 37 20 10 srl %i4, 0x10, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014ca8: 87 28 e0 10 sll %g3, 0x10, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2014cac: 84 08 a0 ff and %g2, 0xff, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014cb0: 82 10 40 03 or %g1, %g3, %g1 2014cb4: 85 28 a0 08 sll %g2, 8, %g2 2014cb8: 82 10 40 02 or %g1, %g2, %g1 if (next_free != fs_info->vol.next_cl_in_fs_info) { uint32_t le_next_free = CT_LE_L(next_free); fs_info->vol.next_cl_in_fs_info = next_free; 2014cbc: f8 27 60 50 st %i4, [ %i5 + 0x50 ] ret2 = fat_sector_write(fs_info, 2014cc0: 90 10 00 1d mov %i5, %o0 &le_free_count); } if (next_free != fs_info->vol.next_cl_in_fs_info) { uint32_t le_next_free = CT_LE_L(next_free); 2014cc4: c2 27 bf fc st %g1, [ %fp + -4 ] fs_info->vol.next_cl_in_fs_info = next_free; ret2 = fat_sector_write(fs_info, 2014cc8: 94 10 21 ec mov 0x1ec, %o2 2014ccc: 96 10 20 04 mov 4, %o3 2014cd0: 7f ff fc cf call 201400c 2014cd4: 98 07 bf fc add %fp, -4, %o4 2014cd8: 91 32 20 1f srl %o0, 0x1f, %o0 sizeof(le_next_free), &le_next_free); } } if ( (ret1 < 0) || (ret2 < 0) ) 2014cdc: 80 8a 20 ff btst 0xff, %o0 2014ce0: 12 80 00 04 bne 2014cf0 <== NEVER TAKEN 2014ce4: 80 8e e0 ff btst 0xff, %i3 2014ce8: 22 bf ff c2 be,a 2014bf0 <== ALWAYS TAKEN 2014cec: b0 10 20 00 clr %i0 { int rc = RC_OK; rc = fat_fat32_update_fsinfo_sector(fs_info); if ( rc != RC_OK ) rc = -1; 2014cf0: 10 bf ff c0 b 2014bf0 <== NOT EXECUTED 2014cf4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED fat_buf_release(fs_info); if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) rc = -1; 2014cf8: 81 c7 e0 08 ret <== NOT EXECUTED 2014cfc: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED =============================================================================== 02036968 : /** * compatible with SVr4, 4.4BSD and X/OPEN - Change Directory */ int fchdir( int fd ) { 2036968: 9d e3 bf 40 save %sp, -192, %sp st.st_mode = 0; st.st_uid = 0; st.st_gid = 0; rtems_libio_check_fd( fd ); 203696c: 03 00 81 86 sethi %hi(0x2061800), %g1 2036970: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 ! 2061980 int rv = 0; rtems_libio_t *iop; struct stat st; rtems_filesystem_location_info_t loc; st.st_mode = 0; 2036974: c0 27 bf c4 clr [ %fp + -60 ] st.st_uid = 0; 2036978: c0 37 bf ca clrh [ %fp + -54 ] st.st_gid = 0; rtems_libio_check_fd( fd ); 203697c: 80 a6 00 01 cmp %i0, %g1 2036980: 1a 80 00 3d bcc 2036a74 2036984: c0 37 bf cc clrh [ %fp + -52 ] iop = rtems_libio_iop( fd ); 2036988: 03 00 81 96 sethi %hi(0x2065800), %g1 203698c: fa 00 62 ac ld [ %g1 + 0x2ac ], %i5 ! 2065aac 2036990: 83 2e 20 03 sll %i0, 3, %g1 2036994: b1 2e 20 06 sll %i0, 6, %i0 2036998: b0 26 00 01 sub %i0, %g1, %i0 203699c: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open( iop ); 20369a0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20369a4: 80 88 61 00 btst 0x100, %g1 20369a8: 02 80 00 33 be 2036a74 20369ac: 01 00 00 00 nop static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 20369b0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 20369b4: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20369b8: c2 00 40 00 ld [ %g1 ], %g1 20369bc: 9f c0 40 00 call %g1 20369c0: b8 07 60 14 add %i5, 0x14, %i4 rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, &st ); 20369c4: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 20369c8: 90 10 00 1c mov %i4, %o0 20369cc: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 20369d0: 9f c0 40 00 call %g1 20369d4: 92 07 bf b8 add %fp, -72, %o1 if ( rv == 0 ) { 20369d8: b0 92 20 00 orcc %o0, 0, %i0 20369dc: 02 80 00 09 be 2036a00 <== ALWAYS TAKEN 20369e0: d2 07 bf c4 ld [ %fp + -60 ], %o1 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 20369e4: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED (*mt_entry->ops->unlock_h)( mt_entry ); 20369e8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 <== NOT EXECUTED 20369ec: c2 00 60 04 ld [ %g1 + 4 ], %g1 <== NOT EXECUTED 20369f0: 9f c0 40 00 call %g1 <== NOT EXECUTED 20369f4: 01 00 00 00 nop <== NOT EXECUTED if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 20369f8: 81 c7 e0 08 ret <== NOT EXECUTED 20369fc: 81 e8 00 00 restore <== NOT EXECUTED rtems_libio_check_is_open( iop ); rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, &st ); if ( rv == 0 ) { bool access_ok = rtems_filesystem_check_access( 2036a00: d4 17 bf ca lduh [ %fp + -54 ], %o2 2036a04: d6 17 bf cc lduh [ %fp + -52 ], %o3 2036a08: 7f ff 61 54 call 200ef58 2036a0c: 90 10 20 01 mov 1, %o0 st.st_mode, st.st_uid, st.st_gid ); if ( access_ok ) { 2036a10: 80 8a 20 ff btst 0xff, %o0 2036a14: 02 80 00 0d be 2036a48 2036a18: 92 10 00 1c mov %i4, %o1 rtems_filesystem_location_clone( &loc, &iop->pathinfo ); 2036a1c: 7f ff 60 05 call 200ea30 2036a20: 90 07 bf a0 add %fp, -96, %o0 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2036a24: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2036a28: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2036a2c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2036a30: 9f c0 40 00 call %g1 2036a34: 01 00 00 00 nop } } rtems_filesystem_instance_unlock( &iop->pathinfo ); if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); 2036a38: 7f ff bf a8 call 20268d8 2036a3c: 90 07 bf a0 add %fp, -96, %o0 2036a40: 81 c7 e0 08 ret 2036a44: 91 e8 00 08 restore %g0, %o0, %o0 ); if ( access_ok ) { rtems_filesystem_location_clone( &loc, &iop->pathinfo ); } else { errno = EACCES; 2036a48: 40 00 11 73 call 203b014 <__errno> 2036a4c: b0 10 3f ff mov -1, %i0 2036a50: 82 10 20 0d mov 0xd, %g1 2036a54: c2 22 00 00 st %g1, [ %o0 ] static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2036a58: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2036a5c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2036a60: c2 00 60 04 ld [ %g1 + 4 ], %g1 2036a64: 9f c0 40 00 call %g1 2036a68: 01 00 00 00 nop if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 2036a6c: 81 c7 e0 08 ret 2036a70: 81 e8 00 00 restore st.st_uid = 0; st.st_gid = 0; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open( iop ); 2036a74: 40 00 11 68 call 203b014 <__errno> 2036a78: b0 10 3f ff mov -1, %i0 2036a7c: 82 10 20 09 mov 9, %g1 2036a80: c2 22 00 00 st %g1, [ %o0 ] 2036a84: 81 c7 e0 08 ret 2036a88: 81 e8 00 00 restore =============================================================================== 02026bb8 : /** * POSIX 1003.1b 5.6.4 - Change File Modes */ int fchmod( int fd, mode_t mode ) { 2026bb8: 9d e3 bf a0 save %sp, -96, %sp int rv; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 2026bbc: 03 00 81 86 sethi %hi(0x2061800), %g1 2026bc0: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 ! 2061980 2026bc4: 80 a6 00 01 cmp %i0, %g1 2026bc8: 1a 80 00 28 bcc 2026c68 2026bcc: 03 00 81 96 sethi %hi(0x2065800), %g1 iop = rtems_libio_iop( fd ); 2026bd0: fa 00 62 ac ld [ %g1 + 0x2ac ], %i5 ! 2065aac 2026bd4: 83 2e 20 03 sll %i0, 3, %g1 2026bd8: b1 2e 20 06 sll %i0, 6, %i0 2026bdc: b0 26 00 01 sub %i0, %g1, %i0 2026be0: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 2026be4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2026be8: 80 88 61 00 btst 0x100, %g1 2026bec: 02 80 00 1f be 2026c68 2026bf0: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 2026bf4: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 2026bf8: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 2026bfc: 80 a0 60 00 cmp %g1, 0 2026c00: 02 80 00 14 be 2026c50 <== NEVER TAKEN 2026c04: 01 00 00 00 nop const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; (*mt_entry->ops->lock_h)( mt_entry ); 2026c08: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026c0c: c2 00 40 00 ld [ %g1 ], %g1 2026c10: 9f c0 40 00 call %g1 2026c14: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->fchmod_h)( &iop->pathinfo, mode ); 2026c18: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2026c1c: 90 07 60 14 add %i5, 0x14, %o0 2026c20: c2 00 60 0c ld [ %g1 + 0xc ], %g1 2026c24: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 2026c28: 9f c0 40 00 call %g1 2026c2c: 92 10 00 19 mov %i1, %o1 2026c30: b0 10 00 08 mov %o0, %i0 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2026c34: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2026c38: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026c3c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2026c40: 9f c0 40 00 call %g1 2026c44: 01 00 00 00 nop 2026c48: 81 c7 e0 08 ret 2026c4c: 81 e8 00 00 restore rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 2026c50: 40 00 50 f1 call 203b014 <__errno> <== NOT EXECUTED 2026c54: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2026c58: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2026c5c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2026c60: 81 c7 e0 08 ret <== NOT EXECUTED 2026c64: 81 e8 00 00 restore <== NOT EXECUTED int rv; rtems_libio_t *iop; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open(iop); 2026c68: 40 00 50 eb call 203b014 <__errno> 2026c6c: b0 10 3f ff mov -1, %i0 2026c70: 82 10 20 09 mov 9, %g1 2026c74: c2 22 00 00 st %g1, [ %o0 ] 2026c78: 81 c7 e0 08 ret 2026c7c: 81 e8 00 00 restore =============================================================================== 02026c80 : /** * POSIX 1003.1b 5.6.5 - Change Owner and Group of a File */ int fchown( int fd, uid_t owner, gid_t group ) { 2026c80: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 2026c84: 03 00 81 86 sethi %hi(0x2061800), %g1 2026c88: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 ! 2061980 2026c8c: 80 a6 00 01 cmp %i0, %g1 2026c90: 1a 80 00 29 bcc 2026d34 2026c94: 03 00 81 96 sethi %hi(0x2065800), %g1 iop = rtems_libio_iop( fd ); 2026c98: fa 00 62 ac ld [ %g1 + 0x2ac ], %i5 ! 2065aac 2026c9c: 83 2e 20 03 sll %i0, 3, %g1 2026ca0: b1 2e 20 06 sll %i0, 6, %i0 2026ca4: b0 26 00 01 sub %i0, %g1, %i0 2026ca8: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 2026cac: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2026cb0: 80 88 61 00 btst 0x100, %g1 2026cb4: 02 80 00 20 be 2026d34 2026cb8: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 2026cbc: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 2026cc0: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 2026cc4: 80 a0 60 00 cmp %g1, 0 2026cc8: 02 80 00 15 be 2026d1c <== NEVER TAKEN 2026ccc: 01 00 00 00 nop const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; (*mt_entry->ops->lock_h)( mt_entry ); 2026cd0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026cd4: c2 00 40 00 ld [ %g1 ], %g1 2026cd8: 9f c0 40 00 call %g1 2026cdc: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->chown_h)( 2026ce0: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2026ce4: 90 07 60 14 add %i5, 0x14, %o0 2026ce8: c2 00 60 0c ld [ %g1 + 0xc ], %g1 2026cec: 92 10 00 19 mov %i1, %o1 2026cf0: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2026cf4: 9f c0 40 00 call %g1 2026cf8: 94 10 00 1a mov %i2, %o2 2026cfc: b0 10 00 08 mov %o0, %i0 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2026d00: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2026d04: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026d08: c2 00 60 04 ld [ %g1 + 4 ], %g1 2026d0c: 9f c0 40 00 call %g1 2026d10: 01 00 00 00 nop 2026d14: 81 c7 e0 08 ret 2026d18: 81 e8 00 00 restore owner, group ); rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 2026d1c: 40 00 50 be call 203b014 <__errno> <== NOT EXECUTED 2026d20: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2026d24: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2026d28: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2026d2c: 81 c7 e0 08 ret <== NOT EXECUTED 2026d30: 81 e8 00 00 restore <== NOT EXECUTED int rv = 0; rtems_libio_t *iop; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open(iop); 2026d34: 40 00 50 b8 call 203b014 <__errno> 2026d38: b0 10 3f ff mov -1, %i0 2026d3c: 82 10 20 09 mov 9, %g1 2026d40: c2 22 00 00 st %g1, [ %o0 ] 2026d44: 81 c7 e0 08 ret 2026d48: 81 e8 00 00 restore =============================================================================== 02031004 : int fcntl( int fd, int cmd, ... ) { 2031004: 9d e3 bf 98 save %sp, -104, %sp int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 2031008: 03 00 80 db sethi %hi(0x2036c00), %g1 203100c: c4 00 61 dc ld [ %g1 + 0x1dc ], %g2 ! 2036ddc ... ) { int ret; va_list ap; va_start( ap, cmd ); 2031010: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2031014: 82 07 a0 4c add %fp, 0x4c, %g1 2031018: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 203101c: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2031020: fa 27 a0 58 st %i5, [ %fp + 0x58 ] int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 2031024: 80 a6 00 02 cmp %i0, %g2 2031028: 1a 80 00 7c bcc 2031218 203102c: c2 27 bf fc st %g1, [ %fp + -4 ] iop = rtems_libio_iop( fd ); 2031030: 39 00 81 1e sethi %hi(0x2047800), %i4 2031034: fa 07 21 00 ld [ %i4 + 0x100 ], %i5 ! 2047900 2031038: 85 2e 20 03 sll %i0, 3, %g2 203103c: b1 2e 20 06 sll %i0, 6, %i0 2031040: b0 26 00 02 sub %i0, %g2, %i0 2031044: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 2031048: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 203104c: 80 8a 21 00 btst 0x100, %o0 2031050: 02 80 00 72 be 2031218 2031054: 80 a6 60 09 cmp %i1, 9 /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 2031058: 08 80 00 08 bleu 2031078 203105c: 85 2e 60 02 sll %i1, 2, %g2 errno = ENOTSUP; ret = -1; break; default: errno = EINVAL; 2031060: 7f ff c4 a5 call 20222f4 <__errno> 2031064: b0 10 3f ff mov -1, %i0 2031068: 82 10 20 16 mov 0x16, %g1 203106c: c2 22 00 00 st %g1, [ %o0 ] va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 2031070: 81 c7 e0 08 ret 2031074: 81 e8 00 00 restore /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 2031078: 07 00 80 c3 sethi %hi(0x2030c00), %g3 203107c: 86 10 e3 dc or %g3, 0x3dc, %g3 ! 2030fdc <_calloc_r+0x14> 2031080: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 2031084: 81 c0 80 00 jmp %g2 2031088: 01 00 00 00 nop errno = ENOTSUP; ret = -1; break; case F_GETOWN: /* for sockets. */ errno = ENOTSUP; 203108c: 7f ff c4 9a call 20222f4 <__errno> 2031090: b0 10 3f ff mov -1, %i0 ! ffffffff 2031094: 82 10 20 86 mov 0x86, %g1 2031098: c2 22 00 00 st %g1, [ %o0 ] 203109c: 81 c7 e0 08 ret 20310a0: 81 e8 00 00 restore 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 ) ); 20310a4: d0 00 40 00 ld [ %g1 ], %o0 20310a8: 7f ff 5e ae call 2008b60 20310ac: 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); 20310b0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20310b4: 90 0a 22 01 and %o0, 0x201, %o0 20310b8: 82 08 7d fe and %g1, -514, %g1 20310bc: 82 12 00 01 or %o0, %g1, %g1 20310c0: c2 27 60 10 st %g1, [ %i5 + 0x10 ] * 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)( iop, cmd ); 20310c4: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 20310c8: 90 10 00 1d mov %i5, %o0 20310cc: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 20310d0: 9f c0 40 00 call %g1 20310d4: 92 10 00 19 mov %i1, %o1 if (err) { 20310d8: ba 92 20 00 orcc %o0, 0, %i5 20310dc: 02 80 00 53 be 2031228 <== ALWAYS TAKEN 20310e0: 01 00 00 00 nop errno = err; 20310e4: 7f ff c4 84 call 20222f4 <__errno> <== NOT EXECUTED 20310e8: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 20310ec: fa 22 00 00 st %i5, [ %o0 ] <== NOT EXECUTED 20310f0: 81 c7 e0 08 ret <== NOT EXECUTED 20310f4: 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 ); 20310f8: 7f ff 5e a7 call 2008b94 20310fc: 01 00 00 00 nop 2031100: 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) { 2031104: 80 a6 20 00 cmp %i0, 0 2031108: 36 bf ff f0 bge,a 20310c8 <== ALWAYS TAKEN 203110c: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 2031110: 81 c7 e0 08 ret <== NOT EXECUTED 2031114: 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 ) ) 2031118: c2 00 40 00 ld [ %g1 ], %g1 203111c: 80 a0 60 00 cmp %g1, 0 2031120: 22 80 00 3b be,a 203120c 2031124: 90 0a 37 ff and %o0, -2049, %o0 iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; 2031128: 90 12 28 00 or %o0, 0x800, %o0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 203112c: 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; 2031130: 10 bf ff e5 b 20310c4 2031134: d0 27 60 10 st %o0, [ %i5 + 0x10 ] fd2 = va_arg( ap, int ); ret = duplicate_iop( iop, fd2 ); break; case F_GETFD: /* get f_flags */ ret = ((iop->flags & LIBIO_FLAGS_CLOSE_ON_EXEC) != 0); 2031138: b1 32 20 0b srl %o0, 0xb, %i0 203113c: 10 bf ff e2 b 20310c4 2031140: b0 0e 20 01 and %i0, 1, %i0 /* * FIXME: We ignore the start value fd2 for the file descriptor search. This * is not POSIX conform. */ rtems_libio_t *diop = rtems_libio_allocate(); 2031144: 7f ff 5e ab call 2008bf0 2031148: 01 00 00 00 nop if (diop != NULL) { 203114c: b6 92 20 00 orcc %o0, 0, %i3 2031150: 02 bf ff c8 be 2031070 2031154: b0 10 3f ff mov -1, %i0 int oflag = rtems_libio_to_fcntl_flags( iop->flags ); 2031158: 7f ff 5e 8f call 2008b94 203115c: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 oflag &= ~O_CREAT; diop->flags |= rtems_libio_fcntl_flags( oflag ); 2031160: f0 06 e0 10 ld [ %i3 + 0x10 ], %i0 rtems_libio_t *diop = rtems_libio_allocate(); if (diop != NULL) { int oflag = rtems_libio_to_fcntl_flags( iop->flags ); oflag &= ~O_CREAT; 2031164: b4 0a 3d ff and %o0, -513, %i2 diop->flags |= rtems_libio_fcntl_flags( oflag ); 2031168: 7f ff 5e 7e call 2008b60 203116c: 90 10 00 1a mov %i2, %o0 static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2031170: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2031174: b0 12 00 18 or %o0, %i0, %i0 (*mt_entry->ops->lock_h)( mt_entry ); 2031178: c4 00 60 0c ld [ %g1 + 0xc ], %g2 203117c: 90 10 00 01 mov %g1, %o0 2031180: c2 00 80 00 ld [ %g2 ], %g1 2031184: 9f c0 40 00 call %g1 2031188: f0 26 e0 10 st %i0, [ %i3 + 0x10 ] rtems_filesystem_instance_lock( &iop->pathinfo ); rtems_filesystem_location_clone( &diop->pathinfo, &iop->pathinfo ); 203118c: 92 07 60 14 add %i5, 0x14, %o1 2031190: 7f ff 9c 1c call 2018200 2031194: 90 06 e0 14 add %i3, 0x14, %o0 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2031198: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 203119c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20311a0: c2 00 60 04 ld [ %g1 + 4 ], %g1 20311a4: 9f c0 40 00 call %g1 20311a8: 01 00 00 00 nop /* * XXX: We call the open handler here to have a proper open and close pair. * * FIXME: What to do with the path? */ rv = (*diop->pathinfo.handlers->open_h)( diop, NULL, oflag, 0 ); 20311ac: c2 06 e0 24 ld [ %i3 + 0x24 ], %g1 20311b0: 90 10 00 1b mov %i3, %o0 20311b4: c2 00 40 00 ld [ %g1 ], %g1 20311b8: 92 10 20 00 clr %o1 20311bc: 94 10 00 1a mov %i2, %o2 20311c0: 9f c0 40 00 call %g1 20311c4: 96 10 20 00 clr %o3 if ( rv == 0 ) { 20311c8: b0 92 20 00 orcc %o0, 0, %i0 20311cc: 12 80 00 19 bne 2031230 <== NEVER TAKEN 20311d0: c2 07 21 00 ld [ %i4 + 0x100 ], %g1 rv = diop - rtems_libio_iops; 20311d4: b6 26 c0 01 sub %i3, %g1, %i3 20311d8: b7 3e e0 03 sra %i3, 3, %i3 20311dc: 85 2e e0 03 sll %i3, 3, %g2 20311e0: 83 2e e0 06 sll %i3, 6, %g1 20311e4: 82 00 80 01 add %g2, %g1, %g1 20311e8: 85 28 60 06 sll %g1, 6, %g2 20311ec: 82 00 40 02 add %g1, %g2, %g1 20311f0: 82 00 40 1b add %g1, %i3, %g1 20311f4: 85 28 60 0f sll %g1, 0xf, %g2 20311f8: 82 00 40 02 add %g1, %g2, %g1 20311fc: 83 28 60 03 sll %g1, 3, %g1 2031200: b6 00 40 1b add %g1, %i3, %i3 2031204: 10 bf ff c0 b 2031104 2031208: b0 20 00 1b neg %i3, %i0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 203120c: 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; 2031210: 10 bf ff ad b 20310c4 2031214: d0 27 60 10 st %o0, [ %i5 + 0x10 ] int mask; int ret = 0; rtems_libio_check_fd( fd ); iop = rtems_libio_iop( fd ); rtems_libio_check_is_open(iop); 2031218: 7f ff c4 37 call 20222f4 <__errno> 203121c: b0 10 3f ff mov -1, %i0 2031220: 82 10 20 09 mov 9, %g1 2031224: c2 22 00 00 st %g1, [ %o0 ] 2031228: 81 c7 e0 08 ret 203122c: 81 e8 00 00 restore */ rv = (*diop->pathinfo.handlers->open_h)( diop, NULL, oflag, 0 ); if ( rv == 0 ) { rv = diop - rtems_libio_iops; } else { rtems_libio_free( diop ); 2031230: 7f ff 5e 86 call 2008c48 <== NOT EXECUTED 2031234: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED /* * If we got this far successfully, then we give the optional * filesystem specific handler a chance to process this. */ if (ret >= 0) { 2031238: 10 bf ff b4 b 2031108 <== NOT EXECUTED 203123c: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED =============================================================================== 0200e630 : int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e630: 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) { 200e634: 3b 00 80 8a sethi %hi(0x2022800), %i5 200e638: d0 07 61 38 ld [ %i5 + 0x138 ], %o0 ! 2022938 int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e63c: b6 10 00 18 mov %i0, %i3 static int pipe_lock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { 200e640: 80 a2 20 00 cmp %o0, 0 200e644: 02 80 00 18 be 200e6a4 200e648: b8 17 61 38 or %i5, 0x138, %i4 rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { sc = rtems_semaphore_obtain(pipe_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 200e64c: 92 10 20 00 clr %o1 200e650: 7f ff eb 6b call 20093fc 200e654: 94 10 20 00 clr %o2 } if (sc == RTEMS_SUCCESSFUL) { 200e658: 80 a2 20 00 cmp %o0, 0 200e65c: 12 80 00 68 bne 200e7fc <== NEVER TAKEN 200e660: 01 00 00 00 nop err = pipe_lock(); if (err) return err; pipe = *pipep; 200e664: f8 06 c0 00 ld [ %i3 ], %i4 if (pipe == NULL) { 200e668: 80 a7 20 00 cmp %i4, 0 200e66c: 02 80 00 1b be 200e6d8 200e670: 01 00 00 00 nop err = pipe_alloc(&pipe); if (err) goto out; } if (! PIPE_LOCK(pipe)) 200e674: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 200e678: 92 10 20 00 clr %o1 200e67c: 7f ff eb 60 call 20093fc 200e680: 94 10 20 00 clr %o2 200e684: 80 a2 20 00 cmp %o0, 0 200e688: 02 80 00 7a be 200e870 <== ALWAYS TAKEN 200e68c: c2 06 c0 00 ld [ %i3 ], %g1 err = -EINTR; if (*pipep == NULL) { 200e690: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 200e694: 22 80 00 5c be,a 200e804 <== NOT EXECUTED 200e698: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 <== NOT EXECUTED if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200e69c: 10 80 00 64 b 200e82c <== NOT EXECUTED 200e6a0: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED */ #include static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 200e6a4: 35 00 80 8a sethi %hi(0x2022800), %i2 200e6a8: d0 06 a2 b8 ld [ %i2 + 0x2b8 ], %o0 ! 2022ab8 200e6ac: 92 10 20 00 clr %o1 200e6b0: 7f ff eb 53 call 20093fc 200e6b4: 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) { 200e6b8: c2 07 61 38 ld [ %i5 + 0x138 ], %g1 200e6bc: 80 a0 60 00 cmp %g1, 0 200e6c0: 02 80 00 43 be 200e7cc <== ALWAYS TAKEN 200e6c4: 98 10 00 1c mov %i4, %o4 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 200e6c8: 7f ff eb 9c call 2009538 <== NOT EXECUTED 200e6cc: d0 06 a2 b8 ld [ %i2 + 0x2b8 ], %o0 <== NOT EXECUTED 200e6d0: 10 bf ff df b 200e64c <== NOT EXECUTED 200e6d4: d0 07 61 38 ld [ %i5 + 0x138 ], %o0 <== NOT EXECUTED { static char c = 'a'; pipe_control_t *pipe; int err = -ENOMEM; pipe = malloc(sizeof(pipe_control_t)); 200e6d8: 7f ff d9 7e call 2004cd0 200e6dc: 90 10 20 34 mov 0x34, %o0 if (pipe == NULL) 200e6e0: b8 92 20 00 orcc %o0, 0, %i4 200e6e4: 02 80 00 61 be 200e868 <== NEVER TAKEN 200e6e8: 82 10 22 00 mov 0x200, %g1 return err; memset(pipe, 0, sizeof(pipe_control_t)); 200e6ec: c0 27 00 00 clr [ %i4 ] 200e6f0: c0 27 20 08 clr [ %i4 + 8 ] 200e6f4: c0 27 20 0c clr [ %i4 + 0xc ] 200e6f8: c0 27 20 10 clr [ %i4 + 0x10 ] 200e6fc: c0 27 20 14 clr [ %i4 + 0x14 ] 200e700: c0 27 20 18 clr [ %i4 + 0x18 ] 200e704: c0 27 20 1c clr [ %i4 + 0x1c ] 200e708: c0 27 20 20 clr [ %i4 + 0x20 ] 200e70c: c0 27 20 24 clr [ %i4 + 0x24 ] 200e710: c0 27 20 28 clr [ %i4 + 0x28 ] 200e714: c0 27 20 2c clr [ %i4 + 0x2c ] 200e718: c0 27 20 30 clr [ %i4 + 0x30 ] pipe->Size = PIPE_BUF; pipe->Buffer = malloc(pipe->Size); 200e71c: 90 10 22 00 mov 0x200, %o0 200e720: 7f ff d9 6c call 2004cd0 200e724: c2 27 20 04 st %g1, [ %i4 + 4 ] if (! pipe->Buffer) 200e728: 80 a2 20 00 cmp %o0, 0 200e72c: 02 80 00 4d be 200e860 <== NEVER TAKEN 200e730: d0 27 00 00 st %o0, [ %i4 ] goto err_buf; err = -ENOMEM; if (rtems_barrier_create( rtems_build_name ('P', 'I', 'r', c), 200e734: 35 00 80 88 sethi %hi(0x2022000), %i2 200e738: d0 4e a2 78 ldsb [ %i2 + 0x278 ], %o0 ! 2022278 if (! pipe->Buffer) goto err_buf; err = -ENOMEM; if (rtems_barrier_create( 200e73c: 31 14 12 5c sethi %hi(0x50497000), %i0 200e740: 82 16 22 00 or %i0, 0x200, %g1 ! 50497200 200e744: 92 10 20 00 clr %o1 200e748: 94 10 20 00 clr %o2 200e74c: 90 12 00 01 or %o0, %g1, %o0 200e750: 40 00 04 4f call 200f88c 200e754: 96 07 20 2c add %i4, 0x2c, %o3 200e758: 80 a2 20 00 cmp %o0, 0 200e75c: 12 80 00 3f bne 200e858 200e760: d0 4e a2 78 ldsb [ %i2 + 0x278 ], %o0 rtems_build_name ('P', 'I', 'r', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->readBarrier) != RTEMS_SUCCESSFUL) goto err_rbar; if (rtems_barrier_create( 200e764: 03 14 12 5d sethi %hi(0x50497400), %g1 200e768: 82 10 63 00 or %g1, 0x300, %g1 ! 50497700 200e76c: 92 10 20 00 clr %o1 200e770: 94 10 20 00 clr %o2 200e774: 90 12 00 01 or %o0, %g1, %o0 200e778: 40 00 04 45 call 200f88c 200e77c: 96 07 20 30 add %i4, 0x30, %o3 200e780: 80 a2 20 00 cmp %o0, 0 200e784: 12 80 00 33 bne 200e850 200e788: d0 4e a2 78 ldsb [ %i2 + 0x278 ], %o0 rtems_build_name ('P', 'I', 'w', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->writeBarrier) != RTEMS_SUCCESSFUL) goto err_wbar; if (rtems_semaphore_create( 200e78c: b0 16 23 00 or %i0, 0x300, %i0 200e790: 92 10 20 01 mov 1, %o1 200e794: 90 12 00 18 or %o0, %i0, %o0 200e798: 94 10 20 10 mov 0x10, %o2 200e79c: 96 10 20 00 clr %o3 200e7a0: 7f ff ea 6f call 200915c 200e7a4: 98 07 20 28 add %i4, 0x28, %o4 200e7a8: 80 a2 20 00 cmp %o0, 0 200e7ac: 12 80 00 27 bne 200e848 200e7b0: c2 4e a2 78 ldsb [ %i2 + 0x278 ], %g1 #ifdef RTEMS_POSIX_API pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') 200e7b4: 80 a0 60 7a cmp %g1, 0x7a 200e7b8: 02 80 00 21 be 200e83c 200e7bc: c4 0e a2 78 ldub [ %i2 + 0x278 ], %g2 200e7c0: 84 00 a0 01 inc %g2 200e7c4: 10 bf ff ac b 200e674 200e7c8: c4 2e a2 78 stb %g2, [ %i2 + 0x278 ] if (pipe_semaphore == RTEMS_ID_NONE) { rtems_libio_lock(); if (pipe_semaphore == RTEMS_ID_NONE) { sc = rtems_semaphore_create( 200e7cc: 92 10 20 01 mov 1, %o1 200e7d0: 94 10 20 54 mov 0x54, %o2 200e7d4: 96 10 20 00 clr %o3 200e7d8: 11 14 12 54 sethi %hi(0x50495000), %o0 200e7dc: 7f ff ea 60 call 200915c 200e7e0: 90 12 20 45 or %o0, 0x45, %o0 ! 50495045 200e7e4: b8 10 00 08 mov %o0, %i4 200e7e8: 7f ff eb 54 call 2009538 200e7ec: d0 06 a2 b8 ld [ %i2 + 0x2b8 ], %o0 } rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { 200e7f0: 80 a7 20 00 cmp %i4, 0 200e7f4: 02 bf ff 96 be 200e64c 200e7f8: d0 07 61 38 ld [ %i5 + 0x138 ], %o0 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { PIPE_UNLOCK(pipe); err = -ENXIO; 200e7fc: 81 c7 e0 08 ret 200e800: 91 e8 3f f4 restore %g0, -12, %o0 /* Called with pipe_semaphore held. */ static inline void pipe_free( pipe_control_t *pipe ) { rtems_barrier_delete(pipe->readBarrier); 200e804: 40 00 04 53 call 200f950 <== NOT EXECUTED 200e808: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED rtems_barrier_delete(pipe->writeBarrier); 200e80c: 40 00 04 51 call 200f950 <== NOT EXECUTED 200e810: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 <== NOT EXECUTED rtems_semaphore_delete(pipe->Semaphore); 200e814: 7f ff ea c3 call 2009320 <== NOT EXECUTED 200e818: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 <== NOT EXECUTED free(pipe->Buffer); 200e81c: 7f ff d8 16 call 2004874 <== NOT EXECUTED 200e820: d0 07 00 00 ld [ %i4 ], %o0 <== NOT EXECUTED free(pipe); 200e824: 7f ff d8 14 call 2004874 <== NOT EXECUTED 200e828: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED #ifdef RTEMS_DEBUG rtems_status_code sc = RTEMS_SUCCESSFUL; sc = #endif rtems_semaphore_release(pipe_semaphore); 200e82c: 7f ff eb 43 call 2009538 200e830: d0 07 61 38 ld [ %i5 + 0x138 ], %o0 return 0; out_error: pipe_release(pipep, iop); return err; } 200e834: 81 c7 e0 08 ret 200e838: 81 e8 00 00 restore pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') c = 'a'; 200e83c: 82 10 20 61 mov 0x61, %g1 200e840: 10 bf ff 8d b 200e674 200e844: c2 2e a2 78 stb %g1, [ %i2 + 0x278 ] return 0; err_sem: rtems_barrier_delete(pipe->writeBarrier); 200e848: 40 00 04 42 call 200f950 200e84c: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 err_wbar: rtems_barrier_delete(pipe->readBarrier); 200e850: 40 00 04 40 call 200f950 200e854: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 err_rbar: free(pipe->Buffer); 200e858: 7f ff d8 07 call 2004874 200e85c: d0 07 00 00 ld [ %i4 ], %o0 err_buf: free(pipe); 200e860: 7f ff d8 05 call 2004874 200e864: 90 10 00 1c mov %i4, %o0 if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200e868: 10 bf ff f1 b 200e82c 200e86c: b0 10 3f f4 mov -12, %i0 if (*pipep == NULL) { 200e870: 80 a0 60 00 cmp %g1, 0 200e874: 22 80 00 02 be,a 200e87c 200e878: f8 26 c0 00 st %i4, [ %i3 ] #ifdef RTEMS_DEBUG rtems_status_code sc = RTEMS_SUCCESSFUL; sc = #endif rtems_semaphore_release(pipe_semaphore); 200e87c: 7f ff eb 2f call 2009538 200e880: d0 07 61 38 ld [ %i5 + 0x138 ], %o0 err = pipe_new(pipep); if (err) return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { 200e884: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e888: 82 08 60 06 and %g1, 6, %g1 200e88c: 80 a0 60 04 cmp %g1, 4 200e890: 02 80 00 0c be 200e8c0 200e894: fa 06 c0 00 ld [ %i3 ], %i5 200e898: 80 a0 60 06 cmp %g1, 6 200e89c: 02 80 00 58 be 200e9fc 200e8a0: 80 a0 60 02 cmp %g1, 2 200e8a4: 22 80 00 31 be,a 200e968 <== ALWAYS TAKEN 200e8a8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); break; } PIPE_UNLOCK(pipe); 200e8ac: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED 200e8b0: 7f ff eb 22 call 2009538 200e8b4: b0 10 20 00 clr %i0 return 0; 200e8b8: 81 c7 e0 08 ret 200e8bc: 81 e8 00 00 restore break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200e8c0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200e8c4: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200e8c8: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200e8cc: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200e8d0: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200e8d4: 80 a0 60 00 cmp %g1, 0 200e8d8: 02 80 00 68 be 200ea78 <== ALWAYS TAKEN 200e8dc: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200e8e0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200e8e4: 80 a0 60 00 cmp %g1, 0 200e8e8: 32 bf ff f2 bne,a 200e8b0 200e8ec: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 200e8f0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e8f4: 80 88 60 01 btst 1, %g1 200e8f8: 32 80 00 65 bne,a 200ea8c 200e8fc: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 err = -ENXIO; goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; 200e900: 10 80 00 0c b 200e930 200e904: f8 07 60 20 ld [ %i5 + 0x20 ], %i4 err = -EINTR; do { PIPE_UNLOCK(pipe); if (! PIPE_WRITEWAIT(pipe)) goto out_error; if (! PIPE_LOCK(pipe)) 200e908: 92 10 20 00 clr %o1 200e90c: 7f ff ea bc call 20093fc 200e910: 94 10 20 00 clr %o2 200e914: 80 a2 20 00 cmp %o0, 0 200e918: 12 80 00 0f bne 200e954 <== NEVER TAKEN 200e91c: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->readerCounter); 200e920: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200e924: 80 a0 40 1c cmp %g1, %i4 200e928: 32 bf ff e2 bne,a 200e8b0 <== ALWAYS TAKEN 200e92c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; do { PIPE_UNLOCK(pipe); 200e930: 7f ff eb 02 call 2009538 200e934: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_WRITEWAIT(pipe)) 200e938: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200e93c: 40 00 04 46 call 200fa54 200e940: 92 10 20 00 clr %o1 200e944: 80 a2 20 00 cmp %o0, 0 200e948: 22 bf ff f0 be,a 200e908 <== ALWAYS TAKEN 200e94c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200e950: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED PIPE_UNLOCK(pipe); return 0; out_error: pipe_release(pipep, iop); 200e954: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 200e958: 7f ff fe f7 call 200e534 200e95c: 92 10 00 19 mov %i1, %o1 return err; 200e960: 81 c7 e0 08 ret 200e964: 81 e8 00 00 restore return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200e968: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200e96c: 86 00 60 01 add %g1, 1, %g3 return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200e970: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200e974: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200e978: 80 a0 60 00 cmp %g1, 0 200e97c: 02 80 00 35 be 200ea50 <== ALWAYS TAKEN 200e980: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); if (pipe->Writers == 0) { 200e984: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 <== NOT EXECUTED 200e988: 80 a0 60 00 cmp %g1, 0 200e98c: 32 bf ff c9 bne,a 200e8b0 200e990: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) 200e994: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e998: 80 88 60 01 btst 1, %g1 200e99c: 32 bf ff c5 bne,a 200e8b0 200e9a0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 break; prevCounter = pipe->writerCounter; 200e9a4: 10 80 00 0c b 200e9d4 200e9a8: f8 07 60 24 ld [ %i5 + 0x24 ], %i4 /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); if (! PIPE_READWAIT(pipe)) goto out_error; if (! PIPE_LOCK(pipe)) 200e9ac: 92 10 20 00 clr %o1 200e9b0: 7f ff ea 93 call 20093fc 200e9b4: 94 10 20 00 clr %o2 200e9b8: 80 a2 20 00 cmp %o0, 0 200e9bc: 12 bf ff e6 bne 200e954 <== NEVER TAKEN 200e9c0: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->writerCounter); 200e9c4: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 200e9c8: 80 a0 40 1c cmp %g1, %i4 200e9cc: 32 bf ff b9 bne,a 200e8b0 <== ALWAYS TAKEN 200e9d0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 prevCounter = pipe->writerCounter; err = -EINTR; /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); 200e9d4: 7f ff ea d9 call 2009538 200e9d8: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_READWAIT(pipe)) 200e9dc: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200e9e0: 40 00 04 1d call 200fa54 200e9e4: 92 10 20 00 clr %o1 200e9e8: 80 a2 20 00 cmp %o0, 0 200e9ec: 22 bf ff f0 be,a 200e9ac <== ALWAYS TAKEN 200e9f0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200e9f4: 10 bf ff d8 b 200e954 <== NOT EXECUTED 200e9f8: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) 200e9fc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200ea00: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200ea04: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200ea08: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200ea0c: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200ea10: 80 a0 60 00 cmp %g1, 0 200ea14: 02 80 00 14 be 200ea64 <== ALWAYS TAKEN 200ea18: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ea1c: 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 ++; 200ea20: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200ea24: 86 00 60 01 add %g1, 1, %g3 case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; 200ea28: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200ea2c: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200ea30: 80 a0 60 00 cmp %g1, 0 200ea34: 12 bf ff 9e bne 200e8ac <== NEVER TAKEN 200ea38: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); 200ea3c: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ea40: 40 00 03 ed call 200f9f4 200ea44: 92 07 bf fc add %fp, -4, %o1 break; } PIPE_UNLOCK(pipe); 200ea48: 10 bf ff 9a b 200e8b0 200ea4c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200ea50: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200ea54: 40 00 03 e8 call 200f9f4 200ea58: 92 07 bf fc add %fp, -4, %o1 if (pipe->Writers == 0) { 200ea5c: 10 bf ff cb b 200e988 200ea60: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200ea64: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200ea68: 40 00 03 e3 call 200f9f4 200ea6c: 92 07 bf fc add %fp, -4, %o1 pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ea70: 10 bf ff ec b 200ea20 200ea74: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); 200ea78: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ea7c: 40 00 03 de call 200f9f4 200ea80: 92 07 bf fc add %fp, -4, %o1 if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200ea84: 10 bf ff 98 b 200e8e4 200ea88: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 PIPE_UNLOCK(pipe); 200ea8c: 7f ff ea ab call 2009538 200ea90: b0 10 3f fa mov -6, %i0 err = -ENXIO; goto out_error; 200ea94: 10 bf ff b1 b 200e958 200ea98: 90 10 00 1b mov %i3, %o0 =============================================================================== 02009c14 : */ long fpathconf( int fd, int name ) { 2009c14: 9d e3 bf a0 save %sp, -96, %sp long return_value; rtems_libio_t *iop; const rtems_filesystem_limits_and_options_t *the_limits; rtems_libio_check_fd(fd); 2009c18: 03 00 80 46 sethi %hi(0x2011800), %g1 2009c1c: c2 00 62 08 ld [ %g1 + 0x208 ], %g1 ! 2011a08 2009c20: 80 a6 00 01 cmp %i0, %g1 2009c24: 1a 80 00 3e bcc 2009d1c 2009c28: 03 00 80 48 sethi %hi(0x2012000), %g1 iop = rtems_libio_iop(fd); 2009c2c: c2 00 61 a0 ld [ %g1 + 0x1a0 ], %g1 ! 20121a0 2009c30: 85 2e 20 03 sll %i0, 3, %g2 2009c34: b1 2e 20 06 sll %i0, 6, %i0 2009c38: b0 26 00 02 sub %i0, %g2, %i0 2009c3c: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_is_open(iop); 2009c40: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2009c44: 80 88 61 00 btst 0x100, %g1 2009c48: 02 80 00 35 be 2009d1c <== NEVER TAKEN 2009c4c: 80 a6 60 0b cmp %i1, 0xb /* * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; 2009c50: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 switch ( name ) { 2009c54: 08 80 00 08 bleu 2009c74 2009c58: c2 00 60 2c ld [ %g1 + 0x2c ], %g1 break; case _PC_SYNC_IO: return_value = the_limits->posix_sync_io; break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2009c5c: 40 00 05 e8 call 200b3fc <__errno> 2009c60: b0 10 3f ff mov -1, %i0 2009c64: 82 10 20 16 mov 0x16, %g1 2009c68: c2 22 00 00 st %g1, [ %o0 ] break; } return return_value; } 2009c6c: 81 c7 e0 08 ret 2009c70: 81 e8 00 00 restore * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { 2009c74: b3 2e 60 02 sll %i1, 2, %i1 2009c78: 05 00 80 26 sethi %hi(0x2009800), %g2 2009c7c: 84 10 a3 e4 or %g2, 0x3e4, %g2 ! 2009be4 <_close_r+0x10> 2009c80: c4 00 80 19 ld [ %g2 + %i1 ], %g2 2009c84: 81 c0 80 00 jmp %g2 2009c88: 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; 2009c8c: f0 00 60 24 ld [ %g1 + 0x24 ], %i0 break; 2009c90: 81 c7 e0 08 ret 2009c94: 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; 2009c98: f0 00 60 18 ld [ %g1 + 0x18 ], %i0 break; 2009c9c: 81 c7 e0 08 ret 2009ca0: 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; 2009ca4: f0 00 60 2c ld [ %g1 + 0x2c ], %i0 break; 2009ca8: 81 c7 e0 08 ret 2009cac: 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; 2009cb0: f0 00 60 20 ld [ %g1 + 0x20 ], %i0 break; 2009cb4: 81 c7 e0 08 ret 2009cb8: 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; 2009cbc: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 break; 2009cc0: 81 c7 e0 08 ret 2009cc4: 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; 2009cc8: f0 00 60 14 ld [ %g1 + 0x14 ], %i0 break; 2009ccc: 81 c7 e0 08 ret 2009cd0: 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; 2009cd4: f0 00 60 10 ld [ %g1 + 0x10 ], %i0 break; 2009cd8: 81 c7 e0 08 ret 2009cdc: 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; 2009ce0: f0 00 60 0c ld [ %g1 + 0xc ], %i0 break; 2009ce4: 81 c7 e0 08 ret 2009ce8: 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; 2009cec: f0 00 60 08 ld [ %g1 + 8 ], %i0 break; 2009cf0: 81 c7 e0 08 ret 2009cf4: 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; 2009cf8: f0 00 60 04 ld [ %g1 + 4 ], %i0 break; 2009cfc: 81 c7 e0 08 ret 2009d00: 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; 2009d04: f0 00 40 00 ld [ %g1 ], %i0 break; 2009d08: 81 c7 e0 08 ret 2009d0c: 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; 2009d10: f0 00 60 28 ld [ %g1 + 0x28 ], %i0 break; 2009d14: 81 c7 e0 08 ret 2009d18: 81 e8 00 00 restore rtems_libio_t *iop; const rtems_filesystem_limits_and_options_t *the_limits; rtems_libio_check_fd(fd); iop = rtems_libio_iop(fd); rtems_libio_check_is_open(iop); 2009d1c: 40 00 05 b8 call 200b3fc <__errno> 2009d20: b0 10 3f ff mov -1, %i0 2009d24: 82 10 20 09 mov 9, %g1 2009d28: c2 22 00 00 st %g1, [ %o0 ] 2009d2c: 81 c7 e0 08 ret 2009d30: 81 e8 00 00 restore =============================================================================== 02003670 : #include void free( void *ptr ) { 2003670: 9d e3 bf a0 save %sp, -96, %sp MSBUMP(free_calls, 1); 2003674: 03 00 80 72 sethi %hi(0x201c800), %g1 2003678: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201caf8 200367c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 #include void free( void *ptr ) { 2003680: b2 10 00 18 mov %i0, %i1 MSBUMP(free_calls, 1); 2003684: 84 00 a0 01 inc %g2 if ( !ptr ) 2003688: 80 a6 20 00 cmp %i0, 0 200368c: 02 80 00 15 be 20036e0 2003690: 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()) && 2003694: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003698: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ce8c <_System_state_Current> 200369c: 80 a0 60 03 cmp %g1, 3 20036a0: 02 80 00 17 be 20036fc <== ALWAYS TAKEN 20036a4: 03 00 80 72 sethi %hi(0x201c800), %g1 } /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 20036a8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 ! 201c834 20036ac: 80 a0 60 00 cmp %g1, 0 20036b0: 02 80 00 06 be 20036c8 20036b4: 3b 00 80 70 sethi %hi(0x201c000), %i5 (*rtems_malloc_statistics_helpers->at_free)(ptr); 20036b8: c2 00 60 08 ld [ %g1 + 8 ], %g1 20036bc: 9f c0 40 00 call %g1 20036c0: 90 10 00 19 mov %i1, %o0 if ( !_Protected_heap_Free( RTEMS_Malloc_Heap, ptr ) ) { 20036c4: 3b 00 80 70 sethi %hi(0x201c000), %i5 20036c8: d0 07 60 e0 ld [ %i5 + 0xe0 ], %o0 ! 201c0e0 20036cc: 40 00 18 c4 call 20099dc <_Protected_heap_Free> 20036d0: 92 10 00 19 mov %i1, %o1 20036d4: 80 8a 20 ff btst 0xff, %o0 20036d8: 02 80 00 04 be 20036e8 20036dc: c2 07 60 e0 ld [ %i5 + 0xe0 ], %g1 20036e0: 81 c7 e0 08 ret 20036e4: 81 e8 00 00 restore printk( "Program heap: free of bad pointer %p -- range %p - %p \n", 20036e8: 31 00 80 6a sethi %hi(0x201a800), %i0 20036ec: f4 00 60 18 ld [ %g1 + 0x18 ], %i2 20036f0: f6 00 60 1c ld [ %g1 + 0x1c ], %i3 20036f4: 40 00 03 81 call 20044f8 20036f8: 91 ee 23 f8 restore %i0, 0x3f8, %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() ) { 20036fc: 40 00 00 67 call 2003898 2003700: 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()) && 2003704: 80 8a 20 ff btst 0xff, %o0 2003708: 12 bf ff e8 bne 20036a8 200370c: 03 00 80 72 sethi %hi(0x201c800), %g1 !malloc_is_system_state_OK() ) { malloc_deferred_free(ptr); 2003710: 40 00 00 7c call 2003900 2003714: 81 e8 00 00 restore =============================================================================== 02019ac4 : int fstat( int fd, struct stat *sbuf ) { 2019ac4: 9d e3 bf a0 save %sp, -96, %sp rtems_libio_t *iop; /* * Check to see if we were passed a valid pointer. */ if ( !sbuf ) 2019ac8: 80 a6 60 00 cmp %i1, 0 2019acc: 02 80 00 1f be 2019b48 <== NEVER TAKEN 2019ad0: 03 00 80 70 sethi %hi(0x201c000), %g1 rtems_set_errno_and_return_minus_one( EFAULT ); /* * Now process the stat() request. */ iop = rtems_libio_iop( fd ); 2019ad4: c2 00 61 24 ld [ %g1 + 0x124 ], %g1 ! 201c124 2019ad8: 80 a6 00 01 cmp %i0, %g1 2019adc: 1a 80 00 15 bcc 2019b30 2019ae0: 03 00 80 72 sethi %hi(0x201c800), %g1 2019ae4: c2 00 62 ec ld [ %g1 + 0x2ec ], %g1 ! 201caec 2019ae8: 85 2e 20 03 sll %i0, 3, %g2 2019aec: b1 2e 20 06 sll %i0, 6, %i0 2019af0: b0 26 00 02 sub %i0, %g2, %i0 2019af4: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_fd( fd ); rtems_libio_check_is_open(iop); 2019af8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2019afc: 80 88 61 00 btst 0x100, %g1 2019b00: 02 80 00 0c be 2019b30 2019b04: 94 10 20 48 mov 0x48, %o2 /* * Zero out the stat structure so the various support * versions of stat don't have to. */ memset( sbuf, 0, sizeof(struct stat) ); 2019b08: 92 10 20 00 clr %o1 2019b0c: 7f ff d9 15 call 200ff60 2019b10: 90 10 00 19 mov %i1, %o0 return (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, sbuf ); 2019b14: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019b18: 90 06 20 14 add %i0, 0x14, %o0 2019b1c: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 2019b20: 9f c0 40 00 call %g1 2019b24: 92 10 00 19 mov %i1, %o1 } 2019b28: 81 c7 e0 08 ret 2019b2c: 91 e8 00 08 restore %g0, %o0, %o0 /* * Now process the stat() request. */ iop = rtems_libio_iop( fd ); rtems_libio_check_fd( fd ); rtems_libio_check_is_open(iop); 2019b30: 7f ff d6 7e call 200f528 <__errno> 2019b34: b0 10 3f ff mov -1, %i0 2019b38: 82 10 20 09 mov 9, %g1 2019b3c: c2 22 00 00 st %g1, [ %o0 ] 2019b40: 81 c7 e0 08 ret 2019b44: 81 e8 00 00 restore /* * Check to see if we were passed a valid pointer. */ if ( !sbuf ) rtems_set_errno_and_return_minus_one( EFAULT ); 2019b48: 7f ff d6 78 call 200f528 <__errno> <== NOT EXECUTED 2019b4c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2019b50: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 2019b54: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2019b58: 81 c7 e0 08 ret <== NOT EXECUTED 2019b5c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200340c : 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) { 200340c: 03 00 80 83 sethi %hi(0x2020c00), %g1 2003410: c2 00 63 58 ld [ %g1 + 0x358 ], %g1 ! 2020f58 2003414: 80 a0 40 08 cmp %g1, %o0 2003418: 08 80 00 20 bleu 2003498 <== NEVER TAKEN 200341c: 03 00 80 83 sethi %hi(0x2020c00), %g1 2003420: c2 00 63 5c ld [ %g1 + 0x35c ], %g1 ! 2020f5c 2003424: 80 a0 60 00 cmp %g1, 0 2003428: 02 80 00 1c be 2003498 <== NEVER TAKEN 200342c: 01 00 00 00 nop rtems_disk_device_table *dtab = disktab + major; 2003430: 91 2a 20 03 sll %o0, 3, %o0 2003434: 84 00 40 08 add %g1, %o0, %g2 if (minor < dtab->size && dtab->minor != NULL) { 2003438: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200343c: 80 a0 80 09 cmp %g2, %o1 2003440: 08 80 00 16 bleu 2003498 <== NEVER TAKEN 2003444: 01 00 00 00 nop 2003448: c2 00 40 08 ld [ %g1 + %o0 ], %g1 200344c: 80 a0 60 00 cmp %g1, 0 2003450: 02 80 00 12 be 2003498 <== NEVER TAKEN 2003454: 93 2a 60 02 sll %o1, 2, %o1 rtems_disk_device *dd = dtab->minor [minor]; if (dd != NULL && !lookup_only) { 2003458: 80 a2 a0 01 cmp %o2, 1 200345c: 12 80 00 04 bne 200346c 2003460: d0 00 40 09 ld [ %g1 + %o1 ], %o0 return dd; } } return NULL; } 2003464: 81 c3 e0 08 retl 2003468: 01 00 00 00 nop rtems_disk_device_table *dtab = disktab + major; if (minor < dtab->size && dtab->minor != NULL) { rtems_disk_device *dd = dtab->minor [minor]; if (dd != NULL && !lookup_only) { 200346c: 80 a2 20 00 cmp %o0, 0 2003470: 02 bf ff fd be 2003464 <== NEVER TAKEN 2003474: 01 00 00 00 nop if (!dd->deleted) { 2003478: c2 0a 20 40 ldub [ %o0 + 0x40 ], %g1 200347c: 80 a0 60 00 cmp %g1, 0 2003480: 12 80 00 06 bne 2003498 2003484: 01 00 00 00 nop ++dd->uses; 2003488: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200348c: 82 00 60 01 inc %g1 2003490: 81 c3 e0 08 retl 2003494: c2 22 20 14 st %g1, [ %o0 + 0x14 ] return dd; } } return NULL; } 2003498: 81 c3 e0 08 retl 200349c: 90 10 20 00 clr %o0 =============================================================================== 02004b78 : * NOTES: * get_sector() operates with device via bdbuf library, * and does not support devices with sector size other than 512 bytes */ static rtems_status_code get_sector(int fd, 2004b78: 9d e3 bf a0 save %sp, -96, %sp new_off = lseek(fd, off, SEEK_SET); if (new_off != off) { return RTEMS_IO_ERROR; } s = (rtems_sector_data_t *) malloc(sizeof(rtems_sector_data_t) + RTEMS_IDE_SECTOR_SIZE); 2004b7c: 40 00 05 c8 call 200629c 2004b80: 90 10 22 04 mov 0x204, %o0 if (s == NULL) { return RTEMS_NO_MEMORY; 2004b84: 82 10 20 1a mov 0x1a, %g1 if (new_off != off) { return RTEMS_IO_ERROR; } s = (rtems_sector_data_t *) malloc(sizeof(rtems_sector_data_t) + RTEMS_IDE_SECTOR_SIZE); if (s == NULL) 2004b88: 80 a2 20 00 cmp %o0, 0 2004b8c: 02 80 00 0c be 2004bbc <== NEVER TAKEN 2004b90: ba 10 00 08 mov %o0, %i5 { return RTEMS_NO_MEMORY; } n = read(fd, s->data, RTEMS_IDE_SECTOR_SIZE); 2004b94: 90 10 00 18 mov %i0, %o0 2004b98: 92 07 60 04 add %i5, 4, %o1 2004b9c: 40 00 08 94 call 2006dec 2004ba0: 94 10 22 00 mov 0x200, %o2 if (n != RTEMS_IDE_SECTOR_SIZE) 2004ba4: 80 a2 22 00 cmp %o0, 0x200 2004ba8: 02 80 00 07 be 2004bc4 <== ALWAYS TAKEN 2004bac: 82 10 20 00 clr %g1 { free(s); 2004bb0: 40 00 04 1e call 2005c28 <== NOT EXECUTED 2004bb4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED return RTEMS_IO_ERROR; 2004bb8: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED s->sector_num = sector_num; *sector = s; return RTEMS_SUCCESSFUL; } 2004bbc: 81 c7 e0 08 ret <== NOT EXECUTED 2004bc0: 91 e8 00 01 restore %g0, %g1, %o0 <== NOT EXECUTED { free(s); return RTEMS_IO_ERROR; } s->sector_num = sector_num; 2004bc4: f2 27 40 00 st %i1, [ %i5 ] *sector = s; 2004bc8: fa 26 80 00 st %i5, [ %i2 ] return RTEMS_SUCCESSFUL; } 2004bcc: 81 c7 e0 08 ret 2004bd0: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02031268 : int getdents( int dd_fd, char *dd_buf, int dd_len ) { 2031268: 9d e3 bf a0 save %sp, -96, %sp rtems_filesystem_node_types_t type; /* * Get the file control block structure associated with the file descriptor */ iop = rtems_libio_iop( dd_fd ); 203126c: 03 00 80 db sethi %hi(0x2036c00), %g1 2031270: c2 00 61 dc ld [ %g1 + 0x1dc ], %g1 ! 2036ddc 2031274: 80 a6 00 01 cmp %i0, %g1 2031278: 1a 80 00 08 bcc 2031298 <== NEVER TAKEN 203127c: ba 10 20 00 clr %i5 2031280: 03 00 81 1e sethi %hi(0x2047800), %g1 2031284: fa 00 61 00 ld [ %g1 + 0x100 ], %i5 ! 2047900 2031288: 83 2e 20 03 sll %i0, 3, %g1 203128c: b1 2e 20 06 sll %i0, 6, %i0 2031290: b0 26 00 01 sub %i0, %g1, %i0 2031294: ba 07 40 18 add %i5, %i0, %i5 /* * Make sure we are working on a directory */ type = rtems_filesystem_node_type( &iop->pathinfo ); 2031298: 7f ff 65 94 call 200a8e8 203129c: 90 07 60 14 add %i5, 0x14, %o0 if ( type != RTEMS_FILESYSTEM_DIRECTORY ) 20312a0: 80 a2 20 00 cmp %o0, 0 20312a4: 12 80 00 09 bne 20312c8 20312a8: 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 ); 20312ac: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 20312b0: c2 00 60 08 ld [ %g1 + 8 ], %g1 20312b4: 92 10 00 19 mov %i1, %o1 20312b8: 9f c0 40 00 call %g1 20312bc: 94 10 00 1a mov %i2, %o2 } 20312c0: 81 c7 e0 08 ret 20312c4: 91 e8 00 08 restore %g0, %o0, %o0 /* * Make sure we are working on a directory */ type = rtems_filesystem_node_type( &iop->pathinfo ); if ( type != RTEMS_FILESYSTEM_DIRECTORY ) rtems_set_errno_and_return_minus_one( ENOTDIR ); 20312c8: 7f ff c4 0b call 20222f4 <__errno> 20312cc: b0 10 3f ff mov -1, %i0 20312d0: 82 10 20 14 mov 0x14, %g1 20312d4: c2 22 00 00 st %g1, [ %o0 ] 20312d8: 81 c7 e0 08 ret 20312dc: 81 e8 00 00 restore =============================================================================== 02003718 : */ int gettimeofday( struct timeval *tp, void * __tz __attribute__((unused)) ) { 2003718: 9d e3 bf 98 save %sp, -104, %sp /* struct timezone* tzp = (struct timezone*) __tz; */ if ( !tp ) 200371c: b6 96 20 00 orcc %i0, 0, %i3 2003720: 02 80 00 1a be 2003788 <== NEVER TAKEN 2003724: 90 07 bf f8 add %fp, -8, %o0 ) { Timestamp_Control snapshot_as_timestamp; Timestamp_Control *snapshot_as_timestamp_ptr; snapshot_as_timestamp_ptr = 2003728: 13 00 80 72 sethi %hi(0x201c800), %o1 200372c: 40 00 15 09 call 2008b50 <_TOD_Get_with_nanoseconds> 2003730: 92 12 63 c8 or %o1, 0x3c8, %o1 ! 201cbc8 <_TOD> struct timeval *tp, struct timezone *tzp ) { return gettimeofday( tp, tzp ); } 2003734: f8 1a 00 00 ldd [ %o0 ], %i4 static inline void _Timestamp64_implementation_To_timeval( const Timestamp64_Control *_timestamp, struct timeval *_timeval ) { _timeval->tv_sec = (time_t) (*_timestamp / 1000000000U); 2003738: 94 10 20 00 clr %o2 200373c: 90 10 00 1c mov %i4, %o0 2003740: 92 10 00 1d mov %i5, %o1 2003744: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2003748: 40 00 54 4d call 201887c <__divdi3> 200374c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timeval->tv_usec = (suseconds_t) ((*_timestamp % 1000000000U) / 1000U); 2003750: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timeval( const Timestamp64_Control *_timestamp, struct timeval *_timeval ) { _timeval->tv_sec = (time_t) (*_timestamp / 1000000000U); 2003754: d2 26 c0 00 st %o1, [ %i3 ] _timeval->tv_usec = (suseconds_t) ((*_timestamp % 1000000000U) / 1000U); 2003758: 90 10 00 1c mov %i4, %o0 200375c: 92 10 00 1d mov %i5, %o1 2003760: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2003764: 40 00 55 31 call 2018c28 <__moddi3> 2003768: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 200376c: 94 10 20 00 clr %o2 2003770: 96 10 23 e8 mov 0x3e8, %o3 2003774: 40 00 54 42 call 201887c <__divdi3> 2003778: b0 10 20 00 clr %i0 200377c: d2 26 e0 04 st %o1, [ %i3 + 4 ] * with Eric Norum, this is how GNU/Linux, Solaris, and MacOS X * do it. This puts us in good company. */ return 0; } 2003780: 81 c7 e0 08 ret 2003784: 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 ); 2003788: 40 00 2f 68 call 200f528 <__errno> <== NOT EXECUTED 200378c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003790: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 2003794: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003798: 81 c7 e0 08 ret <== NOT EXECUTED 200379c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200ed60 : ssize_t imfs_dir_read( rtems_libio_t *iop, void *buffer, size_t count ) { 200ed60: 9d e3 be 88 save %sp, -376, %sp static inline void rtems_filesystem_instance_lock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 200ed64: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 200ed68: c4 02 20 0c ld [ %o0 + 0xc ], %g2 200ed6c: c2 00 80 00 ld [ %g2 ], %g1 200ed70: 9f c0 40 00 call %g1 200ed74: 01 00 00 00 nop int last_entry; struct dirent tmp_dirent; rtems_filesystem_instance_lock( &iop->pathinfo ); the_jnode = (IMFS_jnode_t *)iop->pathinfo.node_access; 200ed78: e4 06 20 1c ld [ %i0 + 0x1c ], %l2 the_chain = &the_jnode->info.directory.Entries; /* Move to the first of the desired directory entries */ bytes_transferred = 0; first_entry = iop->offset; 200ed7c: e0 06 20 0c ld [ %i0 + 0xc ], %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 ); 200ed80: 90 10 00 1a mov %i2, %o0 200ed84: 40 00 25 66 call 201831c <.udiv> 200ed88: 92 10 21 18 mov 0x118, %o1 200ed8c: 83 2a 20 03 sll %o0, 3, %g1 200ed90: 91 2a 20 05 sll %o0, 5, %o0 200ed94: 82 00 40 08 add %g1, %o0, %g1 200ed98: a3 28 60 03 sll %g1, 3, %l1 200ed9c: a2 24 40 01 sub %l1, %g1, %l1 200eda0: a2 04 40 10 add %l1, %l0, %l1 /* The directory was not empty so try to move to the desired entry in chain*/ for ( 200eda4: 80 a4 60 00 cmp %l1, 0 200eda8: 04 80 00 34 ble 200ee78 <== NEVER TAKEN 200edac: f4 04 a0 50 ld [ %l2 + 0x50 ], %i2 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( const Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Immutable_tail( the_chain )); 200edb0: a4 04 a0 54 add %l2, 0x54, %l2 current_entry = 0, the_node = rtems_chain_first( the_chain ); current_entry < last_entry && !rtems_chain_is_tail( the_chain, the_node ); 200edb4: 80 a6 80 12 cmp %i2, %l2 200edb8: 02 80 00 29 be 200ee5c 200edbc: a6 10 20 00 clr %l3 200edc0: b6 10 20 00 clr %i3 the_node = rtems_chain_next( the_node ) ) { if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; tmp_dirent.d_reclen = sizeof( struct dirent ); 200edc4: 10 80 00 08 b 200ede4 200edc8: a8 10 21 18 mov 0x118, %l4 /* -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 ( 200edcc: 80 a4 40 1b cmp %l1, %i3 200edd0: 04 80 00 23 ble 200ee5c <== NEVER TAKEN 200edd4: f4 06 80 00 ld [ %i2 ], %i2 current_entry = 0, the_node = rtems_chain_first( the_chain ); current_entry < last_entry && !rtems_chain_is_tail( the_chain, the_node ); 200edd8: 80 a6 80 12 cmp %i2, %l2 200eddc: 22 80 00 21 be,a 200ee60 200ede0: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 current_entry += sizeof( struct dirent ), the_node = rtems_chain_next( the_node ) ) { if( current_entry >= first_entry ) { 200ede4: 80 a4 00 1b cmp %l0, %i3 200ede8: 34 bf ff f9 bg,a 200edcc 200edec: b6 06 e1 18 add %i3, 0x118, %i3 /* 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; 200edf0: c2 06 a0 38 ld [ %i2 + 0x38 ], %g1 current_entry += sizeof( struct dirent ), the_node = rtems_chain_next( the_node ) ) { if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200edf4: 85 3e e0 1f sra %i3, 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 ); 200edf8: ba 06 a0 0c add %i2, 0xc, %i5 current_entry += sizeof( struct dirent ), the_node = rtems_chain_next( the_node ) ) { if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200edfc: 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; 200ee00: c2 27 be e8 st %g1, [ %fp + -280 ] current_entry += sizeof( struct dirent ), the_node = rtems_chain_next( the_node ) ) { if( current_entry >= first_entry ) { /* Move the entry to the return buffer */ tmp_dirent.d_off = current_entry; 200ee04: f6 27 be f4 st %i3, [ %fp + -268 ] 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 ); 200ee08: 90 10 00 1d mov %i5, %o0 200ee0c: 40 00 07 2c call 2010abc 200ee10: e8 37 be f8 sth %l4, [ %fp + -264 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200ee14: 92 10 00 1d mov %i5, %o1 200ee18: 94 02 20 01 add %o0, 1, %o2 /* 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 ); 200ee1c: d0 37 be fa sth %o0, [ %fp + -262 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200ee20: 40 00 04 13 call 200fe6c 200ee24: 90 07 be fc add %fp, -260, %o0 memcpy( 200ee28: 90 06 40 13 add %i1, %l3, %o0 200ee2c: 92 07 be e8 add %fp, -280, %o1 200ee30: 40 00 04 0f call 200fe6c 200ee34: 94 10 21 18 mov 0x118, %o2 buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200ee38: c4 1e 20 08 ldd [ %i0 + 8 ], %g2 #include "imfs.h" #include #include ssize_t imfs_dir_read( 200ee3c: b6 06 e1 18 add %i3, 0x118, %i3 memcpy( buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200ee40: ba 80 e1 18 addcc %g3, 0x118, %i5 200ee44: b8 40 a0 00 addx %g2, 0, %i4 200ee48: f8 3e 20 08 std %i4, [ %i0 + 8 ] bytes_transferred += sizeof( struct dirent ); 200ee4c: a6 04 e1 18 add %l3, 0x118, %l3 /* -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 ( 200ee50: 80 a4 40 1b cmp %l1, %i3 200ee54: 14 bf ff e1 bg 200edd8 <== NEVER TAKEN 200ee58: f4 06 80 00 ld [ %i2 ], %i2 static inline void rtems_filesystem_instance_unlock( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 200ee5c: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 200ee60: c2 02 20 0c ld [ %o0 + 0xc ], %g1 200ee64: c2 00 60 04 ld [ %g1 + 4 ], %g1 200ee68: 9f c0 40 00 call %g1 200ee6c: b0 10 00 13 mov %l3, %i0 } rtems_filesystem_instance_unlock( &iop->pathinfo ); return bytes_transferred; } 200ee70: 81 c7 e0 08 ret 200ee74: 81 e8 00 00 restore the_jnode = (IMFS_jnode_t *)iop->pathinfo.node_access; the_chain = &the_jnode->info.directory.Entries; /* Move to the first of the desired directory entries */ bytes_transferred = 0; 200ee78: 10 bf ff f9 b 200ee5c <== NOT EXECUTED 200ee7c: a6 10 20 00 clr %l3 <== NOT EXECUTED =============================================================================== 0202733c : /** * Initialize useable but dummy databases */ void init_etc_passwd_group(void) { 202733c: 9d e3 bf a0 save %sp, -96, %sp FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) 2027340: 03 00 81 95 sethi %hi(0x2065400), %g1 2027344: c4 48 60 b8 ldsb [ %g1 + 0xb8 ], %g2 ! 20654b8 2027348: 80 a0 a0 00 cmp %g2, 0 202734c: 02 80 00 04 be 202735c 2027350: 84 10 20 01 mov 1, %g2 2027354: 81 c7 e0 08 ret 2027358: 81 e8 00 00 restore return; etc_passwd_initted = 1; mkdir("/etc", 0777); 202735c: 92 10 21 ff mov 0x1ff, %o1 FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) return; etc_passwd_initted = 1; 2027360: c4 28 60 b8 stb %g2, [ %g1 + 0xb8 ] mkdir("/etc", 0777); 2027364: 11 00 81 72 sethi %hi(0x205c800), %o0 2027368: 7f ff 71 4d call 200389c 202736c: 90 12 21 20 or %o0, 0x120, %o0 ! 205c920 /* * Initialize /etc/passwd */ if ((fp = fopen("/etc/passwd", "r")) != NULL) { 2027370: 39 00 81 72 sethi %hi(0x205c800), %i4 2027374: 3b 00 81 84 sethi %hi(0x2061000), %i5 2027378: 90 17 21 28 or %i4, 0x128, %o0 202737c: 40 00 51 d6 call 203bad4 2027380: 92 17 61 b0 or %i5, 0x1b0, %o1 2027384: 80 a2 20 00 cmp %o0, 0 2027388: 22 80 00 0d be,a 20273bc 202738c: 90 17 21 28 or %i4, 0x128, %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); 2027390: 40 00 4f 73 call 203b15c 2027394: 01 00 00 00 nop } /* * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { 2027398: 39 00 81 72 sethi %hi(0x205c800), %i4 202739c: 92 17 61 b0 or %i5, 0x1b0, %o1 20273a0: 40 00 51 cd call 203bad4 20273a4: 90 17 21 a0 or %i4, 0x1a0, %o0 20273a8: 80 a2 20 00 cmp %o0, 0 20273ac: 22 80 00 11 be,a 20273f0 20273b0: 90 17 21 a0 or %i4, 0x1a0, %o0 fclose(fp); 20273b4: 40 00 4f 6a call 203b15c 20273b8: 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) { 20273bc: 13 00 81 6a sethi %hi(0x205a800), %o1 20273c0: 40 00 51 c5 call 203bad4 20273c4: 92 12 60 e8 or %o1, 0xe8, %o1 ! 205a8e8 20273c8: b8 92 20 00 orcc %o0, 0, %i4 20273cc: 02 bf ff f3 be 2027398 <== NEVER TAKEN 20273d0: 92 10 20 01 mov 1, %o1 fprintf(fp, "root:*:0:0:root::/:/bin/sh\n" 20273d4: 94 10 20 66 mov 0x66, %o2 20273d8: 96 10 00 1c mov %i4, %o3 20273dc: 11 00 81 72 sethi %hi(0x205c800), %o0 20273e0: 40 00 56 8c call 203ce10 20273e4: 90 12 21 38 or %o0, 0x138, %o0 ! 205c938 "rtems:*:1:1:RTEMS Application::/:/bin/sh\n" "tty:!:2:2:tty owner::/:/bin/false\n" ); fclose(fp); 20273e8: 10 bf ff ea b 2027390 20273ec: 90 10 00 1c mov %i4, %o0 * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { fclose(fp); } else if ((fp = fopen("/etc/group", "w")) != NULL) { 20273f0: 13 00 81 6a sethi %hi(0x205a800), %o1 20273f4: 40 00 51 b8 call 203bad4 20273f8: 92 12 60 e8 or %o1, 0xe8, %o1 ! 205a8e8 20273fc: b0 92 20 00 orcc %o0, 0, %i0 2027400: 02 bf ff d5 be 2027354 <== NEVER TAKEN 2027404: 92 10 20 01 mov 1, %o1 fprintf( fp, "root:x:0:root\n" 2027408: 11 00 81 72 sethi %hi(0x205c800), %o0 202740c: 94 10 20 2a mov 0x2a, %o2 2027410: 96 10 00 18 mov %i0, %o3 2027414: 40 00 56 7f call 203ce10 2027418: 90 12 21 b0 or %o0, 0x1b0, %o0 "rtems:x:1:rtems\n" "tty:x:2:tty\n" ); fclose(fp); 202741c: 40 00 4f 50 call 203b15c 2027420: 81 e8 00 00 restore =============================================================================== 020063d8 : /* * Process a single input character */ static int iproc (unsigned char c, struct rtems_termios_tty *tty) { 20063d8: 9d e3 bf a0 save %sp, -96, %sp if (tty->termios.c_iflag & ISTRIP) 20063dc: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 20063e0: 80 88 60 20 btst 0x20, %g1 20063e4: 32 80 00 02 bne,a 20063ec <== NEVER TAKEN 20063e8: b0 0e 20 7f and %i0, 0x7f, %i0 <== NOT EXECUTED c &= 0x7f; if (tty->termios.c_iflag & IUCLC) 20063ec: 80 88 62 00 btst 0x200, %g1 20063f0: 02 80 00 0d be 2006424 20063f4: 80 a6 20 0d cmp %i0, 0xd c = tolower (c); 20063f8: 05 00 80 70 sethi %hi(0x201c000), %g2 20063fc: c6 00 a3 40 ld [ %g2 + 0x340 ], %g3 ! 201c340 <__ctype_ptr__> 2006400: 84 10 00 18 mov %i0, %g2 2006404: b0 00 c0 18 add %g3, %i0, %i0 2006408: c6 0e 20 01 ldub [ %i0 + 1 ], %g3 200640c: 86 08 e0 03 and %g3, 3, %g3 2006410: 80 a0 e0 01 cmp %g3, 1 2006414: 22 80 00 02 be,a 200641c 2006418: 84 00 a0 20 add %g2, 0x20, %g2 200641c: b0 08 a0 ff and %g2, 0xff, %i0 if (c == '\r') { 2006420: 80 a6 20 0d cmp %i0, 0xd 2006424: 02 80 00 1d be 2006498 2006428: 80 a6 20 0a cmp %i0, 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)) { 200642c: 02 80 00 44 be 200653c 2006430: 80 a6 20 00 cmp %i0, 0 c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 2006434: 32 80 00 1f bne,a 20064b0 <== ALWAYS TAKEN 2006438: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 } /* * FIXME: Should do IMAXBEL handling somehow */ if (tty->ccount < (CBUFSIZE-1)) { 200643c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2006440: 05 00 80 70 sethi %hi(0x201c000), %g2 2006444: c4 00 a2 10 ld [ %g2 + 0x210 ], %g2 ! 201c210 2006448: 84 00 bf ff add %g2, -1, %g2 200644c: 80 a0 40 02 cmp %g1, %g2 2006450: 1a 80 00 10 bcc 2006490 <== NEVER TAKEN 2006454: 01 00 00 00 nop if (tty->termios.c_lflag & ECHO) 2006458: c4 06 60 3c ld [ %i1 + 0x3c ], %g2 200645c: 80 88 a0 08 btst 8, %g2 2006460: 12 80 00 3c bne 2006550 <== ALWAYS TAKEN 2006464: 84 00 60 01 add %g1, 1, %g2 echo (c, tty); tty->cbuf[tty->ccount++] = c; 2006468: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 <== NOT EXECUTED 200646c: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] <== NOT EXECUTED 2006470: c4 26 60 20 st %g2, [ %i1 + 0x20 ] <== NOT EXECUTED } return 0; 2006474: 81 c7 e0 08 ret <== NOT EXECUTED 2006478: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED * FIXME: Some of the tests should check for IEXTEN, too. */ static void erase (struct rtems_termios_tty *tty, int lineFlag) { if (tty->ccount == 0) 200647c: 80 a0 60 00 cmp %g1, 0 2006480: 02 80 00 04 be 2006490 2006484: 90 10 00 19 mov %i1, %o0 2006488: 7f ff ff 5f call 2006204 200648c: 92 10 20 00 clr %o1 } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { if (c == tty->termios.c_cc[VERASE]) { erase (tty, 0); return 0; 2006490: 81 c7 e0 08 ret 2006494: 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) 2006498: 80 88 60 80 btst 0x80, %g1 200649c: 12 bf ff fd bne 2006490 <== NEVER TAKEN 20064a0: 80 88 61 00 btst 0x100, %g1 return 0; if (tty->termios.c_iflag & ICRNL) 20064a4: 32 80 00 02 bne,a 20064ac <== ALWAYS TAKEN 20064a8: b0 10 20 0a mov 0xa, %i0 c = '\n'; } else if ((c == '\n') && (tty->termios.c_iflag & INLCR)) { c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 20064ac: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 20064b0: 80 88 60 02 btst 2, %g1 20064b4: 22 bf ff e3 be,a 2006440 20064b8: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 if (c == tty->termios.c_cc[VERASE]) { 20064bc: c4 0e 60 43 ldub [ %i1 + 0x43 ], %g2 20064c0: 80 a0 80 18 cmp %g2, %i0 20064c4: 22 bf ff ee be,a 200647c 20064c8: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { 20064cc: c4 0e 60 44 ldub [ %i1 + 0x44 ], %g2 20064d0: 80 a0 80 18 cmp %g2, %i0 20064d4: 22 80 00 2d be,a 2006588 20064d8: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 erase (tty, 1); return 0; } else if (c == tty->termios.c_cc[VEOF]) { 20064dc: c4 0e 60 45 ldub [ %i1 + 0x45 ], %g2 20064e0: 80 a0 80 18 cmp %g2, %i0 20064e4: 02 80 00 42 be 20065ec <== NEVER TAKEN 20064e8: 80 a6 20 0a cmp %i0, 0xa return 1; } else if (c == '\n') { 20064ec: 02 80 00 33 be 20065b8 20064f0: 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]) || 20064f4: c4 0e 60 4c ldub [ %i1 + 0x4c ], %g2 20064f8: 80 a0 80 18 cmp %g2, %i0 20064fc: 02 80 00 07 be 2006518 <== NEVER TAKEN 2006500: 80 88 60 08 btst 8, %g1 2006504: c4 0e 60 51 ldub [ %i1 + 0x51 ], %g2 2006508: 80 a0 80 18 cmp %g2, %i0 200650c: 32 bf ff cd bne,a 2006440 <== ALWAYS TAKEN 2006510: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (c == tty->termios.c_cc[VEOL2])) { if (tty->termios.c_lflag & ECHO) 2006514: 80 88 60 08 btst 8, %g1 <== NOT EXECUTED 2006518: 12 80 00 18 bne 2006578 <== NOT EXECUTED 200651c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED echo (c, tty); tty->cbuf[tty->ccount++] = c; 2006520: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2006524: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 <== NOT EXECUTED 2006528: 84 00 60 01 add %g1, 1, %g2 <== NOT EXECUTED 200652c: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] <== NOT EXECUTED 2006530: c4 26 60 20 st %g2, [ %i1 + 0x20 ] <== NOT EXECUTED return 1; 2006534: 81 c7 e0 08 ret <== NOT EXECUTED 2006538: 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)) { 200653c: 80 88 60 40 btst 0x40, %g1 2006540: 32 bf ff db bne,a 20064ac <== NEVER TAKEN 2006544: b0 10 20 0d mov 0xd, %i0 <== NOT EXECUTED c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 2006548: 10 bf ff da b 20064b0 200654c: 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); 2006550: 90 10 00 18 mov %i0, %o0 2006554: 7f ff ff 0b call 2006180 2006558: 92 10 00 19 mov %i1, %o1 200655c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 tty->cbuf[tty->ccount++] = c; 2006560: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 2006564: 84 00 60 01 add %g1, 1, %g2 2006568: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] 200656c: c4 26 60 20 st %g2, [ %i1 + 0x20 ] } return 0; 2006570: 81 c7 e0 08 ret 2006574: 91 e8 20 00 restore %g0, 0, %o0 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); 2006578: 7f ff ff 02 call 2006180 <== NOT EXECUTED 200657c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED tty->cbuf[tty->ccount++] = c; 2006580: 10 bf ff e9 b 2006524 <== NOT EXECUTED 2006584: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED * FIXME: Some of the tests should check for IEXTEN, too. */ static void erase (struct rtems_termios_tty *tty, int lineFlag) { if (tty->ccount == 0) 2006588: 80 a0 a0 00 cmp %g2, 0 200658c: 02 bf ff c1 be 2006490 <== NEVER TAKEN 2006590: 80 88 60 08 btst 8, %g1 return; if (lineFlag) { if (!(tty->termios.c_lflag & ECHO)) { 2006594: 02 80 00 18 be 20065f4 <== NEVER TAKEN 2006598: 80 88 60 10 btst 0x10, %g1 tty->ccount = 0; return; } if (!(tty->termios.c_lflag & ECHOE)) { 200659c: 02 80 00 19 be 2006600 <== NEVER TAKEN 20065a0: 90 10 00 19 mov %i1, %o0 20065a4: 92 10 20 01 mov 1, %o1 erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { erase (tty, 1); return 0; 20065a8: 7f ff ff 17 call 2006204 20065ac: b0 10 20 00 clr %i0 20065b0: 81 c7 e0 08 ret 20065b4: 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)) 20065b8: 22 80 00 06 be,a 20065d0 <== NEVER TAKEN 20065bc: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED echo (c, tty); 20065c0: 90 10 20 0a mov 0xa, %o0 20065c4: 7f ff fe ef call 2006180 20065c8: 92 10 00 19 mov %i1, %o1 tty->cbuf[tty->ccount++] = c; 20065cc: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 20065d0: c4 06 60 1c ld [ %i1 + 0x1c ], %g2 20065d4: 86 10 20 0a mov 0xa, %g3 20065d8: c6 28 80 01 stb %g3, [ %g2 + %g1 ] 20065dc: 82 00 60 01 inc %g1 20065e0: c2 26 60 20 st %g1, [ %i1 + 0x20 ] return 1; 20065e4: 81 c7 e0 08 ret 20065e8: 91 e8 20 01 restore %g0, 1, %o0 if (tty->termios.c_lflag & ECHO) echo (c, tty); tty->cbuf[tty->ccount++] = c; } return 0; } 20065ec: 81 c7 e0 08 ret <== NOT EXECUTED 20065f0: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED { if (tty->ccount == 0) return; if (lineFlag) { if (!(tty->termios.c_lflag & ECHO)) { tty->ccount = 0; 20065f4: c0 26 60 20 clr [ %i1 + 0x20 ] <== NOT EXECUTED erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { erase (tty, 1); return 0; 20065f8: 81 c7 e0 08 ret <== NOT EXECUTED 20065fc: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED if (!(tty->termios.c_lflag & ECHO)) { tty->ccount = 0; return; } if (!(tty->termios.c_lflag & ECHOE)) { tty->ccount = 0; 2006600: c0 26 60 20 clr [ %i1 + 0x20 ] <== NOT EXECUTED echo (tty->termios.c_cc[VKILL], tty); 2006604: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2006608: 7f ff fe de call 2006180 <== NOT EXECUTED 200660c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED if (tty->termios.c_lflag & ECHOK) 2006610: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 <== NOT EXECUTED 2006614: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 2006618: 02 bf ff 9e be 2006490 <== NOT EXECUTED 200661c: 90 10 20 0a mov 0xa, %o0 <== NOT EXECUTED echo ('\n', tty); 2006620: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2006624: 7f ff fe d7 call 2006180 <== NOT EXECUTED 2006628: b0 10 20 00 clr %i0 <== NOT EXECUTED 200662c: 81 c7 e0 08 ret <== NOT EXECUTED 2006630: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02019b94 : #if !defined(RTEMS_POSIX_API) int kill( pid_t pid, int sig ) { return 0; } 2019b94: 81 c3 e0 08 retl <== NOT EXECUTED 2019b98: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 02003f3c : extern void _wrapup_reent(struct _reent *); extern void _reclaim_reent(struct _reent *); void libc_wrapup(void) { 2003f3c: 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())) 2003f40: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003f44: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ce8c <_System_state_Current> 2003f48: 80 a0 60 03 cmp %g1, 3 2003f4c: 02 80 00 04 be 2003f5c <== ALWAYS TAKEN 2003f50: 3b 00 80 70 sethi %hi(0x201c000), %i5 2003f54: 81 c7 e0 08 ret <== NOT EXECUTED 2003f58: 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) { 2003f5c: 05 00 80 6d sethi %hi(0x201b400), %g2 2003f60: c2 07 63 48 ld [ %i5 + 0x348 ], %g1 2003f64: f8 00 a1 d0 ld [ %g2 + 0x1d0 ], %i4 2003f68: 80 a0 40 1c cmp %g1, %i4 2003f6c: 02 80 00 05 be 2003f80 2003f70: 01 00 00 00 nop _wrapup_reent(_global_impure_ptr); 2003f74: 40 00 30 9c call 20101e4 <_wrapup_reent> 2003f78: 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; 2003f7c: f8 27 63 48 st %i4, [ %i5 + 0x348 ] * * Should this be changed to do *all* file streams? * _fwalk (_REENT, fclose); */ fclose (stdin); 2003f80: 40 00 2d bc call 200f670 2003f84: d0 07 20 04 ld [ %i4 + 4 ], %o0 fclose (stdout); 2003f88: c2 07 63 48 ld [ %i5 + 0x348 ], %g1 2003f8c: 40 00 2d b9 call 200f670 2003f90: d0 00 60 08 ld [ %g1 + 8 ], %o0 fclose (stderr); 2003f94: c2 07 63 48 ld [ %i5 + 0x348 ], %g1 2003f98: f0 00 60 0c ld [ %g1 + 0xc ], %i0 2003f9c: 40 00 2d b5 call 200f670 2003fa0: 81 e8 00 00 restore =============================================================================== 020039d8 : #include "malloc_p.h" void *malloc( size_t size ) { 20039d8: 9d e3 bf a0 save %sp, -96, %sp void *return_this; MSBUMP(malloc_calls, 1); 20039dc: 03 00 80 72 sethi %hi(0x201c800), %g1 20039e0: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201caf8 20039e4: c4 00 60 04 ld [ %g1 + 4 ], %g2 20039e8: 84 00 a0 01 inc %g2 /* * If some free's have been deferred, then do them now. */ malloc_deferred_frees_process(); 20039ec: 7f ff ff b8 call 20038cc 20039f0: c4 20 60 04 st %g2, [ %g1 + 4 ] /* * Validate the parameters */ if ( !size ) 20039f4: 80 a6 20 00 cmp %i0, 0 20039f8: 02 80 00 25 be 2003a8c 20039fc: 03 00 80 73 sethi %hi(0x201cc00), %g1 return (void *) 0; /* * Do not attempt to allocate memory if not in correct system state. */ if ( _System_state_Is_up(_System_state_Get()) && 2003a00: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ce8c <_System_state_Current> 2003a04: 80 a0 60 03 cmp %g1, 3 2003a08: 02 80 00 1c be 2003a78 2003a0c: 39 00 80 70 sethi %hi(0x201c000), %i4 RTEMS_INLINE_ROUTINE void *_Protected_heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Protected_heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 2003a10: d0 07 20 e0 ld [ %i4 + 0xe0 ], %o0 ! 201c0e0 2003a14: 92 10 00 18 mov %i0, %o1 2003a18: 94 10 20 00 clr %o2 2003a1c: 40 00 17 e2 call 20099a4 <_Protected_heap_Allocate_aligned_with_boundary> 2003a20: 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 ) { 2003a24: ba 92 20 00 orcc %o0, 0, %i5 2003a28: 02 80 00 1c be 2003a98 2003a2c: d0 07 20 e0 ld [ %i4 + 0xe0 ], %o0 } /* * If the user wants us to dirty the allocated memory, then do it. */ if ( rtems_malloc_dirty_helper ) 2003a30: 03 00 80 72 sethi %hi(0x201c800), %g1 2003a34: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 201c830 2003a38: 80 a0 60 00 cmp %g1, 0 2003a3c: 02 80 00 04 be 2003a4c 2003a40: 90 10 00 1d mov %i5, %o0 (*rtems_malloc_dirty_helper)( return_this, size ); 2003a44: 9f c0 40 00 call %g1 2003a48: 92 10 00 18 mov %i0, %o1 /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 2003a4c: 03 00 80 72 sethi %hi(0x201c800), %g1 2003a50: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 ! 201c834 2003a54: 80 a0 60 00 cmp %g1, 0 2003a58: 22 80 00 06 be,a 2003a70 2003a5c: b0 10 00 1d mov %i5, %i0 (*rtems_malloc_statistics_helpers->at_malloc)(return_this); 2003a60: c2 00 60 04 ld [ %g1 + 4 ], %g1 2003a64: 9f c0 40 00 call %g1 2003a68: 90 10 00 1d mov %i5, %o0 return return_this; } 2003a6c: b0 10 00 1d mov %i5, %i0 2003a70: 81 c7 e0 08 ret 2003a74: 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() ) 2003a78: 7f ff ff 88 call 2003898 2003a7c: 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()) && 2003a80: 80 8a 20 ff btst 0xff, %o0 2003a84: 12 bf ff e3 bne 2003a10 <== ALWAYS TAKEN 2003a88: 01 00 00 00 nop /* * Validate the parameters */ if ( !size ) return (void *) 0; 2003a8c: ba 10 20 00 clr %i5 ! 0 */ if ( rtems_malloc_statistics_helpers ) (*rtems_malloc_statistics_helpers->at_malloc)(return_this); return return_this; } 2003a90: 81 c7 e0 08 ret 2003a94: 91 e8 00 1d restore %g0, %i5, %o0 */ return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); if ( !return_this ) { return_this = (*rtems_malloc_extend_handler)( RTEMS_Malloc_Heap, size ); 2003a98: 03 00 80 68 sethi %hi(0x201a000), %g1 2003a9c: c2 00 60 b0 ld [ %g1 + 0xb0 ], %g1 ! 201a0b0 2003aa0: 9f c0 40 00 call %g1 2003aa4: 92 10 00 18 mov %i0, %o1 if ( !return_this ) { 2003aa8: ba 92 20 00 orcc %o0, 0, %i5 2003aac: 12 bf ff e2 bne 2003a34 <== NEVER TAKEN 2003ab0: 03 00 80 72 sethi %hi(0x201c800), %g1 errno = ENOMEM; 2003ab4: 40 00 2e 9d call 200f528 <__errno> 2003ab8: b0 10 00 1d mov %i5, %i0 2003abc: 82 10 20 0c mov 0xc, %g1 2003ac0: c2 22 00 00 st %g1, [ %o0 ] 2003ac4: 81 c7 e0 08 ret 2003ac8: 81 e8 00 00 restore =============================================================================== 0200de80 : * Allocate a block for an in-memory file. */ int memfile_blocks_allocated = 0; void *memfile_alloc_block(void) { 200de80: 9d e3 bf a0 save %sp, -96, %sp void *memory; memory = (void *)calloc(1, IMFS_MEMFILE_BYTES_PER_BLOCK); 200de84: 03 00 80 72 sethi %hi(0x201c800), %g1 200de88: d2 00 60 60 ld [ %g1 + 0x60 ], %o1 ! 201c860 200de8c: 7f ff d5 4a call 20033b4 200de90: 90 10 20 01 mov 1, %o0 if ( memory ) 200de94: b0 92 20 00 orcc %o0, 0, %i0 200de98: 02 80 00 05 be 200deac <== NEVER TAKEN 200de9c: 03 00 80 72 sethi %hi(0x201c800), %g1 memfile_blocks_allocated++; 200dea0: c4 00 61 74 ld [ %g1 + 0x174 ], %g2 ! 201c974 200dea4: 84 00 a0 01 inc %g2 200dea8: c4 20 61 74 st %g2, [ %g1 + 0x174 ] return memory; } 200deac: 81 c7 e0 08 ret 200deb0: 81 e8 00 00 restore =============================================================================== 0200e3f8 : */ static void memfile_free_blocks_in_table( block_p **block_table, int entries ) { 200e3f8: 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 200e404: d0 06 00 00 ld [ %i0 ], %o0 200e408: ba 10 00 08 mov %o0, %i5 200e40c: b8 10 20 00 clr %i4 if ( b[i] ) { 200e410: d0 07 40 00 ld [ %i5 ], %o0 200e414: 80 a2 20 00 cmp %o0, 0 200e418: 02 80 00 05 be 200e42c 200e41c: b8 07 20 01 inc %i4 memfile_free_block( b[i] ); 200e420: 7f ff ff ed call 200e3d4 200e424: 01 00 00 00 nop b[i] = 0; 200e428: 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 200e434: ba 07 60 04 add %i5, 4, %i5 200e438: 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 ); 200e43c: 7f ff ff e6 call 200e3d4 200e440: 01 00 00 00 nop *block_table = 0; 200e444: c0 26 00 00 clr [ %i0 ] 200e448: 81 c7 e0 08 ret 200e44c: 81 e8 00 00 restore =============================================================================== 0200ea8c : int memfile_ftruncate( rtems_libio_t *iop, off_t length ) { 200ea8c: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; 200ea90: 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 ) 200ea94: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200ea98: 80 a0 40 19 cmp %g1, %i1 200ea9c: 06 80 00 11 bl 200eae0 <== NEVER TAKEN 200eaa0: 90 10 00 1d mov %i5, %o0 200eaa4: 22 80 00 0b be,a 200ead0 <== ALWAYS TAKEN 200eaa8: 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; 200eaac: f2 27 60 50 st %i1, [ %i5 + 0x50 ] <== NOT EXECUTED 200eab0: f4 27 60 54 st %i2, [ %i5 + 0x54 ] IMFS_update_atime( the_jnode ); 200eab4: 90 07 bf f8 add %fp, -8, %o0 200eab8: 7f ff d3 18 call 2003718 200eabc: 92 10 20 00 clr %o1 200eac0: c2 07 bf f8 ld [ %fp + -8 ], %g1 200eac4: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return 0; } 200eac8: 81 c7 e0 08 ret 200eacc: 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 ) 200ead0: 80 a0 40 1a cmp %g1, %i2 200ead4: 3a bf ff f7 bcc,a 200eab0 200ead8: f2 27 60 50 st %i1, [ %i5 + 0x50 ] return IMFS_memfile_extend( the_jnode, true, length ); 200eadc: 90 10 00 1d mov %i5, %o0 200eae0: 92 10 20 01 mov 1, %o1 200eae4: 94 10 00 19 mov %i1, %o2 200eae8: 7f ff fe c4 call 200e5f8 200eaec: 96 10 00 1a mov %i2, %o3 200eaf0: 81 c7 e0 08 ret 200eaf4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200ea10 : rtems_libio_t *iop, const char *pathname, int oflag, mode_t mode ) { 200ea10: 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) 200ea14: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200ea18: 80 88 60 04 btst 4, %g1 200ea1c: 02 80 00 07 be 200ea38 200ea20: d0 06 20 1c ld [ %i0 + 0x1c ], %o0 200ea24: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { 200ea28: c2 00 40 00 ld [ %g1 ], %g1 200ea2c: 80 a0 60 05 cmp %g1, 5 200ea30: 22 80 00 04 be,a 200ea40 <== NEVER TAKEN 200ea34: d8 02 20 54 ld [ %o0 + 0x54 ], %o4 <== NOT EXECUTED if ((count != 0) && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) return -1; } return 0; 200ea38: 81 c7 e0 08 ret 200ea3c: 91 e8 20 00 restore %g0, 0, %o0 * Perform 'copy on write' for linear files */ if ((iop->flags & LIBIO_FLAGS_WRITE) && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { uint32_t count = the_jnode->info.linearfile.size; const unsigned char *buffer = the_jnode->info.linearfile.direct; 200ea40: d6 02 20 58 ld [ %o0 + 0x58 ], %o3 <== NOT EXECUTED the_jnode->control = &IMFS_node_control_memfile; 200ea44: 03 00 80 6c sethi %hi(0x201b000), %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200ea48: c0 22 20 50 clr [ %o0 + 0x50 ] <== NOT EXECUTED if ((iop->flags & LIBIO_FLAGS_WRITE) && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { uint32_t count = the_jnode->info.linearfile.size; const unsigned char *buffer = the_jnode->info.linearfile.direct; the_jnode->control = &IMFS_node_control_memfile; 200ea4c: 82 10 60 1c or %g1, 0x1c, %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200ea50: c0 22 20 54 clr [ %o0 + 0x54 ] <== NOT EXECUTED the_jnode->info.file.indirect = 0; 200ea54: c0 22 20 58 clr [ %o0 + 0x58 ] <== NOT EXECUTED if ((iop->flags & LIBIO_FLAGS_WRITE) && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { uint32_t count = the_jnode->info.linearfile.size; const unsigned char *buffer = the_jnode->info.linearfile.direct; the_jnode->control = &IMFS_node_control_memfile; 200ea58: c2 22 20 4c st %g1, [ %o0 + 0x4c ] <== NOT EXECUTED the_jnode->info.file.size = 0; the_jnode->info.file.indirect = 0; the_jnode->info.file.doubly_indirect = 0; 200ea5c: c0 22 20 5c clr [ %o0 + 0x5c ] <== NOT EXECUTED the_jnode->info.file.triply_indirect = 0; if ((count != 0) 200ea60: 80 a3 20 00 cmp %o4, 0 <== NOT EXECUTED 200ea64: 02 bf ff f5 be 200ea38 <== NOT EXECUTED 200ea68: c0 22 20 60 clr [ %o0 + 0x60 ] <== NOT EXECUTED && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) 200ea6c: 92 10 20 00 clr %o1 <== NOT EXECUTED 200ea70: 7f ff ff 53 call 200e7bc <== NOT EXECUTED 200ea74: 94 10 20 00 clr %o2 <== NOT EXECUTED return -1; 200ea78: 90 38 00 08 xnor %g0, %o0, %o0 <== NOT EXECUTED 200ea7c: 80 a0 00 08 cmp %g0, %o0 <== NOT EXECUTED 200ea80: b0 40 3f ff addx %g0, -1, %i0 <== NOT EXECUTED } return 0; } 200ea84: 81 c7 e0 08 ret <== NOT EXECUTED 200ea88: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003bf0 : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 2003bf0: 9d e3 bf 50 save %sp, -176, %sp int rv = 0; if ( 2003bf4: 80 a6 e0 01 cmp %i3, 1 2003bf8: 18 80 00 9a bgu 2003e60 2003bfc: 01 00 00 00 nop options == RTEMS_FILESYSTEM_READ_ONLY || options == RTEMS_FILESYSTEM_READ_WRITE ) { rtems_filesystem_fsmount_me_t fsmount_me_h = 2003c00: 40 00 23 43 call 200c90c 2003c04: 90 10 00 1a mov %i2, %o0 rtems_filesystem_get_mount_handler( filesystemtype ); if ( fsmount_me_h != NULL ) { 2003c08: a4 92 20 00 orcc %o0, 0, %l2 2003c0c: 02 80 00 95 be 2003e60 2003c10: 80 a6 60 00 cmp %i1, 0 const char *target_or_null, const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; 2003c14: 02 80 00 7b be 2003e00 2003c18: 01 00 00 00 nop } return rv; } int mount( 2003c1c: 40 00 33 a8 call 2010abc 2003c20: 90 10 00 19 mov %i1, %o0 2003c24: a6 02 20 01 add %o0, 1, %l3 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; 2003c28: 40 00 33 a5 call 2010abc 2003c2c: 90 10 00 1a mov %i2, %o0 } return rv; } int mount( 2003c30: aa 10 00 19 mov %i1, %l5 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; 2003c34: ba 10 00 08 mov %o0, %i5 size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003c38: 80 a6 20 00 cmp %i0, 0 2003c3c: 02 80 00 7a be 2003e24 2003c40: a8 02 20 01 add %o0, 1, %l4 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003c44: ba 07 40 13 add %i5, %l3, %i5 ) { const char *target = target_or_null != NULL ? target_or_null : "/"; size_t filesystemtype_size = strlen( filesystemtype ) + 1; size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003c48: 40 00 33 9d call 2010abc 2003c4c: 90 10 00 18 mov %i0, %o0 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003c50: 92 07 60 65 add %i5, 0x65, %o1 ) { const char *target = target_or_null != NULL ? target_or_null : "/"; size_t filesystemtype_size = strlen( filesystemtype ) + 1; size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003c54: a2 02 20 01 add %o0, 1, %l1 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size + sizeof( rtems_filesystem_global_location_t ); rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); 2003c58: 90 10 20 01 mov 1, %o0 2003c5c: 7f ff fd d6 call 20033b4 2003c60: 92 02 40 11 add %o1, %l1, %o1 if ( mt_entry != NULL ) { 2003c64: ba 92 20 00 orcc %o0, 0, %i5 2003c68: 02 80 00 78 be 2003e48 <== NEVER TAKEN 2003c6c: a0 07 60 64 add %i5, 0x64, %l0 rtems_filesystem_global_location_t *mt_fs_root = (rtems_filesystem_global_location_t *) ((char *) mt_entry + sizeof( *mt_entry )); char *str = (char *) mt_fs_root + sizeof( *mt_fs_root ); memcpy( str, filesystemtype, filesystemtype_size ); 2003c70: 92 10 00 1a mov %i2, %o1 2003c74: 90 10 00 10 mov %l0, %o0 2003c78: 40 00 30 7d call 200fe6c 2003c7c: 94 10 00 14 mov %l4, %o2 mt_entry->type = str; 2003c80: e0 27 60 34 st %l0, [ %i5 + 0x34 ] + filesystemtype_size + source_size + target_size + sizeof( rtems_filesystem_global_location_t ); rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); if ( mt_entry != NULL ) { rtems_filesystem_global_location_t *mt_fs_root = 2003c84: ac 07 60 40 add %i5, 0x40, %l6 memcpy( str, filesystemtype, filesystemtype_size ); mt_entry->type = str; str += filesystemtype_size; if ( source_or_null != NULL ) { 2003c88: 80 a6 20 00 cmp %i0, 0 2003c8c: 02 80 00 08 be 2003cac 2003c90: b4 04 00 14 add %l0, %l4, %i2 memcpy( str, source_or_null, source_size ); 2003c94: 90 10 00 1a mov %i2, %o0 2003c98: 92 10 00 18 mov %i0, %o1 2003c9c: 40 00 30 74 call 200fe6c 2003ca0: 94 10 00 11 mov %l1, %o2 mt_entry->dev = str; 2003ca4: f4 27 60 38 st %i2, [ %i5 + 0x38 ] str += source_size; 2003ca8: b4 06 80 11 add %i2, %l1, %i2 } memcpy( str, target, target_size ); 2003cac: 92 10 00 15 mov %l5, %o1 2003cb0: 94 10 00 13 mov %l3, %o2 2003cb4: 40 00 30 6e call 200fe6c 2003cb8: 90 10 00 1a mov %i2, %o0 mt_entry->target = str; str += target_size; mt_entry->mounted = true; 2003cbc: 82 10 20 01 mov 1, %g1 2003cc0: c2 2f 60 28 stb %g1, [ %i5 + 0x28 ] mt_entry->mt_fs_root = mt_fs_root; mt_entry->pathconf_limits_and_options = &rtems_filesystem_default_pathconf; 2003cc4: 03 00 80 6b sethi %hi(0x201ac00), %g1 2003cc8: 82 10 60 34 or %g1, 0x34, %g1 ! 201ac34 2003ccc: c2 27 60 2c st %g1, [ %i5 + 0x2c ] mt_fs_root->location.mt_entry = mt_entry; mt_fs_root->reference_count = 1; 2003cd0: 82 10 20 01 mov 1, %g1 void *starting_address, size_t number_nodes, size_t node_size ) { _Chain_Initialize( the_chain, starting_address, number_nodes, node_size ); 2003cd4: 90 07 60 14 add %i5, 0x14, %o0 2003cd8: 92 10 00 16 mov %l6, %o1 2003cdc: 94 10 20 01 mov 1, %o2 2003ce0: 96 10 20 24 mov 0x24, %o3 2003ce4: c2 27 60 58 st %g1, [ %i5 + 0x58 ] mt_entry->dev = str; str += source_size; } memcpy( str, target, target_size ); mt_entry->target = str; 2003ce8: f4 27 60 30 st %i2, [ %i5 + 0x30 ] str += target_size; mt_entry->mounted = true; mt_entry->mt_fs_root = mt_fs_root; 2003cec: ec 27 60 24 st %l6, [ %i5 + 0x24 ] 2003cf0: 40 00 12 70 call 20086b0 <_Chain_Initialize> 2003cf4: fa 27 60 54 st %i5, [ %i5 + 0x54 ] ); if ( mt_entry != NULL ) { mt_entry->writeable = options == RTEMS_FILESYSTEM_READ_WRITE; rv = (*fsmount_me_h)( mt_entry, data ); 2003cf8: 90 10 00 1d mov %i5, %o0 filesystemtype, &target_length ); if ( mt_entry != NULL ) { mt_entry->writeable = options == RTEMS_FILESYSTEM_READ_WRITE; 2003cfc: b6 0e e0 01 and %i3, 1, %i3 rv = (*fsmount_me_h)( mt_entry, data ); 2003d00: 92 10 00 1c mov %i4, %o1 2003d04: 9f c4 80 00 call %l2 2003d08: f6 2f 60 29 stb %i3, [ %i5 + 0x29 ] if ( rv == 0 ) { 2003d0c: b0 92 20 00 orcc %o0, 0, %i0 2003d10: 12 80 00 29 bne 2003db4 2003d14: 80 a6 60 00 cmp %i1, 0 if ( target != NULL ) { 2003d18: 02 80 00 58 be 2003e78 2003d1c: 92 10 00 19 mov %i1, %o1 { int rv = 0; rtems_filesystem_eval_path_context_t ctx; int eval_flags = RTEMS_FS_PERMS_RWX | RTEMS_FS_FOLLOW_LINK; rtems_filesystem_location_info_t *currentloc = 2003d20: 94 10 20 1f mov 0x1f, %o2 2003d24: 40 00 03 3b call 2004a10 2003d28: 90 07 bf c8 add %fp, -56, %o0 static inline bool rtems_filesystem_location_is_instance_root( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2003d2c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 return (*mt_entry->ops->are_nodes_equal_h)( 2003d30: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2003d34: d2 00 60 24 ld [ %g1 + 0x24 ], %o1 2003d38: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2003d3c: 9f c0 40 00 call %g1 2003d40: 01 00 00 00 nop rtems_filesystem_eval_path_start( &ctx, target, eval_flags ); if ( !rtems_filesystem_location_is_instance_root( currentloc ) ) { 2003d44: 80 8a 20 ff btst 0xff, %o0 2003d48: 12 80 00 70 bne 2003f08 2003d4c: 92 07 bf e0 add %fp, -32, %o1 static inline void rtems_filesystem_eval_path_extract_currentloc( rtems_filesystem_eval_path_context_t *ctx, rtems_filesystem_location_info_t *get ) { rtems_filesystem_location_copy_and_detach( 2003d50: 40 00 04 29 call 2004df4 2003d54: 90 07 bf b0 add %fp, -80, %o0 rtems_filesystem_location_info_t targetloc; rtems_filesystem_global_location_t *mt_point_node; rtems_filesystem_eval_path_extract_currentloc( &ctx, &targetloc ); mt_point_node = rtems_filesystem_location_transform_to_global( &targetloc ); 2003d58: 40 00 04 b6 call 2005030 2003d5c: 90 07 bf b0 add %fp, -80, %o0 mt_entry->mt_point_node = mt_point_node; rv = (*mt_point_node->location.mt_entry->ops->mount_h)( mt_entry ); 2003d60: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( !rtems_filesystem_location_is_instance_root( currentloc ) ) { rtems_filesystem_location_info_t targetloc; rtems_filesystem_global_location_t *mt_point_node; rtems_filesystem_eval_path_extract_currentloc( &ctx, &targetloc ); mt_point_node = rtems_filesystem_location_transform_to_global( &targetloc ); 2003d64: b8 10 00 08 mov %o0, %i4 mt_entry->mt_point_node = mt_point_node; rv = (*mt_point_node->location.mt_entry->ops->mount_h)( mt_entry ); 2003d68: c2 00 60 0c ld [ %g1 + 0xc ], %g1 rtems_filesystem_location_info_t targetloc; rtems_filesystem_global_location_t *mt_point_node; rtems_filesystem_eval_path_extract_currentloc( &ctx, &targetloc ); mt_point_node = rtems_filesystem_location_transform_to_global( &targetloc ); mt_entry->mt_point_node = mt_point_node; 2003d6c: d0 27 60 20 st %o0, [ %i5 + 0x20 ] rv = (*mt_point_node->location.mt_entry->ops->mount_h)( mt_entry ); 2003d70: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 2003d74: 9f c0 40 00 call %g1 2003d78: 90 10 00 1d mov %i5, %o0 if ( rv == 0 ) { 2003d7c: b0 92 20 00 orcc %o0, 0, %i0 2003d80: 22 80 00 11 be,a 2003dc4 2003d84: 39 00 80 72 sethi %hi(0x201c800), %i4 &rtems_filesystem_mount_table, &mt_entry->mt_node ); rtems_filesystem_mt_unlock(); } else { rtems_filesystem_global_location_release( mt_point_node ); 2003d88: 40 00 04 50 call 2004ec8 2003d8c: 90 10 00 1c mov %i4, %o0 } else { rtems_filesystem_eval_path_error( &ctx, EBUSY ); rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2003d90: 40 00 03 60 call 2004b10 2003d94: 90 07 bf c8 add %fp, -56, %o0 rv = register_subordinate_file_system( mt_entry, target ); } else { rv = register_root_file_system( mt_entry ); } if ( rv != 0 ) { 2003d98: 80 a6 20 00 cmp %i0, 0 2003d9c: 02 80 00 59 be 2003f00 2003da0: 01 00 00 00 nop (*mt_entry->ops->fsunmount_me_h)( mt_entry ); 2003da4: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2003da8: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 2003dac: 9f c0 40 00 call %g1 2003db0: 90 10 00 1d mov %i5, %o0 } } if ( rv != 0 ) { free( mt_entry ); 2003db4: 7f ff fe 2f call 2003670 2003db8: 90 10 00 1d mov %i5, %o0 errno = EINVAL; rv = -1; } return rv; } 2003dbc: 81 c7 e0 08 ret 2003dc0: 81 e8 00 00 restore */ #include static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 2003dc4: d0 07 22 f4 ld [ %i4 + 0x2f4 ], %o0 2003dc8: 92 10 20 00 clr %o1 2003dcc: 40 00 0f 65 call 2007b60 2003dd0: 94 10 20 00 clr %o2 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 2003dd4: d0 07 22 f4 ld [ %i4 + 0x2f4 ], %o0 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 2003dd8: 03 00 80 70 sethi %hi(0x201c000), %g1 2003ddc: 82 10 61 f8 or %g1, 0x1f8, %g1 ! 201c1f8 2003de0: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_node->next = tail; 2003de4: 86 00 60 04 add %g1, 4, %g3 2003de8: c6 27 40 00 st %g3, [ %i5 ] tail->previous = the_node; 2003dec: fa 20 60 08 st %i5, [ %g1 + 8 ] old_last->next = the_node; 2003df0: fa 20 80 00 st %i5, [ %g2 ] 2003df4: 40 00 0f aa call 2007c9c 2003df8: c4 27 60 04 st %g2, [ %i5 + 4 ] 2003dfc: 30 bf ff e5 b,a 2003d90 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; 2003e00: 40 00 33 2f call 2010abc 2003e04: 90 10 00 1a mov %i2, %o0 const char *target_or_null, const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; 2003e08: 2b 00 80 6b sethi %hi(0x201ac00), %l5 2003e0c: a6 10 20 02 mov 2, %l3 2003e10: aa 15 60 30 or %l5, 0x30, %l5 size_t filesystemtype_size = strlen( filesystemtype ) + 1; 2003e14: ba 10 00 08 mov %o0, %i5 size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003e18: 80 a6 20 00 cmp %i0, 0 2003e1c: 12 bf ff 8a bne 2003c44 <== NEVER TAKEN 2003e20: a8 02 20 01 add %o0, 1, %l4 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003e24: ba 07 40 13 add %i5, %l3, %i5 ) { const char *target = target_or_null != NULL ? target_or_null : "/"; size_t filesystemtype_size = strlen( filesystemtype ) + 1; size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003e28: a2 10 20 00 clr %l1 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003e2c: 92 07 60 65 add %i5, 0x65, %o1 + sizeof( rtems_filesystem_global_location_t ); rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); 2003e30: 90 10 20 01 mov 1, %o0 2003e34: 7f ff fd 60 call 20033b4 2003e38: 92 02 40 11 add %o1, %l1, %o1 if ( mt_entry != NULL ) { 2003e3c: ba 92 20 00 orcc %o0, 0, %i5 2003e40: 12 bf ff 8c bne 2003c70 <== ALWAYS TAKEN 2003e44: a0 07 60 64 add %i5, 0x64, %l0 if ( rv != 0 ) { free( mt_entry ); } } else { errno = ENOMEM; 2003e48: 40 00 2d b8 call 200f528 <__errno> <== NOT EXECUTED 2003e4c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003e50: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2003e54: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003e58: 81 c7 e0 08 ret <== NOT EXECUTED 2003e5c: 81 e8 00 00 restore <== NOT EXECUTED } else { errno = EINVAL; rv = -1; } } else { errno = EINVAL; 2003e60: 40 00 2d b2 call 200f528 <__errno> 2003e64: b0 10 3f ff mov -1, %i0 2003e68: 82 10 20 16 mov 0x16, %g1 2003e6c: c2 22 00 00 st %g1, [ %o0 ] 2003e70: 81 c7 e0 08 ret 2003e74: 81 e8 00 00 restore */ #include static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 2003e78: 39 00 80 72 sethi %hi(0x201c800), %i4 2003e7c: d0 07 22 f4 ld [ %i4 + 0x2f4 ], %o0 ! 201caf4 2003e80: 92 10 20 00 clr %o1 2003e84: 40 00 0f 37 call 2007b60 2003e88: 94 10 20 00 clr %o2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2003e8c: 03 00 80 70 sethi %hi(0x201c000), %g1 ) { int rv = 0; rtems_filesystem_mt_lock(); if ( rtems_chain_is_empty( &rtems_filesystem_mount_table ) ) { 2003e90: c4 00 61 f8 ld [ %g1 + 0x1f8 ], %g2 ! 201c1f8 2003e94: 82 10 61 f8 or %g1, 0x1f8, %g1 2003e98: 86 00 60 04 add %g1, 4, %g3 2003e9c: 80 a0 80 03 cmp %g2, %g3 2003ea0: 12 80 00 1f bne 2003f1c <== NEVER TAKEN 2003ea4: 01 00 00 00 nop Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 2003ea8: c6 00 60 08 ld [ %g1 + 8 ], %g3 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 2003eac: d0 07 22 f4 ld [ %i4 + 0x2f4 ], %o0 the_node->next = tail; 2003eb0: c4 27 40 00 st %g2, [ %i5 ] tail->previous = the_node; 2003eb4: fa 20 60 08 st %i5, [ %g1 + 8 ] old_last->next = the_node; 2003eb8: fa 20 c0 00 st %i5, [ %g3 ] 2003ebc: 40 00 0f 78 call 2007c9c 2003ec0: c6 27 60 04 st %g3, [ %i5 + 4 ] } rtems_filesystem_mt_unlock(); if ( rv == 0 ) { rtems_filesystem_global_location_t *new_fs_root = rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); 2003ec4: ba 07 60 24 add %i5, 0x24, %i5 rv = -1; } rtems_filesystem_mt_unlock(); if ( rv == 0 ) { rtems_filesystem_global_location_t *new_fs_root = 2003ec8: 40 00 04 20 call 2004f48 2003ecc: 90 10 00 1d mov %i5, %o0 2003ed0: b6 10 00 08 mov %o0, %i3 rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_t *new_fs_current = 2003ed4: 40 00 04 1d call 2004f48 2003ed8: 90 10 00 1d mov %i5, %o0 rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_assign( 2003edc: 39 00 80 70 sethi %hi(0x201c000), %i4 rtems_filesystem_mt_unlock(); if ( rv == 0 ) { rtems_filesystem_global_location_t *new_fs_root = rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_t *new_fs_current = 2003ee0: ba 10 00 08 mov %o0, %i5 rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_assign( 2003ee4: d0 07 22 18 ld [ %i4 + 0x218 ], %o0 2003ee8: 92 10 00 1b mov %i3, %o1 2003eec: 40 00 04 0d call 2004f20 2003ef0: 90 02 20 04 add %o0, 4, %o0 &rtems_filesystem_root, new_fs_root ); rtems_filesystem_global_location_assign( 2003ef4: d0 07 22 18 ld [ %i4 + 0x218 ], %o0 2003ef8: 40 00 04 0a call 2004f20 2003efc: 92 10 00 1d mov %i5, %o1 2003f00: 81 c7 e0 08 ret 2003f04: 81 e8 00 00 restore rtems_filesystem_mt_unlock(); } else { rtems_filesystem_global_location_release( mt_point_node ); } } else { rtems_filesystem_eval_path_error( &ctx, EBUSY ); 2003f08: 90 07 bf c8 add %fp, -56, %o0 2003f0c: 92 10 20 10 mov 0x10, %o1 2003f10: 40 00 02 04 call 2004720 2003f14: b0 10 3f ff mov -1, %i0 2003f18: 30 bf ff 9e b,a 2003d90 rtems_chain_append_unprotected( &rtems_filesystem_mount_table, &mt_entry->mt_node ); } else { errno = EINVAL; 2003f1c: 40 00 2d 83 call 200f528 <__errno> <== NOT EXECUTED 2003f20: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003f24: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2003f28: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003f2c: 40 00 0f 5c call 2007c9c <== NOT EXECUTED 2003f30: d0 07 22 f4 ld [ %i4 + 0x2f4 ], %o0 <== NOT EXECUTED } else { rv = register_root_file_system( mt_entry ); } if ( rv != 0 ) { (*mt_entry->ops->fsunmount_me_h)( mt_entry ); 2003f34: 10 bf ff 9d b 2003da8 <== NOT EXECUTED 2003f38: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED =============================================================================== 02009090 : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 2009090: 9d e3 bf a0 save %sp, -96, %sp int rv = -1; if (target != NULL) { 2009094: 90 96 60 00 orcc %i1, 0, %o0 2009098: 02 80 00 0b be 20090c4 200909c: 01 00 00 00 nop rv = rtems_mkdir(target, S_IRWXU | S_IRWXG | S_IRWXO); 20090a0: 40 00 03 0c call 2009cd0 20090a4: 92 10 21 ff mov 0x1ff, %o1 ! 1ff if (rv == 0) { 20090a8: 82 92 20 00 orcc %o0, 0, %g1 20090ac: 02 80 00 04 be 20090bc <== ALWAYS TAKEN 20090b0: 01 00 00 00 nop } else { errno = EINVAL; } return rv; } 20090b4: 81 c7 e0 08 ret 20090b8: 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( 20090bc: 40 00 00 08 call 20090dc 20090c0: 81 e8 00 00 restore options, data ); } } else { errno = EINVAL; 20090c4: 40 00 64 8c call 20222f4 <__errno> 20090c8: 01 00 00 00 nop 20090cc: 84 10 20 16 mov 0x16, %g2 ! 16 const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { int rv = -1; 20090d0: 82 10 3f ff mov -1, %g1 options, data ); } } else { errno = EINVAL; 20090d4: 10 bf ff f8 b 20090b4 20090d8: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 0201839c : msdos_node_type_t type, const char *name, int name_len, mode_t mode, const fat_file_fd_t *link_fd) { 201839c: 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; 20183a0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 uint32_t sec = 0; uint32_t byte = 0; fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); 20183a4: b8 07 bf 80 add %fp, -128, %i4 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; 20183a8: e0 00 60 08 ld [ %g1 + 8 ], %l0 fat_file_fd_t *parent_fat_fd = parent_loc->node_access; fat_file_fd_t *fat_fd = NULL; 20183ac: c0 27 bf 6c clr [ %fp + -148 ] fat_dir_pos_t *dir_pos ) { dir_pos->sname.cln = 0; dir_pos->sname.ofs = 0; dir_pos->lname.cln = FAT_FILE_SHORT_NAME; 20183b0: 82 10 3f ff mov -1, %g1 time_t time_ret = 0; uint16_t time_val = 0; 20183b4: c0 37 bf 68 clrh [ %fp + -152 ] uint16_t date = 0; 20183b8: c0 37 bf 6a clrh [ %fp + -150 ] static inline void fat_dir_pos_init( fat_dir_pos_t *dir_pos ) { dir_pos->sname.cln = 0; 20183bc: c0 27 bf 70 clr [ %fp + -144 ] dir_pos->sname.ofs = 0; 20183c0: c0 27 bf 74 clr [ %fp + -140 ] dir_pos->lname.cln = FAT_FILE_SHORT_NAME; 20183c4: c2 27 bf 78 st %g1, [ %fp + -136 ] dir_pos->lname.ofs = FAT_FILE_SHORT_NAME; 20183c8: c2 27 bf 7c st %g1, [ %fp + -132 ] uint32_t sec = 0; uint32_t byte = 0; fat_dir_pos_init(&dir_pos); memset(short_node, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE); 20183cc: c0 27 bf 80 clr [ %fp + -128 ] 20183d0: c0 27 bf 84 clr [ %fp + -124 ] 20183d4: c0 27 20 08 clr [ %i4 + 8 ] 20183d8: c0 27 20 0c clr [ %i4 + 0xc ] 20183dc: c0 27 20 10 clr [ %i4 + 0x10 ] 20183e0: c0 27 20 14 clr [ %i4 + 0x14 ] 20183e4: c0 27 20 18 clr [ %i4 + 0x18 ] 20183e8: c0 27 20 1c clr [ %i4 + 0x1c ] memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); 20183ec: c0 27 bf c0 clr [ %fp + -64 ] 20183f0: c0 27 bf c4 clr [ %fp + -60 ] 20183f4: c0 27 bf c8 clr [ %fp + -56 ] 20183f8: c0 27 bf cc clr [ %fp + -52 ] 20183fc: c0 27 bf d0 clr [ %fp + -48 ] 2018400: c0 27 bf d4 clr [ %fp + -44 ] 2018404: c0 27 bf d8 clr [ %fp + -40 ] 2018408: c0 27 bf dc clr [ %fp + -36 ] 201840c: c0 27 bf e0 clr [ %fp + -32 ] 2018410: c0 27 bf e4 clr [ %fp + -28 ] 2018414: c0 27 bf e8 clr [ %fp + -24 ] 2018418: c0 27 bf ec clr [ %fp + -20 ] 201841c: c0 27 bf f0 clr [ %fp + -16 ] 2018420: c0 27 bf f4 clr [ %fp + -12 ] 2018424: c0 27 bf f8 clr [ %fp + -8 ] 2018428: c0 27 bf fc clr [ %fp + -4 ] if (name_len > MSDOS_NAME_MAX_LFN_WITH_DOT) { 201842c: 80 a6 e1 04 cmp %i3, 0x104 2018430: 14 80 00 e3 bg 20187bc <== NEVER TAKEN 2018434: e2 06 20 08 ld [ %i0 + 8 ], %l1 rtems_set_errno_and_return_minus_one(ENAMETOOLONG); } name_type = msdos_long_to_short (name, name_len, 2018438: 90 10 00 1a mov %i2, %o0 201843c: 92 10 00 1b mov %i3, %o1 2018440: 94 10 00 1c mov %i4, %o2 2018444: 40 00 01 37 call 2018920 2018448: 96 10 20 0b mov 0xb, %o3 MSDOS_DIR_NAME(short_node), MSDOS_NAME_MAX); if (name_type == MSDOS_NAME_INVALID) { 201844c: a4 92 20 00 orcc %o0, 0, %l2 2018450: 02 80 00 e0 be 20187d0 <== NEVER TAKEN 2018454: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EINVAL); } /* fill reserved field */ *MSDOS_DIR_NT_RES(short_node) = MSDOS_RES_NT_VALUE; 2018458: c0 2f bf 8c clrb [ %fp + -116 ] /* set up last write date and time */ time_ret = time(NULL); 201845c: 40 00 22 ce call 2020f94